/usr/share/doc/gnat-4.8-doc/gnat_rm.html is in gnat-4.8-doc 4.8.2-8ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917 5918 5919 5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981 5982 5983 5984 5985 5986 5987 5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054 6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165 6166 6167 6168 6169 6170 6171 6172 6173 6174 6175 6176 6177 6178 6179 6180 6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202 6203 6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 6245 6246 6247 6248 6249 6250 6251 6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 6262 6263 6264 6265 6266 6267 6268 6269 6270 6271 6272 6273 6274 6275 6276 6277 6278 6279 6280 6281 6282 6283 6284 6285 6286 6287 6288 6289 6290 6291 6292 6293 6294 6295 6296 6297 6298 6299 6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 6328 6329 6330 6331 6332 6333 6334 6335 6336 6337 6338 6339 6340 6341 6342 6343 6344 6345 6346 6347 6348 6349 6350 6351 6352 6353 6354 6355 6356 6357 6358 6359 6360 6361 6362 6363 6364 6365 6366 6367 6368 6369 6370 6371 6372 6373 6374 6375 6376 6377 6378 6379 6380 6381 6382 6383 6384 6385 6386 6387 6388 6389 6390 6391 6392 6393 6394 6395 6396 6397 6398 6399 6400 6401 6402 6403 6404 6405 6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437 6438 6439 6440 6441 6442 6443 6444 6445 6446 6447 6448 6449 6450 6451 6452 6453 6454 6455 6456 6457 6458 6459 6460 6461 6462 6463 6464 6465 6466 6467 6468 6469 6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492 6493 6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505 6506 6507 6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535 6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564 6565 6566 6567 6568 6569 6570 6571 6572 6573 6574 6575 6576 6577 6578 6579 6580 6581 6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616 6617 6618 6619 6620 6621 6622 6623 6624 6625 6626 6627 6628 6629 6630 6631 6632 6633 6634 6635 6636 6637 6638 6639 6640 6641 6642 6643 6644 6645 6646 6647 6648 6649 6650 6651 6652 6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674 6675 6676 6677 6678 6679 6680 6681 6682 6683 6684 6685 6686 6687 6688 6689 6690 6691 6692 6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714 6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728 6729 6730 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 6751 6752 6753 6754 6755 6756 6757 6758 6759 6760 6761 6762 6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776 6777 6778 6779 6780 6781 6782 6783 6784 6785 6786 6787 6788 6789 6790 6791 6792 6793 6794 6795 6796 6797 6798 6799 6800 6801 6802 6803 6804 6805 6806 6807 6808 6809 6810 6811 6812 6813 6814 6815 6816 6817 6818 6819 6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 6850 6851 6852 6853 6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 6867 6868 6869 6870 6871 6872 6873 6874 6875 6876 6877 6878 6879 6880 6881 6882 6883 6884 6885 6886 6887 6888 6889 6890 6891 6892 6893 6894 6895 6896 6897 6898 6899 6900 6901 6902 6903 6904 6905 6906 6907 6908 6909 6910 6911 6912 6913 6914 6915 6916 6917 6918 6919 6920 6921 6922 6923 6924 6925 6926 6927 6928 6929 6930 6931 6932 6933 6934 6935 6936 6937 6938 6939 6940 6941 6942 6943 6944 6945 6946 6947 6948 6949 6950 6951 6952 6953 6954 6955 6956 6957 6958 6959 6960 6961 6962 6963 6964 6965 6966 6967 6968 6969 6970 6971 6972 6973 6974 6975 6976 6977 6978 6979 6980 6981 6982 6983 6984 6985 6986 6987 6988 6989 6990 6991 6992 6993 6994 6995 6996 6997 6998 6999 7000 7001 7002 7003 7004 7005 7006 7007 7008 7009 7010 7011 7012 7013 7014 7015 7016 7017 7018 7019 7020 7021 7022 7023 7024 7025 7026 7027 7028 7029 7030 7031 7032 7033 7034 7035 7036 7037 7038 7039 7040 7041 7042 7043 7044 7045 7046 7047 7048 7049 7050 7051 7052 7053 7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065 7066 7067 7068 7069 7070 7071 7072 7073 7074 7075 7076 7077 7078 7079 7080 7081 7082 7083 7084 7085 7086 7087 7088 7089 7090 7091 7092 7093 7094 7095 7096 7097 7098 7099 7100 7101 7102 7103 7104 7105 7106 7107 7108 7109 7110 7111 7112 7113 7114 7115 7116 7117 7118 7119 7120 7121 7122 7123 7124 7125 7126 7127 7128 7129 7130 7131 7132 7133 7134 7135 7136 7137 7138 7139 7140 7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152 7153 7154 7155 7156 7157 7158 7159 7160 7161 7162 7163 7164 7165 7166 7167 7168 7169 7170 7171 7172 7173 7174 7175 7176 7177 7178 7179 7180 7181 7182 7183 7184 7185 7186 7187 7188 7189 7190 7191 7192 7193 7194 7195 7196 7197 7198 7199 7200 7201 7202 7203 7204 7205 7206 7207 7208 7209 7210 7211 7212 7213 7214 7215 7216 7217 7218 7219 7220 7221 7222 7223 7224 7225 7226 7227 7228 7229 7230 7231 7232 7233 7234 7235 7236 7237 7238 7239 7240 7241 7242 7243 7244 7245 7246 7247 7248 7249 7250 7251 7252 7253 7254 7255 7256 7257 7258 7259 7260 7261 7262 7263 7264 7265 7266 7267 7268 7269 7270 7271 7272 7273 7274 7275 7276 7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290 7291 7292 7293 7294 7295 7296 7297 7298 7299 7300 7301 7302 7303 7304 7305 7306 7307 7308 7309 7310 7311 7312 7313 7314 7315 7316 7317 7318 7319 7320 7321 7322 7323 7324 7325 7326 7327 7328 7329 7330 7331 7332 7333 7334 7335 7336 7337 7338 7339 7340 7341 7342 7343 7344 7345 7346 7347 7348 7349 7350 7351 7352 7353 7354 7355 7356 7357 7358 7359 7360 7361 7362 7363 7364 7365 7366 7367 7368 7369 7370 7371 7372 7373 7374 7375 7376 7377 7378 7379 7380 7381 7382 7383 7384 7385 7386 7387 7388 7389 7390 7391 7392 7393 7394 7395 7396 7397 7398 7399 7400 7401 7402 7403 7404 7405 7406 7407 7408 7409 7410 7411 7412 7413 7414 7415 7416 7417 7418 7419 7420 7421 7422 7423 7424 7425 7426 7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437 7438 7439 7440 7441 7442 7443 7444 7445 7446 7447 7448 7449 7450 7451 7452 7453 7454 7455 7456 7457 7458 7459 7460 7461 7462 7463 7464 7465 7466 7467 7468 7469 7470 7471 7472 7473 7474 7475 7476 7477 7478 7479 7480 7481 7482 7483 7484 7485 7486 7487 7488 7489 7490 7491 7492 7493 7494 7495 7496 7497 7498 7499 7500 7501 7502 7503 7504 7505 7506 7507 7508 7509 7510 7511 7512 7513 7514 7515 7516 7517 7518 7519 7520 7521 7522 7523 7524 7525 7526 7527 7528 7529 7530 7531 7532 7533 7534 7535 7536 7537 7538 7539 7540 7541 7542 7543 7544 7545 7546 7547 7548 7549 7550 7551 7552 7553 7554 7555 7556 7557 7558 7559 7560 7561 7562 7563 7564 7565 7566 7567 7568 7569 7570 7571 7572 7573 7574 7575 7576 7577 7578 7579 7580 7581 7582 7583 7584 7585 7586 7587 7588 7589 7590 7591 7592 7593 7594 7595 7596 7597 7598 7599 7600 7601 7602 7603 7604 7605 7606 7607 7608 7609 7610 7611 7612 7613 7614 7615 7616 7617 7618 7619 7620 7621 7622 7623 7624 7625 7626 7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638 7639 7640 7641 7642 7643 7644 7645 7646 7647 7648 7649 7650 7651 7652 7653 7654 7655 7656 7657 7658 7659 7660 7661 7662 7663 7664 7665 7666 7667 7668 7669 7670 7671 7672 7673 7674 7675 7676 7677 7678 7679 7680 7681 7682 7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699 7700 7701 7702 7703 7704 7705 7706 7707 7708 7709 7710 7711 7712 7713 7714 7715 7716 7717 7718 7719 7720 7721 7722 7723 7724 7725 7726 7727 7728 7729 7730 7731 7732 7733 7734 7735 7736 7737 7738 7739 7740 7741 7742 7743 7744 7745 7746 7747 7748 7749 7750 7751 7752 7753 7754 7755 7756 7757 7758 7759 7760 7761 7762 7763 7764 7765 7766 7767 7768 7769 7770 7771 7772 7773 7774 7775 7776 7777 7778 7779 7780 7781 7782 7783 7784 7785 7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804 7805 7806 7807 7808 7809 7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830 7831 7832 7833 7834 7835 7836 7837 7838 7839 7840 7841 7842 7843 7844 7845 7846 7847 7848 7849 7850 7851 7852 7853 7854 7855 7856 7857 7858 7859 7860 7861 7862 7863 7864 7865 7866 7867 7868 7869 7870 7871 7872 7873 7874 7875 7876 7877 7878 7879 7880 7881 7882 7883 7884 7885 7886 7887 7888 7889 7890 7891 7892 7893 7894 7895 7896 7897 7898 7899 7900 7901 7902 7903 7904 7905 7906 7907 7908 7909 7910 7911 7912 7913 7914 7915 7916 7917 7918 7919 7920 7921 7922 7923 7924 7925 7926 7927 7928 7929 7930 7931 7932 7933 7934 7935 7936 7937 7938 7939 7940 7941 7942 7943 7944 7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958 7959 7960 7961 7962 7963 7964 7965 7966 7967 7968 7969 7970 7971 7972 7973 7974 7975 7976 7977 7978 7979 7980 7981 7982 7983 7984 7985 7986 7987 7988 7989 7990 7991 7992 7993 7994 7995 7996 7997 7998 7999 8000 8001 8002 8003 8004 8005 8006 8007 8008 8009 8010 8011 8012 8013 8014 8015 8016 8017 8018 8019 8020 8021 8022 8023 8024 8025 8026 8027 8028 8029 8030 8031 8032 8033 8034 8035 8036 8037 8038 8039 8040 8041 8042 8043 8044 8045 8046 8047 8048 8049 8050 8051 8052 8053 8054 8055 8056 8057 8058 8059 8060 8061 8062 8063 8064 8065 8066 8067 8068 8069 8070 8071 8072 8073 8074 8075 8076 8077 8078 8079 8080 8081 8082 8083 8084 8085 8086 8087 8088 8089 8090 8091 8092 8093 8094 8095 8096 8097 8098 8099 8100 8101 8102 8103 8104 8105 8106 8107 8108 8109 8110 8111 8112 8113 8114 8115 8116 8117 8118 8119 8120 8121 8122 8123 8124 8125 8126 8127 8128 8129 8130 8131 8132 8133 8134 8135 8136 8137 8138 8139 8140 8141 8142 8143 8144 8145 8146 8147 8148 8149 8150 8151 8152 8153 8154 8155 8156 8157 8158 8159 8160 8161 8162 8163 8164 8165 8166 8167 8168 8169 8170 8171 8172 8173 8174 8175 8176 8177 8178 8179 8180 8181 8182 8183 8184 8185 8186 8187 8188 8189 8190 8191 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8203 8204 8205 8206 8207 8208 8209 8210 8211 8212 8213 8214 8215 8216 8217 8218 8219 8220 8221 8222 8223 8224 8225 8226 8227 8228 8229 8230 8231 8232 8233 8234 8235 8236 8237 8238 8239 8240 8241 8242 8243 8244 8245 8246 8247 8248 8249 8250 8251 8252 8253 8254 8255 8256 8257 8258 8259 8260 8261 8262 8263 8264 8265 8266 8267 8268 8269 8270 8271 8272 8273 8274 8275 8276 8277 8278 8279 8280 8281 8282 8283 8284 8285 8286 8287 8288 8289 8290 8291 8292 8293 8294 8295 8296 8297 8298 8299 8300 8301 8302 8303 8304 8305 8306 8307 8308 8309 8310 8311 8312 8313 8314 8315 8316 8317 8318 8319 8320 8321 8322 8323 8324 8325 8326 8327 8328 8329 8330 8331 8332 8333 8334 8335 8336 8337 8338 8339 8340 8341 8342 8343 8344 8345 8346 8347 8348 8349 8350 8351 8352 8353 8354 8355 8356 8357 8358 8359 8360 8361 8362 8363 8364 8365 8366 8367 8368 8369 8370 8371 8372 8373 8374 8375 8376 8377 8378 8379 8380 8381 8382 8383 8384 8385 8386 8387 8388 8389 8390 8391 8392 8393 8394 8395 8396 8397 8398 8399 8400 8401 8402 8403 8404 8405 8406 8407 8408 8409 8410 8411 8412 8413 8414 8415 8416 8417 8418 8419 8420 8421 8422 8423 8424 8425 8426 8427 8428 8429 8430 8431 8432 8433 8434 8435 8436 8437 8438 8439 8440 8441 8442 8443 8444 8445 8446 8447 8448 8449 8450 8451 8452 8453 8454 8455 8456 8457 8458 8459 8460 8461 8462 8463 8464 8465 8466 8467 8468 8469 8470 8471 8472 8473 8474 8475 8476 8477 8478 8479 8480 8481 8482 8483 8484 8485 8486 8487 8488 8489 8490 8491 8492 8493 8494 8495 8496 8497 8498 8499 8500 8501 8502 8503 8504 8505 8506 8507 8508 8509 8510 8511 8512 8513 8514 8515 8516 8517 8518 8519 8520 8521 8522 8523 8524 8525 8526 8527 8528 8529 8530 8531 8532 8533 8534 8535 8536 8537 8538 8539 8540 8541 8542 8543 8544 8545 8546 8547 8548 8549 8550 8551 8552 8553 8554 8555 8556 8557 8558 8559 8560 8561 8562 8563 8564 8565 8566 8567 8568 8569 8570 8571 8572 8573 8574 8575 8576 8577 8578 8579 8580 8581 8582 8583 8584 8585 8586 8587 8588 8589 8590 8591 8592 8593 8594 8595 8596 8597 8598 8599 8600 8601 8602 8603 8604 8605 8606 8607 8608 8609 8610 8611 8612 8613 8614 8615 8616 8617 8618 8619 8620 8621 8622 8623 8624 8625 8626 8627 8628 8629 8630 8631 8632 8633 8634 8635 8636 8637 8638 8639 8640 8641 8642 8643 8644 8645 8646 8647 8648 8649 8650 8651 8652 8653 8654 8655 8656 8657 8658 8659 8660 8661 8662 8663 8664 8665 8666 8667 8668 8669 8670 8671 8672 8673 8674 8675 8676 8677 8678 8679 8680 8681 8682 8683 8684 8685 8686 8687 8688 8689 8690 8691 8692 8693 8694 8695 8696 8697 8698 8699 8700 8701 8702 8703 8704 8705 8706 8707 8708 8709 8710 8711 8712 8713 8714 8715 8716 8717 8718 8719 8720 8721 8722 8723 8724 8725 8726 8727 8728 8729 8730 8731 8732 8733 8734 8735 8736 8737 8738 8739 8740 8741 8742 8743 8744 8745 8746 8747 8748 8749 8750 8751 8752 8753 8754 8755 8756 8757 8758 8759 8760 8761 8762 8763 8764 8765 8766 8767 8768 8769 8770 8771 8772 8773 8774 8775 8776 8777 8778 8779 8780 8781 8782 8783 8784 8785 8786 8787 8788 8789 8790 8791 8792 8793 8794 8795 8796 8797 8798 8799 8800 8801 8802 8803 8804 8805 8806 8807 8808 8809 8810 8811 8812 8813 8814 8815 8816 8817 8818 8819 8820 8821 8822 8823 8824 8825 8826 8827 8828 8829 8830 8831 8832 8833 8834 8835 8836 8837 8838 8839 8840 8841 8842 8843 8844 8845 8846 8847 8848 8849 8850 8851 8852 8853 8854 8855 8856 8857 8858 8859 8860 8861 8862 8863 8864 8865 8866 8867 8868 8869 8870 8871 8872 8873 8874 8875 8876 8877 8878 8879 8880 8881 8882 8883 8884 8885 8886 8887 8888 8889 8890 8891 8892 8893 8894 8895 8896 8897 8898 8899 8900 8901 8902 8903 8904 8905 8906 8907 8908 8909 8910 8911 8912 8913 8914 8915 8916 8917 8918 8919 8920 8921 8922 8923 8924 8925 8926 8927 8928 8929 8930 8931 8932 8933 8934 8935 8936 8937 8938 8939 8940 8941 8942 8943 8944 8945 8946 8947 8948 8949 8950 8951 8952 8953 8954 8955 8956 8957 8958 8959 8960 8961 8962 8963 8964 8965 8966 8967 8968 8969 8970 8971 8972 8973 8974 8975 8976 8977 8978 8979 8980 8981 8982 8983 8984 8985 8986 8987 8988 8989 8990 8991 8992 8993 8994 8995 8996 8997 8998 8999 9000 9001 9002 9003 9004 9005 9006 9007 9008 9009 9010 9011 9012 9013 9014 9015 9016 9017 9018 9019 9020 9021 9022 9023 9024 9025 9026 9027 9028 9029 9030 9031 9032 9033 9034 9035 9036 9037 9038 9039 9040 9041 9042 9043 9044 9045 9046 9047 9048 9049 9050 9051 9052 9053 9054 9055 9056 9057 9058 9059 9060 9061 9062 9063 9064 9065 9066 9067 9068 9069 9070 9071 9072 9073 9074 9075 9076 9077 9078 9079 9080 9081 9082 9083 9084 9085 9086 9087 9088 9089 9090 9091 9092 9093 9094 9095 9096 9097 9098 9099 9100 9101 9102 9103 9104 9105 9106 9107 9108 9109 9110 9111 9112 9113 9114 9115 9116 9117 9118 9119 9120 9121 9122 9123 9124 9125 9126 9127 9128 9129 9130 9131 9132 9133 9134 9135 9136 9137 9138 9139 9140 9141 9142 9143 9144 9145 9146 9147 9148 9149 9150 9151 9152 9153 9154 9155 9156 9157 9158 9159 9160 9161 9162 9163 9164 9165 9166 9167 9168 9169 9170 9171 9172 9173 9174 9175 9176 9177 9178 9179 9180 9181 9182 9183 9184 9185 9186 9187 9188 9189 9190 9191 9192 9193 9194 9195 9196 9197 9198 9199 9200 9201 9202 9203 9204 9205 9206 9207 9208 9209 9210 9211 9212 9213 9214 9215 9216 9217 9218 9219 9220 9221 9222 9223 9224 9225 9226 9227 9228 9229 9230 9231 9232 9233 9234 9235 9236 9237 9238 9239 9240 9241 9242 9243 9244 9245 9246 9247 9248 9249 9250 9251 9252 9253 9254 9255 9256 9257 9258 9259 9260 9261 9262 9263 9264 9265 9266 9267 9268 9269 9270 9271 9272 9273 9274 9275 9276 9277 9278 9279 9280 9281 9282 9283 9284 9285 9286 9287 9288 9289 9290 9291 9292 9293 9294 9295 9296 9297 9298 9299 9300 9301 9302 9303 9304 9305 9306 9307 9308 9309 9310 9311 9312 9313 9314 9315 9316 9317 9318 9319 9320 9321 9322 9323 9324 9325 9326 9327 9328 9329 9330 9331 9332 9333 9334 9335 9336 9337 9338 9339 9340 9341 9342 9343 9344 9345 9346 9347 9348 9349 9350 9351 9352 9353 9354 9355 9356 9357 9358 9359 9360 9361 9362 9363 9364 9365 9366 9367 9368 9369 9370 9371 9372 9373 9374 9375 9376 9377 9378 9379 9380 9381 9382 9383 9384 9385 9386 9387 9388 9389 9390 9391 9392 9393 9394 9395 9396 9397 9398 9399 9400 9401 9402 9403 9404 9405 9406 9407 9408 9409 9410 9411 9412 9413 9414 9415 9416 9417 9418 9419 9420 9421 9422 9423 9424 9425 9426 9427 9428 9429 9430 9431 9432 9433 9434 9435 9436 9437 9438 9439 9440 9441 9442 9443 9444 9445 9446 9447 9448 9449 9450 9451 9452 9453 9454 9455 9456 9457 9458 9459 9460 9461 9462 9463 9464 9465 9466 9467 9468 9469 9470 9471 9472 9473 9474 9475 9476 9477 9478 9479 9480 9481 9482 9483 9484 9485 9486 9487 9488 9489 9490 9491 9492 9493 9494 9495 9496 9497 9498 9499 9500 9501 9502 9503 9504 9505 9506 9507 9508 9509 9510 9511 9512 9513 9514 9515 9516 9517 9518 9519 9520 9521 9522 9523 9524 9525 9526 9527 9528 9529 9530 9531 9532 9533 9534 9535 9536 9537 9538 9539 9540 9541 9542 9543 9544 9545 9546 9547 9548 9549 9550 9551 9552 9553 9554 9555 9556 9557 9558 9559 9560 9561 9562 9563 9564 9565 9566 9567 9568 9569 9570 9571 9572 9573 9574 9575 9576 9577 9578 9579 9580 9581 9582 9583 9584 9585 9586 9587 9588 9589 9590 9591 9592 9593 9594 9595 9596 9597 9598 9599 9600 9601 9602 9603 9604 9605 9606 9607 9608 9609 9610 9611 9612 9613 9614 9615 9616 9617 9618 9619 9620 9621 9622 9623 9624 9625 9626 9627 9628 9629 9630 9631 9632 9633 9634 9635 9636 9637 9638 9639 9640 9641 9642 9643 9644 9645 9646 9647 9648 9649 9650 9651 9652 9653 9654 9655 9656 9657 9658 9659 9660 9661 9662 9663 9664 9665 9666 9667 9668 9669 9670 9671 9672 9673 9674 9675 9676 9677 9678 9679 9680 9681 9682 9683 9684 9685 9686 9687 9688 9689 9690 9691 9692 9693 9694 9695 9696 9697 9698 9699 9700 9701 9702 9703 9704 9705 9706 9707 9708 9709 9710 9711 9712 9713 9714 9715 9716 9717 9718 9719 9720 9721 9722 9723 9724 9725 9726 9727 9728 9729 9730 9731 9732 9733 9734 9735 9736 9737 9738 9739 9740 9741 9742 9743 9744 9745 9746 9747 9748 9749 9750 9751 9752 9753 9754 9755 9756 9757 9758 9759 9760 9761 9762 9763 9764 9765 9766 9767 9768 9769 9770 9771 9772 9773 9774 9775 9776 9777 9778 9779 9780 9781 9782 9783 9784 9785 9786 9787 9788 9789 9790 9791 9792 9793 9794 9795 9796 9797 9798 9799 9800 9801 9802 9803 9804 9805 9806 9807 9808 9809 9810 9811 9812 9813 9814 9815 9816 9817 9818 9819 9820 9821 9822 9823 9824 9825 9826 9827 9828 9829 9830 9831 9832 9833 9834 9835 9836 9837 9838 9839 9840 9841 9842 9843 9844 9845 9846 9847 9848 9849 9850 9851 9852 9853 9854 9855 9856 9857 9858 9859 9860 9861 9862 9863 9864 9865 9866 9867 9868 9869 9870 9871 9872 9873 9874 9875 9876 9877 9878 9879 9880 9881 9882 9883 9884 9885 9886 9887 9888 9889 9890 9891 9892 9893 9894 9895 9896 9897 9898 9899 9900 9901 9902 9903 9904 9905 9906 9907 9908 9909 9910 9911 9912 9913 9914 9915 9916 9917 9918 9919 9920 9921 9922 9923 9924 9925 9926 9927 9928 9929 9930 9931 9932 9933 9934 9935 9936 9937 9938 9939 9940 9941 9942 9943 9944 9945 9946 9947 9948 9949 9950 9951 9952 9953 9954 9955 9956 9957 9958 9959 9960 9961 9962 9963 9964 9965 9966 9967 9968 9969 9970 9971 9972 9973 9974 9975 9976 9977 9978 9979 9980 9981 9982 9983 9984 9985 9986 9987 9988 9989 9990 9991 9992 9993 9994 9995 9996 9997 9998 9999 10000 10001 10002 10003 10004 10005 10006 10007 10008 10009 10010 10011 10012 10013 10014 10015 10016 10017 10018 10019 10020 10021 10022 10023 10024 10025 10026 10027 10028 10029 10030 10031 10032 10033 10034 10035 10036 10037 10038 10039 10040 10041 10042 10043 10044 10045 10046 10047 10048 10049 10050 10051 10052 10053 10054 10055 10056 10057 10058 10059 10060 10061 10062 10063 10064 10065 10066 10067 10068 10069 10070 10071 10072 10073 10074 10075 10076 10077 10078 10079 10080 10081 10082 10083 10084 10085 10086 10087 10088 10089 10090 10091 10092 10093 10094 10095 10096 10097 10098 10099 10100 10101 10102 10103 10104 10105 10106 10107 10108 10109 10110 10111 10112 10113 10114 10115 10116 10117 10118 10119 10120 10121 10122 10123 10124 10125 10126 10127 10128 10129 10130 10131 10132 10133 10134 10135 10136 10137 10138 10139 10140 10141 10142 10143 10144 10145 10146 10147 10148 10149 10150 10151 10152 10153 10154 10155 10156 10157 10158 10159 10160 10161 10162 10163 10164 10165 10166 10167 10168 10169 10170 10171 10172 10173 10174 10175 10176 10177 10178 10179 10180 10181 10182 10183 10184 10185 10186 10187 10188 10189 10190 10191 10192 10193 10194 10195 10196 10197 10198 10199 10200 10201 10202 10203 10204 10205 10206 10207 10208 10209 10210 10211 10212 10213 10214 10215 10216 10217 10218 10219 10220 10221 10222 10223 10224 10225 10226 10227 10228 10229 10230 10231 10232 10233 10234 10235 10236 10237 10238 10239 10240 10241 10242 10243 10244 10245 10246 10247 10248 10249 10250 10251 10252 10253 10254 10255 10256 10257 10258 10259 10260 10261 10262 10263 10264 10265 10266 10267 10268 10269 10270 10271 10272 10273 10274 10275 10276 10277 10278 10279 10280 10281 10282 10283 10284 10285 10286 10287 10288 10289 10290 10291 10292 10293 10294 10295 10296 10297 10298 10299 10300 10301 10302 10303 10304 10305 10306 10307 10308 10309 10310 10311 10312 10313 10314 10315 10316 10317 10318 10319 10320 10321 10322 10323 10324 10325 10326 10327 10328 10329 10330 10331 10332 10333 10334 10335 10336 10337 10338 10339 10340 10341 10342 10343 10344 10345 10346 10347 10348 10349 10350 10351 10352 10353 10354 10355 10356 10357 10358 10359 10360 10361 10362 10363 10364 10365 10366 10367 10368 10369 10370 10371 10372 10373 10374 10375 10376 10377 10378 10379 10380 10381 10382 10383 10384 10385 10386 10387 10388 10389 10390 10391 10392 10393 10394 10395 10396 10397 10398 10399 10400 10401 10402 10403 10404 10405 10406 10407 10408 10409 10410 10411 10412 10413 10414 10415 10416 10417 10418 10419 10420 10421 10422 10423 10424 10425 10426 10427 10428 10429 10430 10431 10432 10433 10434 10435 10436 10437 10438 10439 10440 10441 10442 10443 10444 10445 10446 10447 10448 10449 10450 10451 10452 10453 10454 10455 10456 10457 10458 10459 10460 10461 10462 10463 10464 10465 10466 10467 10468 10469 10470 10471 10472 10473 10474 10475 10476 10477 10478 10479 10480 10481 10482 10483 10484 10485 10486 10487 10488 10489 10490 10491 10492 10493 10494 10495 10496 10497 10498 10499 10500 10501 10502 10503 10504 10505 10506 10507 10508 10509 10510 10511 10512 10513 10514 10515 10516 10517 10518 10519 10520 10521 10522 10523 10524 10525 10526 10527 10528 10529 10530 10531 10532 10533 10534 10535 10536 10537 10538 10539 10540 10541 10542 10543 10544 10545 10546 10547 10548 10549 10550 10551 10552 10553 10554 10555 10556 10557 10558 10559 10560 10561 10562 10563 10564 10565 10566 10567 10568 10569 10570 10571 10572 10573 10574 10575 10576 10577 10578 10579 10580 10581 10582 10583 10584 10585 10586 10587 10588 10589 10590 10591 10592 10593 10594 10595 10596 10597 10598 10599 10600 10601 10602 10603 10604 10605 10606 10607 10608 10609 10610 10611 10612 10613 10614 10615 10616 10617 10618 10619 10620 10621 10622 10623 10624 10625 10626 10627 10628 10629 10630 10631 10632 10633 10634 10635 10636 10637 10638 10639 10640 10641 10642 10643 10644 10645 10646 10647 10648 10649 10650 10651 10652 10653 10654 10655 10656 10657 10658 10659 10660 10661 10662 10663 10664 10665 10666 10667 10668 10669 10670 10671 10672 10673 10674 10675 10676 10677 10678 10679 10680 10681 10682 10683 10684 10685 10686 10687 10688 10689 10690 10691 10692 10693 10694 10695 10696 10697 10698 10699 10700 10701 10702 10703 10704 10705 10706 10707 10708 10709 10710 10711 10712 10713 10714 10715 10716 10717 10718 10719 10720 10721 10722 10723 10724 10725 10726 10727 10728 10729 10730 10731 10732 10733 10734 10735 10736 10737 10738 10739 10740 10741 10742 10743 10744 10745 10746 10747 10748 10749 10750 10751 10752 10753 10754 10755 10756 10757 10758 10759 10760 10761 10762 10763 10764 10765 10766 10767 10768 10769 10770 10771 10772 10773 10774 10775 10776 10777 10778 10779 10780 10781 10782 10783 10784 10785 10786 10787 10788 10789 10790 10791 10792 10793 10794 10795 10796 10797 10798 10799 10800 10801 10802 10803 10804 10805 10806 10807 10808 10809 10810 10811 10812 10813 10814 10815 10816 10817 10818 10819 10820 10821 10822 10823 10824 10825 10826 10827 10828 10829 10830 10831 10832 10833 10834 10835 10836 10837 10838 10839 10840 10841 10842 10843 10844 10845 10846 10847 10848 10849 10850 10851 10852 10853 10854 10855 10856 10857 10858 10859 10860 10861 10862 10863 10864 10865 10866 10867 10868 10869 10870 10871 10872 10873 10874 10875 10876 10877 10878 10879 10880 10881 10882 10883 10884 10885 10886 10887 10888 10889 10890 10891 10892 10893 10894 10895 10896 10897 10898 10899 10900 10901 10902 10903 10904 10905 10906 10907 10908 10909 10910 10911 10912 10913 10914 10915 10916 10917 10918 10919 10920 10921 10922 10923 10924 10925 10926 10927 10928 10929 10930 10931 10932 10933 10934 10935 10936 10937 10938 10939 10940 10941 10942 10943 10944 10945 10946 10947 10948 10949 10950 10951 10952 10953 10954 10955 10956 10957 10958 10959 10960 10961 10962 10963 10964 10965 10966 10967 10968 10969 10970 10971 10972 10973 10974 10975 10976 10977 10978 10979 10980 10981 10982 10983 10984 10985 10986 10987 10988 10989 10990 10991 10992 10993 10994 10995 10996 10997 10998 10999 11000 11001 11002 11003 11004 11005 11006 11007 11008 11009 11010 11011 11012 11013 11014 11015 11016 11017 11018 11019 11020 11021 11022 11023 11024 11025 11026 11027 11028 11029 11030 11031 11032 11033 11034 11035 11036 11037 11038 11039 11040 11041 11042 11043 11044 11045 11046 11047 11048 11049 11050 11051 11052 11053 11054 11055 11056 11057 11058 11059 11060 11061 11062 11063 11064 11065 11066 11067 11068 11069 11070 11071 11072 11073 11074 11075 11076 11077 11078 11079 11080 11081 11082 11083 11084 11085 11086 11087 11088 11089 11090 11091 11092 11093 11094 11095 11096 11097 11098 11099 11100 11101 11102 11103 11104 11105 11106 11107 11108 11109 11110 11111 11112 11113 11114 11115 11116 11117 11118 11119 11120 11121 11122 11123 11124 11125 11126 11127 11128 11129 11130 11131 11132 11133 11134 11135 11136 11137 11138 11139 11140 11141 11142 11143 11144 11145 11146 11147 11148 11149 11150 11151 11152 11153 11154 11155 11156 11157 11158 11159 11160 11161 11162 11163 11164 11165 11166 11167 11168 11169 11170 11171 11172 11173 11174 11175 11176 11177 11178 11179 11180 11181 11182 11183 11184 11185 11186 11187 11188 11189 11190 11191 11192 11193 11194 11195 11196 11197 11198 11199 11200 11201 11202 11203 11204 11205 11206 11207 11208 11209 11210 11211 11212 11213 11214 11215 11216 11217 11218 11219 11220 11221 11222 11223 11224 11225 11226 11227 11228 11229 11230 11231 11232 11233 11234 11235 11236 11237 11238 11239 11240 11241 11242 11243 11244 11245 11246 11247 11248 11249 11250 11251 11252 11253 11254 11255 11256 11257 11258 11259 11260 11261 11262 11263 11264 11265 11266 11267 11268 11269 11270 11271 11272 11273 11274 11275 11276 11277 11278 11279 11280 11281 11282 11283 11284 11285 11286 11287 11288 11289 11290 11291 11292 11293 11294 11295 11296 11297 11298 11299 11300 11301 11302 11303 11304 11305 11306 11307 11308 11309 11310 11311 11312 11313 11314 11315 11316 11317 11318 11319 11320 11321 11322 11323 11324 11325 11326 11327 11328 11329 11330 11331 11332 11333 11334 11335 11336 11337 11338 11339 11340 11341 11342 11343 11344 11345 11346 11347 11348 11349 11350 11351 11352 11353 11354 11355 11356 11357 11358 11359 11360 11361 11362 11363 11364 11365 11366 11367 11368 11369 11370 11371 11372 11373 11374 11375 11376 11377 11378 11379 11380 11381 11382 11383 11384 11385 11386 11387 11388 11389 11390 11391 11392 11393 11394 11395 11396 11397 11398 11399 11400 11401 11402 11403 11404 11405 11406 11407 11408 11409 11410 11411 11412 11413 11414 11415 11416 11417 11418 11419 11420 11421 11422 11423 11424 11425 11426 11427 11428 11429 11430 11431 11432 11433 11434 11435 11436 11437 11438 11439 11440 11441 11442 11443 11444 11445 11446 11447 11448 11449 11450 11451 11452 11453 11454 11455 11456 11457 11458 11459 11460 11461 11462 11463 11464 11465 11466 11467 11468 11469 11470 11471 11472 11473 11474 11475 11476 11477 11478 11479 11480 11481 11482 11483 11484 11485 11486 11487 11488 11489 11490 11491 11492 11493 11494 11495 11496 11497 11498 11499 11500 11501 11502 11503 11504 11505 11506 11507 11508 11509 11510 11511 11512 11513 11514 11515 11516 11517 11518 11519 11520 11521 11522 11523 11524 11525 11526 11527 11528 11529 11530 11531 11532 11533 11534 11535 11536 11537 11538 11539 11540 11541 11542 11543 11544 11545 11546 11547 11548 11549 11550 11551 11552 11553 11554 11555 11556 11557 11558 11559 11560 11561 11562 11563 11564 11565 11566 11567 11568 11569 11570 11571 11572 11573 11574 11575 11576 11577 11578 11579 11580 11581 11582 11583 11584 11585 11586 11587 11588 11589 11590 11591 11592 11593 11594 11595 11596 11597 11598 11599 11600 11601 11602 11603 11604 11605 11606 11607 11608 11609 11610 11611 11612 11613 11614 11615 11616 11617 11618 11619 11620 11621 11622 11623 11624 11625 11626 11627 11628 11629 11630 11631 11632 11633 11634 11635 11636 11637 11638 11639 11640 11641 11642 11643 11644 11645 11646 11647 11648 11649 11650 11651 11652 11653 11654 11655 11656 11657 11658 11659 11660 11661 11662 11663 11664 11665 11666 11667 11668 11669 11670 11671 11672 11673 11674 11675 11676 11677 11678 11679 11680 11681 11682 11683 11684 11685 11686 11687 11688 11689 11690 11691 11692 11693 11694 11695 11696 11697 11698 11699 11700 11701 11702 11703 11704 11705 11706 11707 11708 11709 11710 11711 11712 11713 11714 11715 11716 11717 11718 11719 11720 11721 11722 11723 11724 11725 11726 11727 11728 11729 11730 11731 11732 11733 11734 11735 11736 11737 11738 11739 11740 11741 11742 11743 11744 11745 11746 11747 11748 11749 11750 11751 11752 11753 11754 11755 11756 11757 11758 11759 11760 11761 11762 11763 11764 11765 11766 11767 11768 11769 11770 11771 11772 11773 11774 11775 11776 11777 11778 11779 11780 11781 11782 11783 11784 11785 11786 11787 11788 11789 11790 11791 11792 11793 11794 11795 11796 11797 11798 11799 11800 11801 11802 11803 11804 11805 11806 11807 11808 11809 11810 11811 11812 11813 11814 11815 11816 11817 11818 11819 11820 11821 11822 11823 11824 11825 11826 11827 11828 11829 11830 11831 11832 11833 11834 11835 11836 11837 11838 11839 11840 11841 11842 11843 11844 11845 11846 11847 11848 11849 11850 11851 11852 11853 11854 11855 11856 11857 11858 11859 11860 11861 11862 11863 11864 11865 11866 11867 11868 11869 11870 11871 11872 11873 11874 11875 11876 11877 11878 11879 11880 11881 11882 11883 11884 11885 11886 11887 11888 11889 11890 11891 11892 11893 11894 11895 11896 11897 11898 11899 11900 11901 11902 11903 11904 11905 11906 11907 11908 11909 11910 11911 11912 11913 11914 11915 11916 11917 11918 11919 11920 11921 11922 11923 11924 11925 11926 11927 11928 11929 11930 11931 11932 11933 11934 11935 11936 11937 11938 11939 11940 11941 11942 11943 11944 11945 11946 11947 11948 11949 11950 11951 11952 11953 11954 11955 11956 11957 11958 11959 11960 11961 11962 11963 11964 11965 11966 11967 11968 11969 11970 11971 11972 11973 11974 11975 11976 11977 11978 11979 11980 11981 11982 11983 11984 11985 11986 11987 11988 11989 11990 11991 11992 11993 11994 11995 11996 11997 11998 11999 12000 12001 12002 12003 12004 12005 12006 12007 12008 12009 12010 12011 12012 12013 12014 12015 12016 12017 12018 12019 12020 12021 12022 12023 12024 12025 12026 12027 12028 12029 12030 12031 12032 12033 12034 12035 12036 12037 12038 12039 12040 12041 12042 12043 12044 12045 12046 12047 12048 12049 12050 12051 12052 12053 12054 12055 12056 12057 12058 12059 12060 12061 12062 12063 12064 12065 12066 12067 12068 12069 12070 12071 12072 12073 12074 12075 12076 12077 12078 12079 12080 12081 12082 12083 12084 12085 12086 12087 12088 12089 12090 12091 12092 12093 12094 12095 12096 12097 12098 12099 12100 12101 12102 12103 12104 12105 12106 12107 12108 12109 12110 12111 12112 12113 12114 12115 12116 12117 12118 12119 12120 12121 12122 12123 12124 12125 12126 12127 12128 12129 12130 12131 12132 12133 12134 12135 12136 12137 12138 12139 12140 12141 12142 12143 12144 12145 12146 12147 12148 12149 12150 12151 12152 12153 12154 12155 12156 12157 12158 12159 12160 12161 12162 12163 12164 12165 12166 12167 12168 12169 12170 12171 12172 12173 12174 12175 12176 12177 12178 12179 12180 12181 12182 12183 12184 12185 12186 12187 12188 12189 12190 12191 12192 12193 12194 12195 12196 12197 12198 12199 12200 12201 12202 12203 12204 12205 12206 12207 12208 12209 12210 12211 12212 12213 12214 12215 12216 12217 12218 12219 12220 12221 12222 12223 12224 12225 12226 12227 12228 12229 12230 12231 12232 12233 12234 12235 12236 12237 12238 12239 12240 12241 12242 12243 12244 12245 12246 12247 12248 12249 12250 12251 12252 12253 12254 12255 12256 12257 12258 12259 12260 12261 12262 12263 12264 12265 12266 12267 12268 12269 12270 12271 12272 12273 12274 12275 12276 12277 12278 12279 12280 12281 12282 12283 12284 12285 12286 12287 12288 12289 12290 12291 12292 12293 12294 12295 12296 12297 12298 12299 12300 12301 12302 12303 12304 12305 12306 12307 12308 12309 12310 12311 12312 12313 12314 12315 12316 12317 12318 12319 12320 12321 12322 12323 12324 12325 12326 12327 12328 12329 12330 12331 12332 12333 12334 12335 12336 12337 12338 12339 12340 12341 12342 12343 12344 12345 12346 12347 12348 12349 12350 12351 12352 12353 12354 12355 12356 12357 12358 12359 12360 12361 12362 12363 12364 12365 12366 12367 12368 12369 12370 12371 12372 12373 12374 12375 12376 12377 12378 12379 12380 12381 12382 12383 12384 12385 12386 12387 12388 12389 12390 12391 12392 12393 12394 12395 12396 12397 12398 12399 12400 12401 12402 12403 12404 12405 12406 12407 12408 12409 12410 12411 12412 12413 12414 12415 12416 12417 12418 12419 12420 12421 12422 12423 12424 12425 12426 12427 12428 12429 12430 12431 12432 12433 12434 12435 12436 12437 12438 12439 12440 12441 12442 12443 12444 12445 12446 12447 12448 12449 12450 12451 12452 12453 12454 12455 12456 12457 12458 12459 12460 12461 12462 12463 12464 12465 12466 12467 12468 12469 12470 12471 12472 12473 12474 12475 12476 12477 12478 12479 12480 12481 12482 12483 12484 12485 12486 12487 12488 12489 12490 12491 12492 12493 12494 12495 12496 12497 12498 12499 12500 12501 12502 12503 12504 12505 12506 12507 12508 12509 12510 12511 12512 12513 12514 12515 12516 12517 12518 12519 12520 12521 12522 12523 12524 12525 12526 12527 12528 12529 12530 12531 12532 12533 12534 12535 12536 12537 12538 12539 12540 12541 12542 12543 12544 12545 12546 12547 12548 12549 12550 12551 12552 12553 12554 12555 12556 12557 12558 12559 12560 12561 12562 12563 12564 12565 12566 12567 12568 12569 12570 12571 12572 12573 12574 12575 12576 12577 12578 12579 12580 12581 12582 12583 12584 12585 12586 12587 12588 12589 12590 12591 12592 12593 12594 12595 12596 12597 12598 12599 12600 12601 12602 12603 12604 12605 12606 12607 12608 12609 12610 12611 12612 12613 12614 12615 12616 12617 12618 12619 12620 12621 12622 12623 12624 12625 12626 12627 12628 12629 12630 12631 12632 12633 12634 12635 12636 12637 12638 12639 12640 12641 12642 12643 12644 12645 12646 12647 12648 12649 12650 12651 12652 12653 12654 12655 12656 12657 12658 12659 12660 12661 12662 12663 12664 12665 12666 12667 12668 12669 12670 12671 12672 12673 12674 12675 12676 12677 12678 12679 12680 12681 12682 12683 12684 12685 12686 12687 12688 12689 12690 12691 12692 12693 12694 12695 12696 12697 12698 12699 12700 12701 12702 12703 12704 12705 12706 12707 12708 12709 12710 12711 12712 12713 12714 12715 12716 12717 12718 12719 12720 12721 12722 12723 12724 12725 12726 12727 12728 12729 12730 12731 12732 12733 12734 12735 12736 12737 12738 12739 12740 12741 12742 12743 12744 12745 12746 12747 12748 12749 12750 12751 12752 12753 12754 12755 12756 12757 12758 12759 12760 12761 12762 12763 12764 12765 12766 12767 12768 12769 12770 12771 12772 12773 12774 12775 12776 12777 12778 12779 12780 12781 12782 12783 12784 12785 12786 12787 12788 12789 12790 12791 12792 12793 12794 12795 12796 12797 12798 12799 12800 12801 12802 12803 12804 12805 12806 12807 12808 12809 12810 12811 12812 12813 12814 12815 12816 12817 12818 12819 12820 12821 12822 12823 12824 12825 12826 12827 12828 12829 12830 12831 12832 12833 12834 12835 12836 12837 12838 12839 12840 12841 12842 12843 12844 12845 12846 12847 12848 12849 12850 12851 12852 12853 12854 12855 12856 12857 12858 12859 12860 12861 12862 12863 12864 12865 12866 12867 12868 12869 12870 12871 12872 12873 12874 12875 12876 12877 12878 12879 12880 12881 12882 12883 12884 12885 12886 12887 12888 12889 12890 12891 12892 12893 12894 12895 12896 12897 12898 12899 12900 12901 12902 12903 12904 12905 12906 12907 12908 12909 12910 12911 12912 12913 12914 12915 12916 12917 12918 12919 12920 12921 12922 12923 12924 12925 12926 12927 12928 12929 12930 12931 12932 12933 12934 12935 12936 12937 12938 12939 12940 12941 12942 12943 12944 12945 12946 12947 12948 12949 12950 12951 12952 12953 12954 12955 12956 12957 12958 12959 12960 12961 12962 12963 12964 12965 12966 12967 12968 12969 12970 12971 12972 12973 12974 12975 12976 12977 12978 12979 12980 12981 12982 12983 12984 12985 12986 12987 12988 12989 12990 12991 12992 12993 12994 12995 12996 12997 12998 12999 13000 13001 13002 13003 13004 13005 13006 13007 13008 13009 13010 13011 13012 13013 13014 13015 13016 13017 13018 13019 13020 13021 13022 13023 13024 13025 13026 13027 13028 13029 13030 13031 13032 13033 13034 13035 13036 13037 13038 13039 13040 13041 13042 13043 13044 13045 13046 13047 13048 13049 13050 13051 13052 13053 13054 13055 13056 13057 13058 13059 13060 13061 13062 13063 13064 13065 13066 13067 13068 13069 13070 13071 13072 13073 13074 13075 13076 13077 13078 13079 13080 13081 13082 13083 13084 13085 13086 13087 13088 13089 13090 13091 13092 13093 13094 13095 13096 13097 13098 13099 13100 13101 13102 13103 13104 13105 13106 13107 13108 13109 13110 13111 13112 13113 13114 13115 13116 13117 13118 13119 13120 13121 13122 13123 13124 13125 13126 13127 13128 13129 13130 13131 13132 13133 13134 13135 13136 13137 13138 13139 13140 13141 13142 13143 13144 13145 13146 13147 13148 13149 13150 13151 13152 13153 13154 13155 13156 13157 13158 13159 13160 13161 13162 13163 13164 13165 13166 13167 13168 13169 13170 13171 13172 13173 13174 13175 13176 13177 13178 13179 13180 13181 13182 13183 13184 13185 13186 13187 13188 13189 13190 13191 13192 13193 13194 13195 13196 13197 13198 13199 13200 13201 13202 13203 13204 13205 13206 13207 13208 13209 13210 13211 13212 13213 13214 13215 13216 13217 13218 13219 13220 13221 13222 13223 13224 13225 13226 13227 13228 13229 13230 13231 13232 13233 13234 13235 13236 13237 13238 13239 13240 13241 13242 13243 13244 13245 13246 13247 13248 13249 13250 13251 13252 13253 13254 13255 13256 13257 13258 13259 13260 13261 13262 13263 13264 13265 13266 13267 13268 13269 13270 13271 13272 13273 13274 13275 13276 13277 13278 13279 13280 13281 13282 13283 13284 13285 13286 13287 13288 13289 13290 13291 13292 13293 13294 13295 13296 13297 13298 13299 13300 13301 13302 13303 13304 13305 13306 13307 13308 13309 13310 13311 13312 13313 13314 13315 13316 13317 13318 13319 13320 13321 13322 13323 13324 13325 13326 13327 13328 13329 13330 13331 13332 13333 13334 13335 13336 13337 13338 13339 13340 13341 13342 13343 13344 13345 13346 13347 13348 13349 13350 13351 13352 13353 13354 13355 13356 13357 13358 13359 13360 13361 13362 13363 13364 13365 13366 13367 13368 13369 13370 13371 13372 13373 13374 13375 13376 13377 13378 13379 13380 13381 13382 13383 13384 13385 13386 13387 13388 13389 13390 13391 13392 13393 13394 13395 13396 13397 13398 13399 13400 13401 13402 13403 13404 13405 13406 13407 13408 13409 13410 13411 13412 13413 13414 13415 13416 13417 13418 13419 13420 13421 13422 13423 13424 13425 13426 13427 13428 13429 13430 13431 13432 13433 13434 13435 13436 13437 13438 13439 13440 13441 13442 13443 13444 13445 13446 13447 13448 13449 13450 13451 13452 13453 13454 13455 13456 13457 13458 13459 13460 13461 13462 13463 13464 13465 13466 13467 13468 13469 13470 13471 13472 13473 13474 13475 13476 13477 13478 13479 13480 13481 13482 13483 13484 13485 13486 13487 13488 13489 13490 13491 13492 13493 13494 13495 13496 13497 13498 13499 13500 13501 13502 13503 13504 13505 13506 13507 13508 13509 13510 13511 13512 13513 13514 13515 13516 13517 13518 13519 13520 13521 13522 13523 13524 13525 13526 13527 13528 13529 13530 13531 13532 13533 13534 13535 13536 13537 13538 13539 13540 13541 13542 13543 13544 13545 13546 13547 13548 13549 13550 13551 13552 13553 13554 13555 13556 13557 13558 13559 13560 13561 13562 13563 13564 13565 13566 13567 13568 13569 13570 13571 13572 13573 13574 13575 13576 13577 13578 13579 13580 13581 13582 13583 13584 13585 13586 13587 13588 13589 13590 13591 13592 13593 13594 13595 13596 13597 13598 13599 13600 13601 13602 13603 13604 13605 13606 13607 13608 13609 13610 13611 13612 13613 13614 13615 13616 13617 13618 13619 13620 13621 13622 13623 13624 13625 13626 13627 13628 13629 13630 13631 13632 13633 13634 13635 13636 13637 13638 13639 13640 13641 13642 13643 13644 13645 13646 13647 13648 13649 13650 13651 13652 13653 13654 13655 13656 13657 13658 13659 13660 13661 13662 13663 13664 13665 13666 13667 13668 13669 13670 13671 13672 13673 13674 13675 13676 13677 13678 13679 13680 13681 13682 13683 13684 13685 13686 13687 13688 13689 13690 13691 13692 13693 13694 13695 13696 13697 13698 13699 13700 13701 13702 13703 13704 13705 13706 13707 13708 13709 13710 13711 13712 13713 13714 13715 13716 13717 13718 13719 13720 13721 13722 13723 13724 13725 13726 13727 13728 13729 13730 13731 13732 13733 13734 13735 13736 13737 13738 13739 13740 13741 13742 13743 13744 13745 13746 13747 13748 13749 13750 13751 13752 13753 13754 13755 13756 13757 13758 13759 13760 13761 13762 13763 13764 13765 13766 13767 13768 13769 13770 13771 13772 13773 13774 13775 13776 13777 13778 13779 13780 13781 13782 13783 13784 13785 13786 13787 13788 13789 13790 13791 13792 13793 13794 13795 13796 13797 13798 13799 13800 13801 13802 13803 13804 13805 13806 13807 13808 13809 13810 13811 13812 13813 13814 13815 13816 13817 13818 13819 13820 13821 13822 13823 13824 13825 13826 13827 13828 13829 13830 13831 13832 13833 13834 13835 13836 13837 13838 13839 13840 13841 13842 13843 13844 13845 13846 13847 13848 13849 13850 13851 13852 13853 13854 13855 13856 13857 13858 13859 13860 13861 13862 13863 13864 13865 13866 13867 13868 13869 13870 13871 13872 13873 13874 13875 13876 13877 13878 13879 13880 13881 13882 13883 13884 13885 13886 13887 13888 13889 13890 13891 13892 13893 13894 13895 13896 13897 13898 13899 13900 13901 13902 13903 13904 13905 13906 13907 13908 13909 13910 13911 13912 13913 13914 13915 13916 13917 13918 13919 13920 13921 13922 13923 13924 13925 13926 13927 13928 13929 13930 13931 13932 13933 13934 13935 13936 13937 13938 13939 13940 13941 13942 13943 13944 13945 13946 13947 13948 13949 13950 13951 13952 13953 13954 13955 13956 13957 13958 13959 13960 13961 13962 13963 13964 13965 13966 13967 13968 13969 13970 13971 13972 13973 13974 13975 13976 13977 13978 13979 13980 13981 13982 13983 13984 13985 13986 13987 13988 13989 13990 13991 13992 13993 13994 13995 13996 13997 13998 13999 14000 14001 14002 14003 14004 14005 14006 14007 14008 14009 14010 14011 14012 14013 14014 14015 14016 14017 14018 14019 14020 14021 14022 14023 14024 14025 14026 14027 14028 14029 14030 14031 14032 14033 14034 14035 14036 14037 14038 14039 14040 14041 14042 14043 14044 14045 14046 14047 14048 14049 14050 14051 14052 14053 14054 14055 14056 14057 14058 14059 14060 14061 14062 14063 14064 14065 14066 14067 14068 14069 14070 14071 14072 14073 14074 14075 14076 14077 14078 14079 14080 14081 14082 14083 14084 14085 14086 14087 14088 14089 14090 14091 14092 14093 14094 14095 14096 14097 14098 14099 14100 14101 14102 14103 14104 14105 14106 14107 14108 14109 14110 14111 14112 14113 14114 14115 14116 14117 14118 14119 14120 14121 14122 14123 14124 14125 14126 14127 14128 14129 14130 14131 14132 14133 14134 14135 14136 14137 14138 14139 14140 14141 14142 14143 14144 14145 14146 14147 14148 14149 14150 14151 14152 14153 14154 14155 14156 14157 14158 14159 14160 14161 14162 14163 14164 14165 14166 14167 14168 14169 14170 14171 14172 14173 14174 14175 14176 14177 14178 14179 14180 14181 14182 14183 14184 14185 14186 14187 14188 14189 14190 14191 14192 14193 14194 14195 14196 14197 14198 14199 14200 14201 14202 14203 14204 14205 14206 14207 14208 14209 14210 14211 14212 14213 14214 14215 14216 14217 14218 14219 14220 14221 14222 14223 14224 14225 14226 14227 14228 14229 14230 14231 14232 14233 14234 14235 14236 14237 14238 14239 14240 14241 14242 14243 14244 14245 14246 14247 14248 14249 14250 14251 14252 14253 14254 14255 14256 14257 14258 14259 14260 14261 14262 14263 14264 14265 14266 14267 14268 14269 14270 14271 14272 14273 14274 14275 14276 14277 14278 14279 14280 14281 14282 14283 14284 14285 14286 14287 14288 14289 14290 14291 14292 14293 14294 14295 14296 14297 14298 14299 14300 14301 14302 14303 14304 14305 14306 14307 14308 14309 14310 14311 14312 14313 14314 14315 14316 14317 14318 14319 14320 14321 14322 14323 14324 14325 14326 14327 14328 14329 14330 14331 14332 14333 14334 14335 14336 14337 14338 14339 14340 14341 14342 14343 14344 14345 14346 14347 14348 14349 14350 14351 14352 14353 14354 14355 14356 14357 14358 14359 14360 14361 14362 14363 14364 14365 14366 14367 14368 14369 14370 14371 14372 14373 14374 14375 14376 14377 14378 14379 14380 14381 14382 14383 14384 14385 14386 14387 14388 14389 14390 14391 14392 14393 14394 14395 14396 14397 14398 14399 14400 14401 14402 14403 14404 14405 14406 14407 14408 14409 14410 14411 14412 14413 14414 14415 14416 14417 14418 14419 14420 14421 14422 14423 14424 14425 14426 14427 14428 14429 14430 14431 14432 14433 14434 14435 14436 14437 14438 14439 14440 14441 14442 14443 14444 14445 14446 14447 14448 14449 14450 14451 14452 14453 14454 14455 14456 14457 14458 14459 14460 14461 14462 14463 14464 14465 14466 14467 14468 14469 14470 14471 14472 14473 14474 14475 14476 14477 14478 14479 14480 14481 14482 14483 14484 14485 14486 14487 14488 14489 14490 14491 14492 14493 14494 14495 14496 14497 14498 14499 14500 14501 14502 14503 14504 14505 14506 14507 14508 14509 14510 14511 14512 14513 14514 14515 14516 14517 14518 14519 14520 14521 14522 14523 14524 14525 14526 14527 14528 14529 14530 14531 14532 14533 14534 14535 14536 14537 14538 14539 14540 14541 14542 14543 14544 14545 14546 14547 14548 14549 14550 14551 14552 14553 14554 14555 14556 14557 14558 14559 14560 14561 14562 14563 14564 14565 14566 14567 14568 14569 14570 14571 14572 14573 14574 14575 14576 14577 14578 14579 14580 14581 14582 14583 14584 14585 14586 14587 14588 14589 14590 14591 14592 14593 14594 14595 14596 14597 14598 14599 14600 14601 14602 14603 14604 14605 14606 14607 14608 14609 14610 14611 14612 14613 14614 14615 14616 14617 14618 14619 14620 14621 14622 14623 14624 14625 14626 14627 14628 14629 14630 14631 14632 14633 14634 14635 14636 14637 14638 14639 14640 14641 14642 14643 14644 14645 14646 14647 14648 14649 14650 14651 14652 14653 14654 14655 14656 14657 14658 14659 14660 14661 14662 14663 14664 14665 14666 14667 14668 14669 14670 14671 14672 14673 14674 14675 14676 14677 14678 14679 14680 14681 14682 14683 14684 14685 14686 14687 14688 14689 14690 14691 14692 14693 14694 14695 14696 14697 14698 14699 14700 14701 14702 14703 14704 14705 14706 14707 14708 14709 14710 14711 14712 14713 14714 14715 14716 14717 14718 14719 14720 14721 14722 14723 14724 14725 14726 14727 14728 14729 14730 14731 14732 14733 14734 14735 14736 14737 14738 14739 14740 14741 14742 14743 14744 14745 14746 14747 14748 14749 14750 14751 14752 14753 14754 14755 14756 14757 14758 14759 14760 14761 14762 14763 14764 14765 14766 14767 14768 14769 14770 14771 14772 14773 14774 14775 14776 14777 14778 14779 14780 14781 14782 14783 14784 14785 14786 14787 14788 14789 14790 14791 14792 14793 14794 14795 14796 14797 14798 14799 14800 14801 14802 14803 14804 14805 14806 14807 14808 14809 14810 14811 14812 14813 14814 14815 14816 14817 14818 14819 14820 14821 14822 14823 14824 14825 14826 14827 14828 14829 14830 14831 14832 14833 14834 14835 14836 14837 14838 14839 14840 14841 14842 14843 14844 14845 14846 14847 14848 14849 14850 14851 14852 14853 14854 14855 14856 14857 14858 14859 14860 14861 14862 14863 14864 14865 14866 14867 14868 14869 14870 14871 14872 14873 14874 14875 14876 14877 14878 14879 14880 14881 14882 14883 14884 14885 14886 14887 14888 14889 14890 14891 14892 14893 14894 14895 14896 14897 14898 14899 14900 14901 14902 14903 14904 14905 14906 14907 14908 14909 14910 14911 14912 14913 14914 14915 14916 14917 14918 14919 14920 14921 14922 14923 14924 14925 14926 14927 14928 14929 14930 14931 14932 14933 14934 14935 14936 14937 14938 14939 14940 14941 14942 14943 14944 14945 14946 14947 14948 14949 14950 14951 14952 14953 14954 14955 14956 14957 14958 14959 14960 14961 14962 14963 14964 14965 14966 14967 14968 14969 14970 14971 14972 14973 14974 14975 14976 14977 14978 14979 14980 14981 14982 14983 14984 14985 14986 14987 14988 14989 14990 14991 14992 14993 14994 14995 14996 14997 14998 14999 15000 15001 15002 15003 15004 15005 15006 15007 15008 15009 15010 15011 15012 15013 15014 15015 15016 15017 15018 15019 15020 15021 15022 15023 15024 15025 15026 15027 15028 15029 15030 15031 15032 15033 15034 15035 15036 15037 15038 15039 15040 15041 15042 15043 15044 15045 15046 15047 15048 15049 15050 15051 15052 15053 15054 15055 15056 15057 15058 15059 15060 15061 15062 15063 15064 15065 15066 15067 15068 15069 15070 15071 15072 15073 15074 15075 15076 15077 15078 15079 15080 15081 15082 15083 15084 15085 15086 15087 15088 15089 15090 15091 15092 15093 15094 15095 15096 15097 15098 15099 15100 15101 15102 15103 15104 15105 15106 15107 15108 15109 15110 15111 15112 15113 15114 15115 15116 15117 15118 15119 15120 15121 15122 15123 15124 15125 15126 15127 15128 15129 15130 15131 15132 15133 15134 15135 15136 15137 15138 15139 15140 15141 15142 15143 15144 15145 15146 15147 15148 15149 15150 15151 15152 15153 15154 15155 15156 15157 15158 15159 15160 15161 15162 15163 15164 15165 15166 15167 15168 15169 15170 15171 15172 15173 15174 15175 15176 15177 15178 15179 15180 15181 15182 15183 15184 15185 15186 15187 15188 15189 15190 15191 15192 15193 15194 15195 15196 15197 15198 15199 15200 15201 15202 15203 15204 15205 15206 15207 15208 15209 15210 15211 15212 15213 15214 15215 15216 15217 15218 15219 15220 15221 15222 15223 15224 15225 15226 15227 15228 15229 15230 15231 15232 15233 15234 15235 15236 15237 15238 15239 15240 15241 15242 15243 15244 15245 15246 15247 15248 15249 15250 15251 15252 15253 15254 15255 15256 15257 15258 15259 15260 15261 15262 15263 15264 15265 15266 15267 15268 15269 15270 15271 15272 15273 15274 15275 15276 15277 15278 15279 15280 15281 15282 15283 15284 15285 15286 15287 15288 15289 15290 15291 15292 15293 15294 15295 15296 15297 15298 15299 15300 15301 15302 15303 15304 15305 15306 15307 15308 15309 15310 15311 15312 15313 15314 15315 15316 15317 15318 15319 15320 15321 15322 15323 15324 15325 15326 15327 15328 15329 15330 15331 15332 15333 15334 15335 15336 15337 15338 15339 15340 15341 15342 15343 15344 15345 15346 15347 15348 15349 15350 15351 15352 15353 15354 15355 15356 15357 15358 15359 15360 15361 15362 15363 15364 15365 15366 15367 15368 15369 15370 15371 15372 15373 15374 15375 15376 15377 15378 15379 15380 15381 15382 15383 15384 15385 15386 15387 15388 15389 15390 15391 15392 15393 15394 15395 15396 15397 15398 15399 15400 15401 15402 15403 15404 15405 15406 15407 15408 15409 15410 15411 15412 15413 15414 15415 15416 15417 15418 15419 15420 15421 15422 15423 15424 15425 15426 15427 15428 15429 15430 15431 15432 15433 15434 15435 15436 15437 15438 15439 15440 15441 15442 15443 15444 15445 15446 15447 15448 15449 15450 15451 15452 15453 15454 15455 15456 15457 15458 15459 15460 15461 15462 15463 15464 15465 15466 15467 15468 15469 15470 15471 15472 15473 15474 15475 15476 15477 15478 15479 15480 15481 15482 15483 15484 15485 15486 15487 15488 15489 15490 15491 15492 15493 15494 15495 15496 15497 15498 15499 15500 15501 15502 15503 15504 15505 15506 15507 15508 15509 15510 15511 15512 15513 15514 15515 15516 15517 15518 15519 15520 15521 15522 15523 15524 15525 15526 15527 15528 15529 15530 15531 15532 15533 15534 15535 15536 15537 15538 15539 15540 15541 15542 15543 15544 15545 15546 15547 15548 15549 15550 15551 15552 15553 15554 15555 15556 15557 15558 15559 15560 15561 15562 15563 15564 15565 15566 15567 15568 15569 15570 15571 15572 15573 15574 15575 15576 15577 15578 15579 15580 15581 15582 15583 15584 15585 15586 15587 15588 15589 15590 15591 15592 15593 15594 15595 15596 15597 15598 15599 15600 15601 15602 15603 15604 15605 15606 15607 15608 15609 15610 15611 15612 15613 15614 15615 15616 15617 15618 15619 15620 15621 15622 15623 15624 15625 15626 15627 15628 15629 15630 15631 15632 15633 15634 15635 15636 15637 15638 15639 15640 15641 15642 15643 15644 15645 15646 15647 15648 15649 15650 15651 15652 15653 15654 15655 15656 15657 15658 15659 15660 15661 15662 15663 15664 15665 15666 15667 15668 15669 15670 15671 15672 15673 15674 15675 15676 15677 15678 15679 15680 15681 15682 15683 15684 15685 15686 15687 15688 15689 15690 15691 15692 15693 15694 15695 15696 15697 15698 15699 15700 15701 15702 15703 15704 15705 15706 15707 15708 15709 15710 15711 15712 15713 15714 15715 15716 15717 15718 15719 15720 15721 15722 15723 15724 15725 15726 15727 15728 15729 15730 15731 15732 15733 15734 15735 15736 15737 15738 15739 15740 15741 15742 15743 15744 15745 15746 15747 15748 15749 15750 15751 15752 15753 15754 15755 15756 15757 15758 15759 15760 15761 15762 15763 15764 15765 15766 15767 15768 15769 15770 15771 15772 15773 15774 15775 15776 15777 15778 15779 15780 15781 15782 15783 15784 15785 15786 15787 15788 15789 15790 15791 15792 15793 15794 15795 15796 15797 15798 15799 15800 15801 15802 15803 15804 15805 15806 15807 15808 15809 15810 15811 15812 15813 15814 15815 15816 15817 15818 15819 15820 15821 15822 15823 15824 15825 15826 15827 15828 15829 15830 15831 15832 15833 15834 15835 15836 15837 15838 15839 15840 15841 15842 15843 15844 15845 15846 15847 15848 15849 15850 15851 15852 15853 15854 15855 15856 15857 15858 15859 15860 15861 15862 15863 15864 15865 15866 15867 15868 15869 15870 15871 15872 15873 15874 15875 15876 15877 15878 15879 15880 15881 15882 15883 15884 15885 15886 15887 15888 15889 15890 15891 15892 15893 15894 15895 15896 15897 15898 15899 15900 15901 15902 15903 15904 15905 15906 15907 15908 15909 15910 15911 15912 15913 15914 15915 15916 15917 15918 15919 15920 15921 15922 15923 15924 15925 15926 15927 15928 15929 15930 15931 15932 15933 15934 15935 15936 15937 15938 15939 15940 15941 15942 15943 15944 15945 15946 15947 15948 15949 15950 15951 15952 15953 15954 15955 15956 15957 15958 15959 15960 15961 15962 15963 15964 15965 15966 15967 15968 15969 15970 15971 15972 15973 15974 15975 15976 15977 15978 15979 15980 15981 15982 15983 15984 15985 15986 15987 15988 15989 15990 15991 15992 15993 15994 15995 15996 15997 15998 15999 16000 16001 16002 16003 16004 16005 16006 16007 16008 16009 16010 16011 16012 16013 16014 16015 16016 16017 16018 16019 16020 16021 16022 16023 16024 16025 16026 16027 16028 16029 16030 16031 16032 16033 16034 16035 16036 16037 16038 16039 16040 16041 16042 16043 16044 16045 16046 16047 16048 16049 16050 16051 16052 16053 16054 16055 16056 16057 16058 16059 16060 16061 16062 16063 16064 16065 16066 16067 16068 16069 16070 16071 16072 16073 16074 16075 16076 16077 16078 16079 16080 16081 16082 16083 16084 16085 16086 16087 16088 16089 16090 16091 16092 16093 16094 16095 16096 16097 16098 16099 16100 16101 16102 16103 16104 16105 16106 16107 16108 16109 16110 16111 16112 16113 16114 16115 16116 16117 16118 16119 16120 16121 16122 16123 16124 16125 16126 16127 16128 16129 16130 16131 16132 16133 16134 16135 16136 16137 16138 16139 16140 16141 16142 16143 16144 16145 16146 16147 16148 16149 16150 16151 16152 16153 16154 16155 16156 16157 16158 16159 16160 16161 16162 16163 16164 16165 16166 16167 16168 16169 16170 16171 16172 16173 16174 16175 16176 16177 16178 16179 16180 16181 16182 16183 16184 16185 16186 16187 16188 16189 16190 16191 16192 16193 16194 16195 16196 16197 16198 16199 16200 16201 16202 16203 16204 16205 16206 16207 16208 16209 16210 16211 16212 16213 16214 16215 16216 16217 16218 16219 16220 16221 16222 16223 16224 16225 16226 16227 16228 16229 16230 16231 16232 16233 16234 16235 16236 16237 16238 16239 16240 16241 16242 16243 16244 16245 16246 16247 16248 16249 16250 16251 16252 16253 16254 16255 16256 16257 16258 16259 16260 16261 16262 16263 16264 16265 16266 16267 16268 16269 16270 16271 16272 16273 16274 16275 16276 16277 16278 16279 16280 16281 16282 16283 16284 16285 16286 16287 16288 16289 16290 16291 16292 16293 16294 16295 16296 16297 16298 16299 16300 16301 16302 16303 16304 16305 16306 16307 16308 16309 16310 16311 16312 16313 16314 16315 16316 16317 16318 16319 16320 16321 16322 16323 16324 16325 16326 16327 16328 16329 16330 16331 16332 16333 16334 16335 16336 16337 16338 16339 16340 16341 16342 16343 16344 16345 16346 16347 16348 16349 16350 16351 16352 16353 16354 16355 16356 16357 16358 16359 16360 16361 16362 16363 16364 16365 16366 16367 16368 16369 16370 16371 16372 16373 16374 16375 16376 16377 16378 16379 16380 16381 16382 16383 16384 16385 16386 16387 16388 16389 16390 16391 16392 16393 16394 16395 16396 16397 16398 16399 16400 16401 16402 16403 16404 16405 16406 16407 16408 16409 16410 16411 16412 16413 16414 16415 16416 16417 16418 16419 16420 16421 16422 16423 16424 16425 16426 16427 16428 16429 16430 16431 16432 16433 16434 16435 16436 16437 16438 16439 16440 16441 16442 16443 16444 16445 16446 16447 16448 16449 16450 16451 16452 16453 16454 16455 16456 16457 16458 16459 16460 16461 16462 16463 16464 16465 16466 16467 16468 16469 16470 16471 16472 16473 16474 16475 16476 16477 16478 16479 16480 16481 16482 16483 16484 16485 16486 16487 16488 16489 16490 16491 16492 16493 16494 16495 16496 16497 16498 16499 16500 16501 16502 16503 16504 16505 16506 16507 16508 16509 16510 16511 16512 16513 16514 16515 16516 16517 16518 16519 16520 16521 16522 16523 16524 16525 16526 16527 16528 16529 16530 16531 16532 16533 16534 16535 16536 16537 16538 16539 16540 16541 16542 16543 16544 16545 16546 16547 16548 16549 16550 16551 16552 16553 16554 16555 16556 16557 16558 16559 16560 16561 16562 16563 16564 16565 16566 16567 16568 16569 16570 16571 16572 16573 16574 16575 16576 16577 16578 16579 16580 16581 16582 16583 16584 16585 16586 16587 16588 16589 16590 16591 16592 16593 16594 16595 16596 16597 16598 16599 16600 16601 16602 16603 16604 16605 16606 16607 16608 16609 16610 16611 16612 16613 16614 16615 16616 16617 16618 16619 16620 16621 16622 16623 16624 16625 16626 16627 16628 16629 16630 16631 16632 16633 16634 16635 16636 16637 16638 16639 16640 16641 16642 16643 16644 16645 16646 16647 16648 16649 16650 16651 16652 16653 16654 16655 16656 16657 16658 16659 16660 16661 16662 16663 16664 16665 16666 16667 16668 16669 16670 16671 16672 16673 16674 16675 16676 16677 16678 16679 16680 16681 16682 16683 16684 16685 16686 16687 16688 16689 16690 16691 16692 16693 16694 16695 16696 16697 16698 16699 16700 16701 16702 16703 16704 16705 16706 16707 16708 16709 16710 16711 16712 16713 16714 16715 16716 16717 16718 16719 16720 16721 16722 16723 16724 16725 16726 16727 16728 16729 16730 16731 16732 16733 16734 16735 16736 16737 16738 16739 16740 16741 16742 16743 16744 16745 16746 16747 16748 16749 16750 16751 16752 16753 16754 16755 16756 16757 16758 16759 16760 16761 16762 16763 16764 16765 16766 16767 16768 16769 16770 16771 16772 16773 16774 16775 16776 16777 16778 16779 16780 16781 16782 16783 16784 16785 16786 16787 16788 16789 16790 16791 16792 16793 16794 16795 16796 16797 16798 16799 16800 16801 16802 16803 16804 16805 16806 16807 16808 16809 16810 16811 16812 16813 16814 16815 16816 16817 16818 16819 16820 16821 16822 16823 16824 16825 16826 16827 16828 16829 16830 16831 16832 16833 16834 16835 16836 16837 16838 16839 16840 16841 16842 16843 16844 16845 16846 16847 16848 16849 16850 16851 16852 16853 16854 16855 16856 16857 16858 16859 16860 16861 16862 16863 16864 16865 16866 16867 16868 16869 16870 16871 16872 16873 16874 16875 16876 16877 16878 16879 16880 16881 16882 16883 16884 16885 16886 16887 16888 16889 16890 16891 16892 16893 16894 16895 16896 16897 16898 16899 16900 16901 16902 16903 16904 16905 16906 16907 16908 16909 16910 16911 16912 16913 16914 16915 16916 16917 16918 16919 16920 16921 16922 16923 16924 16925 16926 16927 16928 16929 16930 16931 16932 16933 16934 16935 16936 16937 16938 16939 16940 16941 16942 16943 16944 16945 16946 16947 16948 16949 16950 16951 16952 16953 16954 16955 16956 16957 16958 16959 16960 16961 16962 16963 16964 16965 16966 16967 16968 16969 16970 16971 16972 16973 16974 16975 16976 16977 16978 16979 16980 16981 16982 16983 16984 16985 16986 16987 16988 16989 16990 16991 16992 16993 16994 16995 16996 16997 16998 16999 17000 17001 17002 17003 17004 17005 17006 17007 17008 17009 17010 17011 17012 17013 17014 17015 17016 17017 17018 17019 17020 17021 17022 17023 17024 17025 17026 17027 17028 17029 17030 17031 17032 17033 17034 17035 17036 17037 17038 17039 17040 17041 17042 17043 17044 17045 17046 17047 17048 17049 17050 17051 17052 17053 17054 17055 17056 17057 17058 17059 17060 17061 17062 17063 17064 17065 17066 17067 17068 17069 17070 17071 17072 17073 17074 17075 17076 17077 17078 17079 17080 17081 17082 17083 17084 17085 17086 17087 17088 17089 17090 17091 17092 17093 17094 17095 17096 17097 17098 17099 17100 17101 17102 17103 17104 17105 17106 17107 17108 17109 17110 17111 17112 17113 17114 17115 17116 17117 17118 17119 17120 17121 17122 17123 17124 17125 17126 17127 17128 17129 17130 17131 17132 17133 17134 17135 17136 17137 17138 17139 17140 17141 17142 17143 17144 17145 17146 17147 17148 17149 17150 17151 17152 17153 17154 17155 17156 17157 17158 17159 17160 17161 17162 17163 17164 17165 17166 17167 17168 17169 17170 17171 17172 17173 17174 17175 17176 17177 17178 17179 17180 17181 17182 17183 17184 17185 17186 17187 17188 17189 17190 17191 17192 17193 17194 17195 17196 17197 17198 17199 17200 17201 17202 17203 17204 17205 17206 17207 17208 17209 17210 17211 17212 17213 17214 17215 17216 17217 17218 17219 17220 17221 17222 17223 17224 17225 17226 17227 17228 17229 17230 17231 17232 17233 17234 17235 17236 17237 17238 17239 17240 17241 17242 17243 17244 17245 17246 17247 17248 17249 17250 17251 17252 17253 17254 17255 17256 17257 17258 17259 17260 17261 17262 17263 17264 17265 17266 17267 17268 17269 17270 17271 17272 17273 17274 17275 17276 17277 17278 17279 17280 17281 17282 17283 17284 17285 17286 17287 17288 17289 17290 17291 17292 17293 17294 17295 17296 17297 17298 17299 17300 17301 17302 17303 17304 17305 17306 17307 17308 17309 17310 17311 17312 17313 17314 17315 17316 17317 17318 17319 17320 17321 17322 17323 17324 17325 17326 17327 17328 17329 17330 17331 17332 17333 17334 17335 17336 17337 17338 17339 17340 17341 17342 17343 17344 17345 17346 17347 17348 17349 17350 17351 17352 17353 17354 17355 17356 17357 17358 17359 17360 17361 17362 17363 17364 17365 17366 17367 17368 17369 17370 17371 17372 17373 17374 17375 17376 17377 17378 17379 17380 17381 17382 17383 17384 17385 17386 17387 17388 17389 17390 17391 17392 17393 17394 17395 17396 17397 17398 17399 17400 17401 17402 17403 17404 17405 17406 17407 17408 17409 17410 17411 17412 17413 17414 17415 17416 17417 17418 17419 17420 17421 17422 17423 17424 17425 17426 17427 17428 17429 17430 17431 17432 17433 17434 17435 17436 17437 17438 17439 17440 17441 17442 17443 17444 17445 17446 17447 17448 17449 17450 17451 17452 17453 17454 17455 17456 17457 17458 17459 17460 17461 17462 17463 17464 17465 17466 17467 17468 17469 17470 17471 17472 17473 17474 17475 17476 17477 17478 17479 17480 17481 17482 17483 17484 17485 17486 17487 17488 17489 17490 17491 17492 17493 17494 17495 17496 17497 17498 17499 17500 17501 17502 17503 17504 17505 17506 17507 17508 17509 17510 17511 17512 17513 17514 17515 17516 17517 17518 17519 17520 17521 17522 17523 17524 17525 17526 17527 17528 17529 17530 17531 17532 17533 17534 17535 17536 17537 17538 17539 17540 17541 17542 17543 17544 17545 17546 17547 17548 17549 17550 17551 17552 17553 17554 17555 17556 17557 17558 17559 17560 17561 17562 17563 17564 17565 17566 17567 17568 17569 17570 17571 17572 17573 17574 17575 17576 17577 17578 17579 17580 17581 17582 17583 17584 17585 17586 17587 17588 17589 17590 17591 17592 17593 17594 17595 17596 17597 17598 17599 17600 17601 17602 17603 17604 17605 17606 17607 17608 17609 17610 17611 17612 17613 17614 17615 17616 17617 17618 17619 17620 17621 17622 17623 17624 17625 17626 17627 17628 17629 17630 17631 17632 17633 17634 17635 17636 17637 17638 17639 17640 17641 17642 17643 17644 17645 17646 17647 17648 17649 17650 17651 17652 17653 17654 17655 17656 17657 17658 17659 17660 17661 17662 17663 17664 17665 17666 17667 17668 17669 17670 17671 17672 17673 17674 17675 17676 17677 17678 17679 17680 17681 17682 17683 17684 17685 17686 17687 17688 17689 17690 17691 17692 17693 17694 17695 17696 17697 17698 17699 17700 17701 17702 17703 17704 17705 17706 17707 17708 17709 17710 17711 17712 17713 17714 17715 17716 17717 17718 17719 17720 17721 17722 17723 17724 17725 17726 17727 17728 17729 17730 17731 17732 17733 17734 17735 17736 17737 17738 17739 17740 17741 17742 17743 17744 17745 17746 17747 17748 17749 17750 17751 17752 17753 17754 17755 17756 17757 17758 17759 17760 17761 17762 17763 17764 17765 17766 17767 17768 17769 17770 17771 17772 17773 17774 17775 17776 17777 17778 17779 17780 17781 17782 17783 17784 17785 17786 17787 17788 17789 17790 17791 17792 17793 17794 17795 17796 17797 17798 17799 17800 17801 17802 17803 17804 17805 17806 17807 17808 17809 17810 17811 17812 17813 17814 17815 17816 17817 17818 17819 17820 17821 17822 17823 17824 17825 17826 17827 17828 17829 17830 17831 17832 17833 17834 17835 17836 17837 17838 17839 17840 17841 17842 17843 17844 17845 17846 17847 17848 17849 17850 17851 17852 17853 17854 17855 17856 17857 17858 17859 17860 17861 17862 17863 17864 17865 17866 17867 17868 17869 17870 17871 17872 17873 17874 17875 17876 17877 17878 17879 17880 17881 17882 17883 17884 17885 17886 17887 17888 17889 17890 17891 17892 17893 17894 17895 17896 17897 17898 17899 17900 17901 17902 17903 17904 17905 17906 17907 17908 17909 17910 17911 17912 17913 17914 17915 17916 17917 17918 17919 17920 17921 17922 17923 17924 17925 17926 17927 17928 17929 17930 17931 17932 17933 17934 17935 17936 17937 17938 17939 17940 17941 17942 17943 17944 17945 17946 17947 17948 17949 17950 17951 17952 17953 17954 17955 17956 17957 17958 17959 17960 17961 17962 17963 17964 17965 17966 17967 17968 17969 17970 17971 17972 17973 17974 17975 17976 17977 17978 17979 17980 17981 17982 17983 17984 17985 17986 17987 17988 17989 17990 17991 17992 17993 17994 17995 17996 17997 17998 17999 18000 18001 18002 18003 18004 18005 18006 18007 18008 18009 18010 18011 18012 18013 18014 18015 18016 18017 18018 18019 18020 18021 18022 18023 18024 18025 18026 18027 18028 18029 18030 18031 18032 18033 18034 18035 18036 18037 18038 18039 18040 18041 18042 18043 18044 18045 18046 18047 18048 18049 18050 18051 18052 18053 18054 18055 18056 18057 18058 18059 18060 18061 18062 18063 18064 18065 18066 18067 18068 18069 18070 18071 18072 18073 18074 18075 18076 18077 18078 18079 18080 18081 18082 18083 18084 18085 18086 18087 18088 18089 18090 18091 18092 18093 18094 18095 18096 18097 18098 18099 18100 18101 18102 18103 18104 18105 18106 18107 18108 18109 18110 18111 18112 18113 18114 18115 18116 18117 18118 18119 18120 18121 18122 18123 18124 18125 18126 18127 18128 18129 18130 18131 18132 18133 18134 18135 18136 18137 18138 18139 18140 18141 18142 18143 18144 18145 18146 18147 18148 18149 18150 18151 18152 18153 18154 18155 18156 18157 18158 18159 18160 18161 18162 18163 18164 18165 18166 18167 18168 18169 18170 18171 18172 18173 18174 18175 18176 18177 18178 18179 18180 18181 18182 18183 18184 18185 18186 18187 18188 18189 18190 18191 18192 18193 18194 18195 18196 18197 18198 18199 18200 18201 18202 18203 18204 18205 18206 18207 18208 18209 18210 18211 18212 18213 18214 18215 18216 18217 18218 18219 18220 18221 18222 18223 18224 18225 18226 18227 18228 18229 18230 18231 18232 18233 18234 18235 18236 18237 18238 18239 18240 18241 18242 18243 18244 18245 18246 18247 18248 18249 18250 18251 18252 18253 18254 18255 18256 18257 18258 18259 18260 18261 18262 18263 18264 18265 18266 18267 18268 18269 18270 18271 18272 18273 18274 18275 18276 18277 18278 18279 18280 18281 18282 18283 18284 18285 18286 18287 18288 18289 18290 18291 18292 18293 18294 18295 18296 18297 18298 18299 18300 18301 18302 18303 18304 18305 18306 18307 18308 18309 18310 18311 18312 18313 18314 18315 18316 18317 18318 18319 18320 18321 18322 18323 18324 18325 18326 18327 18328 18329 18330 18331 18332 18333 18334 18335 18336 18337 18338 18339 18340 18341 18342 18343 18344 18345 18346 18347 18348 18349 18350 18351 18352 18353 18354 18355 18356 18357 18358 18359 18360 18361 18362 18363 18364 18365 18366 18367 18368 18369 18370 18371 18372 18373 18374 18375 18376 18377 18378 18379 18380 18381 18382 18383 18384 18385 18386 18387 18388 18389 18390 18391 18392 18393 18394 18395 18396 18397 18398 18399 18400 18401 18402 18403 18404 18405 18406 18407 18408 18409 18410 18411 18412 18413 18414 18415 18416 18417 18418 18419 18420 18421 18422 18423 18424 18425 18426 18427 18428 18429 18430 18431 18432 18433 18434 18435 18436 18437 18438 18439 18440 18441 18442 18443 18444 18445 18446 18447 18448 18449 18450 18451 18452 18453 18454 18455 18456 18457 18458 18459 18460 18461 18462 18463 18464 18465 18466 18467 18468 18469 18470 18471 18472 18473 18474 18475 18476 18477 18478 18479 18480 18481 18482 18483 18484 18485 18486 18487 18488 18489 18490 18491 18492 18493 18494 18495 18496 18497 18498 18499 18500 18501 18502 18503 18504 18505 18506 18507 18508 18509 18510 18511 18512 18513 18514 18515 18516 18517 18518 18519 18520 18521 18522 18523 18524 18525 18526 18527 18528 18529 18530 18531 18532 18533 18534 18535 18536 18537 18538 18539 18540 18541 18542 18543 18544 18545 18546 18547 18548 18549 18550 18551 18552 18553 18554 18555 18556 18557 18558 18559 18560 18561 18562 18563 18564 18565 18566 18567 18568 18569 18570 18571 18572 18573 18574 18575 18576 18577 18578 18579 18580 18581 18582 18583 18584 18585 18586 18587 18588 18589 18590 18591 18592 18593 18594 18595 18596 18597 18598 18599 18600 18601 18602 18603 18604 18605 18606 18607 18608 18609 18610 18611 18612 18613 18614 18615 18616 18617 18618 18619 18620 18621 18622 18623 18624 18625 18626 18627 18628 18629 18630 18631 18632 18633 18634 18635 18636 18637 18638 18639 18640 18641 18642 18643 18644 18645 18646 18647 18648 18649 18650 18651 18652 18653 18654 18655 18656 18657 18658 18659 18660 18661 18662 18663 18664 18665 18666 18667 18668 18669 18670 18671 18672 18673 18674 18675 18676 18677 18678 18679 18680 18681 18682 18683 18684 18685 18686 18687 18688 18689 18690 18691 18692 18693 18694 18695 18696 18697 18698 18699 18700 18701 18702 18703 18704 18705 18706 18707 18708 18709 18710 18711 18712 18713 18714 18715 18716 18717 18718 18719 18720 18721 18722 18723 18724 18725 18726 18727 18728 18729 18730 18731 18732 18733 18734 18735 18736 18737 18738 18739 18740 18741 18742 18743 18744 18745 18746 18747 18748 18749 18750 18751 18752 18753 18754 18755 18756 18757 18758 18759 18760 18761 18762 18763 18764 18765 18766 18767 18768 18769 18770 18771 18772 18773 18774 18775 18776 18777 18778 18779 18780 18781 18782 18783 18784 18785 18786 18787 18788 18789 18790 18791 18792 18793 18794 18795 18796 18797 18798 18799 18800 18801 18802 18803 18804 18805 18806 18807 18808 18809 18810 18811 18812 18813 18814 18815 18816 18817 18818 18819 18820 18821 18822 18823 18824 18825 18826 18827 18828 18829 18830 18831 18832 18833 18834 18835 18836 18837 18838 18839 18840 18841 18842 18843 18844 18845 18846 18847 18848 18849 18850 18851 18852 18853 18854 18855 18856 18857 18858 18859 18860 18861 18862 18863 18864 18865 18866 18867 18868 18869 18870 18871 18872 18873 18874 18875 18876 18877 18878 18879 18880 18881 18882 18883 18884 18885 18886 18887 18888 18889 18890 18891 18892 18893 18894 18895 18896 18897 18898 18899 18900 18901 18902 18903 18904 18905 18906 18907 18908 18909 18910 18911 18912 18913 18914 18915 18916 18917 18918 18919 18920 18921 18922 18923 18924 18925 18926 18927 18928 18929 18930 18931 18932 18933 18934 18935 18936 18937 18938 18939 18940 18941 18942 18943 18944 18945 18946 18947 18948 18949 18950 18951 18952 18953 18954 18955 18956 18957 18958 18959 18960 18961 18962 18963 18964 18965 18966 18967 18968 18969 18970 18971 18972 18973 18974 18975 18976 18977 18978 18979 18980 18981 18982 18983 18984 18985 18986 18987 18988 18989 18990 18991 18992 18993 18994 18995 18996 18997 18998 18999 19000 19001 19002 19003 19004 19005 19006 19007 19008 19009 19010 19011 19012 19013 19014 19015 19016 19017 19018 19019 19020 19021 19022 19023 19024 19025 19026 19027 19028 19029 19030 19031 19032 19033 19034 19035 19036 19037 19038 19039 19040 19041 19042 19043 19044 19045 19046 19047 19048 19049 19050 19051 19052 19053 19054 19055 19056 19057 19058 19059 19060 19061 19062 19063 19064 19065 19066 19067 19068 19069 19070 19071 19072 19073 19074 19075 19076 19077 19078 19079 19080 19081 19082 19083 19084 19085 19086 19087 19088 19089 19090 19091 19092 19093 19094 19095 19096 19097 19098 19099 19100 19101 19102 19103 19104 19105 19106 19107 19108 19109 19110 19111 19112 19113 19114 19115 19116 19117 19118 19119 19120 19121 19122 19123 19124 19125 19126 19127 19128 19129 19130 19131 19132 19133 19134 19135 19136 19137 19138 19139 19140 19141 19142 19143 19144 19145 19146 19147 19148 19149 19150 19151 19152 19153 19154 19155 19156 19157 19158 19159 19160 19161 19162 19163 19164 19165 19166 19167 19168 19169 19170 19171 19172 19173 19174 19175 19176 19177 19178 19179 19180 19181 19182 19183 19184 19185 19186 19187 19188 19189 19190 19191 19192 19193 19194 19195 19196 19197 19198 19199 19200 19201 19202 19203 19204 19205 19206 19207 19208 19209 19210 19211 19212 19213 19214 19215 19216 19217 19218 19219 19220 19221 19222 19223 19224 19225 19226 19227 19228 19229 19230 19231 19232 19233 19234 19235 19236 19237 19238 19239 19240 19241 19242 19243 19244 19245 19246 19247 19248 19249 19250 19251 19252 19253 19254 19255 19256 19257 19258 19259 19260 19261 19262 19263 19264 19265 19266 19267 19268 19269 19270 19271 19272 19273 19274 19275 19276 19277 19278 19279 19280 19281 19282 19283 19284 19285 19286 19287 19288 19289 19290 19291 19292 19293 19294 19295 19296 19297 19298 19299 19300 19301 19302 19303 19304 19305 19306 19307 19308 19309 19310 19311 19312 19313 19314 19315 19316 19317 19318 19319 19320 19321 19322 19323 19324 19325 19326 19327 19328 19329 19330 19331 19332 19333 19334 19335 19336 19337 19338 19339 19340 19341 19342 19343 19344 19345 19346 19347 19348 19349 19350 19351 19352 19353 19354 19355 19356 19357 19358 19359 19360 19361 19362 19363 19364 19365 19366 19367 19368 19369 19370 19371 19372 19373 19374 19375 19376 19377 19378 19379 19380 19381 19382 19383 19384 19385 19386 19387 19388 19389 19390 19391 19392 19393 19394 19395 19396 19397 19398 19399 19400 19401 19402 19403 19404 19405 19406 19407 19408 19409 19410 19411 19412 19413 19414 19415 19416 19417 19418 19419 19420 19421 19422 19423 19424 19425 19426 19427 19428 19429 19430 19431 19432 19433 19434 19435 19436 19437 19438 19439 19440 19441 19442 19443 19444 19445 19446 19447 19448 19449 19450 19451 19452 19453 19454 19455 19456 19457 19458 19459 19460 19461 19462 19463 19464 19465 19466 19467 19468 19469 19470 19471 19472 19473 19474 19475 19476 19477 19478 19479 19480 19481 19482 19483 19484 19485 19486 19487 19488 19489 19490 19491 19492 19493 19494 19495 19496 19497 19498 19499 19500 19501 19502 19503 19504 19505 19506 19507 19508 19509 19510 19511 19512 19513 19514 19515 19516 19517 19518 19519 19520 19521 19522 19523 19524 19525 19526 19527 19528 19529 19530 19531 19532 19533 19534 19535 19536 19537 19538 19539 19540 19541 19542 19543 19544 19545 19546 19547 19548 19549 19550 19551 19552 19553 19554 19555 19556 19557 19558 19559 19560 19561 19562 19563 19564 19565 19566 19567 19568 19569 19570 19571 19572 19573 19574 19575 19576 19577 19578 19579 19580 19581 19582 19583 19584 19585 19586 19587 19588 19589 19590 19591 19592 19593 19594 19595 19596 19597 19598 19599 19600 19601 19602 19603 19604 19605 19606 19607 19608 19609 19610 19611 19612 19613 19614 19615 19616 19617 19618 19619 19620 19621 19622 19623 19624 19625 19626 19627 19628 19629 19630 19631 19632 19633 19634 19635 19636 19637 19638 19639 19640 19641 19642 19643 19644 19645 19646 19647 19648 19649 19650 19651 19652 19653 19654 19655 19656 19657 19658 19659 19660 19661 19662 19663 19664 19665 19666 19667 19668 19669 19670 19671 19672 19673 19674 19675 19676 19677 19678 19679 19680 19681 19682 19683 19684 19685 19686 19687 19688 19689 19690 19691 19692 19693 19694 19695 19696 19697 19698 19699 19700 19701 19702 19703 19704 19705 19706 19707 19708 19709 19710 19711 19712 19713 19714 19715 19716 19717 19718 19719 19720 19721 19722 19723 19724 19725 19726 19727 19728 19729 19730 19731 19732 19733 19734 19735 19736 19737 19738 19739 19740 19741 19742 19743 19744 19745 19746 19747 19748 19749 19750 19751 19752 19753 19754 19755 19756 19757 19758 19759 19760 19761 19762 19763 19764 19765 19766 19767 19768 19769 19770 19771 19772 19773 19774 19775 19776 19777 19778 19779 19780 19781 19782 19783 19784 19785 19786 19787 19788 19789 19790 19791 19792 19793 19794 19795 19796 19797 19798 19799 19800 19801 19802 19803 19804 19805 19806 19807 19808 19809 19810 19811 19812 19813 19814 19815 19816 19817 19818 19819 19820 19821 19822 19823 19824 19825 19826 19827 19828 19829 19830 19831 19832 19833 19834 19835 19836 19837 19838 19839 19840 19841 19842 19843 19844 19845 19846 19847 19848 19849 19850 19851 19852 19853 19854 19855 19856 19857 19858 19859 19860 19861 19862 19863 19864 19865 19866 19867 19868 19869 19870 19871 19872 19873 19874 19875 19876 19877 19878 19879 19880 19881 19882 19883 19884 19885 19886 19887 19888 19889 19890 19891 19892 19893 19894 19895 19896 19897 19898 19899 19900 19901 19902 19903 19904 19905 19906 19907 19908 19909 19910 19911 19912 19913 19914 19915 19916 19917 19918 19919 19920 19921 19922 19923 19924 19925 19926 19927 19928 19929 19930 19931 19932 19933 19934 19935 19936 19937 19938 19939 19940 19941 19942 19943 19944 19945 19946 19947 19948 19949 19950 19951 19952 19953 19954 19955 19956 19957 19958 19959 19960 19961 19962 19963 19964 19965 19966 19967 19968 19969 19970 19971 19972 19973 19974 19975 19976 19977 19978 19979 19980 19981 19982 19983 19984 19985 19986 19987 19988 19989 19990 19991 19992 19993 19994 19995 19996 19997 19998 19999 20000 20001 20002 20003 20004 20005 20006 20007 20008 20009 20010 20011 20012 20013 20014 20015 20016 20017 20018 20019 20020 20021 20022 20023 20024 20025 20026 20027 20028 20029 20030 20031 20032 20033 20034 20035 20036 20037 20038 20039 20040 20041 20042 20043 20044 20045 20046 20047 20048 20049 20050 20051 20052 20053 20054 20055 20056 20057 20058 20059 20060 20061 20062 20063 20064 20065 20066 20067 20068 20069 20070 20071 20072 20073 20074 20075 20076 20077 20078 20079 20080 20081 20082 20083 20084 20085 20086 20087 20088 20089 20090 20091 20092 20093 20094 20095 20096 20097 20098 20099 20100 20101 20102 20103 20104 20105 20106 20107 20108 20109 20110 20111 20112 20113 20114 20115 20116 20117 20118 20119 20120 20121 20122 20123 20124 20125 20126 20127 20128 20129 20130 20131 20132 20133 20134 20135 20136 20137 20138 20139 20140 20141 20142 20143 20144 20145 20146 20147 20148 20149 20150 20151 20152 20153 20154 20155 20156 20157 20158 20159 20160 20161 20162 20163 20164 20165 20166 20167 20168 20169 20170 20171 20172 20173 20174 20175 20176 20177 20178 20179 20180 20181 20182 20183 20184 20185 20186 20187 20188 20189 20190 20191 20192 20193 20194 20195 20196 20197 20198 20199 20200 20201 20202 20203 20204 20205 20206 20207 20208 20209 20210 20211 20212 20213 20214 20215 20216 20217 20218 20219 20220 20221 20222 20223 20224 20225 20226 20227 20228 20229 20230 20231 20232 20233 20234 20235 20236 20237 20238 20239 20240 20241 20242 20243 20244 20245 20246 20247 20248 20249 20250 20251 20252 20253 20254 20255 20256 20257 20258 20259 20260 20261 20262 20263 20264 20265 20266 20267 20268 20269 20270 20271 20272 20273 20274 20275 20276 20277 20278 20279 20280 20281 20282 20283 20284 20285 20286 20287 20288 20289 20290 20291 20292 20293 20294 20295 20296 20297 20298 20299 20300 20301 20302 20303 20304 20305 20306 20307 20308 20309 20310 20311 20312 20313 20314 20315 20316 20317 20318 20319 20320 20321 20322 20323 20324 20325 20326 20327 20328 20329 20330 20331 20332 20333 20334 20335 20336 20337 20338 20339 20340 20341 20342 20343 20344 20345 20346 20347 20348 20349 20350 20351 20352 20353 20354 20355 20356 20357 20358 20359 20360 20361 20362 20363 20364 20365 20366 20367 20368 20369 20370 20371 20372 20373 20374 20375 20376 20377 20378 20379 20380 20381 20382 20383 20384 20385 20386 20387 20388 20389 20390 20391 20392 20393 20394 20395 20396 20397 20398 20399 20400 20401 20402 20403 20404 20405 20406 20407 20408 20409 20410 20411 20412 20413 20414 20415 20416 20417 20418 20419 20420 20421 20422 20423 20424 20425 20426 20427 20428 20429 20430 20431 20432 20433 20434 20435 20436 20437 20438 20439 20440 20441 20442 20443 20444 20445 20446 20447 20448 20449 20450 20451 20452 20453 20454 20455 20456 20457 20458 20459 20460 20461 20462 20463 20464 20465 20466 20467 20468 20469 20470 20471 20472 20473 20474 20475 20476 20477 20478 20479 20480 20481 20482 20483 20484 20485 20486 20487 20488 20489 20490 20491 20492 20493 20494 20495 20496 20497 20498 20499 20500 20501 20502 20503 20504 20505 20506 20507 20508 20509 20510 20511 20512 20513 20514 20515 20516 20517 20518 20519 20520 20521 20522 20523 20524 20525 20526 20527 20528 20529 20530 20531 20532 20533 20534 20535 20536 20537 20538 20539 20540 20541 20542 20543 20544 20545 20546 20547 20548 20549 20550 20551 20552 20553 20554 20555 20556 20557 20558 20559 20560 20561 20562 20563 20564 20565 20566 20567 20568 20569 20570 20571 20572 20573 20574 20575 20576 20577 20578 20579 20580 20581 20582 20583 20584 20585 20586 20587 20588 20589 20590 20591 20592 20593 20594 20595 20596 20597 20598 20599 20600 20601 20602 20603 20604 20605 20606 20607 20608 20609 20610 20611 20612 20613 20614 20615 20616 20617 20618 20619 20620 20621 20622 20623 20624 20625 20626 20627 20628 20629 20630 20631 20632 20633 20634 20635 20636 20637 20638 20639 20640 20641 20642 20643 20644 20645 20646 20647 20648 20649 20650 20651 20652 20653 20654 20655 20656 20657 20658 20659 20660 20661 20662 20663 20664 20665 20666 20667 20668 20669 20670 20671 20672 20673 20674 20675 20676 20677 20678 20679 20680 20681 20682 20683 20684 20685 20686 20687 20688 20689 20690 20691 20692 20693 20694 20695 20696 20697 20698 20699 20700 20701 20702 20703 20704 20705 20706 20707 20708 20709 20710 20711 20712 20713 20714 20715 20716 20717 20718 20719 20720 20721 20722 20723 20724 20725 20726 20727 20728 20729 20730 20731 20732 20733 20734 20735 20736 20737 20738 20739 20740 20741 20742 20743 20744 20745 20746 20747 20748 20749 20750 20751 20752 20753 20754 20755 20756 20757 20758 20759 20760 20761 20762 20763 20764 20765 20766 20767 20768 20769 20770 20771 20772 20773 20774 20775 20776 20777 20778 20779 20780 20781 20782 20783 20784 20785 20786 20787 20788 20789 20790 20791 20792 20793 20794 20795 20796 20797 20798 20799 20800 20801 20802 20803 20804 20805 20806 20807 20808 20809 20810 20811 20812 20813 20814 20815 20816 20817 20818 20819 20820 20821 20822 20823 20824 20825 20826 20827 20828 20829 20830 20831 20832 20833 20834 20835 20836 20837 20838 20839 20840 20841 20842 20843 20844 20845 20846 20847 20848 20849 20850 20851 20852 20853 20854 20855 20856 20857 20858 20859 20860 20861 20862 20863 20864 20865 20866 20867 20868 20869 20870 20871 20872 20873 20874 20875 20876 20877 20878 20879 20880 20881 20882 20883 20884 20885 20886 20887 20888 20889 20890 20891 20892 20893 20894 20895 20896 20897 20898 20899 20900 20901 20902 20903 20904 20905 20906 20907 20908 20909 20910 20911 20912 20913 20914 20915 20916 20917 20918 20919 20920 20921 20922 20923 20924 20925 20926 20927 20928 20929 20930 20931 20932 20933 20934 20935 20936 20937 20938 20939 20940 20941 20942 20943 20944 20945 20946 20947 20948 20949 20950 20951 20952 20953 20954 20955 20956 20957 20958 20959 20960 20961 20962 20963 20964 20965 20966 20967 20968 20969 20970 20971 20972 20973 20974 20975 20976 20977 20978 20979 20980 20981 20982 20983 20984 20985 20986 20987 20988 20989 20990 20991 20992 20993 20994 20995 20996 20997 20998 20999 21000 21001 21002 21003 21004 21005 21006 21007 21008 21009 21010 21011 21012 21013 21014 21015 21016 21017 21018 21019 21020 21021 21022 21023 21024 21025 21026 21027 21028 21029 21030 21031 21032 21033 21034 21035 21036 21037 21038 21039 21040 21041 21042 21043 21044 21045 21046 21047 21048 21049 21050 21051 21052 21053 21054 21055 21056 21057 21058 21059 21060 21061 21062 21063 21064 21065 21066 21067 21068 21069 21070 21071 21072 21073 21074 21075 21076 21077 21078 21079 21080 21081 21082 21083 21084 21085 21086 21087 21088 21089 21090 21091 21092 21093 21094 21095 21096 21097 21098 21099 21100 21101 21102 21103 21104 21105 21106 21107 21108 21109 21110 21111 21112 21113 21114 21115 21116 21117 21118 21119 21120 21121 21122 21123 21124 21125 21126 21127 21128 21129 21130 21131 21132 21133 21134 21135 21136 21137 21138 21139 21140 21141 21142 21143 21144 21145 21146 21147 21148 21149 21150 21151 21152 21153 21154 21155 21156 21157 21158 21159 21160 21161 21162 21163 21164 21165 21166 21167 21168 21169 21170 21171 21172 21173 21174 21175 21176 21177 21178 21179 21180 21181 21182 21183 21184 21185 21186 21187 21188 21189 21190 21191 21192 21193 21194 21195 21196 21197 21198 21199 21200 21201 21202 21203 21204 21205 21206 21207 21208 21209 21210 21211 21212 21213 21214 21215 21216 21217 21218 21219 21220 21221 21222 21223 21224 21225 21226 21227 21228 21229 21230 21231 21232 21233 21234 21235 21236 21237 21238 21239 21240 21241 21242 21243 21244 21245 21246 21247 21248 21249 21250 21251 21252 21253 21254 21255 21256 21257 21258 21259 21260 21261 21262 21263 21264 21265 21266 21267 21268 21269 21270 21271 21272 21273 21274 21275 21276 21277 21278 21279 21280 21281 21282 21283 21284 21285 21286 21287 21288 21289 21290 21291 21292 21293 21294 21295 21296 21297 21298 21299 21300 21301 21302 21303 21304 21305 21306 21307 21308 21309 21310 21311 21312 21313 21314 21315 21316 21317 21318 21319 21320 21321 21322 21323 21324 21325 21326 21327 21328 21329 21330 21331 21332 21333 21334 21335 21336 21337 21338 21339 21340 21341 21342 21343 21344 21345 21346 21347 21348 21349 21350 21351 21352 21353 21354 21355 21356 21357 21358 21359 21360 21361 21362 21363 21364 21365 21366 21367 21368 21369 21370 21371 21372 21373 21374 21375 21376 21377 21378 21379 21380 21381 21382 21383 21384 21385 21386 21387 21388 21389 21390 21391 21392 21393 21394 21395 21396 21397 21398 21399 21400 21401 21402 21403 21404 21405 21406 21407 21408 21409 21410 21411 21412 21413 21414 21415 21416 21417 21418 21419 21420 21421 21422 21423 21424 21425 21426 21427 21428 21429 21430 21431 21432 21433 21434 21435 21436 21437 21438 21439 21440 21441 21442 21443 21444 21445 21446 21447 21448 21449 21450 21451 21452 21453 21454 21455 21456 21457 21458 21459 21460 21461 21462 21463 21464 21465 21466 21467 21468 21469 21470 21471 21472 21473 21474 21475 21476 21477 21478 21479 21480 21481 21482 21483 21484 21485 21486 21487 21488 21489 21490 21491 21492 21493 21494 21495 21496 21497 21498 21499 21500 21501 21502 21503 21504 21505 21506 21507 21508 21509 21510 21511 21512 21513 21514 21515 21516 21517 21518 21519 21520 21521 21522 21523 21524 21525 21526 21527 21528 21529 21530 21531 21532 21533 21534 21535 21536 21537 21538 21539 21540 21541 21542 21543 21544 21545 21546 21547 21548 21549 21550 21551 21552 21553 21554 21555 21556 21557 21558 21559 21560 21561 21562 21563 21564 21565 21566 21567 21568 21569 21570 21571 21572 21573 21574 21575 21576 21577 21578 21579 21580 21581 21582 21583 21584 21585 21586 21587 21588 21589 21590 21591 21592 21593 21594 21595 21596 21597 21598 21599 21600 21601 21602 21603 21604 21605 21606 21607 21608 21609 21610 21611 21612 21613 21614 21615 21616 21617 21618 21619 21620 21621 21622 21623 21624 21625 21626 21627 21628 21629 21630 21631 21632 21633 21634 21635 21636 21637 21638 21639 21640 21641 21642 21643 21644 21645 21646 21647 21648 21649 21650 21651 21652 21653 21654 21655 21656 21657 21658 21659 21660 21661 21662 21663 21664 21665 21666 21667 21668 21669 21670 21671 21672 21673 21674 21675 21676 21677 21678 21679 21680 21681 21682 21683 21684 21685 21686 21687 21688 21689 21690 21691 21692 21693 21694 21695 21696 21697 21698 21699 21700 21701 21702 21703 21704 21705 21706 21707 21708 21709 21710 21711 21712 21713 21714 21715 21716 21717 21718 21719 21720 21721 21722 21723 21724 21725 21726 21727 21728 21729 21730 21731 21732 21733 21734 21735 21736 21737 21738 21739 21740 21741 21742 21743 21744 21745 21746 21747 21748 21749 21750 21751 21752 21753 21754 21755 21756 21757 21758 21759 21760 21761 21762 21763 21764 21765 21766 21767 21768 21769 21770 21771 21772 21773 21774 21775 21776 21777 21778 21779 21780 21781 21782 21783 21784 21785 21786 21787 21788 21789 21790 21791 21792 21793 21794 21795 21796 21797 21798 21799 21800 21801 21802 21803 21804 21805 21806 21807 21808 21809 21810 21811 21812 21813 21814 21815 21816 21817 21818 21819 21820 21821 21822 21823 21824 21825 21826 21827 21828 21829 21830 21831 21832 21833 21834 21835 21836 21837 21838 21839 21840 21841 21842 21843 21844 21845 21846 21847 21848 21849 21850 21851 21852 21853 21854 21855 21856 21857 21858 21859 21860 21861 21862 21863 21864 21865 21866 21867 21868 21869 21870 21871 21872 21873 21874 21875 21876 21877 21878 21879 21880 21881 21882 21883 21884 21885 21886 21887 21888 21889 21890 21891 21892 21893 21894 21895 21896 21897 21898 21899 21900 21901 21902 21903 21904 21905 21906 21907 21908 21909 21910 21911 21912 21913 21914 21915 21916 21917 21918 21919 21920 21921 21922 21923 21924 21925 21926 21927 21928 21929 21930 21931 21932 21933 21934 21935 21936 21937 21938 21939 21940 21941 21942 21943 21944 21945 21946 21947 21948 21949 21950 21951 21952 21953 21954 21955 21956 21957 21958 21959 21960 21961 21962 21963 21964 21965 21966 21967 21968 21969 21970 21971 21972 21973 21974 21975 21976 21977 21978 21979 21980 21981 21982 21983 21984 21985 21986 21987 21988 21989 21990 21991 21992 21993 21994 21995 21996 21997 21998 21999 22000 22001 22002 22003 22004 22005 22006 22007 22008 22009 22010 22011 22012 22013 22014 22015 22016 22017 22018 22019 22020 22021 22022 22023 22024 22025 22026 22027 22028 22029 22030 22031 22032 22033 22034 22035 22036 22037 22038 22039 22040 22041 22042 22043 22044 22045 22046 22047 22048 22049 22050 22051 22052 22053 22054 22055 22056 22057 22058 22059 22060 22061 22062 22063 22064 22065 22066 22067 22068 22069 22070 22071 22072 22073 22074 22075 22076 22077 22078 22079 22080 22081 22082 22083 22084 22085 22086 22087 22088 22089 22090 22091 22092 22093 22094 22095 22096 22097 22098 22099 22100 22101 22102 22103 22104 22105 22106 22107 22108 22109 22110 22111 22112 22113 22114 22115 22116 22117 22118 22119 22120 22121 22122 22123 22124 22125 22126 22127 22128 22129 22130 22131 22132 22133 22134 22135 22136 22137 22138 22139 22140 22141 22142 22143 22144 22145 22146 22147 22148 22149 22150 22151 22152 22153 22154 22155 22156 22157 22158 22159 22160 22161 22162 22163 22164 22165 22166 22167 22168 22169 22170 22171 22172 22173 22174 22175 22176 22177 22178 22179 22180 22181 22182 22183 22184 22185 22186 22187 22188 22189 22190 22191 22192 22193 22194 22195 22196 22197 22198 22199 22200 22201 22202 22203 22204 22205 22206 22207 22208 22209 22210 22211 22212 22213 22214 22215 22216 22217 22218 22219 22220 22221 22222 22223 22224 22225 22226 22227 22228 22229 22230 22231 22232 22233 22234 22235 22236 22237 22238 22239 22240 22241 22242 22243 22244 22245 22246 22247 22248 22249 22250 22251 22252 22253 22254 22255 22256 22257 22258 22259 22260 22261 22262 22263 22264 22265 22266 22267 22268 22269 22270 22271 22272 22273 22274 22275 22276 22277 22278 22279 22280 22281 22282 22283 22284 22285 22286 22287 22288 22289 22290 22291 22292 22293 22294 22295 22296 22297 22298 22299 22300 22301 22302 22303 22304 22305 22306 22307 22308 22309 22310 22311 22312 22313 22314 22315 22316 22317 22318 22319 22320 22321 22322 22323 22324 22325 22326 22327 22328 22329 22330 22331 22332 22333 22334 22335 22336 22337 22338 22339 22340 22341 22342 22343 22344 22345 22346 22347 22348 22349 22350 22351 22352 22353 22354 22355 22356 22357 22358 22359 22360 22361 22362 22363 22364 22365 22366 22367 22368 22369 22370 22371 22372 22373 22374 22375 22376 22377 22378 22379 22380 22381 22382 22383 22384 22385 22386 22387 22388 22389 22390 22391 22392 22393 22394 22395 22396 22397 22398 22399 22400 22401 22402 22403 22404 22405 22406 22407 22408 22409 22410 22411 22412 22413 22414 22415 22416 22417 22418 22419 22420 22421 22422 22423 22424 22425 22426 22427 22428 22429 22430 22431 22432 22433 22434 22435 22436 22437 22438 22439 22440 22441 22442 22443 22444 22445 22446 22447 22448 22449 22450 22451 22452 22453 22454 22455 22456 22457 22458 22459 22460 22461 22462 22463 22464 22465 22466 22467 22468 22469 22470 22471 22472 22473 22474 22475 22476 22477 22478 22479 22480 22481 22482 22483 22484 22485 22486 22487 22488 22489 22490 22491 22492 22493 22494 22495 22496 22497 22498 22499 22500 22501 22502 22503 22504 22505 22506 22507 22508 22509 22510 22511 22512 22513 22514 22515 22516 22517 22518 22519 22520 22521 22522 22523 22524 22525 22526 22527 22528 22529 22530 22531 22532 22533 22534 22535 22536 22537 22538 22539 22540 22541 22542 22543 22544 22545 22546 22547 22548 22549 22550 22551 22552 22553 22554 22555 22556 22557 22558 22559 22560 22561 22562 22563 22564 22565 22566 22567 22568 22569 22570 22571 22572 22573 22574 22575 22576 22577 22578 22579 22580 22581 22582 22583 22584 22585 22586 22587 22588 22589 22590 22591 22592 22593 22594 22595 22596 22597 22598 22599 22600 22601 22602 22603 22604 22605 22606 22607 22608 22609 22610 22611 22612 22613 22614 22615 22616 22617 22618 22619 22620 22621 22622 22623 22624 22625 22626 22627 22628 22629 22630 22631 22632 22633 22634 22635 22636 22637 22638 22639 22640 22641 22642 22643 22644 22645 22646 22647 22648 22649 22650 22651 22652 22653 22654 22655 22656 22657 22658 22659 22660 22661 22662 22663 22664 22665 22666 22667 22668 22669 22670 22671 22672 22673 22674 22675 22676 22677 22678 22679 22680 22681 22682 22683 22684 22685 22686 22687 22688 22689 22690 22691 22692 22693 22694 22695 22696 22697 22698 22699 22700 22701 22702 22703 22704 22705 22706 22707 22708 22709 22710 22711 22712 22713 22714 22715 22716 22717 22718 22719 22720 22721 22722 22723 22724 22725 22726 22727 22728 22729 22730 22731 22732 22733 22734 22735 22736 22737 22738 22739 22740 22741 22742 22743 22744 22745 22746 22747 22748 22749 22750 22751 22752 22753 22754 22755 22756 22757 22758 22759 22760 22761 22762 22763 22764 22765 22766 22767 22768 22769 22770 22771 22772 22773 22774 22775 22776 22777 22778 22779 22780 22781 22782 22783 22784 22785 22786 22787 22788 22789 22790 22791 22792 22793 22794 22795 22796 22797 22798 22799 22800 22801 22802 22803 22804 22805 22806 22807 22808 22809 22810 22811 22812 22813 22814 22815 22816 22817 22818 22819 22820 22821 22822 22823 22824 22825 22826 22827 22828 22829 22830 22831 22832 22833 22834 22835 22836 22837 22838 22839 22840 22841 22842 22843 22844 22845 22846 22847 22848 22849 22850 22851 22852 22853 22854 22855 22856 22857 22858 22859 22860 22861 22862 22863 22864 22865 22866 22867 22868 22869 22870 22871 22872 22873 22874 22875 22876 22877 22878 22879 22880 22881 22882 22883 22884 22885 22886 22887 22888 22889 22890 22891 22892 22893 22894 22895 22896 22897 22898 22899 22900 22901 22902 22903 22904 22905 22906 22907 22908 22909 22910 22911 22912 22913 22914 22915 22916 22917 22918 22919 22920 22921 22922 22923 22924 22925 22926 22927 22928 22929 22930 22931 22932 22933 22934 22935 22936 22937 22938 22939 22940 22941 22942 22943 22944 22945 22946 22947 22948 22949 22950 22951 22952 22953 22954 22955 22956 22957 22958 22959 22960 22961 22962 22963 22964 22965 22966 22967 22968 22969 22970 22971 22972 22973 22974 22975 22976 22977 22978 22979 22980 22981 22982 22983 22984 22985 22986 22987 22988 22989 22990 22991 22992 22993 22994 22995 22996 22997 22998 22999 23000 23001 23002 23003 23004 23005 23006 23007 23008 23009 23010 23011 23012 23013 23014 23015 23016 23017 23018 23019 23020 23021 23022 23023 23024 23025 23026 23027 23028 23029 23030 23031 23032 23033 23034 23035 23036 23037 23038 23039 23040 23041 23042 23043 23044 23045 23046 23047 23048 23049 23050 23051 23052 23053 23054 23055 23056 23057 23058 23059 23060 23061 23062 23063 23064 23065 23066 23067 23068 23069 23070 23071 23072 23073 23074 23075 23076 23077 23078 23079 23080 23081 23082 23083 23084 23085 23086 23087 23088 23089 23090 23091 23092 23093 23094 23095 23096 23097 23098 23099 23100 23101 23102 23103 23104 23105 23106 23107 23108 23109 23110 23111 23112 23113 23114 23115 23116 23117 23118 23119 23120 23121 23122 23123 23124 23125 23126 23127 23128 23129 23130 23131 23132 23133 23134 23135 23136 23137 23138 23139 23140 23141 23142 23143 23144 23145 23146 23147 23148 23149 23150 23151 23152 23153 23154 23155 23156 23157 23158 23159 23160 23161 23162 23163 23164 23165 23166 23167 23168 23169 23170 23171 23172 23173 23174 23175 23176 23177 23178 23179 23180 23181 23182 23183 23184 23185 23186 23187 23188 23189 23190 23191 23192 23193 23194 23195 23196 23197 23198 23199 23200 23201 23202 23203 23204 23205 23206 23207 23208 23209 23210 23211 23212 23213 23214 23215 23216 23217 23218 23219 23220 23221 23222 23223 23224 23225 23226 23227 23228 23229 23230 23231 23232 23233 23234 23235 23236 23237 23238 23239 23240 23241 23242 23243 23244 23245 23246 23247 23248 23249 23250 23251 23252 23253 23254 23255 23256 23257 23258 23259 23260 23261 23262 23263 23264 23265 23266 23267 23268 23269 23270 23271 23272 23273 23274 23275 23276 23277 23278 23279 23280 23281 23282 23283 23284 23285 23286 23287 23288 23289 23290 23291 23292 23293 23294 23295 23296 23297 23298 23299 23300 23301 23302 23303 23304 23305 23306 23307 23308 23309 23310 23311 23312 23313 23314 23315 23316 23317 23318 23319 23320 23321 23322 23323 23324 23325 23326 23327 23328 23329 23330 23331 23332 23333 23334 23335 23336 23337 23338 23339 23340 23341 23342 23343 23344 23345 23346 23347 23348 23349 23350 23351 23352 23353 23354 23355 23356 23357 23358 23359 23360 23361 23362 23363 23364 23365 23366 23367 23368 23369 23370 23371 23372 23373 23374 23375 23376 23377 23378 23379 23380 23381 23382 23383 23384 23385 23386 23387 23388 23389 23390 23391 23392 23393 23394 23395 23396 23397 23398 23399 23400 23401 23402 23403 23404 23405 23406 23407 23408 23409 23410 23411 23412 23413 23414 23415 23416 23417 23418 23419 23420 23421 23422 23423 23424 23425 23426 23427 23428 23429 23430 23431 23432 23433 23434 23435 23436 23437 23438 23439 23440 23441 23442 23443 23444 23445 23446 23447 23448 23449 23450 23451 23452 23453 23454 23455 23456 23457 23458 23459 23460 23461 23462 23463 23464 23465 23466 23467 23468 23469 23470 23471 23472 23473 23474 23475 23476 23477 23478 23479 23480 23481 23482 23483 23484 23485 23486 23487 23488 23489 23490 23491 23492 23493 23494 23495 23496 23497 23498 23499 23500 23501 23502 23503 23504 23505 23506 23507 23508 23509 23510 23511 23512 23513 23514 23515 23516 23517 23518 23519 23520 23521 23522 23523 23524 23525 23526 23527 23528 23529 23530 23531 23532 23533 23534 23535 23536 23537 23538 23539 23540 23541 23542 23543 23544 23545 23546 23547 23548 23549 23550 23551 23552 23553 23554 23555 23556 23557 23558 23559 23560 23561 23562 23563 23564 23565 23566 23567 23568 23569 23570 23571 23572 23573 23574 23575 23576 23577 23578 23579 23580 23581 23582 23583 23584 23585 23586 23587 23588 23589 23590 23591 23592 23593 23594 23595 23596 23597 23598 23599 23600 23601 23602 23603 23604 23605 23606 23607 23608 23609 23610 23611 23612 23613 23614 23615 23616 23617 23618 23619 23620 23621 23622 23623 23624 23625 23626 23627 23628 23629 23630 23631 23632 23633 23634 23635 23636 23637 23638 23639 23640 23641 23642 23643 23644 23645 23646 23647 23648 23649 23650 23651 23652 23653 23654 23655 23656 23657 23658 23659 23660 23661 23662 23663 23664 23665 23666 23667 23668 23669 23670 23671 23672 23673 23674 23675 23676 23677 23678 23679 23680 23681 23682 23683 23684 23685 23686 23687 23688 23689 23690 23691 23692 23693 23694 23695 23696 23697 23698 23699 23700 23701 23702 23703 23704 23705 23706 23707 23708 23709 23710 23711 23712 23713 23714 23715 23716 23717 23718 23719 23720 23721 23722 23723 23724 23725 23726 23727 23728 23729 23730 23731 23732 23733 23734 23735 23736 23737 23738 23739 23740 23741 23742 23743 23744 23745 23746 23747 23748 23749 23750 23751 23752 23753 23754 23755 23756 23757 23758 23759 23760 23761 23762 23763 23764 23765 23766 23767 23768 23769 23770 23771 23772 23773 23774 23775 23776 23777 23778 23779 23780 23781 23782 23783 23784 23785 23786 23787 23788 23789 23790 23791 23792 23793 23794 23795 23796 23797 23798 23799 23800 23801 23802 23803 23804 23805 23806 23807 23808 23809 23810 23811 23812 23813 23814 23815 23816 23817 23818 23819 23820 23821 23822 23823 23824 23825 23826 23827 23828 23829 23830 23831 23832 23833 23834 23835 23836 23837 23838 23839 23840 23841 23842 23843 23844 23845 23846 23847 23848 23849 23850 23851 23852 23853 23854 23855 23856 23857 23858 23859 23860 23861 23862 23863 23864 23865 23866 23867 23868 23869 23870 23871 23872 23873 23874 23875 23876 23877 23878 23879 23880 23881 23882 23883 23884 23885 23886 23887 23888 23889 23890 23891 23892 23893 23894 23895 23896 23897 23898 23899 23900 23901 23902 23903 23904 23905 23906 23907 23908 23909 23910 23911 23912 23913 23914 23915 23916 23917 23918 23919 23920 23921 23922 23923 23924 23925 23926 23927 23928 23929 23930 23931 23932 23933 23934 23935 23936 23937 23938 23939 23940 23941 23942 23943 23944 23945 23946 23947 23948 23949 23950 23951 23952 23953 23954 23955 23956 23957 23958 23959 23960 23961 23962 23963 23964 23965 23966 23967 23968 23969 23970 23971 23972 23973 23974 23975 23976 23977 23978 23979 23980 23981 23982 23983 23984 23985 23986 23987 23988 23989 23990 23991 23992 23993 23994 23995 23996 23997 23998 23999 24000 24001 24002 24003 24004 24005 24006 24007 24008 24009 24010 24011 24012 24013 24014 24015 24016 24017 24018 24019 24020 24021 24022 24023 24024 24025 24026 24027 24028 24029 24030 24031 24032 24033 24034 24035 24036 24037 24038 24039 24040 24041 24042 24043 24044 24045 24046 24047 24048 24049 24050 24051 24052 24053 24054 24055 24056 24057 24058 24059 24060 24061 24062 24063 24064 24065 24066 24067 24068 24069 24070 24071 24072 24073 24074 24075 24076 24077 24078 24079 24080 24081 24082 24083 24084 24085 24086 24087 24088 24089 24090 24091 24092 24093 24094 24095 24096 24097 24098 24099 24100 24101 24102 24103 24104 24105 24106 24107 24108 24109 24110 24111 24112 24113 24114 24115 24116 24117 24118 24119 24120 24121 24122 24123 24124 24125 24126 24127 24128 24129 24130 24131 24132 24133 24134 24135 24136 24137 24138 24139 24140 24141 24142 24143 24144 24145 24146 24147 24148 24149 24150 24151 24152 24153 24154 24155 24156 24157 24158 24159 24160 24161 24162 24163 24164 24165 24166 24167 24168 24169 24170 24171 24172 24173 24174 24175 24176 24177 24178 24179 24180 24181 24182 24183 24184 24185 24186 24187 24188 24189 24190 24191 24192 24193 24194 24195 24196 24197 24198 24199 24200 24201 24202 24203 24204 24205 24206 24207 24208 24209 24210 24211 24212 24213 24214 24215 24216 24217 24218 24219 24220 24221 24222 24223 24224 24225 24226 24227 24228 24229 24230 24231 24232 24233 24234 24235 24236 24237 24238 24239 24240 24241 24242 24243 24244 24245 24246 24247 24248 24249 24250 24251 24252 24253 24254 24255 24256 24257 24258 24259 24260 24261 24262 24263 24264 24265 24266 24267 24268 24269 24270 24271 24272 24273 24274 24275 24276 24277 24278 24279 24280 24281 24282 24283 24284 24285 24286 24287 24288 24289 24290 24291 24292 24293 24294 24295 24296 24297 24298 24299 24300 24301 24302 24303 24304 24305 24306 24307 24308 24309 24310 24311 24312 24313 24314 24315 24316 24317 24318 24319 24320 24321 24322 24323 24324 24325 24326 24327 24328 24329 24330 24331 24332 24333 24334 24335 24336 24337 24338 24339 24340 24341 24342 24343 24344 24345 24346 24347 24348 24349 24350 24351 24352 24353 24354 24355 24356 24357 24358 24359 24360 24361 24362 24363 24364 24365 24366 24367 24368 24369 24370 24371 24372 24373 24374 24375 24376 24377 24378 24379 24380 24381 24382 24383 24384 24385 24386 24387 24388 24389 24390 24391 24392 24393 24394 24395 24396 24397 24398 24399 24400 24401 24402 24403 24404 24405 24406 24407 24408 24409 24410 24411 24412 24413 24414 24415 24416 24417 24418 24419 24420 24421 24422 24423 24424 24425 24426 24427 24428 24429 24430 24431 24432 24433 24434 24435 24436 24437 24438 24439 24440 24441 24442 24443 24444 24445 24446 24447 24448 24449 24450 24451 24452 24453 24454 24455 24456 24457 24458 24459 24460 24461 24462 24463 24464 24465 24466 24467 24468 24469 24470 24471 24472 24473 24474 24475 24476 24477 24478 24479 24480 24481 24482 24483 24484 24485 24486 24487 24488 24489 24490 24491 24492 24493 24494 24495 24496 24497 24498 24499 24500 24501 24502 24503 24504 24505 24506 24507 24508 24509 24510 24511 24512 24513 24514 24515 24516 24517 24518 24519 24520 24521 24522 24523 24524 24525 24526 24527 24528 24529 24530 24531 24532 24533 24534 24535 24536 24537 24538 24539 24540 24541 24542 24543 24544 24545 24546 24547 24548 24549 24550 24551 24552 24553 24554 24555 24556 24557 24558 24559 24560 24561 24562 24563 24564 24565 24566 24567 24568 24569 24570 24571 24572 24573 24574 24575 24576 24577 24578 24579 24580 24581 24582 24583 24584 24585 24586 24587 24588 24589 24590 24591 24592 24593 24594 24595 24596 24597 24598 24599 24600 24601 24602 24603 24604 24605 24606 24607 24608 24609 24610 24611 24612 24613 24614 24615 24616 24617 24618 24619 24620 24621 24622 24623 24624 24625 24626 24627 24628 24629 24630 24631 24632 24633 24634 24635 24636 24637 24638 24639 24640 24641 24642 24643 24644 24645 24646 24647 24648 24649 24650 24651 24652 24653 24654 24655 24656 24657 24658 24659 24660 24661 24662 24663 24664 24665 24666 24667 24668 24669 24670 24671 24672 24673 24674 24675 24676 24677 24678 24679 24680 24681 24682 24683 24684 24685 24686 24687 24688 24689 24690 24691 24692 24693 24694 24695 24696 24697 24698 24699 24700 24701 24702 24703 24704 24705 24706 24707 24708 24709 24710 24711 24712 24713 24714 24715 24716 24717 24718 24719 24720 24721 24722 24723 24724 24725 24726 24727 24728 24729 24730 24731 24732 24733 24734 24735 24736 24737 24738 24739 24740 24741 24742 24743 24744 24745 24746 24747 24748 24749 24750 | <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<!-- Copyright (C) 1995-2012, Free Software Foundation, Inc.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.3 or
any later version published by the Free Software Foundation; with no
Invariant Sections, with the Front-Cover Texts being "GNAT Reference
Manual", and with no Back-Cover Texts. A copy of the license is
included in the section entitled "GNU Free Documentation License". -->
<!-- Created by GNU Texinfo 5.2, http://www.gnu.org/software/texinfo/ -->
<head>
<title>GNAT Reference Manual</title>
<meta name="description" content="GNAT Reference Manual">
<meta name="keywords" content="GNAT Reference Manual">
<meta name="resource-type" content="document">
<meta name="distribution" content="global">
<meta name="Generator" content="makeinfo">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<link href="#Top" rel="start" title="Top">
<link href="#Index" rel="index" title="Index">
<link href="#SEC_Contents" rel="contents" title="Table of Contents">
<link href="dir.html#Top" rel="up" title="(dir)">
<style type="text/css">
<!--
a.summary-letter {text-decoration: none}
blockquote.smallquotation {font-size: smaller}
div.display {margin-left: 3.2em}
div.example {margin-left: 3.2em}
div.indentedblock {margin-left: 3.2em}
div.lisp {margin-left: 3.2em}
div.smalldisplay {margin-left: 3.2em}
div.smallexample {margin-left: 3.2em}
div.smallindentedblock {margin-left: 3.2em; font-size: smaller}
div.smalllisp {margin-left: 3.2em}
kbd {font-style:oblique}
pre.display {font-family: inherit}
pre.format {font-family: inherit}
pre.menu-comment {font-family: serif}
pre.menu-preformatted {font-family: serif}
pre.smalldisplay {font-family: inherit; font-size: smaller}
pre.smallexample {font-size: smaller}
pre.smallformat {font-family: inherit; font-size: smaller}
pre.smalllisp {font-size: smaller}
span.nocodebreak {white-space:nowrap}
span.nolinebreak {white-space:nowrap}
span.roman {font-family:serif; font-weight:normal}
span.sansserif {font-family:sans-serif; font-weight:normal}
ul.no-bullet {list-style: none}
-->
</style>
</head>
<body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000">
<h1 class="settitle" align="center">GNAT Reference Manual</h1>
<a name="Top"></a>
<div class="header">
<p>
Next: <a href="#About-This-Guide" accesskey="n" rel="next">About This Guide</a>, Previous: <a href="dir.html#Top" accesskey="p" rel="prev">(dir)</a>, Up: <a href="dir.html#Top" accesskey="u" rel="up">(dir)</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT-Reference-Manual"></a>
<h1 class="top">GNAT Reference Manual</h1>
<p>GNAT Reference Manual
</p>
<p>GNAT, The GNU Ada Compiler<br>
GCC version 4.8.2<br>
</p>
<p>AdaCore
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#About-This-Guide" accesskey="1">About This Guide</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Implementation-Defined-Pragmas" accesskey="2">Implementation Defined Pragmas</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Implementation-Defined-Attributes" accesskey="3">Implementation Defined Attributes</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Standard-and-Implementation-Defined-Restrictions" accesskey="4">Standard and Implementation Defined Restrictions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Implementation-Advice" accesskey="5">Implementation Advice</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Implementation-Defined-Characteristics" accesskey="6">Implementation Defined Characteristics</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Intrinsic-Subprograms" accesskey="7">Intrinsic Subprograms</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Representation-Clauses-and-Pragmas" accesskey="8">Representation Clauses and Pragmas</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Standard-Library-Routines" accesskey="9">Standard Library Routines</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#The-Implementation-of-Standard-I_002fO">The Implementation of Standard I/O</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#The-GNAT-Library">The GNAT Library</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-Other-Languages">Interfacing to Other Languages</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Specialized-Needs-Annexes">Specialized Needs Annexes</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Implementation-of-Specific-Ada-Features">Implementation of Specific Ada Features</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Obsolescent-Features">Obsolescent Features</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNU-Free-Documentation-License">GNU Free Documentation License</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Index">Index</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
— The Detailed Node Listing —
About This Guide
</pre></th></tr><tr><td align="left" valign="top">• <a href="#What-This-Reference-Manual-Contains">What This Reference Manual Contains</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Related-Information">Related Information</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Implementation Defined Pragmas
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Pragma-Abort_005fDefer">Pragma Abort_Defer</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f83">Pragma Ada_83</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f95">Pragma Ada_95</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f05">Pragma Ada_05</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f2005">Pragma Ada_2005</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f12">Pragma Ada_12</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f2012">Pragma Ada_2012</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Annotate">Pragma Annotate</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Assert">Pragma Assert</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Assertion_005fPolicy">Pragma Assertion_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Assume_005fNo_005fInvalid_005fValues">Pragma Assume_No_Invalid_Values</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Attribute_005fDefinition">Pragma Attribute_Definition</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ast_005fEntry">Pragma Ast_Entry</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-C_005fPass_005fBy_005fCopy">Pragma C_Pass_By_Copy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check">Pragma Check</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check_005fFloat_005fOverflow">Pragma Check_Float_Overflow</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check_005fName">Pragma Check_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Comment">Pragma Comment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Common_005fObject">Pragma Common_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Compile_005fTime_005fError">Pragma Compile_Time_Error</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Compile_005fTime_005fWarning">Pragma Compile_Time_Warning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Compiler_005fUnit">Pragma Compiler_Unit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Complete_005fRepresentation">Pragma Complete_Representation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Complex_005fRepresentation">Pragma Complex_Representation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Contract_005fCase">Pragma Contract_Case</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Convention_005fIdentifier">Pragma Convention_Identifier</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fClass">Pragma CPP_Class</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fConstructor">Pragma CPP_Constructor</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fVirtual">Pragma CPP_Virtual</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fVtable">Pragma CPP_Vtable</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPU">Pragma CPU</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Debug">Pragma Debug</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Debug_005fPolicy">Pragma Debug_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Default_005fStorage_005fPool">Pragma Default_Storage_Pool</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Detect_005fBlocking">Pragma Detect_Blocking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Dispatching_005fDomain">Pragma Dispatching_Domain</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Elaboration_005fChecks">Pragma Elaboration_Checks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Eliminate">Pragma Eliminate</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fException">Pragma Export_Exception</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fFunction">Pragma Export_Function</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fObject">Pragma Export_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fProcedure">Pragma Export_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fValue">Pragma Export_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fValued_005fProcedure">Pragma Export_Valued_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Extend_005fSystem">Pragma Extend_System</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Extensions_005fAllowed">Pragma Extensions_Allowed</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-External">Pragma External</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-External_005fName_005fCasing">Pragma External_Name_Casing</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Fast_005fMath">Pragma Fast_Math</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Favor_005fTop_005fLevel">Pragma Favor_Top_Level</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Finalize_005fStorage_005fOnly">Pragma Finalize_Storage_Only</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Float_005fRepresentation">Pragma Float_Representation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ident">Pragma Ident</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Implementation_005fDefined">Pragma Implementation_Defined</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Implemented">Pragma Implemented</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Implicit_005fPacking">Pragma Implicit_Packing</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fException">Pragma Import_Exception</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fFunction">Pragma Import_Function</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fObject">Pragma Import_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fProcedure">Pragma Import_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fValued_005fProcedure">Pragma Import_Valued_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Independent">Pragma Independent</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Independent_005fComponents">Pragma Independent_Components</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Initialize_005fScalars">Pragma Initialize_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Inline_005fAlways">Pragma Inline_Always</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Inline_005fGeneric">Pragma Inline_Generic</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interface">Pragma Interface</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interface_005fName">Pragma Interface_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interrupt_005fHandler">Pragma Interrupt_Handler</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interrupt_005fState">Pragma Interrupt_State</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Invariant">Pragma Invariant</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Keep_005fNames">Pragma Keep_Names</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-License">Pragma License</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Link_005fWith">Pragma Link_With</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fAlias">Pragma Linker_Alias</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fConstructor">Pragma Linker_Constructor</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fDestructor">Pragma Linker_Destructor</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fSection">Pragma Linker_Section</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Long_005fFloat">Pragma Long_Float</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Loop_005fOptimize">Pragma Loop_Optimize</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Machine_005fAttribute">Pragma Machine_Attribute</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Main">Pragma Main</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Main_005fStorage">Pragma Main_Storage</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fBody">Pragma No_Body</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fInline">Pragma No_Inline</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fReturn">Pragma No_Return</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fStrict_005fAliasing">Pragma No_Strict_Aliasing </a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Normalize_005fScalars">Pragma Normalize_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Obsolescent">Pragma Obsolescent</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Optimize_005fAlignment">Pragma Optimize_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ordered">Pragma Ordered</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Overflow_005fMode">Pragma Overflow_Mode</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Partition_005fElaboration_005fPolicy">Pragma Partition_Elaboration_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Passive">Pragma Passive</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Persistent_005fBSS">Pragma Persistent_BSS</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Polling">Pragma Polling</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Postcondition">Pragma Postcondition</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Precondition">Pragma Precondition</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Preelaborable_005fInitialization">Pragma Preelaborable_Initialization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Priority_005fSpecific_005fDispatching">Pragma Priority_Specific_Dispatching</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Profile-_0028Ravenscar_0029">Pragma Profile (Ravenscar)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Profile-_0028Restricted_0029">Pragma Profile (Restricted)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Profile-_0028Rational_0029">Pragma Profile (Rational)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Psect_005fObject">Pragma Psect_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Pure_005fFunction">Pragma Pure_Function</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Relative_005fDeadline">Pragma Relative_Deadline</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Remote_005fAccess_005fType">Pragma Remote_Access_Type</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Restriction_005fWarnings">Pragma Restriction_Warnings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Shared">Pragma Shared</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Short_005fCircuit_005fAnd_005fOr">Pragma Short_Circuit_And_Or</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Short_005fDescriptors">Pragma Short_Descriptors</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Simple_005fStorage_005fPool_005fType">Pragma Simple_Storage_Pool_Type</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Source_005fFile_005fName">Pragma Source_File_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Source_005fFile_005fName_005fProject">Pragma Source_File_Name_Project</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Source_005fReference">Pragma Source_Reference</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Static_005fElaboration_005fDesired">Pragma Static_Elaboration_Desired</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Stream_005fConvert">Pragma Stream_Convert</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Style_005fChecks">Pragma Style_Checks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Subtitle">Pragma Subtitle</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress">Pragma Suppress</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress_005fAll">Pragma Suppress_All</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress_005fException_005fLocations">Pragma Suppress_Exception_Locations</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress_005fInitialization">Pragma Suppress_Initialization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Task_005fInfo">Pragma Task_Info</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Task_005fName">Pragma Task_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Task_005fStorage">Pragma Task_Storage</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Test_005fCase">Pragma Test_Case</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Thread_005fLocal_005fStorage">Pragma Thread_Local_Storage</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Time_005fSlice">Pragma Time_Slice</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Title">Pragma Title</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unchecked_005fUnion">Pragma Unchecked_Union</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unimplemented_005fUnit">Pragma Unimplemented_Unit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Universal_005fAliasing">Pragma Universal_Aliasing </a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Universal_005fData">Pragma Universal_Data</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unmodified">Pragma Unmodified</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unreferenced">Pragma Unreferenced</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unreferenced_005fObjects">Pragma Unreferenced_Objects</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unreserve_005fAll_005fInterrupts">Pragma Unreserve_All_Interrupts</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unsuppress">Pragma Unsuppress</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Use_005fVADS_005fSize">Pragma Use_VADS_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Validity_005fChecks">Pragma Validity_Checks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Volatile">Pragma Volatile</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Warnings">Pragma Warnings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Weak_005fExternal">Pragma Weak_External</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Wide_005fCharacter_005fEncoding">Pragma Wide_Character_Encoding</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Implementation Defined Attributes
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Abort_005fSignal">Abort_Signal</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Address_005fSize">Address_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Asm_005fInput">Asm_Input</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Asm_005fOutput">Asm_Output</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#AST_005fEntry">AST_Entry</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Bit">Bit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Bit_005fPosition">Bit_Position</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Compiler_005fVersion">Compiler_Version</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Code_005fAddress">Code_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Default_005fBit_005fOrder">Default_Bit_Order</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Descriptor_005fSize">Descriptor_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elaborated">Elaborated</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elab_005fBody">Elab_Body</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elab_005fSpec">Elab_Spec</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elab_005fSubp_005fBody">Elab_Subp_Body</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Emax">Emax</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enabled">Enabled</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enum_005fRep">Enum_Rep</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enum_005fVal">Enum_Val</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Epsilon">Epsilon</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Fixed_005fValue">Fixed_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Has_005fAccess_005fValues">Has_Access_Values</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Has_005fDiscriminants">Has_Discriminants</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Img">Img</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Integer_005fValue">Integer_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Invalid_005fValue">Invalid_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Large">Large</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Machine_005fSize">Machine_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Mantissa">Mantissa</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fInterrupt_005fPriority">Max_Interrupt_Priority</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fPriority">Max_Priority</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Maximum_005fAlignment">Maximum_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Mechanism_005fCode">Mechanism_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Null_005fParameter">Null_Parameter</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Object_005fSize">Object_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Passed_005fBy_005fReference">Passed_By_Reference</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pool_005fAddress">Pool_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Range_005fLength">Range_Length</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Result">Result</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Safe_005fEmax">Safe_Emax</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Safe_005fLarge">Safe_Large</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Scalar_005fStorage_005fOrder">Scalar_Storage_Order</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Simple_005fStorage_005fPool">Simple_Storage_Pool</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Small">Small</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Storage_005fUnit">Storage_Unit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Stub_005fType">Stub_Type</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_005fAllocator_005fAlignment">System_Allocator_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Target_005fName">Target_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Tick">Tick</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#To_005fAddress">To_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Type_005fClass">Type_Class</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#UET_005fAddress">UET_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Unconstrained_005fArray">Unconstrained_Array</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Universal_005fLiteral_005fString">Universal_Literal_String</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Unrestricted_005fAccess">Unrestricted_Access</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Valid_005fScalars">Valid_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#VADS_005fSize">VADS_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Value_005fSize">Value_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wchar_005fT_005fSize">Wchar_T_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Word_005fSize">Word_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Standard and Implementation Defined Restrictions
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Partition_002dWide-Restrictions">Partition-Wide Restrictions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Program-Unit-Level-Restrictions">Program Unit Level Restrictions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Partition-Wide Restrictions
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Immediate_005fReclamation">Immediate_Reclamation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fAsynchronous_005fSelect_005fNesting">Max_Asynchronous_Select_Nesting</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fEntry_005fQueue_005fLength">Max_Entry_Queue_Length</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fProtected_005fEntries">Max_Protected_Entries</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fSelect_005fAlternatives">Max_Select_Alternatives</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fStorage_005fAt_005fBlocking">Max_Storage_At_Blocking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fTask_005fEntries">Max_Task_Entries</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fTasks">Max_Tasks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAbort_005fStatements">No_Abort_Statements</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAccess_005fParameter_005fAllocators">No_Access_Parameter_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAccess_005fSubprograms">No_Access_Subprograms</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAllocators">No_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAnonymous_005fAllocators">No_Anonymous_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fCalendar">No_Calendar</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fCoextensions">No_Coextensions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDefault_005fInitialization">No_Default_Initialization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDelay">No_Delay</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDependence">No_Dependence</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDirect_005fBoolean_005fOperators">No_Direct_Boolean_Operators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDispatch">No_Dispatch</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDispatching_005fCalls">No_Dispatching_Calls</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDynamic_005fAttachment">No_Dynamic_Attachment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDynamic_005fPriorities">No_Dynamic_Priorities</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode">No_Entry_Calls_In_Elaboration_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fEnumeration_005fMaps">No_Enumeration_Maps</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fException_005fHandlers">No_Exception_Handlers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fException_005fPropagation">No_Exception_Propagation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fException_005fRegistration">No_Exception_Registration</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fExceptions">No_Exceptions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fFinalization">No_Finalization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fFixed_005fPoint">No_Fixed_Point</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fFloating_005fPoint">No_Floating_Point</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fConditionals">No_Implicit_Conditionals</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fDynamic_005fCode">No_Implicit_Dynamic_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fHeap_005fAllocations">No_Implicit_Heap_Allocations</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fLoops">No_Implicit_Loops</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fInitialize_005fScalars">No_Initialize_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fIO">No_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fLocal_005fAllocators">No_Local_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fLocal_005fProtected_005fObjects">No_Local_Protected_Objects</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fLocal_005fTiming_005fEvents">No_Local_Timing_Events</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fNested_005fFinalization">No_Nested_Finalization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fProtected_005fType_005fAllocators">No_Protected_Type_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fProtected_005fTypes">No_Protected_Types</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fRecursion">No_Recursion</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fReentrancy">No_Reentrancy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fRelative_005fDelay">No_Relative_Delay</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fRequeue_005fStatements">No_Requeue_Statements</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSecondary_005fStack">No_Secondary_Stack</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSelect_005fStatements">No_Select_Statements</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSpecific_005fTermination_005fHandlers">No_Specific_Termination_Handlers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSpecification_005fof_005fAspect">No_Specification_of_Aspect</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStandard_005fAllocators_005fAfter_005fElaboration">No_Standard_Allocators_After_Elaboration</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStandard_005fStorage_005fPools">No_Standard_Storage_Pools</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStream_005fOptimizations">No_Stream_Optimizations</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStreams">No_Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fAllocators">No_Task_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fAttributes_005fPackage">No_Task_Attributes_Package</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fHierarchy">No_Task_Hierarchy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fTermination">No_Task_Termination</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTasking">No_Tasking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTerminate_005fAlternatives">No_Terminate_Alternatives</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fUnchecked_005fAccess">No_Unchecked_Access</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Simple_005fBarriers">Simple_Barriers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Static_005fPriorities">Static_Priorities</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Static_005fStorage_005fSize">Static_Storage_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Program Unit Level Restrictions
</pre></th></tr><tr><td align="left" valign="top">• <a href="#No_005fElaboration_005fCode">No_Elaboration_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fEntry_005fQueue">No_Entry_Queue</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fAspect_005fSpecifications">No_Implementation_Aspect_Specifications</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fAttributes">No_Implementation_Attributes</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fIdentifiers">No_Implementation_Identifiers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fPragmas">No_Implementation_Pragmas</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fRestrictions">No_Implementation_Restrictions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fUnits">No_Implementation_Units</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fAliasing">No_Implicit_Aliasing</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fObsolescent_005fFeatures">No_Obsolescent_Features</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fWide_005fCharacters">No_Wide_Characters</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#SPARK">SPARK</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
The Implementation of Standard I/O
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Standard-I_002fO-Packages">Standard I/O Packages</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#FORM-Strings">FORM Strings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Direct_005fIO">Direct_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Sequential_005fIO">Sequential_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO">Text_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fText_005fIO">Wide_Text_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fWide_005fText_005fIO">Wide_Wide_Text_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Stream_005fIO">Stream_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text-Translation">Text Translation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Shared-Files">Shared Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Filenames-encoding">Filenames encoding</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Open-Modes">Open Modes</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Operations-on-C-Streams">Operations on C Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-C-Streams">Interfacing to C Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
The GNAT Library
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029">Ada.Characters.Latin_9 (a-chlat9.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029">Ada.Characters.Wide_Latin_1 (a-cwila1.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029">Ada.Characters.Wide_Latin_9 (a-cwila9.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029">Ada.Characters.Wide_Wide_Latin_1 (a-chzla1.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029">Ada.Characters.Wide_Wide_Latin_9 (a-chzla9.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029">Ada.Containers.Formal_Doubly_Linked_Lists (a-cfdlli.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029">Ada.Containers.Formal_Hashed_Maps (a-cfhama.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029">Ada.Containers.Formal_Hashed_Sets (a-cfhase.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029">Ada.Containers.Formal_Ordered_Maps (a-cforma.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029">Ada.Containers.Formal_Ordered_Sets (a-cforse.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029">Ada.Containers.Formal_Vectors (a-cofove.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029">Ada.Command_Line.Environment (a-colien.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029">Ada.Command_Line.Remove (a-colire.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029">Ada.Command_Line.Response_File (a-clrefi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029">Ada.Direct_IO.C_Streams (a-diocst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029">Ada.Exceptions.Is_Null_Occurrence (a-einuoc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029">Ada.Exceptions.Last_Chance_Handler (a-elchha.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029">Ada.Exceptions.Traceback (a-exctra.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029">Ada.Sequential_IO.C_Streams (a-siocst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029">Ada.Streams.Stream_IO.C_Streams (a-ssicst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029">Ada.Strings.Unbounded.Text_IO (a-suteio.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029">Ada.Strings.Wide_Unbounded.Wide_Text_IO (a-swuwti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029">Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO (a-szuzti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029">Ada.Text_IO.C_Streams (a-tiocst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029">Ada.Text_IO.Reset_Standard_Files (a-tirsfi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029">Ada.Wide_Characters.Unicode (a-wichun.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029">Ada.Wide_Text_IO.C_Streams (a-wtcstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029">Ada.Wide_Text_IO.Reset_Standard_Files (a-wrstfi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029">Ada.Wide_Wide_Characters.Unicode (a-zchuni.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029">Ada.Wide_Wide_Text_IO.C_Streams (a-ztcstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029">Ada.Wide_Wide_Text_IO.Reset_Standard_Files (a-zrstfi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec-_0028g_002daltive_002eads_0029">GNAT.Altivec (g-altive.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029">GNAT.Altivec.Conversions (g-altcon.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029">GNAT.Altivec.Vector_Operations (g-alveop.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029">GNAT.Altivec.Vector_Types (g-alvety.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029">GNAT.Altivec.Vector_Views (g-alvevi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029">GNAT.Array_Split (g-arrspl.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029">GNAT.AWK (g-awk.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029">GNAT.Bounded_Buffers (g-boubuf.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029">GNAT.Bounded_Mailboxes (g-boumai.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029">GNAT.Bubble_Sort (g-bubsor.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029">GNAT.Bubble_Sort_A (g-busora.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029">GNAT.Bubble_Sort_G (g-busorg.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029">GNAT.Byte_Order_Mark (g-byorma.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029">GNAT.Byte_Swapping (g-bytswa.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCalendar-_0028g_002dcalend_002eads_0029">GNAT.Calendar (g-calend.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029">GNAT.Calendar.Time_IO (g-catiio.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029">GNAT.Case_Util (g-casuti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCGI-_0028g_002dcgi_002eads_0029">GNAT.CGI (g-cgi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029">GNAT.CGI.Cookie (g-cgicoo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029">GNAT.CGI.Debug (g-cgideb.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029">GNAT.Command_Line (g-comlin.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029">GNAT.Compiler_Version (g-comver.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029">GNAT.Ctrl_C (g-ctrl_c.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029">GNAT.CRC32 (g-crc32.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029">GNAT.Current_Exception (g-curexc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029">GNAT.Debug_Pools (g-debpoo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029">GNAT.Debug_Utilities (g-debuti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029">GNAT.Directory_Operations (g-dirope.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029">GNAT.Directory_Operations.Iteration (g-diopit.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029">GNAT.Dynamic_HTables (g-dynhta.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029">GNAT.Dynamic_Tables (g-dyntab.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029">GNAT.Exception_Actions (g-excact.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029">GNAT.Exception_Traces (g-exctra.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029">GNAT.Exceptions (g-except.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eExpect-_0028g_002dexpect_002eads_0029">GNAT.Expect (g-expect.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029">GNAT.Expect.TTY (g-exptty.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029">GNAT.Float_Control (g-flocon.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029">GNAT.Heap_Sort (g-heasor.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029">GNAT.Heap_Sort_A (g-hesora.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029">GNAT.Heap_Sort_G (g-hesorg.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHTable-_0028g_002dhtable_002eads_0029">GNAT.HTable (g-htable.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eIO-_0028g_002dio_002eads_0029">GNAT.IO (g-io.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029">GNAT.IO_Aux (g-io_aux.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029">GNAT.Lock_Files (g-locfil.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029">GNAT.MBBS_Discrete_Random (g-mbdira.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029">GNAT.MBBS_Float_Random (g-mbflra.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMD5-_0028g_002dmd5_002eads_0029">GNAT.MD5 (g-md5.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029">GNAT.Memory_Dump (g-memdum.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029">GNAT.Most_Recent_Exception (g-moreex.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029">GNAT.OS_Lib (g-os_lib.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029">GNAT.Perfect_Hash_Generators (g-pehage.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029">GNAT.Random_Numbers (g-rannum.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029">GNAT.Regexp (g-regexp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRegistry-_0028g_002dregist_002eads_0029">GNAT.Registry (g-regist.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029">GNAT.Regpat (g-regpat.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029">GNAT.Secondary_Stack_Info (g-sestin.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029">GNAT.Semaphores (g-semaph.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029">GNAT.Serial_Communications (g-sercom.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA1-_0028g_002dsha1_002eads_0029">GNAT.SHA1 (g-sha1.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA224-_0028g_002dsha224_002eads_0029">GNAT.SHA224 (g-sha224.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA256-_0028g_002dsha256_002eads_0029">GNAT.SHA256 (g-sha256.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA384-_0028g_002dsha384_002eads_0029">GNAT.SHA384 (g-sha384.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA512-_0028g_002dsha512_002eads_0029">GNAT.SHA512 (g-sha512.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSignals-_0028g_002dsignal_002eads_0029">GNAT.Signals (g-signal.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSockets-_0028g_002dsocket_002eads_0029">GNAT.Sockets (g-socket.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029">GNAT.Source_Info (g-souinf.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029">GNAT.Spelling_Checker (g-speche.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029">GNAT.Spelling_Checker_Generic (g-spchge.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029">GNAT.Spitbol.Patterns (g-spipat.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029">GNAT.Spitbol (g-spitbo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029">GNAT.Spitbol.Table_Boolean (g-sptabo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSSE-_0028g_002dsse_002eads_0029">GNAT.SSE (g-sse.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029">GNAT.SSE.Vector_Types (g-ssvety.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eStrings-_0028g_002dstring_002eads_0029">GNAT.Strings (g-string.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029">GNAT.String_Split (g-strspl.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTable-_0028g_002dtable_002eads_0029">GNAT.Table (g-table.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029">GNAT.Task_Lock (g-tasloc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029">GNAT.Threads (g-thread.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029">GNAT.Time_Stamp (g-timsta.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029">GNAT.Traceback (g-traceb.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029">GNAT.Traceback.Symbolic (g-trasym.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029">GNAT.UTF_32 (g-utf_32.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029">GNAT.UTF_32_Spelling_Checker (g-u3spch.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029">GNAT.Wide_Spelling_Checker (g-wispch.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029">GNAT.Wide_String_Split (g-wistsp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029">GNAT.Wide_Wide_Spelling_Checker (g-zspche.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029">GNAT.Wide_Wide_String_Split (g-zistsp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029">Interfaces.C.Extensions (i-cexten.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029">Interfaces.C.Streams (i-cstrea.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029">Interfaces.CPP (i-cpp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029">Interfaces.Packed_Decimal (i-pacdec.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029">Interfaces.VxWorks (i-vxwork.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">Interfaces.VxWorks.IO (i-vxwoio.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029">System.Address_Image (s-addima.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eAssertions-_0028s_002dassert_002eads_0029">System.Assertions (s-assert.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eMemory-_0028s_002dmemory_002eads_0029">System.Memory (s-memory.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029">System.Partition_Interface (s-parint.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029">System.Pool_Global (s-pooglo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029">System.Pool_Local (s-pooloc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eRestrictions-_0028s_002drestri_002eads_0029">System.Restrictions (s-restri.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eRident-_0028s_002drident_002eads_0029">System.Rident (s-rident.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029">System.Strings.Stream_Ops (s-ststop.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029">System.Task_Info (s-tasinf.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029">System.Wch_Cnv (s-wchcnv.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029">System.Wch_Con (s-wchcon.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Text_IO
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Text_005fIO-Stream-Pointer-Positioning">Text_IO Stream Pointer Positioning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO-Reading-and-Writing-Non_002dRegular-Files">Text_IO Reading and Writing Non-Regular Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Get_005fImmediate">Get_Immediate</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Treating-Text_005fIO-Files-as-Streams">Treating Text_IO Files as Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO-Extensions">Text_IO Extensions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO-Facilities-for-Unbounded-Strings">Text_IO Facilities for Unbounded Strings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Wide_Text_IO
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Wide_005fText_005fIO-Stream-Pointer-Positioning">Wide_Text_IO Stream Pointer Positioning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files">Wide_Text_IO Reading and Writing Non-Regular Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Wide_Wide_Text_IO
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Wide_005fWide_005fText_005fIO-Stream-Pointer-Positioning">Wide_Wide_Text_IO Stream Pointer Positioning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fWide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files">Wide_Wide_Text_IO Reading and Writing Non-Regular Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Interfacing to Other Languages
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Interfacing-to-C">Interfacing to C</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-C_002b_002b">Interfacing to C++</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-COBOL">Interfacing to COBOL</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-Fortran">Interfacing to Fortran</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-non_002dGNAT-Ada-code">Interfacing to non-GNAT Ada code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Specialized Needs Annexes
Implementation of Specific Ada Features
</pre></th></tr><tr><td align="left" valign="top">• <a href="#Machine-Code-Insertions">Machine Code Insertions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT-Implementation-of-Tasking">GNAT Implementation of Tasking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT-Implementation-of-Shared-Passive-Packages">GNAT Implementation of Shared Passive Packages</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Code-Generation-for-Array-Aggregates">Code Generation for Array Aggregates</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#The-Size-of-Discriminated-Records-with-Default-Discriminants">The Size of Discriminated Records with Default Discriminants</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Strict-Conformance-to-the-Ada-Reference-Manual">Strict Conformance to the Ada Reference Manual</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Implementation of Ada 2012 Features
Obsolescent Features
GNU Free Documentation License
Index
</pre></th></tr></table>
<hr>
<a name="About-This-Guide"></a>
<div class="header">
<p>
Next: <a href="#Implementation-Defined-Pragmas" accesskey="n" rel="next">Implementation Defined Pragmas</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="About-This-Guide-1"></a>
<h2 class="unnumbered">About This Guide</h2>
<p>This manual contains useful information in writing programs using the
GNAT compiler. It includes information on implementation dependent
characteristics of GNAT, including all the information required by
Annex M of the Ada language standard.
</p>
<p>GNAT implements Ada 95 and Ada 2005, and it may also be invoked in
Ada 83 compatibility mode.
By default, GNAT assumes Ada 2005,
but you can override with a compiler switch
to explicitly specify the language version.
(Please refer to <a href="gnat_ugn.html#Compiling-Different-Versions-of-Ada">Compiling Different Versions of Ada</a> in <cite>GNAT User’s Guide</cite>, for details on these switches.)
Throughout this manual, references to “Ada” without a year suffix
apply to both the Ada 95 and Ada 2005 versions of the language.
</p>
<p>Ada is designed to be highly portable.
In general, a program will have the same effect even when compiled by
different compilers on different platforms.
However, since Ada is designed to be used in a
wide variety of applications, it also contains a number of system
dependent features to be used in interfacing to the external world.
<a name="index-Implementation_002ddependent-features"></a>
<a name="index-Portability"></a>
</p>
<p>Note: Any program that makes use of implementation-dependent features
may be non-portable. You should follow good programming practice and
isolate and clearly document any sections of your program that make use
of these features in a non-portable manner.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#What-This-Reference-Manual-Contains" accesskey="1">What This Reference Manual Contains</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Conventions" accesskey="2">Conventions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Related-Information" accesskey="3">Related Information</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="What-This-Reference-Manual-Contains"></a>
<div class="header">
<p>
Next: <a href="#Conventions" accesskey="n" rel="next">Conventions</a>, Previous: <a href="#Index" accesskey="p" rel="prev">Index</a>, Up: <a href="#About-This-Guide" accesskey="u" rel="up">About This Guide</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="What-This-Reference-Manual-Contains-1"></a>
<h3 class="unnumberedsec">What This Reference Manual Contains</h3>
<p>This reference manual contains the following chapters:
</p>
<ul>
<li> <a href="#Implementation-Defined-Pragmas">Implementation Defined Pragmas</a>, lists GNAT implementation-dependent
pragmas, which can be used to extend and enhance the functionality of the
compiler.
</li><li> <a href="#Implementation-Defined-Attributes">Implementation Defined Attributes</a>, lists GNAT
implementation-dependent attributes, which can be used to extend and
enhance the functionality of the compiler.
</li><li> <a href="#Standard-and-Implementation-Defined-Restrictions">Standard and Implementation Defined Restrictions</a>, lists GNAT
implementation-dependent restrictions, which can be used to extend and
enhance the functionality of the compiler.
</li><li> <a href="#Implementation-Advice">Implementation Advice</a>, provides information on generally
desirable behavior which are not requirements that all compilers must
follow since it cannot be provided on all systems, or which may be
undesirable on some systems.
</li><li> <a href="#Implementation-Defined-Characteristics">Implementation Defined Characteristics</a>, provides a guide to
minimizing implementation dependent features.
</li><li> <a href="#Intrinsic-Subprograms">Intrinsic Subprograms</a>, describes the intrinsic subprograms
implemented by GNAT, and how they can be imported into user
application programs.
</li><li> <a href="#Representation-Clauses-and-Pragmas">Representation Clauses and Pragmas</a>, describes in detail the
way that GNAT represents data, and in particular the exact set
of representation clauses and pragmas that is accepted.
</li><li> <a href="#Standard-Library-Routines">Standard Library Routines</a>, provides a listing of packages and a
brief description of the functionality that is provided by Ada’s
extensive set of standard library routines as implemented by GNAT.
</li><li> <a href="#The-Implementation-of-Standard-I_002fO">The Implementation of Standard I/O</a>, details how the GNAT
implementation of the input-output facilities.
</li><li> <a href="#The-GNAT-Library">The GNAT Library</a>, is a catalog of packages that complement
the Ada predefined library.
</li><li> <a href="#Interfacing-to-Other-Languages">Interfacing to Other Languages</a>, describes how programs
written in Ada using GNAT can be interfaced to other programming
languages.
<p><a href="#Specialized-Needs-Annexes">Specialized Needs Annexes</a>, describes the GNAT implementation of all
of the specialized needs annexes.
</p>
</li><li> <a href="#Implementation-of-Specific-Ada-Features">Implementation of Specific Ada Features</a>, discusses issues related
to GNAT’s implementation of machine code insertions, tasking, and several
other features.
</li><li> <a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a>, describes the status of the
GNAT implementation of the Ada 2012 language standard.
</li><li> <a href="#Obsolescent-Features">Obsolescent Features</a> documents implementation dependent features,
including pragmas and attributes, which are considered obsolescent, since
there are other preferred ways of achieving the same results. These
obsolescent forms are retained for backwards compatibility.
</li></ul>
<a name="index-Ada-95-Language-Reference-Manual"></a>
<a name="index-Ada-2005-Language-Reference-Manual"></a>
<p>This reference manual assumes a basic familiarity with the Ada 95 language, as
described in the International Standard ANSI/ISO/IEC-8652:1995,
January 1995.
It does not require knowledge of the new features introduced by Ada 2005,
(officially known as ISO/IEC 8652:1995 with Technical Corrigendum 1
and Amendment 1).
Both reference manuals are included in the GNAT documentation
package.
</p>
<hr>
<a name="Conventions"></a>
<div class="header">
<p>
Next: <a href="#Related-Information" accesskey="n" rel="next">Related Information</a>, Previous: <a href="#What-This-Reference-Manual-Contains" accesskey="p" rel="prev">What This Reference Manual Contains</a>, Up: <a href="#About-This-Guide" accesskey="u" rel="up">About This Guide</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Conventions-1"></a>
<h3 class="unnumberedsec">Conventions</h3>
<a name="index-Conventions_002c-typographical"></a>
<a name="index-Typographical-conventions"></a>
<p>Following are examples of the typographical and graphic conventions used
in this guide:
</p>
<ul>
<li> <code>Functions</code>, <code>utility program names</code>, <code>standard names</code>,
and <code>classes</code>.
</li><li> <code>Option flags</code>
</li><li> <samp>File names</samp>, ‘<samp>button names</samp>’, and ‘<samp>field names</samp>’.
</li><li> <code>Variables</code>, <code>environment variables</code>, and <var>metasyntactic
variables</var>.
</li><li> <em>Emphasis</em>.
</li><li> [optional information or parameters]
</li><li> Examples are described by text
<div class="smallexample">
<pre class="smallexample">and then shown this way.
</pre></div>
</li></ul>
<p>Commands that are entered by the user are preceded in this manual by the
characters ‘<samp>$ </samp>’ (dollar sign followed by space). If your system uses this
sequence as a prompt, then the commands will appear exactly as you see them
in the manual. If your system uses some other prompt, then the command will
appear with the ‘<samp>$</samp>’ replaced by whatever prompt character you are using.
</p>
<hr>
<a name="Related-Information"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Abort_005fDefer" accesskey="n" rel="next">Pragma Abort_Defer</a>, Previous: <a href="#Conventions" accesskey="p" rel="prev">Conventions</a>, Up: <a href="#About-This-Guide" accesskey="u" rel="up">About This Guide</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Related-Information-1"></a>
<h3 class="unnumberedsec">Related Information</h3>
<p>See the following documents for further information on GNAT:
</p>
<ul>
<li> See <a href="gnat_ugn.html#Top">About This Guide</a> in <cite>GNAT User’s Guide</cite>, which provides information on how to use the
GNAT compiler system.
</li><li> <cite>Ada 95 Reference Manual</cite>, which contains all reference
material for the Ada 95 programming language.
</li><li> <cite>Ada 95 Annotated Reference Manual</cite>, which is an annotated version
of the Ada 95 standard. The annotations describe
detailed aspects of the design decision, and in particular contain useful
sections on Ada 83 compatibility.
</li><li> <cite>Ada 2005 Reference Manual</cite>, which contains all reference
material for the Ada 2005 programming language.
</li><li> <cite>Ada 2005 Annotated Reference Manual</cite>, which is an annotated version
of the Ada 2005 standard. The annotations describe
detailed aspects of the design decision, and in particular contain useful
sections on Ada 83 and Ada 95 compatibility.
</li><li> <cite>DEC Ada, Technical Overview and Comparison on DIGITAL Platforms</cite>,
which contains specific information on compatibility between GNAT and
DEC Ada 83 systems.
</li><li> <cite>DEC Ada, Language Reference Manual, part number AA-PYZAB-TK</cite> which
describes in detail the pragmas and attributes provided by the DEC Ada 83
compiler system.
</li></ul>
<hr>
<a name="Implementation-Defined-Pragmas"></a>
<div class="header">
<p>
Next: <a href="#Implementation-Defined-Attributes" accesskey="n" rel="next">Implementation Defined Attributes</a>, Previous: <a href="#About-This-Guide" accesskey="p" rel="prev">About This Guide</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Implementation-Defined-Pragmas-1"></a>
<h2 class="chapter">1 Implementation Defined Pragmas</h2>
<p>Ada defines a set of pragmas that can be used to supply additional
information to the compiler. These language defined pragmas are
implemented in GNAT and work as described in the Ada Reference Manual.
</p>
<p>In addition, Ada allows implementations to define additional pragmas
whose meaning is defined by the implementation. GNAT provides a number
of these implementation-defined pragmas, which can be used to extend
and enhance the functionality of the compiler. This section of the GNAT
Reference Manual describes these additional pragmas.
</p>
<p>Note that any program using these pragmas might not be portable to other
compilers (although GNAT implements this set of pragmas on all
platforms). Therefore if portability to other compilers is an important
consideration, the use of these pragmas should be minimized.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Pragma-Abort_005fDefer" accesskey="1">Pragma Abort_Defer</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f83" accesskey="2">Pragma Ada_83</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f95" accesskey="3">Pragma Ada_95</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f05" accesskey="4">Pragma Ada_05</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f2005" accesskey="5">Pragma Ada_2005</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f12" accesskey="6">Pragma Ada_12</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ada_005f2012" accesskey="7">Pragma Ada_2012</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Annotate" accesskey="8">Pragma Annotate</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Assert" accesskey="9">Pragma Assert</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Assertion_005fPolicy">Pragma Assertion_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Assume_005fNo_005fInvalid_005fValues">Pragma Assume_No_Invalid_Values</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Attribute_005fDefinition">Pragma Attribute_Definition</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ast_005fEntry">Pragma Ast_Entry</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-C_005fPass_005fBy_005fCopy">Pragma C_Pass_By_Copy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check">Pragma Check</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check_005fFloat_005fOverflow">Pragma Check_Float_Overflow</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check_005fName">Pragma Check_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Comment">Pragma Comment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Common_005fObject">Pragma Common_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Compile_005fTime_005fError">Pragma Compile_Time_Error</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Compile_005fTime_005fWarning">Pragma Compile_Time_Warning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Compiler_005fUnit">Pragma Compiler_Unit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Complete_005fRepresentation">Pragma Complete_Representation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Complex_005fRepresentation">Pragma Complex_Representation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Contract_005fCase">Pragma Contract_Case</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Convention_005fIdentifier">Pragma Convention_Identifier</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fClass">Pragma CPP_Class</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fConstructor">Pragma CPP_Constructor</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fVirtual">Pragma CPP_Virtual</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPP_005fVtable">Pragma CPP_Vtable</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-CPU">Pragma CPU</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Debug">Pragma Debug</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Debug_005fPolicy">Pragma Debug_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Default_005fStorage_005fPool">Pragma Default_Storage_Pool</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Detect_005fBlocking">Pragma Detect_Blocking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Dispatching_005fDomain">Pragma Dispatching_Domain</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Elaboration_005fChecks">Pragma Elaboration_Checks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Eliminate">Pragma Eliminate</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fException">Pragma Export_Exception</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fFunction">Pragma Export_Function</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fObject">Pragma Export_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fProcedure">Pragma Export_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fValue">Pragma Export_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Export_005fValued_005fProcedure">Pragma Export_Valued_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Extend_005fSystem">Pragma Extend_System</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Extensions_005fAllowed">Pragma Extensions_Allowed</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-External">Pragma External</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-External_005fName_005fCasing">Pragma External_Name_Casing</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Fast_005fMath">Pragma Fast_Math</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Favor_005fTop_005fLevel">Pragma Favor_Top_Level</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Finalize_005fStorage_005fOnly">Pragma Finalize_Storage_Only</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Float_005fRepresentation">Pragma Float_Representation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ident">Pragma Ident</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Implementation_005fDefined">Pragma Implementation_Defined</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Implemented">Pragma Implemented</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Implicit_005fPacking">Pragma Implicit_Packing</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fException">Pragma Import_Exception</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fFunction">Pragma Import_Function</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fObject">Pragma Import_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fProcedure">Pragma Import_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Import_005fValued_005fProcedure">Pragma Import_Valued_Procedure</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Independent">Pragma Independent</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Independent_005fComponents">Pragma Independent_Components</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Initialize_005fScalars">Pragma Initialize_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Inline_005fAlways">Pragma Inline_Always</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Inline_005fGeneric">Pragma Inline_Generic</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interface">Pragma Interface</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interface_005fName">Pragma Interface_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interrupt_005fHandler">Pragma Interrupt_Handler</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Interrupt_005fState">Pragma Interrupt_State</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Invariant">Pragma Invariant</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Keep_005fNames">Pragma Keep_Names</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-License">Pragma License</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Link_005fWith">Pragma Link_With</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fAlias">Pragma Linker_Alias</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fConstructor">Pragma Linker_Constructor</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fDestructor">Pragma Linker_Destructor</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Linker_005fSection">Pragma Linker_Section</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Long_005fFloat">Pragma Long_Float</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Loop_005fOptimize">Pragma Loop_Optimize</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Machine_005fAttribute">Pragma Machine_Attribute</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Main">Pragma Main</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Main_005fStorage">Pragma Main_Storage</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fBody">Pragma No_Body</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fInline">Pragma No_Inline</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fReturn">Pragma No_Return</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-No_005fStrict_005fAliasing">Pragma No_Strict_Aliasing</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Normalize_005fScalars">Pragma Normalize_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Obsolescent">Pragma Obsolescent</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Optimize_005fAlignment">Pragma Optimize_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Ordered">Pragma Ordered</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Overflow_005fMode">Pragma Overflow_Mode</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Partition_005fElaboration_005fPolicy">Pragma Partition_Elaboration_Policy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Passive">Pragma Passive</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Persistent_005fBSS">Pragma Persistent_BSS</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Polling">Pragma Polling</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Postcondition">Pragma Postcondition</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Precondition">Pragma Precondition</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Preelaborable_005fInitialization">Pragma Preelaborable_Initialization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Priority_005fSpecific_005fDispatching">Pragma Priority_Specific_Dispatching</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Profile-_0028Ravenscar_0029">Pragma Profile (Ravenscar)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Profile-_0028Restricted_0029">Pragma Profile (Restricted)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Profile-_0028Rational_0029">Pragma Profile (Rational)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Psect_005fObject">Pragma Psect_Object</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Pure_005fFunction">Pragma Pure_Function</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Relative_005fDeadline">Pragma Relative_Deadline</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Remote_005fAccess_005fType">Pragma Remote_Access_Type</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Restriction_005fWarnings">Pragma Restriction_Warnings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Shared">Pragma Shared</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Short_005fCircuit_005fAnd_005fOr">Pragma Short_Circuit_And_Or</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Short_005fDescriptors">Pragma Short_Descriptors</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Simple_005fStorage_005fPool_005fType">Pragma Simple_Storage_Pool_Type</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Source_005fFile_005fName">Pragma Source_File_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Source_005fFile_005fName_005fProject">Pragma Source_File_Name_Project</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Source_005fReference">Pragma Source_Reference</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Static_005fElaboration_005fDesired">Pragma Static_Elaboration_Desired</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Stream_005fConvert">Pragma Stream_Convert</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Style_005fChecks">Pragma Style_Checks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Subtitle">Pragma Subtitle</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress">Pragma Suppress</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress_005fAll">Pragma Suppress_All</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress_005fException_005fLocations">Pragma Suppress_Exception_Locations</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Suppress_005fInitialization">Pragma Suppress_Initialization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Task_005fInfo">Pragma Task_Info</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Task_005fName">Pragma Task_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Task_005fStorage">Pragma Task_Storage</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Test_005fCase">Pragma Test_Case</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Thread_005fLocal_005fStorage">Pragma Thread_Local_Storage</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Time_005fSlice">Pragma Time_Slice</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Title">Pragma Title</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unchecked_005fUnion">Pragma Unchecked_Union</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unimplemented_005fUnit">Pragma Unimplemented_Unit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Universal_005fAliasing">Pragma Universal_Aliasing </a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Universal_005fData">Pragma Universal_Data</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unmodified">Pragma Unmodified</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unreferenced">Pragma Unreferenced</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unreferenced_005fObjects">Pragma Unreferenced_Objects</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unreserve_005fAll_005fInterrupts">Pragma Unreserve_All_Interrupts</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Unsuppress">Pragma Unsuppress</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Use_005fVADS_005fSize">Pragma Use_VADS_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Validity_005fChecks">Pragma Validity_Checks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Volatile">Pragma Volatile</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Warnings">Pragma Warnings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Weak_005fExternal">Pragma Weak_External</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Wide_005fCharacter_005fEncoding">Pragma Wide_Character_Encoding</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Pragma-Abort_005fDefer"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ada_005f83" accesskey="n" rel="next">Pragma Ada_83</a>, Previous: <a href="#Related-Information" accesskey="p" rel="prev">Related Information</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Abort_005fDefer-1"></a>
<h3 class="unnumberedsec">Pragma Abort_Defer</h3>
<a name="index-Abort_005fDefer"></a>
<a name="index-Deferring-aborts"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Abort_Defer;
</pre></div>
<p>This pragma must appear at the start of the statement sequence of a
handled sequence of statements (right after the <code>begin</code>). It has
the effect of deferring aborts for the sequence of statements (but not
for the declarations or handlers, if any, associated with this statement
sequence).
</p>
<hr>
<a name="Pragma-Ada_005f83"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ada_005f95" accesskey="n" rel="next">Pragma Ada_95</a>, Previous: <a href="#Pragma-Abort_005fDefer" accesskey="p" rel="prev">Pragma Abort_Defer</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ada_005f83-1"></a>
<h3 class="unnumberedsec">Pragma Ada_83</h3>
<a name="index-Ada_005f83"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Ada_83;
</pre></div>
<p>A configuration pragma that establishes Ada 83 mode for the unit to
which it applies, regardless of the mode set by the command line
switches. In Ada 83 mode, GNAT attempts to be as compatible with
the syntax and semantics of Ada 83, as defined in the original Ada
83 Reference Manual as possible. In particular, the keywords added by Ada 95
and Ada 2005 are not recognized, optional package bodies are allowed,
and generics may name types with unknown discriminants without using
the <code>(<>)</code> notation. In addition, some but not all of the additional
restrictions of Ada 83 are enforced.
</p>
<p>Ada 83 mode is intended for two purposes. Firstly, it allows existing
Ada 83 code to be compiled and adapted to GNAT with less effort.
Secondly, it aids in keeping code backwards compatible with Ada 83.
However, there is no guarantee that code that is processed correctly
by GNAT in Ada 83 mode will in fact compile and execute with an Ada
83 compiler, since GNAT does not enforce all the additional checks
required by Ada 83.
</p>
<hr>
<a name="Pragma-Ada_005f95"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ada_005f05" accesskey="n" rel="next">Pragma Ada_05</a>, Previous: <a href="#Pragma-Ada_005f83" accesskey="p" rel="prev">Pragma Ada_83</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ada_005f95-1"></a>
<h3 class="unnumberedsec">Pragma Ada_95</h3>
<a name="index-Ada_005f95"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Ada_95;
</pre></div>
<p>A configuration pragma that establishes Ada 95 mode for the unit to which
it applies, regardless of the mode set by the command line switches.
This mode is set automatically for the <code>Ada</code> and <code>System</code>
packages and their children, so you need not specify it in these
contexts. This pragma is useful when writing a reusable component that
itself uses Ada 95 features, but which is intended to be usable from
either Ada 83 or Ada 95 programs.
</p>
<hr>
<a name="Pragma-Ada_005f05"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ada_005f2005" accesskey="n" rel="next">Pragma Ada_2005</a>, Previous: <a href="#Pragma-Ada_005f95" accesskey="p" rel="prev">Pragma Ada_95</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ada_005f05-1"></a>
<h3 class="unnumberedsec">Pragma Ada_05</h3>
<a name="index-Ada_005f05"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Ada_05;
</pre></div>
<p>A configuration pragma that establishes Ada 2005 mode for the unit to which
it applies, regardless of the mode set by the command line switches.
This pragma is useful when writing a reusable component that
itself uses Ada 2005 features, but which is intended to be usable from
either Ada 83 or Ada 95 programs.
</p>
<hr>
<a name="Pragma-Ada_005f2005"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ada_005f12" accesskey="n" rel="next">Pragma Ada_12</a>, Previous: <a href="#Pragma-Ada_005f05" accesskey="p" rel="prev">Pragma Ada_05</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ada_005f2005-1"></a>
<h3 class="unnumberedsec">Pragma Ada_2005</h3>
<a name="index-Ada_005f2005"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Ada_2005;
</pre></div>
<p>This configuration pragma is a synonym for pragma Ada_05 and has the
same syntax and effect.
</p>
<hr>
<a name="Pragma-Ada_005f12"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ada_005f2012" accesskey="n" rel="next">Pragma Ada_2012</a>, Previous: <a href="#Pragma-Ada_005f2005" accesskey="p" rel="prev">Pragma Ada_2005</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ada_005f12-1"></a>
<h3 class="unnumberedsec">Pragma Ada_12</h3>
<a name="index-Ada_005f12"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Ada_12;
</pre></div>
<p>A configuration pragma that establishes Ada 2012 mode for the unit to which
it applies, regardless of the mode set by the command line switches.
This mode is set automatically for the <code>Ada</code> and <code>System</code>
packages and their children, so you need not specify it in these
contexts. This pragma is useful when writing a reusable component that
itself uses Ada 2012 features, but which is intended to be usable from
Ada 83, Ada 95, or Ada 2005 programs.
</p>
<hr>
<a name="Pragma-Ada_005f2012"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Annotate" accesskey="n" rel="next">Pragma Annotate</a>, Previous: <a href="#Pragma-Ada_005f12" accesskey="p" rel="prev">Pragma Ada_12</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ada_005f2012-1"></a>
<h3 class="unnumberedsec">Pragma Ada_2012</h3>
<a name="index-Ada_005f2005-1"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Ada_2012;
</pre></div>
<p>This configuration pragma is a synonym for pragma Ada_12 and has the
same syntax and effect.
</p>
<hr>
<a name="Pragma-Annotate"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Assert" accesskey="n" rel="next">Pragma Assert</a>, Previous: <a href="#Pragma-Ada_005f2012" accesskey="p" rel="prev">Pragma Ada_2012</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Annotate-1"></a>
<h3 class="unnumberedsec">Pragma Annotate</h3>
<a name="index-Annotate"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Annotate (IDENTIFIER [,IDENTIFIER {, ARG}]);
ARG ::= NAME | EXPRESSION
</pre></div>
<p>This pragma is used to annotate programs. <var>identifier</var> identifies
the type of annotation. GNAT verifies that it is an identifier, but does
not otherwise analyze it. The second optional identifier is also left
unanalyzed, and by convention is used to control the action of the tool to
which the annotation is addressed. The remaining <var>arg</var> arguments
can be either string literals or more generally expressions.
String literals are assumed to be either of type
<code>Standard.String</code> or else <code>Wide_String</code> or <code>Wide_Wide_String</code>
depending on the character literals they contain.
All other kinds of arguments are analyzed as expressions, and must be
unambiguous.
</p>
<p>The analyzed pragma is retained in the tree, but not otherwise processed
by any part of the GNAT compiler, except to generate corresponding note
lines in the generated ALI file. For the format of these note lines, see
the compiler source file lib-writ.ads. This pragma is intended for use by
external tools, including ASIS. The use of pragma Annotate does not
affect the compilation process in any way. This pragma may be used as
a configuration pragma.
</p>
<hr>
<a name="Pragma-Assert"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Assertion_005fPolicy" accesskey="n" rel="next">Pragma Assertion_Policy</a>, Previous: <a href="#Pragma-Annotate" accesskey="p" rel="prev">Pragma Annotate</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Assert-1"></a>
<h3 class="unnumberedsec">Pragma Assert</h3>
<a name="index-Assert"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Assert (
boolean_EXPRESSION
[, string_EXPRESSION]);
</pre></div>
<p>The effect of this pragma depends on whether the corresponding command
line switch is set to activate assertions. The pragma expands into code
equivalent to the following:
</p>
<div class="smallexample">
<pre class="smallexample">if assertions-enabled then
if not boolean_EXPRESSION then
System.Assertions.Raise_Assert_Failure
(string_EXPRESSION);
end if;
end if;
</pre></div>
<p>The string argument, if given, is the message that will be associated
with the exception occurrence if the exception is raised. If no second
argument is given, the default message is ‘<samp><var>file</var>:<var>nnn</var></samp>’,
where <var>file</var> is the name of the source file containing the assert,
and <var>nnn</var> is the line number of the assert. A pragma is not a
statement, so if a statement sequence contains nothing but a pragma
assert, then a null statement is required in addition, as in:
</p>
<div class="smallexample">
<pre class="smallexample">…
if J > 3 then
pragma Assert (K > 3, "Bad value for K");
null;
end if;
</pre></div>
<p>Note that, as with the <code>if</code> statement to which it is equivalent, the
type of the expression is either <code>Standard.Boolean</code>, or any type derived
from this standard type.
</p>
<p>If assertions are disabled (switch <samp>-gnata</samp> not used), then there
is no run-time effect (and in particular, any side effects from the
expression will not occur at run time). (The expression is still
analyzed at compile time, and may cause types to be frozen if they are
mentioned here for the first time).
</p>
<p>If assertions are enabled, then the given expression is tested, and if
it is <code>False</code> then <code>System.Assertions.Raise_Assert_Failure</code> is called
which results in the raising of <code>Assert_Failure</code> with the given message.
</p>
<p>You should generally avoid side effects in the expression arguments of
this pragma, because these side effects will turn on and off with the
setting of the assertions mode, resulting in assertions that have an
effect on the program. However, the expressions are analyzed for
semantic correctness whether or not assertions are enabled, so turning
assertions on and off cannot affect the legality of a program.
</p>
<p>Note that the implementation defined policy <code>DISABLE</code>, given in a
pragma Assertion_Policy, can be used to suppress this semantic analysis.
</p>
<p>Note: this is a standard language-defined pragma in versions
of Ada from 2005 on. In GNAT, it is implemented in all versions
of Ada, and the DISABLE policy is an implementation-defined
addition.
</p>
<hr>
<a name="Pragma-Assertion_005fPolicy"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Assume_005fNo_005fInvalid_005fValues" accesskey="n" rel="next">Pragma Assume_No_Invalid_Values</a>, Previous: <a href="#Pragma-Assert" accesskey="p" rel="prev">Pragma Assert</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Assertion_005fPolicy-1"></a>
<h3 class="unnumberedsec">Pragma Assertion_Policy</h3>
<a name="index-Debug_005fPolicy"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Assertion_Policy (CHECK | DISABLE | IGNORE);
</pre></div>
<p>This is a standard Ada 2005 pragma that is available as an
implementation-defined pragma in earlier versions of Ada.
</p>
<p>If the argument is <code>CHECK</code>, then assertions are enabled.
If the argument is <code>IGNORE</code>, then assertions are ignored.
This pragma overrides the effect of the <samp>-gnata</samp> switch on the
command line.
</p>
<p>Assertions are of three kinds:
</p>
<ul>
<li> Pragma <code>Assert</code>.
</li><li> In Ada 2012, all assertions defined in the RM as aspects: preconditions,
postconditions, type invariants and (sub)type predicates.
</li><li> Corresponding pragmas for type invariants and (sub)type predicates.
</li></ul>
<p>The implementation defined policy <code>DISABLE</code> is like
<code>IGNORE</code> except that it completely disables semantic
checking of the argument to <code>pragma Assert</code>. This may
be useful when the pragma argument references subprograms
in a with’ed package which is replaced by a dummy package
for the final build.
</p>
<p>Note: this is a standard language-defined pragma in versions
of Ada from 2005 on. In GNAT, it is implemented in all versions
of Ada, and the DISABLE policy is an implementation-defined
addition.
</p>
<hr>
<a name="Pragma-Assume_005fNo_005fInvalid_005fValues"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ast_005fEntry" accesskey="n" rel="next">Pragma Ast_Entry</a>, Previous: <a href="#Pragma-Assertion_005fPolicy" accesskey="p" rel="prev">Pragma Assertion_Policy</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Assume_005fNo_005fInvalid_005fValues-1"></a>
<h3 class="unnumberedsec">Pragma Assume_No_Invalid_Values</h3>
<a name="index-Assume_005fNo_005fInvalid_005fValues"></a>
<a name="index-Invalid-representations"></a>
<a name="index-Invalid-values"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Assume_No_Invalid_Values (On | Off);
</pre></div>
<p>This is a configuration pragma that controls the assumptions made by the
compiler about the occurrence of invalid representations (invalid values)
in the code.
</p>
<p>The default behavior (corresponding to an Off argument for this pragma), is
to assume that values may in general be invalid unless the compiler can
prove they are valid. Consider the following example:
</p>
<div class="smallexample">
<pre class="smallexample">V1 : Integer range 1 .. 10;
V2 : Integer range 11 .. 20;
...
for J in V2 .. V1 loop
...
end loop;
</pre></div>
<p>if V1 and V2 have valid values, then the loop is known at compile
time not to execute since the lower bound must be greater than the
upper bound. However in default mode, no such assumption is made,
and the loop may execute. If <code>Assume_No_Invalid_Values (On)</code>
is given, the compiler will assume that any occurrence of a variable
other than in an explicit <code>'Valid</code> test always has a valid
value, and the loop above will be optimized away.
</p>
<p>The use of <code>Assume_No_Invalid_Values (On)</code> is appropriate if
you know your code is free of uninitialized variables and other
possible sources of invalid representations, and may result in
more efficient code. A program that accesses an invalid representation
with this pragma in effect is erroneous, so no guarantees can be made
about its behavior.
</p>
<p>It is peculiar though permissible to use this pragma in conjunction
with validity checking (-gnatVa). In such cases, accessing invalid
values will generally give an exception, though formally the program
is erroneous so there are no guarantees that this will always be the
case, and it is recommended that these two options not be used together.
</p>
<hr>
<a name="Pragma-Ast_005fEntry"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Attribute_005fDefinition" accesskey="n" rel="next">Pragma Attribute_Definition</a>, Previous: <a href="#Pragma-Assume_005fNo_005fInvalid_005fValues" accesskey="p" rel="prev">Pragma Assume_No_Invalid_Values</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ast_005fEntry-1"></a>
<h3 class="unnumberedsec">Pragma Ast_Entry</h3>
<a name="index-OpenVMS"></a>
<a name="index-Ast_005fEntry"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma AST_Entry (entry_IDENTIFIER);
</pre></div>
<p>This pragma is implemented only in the OpenVMS implementation of GNAT. The
argument is the simple name of a single entry; at most one <code>AST_Entry</code>
pragma is allowed for any given entry. This pragma must be used in
conjunction with the <code>AST_Entry</code> attribute, and is only allowed after
the entry declaration and in the same task type specification or single task
as the entry to which it applies. This pragma specifies that the given entry
may be used to handle an OpenVMS asynchronous system trap (<code>AST</code>)
resulting from an OpenVMS system service call. The pragma does not affect
normal use of the entry. For further details on this pragma, see the
DEC Ada Language Reference Manual, section 9.12a.
</p>
<hr>
<a name="Pragma-Attribute_005fDefinition"></a>
<div class="header">
<p>
Next: <a href="#Pragma-C_005fPass_005fBy_005fCopy" accesskey="n" rel="next">Pragma C_Pass_By_Copy</a>, Previous: <a href="#Pragma-Ast_005fEntry" accesskey="p" rel="prev">Pragma Ast_Entry</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Attribute_005fDefinition-1"></a>
<h3 class="unnumberedsec">Pragma Attribute_Definition</h3>
<a name="index-Attribute_005fDefinition"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Attribute_Definition
([Attribute =>] ATTRIBUTE_DESIGNATOR,
[Entity =>] LOCAL_NAME,
[Expression =>] EXPRESSION | NAME);
</pre></div>
<p>If <code>Attribute</code> is a known attribute name, this pragma is equivalent to
the attribute definition clause:
</p>
<div class="smallexample">
<pre class="smallexample"> for Entity'Attribute use Expression;
</pre></div>
<p>If <code>Attribute</code> is not a recognized attribute name, the pragma is
ignored, and a warning is emitted. This allows source
code to be written that takes advantage of some new attribute, while remaining
compilable with earlier compilers.
</p>
<hr>
<a name="Pragma-C_005fPass_005fBy_005fCopy"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Check" accesskey="n" rel="next">Pragma Check</a>, Previous: <a href="#Pragma-Attribute_005fDefinition" accesskey="p" rel="prev">Pragma Attribute_Definition</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-C_005fPass_005fBy_005fCopy-1"></a>
<h3 class="unnumberedsec">Pragma C_Pass_By_Copy</h3>
<a name="index-Passing-by-copy"></a>
<a name="index-C_005fPass_005fBy_005fCopy"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma C_Pass_By_Copy
([Max_Size =>] static_integer_EXPRESSION);
</pre></div>
<p>Normally the default mechanism for passing C convention records to C
convention subprograms is to pass them by reference, as suggested by RM
B.3(69). Use the configuration pragma <code>C_Pass_By_Copy</code> to change
this default, by requiring that record formal parameters be passed by
copy if all of the following conditions are met:
</p>
<ul>
<li> The size of the record type does not exceed the value specified for
<code>Max_Size</code>.
</li><li> The record type has <code>Convention C</code>.
</li><li> The formal parameter has this record type, and the subprogram has a
foreign (non-Ada) convention.
</li></ul>
<p>If these conditions are met the argument is passed by copy, i.e. in a
manner consistent with what C expects if the corresponding formal in the
C prototype is a struct (rather than a pointer to a struct).
</p>
<p>You can also pass records by copy by specifying the convention
<code>C_Pass_By_Copy</code> for the record type, or by using the extended
<code>Import</code> and <code>Export</code> pragmas, which allow specification of
passing mechanisms on a parameter by parameter basis.
</p>
<hr>
<a name="Pragma-Check"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Check_005fFloat_005fOverflow" accesskey="n" rel="next">Pragma Check_Float_Overflow</a>, Previous: <a href="#Pragma-C_005fPass_005fBy_005fCopy" accesskey="p" rel="prev">Pragma C_Pass_By_Copy</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Check-1"></a>
<h3 class="unnumberedsec">Pragma Check</h3>
<a name="index-Assertions"></a>
<a name="index-Named-assertions"></a>
<a name="index-Check"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Check (
[Name =>] Identifier,
[Check =>] Boolean_EXPRESSION
[, [Message =>] string_EXPRESSION] );
</pre></div>
<p>This pragma is similar to the predefined pragma <code>Assert</code> except that an
extra identifier argument is present. In conjunction with pragma
<code>Check_Policy</code>, this can be used to define groups of assertions that can
be independently controlled. The identifier <code>Assertion</code> is special, it
refers to the normal set of pragma <code>Assert</code> statements. The identifiers
<code>Precondition</code> and <code>Postcondition</code> correspond to the pragmas of these
names, so these three names would normally not be used directly in a pragma
<code>Check</code>.
</p>
<p>Checks introduced by this pragma are normally deactivated by default. They can
be activated either by the command line option <samp>-gnata</samp>, which turns on
all checks, or individually controlled using pragma <code>Check_Policy</code>.
</p>
<hr>
<a name="Pragma-Check_005fFloat_005fOverflow"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Check_005fName" accesskey="n" rel="next">Pragma Check_Name</a>, Previous: <a href="#Pragma-Check" accesskey="p" rel="prev">Pragma Check</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Check_005fFloat_005fOverflow-1"></a>
<h3 class="unnumberedsec">Pragma Check_Float_Overflow</h3>
<a name="index-Floating_002dpoint-overflow"></a>
<a name="index-Check_005fFloat_005fOverflow"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Check_Float_Overflow;
</pre></div>
<p>In Ada, the predefined floating-point types (<code>Short_Float</code>,
<code>Float</code>, <code>Long_Float</code>, <code>Long_Long_Float</code>) are
defined to be <em>unconstrained</em>. This means that even though each
has a well-defined base range, an operation that delivers a result
outside this base range is not required to raise an exception.
This implementation permission accommodates the notion
of infinities in IEEE floating-point, and corresponds to the
efficient execution mode on most machines. GNAT will not raise
overflow exceptions on these machines; instead it will generate
infinities and NaN’s as defined in the IEEE standard.
</p>
<p>Generating infinities, although efficient, is not always desirable.
Often the preferable approach is to check for overflow, even at the
(perhaps considerable) expense of run-time performance.
This can be accomplished by defining your own constrained floating-point subtypes – i.e., by supplying explicit
range constraints – and indeed such a subtype
can have the same base range as its base type. For example:
</p>
<div class="smallexample">
<pre class="smallexample">subtype My_Float is Float range Float'Range;
</pre></div>
<p>Here <code>My_Float</code> has the same range as
<code>Float</code> but is constrained, so operations on
<code>My_Float</code> values will be checked for overflow
against this range.
</p>
<p>This style will achieve the desired goal, but
it is often more convenient to be able to simply use
the standard predefined floating-point types as long
as overflow checking could be guaranteed.
The <code>Check_Float_Overflow</code>
configuration pragma achieves this effect. If a unit is compiled
subject to this configuration pragma, then all operations
on predefined floating-point types will be treated as
though those types were constrained, and overflow checks
will be generated. The <code>Constraint_Error</code>
exception is raised if the result is out of range.
</p>
<p>This mode can also be set by use of the compiler
switch <samp>-gnateF</samp>.
</p>
<hr>
<a name="Pragma-Check_005fName"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Check_005fPolicy" accesskey="n" rel="next">Pragma Check_Policy</a>, Previous: <a href="#Pragma-Check_005fFloat_005fOverflow" accesskey="p" rel="prev">Pragma Check_Float_Overflow</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Check_005fName-1"></a>
<h3 class="unnumberedsec">Pragma Check_Name</h3>
<a name="index-Defining-check-names"></a>
<a name="index-Check-names_002c-defining"></a>
<a name="index-Check_005fName"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Check_Name (check_name_IDENTIFIER);
</pre></div>
<p>This is a configuration pragma that defines a new implementation
defined check name (unless IDENTIFIER matches one of the predefined
check names, in which case the pragma has no effect). Check names
are global to a partition, so if two or more configuration pragmas
are present in a partition mentioning the same name, only one new
check name is introduced.
</p>
<p>An implementation defined check name introduced with this pragma may
be used in only three contexts: <code>pragma Suppress</code>,
<code>pragma Unsuppress</code>,
and as the prefix of a <code>Check_Name'Enabled</code> attribute reference. For
any of these three cases, the check name must be visible. A check
name is visible if it is in the configuration pragmas applying to
the current unit, or if it appears at the start of any unit that
is part of the dependency set of the current unit (e.g., units that
are mentioned in <code>with</code> clauses).
</p>
<hr>
<a name="Pragma-Check_005fPolicy"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Comment" accesskey="n" rel="next">Pragma Comment</a>, Previous: <a href="#Pragma-Check_005fName" accesskey="p" rel="prev">Pragma Check_Name</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Check_005fPolicy-1"></a>
<h3 class="unnumberedsec">Pragma Check_Policy</h3>
<a name="index-Controlling-assertions"></a>
<a name="index-Assertions_002c-control"></a>
<a name="index-Check-pragma-control"></a>
<a name="index-Named-assertions-1"></a>
<a name="index-Check-1"></a>
<p>Syntax:
</p><div class="smallexample">
<pre class="smallexample">pragma Check_Policy
([Name =>] Identifier,
[Policy =>] POLICY_IDENTIFIER);
POLICY_IDENTIFIER ::= ON | OFF | CHECK | DISABLE | IGNORE
</pre></div>
<p>This pragma is similar to the predefined pragma <code>Assertion_Policy</code>,
except that it controls sets of named assertions introduced using the
<code>Check</code> pragmas. It can be used as a configuration pragma or (unlike
<code>Assertion_Policy</code>) can be used within a declarative part, in which case
it controls the status to the end of the corresponding construct (in a manner
identical to pragma <code>Suppress)</code>.
</p>
<p>The identifier given as the first argument corresponds to a name used in
associated <code>Check</code> pragmas. For example, if the pragma:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Check_Policy (Critical_Error, OFF);
</pre></div>
<p>is given, then subsequent <code>Check</code> pragmas whose first argument is also
<code>Critical_Error</code> will be disabled. The special identifier <code>Assertion</code>
controls the behavior of normal assertions (thus a pragma
<code>Check_Policy</code> with this identifier is similar to the normal
<code>Assertion_Policy</code> pragma except that it can appear within a
declarative part).
</p>
<p>The special identifiers <code>Precondition</code> and <code>Postcondition</code> control
the status of preconditions and postconditions given as pragmas.
If a <code>Precondition</code> pragma
is encountered, it is ignored if turned off by a <code>Check_Policy</code> specifying
that <code>Precondition</code> checks are <code>Off</code> or <code>Ignored</code>. Similarly use
of the name <code>Postcondition</code> controls whether <code>Postcondition</code> pragmas
are recognized. Note that preconditions and postconditions given as aspects
are controlled differently, either by the <code>Assertion_Policy</code> pragma or
by the <code>Check_Policy</code> pragma with identifier <code>Assertion</code>.
</p>
<p>The check policy is <code>OFF</code> to turn off corresponding checks, and <code>ON</code>
to turn on corresponding checks. The default for a set of checks for which no
<code>Check_Policy</code> is given is <code>OFF</code> unless the compiler switch
<samp>-gnata</samp> is given, which turns on all checks by default.
</p>
<p>The check policy settings <code>CHECK</code> and <code>IGNORE</code> are also recognized
as synonyms for <code>ON</code> and <code>OFF</code>. These synonyms are provided for
compatibility with the standard <code>Assertion_Policy</code> pragma.
</p>
<p>The implementation defined policy <code>DISABLE</code> is like
<code>OFF</code> except that it completely disables semantic
checking of the argument to the corresponding class of
pragmas. This may be useful when the pragma arguments reference
subprograms in a with’ed package which is replaced by a dummy package
for the final build.
</p>
<hr>
<a name="Pragma-Comment"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Common_005fObject" accesskey="n" rel="next">Pragma Common_Object</a>, Previous: <a href="#Pragma-Check_005fPolicy" accesskey="p" rel="prev">Pragma Check_Policy</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Comment-1"></a>
<h3 class="unnumberedsec">Pragma Comment</h3>
<a name="index-Comment"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Comment (static_string_EXPRESSION);
</pre></div>
<p>This is almost identical in effect to pragma <code>Ident</code>. It allows the
placement of a comment into the object file and hence into the
executable file if the operating system permits such usage. The
difference is that <code>Comment</code>, unlike <code>Ident</code>, has
no limitations on placement of the pragma (it can be placed
anywhere in the main source unit), and if more than one pragma
is used, all comments are retained.
</p>
<hr>
<a name="Pragma-Common_005fObject"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Compile_005fTime_005fError" accesskey="n" rel="next">Pragma Compile_Time_Error</a>, Previous: <a href="#Pragma-Comment" accesskey="p" rel="prev">Pragma Comment</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Common_005fObject-1"></a>
<h3 class="unnumberedsec">Pragma Common_Object</h3>
<a name="index-Common_005fObject"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Common_Object (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Size =>] EXTERNAL_SYMBOL] );
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
</pre></div>
<p>This pragma enables the shared use of variables stored in overlaid
linker areas corresponding to the use of <code>COMMON</code>
in Fortran. The single
object <var>LOCAL_NAME</var> is assigned to the area designated by
the <var>External</var> argument.
You may define a record to correspond to a series
of fields. The <var>Size</var> argument
is syntax checked in GNAT, but otherwise ignored.
</p>
<p><code>Common_Object</code> is not supported on all platforms. If no
support is available, then the code generator will issue a message
indicating that the necessary attribute for implementation of this
pragma is not available.
</p>
<hr>
<a name="Pragma-Compile_005fTime_005fError"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Compile_005fTime_005fWarning" accesskey="n" rel="next">Pragma Compile_Time_Warning</a>, Previous: <a href="#Pragma-Common_005fObject" accesskey="p" rel="prev">Pragma Common_Object</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Compile_005fTime_005fError-1"></a>
<h3 class="unnumberedsec">Pragma Compile_Time_Error</h3>
<a name="index-Compile_005fTime_005fError"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Compile_Time_Error
(boolean_EXPRESSION, static_string_EXPRESSION);
</pre></div>
<p>This pragma can be used to generate additional compile time
error messages. It
is particularly useful in generics, where errors can be issued for
specific problematic instantiations. The first parameter is a boolean
expression. The pragma is effective only if the value of this expression
is known at compile time, and has the value True. The set of expressions
whose values are known at compile time includes all static boolean
expressions, and also other values which the compiler can determine
at compile time (e.g., the size of a record type set by an explicit
size representation clause, or the value of a variable which was
initialized to a constant and is known not to have been modified).
If these conditions are met, an error message is generated using
the value given as the second argument. This string value may contain
embedded ASCII.LF characters to break the message into multiple lines.
</p>
<hr>
<a name="Pragma-Compile_005fTime_005fWarning"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Compiler_005fUnit" accesskey="n" rel="next">Pragma Compiler_Unit</a>, Previous: <a href="#Pragma-Compile_005fTime_005fError" accesskey="p" rel="prev">Pragma Compile_Time_Error</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Compile_005fTime_005fWarning-1"></a>
<h3 class="unnumberedsec">Pragma Compile_Time_Warning</h3>
<a name="index-Compile_005fTime_005fWarning"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Compile_Time_Warning
(boolean_EXPRESSION, static_string_EXPRESSION);
</pre></div>
<p>Same as pragma Compile_Time_Error, except a warning is issued instead
of an error message. Note that if this pragma is used in a package that
is with’ed by a client, the client will get the warning even though it
is issued by a with’ed package (normally warnings in with’ed units are
suppressed, but this is a special exception to that rule).
</p>
<p>One typical use is within a generic where compile time known characteristics
of formal parameters are tested, and warnings given appropriately. Another use
with a first parameter of True is to warn a client about use of a package,
for example that it is not fully implemented.
</p>
<hr>
<a name="Pragma-Compiler_005fUnit"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Complete_005fRepresentation" accesskey="n" rel="next">Pragma Complete_Representation</a>, Previous: <a href="#Pragma-Compile_005fTime_005fWarning" accesskey="p" rel="prev">Pragma Compile_Time_Warning</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Compiler_005fUnit-1"></a>
<h3 class="unnumberedsec">Pragma Compiler_Unit</h3>
<a name="index-Compiler_005fUnit"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Compiler_Unit;
</pre></div>
<p>This pragma is intended only for internal use in the GNAT run-time library.
It indicates that the unit is used as part of the compiler build. The effect
is to disallow constructs (raise with message, conditional expressions etc)
that would cause trouble when bootstrapping using an older version of GNAT.
For the exact list of restrictions, see the compiler sources and references
to Is_Compiler_Unit.
</p>
<hr>
<a name="Pragma-Complete_005fRepresentation"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Complex_005fRepresentation" accesskey="n" rel="next">Pragma Complex_Representation</a>, Previous: <a href="#Pragma-Compiler_005fUnit" accesskey="p" rel="prev">Pragma Compiler_Unit</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Complete_005fRepresentation-1"></a>
<h3 class="unnumberedsec">Pragma Complete_Representation</h3>
<a name="index-Complete_005fRepresentation"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Complete_Representation;
</pre></div>
<p>This pragma must appear immediately within a record representation
clause. Typical placements are before the first component clause
or after the last component clause. The effect is to give an error
message if any component is missing a component clause. This pragma
may be used to ensure that a record representation clause is
complete, and that this invariant is maintained if fields are
added to the record in the future.
</p>
<hr>
<a name="Pragma-Complex_005fRepresentation"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Component_005fAlignment" accesskey="n" rel="next">Pragma Component_Alignment</a>, Previous: <a href="#Pragma-Complete_005fRepresentation" accesskey="p" rel="prev">Pragma Complete_Representation</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Complex_005fRepresentation-1"></a>
<h3 class="unnumberedsec">Pragma Complex_Representation</h3>
<a name="index-Complex_005fRepresentation"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Complex_Representation
([Entity =>] LOCAL_NAME);
</pre></div>
<p>The <var>Entity</var> argument must be the name of a record type which has
two fields of the same floating-point type. The effect of this pragma is
to force gcc to use the special internal complex representation form for
this record, which may be more efficient. Note that this may result in
the code for this type not conforming to standard ABI (application
binary interface) requirements for the handling of record types. For
example, in some environments, there is a requirement for passing
records by pointer, and the use of this pragma may result in passing
this type in floating-point registers.
</p>
<hr>
<a name="Pragma-Component_005fAlignment"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Contract_005fCase" accesskey="n" rel="next">Pragma Contract_Case</a>, Previous: <a href="#Pragma-Complex_005fRepresentation" accesskey="p" rel="prev">Pragma Complex_Representation</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Component_005fAlignment-1"></a>
<h3 class="unnumberedsec">Pragma Component_Alignment</h3>
<a name="index-Alignments-of-components"></a>
<a name="index-Component_005fAlignment"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Component_Alignment (
[Form =>] ALIGNMENT_CHOICE
[, [Name =>] type_LOCAL_NAME]);
ALIGNMENT_CHOICE ::=
Component_Size
| Component_Size_4
| Storage_Unit
| Default
</pre></div>
<p>Specifies the alignment of components in array or record types.
The meaning of the <var>Form</var> argument is as follows:
</p>
<dl compact="compact">
<dd><a name="index-Component_005fSize"></a>
</dd>
<dt><code>Component_Size</code></dt>
<dd><p>Aligns scalar components and subcomponents of the array or record type
on boundaries appropriate to their inherent size (naturally
aligned). For example, 1-byte components are aligned on byte boundaries,
2-byte integer components are aligned on 2-byte boundaries, 4-byte
integer components are aligned on 4-byte boundaries and so on. These
alignment rules correspond to the normal rules for C compilers on all
machines except the VAX.
</p>
<a name="index-Component_005fSize_005f4"></a>
</dd>
<dt><code>Component_Size_4</code></dt>
<dd><p>Naturally aligns components with a size of four or fewer
bytes. Components that are larger than 4 bytes are placed on the next
4-byte boundary.
</p>
<a name="index-Storage_005fUnit"></a>
</dd>
<dt><code>Storage_Unit</code></dt>
<dd><p>Specifies that array or record components are byte aligned, i.e.
aligned on boundaries determined by the value of the constant
<code>System.Storage_Unit</code>.
</p>
<a name="index-OpenVMS-1"></a>
</dd>
<dt><code>Default</code></dt>
<dd><p>Specifies that array or record components are aligned on default
boundaries, appropriate to the underlying hardware or operating system or
both. For OpenVMS VAX systems, the <code>Default</code> choice is the same as
the <code>Storage_Unit</code> choice (byte alignment). For all other systems,
the <code>Default</code> choice is the same as <code>Component_Size</code> (natural
alignment).
</p></dd>
</dl>
<p>If the <code>Name</code> parameter is present, <var>type_LOCAL_NAME</var> must
refer to a local record or array type, and the specified alignment
choice applies to the specified type. The use of
<code>Component_Alignment</code> together with a pragma <code>Pack</code> causes the
<code>Component_Alignment</code> pragma to be ignored. The use of
<code>Component_Alignment</code> together with a record representation clause
is only effective for fields not specified by the representation clause.
</p>
<p>If the <code>Name</code> parameter is absent, the pragma can be used as either
a configuration pragma, in which case it applies to one or more units in
accordance with the normal rules for configuration pragmas, or it can be
used within a declarative part, in which case it applies to types that
are declared within this declarative part, or within any nested scope
within this declarative part. In either case it specifies the alignment
to be applied to any record or array type which has otherwise standard
representation.
</p>
<p>If the alignment for a record or array type is not specified (using
pragma <code>Pack</code>, pragma <code>Component_Alignment</code>, or a record rep
clause), the GNAT uses the default alignment as described previously.
</p>
<hr>
<a name="Pragma-Contract_005fCase"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Convention_005fIdentifier" accesskey="n" rel="next">Pragma Convention_Identifier</a>, Previous: <a href="#Pragma-Component_005fAlignment" accesskey="p" rel="prev">Pragma Component_Alignment</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Contract_005fCase-1"></a>
<h3 class="unnumberedsec">Pragma Contract_Case</h3>
<a name="index-Contract-cases"></a>
<a name="index-Contract_005fCase"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Contract_Case (
[Name =>] static_string_Expression
,[Mode =>] (Nominal | Robustness)
[, Requires => Boolean_Expression]
[, Ensures => Boolean_Expression]);
</pre></div>
<p>The <code>Contract_Case</code> pragma allows defining fine-grain specifications
that can complement or replace the contract given by a precondition and a
postcondition. Additionally, the <code>Contract_Case</code> pragma can be used
by testing and formal verification tools. The compiler checks its validity and,
depending on the assertion policy at the point of declaration of the pragma,
it may insert a check in the executable. For code generation, the contract
case
</p>
<div class="smallexample">
<pre class="smallexample">pragma Contract_Case (
Name => ...
Mode => ...
Requires => R,
Ensures => E);
</pre></div>
<p>is equivalent to
</p>
<div class="smallexample">
<pre class="smallexample">pragma Postcondition (not R'Old or else E);
</pre></div>
<p>which is also equivalent to (in Ada 2012)
</p>
<div class="smallexample">
<pre class="smallexample">pragma Postcondition (if R'Old then E);
</pre></div>
<p>expressing that, whenever condition <code>R</code> is satisfied on entry to the
subprogram, condition <code>E</code> should be fulfilled on exit to the subprogram.
</p>
<p>A precondition <code>P</code> and postcondition <code>Q</code> can also be
expressed as contract cases:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Contract_Case (
Name => "Replace precondition",
Mode => Nominal,
Requires => not P,
Ensures => False);
pragma Contract_Case (
Name => "Replace postcondition",
Mode => Nominal,
Requires => P,
Ensures => Q);
</pre></div>
<p><code>Contract_Case</code> pragmas may only appear immediately following the
(separate) declaration of a subprogram in a package declaration, inside
a package spec unit. Only other pragmas may intervene (that is appear
between the subprogram declaration and a contract case).
</p>
<p>The compiler checks that boolean expressions given in <code>Requires</code> and
<code>Ensures</code> are valid, where the rules for <code>Requires</code> are the
same as the rule for an expression in <code>Precondition</code> and the rules
for <code>Ensures</code> are the same as the rule for an expression in
<code>Postcondition</code>. In particular, attributes <code>'Old</code> and
<code>'Result</code> can only be used within the <code>Ensures</code>
expression. The following is an example of use within a package spec:
</p>
<div class="smallexample">
<pre class="smallexample">package Math_Functions is
...
function Sqrt (Arg : Float) return Float;
pragma Contract_Case (Name => "Small argument",
Mode => Nominal,
Requires => Arg < 100,
Ensures => Sqrt'Result < 10);
...
end Math_Functions;
</pre></div>
<p>The meaning of a contract case is that, whenever the associated subprogram is
executed in a context where <code>Requires</code> holds, then <code>Ensures</code>
should hold when the subprogram returns. Mode <code>Nominal</code> indicates
that the input context should also satisfy the precondition of the
subprogram, and the output context should also satisfy its
postcondition. More <code>Robustness</code> indicates that the precondition and
postcondition of the subprogram should be ignored for this contract case,
which is mostly useful when testing such a contract using a testing tool
that understands contract cases.
</p>
<hr>
<a name="Pragma-Convention_005fIdentifier"></a>
<div class="header">
<p>
Next: <a href="#Pragma-CPP_005fClass" accesskey="n" rel="next">Pragma CPP_Class</a>, Previous: <a href="#Pragma-Contract_005fCase" accesskey="p" rel="prev">Pragma Contract_Case</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Convention_005fIdentifier-1"></a>
<h3 class="unnumberedsec">Pragma Convention_Identifier</h3>
<a name="index-Convention_005fIdentifier"></a>
<a name="index-Conventions_002c-synonyms"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Convention_Identifier (
[Name =>] IDENTIFIER,
[Convention =>] convention_IDENTIFIER);
</pre></div>
<p>This pragma provides a mechanism for supplying synonyms for existing
convention identifiers. The <code>Name</code> identifier can subsequently
be used as a synonym for the given convention in other pragmas (including
for example pragma <code>Import</code> or another <code>Convention_Identifier</code>
pragma). As an example of the use of this, suppose you had legacy code
which used Fortran77 as the identifier for Fortran. Then the pragma:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Convention_Identifier (Fortran77, Fortran);
</pre></div>
<p>would allow the use of the convention identifier <code>Fortran77</code> in
subsequent code, avoiding the need to modify the sources. As another
example, you could use this to parameterize convention requirements
according to systems. Suppose you needed to use <code>Stdcall</code> on
windows systems, and <code>C</code> on some other system, then you could
define a convention identifier <code>Library</code> and use a single
<code>Convention_Identifier</code> pragma to specify which convention
would be used system-wide.
</p>
<hr>
<a name="Pragma-CPP_005fClass"></a>
<div class="header">
<p>
Next: <a href="#Pragma-CPP_005fConstructor" accesskey="n" rel="next">Pragma CPP_Constructor</a>, Previous: <a href="#Pragma-Convention_005fIdentifier" accesskey="p" rel="prev">Pragma Convention_Identifier</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-CPP_005fClass-1"></a>
<h3 class="unnumberedsec">Pragma CPP_Class</h3>
<a name="index-CPP_005fClass"></a>
<a name="index-Interfacing-with-C_002b_002b"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma CPP_Class ([Entity =>] LOCAL_NAME);
</pre></div>
<p>The argument denotes an entity in the current declarative region that is
declared as a record type. It indicates that the type corresponds to an
externally declared C++ class type, and is to be laid out the same way
that C++ would lay out the type. If the C++ class has virtual primitives
then the record must be declared as a tagged record type.
</p>
<p>Types for which <code>CPP_Class</code> is specified do not have assignment or
equality operators defined (such operations can be imported or declared
as subprograms as required). Initialization is allowed only by constructor
functions (see pragma <code>CPP_Constructor</code>). Such types are implicitly
limited if not explicitly declared as limited or derived from a limited
type, and an error is issued in that case.
</p>
<p>See <a href="#Interfacing-to-C_002b_002b">Interfacing to C++</a> for related information.
</p>
<p>Note: Pragma <code>CPP_Class</code> is currently obsolete. It is supported
for backward compatibility but its functionality is available
using pragma <code>Import</code> with <code>Convention</code> = <code>CPP</code>.
</p>
<hr>
<a name="Pragma-CPP_005fConstructor"></a>
<div class="header">
<p>
Next: <a href="#Pragma-CPP_005fVirtual" accesskey="n" rel="next">Pragma CPP_Virtual</a>, Previous: <a href="#Pragma-CPP_005fClass" accesskey="p" rel="prev">Pragma CPP_Class</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-CPP_005fConstructor-1"></a>
<h3 class="unnumberedsec">Pragma CPP_Constructor</h3>
<a name="index-Interfacing-with-C_002b_002b-1"></a>
<a name="index-CPP_005fConstructor"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma CPP_Constructor ([Entity =>] LOCAL_NAME
[, [External_Name =>] static_string_EXPRESSION ]
[, [Link_Name =>] static_string_EXPRESSION ]);
</pre></div>
<p>This pragma identifies an imported function (imported in the usual way
with pragma <code>Import</code>) as corresponding to a C++ constructor. If
<code>External_Name</code> and <code>Link_Name</code> are not specified then the
<code>Entity</code> argument is a name that must have been previously mentioned
in a pragma <code>Import</code> with <code>Convention</code> = <code>CPP</code>. Such name
must be of one of the following forms:
</p>
<ul>
<li> <code>function <var>Fname</var> return <var>T</var></code>
<ul>
<li> <code>function <var>Fname</var> return <var>T</var>'Class</code>
</li><li> <code>function <var>Fname</var> (…) return <var>T</var></code>
</li></ul>
</li><li> <code>function <var>Fname</var> (…) return <var>T</var>'Class</code>
</li></ul>
<p>where <var>T</var> is a limited record type imported from C++ with pragma
<code>Import</code> and <code>Convention</code> = <code>CPP</code>.
</p>
<p>The first two forms import the default constructor, used when an object
of type <var>T</var> is created on the Ada side with no explicit constructor.
The latter two forms cover all the non-default constructors of the type.
See the GNAT User’s Guide for details.
</p>
<p>If no constructors are imported, it is impossible to create any objects
on the Ada side and the type is implicitly declared abstract.
</p>
<p>Pragma <code>CPP_Constructor</code> is intended primarily for automatic generation
using an automatic binding generator tool (such as the <code>-fdump-ada-spec</code>
GCC switch).
See <a href="#Interfacing-to-C_002b_002b">Interfacing to C++</a> for more related information.
</p>
<p>Note: The use of functions returning class-wide types for constructors is
currently obsolete. They are supported for backward compatibility. The
use of functions returning the type T leave the Ada sources more clear
because the imported C++ constructors always return an object of type T;
that is, they never return an object whose type is a descendant of type T.
</p>
<hr>
<a name="Pragma-CPP_005fVirtual"></a>
<div class="header">
<p>
Next: <a href="#Pragma-CPP_005fVtable" accesskey="n" rel="next">Pragma CPP_Vtable</a>, Previous: <a href="#Pragma-CPP_005fConstructor" accesskey="p" rel="prev">Pragma CPP_Constructor</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-CPP_005fVirtual-1"></a>
<h3 class="unnumberedsec">Pragma CPP_Virtual</h3>
<a name="index-Interfacing-to-C_002b_002b"></a>
<a name="index-CPP_005fVirtual"></a>
<p>This pragma is now obsolete has has no effect because GNAT generates
the same object layout than the G++ compiler.
</p>
<p>See <a href="#Interfacing-to-C_002b_002b">Interfacing to C++</a> for related information.
</p>
<hr>
<a name="Pragma-CPP_005fVtable"></a>
<div class="header">
<p>
Next: <a href="#Pragma-CPU" accesskey="n" rel="next">Pragma CPU</a>, Previous: <a href="#Pragma-CPP_005fVirtual" accesskey="p" rel="prev">Pragma CPP_Virtual</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-CPP_005fVtable-1"></a>
<h3 class="unnumberedsec">Pragma CPP_Vtable</h3>
<a name="index-Interfacing-with-C_002b_002b-2"></a>
<a name="index-CPP_005fVtable"></a>
<p>This pragma is now obsolete has has no effect because GNAT generates
the same object layout than the G++ compiler.
</p>
<p>See <a href="#Interfacing-to-C_002b_002b">Interfacing to C++</a> for related information.
</p>
<hr>
<a name="Pragma-CPU"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Debug" accesskey="n" rel="next">Pragma Debug</a>, Previous: <a href="#Pragma-CPP_005fVtable" accesskey="p" rel="prev">Pragma CPP_Vtable</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-CPU-1"></a>
<h3 class="unnumberedsec">Pragma CPU</h3>
<a name="index-CPU"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma CPU (EXPRESSSION);
</pre></div>
<p>This pragma is standard in Ada 2012, but is available in all earlier
versions of Ada as an implementation-defined pragma.
See Ada 2012 Reference Manual for details.
</p>
<hr>
<a name="Pragma-Debug"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Debug_005fPolicy" accesskey="n" rel="next">Pragma Debug_Policy</a>, Previous: <a href="#Pragma-CPU" accesskey="p" rel="prev">Pragma CPU</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Debug-1"></a>
<h3 class="unnumberedsec">Pragma Debug</h3>
<a name="index-Debug"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Debug ([CONDITION, ]PROCEDURE_CALL_WITHOUT_SEMICOLON);
PROCEDURE_CALL_WITHOUT_SEMICOLON ::=
PROCEDURE_NAME
| PROCEDURE_PREFIX ACTUAL_PARAMETER_PART
</pre></div>
<p>The procedure call argument has the syntactic form of an expression, meeting
the syntactic requirements for pragmas.
</p>
<p>If debug pragmas are not enabled or if the condition is present and evaluates
to False, this pragma has no effect. If debug pragmas are enabled, the
semantics of the pragma is exactly equivalent to the procedure call statement
corresponding to the argument with a terminating semicolon. Pragmas are
permitted in sequences of declarations, so you can use pragma <code>Debug</code> to
intersperse calls to debug procedures in the middle of declarations. Debug
pragmas can be enabled either by use of the command line switch <samp>-gnata</samp>
or by use of the configuration pragma <code>Debug_Policy</code>.
</p>
<hr>
<a name="Pragma-Debug_005fPolicy"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Default_005fStorage_005fPool" accesskey="n" rel="next">Pragma Default_Storage_Pool</a>, Previous: <a href="#Pragma-Debug" accesskey="p" rel="prev">Pragma Debug</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Debug_005fPolicy-1"></a>
<h3 class="unnumberedsec">Pragma Debug_Policy</h3>
<a name="index-Debug_005fPolicy-1"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Debug_Policy (CHECK | DISABLE | IGNORE);
</pre></div>
<p>If the argument is <code>CHECK</code>, then pragma <code>DEBUG</code> is enabled.
If the argument is <code>IGNORE</code>, then pragma <code>DEBUG</code> is ignored.
This pragma overrides the effect of the <samp>-gnata</samp> switch on the
command line.
</p>
<p>The implementation defined policy <code>DISABLE</code> is like
<code>IGNORE</code> except that it completely disables semantic
checking of the argument to <code>pragma Debug</code>. This may
be useful when the pragma argument references subprograms
in a with’ed package which is replaced by a dummy package
for the final build.
</p>
<hr>
<a name="Pragma-Default_005fStorage_005fPool"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Detect_005fBlocking" accesskey="n" rel="next">Pragma Detect_Blocking</a>, Previous: <a href="#Pragma-Debug_005fPolicy" accesskey="p" rel="prev">Pragma Debug_Policy</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Default_005fStorage_005fPool-1"></a>
<h3 class="unnumberedsec">Pragma Default_Storage_Pool</h3>
<a name="index-Default_005fStorage_005fPool"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Default_Storage_Pool (storage_pool_NAME | null);
</pre></div>
<p>This pragma is standard in Ada 2012, but is available in all earlier
versions of Ada as an implementation-defined pragma.
See Ada 2012 Reference Manual for details.
</p>
<hr>
<a name="Pragma-Detect_005fBlocking"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Dispatching_005fDomain" accesskey="n" rel="next">Pragma Dispatching_Domain</a>, Previous: <a href="#Pragma-Default_005fStorage_005fPool" accesskey="p" rel="prev">Pragma Default_Storage_Pool</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Detect_005fBlocking-1"></a>
<h3 class="unnumberedsec">Pragma Detect_Blocking</h3>
<a name="index-Detect_005fBlocking"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Detect_Blocking;
</pre></div>
<p>This is a standard pragma in Ada 2005, that is available in all earlier
versions of Ada as an implementation-defined pragma.
</p>
<p>This is a configuration pragma that forces the detection of potentially
blocking operations within a protected operation, and to raise Program_Error
if that happens.
</p>
<hr>
<a name="Pragma-Dispatching_005fDomain"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Elaboration_005fChecks" accesskey="n" rel="next">Pragma Elaboration_Checks</a>, Previous: <a href="#Pragma-Detect_005fBlocking" accesskey="p" rel="prev">Pragma Detect_Blocking</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Dispatching_005fDomain-1"></a>
<h3 class="unnumberedsec">Pragma Dispatching_Domain</h3>
<a name="index-Dispatching_005fDomain"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Dispatching_Domain (EXPRESSION);
</pre></div>
<p>This pragma is standard in Ada 2012, but is available in all earlier
versions of Ada as an implementation-defined pragma.
See Ada 2012 Reference Manual for details.
</p>
<hr>
<a name="Pragma-Elaboration_005fChecks"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Eliminate" accesskey="n" rel="next">Pragma Eliminate</a>, Previous: <a href="#Pragma-Dispatching_005fDomain" accesskey="p" rel="prev">Pragma Dispatching_Domain</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Elaboration_005fChecks-1"></a>
<h3 class="unnumberedsec">Pragma Elaboration_Checks</h3>
<a name="index-Elaboration-control"></a>
<a name="index-Elaboration_005fChecks"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Elaboration_Checks (Dynamic | Static);
</pre></div>
<p>This is a configuration pragma that provides control over the
elaboration model used by the compilation affected by the
pragma. If the parameter is <code>Dynamic</code>,
then the dynamic elaboration
model described in the Ada Reference Manual is used, as though
the <samp>-gnatE</samp> switch had been specified on the command
line. If the parameter is <code>Static</code>, then the default GNAT static
model is used. This configuration pragma overrides the setting
of the command line. For full details on the elaboration models
used by the GNAT compiler, see <a href="gnat_ugn.html#Elaboration-Order-Handling-in-GNAT">Elaboration Order Handling in GNAT</a> in <cite>GNAT User’s Guide</cite>.
</p>
<hr>
<a name="Pragma-Eliminate"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Export_005fException" accesskey="n" rel="next">Pragma Export_Exception</a>, Previous: <a href="#Pragma-Elaboration_005fChecks" accesskey="p" rel="prev">Pragma Elaboration_Checks</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Eliminate-1"></a>
<h3 class="unnumberedsec">Pragma Eliminate</h3>
<a name="index-Elimination-of-unused-subprograms"></a>
<a name="index-Eliminate"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Eliminate ([Entity =>] DEFINING_DESIGNATOR,
[Source_Location =>] STRING_LITERAL);
</pre></div>
<p>The string literal given for the source location is a string which
specifies the line number of the occurrence of the entity, using
the syntax for SOURCE_TRACE given below:
</p>
<div class="smallexample">
<pre class="smallexample"> SOURCE_TRACE ::= SOURCE_REFERENCE [LBRACKET SOURCE_TRACE RBRACKET]
LBRACKET ::= [
RBRACKET ::= ]
SOURCE_REFERENCE ::= FILE_NAME : LINE_NUMBER
LINE_NUMBER ::= DIGIT {DIGIT}
</pre></div>
<p>Spaces around the colon in a <code>Source_Reference</code> are optional.
</p>
<p>The <code>DEFINING_DESIGNATOR</code> matches the defining designator used in an
explicit subprogram declaration, where the <code>entity</code> name in this
designator appears on the source line specified by the source location.
</p>
<p>The source trace that is given as the <code>Source_Location</code> shall obey the
following rules. The <code>FILE_NAME</code> is the short name (with no directory
information) of an Ada source file, given using exactly the required syntax
for the underlying file system (e.g. case is important if the underlying
operating system is case sensitive). <code>LINE_NUMBER</code> gives the line
number of the occurrence of the <code>entity</code>
as a decimal literal without an exponent or point. If an <code>entity</code> is not
declared in a generic instantiation (this includes generic subprogram
instances), the source trace includes only one source reference. If an entity
is declared inside a generic instantiation, its source trace (when parsing
from left to right) starts with the source location of the declaration of the
entity in the generic unit and ends with the source location of the
instantiation (it is given in square brackets). This approach is recursively
used in case of nested instantiations: the rightmost (nested most deeply in
square brackets) element of the source trace is the location of the outermost
instantiation, the next to left element is the location of the next (first
nested) instantiation in the code of the corresponding generic unit, and so
on, and the leftmost element (that is out of any square brackets) is the
location of the declaration of the entity to eliminate in a generic unit.
</p>
<p>Note that the <code>Source_Location</code> argument specifies which of a set of
similarly named entities is being eliminated, dealing both with overloading,
and also appearence of the same entity name in different scopes.
</p>
<p>This pragma indicates that the given entity is not used in the program to be
compiled and built. The effect of the pragma is to allow the compiler to
eliminate the code or data associated with the named entity. Any reference to
an eliminated entity causes a compile-time or link-time error.
</p>
<p>The intention of pragma <code>Eliminate</code> is to allow a program to be compiled
in a system-independent manner, with unused entities eliminated, without
needing to modify the source text. Normally the required set of
<code>Eliminate</code> pragmas is constructed automatically using the gnatelim tool.
</p>
<p>Any source file change that removes, splits, or
adds lines may make the set of Eliminate pragmas invalid because their
<code>Source_Location</code> argument values may get out of date.
</p>
<p>Pragma <code>Eliminate</code> may be used where the referenced entity is a dispatching
operation. In this case all the subprograms to which the given operation can
dispatch are considered to be unused (are never called as a result of a direct
or a dispatching call).
</p>
<hr>
<a name="Pragma-Export_005fException"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Export_005fFunction" accesskey="n" rel="next">Pragma Export_Function</a>, Previous: <a href="#Pragma-Eliminate" accesskey="p" rel="prev">Pragma Eliminate</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Export_005fException-1"></a>
<h3 class="unnumberedsec">Pragma Export_Exception</h3>
<a name="index-OpenVMS-2"></a>
<a name="index-Export_005fException"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Export_Exception (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Form =>] Ada | VMS]
[, [Code =>] static_integer_EXPRESSION]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
</pre></div>
<p>This pragma is implemented only in the OpenVMS implementation of GNAT. It
causes the specified exception to be propagated outside of the Ada program,
so that it can be handled by programs written in other OpenVMS languages.
This pragma establishes an external name for an Ada exception and makes the
name available to the OpenVMS Linker as a global symbol. For further details
on this pragma, see the
DEC Ada Language Reference Manual, section 13.9a3.2.
</p>
<hr>
<a name="Pragma-Export_005fFunction"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Export_005fObject" accesskey="n" rel="next">Pragma Export_Object</a>, Previous: <a href="#Pragma-Export_005fException" accesskey="p" rel="prev">Pragma Export_Exception</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Export_005fFunction-1"></a>
<h3 class="unnumberedsec">Pragma Export_Function</h3>
<a name="index-Argument-passing-mechanisms"></a>
<a name="index-Export_005fFunction"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Export_Function (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Parameter_Types =>] PARAMETER_TYPES]
[, [Result_Type =>] result_SUBTYPE_MARK]
[, [Mechanism =>] MECHANISM]
[, [Result_Mechanism =>] MECHANISM_NAME]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
| ""
PARAMETER_TYPES ::=
null
| TYPE_DESIGNATOR {, TYPE_DESIGNATOR}
TYPE_DESIGNATOR ::=
subtype_NAME
| subtype_Name ' Access
MECHANISM ::=
MECHANISM_NAME
| (MECHANISM_ASSOCIATION {, MECHANISM_ASSOCIATION})
MECHANISM_ASSOCIATION ::=
[formal_parameter_NAME =>] MECHANISM_NAME
MECHANISM_NAME ::=
Value
| Reference
| Descriptor [([Class =>] CLASS_NAME)]
| Short_Descriptor [([Class =>] CLASS_NAME)]
CLASS_NAME ::= ubs | ubsb | uba | s | sb | a
</pre></div>
<p>Use this pragma to make a function externally callable and optionally
provide information on mechanisms to be used for passing parameter and
result values. We recommend, for the purposes of improving portability,
this pragma always be used in conjunction with a separate pragma
<code>Export</code>, which must precede the pragma <code>Export_Function</code>.
GNAT does not require a separate pragma <code>Export</code>, but if none is
present, <code>Convention Ada</code> is assumed, which is usually
not what is wanted, so it is usually appropriate to use this
pragma in conjunction with a <code>Export</code> or <code>Convention</code>
pragma that specifies the desired foreign convention.
Pragma <code>Export_Function</code>
(and <code>Export</code>, if present) must appear in the same declarative
region as the function to which they apply.
</p>
<p><var>internal_name</var> must uniquely designate the function to which the
pragma applies. If more than one function name exists of this name in
the declarative part you must use the <code>Parameter_Types</code> and
<code>Result_Type</code> parameters is mandatory to achieve the required
unique designation. <var>subtype_mark</var>s in these parameters must
exactly match the subtypes in the corresponding function specification,
using positional notation to match parameters with subtype marks.
The form with an <code>'Access</code> attribute can be used to match an
anonymous access parameter.
</p>
<a name="index-OpenVMS-3"></a>
<a name="index-Passing-by-descriptor"></a>
<p>Passing by descriptor is supported only on the OpenVMS ports of GNAT.
The default behavior for Export_Function is to accept either 64bit or
32bit descriptors unless short_descriptor is specified, then only 32bit
descriptors are accepted.
</p>
<a name="index-Suppressing-external-name"></a>
<p>Special treatment is given if the EXTERNAL is an explicit null
string or a static string expressions that evaluates to the null
string. In this case, no external name is generated. This form
still allows the specification of parameter mechanisms.
</p>
<hr>
<a name="Pragma-Export_005fObject"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Export_005fProcedure" accesskey="n" rel="next">Pragma Export_Procedure</a>, Previous: <a href="#Pragma-Export_005fFunction" accesskey="p" rel="prev">Pragma Export_Function</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Export_005fObject-1"></a>
<h3 class="unnumberedsec">Pragma Export_Object</h3>
<a name="index-Export_005fObject"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Export_Object
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Size =>] EXTERNAL_SYMBOL]
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
</pre></div>
<p>This pragma designates an object as exported, and apart from the
extended rules for external symbols, is identical in effect to the use of
the normal <code>Export</code> pragma applied to an object. You may use a
separate Export pragma (and you probably should from the point of view
of portability), but it is not required. <var>Size</var> is syntax checked,
but otherwise ignored by GNAT.
</p>
<hr>
<a name="Pragma-Export_005fProcedure"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Export_005fValue" accesskey="n" rel="next">Pragma Export_Value</a>, Previous: <a href="#Pragma-Export_005fObject" accesskey="p" rel="prev">Pragma Export_Object</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Export_005fProcedure-1"></a>
<h3 class="unnumberedsec">Pragma Export_Procedure</h3>
<a name="index-Export_005fProcedure"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Export_Procedure (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Parameter_Types =>] PARAMETER_TYPES]
[, [Mechanism =>] MECHANISM]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
| ""
PARAMETER_TYPES ::=
null
| TYPE_DESIGNATOR {, TYPE_DESIGNATOR}
TYPE_DESIGNATOR ::=
subtype_NAME
| subtype_Name ' Access
MECHANISM ::=
MECHANISM_NAME
| (MECHANISM_ASSOCIATION {, MECHANISM_ASSOCIATION})
MECHANISM_ASSOCIATION ::=
[formal_parameter_NAME =>] MECHANISM_NAME
MECHANISM_NAME ::=
Value
| Reference
| Descriptor [([Class =>] CLASS_NAME)]
| Short_Descriptor [([Class =>] CLASS_NAME)]
CLASS_NAME ::= ubs | ubsb | uba | s | sb | a
</pre></div>
<p>This pragma is identical to <code>Export_Function</code> except that it
applies to a procedure rather than a function and the parameters
<code>Result_Type</code> and <code>Result_Mechanism</code> are not permitted.
GNAT does not require a separate pragma <code>Export</code>, but if none is
present, <code>Convention Ada</code> is assumed, which is usually
not what is wanted, so it is usually appropriate to use this
pragma in conjunction with a <code>Export</code> or <code>Convention</code>
pragma that specifies the desired foreign convention.
</p>
<a name="index-OpenVMS-4"></a>
<a name="index-Passing-by-descriptor-1"></a>
<p>Passing by descriptor is supported only on the OpenVMS ports of GNAT.
The default behavior for Export_Procedure is to accept either 64bit or
32bit descriptors unless short_descriptor is specified, then only 32bit
descriptors are accepted.
</p>
<a name="index-Suppressing-external-name-1"></a>
<p>Special treatment is given if the EXTERNAL is an explicit null
string or a static string expressions that evaluates to the null
string. In this case, no external name is generated. This form
still allows the specification of parameter mechanisms.
</p>
<hr>
<a name="Pragma-Export_005fValue"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Export_005fValued_005fProcedure" accesskey="n" rel="next">Pragma Export_Valued_Procedure</a>, Previous: <a href="#Pragma-Export_005fProcedure" accesskey="p" rel="prev">Pragma Export_Procedure</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Export_005fValue-1"></a>
<h3 class="unnumberedsec">Pragma Export_Value</h3>
<a name="index-Export_005fValue"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Export_Value (
[Value =>] static_integer_EXPRESSION,
[Link_Name =>] static_string_EXPRESSION);
</pre></div>
<p>This pragma serves to export a static integer value for external use.
The first argument specifies the value to be exported. The Link_Name
argument specifies the symbolic name to be associated with the integer
value. This pragma is useful for defining a named static value in Ada
that can be referenced in assembly language units to be linked with
the application. This pragma is currently supported only for the
AAMP target and is ignored for other targets.
</p>
<hr>
<a name="Pragma-Export_005fValued_005fProcedure"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Extend_005fSystem" accesskey="n" rel="next">Pragma Extend_System</a>, Previous: <a href="#Pragma-Export_005fValue" accesskey="p" rel="prev">Pragma Export_Value</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Export_005fValued_005fProcedure-1"></a>
<h3 class="unnumberedsec">Pragma Export_Valued_Procedure</h3>
<a name="index-Export_005fValued_005fProcedure"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Export_Valued_Procedure (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Parameter_Types =>] PARAMETER_TYPES]
[, [Mechanism =>] MECHANISM]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
| ""
PARAMETER_TYPES ::=
null
| TYPE_DESIGNATOR {, TYPE_DESIGNATOR}
TYPE_DESIGNATOR ::=
subtype_NAME
| subtype_Name ' Access
MECHANISM ::=
MECHANISM_NAME
| (MECHANISM_ASSOCIATION {, MECHANISM_ASSOCIATION})
MECHANISM_ASSOCIATION ::=
[formal_parameter_NAME =>] MECHANISM_NAME
MECHANISM_NAME ::=
Value
| Reference
| Descriptor [([Class =>] CLASS_NAME)]
| Short_Descriptor [([Class =>] CLASS_NAME)]
CLASS_NAME ::= ubs | ubsb | uba | s | sb | a
</pre></div>
<p>This pragma is identical to <code>Export_Procedure</code> except that the
first parameter of <var>LOCAL_NAME</var>, which must be present, must be of
mode <code>OUT</code>, and externally the subprogram is treated as a function
with this parameter as the result of the function. GNAT provides for
this capability to allow the use of <code>OUT</code> and <code>IN OUT</code>
parameters in interfacing to external functions (which are not permitted
in Ada functions).
GNAT does not require a separate pragma <code>Export</code>, but if none is
present, <code>Convention Ada</code> is assumed, which is almost certainly
not what is wanted since the whole point of this pragma is to interface
with foreign language functions, so it is usually appropriate to use this
pragma in conjunction with a <code>Export</code> or <code>Convention</code>
pragma that specifies the desired foreign convention.
</p>
<a name="index-OpenVMS-5"></a>
<a name="index-Passing-by-descriptor-2"></a>
<p>Passing by descriptor is supported only on the OpenVMS ports of GNAT.
The default behavior for Export_Valued_Procedure is to accept either 64bit or
32bit descriptors unless short_descriptor is specified, then only 32bit
descriptors are accepted.
</p>
<a name="index-Suppressing-external-name-2"></a>
<p>Special treatment is given if the EXTERNAL is an explicit null
string or a static string expressions that evaluates to the null
string. In this case, no external name is generated. This form
still allows the specification of parameter mechanisms.
</p>
<hr>
<a name="Pragma-Extend_005fSystem"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Extensions_005fAllowed" accesskey="n" rel="next">Pragma Extensions_Allowed</a>, Previous: <a href="#Pragma-Export_005fValued_005fProcedure" accesskey="p" rel="prev">Pragma Export_Valued_Procedure</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Extend_005fSystem-1"></a>
<h3 class="unnumberedsec">Pragma Extend_System</h3>
<a name="index-system_002c-extending"></a>
<a name="index-Dec-Ada-83"></a>
<a name="index-Extend_005fSystem"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Extend_System ([Name =>] IDENTIFIER);
</pre></div>
<p>This pragma is used to provide backwards compatibility with other
implementations that extend the facilities of package <code>System</code>. In
GNAT, <code>System</code> contains only the definitions that are present in
the Ada RM. However, other implementations, notably the DEC Ada 83
implementation, provide many extensions to package <code>System</code>.
</p>
<p>For each such implementation accommodated by this pragma, GNAT provides a
package <code>Aux_<var>xxx</var></code>, e.g. <code>Aux_DEC</code> for the DEC Ada 83
implementation, which provides the required additional definitions. You
can use this package in two ways. You can <code>with</code> it in the normal
way and access entities either by selection or using a <code>use</code>
clause. In this case no special processing is required.
</p>
<p>However, if existing code contains references such as
<code>System.<var>xxx</var></code> where <var>xxx</var> is an entity in the extended
definitions provided in package <code>System</code>, you may use this pragma
to extend visibility in <code>System</code> in a non-standard way that
provides greater compatibility with the existing code. Pragma
<code>Extend_System</code> is a configuration pragma whose single argument is
the name of the package containing the extended definition
(e.g. <code>Aux_DEC</code> for the DEC Ada case). A unit compiled under
control of this pragma will be processed using special visibility
processing that looks in package <code>System.Aux_<var>xxx</var></code> where
<code>Aux_<var>xxx</var></code> is the pragma argument for any entity referenced in
package <code>System</code>, but not found in package <code>System</code>.
</p>
<p>You can use this pragma either to access a predefined <code>System</code>
extension supplied with the compiler, for example <code>Aux_DEC</code> or
you can construct your own extension unit following the above
definition. Note that such a package is a child of <code>System</code>
and thus is considered part of the implementation. To compile
it you will have to use the appropriate switch for compiling
system units.
See <a href="gnat_ugn.html#Top">About This Guide</a> in <cite>GNAT User’s Guide</cite>,
for details.
</p>
<hr>
<a name="Pragma-Extensions_005fAllowed"></a>
<div class="header">
<p>
Next: <a href="#Pragma-External" accesskey="n" rel="next">Pragma External</a>, Previous: <a href="#Pragma-Extend_005fSystem" accesskey="p" rel="prev">Pragma Extend_System</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Extensions_005fAllowed-1"></a>
<h3 class="unnumberedsec">Pragma Extensions_Allowed</h3>
<a name="index-Ada-Extensions"></a>
<a name="index-GNAT-Extensions"></a>
<a name="index-Extensions_005fAllowed"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Extensions_Allowed (On | Off);
</pre></div>
<p>This configuration pragma enables or disables the implementation
extension mode (the use of Off as a parameter cancels the effect
of the <samp>-gnatX</samp> command switch).
</p>
<p>In extension mode, the latest version of the Ada language is
implemented (currently Ada 2012), and in addition a small number
of GNAT specific extensions are recognized as follows:
</p>
<dl compact="compact">
<dt>Constrained attribute for generic objects</dt>
<dd><p>The <code>Constrained</code> attribute is permitted for objects of
generic types. The result indicates if the corresponding actual
is constrained.
</p>
</dd>
</dl>
<hr>
<a name="Pragma-External"></a>
<div class="header">
<p>
Next: <a href="#Pragma-External_005fName_005fCasing" accesskey="n" rel="next">Pragma External_Name_Casing</a>, Previous: <a href="#Pragma-Extensions_005fAllowed" accesskey="p" rel="prev">Pragma Extensions_Allowed</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-External-1"></a>
<h3 class="unnumberedsec">Pragma External</h3>
<a name="index-External"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma External (
[ Convention =>] convention_IDENTIFIER,
[ Entity =>] LOCAL_NAME
[, [External_Name =>] static_string_EXPRESSION ]
[, [Link_Name =>] static_string_EXPRESSION ]);
</pre></div>
<p>This pragma is identical in syntax and semantics to pragma
<code>Export</code> as defined in the Ada Reference Manual. It is
provided for compatibility with some Ada 83 compilers that
used this pragma for exactly the same purposes as pragma
<code>Export</code> before the latter was standardized.
</p>
<hr>
<a name="Pragma-External_005fName_005fCasing"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Fast_005fMath" accesskey="n" rel="next">Pragma Fast_Math</a>, Previous: <a href="#Pragma-External" accesskey="p" rel="prev">Pragma External</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-External_005fName_005fCasing-1"></a>
<h3 class="unnumberedsec">Pragma External_Name_Casing</h3>
<a name="index-Dec-Ada-83-casing-compatibility"></a>
<a name="index-External-Names_002c-casing"></a>
<a name="index-Casing-of-External-names"></a>
<a name="index-External_005fName_005fCasing"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma External_Name_Casing (
Uppercase | Lowercase
[, Uppercase | Lowercase | As_Is]);
</pre></div>
<p>This pragma provides control over the casing of external names associated
with Import and Export pragmas. There are two cases to consider:
</p>
<dl compact="compact">
<dt>Implicit external names</dt>
<dd><p>Implicit external names are derived from identifiers. The most common case
arises when a standard Ada Import or Export pragma is used with only two
arguments, as in:
</p>
<div class="smallexample">
<pre class="smallexample"> pragma Import (C, C_Routine);
</pre></div>
<p>Since Ada is a case-insensitive language, the spelling of the identifier in
the Ada source program does not provide any information on the desired
casing of the external name, and so a convention is needed. In GNAT the
default treatment is that such names are converted to all lower case
letters. This corresponds to the normal C style in many environments.
The first argument of pragma <code>External_Name_Casing</code> can be used to
control this treatment. If <code>Uppercase</code> is specified, then the name
will be forced to all uppercase letters. If <code>Lowercase</code> is specified,
then the normal default of all lower case letters will be used.
</p>
<p>This same implicit treatment is also used in the case of extended DEC Ada 83
compatible Import and Export pragmas where an external name is explicitly
specified using an identifier rather than a string.
</p>
</dd>
<dt>Explicit external names</dt>
<dd><p>Explicit external names are given as string literals. The most common case
arises when a standard Ada Import or Export pragma is used with three
arguments, as in:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Import (C, C_Routine, "C_routine");
</pre></div>
<p>In this case, the string literal normally provides the exact casing required
for the external name. The second argument of pragma
<code>External_Name_Casing</code> may be used to modify this behavior.
If <code>Uppercase</code> is specified, then the name
will be forced to all uppercase letters. If <code>Lowercase</code> is specified,
then the name will be forced to all lowercase letters. A specification of
<code>As_Is</code> provides the normal default behavior in which the casing is
taken from the string provided.
</p></dd>
</dl>
<p>This pragma may appear anywhere that a pragma is valid. In particular, it
can be used as a configuration pragma in the <samp>gnat.adc</samp> file, in which
case it applies to all subsequent compilations, or it can be used as a program
unit pragma, in which case it only applies to the current unit, or it can
be used more locally to control individual Import/Export pragmas.
</p>
<p>It is primarily intended for use with OpenVMS systems, where many
compilers convert all symbols to upper case by default. For interfacing to
such compilers (e.g. the DEC C compiler), it may be convenient to use
the pragma:
</p>
<div class="smallexample">
<pre class="smallexample">pragma External_Name_Casing (Uppercase, Uppercase);
</pre></div>
<p>to enforce the upper casing of all external symbols.
</p>
<hr>
<a name="Pragma-Fast_005fMath"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Favor_005fTop_005fLevel" accesskey="n" rel="next">Pragma Favor_Top_Level</a>, Previous: <a href="#Pragma-External_005fName_005fCasing" accesskey="p" rel="prev">Pragma External_Name_Casing</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Fast_005fMath-1"></a>
<h3 class="unnumberedsec">Pragma Fast_Math</h3>
<a name="index-Fast_005fMath"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Fast_Math;
</pre></div>
<p>This is a configuration pragma which activates a mode in which speed is
considered more important for floating-point operations than absolutely
accurate adherence to the requirements of the standard. Currently the
following operations are affected:
</p>
<dl compact="compact">
<dt>Complex Multiplication</dt>
<dd><p>The normal simple formula for complex multiplication can result in intermediate
overflows for numbers near the end of the range. The Ada standard requires that
this situation be detected and corrected by scaling, but in Fast_Math mode such
cases will simply result in overflow. Note that to take advantage of this you
must instantiate your own version of <code>Ada.Numerics.Generic_Complex_Types</code>
under control of the pragma, rather than use the preinstantiated versions.
</p></dd>
</dl>
<hr>
<a name="Pragma-Favor_005fTop_005fLevel"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Finalize_005fStorage_005fOnly" accesskey="n" rel="next">Pragma Finalize_Storage_Only</a>, Previous: <a href="#Pragma-Fast_005fMath" accesskey="p" rel="prev">Pragma Fast_Math</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Favor_005fTop_005fLevel-1"></a>
<h3 class="unnumberedsec">Pragma Favor_Top_Level</h3>
<a name="index-Favor_005fTop_005fLevel"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Favor_Top_Level (type_NAME);
</pre></div>
<p>The named type must be an access-to-subprogram type. This pragma is an
efficiency hint to the compiler, regarding the use of ’Access or
’Unrestricted_Access on nested (non-library-level) subprograms. The
pragma means that nested subprograms are not used with this type, or
are rare, so that the generated code should be efficient in the
top-level case. When this pragma is used, dynamically generated
trampolines may be used on some targets for nested subprograms.
See also the No_Implicit_Dynamic_Code restriction.
</p>
<hr>
<a name="Pragma-Finalize_005fStorage_005fOnly"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Float_005fRepresentation" accesskey="n" rel="next">Pragma Float_Representation</a>, Previous: <a href="#Pragma-Favor_005fTop_005fLevel" accesskey="p" rel="prev">Pragma Favor_Top_Level</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Finalize_005fStorage_005fOnly-1"></a>
<h3 class="unnumberedsec">Pragma Finalize_Storage_Only</h3>
<a name="index-Finalize_005fStorage_005fOnly"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Finalize_Storage_Only (first_subtype_LOCAL_NAME);
</pre></div>
<p>This pragma allows the compiler not to emit a Finalize call for objects
defined at the library level. This is mostly useful for types where
finalization is only used to deal with storage reclamation since in most
environments it is not necessary to reclaim memory just before terminating
execution, hence the name.
</p>
<hr>
<a name="Pragma-Float_005fRepresentation"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ident" accesskey="n" rel="next">Pragma Ident</a>, Previous: <a href="#Pragma-Finalize_005fStorage_005fOnly" accesskey="p" rel="prev">Pragma Finalize_Storage_Only</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Float_005fRepresentation-1"></a>
<h3 class="unnumberedsec">Pragma Float_Representation</h3>
<a name="index-OpenVMS-6"></a>
<a name="index-Float_005fRepresentation"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Float_Representation (FLOAT_REP[, float_type_LOCAL_NAME]);
FLOAT_REP ::= VAX_Float | IEEE_Float
</pre></div>
<p>In the one argument form, this pragma is a configuration pragma which
allows control over the internal representation chosen for the predefined
floating point types declared in the packages <code>Standard</code> and
<code>System</code>. On all systems other than OpenVMS, the argument must
be <code>IEEE_Float</code> and the pragma has no effect. On OpenVMS, the
argument may be <code>VAX_Float</code> to specify the use of the VAX float
format for the floating-point types in Standard. This requires that
the standard runtime libraries be recompiled.
</p>
<p>The two argument form specifies the representation to be used for
the specified floating-point type. On all systems other than OpenVMS,
the argument must
be <code>IEEE_Float</code> and the pragma has no effect. On OpenVMS, the
argument may be <code>VAX_Float</code> to specify the use of the VAX float
format, as follows:
</p>
<ul>
<li> For digits values up to 6, F float format will be used.
</li><li> For digits values from 7 to 9, D float format will be used.
</li><li> For digits values from 10 to 15, G float format will be used.
</li><li> Digits values above 15 are not allowed.
</li></ul>
<hr>
<a name="Pragma-Ident"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Implementation_005fDefined" accesskey="n" rel="next">Pragma Implementation_Defined</a>, Previous: <a href="#Pragma-Float_005fRepresentation" accesskey="p" rel="prev">Pragma Float_Representation</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ident-1"></a>
<h3 class="unnumberedsec">Pragma Ident</h3>
<a name="index-Ident"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Ident (static_string_EXPRESSION);
</pre></div>
<p>This pragma provides a string identification in the generated object file,
if the system supports the concept of this kind of identification string.
This pragma is allowed only in the outermost declarative part or
declarative items of a compilation unit. If more than one <code>Ident</code>
pragma is given, only the last one processed is effective.
<a name="index-OpenVMS-7"></a>
On OpenVMS systems, the effect of the pragma is identical to the effect of
the DEC Ada 83 pragma of the same name. Note that in DEC Ada 83, the
maximum allowed length is 31 characters, so if it is important to
maintain compatibility with this compiler, you should obey this length
limit.
</p>
<hr>
<a name="Pragma-Implementation_005fDefined"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Implemented" accesskey="n" rel="next">Pragma Implemented</a>, Previous: <a href="#Pragma-Ident" accesskey="p" rel="prev">Pragma Ident</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Implementation_005fDefined-1"></a>
<h3 class="unnumberedsec">Pragma Implementation_Defined</h3>
<a name="index-Implementation_005fDefined"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Implementation_Defined (local_NAME);
</pre></div>
<p>This pragma marks a previously declared entioty as implementation-defined.
For an overloaded entity, applies to the most recent homonym.
</p>
<div class="smallexample">
<pre class="smallexample">pragma Implementation_Defined;
</pre></div>
<p>The form with no arguments appears anywhere within a scope, most
typically a package spec, and indicates that all entities that are
defined within the package spec are Implementation_Defined.
</p>
<p>This pragma is used within the GNAT runtime library to identify
implementation-defined entities introduced in language-defined units,
for the purpose of implementing the No_Implementation_Identifiers
restriction.
</p>
<hr>
<a name="Pragma-Implemented"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Implicit_005fPacking" accesskey="n" rel="next">Pragma Implicit_Packing</a>, Previous: <a href="#Pragma-Implementation_005fDefined" accesskey="p" rel="prev">Pragma Implementation_Defined</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Implemented-1"></a>
<h3 class="unnumberedsec">Pragma Implemented</h3>
<a name="index-Implemented"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Implemented (procedure_LOCAL_NAME, implementation_kind);
implementation_kind ::= By_Entry | By_Protected_Procedure | By_Any
</pre></div>
<p>This is an Ada 2012 representation pragma which applies to protected, task
and synchronized interface primitives. The use of pragma Implemented provides
a way to impose a static requirement on the overriding operation by adhering
to one of the three implementation kinds: entry, protected procedure or any of
the above. This pragma is available in all earlier versions of Ada as an
implementation-defined pragma.
</p>
<div class="smallexample">
<pre class="smallexample">type Synch_Iface is synchronized interface;
procedure Prim_Op (Obj : in out Iface) is abstract;
pragma Implemented (Prim_Op, By_Protected_Procedure);
protected type Prot_1 is new Synch_Iface with
procedure Prim_Op; -- Legal
end Prot_1;
protected type Prot_2 is new Synch_Iface with
entry Prim_Op; -- Illegal
end Prot_2;
task type Task_Typ is new Synch_Iface with
entry Prim_Op; -- Illegal
end Task_Typ;
</pre></div>
<p>When applied to the procedure_or_entry_NAME of a requeue statement, pragma
Implemented determines the runtime behavior of the requeue. Implementation kind
By_Entry guarantees that the action of requeueing will proceed from an entry to
another entry. Implementation kind By_Protected_Procedure transforms the
requeue into a dispatching call, thus eliminating the chance of blocking. Kind
By_Any shares the behavior of By_Entry and By_Protected_Procedure depending on
the target’s overriding subprogram kind.
</p>
<hr>
<a name="Pragma-Implicit_005fPacking"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Import_005fException" accesskey="n" rel="next">Pragma Import_Exception</a>, Previous: <a href="#Pragma-Implemented" accesskey="p" rel="prev">Pragma Implemented</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Implicit_005fPacking-1"></a>
<h3 class="unnumberedsec">Pragma Implicit_Packing</h3>
<a name="index-Implicit_005fPacking"></a>
<a name="index-Rational-Profile"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Implicit_Packing;
</pre></div>
<p>This is a configuration pragma that requests implicit packing for packed
arrays for which a size clause is given but no explicit pragma Pack or
specification of Component_Size is present. It also applies to records
where no record representation clause is present. Consider this example:
</p>
<div class="smallexample">
<pre class="smallexample">type R is array (0 .. 7) of Boolean;
for R'Size use 8;
</pre></div>
<p>In accordance with the recommendation in the RM (RM 13.3(53)), a Size clause
does not change the layout of a composite object. So the Size clause in the
above example is normally rejected, since the default layout of the array uses
8-bit components, and thus the array requires a minimum of 64 bits.
</p>
<p>If this declaration is compiled in a region of code covered by an occurrence
of the configuration pragma Implicit_Packing, then the Size clause in this
and similar examples will cause implicit packing and thus be accepted. For
this implicit packing to occur, the type in question must be an array of small
components whose size is known at compile time, and the Size clause must
specify the exact size that corresponds to the length of the array multiplied
by the size in bits of the component type.
<a name="index-Array-packing"></a>
</p>
<p>Similarly, the following example shows the use in the record case
</p>
<div class="smallexample">
<pre class="smallexample">type r is record
a, b, c, d, e, f, g, h : boolean;
chr : character;
end record;
for r'size use 16;
</pre></div>
<p>Without a pragma Pack, each Boolean field requires 8 bits, so the
minimum size is 72 bits, but with a pragma Pack, 16 bits would be
sufficient. The use of pragma Implicit_Packing allows this record
declaration to compile without an explicit pragma Pack.
</p><hr>
<a name="Pragma-Import_005fException"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Import_005fFunction" accesskey="n" rel="next">Pragma Import_Function</a>, Previous: <a href="#Pragma-Implicit_005fPacking" accesskey="p" rel="prev">Pragma Implicit_Packing</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Import_005fException-1"></a>
<h3 class="unnumberedsec">Pragma Import_Exception</h3>
<a name="index-OpenVMS-8"></a>
<a name="index-Import_005fException"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Import_Exception (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Form =>] Ada | VMS]
[, [Code =>] static_integer_EXPRESSION]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
</pre></div>
<p>This pragma is implemented only in the OpenVMS implementation of GNAT.
It allows OpenVMS conditions (for example, from OpenVMS system services or
other OpenVMS languages) to be propagated to Ada programs as Ada exceptions.
The pragma specifies that the exception associated with an exception
declaration in an Ada program be defined externally (in non-Ada code).
For further details on this pragma, see the
DEC Ada Language Reference Manual, section 13.9a.3.1.
</p>
<hr>
<a name="Pragma-Import_005fFunction"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Import_005fObject" accesskey="n" rel="next">Pragma Import_Object</a>, Previous: <a href="#Pragma-Import_005fException" accesskey="p" rel="prev">Pragma Import_Exception</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Import_005fFunction-1"></a>
<h3 class="unnumberedsec">Pragma Import_Function</h3>
<a name="index-Import_005fFunction"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Import_Function (
[Internal =>] LOCAL_NAME,
[, [External =>] EXTERNAL_SYMBOL]
[, [Parameter_Types =>] PARAMETER_TYPES]
[, [Result_Type =>] SUBTYPE_MARK]
[, [Mechanism =>] MECHANISM]
[, [Result_Mechanism =>] MECHANISM_NAME]
[, [First_Optional_Parameter =>] IDENTIFIER]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
PARAMETER_TYPES ::=
null
| TYPE_DESIGNATOR {, TYPE_DESIGNATOR}
TYPE_DESIGNATOR ::=
subtype_NAME
| subtype_Name ' Access
MECHANISM ::=
MECHANISM_NAME
| (MECHANISM_ASSOCIATION {, MECHANISM_ASSOCIATION})
MECHANISM_ASSOCIATION ::=
[formal_parameter_NAME =>] MECHANISM_NAME
MECHANISM_NAME ::=
Value
| Reference
| Descriptor [([Class =>] CLASS_NAME)]
| Short_Descriptor [([Class =>] CLASS_NAME)]
CLASS_NAME ::= ubs | ubsb | uba | s | sb | a | nca
</pre></div>
<p>This pragma is used in conjunction with a pragma <code>Import</code> to
specify additional information for an imported function. The pragma
<code>Import</code> (or equivalent pragma <code>Interface</code>) must precede the
<code>Import_Function</code> pragma and both must appear in the same
declarative part as the function specification.
</p>
<p>The <var>Internal</var> argument must uniquely designate
the function to which the
pragma applies. If more than one function name exists of this name in
the declarative part you must use the <code>Parameter_Types</code> and
<var>Result_Type</var> parameters to achieve the required unique
designation. Subtype marks in these parameters must exactly match the
subtypes in the corresponding function specification, using positional
notation to match parameters with subtype marks.
The form with an <code>'Access</code> attribute can be used to match an
anonymous access parameter.
</p>
<p>You may optionally use the <var>Mechanism</var> and <var>Result_Mechanism</var>
parameters to specify passing mechanisms for the
parameters and result. If you specify a single mechanism name, it
applies to all parameters. Otherwise you may specify a mechanism on a
parameter by parameter basis using either positional or named
notation. If the mechanism is not specified, the default mechanism
is used.
</p>
<a name="index-OpenVMS-9"></a>
<a name="index-Passing-by-descriptor-3"></a>
<p>Passing by descriptor is supported only on the OpenVMS ports of GNAT.
The default behavior for Import_Function is to pass a 64bit descriptor
unless short_descriptor is specified, then a 32bit descriptor is passed.
</p>
<p><code>First_Optional_Parameter</code> applies only to OpenVMS ports of GNAT.
It specifies that the designated parameter and all following parameters
are optional, meaning that they are not passed at the generated code
level (this is distinct from the notion of optional parameters in Ada
where the parameters are passed anyway with the designated optional
parameters). All optional parameters must be of mode <code>IN</code> and have
default parameter values that are either known at compile time
expressions, or uses of the <code>'Null_Parameter</code> attribute.
</p>
<hr>
<a name="Pragma-Import_005fObject"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Import_005fProcedure" accesskey="n" rel="next">Pragma Import_Procedure</a>, Previous: <a href="#Pragma-Import_005fFunction" accesskey="p" rel="prev">Pragma Import_Function</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Import_005fObject-1"></a>
<h3 class="unnumberedsec">Pragma Import_Object</h3>
<a name="index-Import_005fObject"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Import_Object
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Size =>] EXTERNAL_SYMBOL]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
</pre></div>
<p>This pragma designates an object as imported, and apart from the
extended rules for external symbols, is identical in effect to the use of
the normal <code>Import</code> pragma applied to an object. Unlike the
subprogram case, you need not use a separate <code>Import</code> pragma,
although you may do so (and probably should do so from a portability
point of view). <var>size</var> is syntax checked, but otherwise ignored by
GNAT.
</p>
<hr>
<a name="Pragma-Import_005fProcedure"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Import_005fValued_005fProcedure" accesskey="n" rel="next">Pragma Import_Valued_Procedure</a>, Previous: <a href="#Pragma-Import_005fObject" accesskey="p" rel="prev">Pragma Import_Object</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Import_005fProcedure-1"></a>
<h3 class="unnumberedsec">Pragma Import_Procedure</h3>
<a name="index-Import_005fProcedure"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Import_Procedure (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Parameter_Types =>] PARAMETER_TYPES]
[, [Mechanism =>] MECHANISM]
[, [First_Optional_Parameter =>] IDENTIFIER]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
PARAMETER_TYPES ::=
null
| TYPE_DESIGNATOR {, TYPE_DESIGNATOR}
TYPE_DESIGNATOR ::=
subtype_NAME
| subtype_Name ' Access
MECHANISM ::=
MECHANISM_NAME
| (MECHANISM_ASSOCIATION {, MECHANISM_ASSOCIATION})
MECHANISM_ASSOCIATION ::=
[formal_parameter_NAME =>] MECHANISM_NAME
MECHANISM_NAME ::=
Value
| Reference
| Descriptor [([Class =>] CLASS_NAME)]
| Short_Descriptor [([Class =>] CLASS_NAME)]
CLASS_NAME ::= ubs | ubsb | uba | s | sb | a | nca
</pre></div>
<p>This pragma is identical to <code>Import_Function</code> except that it
applies to a procedure rather than a function and the parameters
<code>Result_Type</code> and <code>Result_Mechanism</code> are not permitted.
</p>
<hr>
<a name="Pragma-Import_005fValued_005fProcedure"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Independent" accesskey="n" rel="next">Pragma Independent</a>, Previous: <a href="#Pragma-Import_005fProcedure" accesskey="p" rel="prev">Pragma Import_Procedure</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Import_005fValued_005fProcedure-1"></a>
<h3 class="unnumberedsec">Pragma Import_Valued_Procedure</h3>
<a name="index-Import_005fValued_005fProcedure"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Import_Valued_Procedure (
[Internal =>] LOCAL_NAME
[, [External =>] EXTERNAL_SYMBOL]
[, [Parameter_Types =>] PARAMETER_TYPES]
[, [Mechanism =>] MECHANISM]
[, [First_Optional_Parameter =>] IDENTIFIER]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
PARAMETER_TYPES ::=
null
| TYPE_DESIGNATOR {, TYPE_DESIGNATOR}
TYPE_DESIGNATOR ::=
subtype_NAME
| subtype_Name ' Access
MECHANISM ::=
MECHANISM_NAME
| (MECHANISM_ASSOCIATION {, MECHANISM_ASSOCIATION})
MECHANISM_ASSOCIATION ::=
[formal_parameter_NAME =>] MECHANISM_NAME
MECHANISM_NAME ::=
Value
| Reference
| Descriptor [([Class =>] CLASS_NAME)]
| Short_Descriptor [([Class =>] CLASS_NAME)]
CLASS_NAME ::= ubs | ubsb | uba | s | sb | a | nca
</pre></div>
<p>This pragma is identical to <code>Import_Procedure</code> except that the
first parameter of <var>LOCAL_NAME</var>, which must be present, must be of
mode <code>OUT</code>, and externally the subprogram is treated as a function
with this parameter as the result of the function. The purpose of this
capability is to allow the use of <code>OUT</code> and <code>IN OUT</code>
parameters in interfacing to external functions (which are not permitted
in Ada functions). You may optionally use the <code>Mechanism</code>
parameters to specify passing mechanisms for the parameters.
If you specify a single mechanism name, it applies to all parameters.
Otherwise you may specify a mechanism on a parameter by parameter
basis using either positional or named notation. If the mechanism is not
specified, the default mechanism is used.
</p>
<p>Note that it is important to use this pragma in conjunction with a separate
pragma Import that specifies the desired convention, since otherwise the
default convention is Ada, which is almost certainly not what is required.
</p>
<hr>
<a name="Pragma-Independent"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Independent_005fComponents" accesskey="n" rel="next">Pragma Independent_Components</a>, Previous: <a href="#Pragma-Import_005fValued_005fProcedure" accesskey="p" rel="prev">Pragma Import_Valued_Procedure</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Independent-1"></a>
<h3 class="unnumberedsec">Pragma Independent</h3>
<a name="index-Independent"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Independent (Local_NAME);
</pre></div>
<p>This pragma is standard in Ada 2012 mode (which also provides an aspect
of the same name). It is also available as an implementation-defined
pragma in all earlier versions. It specifies that the
designated object or all objects of the designated type must be
independently addressable. This means that separate tasks can safely
manipulate such objects. For example, if two components of a record are
independent, then two separate tasks may access these two components.
This may place
constraints on the representation of the object (for instance prohibiting
tight packing).
</p>
<hr>
<a name="Pragma-Independent_005fComponents"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Initialize_005fScalars" accesskey="n" rel="next">Pragma Initialize_Scalars</a>, Previous: <a href="#Pragma-Independent" accesskey="p" rel="prev">Pragma Independent</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Independent_005fComponents-1"></a>
<h3 class="unnumberedsec">Pragma Independent_Components</h3>
<a name="index-Independent_005fComponents"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Independent_Components (Local_NAME);
</pre></div>
<p>This pragma is standard in Ada 2012 mode (which also provides an aspect
of the same name). It is also available as an implementation-defined
pragma in all earlier versions. It specifies that the components of the
designated object, or the components of each object of the designated
type, must be
independently addressable. This means that separate tasks can safely
manipulate separate components in the composite object. This may place
constraints on the representation of the object (for instance prohibiting
tight packing).
</p>
<hr>
<a name="Pragma-Initialize_005fScalars"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Inline_005fAlways" accesskey="n" rel="next">Pragma Inline_Always</a>, Previous: <a href="#Pragma-Independent_005fComponents" accesskey="p" rel="prev">Pragma Independent_Components</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Initialize_005fScalars-1"></a>
<h3 class="unnumberedsec">Pragma Initialize_Scalars</h3>
<a name="index-Initialize_005fScalars"></a>
<a name="index-debugging-with-Initialize_005fScalars"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Initialize_Scalars;
</pre></div>
<p>This pragma is similar to <code>Normalize_Scalars</code> conceptually but has
two important differences. First, there is no requirement for the pragma
to be used uniformly in all units of a partition, in particular, it is fine
to use this just for some or all of the application units of a partition,
without needing to recompile the run-time library.
</p>
<p>In the case where some units are compiled with the pragma, and some without,
then a declaration of a variable where the type is defined in package
Standard or is locally declared will always be subject to initialization,
as will any declaration of a scalar variable. For composite variables,
whether the variable is initialized may also depend on whether the package
in which the type of the variable is declared is compiled with the pragma.
</p>
<p>The other important difference is that you can control the value used
for initializing scalar objects. At bind time, you can select several
options for initialization. You can
initialize with invalid values (similar to Normalize_Scalars, though for
Initialize_Scalars it is not always possible to determine the invalid
values in complex cases like signed component fields with non-standard
sizes). You can also initialize with high or
low values, or with a specified bit pattern. See the GNAT
User’s Guide for binder options for specifying these cases.
</p>
<p>This means that you can compile a program, and then without having to
recompile the program, you can run it with different values being used
for initializing otherwise uninitialized values, to test if your program
behavior depends on the choice. Of course the behavior should not change,
and if it does, then most likely you have an erroneous reference to an
uninitialized value.
</p>
<p>It is even possible to change the value at execution time eliminating even
the need to rebind with a different switch using an environment variable.
See the GNAT User’s Guide for details.
</p>
<p>Note that pragma <code>Initialize_Scalars</code> is particularly useful in
conjunction with the enhanced validity checking that is now provided
in GNAT, which checks for invalid values under more conditions.
Using this feature (see description of the <samp>-gnatV</samp> flag in the
GNAT User’s Guide) in conjunction with
pragma <code>Initialize_Scalars</code>
provides a powerful new tool to assist in the detection of problems
caused by uninitialized variables.
</p>
<p>Note: the use of <code>Initialize_Scalars</code> has a fairly extensive
effect on the generated code. This may cause your code to be
substantially larger. It may also cause an increase in the amount
of stack required, so it is probably a good idea to turn on stack
checking (see description of stack checking in the GNAT
User’s Guide) when using this pragma.
</p>
<hr>
<a name="Pragma-Inline_005fAlways"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Inline_005fGeneric" accesskey="n" rel="next">Pragma Inline_Generic</a>, Previous: <a href="#Pragma-Initialize_005fScalars" accesskey="p" rel="prev">Pragma Initialize_Scalars</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Inline_005fAlways-1"></a>
<h3 class="unnumberedsec">Pragma Inline_Always</h3>
<a name="index-Inline_005fAlways"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Inline_Always (NAME [, NAME]);
</pre></div>
<p>Similar to pragma <code>Inline</code> except that inlining is not subject to
the use of option <samp>-gnatn</samp> or <samp>-gnatN</samp> and the inlining
happens regardless of whether these options are used.
</p>
<hr>
<a name="Pragma-Inline_005fGeneric"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Interface" accesskey="n" rel="next">Pragma Interface</a>, Previous: <a href="#Pragma-Inline_005fAlways" accesskey="p" rel="prev">Pragma Inline_Always</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Inline_005fGeneric-1"></a>
<h3 class="unnumberedsec">Pragma Inline_Generic</h3>
<a name="index-Inline_005fGeneric"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Inline_Generic (generic_package_NAME);
</pre></div>
<p>This is implemented for compatibility with DEC Ada 83 and is recognized,
but otherwise ignored, by GNAT. All generic instantiations are inlined
by default when using GNAT.
</p>
<hr>
<a name="Pragma-Interface"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Interface_005fName" accesskey="n" rel="next">Pragma Interface_Name</a>, Previous: <a href="#Pragma-Inline_005fGeneric" accesskey="p" rel="prev">Pragma Inline_Generic</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Interface-1"></a>
<h3 class="unnumberedsec">Pragma Interface</h3>
<a name="index-Interface"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Interface (
[Convention =>] convention_identifier,
[Entity =>] local_NAME
[, [External_Name =>] static_string_expression]
[, [Link_Name =>] static_string_expression]);
</pre></div>
<p>This pragma is identical in syntax and semantics to
the standard Ada pragma <code>Import</code>. It is provided for compatibility
with Ada 83. The definition is upwards compatible both with pragma
<code>Interface</code> as defined in the Ada 83 Reference Manual, and also
with some extended implementations of this pragma in certain Ada 83
implementations. The only difference between pragma <code>Interface</code>
and pragma <code>Import</code> is that there is special circuitry to allow
both pragmas to appear for the same subprogram entity (normally it
is illegal to have multiple <code>Import</code> pragmas. This is useful in
maintaining Ada 83/Ada 95 compatibility and is compatible with other
Ada 83 compilers.
</p>
<hr>
<a name="Pragma-Interface_005fName"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Interrupt_005fHandler" accesskey="n" rel="next">Pragma Interrupt_Handler</a>, Previous: <a href="#Pragma-Interface" accesskey="p" rel="prev">Pragma Interface</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Interface_005fName-1"></a>
<h3 class="unnumberedsec">Pragma Interface_Name</h3>
<a name="index-Interface_005fName"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Interface_Name (
[Entity =>] LOCAL_NAME
[, [External_Name =>] static_string_EXPRESSION]
[, [Link_Name =>] static_string_EXPRESSION]);
</pre></div>
<p>This pragma provides an alternative way of specifying the interface name
for an interfaced subprogram, and is provided for compatibility with Ada
83 compilers that use the pragma for this purpose. You must provide at
least one of <var>External_Name</var> or <var>Link_Name</var>.
</p>
<hr>
<a name="Pragma-Interrupt_005fHandler"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Interrupt_005fState" accesskey="n" rel="next">Pragma Interrupt_State</a>, Previous: <a href="#Pragma-Interface_005fName" accesskey="p" rel="prev">Pragma Interface_Name</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Interrupt_005fHandler-1"></a>
<h3 class="unnumberedsec">Pragma Interrupt_Handler</h3>
<a name="index-Interrupt_005fHandler"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Interrupt_Handler (procedure_LOCAL_NAME);
</pre></div>
<p>This program unit pragma is supported for parameterless protected procedures
as described in Annex C of the Ada Reference Manual. On the AAMP target
the pragma can also be specified for nonprotected parameterless procedures
that are declared at the library level (which includes procedures
declared at the top level of a library package). In the case of AAMP,
when this pragma is applied to a nonprotected procedure, the instruction
<code>IERET</code> is generated for returns from the procedure, enabling
maskable interrupts, in place of the normal return instruction.
</p>
<hr>
<a name="Pragma-Interrupt_005fState"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Invariant" accesskey="n" rel="next">Pragma Invariant</a>, Previous: <a href="#Pragma-Interrupt_005fHandler" accesskey="p" rel="prev">Pragma Interrupt_Handler</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Interrupt_005fState-1"></a>
<h3 class="unnumberedsec">Pragma Interrupt_State</h3>
<a name="index-Interrupt_005fState"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Interrupt_State
([Name =>] value,
[State =>] SYSTEM | RUNTIME | USER);
</pre></div>
<p>Normally certain interrupts are reserved to the implementation. Any attempt
to attach an interrupt causes Program_Error to be raised, as described in
RM C.3.2(22). A typical example is the <code>SIGINT</code> interrupt used in
many systems for an <kbd>Ctrl-C</kbd> interrupt. Normally this interrupt is
reserved to the implementation, so that <kbd>Ctrl-C</kbd> can be used to
interrupt execution. Additionally, signals such as <code>SIGSEGV</code>,
<code>SIGABRT</code>, <code>SIGFPE</code> and <code>SIGILL</code> are often mapped to specific
Ada exceptions, or used to implement run-time functions such as the
<code>abort</code> statement and stack overflow checking.
</p>
<p>Pragma <code>Interrupt_State</code> provides a general mechanism for overriding
such uses of interrupts. It subsumes the functionality of pragma
<code>Unreserve_All_Interrupts</code>. Pragma <code>Interrupt_State</code> is not
available on Windows or VMS. On all other platforms than VxWorks,
it applies to signals; on VxWorks, it applies to vectored hardware interrupts
and may be used to mark interrupts required by the board support package
as reserved.
</p>
<p>Interrupts can be in one of three states:
</p><ul>
<li> System
<p>The interrupt is reserved (no Ada handler can be installed), and the
Ada run-time may not install a handler. As a result you are guaranteed
standard system default action if this interrupt is raised.
</p>
</li><li> Runtime
<p>The interrupt is reserved (no Ada handler can be installed). The run time
is allowed to install a handler for internal control purposes, but is
not required to do so.
</p>
</li><li> User
<p>The interrupt is unreserved. The user may install a handler to provide
some other action.
</p></li></ul>
<p>These states are the allowed values of the <code>State</code> parameter of the
pragma. The <code>Name</code> parameter is a value of the type
<code>Ada.Interrupts.Interrupt_ID</code>. Typically, it is a name declared in
<code>Ada.Interrupts.Names</code>.
</p>
<p>This is a configuration pragma, and the binder will check that there
are no inconsistencies between different units in a partition in how a
given interrupt is specified. It may appear anywhere a pragma is legal.
</p>
<p>The effect is to move the interrupt to the specified state.
</p>
<p>By declaring interrupts to be SYSTEM, you guarantee the standard system
action, such as a core dump.
</p>
<p>By declaring interrupts to be USER, you guarantee that you can install
a handler.
</p>
<p>Note that certain signals on many operating systems cannot be caught and
handled by applications. In such cases, the pragma is ignored. See the
operating system documentation, or the value of the array <code>Reserved</code>
declared in the spec of package <code>System.OS_Interface</code>.
</p>
<p>Overriding the default state of signals used by the Ada runtime may interfere
with an application’s runtime behavior in the cases of the synchronous signals,
and in the case of the signal used to implement the <code>abort</code> statement.
</p>
<hr>
<a name="Pragma-Invariant"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Keep_005fNames" accesskey="n" rel="next">Pragma Keep_Names</a>, Previous: <a href="#Pragma-Interrupt_005fState" accesskey="p" rel="prev">Pragma Interrupt_State</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Invariant-1"></a>
<h3 class="unnumberedsec">Pragma Invariant</h3>
<a name="index-Invariant"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Invariant
([Entity =>] private_type_LOCAL_NAME,
[Check =>] EXPRESSION
[,[Message =>] String_Expression]);
</pre></div>
<p>This pragma provides exactly the same capabilities as the Type_Invariant aspect
defined in AI05-0146-1, and in the Ada 2012 Reference Manual. The
Type_Invariant aspect is fully implemented in Ada 2012 mode, but since it
requires the use of the aspect syntax, which is not available except in 2012
mode, it is not possible to use the Type_Invariant aspect in earlier versions
of Ada. However the Invariant pragma may be used in any version of Ada. Also
note that the aspect Invariant is a synonym in GNAT for the aspect
Type_Invariant, but there is no pragma Type_Invariant.
</p>
<p>The pragma must appear within the visible part of the package specification,
after the type to which its Entity argument appears. As with the Invariant
aspect, the Check expression is not analyzed until the end of the visible
part of the package, so it may contain forward references. The Message
argument, if present, provides the exception message used if the invariant
is violated. If no Message parameter is provided, a default message that
identifies the line on which the pragma appears is used.
</p>
<p>It is permissible to have multiple Invariants for the same type entity, in
which case they are and’ed together. It is permissible to use this pragma
in Ada 2012 mode, but you cannot have both an invariant aspect and an
invariant pragma for the same entity.
</p>
<p>For further details on the use of this pragma, see the Ada 2012 documentation
of the Type_Invariant aspect.
</p>
<hr>
<a name="Pragma-Keep_005fNames"></a>
<div class="header">
<p>
Next: <a href="#Pragma-License" accesskey="n" rel="next">Pragma License</a>, Previous: <a href="#Pragma-Invariant" accesskey="p" rel="prev">Pragma Invariant</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Keep_005fNames-1"></a>
<h3 class="unnumberedsec">Pragma Keep_Names</h3>
<a name="index-Keep_005fNames"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Keep_Names ([On =>] enumeration_first_subtype_LOCAL_NAME);
</pre></div>
<p>The <var>LOCAL_NAME</var> argument
must refer to an enumeration first subtype
in the current declarative part. The effect is to retain the enumeration
literal names for use by <code>Image</code> and <code>Value</code> even if a global
<code>Discard_Names</code> pragma applies. This is useful when you want to
generally suppress enumeration literal names and for example you therefore
use a <code>Discard_Names</code> pragma in the <samp>gnat.adc</samp> file, but you
want to retain the names for specific enumeration types.
</p>
<hr>
<a name="Pragma-License"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Link_005fWith" accesskey="n" rel="next">Pragma Link_With</a>, Previous: <a href="#Pragma-Keep_005fNames" accesskey="p" rel="prev">Pragma Keep_Names</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-License-1"></a>
<h3 class="unnumberedsec">Pragma License</h3>
<a name="index-License"></a>
<a name="index-License-checking"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma License (Unrestricted | GPL | Modified_GPL | Restricted);
</pre></div>
<p>This pragma is provided to allow automated checking for appropriate license
conditions with respect to the standard and modified GPL. A pragma
<code>License</code>, which is a configuration pragma that typically appears at
the start of a source file or in a separate <samp>gnat.adc</samp> file, specifies
the licensing conditions of a unit as follows:
</p>
<ul>
<li> Unrestricted
This is used for a unit that can be freely used with no license restrictions.
Examples of such units are public domain units, and units from the Ada
Reference Manual.
</li><li> GPL
This is used for a unit that is licensed under the unmodified GPL, and which
therefore cannot be <code>with</code>’ed by a restricted unit.
</li><li> Modified_GPL
This is used for a unit licensed under the GNAT modified GPL that includes
a special exception paragraph that specifically permits the inclusion of
the unit in programs without requiring the entire program to be released
under the GPL.
</li><li> Restricted
This is used for a unit that is restricted in that it is not permitted to
depend on units that are licensed under the GPL. Typical examples are
proprietary code that is to be released under more restrictive license
conditions. Note that restricted units are permitted to <code>with</code> units
which are licensed under the modified GPL (this is the whole point of the
modified GPL).
</li></ul>
<p>Normally a unit with no <code>License</code> pragma is considered to have an
unknown license, and no checking is done. However, standard GNAT headers
are recognized, and license information is derived from them as follows.
</p>
<ul>
<li>
A GNAT license header starts with a line containing 78 hyphens. The following
comment text is searched for the appearance of any of the following strings.
<p>If the string “GNU General Public License” is found, then the unit is assumed
to have GPL license, unless the string “As a special exception” follows, in
which case the license is assumed to be modified GPL.
</p>
<p>If one of the strings
“This specification is adapted from the Ada Semantic Interface” or
“This specification is derived from the Ada Reference Manual” is found
then the unit is assumed to be unrestricted.
</p></li></ul>
<p>These default actions means that a program with a restricted license pragma
will automatically get warnings if a GPL unit is inappropriately
<code>with</code>’ed. For example, the program:
</p>
<div class="smallexample">
<pre class="smallexample">with Sem_Ch3;
with GNAT.Sockets;
procedure Secret_Stuff is
…
end Secret_Stuff
</pre></div>
<p>if compiled with pragma <code>License</code> (<code>Restricted</code>) in a
<samp>gnat.adc</samp> file will generate the warning:
</p>
<div class="smallexample">
<pre class="smallexample">1. with Sem_Ch3;
|
>>> license of withed unit "Sem_Ch3" is incompatible
2. with GNAT.Sockets;
3. procedure Secret_Stuff is
</pre></div>
<p>Here we get a warning on <code>Sem_Ch3</code> since it is part of the GNAT
compiler and is licensed under the
GPL, but no warning for <code>GNAT.Sockets</code> which is part of the GNAT
run time, and is therefore licensed under the modified GPL.
</p>
<hr>
<a name="Pragma-Link_005fWith"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Linker_005fAlias" accesskey="n" rel="next">Pragma Linker_Alias</a>, Previous: <a href="#Pragma-License" accesskey="p" rel="prev">Pragma License</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Link_005fWith-1"></a>
<h3 class="unnumberedsec">Pragma Link_With</h3>
<a name="index-Link_005fWith"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Link_With (static_string_EXPRESSION {,static_string_EXPRESSION});
</pre></div>
<p>This pragma is provided for compatibility with certain Ada 83 compilers.
It has exactly the same effect as pragma <code>Linker_Options</code> except
that spaces occurring within one of the string expressions are treated
as separators. For example, in the following case:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Link_With ("-labc -ldef");
</pre></div>
<p>results in passing the strings <code>-labc</code> and <code>-ldef</code> as two
separate arguments to the linker. In addition pragma Link_With allows
multiple arguments, with the same effect as successive pragmas.
</p>
<hr>
<a name="Pragma-Linker_005fAlias"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Linker_005fConstructor" accesskey="n" rel="next">Pragma Linker_Constructor</a>, Previous: <a href="#Pragma-Link_005fWith" accesskey="p" rel="prev">Pragma Link_With</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Linker_005fAlias-1"></a>
<h3 class="unnumberedsec">Pragma Linker_Alias</h3>
<a name="index-Linker_005fAlias"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Linker_Alias (
[Entity =>] LOCAL_NAME,
[Target =>] static_string_EXPRESSION);
</pre></div>
<p><var>LOCAL_NAME</var> must refer to an object that is declared at the library
level. This pragma establishes the given entity as a linker alias for the
given target. It is equivalent to <code>__attribute__((alias))</code> in GNU C
and causes <var>LOCAL_NAME</var> to be emitted as an alias for the symbol
<var>static_string_EXPRESSION</var> in the object file, that is to say no space
is reserved for <var>LOCAL_NAME</var> by the assembler and it will be resolved
to the same address as <var>static_string_EXPRESSION</var> by the linker.
</p>
<p>The actual linker name for the target must be used (e.g. the fully
encoded name with qualification in Ada, or the mangled name in C++),
or it must be declared using the C convention with <code>pragma Import</code>
or <code>pragma Export</code>.
</p>
<p>Not all target machines support this pragma. On some of them it is accepted
only if <code>pragma Weak_External</code> has been applied to <var>LOCAL_NAME</var>.
</p>
<div class="smallexample">
<pre class="smallexample">-- Example of the use of pragma Linker_Alias
package p is
i : Integer := 1;
pragma Export (C, i);
new_name_for_i : Integer;
pragma Linker_Alias (new_name_for_i, "i");
end p;
</pre></div>
<hr>
<a name="Pragma-Linker_005fConstructor"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Linker_005fDestructor" accesskey="n" rel="next">Pragma Linker_Destructor</a>, Previous: <a href="#Pragma-Linker_005fAlias" accesskey="p" rel="prev">Pragma Linker_Alias</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Linker_005fConstructor-1"></a>
<h3 class="unnumberedsec">Pragma Linker_Constructor</h3>
<a name="index-Linker_005fConstructor"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Linker_Constructor (procedure_LOCAL_NAME);
</pre></div>
<p><var>procedure_LOCAL_NAME</var> must refer to a parameterless procedure that
is declared at the library level. A procedure to which this pragma is
applied will be treated as an initialization routine by the linker.
It is equivalent to <code>__attribute__((constructor))</code> in GNU C and
causes <var>procedure_LOCAL_NAME</var> to be invoked before the entry point
of the executable is called (or immediately after the shared library is
loaded if the procedure is linked in a shared library), in particular
before the Ada run-time environment is set up.
</p>
<p>Because of these specific contexts, the set of operations such a procedure
can perform is very limited and the type of objects it can manipulate is
essentially restricted to the elementary types. In particular, it must only
contain code to which pragma Restrictions (No_Elaboration_Code) applies.
</p>
<p>This pragma is used by GNAT to implement auto-initialization of shared Stand
Alone Libraries, which provides a related capability without the restrictions
listed above. Where possible, the use of Stand Alone Libraries is preferable
to the use of this pragma.
</p>
<hr>
<a name="Pragma-Linker_005fDestructor"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Linker_005fSection" accesskey="n" rel="next">Pragma Linker_Section</a>, Previous: <a href="#Pragma-Linker_005fConstructor" accesskey="p" rel="prev">Pragma Linker_Constructor</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Linker_005fDestructor-1"></a>
<h3 class="unnumberedsec">Pragma Linker_Destructor</h3>
<a name="index-Linker_005fDestructor"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Linker_Destructor (procedure_LOCAL_NAME);
</pre></div>
<p><var>procedure_LOCAL_NAME</var> must refer to a parameterless procedure that
is declared at the library level. A procedure to which this pragma is
applied will be treated as a finalization routine by the linker.
It is equivalent to <code>__attribute__((destructor))</code> in GNU C and
causes <var>procedure_LOCAL_NAME</var> to be invoked after the entry point
of the executable has exited (or immediately before the shared library
is unloaded if the procedure is linked in a shared library), in particular
after the Ada run-time environment is shut down.
</p>
<p>See <code>pragma Linker_Constructor</code> for the set of restrictions that apply
because of these specific contexts.
</p>
<hr>
<a name="Pragma-Linker_005fSection"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Long_005fFloat" accesskey="n" rel="next">Pragma Long_Float</a>, Previous: <a href="#Pragma-Linker_005fDestructor" accesskey="p" rel="prev">Pragma Linker_Destructor</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Linker_005fSection-1"></a>
<h3 class="unnumberedsec">Pragma Linker_Section</h3>
<a name="index-Linker_005fSection"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Linker_Section (
[Entity =>] LOCAL_NAME,
[Section =>] static_string_EXPRESSION);
</pre></div>
<p><var>LOCAL_NAME</var> must refer to an object that is declared at the library
level. This pragma specifies the name of the linker section for the given
entity. It is equivalent to <code>__attribute__((section))</code> in GNU C and
causes <var>LOCAL_NAME</var> to be placed in the <var>static_string_EXPRESSION</var>
section of the executable (assuming the linker doesn’t rename the section).
</p>
<p>The compiler normally places library-level objects in standard sections
depending on their type: procedures and functions generally go in the
<code>.text</code> section, initialized variables in the <code>.data</code> section
and uninitialized variables in the <code>.bss</code> section.
</p>
<p>Other, special sections may exist on given target machines to map special
hardware, for example I/O ports or flash memory. This pragma is a means to
defer the final layout of the executable to the linker, thus fully working
at the symbolic level with the compiler.
</p>
<p>Some file formats do not support arbitrary sections so not all target
machines support this pragma. The use of this pragma may cause a program
execution to be erroneous if it is used to place an entity into an
inappropriate section (e.g. a modified variable into the <code>.text</code>
section). See also <code>pragma Persistent_BSS</code>.
</p>
<div class="smallexample">
<pre class="smallexample">-- Example of the use of pragma Linker_Section
package IO_Card is
Port_A : Integer;
pragma Volatile (Port_A);
pragma Linker_Section (Port_A, ".bss.port_a");
Port_B : Integer;
pragma Volatile (Port_B);
pragma Linker_Section (Port_B, ".bss.port_b");
end IO_Card;
</pre></div>
<hr>
<a name="Pragma-Long_005fFloat"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Loop_005fOptimize" accesskey="n" rel="next">Pragma Loop_Optimize</a>, Previous: <a href="#Pragma-Linker_005fSection" accesskey="p" rel="prev">Pragma Linker_Section</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Long_005fFloat-1"></a>
<h3 class="unnumberedsec">Pragma Long_Float</h3>
<a name="index-OpenVMS-10"></a>
<a name="index-Long_005fFloat"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Long_Float (FLOAT_FORMAT);
FLOAT_FORMAT ::= D_Float | G_Float
</pre></div>
<p>This pragma is implemented only in the OpenVMS implementation of GNAT.
It allows control over the internal representation chosen for the predefined
type <code>Long_Float</code> and for floating point type representations with
<code>digits</code> specified in the range 7 through 15.
For further details on this pragma, see the
<cite>DEC Ada Language Reference Manual</cite>, section 3.5.7b. Note that to use
this pragma, the standard runtime libraries must be recompiled.
</p>
<hr>
<a name="Pragma-Loop_005fOptimize"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Machine_005fAttribute" accesskey="n" rel="next">Pragma Machine_Attribute</a>, Previous: <a href="#Pragma-Long_005fFloat" accesskey="p" rel="prev">Pragma Long_Float</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Loop_005fOptimize-1"></a>
<h3 class="unnumberedsec">Pragma Loop_Optimize</h3>
<a name="index-Loop_005fOptimize"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Loop_Optimize (OPTIMIZATION_HINT {, OPTIMIZATION_HINT});
OPTIMIZATION_HINT ::= No_Unroll | Unroll | No_Vector | Vector
</pre></div>
<p>This pragma must appear immediately within a loop statement. It allows the
programmer to specify optimization hints for the enclosing loop. The hints
are not mutually exclusive and can be freely mixed, but not all combinations
will yield a sensible outcome.
</p>
<p>There are four supported optimization hints for a loop:
</p><ul>
<li> No_Unroll
<p>The loop must not be unrolled. This is a strong hint: the compiler will not
unroll a loop marked with this hint.
</p>
</li><li> Unroll
<p>The loop should be unrolled. This is a weak hint: the compiler will try to
apply unrolling to this loop preferably to other optimizations, notably
vectorization, but there is no guarantee that the loop will be unrolled.
</p>
</li><li> No_Vector
<p>The loop must not be vectorized. This is a strong hint: the compiler will not
vectorize a loop marked with this hint.
</p>
</li><li> Vector
<p>The loop should be vectorized. This is a weak hint: the compiler will try to
apply vectorization to this loop preferably to other optimizations, notably
unrolling, but there is no guarantee that the loop will be vectorized.
</p>
</li></ul>
<p>These hints do not void the need to pass the appropriate switches to the
compiler in order to enable the relevant optimizations, that is to say
<samp>-funroll-loops</samp> for unrolling and <samp>-ftree-vectorize</samp> for
vectorization.
</p>
<hr>
<a name="Pragma-Machine_005fAttribute"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Main" accesskey="n" rel="next">Pragma Main</a>, Previous: <a href="#Pragma-Loop_005fOptimize" accesskey="p" rel="prev">Pragma Loop_Optimize</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Machine_005fAttribute-1"></a>
<h3 class="unnumberedsec">Pragma Machine_Attribute</h3>
<a name="index-Machine_005fAttribute"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Machine_Attribute (
[Entity =>] LOCAL_NAME,
[Attribute_Name =>] static_string_EXPRESSION
[, [Info =>] static_EXPRESSION] );
</pre></div>
<p>Machine-dependent attributes can be specified for types and/or
declarations. This pragma is semantically equivalent to
<code>__attribute__((<var>attribute_name</var>))</code> (if <var>info</var> is not
specified) or <code>__attribute__((<var>attribute_name</var>(<var>info</var>)))</code>
in GNU C, where <code><var>attribute_name</var></code> is recognized by the
compiler middle-end or the <code>TARGET_ATTRIBUTE_TABLE</code> machine
specific macro. A string literal for the optional parameter <var>info</var>
is transformed into an identifier, which may make this pragma unusable
for some attributes. See <a href="http://gcc.gnu.org/onlinedocs/gccint/Target-Attributes.html#Target-Attributes">Defining target-specific
uses of <code>__attribute__</code></a> in <cite>GNU Compiler Collection (GCC)
Internals</cite>, further information.
</p>
<hr>
<a name="Pragma-Main"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Main_005fStorage" accesskey="n" rel="next">Pragma Main_Storage</a>, Previous: <a href="#Pragma-Machine_005fAttribute" accesskey="p" rel="prev">Pragma Machine_Attribute</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Main-1"></a>
<h3 class="unnumberedsec">Pragma Main</h3>
<a name="index-OpenVMS-11"></a>
<a name="index-Main"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Main
(MAIN_OPTION [, MAIN_OPTION]);
MAIN_OPTION ::=
[Stack_Size =>] static_integer_EXPRESSION
| [Task_Stack_Size_Default =>] static_integer_EXPRESSION
| [Time_Slicing_Enabled =>] static_boolean_EXPRESSION
</pre></div>
<p>This pragma is provided for compatibility with OpenVMS VAX Systems. It has
no effect in GNAT, other than being syntax checked.
</p>
<hr>
<a name="Pragma-Main_005fStorage"></a>
<div class="header">
<p>
Next: <a href="#Pragma-No_005fBody" accesskey="n" rel="next">Pragma No_Body</a>, Previous: <a href="#Pragma-Main" accesskey="p" rel="prev">Pragma Main</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Main_005fStorage-1"></a>
<h3 class="unnumberedsec">Pragma Main_Storage</h3>
<a name="index-OpenVMS-12"></a>
<a name="index-Main_005fStorage"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Main_Storage
(MAIN_STORAGE_OPTION [, MAIN_STORAGE_OPTION]);
MAIN_STORAGE_OPTION ::=
[WORKING_STORAGE =>] static_SIMPLE_EXPRESSION
| [TOP_GUARD =>] static_SIMPLE_EXPRESSION
</pre></div>
<p>This pragma is provided for compatibility with OpenVMS VAX Systems. It has
no effect in GNAT, other than being syntax checked. Note that the pragma
also has no effect in DEC Ada 83 for OpenVMS Alpha Systems.
</p>
<hr>
<a name="Pragma-No_005fBody"></a>
<div class="header">
<p>
Next: <a href="#Pragma-No_005fInline" accesskey="n" rel="next">Pragma No_Inline</a>, Previous: <a href="#Pragma-Main_005fStorage" accesskey="p" rel="prev">Pragma Main_Storage</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-No_005fBody-1"></a>
<h3 class="unnumberedsec">Pragma No_Body</h3>
<a name="index-No_005fBody"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma No_Body;
</pre></div>
<p>There are a number of cases in which a package spec does not require a body,
and in fact a body is not permitted. GNAT will not permit the spec to be
compiled if there is a body around. The pragma No_Body allows you to provide
a body file, even in a case where no body is allowed. The body file must
contain only comments and a single No_Body pragma. This is recognized by
the compiler as indicating that no body is logically present.
</p>
<p>This is particularly useful during maintenance when a package is modified in
such a way that a body needed before is no longer needed. The provision of a
dummy body with a No_Body pragma ensures that there is no interference from
earlier versions of the package body.
</p>
<hr>
<a name="Pragma-No_005fInline"></a>
<div class="header">
<p>
Next: <a href="#Pragma-No_005fReturn" accesskey="n" rel="next">Pragma No_Return</a>, Previous: <a href="#Pragma-No_005fBody" accesskey="p" rel="prev">Pragma No_Body</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-No_005fInline-1"></a>
<h3 class="unnumberedsec">Pragma No_Inline</h3>
<a name="index-No_005fInline"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma No_Inline (NAME [, NAME]);
</pre></div>
<p>This pragma suppresses inlining for the callable entity or the instances of
the generic subprogram designated by <var>NAME</var>, including inlining that
results from the use of pragma <code>Inline</code>. This pragma is always active,
in particular it is not subject to the use of option <samp>-gnatn</samp> or
<samp>-gnatN</samp>. It is illegal to specify both pragma <code>No_Inline</code> and
pragma <code>Inline_Always</code> for the same <var>NAME</var>.
</p>
<hr>
<a name="Pragma-No_005fReturn"></a>
<div class="header">
<p>
Next: <a href="#Pragma-No_005fStrict_005fAliasing" accesskey="n" rel="next">Pragma No_Strict_Aliasing</a>, Previous: <a href="#Pragma-No_005fInline" accesskey="p" rel="prev">Pragma No_Inline</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-No_005fReturn-1"></a>
<h3 class="unnumberedsec">Pragma No_Return</h3>
<a name="index-No_005fReturn"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma No_Return (procedure_LOCAL_NAME {, procedure_LOCAL_NAME});
</pre></div>
<p>Each <var>procedure_LOCAL_NAME</var> argument must refer to one or more procedure
declarations in the current declarative part. A procedure to which this
pragma is applied may not contain any explicit <code>return</code> statements.
In addition, if the procedure contains any implicit returns from falling
off the end of a statement sequence, then execution of that implicit
return will cause Program_Error to be raised.
</p>
<p>One use of this pragma is to identify procedures whose only purpose is to raise
an exception. Another use of this pragma is to suppress incorrect warnings
about missing returns in functions, where the last statement of a function
statement sequence is a call to such a procedure.
</p>
<p>Note that in Ada 2005 mode, this pragma is part of the language. It is
available in all earlier versions of Ada as an implementation-defined
pragma.
</p>
<hr>
<a name="Pragma-No_005fStrict_005fAliasing"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Normalize_005fScalars" accesskey="n" rel="next">Pragma Normalize_Scalars</a>, Previous: <a href="#Pragma-No_005fReturn" accesskey="p" rel="prev">Pragma No_Return</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-No_005fStrict_005fAliasing-1"></a>
<h3 class="unnumberedsec">Pragma No_Strict_Aliasing</h3>
<a name="index-No_005fStrict_005fAliasing"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma No_Strict_Aliasing [([Entity =>] type_LOCAL_NAME)];
</pre></div>
<p><var>type_LOCAL_NAME</var> must refer to an access type
declaration in the current declarative part. The effect is to inhibit
strict aliasing optimization for the given type. The form with no
arguments is a configuration pragma which applies to all access types
declared in units to which the pragma applies. For a detailed
description of the strict aliasing optimization, and the situations
in which it must be suppressed, see <a href="gnat_ugn.html#Optimization-and-Strict-Aliasing">Optimization and Strict
Aliasing</a> in <cite>GNAT User’s Guide</cite>.
</p>
<p>This pragma currently has no effects on access to unconstrained array types.
</p>
<hr>
<a name="Pragma-Normalize_005fScalars"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Obsolescent" accesskey="n" rel="next">Pragma Obsolescent</a>, Previous: <a href="#Pragma-No_005fStrict_005fAliasing" accesskey="p" rel="prev">Pragma No_Strict_Aliasing</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Normalize_005fScalars-1"></a>
<h3 class="unnumberedsec">Pragma Normalize_Scalars</h3>
<a name="index-Normalize_005fScalars"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Normalize_Scalars;
</pre></div>
<p>This is a language defined pragma which is fully implemented in GNAT. The
effect is to cause all scalar objects that are not otherwise initialized
to be initialized. The initial values are implementation dependent and
are as follows:
</p>
<dl compact="compact">
<dt><code>Standard.Character</code></dt>
<dd><p>Objects whose root type is Standard.Character are initialized to
Character’Last unless the subtype range excludes NUL (in which case
NUL is used). This choice will always generate an invalid value if
one exists.
</p>
</dd>
<dt><code>Standard.Wide_Character</code></dt>
<dd><p>Objects whose root type is Standard.Wide_Character are initialized to
Wide_Character’Last unless the subtype range excludes NUL (in which case
NUL is used). This choice will always generate an invalid value if
one exists.
</p>
</dd>
<dt><code>Standard.Wide_Wide_Character</code></dt>
<dd><p>Objects whose root type is Standard.Wide_Wide_Character are initialized to
the invalid value 16#FFFF_FFFF# unless the subtype range excludes NUL (in
which case NUL is used). This choice will always generate an invalid value if
one exists.
</p>
</dd>
<dt><code>Integer types</code></dt>
<dd><p>Objects of an integer type are treated differently depending on whether
negative values are present in the subtype. If no negative values are
present, then all one bits is used as the initial value except in the
special case where zero is excluded from the subtype, in which case
all zero bits are used. This choice will always generate an invalid
value if one exists.
</p>
<p>For subtypes with negative values present, the largest negative number
is used, except in the unusual case where this largest negative number
is in the subtype, and the largest positive number is not, in which case
the largest positive value is used. This choice will always generate
an invalid value if one exists.
</p>
</dd>
<dt><code>Floating-Point Types</code></dt>
<dd><p>Objects of all floating-point types are initialized to all 1-bits. For
standard IEEE format, this corresponds to a NaN (not a number) which is
indeed an invalid value.
</p>
</dd>
<dt><code>Fixed-Point Types</code></dt>
<dd><p>Objects of all fixed-point types are treated as described above for integers,
with the rules applying to the underlying integer value used to represent
the fixed-point value.
</p>
</dd>
<dt><code>Modular types</code></dt>
<dd><p>Objects of a modular type are initialized to all one bits, except in
the special case where zero is excluded from the subtype, in which
case all zero bits are used. This choice will always generate an
invalid value if one exists.
</p>
</dd>
<dt><code>Enumeration types</code></dt>
<dd><p>Objects of an enumeration type are initialized to all one-bits, i.e. to
the value <code>2 ** typ'Size - 1</code> unless the subtype excludes the literal
whose Pos value is zero, in which case a code of zero is used. This choice
will always generate an invalid value if one exists.
</p>
</dd>
</dl>
<hr>
<a name="Pragma-Obsolescent"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Optimize_005fAlignment" accesskey="n" rel="next">Pragma Optimize_Alignment</a>, Previous: <a href="#Pragma-Normalize_005fScalars" accesskey="p" rel="prev">Pragma Normalize_Scalars</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Obsolescent-1"></a>
<h3 class="unnumberedsec">Pragma Obsolescent</h3>
<a name="index-Obsolescent"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Obsolescent;
pragma Obsolescent (
[Message =>] static_string_EXPRESSION
[,[Version =>] Ada_05]]);
pragma Obsolescent (
[Entity =>] NAME
[,[Message =>] static_string_EXPRESSION
[,[Version =>] Ada_05]] );
</pre></div>
<p>This pragma can occur immediately following a declaration of an entity,
including the case of a record component. If no Entity argument is present,
then this declaration is the one to which the pragma applies. If an Entity
parameter is present, it must either match the name of the entity in this
declaration, or alternatively, the pragma can immediately follow an enumeration
type declaration, where the Entity argument names one of the enumeration
literals.
</p>
<p>This pragma is used to indicate that the named entity
is considered obsolescent and should not be used. Typically this is
used when an API must be modified by eventually removing or modifying
existing subprograms or other entities. The pragma can be used at an
intermediate stage when the entity is still present, but will be
removed later.
</p>
<p>The effect of this pragma is to output a warning message on a reference to
an entity thus marked that the subprogram is obsolescent if the appropriate
warning option in the compiler is activated. If the Message parameter is
present, then a second warning message is given containing this text. In
addition, a reference to the entity is considered to be a violation of pragma
Restrictions (No_Obsolescent_Features).
</p>
<p>This pragma can also be used as a program unit pragma for a package,
in which case the entity name is the name of the package, and the
pragma indicates that the entire package is considered
obsolescent. In this case a client <code>with</code>’ing such a package
violates the restriction, and the <code>with</code> statement is
flagged with warnings if the warning option is set.
</p>
<p>If the Version parameter is present (which must be exactly
the identifier Ada_05, no other argument is allowed), then the
indication of obsolescence applies only when compiling in Ada 2005
mode. This is primarily intended for dealing with the situations
in the predefined library where subprograms or packages
have become defined as obsolescent in Ada 2005
(e.g. in Ada.Characters.Handling), but may be used anywhere.
</p>
<p>The following examples show typical uses of this pragma:
</p>
<div class="smallexample">
<pre class="smallexample">package p is
pragma Obsolescent (p, Message => "use pp instead of p");
end p;
package q is
procedure q2;
pragma Obsolescent ("use q2new instead");
type R is new integer;
pragma Obsolescent
(Entity => R,
Message => "use RR in Ada 2005",
Version => Ada_05);
type M is record
F1 : Integer;
F2 : Integer;
pragma Obsolescent;
F3 : Integer;
end record;
type E is (a, bc, 'd', quack);
pragma Obsolescent (Entity => bc)
pragma Obsolescent (Entity => 'd')
function "+"
(a, b : character) return character;
pragma Obsolescent (Entity => "+");
end;
</pre></div>
<p>Note that, as for all pragmas, if you use a pragma argument identifier,
then all subsequent parameters must also use a pragma argument identifier.
So if you specify "Entity =>" for the Entity argument, and a Message
argument is present, it must be preceded by "Message =>".
</p>
<hr>
<a name="Pragma-Optimize_005fAlignment"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Ordered" accesskey="n" rel="next">Pragma Ordered</a>, Previous: <a href="#Pragma-Obsolescent" accesskey="p" rel="prev">Pragma Obsolescent</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Optimize_005fAlignment-1"></a>
<h3 class="unnumberedsec">Pragma Optimize_Alignment</h3>
<a name="index-Optimize_005fAlignment"></a>
<a name="index-Alignment_002c-default-settings"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Optimize_Alignment (TIME | SPACE | OFF);
</pre></div>
<p>This is a configuration pragma which affects the choice of default alignments
for types where no alignment is explicitly specified. There is a time/space
trade-off in the selection of these values. Large alignments result in more
efficient code, at the expense of larger data space, since sizes have to be
increased to match these alignments. Smaller alignments save space, but the
access code is slower. The normal choice of default alignments (which is what
you get if you do not use this pragma, or if you use an argument of OFF),
tries to balance these two requirements.
</p>
<p>Specifying SPACE causes smaller default alignments to be chosen in two cases.
First any packed record is given an alignment of 1. Second, if a size is given
for the type, then the alignment is chosen to avoid increasing this size. For
example, consider:
</p>
<div class="smallexample">
<pre class="smallexample"> type R is record
X : Integer;
Y : Character;
end record;
for R'Size use 5*8;
</pre></div>
<p>In the default mode, this type gets an alignment of 4, so that access to the
Integer field X are efficient. But this means that objects of the type end up
with a size of 8 bytes. This is a valid choice, since sizes of objects are
allowed to be bigger than the size of the type, but it can waste space if for
example fields of type R appear in an enclosing record. If the above type is
compiled in <code>Optimize_Alignment (Space)</code> mode, the alignment is set to 1.
</p>
<p>However, there is one case in which SPACE is ignored. If a variable length
record (that is a discriminated record with a component which is an array
whose length depends on a discriminant), has a pragma Pack, then it is not
in general possible to set the alignment of such a record to one, so the
pragma is ignored in this case (with a warning).
</p>
<p>Specifying TIME causes larger default alignments to be chosen in the case of
small types with sizes that are not a power of 2. For example, consider:
</p>
<div class="smallexample">
<pre class="smallexample"> type R is record
A : Character;
B : Character;
C : Boolean;
end record;
pragma Pack (R);
for R'Size use 17;
</pre></div>
<p>The default alignment for this record is normally 1, but if this type is
compiled in <code>Optimize_Alignment (Time)</code> mode, then the alignment is set
to 4, which wastes space for objects of the type, since they are now 4 bytes
long, but results in more efficient access when the whole record is referenced.
</p>
<p>As noted above, this is a configuration pragma, and there is a requirement
that all units in a partition be compiled with a consistent setting of the
optimization setting. This would normally be achieved by use of a configuration
pragma file containing the appropriate setting. The exception to this rule is
that units with an explicit configuration pragma in the same file as the source
unit are excluded from the consistency check, as are all predefined units. The
latter are compiled by default in pragma Optimize_Alignment (Off) mode if no
pragma appears at the start of the file.
</p>
<hr>
<a name="Pragma-Ordered"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Overflow_005fMode" accesskey="n" rel="next">Pragma Overflow_Mode</a>, Previous: <a href="#Pragma-Optimize_005fAlignment" accesskey="p" rel="prev">Pragma Optimize_Alignment</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Ordered-1"></a>
<h3 class="unnumberedsec">Pragma Ordered</h3>
<a name="index-Ordered"></a>
<a name="index-pragma-Ordered"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Ordered (enumeration_first_subtype_LOCAL_NAME);
</pre></div>
<p>Most enumeration types are from a conceptual point of view unordered.
For example, consider:
</p>
<div class="smallexample">
<pre class="smallexample">type Color is (Red, Blue, Green, Yellow);
</pre></div>
<p>By Ada semantics <code>Blue > Red</code> and <code>Green > Blue</code>,
but really these relations make no sense; the enumeration type merely
specifies a set of possible colors, and the order is unimportant.
</p>
<p>For unordered enumeration types, it is generally a good idea if
clients avoid comparisons (other than equality or inequality) and
explicit ranges. (A <em>client</em> is a unit where the type is referenced,
other than the unit where the type is declared, its body, and its subunits.)
For example, if code buried in some client says:
</p>
<div class="smallexample">
<pre class="smallexample">if Current_Color < Yellow then ...
if Current_Color in Blue .. Green then ...
</pre></div>
<p>then the client code is relying on the order, which is undesirable.
It makes the code hard to read and creates maintenance difficulties if
entries have to be added to the enumeration type. Instead,
the code in the client should list the possibilities, or an
appropriate subtype should be declared in the unit that declares
the original enumeration type. E.g., the following subtype could
be declared along with the type <code>Color</code>:
</p>
<div class="smallexample">
<pre class="smallexample">subtype RBG is Color range Red .. Green;
</pre></div>
<p>and then the client could write:
</p>
<div class="smallexample">
<pre class="smallexample">if Current_Color in RBG then ...
if Current_Color = Blue or Current_Color = Green then ...
</pre></div>
<p>However, some enumeration types are legitimately ordered from a conceptual
point of view. For example, if you declare:
</p>
<div class="smallexample">
<pre class="smallexample">type Day is (Mon, Tue, Wed, Thu, Fri, Sat, Sun);
</pre></div>
<p>then the ordering imposed by the language is reasonable, and
clients can depend on it, writing for example:
</p>
<div class="smallexample">
<pre class="smallexample">if D in Mon .. Fri then ...
if D < Wed then ...
</pre></div>
<p>The pragma <samp>Ordered</samp> is provided to mark enumeration types that
are conceptually ordered, alerting the reader that clients may depend
on the ordering. GNAT provides a pragma to mark enumerations as ordered
rather than one to mark them as unordered, since in our experience,
the great majority of enumeration types are conceptually unordered.
</p>
<p>The types <code>Boolean</code>, <code>Character</code>, <code>Wide_Character</code>,
and <code>Wide_Wide_Character</code>
are considered to be ordered types, so each is declared with a
pragma <code>Ordered</code> in package <code>Standard</code>.
</p>
<p>Normally pragma <code>Ordered</code> serves only as documentation and a guide for
coding standards, but GNAT provides a warning switch <samp>-gnatw.u</samp> that
requests warnings for inappropriate uses (comparisons and explicit
subranges) for unordered types. If this switch is used, then any
enumeration type not marked with pragma <code>Ordered</code> will be considered
as unordered, and will generate warnings for inappropriate uses.
</p>
<p>For additional information please refer to the description of the
<samp>-gnatw.u</samp> switch in the GNAT User’s Guide.
</p>
<hr>
<a name="Pragma-Overflow_005fMode"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Partition_005fElaboration_005fPolicy" accesskey="n" rel="next">Pragma Partition_Elaboration_Policy</a>, Previous: <a href="#Pragma-Ordered" accesskey="p" rel="prev">Pragma Ordered</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Overflow_005fMode-1"></a>
<h3 class="unnumberedsec">Pragma Overflow_Mode</h3>
<a name="index-Overflow-checks"></a>
<a name="index-Overflow-mode"></a>
<a name="index-pragma-Overflow_005fMode"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Overflow_Mode
( [General =>] MODE
[,[Assertions =>] MODE]);
MODE ::= STRICT | MINIMIZED | ELIMINATED
</pre></div>
<p>This pragma sets the current overflow mode to the given setting. For details
of the meaning of these modes, please refer to the
“Overflow Check Handling in GNAT” appendix in the
GNAT User’s Guide. If only the <code>General</code> parameter is present,
the given mode applies to all expressions. If both parameters are present,
the <code>General</code> mode applies to expressions outside assertions, and
the <code>Eliminated</code> mode applies to expressions within assertions.
</p>
<p>The case of the <code>MODE</code> parameter is ignored,
so <code>MINIMIZED</code>, <code>Minimized</code> and
<code>minimized</code> all have the same effect.
</p>
<p>The <code>Overflow_Mode</code> pragma has the same scoping and placement
rules as pragma <code>Suppress</code>, so it can occur either as a
configuration pragma, specifying a default for the whole
program, or in a declarative scope, where it applies to the
remaining declarations and statements in that scope.
</p>
<p>The pragma <code>Suppress (Overflow_Check)</code> suppresses
overflow checking, but does not affect the overflow mode.
</p>
<p>The pragma <code>Unsuppress (Overflow_Check)</code> unsuppresses (enables)
overflow checking, but does not affect the overflow mode.
</p>
<hr>
<a name="Pragma-Partition_005fElaboration_005fPolicy"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Passive" accesskey="n" rel="next">Pragma Passive</a>, Previous: <a href="#Pragma-Overflow_005fMode" accesskey="p" rel="prev">Pragma Overflow_Mode</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Partition_005fElaboration_005fPolicy-1"></a>
<h3 class="unnumberedsec">Pragma Partition_Elaboration_Policy</h3>
<a name="index-Partition_005fElaboration_005fPolicy"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Partition_Elaboration_Policy (POLICY_IDENTIFIER);
POLICY_IDENTIFIER ::= Concurrent | Sequential
</pre></div>
<p>This pragma is standard in Ada 2005, but is available in all earlier
versions of Ada as an implementation-defined pragma.
See Ada 2012 Reference Manual for details.
</p>
<hr>
<a name="Pragma-Passive"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Persistent_005fBSS" accesskey="n" rel="next">Pragma Persistent_BSS</a>, Previous: <a href="#Pragma-Partition_005fElaboration_005fPolicy" accesskey="p" rel="prev">Pragma Partition_Elaboration_Policy</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Passive-1"></a>
<h3 class="unnumberedsec">Pragma Passive</h3>
<a name="index-Passive"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Passive [(Semaphore | No)];
</pre></div>
<p>Syntax checked, but otherwise ignored by GNAT. This is recognized for
compatibility with DEC Ada 83 implementations, where it is used within a
task definition to request that a task be made passive. If the argument
<code>Semaphore</code> is present, or the argument is omitted, then DEC Ada 83
treats the pragma as an assertion that the containing task is passive
and that optimization of context switch with this task is permitted and
desired. If the argument <code>No</code> is present, the task must not be
optimized. GNAT does not attempt to optimize any tasks in this manner
(since protected objects are available in place of passive tasks).
</p>
<hr>
<a name="Pragma-Persistent_005fBSS"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Polling" accesskey="n" rel="next">Pragma Polling</a>, Previous: <a href="#Pragma-Passive" accesskey="p" rel="prev">Pragma Passive</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Persistent_005fBSS-1"></a>
<h3 class="unnumberedsec">Pragma Persistent_BSS</h3>
<a name="index-Persistent_005fBSS"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Persistent_BSS [(LOCAL_NAME)]
</pre></div>
<p>This pragma allows selected objects to be placed in the <code>.persistent_bss</code>
section. On some targets the linker and loader provide for special
treatment of this section, allowing a program to be reloaded without
affecting the contents of this data (hence the name persistent).
</p>
<p>There are two forms of usage. If an argument is given, it must be the
local name of a library level object, with no explicit initialization
and whose type is potentially persistent. If no argument is given, then
the pragma is a configuration pragma, and applies to all library level
objects with no explicit initialization of potentially persistent types.
</p>
<p>A potentially persistent type is a scalar type, or a non-tagged,
non-discriminated record, all of whose components have no explicit
initialization and are themselves of a potentially persistent type,
or an array, all of whose constraints are static, and whose component
type is potentially persistent.
</p>
<p>If this pragma is used on a target where this feature is not supported,
then the pragma will be ignored. See also <code>pragma Linker_Section</code>.
</p>
<hr>
<a name="Pragma-Polling"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Postcondition" accesskey="n" rel="next">Pragma Postcondition</a>, Previous: <a href="#Pragma-Persistent_005fBSS" accesskey="p" rel="prev">Pragma Persistent_BSS</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Polling-1"></a>
<h3 class="unnumberedsec">Pragma Polling</h3>
<a name="index-Polling"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Polling (ON | OFF);
</pre></div>
<p>This pragma controls the generation of polling code. This is normally off.
If <code>pragma Polling (ON)</code> is used then periodic calls are generated to
the routine <code>Ada.Exceptions.Poll</code>. This routine is a separate unit in the
runtime library, and can be found in file <samp>a-excpol.adb</samp>.
</p>
<p>Pragma <code>Polling</code> can appear as a configuration pragma (for example it
can be placed in the <samp>gnat.adc</samp> file) to enable polling globally, or it
can be used in the statement or declaration sequence to control polling
more locally.
</p>
<p>A call to the polling routine is generated at the start of every loop and
at the start of every subprogram call. This guarantees that the <code>Poll</code>
routine is called frequently, and places an upper bound (determined by
the complexity of the code) on the period between two <code>Poll</code> calls.
</p>
<p>The primary purpose of the polling interface is to enable asynchronous
aborts on targets that cannot otherwise support it (for example Windows
NT), but it may be used for any other purpose requiring periodic polling.
The standard version is null, and can be replaced by a user program. This
will require re-compilation of the <code>Ada.Exceptions</code> package that can
be found in files <samp>a-except.ads</samp> and <samp>a-except.adb</samp>.
</p>
<p>A standard alternative unit (in file <samp>4wexcpol.adb</samp> in the standard GNAT
distribution) is used to enable the asynchronous abort capability on
targets that do not normally support the capability. The version of
<code>Poll</code> in this file makes a call to the appropriate runtime routine
to test for an abort condition.
</p>
<p>Note that polling can also be enabled by use of the <samp>-gnatP</samp> switch.
See <a href="gnat_ugn.html#Switches-for-gcc">Switches for gcc</a> in <cite>GNAT User’s Guide</cite>, for
details.
</p>
<hr>
<a name="Pragma-Postcondition"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Preelaborable_005fInitialization" accesskey="n" rel="next">Pragma Preelaborable_Initialization</a>, Previous: <a href="#Pragma-Polling" accesskey="p" rel="prev">Pragma Polling</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Postcondition-1"></a>
<h3 class="unnumberedsec">Pragma Postcondition</h3>
<a name="index-Postconditions"></a>
<a name="index-Checks_002c-postconditions"></a>
<a name="index-Postconditions-1"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Postcondition (
[Check =>] Boolean_Expression
[,[Message =>] String_Expression]);
</pre></div>
<p>The <code>Postcondition</code> pragma allows specification of automatic
postcondition checks for subprograms. These checks are similar to
assertions, but are automatically inserted just prior to the return
statements of the subprogram with which they are associated (including
implicit returns at the end of procedure bodies and associated
exception handlers).
</p>
<p>In addition, the boolean expression which is the condition which
must be true may contain references to function’Result in the case
of a function to refer to the returned value.
</p>
<p><code>Postcondition</code> pragmas may appear either immediately following the
(separate) declaration of a subprogram, or at the start of the
declarations of a subprogram body. Only other pragmas may intervene
(that is appear between the subprogram declaration and its
postconditions, or appear before the postcondition in the
declaration sequence in a subprogram body). In the case of a
postcondition appearing after a subprogram declaration, the
formal arguments of the subprogram are visible, and can be
referenced in the postcondition expressions.
</p>
<p>The postconditions are collected and automatically tested just
before any return (implicit or explicit) in the subprogram body.
A postcondition is only recognized if postconditions are active
at the time the pragma is encountered. The compiler switch <samp>gnata</samp>
turns on all postconditions by default, and pragma <code>Check_Policy</code>
with an identifier of <code>Postcondition</code> can also be used to
control whether postconditions are active.
</p>
<p>The general approach is that postconditions are placed in the spec
if they represent functional aspects which make sense to the client.
For example we might have:
</p>
<div class="smallexample">
<pre class="smallexample"> function Direction return Integer;
pragma Postcondition
(Direction'Result = +1
or else
Direction'Result = -1);
</pre></div>
<p>which serves to document that the result must be +1 or -1, and
will test that this is the case at run time if postcondition
checking is active.
</p>
<p>Postconditions within the subprogram body can be used to
check that some internal aspect of the implementation,
not visible to the client, is operating as expected.
For instance if a square root routine keeps an internal
counter of the number of times it is called, then we
might have the following postcondition:
</p>
<div class="smallexample">
<pre class="smallexample"> Sqrt_Calls : Natural := 0;
function Sqrt (Arg : Float) return Float is
pragma Postcondition
(Sqrt_Calls = Sqrt_Calls'Old + 1);
...
end Sqrt
</pre></div>
<p>As this example, shows, the use of the <code>Old</code> attribute
is often useful in postconditions to refer to the state on
entry to the subprogram.
</p>
<p>Note that postconditions are only checked on normal returns
from the subprogram. If an abnormal return results from
raising an exception, then the postconditions are not checked.
</p>
<p>If a postcondition fails, then the exception
<code>System.Assertions.Assert_Failure</code> is raised. If
a message argument was supplied, then the given string
will be used as the exception message. If no message
argument was supplied, then the default message has
the form "Postcondition failed at file:line". The
exception is raised in the context of the subprogram
body, so it is possible to catch postcondition failures
within the subprogram body itself.
</p>
<p>Within a package spec, normal visibility rules
in Ada would prevent forward references within a
postcondition pragma to functions defined later in
the same package. This would introduce undesirable
ordering constraints. To avoid this problem, all
postcondition pragmas are analyzed at the end of
the package spec, allowing forward references.
</p>
<p>The following example shows that this even allows
mutually recursive postconditions as in:
</p>
<div class="smallexample">
<pre class="smallexample">package Parity_Functions is
function Odd (X : Natural) return Boolean;
pragma Postcondition
(Odd'Result =
(x = 1
or else
(x /= 0 and then Even (X - 1))));
function Even (X : Natural) return Boolean;
pragma Postcondition
(Even'Result =
(x = 0
or else
(x /= 1 and then Odd (X - 1))));
end Parity_Functions;
</pre></div>
<p>There are no restrictions on the complexity or form of
conditions used within <code>Postcondition</code> pragmas.
The following example shows that it is even possible
to verify performance behavior.
</p>
<div class="smallexample">
<pre class="smallexample">package Sort is
Performance : constant Float;
-- Performance constant set by implementation
-- to match target architecture behavior.
procedure Treesort (Arg : String);
-- Sorts characters of argument using N*logN sort
pragma Postcondition
(Float (Clock - Clock'Old) <=
Float (Arg'Length) *
log (Float (Arg'Length)) *
Performance);
end Sort;
</pre></div>
<p>Note: postcondition pragmas associated with subprograms that are
marked as Inline_Always, or those marked as Inline with front-end
inlining (-gnatN option set) are accepted and legality-checked
by the compiler, but are ignored at run-time even if postcondition
checking is enabled.
</p>
<hr>
<a name="Pragma-Preelaborable_005fInitialization"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Priority_005fSpecific_005fDispatching" accesskey="n" rel="next">Pragma Priority_Specific_Dispatching</a>, Previous: <a href="#Pragma-Postcondition" accesskey="p" rel="prev">Pragma Postcondition</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Preelaborable_005fInitialization-1"></a>
<h3 class="unnumberedsec">Pragma Preelaborable_Initialization</h3>
<a name="index-Preelaborable_005fInitialization"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Preelaborable_Initialization (DIRECT_NAME);
</pre></div>
<p>This pragma is standard in Ada 2005, but is available in all earlier
versions of Ada as an implementation-defined pragma.
See Ada 2012 Reference Manual for details.
</p>
<hr>
<a name="Pragma-Priority_005fSpecific_005fDispatching"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Precondition" accesskey="n" rel="next">Pragma Precondition</a>, Previous: <a href="#Pragma-Preelaborable_005fInitialization" accesskey="p" rel="prev">Pragma Preelaborable_Initialization</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Priority_005fSpecific_005fDispatching-1"></a>
<h3 class="unnumberedsec">Pragma Priority_Specific_Dispatching</h3>
<a name="index-Priority_005fSpecific_005fDispatching"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Priority_Specific_Dispatching (
POLICY_IDENTIFIER,
first_priority_EXPRESSION,
last_priority_EXPRESSION)
POLICY_IDENTIFIER ::=
EDF_Across_Priorities |
FIFO_Within_Priorities |
Non_Preemptive_Within_Priorities |
Round_Robin_Within_Priorities
</pre></div>
<p>This pragma is standard in Ada 2005, but is available in all earlier
versions of Ada as an implementation-defined pragma.
See Ada 2012 Reference Manual for details.
</p>
<hr>
<a name="Pragma-Precondition"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Profile-_0028Ravenscar_0029" accesskey="n" rel="next">Pragma Profile (Ravenscar)</a>, Previous: <a href="#Pragma-Priority_005fSpecific_005fDispatching" accesskey="p" rel="prev">Pragma Priority_Specific_Dispatching</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Precondition-1"></a>
<h3 class="unnumberedsec">Pragma Precondition</h3>
<a name="index-Preconditions"></a>
<a name="index-Checks_002c-preconditions"></a>
<a name="index-Preconditions-1"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Precondition (
[Check =>] Boolean_Expression
[,[Message =>] String_Expression]);
</pre></div>
<p>The <code>Precondition</code> pragma is similar to <code>Postcondition</code>
except that the corresponding checks take place immediately upon
entry to the subprogram, and if a precondition fails, the exception
is raised in the context of the caller, and the attribute ’Result
cannot be used within the precondition expression.
</p>
<p>Otherwise, the placement and visibility rules are identical to those
described for postconditions. The following is an example of use
within a package spec:
</p>
<div class="smallexample">
<pre class="smallexample">package Math_Functions is
...
function Sqrt (Arg : Float) return Float;
pragma Precondition (Arg >= 0.0)
...
end Math_Functions;
</pre></div>
<p><code>Precondition</code> pragmas may appear either immediately following the
(separate) declaration of a subprogram, or at the start of the
declarations of a subprogram body. Only other pragmas may intervene
(that is appear between the subprogram declaration and its
postconditions, or appear before the postcondition in the
declaration sequence in a subprogram body).
</p>
<p>Note: postcondition pragmas associated with subprograms that are
marked as Inline_Always, or those marked as Inline with front-end
inlining (-gnatN option set) are accepted and legality-checked
by the compiler, but are ignored at run-time even if postcondition
checking is enabled.
</p>
<hr>
<a name="Pragma-Profile-_0028Ravenscar_0029"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Profile-_0028Restricted_0029" accesskey="n" rel="next">Pragma Profile (Restricted)</a>, Previous: <a href="#Pragma-Precondition" accesskey="p" rel="prev">Pragma Precondition</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Profile-_0028Ravenscar_0029-1"></a>
<h3 class="unnumberedsec">Pragma Profile (Ravenscar)</h3>
<a name="index-Ravenscar"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Profile (Ravenscar | Restricted);
</pre></div>
<p>This pragma is standard in Ada 2005, but is available in all earlier
versions of Ada as an implementation-defined pragma. This is a
configuration pragma that establishes the following set of configuration
pragmas:
</p>
<dl compact="compact">
<dt><code>Task_Dispatching_Policy (FIFO_Within_Priorities)</code></dt>
<dd><p>[RM D.2.2] Tasks are dispatched following a preemptive
priority-ordered scheduling policy.
</p>
</dd>
<dt><code>Locking_Policy (Ceiling_Locking)</code></dt>
<dd><p>[RM D.3] While tasks and interrupts execute a protected action, they inherit
the ceiling priority of the corresponding protected object.
</p></dd>
</dl>
<p>plus the following set of restrictions:
</p>
<dl compact="compact">
<dt><code>Max_Entry_Queue_Length => 1</code></dt>
<dd><p>No task can be queued on a protected entry.
</p></dd>
<dt><code>Max_Protected_Entries => 1</code></dt>
<dt><code>Max_Task_Entries => 0</code></dt>
<dd><p>No rendezvous statements are allowed.
</p></dd>
<dt><code>No_Abort_Statements</code></dt>
<dt><code>No_Dynamic_Attachment</code></dt>
<dt><code>No_Dynamic_Priorities</code></dt>
<dt><code>No_Implicit_Heap_Allocations</code></dt>
<dt><code>No_Local_Protected_Objects</code></dt>
<dt><code>No_Local_Timing_Events</code></dt>
<dt><code>No_Protected_Type_Allocators</code></dt>
<dt><code>No_Relative_Delay</code></dt>
<dt><code>No_Requeue_Statements</code></dt>
<dt><code>No_Select_Statements</code></dt>
<dt><code>No_Specific_Termination_Handlers</code></dt>
<dt><code>No_Task_Allocators</code></dt>
<dt><code>No_Task_Hierarchy</code></dt>
<dt><code>No_Task_Termination</code></dt>
<dt><code>Simple_Barriers</code></dt>
</dl>
<p>The Ravenscar profile also includes the following restrictions that specify
that there are no semantic dependences on the corresponding predefined
packages:
</p>
<dl compact="compact">
<dt><code>No_Dependence => Ada.Asynchronous_Task_Control</code></dt>
<dt><code>No_Dependence => Ada.Calendar</code></dt>
<dt><code>No_Dependence => Ada.Execution_Time.Group_Budget</code></dt>
<dt><code>No_Dependence => Ada.Execution_Time.Timers</code></dt>
<dt><code>No_Dependence => Ada.Task_Attributes</code></dt>
<dt><code>No_Dependence => System.Multiprocessors.Dispatching_Domains</code></dt>
</dl>
<p>This set of configuration pragmas and restrictions correspond to the
definition of the “Ravenscar Profile” for limited tasking, devised and
published by the <cite>International Real-Time Ada Workshop</cite>, 1997,
and whose most recent description is available at
<a href="http://www-users.cs.york.ac.uk/~burns/ravenscar.ps">http://www-users.cs.york.ac.uk/~burns/ravenscar.ps</a>.
</p>
<p>The original definition of the profile was revised at subsequent IRTAW
meetings. It has been included in the ISO
<cite>Guide for the Use of the Ada Programming Language in High
Integrity Systems</cite>, and has been approved by ISO/IEC/SC22/WG9 for inclusion in
the next revision of the standard. The formal definition given by
the Ada Rapporteur Group (ARG) can be found in two Ada Issues (AI-249 and
AI-305) available at
<a href="http://www.ada-auth.org/cgi-bin/cvsweb.cgi/ais/ai-00249.txt">http://www.ada-auth.org/cgi-bin/cvsweb.cgi/ais/ai-00249.txt</a> and
<a href="http://www.ada-auth.org/cgi-bin/cvsweb.cgi/ais/ai-00305.txt">http://www.ada-auth.org/cgi-bin/cvsweb.cgi/ais/ai-00305.txt</a>.
</p>
<p>The above set is a superset of the restrictions provided by pragma
<code>Profile (Restricted)</code>, it includes six additional restrictions
(<code>Simple_Barriers</code>, <code>No_Select_Statements</code>,
<code>No_Calendar</code>, <code>No_Implicit_Heap_Allocations</code>,
<code>No_Relative_Delay</code> and <code>No_Task_Termination</code>). This means
that pragma <code>Profile (Ravenscar)</code>, like the pragma
<code>Profile (Restricted)</code>,
automatically causes the use of a simplified,
more efficient version of the tasking run-time system.
</p>
<hr>
<a name="Pragma-Profile-_0028Restricted_0029"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Profile-_0028Rational_0029" accesskey="n" rel="next">Pragma Profile (Rational)</a>, Previous: <a href="#Pragma-Profile-_0028Ravenscar_0029" accesskey="p" rel="prev">Pragma Profile (Ravenscar)</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Profile-_0028Restricted_0029-1"></a>
<h3 class="unnumberedsec">Pragma Profile (Restricted)</h3>
<a name="index-Restricted-Run-Time"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Profile (Restricted);
</pre></div>
<p>This is an implementation-defined version of the standard pragma defined
in Ada 2005. It is available in all versions of Ada. It is a
configuration pragma that establishes the following set of restrictions:
</p>
<ul>
<li> No_Abort_Statements
</li><li> No_Entry_Queue
</li><li> No_Task_Hierarchy
</li><li> No_Task_Allocators
</li><li> No_Dynamic_Priorities
</li><li> No_Terminate_Alternatives
</li><li> No_Dynamic_Attachment
</li><li> No_Protected_Type_Allocators
</li><li> No_Local_Protected_Objects
</li><li> No_Requeue_Statements
</li><li> No_Task_Attributes_Package
</li><li> Max_Asynchronous_Select_Nesting = 0
</li><li> Max_Task_Entries = 0
</li><li> Max_Protected_Entries = 1
</li><li> Max_Select_Alternatives = 0
</li></ul>
<p>This set of restrictions causes the automatic selection of a simplified
version of the run time that provides improved performance for the
limited set of tasking functionality permitted by this set of restrictions.
</p>
<hr>
<a name="Pragma-Profile-_0028Rational_0029"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Psect_005fObject" accesskey="n" rel="next">Pragma Psect_Object</a>, Previous: <a href="#Pragma-Profile-_0028Restricted_0029" accesskey="p" rel="prev">Pragma Profile (Restricted)</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Profile-_0028Rational_0029-1"></a>
<h3 class="unnumberedsec">Pragma Profile (Rational)</h3>
<a name="index-Rational-compatibility-mode"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Profile (Rational);
</pre></div>
<p>The Rational profile is intended to facilitate porting legacy code that
compiles with the Rational APEX compiler, even when the code includes non-
conforming Ada constructs. The profile enables the following three pragmas:
</p>
<ul>
<li>pragma Implicit_Packing;
pragma Overriding_Renamings;
pragma Use_VADS_Size;
</li></ul>
<hr>
<a name="Pragma-Psect_005fObject"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Pure_005fFunction" accesskey="n" rel="next">Pragma Pure_Function</a>, Previous: <a href="#Pragma-Profile-_0028Rational_0029" accesskey="p" rel="prev">Pragma Profile (Rational)</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Psect_005fObject-1"></a>
<h3 class="unnumberedsec">Pragma Psect_Object</h3>
<a name="index-Psect_005fObject"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Psect_Object (
[Internal =>] LOCAL_NAME,
[, [External =>] EXTERNAL_SYMBOL]
[, [Size =>] EXTERNAL_SYMBOL]);
EXTERNAL_SYMBOL ::=
IDENTIFIER
| static_string_EXPRESSION
</pre></div>
<p>This pragma is identical in effect to pragma <code>Common_Object</code>.
</p>
<hr>
<a name="Pragma-Pure_005fFunction"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Relative_005fDeadline" accesskey="n" rel="next">Pragma Relative_Deadline</a>, Previous: <a href="#Pragma-Psect_005fObject" accesskey="p" rel="prev">Pragma Psect_Object</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Pure_005fFunction-1"></a>
<h3 class="unnumberedsec">Pragma Pure_Function</h3>
<a name="index-Pure_005fFunction"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Pure_Function ([Entity =>] function_LOCAL_NAME);
</pre></div>
<p>This pragma appears in the same declarative part as a function
declaration (or a set of function declarations if more than one
overloaded declaration exists, in which case the pragma applies
to all entities). It specifies that the function <code>Entity</code> is
to be considered pure for the purposes of code generation. This means
that the compiler can assume that there are no side effects, and
in particular that two calls with identical arguments produce the
same result. It also means that the function can be used in an
address clause.
</p>
<p>Note that, quite deliberately, there are no static checks to try
to ensure that this promise is met, so <code>Pure_Function</code> can be used
with functions that are conceptually pure, even if they do modify
global variables. For example, a square root function that is
instrumented to count the number of times it is called is still
conceptually pure, and can still be optimized, even though it
modifies a global variable (the count). Memo functions are another
example (where a table of previous calls is kept and consulted to
avoid re-computation).
</p>
<p>Note also that the normal rules excluding optimization of subprograms
in pure units (when parameter types are descended from System.Address,
or when the full view of a parameter type is limited), do not apply
for the Pure_Function case. If you explicitly specify Pure_Function,
the compiler may optimize away calls with identical arguments, and
if that results in unexpected behavior, the proper action is not to
use the pragma for subprograms that are not (conceptually) pure.
</p>
<a name="index-Pure"></a>
<p>Note: Most functions in a <code>Pure</code> package are automatically pure, and
there is no need to use pragma <code>Pure_Function</code> for such functions. One
exception is any function that has at least one formal of type
<code>System.Address</code> or a type derived from it. Such functions are not
considered pure by default, since the compiler assumes that the
<code>Address</code> parameter may be functioning as a pointer and that the
referenced data may change even if the address value does not.
Similarly, imported functions are not considered to be pure by default,
since there is no way of checking that they are in fact pure. The use
of pragma <code>Pure_Function</code> for such a function will override these default
assumption, and cause the compiler to treat a designated subprogram as pure
in these cases.
</p>
<p>Note: If pragma <code>Pure_Function</code> is applied to a renamed function, it
applies to the underlying renamed function. This can be used to
disambiguate cases of overloading where some but not all functions
in a set of overloaded functions are to be designated as pure.
</p>
<p>If pragma <code>Pure_Function</code> is applied to a library level function, the
function is also considered pure from an optimization point of view, but the
unit is not a Pure unit in the categorization sense. So for example, a function
thus marked is free to <code>with</code> non-pure units.
</p>
<hr>
<a name="Pragma-Relative_005fDeadline"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Remote_005fAccess_005fType" accesskey="n" rel="next">Pragma Remote_Access_Type</a>, Previous: <a href="#Pragma-Pure_005fFunction" accesskey="p" rel="prev">Pragma Pure_Function</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Relative_005fDeadline-1"></a>
<h3 class="unnumberedsec">Pragma Relative_Deadline</h3>
<a name="index-Relative_005fDeadline"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Relative_Deadline (time_span_EXPRESSSION);
</pre></div>
<p>This pragma is standard in Ada 2005, but is available in all earlier
versions of Ada as an implementation-defined pragma.
See Ada 2012 Reference Manual for details.
</p>
<hr>
<a name="Pragma-Remote_005fAccess_005fType"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Restriction_005fWarnings" accesskey="n" rel="next">Pragma Restriction_Warnings</a>, Previous: <a href="#Pragma-Relative_005fDeadline" accesskey="p" rel="prev">Pragma Relative_Deadline</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Remote_005fAccess_005fType-1"></a>
<h3 class="unnumberedsec">Pragma Remote_Access_Type</h3>
<a name="index-Remote_005fAccess_005fType"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Remote_Access_Type ([Entity =>] formal_access_type_LOCAL_NAME);
</pre></div>
<p>This pragma appears in the formal part of a generic declaration.
It specifies an exception to the RM rule from E.2.2(17/2), which forbids
the use of a remote access to class-wide type as actual for a formal
access type.
</p>
<p>When this pragma applies to a formal access type <code>Entity</code>, that
type is treated as a remote access to class-wide type in the generic.
It must be a formal general access type, and its designated type must
be the class-wide type of a formal tagged limited private type from the
same generic declaration.
</p>
<p>In the generic unit, the formal type is subject to all restrictions
pertaining to remote access to class-wide types. At instantiation, the
actual type must be a remote access to class-wide type.
</p>
<hr>
<a name="Pragma-Restriction_005fWarnings"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Shared" accesskey="n" rel="next">Pragma Shared</a>, Previous: <a href="#Pragma-Remote_005fAccess_005fType" accesskey="p" rel="prev">Pragma Remote_Access_Type</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Restriction_005fWarnings-1"></a>
<h3 class="unnumberedsec">Pragma Restriction_Warnings</h3>
<a name="index-Restriction_005fWarnings"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Restriction_Warnings
(restriction_IDENTIFIER {, restriction_IDENTIFIER});
</pre></div>
<p>This pragma allows a series of restriction identifiers to be
specified (the list of allowed identifiers is the same as for
pragma <code>Restrictions</code>). For each of these identifiers
the compiler checks for violations of the restriction, but
generates a warning message rather than an error message
if the restriction is violated.
</p>
<hr>
<a name="Pragma-Shared"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Short_005fCircuit_005fAnd_005fOr" accesskey="n" rel="next">Pragma Short_Circuit_And_Or</a>, Previous: <a href="#Pragma-Restriction_005fWarnings" accesskey="p" rel="prev">Pragma Restriction_Warnings</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Shared-1"></a>
<h3 class="unnumberedsec">Pragma Shared</h3>
<a name="index-Shared"></a>
<p>This pragma is provided for compatibility with Ada 83. The syntax and
semantics are identical to pragma Atomic.
</p>
<hr>
<a name="Pragma-Short_005fCircuit_005fAnd_005fOr"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Short_005fDescriptors" accesskey="n" rel="next">Pragma Short_Descriptors</a>, Previous: <a href="#Pragma-Shared" accesskey="p" rel="prev">Pragma Shared</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Short_005fCircuit_005fAnd_005fOr-1"></a>
<h3 class="unnumberedsec">Pragma Short_Circuit_And_Or</h3>
<a name="index-Short_005fCircuit_005fAnd_005fOr"></a>
<p>This configuration pragma causes any occurrence of the AND operator applied to
operands of type Standard.Boolean to be short-circuited (i.e. the AND operator
is treated as if it were AND THEN). Or is similarly treated as OR ELSE. This
may be useful in the context of certification protocols requiring the use of
short-circuited logical operators. If this configuration pragma occurs locally
within the file being compiled, it applies only to the file being compiled.
There is no requirement that all units in a partition use this option.
</p>
<hr>
<a name="Pragma-Short_005fDescriptors"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Simple_005fStorage_005fPool_005fType" accesskey="n" rel="next">Pragma Simple_Storage_Pool_Type</a>, Previous: <a href="#Pragma-Short_005fCircuit_005fAnd_005fOr" accesskey="p" rel="prev">Pragma Short_Circuit_And_Or</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Short_005fDescriptors-1"></a>
<h3 class="unnumberedsec">Pragma Short_Descriptors</h3>
<a name="index-Short_005fDescriptors"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Short_Descriptors
</pre></div>
<p>In VMS versions of the compiler, this configuration pragma causes all
occurrences of the mechanism types Descriptor[_xxx] to be treated as
Short_Descriptor[_xxx]. This is helpful in porting legacy applications from a
32-bit environment to a 64-bit environment. This pragma is ignored for non-VMS
versions.
</p>
<hr>
<a name="Pragma-Simple_005fStorage_005fPool_005fType"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Source_005fFile_005fName" accesskey="n" rel="next">Pragma Source_File_Name</a>, Previous: <a href="#Pragma-Short_005fDescriptors" accesskey="p" rel="prev">Pragma Short_Descriptors</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Simple_005fStorage_005fPool_005fType-1"></a>
<h3 class="unnumberedsec">Pragma Simple_Storage_Pool_Type</h3>
<a name="index-Simple_005fStorage_005fPool_005fType"></a>
<a name="index-Storage-pool_002c-simple"></a>
<a name="index-Simple-storage-pool"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Simple_Storage_Pool_Type (type_LOCAL_NAME);
</pre></div>
<p>A type can be established as a “simple storage pool type” by applying
the representation pragma <code>Simple_Storage_Pool_Type</code> to the type.
A type named in the pragma must be a library-level immutably limited record
type or limited tagged type declared immediately within a package declaration.
The type can also be a limited private type whose full type is allowed as
a simple storage pool type.
</p>
<p>For a simple storage pool type <var>SSP</var>, nonabstract primitive subprograms
<code>Allocate</code>, <code>Deallocate</code>, and <code>Storage_Size</code> can be declared that
are subtype conformant with the following subprogram declarations:
</p>
<div class="smallexample">
<pre class="smallexample">procedure Allocate
(Pool : in out SSP;
Storage_Address : out System.Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count);
procedure Deallocate
(Pool : in out SSP;
Storage_Address : System.Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count);
function Storage_Size (Pool : SSP)
return System.Storage_Elements.Storage_Count;
</pre></div>
<p>Procedure <code>Allocate</code> must be declared, whereas <code>Deallocate</code> and
<code>Storage_Size</code> are optional. If <code>Deallocate</code> is not declared, then
applying an unchecked deallocation has no effect other than to set its actual
parameter to null. If <code>Storage_Size</code> is not declared, then the
<code>Storage_Size</code> attribute applied to an access type associated with
a pool object of type SSP returns zero. Additional operations can be declared
for a simple storage pool type (such as for supporting a mark/release
storage-management discipline).
</p>
<p>An object of a simple storage pool type can be associated with an access
type by specifying the attribute <code>Simple_Storage_Pool</code>. For example:
</p>
<div class="smallexample">
<pre class="smallexample">
My_Pool : My_Simple_Storage_Pool_Type;
type Acc is access My_Data_Type;
for Acc'Simple_Storage_Pool use My_Pool;
</pre></div>
<p>See attribute <code>Simple_Storage_Pool</code> for further details.
</p>
<hr>
<a name="Pragma-Source_005fFile_005fName"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Source_005fFile_005fName_005fProject" accesskey="n" rel="next">Pragma Source_File_Name_Project</a>, Previous: <a href="#Pragma-Simple_005fStorage_005fPool_005fType" accesskey="p" rel="prev">Pragma Simple_Storage_Pool_Type</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Source_005fFile_005fName-1"></a>
<h3 class="unnumberedsec">Pragma Source_File_Name</h3>
<a name="index-Source_005fFile_005fName"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Source_File_Name (
[Unit_Name =>] unit_NAME,
Spec_File_Name => STRING_LITERAL,
[Index => INTEGER_LITERAL]);
pragma Source_File_Name (
[Unit_Name =>] unit_NAME,
Body_File_Name => STRING_LITERAL,
[Index => INTEGER_LITERAL]);
</pre></div>
<p>Use this to override the normal naming convention. It is a configuration
pragma, and so has the usual applicability of configuration pragmas
(i.e. it applies to either an entire partition, or to all units in a
compilation, or to a single unit, depending on how it is used.
<var>unit_name</var> is mapped to <var>file_name_literal</var>. The identifier for
the second argument is required, and indicates whether this is the file
name for the spec or for the body.
</p>
<p>The optional Index argument should be used when a file contains multiple
units, and when you do not want to use <code>gnatchop</code> to separate then
into multiple files (which is the recommended procedure to limit the
number of recompilations that are needed when some sources change).
For instance, if the source file <samp>source.ada</samp> contains
</p>
<div class="smallexample">
<pre class="smallexample">package B is
...
end B;
with B;
procedure A is
begin
..
end A;
</pre></div>
<p>you could use the following configuration pragmas:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Source_File_Name
(B, Spec_File_Name => "source.ada", Index => 1);
pragma Source_File_Name
(A, Body_File_Name => "source.ada", Index => 2);
</pre></div>
<p>Note that the <code>gnatname</code> utility can also be used to generate those
configuration pragmas.
</p>
<p>Another form of the <code>Source_File_Name</code> pragma allows
the specification of patterns defining alternative file naming schemes
to apply to all files.
</p>
<div class="smallexample">
<pre class="smallexample">pragma Source_File_Name
( [Spec_File_Name =>] STRING_LITERAL
[,[Casing =>] CASING_SPEC]
[,[Dot_Replacement =>] STRING_LITERAL]);
pragma Source_File_Name
( [Body_File_Name =>] STRING_LITERAL
[,[Casing =>] CASING_SPEC]
[,[Dot_Replacement =>] STRING_LITERAL]);
pragma Source_File_Name
( [Subunit_File_Name =>] STRING_LITERAL
[,[Casing =>] CASING_SPEC]
[,[Dot_Replacement =>] STRING_LITERAL]);
CASING_SPEC ::= Lowercase | Uppercase | Mixedcase
</pre></div>
<p>The first argument is a pattern that contains a single asterisk indicating
the point at which the unit name is to be inserted in the pattern string
to form the file name. The second argument is optional. If present it
specifies the casing of the unit name in the resulting file name string.
The default is lower case. Finally the third argument allows for systematic
replacement of any dots in the unit name by the specified string literal.
</p>
<p>Note that Source_File_Name pragmas should not be used if you are using
project files. The reason for this rule is that the project manager is not
aware of these pragmas, and so other tools that use the projet file would not
be aware of the intended naming conventions. If you are using project files,
file naming is controlled by Source_File_Name_Project pragmas, which are
usually supplied automatically by the project manager. A pragma
Source_File_Name cannot appear after a <a href="#Pragma-Source_005fFile_005fName_005fProject">Pragma Source_File_Name_Project</a>.
</p>
<p>For more details on the use of the <code>Source_File_Name</code> pragma,
See <a href="gnat_ugn.html#Using-Other-File-Names">Using Other File Names</a> in <cite>GNAT User’s Guide</cite>,
and <a href="gnat_ugn.html#Alternative-File-Naming-Schemes">Alternative File Naming Schemes</a> in <cite>GNAT
User’s Guide</cite>.
</p>
<hr>
<a name="Pragma-Source_005fFile_005fName_005fProject"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Source_005fReference" accesskey="n" rel="next">Pragma Source_Reference</a>, Previous: <a href="#Pragma-Source_005fFile_005fName" accesskey="p" rel="prev">Pragma Source_File_Name</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Source_005fFile_005fName_005fProject-1"></a>
<h3 class="unnumberedsec">Pragma Source_File_Name_Project</h3>
<a name="index-Source_005fFile_005fName_005fProject"></a>
<p>This pragma has the same syntax and semantics as pragma Source_File_Name.
It is only allowed as a stand alone configuration pragma.
It cannot appear after a <a href="#Pragma-Source_005fFile_005fName">Pragma Source_File_Name</a>, and
most importantly, once pragma Source_File_Name_Project appears,
no further Source_File_Name pragmas are allowed.
</p>
<p>The intention is that Source_File_Name_Project pragmas are always
generated by the Project Manager in a manner consistent with the naming
specified in a project file, and when naming is controlled in this manner,
it is not permissible to attempt to modify this naming scheme using
Source_File_Name or Source_File_Name_Project pragmas (which would not be
known to the project manager).
</p>
<hr>
<a name="Pragma-Source_005fReference"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Static_005fElaboration_005fDesired" accesskey="n" rel="next">Pragma Static_Elaboration_Desired</a>, Previous: <a href="#Pragma-Source_005fFile_005fName_005fProject" accesskey="p" rel="prev">Pragma Source_File_Name_Project</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Source_005fReference-1"></a>
<h3 class="unnumberedsec">Pragma Source_Reference</h3>
<a name="index-Source_005fReference"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Source_Reference (INTEGER_LITERAL, STRING_LITERAL);
</pre></div>
<p>This pragma must appear as the first line of a source file.
<var>integer_literal</var> is the logical line number of the line following
the pragma line (for use in error messages and debugging
information). <var>string_literal</var> is a static string constant that
specifies the file name to be used in error messages and debugging
information. This is most notably used for the output of <code>gnatchop</code>
with the <samp>-r</samp> switch, to make sure that the original unchopped
source file is the one referred to.
</p>
<p>The second argument must be a string literal, it cannot be a static
string expression other than a string literal. This is because its value
is needed for error messages issued by all phases of the compiler.
</p>
<hr>
<a name="Pragma-Static_005fElaboration_005fDesired"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Stream_005fConvert" accesskey="n" rel="next">Pragma Stream_Convert</a>, Previous: <a href="#Pragma-Source_005fReference" accesskey="p" rel="prev">Pragma Source_Reference</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Static_005fElaboration_005fDesired-1"></a>
<h3 class="unnumberedsec">Pragma Static_Elaboration_Desired</h3>
<a name="index-Static_005fElaboration_005fDesired"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Static_Elaboration_Desired;
</pre></div>
<p>This pragma is used to indicate that the compiler should attempt to initialize
statically the objects declared in the library unit to which the pragma applies,
when these objects are initialized (explicitly or implicitly) by an aggregate.
In the absence of this pragma, aggregates in object declarations are expanded
into assignments and loops, even when the aggregate components are static
constants. When the aggregate is present the compiler builds a static expression
that requires no run-time code, so that the initialized object can be placed in
read-only data space. If the components are not static, or the aggregate has
more that 100 components, the compiler emits a warning that the pragma cannot
be obeyed. (See also the restriction No_Implicit_Loops, which supports static
construction of larger aggregates with static components that include an others
choice.)
</p>
<hr>
<a name="Pragma-Stream_005fConvert"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Style_005fChecks" accesskey="n" rel="next">Pragma Style_Checks</a>, Previous: <a href="#Pragma-Static_005fElaboration_005fDesired" accesskey="p" rel="prev">Pragma Static_Elaboration_Desired</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Stream_005fConvert-1"></a>
<h3 class="unnumberedsec">Pragma Stream_Convert</h3>
<a name="index-Stream_005fConvert"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Stream_Convert (
[Entity =>] type_LOCAL_NAME,
[Read =>] function_NAME,
[Write =>] function_NAME);
</pre></div>
<p>This pragma provides an efficient way of providing stream functions for
types defined in packages. Not only is it simpler to use than declaring
the necessary functions with attribute representation clauses, but more
significantly, it allows the declaration to made in such a way that the
stream packages are not loaded unless they are needed. The use of
the Stream_Convert pragma adds no overhead at all, unless the stream
attributes are actually used on the designated type.
</p>
<p>The first argument specifies the type for which stream functions are
provided. The second parameter provides a function used to read values
of this type. It must name a function whose argument type may be any
subtype, and whose returned type must be the type given as the first
argument to the pragma.
</p>
<p>The meaning of the <var>Read</var>
parameter is that if a stream attribute directly
or indirectly specifies reading of the type given as the first parameter,
then a value of the type given as the argument to the Read function is
read from the stream, and then the Read function is used to convert this
to the required target type.
</p>
<p>Similarly the <var>Write</var> parameter specifies how to treat write attributes
that directly or indirectly apply to the type given as the first parameter.
It must have an input parameter of the type specified by the first parameter,
and the return type must be the same as the input type of the Read function.
The effect is to first call the Write function to convert to the given stream
type, and then write the result type to the stream.
</p>
<p>The Read and Write functions must not be overloaded subprograms. If necessary
renamings can be supplied to meet this requirement.
The usage of this attribute is best illustrated by a simple example, taken
from the GNAT implementation of package Ada.Strings.Unbounded:
</p>
<div class="smallexample">
<pre class="smallexample">function To_Unbounded (S : String)
return Unbounded_String
renames To_Unbounded_String;
pragma Stream_Convert
(Unbounded_String, To_Unbounded, To_String);
</pre></div>
<p>The specifications of the referenced functions, as given in the Ada
Reference Manual are:
</p>
<div class="smallexample">
<pre class="smallexample">function To_Unbounded_String (Source : String)
return Unbounded_String;
function To_String (Source : Unbounded_String)
return String;
</pre></div>
<p>The effect is that if the value of an unbounded string is written to a stream,
then the representation of the item in the stream is in the same format that
would be used for <code>Standard.String'Output</code>, and this same representation
is expected when a value of this type is read from the stream. Note that the
value written always includes the bounds, even for Unbounded_String’Write,
since Unbounded_String is not an array type.
</p>
<hr>
<a name="Pragma-Style_005fChecks"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Subtitle" accesskey="n" rel="next">Pragma Subtitle</a>, Previous: <a href="#Pragma-Stream_005fConvert" accesskey="p" rel="prev">Pragma Stream_Convert</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Style_005fChecks-1"></a>
<h3 class="unnumberedsec">Pragma Style_Checks</h3>
<a name="index-Style_005fChecks"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Style_Checks (string_LITERAL | ALL_CHECKS |
On | Off [, LOCAL_NAME]);
</pre></div>
<p>This pragma is used in conjunction with compiler switches to control the
built in style checking provided by GNAT. The compiler switches, if set,
provide an initial setting for the switches, and this pragma may be used
to modify these settings, or the settings may be provided entirely by
the use of the pragma. This pragma can be used anywhere that a pragma
is legal, including use as a configuration pragma (including use in
the <samp>gnat.adc</samp> file).
</p>
<p>The form with a string literal specifies which style options are to be
activated. These are additive, so they apply in addition to any previously
set style check options. The codes for the options are the same as those
used in the <samp>-gnaty</samp> switch to <code>gcc</code> or <code>gnatmake</code>.
For example the following two methods can be used to enable
layout checking:
</p>
<ul>
<li> <div class="smallexample">
<pre class="smallexample">pragma Style_Checks ("l");
</pre></div>
</li><li> <div class="smallexample">
<pre class="smallexample">gcc -c -gnatyl …
</pre></div>
</li></ul>
<p>The form ALL_CHECKS activates all standard checks (its use is equivalent
to the use of the <code>gnaty</code> switch with no options. See <a href="gnat_ugn.html#Top">About This Guide</a> in <cite>GNAT User’s Guide</cite>, for details.)
</p>
<p>Note: the behavior is slightly different in GNAT mode (<samp>-gnatg</samp> used).
In this case, ALL_CHECKS implies the standard set of GNAT mode style check
options (i.e. equivalent to -gnatyg).
</p>
<p>The forms with <code>Off</code> and <code>On</code>
can be used to temporarily disable style checks
as shown in the following example:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Style_Checks ("k"); -- requires keywords in lower case
pragma Style_Checks (Off); -- turn off style checks
NULL; -- this will not generate an error message
pragma Style_Checks (On); -- turn style checks back on
NULL; -- this will generate an error message
</pre></div>
<p>Finally the two argument form is allowed only if the first argument is
<code>On</code> or <code>Off</code>. The effect is to turn of semantic style checks
for the specified entity, as shown in the following example:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Style_Checks ("r"); -- require consistency of identifier casing
Arg : Integer;
Rf1 : Integer := ARG; -- incorrect, wrong case
pragma Style_Checks (Off, Arg);
Rf2 : Integer := ARG; -- OK, no error
</pre></div>
<hr>
<a name="Pragma-Subtitle"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Suppress" accesskey="n" rel="next">Pragma Suppress</a>, Previous: <a href="#Pragma-Style_005fChecks" accesskey="p" rel="prev">Pragma Style_Checks</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Subtitle-1"></a>
<h3 class="unnumberedsec">Pragma Subtitle</h3>
<a name="index-Subtitle"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Subtitle ([Subtitle =>] STRING_LITERAL);
</pre></div>
<p>This pragma is recognized for compatibility with other Ada compilers
but is ignored by GNAT.
</p>
<hr>
<a name="Pragma-Suppress"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Suppress_005fAll" accesskey="n" rel="next">Pragma Suppress_All</a>, Previous: <a href="#Pragma-Subtitle" accesskey="p" rel="prev">Pragma Subtitle</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Suppress-1"></a>
<h3 class="unnumberedsec">Pragma Suppress</h3>
<a name="index-Suppress"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Suppress (Identifier [, [On =>] Name]);
</pre></div>
<p>This is a standard pragma, and supports all the check names required in
the RM. It is included here because GNAT recognizes one additional check
name: <code>Alignment_Check</code> which can be used to suppress alignment checks
on addresses used in address clauses. Such checks can also be suppressed
by suppressing range checks, but the specific use of <code>Alignment_Check</code>
allows suppression of alignment checks without suppressing other range checks.
</p>
<p>Note that pragma Suppress gives the compiler permission to omit
checks, but does not require the compiler to omit checks. The compiler
will generate checks if they are essentially free, even when they are
suppressed. In particular, if the compiler can prove that a certain
check will necessarily fail, it will generate code to do an
unconditional “raise”, even if checks are suppressed. The compiler
warns in this case.
</p>
<p>Of course, run-time checks are omitted whenever the compiler can prove
that they will not fail, whether or not checks are suppressed.
</p>
<hr>
<a name="Pragma-Suppress_005fAll"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Suppress_005fException_005fLocations" accesskey="n" rel="next">Pragma Suppress_Exception_Locations</a>, Previous: <a href="#Pragma-Suppress" accesskey="p" rel="prev">Pragma Suppress</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Suppress_005fAll-1"></a>
<h3 class="unnumberedsec">Pragma Suppress_All</h3>
<a name="index-Suppress_005fAll"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Suppress_All;
</pre></div>
<p>This pragma can appear anywhere within a unit.
The effect is to apply <code>Suppress (All_Checks)</code> to the unit
in which it appears. This pragma is implemented for compatibility with DEC
Ada 83 usage where it appears at the end of a unit, and for compatibility
with Rational Ada, where it appears as a program unit pragma.
The use of the standard Ada pragma <code>Suppress (All_Checks)</code>
as a normal configuration pragma is the preferred usage in GNAT.
</p>
<hr>
<a name="Pragma-Suppress_005fException_005fLocations"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Suppress_005fInitialization" accesskey="n" rel="next">Pragma Suppress_Initialization</a>, Previous: <a href="#Pragma-Suppress_005fAll" accesskey="p" rel="prev">Pragma Suppress_All</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Suppress_005fException_005fLocations-1"></a>
<h3 class="unnumberedsec">Pragma Suppress_Exception_Locations</h3>
<a name="index-Suppress_005fException_005fLocations"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Suppress_Exception_Locations;
</pre></div>
<p>In normal mode, a raise statement for an exception by default generates
an exception message giving the file name and line number for the location
of the raise. This is useful for debugging and logging purposes, but this
entails extra space for the strings for the messages. The configuration
pragma <code>Suppress_Exception_Locations</code> can be used to suppress the
generation of these strings, with the result that space is saved, but the
exception message for such raises is null. This configuration pragma may
appear in a global configuration pragma file, or in a specific unit as
usual. It is not required that this pragma be used consistently within
a partition, so it is fine to have some units within a partition compiled
with this pragma and others compiled in normal mode without it.
</p>
<hr>
<a name="Pragma-Suppress_005fInitialization"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Task_005fInfo" accesskey="n" rel="next">Pragma Task_Info</a>, Previous: <a href="#Pragma-Suppress_005fException_005fLocations" accesskey="p" rel="prev">Pragma Suppress_Exception_Locations</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Suppress_005fInitialization-1"></a>
<h3 class="unnumberedsec">Pragma Suppress_Initialization</h3>
<a name="index-Suppress_005fInitialization"></a>
<a name="index-Suppressing-initialization"></a>
<a name="index-Initialization_002c-suppression-of"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Suppress_Initialization ([Entity =>] subtype_Name);
</pre></div>
<p>Here subtype_Name is the name introduced by a type declaration
or subtype declaration.
This pragma suppresses any implicit or explicit initialization
for all variables of the given type or subtype,
including initialization resulting from the use of pragmas
Normalize_Scalars or Initialize_Scalars.
</p>
<p>This is considered a representation item, so it cannot be given after
the type is frozen. It applies to all subsequent object declarations,
and also any allocator that creates objects of the type.
</p>
<p>If the pragma is given for the first subtype, then it is considered
to apply to the base type and all its subtypes. If the pragma is given
for other than a first subtype, then it applies only to the given subtype.
The pragma may not be given after the type is frozen.
</p>
<hr>
<a name="Pragma-Task_005fInfo"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Task_005fName" accesskey="n" rel="next">Pragma Task_Name</a>, Previous: <a href="#Pragma-Suppress_005fInitialization" accesskey="p" rel="prev">Pragma Suppress_Initialization</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Task_005fInfo-1"></a>
<h3 class="unnumberedsec">Pragma Task_Info</h3>
<a name="index-Task_005fInfo"></a>
<p>Syntax
</p>
<div class="smallexample">
<pre class="smallexample">pragma Task_Info (EXPRESSION);
</pre></div>
<p>This pragma appears within a task definition (like pragma
<code>Priority</code>) and applies to the task in which it appears. The
argument must be of type <code>System.Task_Info.Task_Info_Type</code>.
The <code>Task_Info</code> pragma provides system dependent control over
aspects of tasking implementation, for example, the ability to map
tasks to specific processors. For details on the facilities available
for the version of GNAT that you are using, see the documentation
in the spec of package System.Task_Info in the runtime
library.
</p>
<hr>
<a name="Pragma-Task_005fName"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Task_005fStorage" accesskey="n" rel="next">Pragma Task_Storage</a>, Previous: <a href="#Pragma-Task_005fInfo" accesskey="p" rel="prev">Pragma Task_Info</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Task_005fName-1"></a>
<h3 class="unnumberedsec">Pragma Task_Name</h3>
<a name="index-Task_005fName"></a>
<p>Syntax
</p>
<div class="smallexample">
<pre class="smallexample">pragma Task_Name (string_EXPRESSION);
</pre></div>
<p>This pragma appears within a task definition (like pragma
<code>Priority</code>) and applies to the task in which it appears. The
argument must be of type String, and provides a name to be used for
the task instance when the task is created. Note that this expression
is not required to be static, and in particular, it can contain
references to task discriminants. This facility can be used to
provide different names for different tasks as they are created,
as illustrated in the example below.
</p>
<p>The task name is recorded internally in the run-time structures
and is accessible to tools like the debugger. In addition the
routine <code>Ada.Task_Identification.Image</code> will return this
string, with a unique task address appended.
</p>
<div class="smallexample">
<pre class="smallexample">-- Example of the use of pragma Task_Name
with Ada.Task_Identification;
use Ada.Task_Identification;
with Text_IO; use Text_IO;
procedure t3 is
type Astring is access String;
task type Task_Typ (Name : access String) is
pragma Task_Name (Name.all);
end Task_Typ;
task body Task_Typ is
Nam : constant String := Image (Current_Task);
begin
Put_Line ("-->" & Nam (1 .. 14) & "<--");
end Task_Typ;
type Ptr_Task is access Task_Typ;
Task_Var : Ptr_Task;
begin
Task_Var :=
new Task_Typ (new String'("This is task 1"));
Task_Var :=
new Task_Typ (new String'("This is task 2"));
end;
</pre></div>
<hr>
<a name="Pragma-Task_005fStorage"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Test_005fCase" accesskey="n" rel="next">Pragma Test_Case</a>, Previous: <a href="#Pragma-Task_005fName" accesskey="p" rel="prev">Pragma Task_Name</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Task_005fStorage-1"></a>
<h3 class="unnumberedsec">Pragma Task_Storage</h3>
<a name="index-Task_005fStorage"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Task_Storage (
[Task_Type =>] LOCAL_NAME,
[Top_Guard =>] static_integer_EXPRESSION);
</pre></div>
<p>This pragma specifies the length of the guard area for tasks. The guard
area is an additional storage area allocated to a task. A value of zero
means that either no guard area is created or a minimal guard area is
created, depending on the target. This pragma can appear anywhere a
<code>Storage_Size</code> attribute definition clause is allowed for a task
type.
</p>
<hr>
<a name="Pragma-Test_005fCase"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Thread_005fLocal_005fStorage" accesskey="n" rel="next">Pragma Thread_Local_Storage</a>, Previous: <a href="#Pragma-Task_005fStorage" accesskey="p" rel="prev">Pragma Task_Storage</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Test_005fCase-1"></a>
<h3 class="unnumberedsec">Pragma Test_Case</h3>
<a name="index-Test-cases"></a>
<a name="index-Test_005fCase"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Test_Case (
[Name =>] static_string_Expression
,[Mode =>] (Nominal | Robustness)
[, Requires => Boolean_Expression]
[, Ensures => Boolean_Expression]);
</pre></div>
<p>The <code>Test_Case</code> pragma allows defining fine-grain specifications
for use by testing tools. Its syntax is similar to the syntax of the
<code>Contract_Case</code> pragma, which is used for both testing and
formal verification.
The compiler checks the validity of the <code>Test_Case</code> pragma, but its
presence does not lead to any modification of the code generated by the
compiler, contrary to the treatment of the <code>Contract_Case</code> pragma.
</p>
<p><code>Test_Case</code> pragmas may only appear immediately following the
(separate) declaration of a subprogram in a package declaration, inside
a package spec unit. Only other pragmas may intervene (that is appear
between the subprogram declaration and a test case).
</p>
<p>The compiler checks that boolean expressions given in <code>Requires</code> and
<code>Ensures</code> are valid, where the rules for <code>Requires</code> are the
same as the rule for an expression in <code>Precondition</code> and the rules
for <code>Ensures</code> are the same as the rule for an expression in
<code>Postcondition</code>. In particular, attributes <code>'Old</code> and
<code>'Result</code> can only be used within the <code>Ensures</code>
expression. The following is an example of use within a package spec:
</p>
<div class="smallexample">
<pre class="smallexample">package Math_Functions is
...
function Sqrt (Arg : Float) return Float;
pragma Test_Case (Name => "Test 1",
Mode => Nominal,
Requires => Arg < 10000,
Ensures => Sqrt'Result < 10);
...
end Math_Functions;
</pre></div>
<p>The meaning of a test case is that there is at least one context where
<code>Requires</code> holds such that, if the associated subprogram is executed in
that context, then <code>Ensures</code> holds when the subprogram returns.
Mode <code>Nominal</code> indicates that the input context should also satisfy the
precondition of the subprogram, and the output context should also satisfy its
postcondition. More <code>Robustness</code> indicates that the precondition and
postcondition of the subprogram should be ignored for this test case.
</p>
<hr>
<a name="Pragma-Thread_005fLocal_005fStorage"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Time_005fSlice" accesskey="n" rel="next">Pragma Time_Slice</a>, Previous: <a href="#Pragma-Test_005fCase" accesskey="p" rel="prev">Pragma Test_Case</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Thread_005fLocal_005fStorage-1"></a>
<h3 class="unnumberedsec">Pragma Thread_Local_Storage</h3>
<a name="index-Thread_005fLocal_005fStorage"></a>
<a name="index-Task-specific-storage"></a>
<a name="index-TLS-_0028Thread-Local-Storage_0029"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Thread_Local_Storage ([Entity =>] LOCAL_NAME);
</pre></div>
<p>This pragma specifies that the specified entity, which must be
a variable declared in a library level package, is to be marked as
"Thread Local Storage" (<code>TLS</code>). On systems supporting this (which
include Solaris, GNU/Linux and VxWorks 6), this causes each thread
(and hence each Ada task) to see a distinct copy of the variable.
</p>
<p>The variable may not have default initialization, and if there is
an explicit initialization, it must be either <code>null</code> for an
access variable, or a static expression for a scalar variable.
This provides a low level mechanism similar to that provided by
the <code>Ada.Task_Attributes</code> package, but much more efficient
and is also useful in writing interface code that will interact
with foreign threads.
</p>
<p>If this pragma is used on a system where <code>TLS</code> is not supported,
then an error message will be generated and the program will be rejected.
</p>
<hr>
<a name="Pragma-Time_005fSlice"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Title" accesskey="n" rel="next">Pragma Title</a>, Previous: <a href="#Pragma-Thread_005fLocal_005fStorage" accesskey="p" rel="prev">Pragma Thread_Local_Storage</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Time_005fSlice-1"></a>
<h3 class="unnumberedsec">Pragma Time_Slice</h3>
<a name="index-Time_005fSlice"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Time_Slice (static_duration_EXPRESSION);
</pre></div>
<p>For implementations of GNAT on operating systems where it is possible
to supply a time slice value, this pragma may be used for this purpose.
It is ignored if it is used in a system that does not allow this control,
or if it appears in other than the main program unit.
<a name="index-OpenVMS-13"></a>
Note that the effect of this pragma is identical to the effect of the
DEC Ada 83 pragma of the same name when operating under OpenVMS systems.
</p>
<hr>
<a name="Pragma-Title"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Unchecked_005fUnion" accesskey="n" rel="next">Pragma Unchecked_Union</a>, Previous: <a href="#Pragma-Time_005fSlice" accesskey="p" rel="prev">Pragma Time_Slice</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Title-1"></a>
<h3 class="unnumberedsec">Pragma Title</h3>
<a name="index-Title"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Title (TITLING_OPTION [, TITLING OPTION]);
TITLING_OPTION ::=
[Title =>] STRING_LITERAL,
| [Subtitle =>] STRING_LITERAL
</pre></div>
<p>Syntax checked but otherwise ignored by GNAT. This is a listing control
pragma used in DEC Ada 83 implementations to provide a title and/or
subtitle for the program listing. The program listing generated by GNAT
does not have titles or subtitles.
</p>
<p>Unlike other pragmas, the full flexibility of named notation is allowed
for this pragma, i.e. the parameters may be given in any order if named
notation is used, and named and positional notation can be mixed
following the normal rules for procedure calls in Ada.
</p>
<hr>
<a name="Pragma-Unchecked_005fUnion"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Unimplemented_005fUnit" accesskey="n" rel="next">Pragma Unimplemented_Unit</a>, Previous: <a href="#Pragma-Title" accesskey="p" rel="prev">Pragma Title</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Unchecked_005fUnion-1"></a>
<h3 class="unnumberedsec">Pragma Unchecked_Union</h3>
<a name="index-Unions-in-C"></a>
<a name="index-Unchecked_005fUnion"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Unchecked_Union (first_subtype_LOCAL_NAME);
</pre></div>
<p>This pragma is used to specify a representation of a record type that is
equivalent to a C union. It was introduced as a GNAT implementation defined
pragma in the GNAT Ada 95 mode. Ada 2005 includes an extended version of this
pragma, making it language defined, and GNAT fully implements this extended
version in all language modes (Ada 83, Ada 95, and Ada 2005). For full
details, consult the Ada 2012 Reference Manual, section B.3.3.
</p>
<hr>
<a name="Pragma-Unimplemented_005fUnit"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Universal_005fAliasing" accesskey="n" rel="next">Pragma Universal_Aliasing</a>, Previous: <a href="#Pragma-Unchecked_005fUnion" accesskey="p" rel="prev">Pragma Unchecked_Union</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Unimplemented_005fUnit-1"></a>
<h3 class="unnumberedsec">Pragma Unimplemented_Unit</h3>
<a name="index-Unimplemented_005fUnit"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Unimplemented_Unit;
</pre></div>
<p>If this pragma occurs in a unit that is processed by the compiler, GNAT
aborts with the message ‘<samp><var>xxx</var> not implemented</samp>’, where
<var>xxx</var> is the name of the current compilation unit. This pragma is
intended to allow the compiler to handle unimplemented library units in
a clean manner.
</p>
<p>The abort only happens if code is being generated. Thus you can use
specs of unimplemented packages in syntax or semantic checking mode.
</p>
<hr>
<a name="Pragma-Universal_005fAliasing"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Universal_005fData" accesskey="n" rel="next">Pragma Universal_Data</a>, Previous: <a href="#Pragma-Unimplemented_005fUnit" accesskey="p" rel="prev">Pragma Unimplemented_Unit</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Universal_005fAliasing-1"></a>
<h3 class="unnumberedsec">Pragma Universal_Aliasing</h3>
<a name="index-Universal_005fAliasing"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Universal_Aliasing [([Entity =>] type_LOCAL_NAME)];
</pre></div>
<p><var>type_LOCAL_NAME</var> must refer to a type declaration in the current
declarative part. The effect is to inhibit strict type-based aliasing
optimization for the given type. In other words, the effect is as though
access types designating this type were subject to pragma No_Strict_Aliasing.
For a detailed description of the strict aliasing optimization, and the
situations in which it must be suppressed, See <a href="gnat_ugn.html#Optimization-and-Strict-Aliasing">Optimization and Strict
Aliasing</a> in <cite>GNAT User’s Guide</cite>.
</p>
<hr>
<a name="Pragma-Universal_005fData"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Unmodified" accesskey="n" rel="next">Pragma Unmodified</a>, Previous: <a href="#Pragma-Universal_005fAliasing" accesskey="p" rel="prev">Pragma Universal_Aliasing</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Universal_005fData-1"></a>
<h3 class="unnumberedsec">Pragma Universal_Data</h3>
<a name="index-Universal_005fData"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Universal_Data [(library_unit_Name)];
</pre></div>
<p>This pragma is supported only for the AAMP target and is ignored for
other targets. The pragma specifies that all library-level objects
(Counter 0 data) associated with the library unit are to be accessed
and updated using universal addressing (24-bit addresses for AAMP5)
rather than the default of 16-bit Data Environment (DENV) addressing.
Use of this pragma will generally result in less efficient code for
references to global data associated with the library unit, but
allows such data to be located anywhere in memory. This pragma is
a library unit pragma, but can also be used as a configuration pragma
(including use in the <samp>gnat.adc</samp> file). The functionality
of this pragma is also available by applying the -univ switch on the
compilations of units where universal addressing of the data is desired.
</p>
<hr>
<a name="Pragma-Unmodified"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Unreferenced" accesskey="n" rel="next">Pragma Unreferenced</a>, Previous: <a href="#Pragma-Universal_005fData" accesskey="p" rel="prev">Pragma Universal_Data</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Unmodified-1"></a>
<h3 class="unnumberedsec">Pragma Unmodified</h3>
<a name="index-Unmodified"></a>
<a name="index-Warnings_002c-unmodified"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Unmodified (LOCAL_NAME {, LOCAL_NAME});
</pre></div>
<p>This pragma signals that the assignable entities (variables,
<code>out</code> parameters, <code>in out</code> parameters) whose names are listed are
deliberately not assigned in the current source unit. This
suppresses warnings about the
entities being referenced but not assigned, and in addition a warning will be
generated if one of these entities is in fact assigned in the
same unit as the pragma (or in the corresponding body, or one
of its subunits).
</p>
<p>This is particularly useful for clearly signaling that a particular
parameter is not modified, even though the spec suggests that it might
be.
</p>
<hr>
<a name="Pragma-Unreferenced"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Unreferenced_005fObjects" accesskey="n" rel="next">Pragma Unreferenced_Objects</a>, Previous: <a href="#Pragma-Unmodified" accesskey="p" rel="prev">Pragma Unmodified</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Unreferenced-1"></a>
<h3 class="unnumberedsec">Pragma Unreferenced</h3>
<a name="index-Unreferenced"></a>
<a name="index-Warnings_002c-unreferenced"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Unreferenced (LOCAL_NAME {, LOCAL_NAME});
pragma Unreferenced (library_unit_NAME {, library_unit_NAME});
</pre></div>
<p>This pragma signals that the entities whose names are listed are
deliberately not referenced in the current source unit. This
suppresses warnings about the
entities being unreferenced, and in addition a warning will be
generated if one of these entities is in fact subsequently referenced in the
same unit as the pragma (or in the corresponding body, or one
of its subunits).
</p>
<p>This is particularly useful for clearly signaling that a particular
parameter is not referenced in some particular subprogram implementation
and that this is deliberate. It can also be useful in the case of
objects declared only for their initialization or finalization side
effects.
</p>
<p>If <code>LOCAL_NAME</code> identifies more than one matching homonym in the
current scope, then the entity most recently declared is the one to which
the pragma applies. Note that in the case of accept formals, the pragma
Unreferenced may appear immediately after the keyword <code>do</code> which
allows the indication of whether or not accept formals are referenced
or not to be given individually for each accept statement.
</p>
<p>The left hand side of an assignment does not count as a reference for the
purpose of this pragma. Thus it is fine to assign to an entity for which
pragma Unreferenced is given.
</p>
<p>Note that if a warning is desired for all calls to a given subprogram,
regardless of whether they occur in the same unit as the subprogram
declaration, then this pragma should not be used (calls from another
unit would not be flagged); pragma Obsolescent can be used instead
for this purpose, see See <a href="#Pragma-Obsolescent">Pragma Obsolescent</a>.
</p>
<p>The second form of pragma <code>Unreferenced</code> is used within a context
clause. In this case the arguments must be unit names of units previously
mentioned in <code>with</code> clauses (similar to the usage of pragma
<code>Elaborate_All</code>. The effect is to suppress warnings about unreferenced
units and unreferenced entities within these units.
</p>
<hr>
<a name="Pragma-Unreferenced_005fObjects"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Unreserve_005fAll_005fInterrupts" accesskey="n" rel="next">Pragma Unreserve_All_Interrupts</a>, Previous: <a href="#Pragma-Unreferenced" accesskey="p" rel="prev">Pragma Unreferenced</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Unreferenced_005fObjects-1"></a>
<h3 class="unnumberedsec">Pragma Unreferenced_Objects</h3>
<a name="index-Unreferenced_005fObjects"></a>
<a name="index-Warnings_002c-unreferenced-1"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Unreferenced_Objects (local_subtype_NAME {, local_subtype_NAME});
</pre></div>
<p>This pragma signals that for the types or subtypes whose names are
listed, objects which are declared with one of these types or subtypes may
not be referenced, and if no references appear, no warnings are given.
</p>
<p>This is particularly useful for objects which are declared solely for their
initialization and finalization effect. Such variables are sometimes referred
to as RAII variables (Resource Acquisition Is Initialization). Using this
pragma on the relevant type (most typically a limited controlled type), the
compiler will automatically suppress unwanted warnings about these variables
not being referenced.
</p>
<hr>
<a name="Pragma-Unreserve_005fAll_005fInterrupts"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Unsuppress" accesskey="n" rel="next">Pragma Unsuppress</a>, Previous: <a href="#Pragma-Unreferenced_005fObjects" accesskey="p" rel="prev">Pragma Unreferenced_Objects</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Unreserve_005fAll_005fInterrupts-1"></a>
<h3 class="unnumberedsec">Pragma Unreserve_All_Interrupts</h3>
<a name="index-Unreserve_005fAll_005fInterrupts"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Unreserve_All_Interrupts;
</pre></div>
<p>Normally certain interrupts are reserved to the implementation. Any attempt
to attach an interrupt causes Program_Error to be raised, as described in
RM C.3.2(22). A typical example is the <code>SIGINT</code> interrupt used in
many systems for a <kbd>Ctrl-C</kbd> interrupt. Normally this interrupt is
reserved to the implementation, so that <kbd>Ctrl-C</kbd> can be used to
interrupt execution.
</p>
<p>If the pragma <code>Unreserve_All_Interrupts</code> appears anywhere in any unit in
a program, then all such interrupts are unreserved. This allows the
program to handle these interrupts, but disables their standard
functions. For example, if this pragma is used, then pressing
<kbd>Ctrl-C</kbd> will not automatically interrupt execution. However,
a program can then handle the <code>SIGINT</code> interrupt as it chooses.
</p>
<p>For a full list of the interrupts handled in a specific implementation,
see the source code for the spec of <code>Ada.Interrupts.Names</code> in
file <samp>a-intnam.ads</samp>. This is a target dependent file that contains the
list of interrupts recognized for a given target. The documentation in
this file also specifies what interrupts are affected by the use of
the <code>Unreserve_All_Interrupts</code> pragma.
</p>
<p>For a more general facility for controlling what interrupts can be
handled, see pragma <code>Interrupt_State</code>, which subsumes the functionality
of the <code>Unreserve_All_Interrupts</code> pragma.
</p>
<hr>
<a name="Pragma-Unsuppress"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Use_005fVADS_005fSize" accesskey="n" rel="next">Pragma Use_VADS_Size</a>, Previous: <a href="#Pragma-Unreserve_005fAll_005fInterrupts" accesskey="p" rel="prev">Pragma Unreserve_All_Interrupts</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Unsuppress-1"></a>
<h3 class="unnumberedsec">Pragma Unsuppress</h3>
<a name="index-Unsuppress"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Unsuppress (IDENTIFIER [, [On =>] NAME]);
</pre></div>
<p>This pragma undoes the effect of a previous pragma <code>Suppress</code>. If
there is no corresponding pragma <code>Suppress</code> in effect, it has no
effect. The range of the effect is the same as for pragma
<code>Suppress</code>. The meaning of the arguments is identical to that used
in pragma <code>Suppress</code>.
</p>
<p>One important application is to ensure that checks are on in cases where
code depends on the checks for its correct functioning, so that the code
will compile correctly even if the compiler switches are set to suppress
checks.
</p>
<p>This pragma is standard in Ada 2005. It is available in all earlier versions
of Ada as an implementation-defined pragma.
</p>
<hr>
<a name="Pragma-Use_005fVADS_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Validity_005fChecks" accesskey="n" rel="next">Pragma Validity_Checks</a>, Previous: <a href="#Pragma-Unsuppress" accesskey="p" rel="prev">Pragma Unsuppress</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Use_005fVADS_005fSize-1"></a>
<h3 class="unnumberedsec">Pragma Use_VADS_Size</h3>
<a name="index-Size_002c-VADS-compatibility"></a>
<a name="index-Rational-profile"></a>
<a name="index-Use_005fVADS_005fSize"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Use_VADS_Size;
</pre></div>
<p>This is a configuration pragma. In a unit to which it applies, any use
of the ’Size attribute is automatically interpreted as a use of the
’VADS_Size attribute. Note that this may result in incorrect semantic
processing of valid Ada 95 or Ada 2005 programs. This is intended to aid in
the handling of existing code which depends on the interpretation of Size
as implemented in the VADS compiler. See description of the VADS_Size
attribute for further details.
</p>
<hr>
<a name="Pragma-Validity_005fChecks"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Volatile" accesskey="n" rel="next">Pragma Volatile</a>, Previous: <a href="#Pragma-Use_005fVADS_005fSize" accesskey="p" rel="prev">Pragma Use_VADS_Size</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Validity_005fChecks-1"></a>
<h3 class="unnumberedsec">Pragma Validity_Checks</h3>
<a name="index-Validity_005fChecks"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Validity_Checks (string_LITERAL | ALL_CHECKS | On | Off);
</pre></div>
<p>This pragma is used in conjunction with compiler switches to control the
built-in validity checking provided by GNAT. The compiler switches, if set
provide an initial setting for the switches, and this pragma may be used
to modify these settings, or the settings may be provided entirely by
the use of the pragma. This pragma can be used anywhere that a pragma
is legal, including use as a configuration pragma (including use in
the <samp>gnat.adc</samp> file).
</p>
<p>The form with a string literal specifies which validity options are to be
activated. The validity checks are first set to include only the default
reference manual settings, and then a string of letters in the string
specifies the exact set of options required. The form of this string
is exactly as described for the <samp>-gnatVx</samp> compiler switch (see the
GNAT User’s Guide for details). For example the following two
methods can be used to enable validity checking for mode <code>in</code> and
<code>in out</code> subprogram parameters:
</p>
<ul>
<li> <div class="smallexample">
<pre class="smallexample">pragma Validity_Checks ("im");
</pre></div>
</li><li> <div class="smallexample">
<pre class="smallexample">gcc -c -gnatVim …
</pre></div>
</li></ul>
<p>The form ALL_CHECKS activates all standard checks (its use is equivalent
to the use of the <code>gnatva</code> switch.
</p>
<p>The forms with <code>Off</code> and <code>On</code>
can be used to temporarily disable validity checks
as shown in the following example:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Validity_Checks ("c"); -- validity checks for copies
pragma Validity_Checks (Off); -- turn off validity checks
A := B; -- B will not be validity checked
pragma Validity_Checks (On); -- turn validity checks back on
A := C; -- C will be validity checked
</pre></div>
<hr>
<a name="Pragma-Volatile"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Warnings" accesskey="n" rel="next">Pragma Warnings</a>, Previous: <a href="#Pragma-Validity_005fChecks" accesskey="p" rel="prev">Pragma Validity_Checks</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Volatile-1"></a>
<h3 class="unnumberedsec">Pragma Volatile</h3>
<a name="index-Volatile"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Volatile (LOCAL_NAME);
</pre></div>
<p>This pragma is defined by the Ada Reference Manual, and the GNAT
implementation is fully conformant with this definition. The reason it
is mentioned in this section is that a pragma of the same name was supplied
in some Ada 83 compilers, including DEC Ada 83. The Ada 95 / Ada 2005
implementation of pragma Volatile is upwards compatible with the
implementation in DEC Ada 83.
</p>
<hr>
<a name="Pragma-Warnings"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Weak_005fExternal" accesskey="n" rel="next">Pragma Weak_External</a>, Previous: <a href="#Pragma-Volatile" accesskey="p" rel="prev">Pragma Volatile</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Warnings-1"></a>
<h3 class="unnumberedsec">Pragma Warnings</h3>
<a name="index-Warnings"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Warnings (On | Off);
pragma Warnings (On | Off, LOCAL_NAME);
pragma Warnings (static_string_EXPRESSION);
pragma Warnings (On | Off, static_string_EXPRESSION);
</pre></div>
<p>Normally warnings are enabled, with the output being controlled by
the command line switch. Warnings (<code>Off</code>) turns off generation of
warnings until a Warnings (<code>On</code>) is encountered or the end of the
current unit. If generation of warnings is turned off using this
pragma, then no warning messages are output, regardless of the
setting of the command line switches.
</p>
<p>The form with a single argument may be used as a configuration pragma.
</p>
<p>If the <var>LOCAL_NAME</var> parameter is present, warnings are suppressed for
the specified entity. This suppression is effective from the point where
it occurs till the end of the extended scope of the variable (similar to
the scope of <code>Suppress</code>).
</p>
<p>The form with a single static_string_EXPRESSION argument provides more precise
control over which warnings are active. The string is a list of letters
specifying which warnings are to be activated and which deactivated. The
code for these letters is the same as the string used in the command
line switch controlling warnings. For a brief summary, use the gnatmake
command with no arguments, which will generate usage information containing
the list of warnings switches supported. For
full details see <a href="gnat_ugn.html#Warning-Message-Control">Warning Message Control</a> in <cite>GNAT
User’s Guide</cite>.
</p>
<p>The warnings controlled by the ‘-gnatw’ switch are generated by the front end
of the compiler. The ‘GCC’ back end can provide additional warnings and they
are controlled by the ‘-W’ switch.
The form with a single static_string_EXPRESSION argument also works for the
latters, but the string must be a single full ‘-W’ switch in this case.
The above reference lists a few examples of these additional warnings.
</p>
<p>The specified warnings will be in effect until the end of the program
or another pragma Warnings is encountered. The effect of the pragma is
cumulative. Initially the set of warnings is the standard default set
as possibly modified by compiler switches. Then each pragma Warning
modifies this set of warnings as specified. This form of the pragma may
also be used as a configuration pragma.
</p>
<p>The fourth form, with an <code>On|Off</code> parameter and a string, is used to
control individual messages, based on their text. The string argument
is a pattern that is used to match against the text of individual
warning messages (not including the initial "warning: " tag).
</p>
<p>The pattern may contain asterisks, which match zero or more characters in
the message. For example, you can use
<code>pragma Warnings (Off, "*bits of*unused")</code> to suppress the warning
message <code>warning: 960 bits of "a" unused</code>. No other regular
expression notations are permitted. All characters other than asterisk in
these three specific cases are treated as literal characters in the match.
</p>
<p>The above use of patterns to match the message applies only to warning
messages generated by the front end. This form of the pragma with a
string argument can also be used to control back end warnings controlled
by a "-Wxxx" switch. Such warnings can be identified by the appearence
of a string of the form "[-Wxxx]" in the message which identifies the
"-W" switch that controls the message. By using the text of the
"-W" switch in the pragma, such back end warnings can be turned on and off.
</p>
<p>There are two ways to use the pragma in this form. The OFF form can be used as a
configuration pragma. The effect is to suppress all warnings (if any)
that match the pattern string throughout the compilation (or match the
-W switch in the back end case).
</p>
<p>The second usage is to suppress a warning locally, and in this case, two
pragmas must appear in sequence:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Warnings (Off, Pattern);
… code where given warning is to be suppressed
pragma Warnings (On, Pattern);
</pre></div>
<p>In this usage, the pattern string must match in the Off and On pragmas,
and at least one matching warning must be suppressed.
</p>
<p>Note: to write a string that will match any warning, use the string
<code>"***"</code>. It will not work to use a single asterisk or two asterisks
since this looks like an operator name. This form with three asterisks
is similar in effect to specifying <code>pragma Warnings (Off)</code> except that a
matching <code>pragma Warnings (On, "***")</code> will be required. This can be
helpful in avoiding forgetting to turn warnings back on.
</p>
<p>Note: the debug flag -gnatd.i (<code>/NOWARNINGS_PRAGMAS</code> in VMS) can be
used to cause the compiler to entirely ignore all WARNINGS pragmas. This can
be useful in checking whether obsolete pragmas in existing programs are hiding
real problems.
</p>
<p>Note: pragma Warnings does not affect the processing of style messages. See
separate entry for pragma Style_Checks for control of style messages.
</p>
<hr>
<a name="Pragma-Weak_005fExternal"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Wide_005fCharacter_005fEncoding" accesskey="n" rel="next">Pragma Wide_Character_Encoding</a>, Previous: <a href="#Pragma-Warnings" accesskey="p" rel="prev">Pragma Warnings</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Weak_005fExternal-1"></a>
<h3 class="unnumberedsec">Pragma Weak_External</h3>
<a name="index-Weak_005fExternal"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Weak_External ([Entity =>] LOCAL_NAME);
</pre></div>
<p><var>LOCAL_NAME</var> must refer to an object that is declared at the library
level. This pragma specifies that the given entity should be marked as a
weak symbol for the linker. It is equivalent to <code>__attribute__((weak))</code>
in GNU C and causes <var>LOCAL_NAME</var> to be emitted as a weak symbol instead
of a regular symbol, that is to say a symbol that does not have to be
resolved by the linker if used in conjunction with a pragma Import.
</p>
<p>When a weak symbol is not resolved by the linker, its address is set to
zero. This is useful in writing interfaces to external modules that may
or may not be linked in the final executable, for example depending on
configuration settings.
</p>
<p>If a program references at run time an entity to which this pragma has been
applied, and the corresponding symbol was not resolved at link time, then
the execution of the program is erroneous. It is not erroneous to take the
Address of such an entity, for example to guard potential references,
as shown in the example below.
</p>
<p>Some file formats do not support weak symbols so not all target machines
support this pragma.
</p>
<div class="smallexample">
<pre class="smallexample">-- Example of the use of pragma Weak_External
package External_Module is
key : Integer;
pragma Import (C, key);
pragma Weak_External (key);
function Present return boolean;
end External_Module;
with System; use System;
package body External_Module is
function Present return boolean is
begin
return key'Address /= System.Null_Address;
end Present;
end External_Module;
</pre></div>
<hr>
<a name="Pragma-Wide_005fCharacter_005fEncoding"></a>
<div class="header">
<p>
Next: <a href="#Abort_005fSignal" accesskey="n" rel="next">Abort_Signal</a>, Previous: <a href="#Pragma-Weak_005fExternal" accesskey="p" rel="prev">Pragma Weak_External</a>, Up: <a href="#Implementation-Defined-Pragmas" accesskey="u" rel="up">Implementation Defined Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Wide_005fCharacter_005fEncoding-1"></a>
<h3 class="unnumberedsec">Pragma Wide_Character_Encoding</h3>
<a name="index-Wide_005fCharacter_005fEncoding"></a>
<p>Syntax:
</p>
<div class="smallexample">
<pre class="smallexample">pragma Wide_Character_Encoding (IDENTIFIER | CHARACTER_LITERAL);
</pre></div>
<p>This pragma specifies the wide character encoding to be used in program
source text appearing subsequently. It is a configuration pragma, but may
also be used at any point that a pragma is allowed, and it is permissible
to have more than one such pragma in a file, allowing multiple encodings
to appear within the same file.
</p>
<p>The argument can be an identifier or a character literal. In the identifier
case, it is one of <code>HEX</code>, <code>UPPER</code>, <code>SHIFT_JIS</code>,
<code>EUC</code>, <code>UTF8</code>, or <code>BRACKETS</code>. In the character literal
case it is correspondingly one of the characters ‘<samp>h</samp>’, ‘<samp>u</samp>’,
‘<samp>s</samp>’, ‘<samp>e</samp>’, ‘<samp>8</samp>’, or ‘<samp>b</samp>’.
</p>
<p>Note that when the pragma is used within a file, it affects only the
encoding within that file, and does not affect withed units, specs,
or subunits.
</p>
<hr>
<a name="Implementation-Defined-Attributes"></a>
<div class="header">
<p>
Next: <a href="#Standard-and-Implementation-Defined-Restrictions" accesskey="n" rel="next">Standard and Implementation Defined Restrictions</a>, Previous: <a href="#Implementation-Defined-Pragmas" accesskey="p" rel="prev">Implementation Defined Pragmas</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Implementation-Defined-Attributes-1"></a>
<h2 class="chapter">2 Implementation Defined Attributes</h2>
<p>Ada defines (throughout the Ada reference manual,
summarized in Annex K),
a set of attributes that provide useful additional functionality in all
areas of the language. These language defined attributes are implemented
in GNAT and work as described in the Ada Reference Manual.
</p>
<p>In addition, Ada allows implementations to define additional
attributes whose meaning is defined by the implementation. GNAT provides
a number of these implementation-dependent attributes which can be used
to extend and enhance the functionality of the compiler. This section of
the GNAT reference manual describes these additional attributes.
</p>
<p>Note that any program using these attributes may not be portable to
other compilers (although GNAT implements this set of attributes on all
platforms). Therefore if portability to other compilers is an important
consideration, you should minimize the use of these attributes.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Abort_005fSignal" accesskey="1">Abort_Signal</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Address_005fSize" accesskey="2">Address_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Asm_005fInput" accesskey="3">Asm_Input</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Asm_005fOutput" accesskey="4">Asm_Output</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#AST_005fEntry" accesskey="5">AST_Entry</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Bit" accesskey="6">Bit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Bit_005fPosition" accesskey="7">Bit_Position</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Compiler_005fVersion" accesskey="8">Compiler_Version</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Code_005fAddress" accesskey="9">Code_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Default_005fBit_005fOrder">Default_Bit_Order</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Descriptor_005fSize">Descriptor_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elaborated">Elaborated</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elab_005fBody">Elab_Body</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elab_005fSpec">Elab_Spec</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Elab_005fSubp_005fBody">Elab_Subp_Body</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Emax">Emax</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enabled">Enabled</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enum_005fRep">Enum_Rep</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enum_005fVal">Enum_Val</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Epsilon">Epsilon</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Fixed_005fValue">Fixed_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Has_005fAccess_005fValues">Has_Access_Values</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Has_005fDiscriminants">Has_Discriminants</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Img">Img</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Integer_005fValue">Integer_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Invalid_005fValue">Invalid_Value</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Large">Large</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Machine_005fSize">Machine_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Mantissa">Mantissa</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fInterrupt_005fPriority">Max_Interrupt_Priority</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fPriority">Max_Priority</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Maximum_005fAlignment">Maximum_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Mechanism_005fCode">Mechanism_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Null_005fParameter">Null_Parameter</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Object_005fSize">Object_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Passed_005fBy_005fReference">Passed_By_Reference</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pool_005fAddress">Pool_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Range_005fLength">Range_Length</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ref">Ref</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Result">Result</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Safe_005fEmax">Safe_Emax</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Safe_005fLarge">Safe_Large</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Scalar_005fStorage_005fOrder">Scalar_Storage_Order</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Simple_005fStorage_005fPool">Simple_Storage_Pool</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Small">Small</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Storage_005fUnit">Storage_Unit</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Stub_005fType">Stub_Type</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_005fAllocator_005fAlignment">System_Allocator_Alignment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Target_005fName">Target_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Tick">Tick</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#To_005fAddress">To_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Type_005fClass">Type_Class</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#UET_005fAddress">UET_Address</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Unconstrained_005fArray">Unconstrained_Array</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Universal_005fLiteral_005fString">Universal_Literal_String</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Unrestricted_005fAccess">Unrestricted_Access</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Valid_005fScalars">Valid_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#VADS_005fSize">VADS_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Value_005fSize">Value_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wchar_005fT_005fSize">Wchar_T_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Word_005fSize">Word_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Abort_005fSignal"></a>
<div class="header">
<p>
Next: <a href="#Address_005fSize" accesskey="n" rel="next">Address_Size</a>, Previous: <a href="#Pragma-Wide_005fCharacter_005fEncoding" accesskey="p" rel="prev">Pragma Wide_Character_Encoding</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Abort_005fSignal-1"></a>
<h3 class="unnumberedsec">Abort_Signal</h3>
<a name="index-Abort_005fSignal"></a>
<p><code>Standard'Abort_Signal</code> (<code>Standard</code> is the only allowed
prefix) provides the entity for the special exception used to signal
task abort or asynchronous transfer of control. Normally this attribute
should only be used in the tasking runtime (it is highly peculiar, and
completely outside the normal semantics of Ada, for a user program to
intercept the abort exception).
</p>
<hr>
<a name="Address_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Asm_005fInput" accesskey="n" rel="next">Asm_Input</a>, Previous: <a href="#Abort_005fSignal" accesskey="p" rel="prev">Abort_Signal</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Address_005fSize-1"></a>
<h3 class="unnumberedsec">Address_Size</h3>
<a name="index-Size-of-Address"></a>
<a name="index-Address_005fSize"></a>
<p><code>Standard'Address_Size</code> (<code>Standard</code> is the only allowed
prefix) is a static constant giving the number of bits in an
<code>Address</code>. It is the same value as System.Address’Size,
but has the advantage of being static, while a direct
reference to System.Address’Size is non-static because Address
is a private type.
</p>
<hr>
<a name="Asm_005fInput"></a>
<div class="header">
<p>
Next: <a href="#Asm_005fOutput" accesskey="n" rel="next">Asm_Output</a>, Previous: <a href="#Address_005fSize" accesskey="p" rel="prev">Address_Size</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Asm_005fInput-1"></a>
<h3 class="unnumberedsec">Asm_Input</h3>
<a name="index-Asm_005fInput"></a>
<p>The <code>Asm_Input</code> attribute denotes a function that takes two
parameters. The first is a string, the second is an expression of the
type designated by the prefix. The first (string) argument is required
to be a static expression, and is the constraint for the parameter,
(e.g. what kind of register is required). The second argument is the
value to be used as the input argument. The possible values for the
constant are the same as those used in the RTL, and are dependent on
the configuration file used to built the GCC back end.
<a href="#Machine-Code-Insertions">Machine Code Insertions</a>
</p>
<hr>
<a name="Asm_005fOutput"></a>
<div class="header">
<p>
Next: <a href="#AST_005fEntry" accesskey="n" rel="next">AST_Entry</a>, Previous: <a href="#Asm_005fInput" accesskey="p" rel="prev">Asm_Input</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Asm_005fOutput-1"></a>
<h3 class="unnumberedsec">Asm_Output</h3>
<a name="index-Asm_005fOutput"></a>
<p>The <code>Asm_Output</code> attribute denotes a function that takes two
parameters. The first is a string, the second is the name of a variable
of the type designated by the attribute prefix. The first (string)
argument is required to be a static expression and designates the
constraint for the parameter (e.g. what kind of register is
required). The second argument is the variable to be updated with the
result. The possible values for constraint are the same as those used in
the RTL, and are dependent on the configuration file used to build the
GCC back end. If there are no output operands, then this argument may
either be omitted, or explicitly given as <code>No_Output_Operands</code>.
<a href="#Machine-Code-Insertions">Machine Code Insertions</a>
</p>
<hr>
<a name="AST_005fEntry"></a>
<div class="header">
<p>
Next: <a href="#Bit" accesskey="n" rel="next">Bit</a>, Previous: <a href="#Asm_005fOutput" accesskey="p" rel="prev">Asm_Output</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="AST_005fEntry-1"></a>
<h3 class="unnumberedsec">AST_Entry</h3>
<a name="index-OpenVMS-14"></a>
<a name="index-AST_005fEntry"></a>
<p>This attribute is implemented only in OpenVMS versions of GNAT. Applied to
the name of an entry, it yields a value of the predefined type AST_Handler
(declared in the predefined package System, as extended by the use of
pragma <code>Extend_System (Aux_DEC)</code>). This value enables the given entry to
be called when an AST occurs. For further details, refer to the <cite>DEC Ada
Language Reference Manual</cite>, section 9.12a.
</p>
<hr>
<a name="Bit"></a>
<div class="header">
<p>
Next: <a href="#Bit_005fPosition" accesskey="n" rel="next">Bit_Position</a>, Previous: <a href="#AST_005fEntry" accesskey="p" rel="prev">AST_Entry</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Bit-1"></a>
<h3 class="unnumberedsec">Bit</h3>
<a name="index-Bit"></a>
<p><code><var>obj</var>'Bit</code>, where <var>obj</var> is any object, yields the bit
offset within the storage unit (byte) that contains the first bit of
storage allocated for the object. The value of this attribute is of the
type <code>Universal_Integer</code>, and is always a non-negative number not
exceeding the value of <code>System.Storage_Unit</code>.
</p>
<p>For an object that is a variable or a constant allocated in a register,
the value is zero. (The use of this attribute does not force the
allocation of a variable to memory).
</p>
<p>For an object that is a formal parameter, this attribute applies
to either the matching actual parameter or to a copy of the
matching actual parameter.
</p>
<p>For an access object the value is zero. Note that
<code><var>obj</var>.all'Bit</code> is subject to an <code>Access_Check</code> for the
designated object. Similarly for a record component
<code><var>X</var>.<var>C</var>'Bit</code> is subject to a discriminant check and
<code><var>X</var>(<var>I</var>).Bit</code> and <code><var>X</var>(<var>I1</var>..<var>I2</var>)'Bit</code>
are subject to index checks.
</p>
<p>This attribute is designed to be compatible with the DEC Ada 83 definition
and implementation of the <code>Bit</code> attribute.
</p>
<hr>
<a name="Bit_005fPosition"></a>
<div class="header">
<p>
Next: <a href="#Compiler_005fVersion" accesskey="n" rel="next">Compiler_Version</a>, Previous: <a href="#Bit" accesskey="p" rel="prev">Bit</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Bit_005fPosition-1"></a>
<h3 class="unnumberedsec">Bit_Position</h3>
<a name="index-Bit_005fPosition"></a>
<p><code><var>R.C</var>'Bit_Position</code>, where <var>R</var> is a record object and C is one
of the fields of the record type, yields the bit
offset within the record contains the first bit of
storage allocated for the object. The value of this attribute is of the
type <code>Universal_Integer</code>. The value depends only on the field
<var>C</var> and is independent of the alignment of
the containing record <var>R</var>.
</p>
<hr>
<a name="Compiler_005fVersion"></a>
<div class="header">
<p>
Next: <a href="#Code_005fAddress" accesskey="n" rel="next">Code_Address</a>, Previous: <a href="#Bit_005fPosition" accesskey="p" rel="prev">Bit_Position</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Compiler_005fVersion-1"></a>
<h3 class="unnumberedsec">Compiler_Version</h3>
<a name="index-Compiler_005fVersion"></a>
<p><code>Standard'Compiler_Version</code> (<code>Standard</code> is the only allowed
prefix) yields a static string identifying the version of the compiler
being used to compile the unit containing the attribute reference. A
typical result would be something like "GNAT <i>version</i> (20090221)".
</p>
<hr>
<a name="Code_005fAddress"></a>
<div class="header">
<p>
Next: <a href="#Default_005fBit_005fOrder" accesskey="n" rel="next">Default_Bit_Order</a>, Previous: <a href="#Compiler_005fVersion" accesskey="p" rel="prev">Compiler_Version</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Code_005fAddress-1"></a>
<h3 class="unnumberedsec">Code_Address</h3>
<a name="index-Code_005fAddress"></a>
<a name="index-Subprogram-address"></a>
<a name="index-Address-of-subprogram-code"></a>
<p>The <code>'Address</code>
attribute may be applied to subprograms in Ada 95 and Ada 2005, but the
intended effect seems to be to provide
an address value which can be used to call the subprogram by means of
an address clause as in the following example:
</p>
<div class="smallexample">
<pre class="smallexample">procedure K is …
procedure L;
for L'Address use K'Address;
pragma Import (Ada, L);
</pre></div>
<p>A call to <code>L</code> is then expected to result in a call to <code>K</code>.
In Ada 83, where there were no access-to-subprogram values, this was
a common work-around for getting the effect of an indirect call.
GNAT implements the above use of <code>Address</code> and the technique
illustrated by the example code works correctly.
</p>
<p>However, for some purposes, it is useful to have the address of the start
of the generated code for the subprogram. On some architectures, this is
not necessarily the same as the <code>Address</code> value described above.
For example, the <code>Address</code> value may reference a subprogram
descriptor rather than the subprogram itself.
</p>
<p>The <code>'Code_Address</code> attribute, which can only be applied to
subprogram entities, always returns the address of the start of the
generated code of the specified subprogram, which may or may not be
the same value as is returned by the corresponding <code>'Address</code>
attribute.
</p>
<hr>
<a name="Default_005fBit_005fOrder"></a>
<div class="header">
<p>
Next: <a href="#Descriptor_005fSize" accesskey="n" rel="next">Descriptor_Size</a>, Previous: <a href="#Code_005fAddress" accesskey="p" rel="prev">Code_Address</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Default_005fBit_005fOrder-1"></a>
<h3 class="unnumberedsec">Default_Bit_Order</h3>
<a name="index-Big-endian"></a>
<a name="index-Little-endian"></a>
<a name="index-Default_005fBit_005fOrder"></a>
<p><code>Standard'Default_Bit_Order</code> (<code>Standard</code> is the only
permissible prefix), provides the value <code>System.Default_Bit_Order</code>
as a <code>Pos</code> value (0 for <code>High_Order_First</code>, 1 for
<code>Low_Order_First</code>). This is used to construct the definition of
<code>Default_Bit_Order</code> in package <code>System</code>.
</p>
<hr>
<a name="Descriptor_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Elaborated" accesskey="n" rel="next">Elaborated</a>, Previous: <a href="#Default_005fBit_005fOrder" accesskey="p" rel="prev">Default_Bit_Order</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Descriptor_005fSize-1"></a>
<h3 class="unnumberedsec">Descriptor_Size</h3>
<a name="index-Descriptor"></a>
<a name="index-Dope-vector"></a>
<a name="index-Descriptor_005fSize"></a>
<p>Non-static attribute <code>Descriptor_Size</code> returns the size in bits of the
descriptor allocated for a type. The result is non-zero only for unconstrained
array types and the returned value is of type universal integer. In GNAT, an
array descriptor contains bounds information and is located immediately before
the first element of the array.
</p>
<div class="smallexample">
<pre class="smallexample">type Unconstr_Array is array (Positive range <>) of Boolean;
Put_Line ("Descriptor size = " & Unconstr_Array'Descriptor_Size'Img);
</pre></div>
<p>The attribute takes into account any additional padding due to type alignment.
In the example above, the descriptor contains two values of type
<code>Positive</code> representing the low and high bound. Since <code>Positive</code> has
a size of 31 bits and an alignment of 4, the descriptor size is <code>2 *
Positive'Size + 2</code> or 64 bits.
</p>
<hr>
<a name="Elaborated"></a>
<div class="header">
<p>
Next: <a href="#Elab_005fBody" accesskey="n" rel="next">Elab_Body</a>, Previous: <a href="#Descriptor_005fSize" accesskey="p" rel="prev">Descriptor_Size</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Elaborated-1"></a>
<h3 class="unnumberedsec">Elaborated</h3>
<a name="index-Elaborated"></a>
<p>The prefix of the <code>'Elaborated</code> attribute must be a unit name. The
value is a Boolean which indicates whether or not the given unit has been
elaborated. This attribute is primarily intended for internal use by the
generated code for dynamic elaboration checking, but it can also be used
in user programs. The value will always be True once elaboration of all
units has been completed. An exception is for units which need no
elaboration, the value is always False for such units.
</p>
<hr>
<a name="Elab_005fBody"></a>
<div class="header">
<p>
Next: <a href="#Elab_005fSpec" accesskey="n" rel="next">Elab_Spec</a>, Previous: <a href="#Elaborated" accesskey="p" rel="prev">Elaborated</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Elab_005fBody-1"></a>
<h3 class="unnumberedsec">Elab_Body</h3>
<a name="index-Elab_005fBody"></a>
<p>This attribute can only be applied to a program unit name. It returns
the entity for the corresponding elaboration procedure for elaborating
the body of the referenced unit. This is used in the main generated
elaboration procedure by the binder and is not normally used in any
other context. However, there may be specialized situations in which it
is useful to be able to call this elaboration procedure from Ada code,
e.g. if it is necessary to do selective re-elaboration to fix some
error.
</p>
<hr>
<a name="Elab_005fSpec"></a>
<div class="header">
<p>
Next: <a href="#Elab_005fSubp_005fBody" accesskey="n" rel="next">Elab_Subp_Body</a>, Previous: <a href="#Elab_005fBody" accesskey="p" rel="prev">Elab_Body</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Elab_005fSpec-1"></a>
<h3 class="unnumberedsec">Elab_Spec</h3>
<a name="index-Elab_005fSpec"></a>
<p>This attribute can only be applied to a program unit name. It returns
the entity for the corresponding elaboration procedure for elaborating
the spec of the referenced unit. This is used in the main
generated elaboration procedure by the binder and is not normally used
in any other context. However, there may be specialized situations in
which it is useful to be able to call this elaboration procedure from
Ada code, e.g. if it is necessary to do selective re-elaboration to fix
some error.
</p>
<hr>
<a name="Elab_005fSubp_005fBody"></a>
<div class="header">
<p>
Next: <a href="#Emax" accesskey="n" rel="next">Emax</a>, Previous: <a href="#Elab_005fSpec" accesskey="p" rel="prev">Elab_Spec</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Elab_005fSubp_005fBody-1"></a>
<h3 class="unnumberedsec">Elab_Subp_Body</h3>
<a name="index-Elab_005fSubp_005fBody"></a>
<p>This attribute can only be applied to a library level subprogram
name and is only allowed in CodePeer mode. It returns the entity
for the corresponding elaboration procedure for elaborating the body
of the referenced subprogram unit. This is used in the main generated
elaboration procedure by the binder in CodePeer mode only and is unrecognized
otherwise.
</p>
<hr>
<a name="Emax"></a>
<div class="header">
<p>
Next: <a href="#Enabled" accesskey="n" rel="next">Enabled</a>, Previous: <a href="#Elab_005fSubp_005fBody" accesskey="p" rel="prev">Elab_Subp_Body</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Emax-1"></a>
<h3 class="unnumberedsec">Emax</h3>
<a name="index-Ada-83-attributes"></a>
<a name="index-Emax"></a>
<p>The <code>Emax</code> attribute is provided for compatibility with Ada 83. See
the Ada 83 reference manual for an exact description of the semantics of
this attribute.
</p>
<hr>
<a name="Enabled"></a>
<div class="header">
<p>
Next: <a href="#Enum_005fRep" accesskey="n" rel="next">Enum_Rep</a>, Previous: <a href="#Emax" accesskey="p" rel="prev">Emax</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Enabled-1"></a>
<h3 class="unnumberedsec">Enabled</h3>
<a name="index-Enabled"></a>
<p>The <code>Enabled</code> attribute allows an application program to check at compile
time to see if the designated check is currently enabled. The prefix is a
simple identifier, referencing any predefined check name (other than
<code>All_Checks</code>) or a check name introduced by pragma Check_Name. If
no argument is given for the attribute, the check is for the general state
of the check, if an argument is given, then it is an entity name, and the
check indicates whether an <code>Suppress</code> or <code>Unsuppress</code> has been
given naming the entity (if not, then the argument is ignored).
</p>
<p>Note that instantiations inherit the check status at the point of the
instantiation, so a useful idiom is to have a library package that
introduces a check name with <code>pragma Check_Name</code>, and then contains
generic packages or subprograms which use the <code>Enabled</code> attribute
to see if the check is enabled. A user of this package can then issue
a <code>pragma Suppress</code> or <code>pragma Unsuppress</code> before instantiating
the package or subprogram, controlling whether the check will be present.
</p>
<hr>
<a name="Enum_005fRep"></a>
<div class="header">
<p>
Next: <a href="#Enum_005fVal" accesskey="n" rel="next">Enum_Val</a>, Previous: <a href="#Enabled" accesskey="p" rel="prev">Enabled</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Enum_005fRep-1"></a>
<h3 class="unnumberedsec">Enum_Rep</h3>
<a name="index-Representation-of-enums"></a>
<a name="index-Enum_005fRep"></a>
<p>For every enumeration subtype <var>S</var>, <code><var>S</var>'Enum_Rep</code> denotes a
function with the following spec:
</p>
<div class="smallexample">
<pre class="smallexample">function <var>S</var>'Enum_Rep (Arg : <var>S</var>'Base)
return <i>Universal_Integer</i>;
</pre></div>
<p>It is also allowable to apply <code>Enum_Rep</code> directly to an object of an
enumeration type or to a non-overloaded enumeration
literal. In this case <code><var>S</var>'Enum_Rep</code> is equivalent to
<code><var>typ</var>'Enum_Rep(<var>S</var>)</code> where <var>typ</var> is the type of the
enumeration literal or object.
</p>
<p>The function returns the representation value for the given enumeration
value. This will be equal to value of the <code>Pos</code> attribute in the
absence of an enumeration representation clause. This is a static
attribute (i.e. the result is static if the argument is static).
</p>
<p><code><var>S</var>'Enum_Rep</code> can also be used with integer types and objects,
in which case it simply returns the integer value. The reason for this
is to allow it to be used for <code>(<>)</code> discrete formal arguments in
a generic unit that can be instantiated with either enumeration types
or integer types. Note that if <code>Enum_Rep</code> is used on a modular
type whose upper bound exceeds the upper bound of the largest signed
integer type, and the argument is a variable, so that the universal
integer calculation is done at run time, then the call to <code>Enum_Rep</code>
may raise <code>Constraint_Error</code>.
</p>
<hr>
<a name="Enum_005fVal"></a>
<div class="header">
<p>
Next: <a href="#Epsilon" accesskey="n" rel="next">Epsilon</a>, Previous: <a href="#Enum_005fRep" accesskey="p" rel="prev">Enum_Rep</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Enum_005fVal-1"></a>
<h3 class="unnumberedsec">Enum_Val</h3>
<a name="index-Representation-of-enums-1"></a>
<a name="index-Enum_005fVal"></a>
<p>For every enumeration subtype <var>S</var>, <code><var>S</var>'Enum_Val</code> denotes a
function with the following spec:
</p>
<div class="smallexample">
<pre class="smallexample">function <var>S</var>'Enum_Val (Arg : <i>Universal_Integer)
return <var>S</var>’Base</i>;
</pre></div>
<p>The function returns the enumeration value whose representation matches the
argument, or raises Constraint_Error if no enumeration literal of the type
has the matching value.
This will be equal to value of the <code>Val</code> attribute in the
absence of an enumeration representation clause. This is a static
attribute (i.e. the result is static if the argument is static).
</p>
<hr>
<a name="Epsilon"></a>
<div class="header">
<p>
Next: <a href="#Fixed_005fValue" accesskey="n" rel="next">Fixed_Value</a>, Previous: <a href="#Enum_005fVal" accesskey="p" rel="prev">Enum_Val</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Epsilon-1"></a>
<h3 class="unnumberedsec">Epsilon</h3>
<a name="index-Ada-83-attributes-1"></a>
<a name="index-Epsilon"></a>
<p>The <code>Epsilon</code> attribute is provided for compatibility with Ada 83. See
the Ada 83 reference manual for an exact description of the semantics of
this attribute.
</p>
<hr>
<a name="Fixed_005fValue"></a>
<div class="header">
<p>
Next: <a href="#Has_005fAccess_005fValues" accesskey="n" rel="next">Has_Access_Values</a>, Previous: <a href="#Epsilon" accesskey="p" rel="prev">Epsilon</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Fixed_005fValue-1"></a>
<h3 class="unnumberedsec">Fixed_Value</h3>
<a name="index-Fixed_005fValue"></a>
<p>For every fixed-point type <var>S</var>, <code><var>S</var>'Fixed_Value</code> denotes a
function with the following specification:
</p>
<div class="smallexample">
<pre class="smallexample">function <var>S</var>'Fixed_Value (Arg : <i>Universal_Integer</i>)
return <var>S</var>;
</pre></div>
<p>The value returned is the fixed-point value <var>V</var> such that
</p>
<div class="smallexample">
<pre class="smallexample"><var>V</var> = Arg * <var>S</var>'Small
</pre></div>
<p>The effect is thus similar to first converting the argument to the
integer type used to represent <var>S</var>, and then doing an unchecked
conversion to the fixed-point type. The difference is
that there are full range checks, to ensure that the result is in range.
This attribute is primarily intended for use in implementation of the
input-output functions for fixed-point values.
</p>
<hr>
<a name="Has_005fAccess_005fValues"></a>
<div class="header">
<p>
Next: <a href="#Has_005fDiscriminants" accesskey="n" rel="next">Has_Discriminants</a>, Previous: <a href="#Fixed_005fValue" accesskey="p" rel="prev">Fixed_Value</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Has_005fAccess_005fValues-1"></a>
<h3 class="unnumberedsec">Has_Access_Values</h3>
<a name="index-Access-values_002c-testing-for"></a>
<a name="index-Has_005fAccess_005fValues"></a>
<p>The prefix of the <code>Has_Access_Values</code> attribute is a type. The result
is a Boolean value which is True if the is an access type, or is a composite
type with a component (at any nesting depth) that is an access type, and is
False otherwise.
The intended use of this attribute is in conjunction with generic
definitions. If the attribute is applied to a generic private type, it
indicates whether or not the corresponding actual type has access values.
</p>
<hr>
<a name="Has_005fDiscriminants"></a>
<div class="header">
<p>
Next: <a href="#Img" accesskey="n" rel="next">Img</a>, Previous: <a href="#Has_005fAccess_005fValues" accesskey="p" rel="prev">Has_Access_Values</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Has_005fDiscriminants-1"></a>
<h3 class="unnumberedsec">Has_Discriminants</h3>
<a name="index-Discriminants_002c-testing-for"></a>
<a name="index-Has_005fDiscriminants"></a>
<p>The prefix of the <code>Has_Discriminants</code> attribute is a type. The result
is a Boolean value which is True if the type has discriminants, and False
otherwise. The intended use of this attribute is in conjunction with generic
definitions. If the attribute is applied to a generic private type, it
indicates whether or not the corresponding actual type has discriminants.
</p>
<hr>
<a name="Img"></a>
<div class="header">
<p>
Next: <a href="#Integer_005fValue" accesskey="n" rel="next">Integer_Value</a>, Previous: <a href="#Has_005fDiscriminants" accesskey="p" rel="prev">Has_Discriminants</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Img-1"></a>
<h3 class="unnumberedsec">Img</h3>
<a name="index-Img"></a>
<p>The <code>Img</code> attribute differs from <code>Image</code> in that it may be
applied to objects as well as types, in which case it gives the
<code>Image</code> for the subtype of the object. This is convenient for
debugging:
</p>
<div class="smallexample">
<pre class="smallexample">Put_Line ("X = " & X'Img);
</pre></div>
<p>has the same meaning as the more verbose:
</p>
<div class="smallexample">
<pre class="smallexample">Put_Line ("X = " & <var>T</var>'Image (X));
</pre></div>
<p>where <var>T</var> is the (sub)type of the object <code>X</code>.
</p>
<hr>
<a name="Integer_005fValue"></a>
<div class="header">
<p>
Next: <a href="#Invalid_005fValue" accesskey="n" rel="next">Invalid_Value</a>, Previous: <a href="#Img" accesskey="p" rel="prev">Img</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Integer_005fValue-1"></a>
<h3 class="unnumberedsec">Integer_Value</h3>
<a name="index-Integer_005fValue"></a>
<p>For every integer type <var>S</var>, <code><var>S</var>'Integer_Value</code> denotes a
function with the following spec:
</p>
<div class="smallexample">
<pre class="smallexample">function <var>S</var>'Integer_Value (Arg : <i>Universal_Fixed</i>)
return <var>S</var>;
</pre></div>
<p>The value returned is the integer value <var>V</var>, such that
</p>
<div class="smallexample">
<pre class="smallexample">Arg = <var>V</var> * <var>T</var>'Small
</pre></div>
<p>where <var>T</var> is the type of <code>Arg</code>.
The effect is thus similar to first doing an unchecked conversion from
the fixed-point type to its corresponding implementation type, and then
converting the result to the target integer type. The difference is
that there are full range checks, to ensure that the result is in range.
This attribute is primarily intended for use in implementation of the
standard input-output functions for fixed-point values.
</p>
<hr>
<a name="Invalid_005fValue"></a>
<div class="header">
<p>
Next: <a href="#Large" accesskey="n" rel="next">Large</a>, Previous: <a href="#Integer_005fValue" accesskey="p" rel="prev">Integer_Value</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Invalid_005fValue-1"></a>
<h3 class="unnumberedsec">Invalid_Value</h3>
<a name="index-Invalid_005fValue"></a>
<p>For every scalar type S, S’Invalid_Value returns an undefined value of the
type. If possible this value is an invalid representation for the type. The
value returned is identical to the value used to initialize an otherwise
uninitialized value of the type if pragma Initialize_Scalars is used,
including the ability to modify the value with the binder -Sxx flag and
relevant environment variables at run time.
</p>
<hr>
<a name="Large"></a>
<div class="header">
<p>
Next: <a href="#Machine_005fSize" accesskey="n" rel="next">Machine_Size</a>, Previous: <a href="#Invalid_005fValue" accesskey="p" rel="prev">Invalid_Value</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Large-1"></a>
<h3 class="unnumberedsec">Large</h3>
<a name="index-Ada-83-attributes-2"></a>
<a name="index-Large"></a>
<p>The <code>Large</code> attribute is provided for compatibility with Ada 83. See
the Ada 83 reference manual for an exact description of the semantics of
this attribute.
</p>
<hr>
<a name="Machine_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Mantissa" accesskey="n" rel="next">Mantissa</a>, Previous: <a href="#Large" accesskey="p" rel="prev">Large</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Machine_005fSize-1"></a>
<h3 class="unnumberedsec">Machine_Size</h3>
<a name="index-Machine_005fSize"></a>
<p>This attribute is identical to the <code>Object_Size</code> attribute. It is
provided for compatibility with the DEC Ada 83 attribute of this name.
</p>
<hr>
<a name="Mantissa"></a>
<div class="header">
<p>
Next: <a href="#Max_005fInterrupt_005fPriority" accesskey="n" rel="next">Max_Interrupt_Priority</a>, Previous: <a href="#Machine_005fSize" accesskey="p" rel="prev">Machine_Size</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Mantissa-1"></a>
<h3 class="unnumberedsec">Mantissa</h3>
<a name="index-Ada-83-attributes-3"></a>
<a name="index-Mantissa"></a>
<p>The <code>Mantissa</code> attribute is provided for compatibility with Ada 83. See
the Ada 83 reference manual for an exact description of the semantics of
this attribute.
</p>
<hr>
<a name="Max_005fInterrupt_005fPriority"></a>
<div class="header">
<p>
Next: <a href="#Max_005fPriority" accesskey="n" rel="next">Max_Priority</a>, Previous: <a href="#Mantissa" accesskey="p" rel="prev">Mantissa</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fInterrupt_005fPriority-1"></a>
<h3 class="unnumberedsec">Max_Interrupt_Priority</h3>
<a name="index-Interrupt-priority_002c-maximum"></a>
<a name="index-Max_005fInterrupt_005fPriority"></a>
<p><code>Standard'Max_Interrupt_Priority</code> (<code>Standard</code> is the only
permissible prefix), provides the same value as
<code>System.Max_Interrupt_Priority</code>.
</p>
<hr>
<a name="Max_005fPriority"></a>
<div class="header">
<p>
Next: <a href="#Maximum_005fAlignment" accesskey="n" rel="next">Maximum_Alignment</a>, Previous: <a href="#Max_005fInterrupt_005fPriority" accesskey="p" rel="prev">Max_Interrupt_Priority</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fPriority-1"></a>
<h3 class="unnumberedsec">Max_Priority</h3>
<a name="index-Priority_002c-maximum"></a>
<a name="index-Max_005fPriority"></a>
<p><code>Standard'Max_Priority</code> (<code>Standard</code> is the only permissible
prefix) provides the same value as <code>System.Max_Priority</code>.
</p>
<hr>
<a name="Maximum_005fAlignment"></a>
<div class="header">
<p>
Next: <a href="#Mechanism_005fCode" accesskey="n" rel="next">Mechanism_Code</a>, Previous: <a href="#Max_005fPriority" accesskey="p" rel="prev">Max_Priority</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Maximum_005fAlignment-1"></a>
<h3 class="unnumberedsec">Maximum_Alignment</h3>
<a name="index-Alignment_002c-maximum"></a>
<a name="index-Maximum_005fAlignment"></a>
<p><code>Standard'Maximum_Alignment</code> (<code>Standard</code> is the only
permissible prefix) provides the maximum useful alignment value for the
target. This is a static value that can be used to specify the alignment
for an object, guaranteeing that it is properly aligned in all
cases.
</p>
<hr>
<a name="Mechanism_005fCode"></a>
<div class="header">
<p>
Next: <a href="#Null_005fParameter" accesskey="n" rel="next">Null_Parameter</a>, Previous: <a href="#Maximum_005fAlignment" accesskey="p" rel="prev">Maximum_Alignment</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Mechanism_005fCode-1"></a>
<h3 class="unnumberedsec">Mechanism_Code</h3>
<a name="index-Return-values_002c-passing-mechanism"></a>
<a name="index-Parameters_002c-passing-mechanism"></a>
<a name="index-Mechanism_005fCode"></a>
<p><code><var>function</var>'Mechanism_Code</code> yields an integer code for the
mechanism used for the result of function, and
<code><var>subprogram</var>'Mechanism_Code (<var>n</var>)</code> yields the mechanism
used for formal parameter number <var>n</var> (a static integer value with 1
meaning the first parameter) of <var>subprogram</var>. The code returned is:
</p>
<dl compact="compact">
<dt>1</dt>
<dd><p>by copy (value)
</p></dd>
<dt>2</dt>
<dd><p>by reference
</p></dd>
<dt>3</dt>
<dd><p>by descriptor (default descriptor class)
</p></dd>
<dt>4</dt>
<dd><p>by descriptor (UBS: unaligned bit string)
</p></dd>
<dt>5</dt>
<dd><p>by descriptor (UBSB: aligned bit string with arbitrary bounds)
</p></dd>
<dt>6</dt>
<dd><p>by descriptor (UBA: unaligned bit array)
</p></dd>
<dt>7</dt>
<dd><p>by descriptor (S: string, also scalar access type parameter)
</p></dd>
<dt>8</dt>
<dd><p>by descriptor (SB: string with arbitrary bounds)
</p></dd>
<dt>9</dt>
<dd><p>by descriptor (A: contiguous array)
</p></dd>
<dt>10</dt>
<dd><p>by descriptor (NCA: non-contiguous array)
</p></dd>
</dl>
<p>Values from 3 through 10 are only relevant to Digital OpenVMS implementations.
<a name="index-OpenVMS-15"></a>
</p>
<hr>
<a name="Null_005fParameter"></a>
<div class="header">
<p>
Next: <a href="#Object_005fSize" accesskey="n" rel="next">Object_Size</a>, Previous: <a href="#Mechanism_005fCode" accesskey="p" rel="prev">Mechanism_Code</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Null_005fParameter-1"></a>
<h3 class="unnumberedsec">Null_Parameter</h3>
<a name="index-Zero-address_002c-passing"></a>
<a name="index-Null_005fParameter"></a>
<p>A reference <code><var>T</var>'Null_Parameter</code> denotes an imaginary object of
type or subtype <var>T</var> allocated at machine address zero. The attribute
is allowed only as the default expression of a formal parameter, or as
an actual expression of a subprogram call. In either case, the
subprogram must be imported.
</p>
<p>The identity of the object is represented by the address zero in the
argument list, independent of the passing mechanism (explicit or
default).
</p>
<p>This capability is needed to specify that a zero address should be
passed for a record or other composite object passed by reference.
There is no way of indicating this without the <code>Null_Parameter</code>
attribute.
</p>
<hr>
<a name="Object_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Passed_005fBy_005fReference" accesskey="n" rel="next">Passed_By_Reference</a>, Previous: <a href="#Null_005fParameter" accesskey="p" rel="prev">Null_Parameter</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Object_005fSize-1"></a>
<h3 class="unnumberedsec">Object_Size</h3>
<a name="index-Size_002c-used-for-objects"></a>
<a name="index-Object_005fSize"></a>
<p>The size of an object is not necessarily the same as the size of the type
of an object. This is because by default object sizes are increased to be
a multiple of the alignment of the object. For example,
<code>Natural'Size</code> is
31, but by default objects of type <code>Natural</code> will have a size of 32 bits.
Similarly, a record containing an integer and a character:
</p>
<div class="smallexample">
<pre class="smallexample">type Rec is record
I : Integer;
C : Character;
end record;
</pre></div>
<p>will have a size of 40 (that is <code>Rec'Size</code> will be 40). The
alignment will be 4, because of the
integer field, and so the default size of record objects for this type
will be 64 (8 bytes).
</p>
<hr>
<a name="Passed_005fBy_005fReference"></a>
<div class="header">
<p>
Next: <a href="#Pool_005fAddress" accesskey="n" rel="next">Pool_Address</a>, Previous: <a href="#Object_005fSize" accesskey="p" rel="prev">Object_Size</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Passed_005fBy_005fReference-1"></a>
<h3 class="unnumberedsec">Passed_By_Reference</h3>
<a name="index-Parameters_002c-when-passed-by-reference"></a>
<a name="index-Passed_005fBy_005fReference"></a>
<p><code><var>type</var>'Passed_By_Reference</code> for any subtype <var>type</var> returns
a value of type <code>Boolean</code> value that is <code>True</code> if the type is
normally passed by reference and <code>False</code> if the type is normally
passed by copy in calls. For scalar types, the result is always <code>False</code>
and is static. For non-scalar types, the result is non-static.
</p>
<hr>
<a name="Pool_005fAddress"></a>
<div class="header">
<p>
Next: <a href="#Range_005fLength" accesskey="n" rel="next">Range_Length</a>, Previous: <a href="#Passed_005fBy_005fReference" accesskey="p" rel="prev">Passed_By_Reference</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pool_005fAddress-1"></a>
<h3 class="unnumberedsec">Pool_Address</h3>
<a name="index-Parameters_002c-when-passed-by-reference-1"></a>
<a name="index-Pool_005fAddress"></a>
<p><code><var>X</var>'Pool_Address</code> for any object <var>X</var> returns the address
of X within its storage pool. This is the same as
<code><var>X</var>'Address</code>, except that for an unconstrained array whose
bounds are allocated just before the first component,
<code><var>X</var>'Pool_Address</code> returns the address of those bounds,
whereas <code><var>X</var>'Address</code> returns the address of the first
component.
</p>
<p>Here, we are interpreting “storage pool” broadly to mean “wherever
the object is allocated”, which could be a user-defined storage pool,
the global heap, on the stack, or in a static memory area. For an
object created by <code>new</code>, <code><var>Ptr.all</var>'Pool_Address</code> is
what is passed to <code>Allocate</code> and returned from <code>Deallocate</code>.
</p>
<hr>
<a name="Range_005fLength"></a>
<div class="header">
<p>
Next: <a href="#Ref" accesskey="n" rel="next">Ref</a>, Previous: <a href="#Pool_005fAddress" accesskey="p" rel="prev">Pool_Address</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Range_005fLength-1"></a>
<h3 class="unnumberedsec">Range_Length</h3>
<a name="index-Range_005fLength"></a>
<p><code><var>type</var>'Range_Length</code> for any discrete type <var>type</var> yields
the number of values represented by the subtype (zero for a null
range). The result is static for static subtypes. <code>Range_Length</code>
applied to the index subtype of a one dimensional array always gives the
same result as <code>Range</code> applied to the array itself.
</p>
<hr>
<a name="Ref"></a>
<div class="header">
<p>
Next: <a href="#Result" accesskey="n" rel="next">Result</a>, Previous: <a href="#Range_005fLength" accesskey="p" rel="prev">Range_Length</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ref-1"></a>
<h3 class="unnumberedsec">Ref</h3>
<a name="index-Ref"></a>
<p>The <code>System.Address'Ref</code>
(<code>System.Address</code> is the only permissible prefix)
denotes a function identical to
<code>System.Storage_Elements.To_Address</code> except that
it is a static attribute. See <a href="#To_005fAddress">To_Address</a> for more details.
</p>
<hr>
<a name="Result"></a>
<div class="header">
<p>
Next: <a href="#Safe_005fEmax" accesskey="n" rel="next">Safe_Emax</a>, Previous: <a href="#Ref" accesskey="p" rel="prev">Ref</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Result-1"></a>
<h3 class="unnumberedsec">Result</h3>
<a name="index-Result"></a>
<p><code><var>function</var>'Result</code> can only be used with in a Postcondition pragma
for a function. The prefix must be the name of the corresponding function. This
is used to refer to the result of the function in the postcondition expression.
For a further discussion of the use of this attribute and examples of its use,
see the description of pragma Postcondition.
</p>
<hr>
<a name="Safe_005fEmax"></a>
<div class="header">
<p>
Next: <a href="#Safe_005fLarge" accesskey="n" rel="next">Safe_Large</a>, Previous: <a href="#Result" accesskey="p" rel="prev">Result</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Safe_005fEmax-1"></a>
<h3 class="unnumberedsec">Safe_Emax</h3>
<a name="index-Ada-83-attributes-4"></a>
<a name="index-Safe_005fEmax"></a>
<p>The <code>Safe_Emax</code> attribute is provided for compatibility with Ada 83. See
the Ada 83 reference manual for an exact description of the semantics of
this attribute.
</p>
<hr>
<a name="Safe_005fLarge"></a>
<div class="header">
<p>
Next: <a href="#Scalar_005fStorage_005fOrder" accesskey="n" rel="next">Scalar_Storage_Order</a>, Previous: <a href="#Safe_005fEmax" accesskey="p" rel="prev">Safe_Emax</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Safe_005fLarge-1"></a>
<h3 class="unnumberedsec">Safe_Large</h3>
<a name="index-Ada-83-attributes-5"></a>
<a name="index-Safe_005fLarge"></a>
<p>The <code>Safe_Large</code> attribute is provided for compatibility with Ada 83. See
the Ada 83 reference manual for an exact description of the semantics of
this attribute.
</p>
<hr>
<a name="Scalar_005fStorage_005fOrder"></a>
<div class="header">
<p>
Next: <a href="#Simple_005fStorage_005fPool" accesskey="n" rel="next">Simple_Storage_Pool</a>, Previous: <a href="#Safe_005fLarge" accesskey="p" rel="prev">Safe_Large</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Scalar_005fStorage_005fOrder-1"></a>
<h3 class="unnumberedsec">Scalar_Storage_Order</h3>
<a name="index-Endianness"></a>
<a name="index-Scalar-storage-order"></a>
<a name="index-Scalar_005fStorage_005fOrder"></a>
<p>For every array or record type <var>S</var>, the representation attribute
<code>Scalar_Storage_Order</code> denotes the order in which storage elements
that make up scalar components are ordered within S:
</p>
<div class="smallexample">
<pre class="smallexample"> -- Component type definitions
subtype Yr_Type is Natural range 0 .. 127;
subtype Mo_Type is Natural range 1 .. 12;
subtype Da_Type is Natural range 1 .. 31;
-- Record declaration
type Date is record
Years_Since_1980 : Yr_Type;
Month : Mo_Type;
Day_Of_Month : Da_Type;
end record;
-- Record representation clause
for Date use record
Years_Since_1980 at 0 range 0 .. 6;
Month at 0 range 7 .. 10;
Day_Of_Month at 0 range 11 .. 15;
end record;
-- Attribute definition clauses
for Date'Bit_Order use System.High_Order_First;
for Date'Scalar_Storage_Order use System.High_Order_First;
-- If Scalar_Storage_Order is specified, it must be consistent with
-- Bit_Order, so it's best to always define the latter explicitly if
-- the former is used.
</pre></div>
<p>Other properties are
as for standard representation attribute <code>Bit_Order</code>, as defined by
Ada RM 13.5.3(4). The default is <code>System.Default_Bit_Order</code>.
</p>
<p>For a record type <var>S</var>, if <code><var>S</var>'Scalar_Storage_Order</code> is
specified explicitly, it shall be equal to <code><var>S</var>'Bit_Order</code>. Note:
this means that if a <code>Scalar_Storage_Order</code> attribute definition
clause is not confirming, then the type’s <code>Bit_Order</code> shall be
specified explicitly and set to the same value.
</p>
<p>For a record extension, the derived type shall have the same scalar storage
order as the parent type.
</p>
<p>If a component of <var>S</var> has itself a record or array type, then it shall also
have a <code>Scalar_Storage_Order</code> attribute definition clause. In addition,
if the component does not start on a byte boundary, then the scalar storage
order specified for S and for the nested component type shall be identical.
</p>
<p>No component of a type that has a <code>Scalar_Storage_Order</code> attribute
definition may be aliased.
</p>
<p>A confirming <code>Scalar_Storage_Order</code> attribute definition clause (i.e.
with a value equal to <code>System.Default_Bit_Order</code>) has no effect.
</p>
<p>If the opposite storage order is specified, then whenever the value of
a scalar component of an object of type <var>S</var> is read, the storage
elements of the enclosing machine scalar are first reversed (before
retrieving the component value, possibly applying some shift and mask
operatings on the enclosing machine scalar), and the opposite operation
is done for writes.
</p>
<p>In that case, the restrictions set forth in 13.5.1(10.3/2) for scalar components
are relaxed. Instead, the following rules apply:
</p>
<ul>
<li> the underlying storage elements are those at positions
<code>(position + first_bit / storage_element_size) ..
(position + (last_bit + storage_element_size - 1) /
storage_element_size)</code>
</li><li> the sequence of underlying storage elements shall have
a size no greater than the largest machine scalar
</li><li> the enclosing machine scalar is defined as the smallest machine
scalar starting at a position no greater than
<code>position + first_bit / storage_element_size</code> and covering
storage elements at least up to <code>position + (last_bit +
storage_element_size - 1) / storage_element_size</code>
</li><li> the position of the component is interpreted relative to that machine
scalar.
</li></ul>
<hr>
<a name="Simple_005fStorage_005fPool"></a>
<div class="header">
<p>
Next: <a href="#Small" accesskey="n" rel="next">Small</a>, Previous: <a href="#Scalar_005fStorage_005fOrder" accesskey="p" rel="prev">Scalar_Storage_Order</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Simple_005fStorage_005fPool-1"></a>
<h3 class="unnumberedsec">Simple_Storage_Pool</h3>
<a name="index-Storage-pool_002c-simple-1"></a>
<a name="index-Simple-storage-pool-1"></a>
<a name="index-Simple_005fStorage_005fPool"></a>
<p>For every nonformal, nonderived access-to-object type <var>Acc</var>, the
representation attribute <code>Simple_Storage_Pool</code> may be specified
via an attribute_definition_clause (or by specifying the equivalent aspect):
</p>
<div class="smallexample">
<pre class="smallexample">
My_Pool : My_Simple_Storage_Pool_Type;
type Acc is access My_Data_Type;
for Acc'Simple_Storage_Pool use My_Pool;
</pre></div>
<p>The name given in an attribute_definition_clause for the
<code>Simple_Storage_Pool</code> attribute shall denote a variable of
a “simple storage pool type” (see pragma <code>Simple_Storage_Pool_Type</code>).
</p>
<p>The use of this attribute is only allowed for a prefix denoting a type
for which it has been specified. The type of the attribute is the type
of the variable specified as the simple storage pool of the access type,
and the attribute denotes that variable.
</p>
<p>It is illegal to specify both <code>Storage_Pool</code> and <code>Simple_Storage_Pool</code>
for the same access type.
</p>
<p>If the <code>Simple_Storage_Pool</code> attribute has been specified for an access
type, then applying the <code>Storage_Pool</code> attribute to the type is flagged
with a warning and its evaluation raises the exception <code>Program_Error</code>.
</p>
<p>If the Simple_Storage_Pool attribute has been specified for an access
type <var>S</var>, then the evaluation of the attribute <code><var>S</var>'Storage_Size</code>
returns the result of calling <code>Storage_Size (<var>S</var>'Simple_Storage_Pool)</code>,
which is intended to indicate the number of storage elements reserved for
the simple storage pool. If the Storage_Size function has not been defined
for the simple storage pool type, then this attribute returns zero.
</p>
<p>If an access type <var>S</var> has a specified simple storage pool of type
<var>SSP</var>, then the evaluation of an allocator for that access type calls
the primitive <code>Allocate</code> procedure for type <var>SSP</var>, passing
<code><var>S</var>'Simple_Storage_Pool</code> as the pool parameter. The detailed
semantics of such allocators is the same as those defined for allocators
in section 13.11 of the Ada Reference Manual, with the term
“simple storage pool” substituted for “storage pool”.
</p>
<p>If an access type <var>S</var> has a specified simple storage pool of type
<var>SSP</var>, then a call to an instance of the <code>Ada.Unchecked_Deallocation</code>
for that access type invokes the primitive <code>Deallocate</code> procedure
for type <var>SSP</var>, passing <code><var>S</var>'Simple_Storage_Pool</code> as the pool
parameter. The detailed semantics of such unchecked deallocations is the same
as defined in section 13.11.2 of the Ada Reference Manual, except that the
term “simple storage pool” is substituted for “storage pool”.
</p>
<hr>
<a name="Small"></a>
<div class="header">
<p>
Next: <a href="#Storage_005fUnit" accesskey="n" rel="next">Storage_Unit</a>, Previous: <a href="#Simple_005fStorage_005fPool" accesskey="p" rel="prev">Simple_Storage_Pool</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Small-1"></a>
<h3 class="unnumberedsec">Small</h3>
<a name="index-Ada-83-attributes-6"></a>
<a name="index-Small"></a>
<p>The <code>Small</code> attribute is defined in Ada 95 (and Ada 2005) only for
fixed-point types.
GNAT also allows this attribute to be applied to floating-point types
for compatibility with Ada 83. See
the Ada 83 reference manual for an exact description of the semantics of
this attribute when applied to floating-point types.
</p>
<hr>
<a name="Storage_005fUnit"></a>
<div class="header">
<p>
Next: <a href="#Stub_005fType" accesskey="n" rel="next">Stub_Type</a>, Previous: <a href="#Small" accesskey="p" rel="prev">Small</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Storage_005fUnit-1"></a>
<h3 class="unnumberedsec">Storage_Unit</h3>
<a name="index-Storage_005fUnit-1"></a>
<p><code>Standard'Storage_Unit</code> (<code>Standard</code> is the only permissible
prefix) provides the same value as <code>System.Storage_Unit</code>.
</p>
<hr>
<a name="Stub_005fType"></a>
<div class="header">
<p>
Next: <a href="#System_005fAllocator_005fAlignment" accesskey="n" rel="next">System_Allocator_Alignment</a>, Previous: <a href="#Storage_005fUnit" accesskey="p" rel="prev">Storage_Unit</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Stub_005fType-1"></a>
<h3 class="unnumberedsec">Stub_Type</h3>
<a name="index-Stub_005fType"></a>
<p>The GNAT implementation of remote access-to-classwide types is
organized as described in AARM section E.4 (20.t): a value of an RACW type
(designating a remote object) is represented as a normal access
value, pointing to a "stub" object which in turn contains the
necessary information to contact the designated remote object. A
call on any dispatching operation of such a stub object does the
remote call, if necessary, using the information in the stub object
to locate the target partition, etc.
</p>
<p>For a prefix <code>T</code> that denotes a remote access-to-classwide type,
<code>T'Stub_Type</code> denotes the type of the corresponding stub objects.
</p>
<p>By construction, the layout of <code>T'Stub_Type</code> is identical to that of
type <code>RACW_Stub_Type</code> declared in the internal implementation-defined
unit <code>System.Partition_Interface</code>. Use of this attribute will create
an implicit dependency on this unit.
</p>
<hr>
<a name="System_005fAllocator_005fAlignment"></a>
<div class="header">
<p>
Next: <a href="#Target_005fName" accesskey="n" rel="next">Target_Name</a>, Previous: <a href="#Stub_005fType" accesskey="p" rel="prev">Stub_Type</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_005fAllocator_005fAlignment-1"></a>
<h3 class="unnumberedsec">System_Allocator_Alignment</h3>
<a name="index-Alignment_002c-allocator"></a>
<a name="index-System_005fAllocator_005fAlignment"></a>
<p><code>Standard'System_Allocator_Alignment</code> (<code>Standard</code> is the only
permissible prefix) provides the observable guaranted to be honored by
the system allocator (malloc). This is a static value that can be used
in user storage pools based on malloc either to reject allocation
with alignment too large or to enable a realignment circuitry if the
alignment request is larger than this value.
</p>
<hr>
<a name="Target_005fName"></a>
<div class="header">
<p>
Next: <a href="#Tick" accesskey="n" rel="next">Tick</a>, Previous: <a href="#System_005fAllocator_005fAlignment" accesskey="p" rel="prev">System_Allocator_Alignment</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Target_005fName-1"></a>
<h3 class="unnumberedsec">Target_Name</h3>
<a name="index-Target_005fName"></a>
<p><code>Standard'Target_Name</code> (<code>Standard</code> is the only permissible
prefix) provides a static string value that identifies the target
for the current compilation. For GCC implementations, this is the
standard gcc target name without the terminating slash (for
example, GNAT 5.0 on windows yields "i586-pc-mingw32msv").
</p>
<hr>
<a name="Tick"></a>
<div class="header">
<p>
Next: <a href="#To_005fAddress" accesskey="n" rel="next">To_Address</a>, Previous: <a href="#Target_005fName" accesskey="p" rel="prev">Target_Name</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Tick-1"></a>
<h3 class="unnumberedsec">Tick</h3>
<a name="index-Tick"></a>
<p><code>Standard'Tick</code> (<code>Standard</code> is the only permissible prefix)
provides the same value as <code>System.Tick</code>,
</p>
<hr>
<a name="To_005fAddress"></a>
<div class="header">
<p>
Next: <a href="#Type_005fClass" accesskey="n" rel="next">Type_Class</a>, Previous: <a href="#Tick" accesskey="p" rel="prev">Tick</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="To_005fAddress-1"></a>
<h3 class="unnumberedsec">To_Address</h3>
<a name="index-To_005fAddress"></a>
<p>The <code>System'To_Address</code>
(<code>System</code> is the only permissible prefix)
denotes a function identical to
<code>System.Storage_Elements.To_Address</code> except that
it is a static attribute. This means that if its argument is
a static expression, then the result of the attribute is a
static expression. The result is that such an expression can be
used in contexts (e.g. preelaborable packages) which require a
static expression and where the function call could not be used
(since the function call is always non-static, even if its
argument is static).
</p>
<hr>
<a name="Type_005fClass"></a>
<div class="header">
<p>
Next: <a href="#UET_005fAddress" accesskey="n" rel="next">UET_Address</a>, Previous: <a href="#To_005fAddress" accesskey="p" rel="prev">To_Address</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Type_005fClass-1"></a>
<h3 class="unnumberedsec">Type_Class</h3>
<a name="index-Type_005fClass"></a>
<p><code><var>type</var>'Type_Class</code> for any type or subtype <var>type</var> yields
the value of the type class for the full type of <var>type</var>. If
<var>type</var> is a generic formal type, the value is the value for the
corresponding actual subtype. The value of this attribute is of type
<code>System.Aux_DEC.Type_Class</code>, which has the following definition:
</p>
<div class="smallexample">
<pre class="smallexample"> type Type_Class is
(Type_Class_Enumeration,
Type_Class_Integer,
Type_Class_Fixed_Point,
Type_Class_Floating_Point,
Type_Class_Array,
Type_Class_Record,
Type_Class_Access,
Type_Class_Task,
Type_Class_Address);
</pre></div>
<p>Protected types yield the value <code>Type_Class_Task</code>, which thus
applies to all concurrent types. This attribute is designed to
be compatible with the DEC Ada 83 attribute of the same name.
</p>
<hr>
<a name="UET_005fAddress"></a>
<div class="header">
<p>
Next: <a href="#Unconstrained_005fArray" accesskey="n" rel="next">Unconstrained_Array</a>, Previous: <a href="#Type_005fClass" accesskey="p" rel="prev">Type_Class</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="UET_005fAddress-1"></a>
<h3 class="unnumberedsec">UET_Address</h3>
<a name="index-UET_005fAddress"></a>
<p>The <code>UET_Address</code> attribute can only be used for a prefix which
denotes a library package. It yields the address of the unit exception
table when zero cost exception handling is used. This attribute is
intended only for use within the GNAT implementation. See the unit
<code>Ada.Exceptions</code> in files <samp>a-except.ads</samp> and <samp>a-except.adb</samp>
for details on how this attribute is used in the implementation.
</p>
<hr>
<a name="Unconstrained_005fArray"></a>
<div class="header">
<p>
Next: <a href="#Universal_005fLiteral_005fString" accesskey="n" rel="next">Universal_Literal_String</a>, Previous: <a href="#UET_005fAddress" accesskey="p" rel="prev">UET_Address</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Unconstrained_005fArray-1"></a>
<h3 class="unnumberedsec">Unconstrained_Array</h3>
<a name="index-Unconstrained_005fArray"></a>
<p>The <code>Unconstrained_Array</code> attribute can be used with a prefix that
denotes any type or subtype. It is a static attribute that yields
<code>True</code> if the prefix designates an unconstrained array,
and <code>False</code> otherwise. In a generic instance, the result is
still static, and yields the result of applying this test to the
generic actual.
</p>
<hr>
<a name="Universal_005fLiteral_005fString"></a>
<div class="header">
<p>
Next: <a href="#Unrestricted_005fAccess" accesskey="n" rel="next">Unrestricted_Access</a>, Previous: <a href="#Unconstrained_005fArray" accesskey="p" rel="prev">Unconstrained_Array</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Universal_005fLiteral_005fString-1"></a>
<h3 class="unnumberedsec">Universal_Literal_String</h3>
<a name="index-Named-numbers_002c-representation-of"></a>
<a name="index-Universal_005fLiteral_005fString"></a>
<p>The prefix of <code>Universal_Literal_String</code> must be a named
number. The static result is the string consisting of the characters of
the number as defined in the original source. This allows the user
program to access the actual text of named numbers without intermediate
conversions and without the need to enclose the strings in quotes (which
would preclude their use as numbers).
</p>
<p>For example, the following program prints the first 50 digits of pi:
</p>
<div class="smallexample">
<pre class="smallexample">with Text_IO; use Text_IO;
with Ada.Numerics;
procedure Pi is
begin
Put (Ada.Numerics.Pi'Universal_Literal_String);
end;
</pre></div>
<hr>
<a name="Unrestricted_005fAccess"></a>
<div class="header">
<p>
Next: <a href="#Valid_005fScalars" accesskey="n" rel="next">Valid_Scalars</a>, Previous: <a href="#Universal_005fLiteral_005fString" accesskey="p" rel="prev">Universal_Literal_String</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Unrestricted_005fAccess-1"></a>
<h3 class="unnumberedsec">Unrestricted_Access</h3>
<a name="index-Access_002c-unrestricted"></a>
<a name="index-Unrestricted_005fAccess"></a>
<p>The <code>Unrestricted_Access</code> attribute is similar to <code>Access</code>
except that all accessibility and aliased view checks are omitted. This
is a user-beware attribute. It is similar to
<code>Address</code>, for which it is a desirable replacement where the value
desired is an access type. In other words, its effect is identical to
first applying the <code>Address</code> attribute and then doing an unchecked
conversion to a desired access type. In GNAT, but not necessarily in
other implementations, the use of static chains for inner level
subprograms means that <code>Unrestricted_Access</code> applied to a
subprogram yields a value that can be called as long as the subprogram
is in scope (normal Ada accessibility rules restrict this usage).
</p>
<p>It is possible to use <code>Unrestricted_Access</code> for any type, but care
must be exercised if it is used to create pointers to unconstrained
objects. In this case, the resulting pointer has the same scope as the
context of the attribute, and may not be returned to some enclosing
scope. For instance, a function cannot use <code>Unrestricted_Access</code>
to create a unconstrained pointer and then return that value to the
caller.
</p>
<hr>
<a name="Valid_005fScalars"></a>
<div class="header">
<p>
Next: <a href="#VADS_005fSize" accesskey="n" rel="next">VADS_Size</a>, Previous: <a href="#Unrestricted_005fAccess" accesskey="p" rel="prev">Unrestricted_Access</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Valid_005fScalars-1"></a>
<h3 class="unnumberedsec">Valid_Scalars</h3>
<a name="index-Valid_005fScalars"></a>
<p>The <code>'Valid_Scalars</code> attribute is intended to make it easier to
check the validity of scalar subcomponents of composite objects. It
is defined for any prefix <code>X</code> that denotes an object.
The value of this attribute is of the predefined type Boolean.
<code>X'Valid_Scalars</code> yields True if and only if evaluation of
<code>P'Valid</code> yields True for every scalar part P of X or if X has
no scalar parts. It is not specified in what order the scalar parts
are checked, nor whether any more are checked after any one of them
is determined to be invalid. If the prefix <code>X</code> is of a class-wide
type <code>T'Class</code> (where <code>T</code> is the associated specific type),
or if the prefix <code>X</code> is of a specific tagged type <code>T</code>, then
only the scalar parts of components of <code>T</code> are traversed; in other
words, components of extensions of <code>T</code> are not traversed even if
<code>T'Class (X)'Tag /= T'Tag</code> . The compiler will issue a warning if it can
be determined at compile time that the prefix of the attribute has no
scalar parts (e.g., if the prefix is of an access type, an interface type,
an undiscriminated task type, or an undiscriminated protected type).
</p>
<hr>
<a name="VADS_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Value_005fSize" accesskey="n" rel="next">Value_Size</a>, Previous: <a href="#Valid_005fScalars" accesskey="p" rel="prev">Valid_Scalars</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="VADS_005fSize-1"></a>
<h3 class="unnumberedsec">VADS_Size</h3>
<a name="index-Size_002c-VADS-compatibility-1"></a>
<a name="index-VADS_005fSize"></a>
<p>The <code>'VADS_Size</code> attribute is intended to make it easier to port
legacy code which relies on the semantics of <code>'Size</code> as implemented
by the VADS Ada 83 compiler. GNAT makes a best effort at duplicating the
same semantic interpretation. In particular, <code>'VADS_Size</code> applied
to a predefined or other primitive type with no Size clause yields the
Object_Size (for example, <code>Natural'Size</code> is 32 rather than 31 on
typical machines). In addition <code>'VADS_Size</code> applied to an object
gives the result that would be obtained by applying the attribute to
the corresponding type.
</p>
<hr>
<a name="Value_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Wchar_005fT_005fSize" accesskey="n" rel="next">Wchar_T_Size</a>, Previous: <a href="#VADS_005fSize" accesskey="p" rel="prev">VADS_Size</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Value_005fSize-1"></a>
<h3 class="unnumberedsec">Value_Size</h3>
<a name="index-Size_002c-setting-for-not_002dfirst-subtype"></a>
<a name="index-Value_005fSize"></a>
<p><code><var>type</var>'Value_Size</code> is the number of bits required to represent
a value of the given subtype. It is the same as <code><var>type</var>'Size</code>,
but, unlike <code>Size</code>, may be set for non-first subtypes.
</p>
<hr>
<a name="Wchar_005fT_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Word_005fSize" accesskey="n" rel="next">Word_Size</a>, Previous: <a href="#Value_005fSize" accesskey="p" rel="prev">Value_Size</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Wchar_005fT_005fSize-1"></a>
<h3 class="unnumberedsec">Wchar_T_Size</h3>
<a name="index-Wchar_005fT_005fSize"></a>
<p><code>Standard'Wchar_T_Size</code> (<code>Standard</code> is the only permissible
prefix) provides the size in bits of the C <code>wchar_t</code> type
primarily for constructing the definition of this type in
package <code>Interfaces.C</code>.
</p>
<hr>
<a name="Word_005fSize"></a>
<div class="header">
<p>
Next: <a href="#Partition_002dWide-Restrictions" accesskey="n" rel="next">Partition-Wide Restrictions</a>, Previous: <a href="#Wchar_005fT_005fSize" accesskey="p" rel="prev">Wchar_T_Size</a>, Up: <a href="#Implementation-Defined-Attributes" accesskey="u" rel="up">Implementation Defined Attributes</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Word_005fSize-1"></a>
<h3 class="unnumberedsec">Word_Size</h3>
<a name="index-Word_005fSize"></a>
<p><code>Standard'Word_Size</code> (<code>Standard</code> is the only permissible
prefix) provides the value <code>System.Word_Size</code>.
</p>
<hr>
<a name="Standard-and-Implementation-Defined-Restrictions"></a>
<div class="header">
<p>
Next: <a href="#Implementation-Advice" accesskey="n" rel="next">Implementation Advice</a>, Previous: <a href="#Implementation-Defined-Attributes" accesskey="p" rel="prev">Implementation Defined Attributes</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Standard-and-Implementation-Defined-Restrictions-1"></a>
<h2 class="chapter">3 Standard and Implementation Defined Restrictions</h2>
<p>All RM defined Restriction identifiers are implemented:
</p>
<ul>
<li> language-defined restrictions (see 13.12.1)
</li><li> tasking restrictions (see D.7)
</li><li> high integrity restrictions (see H.4)
</li></ul>
<p>GNAT implements additional restriction identifiers. All restrictions, whether
language defined or GNAT-specific, are listed in the following.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Partition_002dWide-Restrictions" accesskey="1">Partition-Wide Restrictions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Program-Unit-Level-Restrictions" accesskey="2">Program Unit Level Restrictions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Partition_002dWide-Restrictions"></a>
<div class="header">
<p>
Next: <a href="#Program-Unit-Level-Restrictions" accesskey="n" rel="next">Program Unit Level Restrictions</a>, Previous: <a href="#Word_005fSize" accesskey="p" rel="prev">Word_Size</a>, Up: <a href="#Standard-and-Implementation-Defined-Restrictions" accesskey="u" rel="up">Standard and Implementation Defined Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Partition_002dWide-Restrictions-1"></a>
<h3 class="section">3.1 Partition-Wide Restrictions</h3>
<p>There are two separate lists of restriction identifiers. The first
set requires consistency throughout a partition (in other words, if the
restriction identifier is used for any compilation unit in the partition,
then all compilation units in the partition must obey the restriction).
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Immediate_005fReclamation" accesskey="1">Immediate_Reclamation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fAsynchronous_005fSelect_005fNesting" accesskey="2">Max_Asynchronous_Select_Nesting</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fEntry_005fQueue_005fLength" accesskey="3">Max_Entry_Queue_Length</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fProtected_005fEntries" accesskey="4">Max_Protected_Entries</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fSelect_005fAlternatives" accesskey="5">Max_Select_Alternatives</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fStorage_005fAt_005fBlocking" accesskey="6">Max_Storage_At_Blocking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fTask_005fEntries" accesskey="7">Max_Task_Entries</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Max_005fTasks" accesskey="8">Max_Tasks</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAbort_005fStatements" accesskey="9">No_Abort_Statements</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAccess_005fParameter_005fAllocators">No_Access_Parameter_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAccess_005fSubprograms">No_Access_Subprograms</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAllocators">No_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fAnonymous_005fAllocators">No_Anonymous_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fCalendar">No_Calendar</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fCoextensions">No_Coextensions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDefault_005fInitialization">No_Default_Initialization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDelay">No_Delay</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDependence">No_Dependence</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDirect_005fBoolean_005fOperators">No_Direct_Boolean_Operators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDispatch">No_Dispatch</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDispatching_005fCalls">No_Dispatching_Calls</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDynamic_005fAttachment">No_Dynamic_Attachment</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fDynamic_005fPriorities">No_Dynamic_Priorities</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode">No_Entry_Calls_In_Elaboration_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fEnumeration_005fMaps">No_Enumeration_Maps</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fException_005fHandlers">No_Exception_Handlers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fException_005fPropagation">No_Exception_Propagation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fException_005fRegistration">No_Exception_Registration</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fExceptions">No_Exceptions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fFinalization">No_Finalization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fFixed_005fPoint">No_Fixed_Point</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fFloating_005fPoint">No_Floating_Point</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fConditionals">No_Implicit_Conditionals</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fDynamic_005fCode">No_Implicit_Dynamic_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fHeap_005fAllocations">No_Implicit_Heap_Allocations</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fLoops">No_Implicit_Loops</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fInitialize_005fScalars">No_Initialize_Scalars</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fIO">No_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fLocal_005fAllocators">No_Local_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fLocal_005fProtected_005fObjects">No_Local_Protected_Objects</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fLocal_005fTiming_005fEvents">No_Local_Timing_Events</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fNested_005fFinalization">No_Nested_Finalization</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fProtected_005fType_005fAllocators">No_Protected_Type_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fProtected_005fTypes">No_Protected_Types</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fRecursion">No_Recursion</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fReentrancy">No_Reentrancy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fRelative_005fDelay">No_Relative_Delay</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fRequeue_005fStatements">No_Requeue_Statements</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSecondary_005fStack">No_Secondary_Stack</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSelect_005fStatements">No_Select_Statements</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSpecific_005fTermination_005fHandlers">No_Specific_Termination_Handlers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fSpecification_005fof_005fAspect">No_Specification_of_Aspect</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStandard_005fAllocators_005fAfter_005fElaboration">No_Standard_Allocators_After_Elaboration</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStandard_005fStorage_005fPools">No_Standard_Storage_Pools</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStream_005fOptimizations">No_Stream_Optimizations</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fStreams">No_Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fAllocators">No_Task_Allocators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fAttributes_005fPackage">No_Task_Attributes_Package</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fHierarchy">No_Task_Hierarchy</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTask_005fTermination">No_Task_Termination</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTasking">No_Tasking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fTerminate_005fAlternatives">No_Terminate_Alternatives</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fUnchecked_005fAccess">No_Unchecked_Access</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Simple_005fBarriers">Simple_Barriers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Static_005fPriorities">Static_Priorities</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Static_005fStorage_005fSize">Static_Storage_Size</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Immediate_005fReclamation"></a>
<div class="header">
<p>
Next: <a href="#Max_005fAsynchronous_005fSelect_005fNesting" accesskey="n" rel="next">Max_Asynchronous_Select_Nesting</a>, Previous: <a href="#Program-Unit-Level-Restrictions" accesskey="p" rel="prev">Program Unit Level Restrictions</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Immediate_005fReclamation-1"></a>
<h4 class="unnumberedsubsec">Immediate_Reclamation</h4>
<a name="index-Immediate_005fReclamation"></a>
<p>[RM H.4] This restriction ensures that, except for storage occupied by
objects created by allocators and not deallocated via unchecked
deallocation, any storage reserved at run time for an object is
immediately reclaimed when the object no longer exists.
</p>
<hr>
<a name="Max_005fAsynchronous_005fSelect_005fNesting"></a>
<div class="header">
<p>
Next: <a href="#Max_005fEntry_005fQueue_005fLength" accesskey="n" rel="next">Max_Entry_Queue_Length</a>, Previous: <a href="#Immediate_005fReclamation" accesskey="p" rel="prev">Immediate_Reclamation</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fAsynchronous_005fSelect_005fNesting-1"></a>
<h4 class="unnumberedsubsec">Max_Asynchronous_Select_Nesting</h4>
<a name="index-Max_005fAsynchronous_005fSelect_005fNesting"></a>
<p>[RM D.7] Specifies the maximum dynamic nesting level of asynchronous
selects. Violations of this restriction with a value of zero are
detected at compile time. Violations of this restriction with values
other than zero cause Storage_Error to be raised.
</p>
<hr>
<a name="Max_005fEntry_005fQueue_005fLength"></a>
<div class="header">
<p>
Next: <a href="#Max_005fProtected_005fEntries" accesskey="n" rel="next">Max_Protected_Entries</a>, Previous: <a href="#Max_005fAsynchronous_005fSelect_005fNesting" accesskey="p" rel="prev">Max_Asynchronous_Select_Nesting</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fEntry_005fQueue_005fLength-1"></a>
<h4 class="unnumberedsubsec">Max_Entry_Queue_Length</h4>
<a name="index-Max_005fEntry_005fQueue_005fLength"></a>
<p>[RM D.7] This restriction is a declaration that any protected entry compiled in
the scope of the restriction has at most the specified number of
tasks waiting on the entry at any one time, and so no queue is required.
Note that this restriction is checked at run time. Violation of this
restriction results in the raising of Program_Error exception at the point of
the call.
</p>
<hr>
<a name="Max_005fProtected_005fEntries"></a>
<div class="header">
<p>
Next: <a href="#Max_005fSelect_005fAlternatives" accesskey="n" rel="next">Max_Select_Alternatives</a>, Previous: <a href="#Max_005fEntry_005fQueue_005fLength" accesskey="p" rel="prev">Max_Entry_Queue_Length</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fProtected_005fEntries-1"></a>
<h4 class="unnumberedsubsec">Max_Protected_Entries</h4>
<a name="index-Max_005fProtected_005fEntries"></a>
<p>[RM D.7] Specifies the maximum number of entries per protected type. The
bounds of every entry family of a protected unit shall be static, or shall be
defined by a discriminant of a subtype whose corresponding bound is static.
</p>
<hr>
<a name="Max_005fSelect_005fAlternatives"></a>
<div class="header">
<p>
Next: <a href="#Max_005fStorage_005fAt_005fBlocking" accesskey="n" rel="next">Max_Storage_At_Blocking</a>, Previous: <a href="#Max_005fProtected_005fEntries" accesskey="p" rel="prev">Max_Protected_Entries</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fSelect_005fAlternatives-1"></a>
<h4 class="unnumberedsubsec">Max_Select_Alternatives</h4>
<a name="index-Max_005fSelect_005fAlternatives"></a>
<p>[RM D.7] Specifies the maximum number of alternatives in a selective accept.
</p>
<hr>
<a name="Max_005fStorage_005fAt_005fBlocking"></a>
<div class="header">
<p>
Next: <a href="#Max_005fTask_005fEntries" accesskey="n" rel="next">Max_Task_Entries</a>, Previous: <a href="#Max_005fSelect_005fAlternatives" accesskey="p" rel="prev">Max_Select_Alternatives</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fStorage_005fAt_005fBlocking-1"></a>
<h4 class="unnumberedsubsec">Max_Storage_At_Blocking</h4>
<a name="index-Max_005fStorage_005fAt_005fBlocking"></a>
<p>[RM D.7] Specifies the maximum portion (in storage elements) of a task’s
Storage_Size that can be retained by a blocked task. A violation of this
restriction causes Storage_Error to be raised.
</p>
<hr>
<a name="Max_005fTask_005fEntries"></a>
<div class="header">
<p>
Next: <a href="#Max_005fTasks" accesskey="n" rel="next">Max_Tasks</a>, Previous: <a href="#Max_005fStorage_005fAt_005fBlocking" accesskey="p" rel="prev">Max_Storage_At_Blocking</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fTask_005fEntries-1"></a>
<h4 class="unnumberedsubsec">Max_Task_Entries</h4>
<a name="index-Max_005fTask_005fEntries"></a>
<p>[RM D.7] Specifies the maximum number of entries
per task. The bounds of every entry family
of a task unit shall be static, or shall be
defined by a discriminant of a subtype whose
corresponding bound is static.
</p>
<hr>
<a name="Max_005fTasks"></a>
<div class="header">
<p>
Next: <a href="#No_005fAbort_005fStatements" accesskey="n" rel="next">No_Abort_Statements</a>, Previous: <a href="#Max_005fTask_005fEntries" accesskey="p" rel="prev">Max_Task_Entries</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Max_005fTasks-1"></a>
<h4 class="unnumberedsubsec">Max_Tasks</h4>
<a name="index-Max_005fTasks"></a>
<p>[RM D.7] Specifies the maximum number of task that may be created, not
counting the creation of the environment task. Violations of this
restriction with a value of zero are detected at compile
time. Violations of this restriction with values other than zero cause
Storage_Error to be raised.
</p>
<hr>
<a name="No_005fAbort_005fStatements"></a>
<div class="header">
<p>
Next: <a href="#No_005fAccess_005fParameter_005fAllocators" accesskey="n" rel="next">No_Access_Parameter_Allocators</a>, Previous: <a href="#Max_005fTasks" accesskey="p" rel="prev">Max_Tasks</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fAbort_005fStatements-1"></a>
<h4 class="unnumberedsubsec">No_Abort_Statements</h4>
<a name="index-No_005fAbort_005fStatements"></a>
<p>[RM D.7] There are no abort_statements, and there are
no calls to Task_Identification.Abort_Task.
</p>
<hr>
<a name="No_005fAccess_005fParameter_005fAllocators"></a>
<div class="header">
<p>
Next: <a href="#No_005fAccess_005fSubprograms" accesskey="n" rel="next">No_Access_Subprograms</a>, Previous: <a href="#No_005fAbort_005fStatements" accesskey="p" rel="prev">No_Abort_Statements</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fAccess_005fParameter_005fAllocators-1"></a>
<h4 class="unnumberedsubsec">No_Access_Parameter_Allocators</h4>
<a name="index-No_005fAccess_005fParameter_005fAllocators"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of an allocator as the actual parameter to an access
parameter.
</p>
<hr>
<a name="No_005fAccess_005fSubprograms"></a>
<div class="header">
<p>
Next: <a href="#No_005fAllocators" accesskey="n" rel="next">No_Allocators</a>, Previous: <a href="#No_005fAccess_005fParameter_005fAllocators" accesskey="p" rel="prev">No_Access_Parameter_Allocators</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fAccess_005fSubprograms-1"></a>
<h4 class="unnumberedsubsec">No_Access_Subprograms</h4>
<a name="index-No_005fAccess_005fSubprograms"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
declarations of access-to-subprogram types.
</p>
<hr>
<a name="No_005fAllocators"></a>
<div class="header">
<p>
Next: <a href="#No_005fAnonymous_005fAllocators" accesskey="n" rel="next">No_Anonymous_Allocators</a>, Previous: <a href="#No_005fAccess_005fSubprograms" accesskey="p" rel="prev">No_Access_Subprograms</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fAllocators-1"></a>
<h4 class="unnumberedsubsec">No_Allocators</h4>
<a name="index-No_005fAllocators"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of an allocator.
</p>
<hr>
<a name="No_005fAnonymous_005fAllocators"></a>
<div class="header">
<p>
Next: <a href="#No_005fCalendar" accesskey="n" rel="next">No_Calendar</a>, Previous: <a href="#No_005fAllocators" accesskey="p" rel="prev">No_Allocators</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fAnonymous_005fAllocators-1"></a>
<h4 class="unnumberedsubsec">No_Anonymous_Allocators</h4>
<a name="index-No_005fAnonymous_005fAllocators"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of an allocator of anonymous access type.
</p>
<hr>
<a name="No_005fCalendar"></a>
<div class="header">
<p>
Next: <a href="#No_005fCoextensions" accesskey="n" rel="next">No_Coextensions</a>, Previous: <a href="#No_005fAnonymous_005fAllocators" accesskey="p" rel="prev">No_Anonymous_Allocators</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fCalendar-1"></a>
<h4 class="unnumberedsubsec">No_Calendar</h4>
<a name="index-No_005fCalendar"></a>
<p>[GNAT] This restriction ensures at compile time that there is no implicit or
explicit dependence on the package <code>Ada.Calendar</code>.
</p>
<hr>
<a name="No_005fCoextensions"></a>
<div class="header">
<p>
Next: <a href="#No_005fDefault_005fInitialization" accesskey="n" rel="next">No_Default_Initialization</a>, Previous: <a href="#No_005fCalendar" accesskey="p" rel="prev">No_Calendar</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fCoextensions-1"></a>
<h4 class="unnumberedsubsec">No_Coextensions</h4>
<a name="index-No_005fCoextensions"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
coextensions. See 3.10.2.
</p>
<hr>
<a name="No_005fDefault_005fInitialization"></a>
<div class="header">
<p>
Next: <a href="#No_005fDelay" accesskey="n" rel="next">No_Delay</a>, Previous: <a href="#No_005fCoextensions" accesskey="p" rel="prev">No_Coextensions</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDefault_005fInitialization-1"></a>
<h4 class="unnumberedsubsec">No_Default_Initialization</h4>
<a name="index-No_005fDefault_005fInitialization"></a>
<p>[GNAT] This restriction prohibits any instance of default initialization
of variables. The binder implements a consistency rule which prevents
any unit compiled without the restriction from with’ing a unit with the
restriction (this allows the generation of initialization procedures to
be skipped, since you can be sure that no call is ever generated to an
initialization procedure in a unit with the restriction active). If used
in conjunction with Initialize_Scalars or Normalize_Scalars, the effect
is to prohibit all cases of variables declared without a specific
initializer (including the case of OUT scalar parameters).
</p>
<hr>
<a name="No_005fDelay"></a>
<div class="header">
<p>
Next: <a href="#No_005fDependence" accesskey="n" rel="next">No_Dependence</a>, Previous: <a href="#No_005fDefault_005fInitialization" accesskey="p" rel="prev">No_Default_Initialization</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDelay-1"></a>
<h4 class="unnumberedsubsec">No_Delay</h4>
<a name="index-No_005fDelay"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
delay statements and no dependences on package Calendar.
</p>
<hr>
<a name="No_005fDependence"></a>
<div class="header">
<p>
Next: <a href="#No_005fDirect_005fBoolean_005fOperators" accesskey="n" rel="next">No_Direct_Boolean_Operators</a>, Previous: <a href="#No_005fDelay" accesskey="p" rel="prev">No_Delay</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDependence-1"></a>
<h4 class="unnumberedsubsec">No_Dependence</h4>
<a name="index-No_005fDependence"></a>
<p>[RM 13.12.1] This restriction checks at compile time that there are no
dependence on a library unit.
</p>
<hr>
<a name="No_005fDirect_005fBoolean_005fOperators"></a>
<div class="header">
<p>
Next: <a href="#No_005fDispatch" accesskey="n" rel="next">No_Dispatch</a>, Previous: <a href="#No_005fDependence" accesskey="p" rel="prev">No_Dependence</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDirect_005fBoolean_005fOperators-1"></a>
<h4 class="unnumberedsubsec">No_Direct_Boolean_Operators</h4>
<a name="index-No_005fDirect_005fBoolean_005fOperators"></a>
<p>[GNAT] This restriction ensures that no logical (and/or/xor) are used on
operands of type Boolean (or any type derived
from Boolean). This is intended for use in safety critical programs
where the certification protocol requires the use of short-circuit
(and then, or else) forms for all composite boolean operations.
</p>
<hr>
<a name="No_005fDispatch"></a>
<div class="header">
<p>
Next: <a href="#No_005fDispatching_005fCalls" accesskey="n" rel="next">No_Dispatching_Calls</a>, Previous: <a href="#No_005fDirect_005fBoolean_005fOperators" accesskey="p" rel="prev">No_Direct_Boolean_Operators</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDispatch-1"></a>
<h4 class="unnumberedsubsec">No_Dispatch</h4>
<a name="index-No_005fDispatch"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of <code>T'Class</code>, for any (tagged) subtype <code>T</code>.
</p>
<hr>
<a name="No_005fDispatching_005fCalls"></a>
<div class="header">
<p>
Next: <a href="#No_005fDynamic_005fAttachment" accesskey="n" rel="next">No_Dynamic_Attachment</a>, Previous: <a href="#No_005fDispatch" accesskey="p" rel="prev">No_Dispatch</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDispatching_005fCalls-1"></a>
<h4 class="unnumberedsubsec">No_Dispatching_Calls</h4>
<a name="index-No_005fDispatching_005fCalls"></a>
<p>[GNAT] This restriction ensures at compile time that the code generated by the
compiler involves no dispatching calls. The use of this restriction allows the
safe use of record extensions, classwide membership tests and other classwide
features not involving implicit dispatching. This restriction ensures that
the code contains no indirect calls through a dispatching mechanism. Note that
this includes internally-generated calls created by the compiler, for example
in the implementation of class-wide objects assignments. The
membership test is allowed in the presence of this restriction, because its
implementation requires no dispatching.
This restriction is comparable to the official Ada restriction
<code>No_Dispatch</code> except that it is a bit less restrictive in that it allows
all classwide constructs that do not imply dispatching.
The following example indicates constructs that violate this restriction.
</p>
<div class="smallexample">
<pre class="smallexample">package Pkg is
type T is tagged record
Data : Natural;
end record;
procedure P (X : T);
type DT is new T with record
More_Data : Natural;
end record;
procedure Q (X : DT);
end Pkg;
with Pkg; use Pkg;
procedure Example is
procedure Test (O : T'Class) is
N : Natural := O'Size;-- Error: Dispatching call
C : T'Class := O; -- Error: implicit Dispatching Call
begin
if O in DT'Class then -- OK : Membership test
Q (DT (O)); -- OK : Type conversion plus direct call
else
P (O); -- Error: Dispatching call
end if;
end Test;
Obj : DT;
begin
P (Obj); -- OK : Direct call
P (T (Obj)); -- OK : Type conversion plus direct call
P (T'Class (Obj)); -- Error: Dispatching call
Test (Obj); -- OK : Type conversion
if Obj in T'Class then -- OK : Membership test
null;
end if;
end Example;
</pre></div>
<hr>
<a name="No_005fDynamic_005fAttachment"></a>
<div class="header">
<p>
Next: <a href="#No_005fDynamic_005fPriorities" accesskey="n" rel="next">No_Dynamic_Priorities</a>, Previous: <a href="#No_005fDispatching_005fCalls" accesskey="p" rel="prev">No_Dispatching_Calls</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDynamic_005fAttachment-1"></a>
<h4 class="unnumberedsubsec">No_Dynamic_Attachment</h4>
<a name="index-No_005fDynamic_005fAttachment"></a>
<p>[RM D.7] This restriction ensures that there is no call to any of the
operations defined in package Ada.Interrupts
(Is_Reserved, Is_Attached, Current_Handler, Attach_Handler, Exchange_Handler,
Detach_Handler, and Reference).
</p>
<hr>
<a name="No_005fDynamic_005fPriorities"></a>
<div class="header">
<p>
Next: <a href="#No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode" accesskey="n" rel="next">No_Entry_Calls_In_Elaboration_Code</a>, Previous: <a href="#No_005fDynamic_005fAttachment" accesskey="p" rel="prev">No_Dynamic_Attachment</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fDynamic_005fPriorities-1"></a>
<h4 class="unnumberedsubsec">No_Dynamic_Priorities</h4>
<a name="index-No_005fDynamic_005fPriorities"></a>
<p>[RM D.7] There are no semantic dependencies on the package Dynamic_Priorities.
</p>
<hr>
<a name="No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode"></a>
<div class="header">
<p>
Next: <a href="#No_005fEnumeration_005fMaps" accesskey="n" rel="next">No_Enumeration_Maps</a>, Previous: <a href="#No_005fDynamic_005fPriorities" accesskey="p" rel="prev">No_Dynamic_Priorities</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode-1"></a>
<h4 class="unnumberedsubsec">No_Entry_Calls_In_Elaboration_Code</h4>
<a name="index-No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode"></a>
<p>[GNAT] This restriction ensures at compile time that no task or protected entry
calls are made during elaboration code. As a result of the use of this
restriction, the compiler can assume that no code past an accept statement
in a task can be executed at elaboration time.
</p>
<hr>
<a name="No_005fEnumeration_005fMaps"></a>
<div class="header">
<p>
Next: <a href="#No_005fException_005fHandlers" accesskey="n" rel="next">No_Exception_Handlers</a>, Previous: <a href="#No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode" accesskey="p" rel="prev">No_Entry_Calls_In_Elaboration_Code</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fEnumeration_005fMaps-1"></a>
<h4 class="unnumberedsubsec">No_Enumeration_Maps</h4>
<a name="index-No_005fEnumeration_005fMaps"></a>
<p>[GNAT] This restriction ensures at compile time that no operations requiring
enumeration maps are used (that is Image and Value attributes applied
to enumeration types).
</p>
<hr>
<a name="No_005fException_005fHandlers"></a>
<div class="header">
<p>
Next: <a href="#No_005fException_005fPropagation" accesskey="n" rel="next">No_Exception_Propagation</a>, Previous: <a href="#No_005fEnumeration_005fMaps" accesskey="p" rel="prev">No_Enumeration_Maps</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fException_005fHandlers-1"></a>
<h4 class="unnumberedsubsec">No_Exception_Handlers</h4>
<a name="index-No_005fException_005fHandlers"></a>
<p>[GNAT] This restriction ensures at compile time that there are no explicit
exception handlers. It also indicates that no exception propagation will
be provided. In this mode, exceptions may be raised but will result in
an immediate call to the last chance handler, a routine that the user
must define with the following profile:
</p>
<div class="smallexample">
<pre class="smallexample">procedure Last_Chance_Handler
(Source_Location : System.Address; Line : Integer);
pragma Export (C, Last_Chance_Handler,
"__gnat_last_chance_handler");
</pre></div>
<p>The parameter is a C null-terminated string representing a message to be
associated with the exception (typically the source location of the raise
statement generated by the compiler). The Line parameter when nonzero
represents the line number in the source program where the raise occurs.
</p>
<hr>
<a name="No_005fException_005fPropagation"></a>
<div class="header">
<p>
Next: <a href="#No_005fException_005fRegistration" accesskey="n" rel="next">No_Exception_Registration</a>, Previous: <a href="#No_005fException_005fHandlers" accesskey="p" rel="prev">No_Exception_Handlers</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fException_005fPropagation-1"></a>
<h4 class="unnumberedsubsec">No_Exception_Propagation</h4>
<a name="index-No_005fException_005fPropagation"></a>
<p>[GNAT] This restriction guarantees that exceptions are never propagated
to an outer subprogram scope. The only case in which an exception may
be raised is when the handler is statically in the same subprogram, so
that the effect of a raise is essentially like a goto statement. Any
other raise statement (implicit or explicit) will be considered
unhandled. Exception handlers are allowed, but may not contain an
exception occurrence identifier (exception choice). In addition, use of
the package GNAT.Current_Exception is not permitted, and reraise
statements (raise with no operand) are not permitted.
</p>
<hr>
<a name="No_005fException_005fRegistration"></a>
<div class="header">
<p>
Next: <a href="#No_005fExceptions" accesskey="n" rel="next">No_Exceptions</a>, Previous: <a href="#No_005fException_005fPropagation" accesskey="p" rel="prev">No_Exception_Propagation</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fException_005fRegistration-1"></a>
<h4 class="unnumberedsubsec">No_Exception_Registration</h4>
<a name="index-No_005fException_005fRegistration"></a>
<p>[GNAT] This restriction ensures at compile time that no stream operations for
types Exception_Id or Exception_Occurrence are used. This also makes it
impossible to pass exceptions to or from a partition with this restriction
in a distributed environment. If this exception is active, then the generated
code is simplified by omitting the otherwise-required global registration
of exceptions when they are declared.
</p>
<hr>
<a name="No_005fExceptions"></a>
<div class="header">
<p>
Next: <a href="#No_005fFinalization" accesskey="n" rel="next">No_Finalization</a>, Previous: <a href="#No_005fException_005fRegistration" accesskey="p" rel="prev">No_Exception_Registration</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fExceptions-1"></a>
<h4 class="unnumberedsubsec">No_Exceptions</h4>
<a name="index-No_005fExceptions"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
raise statements and no exception handlers.
</p>
<hr>
<a name="No_005fFinalization"></a>
<div class="header">
<p>
Next: <a href="#No_005fFixed_005fPoint" accesskey="n" rel="next">No_Fixed_Point</a>, Previous: <a href="#No_005fExceptions" accesskey="p" rel="prev">No_Exceptions</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fFinalization-1"></a>
<h4 class="unnumberedsubsec">No_Finalization</h4>
<a name="index-No_005fFinalization"></a>
<p>[GNAT] This restriction disables the language features described in
chapter 7.6 of the Ada 2005 RM as well as all form of code generation
performed by the compiler to support these features. The following types
are no longer considered controlled when this restriction is in effect:
</p><ul>
<li> <code>Ada.Finalization.Controlled</code>
</li><li> <code>Ada.Finalization.Limited_Controlled</code>
</li><li> Derivations from <code>Controlled</code> or <code>Limited_Controlled</code>
</li><li> Class-wide types
</li><li> Protected types
</li><li> Task types
</li><li> Array and record types with controlled components
</li></ul>
<p>The compiler no longer generates code to initialize, finalize or adjust an
object or a nested component, either declared on the stack or on the heap. The
deallocation of a controlled object no longer finalizes its contents.
</p>
<hr>
<a name="No_005fFixed_005fPoint"></a>
<div class="header">
<p>
Next: <a href="#No_005fFloating_005fPoint" accesskey="n" rel="next">No_Floating_Point</a>, Previous: <a href="#No_005fFinalization" accesskey="p" rel="prev">No_Finalization</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fFixed_005fPoint-1"></a>
<h4 class="unnumberedsubsec">No_Fixed_Point</h4>
<a name="index-No_005fFixed_005fPoint"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of fixed point types and operations.
</p>
<hr>
<a name="No_005fFloating_005fPoint"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplicit_005fConditionals" accesskey="n" rel="next">No_Implicit_Conditionals</a>, Previous: <a href="#No_005fFixed_005fPoint" accesskey="p" rel="prev">No_Fixed_Point</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fFloating_005fPoint-1"></a>
<h4 class="unnumberedsubsec">No_Floating_Point</h4>
<a name="index-No_005fFloating_005fPoint"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of floating point types and operations.
</p>
<hr>
<a name="No_005fImplicit_005fConditionals"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplicit_005fDynamic_005fCode" accesskey="n" rel="next">No_Implicit_Dynamic_Code</a>, Previous: <a href="#No_005fFloating_005fPoint" accesskey="p" rel="prev">No_Floating_Point</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplicit_005fConditionals-1"></a>
<h4 class="unnumberedsubsec">No_Implicit_Conditionals</h4>
<a name="index-No_005fImplicit_005fConditionals"></a>
<p>[GNAT] This restriction ensures that the generated code does not contain any
implicit conditionals, either by modifying the generated code where possible,
or by rejecting any construct that would otherwise generate an implicit
conditional. Note that this check does not include run time constraint
checks, which on some targets may generate implicit conditionals as
well. To control the latter, constraint checks can be suppressed in the
normal manner. Constructs generating implicit conditionals include comparisons
of composite objects and the Max/Min attributes.
</p>
<hr>
<a name="No_005fImplicit_005fDynamic_005fCode"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplicit_005fHeap_005fAllocations" accesskey="n" rel="next">No_Implicit_Heap_Allocations</a>, Previous: <a href="#No_005fImplicit_005fConditionals" accesskey="p" rel="prev">No_Implicit_Conditionals</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplicit_005fDynamic_005fCode-1"></a>
<h4 class="unnumberedsubsec">No_Implicit_Dynamic_Code</h4>
<a name="index-No_005fImplicit_005fDynamic_005fCode"></a>
<a name="index-trampoline"></a>
<p>[GNAT] This restriction prevents the compiler from building “trampolines”.
This is a structure that is built on the stack and contains dynamic
code to be executed at run time. On some targets, a trampoline is
built for the following features: <code>Access</code>,
<code>Unrestricted_Access</code>, or <code>Address</code> of a nested subprogram;
nested task bodies; primitive operations of nested tagged types.
Trampolines do not work on machines that prevent execution of stack
data. For example, on windows systems, enabling DEP (data execution
protection) will cause trampolines to raise an exception.
Trampolines are also quite slow at run time.
</p>
<p>On many targets, trampolines have been largely eliminated. Look at the
version of system.ads for your target — if it has
Always_Compatible_Rep equal to False, then trampolines are largely
eliminated. In particular, a trampoline is built for the following
features: <code>Address</code> of a nested subprogram;
<code>Access</code> or <code>Unrestricted_Access</code> of a nested subprogram,
but only if pragma Favor_Top_Level applies, or the access type has a
foreign-language convention; primitive operations of nested tagged
types.
</p>
<hr>
<a name="No_005fImplicit_005fHeap_005fAllocations"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplicit_005fLoops" accesskey="n" rel="next">No_Implicit_Loops</a>, Previous: <a href="#No_005fImplicit_005fDynamic_005fCode" accesskey="p" rel="prev">No_Implicit_Dynamic_Code</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplicit_005fHeap_005fAllocations-1"></a>
<h4 class="unnumberedsubsec">No_Implicit_Heap_Allocations</h4>
<a name="index-No_005fImplicit_005fHeap_005fAllocations"></a>
<p>[RM D.7] No constructs are allowed to cause implicit heap allocation.
</p>
<hr>
<a name="No_005fImplicit_005fLoops"></a>
<div class="header">
<p>
Next: <a href="#No_005fInitialize_005fScalars" accesskey="n" rel="next">No_Initialize_Scalars</a>, Previous: <a href="#No_005fImplicit_005fHeap_005fAllocations" accesskey="p" rel="prev">No_Implicit_Heap_Allocations</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplicit_005fLoops-1"></a>
<h4 class="unnumberedsubsec">No_Implicit_Loops</h4>
<a name="index-No_005fImplicit_005fLoops"></a>
<p>[GNAT] This restriction ensures that the generated code does not contain any
implicit <code>for</code> loops, either by modifying
the generated code where possible,
or by rejecting any construct that would otherwise generate an implicit
<code>for</code> loop. If this restriction is active, it is possible to build
large array aggregates with all static components without generating an
intermediate temporary, and without generating a loop to initialize individual
components. Otherwise, a loop is created for arrays larger than about 5000
scalar components.
</p>
<hr>
<a name="No_005fInitialize_005fScalars"></a>
<div class="header">
<p>
Next: <a href="#No_005fIO" accesskey="n" rel="next">No_IO</a>, Previous: <a href="#No_005fImplicit_005fLoops" accesskey="p" rel="prev">No_Implicit_Loops</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fInitialize_005fScalars-1"></a>
<h4 class="unnumberedsubsec">No_Initialize_Scalars</h4>
<a name="index-No_005fInitialize_005fScalars"></a>
<p>[GNAT] This restriction ensures that no unit in the partition is compiled with
pragma Initialize_Scalars. This allows the generation of more efficient
code, and in particular eliminates dummy null initialization routines that
are otherwise generated for some record and array types.
</p>
<hr>
<a name="No_005fIO"></a>
<div class="header">
<p>
Next: <a href="#No_005fLocal_005fAllocators" accesskey="n" rel="next">No_Local_Allocators</a>, Previous: <a href="#No_005fInitialize_005fScalars" accesskey="p" rel="prev">No_Initialize_Scalars</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fIO-1"></a>
<h4 class="unnumberedsubsec">No_IO</h4>
<a name="index-No_005fIO"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
dependences on any of the library units Sequential_IO, Direct_IO,
Text_IO, Wide_Text_IO, Wide_Wide_Text_IO, or Stream_IO.
</p>
<hr>
<a name="No_005fLocal_005fAllocators"></a>
<div class="header">
<p>
Next: <a href="#No_005fLocal_005fProtected_005fObjects" accesskey="n" rel="next">No_Local_Protected_Objects</a>, Previous: <a href="#No_005fIO" accesskey="p" rel="prev">No_IO</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fLocal_005fAllocators-1"></a>
<h4 class="unnumberedsubsec">No_Local_Allocators</h4>
<a name="index-No_005fLocal_005fAllocators"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of an allocator in subprograms, generic subprograms, tasks,
and entry bodies.
</p>
<hr>
<a name="No_005fLocal_005fProtected_005fObjects"></a>
<div class="header">
<p>
Next: <a href="#No_005fLocal_005fTiming_005fEvents" accesskey="n" rel="next">No_Local_Timing_Events</a>, Previous: <a href="#No_005fLocal_005fAllocators" accesskey="p" rel="prev">No_Local_Allocators</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fLocal_005fProtected_005fObjects-1"></a>
<h4 class="unnumberedsubsec">No_Local_Protected_Objects</h4>
<a name="index-No_005fLocal_005fProtected_005fObjects"></a>
<p>[RM D.7] This restriction ensures at compile time that protected objects are
only declared at the library level.
</p>
<hr>
<a name="No_005fLocal_005fTiming_005fEvents"></a>
<div class="header">
<p>
Next: <a href="#No_005fNested_005fFinalization" accesskey="n" rel="next">No_Nested_Finalization</a>, Previous: <a href="#No_005fLocal_005fProtected_005fObjects" accesskey="p" rel="prev">No_Local_Protected_Objects</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fLocal_005fTiming_005fEvents-1"></a>
<h4 class="unnumberedsubsec">No_Local_Timing_Events</h4>
<a name="index-No_005fLocal_005fTiming_005fEvents"></a>
<p>[RM D.7] All objects of type Ada.Timing_Events.Timing_Event are
declared at the library level.
</p>
<hr>
<a name="No_005fNested_005fFinalization"></a>
<div class="header">
<p>
Next: <a href="#No_005fProtected_005fType_005fAllocators" accesskey="n" rel="next">No_Protected_Type_Allocators</a>, Previous: <a href="#No_005fLocal_005fTiming_005fEvents" accesskey="p" rel="prev">No_Local_Timing_Events</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fNested_005fFinalization-1"></a>
<h4 class="unnumberedsubsec">No_Nested_Finalization</h4>
<a name="index-No_005fNested_005fFinalization"></a>
<p>[RM D.7] All objects requiring finalization are declared at the library level.
</p>
<hr>
<a name="No_005fProtected_005fType_005fAllocators"></a>
<div class="header">
<p>
Next: <a href="#No_005fProtected_005fTypes" accesskey="n" rel="next">No_Protected_Types</a>, Previous: <a href="#No_005fNested_005fFinalization" accesskey="p" rel="prev">No_Nested_Finalization</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fProtected_005fType_005fAllocators-1"></a>
<h4 class="unnumberedsubsec">No_Protected_Type_Allocators</h4>
<a name="index-No_005fProtected_005fType_005fAllocators"></a>
<p>[RM D.7] This restriction ensures at compile time that there are no allocator
expressions that attempt to allocate protected objects.
</p>
<hr>
<a name="No_005fProtected_005fTypes"></a>
<div class="header">
<p>
Next: <a href="#No_005fRecursion" accesskey="n" rel="next">No_Recursion</a>, Previous: <a href="#No_005fProtected_005fType_005fAllocators" accesskey="p" rel="prev">No_Protected_Type_Allocators</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fProtected_005fTypes-1"></a>
<h4 class="unnumberedsubsec">No_Protected_Types</h4>
<a name="index-No_005fProtected_005fTypes"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
declarations of protected types or protected objects.
</p>
<hr>
<a name="No_005fRecursion"></a>
<div class="header">
<p>
Next: <a href="#No_005fReentrancy" accesskey="n" rel="next">No_Reentrancy</a>, Previous: <a href="#No_005fProtected_005fTypes" accesskey="p" rel="prev">No_Protected_Types</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fRecursion-1"></a>
<h4 class="unnumberedsubsec">No_Recursion</h4>
<a name="index-No_005fRecursion"></a>
<p>[RM H.4] A program execution is erroneous if a subprogram is invoked as
part of its execution.
</p>
<hr>
<a name="No_005fReentrancy"></a>
<div class="header">
<p>
Next: <a href="#No_005fRelative_005fDelay" accesskey="n" rel="next">No_Relative_Delay</a>, Previous: <a href="#No_005fRecursion" accesskey="p" rel="prev">No_Recursion</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fReentrancy-1"></a>
<h4 class="unnumberedsubsec">No_Reentrancy</h4>
<a name="index-No_005fReentrancy"></a>
<p>[RM H.4] A program execution is erroneous if a subprogram is executed by
two tasks at the same time.
</p>
<hr>
<a name="No_005fRelative_005fDelay"></a>
<div class="header">
<p>
Next: <a href="#No_005fRequeue_005fStatements" accesskey="n" rel="next">No_Requeue_Statements</a>, Previous: <a href="#No_005fReentrancy" accesskey="p" rel="prev">No_Reentrancy</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fRelative_005fDelay-1"></a>
<h4 class="unnumberedsubsec">No_Relative_Delay</h4>
<a name="index-No_005fRelative_005fDelay"></a>
<p>[RM D.7] This restriction ensures at compile time that there are no delay
relative statements and prevents expressions such as <code>delay 1.23;</code> from
appearing in source code.
</p>
<hr>
<a name="No_005fRequeue_005fStatements"></a>
<div class="header">
<p>
Next: <a href="#No_005fSecondary_005fStack" accesskey="n" rel="next">No_Secondary_Stack</a>, Previous: <a href="#No_005fRelative_005fDelay" accesskey="p" rel="prev">No_Relative_Delay</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fRequeue_005fStatements-1"></a>
<h4 class="unnumberedsubsec">No_Requeue_Statements</h4>
<a name="index-No_005fRequeue_005fStatements"></a>
<p>[RM D.7] This restriction ensures at compile time that no requeue statements
are permitted and prevents keyword <code>requeue</code> from being used in source
code.
</p>
<hr>
<a name="No_005fSecondary_005fStack"></a>
<div class="header">
<p>
Next: <a href="#No_005fSelect_005fStatements" accesskey="n" rel="next">No_Select_Statements</a>, Previous: <a href="#No_005fRequeue_005fStatements" accesskey="p" rel="prev">No_Requeue_Statements</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fSecondary_005fStack-1"></a>
<h4 class="unnumberedsubsec">No_Secondary_Stack</h4>
<a name="index-No_005fSecondary_005fStack"></a>
<p>[GNAT] This restriction ensures at compile time that the generated code
does not contain any reference to the secondary stack. The secondary
stack is used to implement functions returning unconstrained objects
(arrays or records) on some targets.
</p>
<hr>
<a name="No_005fSelect_005fStatements"></a>
<div class="header">
<p>
Next: <a href="#No_005fSpecific_005fTermination_005fHandlers" accesskey="n" rel="next">No_Specific_Termination_Handlers</a>, Previous: <a href="#No_005fSecondary_005fStack" accesskey="p" rel="prev">No_Secondary_Stack</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fSelect_005fStatements-1"></a>
<h4 class="unnumberedsubsec">No_Select_Statements</h4>
<a name="index-No_005fSelect_005fStatements"></a>
<p>[RM D.7] This restriction ensures at compile time no select statements of any
kind are permitted, that is the keyword <code>select</code> may not appear.
</p>
<hr>
<a name="No_005fSpecific_005fTermination_005fHandlers"></a>
<div class="header">
<p>
Next: <a href="#No_005fSpecification_005fof_005fAspect" accesskey="n" rel="next">No_Specification_of_Aspect</a>, Previous: <a href="#No_005fSelect_005fStatements" accesskey="p" rel="prev">No_Select_Statements</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fSpecific_005fTermination_005fHandlers-1"></a>
<h4 class="unnumberedsubsec">No_Specific_Termination_Handlers</h4>
<a name="index-No_005fSpecific_005fTermination_005fHandlers"></a>
<p>[RM D.7] There are no calls to Ada.Task_Termination.Set_Specific_Handler
or to Ada.Task_Termination.Specific_Handler.
</p>
<hr>
<a name="No_005fSpecification_005fof_005fAspect"></a>
<div class="header">
<p>
Next: <a href="#No_005fStandard_005fAllocators_005fAfter_005fElaboration" accesskey="n" rel="next">No_Standard_Allocators_After_Elaboration</a>, Previous: <a href="#No_005fSpecific_005fTermination_005fHandlers" accesskey="p" rel="prev">No_Specific_Termination_Handlers</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fSpecification_005fof_005fAspect-1"></a>
<h4 class="unnumberedsubsec">No_Specification_of_Aspect</h4>
<a name="index-No_005fSpecification_005fof_005fAspect"></a>
<p>[RM 13.12.1] This restriction checks at compile time that no aspect
specification, attribute definition clause, or pragma is given for a
given aspect.
</p>
<hr>
<a name="No_005fStandard_005fAllocators_005fAfter_005fElaboration"></a>
<div class="header">
<p>
Next: <a href="#No_005fStandard_005fStorage_005fPools" accesskey="n" rel="next">No_Standard_Storage_Pools</a>, Previous: <a href="#No_005fSpecification_005fof_005fAspect" accesskey="p" rel="prev">No_Specification_of_Aspect</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fStandard_005fAllocators_005fAfter_005fElaboration-1"></a>
<h4 class="unnumberedsubsec">No_Standard_Allocators_After_Elaboration</h4>
<a name="index-No_005fStandard_005fAllocators_005fAfter_005fElaboration"></a>
<p>[RM D.7] Specifies that an allocator using a standard storage pool
should never be evaluated at run time after the elaboration of the
library items of the partition has completed. Otherwise, Storage_Error
is raised.
</p>
<hr>
<a name="No_005fStandard_005fStorage_005fPools"></a>
<div class="header">
<p>
Next: <a href="#No_005fStream_005fOptimizations" accesskey="n" rel="next">No_Stream_Optimizations</a>, Previous: <a href="#No_005fStandard_005fAllocators_005fAfter_005fElaboration" accesskey="p" rel="prev">No_Standard_Allocators_After_Elaboration</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fStandard_005fStorage_005fPools-1"></a>
<h4 class="unnumberedsubsec">No_Standard_Storage_Pools</h4>
<a name="index-No_005fStandard_005fStorage_005fPools"></a>
<p>[GNAT] This restriction ensures at compile time that no access types
use the standard default storage pool. Any access type declared must
have an explicit Storage_Pool attribute defined specifying a
user-defined storage pool.
</p>
<hr>
<a name="No_005fStream_005fOptimizations"></a>
<div class="header">
<p>
Next: <a href="#No_005fStreams" accesskey="n" rel="next">No_Streams</a>, Previous: <a href="#No_005fStandard_005fStorage_005fPools" accesskey="p" rel="prev">No_Standard_Storage_Pools</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fStream_005fOptimizations-1"></a>
<h4 class="unnumberedsubsec">No_Stream_Optimizations</h4>
<a name="index-No_005fStream_005fOptimizations"></a>
<p>[GNAT] This restriction affects the performance of stream operations on types
<code>String</code>, <code>Wide_String</code> and <code>Wide_Wide_String</code>. By default, the
compiler uses block reads and writes when manipulating <code>String</code> objects
due to their supperior performance. When this restriction is in effect, the
compiler performs all IO operations on a per-character basis.
</p>
<hr>
<a name="No_005fStreams"></a>
<div class="header">
<p>
Next: <a href="#No_005fTask_005fAllocators" accesskey="n" rel="next">No_Task_Allocators</a>, Previous: <a href="#No_005fStream_005fOptimizations" accesskey="p" rel="prev">No_Stream_Optimizations</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fStreams-1"></a>
<h4 class="unnumberedsubsec">No_Streams</h4>
<a name="index-No_005fStreams"></a>
<p>[GNAT] This restriction ensures at compile/bind time that there are no
stream objects created and no use of stream attributes.
This restriction does not forbid dependences on the package
<code>Ada.Streams</code>. So it is permissible to with
<code>Ada.Streams</code> (or another package that does so itself)
as long as no actual stream objects are created and no
stream attributes are used.
</p>
<p>Note that the use of restriction allows optimization of tagged types,
since they do not need to worry about dispatching stream operations.
To take maximum advantage of this space-saving optimization, any
unit declaring a tagged type should be compiled with the restriction,
though this is not required.
</p>
<hr>
<a name="No_005fTask_005fAllocators"></a>
<div class="header">
<p>
Next: <a href="#No_005fTask_005fAttributes_005fPackage" accesskey="n" rel="next">No_Task_Attributes_Package</a>, Previous: <a href="#No_005fStreams" accesskey="p" rel="prev">No_Streams</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fTask_005fAllocators-1"></a>
<h4 class="unnumberedsubsec">No_Task_Allocators</h4>
<a name="index-No_005fTask_005fAllocators"></a>
<p>[RM D.7] There are no allocators for task types
or types containing task subcomponents.
</p>
<hr>
<a name="No_005fTask_005fAttributes_005fPackage"></a>
<div class="header">
<p>
Next: <a href="#No_005fTask_005fHierarchy" accesskey="n" rel="next">No_Task_Hierarchy</a>, Previous: <a href="#No_005fTask_005fAllocators" accesskey="p" rel="prev">No_Task_Allocators</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fTask_005fAttributes_005fPackage-1"></a>
<h4 class="unnumberedsubsec">No_Task_Attributes_Package</h4>
<a name="index-No_005fTask_005fAttributes_005fPackage"></a>
<p>[GNAT] This restriction ensures at compile time that there are no implicit or
explicit dependencies on the package <code>Ada.Task_Attributes</code>.
</p>
<hr>
<a name="No_005fTask_005fHierarchy"></a>
<div class="header">
<p>
Next: <a href="#No_005fTask_005fTermination" accesskey="n" rel="next">No_Task_Termination</a>, Previous: <a href="#No_005fTask_005fAttributes_005fPackage" accesskey="p" rel="prev">No_Task_Attributes_Package</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fTask_005fHierarchy-1"></a>
<h4 class="unnumberedsubsec">No_Task_Hierarchy</h4>
<a name="index-No_005fTask_005fHierarchy"></a>
<p>[RM D.7] All (non-environment) tasks depend
directly on the environment task of the partition.
</p>
<hr>
<a name="No_005fTask_005fTermination"></a>
<div class="header">
<p>
Next: <a href="#No_005fTasking" accesskey="n" rel="next">No_Tasking</a>, Previous: <a href="#No_005fTask_005fHierarchy" accesskey="p" rel="prev">No_Task_Hierarchy</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fTask_005fTermination-1"></a>
<h4 class="unnumberedsubsec">No_Task_Termination</h4>
<a name="index-No_005fTask_005fTermination"></a>
<p>[RM D.7] Tasks which terminate are erroneous.
</p>
<hr>
<a name="No_005fTasking"></a>
<div class="header">
<p>
Next: <a href="#No_005fTerminate_005fAlternatives" accesskey="n" rel="next">No_Terminate_Alternatives</a>, Previous: <a href="#No_005fTask_005fTermination" accesskey="p" rel="prev">No_Task_Termination</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fTasking-1"></a>
<h4 class="unnumberedsubsec">No_Tasking</h4>
<a name="index-No_005fTasking"></a>
<p>[GNAT] This restriction prevents the declaration of tasks or task types
throughout the partition. It is similar in effect to the use of
<code>Max_Tasks => 0</code> except that violations are caught at compile time
and cause an error message to be output either by the compiler or
binder.
</p>
<hr>
<a name="No_005fTerminate_005fAlternatives"></a>
<div class="header">
<p>
Next: <a href="#No_005fUnchecked_005fAccess" accesskey="n" rel="next">No_Unchecked_Access</a>, Previous: <a href="#No_005fTasking" accesskey="p" rel="prev">No_Tasking</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fTerminate_005fAlternatives-1"></a>
<h4 class="unnumberedsubsec">No_Terminate_Alternatives</h4>
<a name="index-No_005fTerminate_005fAlternatives"></a>
<p>[RM D.7] There are no selective accepts with terminate alternatives.
</p>
<hr>
<a name="No_005fUnchecked_005fAccess"></a>
<div class="header">
<p>
Next: <a href="#Simple_005fBarriers" accesskey="n" rel="next">Simple_Barriers</a>, Previous: <a href="#No_005fTerminate_005fAlternatives" accesskey="p" rel="prev">No_Terminate_Alternatives</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fUnchecked_005fAccess-1"></a>
<h4 class="unnumberedsubsec">No_Unchecked_Access</h4>
<a name="index-No_005fUnchecked_005fAccess"></a>
<p>[RM H.4] This restriction ensures at compile time that there are no
occurrences of the Unchecked_Access attribute.
</p>
<hr>
<a name="Simple_005fBarriers"></a>
<div class="header">
<p>
Next: <a href="#Static_005fPriorities" accesskey="n" rel="next">Static_Priorities</a>, Previous: <a href="#No_005fUnchecked_005fAccess" accesskey="p" rel="prev">No_Unchecked_Access</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Simple_005fBarriers-1"></a>
<h4 class="unnumberedsubsec">Simple_Barriers</h4>
<a name="index-Simple_005fBarriers"></a>
<p>[RM D.7] This restriction ensures at compile time that barriers in entry
declarations for protected types are restricted to either static boolean
expressions or references to simple boolean variables defined in the private
part of the protected type. No other form of entry barriers is permitted.
</p>
<hr>
<a name="Static_005fPriorities"></a>
<div class="header">
<p>
Next: <a href="#Static_005fStorage_005fSize" accesskey="n" rel="next">Static_Storage_Size</a>, Previous: <a href="#Simple_005fBarriers" accesskey="p" rel="prev">Simple_Barriers</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Static_005fPriorities-1"></a>
<h4 class="unnumberedsubsec">Static_Priorities</h4>
<a name="index-Static_005fPriorities"></a>
<p>[GNAT] This restriction ensures at compile time that all priority expressions
are static, and that there are no dependences on the package
<code>Ada.Dynamic_Priorities</code>.
</p>
<hr>
<a name="Static_005fStorage_005fSize"></a>
<div class="header">
<p>
Next: <a href="#No_005fElaboration_005fCode" accesskey="n" rel="next">No_Elaboration_Code</a>, Previous: <a href="#Static_005fPriorities" accesskey="p" rel="prev">Static_Priorities</a>, Up: <a href="#Partition_002dWide-Restrictions" accesskey="u" rel="up">Partition-Wide Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Static_005fStorage_005fSize-1"></a>
<h4 class="unnumberedsubsec">Static_Storage_Size</h4>
<a name="index-Static_005fStorage_005fSize"></a>
<p>[GNAT] This restriction ensures at compile time that any expression appearing
in a Storage_Size pragma or attribute definition clause is static.
</p>
<hr>
<a name="Program-Unit-Level-Restrictions"></a>
<div class="header">
<p>
Next: <a href="#Immediate_005fReclamation" accesskey="n" rel="next">Immediate_Reclamation</a>, Previous: <a href="#Partition_002dWide-Restrictions" accesskey="p" rel="prev">Partition-Wide Restrictions</a>, Up: <a href="#Standard-and-Implementation-Defined-Restrictions" accesskey="u" rel="up">Standard and Implementation Defined Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Program-Unit-Level-Restrictions-1"></a>
<h3 class="section">3.2 Program Unit Level Restrictions</h3>
<p>The second set of restriction identifiers
does not require partition-wide consistency.
The restriction may be enforced for a single
compilation unit without any effect on any of the
other compilation units in the partition.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#No_005fElaboration_005fCode" accesskey="1">No_Elaboration_Code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fEntry_005fQueue" accesskey="2">No_Entry_Queue</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fAspect_005fSpecifications" accesskey="3">No_Implementation_Aspect_Specifications</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fAttributes" accesskey="4">No_Implementation_Attributes</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fIdentifiers" accesskey="5">No_Implementation_Identifiers</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fPragmas" accesskey="6">No_Implementation_Pragmas</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fRestrictions" accesskey="7">No_Implementation_Restrictions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplementation_005fUnits" accesskey="8">No_Implementation_Units</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fImplicit_005fAliasing" accesskey="9">No_Implicit_Aliasing</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fObsolescent_005fFeatures">No_Obsolescent_Features</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#No_005fWide_005fCharacters">No_Wide_Characters</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#SPARK">SPARK</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="No_005fElaboration_005fCode"></a>
<div class="header">
<p>
Next: <a href="#No_005fEntry_005fQueue" accesskey="n" rel="next">No_Entry_Queue</a>, Previous: <a href="#Static_005fStorage_005fSize" accesskey="p" rel="prev">Static_Storage_Size</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fElaboration_005fCode-1"></a>
<h4 class="unnumberedsubsec">No_Elaboration_Code</h4>
<a name="index-No_005fElaboration_005fCode"></a>
<p>[GNAT] This restriction ensures at compile time that no elaboration code is
generated. Note that this is not the same condition as is enforced
by pragma <code>Preelaborate</code>. There are cases in which pragma
<code>Preelaborate</code> still permits code to be generated (e.g. code
to initialize a large array to all zeroes), and there are cases of units
which do not meet the requirements for pragma <code>Preelaborate</code>,
but for which no elaboration code is generated. Generally, it is
the case that preelaborable units will meet the restrictions, with
the exception of large aggregates initialized with an others_clause,
and exception declarations (which generate calls to a run-time
registry procedure). This restriction is enforced on
a unit by unit basis, it need not be obeyed consistently
throughout a partition.
</p>
<p>In the case of aggregates with others, if the aggregate has a dynamic
size, there is no way to eliminate the elaboration code (such dynamic
bounds would be incompatible with <code>Preelaborate</code> in any case). If
the bounds are static, then use of this restriction actually modifies
the code choice of the compiler to avoid generating a loop, and instead
generate the aggregate statically if possible, no matter how many times
the data for the others clause must be repeatedly generated.
</p>
<p>It is not possible to precisely document
the constructs which are compatible with this restriction, since,
unlike most other restrictions, this is not a restriction on the
source code, but a restriction on the generated object code. For
example, if the source contains a declaration:
</p>
<div class="smallexample">
<pre class="smallexample"> Val : constant Integer := X;
</pre></div>
<p>where X is not a static constant, it may be possible, depending
on complex optimization circuitry, for the compiler to figure
out the value of X at compile time, in which case this initialization
can be done by the loader, and requires no initialization code. It
is not possible to document the precise conditions under which the
optimizer can figure this out.
</p>
<p>Note that this the implementation of this restriction requires full
code generation. If it is used in conjunction with "semantics only"
checking, then some cases of violations may be missed.
</p>
<hr>
<a name="No_005fEntry_005fQueue"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplementation_005fAspect_005fSpecifications" accesskey="n" rel="next">No_Implementation_Aspect_Specifications</a>, Previous: <a href="#No_005fElaboration_005fCode" accesskey="p" rel="prev">No_Elaboration_Code</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fEntry_005fQueue-1"></a>
<h4 class="unnumberedsubsec">No_Entry_Queue</h4>
<a name="index-No_005fEntry_005fQueue"></a>
<p>[GNAT] This restriction is a declaration that any protected entry compiled in
the scope of the restriction has at most one task waiting on the entry
at any one time, and so no queue is required. This restriction is not
checked at compile time. A program execution is erroneous if an attempt
is made to queue a second task on such an entry.
</p>
<hr>
<a name="No_005fImplementation_005fAspect_005fSpecifications"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplementation_005fAttributes" accesskey="n" rel="next">No_Implementation_Attributes</a>, Previous: <a href="#No_005fEntry_005fQueue" accesskey="p" rel="prev">No_Entry_Queue</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplementation_005fAspect_005fSpecifications-1"></a>
<h4 class="unnumberedsubsec">No_Implementation_Aspect_Specifications</h4>
<a name="index-No_005fImplementation_005fAspect_005fSpecifications"></a>
<p>[RM 13.12.1] This restriction checks at compile time that no
GNAT-defined aspects are present. With this restriction, the only
aspects that can be used are those defined in the Ada Reference Manual.
</p>
<hr>
<a name="No_005fImplementation_005fAttributes"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplementation_005fIdentifiers" accesskey="n" rel="next">No_Implementation_Identifiers</a>, Previous: <a href="#No_005fImplementation_005fAspect_005fSpecifications" accesskey="p" rel="prev">No_Implementation_Aspect_Specifications</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplementation_005fAttributes-1"></a>
<h4 class="unnumberedsubsec">No_Implementation_Attributes</h4>
<a name="index-No_005fImplementation_005fAttributes"></a>
<p>[RM 13.12.1] This restriction checks at compile time that no
GNAT-defined attributes are present. With this restriction, the only
attributes that can be used are those defined in the Ada Reference
Manual.
</p>
<hr>
<a name="No_005fImplementation_005fIdentifiers"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplementation_005fPragmas" accesskey="n" rel="next">No_Implementation_Pragmas</a>, Previous: <a href="#No_005fImplementation_005fAttributes" accesskey="p" rel="prev">No_Implementation_Attributes</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplementation_005fIdentifiers-1"></a>
<h4 class="unnumberedsubsec">No_Implementation_Identifiers</h4>
<a name="index-No_005fImplementation_005fIdentifiers"></a>
<p>[RM 13.12.1] This restriction checks at compile time that no
implementation-defined identifiers (marked with pragma Implementation_Defined)
occur within language-defined packages.
</p>
<hr>
<a name="No_005fImplementation_005fPragmas"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplementation_005fRestrictions" accesskey="n" rel="next">No_Implementation_Restrictions</a>, Previous: <a href="#No_005fImplementation_005fIdentifiers" accesskey="p" rel="prev">No_Implementation_Identifiers</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplementation_005fPragmas-1"></a>
<h4 class="unnumberedsubsec">No_Implementation_Pragmas</h4>
<a name="index-No_005fImplementation_005fPragmas"></a>
<p>[RM 13.12.1] This restriction checks at compile time that no
GNAT-defined pragmas are present. With this restriction, the only
pragmas that can be used are those defined in the Ada Reference Manual.
</p>
<hr>
<a name="No_005fImplementation_005fRestrictions"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplementation_005fUnits" accesskey="n" rel="next">No_Implementation_Units</a>, Previous: <a href="#No_005fImplementation_005fPragmas" accesskey="p" rel="prev">No_Implementation_Pragmas</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplementation_005fRestrictions-1"></a>
<h4 class="unnumberedsubsec">No_Implementation_Restrictions</h4>
<a name="index-No_005fImplementation_005fRestrictions"></a>
<p>[GNAT] This restriction checks at compile time that no GNAT-defined restriction
identifiers (other than <code>No_Implementation_Restrictions</code> itself)
are present. With this restriction, the only other restriction identifiers
that can be used are those defined in the Ada Reference Manual.
</p>
<hr>
<a name="No_005fImplementation_005fUnits"></a>
<div class="header">
<p>
Next: <a href="#No_005fImplicit_005fAliasing" accesskey="n" rel="next">No_Implicit_Aliasing</a>, Previous: <a href="#No_005fImplementation_005fRestrictions" accesskey="p" rel="prev">No_Implementation_Restrictions</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplementation_005fUnits-1"></a>
<h4 class="unnumberedsubsec">No_Implementation_Units</h4>
<a name="index-No_005fImplementation_005fUnits"></a>
<p>[RM 13.12.1] This restriction checks at compile time that there is no
mention in the context clause of any implementation-defined descendants
of packages Ada, Interfaces, or System.
</p>
<hr>
<a name="No_005fImplicit_005fAliasing"></a>
<div class="header">
<p>
Next: <a href="#No_005fObsolescent_005fFeatures" accesskey="n" rel="next">No_Obsolescent_Features</a>, Previous: <a href="#No_005fImplementation_005fUnits" accesskey="p" rel="prev">No_Implementation_Units</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fImplicit_005fAliasing-1"></a>
<h4 class="unnumberedsubsec">No_Implicit_Aliasing</h4>
<a name="index-No_005fImplicit_005fAliasing"></a>
<p>[GNAT] This restriction, which is not required to be partition-wide consistent,
requires an explicit aliased keyword for an object to which ’Access,
’Unchecked_Access, or ’Address is applied, and forbids entirely the use of
the ’Unrestricted_Access attribute for objects. Note: the reason that
Unrestricted_Access is forbidden is that it would require the prefix
to be aliased, and in such cases, it can always be replaced by
the standard attribute Unchecked_Access which is preferable.
</p>
<hr>
<a name="No_005fObsolescent_005fFeatures"></a>
<div class="header">
<p>
Next: <a href="#No_005fWide_005fCharacters" accesskey="n" rel="next">No_Wide_Characters</a>, Previous: <a href="#No_005fImplicit_005fAliasing" accesskey="p" rel="prev">No_Implicit_Aliasing</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fObsolescent_005fFeatures-1"></a>
<h4 class="unnumberedsubsec">No_Obsolescent_Features</h4>
<a name="index-No_005fObsolescent_005fFeatures"></a>
<p>[RM 13.12.1] This restriction checks at compile time that no obsolescent
features are used, as defined in Annex J of the Ada Reference Manual.
</p>
<hr>
<a name="No_005fWide_005fCharacters"></a>
<div class="header">
<p>
Next: <a href="#SPARK" accesskey="n" rel="next">SPARK</a>, Previous: <a href="#No_005fObsolescent_005fFeatures" accesskey="p" rel="prev">No_Obsolescent_Features</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="No_005fWide_005fCharacters-1"></a>
<h4 class="unnumberedsubsec">No_Wide_Characters</h4>
<a name="index-No_005fWide_005fCharacters"></a>
<p>[GNAT] This restriction ensures at compile time that no uses of the types
<code>Wide_Character</code> or <code>Wide_String</code> or corresponding wide
wide types
appear, and that no wide or wide wide string or character literals
appear in the program (that is literals representing characters not in
type <code>Character</code>).
</p>
<hr>
<a name="SPARK"></a>
<div class="header">
<p>
Next: <a href="#Standard-I_002fO-Packages" accesskey="n" rel="next">Standard I/O Packages</a>, Previous: <a href="#No_005fWide_005fCharacters" accesskey="p" rel="prev">No_Wide_Characters</a>, Up: <a href="#Program-Unit-Level-Restrictions" accesskey="u" rel="up">Program Unit Level Restrictions</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SPARK-1"></a>
<h4 class="unnumberedsubsec">SPARK</h4>
<a name="index-SPARK"></a>
<p>[GNAT] This restriction checks at compile time that some constructs
forbidden in SPARK are not present. The SPARK version used as a
reference is the same as the Ada mode for the unit, so a unit compiled
in Ada 95 mode with SPARK restrictions will be checked for constructs
forbidden in SPARK 95. Error messages related to SPARK restriction have
the form:
</p>
<div class="smallexample">
<pre class="smallexample">violation of restriction "SPARK" at <file>
<error message>
</pre></div>
<p>This is not a replacement for the semantic checks performed by the
SPARK Examiner tool, as the compiler only deals currently with code,
not at all with SPARK annotations and does not guarantee catching all
cases of constructs forbidden by SPARK.
</p>
<p>Thus it may well be the case that code which
passes the compiler in SPARK mode is rejected by the SPARK Examiner,
e.g. due to the different visibility rules of the Examiner based on
SPARK <code>inherit</code> annotations.
</p>
<p>This restriction can be useful in providing an initial filter for
code developed using SPARK, or in examining legacy code to see how far
it is from meeting SPARK restrictions.
</p>
<hr>
<a name="Implementation-Advice"></a>
<div class="header">
<p>
Next: <a href="#Implementation-Defined-Characteristics" accesskey="n" rel="next">Implementation Defined Characteristics</a>, Previous: <a href="#Standard-and-Implementation-Defined-Restrictions" accesskey="p" rel="prev">Standard and Implementation Defined Restrictions</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Implementation-Advice-1"></a>
<h2 class="chapter">4 Implementation Advice</h2>
<p>The main text of the Ada Reference Manual describes the required
behavior of all Ada compilers, and the GNAT compiler conforms to
these requirements.
</p>
<p>In addition, there are sections throughout the Ada Reference Manual headed
by the phrase “Implementation advice”. These sections are not normative,
i.e., they do not specify requirements that all compilers must
follow. Rather they provide advice on generally desirable behavior. You
may wonder why they are not requirements. The most typical answer is
that they describe behavior that seems generally desirable, but cannot
be provided on all systems, or which may be undesirable on some systems.
</p>
<p>As far as practical, GNAT follows the implementation advice sections in
the Ada Reference Manual. This chapter contains a table giving the
reference manual section number, paragraph number and several keywords
for each advice. Each entry consists of the text of the advice followed
by the GNAT interpretation of this advice. Most often, this simply says
“followed”, which means that GNAT follows the advice. However, in a
number of cases, GNAT deliberately deviates from this advice, in which
case the text describes what GNAT does and why.
</p>
<a name="index-Error-detection"></a>
<a name="g_t1_002e1_002e3_002820_0029_003a-Error-Detection"></a>
<h3 class="unnumberedsec">1.1.3(20): Error Detection</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an implementation detects the use of an unsupported Specialized Needs
Annex feature at run time, it should raise <code>Program_Error</code> if
feasible.
</p></td></tr></table>
<p>Not relevant. All specialized needs annex features are either supported,
or diagnosed at compile time.
</p>
<a name="index-Child-Units"></a>
<a name="g_t1_002e1_002e3_002831_0029_003a-Child-Units"></a>
<h3 class="unnumberedsec">1.1.3(31): Child Units</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an implementation wishes to provide implementation-defined
extensions to the functionality of a language-defined library unit, it
should normally do so by adding children to the library unit.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Bounded-errors"></a>
<a name="g_t1_002e1_002e5_002812_0029_003a-Bounded-Errors"></a>
<h3 class="unnumberedsec">1.1.5(12): Bounded Errors</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an implementation detects a bounded error or erroneous
execution, it should raise <code>Program_Error</code>.
</p></td></tr></table>
<p>Followed in all cases in which the implementation detects a bounded
error or erroneous execution. Not all such situations are detected at
runtime.
</p>
<a name="index-Pragmas"></a>
<a name="g_t2_002e8_002816_0029_003a-Pragmas"></a>
<h3 class="unnumberedsec">2.8(16): Pragmas</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Normally, implementation-defined pragmas should have no semantic effect
for error-free programs; that is, if the implementation-defined pragmas
are removed from a working program, the program should still be legal,
and should still have the same semantics.
</p></td></tr></table>
<p>The following implementation defined pragmas are exceptions to this
rule:
</p>
<dl compact="compact">
<dt><code>Abort_Defer</code></dt>
<dd><p>Affects semantics
</p></dd>
<dt><code>Ada_83</code></dt>
<dd><p>Affects legality
</p></dd>
<dt><code>Assert</code></dt>
<dd><p>Affects semantics
</p></dd>
<dt><code>CPP_Class</code></dt>
<dd><p>Affects semantics
</p></dd>
<dt><code>CPP_Constructor</code></dt>
<dd><p>Affects semantics
</p></dd>
<dt><code>Debug</code></dt>
<dd><p>Affects semantics
</p></dd>
<dt><code>Interface_Name</code></dt>
<dd><p>Affects semantics
</p></dd>
<dt><code>Machine_Attribute</code></dt>
<dd><p>Affects semantics
</p></dd>
<dt><code>Unimplemented_Unit</code></dt>
<dd><p>Affects legality
</p></dd>
<dt><code>Unchecked_Union</code></dt>
<dd><p>Affects semantics
</p></dd>
</dl>
<p>In each of the above cases, it is essential to the purpose of the pragma
that this advice not be followed. For details see the separate section
on implementation defined pragmas.
</p>
<a name="g_t2_002e8_002817_002d19_0029_003a-Pragmas"></a>
<h3 class="unnumberedsec">2.8(17-19): Pragmas</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Normally, an implementation should not define pragmas that can
make an illegal program legal, except as follows:
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>A pragma used to complete a declaration, such as a pragma <code>Import</code>;
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>A pragma used to configure the environment by adding, removing, or
replacing <code>library_items</code>.
</p></td></tr></table>
<p>See response to paragraph 16 of this same section.
</p>
<a name="index-Character-Sets"></a>
<a name="index-Alternative-Character-Sets"></a>
<a name="g_t3_002e5_002e2_00285_0029_003a-Alternative-Character-Sets"></a>
<h3 class="unnumberedsec">3.5.2(5): Alternative Character Sets</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an implementation supports a mode with alternative interpretations
for <code>Character</code> and <code>Wide_Character</code>, the set of graphic
characters of <code>Character</code> should nevertheless remain a proper
subset of the set of graphic characters of <code>Wide_Character</code>. Any
character set “localizations” should be reflected in the results of
the subprograms defined in the language-defined package
<code>Characters.Handling</code> (see A.3) available in such a mode. In a mode with
an alternative interpretation of <code>Character</code>, the implementation should
also support a corresponding change in what is a legal
<code>identifier_letter</code>.
</p></td></tr></table>
<p>Not all wide character modes follow this advice, in particular the JIS
and IEC modes reflect standard usage in Japan, and in these encoding,
the upper half of the Latin-1 set is not part of the wide-character
subset, since the most significant bit is used for wide character
encoding. However, this only applies to the external forms. Internally
there is no such restriction.
</p>
<a name="index-Integer-types"></a>
<a name="g_t3_002e5_002e4_002828_0029_003a-Integer-Types"></a>
<h3 class="unnumberedsec">3.5.4(28): Integer Types</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should support <code>Long_Integer</code> in addition to
<code>Integer</code> if the target machine supports 32-bit (or longer)
arithmetic. No other named integer subtypes are recommended for package
<code>Standard</code>. Instead, appropriate named integer subtypes should be
provided in the library package <code>Interfaces</code> (see B.2).
</p></td></tr></table>
<p><code>Long_Integer</code> is supported. Other standard integer types are supported
so this advice is not fully followed. These types
are supported for convenient interface to C, and so that all hardware
types of the machine are easily available.
</p><a name="g_t3_002e5_002e4_002829_0029_003a-Integer-Types"></a>
<h3 class="unnumberedsec">3.5.4(29): Integer Types</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation for a two’s complement machine should support
modular types with a binary modulus up to <code>System.Max_Int*2+2</code>. An
implementation should support a non-binary modules up to <code>Integer'Last</code>.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Enumeration-values"></a>
<a name="g_t3_002e5_002e5_00288_0029_003a-Enumeration-Values"></a>
<h3 class="unnumberedsec">3.5.5(8): Enumeration Values</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>For the evaluation of a call on <code><var>S</var>'Pos</code> for an enumeration
subtype, if the value of the operand does not correspond to the internal
code for any enumeration literal of its type (perhaps due to an
un-initialized variable), then the implementation should raise
<code>Program_Error</code>. This is particularly important for enumeration
types with noncontiguous internal codes specified by an
enumeration_representation_clause.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Float-types"></a>
<a name="g_t3_002e5_002e7_002817_0029_003a-Float-Types"></a>
<h3 class="unnumberedsec">3.5.7(17): Float Types</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should support <code>Long_Float</code> in addition to
<code>Float</code> if the target machine supports 11 or more digits of
precision. No other named floating point subtypes are recommended for
package <code>Standard</code>. Instead, appropriate named floating point subtypes
should be provided in the library package <code>Interfaces</code> (see B.2).
</p></td></tr></table>
<p><code>Short_Float</code> and <code>Long_Long_Float</code> are also provided. The
former provides improved compatibility with other implementations
supporting this type. The latter corresponds to the highest precision
floating-point type supported by the hardware. On most machines, this
will be the same as <code>Long_Float</code>, but on some machines, it will
correspond to the IEEE extended form. The notable case is all ia32
(x86) implementations, where <code>Long_Long_Float</code> corresponds to
the 80-bit extended precision format supported in hardware on this
processor. Note that the 128-bit format on SPARC is not supported,
since this is a software rather than a hardware format.
</p>
<a name="index-Multidimensional-arrays"></a>
<a name="index-Arrays_002c-multidimensional"></a>
<a name="g_t3_002e6_002e2_002811_0029_003a-Multidimensional-Arrays"></a>
<h3 class="unnumberedsec">3.6.2(11): Multidimensional Arrays</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should normally represent multidimensional arrays in
row-major order, consistent with the notation used for multidimensional
array aggregates (see 4.3.3). However, if a pragma <code>Convention</code>
(<code>Fortran</code>, …) applies to a multidimensional array type, then
column-major order should be used instead (see B.5, “Interfacing with
Fortran”).
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Duration_0027Small"></a>
<a name="g_t9_002e6_002830_002d31_0029_003a-Duration_0027Small"></a>
<h3 class="unnumberedsec">9.6(30-31): Duration’Small</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Whenever possible in an implementation, the value of <code>Duration'Small</code>
should be no greater than 100 microseconds.
</p></td></tr></table>
<p>Followed. (<code>Duration'Small</code> = 10**(-9)).
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The time base for <code>delay_relative_statements</code> should be monotonic;
it need not be the same time base as used for <code>Calendar.Clock</code>.
</p></td></tr></table>
<p>Followed.
</p>
<a name="g_t10_002e2_002e1_002812_0029_003a-Consistent-Representation"></a>
<h3 class="unnumberedsec">10.2.1(12): Consistent Representation</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>In an implementation, a type declared in a pre-elaborated package should
have the same representation in every elaboration of a given version of
the package, whether the elaborations occur in distinct executions of
the same program, or in executions of distinct programs or partitions
that include the given version.
</p></td></tr></table>
<p>Followed, except in the case of tagged types. Tagged types involve
implicit pointers to a local copy of a dispatch table, and these pointers
have representations which thus depend on a particular elaboration of the
package. It is not easy to see how it would be possible to follow this
advice without severely impacting efficiency of execution.
</p>
<a name="index-Exception-information"></a>
<a name="g_t11_002e4_002e1_002819_0029_003a-Exception-Information"></a>
<h3 class="unnumberedsec">11.4.1(19): Exception Information</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p><code>Exception_Message</code> by default and <code>Exception_Information</code>
should produce information useful for
debugging. <code>Exception_Message</code> should be short, about one
line. <code>Exception_Information</code> can be long. <code>Exception_Message</code>
should not include the
<code>Exception_Name</code>. <code>Exception_Information</code> should include both
the <code>Exception_Name</code> and the <code>Exception_Message</code>.
</p></td></tr></table>
<p>Followed. For each exception that doesn’t have a specified
<code>Exception_Message</code>, the compiler generates one containing the location
of the raise statement. This location has the form “file:line”, where
file is the short file name (without path information) and line is the line
number in the file. Note that in the case of the Zero Cost Exception
mechanism, these messages become redundant with the Exception_Information that
contains a full backtrace of the calling sequence, so they are disabled.
To disable explicitly the generation of the source location message, use the
Pragma <code>Discard_Names</code>.
</p>
<a name="index-Suppression-of-checks"></a>
<a name="index-Checks_002c-suppression-of"></a>
<a name="g_t11_002e5_002828_0029_003a-Suppression-of-Checks"></a>
<h3 class="unnumberedsec">11.5(28): Suppression of Checks</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The implementation should minimize the code executed for checks that
have been suppressed.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Representation-clauses"></a>
<a name="g_t13_002e1-_002821_002d24_0029_003a-Representation-Clauses"></a>
<h3 class="unnumberedsec">13.1 (21-24): Representation Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for all representation items is
qualified as follows:
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation need not support representation items containing
non-static expressions, except that an implementation should support a
representation item for a given entity if each non-static expression in
the representation item is a name that statically denotes a constant
declared before the entity.
</p></td></tr></table>
<p>Followed. In fact, GNAT goes beyond the recommended level of support
by allowing nonstatic expressions in some representation clauses even
without the need to declare constants initialized with the values of
such expressions.
For example:
</p>
<div class="smallexample">
<pre class="smallexample"> X : Integer;
Y : Float;
for Y'Address use X'Address;>>
</pre></div>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation need not support a specification for the <code>Size</code>
for a given composite subtype, nor the size or storage place for an
object (including a component) of a given composite subtype, unless the
constraints on the subtype and its composite subcomponents (if any) are
all static constraints.
</p></td></tr></table>
<p>Followed. Size Clauses are not permitted on non-static components, as
described above.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An aliased component, or a component whose type is by-reference, should
always be allocated at an addressable location.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Packed-types"></a>
<a name="g_t13_002e2_00286_002d8_0029_003a-Packed-Types"></a>
<h3 class="unnumberedsec">13.2(6-8): Packed Types</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If a type is packed, then the implementation should try to minimize
storage allocated to objects of the type, possibly at the expense of
speed of accessing components, subject to reasonable complexity in
addressing calculations.
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support pragma <code>Pack</code> is:
</p>
<p>For a packed record type, the components should be packed as tightly as
possible subject to the Sizes of the component subtypes, and subject to
any <code>record_representation_clause</code> that applies to the type; the
implementation may, but need not, reorder components or cross aligned
word boundaries to improve the packing. A component whose <code>Size</code> is
greater than the word size may be allocated an integral number of words.
</p></td></tr></table>
<p>Followed. Tight packing of arrays is supported for all component sizes
up to 64-bits. If the array component size is 1 (that is to say, if
the component is a boolean type or an enumeration type with two values)
then values of the type are implicitly initialized to zero. This
happens both for objects of the packed type, and for objects that have a
subcomponent of the packed type.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should support Address clauses for imported
subprograms.
</p></td></tr></table>
<p>Followed.
<a name="index-Address-clauses"></a>
</p><a name="g_t13_002e3_002814_002d19_0029_003a-Address-Clauses"></a>
<h3 class="unnumberedsec">13.3(14-19): Address Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>For an array <var>X</var>, <code><var>X</var>'Address</code> should point at the first
component of the array, and not at the array bounds.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for the <code>Address</code> attribute is:
</p>
<p><code><var>X</var>'Address</code> should produce a useful result if <var>X</var> is an
object that is aliased or of a by-reference type, or is an entity whose
<code>Address</code> has been specified.
</p></td></tr></table>
<p>Followed. A valid address will be produced even if none of those
conditions have been met. If necessary, the object is forced into
memory to ensure the address is valid.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should support <code>Address</code> clauses for imported
subprograms.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Objects (including subcomponents) that are aliased or of a by-reference
type should be allocated on storage element boundaries.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If the <code>Address</code> of an object is specified, or it is imported or exported,
then the implementation should not perform optimizations based on
assumptions of no aliases.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Alignment-clauses"></a>
<a name="g_t13_002e3_002829_002d35_0029_003a-Alignment-Clauses"></a>
<h3 class="unnumberedsec">13.3(29-35): Alignment Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for the <code>Alignment</code> attribute for
subtypes is:
</p>
<p>An implementation should support specified Alignments that are factors
and multiples of the number of storage elements per word, subject to the
following:
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation need not support specified <code>Alignment</code>s for
combinations of <code>Size</code>s and <code>Alignment</code>s that cannot be easily
loaded and stored by available machine instructions.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation need not support specified <code>Alignment</code>s that are
greater than the maximum <code>Alignment</code> the implementation ever returns by
default.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for the <code>Alignment</code> attribute for
objects is:
</p>
<p>Same as above, for subtypes, but in addition:
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>For stand-alone library-level objects of statically constrained
subtypes, the implementation should support all <code>Alignment</code>s
supported by the target linker. For example, page alignment is likely to
be supported for such objects, but not for subtypes.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Size-clauses"></a>
<a name="g_t13_002e3_002842_002d43_0029_003a-Size-Clauses"></a>
<h3 class="unnumberedsec">13.3(42-43): Size Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for the <code>Size</code> attribute of
objects is:
</p>
<p>A <code>Size</code> clause should be supported for an object if the specified
<code>Size</code> is at least as large as its subtype’s <code>Size</code>, and
corresponds to a size in storage elements that is a multiple of the
object’s <code>Alignment</code> (if the <code>Alignment</code> is nonzero).
</p></td></tr></table>
<p>Followed.
</p>
<a name="g_t13_002e3_002850_002d56_0029_003a-Size-Clauses"></a>
<h3 class="unnumberedsec">13.3(50-56): Size Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If the <code>Size</code> of a subtype is specified, and allows for efficient
independent addressability (see 9.10) on the target architecture, then
the <code>Size</code> of the following objects of the subtype should equal the
<code>Size</code> of the subtype:
</p>
<p>Aliased objects (including components).
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><code>Size</code> clause on a composite subtype should not affect the
internal layout of components.
</p></td></tr></table>
<p>Followed. But note that this can be overridden by use of the implementation
pragma Implicit_Packing in the case of packed arrays.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for the <code>Size</code> attribute of subtypes is:
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The <code>Size</code> (if not specified) of a static discrete or fixed point
subtype should be the number of bits needed to represent each value
belonging to the subtype using an unbiased representation, leaving space
for a sign bit only if the subtype contains negative values. If such a
subtype is a first subtype, then an implementation should support a
specified <code>Size</code> for it that reflects this representation.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>For a subtype implemented with levels of indirection, the <code>Size</code>
should include the size of the pointers, but not the size of what they
point at.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Component_005fSize-clauses"></a>
<a name="g_t13_002e3_002871_002d73_0029_003a-Component-Size-Clauses"></a>
<h3 class="unnumberedsec">13.3(71-73): Component Size Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for the <code>Component_Size</code>
attribute is:
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation need not support specified <code>Component_Sizes</code> that are
less than the <code>Size</code> of the component subtype.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should support specified <code>Component_Size</code>s that
are factors and multiples of the word size. For such
<code>Component_Size</code>s, the array should contain no gaps between
components. For other <code>Component_Size</code>s (if supported), the array
should contain no gaps between components when packing is also
specified; the implementation should forbid this combination in cases
where it cannot support a no-gaps representation.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Enumeration-representation-clauses"></a>
<a name="index-Representation-clauses_002c-enumeration"></a>
<a name="g_t13_002e4_00289_002d10_0029_003a-Enumeration-Representation-Clauses"></a>
<h3 class="unnumberedsec">13.4(9-10): Enumeration Representation Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for enumeration representation clauses
is:
</p>
<p>An implementation need not support enumeration representation clauses
for boolean types, but should at minimum support the internal codes in
the range <code>System.Min_Int.System.Max_Int</code>.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Record-representation-clauses"></a>
<a name="index-Representation-clauses_002c-records"></a>
<a name="g_t13_002e5_002e1_002817_002d22_0029_003a-Record-Representation-Clauses"></a>
<h3 class="unnumberedsec">13.5.1(17-22): Record Representation Clauses</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for
<br><code>record_representation_clauses</code> is:
</p>
<p>An implementation should support storage places that can be extracted
with a load, mask, shift sequence of machine code, and set with a load,
shift, mask, store sequence, given the available machine instructions
and run-time model.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>A storage place should be supported if its size is equal to the
<code>Size</code> of the component subtype, and it starts and ends on a
boundary that obeys the <code>Alignment</code> of the component subtype.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If the default bit ordering applies to the declaration of a given type,
then for a component whose subtype’s <code>Size</code> is less than the word
size, any storage place that does not cross an aligned word boundary
should be supported.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation may reserve a storage place for the tag field of a
tagged type, and disallow other components from overlapping that place.
</p></td></tr></table>
<p>Followed. The storage place for the tag field is the beginning of the tagged
record, and its size is Address’Size. GNAT will reject an explicit component
clause for the tag field.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation need not support a <code>component_clause</code> for a
component of an extension part if the storage place is not after the
storage places of all components of the parent type, whether or not
those storage places had been specified.
</p></td></tr></table>
<p>Followed. The above advice on record representation clauses is followed,
and all mentioned features are implemented.
</p>
<a name="index-Storage-place-attributes"></a>
<a name="g_t13_002e5_002e2_00285_0029_003a-Storage-Place-Attributes"></a>
<h3 class="unnumberedsec">13.5.2(5): Storage Place Attributes</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If a component is represented using some form of pointer (such as an
offset) to the actual data of the component, and this data is contiguous
with the rest of the object, then the storage place attributes should
reflect the place of the actual data, not the pointer. If a component is
allocated discontinuously from the rest of the object, then a warning
should be generated upon reference to one of its storage place
attributes.
</p></td></tr></table>
<p>Followed. There are no such components in GNAT.
</p>
<a name="index-Bit-ordering"></a>
<a name="g_t13_002e5_002e3_00287_002d8_0029_003a-Bit-Ordering"></a>
<h3 class="unnumberedsec">13.5.3(7-8): Bit Ordering</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for the non-default bit ordering is:
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If <code>Word_Size</code> = <code>Storage_Unit</code>, then the implementation
should support the non-default bit ordering in addition to the default
bit ordering.
</p></td></tr></table>
<p>Followed. Word size does not equal storage size in this implementation.
Thus non-default bit ordering is not supported.
</p>
<a name="index-Address_002c-as-private-type"></a>
<a name="g_t13_002e7_002837_0029_003a-Address-as-Private"></a>
<h3 class="unnumberedsec">13.7(37): Address as Private</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p><code>Address</code> should be of a private type.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Operations_002c-on-Address"></a>
<a name="index-Address_002c-operations-of"></a>
<a name="g_t13_002e7_002e1_002816_0029_003a-Address-Operations"></a>
<h3 class="unnumberedsec">13.7.1(16): Address Operations</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Operations in <code>System</code> and its children should reflect the target
environment semantics as closely as is reasonable. For example, on most
machines, it makes sense for address arithmetic to “wrap around”.
Operations that do not make sense should raise <code>Program_Error</code>.
</p></td></tr></table>
<p>Followed. Address arithmetic is modular arithmetic that wraps around. No
operation raises <code>Program_Error</code>, since all operations make sense.
</p>
<a name="index-Unchecked-conversion"></a>
<a name="g_t13_002e9_002814_002d17_0029_003a-Unchecked-Conversion"></a>
<h3 class="unnumberedsec">13.9(14-17): Unchecked Conversion</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The <code>Size</code> of an array object should not include its bounds; hence,
the bounds should not be part of the converted data.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The implementation should not generate unnecessary run-time checks to
ensure that the representation of <var>S</var> is a representation of the
target type. It should take advantage of the permission to return by
reference when possible. Restrictions on unchecked conversions should be
avoided unless required by the target environment.
</p></td></tr></table>
<p>Followed. There are no restrictions on unchecked conversion. A warning is
generated if the source and target types do not have the same size since
the semantics in this case may be target dependent.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The recommended level of support for unchecked conversions is:
</p></td></tr></table>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Unchecked conversions should be supported and should be reversible in
the cases where this clause defines the result. To enable meaningful use
of unchecked conversion, a contiguous representation should be used for
elementary subtypes, for statically constrained array subtypes whose
component subtype is one of the subtypes described in this paragraph,
and for record subtypes without discriminants whose component subtypes
are described in this paragraph.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Heap-usage_002c-implicit"></a>
<a name="g_t13_002e11_002823_002d25_0029_003a-Implicit-Heap-Usage"></a>
<h3 class="unnumberedsec">13.11(23-25): Implicit Heap Usage</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should document any cases in which it dynamically
allocates heap storage for a purpose other than the evaluation of an
allocator.
</p></td></tr></table>
<p>Followed, the only other points at which heap storage is dynamically
allocated are as follows:
</p>
<ul>
<li> At initial elaboration time, to allocate dynamically sized global
objects.
</li><li> To allocate space for a task when a task is created.
</li><li> To extend the secondary stack dynamically when needed. The secondary
stack is used for returning variable length results.
</li></ul>
<br>
<table class="cartouche" border="1"><tr><td>
<p>A default (implementation-provided) storage pool for an
access-to-constant type should not have overhead to support deallocation of
individual objects.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>A storage pool for an anonymous access type should be created at the
point of an allocator for the type, and be reclaimed when the designated
object becomes inaccessible.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Unchecked-deallocation"></a>
<a name="g_t13_002e11_002e2_002817_0029_003a-Unchecked-De_002dallocation"></a>
<h3 class="unnumberedsec">13.11.2(17): Unchecked De-allocation</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>For a standard storage pool, <code>Free</code> should actually reclaim the
storage.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Stream-oriented-attributes"></a>
<a name="g_t13_002e13_002e2_002817_0029_003a-Stream-Oriented-Attributes"></a>
<h3 class="unnumberedsec">13.13.2(17): Stream Oriented Attributes</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If a stream element is the same size as a storage element, then the
normal in-memory representation should be used by <code>Read</code> and
<code>Write</code> for scalar objects. Otherwise, <code>Read</code> and <code>Write</code>
should use the smallest number of stream elements needed to represent
all values in the base range of the scalar type.
</p></td></tr></table>
<p>Followed. By default, GNAT uses the interpretation suggested by AI-195,
which specifies using the size of the first subtype.
However, such an implementation is based on direct binary
representations and is therefore target- and endianness-dependent.
To address this issue, GNAT also supplies an alternate implementation
of the stream attributes <code>Read</code> and <code>Write</code>,
which uses the target-independent XDR standard representation
for scalar types.
<a name="index-XDR-representation"></a>
<a name="index-Read-attribute"></a>
<a name="index-Write-attribute"></a>
<a name="index-Stream-oriented-attributes-1"></a>
The XDR implementation is provided as an alternative body of the
<code>System.Stream_Attributes</code> package, in the file
<samp>s-stratt-xdr.adb</samp> in the GNAT library.
There is no <samp>s-stratt-xdr.ads</samp> file.
In order to install the XDR implementation, do the following:
</p><ol>
<li> Replace the default implementation of the
<code>System.Stream_Attributes</code> package with the XDR implementation.
For example on a Unix platform issue the commands:
<div class="smallexample">
<pre class="smallexample">$ mv s-stratt.adb s-stratt-default.adb
$ mv s-stratt-xdr.adb s-stratt.adb
</pre></div>
</li><li> Rebuild the GNAT run-time library as documented in
<a href="gnat_ugn.html#GNAT-and-Libraries">GNAT and Libraries</a> in <cite>GNAT User’s Guide</cite>.
</li></ol>
<a name="A_002e1_002852_0029_003a-Names-of-Predefined-Numeric-Types"></a>
<h3 class="unnumberedsec">A.1(52): Names of Predefined Numeric Types</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an implementation provides additional named predefined integer types,
then the names should end with ‘<samp>Integer</samp>’ as in
‘<samp>Long_Integer</samp>’. If an implementation provides additional named
predefined floating point types, then the names should end with
‘<samp>Float</samp>’ as in ‘<samp>Long_Float</samp>’.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Ada_002eCharacters_002eHandling"></a>
<a name="A_002e3_002e2_002849_0029_003a-Ada_002eCharacters_002eHandling"></a>
<h3 class="unnumberedsec">A.3.2(49): <code>Ada.Characters.Handling</code></h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an implementation provides a localized definition of <code>Character</code>
or <code>Wide_Character</code>, then the effects of the subprograms in
<code>Characters.Handling</code> should reflect the localizations. See also
3.5.2.
</p></td></tr></table>
<p>Followed. GNAT provides no such localized definitions.
</p>
<a name="index-Bounded_002dlength-strings"></a>
<a name="A_002e4_002e4_0028106_0029_003a-Bounded_002dLength-String-Handling"></a>
<h3 class="unnumberedsec">A.4.4(106): Bounded-Length String Handling</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Bounded string objects should not be implemented by implicit pointers
and dynamic allocation.
</p></td></tr></table>
<p>Followed. No implicit pointers or dynamic allocation are used.
</p>
<a name="index-Random-number-generation"></a>
<a name="A_002e5_002e2_002846_002d47_0029_003a-Random-Number-Generation"></a>
<h3 class="unnumberedsec">A.5.2(46-47): Random Number Generation</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Any storage associated with an object of type <code>Generator</code> should be
reclaimed on exit from the scope of the object.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If the generator period is sufficiently long in relation to the number
of distinct initiator values, then each possible value of
<code>Initiator</code> passed to <code>Reset</code> should initiate a sequence of
random numbers that does not, in a practical sense, overlap the sequence
initiated by any other value. If this is not possible, then the mapping
between initiator values and generator states should be a rapidly
varying function of the initiator value.
</p></td></tr></table>
<p>Followed. The generator period is sufficiently long for the first
condition here to hold true.
</p>
<a name="index-Get_005fImmediate-1"></a>
<a name="A_002e10_002e7_002823_0029_003a-Get_005fImmediate"></a>
<h3 class="unnumberedsec">A.10.7(23): <code>Get_Immediate</code></h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The <code>Get_Immediate</code> procedures should be implemented with
unbuffered input. For a device such as a keyboard, input should be
<em>available</em> if a key has already been typed, whereas for a disk
file, input should always be available except at end of file. For a file
associated with a keyboard-like device, any line-editing features of the
underlying operating system should be disabled during the execution of
<code>Get_Immediate</code>.
</p></td></tr></table>
<p>Followed on all targets except VxWorks. For VxWorks, there is no way to
provide this functionality that does not result in the input buffer being
flushed before the <code>Get_Immediate</code> call. A special unit
<code>Interfaces.Vxworks.IO</code> is provided that contains routines to enable
this functionality.
</p>
<a name="index-Export"></a>
<a name="B_002e1_002839_002d41_0029_003a-Pragma-Export"></a>
<h3 class="unnumberedsec">B.1(39-41): Pragma <code>Export</code></h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an implementation supports pragma <code>Export</code> to a given language,
then it should also allow the main subprogram to be written in that
language. It should support some mechanism for invoking the elaboration
of the Ada library units included in the system, and for invoking the
finalization of the environment task. On typical systems, the
recommended mechanism is to provide two subprograms whose link names are
<code>adainit</code> and <code>adafinal</code>. <code>adainit</code> should contain the
elaboration code for library units. <code>adafinal</code> should contain the
finalization code. These subprograms should have no effect the second
and subsequent time they are called.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Automatic elaboration of pre-elaborated packages should be
provided when pragma <code>Export</code> is supported.
</p></td></tr></table>
<p>Followed when the main program is in Ada. If the main program is in a
foreign language, then
<code>adainit</code> must be called to elaborate pre-elaborated
packages.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>For each supported convention <var>L</var> other than <code>Intrinsic</code>, an
implementation should support <code>Import</code> and <code>Export</code> pragmas
for objects of <var>L</var>-compatible types and for subprograms, and pragma
<code>Convention</code> for <var>L</var>-eligible types and for subprograms,
presuming the other language has corresponding features. Pragma
<code>Convention</code> need not be supported for scalar types.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Package-Interfaces"></a>
<a name="index-Interfaces"></a>
<a name="B_002e2_002812_002d13_0029_003a-Package-Interfaces"></a>
<h3 class="unnumberedsec">B.2(12-13): Package <code>Interfaces</code></h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>For each implementation-defined convention identifier, there should be a
child package of package Interfaces with the corresponding name. This
package should contain any declarations that would be useful for
interfacing to the language (implementation) represented by the
convention. Any declarations useful for interfacing to any language on
the given hardware architecture should be provided directly in
<code>Interfaces</code>.
</p></td></tr></table>
<p>Followed. An additional package not defined
in the Ada Reference Manual is <code>Interfaces.CPP</code>, used
for interfacing to C++.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation supporting an interface to C, COBOL, or Fortran should
provide the corresponding package or packages described in the following
clauses.
</p></td></tr></table>
<p>Followed. GNAT provides all the packages described in this section.
</p>
<a name="index-C_002c-interfacing-with"></a>
<a name="B_002e3_002863_002d71_0029_003a-Interfacing-with-C"></a>
<h3 class="unnumberedsec">B.3(63-71): Interfacing with C</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An implementation should support the following interface correspondences
between Ada and C.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada procedure corresponds to a void-returning C function.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada function corresponds to a non-void C function.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada <code>in</code> scalar parameter is passed as a scalar argument to a C
function.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada <code>in</code> parameter of an access-to-object type with designated
type <var>T</var> is passed as a <code><var>t</var>*</code> argument to a C function,
where <var>t</var> is the C type corresponding to the Ada type <var>T</var>.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada access <var>T</var> parameter, or an Ada <code>out</code> or <code>in out</code>
parameter of an elementary type <var>T</var>, is passed as a <code><var>t</var>*</code>
argument to a C function, where <var>t</var> is the C type corresponding to
the Ada type <var>T</var>. In the case of an elementary <code>out</code> or
<code>in out</code> parameter, a pointer to a temporary copy is used to
preserve by-copy semantics.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada parameter of a record type <var>T</var>, of any mode, is passed as a
<code><var>t</var>*</code> argument to a C function, where <var>t</var> is the C
structure corresponding to the Ada type <var>T</var>.
</p></td></tr></table>
<p>Followed. This convention may be overridden by the use of the C_Pass_By_Copy
pragma, or Convention, or by explicitly specifying the mechanism for a given
call using an extended import or export pragma.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada parameter of an array type with component type <var>T</var>, of any
mode, is passed as a <code><var>t</var>*</code> argument to a C function, where
<var>t</var> is the C type corresponding to the Ada type <var>T</var>.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada parameter of an access-to-subprogram type is passed as a pointer
to a C function whose prototype corresponds to the designated
subprogram’s specification.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-COBOL_002c-interfacing-with"></a>
<a name="B_002e4_002895_002d98_0029_003a-Interfacing-with-COBOL"></a>
<h3 class="unnumberedsec">B.4(95-98): Interfacing with COBOL</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada implementation should support the following interface
correspondences between Ada and COBOL.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada access <var>T</var> parameter is passed as a ‘<samp>BY REFERENCE</samp>’ data item of
the COBOL type corresponding to <var>T</var>.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada in scalar parameter is passed as a ‘<samp>BY CONTENT</samp>’ data item of
the corresponding COBOL type.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Any other Ada parameter is passed as a ‘<samp>BY REFERENCE</samp>’ data item of the
COBOL type corresponding to the Ada parameter type; for scalars, a local
copy is used if necessary to ensure by-copy semantics.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Fortran_002c-interfacing-with"></a>
<a name="B_002e5_002822_002d26_0029_003a-Interfacing-with-Fortran"></a>
<h3 class="unnumberedsec">B.5(22-26): Interfacing with Fortran</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada implementation should support the following interface
correspondences between Ada and Fortran:
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada procedure corresponds to a Fortran subroutine.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada function corresponds to a Fortran function.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada parameter of an elementary, array, or record type <var>T</var> is
passed as a <var>T</var> argument to a Fortran procedure, where <var>T</var> is
the Fortran type corresponding to the Ada type <var>T</var>, and where the
INTENT attribute of the corresponding dummy argument matches the Ada
formal parameter mode; the Fortran implementation’s parameter passing
conventions are used. For elementary types, a local copy is used if
necessary to ensure by-copy semantics.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>An Ada parameter of an access-to-subprogram type is passed as a
reference to a Fortran procedure whose interface corresponds to the
designated subprogram’s specification.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Machine-operations"></a>
<a name="C_002e1_00283_002d5_0029_003a-Access-to-Machine-Operations"></a>
<h3 class="unnumberedsec">C.1(3-5): Access to Machine Operations</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The machine code or intrinsic support should allow access to all
operations normally available to assembly language programmers for the
target environment, including privileged instructions, if any.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The interfacing pragmas (see Annex B) should support interface to
assembler; the default assembler should be associated with the
convention identifier <code>Assembler</code>.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If an entity is exported to assembly language, then the implementation
should allocate it at an addressable location, and should ensure that it
is retained by the linking process, even if not otherwise referenced
from the Ada code. The implementation should assume that any call to a
machine code or assembler subprogram is allowed to read or update every
object that is specified as exported.
</p></td></tr></table>
<p>Followed.
</p>
<a name="C_002e1_002810_002d16_0029_003a-Access-to-Machine-Operations"></a>
<h3 class="unnumberedsec">C.1(10-16): Access to Machine Operations</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The implementation should ensure that little or no overhead is
associated with calling intrinsic and machine-code subprograms.
</p></td></tr></table>
<p>Followed for both intrinsics and machine-code subprograms.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>It is recommended that intrinsic subprograms be provided for convenient
access to any machine operations that provide special capabilities or
efficiency and that are not otherwise available through the language
constructs.
</p></td></tr></table>
<p>Followed. A full set of machine operation intrinsic subprograms is provided.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Atomic read-modify-write operations—e.g., test and set, compare and
swap, decrement and test, enqueue/dequeue.
</p></td></tr></table>
<p>Followed on any target supporting such operations.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Standard numeric functions—e.g., sin, log.
</p></td></tr></table>
<p>Followed on any target supporting such operations.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>String manipulation operations—e.g., translate and test.
</p></td></tr></table>
<p>Followed on any target supporting such operations.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Vector operations—e.g., compare vector against thresholds.
</p></td></tr></table>
<p>Followed on any target supporting such operations.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Direct operations on I/O ports.
</p></td></tr></table>
<p>Followed on any target supporting such operations.
</p>
<a name="index-Interrupt-support"></a>
<a name="C_002e3_002828_0029_003a-Interrupt-Support"></a>
<h3 class="unnumberedsec">C.3(28): Interrupt Support</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If the <code>Ceiling_Locking</code> policy is not in effect, the
implementation should provide means for the application to specify which
interrupts are to be blocked during protected actions, if the underlying
system allows for a finer-grain control of interrupt blocking.
</p></td></tr></table>
<p>Followed. The underlying system does not allow for finer-grain control
of interrupt blocking.
</p>
<a name="index-Protected-procedure-handlers"></a>
<a name="C_002e3_002e1_002820_002d21_0029_003a-Protected-Procedure-Handlers"></a>
<h3 class="unnumberedsec">C.3.1(20-21): Protected Procedure Handlers</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Whenever possible, the implementation should allow interrupt handlers to
be called directly by the hardware.
</p></td></tr></table>
<p>Followed on any target where the underlying operating system permits
such direct calls.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Whenever practical, violations of any
implementation-defined restrictions should be detected before run time.
</p></td></tr></table>
<p>Followed. Compile time warnings are given when possible.
</p>
<a name="index-Package-Interrupts"></a>
<a name="index-Interrupts"></a>
<a name="C_002e3_002e2_002825_0029_003a-Package-Interrupts"></a>
<h3 class="unnumberedsec">C.3.2(25): Package <code>Interrupts</code></h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If implementation-defined forms of interrupt handler procedures are
supported, such as protected procedures with parameters, then for each
such form of a handler, a type analogous to <code>Parameterless_Handler</code>
should be specified in a child package of <code>Interrupts</code>, with the
same operations as in the predefined package Interrupts.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Pre_002delaboration-requirements"></a>
<a name="C_002e4_002814_0029_003a-Pre_002delaboration-Requirements"></a>
<h3 class="unnumberedsec">C.4(14): Pre-elaboration Requirements</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>It is recommended that pre-elaborated packages be implemented in such a
way that there should be little or no code executed at run time for the
elaboration of entities not already covered by the Implementation
Requirements.
</p></td></tr></table>
<p>Followed. Executable code is generated in some cases, e.g. loops
to initialize large arrays.
</p>
<a name="C_002e5_00288_0029_003a-Pragma-Discard_005fNames"></a>
<h3 class="unnumberedsec">C.5(8): Pragma <code>Discard_Names</code></h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If the pragma applies to an entity, then the implementation should
reduce the amount of storage used for storing names associated with that
entity.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Package-Task_005fAttributes"></a>
<a name="index-Task_005fAttributes"></a>
<a name="C_002e7_002e2_002830_0029_003a-The-Package-Task_005fAttributes"></a>
<h3 class="unnumberedsec">C.7.2(30): The Package Task_Attributes</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Some implementations are targeted to domains in which memory use at run
time must be completely deterministic. For such implementations, it is
recommended that the storage for task attributes will be pre-allocated
statically and not from the heap. This can be accomplished by either
placing restrictions on the number and the size of the task’s
attributes, or by using the pre-allocated storage for the first <var>N</var>
attribute objects, and the heap for the others. In the latter case,
<var>N</var> should be documented.
</p></td></tr></table>
<p>Not followed. This implementation is not targeted to such a domain.
</p>
<a name="index-Locking-Policies"></a>
<a name="D_002e3_002817_0029_003a-Locking-Policies"></a>
<h3 class="unnumberedsec">D.3(17): Locking Policies</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The implementation should use names that end with ‘<samp>_Locking</samp>’ for
locking policies defined by the implementation.
</p></td></tr></table>
<p>Followed. Two implementation-defined locking policies are defined,
whose names (<code>Inheritance_Locking</code> and
<code>Concurrent_Readers_Locking</code>) follow this suggestion.
</p>
<a name="index-Entry-queuing-policies"></a>
<a name="D_002e4_002816_0029_003a-Entry-Queuing-Policies"></a>
<h3 class="unnumberedsec">D.4(16): Entry Queuing Policies</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Names that end with ‘<samp>_Queuing</samp>’ should be used
for all implementation-defined queuing policies.
</p></td></tr></table>
<p>Followed. No such implementation-defined queuing policies exist.
</p>
<a name="index-Preemptive-abort"></a>
<a name="D_002e6_00289_002d10_0029_003a-Preemptive-Abort"></a>
<h3 class="unnumberedsec">D.6(9-10): Preemptive Abort</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Even though the <code>abort_statement</code> is included in the list of
potentially blocking operations (see 9.5.1), it is recommended that this
statement be implemented in a way that never requires the task executing
the <code>abort_statement</code> to block.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>On a multi-processor, the delay associated with aborting a task on
another processor should be bounded; the implementation should use
periodic polling, if necessary, to achieve this.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Tasking-restrictions"></a>
<a name="D_002e7_002821_0029_003a-Tasking-Restrictions"></a>
<h3 class="unnumberedsec">D.7(21): Tasking Restrictions</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>When feasible, the implementation should take advantage of the specified
restrictions to produce a more efficient implementation.
</p></td></tr></table>
<p>GNAT currently takes advantage of these restrictions by providing an optimized
run time when the Ravenscar profile and the GNAT restricted run time set
of restrictions are specified. See pragma <code>Profile (Ravenscar)</code> and
pragma <code>Profile (Restricted)</code> for more details.
</p>
<a name="index-Time_002c-monotonic"></a>
<a name="D_002e8_002847_002d49_0029_003a-Monotonic-Time"></a>
<h3 class="unnumberedsec">D.8(47-49): Monotonic Time</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>When appropriate, implementations should provide configuration
mechanisms to change the value of <code>Tick</code>.
</p></td></tr></table>
<p>Such configuration mechanisms are not appropriate to this implementation
and are thus not supported.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>It is recommended that <code>Calendar.Clock</code> and <code>Real_Time.Clock</code>
be implemented as transformations of the same time base.
</p></td></tr></table>
<p>Followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>It is recommended that the <em>best</em> time base which exists in
the underlying system be available to the application through
<code>Clock</code>. <em>Best</em> may mean highest accuracy or largest range.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Partition-communication-subsystem"></a>
<a name="index-PCS"></a>
<a name="E_002e5_002828_002d29_0029_003a-Partition-Communication-Subsystem"></a>
<h3 class="unnumberedsec">E.5(28-29): Partition Communication Subsystem</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Whenever possible, the PCS on the called partition should allow for
multiple tasks to call the RPC-receiver with different messages and
should allow them to block until the corresponding subprogram body
returns.
</p></td></tr></table>
<p>Followed by GLADE, a separately supplied PCS that can be used with
GNAT.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The <code>Write</code> operation on a stream of type <code>Params_Stream_Type</code>
should raise <code>Storage_Error</code> if it runs out of space trying to
write the <code>Item</code> into the stream.
</p></td></tr></table>
<p>Followed by GLADE, a separately supplied PCS that can be used with
GNAT.
</p>
<a name="index-COBOL-support"></a>
<a name="F_00287_0029_003a-COBOL-Support"></a>
<h3 class="unnumberedsec">F(7): COBOL Support</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If COBOL (respectively, C) is widely supported in the target
environment, implementations supporting the Information Systems Annex
should provide the child package <code>Interfaces.COBOL</code> (respectively,
<code>Interfaces.C</code>) specified in Annex B and should support a
<code>convention_identifier</code> of COBOL (respectively, C) in the interfacing
pragmas (see Annex B), thus allowing Ada programs to interface with
programs written in that language.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Decimal-radix-support"></a>
<a name="F_002e1_00282_0029_003a-Decimal-Radix-Support"></a>
<h3 class="unnumberedsec">F.1(2): Decimal Radix Support</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Packed decimal should be used as the internal representation for objects
of subtype <var>S</var> when <var>S</var>’Machine_Radix = 10.
</p></td></tr></table>
<p>Not followed. GNAT ignores <var>S</var>’Machine_Radix and always uses binary
representations.
</p>
<a name="index-Numerics"></a>
<a name="G_003a-Numerics"></a>
<h3 class="unnumberedsec">G: Numerics</h3>
<br>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If Fortran (respectively, C) is widely supported in the target
environment, implementations supporting the Numerics Annex
should provide the child package <code>Interfaces.Fortran</code> (respectively,
<code>Interfaces.C</code>) specified in Annex B and should support a
<code>convention_identifier</code> of Fortran (respectively, C) in the interfacing
pragmas (see Annex B), thus allowing Ada programs to interface with
programs written in that language.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Complex-types"></a>
<a name="G_002e1_002e1_002856_002d58_0029_003a-Complex-Types"></a>
<h3 class="unnumberedsec">G.1.1(56-58): Complex Types</h3>
<br>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Because the usual mathematical meaning of multiplication of a complex
operand and a real operand is that of the scaling of both components of
the former by the latter, an implementation should not perform this
operation by first promoting the real operand to complex type and then
performing a full complex multiplication. In systems that, in the
future, support an Ada binding to IEC 559:1989, the latter technique
will not generate the required result when one of the components of the
complex operand is infinite. (Explicit multiplication of the infinite
component by the zero component obtained during promotion yields a NaN
that propagates into the final result.) Analogous advice applies in the
case of multiplication of a complex operand and a pure-imaginary
operand, and in the case of division of a complex operand by a real or
pure-imaginary operand.
</p></td></tr></table>
<p>Not followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Similarly, because the usual mathematical meaning of addition of a
complex operand and a real operand is that the imaginary operand remains
unchanged, an implementation should not perform this operation by first
promoting the real operand to complex type and then performing a full
complex addition. In implementations in which the <code>Signed_Zeros</code>
attribute of the component type is <code>True</code> (and which therefore
conform to IEC 559:1989 in regard to the handling of the sign of zero in
predefined arithmetic operations), the latter technique will not
generate the required result when the imaginary component of the complex
operand is a negatively signed zero. (Explicit addition of the negative
zero to the zero obtained during promotion yields a positive zero.)
Analogous advice applies in the case of addition of a complex operand
and a pure-imaginary operand, and in the case of subtraction of a
complex operand and a real or pure-imaginary operand.
</p></td></tr></table>
<p>Not followed.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Implementations in which <code>Real'Signed_Zeros</code> is <code>True</code> should
attempt to provide a rational treatment of the signs of zero results and
result components. As one example, the result of the <code>Argument</code>
function should have the sign of the imaginary component of the
parameter <code>X</code> when the point represented by that parameter lies on
the positive real axis; as another, the sign of the imaginary component
of the <code>Compose_From_Polar</code> function should be the same as
(respectively, the opposite of) that of the <code>Argument</code> parameter when that
parameter has a value of zero and the <code>Modulus</code> parameter has a
nonnegative (respectively, negative) value.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Complex-elementary-functions"></a>
<a name="G_002e1_002e2_002849_0029_003a-Complex-Elementary-Functions"></a>
<h3 class="unnumberedsec">G.1.2(49): Complex Elementary Functions</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>Implementations in which <code>Complex_Types.Real'Signed_Zeros</code> is
<code>True</code> should attempt to provide a rational treatment of the signs
of zero results and result components. For example, many of the complex
elementary functions have components that are odd functions of one of
the parameter components; in these cases, the result component should
have the sign of the parameter component at the origin. Other complex
elementary functions have zero components whose sign is opposite that of
a parameter component at the origin, or is always positive or always
negative.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Accuracy-requirements"></a>
<a name="G_002e2_002e4_002819_0029_003a-Accuracy-Requirements"></a>
<h3 class="unnumberedsec">G.2.4(19): Accuracy Requirements</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The versions of the forward trigonometric functions without a
<code>Cycle</code> parameter should not be implemented by calling the
corresponding version with a <code>Cycle</code> parameter of
<code>2.0*Numerics.Pi</code>, since this will not provide the required
accuracy in some portions of the domain. For the same reason, the
version of <code>Log</code> without a <code>Base</code> parameter should not be
implemented by calling the corresponding version with a <code>Base</code>
parameter of <code>Numerics.e</code>.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Complex-arithmetic-accuracy"></a>
<a name="index-Accuracy_002c-complex-arithmetic"></a>
<a name="G_002e2_002e6_002815_0029_003a-Complex-Arithmetic-Accuracy"></a>
<h3 class="unnumberedsec">G.2.6(15): Complex Arithmetic Accuracy</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>The version of the <code>Compose_From_Polar</code> function without a
<code>Cycle</code> parameter should not be implemented by calling the
corresponding version with a <code>Cycle</code> parameter of
<code>2.0*Numerics.Pi</code>, since this will not provide the required
accuracy in some portions of the domain.
</p></td></tr></table>
<p>Followed.
</p>
<a name="index-Sequential-elaboration-policy"></a>
<a name="H_002e6_002815_002f2_0029_003a-Pragma-Partition_005fElaboration_005fPolicy"></a>
<h3 class="unnumberedsec">H.6(15/2): Pragma Partition_Elaboration_Policy</h3>
<br>
<table class="cartouche" border="1"><tr><td>
<p>If the partition elaboration policy is <code>Sequential</code> and the
Environment task becomes permanently blocked during elaboration then the
partition is deadlocked and it is recommended that the partition be
immediately terminated.
</p></td></tr></table>
<p>Not followed.
</p>
<hr>
<a name="Implementation-Defined-Characteristics"></a>
<div class="header">
<p>
Next: <a href="#Intrinsic-Subprograms" accesskey="n" rel="next">Intrinsic Subprograms</a>, Previous: <a href="#Implementation-Advice" accesskey="p" rel="prev">Implementation Advice</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Implementation-Defined-Characteristics-1"></a>
<h2 class="chapter">5 Implementation Defined Characteristics</h2>
<p>In addition to the implementation dependent pragmas and attributes, and the
implementation advice, there are a number of other Ada features that are
potentially implementation dependent and are designated as
implementation-defined. These are mentioned throughout the Ada Reference
Manual, and are summarized in Annex M.
</p>
<p>A requirement for conforming Ada compilers is that they provide
documentation describing how the implementation deals with each of these
issues. In this chapter, you will find each point in Annex M listed
followed by a description in italic font of how GNAT
handles the implementation dependence.
</p>
<p>You can use this chapter as a guide to minimizing implementation
dependent features in your programs if portability to other compilers
and other operating systems is an important consideration. The numbers
in each section below correspond to the paragraph number in the Ada
Reference Manual.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>2</strong>. Whether or not each recommendation given in Implementation
Advice is followed. See 1.1.2(37).
</p></td></tr></table>
<p>See <a href="#Implementation-Advice">Implementation Advice</a>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>3</strong>. Capacity limitations of the implementation. See 1.1.3(3).
</p></td></tr></table>
<p>The complexity of programs that can be processed is limited only by the
total amount of available virtual memory, and disk space for the
generated object files.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>4</strong>. Variations from the standard that are impractical to avoid
given the implementation’s execution environment. See 1.1.3(6).
</p></td></tr></table>
<p>There are no variations from the standard.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>5</strong>. Which <code>code_statement</code>s cause external
interactions. See 1.1.3(10).
</p></td></tr></table>
<p>Any <code>code_statement</code> can potentially cause external interactions.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>6</strong>. The coded representation for the text of an Ada
program. See 2.1(4).
</p></td></tr></table>
<p>See separate section on source representation.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>7</strong>. The control functions allowed in comments. See 2.1(14).
</p></td></tr></table>
<p>See separate section on source representation.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>8</strong>. The representation for an end of line. See 2.2(2).
</p></td></tr></table>
<p>See separate section on source representation.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>9</strong>. Maximum supported line length and lexical element
length. See 2.2(15).
</p></td></tr></table>
<p>The maximum line length is 255 characters and the maximum length of
a lexical element is also 255 characters. This is the default setting
if not overridden by the use of compiler switch <samp>-gnaty</samp> (which
sets the maximum to 79) or <samp>-gnatyMnn</samp> which allows the maximum
line length to be specified to be any value up to 32767. The maximum
length of a lexical element is the same as the maximum line length.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>10</strong>. Implementation defined pragmas. See 2.8(14).
</p></td></tr></table>
<p>See <a href="#Implementation-Defined-Pragmas">Implementation Defined Pragmas</a>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>11</strong>. Effect of pragma <code>Optimize</code>. See 2.8(27).
</p></td></tr></table>
<p>Pragma <code>Optimize</code>, if given with a <code>Time</code> or <code>Space</code>
parameter, checks that the optimization flag is set, and aborts if it is
not.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>12</strong>. The sequence of characters of the value returned by
<code><var>S</var>'Image</code> when some of the graphic characters of
<code><var>S</var>'Wide_Image</code> are not defined in <code>Character</code>. See
3.5(37).
</p></td></tr></table>
<p>The sequence of characters is as defined by the wide character encoding
method used for the source. See section on source representation for
further details.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>13</strong>. The predefined integer types declared in
<code>Standard</code>. See 3.5.4(25).
</p></td></tr></table>
<dl compact="compact">
<dt><code>Short_Short_Integer</code></dt>
<dd><p>8 bit signed
</p></dd>
<dt><code>Short_Integer</code></dt>
<dd><p>(Short) 16 bit signed
</p></dd>
<dt><code>Integer</code></dt>
<dd><p>32 bit signed
</p></dd>
<dt><code>Long_Integer</code></dt>
<dd><p>64 bit signed (on most 64 bit targets, depending on the C definition of long).
32 bit signed (all other targets)
</p></dd>
<dt><code>Long_Long_Integer</code></dt>
<dd><p>64 bit signed
</p></dd>
</dl>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>14</strong>. Any nonstandard integer types and the operators defined
for them. See 3.5.4(26).
</p></td></tr></table>
<p>There are no nonstandard integer types.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>15</strong>. Any nonstandard real types and the operators defined for
them. See 3.5.6(8).
</p></td></tr></table>
<p>There are no nonstandard real types.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>16</strong>. What combinations of requested decimal precision and range
are supported for floating point types. See 3.5.7(7).
</p></td></tr></table>
<p>The precision and range is as defined by the IEEE standard.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>17</strong>. The predefined floating point types declared in
<code>Standard</code>. See 3.5.7(16).
</p></td></tr></table>
<dl compact="compact">
<dt><code>Short_Float</code></dt>
<dd><p>32 bit IEEE short
</p></dd>
<dt><code>Float</code></dt>
<dd><p>(Short) 32 bit IEEE short
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p>64 bit IEEE long
</p></dd>
<dt><code>Long_Long_Float</code></dt>
<dd><p>64 bit IEEE long (80 bit IEEE long on x86 processors)
</p></dd>
</dl>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>18</strong>. The small of an ordinary fixed point type. See 3.5.9(8).
</p></td></tr></table>
<p><code>Fine_Delta</code> is 2**(-63)
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>19</strong>. What combinations of small, range, and digits are
supported for fixed point types. See 3.5.9(10).
</p></td></tr></table>
<p>Any combinations are permitted that do not result in a small less than
<code>Fine_Delta</code> and do not result in a mantissa larger than 63 bits.
If the mantissa is larger than 53 bits on machines where Long_Long_Float
is 64 bits (true of all architectures except ia32), then the output from
Text_IO is accurate to only 53 bits, rather than the full mantissa. This
is because floating-point conversions are used to convert fixed point.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>20</strong>. The result of <code>Tags.Expanded_Name</code> for types declared
within an unnamed <code>block_statement</code>. See 3.9(10).
</p></td></tr></table>
<p>Block numbers of the form <code>B<var>nnn</var></code>, where <var>nnn</var> is a
decimal integer are allocated.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>21</strong>. Implementation-defined attributes. See 4.1.4(12).
</p></td></tr></table>
<p>See <a href="#Implementation-Defined-Attributes">Implementation Defined Attributes</a>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>22</strong>. Any implementation-defined time types. See 9.6(6).
</p></td></tr></table>
<p>There are no implementation-defined time types.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>23</strong>. The time base associated with relative delays.
</p></td></tr></table>
<p>See 9.6(20). The time base used is that provided by the C library
function <code>gettimeofday</code>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>24</strong>. The time base of the type <code>Calendar.Time</code>. See
9.6(23).
</p></td></tr></table>
<p>The time base used is that provided by the C library function
<code>gettimeofday</code>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>25</strong>. The time zone used for package <code>Calendar</code>
operations. See 9.6(24).
</p></td></tr></table>
<p>The time zone used by package <code>Calendar</code> is the current system time zone
setting for local time, as accessed by the C library function
<code>localtime</code>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>26</strong>. Any limit on <code>delay_until_statements</code> of
<code>select_statements</code>. See 9.6(29).
</p></td></tr></table>
<p>There are no such limits.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>27</strong>. Whether or not two non-overlapping parts of a composite
object are independently addressable, in the case where packing, record
layout, or <code>Component_Size</code> is specified for the object. See
9.10(1).
</p></td></tr></table>
<p>Separate components are independently addressable if they do not share
overlapping storage units.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>28</strong>. The representation for a compilation. See 10.1(2).
</p></td></tr></table>
<p>A compilation is represented by a sequence of files presented to the
compiler in a single invocation of the <code>gcc</code> command.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>29</strong>. Any restrictions on compilations that contain multiple
compilation_units. See 10.1(4).
</p></td></tr></table>
<p>No single file can contain more than one compilation unit, but any
sequence of files can be presented to the compiler as a single
compilation.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>30</strong>. The mechanisms for creating an environment and for adding
and replacing compilation units. See 10.1.4(3).
</p></td></tr></table>
<p>See separate section on compilation model.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>31</strong>. The manner of explicitly assigning library units to a
partition. See 10.2(2).
</p></td></tr></table>
<p>If a unit contains an Ada main program, then the Ada units for the partition
are determined by recursive application of the rules in the Ada Reference
Manual section 10.2(2-6). In other words, the Ada units will be those that
are needed by the main program, and then this definition of need is applied
recursively to those units, and the partition contains the transitive
closure determined by this relationship. In short, all the necessary units
are included, with no need to explicitly specify the list. If additional
units are required, e.g. by foreign language units, then all units must be
mentioned in the context clause of one of the needed Ada units.
</p>
<p>If the partition contains no main program, or if the main program is in
a language other than Ada, then GNAT
provides the binder options <samp>-z</samp> and <samp>-n</samp> respectively, and in
this case a list of units can be explicitly supplied to the binder for
inclusion in the partition (all units needed by these units will also
be included automatically). For full details on the use of these
options, refer to <a href="gnat_ugn.html#The-GNAT-Make-Program-gnatmake">The GNAT Make Program gnatmake</a> in <cite>GNAT User’s Guide</cite>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>32</strong>. The implementation-defined means, if any, of specifying
which compilation units are needed by a given compilation unit. See
10.2(2).
</p></td></tr></table>
<p>The units needed by a given compilation unit are as defined in
the Ada Reference Manual section 10.2(2-6). There are no
implementation-defined pragmas or other implementation-defined
means for specifying needed units.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>33</strong>. The manner of designating the main subprogram of a
partition. See 10.2(7).
</p></td></tr></table>
<p>The main program is designated by providing the name of the
corresponding <samp>ALI</samp> file as the input parameter to the binder.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>34</strong>. The order of elaboration of <code>library_items</code>. See
10.2(18).
</p></td></tr></table>
<p>The first constraint on ordering is that it meets the requirements of
Chapter 10 of the Ada Reference Manual. This still leaves some
implementation dependent choices, which are resolved by first
elaborating bodies as early as possible (i.e., in preference to specs
where there is a choice), and second by evaluating the immediate with
clauses of a unit to determine the probably best choice, and
third by elaborating in alphabetical order of unit names
where a choice still remains.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>35</strong>. Parameter passing and function return for the main
subprogram. See 10.2(21).
</p></td></tr></table>
<p>The main program has no parameters. It may be a procedure, or a function
returning an integer type. In the latter case, the returned integer
value is the return code of the program (overriding any value that
may have been set by a call to <code>Ada.Command_Line.Set_Exit_Status</code>).
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>36</strong>. The mechanisms for building and running partitions. See
10.2(24).
</p></td></tr></table>
<p>GNAT itself supports programs with only a single partition. The GNATDIST
tool provided with the GLADE package (which also includes an implementation
of the PCS) provides a completely flexible method for building and running
programs consisting of multiple partitions. See the separate GLADE manual
for details.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>37</strong>. The details of program execution, including program
termination. See 10.2(25).
</p></td></tr></table>
<p>See separate section on compilation model.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>38</strong>. The semantics of any non-active partitions supported by the
implementation. See 10.2(28).
</p></td></tr></table>
<p>Passive partitions are supported on targets where shared memory is
provided by the operating system. See the GLADE reference manual for
further details.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>39</strong>. The information returned by <code>Exception_Message</code>. See
11.4.1(10).
</p></td></tr></table>
<p>Exception message returns the null string unless a specific message has
been passed by the program.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>40</strong>. The result of <code>Exceptions.Exception_Name</code> for types
declared within an unnamed <code>block_statement</code>. See 11.4.1(12).
</p></td></tr></table>
<p>Blocks have implementation defined names of the form <code>B<var>nnn</var></code>
where <var>nnn</var> is an integer.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>41</strong>. The information returned by
<code>Exception_Information</code>. See 11.4.1(13).
</p></td></tr></table>
<p><code>Exception_Information</code> returns a string in the following format:
</p>
<div class="smallexample">
<pre class="smallexample"><em>Exception_Name:</em> nnnnn
<em>Message:</em> mmmmm
<em>PID:</em> ppp
<em>Call stack traceback locations:</em>
0xhhhh 0xhhhh 0xhhhh ... 0xhhh
</pre></div>
<p>where
</p>
<ul>
<li> <code>nnnn</code> is the fully qualified name of the exception in all upper
case letters. This line is always present.
</li><li> <code>mmmm</code> is the message (this line present only if message is non-null)
</li><li> <code>ppp</code> is the Process Id value as a decimal integer (this line is
present only if the Process Id is nonzero). Currently we are
not making use of this field.
</li><li> The Call stack traceback locations line and the following values
are present only if at least one traceback location was recorded.
The values are given in C style format, with lower case letters
for a-f, and only as many digits present as are necessary.
</li></ul>
<p>The line terminator sequence at the end of each line, including
the last line is a single <code>LF</code> character (<code>16#0A#</code>).
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>42</strong>. Implementation-defined check names. See 11.5(27).
</p></td></tr></table>
<p>The implementation defined check name Alignment_Check controls checking of
address clause values for proper alignment (that is, the address supplied
must be consistent with the alignment of the type).
</p>
<p>In addition, a user program can add implementation-defined check names
by means of the pragma Check_Name.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>43</strong>. The interpretation of each aspect of representation. See
13.1(20).
</p></td></tr></table>
<p>See separate section on data representations.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>44</strong>. Any restrictions placed upon representation items. See
13.1(20).
</p></td></tr></table>
<p>See separate section on data representations.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>45</strong>. The meaning of <code>Size</code> for indefinite subtypes. See
13.3(48).
</p></td></tr></table>
<p>Size for an indefinite subtype is the maximum possible size, except that
for the case of a subprogram parameter, the size of the parameter object
is the actual size.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>46</strong>. The default external representation for a type tag. See
13.3(75).
</p></td></tr></table>
<p>The default external representation for a type tag is the fully expanded
name of the type in upper case letters.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>47</strong>. What determines whether a compilation unit is the same in
two different partitions. See 13.3(76).
</p></td></tr></table>
<p>A compilation unit is the same in two different partitions if and only
if it derives from the same source file.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>48</strong>. Implementation-defined components. See 13.5.1(15).
</p></td></tr></table>
<p>The only implementation defined component is the tag for a tagged type,
which contains a pointer to the dispatching table.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>49</strong>. If <code>Word_Size</code> = <code>Storage_Unit</code>, the default bit
ordering. See 13.5.3(5).
</p></td></tr></table>
<p><code>Word_Size</code> (32) is not the same as <code>Storage_Unit</code> (8) for this
implementation, so no non-default bit ordering is supported. The default
bit ordering corresponds to the natural endianness of the target architecture.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>50</strong>. The contents of the visible part of package <code>System</code>
and its language-defined children. See 13.7(2).
</p></td></tr></table>
<p>See the definition of these packages in files <samp>system.ads</samp> and
<samp>s-stoele.ads</samp>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>51</strong>. The contents of the visible part of package
<code>System.Machine_Code</code>, and the meaning of
<code>code_statements</code>. See 13.8(7).
</p></td></tr></table>
<p>See the definition and documentation in file <samp>s-maccod.ads</samp>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>52</strong>. The effect of unchecked conversion. See 13.9(11).
</p></td></tr></table>
<p>Unchecked conversion between types of the same size
results in an uninterpreted transmission of the bits from one type
to the other. If the types are of unequal sizes, then in the case of
discrete types, a shorter source is first zero or sign extended as
necessary, and a shorter target is simply truncated on the left.
For all non-discrete types, the source is first copied if necessary
to ensure that the alignment requirements of the target are met, then
a pointer is constructed to the source value, and the result is obtained
by dereferencing this pointer after converting it to be a pointer to the
target type. Unchecked conversions where the target subtype is an
unconstrained array are not permitted. If the target alignment is
greater than the source alignment, then a copy of the result is
made with appropriate alignment
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>53</strong>. The semantics of operations on invalid representations.
See 13.9.2(10-11).
</p></td></tr></table>
<p>For assignments and other operations where the use of invalid values cannot
result in erroneous behavior, the compiler ignores the possibility of invalid
values. An exception is raised at the point where an invalid value would
result in erroneous behavior. For example executing:
</p>
<div class="smallexample">
<pre class="smallexample">procedure invalidvals is
X : Integer := -1;
Y : Natural range 1 .. 10;
for Y'Address use X'Address;
Z : Natural range 1 .. 10;
A : array (Natural range 1 .. 10) of Integer;
begin
Z := Y; -- no exception
A (Z) := 3; -- exception raised;
end;
</pre></div>
<p>As indicated, an exception is raised on the array assignment, but not
on the simple assignment of the invalid negative value from Y to Z.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>53</strong>. The manner of choosing a storage pool for an access type
when <code>Storage_Pool</code> is not specified for the type. See 13.11(17).
</p></td></tr></table>
<p>There are 3 different standard pools used by the compiler when
<code>Storage_Pool</code> is not specified depending whether the type is local
to a subprogram or defined at the library level and whether
<code>Storage_Size</code>is specified or not. See documentation in the runtime
library units <code>System.Pool_Global</code>, <code>System.Pool_Size</code> and
<code>System.Pool_Local</code> in files <samp>s-poosiz.ads</samp>,
<samp>s-pooglo.ads</samp> and <samp>s-pooloc.ads</samp> for full details on the
default pools used.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>54</strong>. Whether or not the implementation provides user-accessible
names for the standard pool type(s). See 13.11(17).
</p></td></tr></table>
<p>See documentation in the sources of the run time mentioned in paragraph
<strong>53</strong> . All these pools are accessible by means of <code>with</code>’ing
these units.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>55</strong>. The meaning of <code>Storage_Size</code>. See 13.11(18).
</p></td></tr></table>
<p><code>Storage_Size</code> is measured in storage units, and refers to the
total space available for an access type collection, or to the primary
stack space for a task.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>56</strong>. Implementation-defined aspects of storage pools. See
13.11(22).
</p></td></tr></table>
<p>See documentation in the sources of the run time mentioned in paragraph
<strong>53</strong> for details on GNAT-defined aspects of storage pools.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>57</strong>. The set of restrictions allowed in a pragma
<code>Restrictions</code>. See 13.12(7).
</p></td></tr></table>
<p>See <a href="#Standard-and-Implementation-Defined-Restrictions">Standard and Implementation Defined Restrictions</a>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>58</strong>. The consequences of violating limitations on
<code>Restrictions</code> pragmas. See 13.12(9).
</p></td></tr></table>
<p>Restrictions that can be checked at compile time result in illegalities
if violated. Currently there are no other consequences of violating
restrictions.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>59</strong>. The representation used by the <code>Read</code> and
<code>Write</code> attributes of elementary types in terms of stream
elements. See 13.13.2(9).
</p></td></tr></table>
<p>The representation is the in-memory representation of the base type of
the type, using the number of bits corresponding to the
<code><var>type</var>'Size</code> value, and the natural ordering of the machine.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>60</strong>. The names and characteristics of the numeric subtypes
declared in the visible part of package <code>Standard</code>. See A.1(3).
</p></td></tr></table>
<p>See items describing the integer and floating-point types supported.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>61</strong>. The accuracy actually achieved by the elementary
functions. See A.5.1(1).
</p></td></tr></table>
<p>The elementary functions correspond to the functions available in the C
library. Only fast math mode is implemented.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>62</strong>. The sign of a zero result from some of the operators or
functions in <code>Numerics.Generic_Elementary_Functions</code>, when
<code>Float_Type'Signed_Zeros</code> is <code>True</code>. See A.5.1(46).
</p></td></tr></table>
<p>The sign of zeroes follows the requirements of the IEEE 754 standard on
floating-point.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>63</strong>. The value of
<code>Numerics.Float_Random.Max_Image_Width</code>. See A.5.2(27).
</p></td></tr></table>
<p>Maximum image width is 6864, see library file <samp>s-rannum.ads</samp>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>64</strong>. The value of
<code>Numerics.Discrete_Random.Max_Image_Width</code>. See A.5.2(27).
</p></td></tr></table>
<p>Maximum image width is 6864, see library file <samp>s-rannum.ads</samp>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>65</strong>. The algorithms for random number generation. See
A.5.2(32).
</p></td></tr></table>
<p>The algorithm is the Mersenne Twister, as documented in the source file
<samp>s-rannum.adb</samp>. This version of the algorithm has a period of
2**19937-1.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>66</strong>. The string representation of a random number generator’s
state. See A.5.2(38).
</p></td></tr></table>
<p>The value returned by the Image function is the concatenation of
the fixed-width decimal representations of the 624 32-bit integers
of the state vector.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>67</strong>. The minimum time interval between calls to the
time-dependent Reset procedure that are guaranteed to initiate different
random number sequences. See A.5.2(45).
</p></td></tr></table>
<p>The minimum period between reset calls to guarantee distinct series of
random numbers is one microsecond.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>68</strong>. The values of the <code>Model_Mantissa</code>,
<code>Model_Emin</code>, <code>Model_Epsilon</code>, <code>Model</code>,
<code>Safe_First</code>, and <code>Safe_Last</code> attributes, if the Numerics
Annex is not supported. See A.5.3(72).
</p></td></tr></table>
<p>Run the compiler with <samp>-gnatS</samp> to produce a listing of package
<code>Standard</code>, has the values of all numeric attributes.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>69</strong>. Any implementation-defined characteristics of the
input-output packages. See A.7(14).
</p></td></tr></table>
<p>There are no special implementation defined characteristics for these
packages.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>70</strong>. The value of <code>Buffer_Size</code> in <code>Storage_IO</code>. See
A.9(10).
</p></td></tr></table>
<p>All type representations are contiguous, and the <code>Buffer_Size</code> is
the value of <code><var>type</var>'Size</code> rounded up to the next storage unit
boundary.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>71</strong>. External files for standard input, standard output, and
standard error See A.10(5).
</p></td></tr></table>
<p>These files are mapped onto the files provided by the C streams
libraries. See source file <samp>i-cstrea.ads</samp> for further details.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>72</strong>. The accuracy of the value produced by <code>Put</code>. See
A.10.9(36).
</p></td></tr></table>
<p>If more digits are requested in the output than are represented by the
precision of the value, zeroes are output in the corresponding least
significant digit positions.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>73</strong>. The meaning of <code>Argument_Count</code>, <code>Argument</code>, and
<code>Command_Name</code>. See A.15(1).
</p></td></tr></table>
<p>These are mapped onto the <code>argv</code> and <code>argc</code> parameters of the
main program in the natural manner.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>74</strong>. The interpretation of the <code>Form</code> parameter in procedure
<code>Create_Directory</code>. See A.16(56).
</p></td></tr></table>
<p>The <code>Form</code> parameter is not used.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>75</strong>. The interpretation of the <code>Form</code> parameter in procedure
<code>Create_Path</code>. See A.16(60).
</p></td></tr></table>
<p>The <code>Form</code> parameter is not used.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>76</strong>. The interpretation of the <code>Form</code> parameter in procedure
<code>Copy_File</code>. See A.16(68).
</p></td></tr></table>
<p>The <code>Form</code> parameter is case-insensitive.
</p>
<p>Two fields are recognized in the <code>Form</code> parameter:
</p>
<dl compact="compact">
<dt><code>preserve=<value></code></dt>
<dt><code>mode=<value></code></dt>
</dl>
<p><value> starts immediately after the character ’=’ and ends with the
character immediately preceding the next comma (’,’) or with the last
character of the parameter.
</p>
<p>The only possible values for preserve= are:
</p>
<dl compact="compact">
<dt><code>no_attributes</code></dt>
<dd><p>Do not try to preserve any file attributes. This is the default if no
preserve= is found in Form.
</p>
</dd>
<dt><code>all_attributes</code></dt>
<dd><p>Try to preserve all file attributes (timestamps, access rights).
</p>
</dd>
<dt><code>timestamps</code></dt>
<dd><p>Preserve the timestamp of the copied file, but not the other file attributes.
</p>
</dd>
</dl>
<p>The only possible values for mode= are:
</p>
<dl compact="compact">
<dt><code>copy</code></dt>
<dd><p>Only do the copy if the destination file does not already exist. If it already
exists, Copy_File fails.
</p>
</dd>
<dt><code>overwrite</code></dt>
<dd><p>Copy the file in all cases. Overwrite an already existing destination file.
</p>
</dd>
<dt><code>append</code></dt>
<dd><p>Append the original file to the destination file. If the destination file does
not exist, the destination file is a copy of the source file. When mode=append,
the field preserve=, if it exists, is not taken into account.
</p>
</dd>
</dl>
<p>If the Form parameter includes one or both of the fields and the value or
values are incorrect, Copy_file fails with Use_Error.
</p>
<p>Examples of correct Forms:
</p>
<div class="smallexample">
<pre class="smallexample">Form => "preserve=no_attributes,mode=overwrite" (the default)
Form => "mode=append"
Form => "mode=copy, preserve=all_attributes"
</pre></div>
<p>Examples of incorrect Forms
</p>
<div class="smallexample">
<pre class="smallexample">Form => "preserve=junk"
Form => "mode=internal, preserve=timestamps"
</pre></div>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>77</strong>. Implementation-defined convention names. See B.1(11).
</p></td></tr></table>
<p>The following convention names are supported
</p>
<dl compact="compact">
<dt><code>Ada</code></dt>
<dd><p>Ada
</p></dd>
<dt><code>Ada_Pass_By_Copy</code></dt>
<dd><p>Allowed for any types except by-reference types such as limited
records. Compatible with convention Ada, but causes any parameters
with this convention to be passed by copy.
</p></dd>
<dt><code>Ada_Pass_By_Reference</code></dt>
<dd><p>Allowed for any types except by-copy types such as scalars.
Compatible with convention Ada, but causes any parameters
with this convention to be passed by reference.
</p></dd>
<dt><code>Assembler</code></dt>
<dd><p>Assembly language
</p></dd>
<dt><code>Asm</code></dt>
<dd><p>Synonym for Assembler
</p></dd>
<dt><code>Assembly</code></dt>
<dd><p>Synonym for Assembler
</p></dd>
<dt><code>C</code></dt>
<dd><p>C
</p></dd>
<dt><code>C_Pass_By_Copy</code></dt>
<dd><p>Allowed only for record types, like C, but also notes that record
is to be passed by copy rather than reference.
</p></dd>
<dt><code>COBOL</code></dt>
<dd><p>COBOL
</p></dd>
<dt><code>C_Plus_Plus (or CPP)</code></dt>
<dd><p>C++
</p></dd>
<dt><code>Default</code></dt>
<dd><p>Treated the same as C
</p></dd>
<dt><code>External</code></dt>
<dd><p>Treated the same as C
</p></dd>
<dt><code>Fortran</code></dt>
<dd><p>Fortran
</p></dd>
<dt><code>Intrinsic</code></dt>
<dd><p>For support of pragma <code>Import</code> with convention Intrinsic, see
separate section on Intrinsic Subprograms.
</p></dd>
<dt><code>Stdcall</code></dt>
<dd><p>Stdcall (used for Windows implementations only). This convention correspond
to the WINAPI (previously called Pascal convention) C/C++ convention under
Windows. A routine with this convention cleans the stack before
exit. This pragma cannot be applied to a dispatching call.
</p></dd>
<dt><code>DLL</code></dt>
<dd><p>Synonym for Stdcall
</p></dd>
<dt><code>Win32</code></dt>
<dd><p>Synonym for Stdcall
</p></dd>
<dt><code>Stubbed</code></dt>
<dd><p>Stubbed is a special convention used to indicate that the body of the
subprogram will be entirely ignored. Any call to the subprogram
is converted into a raise of the <code>Program_Error</code> exception. If a
pragma <code>Import</code> specifies convention <code>stubbed</code> then no body need
be present at all. This convention is useful during development for the
inclusion of subprograms whose body has not yet been written.
</p>
</dd>
</dl>
<p>In addition, all otherwise unrecognized convention names are also
treated as being synonymous with convention C. In all implementations
except for VMS, use of such other names results in a warning. In VMS
implementations, these names are accepted silently.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>78</strong>. The meaning of link names. See B.1(36).
</p></td></tr></table>
<p>Link names are the actual names used by the linker.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>79</strong>. The manner of choosing link names when neither the link
name nor the address of an imported or exported entity is specified. See
B.1(36).
</p></td></tr></table>
<p>The default linker name is that which would be assigned by the relevant
external language, interpreting the Ada name as being in all lower case
letters.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>80</strong>. The effect of pragma <code>Linker_Options</code>. See B.1(37).
</p></td></tr></table>
<p>The string passed to <code>Linker_Options</code> is presented uninterpreted as
an argument to the link command, unless it contains ASCII.NUL characters.
NUL characters if they appear act as argument separators, so for example
</p>
<div class="smallexample">
<pre class="smallexample">pragma Linker_Options ("-labc" & ASCII.NUL & "-ldef");
</pre></div>
<p>causes two separate arguments <code>-labc</code> and <code>-ldef</code> to be passed to the
linker. The order of linker options is preserved for a given unit. The final
list of options passed to the linker is in reverse order of the elaboration
order. For example, linker options for a body always appear before the options
from the corresponding package spec.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>81</strong>. The contents of the visible part of package
<code>Interfaces</code> and its language-defined descendants. See B.2(1).
</p></td></tr></table>
<p>See files with prefix <samp>i-</samp> in the distributed library.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>82</strong>. Implementation-defined children of package
<code>Interfaces</code>. The contents of the visible part of package
<code>Interfaces</code>. See B.2(11).
</p></td></tr></table>
<p>See files with prefix <samp>i-</samp> in the distributed library.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>83</strong>. The types <code>Floating</code>, <code>Long_Floating</code>,
<code>Binary</code>, <code>Long_Binary</code>, <code>Decimal_ Element</code>, and
<code>COBOL_Character</code>; and the initialization of the variables
<code>Ada_To_COBOL</code> and <code>COBOL_To_Ada</code>, in
<code>Interfaces.COBOL</code>. See B.4(50).
</p></td></tr></table>
<dl compact="compact">
<dt><code>Floating</code></dt>
<dd><p>Float
</p></dd>
<dt><code>Long_Floating</code></dt>
<dd><p>(Floating) Long_Float
</p></dd>
<dt><code>Binary</code></dt>
<dd><p>Integer
</p></dd>
<dt><code>Long_Binary</code></dt>
<dd><p>Long_Long_Integer
</p></dd>
<dt><code>Decimal_Element</code></dt>
<dd><p>Character
</p></dd>
<dt><code>COBOL_Character</code></dt>
<dd><p>Character
</p></dd>
</dl>
<p>For initialization, see the file <samp>i-cobol.ads</samp> in the distributed library.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>84</strong>. Support for access to machine instructions. See C.1(1).
</p></td></tr></table>
<p>See documentation in file <samp>s-maccod.ads</samp> in the distributed library.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>85</strong>. Implementation-defined aspects of access to machine
operations. See C.1(9).
</p></td></tr></table>
<p>See documentation in file <samp>s-maccod.ads</samp> in the distributed library.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>86</strong>. Implementation-defined aspects of interrupts. See C.3(2).
</p></td></tr></table>
<p>Interrupts are mapped to signals or conditions as appropriate. See
definition of unit
<code>Ada.Interrupt_Names</code> in source file <samp>a-intnam.ads</samp> for details
on the interrupts supported on a particular target.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>87</strong>. Implementation-defined aspects of pre-elaboration. See
C.4(13).
</p></td></tr></table>
<p>GNAT does not permit a partition to be restarted without reloading,
except under control of the debugger.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>88</strong>. The semantics of pragma <code>Discard_Names</code>. See C.5(7).
</p></td></tr></table>
<p>Pragma <code>Discard_Names</code> causes names of enumeration literals to
be suppressed. In the presence of this pragma, the Image attribute
provides the image of the Pos of the literal, and Value accepts
Pos values.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>89</strong>. The result of the <code>Task_Identification.Image</code>
attribute. See C.7.1(7).
</p></td></tr></table>
<p>The result of this attribute is a string that identifies
the object or component that denotes a given task. If a variable <code>Var</code>
has a task type, the image for this task will have the form <code>Var_<var>XXXXXXXX</var></code>,
where the suffix
is the hexadecimal representation of the virtual address of the corresponding
task control block. If the variable is an array of tasks, the image of each
task will have the form of an indexed component indicating the position of a
given task in the array, e.g. <code>Group(5)_<var>XXXXXXX</var></code>. If the task is a
component of a record, the image of the task will have the form of a selected
component. These rules are fully recursive, so that the image of a task that
is a subcomponent of a composite object corresponds to the expression that
designates this task.
If a task is created by an allocator, its image depends on the context. If the
allocator is part of an object declaration, the rules described above are used
to construct its image, and this image is not affected by subsequent
assignments. If the allocator appears within an expression, the image
includes only the name of the task type.
If the configuration pragma Discard_Names is present, or if the restriction
No_Implicit_Heap_Allocation is in effect, the image reduces to
the numeric suffix, that is to say the hexadecimal representation of the
virtual address of the control block of the task.
</p><br>
<table class="cartouche" border="1"><tr><td>
<p><strong>90</strong>. The value of <code>Current_Task</code> when in a protected entry
or interrupt handler. See C.7.1(17).
</p></td></tr></table>
<p>Protected entries or interrupt handlers can be executed by any
convenient thread, so the value of <code>Current_Task</code> is undefined.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>91</strong>. The effect of calling <code>Current_Task</code> from an entry
body or interrupt handler. See C.7.1(19).
</p></td></tr></table>
<p>The effect of calling <code>Current_Task</code> from an entry body or
interrupt handler is to return the identification of the task currently
executing the code.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>92</strong>. Implementation-defined aspects of
<code>Task_Attributes</code>. See C.7.2(19).
</p></td></tr></table>
<p>There are no implementation-defined aspects of <code>Task_Attributes</code>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>93</strong>. Values of all <code>Metrics</code>. See D(2).
</p></td></tr></table>
<p>The metrics information for GNAT depends on the performance of the
underlying operating system. The sources of the run-time for tasking
implementation, together with the output from <samp>-gnatG</samp> can be
used to determine the exact sequence of operating systems calls made
to implement various tasking constructs. Together with appropriate
information on the performance of the underlying operating system,
on the exact target in use, this information can be used to determine
the required metrics.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>94</strong>. The declarations of <code>Any_Priority</code> and
<code>Priority</code>. See D.1(11).
</p></td></tr></table>
<p>See declarations in file <samp>system.ads</samp>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>95</strong>. Implementation-defined execution resources. See D.1(15).
</p></td></tr></table>
<p>There are no implementation-defined execution resources.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>96</strong>. Whether, on a multiprocessor, a task that is waiting for
access to a protected object keeps its processor busy. See D.2.1(3).
</p></td></tr></table>
<p>On a multi-processor, a task that is waiting for access to a protected
object does not keep its processor busy.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>97</strong>. The affect of implementation defined execution resources
on task dispatching. See D.2.1(9).
</p></td></tr></table>
<p>Tasks map to threads in the threads package used by GNAT. Where possible
and appropriate, these threads correspond to native threads of the
underlying operating system.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>98</strong>. Implementation-defined <code>policy_identifiers</code> allowed
in a pragma <code>Task_Dispatching_Policy</code>. See D.2.2(3).
</p></td></tr></table>
<p>There are no implementation-defined policy-identifiers allowed in this
pragma.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>99</strong>. Implementation-defined aspects of priority inversion. See
D.2.2(16).
</p></td></tr></table>
<p>Execution of a task cannot be preempted by the implementation processing
of delay expirations for lower priority tasks.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>100</strong>. Implementation-defined task dispatching. See D.2.2(18).
</p></td></tr></table>
<p>The policy is the same as that of the underlying threads implementation.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>101</strong>. Implementation-defined <code>policy_identifiers</code> allowed
in a pragma <code>Locking_Policy</code>. See D.3(4).
</p></td></tr></table>
<p>The two implementation defined policies permitted in GNAT are
<code>Inheritance_Locking</code> and <code>Conccurent_Readers_Locking</code>. On
targets that support the <code>Inheritance_Locking</code> policy, locking is
implemented by inheritance, i.e. the task owning the lock operates
at a priority equal to the highest priority of any task currently
requesting the lock. On targets that support the
<code>Conccurent_Readers_Locking</code> policy, locking is implemented with a
read/write lock allowing multiple propected object functions to enter
concurrently.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>102</strong>. Default ceiling priorities. See D.3(10).
</p></td></tr></table>
<p>The ceiling priority of protected objects of the type
<code>System.Interrupt_Priority'Last</code> as described in the Ada
Reference Manual D.3(10),
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>103</strong>. The ceiling of any protected object used internally by
the implementation. See D.3(16).
</p></td></tr></table>
<p>The ceiling priority of internal protected objects is
<code>System.Priority'Last</code>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>104</strong>. Implementation-defined queuing policies. See D.4(1).
</p></td></tr></table>
<p>There are no implementation-defined queuing policies.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>105</strong>. On a multiprocessor, any conditions that cause the
completion of an aborted construct to be delayed later than what is
specified for a single processor. See D.6(3).
</p></td></tr></table>
<p>The semantics for abort on a multi-processor is the same as on a single
processor, there are no further delays.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>106</strong>. Any operations that implicitly require heap storage
allocation. See D.7(8).
</p></td></tr></table>
<p>The only operation that implicitly requires heap storage allocation is
task creation.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>107</strong>. Implementation-defined aspects of pragma
<code>Restrictions</code>. See D.7(20).
</p></td></tr></table>
<p>There are no such implementation-defined aspects.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>108</strong>. Implementation-defined aspects of package
<code>Real_Time</code>. See D.8(17).
</p></td></tr></table>
<p>There are no implementation defined aspects of package <code>Real_Time</code>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>109</strong>. Implementation-defined aspects of
<code>delay_statements</code>. See D.9(8).
</p></td></tr></table>
<p>Any difference greater than one microsecond will cause the task to be
delayed (see D.9(7)).
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>110</strong>. The upper bound on the duration of interrupt blocking
caused by the implementation. See D.12(5).
</p></td></tr></table>
<p>The upper bound is determined by the underlying operating system. In
no cases is it more than 10 milliseconds.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>111</strong>. The means for creating and executing distributed
programs. See E(5).
</p></td></tr></table>
<p>The GLADE package provides a utility GNATDIST for creating and executing
distributed programs. See the GLADE reference manual for further details.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>112</strong>. Any events that can result in a partition becoming
inaccessible. See E.1(7).
</p></td></tr></table>
<p>See the GLADE reference manual for full details on such events.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>113</strong>. The scheduling policies, treatment of priorities, and
management of shared resources between partitions in certain cases. See
E.1(11).
</p></td></tr></table>
<p>See the GLADE reference manual for full details on these aspects of
multi-partition execution.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>114</strong>. Events that cause the version of a compilation unit to
change. See E.3(5).
</p></td></tr></table>
<p>Editing the source file of a compilation unit, or the source files of
any units on which it is dependent in a significant way cause the version
to change. No other actions cause the version number to change. All changes
are significant except those which affect only layout, capitalization or
comments.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>115</strong>. Whether the execution of the remote subprogram is
immediately aborted as a result of cancellation. See E.4(13).
</p></td></tr></table>
<p>See the GLADE reference manual for details on the effect of abort in
a distributed application.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>116</strong>. Implementation-defined aspects of the PCS. See E.5(25).
</p></td></tr></table>
<p>See the GLADE reference manual for a full description of all implementation
defined aspects of the PCS.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>117</strong>. Implementation-defined interfaces in the PCS. See
E.5(26).
</p></td></tr></table>
<p>See the GLADE reference manual for a full description of all
implementation defined interfaces.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>118</strong>. The values of named numbers in the package
<code>Decimal</code>. See F.2(7).
</p></td></tr></table>
<dl compact="compact">
<dt><code>Max_Scale</code></dt>
<dd><p>+18
</p></dd>
<dt><code>Min_Scale</code></dt>
<dd><p>-18
</p></dd>
<dt><code>Min_Delta</code></dt>
<dd><p>1.0E-18
</p></dd>
<dt><code>Max_Delta</code></dt>
<dd><p>1.0E+18
</p></dd>
<dt><code>Max_Decimal_Digits</code></dt>
<dd><p>18
</p></dd>
</dl>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>119</strong>. The value of <code>Max_Picture_Length</code> in the package
<code>Text_IO.Editing</code>. See F.3.3(16).
</p></td></tr></table>
<p>64
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>120</strong>. The value of <code>Max_Picture_Length</code> in the package
<code>Wide_Text_IO.Editing</code>. See F.3.4(5).
</p></td></tr></table>
<p>64
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>121</strong>. The accuracy actually achieved by the complex elementary
functions and by other complex arithmetic operations. See G.1(1).
</p></td></tr></table>
<p>Standard library functions are used for the complex arithmetic
operations. Only fast math mode is currently supported.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>122</strong>. The sign of a zero result (or a component thereof) from
any operator or function in <code>Numerics.Generic_Complex_Types</code>, when
<code>Real'Signed_Zeros</code> is True. See G.1.1(53).
</p></td></tr></table>
<p>The signs of zero values are as recommended by the relevant
implementation advice.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>123</strong>. The sign of a zero result (or a component thereof) from
any operator or function in
<code>Numerics.Generic_Complex_Elementary_Functions</code>, when
<code>Real'Signed_Zeros</code> is <code>True</code>. See G.1.2(45).
</p></td></tr></table>
<p>The signs of zero values are as recommended by the relevant
implementation advice.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>124</strong>. Whether the strict mode or the relaxed mode is the
default. See G.2(2).
</p></td></tr></table>
<p>The strict mode is the default. There is no separate relaxed mode. GNAT
provides a highly efficient implementation of strict mode.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>125</strong>. The result interval in certain cases of fixed-to-float
conversion. See G.2.1(10).
</p></td></tr></table>
<p>For cases where the result interval is implementation dependent, the
accuracy is that provided by performing all operations in 64-bit IEEE
floating-point format.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>126</strong>. The result of a floating point arithmetic operation in
overflow situations, when the <code>Machine_Overflows</code> attribute of the
result type is <code>False</code>. See G.2.1(13).
</p></td></tr></table>
<p>Infinite and NaN values are produced as dictated by the IEEE
floating-point standard.
</p>
<p>Note that on machines that are not fully compliant with the IEEE
floating-point standard, such as Alpha, the <samp>-mieee</samp> compiler flag
must be used for achieving IEEE conforming behavior (although at the cost
of a significant performance penalty), so infinite and NaN values are
properly generated.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>127</strong>. The result interval for division (or exponentiation by a
negative exponent), when the floating point hardware implements division
as multiplication by a reciprocal. See G.2.1(16).
</p></td></tr></table>
<p>Not relevant, division is IEEE exact.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>128</strong>. The definition of close result set, which determines the
accuracy of certain fixed point multiplications and divisions. See
G.2.3(5).
</p></td></tr></table>
<p>Operations in the close result set are performed using IEEE long format
floating-point arithmetic. The input operands are converted to
floating-point, the operation is done in floating-point, and the result
is converted to the target type.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>129</strong>. Conditions on a <code>universal_real</code> operand of a fixed
point multiplication or division for which the result shall be in the
perfect result set. See G.2.3(22).
</p></td></tr></table>
<p>The result is only defined to be in the perfect result set if the result
can be computed by a single scaling operation involving a scale factor
representable in 64-bits.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>130</strong>. The result of a fixed point arithmetic operation in
overflow situations, when the <code>Machine_Overflows</code> attribute of the
result type is <code>False</code>. See G.2.3(27).
</p></td></tr></table>
<p>Not relevant, <code>Machine_Overflows</code> is <code>True</code> for fixed-point
types.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>131</strong>. The result of an elementary function reference in
overflow situations, when the <code>Machine_Overflows</code> attribute of the
result type is <code>False</code>. See G.2.4(4).
</p></td></tr></table>
<p>IEEE infinite and Nan values are produced as appropriate.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>132</strong>. The value of the angle threshold, within which certain
elementary functions, complex arithmetic operations, and complex
elementary functions yield results conforming to a maximum relative
error bound. See G.2.4(10).
</p></td></tr></table>
<p>Information on this subject is not yet available.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>133</strong>. The accuracy of certain elementary functions for
parameters beyond the angle threshold. See G.2.4(10).
</p></td></tr></table>
<p>Information on this subject is not yet available.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>134</strong>. The result of a complex arithmetic operation or complex
elementary function reference in overflow situations, when the
<code>Machine_Overflows</code> attribute of the corresponding real type is
<code>False</code>. See G.2.6(5).
</p></td></tr></table>
<p>IEEE infinite and Nan values are produced as appropriate.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>135</strong>. The accuracy of certain complex arithmetic operations and
certain complex elementary functions for parameters (or components
thereof) beyond the angle threshold. See G.2.6(8).
</p></td></tr></table>
<p>Information on those subjects is not yet available.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>136</strong>. Information regarding bounded errors and erroneous
execution. See H.2(1).
</p></td></tr></table>
<p>Information on this subject is not yet available.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>137</strong>. Implementation-defined aspects of pragma
<code>Inspection_Point</code>. See H.3.2(8).
</p></td></tr></table>
<p>Pragma <code>Inspection_Point</code> ensures that the variable is live and can
be examined by the debugger at the inspection point.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>138</strong>. Implementation-defined aspects of pragma
<code>Restrictions</code>. See H.4(25).
</p></td></tr></table>
<p>There are no implementation-defined aspects of pragma <code>Restrictions</code>. The
use of pragma <code>Restrictions [No_Exceptions]</code> has no effect on the
generated code. Checks must suppressed by use of pragma <code>Suppress</code>.
</p>
<br>
<table class="cartouche" border="1"><tr><td>
<p><strong>139</strong>. Any restrictions on pragma <code>Restrictions</code>. See
H.4(27).
</p></td></tr></table>
<p>There are no restrictions on pragma <code>Restrictions</code>.
</p>
<hr>
<a name="Intrinsic-Subprograms"></a>
<div class="header">
<p>
Next: <a href="#Representation-Clauses-and-Pragmas" accesskey="n" rel="next">Representation Clauses and Pragmas</a>, Previous: <a href="#Implementation-Defined-Characteristics" accesskey="p" rel="prev">Implementation Defined Characteristics</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Intrinsic-Subprograms-1"></a>
<h2 class="chapter">6 Intrinsic Subprograms</h2>
<a name="index-Intrinsic-Subprograms"></a>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Intrinsic-Operators" accesskey="1">Intrinsic Operators</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enclosing_005fEntity" accesskey="2">Enclosing_Entity</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Exception_005fInformation" accesskey="3">Exception_Information</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Exception_005fMessage" accesskey="4">Exception_Message</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Exception_005fName" accesskey="5">Exception_Name</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#File" accesskey="6">File</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Line" accesskey="7">Line</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Shifts-and-Rotates" accesskey="8">Shifts and Rotates</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Source_005fLocation" accesskey="9">Source_Location</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<p>GNAT allows a user application program to write the declaration:
</p>
<div class="smallexample">
<pre class="smallexample"> pragma Import (Intrinsic, name);
</pre></div>
<p>providing that the name corresponds to one of the implemented intrinsic
subprograms in GNAT, and that the parameter profile of the referenced
subprogram meets the requirements. This chapter describes the set of
implemented intrinsic subprograms, and the requirements on parameter profiles.
Note that no body is supplied; as with other uses of pragma Import, the
body is supplied elsewhere (in this case by the compiler itself). Note
that any use of this feature is potentially non-portable, since the
Ada standard does not require Ada compilers to implement this feature.
</p>
<hr>
<a name="Intrinsic-Operators"></a>
<div class="header">
<p>
Next: <a href="#Enclosing_005fEntity" accesskey="n" rel="next">Enclosing_Entity</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Intrinsic-Operators-1"></a>
<h3 class="section">6.1 Intrinsic Operators</h3>
<a name="index-Intrinsic-operator"></a>
<p>All the predefined numeric operators in package Standard
in <code>pragma Import (Intrinsic,..)</code>
declarations. In the binary operator case, the operands must have the same
size. The operand or operands must also be appropriate for
the operator. For example, for addition, the operands must
both be floating-point or both be fixed-point, and the
right operand for <code>"**"</code> must have a root type of
<code>Standard.Integer'Base</code>.
You can use an intrinsic operator declaration as in the following example:
</p>
<div class="smallexample">
<pre class="smallexample"> type Int1 is new Integer;
type Int2 is new Integer;
function "+" (X1 : Int1; X2 : Int2) return Int1;
function "+" (X1 : Int1; X2 : Int2) return Int2;
pragma Import (Intrinsic, "+");
</pre></div>
<p>This declaration would permit “mixed mode” arithmetic on items
of the differing types <code>Int1</code> and <code>Int2</code>.
It is also possible to specify such operators for private types, if the
full views are appropriate arithmetic types.
</p>
<hr>
<a name="Enclosing_005fEntity"></a>
<div class="header">
<p>
Next: <a href="#Exception_005fInformation" accesskey="n" rel="next">Exception_Information</a>, Previous: <a href="#Intrinsic-Operators" accesskey="p" rel="prev">Intrinsic Operators</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Enclosing_005fEntity-1"></a>
<h3 class="section">6.2 Enclosing_Entity</h3>
<a name="index-Enclosing_005fEntity"></a>
<p>This intrinsic subprogram is used in the implementation of the
library routine <code>GNAT.Source_Info</code>. The only useful use of the
intrinsic import in this case is the one in this unit, so an
application program should simply call the function
<code>GNAT.Source_Info.Enclosing_Entity</code> to obtain the name of
the current subprogram, package, task, entry, or protected subprogram.
</p>
<hr>
<a name="Exception_005fInformation"></a>
<div class="header">
<p>
Next: <a href="#Exception_005fMessage" accesskey="n" rel="next">Exception_Message</a>, Previous: <a href="#Enclosing_005fEntity" accesskey="p" rel="prev">Enclosing_Entity</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Exception_005fInformation-1"></a>
<h3 class="section">6.3 Exception_Information</h3>
<a name="index-Exception_005fInformation_0027"></a>
<p>This intrinsic subprogram is used in the implementation of the
library routine <code>GNAT.Current_Exception</code>. The only useful
use of the intrinsic import in this case is the one in this unit,
so an application program should simply call the function
<code>GNAT.Current_Exception.Exception_Information</code> to obtain
the exception information associated with the current exception.
</p>
<hr>
<a name="Exception_005fMessage"></a>
<div class="header">
<p>
Next: <a href="#Exception_005fName" accesskey="n" rel="next">Exception_Name</a>, Previous: <a href="#Exception_005fInformation" accesskey="p" rel="prev">Exception_Information</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Exception_005fMessage-1"></a>
<h3 class="section">6.4 Exception_Message</h3>
<a name="index-Exception_005fMessage"></a>
<p>This intrinsic subprogram is used in the implementation of the
library routine <code>GNAT.Current_Exception</code>. The only useful
use of the intrinsic import in this case is the one in this unit,
so an application program should simply call the function
<code>GNAT.Current_Exception.Exception_Message</code> to obtain
the message associated with the current exception.
</p>
<hr>
<a name="Exception_005fName"></a>
<div class="header">
<p>
Next: <a href="#File" accesskey="n" rel="next">File</a>, Previous: <a href="#Exception_005fMessage" accesskey="p" rel="prev">Exception_Message</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Exception_005fName-1"></a>
<h3 class="section">6.5 Exception_Name</h3>
<a name="index-Exception_005fName"></a>
<p>This intrinsic subprogram is used in the implementation of the
library routine <code>GNAT.Current_Exception</code>. The only useful
use of the intrinsic import in this case is the one in this unit,
so an application program should simply call the function
<code>GNAT.Current_Exception.Exception_Name</code> to obtain
the name of the current exception.
</p>
<hr>
<a name="File"></a>
<div class="header">
<p>
Next: <a href="#Line" accesskey="n" rel="next">Line</a>, Previous: <a href="#Exception_005fName" accesskey="p" rel="prev">Exception_Name</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="File-1"></a>
<h3 class="section">6.6 File</h3>
<a name="index-File"></a>
<p>This intrinsic subprogram is used in the implementation of the
library routine <code>GNAT.Source_Info</code>. The only useful use of the
intrinsic import in this case is the one in this unit, so an
application program should simply call the function
<code>GNAT.Source_Info.File</code> to obtain the name of the current
file.
</p>
<hr>
<a name="Line"></a>
<div class="header">
<p>
Next: <a href="#Shifts-and-Rotates" accesskey="n" rel="next">Shifts and Rotates</a>, Previous: <a href="#File" accesskey="p" rel="prev">File</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Line-1"></a>
<h3 class="section">6.7 Line</h3>
<a name="index-Line"></a>
<p>This intrinsic subprogram is used in the implementation of the
library routine <code>GNAT.Source_Info</code>. The only useful use of the
intrinsic import in this case is the one in this unit, so an
application program should simply call the function
<code>GNAT.Source_Info.Line</code> to obtain the number of the current
source line.
</p>
<hr>
<a name="Shifts-and-Rotates"></a>
<div class="header">
<p>
Next: <a href="#Source_005fLocation" accesskey="n" rel="next">Source_Location</a>, Previous: <a href="#Line" accesskey="p" rel="prev">Line</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Shifts-and-Rotates-1"></a>
<h3 class="section">6.8 Shifts and Rotates</h3>
<a name="index-Shift_005fLeft"></a>
<a name="index-Shift_005fRight"></a>
<a name="index-Shift_005fRight_005fArithmetic"></a>
<a name="index-Rotate_005fLeft"></a>
<a name="index-Rotate_005fRight"></a>
<p>In standard Ada, the shift and rotate functions are available only
for the predefined modular types in package <code>Interfaces</code>. However, in
GNAT it is possible to define these functions for any integer
type (signed or modular), as in this example:
</p>
<div class="smallexample">
<pre class="smallexample"> function Shift_Left
(Value : T;
Amount : Natural)
return T;
</pre></div>
<p>The function name must be one of
Shift_Left, Shift_Right, Shift_Right_Arithmetic, Rotate_Left, or
Rotate_Right. T must be an integer type. T’Size must be
8, 16, 32 or 64 bits; if T is modular, the modulus
must be 2**8, 2**16, 2**32 or 2**64.
The result type must be the same as the type of <code>Value</code>.
The shift amount must be Natural.
The formal parameter names can be anything.
</p>
<hr>
<a name="Source_005fLocation"></a>
<div class="header">
<p>
Previous: <a href="#Shifts-and-Rotates" accesskey="p" rel="prev">Shifts and Rotates</a>, Up: <a href="#Intrinsic-Subprograms" accesskey="u" rel="up">Intrinsic Subprograms</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Source_005fLocation-1"></a>
<h3 class="section">6.9 Source_Location</h3>
<a name="index-Source_005fLocation"></a>
<p>This intrinsic subprogram is used in the implementation of the
library routine <code>GNAT.Source_Info</code>. The only useful use of the
intrinsic import in this case is the one in this unit, so an
application program should simply call the function
<code>GNAT.Source_Info.Source_Location</code> to obtain the current
source file location.
</p>
<hr>
<a name="Representation-Clauses-and-Pragmas"></a>
<div class="header">
<p>
Next: <a href="#Standard-Library-Routines" accesskey="n" rel="next">Standard Library Routines</a>, Previous: <a href="#Intrinsic-Subprograms" accesskey="p" rel="prev">Intrinsic Subprograms</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Representation-Clauses-and-Pragmas-1"></a>
<h2 class="chapter">7 Representation Clauses and Pragmas</h2>
<a name="index-Representation-Clauses"></a>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Alignment-Clauses" accesskey="1">Alignment Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Size-Clauses" accesskey="2">Size Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Storage_005fSize-Clauses" accesskey="3">Storage_Size Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Size-of-Variant-Record-Objects" accesskey="4">Size of Variant Record Objects</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Biased-Representation" accesskey="5">Biased Representation </a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Value_005fSize-and-Object_005fSize-Clauses" accesskey="6">Value_Size and Object_Size Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Component_005fSize-Clauses" accesskey="7">Component_Size Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Bit_005fOrder-Clauses" accesskey="8">Bit_Order Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Effect-of-Bit_005fOrder-on-Byte-Ordering" accesskey="9">Effect of Bit_Order on Byte Ordering</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Pack-for-Arrays">Pragma Pack for Arrays</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Pragma-Pack-for-Records">Pragma Pack for Records</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Record-Representation-Clauses">Record Representation Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Enumeration-Clauses">Enumeration Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Address-Clauses">Address Clauses</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Effect-of-Convention-on-Representation">Effect of Convention on Representation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Determining-the-Representations-chosen-by-GNAT">Determining the Representations chosen by GNAT</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<a name="index-Representation-Clause"></a>
<a name="index-Representation-Pragma"></a>
<a name="index-Pragma_002c-representation"></a>
<p>This section describes the representation clauses accepted by GNAT, and
their effect on the representation of corresponding data objects.
</p>
<p>GNAT fully implements Annex C (Systems Programming). This means that all
the implementation advice sections in chapter 13 are fully implemented.
However, these sections only require a minimal level of support for
representation clauses. GNAT provides much more extensive capabilities,
and this section describes the additional capabilities provided.
</p>
<hr>
<a name="Alignment-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Size-Clauses" accesskey="n" rel="next">Size Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Alignment-Clauses-1"></a>
<h3 class="section">7.1 Alignment Clauses</h3>
<a name="index-Alignment-Clause"></a>
<p>GNAT requires that all alignment clauses specify a power of 2, and all
default alignments are always a power of 2. The default alignment
values are as follows:
</p>
<ul>
<li> <em>Primitive Types</em>.
For primitive types, the alignment is the minimum of the actual size of
objects of the type divided by <code>Storage_Unit</code>,
and the maximum alignment supported by the target.
(This maximum alignment is given by the GNAT-specific attribute
<code>Standard'Maximum_Alignment</code>; see <a href="#Maximum_005fAlignment">Maximum_Alignment</a>.)
<a name="index-Maximum_005fAlignment-attribute"></a>
For example, for type <code>Long_Float</code>, the object size is 8 bytes, and the
default alignment will be 8 on any target that supports alignments
this large, but on some targets, the maximum alignment may be smaller
than 8, in which case objects of type <code>Long_Float</code> will be maximally
aligned.
</li><li> <em>Arrays</em>.
For arrays, the alignment is equal to the alignment of the component type
for the normal case where no packing or component size is given. If the
array is packed, and the packing is effective (see separate section on
packed arrays), then the alignment will be one for long packed arrays,
or arrays whose length is not known at compile time. For short packed
arrays, which are handled internally as modular types, the alignment
will be as described for primitive types, e.g. a packed array of length
31 bits will have an object size of four bytes, and an alignment of 4.
</li><li> <em>Records</em>.
For the normal non-packed case, the alignment of a record is equal to
the maximum alignment of any of its components. For tagged records, this
includes the implicit access type used for the tag. If a pragma <code>Pack</code>
is used and all components are packable (see separate section on pragma
<code>Pack</code>), then the resulting alignment is 1, unless the layout of the
record makes it profitable to increase it.
<p>A special case is when:
</p><ul>
<li> the size of the record is given explicitly, or a
full record representation clause is given, and
</li><li> the size of the record is 2, 4, or 8 bytes.
</li></ul>
<p>In this case, an alignment is chosen to match the
size of the record. For example, if we have:
</p>
<div class="smallexample">
<pre class="smallexample"> type Small is record
A, B : Character;
end record;
for Small'Size use 16;
</pre></div>
<p>then the default alignment of the record type <code>Small</code> is 2, not 1. This
leads to more efficient code when the record is treated as a unit, and also
allows the type to specified as <code>Atomic</code> on architectures requiring
strict alignment.
</p>
</li></ul>
<p>An alignment clause may specify a larger alignment than the default value
up to some maximum value dependent on the target (obtainable by using the
attribute reference <code>Standard'Maximum_Alignment</code>). It may also specify
a smaller alignment than the default value for enumeration, integer and
fixed point types, as well as for record types, for example
</p>
<div class="smallexample">
<pre class="smallexample"> type V is record
A : Integer;
end record;
for V'alignment use 1;
</pre></div>
<a name="index-Alignment_002c-default"></a>
<p>The default alignment for the type <code>V</code> is 4, as a result of the
Integer field in the record, but it is permissible, as shown, to
override the default alignment of the record with a smaller value.
</p>
<a name="index-Alignment_002c-subtypes"></a>
<p>Note that according to the Ada standard, an alignment clause applies only
to the first named subtype. If additional subtypes are declared, then the
compiler is allowed to choose any alignment it likes, and there is no way
to control this choice. Consider:
</p>
<div class="smallexample">
<pre class="smallexample"> type R is range 1 .. 10_000;
for R'Alignment use 1;
subtype RS is R range 1 .. 1000;
</pre></div>
<p>The alignment clause specifies an alignment of 1 for the first named subtype
<code>R</code> but this does not necessarily apply to <code>RS</code>. When writing
portable Ada code, you should avoid writing code that explicitly or
implicitly relies on the alignment of such subtypes.
</p>
<p>For the GNAT compiler, if an explicit alignment clause is given, this
value is also used for any subsequent subtypes. So for GNAT, in the
above example, you can count on the alignment of <code>RS</code> being 1. But this
assumption is non-portable, and other compilers may choose different
alignments for the subtype <code>RS</code>.
</p>
<hr>
<a name="Size-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Storage_005fSize-Clauses" accesskey="n" rel="next">Storage_Size Clauses</a>, Previous: <a href="#Alignment-Clauses" accesskey="p" rel="prev">Alignment Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Size-Clauses-1"></a>
<h3 class="section">7.2 Size Clauses</h3>
<a name="index-Size-Clause"></a>
<p>The default size for a type <code>T</code> is obtainable through the
language-defined attribute <code>T'Size</code> and also through the
equivalent GNAT-defined attribute <code>T'Value_Size</code>.
For objects of type <code>T</code>, GNAT will generally increase the type size
so that the object size (obtainable through the GNAT-defined attribute
<code>T'Object_Size</code>)
is a multiple of <code>T'Alignment * Storage_Unit</code>.
For example
</p>
<div class="smallexample">
<pre class="smallexample"> type Smallint is range 1 .. 6;
type Rec is record
Y1 : integer;
Y2 : boolean;
end record;
</pre></div>
<p>In this example, <code>Smallint'Size</code> = <code>Smallint'Value_Size</code> = 3,
as specified by the RM rules,
but objects of this type will have a size of 8
(<code>Smallint'Object_Size</code> = 8),
since objects by default occupy an integral number
of storage units. On some targets, notably older
versions of the Digital Alpha, the size of stand
alone objects of this type may be 32, reflecting
the inability of the hardware to do byte load/stores.
</p>
<p>Similarly, the size of type <code>Rec</code> is 40 bits
(<code>Rec'Size</code> = <code>Rec'Value_Size</code> = 40), but
the alignment is 4, so objects of this type will have
their size increased to 64 bits so that it is a multiple
of the alignment (in bits). This decision is
in accordance with the specific Implementation Advice in RM 13.3(43):
</p>
<blockquote>
<p>A <code>Size</code> clause should be supported for an object if the specified
<code>Size</code> is at least as large as its subtype’s <code>Size</code>, and corresponds
to a size in storage elements that is a multiple of the object’s
<code>Alignment</code> (if the <code>Alignment</code> is nonzero).
</p></blockquote>
<p>An explicit size clause may be used to override the default size by
increasing it. For example, if we have:
</p>
<div class="smallexample">
<pre class="smallexample"> type My_Boolean is new Boolean;
for My_Boolean'Size use 32;
</pre></div>
<p>then values of this type will always be 32 bits long. In the case of
discrete types, the size can be increased up to 64 bits, with the effect
that the entire specified field is used to hold the value, sign- or
zero-extended as appropriate. If more than 64 bits is specified, then
padding space is allocated after the value, and a warning is issued that
there are unused bits.
</p>
<p>Similarly the size of records and arrays may be increased, and the effect
is to add padding bits after the value. This also causes a warning message
to be generated.
</p>
<p>The largest Size value permitted in GNAT is 2**31-1. Since this is a
Size in bits, this corresponds to an object of size 256 megabytes (minus
one). This limitation is true on all targets. The reason for this
limitation is that it improves the quality of the code in many cases
if it is known that a Size value can be accommodated in an object of
type Integer.
</p>
<hr>
<a name="Storage_005fSize-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Size-of-Variant-Record-Objects" accesskey="n" rel="next">Size of Variant Record Objects</a>, Previous: <a href="#Size-Clauses" accesskey="p" rel="prev">Size Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Storage_005fSize-Clauses-1"></a>
<h3 class="section">7.3 Storage_Size Clauses</h3>
<a name="index-Storage_005fSize-Clause"></a>
<p>For tasks, the <code>Storage_Size</code> clause specifies the amount of space
to be allocated for the task stack. This cannot be extended, and if the
stack is exhausted, then <code>Storage_Error</code> will be raised (if stack
checking is enabled). Use a <code>Storage_Size</code> attribute definition clause,
or a <code>Storage_Size</code> pragma in the task definition to set the
appropriate required size. A useful technique is to include in every
task definition a pragma of the form:
</p>
<div class="smallexample">
<pre class="smallexample"> pragma Storage_Size (Default_Stack_Size);
</pre></div>
<p>Then <code>Default_Stack_Size</code> can be defined in a global package, and
modified as required. Any tasks requiring stack sizes different from the
default can have an appropriate alternative reference in the pragma.
</p>
<p>You can also use the <samp>-d</samp> binder switch to modify the default stack
size.
</p>
<p>For access types, the <code>Storage_Size</code> clause specifies the maximum
space available for allocation of objects of the type. If this space is
exceeded then <code>Storage_Error</code> will be raised by an allocation attempt.
In the case where the access type is declared local to a subprogram, the
use of a <code>Storage_Size</code> clause triggers automatic use of a special
predefined storage pool (<code>System.Pool_Size</code>) that ensures that all
space for the pool is automatically reclaimed on exit from the scope in
which the type is declared.
</p>
<p>A special case recognized by the compiler is the specification of a
<code>Storage_Size</code> of zero for an access type. This means that no
items can be allocated from the pool, and this is recognized at compile
time, and all the overhead normally associated with maintaining a fixed
size storage pool is eliminated. Consider the following example:
</p>
<div class="smallexample">
<pre class="smallexample"> procedure p is
type R is array (Natural) of Character;
type P is access all R;
for P'Storage_Size use 0;
-- Above access type intended only for interfacing purposes
y : P;
procedure g (m : P);
pragma Import (C, g);
-- …
begin
-- …
y := new R;
end;
</pre></div>
<p>As indicated in this example, these dummy storage pools are often useful in
connection with interfacing where no object will ever be allocated. If you
compile the above example, you get the warning:
</p>
<div class="smallexample">
<pre class="smallexample"> p.adb:16:09: warning: allocation from empty storage pool
p.adb:16:09: warning: Storage_Error will be raised at run time
</pre></div>
<p>Of course in practice, there will not be any explicit allocators in the
case of such an access declaration.
</p>
<hr>
<a name="Size-of-Variant-Record-Objects"></a>
<div class="header">
<p>
Next: <a href="#Biased-Representation" accesskey="n" rel="next">Biased Representation</a>, Previous: <a href="#Storage_005fSize-Clauses" accesskey="p" rel="prev">Storage_Size Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Size-of-Variant-Record-Objects-1"></a>
<h3 class="section">7.4 Size of Variant Record Objects</h3>
<a name="index-Size_002c-variant-record-objects"></a>
<a name="index-Variant-record-objects_002c-size"></a>
<p>In the case of variant record objects, there is a question whether Size gives
information about a particular variant, or the maximum size required
for any variant. Consider the following program
</p>
<div class="smallexample">
<pre class="smallexample">with Text_IO; use Text_IO;
procedure q is
type R1 (A : Boolean := False) is record
case A is
when True => X : Character;
when False => null;
end case;
end record;
V1 : R1 (False);
V2 : R1;
begin
Put_Line (Integer'Image (V1'Size));
Put_Line (Integer'Image (V2'Size));
end q;
</pre></div>
<p>Here we are dealing with a variant record, where the True variant
requires 16 bits, and the False variant requires 8 bits.
In the above example, both V1 and V2 contain the False variant,
which is only 8 bits long. However, the result of running the
program is:
</p>
<div class="smallexample">
<pre class="smallexample">8
16
</pre></div>
<p>The reason for the difference here is that the discriminant value of
V1 is fixed, and will always be False. It is not possible to assign
a True variant value to V1, therefore 8 bits is sufficient. On the
other hand, in the case of V2, the initial discriminant value is
False (from the default), but it is possible to assign a True
variant value to V2, therefore 16 bits must be allocated for V2
in the general case, even fewer bits may be needed at any particular
point during the program execution.
</p>
<p>As can be seen from the output of this program, the <code>'Size</code>
attribute applied to such an object in GNAT gives the actual allocated
size of the variable, which is the largest size of any of the variants.
The Ada Reference Manual is not completely clear on what choice should
be made here, but the GNAT behavior seems most consistent with the
language in the RM.
</p>
<p>In some cases, it may be desirable to obtain the size of the current
variant, rather than the size of the largest variant. This can be
achieved in GNAT by making use of the fact that in the case of a
subprogram parameter, GNAT does indeed return the size of the current
variant (because a subprogram has no way of knowing how much space
is actually allocated for the actual).
</p>
<p>Consider the following modified version of the above program:
</p>
<div class="smallexample">
<pre class="smallexample">with Text_IO; use Text_IO;
procedure q is
type R1 (A : Boolean := False) is record
case A is
when True => X : Character;
when False => null;
end case;
end record;
V2 : R1;
function Size (V : R1) return Integer is
begin
return V'Size;
end Size;
begin
Put_Line (Integer'Image (V2'Size));
Put_Line (Integer'IMage (Size (V2)));
V2 := (True, 'x');
Put_Line (Integer'Image (V2'Size));
Put_Line (Integer'IMage (Size (V2)));
end q;
</pre></div>
<p>The output from this program is
</p>
<div class="smallexample">
<pre class="smallexample">16
8
16
16
</pre></div>
<p>Here we see that while the <code>'Size</code> attribute always returns
the maximum size, regardless of the current variant value, the
<code>Size</code> function does indeed return the size of the current
variant value.
</p>
<hr>
<a name="Biased-Representation"></a>
<div class="header">
<p>
Next: <a href="#Value_005fSize-and-Object_005fSize-Clauses" accesskey="n" rel="next">Value_Size and Object_Size Clauses</a>, Previous: <a href="#Size-of-Variant-Record-Objects" accesskey="p" rel="prev">Size of Variant Record Objects</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Biased-Representation-1"></a>
<h3 class="section">7.5 Biased Representation</h3>
<a name="index-Size-for-biased-representation"></a>
<a name="index-Biased-representation"></a>
<p>In the case of scalars with a range starting at other than zero, it is
possible in some cases to specify a size smaller than the default minimum
value, and in such cases, GNAT uses an unsigned biased representation,
in which zero is used to represent the lower bound, and successive values
represent successive values of the type.
</p>
<p>For example, suppose we have the declaration:
</p>
<div class="smallexample">
<pre class="smallexample"> type Small is range -7 .. -4;
for Small'Size use 2;
</pre></div>
<p>Although the default size of type <code>Small</code> is 4, the <code>Size</code>
clause is accepted by GNAT and results in the following representation
scheme:
</p>
<div class="smallexample">
<pre class="smallexample"> -7 is represented as 2#00#
-6 is represented as 2#01#
-5 is represented as 2#10#
-4 is represented as 2#11#
</pre></div>
<p>Biased representation is only used if the specified <code>Size</code> clause
cannot be accepted in any other manner. These reduced sizes that force
biased representation can be used for all discrete types except for
enumeration types for which a representation clause is given.
</p>
<hr>
<a name="Value_005fSize-and-Object_005fSize-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Component_005fSize-Clauses" accesskey="n" rel="next">Component_Size Clauses</a>, Previous: <a href="#Biased-Representation" accesskey="p" rel="prev">Biased Representation</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Value_005fSize-and-Object_005fSize-Clauses-1"></a>
<h3 class="section">7.6 Value_Size and Object_Size Clauses</h3>
<a name="index-Value_005fSize-1"></a>
<a name="index-Object_005fSize-1"></a>
<a name="index-Size_002c-of-objects"></a>
<p>In Ada 95 and Ada 2005, <code>T'Size</code> for a type <code>T</code> is the minimum
number of bits required to hold values of type <code>T</code>.
Although this interpretation was allowed in Ada 83, it was not required,
and this requirement in practice can cause some significant difficulties.
For example, in most Ada 83 compilers, <code>Natural'Size</code> was 32.
However, in Ada 95 and Ada 2005,
<code>Natural'Size</code> is
typically 31. This means that code may change in behavior when moving
from Ada 83 to Ada 95 or Ada 2005. For example, consider:
</p>
<div class="smallexample">
<pre class="smallexample"> type Rec is record;
A : Natural;
B : Natural;
end record;
for Rec use record
at 0 range 0 .. Natural'Size - 1;
at 0 range Natural'Size .. 2 * Natural'Size - 1;
end record;
</pre></div>
<p>In the above code, since the typical size of <code>Natural</code> objects
is 32 bits and <code>Natural'Size</code> is 31, the above code can cause
unexpected inefficient packing in Ada 95 and Ada 2005, and in general
there are cases where the fact that the object size can exceed the
size of the type causes surprises.
</p>
<p>To help get around this problem GNAT provides two implementation
defined attributes, <code>Value_Size</code> and <code>Object_Size</code>. When
applied to a type, these attributes yield the size of the type
(corresponding to the RM defined size attribute), and the size of
objects of the type respectively.
</p>
<p>The <code>Object_Size</code> is used for determining the default size of
objects and components. This size value can be referred to using the
<code>Object_Size</code> attribute. The phrase “is used” here means that it is
the basis of the determination of the size. The backend is free to
pad this up if necessary for efficiency, e.g. an 8-bit stand-alone
character might be stored in 32 bits on a machine with no efficient
byte access instructions such as the Alpha.
</p>
<p>The default rules for the value of <code>Object_Size</code> for
discrete types are as follows:
</p>
<ul>
<li> The <code>Object_Size</code> for base subtypes reflect the natural hardware
size in bits (run the compiler with <samp>-gnatS</samp> to find those values
for numeric types). Enumeration types and fixed-point base subtypes have
8, 16, 32 or 64 bits for this size, depending on the range of values
to be stored.
</li><li> The <code>Object_Size</code> of a subtype is the same as the
<code>Object_Size</code> of
the type from which it is obtained.
</li><li> The <code>Object_Size</code> of a derived base type is copied from the parent
base type, and the <code>Object_Size</code> of a derived first subtype is copied
from the parent first subtype.
</li></ul>
<p>The <code>Value_Size</code> attribute
is the (minimum) number of bits required to store a value
of the type.
This value is used to determine how tightly to pack
records or arrays with components of this type, and also affects
the semantics of unchecked conversion (unchecked conversions where
the <code>Value_Size</code> values differ generate a warning, and are potentially
target dependent).
</p>
<p>The default rules for the value of <code>Value_Size</code> are as follows:
</p>
<ul>
<li> The <code>Value_Size</code> for a base subtype is the minimum number of bits
required to store all values of the type (including the sign bit
only if negative values are possible).
</li><li> If a subtype statically matches the first subtype of a given type, then it has
by default the same <code>Value_Size</code> as the first subtype. This is a
consequence of RM 13.1(14) (“if two subtypes statically match,
then their subtype-specific aspects are the same”.)
</li><li> All other subtypes have a <code>Value_Size</code> corresponding to the minimum
number of bits required to store all values of the subtype. For
dynamic bounds, it is assumed that the value can range down or up
to the corresponding bound of the ancestor
</li></ul>
<p>The RM defined attribute <code>Size</code> corresponds to the
<code>Value_Size</code> attribute.
</p>
<p>The <code>Size</code> attribute may be defined for a first-named subtype. This sets
the <code>Value_Size</code> of
the first-named subtype to the given value, and the
<code>Object_Size</code> of this first-named subtype to the given value padded up
to an appropriate boundary. It is a consequence of the default rules
above that this <code>Object_Size</code> will apply to all further subtypes. On the
other hand, <code>Value_Size</code> is affected only for the first subtype, any
dynamic subtypes obtained from it directly, and any statically matching
subtypes. The <code>Value_Size</code> of any other static subtypes is not affected.
</p>
<p><code>Value_Size</code> and
<code>Object_Size</code> may be explicitly set for any subtype using
an attribute definition clause. Note that the use of these attributes
can cause the RM 13.1(14) rule to be violated. If two access types
reference aliased objects whose subtypes have differing <code>Object_Size</code>
values as a result of explicit attribute definition clauses, then it
is erroneous to convert from one access subtype to the other.
</p>
<p>At the implementation level, Esize stores the Object_Size and the
RM_Size field stores the <code>Value_Size</code> (and hence the value of the
<code>Size</code> attribute,
which, as noted above, is equivalent to <code>Value_Size</code>).
</p>
<p>To get a feel for the difference, consider the following examples (note
that in each case the base is <code>Short_Short_Integer</code> with a size of 8):
</p>
<div class="smallexample">
<pre class="smallexample"> Object_Size Value_Size
type x1 is range 0 .. 5; 8 3
type x2 is range 0 .. 5;
for x2'size use 12; 16 12
subtype x3 is x2 range 0 .. 3; 16 2
subtype x4 is x2'base range 0 .. 10; 8 4
subtype x5 is x2 range 0 .. dynamic; 16 3*
subtype x6 is x2'base range 0 .. dynamic; 8 3*
</pre></div>
<p>Note: the entries marked “3*” are not actually specified by the Ada
Reference Manual, but it seems in the spirit of the RM rules to allocate
the minimum number of bits (here 3, given the range for <code>x2</code>)
known to be large enough to hold the given range of values.
</p>
<p>So far, so good, but GNAT has to obey the RM rules, so the question is
under what conditions must the RM <code>Size</code> be used.
The following is a list
of the occasions on which the RM <code>Size</code> must be used:
</p>
<ul>
<li> Component size for packed arrays or records
</li><li> Value of the attribute <code>Size</code> for a type
</li><li> Warning about sizes not matching for unchecked conversion
</li></ul>
<p>For record types, the <code>Object_Size</code> is always a multiple of the
alignment of the type (this is true for all types). In some cases the
<code>Value_Size</code> can be smaller. Consider:
</p>
<div class="smallexample">
<pre class="smallexample"> type R is record
X : Integer;
Y : Character;
end record;
</pre></div>
<p>On a typical 32-bit architecture, the X component will be four bytes, and
require four-byte alignment, and the Y component will be one byte. In this
case <code>R'Value_Size</code> will be 40 (bits) since this is the minimum size
required to store a value of this type, and for example, it is permissible
to have a component of type R in an outer array whose component size is
specified to be 48 bits. However, <code>R'Object_Size</code> will be 64 (bits),
since it must be rounded up so that this value is a multiple of the
alignment (4 bytes = 32 bits).
</p>
<p>For all other types, the <code>Object_Size</code>
and Value_Size are the same (and equivalent to the RM attribute <code>Size</code>).
Only <code>Size</code> may be specified for such types.
</p>
<hr>
<a name="Component_005fSize-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Bit_005fOrder-Clauses" accesskey="n" rel="next">Bit_Order Clauses</a>, Previous: <a href="#Value_005fSize-and-Object_005fSize-Clauses" accesskey="p" rel="prev">Value_Size and Object_Size Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Component_005fSize-Clauses-1"></a>
<h3 class="section">7.7 Component_Size Clauses</h3>
<a name="index-Component_005fSize-Clause"></a>
<p>Normally, the value specified in a component size clause must be consistent
with the subtype of the array component with regard to size and alignment.
In other words, the value specified must be at least equal to the size
of this subtype, and must be a multiple of the alignment value.
</p>
<p>In addition, component size clauses are allowed which cause the array
to be packed, by specifying a smaller value. A first case is for
component size values in the range 1 through 63. The value specified
must not be smaller than the Size of the subtype. GNAT will accurately
honor all packing requests in this range. For example, if we have:
</p>
<div class="smallexample">
<pre class="smallexample">type r is array (1 .. 8) of Natural;
for r'Component_Size use 31;
</pre></div>
<p>then the resulting array has a length of 31 bytes (248 bits = 8 * 31).
Of course access to the components of such an array is considerably
less efficient than if the natural component size of 32 is used.
A second case is when the subtype of the component is a record type
padded because of its default alignment. For example, if we have:
</p>
<div class="smallexample">
<pre class="smallexample">type r is record
i : Integer;
j : Integer;
b : Boolean;
end record;
type a is array (1 .. 8) of r;
for a'Component_Size use 72;
</pre></div>
<p>then the resulting array has a length of 72 bytes, instead of 96 bytes
if the alignment of the record (4) was obeyed.
</p>
<p>Note that there is no point in giving both a component size clause
and a pragma Pack for the same array type. if such duplicate
clauses are given, the pragma Pack will be ignored.
</p>
<hr>
<a name="Bit_005fOrder-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Effect-of-Bit_005fOrder-on-Byte-Ordering" accesskey="n" rel="next">Effect of Bit_Order on Byte Ordering</a>, Previous: <a href="#Component_005fSize-Clauses" accesskey="p" rel="prev">Component_Size Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Bit_005fOrder-Clauses-1"></a>
<h3 class="section">7.8 Bit_Order Clauses</h3>
<a name="index-Bit_005fOrder-Clause"></a>
<a name="index-bit-ordering"></a>
<a name="index-ordering_002c-of-bits"></a>
<p>For record subtypes, GNAT permits the specification of the <code>Bit_Order</code>
attribute. The specification may either correspond to the default bit
order for the target, in which case the specification has no effect and
places no additional restrictions, or it may be for the non-standard
setting (that is the opposite of the default).
</p>
<p>In the case where the non-standard value is specified, the effect is
to renumber bits within each byte, but the ordering of bytes is not
affected. There are certain
restrictions placed on component clauses as follows:
</p>
<ul>
<li> Components fitting within a single storage unit.
These are unrestricted, and the effect is merely to renumber bits. For
example if we are on a little-endian machine with <code>Low_Order_First</code>
being the default, then the following two declarations have exactly
the same effect:
<div class="smallexample">
<pre class="smallexample"> type R1 is record
A : Boolean;
B : Integer range 1 .. 120;
end record;
for R1 use record
A at 0 range 0 .. 0;
B at 0 range 1 .. 7;
end record;
type R2 is record
A : Boolean;
B : Integer range 1 .. 120;
end record;
for R2'Bit_Order use High_Order_First;
for R2 use record
A at 0 range 7 .. 7;
B at 0 range 0 .. 6;
end record;
</pre></div>
<p>The useful application here is to write the second declaration with the
<code>Bit_Order</code> attribute definition clause, and know that it will be treated
the same, regardless of whether the target is little-endian or big-endian.
</p>
</li><li> Components occupying an integral number of bytes.
These are components that exactly fit in two or more bytes. Such component
declarations are allowed, but have no effect, since it is important to realize
that the <code>Bit_Order</code> specification does not affect the ordering of bytes.
In particular, the following attempt at getting an endian-independent integer
does not work:
<div class="smallexample">
<pre class="smallexample"> type R2 is record
A : Integer;
end record;
for R2'Bit_Order use High_Order_First;
for R2 use record
A at 0 range 0 .. 31;
end record;
</pre></div>
<p>This declaration will result in a little-endian integer on a
little-endian machine, and a big-endian integer on a big-endian machine.
If byte flipping is required for interoperability between big- and
little-endian machines, this must be explicitly programmed. This capability
is not provided by <code>Bit_Order</code>.
</p>
</li><li> Components that are positioned across byte boundaries
but do not occupy an integral number of bytes. Given that bytes are not
reordered, such fields would occupy a non-contiguous sequence of bits
in memory, requiring non-trivial code to reassemble. They are for this
reason not permitted, and any component clause specifying such a layout
will be flagged as illegal by GNAT.
</li></ul>
<p>Since the misconception that Bit_Order automatically deals with all
endian-related incompatibilities is a common one, the specification of
a component field that is an integral number of bytes will always
generate a warning. This warning may be suppressed using <code>pragma
Warnings (Off)</code> if desired. The following section contains additional
details regarding the issue of byte ordering.
</p>
<hr>
<a name="Effect-of-Bit_005fOrder-on-Byte-Ordering"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Pack-for-Arrays" accesskey="n" rel="next">Pragma Pack for Arrays</a>, Previous: <a href="#Bit_005fOrder-Clauses" accesskey="p" rel="prev">Bit_Order Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Effect-of-Bit_005fOrder-on-Byte-Ordering-1"></a>
<h3 class="section">7.9 Effect of Bit_Order on Byte Ordering</h3>
<a name="index-byte-ordering"></a>
<a name="index-ordering_002c-of-bytes"></a>
<p>In this section we will review the effect of the <code>Bit_Order</code> attribute
definition clause on byte ordering. Briefly, it has no effect at all, but
a detailed example will be helpful. Before giving this
example, let us review the precise
definition of the effect of defining <code>Bit_Order</code>. The effect of a
non-standard bit order is described in section 15.5.3 of the Ada
Reference Manual:
</p>
<blockquote>
<p>2 A bit ordering is a method of interpreting the meaning of
the storage place attributes.
</p></blockquote>
<p>To understand the precise definition of storage place attributes in
this context, we visit section 13.5.1 of the manual:
</p>
<blockquote>
<p>13 A record_representation_clause (without the mod_clause)
specifies the layout. The storage place attributes (see 13.5.2)
are taken from the values of the position, first_bit, and last_bit
expressions after normalizing those values so that first_bit is
less than Storage_Unit.
</p></blockquote>
<p>The critical point here is that storage places are taken from
the values after normalization, not before. So the <code>Bit_Order</code>
interpretation applies to normalized values. The interpretation
is described in the later part of the 15.5.3 paragraph:
</p>
<blockquote>
<p>2 A bit ordering is a method of interpreting the meaning of
the storage place attributes. High_Order_First (known in the
vernacular as “big endian”) means that the first bit of a
storage element (bit 0) is the most significant bit (interpreting
the sequence of bits that represent a component as an unsigned
integer value). Low_Order_First (known in the vernacular as
“little endian”) means the opposite: the first bit is the
least significant.
</p></blockquote>
<p>Note that the numbering is with respect to the bits of a storage
unit. In other words, the specification affects only the numbering
of bits within a single storage unit.
</p>
<p>We can make the effect clearer by giving an example.
</p>
<p>Suppose that we have an external device which presents two bytes, the first
byte presented, which is the first (low addressed byte) of the two byte
record is called Master, and the second byte is called Slave.
</p>
<p>The left most (most significant bit is called Control for each byte, and
the remaining 7 bits are called V1, V2, … V7, where V7 is the rightmost
(least significant) bit.
</p>
<p>On a big-endian machine, we can write the following representation clause
</p>
<div class="smallexample">
<pre class="smallexample"> type Data is record
Master_Control : Bit;
Master_V1 : Bit;
Master_V2 : Bit;
Master_V3 : Bit;
Master_V4 : Bit;
Master_V5 : Bit;
Master_V6 : Bit;
Master_V7 : Bit;
Slave_Control : Bit;
Slave_V1 : Bit;
Slave_V2 : Bit;
Slave_V3 : Bit;
Slave_V4 : Bit;
Slave_V5 : Bit;
Slave_V6 : Bit;
Slave_V7 : Bit;
end record;
for Data use record
Master_Control at 0 range 0 .. 0;
Master_V1 at 0 range 1 .. 1;
Master_V2 at 0 range 2 .. 2;
Master_V3 at 0 range 3 .. 3;
Master_V4 at 0 range 4 .. 4;
Master_V5 at 0 range 5 .. 5;
Master_V6 at 0 range 6 .. 6;
Master_V7 at 0 range 7 .. 7;
Slave_Control at 1 range 0 .. 0;
Slave_V1 at 1 range 1 .. 1;
Slave_V2 at 1 range 2 .. 2;
Slave_V3 at 1 range 3 .. 3;
Slave_V4 at 1 range 4 .. 4;
Slave_V5 at 1 range 5 .. 5;
Slave_V6 at 1 range 6 .. 6;
Slave_V7 at 1 range 7 .. 7;
end record;
</pre></div>
<p>Now if we move this to a little endian machine, then the bit ordering within
the byte is backwards, so we have to rewrite the record rep clause as:
</p>
<div class="smallexample">
<pre class="smallexample"> for Data use record
Master_Control at 0 range 7 .. 7;
Master_V1 at 0 range 6 .. 6;
Master_V2 at 0 range 5 .. 5;
Master_V3 at 0 range 4 .. 4;
Master_V4 at 0 range 3 .. 3;
Master_V5 at 0 range 2 .. 2;
Master_V6 at 0 range 1 .. 1;
Master_V7 at 0 range 0 .. 0;
Slave_Control at 1 range 7 .. 7;
Slave_V1 at 1 range 6 .. 6;
Slave_V2 at 1 range 5 .. 5;
Slave_V3 at 1 range 4 .. 4;
Slave_V4 at 1 range 3 .. 3;
Slave_V5 at 1 range 2 .. 2;
Slave_V6 at 1 range 1 .. 1;
Slave_V7 at 1 range 0 .. 0;
end record;
</pre></div>
<p>It is a nuisance to have to rewrite the clause, especially if
the code has to be maintained on both machines. However,
this is a case that we can handle with the
<code>Bit_Order</code> attribute if it is implemented.
Note that the implementation is not required on byte addressed
machines, but it is indeed implemented in GNAT.
This means that we can simply use the
first record clause, together with the declaration
</p>
<div class="smallexample">
<pre class="smallexample"> for Data'Bit_Order use High_Order_First;
</pre></div>
<p>and the effect is what is desired, namely the layout is exactly the same,
independent of whether the code is compiled on a big-endian or little-endian
machine.
</p>
<p>The important point to understand is that byte ordering is not affected.
A <code>Bit_Order</code> attribute definition never affects which byte a field
ends up in, only where it ends up in that byte.
To make this clear, let us rewrite the record rep clause of the previous
example as:
</p>
<div class="smallexample">
<pre class="smallexample"> for Data'Bit_Order use High_Order_First;
for Data use record
Master_Control at 0 range 0 .. 0;
Master_V1 at 0 range 1 .. 1;
Master_V2 at 0 range 2 .. 2;
Master_V3 at 0 range 3 .. 3;
Master_V4 at 0 range 4 .. 4;
Master_V5 at 0 range 5 .. 5;
Master_V6 at 0 range 6 .. 6;
Master_V7 at 0 range 7 .. 7;
Slave_Control at 0 range 8 .. 8;
Slave_V1 at 0 range 9 .. 9;
Slave_V2 at 0 range 10 .. 10;
Slave_V3 at 0 range 11 .. 11;
Slave_V4 at 0 range 12 .. 12;
Slave_V5 at 0 range 13 .. 13;
Slave_V6 at 0 range 14 .. 14;
Slave_V7 at 0 range 15 .. 15;
end record;
</pre></div>
<p>This is exactly equivalent to saying (a repeat of the first example):
</p>
<div class="smallexample">
<pre class="smallexample"> for Data'Bit_Order use High_Order_First;
for Data use record
Master_Control at 0 range 0 .. 0;
Master_V1 at 0 range 1 .. 1;
Master_V2 at 0 range 2 .. 2;
Master_V3 at 0 range 3 .. 3;
Master_V4 at 0 range 4 .. 4;
Master_V5 at 0 range 5 .. 5;
Master_V6 at 0 range 6 .. 6;
Master_V7 at 0 range 7 .. 7;
Slave_Control at 1 range 0 .. 0;
Slave_V1 at 1 range 1 .. 1;
Slave_V2 at 1 range 2 .. 2;
Slave_V3 at 1 range 3 .. 3;
Slave_V4 at 1 range 4 .. 4;
Slave_V5 at 1 range 5 .. 5;
Slave_V6 at 1 range 6 .. 6;
Slave_V7 at 1 range 7 .. 7;
end record;
</pre></div>
<p>Why are they equivalent? Well take a specific field, the <code>Slave_V2</code>
field. The storage place attributes are obtained by normalizing the
values given so that the <code>First_Bit</code> value is less than 8. After
normalizing the values (0,10,10) we get (1,2,2) which is exactly what
we specified in the other case.
</p>
<p>Now one might expect that the <code>Bit_Order</code> attribute might affect
bit numbering within the entire record component (two bytes in this
case, thus affecting which byte fields end up in), but that is not
the way this feature is defined, it only affects numbering of bits,
not which byte they end up in.
</p>
<p>Consequently it never makes sense to specify a starting bit number
greater than 7 (for a byte addressable field) if an attribute
definition for <code>Bit_Order</code> has been given, and indeed it
may be actively confusing to specify such a value, so the compiler
generates a warning for such usage.
</p>
<p>If you do need to control byte ordering then appropriate conditional
values must be used. If in our example, the slave byte came first on
some machines we might write:
</p>
<div class="smallexample">
<pre class="smallexample"> Master_Byte_First constant Boolean := …;
Master_Byte : constant Natural :=
1 - Boolean'Pos (Master_Byte_First);
Slave_Byte : constant Natural :=
Boolean'Pos (Master_Byte_First);
for Data'Bit_Order use High_Order_First;
for Data use record
Master_Control at Master_Byte range 0 .. 0;
Master_V1 at Master_Byte range 1 .. 1;
Master_V2 at Master_Byte range 2 .. 2;
Master_V3 at Master_Byte range 3 .. 3;
Master_V4 at Master_Byte range 4 .. 4;
Master_V5 at Master_Byte range 5 .. 5;
Master_V6 at Master_Byte range 6 .. 6;
Master_V7 at Master_Byte range 7 .. 7;
Slave_Control at Slave_Byte range 0 .. 0;
Slave_V1 at Slave_Byte range 1 .. 1;
Slave_V2 at Slave_Byte range 2 .. 2;
Slave_V3 at Slave_Byte range 3 .. 3;
Slave_V4 at Slave_Byte range 4 .. 4;
Slave_V5 at Slave_Byte range 5 .. 5;
Slave_V6 at Slave_Byte range 6 .. 6;
Slave_V7 at Slave_Byte range 7 .. 7;
end record;
</pre></div>
<p>Now to switch between machines, all that is necessary is
to set the boolean constant <code>Master_Byte_First</code> in
an appropriate manner.
</p>
<hr>
<a name="Pragma-Pack-for-Arrays"></a>
<div class="header">
<p>
Next: <a href="#Pragma-Pack-for-Records" accesskey="n" rel="next">Pragma Pack for Records</a>, Previous: <a href="#Effect-of-Bit_005fOrder-on-Byte-Ordering" accesskey="p" rel="prev">Effect of Bit_Order on Byte Ordering</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Pack-for-Arrays-1"></a>
<h3 class="section">7.10 Pragma Pack for Arrays</h3>
<a name="index-Pragma-Pack-_0028for-arrays_0029"></a>
<p>Pragma <code>Pack</code> applied to an array has no effect unless the component type
is packable. For a component type to be packable, it must be one of the
following cases:
</p>
<ul>
<li> Any scalar type
</li><li> Any type whose size is specified with a size clause
</li><li> Any packed array type with a static size
</li><li> Any record type padded because of its default alignment
</li></ul>
<p>For all these cases, if the component subtype size is in the range
1 through 63, then the effect of the pragma <code>Pack</code> is exactly as though a
component size were specified giving the component subtype size.
For example if we have:
</p>
<div class="smallexample">
<pre class="smallexample"> type r is range 0 .. 17;
type ar is array (1 .. 8) of r;
pragma Pack (ar);
</pre></div>
<p>Then the component size of <code>ar</code> will be set to 5 (i.e. to <code>r'size</code>,
and the size of the array <code>ar</code> will be exactly 40 bits.
</p>
<p>Note that in some cases this rather fierce approach to packing can produce
unexpected effects. For example, in Ada 95 and Ada 2005,
subtype <code>Natural</code> typically has a size of 31, meaning that if you
pack an array of <code>Natural</code>, you get 31-bit
close packing, which saves a few bits, but results in far less efficient
access. Since many other Ada compilers will ignore such a packing request,
GNAT will generate a warning on some uses of pragma <code>Pack</code> that it guesses
might not be what is intended. You can easily remove this warning by
using an explicit <code>Component_Size</code> setting instead, which never generates
a warning, since the intention of the programmer is clear in this case.
</p>
<p>GNAT treats packed arrays in one of two ways. If the size of the array is
known at compile time and is less than 64 bits, then internally the array
is represented as a single modular type, of exactly the appropriate number
of bits. If the length is greater than 63 bits, or is not known at compile
time, then the packed array is represented as an array of bytes, and the
length is always a multiple of 8 bits.
</p>
<p>Note that to represent a packed array as a modular type, the alignment must
be suitable for the modular type involved. For example, on typical machines
a 32-bit packed array will be represented by a 32-bit modular integer with
an alignment of four bytes. If you explicitly override the default alignment
with an alignment clause that is too small, the modular representation
cannot be used. For example, consider the following set of declarations:
</p>
<div class="smallexample">
<pre class="smallexample"> type R is range 1 .. 3;
type S is array (1 .. 31) of R;
for S'Component_Size use 2;
for S'Size use 62;
for S'Alignment use 1;
</pre></div>
<p>If the alignment clause were not present, then a 62-bit modular
representation would be chosen (typically with an alignment of 4 or 8
bytes depending on the target). But the default alignment is overridden
with the explicit alignment clause. This means that the modular
representation cannot be used, and instead the array of bytes
representation must be used, meaning that the length must be a multiple
of 8. Thus the above set of declarations will result in a diagnostic
rejecting the size clause and noting that the minimum size allowed is 64.
</p>
<a name="index-Pragma-Pack-_0028for-type-Natural_0029"></a>
<a name="index-Pragma-Pack-warning"></a>
<p>One special case that is worth noting occurs when the base type of the
component size is 8/16/32 and the subtype is one bit less. Notably this
occurs with subtype <code>Natural</code>. Consider:
</p>
<div class="smallexample">
<pre class="smallexample"> type Arr is array (1 .. 32) of Natural;
pragma Pack (Arr);
</pre></div>
<p>In all commonly used Ada 83 compilers, this pragma Pack would be ignored,
since typically <code>Natural'Size</code> is 32 in Ada 83, and in any case most
Ada 83 compilers did not attempt 31 bit packing.
</p>
<p>In Ada 95 and Ada 2005, <code>Natural'Size</code> is required to be 31. Furthermore,
GNAT really does pack 31-bit subtype to 31 bits. This may result in a
substantial unintended performance penalty when porting legacy Ada 83 code.
To help prevent this, GNAT generates a warning in such cases. If you really
want 31 bit packing in a case like this, you can set the component size
explicitly:
</p>
<div class="smallexample">
<pre class="smallexample"> type Arr is array (1 .. 32) of Natural;
for Arr'Component_Size use 31;
</pre></div>
<p>Here 31-bit packing is achieved as required, and no warning is generated,
since in this case the programmer intention is clear.
</p>
<hr>
<a name="Pragma-Pack-for-Records"></a>
<div class="header">
<p>
Next: <a href="#Record-Representation-Clauses" accesskey="n" rel="next">Record Representation Clauses</a>, Previous: <a href="#Pragma-Pack-for-Arrays" accesskey="p" rel="prev">Pragma Pack for Arrays</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Pragma-Pack-for-Records-1"></a>
<h3 class="section">7.11 Pragma Pack for Records</h3>
<a name="index-Pragma-Pack-_0028for-records_0029"></a>
<p>Pragma <code>Pack</code> applied to a record will pack the components to reduce
wasted space from alignment gaps and by reducing the amount of space
taken by components. We distinguish between <em>packable</em> components and
<em>non-packable</em> components.
Components of the following types are considered packable:
</p><ul>
<li> All primitive types are packable.
</li><li> Small packed arrays, whose size does not exceed 64 bits, and where the
size is statically known at compile time, are represented internally
as modular integers, and so they are also packable.
</li></ul>
<p>All packable components occupy the exact number of bits corresponding to
their <code>Size</code> value, and are packed with no padding bits, i.e. they
can start on an arbitrary bit boundary.
</p>
<p>All other types are non-packable, they occupy an integral number of
storage units, and
are placed at a boundary corresponding to their alignment requirements.
</p>
<p>For example, consider the record
</p>
<div class="smallexample">
<pre class="smallexample"> type Rb1 is array (1 .. 13) of Boolean;
pragma Pack (rb1);
type Rb2 is array (1 .. 65) of Boolean;
pragma Pack (rb2);
type x2 is record
l1 : Boolean;
l2 : Duration;
l3 : Float;
l4 : Boolean;
l5 : Rb1;
l6 : Rb2;
end record;
pragma Pack (x2);
</pre></div>
<p>The representation for the record x2 is as follows:
</p>
<div class="smallexample">
<pre class="smallexample">for x2'Size use 224;
for x2 use record
l1 at 0 range 0 .. 0;
l2 at 0 range 1 .. 64;
l3 at 12 range 0 .. 31;
l4 at 16 range 0 .. 0;
l5 at 16 range 1 .. 13;
l6 at 18 range 0 .. 71;
end record;
</pre></div>
<p>Studying this example, we see that the packable fields <code>l1</code>
and <code>l2</code> are
of length equal to their sizes, and placed at specific bit boundaries (and
not byte boundaries) to
eliminate padding. But <code>l3</code> is of a non-packable float type, so
it is on the next appropriate alignment boundary.
</p>
<p>The next two fields are fully packable, so <code>l4</code> and <code>l5</code> are
minimally packed with no gaps. However, type <code>Rb2</code> is a packed
array that is longer than 64 bits, so it is itself non-packable. Thus
the <code>l6</code> field is aligned to the next byte boundary, and takes an
integral number of bytes, i.e. 72 bits.
</p>
<hr>
<a name="Record-Representation-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Enumeration-Clauses" accesskey="n" rel="next">Enumeration Clauses</a>, Previous: <a href="#Pragma-Pack-for-Records" accesskey="p" rel="prev">Pragma Pack for Records</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Record-Representation-Clauses-1"></a>
<h3 class="section">7.12 Record Representation Clauses</h3>
<a name="index-Record-Representation-Clause"></a>
<p>Record representation clauses may be given for all record types, including
types obtained by record extension. Component clauses are allowed for any
static component. The restrictions on component clauses depend on the type
of the component.
</p>
<a name="index-Component-Clause"></a>
<p>For all components of an elementary type, the only restriction on component
clauses is that the size must be at least the ’Size value of the type
(actually the Value_Size). There are no restrictions due to alignment,
and such components may freely cross storage boundaries.
</p>
<p>Packed arrays with a size up to and including 64 bits are represented
internally using a modular type with the appropriate number of bits, and
thus the same lack of restriction applies. For example, if you declare:
</p>
<div class="smallexample">
<pre class="smallexample"> type R is array (1 .. 49) of Boolean;
pragma Pack (R);
for R'Size use 49;
</pre></div>
<p>then a component clause for a component of type R may start on any
specified bit boundary, and may specify a value of 49 bits or greater.
</p>
<p>For packed bit arrays that are longer than 64 bits, there are two
cases. If the component size is a power of 2 (1,2,4,8,16,32 bits),
including the important case of single bits or boolean values, then
there are no limitations on placement of such components, and they
may start and end at arbitrary bit boundaries.
</p>
<p>If the component size is not a power of 2 (e.g. 3 or 5), then
an array of this type longer than 64 bits must always be placed on
on a storage unit (byte) boundary and occupy an integral number
of storage units (bytes). Any component clause that does not
meet this requirement will be rejected.
</p>
<p>Any aliased component, or component of an aliased type, must
have its normal alignment and size. A component clause that
does not meet this requirement will be rejected.
</p>
<p>The tag field of a tagged type always occupies an address sized field at
the start of the record. No component clause may attempt to overlay this
tag. When a tagged type appears as a component, the tag field must have
proper alignment
</p>
<p>In the case of a record extension T1, of a type T, no component clause applied
to the type T1 can specify a storage location that would overlap the first
T’Size bytes of the record.
</p>
<p>For all other component types, including non-bit-packed arrays,
the component can be placed at an arbitrary bit boundary,
so for example, the following is permitted:
</p>
<div class="smallexample">
<pre class="smallexample"> type R is array (1 .. 10) of Boolean;
for R'Size use 80;
type Q is record
G, H : Boolean;
L, M : R;
end record;
for Q use record
G at 0 range 0 .. 0;
H at 0 range 1 .. 1;
L at 0 range 2 .. 81;
R at 0 range 82 .. 161;
end record;
</pre></div>
<p>Note: the above rules apply to recent releases of GNAT 5.
In GNAT 3, there are more severe restrictions on larger components.
For non-primitive types, including packed arrays with a size greater than
64 bits, component clauses must respect the alignment requirement of the
type, in particular, always starting on a byte boundary, and the length
must be a multiple of the storage unit.
</p>
<hr>
<a name="Enumeration-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Address-Clauses" accesskey="n" rel="next">Address Clauses</a>, Previous: <a href="#Record-Representation-Clauses" accesskey="p" rel="prev">Record Representation Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Enumeration-Clauses-1"></a>
<h3 class="section">7.13 Enumeration Clauses</h3>
<p>The only restriction on enumeration clauses is that the range of values
must be representable. For the signed case, if one or more of the
representation values are negative, all values must be in the range:
</p>
<div class="smallexample">
<pre class="smallexample"> System.Min_Int .. System.Max_Int
</pre></div>
<p>For the unsigned case, where all values are nonnegative, the values must
be in the range:
</p>
<div class="smallexample">
<pre class="smallexample"> 0 .. System.Max_Binary_Modulus;
</pre></div>
<p>A <em>confirming</em> representation clause is one in which the values range
from 0 in sequence, i.e. a clause that confirms the default representation
for an enumeration type.
Such a confirming representation
is permitted by these rules, and is specially recognized by the compiler so
that no extra overhead results from the use of such a clause.
</p>
<p>If an array has an index type which is an enumeration type to which an
enumeration clause has been applied, then the array is stored in a compact
manner. Consider the declarations:
</p>
<div class="smallexample">
<pre class="smallexample"> type r is (A, B, C);
for r use (A => 1, B => 5, C => 10);
type t is array (r) of Character;
</pre></div>
<p>The array type t corresponds to a vector with exactly three elements and
has a default size equal to <code>3*Character'Size</code>. This ensures efficient
use of space, but means that accesses to elements of the array will incur
the overhead of converting representation values to the corresponding
positional values, (i.e. the value delivered by the <code>Pos</code> attribute).
</p>
<hr>
<a name="Address-Clauses"></a>
<div class="header">
<p>
Next: <a href="#Effect-of-Convention-on-Representation" accesskey="n" rel="next">Effect of Convention on Representation</a>, Previous: <a href="#Enumeration-Clauses" accesskey="p" rel="prev">Enumeration Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Address-Clauses-1"></a>
<h3 class="section">7.14 Address Clauses</h3>
<a name="index-Address-Clause"></a>
<p>The reference manual allows a general restriction on representation clauses,
as found in RM 13.1(22):
</p>
<blockquote>
<p>An implementation need not support representation
items containing nonstatic expressions, except that
an implementation should support a representation item
for a given entity if each nonstatic expression in the
representation item is a name that statically denotes
a constant declared before the entity.
</p></blockquote>
<p>In practice this is applicable only to address clauses, since this is the
only case in which a non-static expression is permitted by the syntax. As
the AARM notes in sections 13.1 (22.a-22.h):
</p>
<div class="display">
<pre class="display"> 22.a Reason: This is to avoid the following sort of thing:
22.b X : Integer := F(…);
Y : Address := G(…);
for X’Address use Y;
22.c In the above, we have to evaluate the
initialization expression for X before we
know where to put the result. This seems
like an unreasonable implementation burden.
22.d The above code should instead be written
like this:
22.e Y : constant Address := G(…);
X : Integer := F(…);
for X’Address use Y;
22.f This allows the expression “Y” to be safely
evaluated before X is created.
22.g The constant could be a formal parameter of mode in.
22.h An implementation can support other nonstatic
expressions if it wants to. Expressions of type
Address are hardly ever static, but their value
might be known at compile time anyway in many
cases.
</pre></div>
<p>GNAT does indeed permit many additional cases of non-static expressions. In
particular, if the type involved is elementary there are no restrictions
(since in this case, holding a temporary copy of the initialization value,
if one is present, is inexpensive). In addition, if there is no implicit or
explicit initialization, then there are no restrictions. GNAT will reject
only the case where all three of these conditions hold:
</p>
<ul>
<li> The type of the item is non-elementary (e.g. a record or array).
</li><li> There is explicit or implicit initialization required for the object.
Note that access values are always implicitly initialized.
</li><li> The address value is non-static. Here GNAT is more permissive than the
RM, and allows the address value to be the address of a previously declared
stand-alone variable, as long as it does not itself have an address clause.
<div class="smallexample">
<pre class="smallexample"> Anchor : Some_Initialized_Type;
Overlay : Some_Initialized_Type;
for Overlay'Address use Anchor'Address;
</pre></div>
<p>However, the prefix of the address clause cannot be an array component, or
a component of a discriminated record.
</p>
</li></ul>
<p>As noted above in section 22.h, address values are typically non-static. In
particular the To_Address function, even if applied to a literal value, is
a non-static function call. To avoid this minor annoyance, GNAT provides
the implementation defined attribute ’To_Address. The following two
expressions have identical values:
</p>
<a name="index-Attribute"></a>
<a name="index-To_005fAddress-1"></a>
<div class="smallexample">
<pre class="smallexample"> To_Address (16#1234_0000#)
System'To_Address (16#1234_0000#);
</pre></div>
<p>except that the second form is considered to be a static expression, and
thus when used as an address clause value is always permitted.
</p>
<p>Additionally, GNAT treats as static an address clause that is an
unchecked_conversion of a static integer value. This simplifies the porting
of legacy code, and provides a portable equivalent to the GNAT attribute
<code>To_Address</code>.
</p>
<p>Another issue with address clauses is the interaction with alignment
requirements. When an address clause is given for an object, the address
value must be consistent with the alignment of the object (which is usually
the same as the alignment of the type of the object). If an address clause
is given that specifies an inappropriately aligned address value, then the
program execution is erroneous.
</p>
<p>Since this source of erroneous behavior can have unfortunate effects, GNAT
checks (at compile time if possible, generating a warning, or at execution
time with a run-time check) that the alignment is appropriate. If the
run-time check fails, then <code>Program_Error</code> is raised. This run-time
check is suppressed if range checks are suppressed, or if the special GNAT
check Alignment_Check is suppressed, or if
<code>pragma Restrictions (No_Elaboration_Code)</code> is in effect.
</p>
<p>Finally, GNAT does not permit overlaying of objects of controlled types or
composite types containing a controlled component. In most cases, the compiler
can detect an attempt at such overlays and will generate a warning at compile
time and a Program_Error exception at run time.
</p>
<a name="index-Export-1"></a>
<p>An address clause cannot be given for an exported object. More
understandably the real restriction is that objects with an address
clause cannot be exported. This is because such variables are not
defined by the Ada program, so there is no external object to export.
</p>
<a name="index-Import"></a>
<p>It is permissible to give an address clause and a pragma Import for the
same object. In this case, the variable is not really defined by the
Ada program, so there is no external symbol to be linked. The link name
and the external name are ignored in this case. The reason that we allow this
combination is that it provides a useful idiom to avoid unwanted
initializations on objects with address clauses.
</p>
<p>When an address clause is given for an object that has implicit or
explicit initialization, then by default initialization takes place. This
means that the effect of the object declaration is to overwrite the
memory at the specified address. This is almost always not what the
programmer wants, so GNAT will output a warning:
</p>
<div class="smallexample">
<pre class="smallexample"> with System;
package G is
type R is record
M : Integer := 0;
end record;
Ext : R;
for Ext'Address use System'To_Address (16#1234_1234#);
|
>>> warning: implicit initialization of "Ext" may
modify overlaid storage
>>> warning: use pragma Import for "Ext" to suppress
initialization (RM B(24))
end G;
</pre></div>
<p>As indicated by the warning message, the solution is to use a (dummy) pragma
Import to suppress this initialization. The pragma tell the compiler that the
object is declared and initialized elsewhere. The following package compiles
without warnings (and the initialization is suppressed):
</p>
<div class="smallexample">
<pre class="smallexample"> with System;
package G is
type R is record
M : Integer := 0;
end record;
Ext : R;
for Ext'Address use System'To_Address (16#1234_1234#);
pragma Import (Ada, Ext);
end G;
</pre></div>
<p>A final issue with address clauses involves their use for overlaying
variables, as in the following example:
<a name="index-Overlaying-of-objects"></a>
</p>
<div class="smallexample">
<pre class="smallexample"> A : Integer;
B : Integer;
for B'Address use A'Address;
</pre></div>
<p>or alternatively, using the form recommended by the RM:
</p>
<div class="smallexample">
<pre class="smallexample"> A : Integer;
Addr : constant Address := A'Address;
B : Integer;
for B'Address use Addr;
</pre></div>
<p>In both of these cases, <code>A</code>
and <code>B</code> become aliased to one another via the
address clause. This use of address clauses to overlay
variables, achieving an effect similar to unchecked
conversion was erroneous in Ada 83, but in Ada 95 and Ada 2005
the effect is implementation defined. Furthermore, the
Ada RM specifically recommends that in a situation
like this, <code>B</code> should be subject to the following
implementation advice (RM 13.3(19)):
</p>
<blockquote>
<p>19 If the Address of an object is specified, or it is imported
or exported, then the implementation should not perform
optimizations based on assumptions of no aliases.
</p></blockquote>
<p>GNAT follows this recommendation, and goes further by also applying
this recommendation to the overlaid variable (<code>A</code>
in the above example) in this case. This means that the overlay
works "as expected", in that a modification to one of the variables
will affect the value of the other.
</p>
<hr>
<a name="Effect-of-Convention-on-Representation"></a>
<div class="header">
<p>
Next: <a href="#Determining-the-Representations-chosen-by-GNAT" accesskey="n" rel="next">Determining the Representations chosen by GNAT</a>, Previous: <a href="#Address-Clauses" accesskey="p" rel="prev">Address Clauses</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Effect-of-Convention-on-Representation-1"></a>
<h3 class="section">7.15 Effect of Convention on Representation</h3>
<a name="index-Convention_002c-effect-on-representation"></a>
<p>Normally the specification of a foreign language convention for a type or
an object has no effect on the chosen representation. In particular, the
representation chosen for data in GNAT generally meets the standard system
conventions, and for example records are laid out in a manner that is
consistent with C. This means that specifying convention C (for example)
has no effect.
</p>
<p>There are four exceptions to this general rule:
</p>
<ul>
<li> Convention Fortran and array subtypes
If pragma Convention Fortran is specified for an array subtype, then in
accordance with the implementation advice in section 3.6.2(11) of the
Ada Reference Manual, the array will be stored in a Fortran-compatible
column-major manner, instead of the normal default row-major order.
</li><li> Convention C and enumeration types
GNAT normally stores enumeration types in 8, 16, or 32 bits as required
to accommodate all values of the type. For example, for the enumeration
type declared by:
<div class="smallexample">
<pre class="smallexample"> type Color is (Red, Green, Blue);
</pre></div>
<p>8 bits is sufficient to store all values of the type, so by default, objects
of type <code>Color</code> will be represented using 8 bits. However, normal C
convention is to use 32 bits for all enum values in C, since enum values
are essentially of type int. If pragma <code>Convention C</code> is specified for an
Ada enumeration type, then the size is modified as necessary (usually to
32 bits) to be consistent with the C convention for enum values.
</p>
<p>Note that this treatment applies only to types. If Convention C is given for
an enumeration object, where the enumeration type is not Convention C, then
Object_Size bits are allocated. For example, for a normal enumeration type,
with less than 256 elements, only 8 bits will be allocated for the object.
Since this may be a surprise in terms of what C expects, GNAT will issue a
warning in this situation. The warning can be suppressed by giving an explicit
size clause specifying the desired size.
</p>
</li><li> Convention C/Fortran and Boolean types
In C, the usual convention for boolean values, that is values used for
conditions, is that zero represents false, and nonzero values represent
true. In Ada, the normal convention is that two specific values, typically
0/1, are used to represent false/true respectively.
<p>Fortran has a similar convention for <code>LOGICAL</code> values (any nonzero
value represents true).
</p>
<p>To accommodate the Fortran and C conventions, if a pragma Convention specifies
C or Fortran convention for a derived Boolean, as in the following example:
</p>
<div class="smallexample">
<pre class="smallexample"> type C_Switch is new Boolean;
pragma Convention (C, C_Switch);
</pre></div>
<p>then the GNAT generated code will treat any nonzero value as true. For truth
values generated by GNAT, the conventional value 1 will be used for True, but
when one of these values is read, any nonzero value is treated as True.
</p>
</li><li> Access types on OpenVMS
For 64-bit OpenVMS systems, access types (other than those for unconstrained
arrays) are 64-bits long. An exception to this rule is for the case of
C-convention access types where there is no explicit size clause present (or
inherited for derived types). In this case, GNAT chooses to make these
pointers 32-bits, which provides an easier path for migration of 32-bit legacy
code. size clause specifying 64-bits must be used to obtain a 64-bit pointer.
</li></ul>
<hr>
<a name="Determining-the-Representations-chosen-by-GNAT"></a>
<div class="header">
<p>
Previous: <a href="#Effect-of-Convention-on-Representation" accesskey="p" rel="prev">Effect of Convention on Representation</a>, Up: <a href="#Representation-Clauses-and-Pragmas" accesskey="u" rel="up">Representation Clauses and Pragmas</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Determining-the-Representations-chosen-by-GNAT-1"></a>
<h3 class="section">7.16 Determining the Representations chosen by GNAT</h3>
<a name="index-Representation_002c-determination-of"></a>
<a name="index-_002dgnatR-switch"></a>
<p>Although the descriptions in this section are intended to be complete, it is
often easier to simply experiment to see what GNAT accepts and what the
effect is on the layout of types and objects.
</p>
<p>As required by the Ada RM, if a representation clause is not accepted, then
it must be rejected as illegal by the compiler. However, when a
representation clause or pragma is accepted, there can still be questions
of what the compiler actually does. For example, if a partial record
representation clause specifies the location of some components and not
others, then where are the non-specified components placed? Or if pragma
<code>Pack</code> is used on a record, then exactly where are the resulting
fields placed? The section on pragma <code>Pack</code> in this chapter can be
used to answer the second question, but it is often easier to just see
what the compiler does.
</p>
<p>For this purpose, GNAT provides the option <samp>-gnatR</samp>. If you compile
with this option, then the compiler will output information on the actual
representations chosen, in a format similar to source representation
clauses. For example, if we compile the package:
</p>
<div class="smallexample">
<pre class="smallexample">package q is
type r (x : boolean) is tagged record
case x is
when True => S : String (1 .. 100);
when False => null;
end case;
end record;
type r2 is new r (false) with record
y2 : integer;
end record;
for r2 use record
y2 at 16 range 0 .. 31;
end record;
type x is record
y : character;
end record;
type x1 is array (1 .. 10) of x;
for x1'component_size use 11;
type ia is access integer;
type Rb1 is array (1 .. 13) of Boolean;
pragma Pack (rb1);
type Rb2 is array (1 .. 65) of Boolean;
pragma Pack (rb2);
type x2 is record
l1 : Boolean;
l2 : Duration;
l3 : Float;
l4 : Boolean;
l5 : Rb1;
l6 : Rb2;
end record;
pragma Pack (x2);
end q;
</pre></div>
<p>using the switch <samp>-gnatR</samp> we obtain the following output:
</p>
<div class="smallexample">
<pre class="smallexample">Representation information for unit q
-------------------------------------
for r'Size use ??;
for r'Alignment use 4;
for r use record
x at 4 range 0 .. 7;
_tag at 0 range 0 .. 31;
s at 5 range 0 .. 799;
end record;
for r2'Size use 160;
for r2'Alignment use 4;
for r2 use record
x at 4 range 0 .. 7;
_tag at 0 range 0 .. 31;
_parent at 0 range 0 .. 63;
y2 at 16 range 0 .. 31;
end record;
for x'Size use 8;
for x'Alignment use 1;
for x use record
y at 0 range 0 .. 7;
end record;
for x1'Size use 112;
for x1'Alignment use 1;
for x1'Component_Size use 11;
for rb1'Size use 13;
for rb1'Alignment use 2;
for rb1'Component_Size use 1;
for rb2'Size use 72;
for rb2'Alignment use 1;
for rb2'Component_Size use 1;
for x2'Size use 224;
for x2'Alignment use 4;
for x2 use record
l1 at 0 range 0 .. 0;
l2 at 0 range 1 .. 64;
l3 at 12 range 0 .. 31;
l4 at 16 range 0 .. 0;
l5 at 16 range 1 .. 13;
l6 at 18 range 0 .. 71;
end record;
</pre></div>
<p>The Size values are actually the Object_Size, i.e. the default size that
will be allocated for objects of the type.
The ?? size for type r indicates that we have a variant record, and the
actual size of objects will depend on the discriminant value.
</p>
<p>The Alignment values show the actual alignment chosen by the compiler
for each record or array type.
</p>
<p>The record representation clause for type r shows where all fields
are placed, including the compiler generated tag field (whose location
cannot be controlled by the programmer).
</p>
<p>The record representation clause for the type extension r2 shows all the
fields present, including the parent field, which is a copy of the fields
of the parent type of r2, i.e. r1.
</p>
<p>The component size and size clauses for types rb1 and rb2 show
the exact effect of pragma <code>Pack</code> on these arrays, and the record
representation clause for type x2 shows how pragma <code>Pack</code> affects
this record type.
</p>
<p>In some cases, it may be useful to cut and paste the representation clauses
generated by the compiler into the original source to fix and guarantee
the actual representation to be used.
</p>
<hr>
<a name="Standard-Library-Routines"></a>
<div class="header">
<p>
Next: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="n" rel="next">The Implementation of Standard I/O</a>, Previous: <a href="#Representation-Clauses-and-Pragmas" accesskey="p" rel="prev">Representation Clauses and Pragmas</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Standard-Library-Routines-1"></a>
<h2 class="chapter">8 Standard Library Routines</h2>
<p>The Ada Reference Manual contains in Annex A a full description of an
extensive set of standard library routines that can be used in any Ada
program, and which must be provided by all Ada compilers. They are
analogous to the standard C library used by C programs.
</p>
<p>GNAT implements all of the facilities described in annex A, and for most
purposes the description in the Ada Reference Manual, or appropriate Ada
text book, will be sufficient for making use of these facilities.
</p>
<p>In the case of the input-output facilities,
See <a href="#The-Implementation-of-Standard-I_002fO">The Implementation of Standard I/O</a>,
gives details on exactly how GNAT interfaces to the
file system. For the remaining packages, the Ada Reference Manual
should be sufficient. The following is a list of the packages included,
together with a brief description of the functionality that is provided.
</p>
<p>For completeness, references are included to other predefined library
routines defined in other sections of the Ada Reference Manual (these are
cross-indexed from Annex A).
</p>
<dl compact="compact">
<dt><code>Ada (A.2)</code></dt>
<dd><p>This is a parent package for all the standard library packages. It is
usually included implicitly in your program, and itself contains no
useful data or routines.
</p>
</dd>
<dt><code>Ada.Calendar (9.6)</code></dt>
<dd><p><code>Calendar</code> provides time of day access, and routines for
manipulating times and durations.
</p>
</dd>
<dt><code>Ada.Characters (A.3.1)</code></dt>
<dd><p>This is a dummy parent package that contains no useful entities
</p>
</dd>
<dt><code>Ada.Characters.Handling (A.3.2)</code></dt>
<dd><p>This package provides some basic character handling capabilities,
including classification functions for classes of characters (e.g. test
for letters, or digits).
</p>
</dd>
<dt><code>Ada.Characters.Latin_1 (A.3.3)</code></dt>
<dd><p>This package includes a complete set of definitions of the characters
that appear in type CHARACTER. It is useful for writing programs that
will run in international environments. For example, if you want an
upper case E with an acute accent in a string, it is often better to use
the definition of <code>UC_E_Acute</code> in this package. Then your program
will print in an understandable manner even if your environment does not
support these extended characters.
</p>
</dd>
<dt><code>Ada.Command_Line (A.15)</code></dt>
<dd><p>This package provides access to the command line parameters and the name
of the current program (analogous to the use of <code>argc</code> and <code>argv</code>
in C), and also allows the exit status for the program to be set in a
system-independent manner.
</p>
</dd>
<dt><code>Ada.Decimal (F.2)</code></dt>
<dd><p>This package provides constants describing the range of decimal numbers
implemented, and also a decimal divide routine (analogous to the COBOL
verb DIVIDE … GIVING … REMAINDER …)
</p>
</dd>
<dt><code>Ada.Direct_IO (A.8.4)</code></dt>
<dd><p>This package provides input-output using a model of a set of records of
fixed-length, containing an arbitrary definite Ada type, indexed by an
integer record number.
</p>
</dd>
<dt><code>Ada.Dynamic_Priorities (D.5)</code></dt>
<dd><p>This package allows the priorities of a task to be adjusted dynamically
as the task is running.
</p>
</dd>
<dt><code>Ada.Exceptions (11.4.1)</code></dt>
<dd><p>This package provides additional information on exceptions, and also
contains facilities for treating exceptions as data objects, and raising
exceptions with associated messages.
</p>
</dd>
<dt><code>Ada.Finalization (7.6)</code></dt>
<dd><p>This package contains the declarations and subprograms to support the
use of controlled types, providing for automatic initialization and
finalization (analogous to the constructors and destructors of C++)
</p>
</dd>
<dt><code>Ada.Interrupts (C.3.2)</code></dt>
<dd><p>This package provides facilities for interfacing to interrupts, which
includes the set of signals or conditions that can be raised and
recognized as interrupts.
</p>
</dd>
<dt><code>Ada.Interrupts.Names (C.3.2)</code></dt>
<dd><p>This package provides the set of interrupt names (actually signal
or condition names) that can be handled by GNAT.
</p>
</dd>
<dt><code>Ada.IO_Exceptions (A.13)</code></dt>
<dd><p>This package defines the set of exceptions that can be raised by use of
the standard IO packages.
</p>
</dd>
<dt><code>Ada.Numerics</code></dt>
<dd><p>This package contains some standard constants and exceptions used
throughout the numerics packages. Note that the constants pi and e are
defined here, and it is better to use these definitions than rolling
your own.
</p>
</dd>
<dt><code>Ada.Numerics.Complex_Elementary_Functions</code></dt>
<dd><p>Provides the implementation of standard elementary functions (such as
log and trigonometric functions) operating on complex numbers using the
standard <code>Float</code> and the <code>Complex</code> and <code>Imaginary</code> types
created by the package <code>Numerics.Complex_Types</code>.
</p>
</dd>
<dt><code>Ada.Numerics.Complex_Types</code></dt>
<dd><p>This is a predefined instantiation of
<code>Numerics.Generic_Complex_Types</code> using <code>Standard.Float</code> to
build the type <code>Complex</code> and <code>Imaginary</code>.
</p>
</dd>
<dt><code>Ada.Numerics.Discrete_Random</code></dt>
<dd><p>This generic package provides a random number generator suitable for generating
uniformly distributed values of a specified discrete subtype.
</p>
</dd>
<dt><code>Ada.Numerics.Float_Random</code></dt>
<dd><p>This package provides a random number generator suitable for generating
uniformly distributed floating point values in the unit interval.
</p>
</dd>
<dt><code>Ada.Numerics.Generic_Complex_Elementary_Functions</code></dt>
<dd><p>This is a generic version of the package that provides the
implementation of standard elementary functions (such as log and
trigonometric functions) for an arbitrary complex type.
</p>
<p>The following predefined instantiations of this package are provided:
</p>
<dl compact="compact">
<dt><code>Short_Float</code></dt>
<dd><p><code>Ada.Numerics.Short_Complex_Elementary_Functions</code>
</p></dd>
<dt><code>Float</code></dt>
<dd><p><code>Ada.Numerics.Complex_Elementary_Functions</code>
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p><code>Ada.Numerics.Long_Complex_Elementary_Functions</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Numerics.Generic_Complex_Types</code></dt>
<dd><p>This is a generic package that allows the creation of complex types,
with associated complex arithmetic operations.
</p>
<p>The following predefined instantiations of this package exist
</p><dl compact="compact">
<dt><code>Short_Float</code></dt>
<dd><p><code>Ada.Numerics.Short_Complex_Complex_Types</code>
</p></dd>
<dt><code>Float</code></dt>
<dd><p><code>Ada.Numerics.Complex_Complex_Types</code>
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p><code>Ada.Numerics.Long_Complex_Complex_Types</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Numerics.Generic_Elementary_Functions</code></dt>
<dd><p>This is a generic package that provides the implementation of standard
elementary functions (such as log an trigonometric functions) for an
arbitrary float type.
</p>
<p>The following predefined instantiations of this package exist
</p>
<dl compact="compact">
<dt><code>Short_Float</code></dt>
<dd><p><code>Ada.Numerics.Short_Elementary_Functions</code>
</p></dd>
<dt><code>Float</code></dt>
<dd><p><code>Ada.Numerics.Elementary_Functions</code>
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p><code>Ada.Numerics.Long_Elementary_Functions</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Real_Time (D.8)</code></dt>
<dd><p>This package provides facilities similar to those of <code>Calendar</code>, but
operating with a finer clock suitable for real time control. Note that
annex D requires that there be no backward clock jumps, and GNAT generally
guarantees this behavior, but of course if the external clock on which
the GNAT runtime depends is deliberately reset by some external event,
then such a backward jump may occur.
</p>
</dd>
<dt><code>Ada.Sequential_IO (A.8.1)</code></dt>
<dd><p>This package provides input-output facilities for sequential files,
which can contain a sequence of values of a single type, which can be
any Ada type, including indefinite (unconstrained) types.
</p>
</dd>
<dt><code>Ada.Storage_IO (A.9)</code></dt>
<dd><p>This package provides a facility for mapping arbitrary Ada types to and
from a storage buffer. It is primarily intended for the creation of new
IO packages.
</p>
</dd>
<dt><code>Ada.Streams (13.13.1)</code></dt>
<dd><p>This is a generic package that provides the basic support for the
concept of streams as used by the stream attributes (<code>Input</code>,
<code>Output</code>, <code>Read</code> and <code>Write</code>).
</p>
</dd>
<dt><code>Ada.Streams.Stream_IO (A.12.1)</code></dt>
<dd><p>This package is a specialization of the type <code>Streams</code> defined in
package <code>Streams</code> together with a set of operations providing
Stream_IO capability. The Stream_IO model permits both random and
sequential access to a file which can contain an arbitrary set of values
of one or more Ada types.
</p>
</dd>
<dt><code>Ada.Strings (A.4.1)</code></dt>
<dd><p>This package provides some basic constants used by the string handling
packages.
</p>
</dd>
<dt><code>Ada.Strings.Bounded (A.4.4)</code></dt>
<dd><p>This package provides facilities for handling variable length
strings. The bounded model requires a maximum length. It is thus
somewhat more limited than the unbounded model, but avoids the use of
dynamic allocation or finalization.
</p>
</dd>
<dt><code>Ada.Strings.Fixed (A.4.3)</code></dt>
<dd><p>This package provides facilities for handling fixed length strings.
</p>
</dd>
<dt><code>Ada.Strings.Maps (A.4.2)</code></dt>
<dd><p>This package provides facilities for handling character mappings and
arbitrarily defined subsets of characters. For instance it is useful in
defining specialized translation tables.
</p>
</dd>
<dt><code>Ada.Strings.Maps.Constants (A.4.6)</code></dt>
<dd><p>This package provides a standard set of predefined mappings and
predefined character sets. For example, the standard upper to lower case
conversion table is found in this package. Note that upper to lower case
conversion is non-trivial if you want to take the entire set of
characters, including extended characters like E with an acute accent,
into account. You should use the mappings in this package (rather than
adding 32 yourself) to do case mappings.
</p>
</dd>
<dt><code>Ada.Strings.Unbounded (A.4.5)</code></dt>
<dd><p>This package provides facilities for handling variable length
strings. The unbounded model allows arbitrary length strings, but
requires the use of dynamic allocation and finalization.
</p>
</dd>
<dt><code>Ada.Strings.Wide_Bounded (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Fixed (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Maps (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Maps.Constants (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Unbounded (A.4.7)</code></dt>
<dd><p>These packages provide analogous capabilities to the corresponding
packages without ‘<samp>Wide_</samp>’ in the name, but operate with the types
<code>Wide_String</code> and <code>Wide_Character</code> instead of <code>String</code>
and <code>Character</code>.
</p>
</dd>
<dt><code>Ada.Strings.Wide_Wide_Bounded (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Wide_Fixed (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Wide_Maps (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Wide_Maps.Constants (A.4.7)</code></dt>
<dt><code>Ada.Strings.Wide_Wide_Unbounded (A.4.7)</code></dt>
<dd><p>These packages provide analogous capabilities to the corresponding
packages without ‘<samp>Wide_</samp>’ in the name, but operate with the types
<code>Wide_Wide_String</code> and <code>Wide_Wide_Character</code> instead
of <code>String</code> and <code>Character</code>.
</p>
</dd>
<dt><code>Ada.Synchronous_Task_Control (D.10)</code></dt>
<dd><p>This package provides some standard facilities for controlling task
communication in a synchronous manner.
</p>
</dd>
<dt><code>Ada.Tags</code></dt>
<dd><p>This package contains definitions for manipulation of the tags of tagged
values.
</p>
</dd>
<dt><code>Ada.Task_Attributes</code></dt>
<dd><p>This package provides the capability of associating arbitrary
task-specific data with separate tasks.
</p>
</dd>
<dt><code>Ada.Text_IO</code></dt>
<dd><p>This package provides basic text input-output capabilities for
character, string and numeric data. The subpackages of this
package are listed next.
</p>
</dd>
<dt><code>Ada.Text_IO.Decimal_IO</code></dt>
<dd><p>Provides input-output facilities for decimal fixed-point types
</p>
</dd>
<dt><code>Ada.Text_IO.Enumeration_IO</code></dt>
<dd><p>Provides input-output facilities for enumeration types.
</p>
</dd>
<dt><code>Ada.Text_IO.Fixed_IO</code></dt>
<dd><p>Provides input-output facilities for ordinary fixed-point types.
</p>
</dd>
<dt><code>Ada.Text_IO.Float_IO</code></dt>
<dd><p>Provides input-output facilities for float types. The following
predefined instantiations of this generic package are available:
</p>
<dl compact="compact">
<dt><code>Short_Float</code></dt>
<dd><p><code>Short_Float_Text_IO</code>
</p></dd>
<dt><code>Float</code></dt>
<dd><p><code>Float_Text_IO</code>
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p><code>Long_Float_Text_IO</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Text_IO.Integer_IO</code></dt>
<dd><p>Provides input-output facilities for integer types. The following
predefined instantiations of this generic package are available:
</p>
<dl compact="compact">
<dt><code>Short_Short_Integer</code></dt>
<dd><p><code>Ada.Short_Short_Integer_Text_IO</code>
</p></dd>
<dt><code>Short_Integer</code></dt>
<dd><p><code>Ada.Short_Integer_Text_IO</code>
</p></dd>
<dt><code>Integer</code></dt>
<dd><p><code>Ada.Integer_Text_IO</code>
</p></dd>
<dt><code>Long_Integer</code></dt>
<dd><p><code>Ada.Long_Integer_Text_IO</code>
</p></dd>
<dt><code>Long_Long_Integer</code></dt>
<dd><p><code>Ada.Long_Long_Integer_Text_IO</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Text_IO.Modular_IO</code></dt>
<dd><p>Provides input-output facilities for modular (unsigned) types
</p>
</dd>
<dt><code>Ada.Text_IO.Complex_IO (G.1.3)</code></dt>
<dd><p>This package provides basic text input-output capabilities for complex
data.
</p>
</dd>
<dt><code>Ada.Text_IO.Editing (F.3.3)</code></dt>
<dd><p>This package contains routines for edited output, analogous to the use
of pictures in COBOL. The picture formats used by this package are a
close copy of the facility in COBOL.
</p>
</dd>
<dt><code>Ada.Text_IO.Text_Streams (A.12.2)</code></dt>
<dd><p>This package provides a facility that allows Text_IO files to be treated
as streams, so that the stream attributes can be used for writing
arbitrary data, including binary data, to Text_IO files.
</p>
</dd>
<dt><code>Ada.Unchecked_Conversion (13.9)</code></dt>
<dd><p>This generic package allows arbitrary conversion from one type to
another of the same size, providing for breaking the type safety in
special circumstances.
</p>
<p>If the types have the same Size (more accurately the same Value_Size),
then the effect is simply to transfer the bits from the source to the
target type without any modification. This usage is well defined, and
for simple types whose representation is typically the same across
all implementations, gives a portable method of performing such
conversions.
</p>
<p>If the types do not have the same size, then the result is implementation
defined, and thus may be non-portable. The following describes how GNAT
handles such unchecked conversion cases.
</p>
<p>If the types are of different sizes, and are both discrete types, then
the effect is of a normal type conversion without any constraint checking.
In particular if the result type has a larger size, the result will be
zero or sign extended. If the result type has a smaller size, the result
will be truncated by ignoring high order bits.
</p>
<p>If the types are of different sizes, and are not both discrete types,
then the conversion works as though pointers were created to the source
and target, and the pointer value is converted. The effect is that bits
are copied from successive low order storage units and bits of the source
up to the length of the target type.
</p>
<p>A warning is issued if the lengths differ, since the effect in this
case is implementation dependent, and the above behavior may not match
that of some other compiler.
</p>
<p>A pointer to one type may be converted to a pointer to another type using
unchecked conversion. The only case in which the effect is undefined is
when one or both pointers are pointers to unconstrained array types. In
this case, the bounds information may get incorrectly transferred, and in
particular, GNAT uses double size pointers for such types, and it is
meaningless to convert between such pointer types. GNAT will issue a
warning if the alignment of the target designated type is more strict
than the alignment of the source designated type (since the result may
be unaligned in this case).
</p>
<p>A pointer other than a pointer to an unconstrained array type may be
converted to and from System.Address. Such usage is common in Ada 83
programs, but note that Ada.Address_To_Access_Conversions is the
preferred method of performing such conversions in Ada 95 and Ada 2005.
Neither
unchecked conversion nor Ada.Address_To_Access_Conversions should be
used in conjunction with pointers to unconstrained objects, since
the bounds information cannot be handled correctly in this case.
</p>
</dd>
<dt><code>Ada.Unchecked_Deallocation (13.11.2)</code></dt>
<dd><p>This generic package allows explicit freeing of storage previously
allocated by use of an allocator.
</p>
</dd>
<dt><code>Ada.Wide_Text_IO (A.11)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO</code>, except that the external
file supports wide character representations, and the internal types are
<code>Wide_Character</code> and <code>Wide_String</code> instead of <code>Character</code>
and <code>String</code>. It contains generic subpackages listed next.
</p>
</dd>
<dt><code>Ada.Wide_Text_IO.Decimal_IO</code></dt>
<dd><p>Provides input-output facilities for decimal fixed-point types
</p>
</dd>
<dt><code>Ada.Wide_Text_IO.Enumeration_IO</code></dt>
<dd><p>Provides input-output facilities for enumeration types.
</p>
</dd>
<dt><code>Ada.Wide_Text_IO.Fixed_IO</code></dt>
<dd><p>Provides input-output facilities for ordinary fixed-point types.
</p>
</dd>
<dt><code>Ada.Wide_Text_IO.Float_IO</code></dt>
<dd><p>Provides input-output facilities for float types. The following
predefined instantiations of this generic package are available:
</p>
<dl compact="compact">
<dt><code>Short_Float</code></dt>
<dd><p><code>Short_Float_Wide_Text_IO</code>
</p></dd>
<dt><code>Float</code></dt>
<dd><p><code>Float_Wide_Text_IO</code>
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p><code>Long_Float_Wide_Text_IO</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Wide_Text_IO.Integer_IO</code></dt>
<dd><p>Provides input-output facilities for integer types. The following
predefined instantiations of this generic package are available:
</p>
<dl compact="compact">
<dt><code>Short_Short_Integer</code></dt>
<dd><p><code>Ada.Short_Short_Integer_Wide_Text_IO</code>
</p></dd>
<dt><code>Short_Integer</code></dt>
<dd><p><code>Ada.Short_Integer_Wide_Text_IO</code>
</p></dd>
<dt><code>Integer</code></dt>
<dd><p><code>Ada.Integer_Wide_Text_IO</code>
</p></dd>
<dt><code>Long_Integer</code></dt>
<dd><p><code>Ada.Long_Integer_Wide_Text_IO</code>
</p></dd>
<dt><code>Long_Long_Integer</code></dt>
<dd><p><code>Ada.Long_Long_Integer_Wide_Text_IO</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Wide_Text_IO.Modular_IO</code></dt>
<dd><p>Provides input-output facilities for modular (unsigned) types
</p>
</dd>
<dt><code>Ada.Wide_Text_IO.Complex_IO (G.1.3)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO.Complex_IO</code>, except that the
external file supports wide character representations.
</p>
</dd>
<dt><code>Ada.Wide_Text_IO.Editing (F.3.4)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO.Editing</code>, except that the
types are <code>Wide_Character</code> and <code>Wide_String</code> instead of
<code>Character</code> and <code>String</code>.
</p>
</dd>
<dt><code>Ada.Wide_Text_IO.Streams (A.12.3)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO.Streams</code>, except that the
types are <code>Wide_Character</code> and <code>Wide_String</code> instead of
<code>Character</code> and <code>String</code>.
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO (A.11)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO</code>, except that the external
file supports wide character representations, and the internal types are
<code>Wide_Character</code> and <code>Wide_String</code> instead of <code>Character</code>
and <code>String</code>. It contains generic subpackages listed next.
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Decimal_IO</code></dt>
<dd><p>Provides input-output facilities for decimal fixed-point types
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Enumeration_IO</code></dt>
<dd><p>Provides input-output facilities for enumeration types.
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Fixed_IO</code></dt>
<dd><p>Provides input-output facilities for ordinary fixed-point types.
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Float_IO</code></dt>
<dd><p>Provides input-output facilities for float types. The following
predefined instantiations of this generic package are available:
</p>
<dl compact="compact">
<dt><code>Short_Float</code></dt>
<dd><p><code>Short_Float_Wide_Wide_Text_IO</code>
</p></dd>
<dt><code>Float</code></dt>
<dd><p><code>Float_Wide_Wide_Text_IO</code>
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p><code>Long_Float_Wide_Wide_Text_IO</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Integer_IO</code></dt>
<dd><p>Provides input-output facilities for integer types. The following
predefined instantiations of this generic package are available:
</p>
<dl compact="compact">
<dt><code>Short_Short_Integer</code></dt>
<dd><p><code>Ada.Short_Short_Integer_Wide_Wide_Text_IO</code>
</p></dd>
<dt><code>Short_Integer</code></dt>
<dd><p><code>Ada.Short_Integer_Wide_Wide_Text_IO</code>
</p></dd>
<dt><code>Integer</code></dt>
<dd><p><code>Ada.Integer_Wide_Wide_Text_IO</code>
</p></dd>
<dt><code>Long_Integer</code></dt>
<dd><p><code>Ada.Long_Integer_Wide_Wide_Text_IO</code>
</p></dd>
<dt><code>Long_Long_Integer</code></dt>
<dd><p><code>Ada.Long_Long_Integer_Wide_Wide_Text_IO</code>
</p></dd>
</dl>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Modular_IO</code></dt>
<dd><p>Provides input-output facilities for modular (unsigned) types
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Complex_IO (G.1.3)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO.Complex_IO</code>, except that the
external file supports wide character representations.
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Editing (F.3.4)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO.Editing</code>, except that the
types are <code>Wide_Character</code> and <code>Wide_String</code> instead of
<code>Character</code> and <code>String</code>.
</p>
</dd>
<dt><code>Ada.Wide_Wide_Text_IO.Streams (A.12.3)</code></dt>
<dd><p>This package is similar to <code>Ada.Text_IO.Streams</code>, except that the
types are <code>Wide_Character</code> and <code>Wide_String</code> instead of
<code>Character</code> and <code>String</code>.
</p></dd>
</dl>
<hr>
<a name="The-Implementation-of-Standard-I_002fO"></a>
<div class="header">
<p>
Next: <a href="#The-GNAT-Library" accesskey="n" rel="next">The GNAT Library</a>, Previous: <a href="#Standard-Library-Routines" accesskey="p" rel="prev">Standard Library Routines</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="The-Implementation-of-Standard-I_002fO-1"></a>
<h2 class="chapter">9 The Implementation of Standard I/O</h2>
<p>GNAT implements all the required input-output facilities described in
A.6 through A.14. These sections of the Ada Reference Manual describe the
required behavior of these packages from the Ada point of view, and if
you are writing a portable Ada program that does not need to know the
exact manner in which Ada maps to the outside world when it comes to
reading or writing external files, then you do not need to read this
chapter. As long as your files are all regular files (not pipes or
devices), and as long as you write and read the files only from Ada, the
description in the Ada Reference Manual is sufficient.
</p>
<p>However, if you want to do input-output to pipes or other devices, such
as the keyboard or screen, or if the files you are dealing with are
either generated by some other language, or to be read by some other
language, then you need to know more about the details of how the GNAT
implementation of these input-output facilities behaves.
</p>
<p>In this chapter we give a detailed description of exactly how GNAT
interfaces to the file system. As always, the sources of the system are
available to you for answering questions at an even more detailed level,
but for most purposes the information in this chapter will suffice.
</p>
<p>Another reason that you may need to know more about how input-output is
implemented arises when you have a program written in mixed languages
where, for example, files are shared between the C and Ada sections of
the same program. GNAT provides some additional facilities, in the form
of additional child library packages, that facilitate this sharing, and
these additional facilities are also described in this chapter.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Standard-I_002fO-Packages" accesskey="1">Standard I/O Packages</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#FORM-Strings" accesskey="2">FORM Strings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Direct_005fIO" accesskey="3">Direct_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Sequential_005fIO" accesskey="4">Sequential_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO" accesskey="5">Text_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fText_005fIO" accesskey="6">Wide_Text_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fWide_005fText_005fIO" accesskey="7">Wide_Wide_Text_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Stream_005fIO" accesskey="8">Stream_IO</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text-Translation" accesskey="9">Text Translation</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Shared-Files">Shared Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Filenames-encoding">Filenames encoding</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Open-Modes">Open Modes</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Operations-on-C-Streams">Operations on C Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-C-Streams">Interfacing to C Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Standard-I_002fO-Packages"></a>
<div class="header">
<p>
Next: <a href="#FORM-Strings" accesskey="n" rel="next">FORM Strings</a>, Previous: <a href="#SPARK" accesskey="p" rel="prev">SPARK</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Standard-I_002fO-Packages-1"></a>
<h3 class="section">9.1 Standard I/O Packages</h3>
<p>The Standard I/O packages described in Annex A for
</p>
<ul>
<li> Ada.Text_IO
</li><li> Ada.Text_IO.Complex_IO
</li><li> Ada.Text_IO.Text_Streams
</li><li> Ada.Wide_Text_IO
</li><li> Ada.Wide_Text_IO.Complex_IO
</li><li> Ada.Wide_Text_IO.Text_Streams
</li><li> Ada.Wide_Wide_Text_IO
</li><li> Ada.Wide_Wide_Text_IO.Complex_IO
</li><li> Ada.Wide_Wide_Text_IO.Text_Streams
</li><li> Ada.Stream_IO
</li><li> Ada.Sequential_IO
</li><li> Ada.Direct_IO
</li></ul>
<p>are implemented using the C
library streams facility; where
</p>
<ul>
<li> All files are opened using <code>fopen</code>.
</li><li> All input/output operations use <code>fread</code>/<code>fwrite</code>.
</li></ul>
<p>There is no internal buffering of any kind at the Ada library level. The only
buffering is that provided at the system level in the implementation of the
library routines that support streams. This facilitates shared use of these
streams by mixed language programs. Note though that system level buffering is
explicitly enabled at elaboration of the standard I/O packages and that can
have an impact on mixed language programs, in particular those using I/O before
calling the Ada elaboration routine (e.g. adainit). It is recommended to call
the Ada elaboration routine before performing any I/O or when impractical,
flush the common I/O streams and in particular Standard_Output before
elaborating the Ada code.
</p>
<hr>
<a name="FORM-Strings"></a>
<div class="header">
<p>
Next: <a href="#Direct_005fIO" accesskey="n" rel="next">Direct_IO</a>, Previous: <a href="#Standard-I_002fO-Packages" accesskey="p" rel="prev">Standard I/O Packages</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FORM-Strings-1"></a>
<h3 class="section">9.2 FORM Strings</h3>
<p>The format of a FORM string in GNAT is:
</p>
<div class="smallexample">
<pre class="smallexample">"keyword=value,keyword=value,…,keyword=value"
</pre></div>
<p>where letters may be in upper or lower case, and there are no spaces
between values. The order of the entries is not important. Currently
the following keywords defined.
</p>
<div class="smallexample">
<pre class="smallexample">TEXT_TRANSLATION=[YES|NO]
SHARED=[YES|NO]
WCEM=[n|h|u|s|e|8|b]
ENCODING=[UTF8|8BITS]
</pre></div>
<p>The use of these parameters is described later in this section. If an
unrecognized keyword appears in a form string, it is silently ignored
and not considered invalid.
</p>
<hr>
<a name="Direct_005fIO"></a>
<div class="header">
<p>
Next: <a href="#Sequential_005fIO" accesskey="n" rel="next">Sequential_IO</a>, Previous: <a href="#FORM-Strings" accesskey="p" rel="prev">FORM Strings</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Direct_005fIO-1"></a>
<h3 class="section">9.3 Direct_IO</h3>
<p>Direct_IO can only be instantiated for definite types. This is a
restriction of the Ada language, which means that the records are fixed
length (the length being determined by <code><var>type</var>'Size</code>, rounded
up to the next storage unit boundary if necessary).
</p>
<p>The records of a Direct_IO file are simply written to the file in index
sequence, with the first record starting at offset zero, and subsequent
records following. There is no control information of any kind. For
example, if 32-bit integers are being written, each record takes
4-bytes, so the record at index <var>K</var> starts at offset
(<var>K</var>-1)*4.
</p>
<p>There is no limit on the size of Direct_IO files, they are expanded as
necessary to accommodate whatever records are written to the file.
</p>
<hr>
<a name="Sequential_005fIO"></a>
<div class="header">
<p>
Next: <a href="#Text_005fIO" accesskey="n" rel="next">Text_IO</a>, Previous: <a href="#Direct_005fIO" accesskey="p" rel="prev">Direct_IO</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Sequential_005fIO-1"></a>
<h3 class="section">9.4 Sequential_IO</h3>
<p>Sequential_IO may be instantiated with either a definite (constrained)
or indefinite (unconstrained) type.
</p>
<p>For the definite type case, the elements written to the file are simply
the memory images of the data values with no control information of any
kind. The resulting file should be read using the same type, no validity
checking is performed on input.
</p>
<p>For the indefinite type case, the elements written consist of two
parts. First is the size of the data item, written as the memory image
of a <code>Interfaces.C.size_t</code> value, followed by the memory image of
the data value. The resulting file can only be read using the same
(unconstrained) type. Normal assignment checks are performed on these
read operations, and if these checks fail, <code>Data_Error</code> is
raised. In particular, in the array case, the lengths must match, and in
the variant record case, if the variable for a particular read operation
is constrained, the discriminants must match.
</p>
<p>Note that it is not possible to use Sequential_IO to write variable
length array items, and then read the data back into different length
arrays. For example, the following will raise <code>Data_Error</code>:
</p>
<div class="smallexample">
<pre class="smallexample"> package IO is new Sequential_IO (String);
F : IO.File_Type;
S : String (1..4);
…
IO.Create (F)
IO.Write (F, "hello!")
IO.Reset (F, Mode=>In_File);
IO.Read (F, S);
Put_Line (S);
</pre></div>
<p>On some Ada implementations, this will print <code>hell</code>, but the program is
clearly incorrect, since there is only one element in the file, and that
element is the string <code>hello!</code>.
</p>
<p>In Ada 95 and Ada 2005, this kind of behavior can be legitimately achieved
using Stream_IO, and this is the preferred mechanism. In particular, the
above program fragment rewritten to use Stream_IO will work correctly.
</p>
<hr>
<a name="Text_005fIO"></a>
<div class="header">
<p>
Next: <a href="#Wide_005fText_005fIO" accesskey="n" rel="next">Wide_Text_IO</a>, Previous: <a href="#Sequential_005fIO" accesskey="p" rel="prev">Sequential_IO</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Text_005fIO-1"></a>
<h3 class="section">9.5 Text_IO</h3>
<p>Text_IO files consist of a stream of characters containing the following
special control characters:
</p>
<div class="smallexample">
<pre class="smallexample">LF (line feed, 16#0A#) Line Mark
FF (form feed, 16#0C#) Page Mark
</pre></div>
<p>A canonical Text_IO file is defined as one in which the following
conditions are met:
</p>
<ul>
<li> The character <code>LF</code> is used only as a line mark, i.e. to mark the end
of the line.
</li><li> The character <code>FF</code> is used only as a page mark, i.e. to mark the
end of a page and consequently can appear only immediately following a
<code>LF</code> (line mark) character.
</li><li> The file ends with either <code>LF</code> (line mark) or <code>LF</code>-<code>FF</code>
(line mark, page mark). In the former case, the page mark is implicitly
assumed to be present.
</li></ul>
<p>A file written using Text_IO will be in canonical form provided that no
explicit <code>LF</code> or <code>FF</code> characters are written using <code>Put</code>
or <code>Put_Line</code>. There will be no <code>FF</code> character at the end of
the file unless an explicit <code>New_Page</code> operation was performed
before closing the file.
</p>
<p>A canonical Text_IO file that is a regular file (i.e., not a device or a
pipe) can be read using any of the routines in Text_IO. The
semantics in this case will be exactly as defined in the Ada Reference
Manual, and all the routines in Text_IO are fully implemented.
</p>
<p>A text file that does not meet the requirements for a canonical Text_IO
file has one of the following:
</p>
<ul>
<li> The file contains <code>FF</code> characters not immediately following a
<code>LF</code> character.
</li><li> The file contains <code>LF</code> or <code>FF</code> characters written by
<code>Put</code> or <code>Put_Line</code>, which are not logically considered to be
line marks or page marks.
</li><li> The file ends in a character other than <code>LF</code> or <code>FF</code>,
i.e. there is no explicit line mark or page mark at the end of the file.
</li></ul>
<p>Text_IO can be used to read such non-standard text files but subprograms
to do with line or page numbers do not have defined meanings. In
particular, a <code>FF</code> character that does not follow a <code>LF</code>
character may or may not be treated as a page mark from the point of
view of page and line numbering. Every <code>LF</code> character is considered
to end a line, and there is an implied <code>LF</code> character at the end of
the file.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Text_005fIO-Stream-Pointer-Positioning" accesskey="1">Text_IO Stream Pointer Positioning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="2">Text_IO Reading and Writing Non-Regular Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Get_005fImmediate" accesskey="3">Get_Immediate</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Treating-Text_005fIO-Files-as-Streams" accesskey="4">Treating Text_IO Files as Streams</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO-Extensions" accesskey="5">Text_IO Extensions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Text_005fIO-Facilities-for-Unbounded-Strings" accesskey="6">Text_IO Facilities for Unbounded Strings</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Text_005fIO-Stream-Pointer-Positioning"></a>
<div class="header">
<p>
Next: <a href="#Text_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="n" rel="next">Text_IO Reading and Writing Non-Regular Files</a>, Previous: <a href="#System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029" accesskey="p" rel="prev">System.Wch_Con (s-wchcon.ads)</a>, Up: <a href="#Text_005fIO" accesskey="u" rel="up">Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Stream-Pointer-Positioning"></a>
<h4 class="subsection">9.5.1 Stream Pointer Positioning</h4>
<p><code>Ada.Text_IO</code> has a definition of current position for a file that
is being read. No internal buffering occurs in Text_IO, and usually the
physical position in the stream used to implement the file corresponds
to this logical position defined by Text_IO. There are two exceptions:
</p>
<ul>
<li> After a call to <code>End_Of_Page</code> that returns <code>True</code>, the stream
is positioned past the <code>LF</code> (line mark) that precedes the page
mark. Text_IO maintains an internal flag so that subsequent read
operations properly handle the logical position which is unchanged by
the <code>End_Of_Page</code> call.
</li><li> After a call to <code>End_Of_File</code> that returns <code>True</code>, if the
Text_IO file was positioned before the line mark at the end of file
before the call, then the logical position is unchanged, but the stream
is physically positioned right at the end of file (past the line mark,
and past a possible page mark following the line mark. Again Text_IO
maintains internal flags so that subsequent read operations properly
handle the logical position.
</li></ul>
<p>These discrepancies have no effect on the observable behavior of
Text_IO, but if a single Ada stream is shared between a C program and
Ada program, or shared (using ‘<samp>shared=yes</samp>’ in the form string)
between two Ada files, then the difference may be observable in some
situations.
</p>
<hr>
<a name="Text_005fIO-Reading-and-Writing-Non_002dRegular-Files"></a>
<div class="header">
<p>
Next: <a href="#Get_005fImmediate" accesskey="n" rel="next">Get_Immediate</a>, Previous: <a href="#Text_005fIO-Stream-Pointer-Positioning" accesskey="p" rel="prev">Text_IO Stream Pointer Positioning</a>, Up: <a href="#Text_005fIO" accesskey="u" rel="up">Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Reading-and-Writing-Non_002dRegular-Files"></a>
<h4 class="subsection">9.5.2 Reading and Writing Non-Regular Files</h4>
<p>A non-regular file is a device (such as a keyboard), or a pipe. Text_IO
can be used for reading and writing. Writing is not affected and the
sequence of characters output is identical to the normal file case, but
for reading, the behavior of Text_IO is modified to avoid undesirable
look-ahead as follows:
</p>
<p>An input file that is not a regular file is considered to have no page
marks. Any <code>Ascii.FF</code> characters (the character normally used for a
page mark) appearing in the file are considered to be data
characters. In particular:
</p>
<ul>
<li> <code>Get_Line</code> and <code>Skip_Line</code> do not test for a page mark
following a line mark. If a page mark appears, it will be treated as a
data character.
</li><li> This avoids the need to wait for an extra character to be typed or
entered from the pipe to complete one of these operations.
</li><li> <code>End_Of_Page</code> always returns <code>False</code>
</li><li> <code>End_Of_File</code> will return <code>False</code> if there is a page mark at
the end of the file.
</li></ul>
<p>Output to non-regular files is the same as for regular files. Page marks
may be written to non-regular files using <code>New_Page</code>, but as noted
above they will not be treated as page marks on input if the output is
piped to another Ada program.
</p>
<p>Another important discrepancy when reading non-regular files is that the end
of file indication is not “sticky”. If an end of file is entered, e.g. by
pressing the <tt class="key">EOT</tt> key,
then end of file
is signaled once (i.e. the test <code>End_Of_File</code>
will yield <code>True</code>, or a read will
raise <code>End_Error</code>), but then reading can resume
to read data past that end of
file indication, until another end of file indication is entered.
</p>
<hr>
<a name="Get_005fImmediate"></a>
<div class="header">
<p>
Next: <a href="#Treating-Text_005fIO-Files-as-Streams" accesskey="n" rel="next">Treating Text_IO Files as Streams</a>, Previous: <a href="#Text_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="p" rel="prev">Text_IO Reading and Writing Non-Regular Files</a>, Up: <a href="#Text_005fIO" accesskey="u" rel="up">Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Get_005fImmediate-1"></a>
<h4 class="subsection">9.5.3 Get_Immediate</h4>
<a name="index-Get_005fImmediate"></a>
<p>Get_Immediate returns the next character (including control characters)
from the input file. In particular, Get_Immediate will return LF or FF
characters used as line marks or page marks. Such operations leave the
file positioned past the control character, and it is thus not treated
as having its normal function. This means that page, line and column
counts after this kind of Get_Immediate call are set as though the mark
did not occur. In the case where a Get_Immediate leaves the file
positioned between the line mark and page mark (which is not normally
possible), it is undefined whether the FF character will be treated as a
page mark.
</p>
<hr>
<a name="Treating-Text_005fIO-Files-as-Streams"></a>
<div class="header">
<p>
Next: <a href="#Text_005fIO-Extensions" accesskey="n" rel="next">Text_IO Extensions</a>, Previous: <a href="#Get_005fImmediate" accesskey="p" rel="prev">Get_Immediate</a>, Up: <a href="#Text_005fIO" accesskey="u" rel="up">Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Treating-Text_005fIO-Files-as-Streams-1"></a>
<h4 class="subsection">9.5.4 Treating Text_IO Files as Streams</h4>
<a name="index-Stream-files"></a>
<p>The package <code>Text_IO.Streams</code> allows a Text_IO file to be treated
as a stream. Data written to a Text_IO file in this stream mode is
binary data. If this binary data contains bytes 16#0A# (<code>LF</code>) or
16#0C# (<code>FF</code>), the resulting file may have non-standard
format. Similarly if read operations are used to read from a Text_IO
file treated as a stream, then <code>LF</code> and <code>FF</code> characters may be
skipped and the effect is similar to that described above for
<code>Get_Immediate</code>.
</p>
<hr>
<a name="Text_005fIO-Extensions"></a>
<div class="header">
<p>
Next: <a href="#Text_005fIO-Facilities-for-Unbounded-Strings" accesskey="n" rel="next">Text_IO Facilities for Unbounded Strings</a>, Previous: <a href="#Treating-Text_005fIO-Files-as-Streams" accesskey="p" rel="prev">Treating Text_IO Files as Streams</a>, Up: <a href="#Text_005fIO" accesskey="u" rel="up">Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Text_005fIO-Extensions-1"></a>
<h4 class="subsection">9.5.5 Text_IO Extensions</h4>
<a name="index-Text_005fIO-extensions"></a>
<p>A package GNAT.IO_Aux in the GNAT library provides some useful extensions
to the standard <code>Text_IO</code> package:
</p>
<ul>
<li> function File_Exists (Name : String) return Boolean;
Determines if a file of the given name exists.
</li><li> function Get_Line return String;
Reads a string from the standard input file. The value returned is exactly
the length of the line that was read.
</li><li> function Get_Line (File : Ada.Text_IO.File_Type) return String;
Similar, except that the parameter File specifies the file from which
the string is to be read.
</li></ul>
<hr>
<a name="Text_005fIO-Facilities-for-Unbounded-Strings"></a>
<div class="header">
<p>
Next: <a href="#Wide_005fText_005fIO-Stream-Pointer-Positioning" accesskey="n" rel="next">Wide_Text_IO Stream Pointer Positioning</a>, Previous: <a href="#Text_005fIO-Extensions" accesskey="p" rel="prev">Text_IO Extensions</a>, Up: <a href="#Text_005fIO" accesskey="u" rel="up">Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Text_005fIO-Facilities-for-Unbounded-Strings-1"></a>
<h4 class="subsection">9.5.6 Text_IO Facilities for Unbounded Strings</h4>
<a name="index-Text_005fIO-for-unbounded-strings"></a>
<a name="index-Unbounded_005fString_002c-Text_005fIO-operations"></a>
<p>The package <code>Ada.Strings.Unbounded.Text_IO</code>
in library files <code>a-suteio.ads/adb</code> contains some GNAT-specific
subprograms useful for Text_IO operations on unbounded strings:
</p>
<ul>
<li> function Get_Line (File : File_Type) return Unbounded_String;
Reads a line from the specified file
and returns the result as an unbounded string.
</li><li> procedure Put (File : File_Type; U : Unbounded_String);
Writes the value of the given unbounded string to the specified file
Similar to the effect of
<code>Put (To_String (U))</code> except that an extra copy is avoided.
</li><li> procedure Put_Line (File : File_Type; U : Unbounded_String);
Writes the value of the given unbounded string to the specified file,
followed by a <code>New_Line</code>.
Similar to the effect of <code>Put_Line (To_String (U))</code> except
that an extra copy is avoided.
</li></ul>
<p>In the above procedures, <code>File</code> is of type <code>Ada.Text_IO.File_Type</code>
and is optional. If the parameter is omitted, then the standard input or
output file is referenced as appropriate.
</p>
<p>The package <code>Ada.Strings.Wide_Unbounded.Wide_Text_IO</code> in library
files <samp>a-swuwti.ads</samp> and <samp>a-swuwti.adb</samp> provides similar extended
<code>Wide_Text_IO</code> functionality for unbounded wide strings.
</p>
<p>The package <code>Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO</code> in library
files <samp>a-szuzti.ads</samp> and <samp>a-szuzti.adb</samp> provides similar extended
<code>Wide_Wide_Text_IO</code> functionality for unbounded wide wide strings.
</p>
<hr>
<a name="Wide_005fText_005fIO"></a>
<div class="header">
<p>
Next: <a href="#Wide_005fWide_005fText_005fIO" accesskey="n" rel="next">Wide_Wide_Text_IO</a>, Previous: <a href="#Text_005fIO" accesskey="p" rel="prev">Text_IO</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Wide_005fText_005fIO-1"></a>
<h3 class="section">9.6 Wide_Text_IO</h3>
<p><code>Wide_Text_IO</code> is similar in most respects to Text_IO, except that
both input and output files may contain special sequences that represent
wide character values. The encoding scheme for a given file may be
specified using a FORM parameter:
</p>
<div class="smallexample">
<pre class="smallexample">WCEM=<var>x</var>
</pre></div>
<p>as part of the FORM string (WCEM = wide character encoding method),
where <var>x</var> is one of the following characters
</p>
<dl compact="compact">
<dt>‘<samp>h</samp>’</dt>
<dd><p>Hex ESC encoding
</p></dd>
<dt>‘<samp>u</samp>’</dt>
<dd><p>Upper half encoding
</p></dd>
<dt>‘<samp>s</samp>’</dt>
<dd><p>Shift-JIS encoding
</p></dd>
<dt>‘<samp>e</samp>’</dt>
<dd><p>EUC Encoding
</p></dd>
<dt>‘<samp>8</samp>’</dt>
<dd><p>UTF-8 encoding
</p></dd>
<dt>‘<samp>b</samp>’</dt>
<dd><p>Brackets encoding
</p></dd>
</dl>
<p>The encoding methods match those that
can be used in a source
program, but there is no requirement that the encoding method used for
the source program be the same as the encoding method used for files,
and different files may use different encoding methods.
</p>
<p>The default encoding method for the standard files, and for opened files
for which no WCEM parameter is given in the FORM string matches the
wide character encoding specified for the main program (the default
being brackets encoding if no coding method was specified with -gnatW).
</p>
<dl compact="compact">
<dt>Hex Coding</dt>
<dd><p>In this encoding, a wide character is represented by a five character
sequence:
</p>
<div class="smallexample">
<pre class="smallexample">ESC a b c d
</pre></div>
<p>where <var>a</var>, <var>b</var>, <var>c</var>, <var>d</var> are the four hexadecimal
characters (using upper case letters) of the wide character code. For
example, ESC A345 is used to represent the wide character with code
16#A345#. This scheme is compatible with use of the full
<code>Wide_Character</code> set.
</p>
</dd>
<dt>Upper Half Coding</dt>
<dd><p>The wide character with encoding 16#abcd#, where the upper bit is on
(i.e. a is in the range 8-F) is represented as two bytes 16#ab# and
16#cd#. The second byte may never be a format control character, but is
not required to be in the upper half. This method can be also used for
shift-JIS or EUC where the internal coding matches the external coding.
</p>
</dd>
<dt>Shift JIS Coding</dt>
<dd><p>A wide character is represented by a two character sequence 16#ab# and
16#cd#, with the restrictions described for upper half encoding as
described above. The internal character code is the corresponding JIS
character according to the standard algorithm for Shift-JIS
conversion. Only characters defined in the JIS code set table can be
used with this encoding method.
</p>
</dd>
<dt>EUC Coding</dt>
<dd><p>A wide character is represented by a two character sequence 16#ab# and
16#cd#, with both characters being in the upper half. The internal
character code is the corresponding JIS character according to the EUC
encoding algorithm. Only characters defined in the JIS code set table
can be used with this encoding method.
</p>
</dd>
<dt>UTF-8 Coding</dt>
<dd><p>A wide character is represented using
UCS Transformation Format 8 (UTF-8) as defined in Annex R of ISO
10646-1/Am.2. Depending on the character value, the representation
is a one, two, or three byte sequence:
</p>
<div class="smallexample">
<pre class="smallexample">16#0000#-16#007f#: 2#0xxxxxxx#
16#0080#-16#07ff#: 2#110xxxxx# 2#10xxxxxx#
16#0800#-16#ffff#: 2#1110xxxx# 2#10xxxxxx# 2#10xxxxxx#
</pre></div>
<p>where the <var>xxx</var> bits correspond to the left-padded bits of the
16-bit character value. Note that all lower half ASCII characters
are represented as ASCII bytes and all upper half characters and
other wide characters are represented as sequences of upper-half
(The full UTF-8 scheme allows for encoding 31-bit characters as
6-byte sequences, but in this implementation, all UTF-8 sequences
of four or more bytes length will raise a Constraint_Error, as
will all invalid UTF-8 sequences.)
</p>
</dd>
<dt>Brackets Coding</dt>
<dd><p>In this encoding, a wide character is represented by the following eight
character sequence:
</p>
<div class="smallexample">
<pre class="smallexample">[ " a b c d " ]
</pre></div>
<p>where <code>a</code>, <code>b</code>, <code>c</code>, <code>d</code> are the four hexadecimal
characters (using uppercase letters) of the wide character code. For
example, <code>["A345"]</code> is used to represent the wide character with code
<code>16#A345#</code>.
This scheme is compatible with use of the full Wide_Character set.
On input, brackets coding can also be used for upper half characters,
e.g. <code>["C1"]</code> for lower case a. However, on output, brackets notation
is only used for wide characters with a code greater than <code>16#FF#</code>.
</p>
<p>Note that brackets coding is not normally used in the context of
Wide_Text_IO or Wide_Wide_Text_IO, since it is really just designed as
a portable way of encoding source files. In the context of Wide_Text_IO
or Wide_Wide_Text_IO, it can only be used if the file does not contain
any instance of the left bracket character other than to encode wide
character values using the brackets encoding method. In practice it is
expected that some standard wide character encoding method such
as UTF-8 will be used for text input output.
</p>
<p>If brackets notation is used, then any occurrence of a left bracket
in the input file which is not the start of a valid wide character
sequence will cause Constraint_Error to be raised. It is possible to
encode a left bracket as ["5B"] and Wide_Text_IO and Wide_Wide_Text_IO
input will interpret this as a left bracket.
</p>
<p>However, when a left bracket is output, it will be output as a left bracket
and not as ["5B"]. We make this decision because for normal use of
Wide_Text_IO for outputting messages, it is unpleasant to clobber left
brackets. For example, if we write:
</p>
<div class="smallexample">
<pre class="smallexample"> Put_Line ("Start of output [first run]");
</pre></div>
<p>we really do not want to have the left bracket in this message clobbered so
that the output reads:
</p>
<div class="smallexample">
<pre class="smallexample"> Start of output ["5B"]first run]
</pre></div>
<p>In practice brackets encoding is reasonably useful for normal Put_Line use
since we won’t get confused between left brackets and wide character
sequences in the output. But for input, or when files are written out
and read back in, it really makes better sense to use one of the standard
encoding methods such as UTF-8.
</p>
</dd>
</dl>
<p>For the coding schemes other than UTF-8, Hex, or Brackets encoding,
not all wide character
values can be represented. An attempt to output a character that cannot
be represented using the encoding scheme for the file causes
Constraint_Error to be raised. An invalid wide character sequence on
input also causes Constraint_Error to be raised.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Wide_005fText_005fIO-Stream-Pointer-Positioning" accesskey="1">Wide_Text_IO Stream Pointer Positioning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="2">Wide_Text_IO Reading and Writing Non-Regular Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Wide_005fText_005fIO-Stream-Pointer-Positioning"></a>
<div class="header">
<p>
Next: <a href="#Wide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="n" rel="next">Wide_Text_IO Reading and Writing Non-Regular Files</a>, Previous: <a href="#Text_005fIO-Facilities-for-Unbounded-Strings" accesskey="p" rel="prev">Text_IO Facilities for Unbounded Strings</a>, Up: <a href="#Wide_005fText_005fIO" accesskey="u" rel="up">Wide_Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Stream-Pointer-Positioning-1"></a>
<h4 class="subsection">9.6.1 Stream Pointer Positioning</h4>
<p><code>Ada.Wide_Text_IO</code> is similar to <code>Ada.Text_IO</code> in its handling
of stream pointer positioning (see <a href="#Text_005fIO">Text_IO</a>). There is one additional
case:
</p>
<p>If <code>Ada.Wide_Text_IO.Look_Ahead</code> reads a character outside the
normal lower ASCII set (i.e. a character in the range:
</p>
<div class="smallexample">
<pre class="smallexample">Wide_Character'Val (16#0080#) .. Wide_Character'Val (16#FFFF#)
</pre></div>
<p>then although the logical position of the file pointer is unchanged by
the <code>Look_Ahead</code> call, the stream is physically positioned past the
wide character sequence. Again this is to avoid the need for buffering
or backup, and all <code>Wide_Text_IO</code> routines check the internal
indication that this situation has occurred so that this is not visible
to a normal program using <code>Wide_Text_IO</code>. However, this discrepancy
can be observed if the wide text file shares a stream with another file.
</p>
<hr>
<a name="Wide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files"></a>
<div class="header">
<p>
Next: <a href="#Wide_005fWide_005fText_005fIO-Stream-Pointer-Positioning" accesskey="n" rel="next">Wide_Wide_Text_IO Stream Pointer Positioning</a>, Previous: <a href="#Wide_005fText_005fIO-Stream-Pointer-Positioning" accesskey="p" rel="prev">Wide_Text_IO Stream Pointer Positioning</a>, Up: <a href="#Wide_005fText_005fIO" accesskey="u" rel="up">Wide_Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Reading-and-Writing-Non_002dRegular-Files-1"></a>
<h4 class="subsection">9.6.2 Reading and Writing Non-Regular Files</h4>
<p>As in the case of Text_IO, when a non-regular file is read, it is
assumed that the file contains no page marks (any form characters are
treated as data characters), and <code>End_Of_Page</code> always returns
<code>False</code>. Similarly, the end of file indication is not sticky, so
it is possible to read beyond an end of file.
</p>
<hr>
<a name="Wide_005fWide_005fText_005fIO"></a>
<div class="header">
<p>
Next: <a href="#Stream_005fIO" accesskey="n" rel="next">Stream_IO</a>, Previous: <a href="#Wide_005fText_005fIO" accesskey="p" rel="prev">Wide_Text_IO</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Wide_005fWide_005fText_005fIO-1"></a>
<h3 class="section">9.7 Wide_Wide_Text_IO</h3>
<p><code>Wide_Wide_Text_IO</code> is similar in most respects to Text_IO, except that
both input and output files may contain special sequences that represent
wide wide character values. The encoding scheme for a given file may be
specified using a FORM parameter:
</p>
<div class="smallexample">
<pre class="smallexample">WCEM=<var>x</var>
</pre></div>
<p>as part of the FORM string (WCEM = wide character encoding method),
where <var>x</var> is one of the following characters
</p>
<dl compact="compact">
<dt>‘<samp>h</samp>’</dt>
<dd><p>Hex ESC encoding
</p></dd>
<dt>‘<samp>u</samp>’</dt>
<dd><p>Upper half encoding
</p></dd>
<dt>‘<samp>s</samp>’</dt>
<dd><p>Shift-JIS encoding
</p></dd>
<dt>‘<samp>e</samp>’</dt>
<dd><p>EUC Encoding
</p></dd>
<dt>‘<samp>8</samp>’</dt>
<dd><p>UTF-8 encoding
</p></dd>
<dt>‘<samp>b</samp>’</dt>
<dd><p>Brackets encoding
</p></dd>
</dl>
<p>The encoding methods match those that
can be used in a source
program, but there is no requirement that the encoding method used for
the source program be the same as the encoding method used for files,
and different files may use different encoding methods.
</p>
<p>The default encoding method for the standard files, and for opened files
for which no WCEM parameter is given in the FORM string matches the
wide character encoding specified for the main program (the default
being brackets encoding if no coding method was specified with -gnatW).
</p>
<dl compact="compact">
<dt>UTF-8 Coding</dt>
<dd><p>A wide character is represented using
UCS Transformation Format 8 (UTF-8) as defined in Annex R of ISO
10646-1/Am.2. Depending on the character value, the representation
is a one, two, three, or four byte sequence:
</p>
<div class="smallexample">
<pre class="smallexample">16#000000#-16#00007f#: 2#0xxxxxxx#
16#000080#-16#0007ff#: 2#110xxxxx# 2#10xxxxxx#
16#000800#-16#00ffff#: 2#1110xxxx# 2#10xxxxxx# 2#10xxxxxx#
16#010000#-16#10ffff#: 2#11110xxx# 2#10xxxxxx# 2#10xxxxxx# 2#10xxxxxx#
</pre></div>
<p>where the <var>xxx</var> bits correspond to the left-padded bits of the
21-bit character value. Note that all lower half ASCII characters
are represented as ASCII bytes and all upper half characters and
other wide characters are represented as sequences of upper-half
characters.
</p>
</dd>
<dt>Brackets Coding</dt>
<dd><p>In this encoding, a wide wide character is represented by the following eight
character sequence if is in wide character range
</p>
<div class="smallexample">
<pre class="smallexample">[ " a b c d " ]
</pre></div>
<p>and by the following ten character sequence if not
</p>
<div class="smallexample">
<pre class="smallexample">[ " a b c d e f " ]
</pre></div>
<p>where <code>a</code>, <code>b</code>, <code>c</code>, <code>d</code>, <code>e</code>, and <code>f</code>
are the four or six hexadecimal
characters (using uppercase letters) of the wide wide character code. For
example, <code>["01A345"]</code> is used to represent the wide wide character
with code <code>16#01A345#</code>.
</p>
<p>This scheme is compatible with use of the full Wide_Wide_Character set.
On input, brackets coding can also be used for upper half characters,
e.g. <code>["C1"]</code> for lower case a. However, on output, brackets notation
is only used for wide characters with a code greater than <code>16#FF#</code>.
</p>
</dd>
</dl>
<p>If is also possible to use the other Wide_Character encoding methods,
such as Shift-JIS, but the other schemes cannot support the full range
of wide wide characters.
An attempt to output a character that cannot
be represented using the encoding scheme for the file causes
Constraint_Error to be raised. An invalid wide character sequence on
input also causes Constraint_Error to be raised.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Wide_005fWide_005fText_005fIO-Stream-Pointer-Positioning" accesskey="1">Wide_Wide_Text_IO Stream Pointer Positioning</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Wide_005fWide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="2">Wide_Wide_Text_IO Reading and Writing Non-Regular Files</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Wide_005fWide_005fText_005fIO-Stream-Pointer-Positioning"></a>
<div class="header">
<p>
Next: <a href="#Wide_005fWide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="n" rel="next">Wide_Wide_Text_IO Reading and Writing Non-Regular Files</a>, Previous: <a href="#Wide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="p" rel="prev">Wide_Text_IO Reading and Writing Non-Regular Files</a>, Up: <a href="#Wide_005fWide_005fText_005fIO" accesskey="u" rel="up">Wide_Wide_Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Stream-Pointer-Positioning-2"></a>
<h4 class="subsection">9.7.1 Stream Pointer Positioning</h4>
<p><code>Ada.Wide_Wide_Text_IO</code> is similar to <code>Ada.Text_IO</code> in its handling
of stream pointer positioning (see <a href="#Text_005fIO">Text_IO</a>). There is one additional
case:
</p>
<p>If <code>Ada.Wide_Wide_Text_IO.Look_Ahead</code> reads a character outside the
normal lower ASCII set (i.e. a character in the range:
</p>
<div class="smallexample">
<pre class="smallexample">Wide_Wide_Character'Val (16#0080#) .. Wide_Wide_Character'Val (16#10FFFF#)
</pre></div>
<p>then although the logical position of the file pointer is unchanged by
the <code>Look_Ahead</code> call, the stream is physically positioned past the
wide character sequence. Again this is to avoid the need for buffering
or backup, and all <code>Wide_Wide_Text_IO</code> routines check the internal
indication that this situation has occurred so that this is not visible
to a normal program using <code>Wide_Wide_Text_IO</code>. However, this discrepancy
can be observed if the wide text file shares a stream with another file.
</p>
<hr>
<a name="Wide_005fWide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files"></a>
<div class="header">
<p>
Next: <a href="#Interfacing-to-C" accesskey="n" rel="next">Interfacing to C</a>, Previous: <a href="#Wide_005fWide_005fText_005fIO-Stream-Pointer-Positioning" accesskey="p" rel="prev">Wide_Wide_Text_IO Stream Pointer Positioning</a>, Up: <a href="#Wide_005fWide_005fText_005fIO" accesskey="u" rel="up">Wide_Wide_Text_IO</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Reading-and-Writing-Non_002dRegular-Files-2"></a>
<h4 class="subsection">9.7.2 Reading and Writing Non-Regular Files</h4>
<p>As in the case of Text_IO, when a non-regular file is read, it is
assumed that the file contains no page marks (any form characters are
treated as data characters), and <code>End_Of_Page</code> always returns
<code>False</code>. Similarly, the end of file indication is not sticky, so
it is possible to read beyond an end of file.
</p>
<hr>
<a name="Stream_005fIO"></a>
<div class="header">
<p>
Next: <a href="#Text-Translation" accesskey="n" rel="next">Text Translation</a>, Previous: <a href="#Wide_005fWide_005fText_005fIO" accesskey="p" rel="prev">Wide_Wide_Text_IO</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Stream_005fIO-1"></a>
<h3 class="section">9.8 Stream_IO</h3>
<p>A stream file is a sequence of bytes, where individual elements are
written to the file as described in the Ada Reference Manual. The type
<code>Stream_Element</code> is simply a byte. There are two ways to read or
write a stream file.
</p>
<ul>
<li> The operations <code>Read</code> and <code>Write</code> directly read or write a
sequence of stream elements with no control information.
</li><li> The stream attributes applied to a stream file transfer data in the
manner described for stream attributes.
</li></ul>
<hr>
<a name="Text-Translation"></a>
<div class="header">
<p>
Next: <a href="#Shared-Files" accesskey="n" rel="next">Shared Files</a>, Previous: <a href="#Stream_005fIO" accesskey="p" rel="prev">Stream_IO</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Text-Translation-1"></a>
<h3 class="section">9.9 Text Translation</h3>
<p>‘<samp>Text_Translation=<var>xxx</var></samp>’ may be used as the Form parameter
passed to Text_IO.Create and Text_IO.Open:
‘<samp>Text_Translation=<var>Yes</var></samp>’ is the default, which means to
translate LF to/from CR/LF on Windows systems.
‘<samp>Text_Translation=<var>No</var></samp>’ disables this translation; i.e. it
uses binary mode. For output files, ‘<samp>Text_Translation=<var>No</var></samp>’
may be used to create Unix-style files on
Windows. ‘<samp>Text_Translation=<var>xxx</var></samp>’ has no effect on Unix
systems.
</p>
<hr>
<a name="Shared-Files"></a>
<div class="header">
<p>
Next: <a href="#Filenames-encoding" accesskey="n" rel="next">Filenames encoding</a>, Previous: <a href="#Text-Translation" accesskey="p" rel="prev">Text Translation</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Shared-Files-1"></a>
<h3 class="section">9.10 Shared Files</h3>
<p>Section A.14 of the Ada Reference Manual allows implementations to
provide a wide variety of behavior if an attempt is made to access the
same external file with two or more internal files.
</p>
<p>To provide a full range of functionality, while at the same time
minimizing the problems of portability caused by this implementation
dependence, GNAT handles file sharing as follows:
</p>
<ul>
<li> In the absence of a ‘<samp>shared=<var>xxx</var></samp>’ form parameter, an attempt
to open two or more files with the same full name is considered an error
and is not supported. The exception <code>Use_Error</code> will be
raised. Note that a file that is not explicitly closed by the program
remains open until the program terminates.
</li><li> If the form parameter ‘<samp>shared=no</samp>’ appears in the form string, the
file can be opened or created with its own separate stream identifier,
regardless of whether other files sharing the same external file are
opened. The exact effect depends on how the C stream routines handle
multiple accesses to the same external files using separate streams.
</li><li> If the form parameter ‘<samp>shared=yes</samp>’ appears in the form string for
each of two or more files opened using the same full name, the same
stream is shared between these files, and the semantics are as described
in Ada Reference Manual, Section A.14.
</li></ul>
<p>When a program that opens multiple files with the same name is ported
from another Ada compiler to GNAT, the effect will be that
<code>Use_Error</code> is raised.
</p>
<p>The documentation of the original compiler and the documentation of the
program should then be examined to determine if file sharing was
expected, and ‘<samp>shared=<var>xxx</var></samp>’ parameters added to <code>Open</code>
and <code>Create</code> calls as required.
</p>
<p>When a program is ported from GNAT to some other Ada compiler, no
special attention is required unless the ‘<samp>shared=<var>xxx</var></samp>’ form
parameter is used in the program. In this case, you must examine the
documentation of the new compiler to see if it supports the required
file sharing semantics, and form strings modified appropriately. Of
course it may be the case that the program cannot be ported if the
target compiler does not support the required functionality. The best
approach in writing portable code is to avoid file sharing (and hence
the use of the ‘<samp>shared=<var>xxx</var></samp>’ parameter in the form string)
completely.
</p>
<p>One common use of file sharing in Ada 83 is the use of instantiations of
Sequential_IO on the same file with different types, to achieve
heterogeneous input-output. Although this approach will work in GNAT if
‘<samp>shared=yes</samp>’ is specified, it is preferable in Ada to use Stream_IO
for this purpose (using the stream attributes)
</p>
<hr>
<a name="Filenames-encoding"></a>
<div class="header">
<p>
Next: <a href="#Open-Modes" accesskey="n" rel="next">Open Modes</a>, Previous: <a href="#Shared-Files" accesskey="p" rel="prev">Shared Files</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Filenames-encoding-1"></a>
<h3 class="section">9.11 Filenames encoding</h3>
<p>An encoding form parameter can be used to specify the filename
encoding ‘<samp>encoding=<var>xxx</var></samp>’.
</p>
<ul>
<li> If the form parameter ‘<samp>encoding=utf8</samp>’ appears in the form string, the
filename must be encoded in UTF-8.
</li><li> If the form parameter ‘<samp>encoding=8bits</samp>’ appears in the form
string, the filename must be a standard 8bits string.
</li></ul>
<p>In the absence of a ‘<samp>encoding=<var>xxx</var></samp>’ form parameter, the
encoding is controlled by the ‘<samp>GNAT_CODE_PAGE</samp>’ environment
variable. And if not set ‘<samp>utf8</samp>’ is assumed.
</p>
<dl compact="compact">
<dt>‘<samp>CP_ACP</samp>’</dt>
<dd><p>The current system Windows ANSI code page.
</p></dd>
<dt>‘<samp>CP_UTF8</samp>’</dt>
<dd><p>UTF-8 encoding
</p></dd>
</dl>
<p>This encoding form parameter is only supported on the Windows
platform. On the other Operating Systems the run-time is supporting
UTF-8 natively.
</p>
<hr>
<a name="Open-Modes"></a>
<div class="header">
<p>
Next: <a href="#Operations-on-C-Streams" accesskey="n" rel="next">Operations on C Streams</a>, Previous: <a href="#Filenames-encoding" accesskey="p" rel="prev">Filenames encoding</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Open-Modes-1"></a>
<h3 class="section">9.12 Open Modes</h3>
<p><code>Open</code> and <code>Create</code> calls result in a call to <code>fopen</code>
using the mode shown in the following table:
</p>
<br>
<br>
<div align="center"><code>Open</code> and <code>Create</code> Call Modes
</div><div class="smallexample">
<pre class="smallexample"> <b>OPEN </b> <b>CREATE</b>
Append_File "r+" "w+"
In_File "r" "w+"
Out_File (Direct_IO) "r+" "w"
Out_File (all other cases) "w" "w"
Inout_File "r+" "w+"
</pre></div>
<p>If text file translation is required, then either ‘<samp>b</samp>’ or ‘<samp>t</samp>’
is added to the mode, depending on the setting of Text. Text file
translation refers to the mapping of CR/LF sequences in an external file
to LF characters internally. This mapping only occurs in DOS and
DOS-like systems, and is not relevant to other systems.
</p>
<p>A special case occurs with Stream_IO. As shown in the above table, the
file is initially opened in ‘<samp>r</samp>’ or ‘<samp>w</samp>’ mode for the
<code>In_File</code> and <code>Out_File</code> cases. If a <code>Set_Mode</code> operation
subsequently requires switching from reading to writing or vice-versa,
then the file is reopened in ‘<samp>r+</samp>’ mode to permit the required operation.
</p>
<hr>
<a name="Operations-on-C-Streams"></a>
<div class="header">
<p>
Next: <a href="#Interfacing-to-C-Streams" accesskey="n" rel="next">Interfacing to C Streams</a>, Previous: <a href="#Open-Modes" accesskey="p" rel="prev">Open Modes</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Operations-on-C-Streams-1"></a>
<h3 class="section">9.13 Operations on C Streams</h3>
<p>The package <code>Interfaces.C_Streams</code> provides an Ada program with direct
access to the C library functions for operations on C streams:
</p>
<div class="smallexample">
<pre class="smallexample">package Interfaces.C_Streams is
-- Note: the reason we do not use the types that are in
-- Interfaces.C is that we want to avoid dragging in the
-- code in this unit if possible.
subtype chars is System.Address;
-- Pointer to null-terminated array of characters
subtype FILEs is System.Address;
-- Corresponds to the C type FILE*
subtype voids is System.Address;
-- Corresponds to the C type void*
subtype int is Integer;
subtype long is Long_Integer;
-- Note: the above types are subtypes deliberately, and it
-- is part of this spec that the above correspondences are
-- guaranteed. This means that it is legitimate to, for
-- example, use Integer instead of int. We provide these
-- synonyms for clarity, but in some cases it may be
-- convenient to use the underlying types (for example to
-- avoid an unnecessary dependency of a spec on the spec
-- of this unit).
type size_t is mod 2 ** Standard'Address_Size;
NULL_Stream : constant FILEs;
-- Value returned (NULL in C) to indicate an
-- fdopen/fopen/tmpfile error
----------------------------------
-- Constants Defined in stdio.h --
----------------------------------
EOF : constant int;
-- Used by a number of routines to indicate error or
-- end of file
IOFBF : constant int;
IOLBF : constant int;
IONBF : constant int;
-- Used to indicate buffering mode for setvbuf call
SEEK_CUR : constant int;
SEEK_END : constant int;
SEEK_SET : constant int;
-- Used to indicate origin for fseek call
function stdin return FILEs;
function stdout return FILEs;
function stderr return FILEs;
-- Streams associated with standard files
--------------------------
-- Standard C functions --
--------------------------
-- The functions selected below are ones that are
-- available in UNIX (but not necessarily in ANSI C).
-- These are very thin interfaces
-- which copy exactly the C headers. For more
-- documentation on these functions, see the Microsoft C
-- "Run-Time Library Reference" (Microsoft Press, 1990,
-- ISBN 1-55615-225-6), which includes useful information
-- on system compatibility.
procedure clearerr (stream : FILEs);
function fclose (stream : FILEs) return int;
function fdopen (handle : int; mode : chars) return FILEs;
function feof (stream : FILEs) return int;
function ferror (stream : FILEs) return int;
function fflush (stream : FILEs) return int;
function fgetc (stream : FILEs) return int;
function fgets (strng : chars; n : int; stream : FILEs)
return chars;
function fileno (stream : FILEs) return int;
function fopen (filename : chars; Mode : chars)
return FILEs;
-- Note: to maintain target independence, use
-- text_translation_required, a boolean variable defined in
-- a-sysdep.c to deal with the target dependent text
-- translation requirement. If this variable is set,
-- then b/t should be appended to the standard mode
-- argument to set the text translation mode off or on
-- as required.
function fputc (C : int; stream : FILEs) return int;
function fputs (Strng : chars; Stream : FILEs) return int;
function fread
(buffer : voids;
size : size_t;
count : size_t;
stream : FILEs)
return size_t;
function freopen
(filename : chars;
mode : chars;
stream : FILEs)
return FILEs;
function fseek
(stream : FILEs;
offset : long;
origin : int)
return int;
function ftell (stream : FILEs) return long;
function fwrite
(buffer : voids;
size : size_t;
count : size_t;
stream : FILEs)
return size_t;
function isatty (handle : int) return int;
procedure mktemp (template : chars);
-- The return value (which is just a pointer to template)
-- is discarded
procedure rewind (stream : FILEs);
function rmtmp return int;
function setvbuf
(stream : FILEs;
buffer : chars;
mode : int;
size : size_t)
return int;
function tmpfile return FILEs;
function ungetc (c : int; stream : FILEs) return int;
function unlink (filename : chars) return int;
---------------------
-- Extra functions --
---------------------
-- These functions supply slightly thicker bindings than
-- those above. They are derived from functions in the
-- C Run-Time Library, but may do a bit more work than
-- just directly calling one of the Library functions.
function is_regular_file (handle : int) return int;
-- Tests if given handle is for a regular file (result 1)
-- or for a non-regular file (pipe or device, result 0).
---------------------------------
-- Control of Text/Binary Mode --
---------------------------------
-- If text_translation_required is true, then the following
-- functions may be used to dynamically switch a file from
-- binary to text mode or vice versa. These functions have
-- no effect if text_translation_required is false (i.e. in
-- normal UNIX mode). Use fileno to get a stream handle.
procedure set_binary_mode (handle : int);
procedure set_text_mode (handle : int);
----------------------------
-- Full Path Name support --
----------------------------
procedure full_name (nam : chars; buffer : chars);
-- Given a NUL terminated string representing a file
-- name, returns in buffer a NUL terminated string
-- representing the full path name for the file name.
-- On systems where it is relevant the drive is also
-- part of the full path name. It is the responsibility
-- of the caller to pass an actual parameter for buffer
-- that is big enough for any full path name. Use
-- max_path_len given below as the size of buffer.
max_path_len : integer;
-- Maximum length of an allowable full path name on the
-- system, including a terminating NUL character.
end Interfaces.C_Streams;
</pre></div>
<hr>
<a name="Interfacing-to-C-Streams"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029" accesskey="n" rel="next">Ada.Characters.Latin_9 (a-chlat9.ads)</a>, Previous: <a href="#Operations-on-C-Streams" accesskey="p" rel="prev">Operations on C Streams</a>, Up: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="u" rel="up">The Implementation of Standard I/O</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfacing-to-C-Streams-1"></a>
<h3 class="section">9.14 Interfacing to C Streams</h3>
<p>The packages in this section permit interfacing Ada files to C Stream
operations.
</p>
<div class="smallexample">
<pre class="smallexample"> with Interfaces.C_Streams;
package Ada.Sequential_IO.C_Streams is
function C_Stream (F : File_Type)
return Interfaces.C_Streams.FILEs;
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in Interfaces.C_Streams.FILEs;
Form : in String := "");
end Ada.Sequential_IO.C_Streams;
with Interfaces.C_Streams;
package Ada.Direct_IO.C_Streams is
function C_Stream (F : File_Type)
return Interfaces.C_Streams.FILEs;
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in Interfaces.C_Streams.FILEs;
Form : in String := "");
end Ada.Direct_IO.C_Streams;
with Interfaces.C_Streams;
package Ada.Text_IO.C_Streams is
function C_Stream (F : File_Type)
return Interfaces.C_Streams.FILEs;
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in Interfaces.C_Streams.FILEs;
Form : in String := "");
end Ada.Text_IO.C_Streams;
with Interfaces.C_Streams;
package Ada.Wide_Text_IO.C_Streams is
function C_Stream (F : File_Type)
return Interfaces.C_Streams.FILEs;
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in Interfaces.C_Streams.FILEs;
Form : in String := "");
end Ada.Wide_Text_IO.C_Streams;
with Interfaces.C_Streams;
package Ada.Wide_Wide_Text_IO.C_Streams is
function C_Stream (F : File_Type)
return Interfaces.C_Streams.FILEs;
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in Interfaces.C_Streams.FILEs;
Form : in String := "");
end Ada.Wide_Wide_Text_IO.C_Streams;
with Interfaces.C_Streams;
package Ada.Stream_IO.C_Streams is
function C_Stream (F : File_Type)
return Interfaces.C_Streams.FILEs;
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in Interfaces.C_Streams.FILEs;
Form : in String := "");
end Ada.Stream_IO.C_Streams;
</pre></div>
<p>In each of these six packages, the <code>C_Stream</code> function obtains the
<code>FILE</code> pointer from a currently opened Ada file. It is then
possible to use the <code>Interfaces.C_Streams</code> package to operate on
this stream, or the stream can be passed to a C program which can
operate on it directly. Of course the program is responsible for
ensuring that only appropriate sequences of operations are executed.
</p>
<p>One particular use of relevance to an Ada program is that the
<code>setvbuf</code> function can be used to control the buffering of the
stream used by an Ada file. In the absence of such a call the standard
default buffering is used.
</p>
<p>The <code>Open</code> procedures in these packages open a file giving an
existing C Stream instead of a file name. Typically this stream is
imported from a C program, allowing an Ada file to operate on an
existing C file.
</p>
<hr>
<a name="The-GNAT-Library"></a>
<div class="header">
<p>
Next: <a href="#Interfacing-to-Other-Languages" accesskey="n" rel="next">Interfacing to Other Languages</a>, Previous: <a href="#The-Implementation-of-Standard-I_002fO" accesskey="p" rel="prev">The Implementation of Standard I/O</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="The-GNAT-Library-1"></a>
<h2 class="chapter">10 The GNAT Library</h2>
<p>The GNAT library contains a number of general and special purpose packages.
It represents functionality that the GNAT developers have found useful, and
which is made available to GNAT users. The packages described here are fully
supported, and upwards compatibility will be maintained in future releases,
so you can use these facilities with the confidence that the same functionality
will be available in future releases.
</p>
<p>The chapter here simply gives a brief summary of the facilities available.
The full documentation is found in the spec file for the package. The full
sources of these library packages, including both spec and body, are provided
with all GNAT releases. For example, to find out the full specifications of
the SPITBOL pattern matching capability, including a full tutorial and
extensive examples, look in the <samp>g-spipat.ads</samp> file in the library.
</p>
<p>For each entry here, the package name (as it would appear in a <code>with</code>
clause) is given, followed by the name of the corresponding spec file in
parentheses. The packages are children in four hierarchies, <code>Ada</code>,
<code>Interfaces</code>, <code>System</code>, and <code>GNAT</code>, the latter being a
GNAT-specific hierarchy.
</p>
<p>Note that an application program should only use packages in one of these
four hierarchies if the package is defined in the Ada Reference Manual,
or is listed in this section of the GNAT Programmers Reference Manual.
All other units should be considered internal implementation units and
should not be directly <code>with</code>’ed by application code. The use of
a <code>with</code> statement that references one of these internal implementation
units makes an application potentially dependent on changes in versions
of GNAT, and will generate a warning message.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029" accesskey="1">Ada.Characters.Latin_9 (a-chlat9.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029" accesskey="2">Ada.Characters.Wide_Latin_1 (a-cwila1.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029" accesskey="3">Ada.Characters.Wide_Latin_9 (a-cwila9.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029" accesskey="4">Ada.Characters.Wide_Wide_Latin_1 (a-chzla1.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029" accesskey="5">Ada.Characters.Wide_Wide_Latin_9 (a-chzla9.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029" accesskey="6">Ada.Containers.Formal_Doubly_Linked_Lists (a-cfdlli.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029" accesskey="7">Ada.Containers.Formal_Hashed_Maps (a-cfhama.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029" accesskey="8">Ada.Containers.Formal_Hashed_Sets (a-cfhase.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029" accesskey="9">Ada.Containers.Formal_Ordered_Maps (a-cforma.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029">Ada.Containers.Formal_Ordered_Sets (a-cforse.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029">Ada.Containers.Formal_Vectors (a-cofove.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029">Ada.Command_Line.Environment (a-colien.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029">Ada.Command_Line.Remove (a-colire.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029">Ada.Command_Line.Response_File (a-clrefi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029">Ada.Direct_IO.C_Streams (a-diocst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029">Ada.Exceptions.Is_Null_Occurrence (a-einuoc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029">Ada.Exceptions.Last_Chance_Handler (a-elchha.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029">Ada.Exceptions.Traceback (a-exctra.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029">Ada.Sequential_IO.C_Streams (a-siocst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029">Ada.Streams.Stream_IO.C_Streams (a-ssicst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029">Ada.Strings.Unbounded.Text_IO (a-suteio.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029">Ada.Strings.Wide_Unbounded.Wide_Text_IO (a-swuwti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029">Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO (a-szuzti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029">Ada.Text_IO.C_Streams (a-tiocst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029">Ada.Text_IO.Reset_Standard_Files (a-tirsfi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029">Ada.Wide_Characters.Unicode (a-wichun.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029">Ada.Wide_Text_IO.C_Streams (a-wtcstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029">Ada.Wide_Text_IO.Reset_Standard_Files (a-wrstfi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029">Ada.Wide_Wide_Characters.Unicode (a-zchuni.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029">Ada.Wide_Wide_Text_IO.C_Streams (a-ztcstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029">Ada.Wide_Wide_Text_IO.Reset_Standard_Files (a-zrstfi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec-_0028g_002daltive_002eads_0029">GNAT.Altivec (g-altive.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029">GNAT.Altivec.Conversions (g-altcon.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029">GNAT.Altivec.Vector_Operations (g-alveop.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029">GNAT.Altivec.Vector_Types (g-alvety.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029">GNAT.Altivec.Vector_Views (g-alvevi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029">GNAT.Array_Split (g-arrspl.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029">GNAT.AWK (g-awk.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029">GNAT.Bounded_Buffers (g-boubuf.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029">GNAT.Bounded_Mailboxes (g-boumai.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029">GNAT.Bubble_Sort (g-bubsor.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029">GNAT.Bubble_Sort_A (g-busora.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029">GNAT.Bubble_Sort_G (g-busorg.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029">GNAT.Byte_Order_Mark (g-byorma.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029">GNAT.Byte_Swapping (g-bytswa.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCalendar-_0028g_002dcalend_002eads_0029">GNAT.Calendar (g-calend.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029">GNAT.Calendar.Time_IO (g-catiio.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029">GNAT.Case_Util (g-casuti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCGI-_0028g_002dcgi_002eads_0029">GNAT.CGI (g-cgi.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029">GNAT.CGI.Cookie (g-cgicoo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029">GNAT.CGI.Debug (g-cgideb.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029">GNAT.Command_Line (g-comlin.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029">GNAT.Compiler_Version (g-comver.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029">GNAT.Ctrl_C (g-ctrl_c.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029">GNAT.CRC32 (g-crc32.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029">GNAT.Current_Exception (g-curexc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029">GNAT.Debug_Pools (g-debpoo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029">GNAT.Debug_Utilities (g-debuti.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029">GNAT.Directory_Operations (g-dirope.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029">GNAT.Directory_Operations.Iteration (g-diopit.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029">GNAT.Dynamic_HTables (g-dynhta.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029">GNAT.Dynamic_Tables (g-dyntab.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029">GNAT.Exception_Actions (g-excact.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029">GNAT.Exception_Traces (g-exctra.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029">GNAT.Exceptions (g-except.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eExpect-_0028g_002dexpect_002eads_0029">GNAT.Expect (g-expect.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029">GNAT.Expect.TTY (g-exptty.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029">GNAT.Float_Control (g-flocon.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029">GNAT.Heap_Sort (g-heasor.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029">GNAT.Heap_Sort_A (g-hesora.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029">GNAT.Heap_Sort_G (g-hesorg.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eHTable-_0028g_002dhtable_002eads_0029">GNAT.HTable (g-htable.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eIO-_0028g_002dio_002eads_0029">GNAT.IO (g-io.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029">GNAT.IO_Aux (g-io_aux.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029">GNAT.Lock_Files (g-locfil.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029">GNAT.MBBS_Discrete_Random (g-mbdira.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029">GNAT.MBBS_Float_Random (g-mbflra.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMD5-_0028g_002dmd5_002eads_0029">GNAT.MD5 (g-md5.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029">GNAT.Memory_Dump (g-memdum.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029">GNAT.Most_Recent_Exception (g-moreex.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029">GNAT.OS_Lib (g-os_lib.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029">GNAT.Perfect_Hash_Generators (g-pehage.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029">GNAT.Random_Numbers (g-rannum.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029">GNAT.Regexp (g-regexp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRegistry-_0028g_002dregist_002eads_0029">GNAT.Registry (g-regist.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029">GNAT.Regpat (g-regpat.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029">GNAT.Secondary_Stack_Info (g-sestin.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029">GNAT.Semaphores (g-semaph.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029">GNAT.Serial_Communications (g-sercom.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA1-_0028g_002dsha1_002eads_0029">GNAT.SHA1 (g-sha1.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA224-_0028g_002dsha224_002eads_0029">GNAT.SHA224 (g-sha224.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA256-_0028g_002dsha256_002eads_0029">GNAT.SHA256 (g-sha256.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA384-_0028g_002dsha384_002eads_0029">GNAT.SHA384 (g-sha384.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSHA512-_0028g_002dsha512_002eads_0029">GNAT.SHA512 (g-sha512.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSignals-_0028g_002dsignal_002eads_0029">GNAT.Signals (g-signal.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSockets-_0028g_002dsocket_002eads_0029">GNAT.Sockets (g-socket.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029">GNAT.Source_Info (g-souinf.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029">GNAT.Spelling_Checker (g-speche.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029">GNAT.Spelling_Checker_Generic (g-spchge.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029">GNAT.Spitbol.Patterns (g-spipat.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029">GNAT.Spitbol (g-spitbo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029">GNAT.Spitbol.Table_Boolean (g-sptabo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSSE-_0028g_002dsse_002eads_0029">GNAT.SSE (g-sse.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029">GNAT.SSE.Vector_Types (g-ssvety.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eStrings-_0028g_002dstring_002eads_0029">GNAT.Strings (g-string.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029">GNAT.String_Split (g-strspl.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTable-_0028g_002dtable_002eads_0029">GNAT.Table (g-table.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029">GNAT.Task_Lock (g-tasloc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029">GNAT.Threads (g-thread.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029">GNAT.Time_Stamp (g-timsta.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029">GNAT.Traceback (g-traceb.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029">GNAT.Traceback.Symbolic (g-trasym.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029">GNAT.UTF_32 (g-utf_32.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029">GNAT.UTF_32_Spelling_Checker (g-u3spch.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029">GNAT.Wide_Spelling_Checker (g-wispch.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029">GNAT.Wide_String_Split (g-wistsp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029">GNAT.Wide_Wide_Spelling_Checker (g-zspche.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029">GNAT.Wide_Wide_String_Split (g-zistsp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029">Interfaces.C.Extensions (i-cexten.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029">Interfaces.C.Streams (i-cstrea.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029">Interfaces.CPP (i-cpp.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029">Interfaces.Packed_Decimal (i-pacdec.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029">Interfaces.VxWorks (i-vxwork.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">Interfaces.VxWorks.IO (i-vxwoio.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029">System.Address_Image (s-addima.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eAssertions-_0028s_002dassert_002eads_0029">System.Assertions (s-assert.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eMemory-_0028s_002dmemory_002eads_0029">System.Memory (s-memory.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029">System.Partition_Interface (s-parint.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029">System.Pool_Global (s-pooglo.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029">System.Pool_Local (s-pooloc.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eRestrictions-_0028s_002drestri_002eads_0029">System.Restrictions (s-restri.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eRident-_0028s_002drident_002eads_0029">System.Rident (s-rident.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029">System.Strings.Stream_Ops (s-ststop.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029">System.Task_Info (s-tasinf.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029">System.Wch_Cnv (s-wchcnv.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029">System.Wch_Con (s-wchcon.ads)</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029" accesskey="n" rel="next">Ada.Characters.Wide_Latin_1 (a-cwila1.ads)</a>, Previous: <a href="#Interfacing-to-C-Streams" accesskey="p" rel="prev">Interfacing to C Streams</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029-1"></a>
<h3 class="section">10.1 <code>Ada.Characters.Latin_9</code> (<samp>a-chlat9.ads</samp>)</h3>
<a name="index-Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029"></a>
<a name="index-Latin_005f9-constants-for-Character"></a>
<p>This child of <code>Ada.Characters</code>
provides a set of definitions corresponding to those in the
RM-defined package <code>Ada.Characters.Latin_1</code> but with the
few modifications required for <code>Latin-9</code>
The provision of such a package
is specifically authorized by the Ada Reference Manual
(RM A.3.3(27)).
</p>
<hr>
<a name="Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029" accesskey="n" rel="next">Ada.Characters.Wide_Latin_9 (a-cwila9.ads)</a>, Previous: <a href="#Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029" accesskey="p" rel="prev">Ada.Characters.Latin_9 (a-chlat9.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029-1"></a>
<h3 class="section">10.2 <code>Ada.Characters.Wide_Latin_1</code> (<samp>a-cwila1.ads</samp>)</h3>
<a name="index-Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029"></a>
<a name="index-Latin_005f1-constants-for-Wide_005fCharacter"></a>
<p>This child of <code>Ada.Characters</code>
provides a set of definitions corresponding to those in the
RM-defined package <code>Ada.Characters.Latin_1</code> but with the
types of the constants being <code>Wide_Character</code>
instead of <code>Character</code>. The provision of such a package
is specifically authorized by the Ada Reference Manual
(RM A.3.3(27)).
</p>
<hr>
<a name="Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029" accesskey="n" rel="next">Ada.Characters.Wide_Wide_Latin_1 (a-chzla1.ads)</a>, Previous: <a href="#Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029" accesskey="p" rel="prev">Ada.Characters.Wide_Latin_1 (a-cwila1.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila1_002eads_0029"></a>
<h3 class="section">10.3 <code>Ada.Characters.Wide_Latin_9</code> (<samp>a-cwila1.ads</samp>)</h3>
<a name="index-Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila1_002eads_0029"></a>
<a name="index-Latin_005f9-constants-for-Wide_005fCharacter"></a>
<p>This child of <code>Ada.Characters</code>
provides a set of definitions corresponding to those in the
GNAT defined package <code>Ada.Characters.Latin_9</code> but with the
types of the constants being <code>Wide_Character</code>
instead of <code>Character</code>. The provision of such a package
is specifically authorized by the Ada Reference Manual
(RM A.3.3(27)).
</p>
<hr>
<a name="Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029" accesskey="n" rel="next">Ada.Characters.Wide_Wide_Latin_9 (a-chzla9.ads)</a>, Previous: <a href="#Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029" accesskey="p" rel="prev">Ada.Characters.Wide_Latin_9 (a-cwila9.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029-1"></a>
<h3 class="section">10.4 <code>Ada.Characters.Wide_Wide_Latin_1</code> (<samp>a-chzla1.ads</samp>)</h3>
<a name="index-Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029"></a>
<a name="index-Latin_005f1-constants-for-Wide_005fWide_005fCharacter"></a>
<p>This child of <code>Ada.Characters</code>
provides a set of definitions corresponding to those in the
RM-defined package <code>Ada.Characters.Latin_1</code> but with the
types of the constants being <code>Wide_Wide_Character</code>
instead of <code>Character</code>. The provision of such a package
is specifically authorized by the Ada Reference Manual
(RM A.3.3(27)).
</p>
<hr>
<a name="Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029" accesskey="n" rel="next">Ada.Containers.Formal_Doubly_Linked_Lists (a-cfdlli.ads)</a>, Previous: <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029" accesskey="p" rel="prev">Ada.Characters.Wide_Wide_Latin_1 (a-chzla1.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029-1"></a>
<h3 class="section">10.5 <code>Ada.Characters.Wide_Wide_Latin_9</code> (<samp>a-chzla9.ads</samp>)</h3>
<a name="index-Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029"></a>
<a name="index-Latin_005f9-constants-for-Wide_005fWide_005fCharacter"></a>
<p>This child of <code>Ada.Characters</code>
provides a set of definitions corresponding to those in the
GNAT defined package <code>Ada.Characters.Latin_9</code> but with the
types of the constants being <code>Wide_Wide_Character</code>
instead of <code>Character</code>. The provision of such a package
is specifically authorized by the Ada Reference Manual
(RM A.3.3(27)).
</p>
<hr>
<a name="Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029" accesskey="n" rel="next">Ada.Containers.Formal_Hashed_Maps (a-cfhama.ads)</a>, Previous: <a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029" accesskey="p" rel="prev">Ada.Characters.Wide_Wide_Latin_9 (a-chzla9.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029-1"></a>
<h3 class="section">10.6 <code>Ada.Containers.Formal_Doubly_Linked_Lists</code> (<samp>a-cfdlli.ads</samp>)</h3>
<a name="index-Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029"></a>
<a name="index-Formal-container-for-doubly-linked-lists"></a>
<p>This child of <code>Ada.Containers</code> defines a modified version of the Ada 2005
container for doubly linked lists, meant to facilitate formal verification of
code using such containers.
</p>
<hr>
<a name="Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029" accesskey="n" rel="next">Ada.Containers.Formal_Hashed_Sets (a-cfhase.ads)</a>, Previous: <a href="#Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029" accesskey="p" rel="prev">Ada.Containers.Formal_Doubly_Linked_Lists (a-cfdlli.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029-1"></a>
<h3 class="section">10.7 <code>Ada.Containers.Formal_Hashed_Maps</code> (<samp>a-cfhama.ads</samp>)</h3>
<a name="index-Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029"></a>
<a name="index-Formal-container-for-hashed-maps"></a>
<p>This child of <code>Ada.Containers</code> defines a modified version of the Ada 2005
container for hashed maps, meant to facilitate formal verification of
code using such containers.
</p>
<hr>
<a name="Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029" accesskey="n" rel="next">Ada.Containers.Formal_Ordered_Maps (a-cforma.ads)</a>, Previous: <a href="#Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029" accesskey="p" rel="prev">Ada.Containers.Formal_Hashed_Maps (a-cfhama.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029-1"></a>
<h3 class="section">10.8 <code>Ada.Containers.Formal_Hashed_Sets</code> (<samp>a-cfhase.ads</samp>)</h3>
<a name="index-Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029"></a>
<a name="index-Formal-container-for-hashed-sets"></a>
<p>This child of <code>Ada.Containers</code> defines a modified version of the Ada 2005
container for hashed sets, meant to facilitate formal verification of
code using such containers.
</p>
<hr>
<a name="Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029" accesskey="n" rel="next">Ada.Containers.Formal_Ordered_Sets (a-cforse.ads)</a>, Previous: <a href="#Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029" accesskey="p" rel="prev">Ada.Containers.Formal_Hashed_Sets (a-cfhase.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029-1"></a>
<h3 class="section">10.9 <code>Ada.Containers.Formal_Ordered_Maps</code> (<samp>a-cforma.ads</samp>)</h3>
<a name="index-Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029"></a>
<a name="index-Formal-container-for-ordered-maps"></a>
<p>This child of <code>Ada.Containers</code> defines a modified version of the Ada 2005
container for ordered maps, meant to facilitate formal verification of
code using such containers.
</p>
<hr>
<a name="Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029" accesskey="n" rel="next">Ada.Containers.Formal_Vectors (a-cofove.ads)</a>, Previous: <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029" accesskey="p" rel="prev">Ada.Containers.Formal_Ordered_Maps (a-cforma.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029-1"></a>
<h3 class="section">10.10 <code>Ada.Containers.Formal_Ordered_Sets</code> (<samp>a-cforse.ads</samp>)</h3>
<a name="index-Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029"></a>
<a name="index-Formal-container-for-ordered-sets"></a>
<p>This child of <code>Ada.Containers</code> defines a modified version of the Ada 2005
container for ordered sets, meant to facilitate formal verification of
code using such containers.
</p>
<hr>
<a name="Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029" accesskey="n" rel="next">Ada.Command_Line.Environment (a-colien.ads)</a>, Previous: <a href="#Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029" accesskey="p" rel="prev">Ada.Containers.Formal_Ordered_Sets (a-cforse.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029-1"></a>
<h3 class="section">10.11 <code>Ada.Containers.Formal_Vectors</code> (<samp>a-cofove.ads</samp>)</h3>
<a name="index-Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029"></a>
<a name="index-Formal-container-for-vectors"></a>
<p>This child of <code>Ada.Containers</code> defines a modified version of the Ada 2005
container for vectors, meant to facilitate formal verification of
code using such containers.
</p>
<hr>
<a name="Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029" accesskey="n" rel="next">Ada.Command_Line.Remove (a-colire.ads)</a>, Previous: <a href="#Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029" accesskey="p" rel="prev">Ada.Containers.Formal_Vectors (a-cofove.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029-1"></a>
<h3 class="section">10.12 <code>Ada.Command_Line.Environment</code> (<samp>a-colien.ads</samp>)</h3>
<a name="index-Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029"></a>
<a name="index-Environment-entries"></a>
<p>This child of <code>Ada.Command_Line</code>
provides a mechanism for obtaining environment values on systems
where this concept makes sense.
</p>
<hr>
<a name="Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029" accesskey="n" rel="next">Ada.Command_Line.Response_File (a-clrefi.ads)</a>, Previous: <a href="#Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029" accesskey="p" rel="prev">Ada.Command_Line.Environment (a-colien.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029-1"></a>
<h3 class="section">10.13 <code>Ada.Command_Line.Remove</code> (<samp>a-colire.ads</samp>)</h3>
<a name="index-Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029"></a>
<a name="index-Removing-command-line-arguments"></a>
<a name="index-Command-line_002c-argument-removal"></a>
<p>This child of <code>Ada.Command_Line</code>
provides a mechanism for logically removing
arguments from the argument list. Once removed, an argument is not visible
to further calls on the subprograms in <code>Ada.Command_Line</code> will not
see the removed argument.
</p>
<hr>
<a name="Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029" accesskey="n" rel="next">Ada.Direct_IO.C_Streams (a-diocst.ads)</a>, Previous: <a href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029" accesskey="p" rel="prev">Ada.Command_Line.Remove (a-colire.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029-1"></a>
<h3 class="section">10.14 <code>Ada.Command_Line.Response_File</code> (<samp>a-clrefi.ads</samp>)</h3>
<a name="index-Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029"></a>
<a name="index-Response-file-for-command-line"></a>
<a name="index-Command-line_002c-response-file"></a>
<a name="index-Command-line_002c-handling-long-command-lines"></a>
<p>This child of <code>Ada.Command_Line</code> provides a mechanism facilities for
getting command line arguments from a text file, called a "response file".
Using a response file allow passing a set of arguments to an executable longer
than the maximum allowed by the system on the command line.
</p>
<hr>
<a name="Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029" accesskey="n" rel="next">Ada.Exceptions.Is_Null_Occurrence (a-einuoc.ads)</a>, Previous: <a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029" accesskey="p" rel="prev">Ada.Command_Line.Response_File (a-clrefi.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029-1"></a>
<h3 class="section">10.15 <code>Ada.Direct_IO.C_Streams</code> (<samp>a-diocst.ads</samp>)</h3>
<a name="index-Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029"></a>
<a name="index-C-Streams_002c-Interfacing-with-Direct_005fIO"></a>
<p>This package provides subprograms that allow interfacing between
C streams and <code>Direct_IO</code>. The stream identifier can be
extracted from a file opened on the Ada side, and an Ada file
can be constructed from a stream opened on the C side.
</p>
<hr>
<a name="Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029" accesskey="n" rel="next">Ada.Exceptions.Last_Chance_Handler (a-elchha.ads)</a>, Previous: <a href="#Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029" accesskey="p" rel="prev">Ada.Direct_IO.C_Streams (a-diocst.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029-1"></a>
<h3 class="section">10.16 <code>Ada.Exceptions.Is_Null_Occurrence</code> (<samp>a-einuoc.ads</samp>)</h3>
<a name="index-Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029"></a>
<a name="index-Null_005fOccurrence_002c-testing-for"></a>
<p>This child subprogram provides a way of testing for the null
exception occurrence (<code>Null_Occurrence</code>) without raising
an exception.
</p>
<hr>
<a name="Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029" accesskey="n" rel="next">Ada.Exceptions.Traceback (a-exctra.ads)</a>, Previous: <a href="#Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029" accesskey="p" rel="prev">Ada.Exceptions.Is_Null_Occurrence (a-einuoc.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029-1"></a>
<h3 class="section">10.17 <code>Ada.Exceptions.Last_Chance_Handler</code> (<samp>a-elchha.ads</samp>)</h3>
<a name="index-Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029"></a>
<a name="index-Null_005fOccurrence_002c-testing-for-1"></a>
<p>This child subprogram is used for handling otherwise unhandled
exceptions (hence the name last chance), and perform clean ups before
terminating the program. Note that this subprogram never returns.
</p>
<hr>
<a name="Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029" accesskey="n" rel="next">Ada.Sequential_IO.C_Streams (a-siocst.ads)</a>, Previous: <a href="#Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029" accesskey="p" rel="prev">Ada.Exceptions.Last_Chance_Handler (a-elchha.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029-1"></a>
<h3 class="section">10.18 <code>Ada.Exceptions.Traceback</code> (<samp>a-exctra.ads</samp>)</h3>
<a name="index-Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029"></a>
<a name="index-Traceback-for-Exception-Occurrence"></a>
<p>This child package provides the subprogram (<code>Tracebacks</code>) to
give a traceback array of addresses based on an exception
occurrence.
</p>
<hr>
<a name="Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029" accesskey="n" rel="next">Ada.Streams.Stream_IO.C_Streams (a-ssicst.ads)</a>, Previous: <a href="#Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029" accesskey="p" rel="prev">Ada.Exceptions.Traceback (a-exctra.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029-1"></a>
<h3 class="section">10.19 <code>Ada.Sequential_IO.C_Streams</code> (<samp>a-siocst.ads</samp>)</h3>
<a name="index-Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029"></a>
<a name="index-C-Streams_002c-Interfacing-with-Sequential_005fIO"></a>
<p>This package provides subprograms that allow interfacing between
C streams and <code>Sequential_IO</code>. The stream identifier can be
extracted from a file opened on the Ada side, and an Ada file
can be constructed from a stream opened on the C side.
</p>
<hr>
<a name="Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029" accesskey="n" rel="next">Ada.Strings.Unbounded.Text_IO (a-suteio.ads)</a>, Previous: <a href="#Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029" accesskey="p" rel="prev">Ada.Sequential_IO.C_Streams (a-siocst.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029-1"></a>
<h3 class="section">10.20 <code>Ada.Streams.Stream_IO.C_Streams</code> (<samp>a-ssicst.ads</samp>)</h3>
<a name="index-Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029"></a>
<a name="index-C-Streams_002c-Interfacing-with-Stream_005fIO"></a>
<p>This package provides subprograms that allow interfacing between
C streams and <code>Stream_IO</code>. The stream identifier can be
extracted from a file opened on the Ada side, and an Ada file
can be constructed from a stream opened on the C side.
</p>
<hr>
<a name="Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029" accesskey="n" rel="next">Ada.Strings.Wide_Unbounded.Wide_Text_IO (a-swuwti.ads)</a>, Previous: <a href="#Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029" accesskey="p" rel="prev">Ada.Streams.Stream_IO.C_Streams (a-ssicst.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029-1"></a>
<h3 class="section">10.21 <code>Ada.Strings.Unbounded.Text_IO</code> (<samp>a-suteio.ads</samp>)</h3>
<a name="index-Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029"></a>
<a name="index-Unbounded_005fString_002c-IO-support"></a>
<a name="index-Text_005fIO_002c-extensions-for-unbounded-strings"></a>
<p>This package provides subprograms for Text_IO for unbounded
strings, avoiding the necessity for an intermediate operation
with ordinary strings.
</p>
<hr>
<a name="Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029" accesskey="n" rel="next">Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO (a-szuzti.ads)</a>, Previous: <a href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029" accesskey="p" rel="prev">Ada.Strings.Unbounded.Text_IO (a-suteio.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029-1"></a>
<h3 class="section">10.22 <code>Ada.Strings.Wide_Unbounded.Wide_Text_IO</code> (<samp>a-swuwti.ads</samp>)</h3>
<a name="index-Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029"></a>
<a name="index-Unbounded_005fWide_005fString_002c-IO-support"></a>
<a name="index-Text_005fIO_002c-extensions-for-unbounded-wide-strings"></a>
<p>This package provides subprograms for Text_IO for unbounded
wide strings, avoiding the necessity for an intermediate operation
with ordinary wide strings.
</p>
<hr>
<a name="Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029" accesskey="n" rel="next">Ada.Text_IO.C_Streams (a-tiocst.ads)</a>, Previous: <a href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029" accesskey="p" rel="prev">Ada.Strings.Wide_Unbounded.Wide_Text_IO (a-swuwti.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029-1"></a>
<h3 class="section">10.23 <code>Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO</code> (<samp>a-szuzti.ads</samp>)</h3>
<a name="index-Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029"></a>
<a name="index-Unbounded_005fWide_005fWide_005fString_002c-IO-support"></a>
<a name="index-Text_005fIO_002c-extensions-for-unbounded-wide-wide-strings"></a>
<p>This package provides subprograms for Text_IO for unbounded
wide wide strings, avoiding the necessity for an intermediate operation
with ordinary wide wide strings.
</p>
<hr>
<a name="Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029" accesskey="n" rel="next">Ada.Text_IO.Reset_Standard_Files (a-tirsfi.ads)</a>, Previous: <a href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029" accesskey="p" rel="prev">Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO (a-szuzti.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029-1"></a>
<h3 class="section">10.24 <code>Ada.Text_IO.C_Streams</code> (<samp>a-tiocst.ads</samp>)</h3>
<a name="index-Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029"></a>
<a name="index-C-Streams_002c-Interfacing-with-Text_005fIO"></a>
<p>This package provides subprograms that allow interfacing between
C streams and <code>Text_IO</code>. The stream identifier can be
extracted from a file opened on the Ada side, and an Ada file
can be constructed from a stream opened on the C side.
</p>
<hr>
<a name="Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029" accesskey="n" rel="next">Ada.Wide_Characters.Unicode (a-wichun.ads)</a>, Previous: <a href="#Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029" accesskey="p" rel="prev">Ada.Text_IO.C_Streams (a-tiocst.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029-1"></a>
<h3 class="section">10.25 <code>Ada.Text_IO.Reset_Standard_Files</code> (<samp>a-tirsfi.ads</samp>)</h3>
<a name="index-Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029"></a>
<a name="index-Text_005fIO-resetting-standard-files"></a>
<p>This procedure is used to reset the status of the standard files used
by Ada.Text_IO. This is useful in a situation (such as a restart in an
embedded application) where the status of the files may change during
execution (for example a standard input file may be redefined to be
interactive).
</p>
<hr>
<a name="Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029" accesskey="n" rel="next">Ada.Wide_Text_IO.C_Streams (a-wtcstr.ads)</a>, Previous: <a href="#Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029" accesskey="p" rel="prev">Ada.Text_IO.Reset_Standard_Files (a-tirsfi.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029-1"></a>
<h3 class="section">10.26 <code>Ada.Wide_Characters.Unicode</code> (<samp>a-wichun.ads</samp>)</h3>
<a name="index-Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029"></a>
<a name="index-Unicode-categorization_002c-Wide_005fCharacter"></a>
<p>This package provides subprograms that allow categorization of
Wide_Character values according to Unicode categories.
</p>
<hr>
<a name="Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029" accesskey="n" rel="next">Ada.Wide_Text_IO.Reset_Standard_Files (a-wrstfi.ads)</a>, Previous: <a href="#Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029" accesskey="p" rel="prev">Ada.Wide_Characters.Unicode (a-wichun.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029-1"></a>
<h3 class="section">10.27 <code>Ada.Wide_Text_IO.C_Streams</code> (<samp>a-wtcstr.ads</samp>)</h3>
<a name="index-Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029"></a>
<a name="index-C-Streams_002c-Interfacing-with-Wide_005fText_005fIO"></a>
<p>This package provides subprograms that allow interfacing between
C streams and <code>Wide_Text_IO</code>. The stream identifier can be
extracted from a file opened on the Ada side, and an Ada file
can be constructed from a stream opened on the C side.
</p>
<hr>
<a name="Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029" accesskey="n" rel="next">Ada.Wide_Wide_Characters.Unicode (a-zchuni.ads)</a>, Previous: <a href="#Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029" accesskey="p" rel="prev">Ada.Wide_Text_IO.C_Streams (a-wtcstr.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029-1"></a>
<h3 class="section">10.28 <code>Ada.Wide_Text_IO.Reset_Standard_Files</code> (<samp>a-wrstfi.ads</samp>)</h3>
<a name="index-Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029"></a>
<a name="index-Wide_005fText_005fIO-resetting-standard-files"></a>
<p>This procedure is used to reset the status of the standard files used
by Ada.Wide_Text_IO. This is useful in a situation (such as a restart in an
embedded application) where the status of the files may change during
execution (for example a standard input file may be redefined to be
interactive).
</p>
<hr>
<a name="Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029" accesskey="n" rel="next">Ada.Wide_Wide_Text_IO.C_Streams (a-ztcstr.ads)</a>, Previous: <a href="#Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029" accesskey="p" rel="prev">Ada.Wide_Text_IO.Reset_Standard_Files (a-wrstfi.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029-1"></a>
<h3 class="section">10.29 <code>Ada.Wide_Wide_Characters.Unicode</code> (<samp>a-zchuni.ads</samp>)</h3>
<a name="index-Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029"></a>
<a name="index-Unicode-categorization_002c-Wide_005fWide_005fCharacter"></a>
<p>This package provides subprograms that allow categorization of
Wide_Wide_Character values according to Unicode categories.
</p>
<hr>
<a name="Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029" accesskey="n" rel="next">Ada.Wide_Wide_Text_IO.Reset_Standard_Files (a-zrstfi.ads)</a>, Previous: <a href="#Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029" accesskey="p" rel="prev">Ada.Wide_Wide_Characters.Unicode (a-zchuni.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029-1"></a>
<h3 class="section">10.30 <code>Ada.Wide_Wide_Text_IO.C_Streams</code> (<samp>a-ztcstr.ads</samp>)</h3>
<a name="index-Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029"></a>
<a name="index-C-Streams_002c-Interfacing-with-Wide_005fWide_005fText_005fIO"></a>
<p>This package provides subprograms that allow interfacing between
C streams and <code>Wide_Wide_Text_IO</code>. The stream identifier can be
extracted from a file opened on the Ada side, and an Ada file
can be constructed from a stream opened on the C side.
</p>
<hr>
<a name="Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eAltivec-_0028g_002daltive_002eads_0029" accesskey="n" rel="next">GNAT.Altivec (g-altive.ads)</a>, Previous: <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029" accesskey="p" rel="prev">Ada.Wide_Wide_Text_IO.C_Streams (a-ztcstr.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029-1"></a>
<h3 class="section">10.31 <code>Ada.Wide_Wide_Text_IO.Reset_Standard_Files</code> (<samp>a-zrstfi.ads</samp>)</h3>
<a name="index-Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029"></a>
<a name="index-Wide_005fWide_005fText_005fIO-resetting-standard-files"></a>
<p>This procedure is used to reset the status of the standard files used
by Ada.Wide_Wide_Text_IO. This is useful in a situation (such as a
restart in an embedded application) where the status of the files may
change during execution (for example a standard input file may be
redefined to be interactive).
</p>
<hr>
<a name="GNAT_002eAltivec-_0028g_002daltive_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029" accesskey="n" rel="next">GNAT.Altivec.Conversions (g-altcon.ads)</a>, Previous: <a href="#Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029" accesskey="p" rel="prev">Ada.Wide_Wide_Text_IO.Reset_Standard_Files (a-zrstfi.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eAltivec-_0028g_002daltive_002eads_0029-1"></a>
<h3 class="section">10.32 <code>GNAT.Altivec</code> (<samp>g-altive.ads</samp>)</h3>
<a name="index-GNAT_002eAltivec-_0028g_002daltive_002eads_0029"></a>
<a name="index-AltiVec"></a>
<p>This is the root package of the GNAT AltiVec binding. It provides
definitions of constants and types common to all the versions of the
binding.
</p>
<hr>
<a name="GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029" accesskey="n" rel="next">GNAT.Altivec.Vector_Operations (g-alveop.ads)</a>, Previous: <a href="#GNAT_002eAltivec-_0028g_002daltive_002eads_0029" accesskey="p" rel="prev">GNAT.Altivec (g-altive.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029-1"></a>
<h3 class="section">10.33 <code>GNAT.Altivec.Conversions</code> (<samp>g-altcon.ads</samp>)</h3>
<a name="index-GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029"></a>
<a name="index-AltiVec-1"></a>
<p>This package provides the Vector/View conversion routines.
</p>
<hr>
<a name="GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029" accesskey="n" rel="next">GNAT.Altivec.Vector_Types (g-alvety.ads)</a>, Previous: <a href="#GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029" accesskey="p" rel="prev">GNAT.Altivec.Conversions (g-altcon.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029-1"></a>
<h3 class="section">10.34 <code>GNAT.Altivec.Vector_Operations</code> (<samp>g-alveop.ads</samp>)</h3>
<a name="index-GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029"></a>
<a name="index-AltiVec-2"></a>
<p>This package exposes the Ada interface to the AltiVec operations on
vector objects. A soft emulation is included by default in the GNAT
library. The hard binding is provided as a separate package. This unit
is common to both bindings.
</p>
<hr>
<a name="GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029" accesskey="n" rel="next">GNAT.Altivec.Vector_Views (g-alvevi.ads)</a>, Previous: <a href="#GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029" accesskey="p" rel="prev">GNAT.Altivec.Vector_Operations (g-alveop.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029-1"></a>
<h3 class="section">10.35 <code>GNAT.Altivec.Vector_Types</code> (<samp>g-alvety.ads</samp>)</h3>
<a name="index-GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029"></a>
<a name="index-AltiVec-3"></a>
<p>This package exposes the various vector types part of the Ada binding
to AltiVec facilities.
</p>
<hr>
<a name="GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029" accesskey="n" rel="next">GNAT.Array_Split (g-arrspl.ads)</a>, Previous: <a href="#GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029" accesskey="p" rel="prev">GNAT.Altivec.Vector_Types (g-alvety.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029-1"></a>
<h3 class="section">10.36 <code>GNAT.Altivec.Vector_Views</code> (<samp>g-alvevi.ads</samp>)</h3>
<a name="index-GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029"></a>
<a name="index-AltiVec-4"></a>
<p>This package provides public ’View’ data types from/to which private
vector representations can be converted via
GNAT.Altivec.Conversions. This allows convenient access to individual
vector elements and provides a simple way to initialize vector
objects.
</p>
<hr>
<a name="GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029" accesskey="n" rel="next">GNAT.AWK (g-awk.ads)</a>, Previous: <a href="#GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029" accesskey="p" rel="prev">GNAT.Altivec.Vector_Views (g-alvevi.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029-1"></a>
<h3 class="section">10.37 <code>GNAT.Array_Split</code> (<samp>g-arrspl.ads</samp>)</h3>
<a name="index-GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029"></a>
<a name="index-Array-splitter"></a>
<p>Useful array-manipulation routines: given a set of separators, split
an array wherever the separators appear, and provide direct access
to the resulting slices.
</p>
<hr>
<a name="GNAT_002eAWK-_0028g_002dawk_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029" accesskey="n" rel="next">GNAT.Bounded_Buffers (g-boubuf.ads)</a>, Previous: <a href="#GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029" accesskey="p" rel="prev">GNAT.Array_Split (g-arrspl.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eAWK-_0028g_002dawk_002eads_0029-1"></a>
<h3 class="section">10.38 <code>GNAT.AWK</code> (<samp>g-awk.ads</samp>)</h3>
<a name="index-GNAT_002eAWK-_0028g_002dawk_002eads_0029"></a>
<a name="index-Parsing"></a>
<a name="index-AWK"></a>
<p>Provides AWK-like parsing functions, with an easy interface for parsing one
or more files containing formatted data. The file is viewed as a database
where each record is a line and a field is a data element in this line.
</p>
<hr>
<a name="GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029" accesskey="n" rel="next">GNAT.Bounded_Mailboxes (g-boumai.ads)</a>, Previous: <a href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029" accesskey="p" rel="prev">GNAT.AWK (g-awk.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029-1"></a>
<h3 class="section">10.39 <code>GNAT.Bounded_Buffers</code> (<samp>g-boubuf.ads</samp>)</h3>
<a name="index-GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029"></a>
<a name="index-Parsing-1"></a>
<a name="index-Bounded-Buffers"></a>
<p>Provides a concurrent generic bounded buffer abstraction. Instances are
useful directly or as parts of the implementations of other abstractions,
such as mailboxes.
</p>
<hr>
<a name="GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029" accesskey="n" rel="next">GNAT.Bubble_Sort (g-bubsor.ads)</a>, Previous: <a href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029" accesskey="p" rel="prev">GNAT.Bounded_Buffers (g-boubuf.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029-1"></a>
<h3 class="section">10.40 <code>GNAT.Bounded_Mailboxes</code> (<samp>g-boumai.ads</samp>)</h3>
<a name="index-GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029"></a>
<a name="index-Parsing-2"></a>
<a name="index-Mailboxes"></a>
<p>Provides a thread-safe asynchronous intertask mailbox communication facility.
</p>
<hr>
<a name="GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029" accesskey="n" rel="next">GNAT.Bubble_Sort_A (g-busora.ads)</a>, Previous: <a href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029" accesskey="p" rel="prev">GNAT.Bounded_Mailboxes (g-boumai.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029-1"></a>
<h3 class="section">10.41 <code>GNAT.Bubble_Sort</code> (<samp>g-bubsor.ads</samp>)</h3>
<a name="index-GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029"></a>
<a name="index-Sorting"></a>
<a name="index-Bubble-sort"></a>
<p>Provides a general implementation of bubble sort usable for sorting arbitrary
data items. Exchange and comparison procedures are provided by passing
access-to-procedure values.
</p>
<hr>
<a name="GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029" accesskey="n" rel="next">GNAT.Bubble_Sort_G (g-busorg.ads)</a>, Previous: <a href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029" accesskey="p" rel="prev">GNAT.Bubble_Sort (g-bubsor.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029-1"></a>
<h3 class="section">10.42 <code>GNAT.Bubble_Sort_A</code> (<samp>g-busora.ads</samp>)</h3>
<a name="index-GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029"></a>
<a name="index-Sorting-1"></a>
<a name="index-Bubble-sort-1"></a>
<p>Provides a general implementation of bubble sort usable for sorting arbitrary
data items. Move and comparison procedures are provided by passing
access-to-procedure values. This is an older version, retained for
compatibility. Usually <code>GNAT.Bubble_Sort</code> will be preferable.
</p>
<hr>
<a name="GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029" accesskey="n" rel="next">GNAT.Byte_Order_Mark (g-byorma.ads)</a>, Previous: <a href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029" accesskey="p" rel="prev">GNAT.Bubble_Sort_A (g-busora.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029-1"></a>
<h3 class="section">10.43 <code>GNAT.Bubble_Sort_G</code> (<samp>g-busorg.ads</samp>)</h3>
<a name="index-GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029"></a>
<a name="index-Sorting-2"></a>
<a name="index-Bubble-sort-2"></a>
<p>Similar to <code>Bubble_Sort_A</code> except that the move and sorting procedures
are provided as generic parameters, this improves efficiency, especially
if the procedures can be inlined, at the expense of duplicating code for
multiple instantiations.
</p>
<hr>
<a name="GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029" accesskey="n" rel="next">GNAT.Byte_Swapping (g-bytswa.ads)</a>, Previous: <a href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029" accesskey="p" rel="prev">GNAT.Bubble_Sort_G (g-busorg.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029-1"></a>
<h3 class="section">10.44 <code>GNAT.Byte_Order_Mark</code> (<samp>g-byorma.ads</samp>)</h3>
<a name="index-GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029"></a>
<a name="index-UTF_002d8-representation"></a>
<a name="index-Wide-characte-representations"></a>
<p>Provides a routine which given a string, reads the start of the string to
see whether it is one of the standard byte order marks (BOM’s) which signal
the encoding of the string. The routine includes detection of special XML
sequences for various UCS input formats.
</p>
<hr>
<a name="GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCalendar-_0028g_002dcalend_002eads_0029" accesskey="n" rel="next">GNAT.Calendar (g-calend.ads)</a>, Previous: <a href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029" accesskey="p" rel="prev">GNAT.Byte_Order_Mark (g-byorma.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029-1"></a>
<h3 class="section">10.45 <code>GNAT.Byte_Swapping</code> (<samp>g-bytswa.ads</samp>)</h3>
<a name="index-GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029"></a>
<a name="index-Byte-swapping"></a>
<a name="index-Endianness-1"></a>
<p>General routines for swapping the bytes in 2-, 4-, and 8-byte quantities.
Machine-specific implementations are available in some cases.
</p>
<hr>
<a name="GNAT_002eCalendar-_0028g_002dcalend_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029" accesskey="n" rel="next">GNAT.Calendar.Time_IO (g-catiio.ads)</a>, Previous: <a href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029" accesskey="p" rel="prev">GNAT.Byte_Swapping (g-bytswa.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCalendar-_0028g_002dcalend_002eads_0029-1"></a>
<h3 class="section">10.46 <code>GNAT.Calendar</code> (<samp>g-calend.ads</samp>)</h3>
<a name="index-GNAT_002eCalendar-_0028g_002dcalend_002eads_0029"></a>
<a name="index-Calendar"></a>
<p>Extends the facilities provided by <code>Ada.Calendar</code> to include handling
of days of the week, an extended <code>Split</code> and <code>Time_Of</code> capability.
Also provides conversion of <code>Ada.Calendar.Time</code> values to and from the
C <code>timeval</code> format.
</p>
<hr>
<a name="GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029" accesskey="n" rel="next">GNAT.CRC32 (g-crc32.ads)</a>, Previous: <a href="#GNAT_002eCalendar-_0028g_002dcalend_002eads_0029" accesskey="p" rel="prev">GNAT.Calendar (g-calend.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029-1"></a>
<h3 class="section">10.47 <code>GNAT.Calendar.Time_IO</code> (<samp>g-catiio.ads</samp>)</h3>
<a name="index-Calendar-1"></a>
<a name="index-Time"></a>
<a name="index-GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029"></a>
<hr>
<a name="GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029" accesskey="n" rel="next">GNAT.Case_Util (g-casuti.ads)</a>, Previous: <a href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029" accesskey="p" rel="prev">GNAT.Calendar.Time_IO (g-catiio.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029-1"></a>
<h3 class="section">10.48 <code>GNAT.CRC32</code> (<samp>g-crc32.ads</samp>)</h3>
<a name="index-GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029"></a>
<a name="index-CRC32"></a>
<a name="index-Cyclic-Redundancy-Check"></a>
<p>This package implements the CRC-32 algorithm. For a full description
of this algorithm see
“Computation of Cyclic Redundancy Checks via Table Look-Up”,
<cite>Communications of the ACM</cite>, Vol. 31 No. 8, pp. 1008-1013,
Aug. 1988. Sarwate, D.V.
</p>
<hr>
<a name="GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCGI-_0028g_002dcgi_002eads_0029" accesskey="n" rel="next">GNAT.CGI (g-cgi.ads)</a>, Previous: <a href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029" accesskey="p" rel="prev">GNAT.CRC32 (g-crc32.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029-1"></a>
<h3 class="section">10.49 <code>GNAT.Case_Util</code> (<samp>g-casuti.ads</samp>)</h3>
<a name="index-GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029"></a>
<a name="index-Casing-utilities"></a>
<a name="index-Character-handling-_0028GNAT_002eCase_005fUtil_0029"></a>
<p>A set of simple routines for handling upper and lower casing of strings
without the overhead of the full casing tables
in <code>Ada.Characters.Handling</code>.
</p>
<hr>
<a name="GNAT_002eCGI-_0028g_002dcgi_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029" accesskey="n" rel="next">GNAT.CGI.Cookie (g-cgicoo.ads)</a>, Previous: <a href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029" accesskey="p" rel="prev">GNAT.Case_Util (g-casuti.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCGI-_0028g_002dcgi_002eads_0029-1"></a>
<h3 class="section">10.50 <code>GNAT.CGI</code> (<samp>g-cgi.ads</samp>)</h3>
<a name="index-GNAT_002eCGI-_0028g_002dcgi_002eads_0029"></a>
<a name="index-CGI-_0028Common-Gateway-Interface_0029"></a>
<p>This is a package for interfacing a GNAT program with a Web server via the
Common Gateway Interface (CGI). Basically this package parses the CGI
parameters, which are a set of key/value pairs sent by the Web server. It
builds a table whose index is the key and provides some services to deal
with this table.
</p>
<hr>
<a name="GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029" accesskey="n" rel="next">GNAT.CGI.Debug (g-cgideb.ads)</a>, Previous: <a href="#GNAT_002eCGI-_0028g_002dcgi_002eads_0029" accesskey="p" rel="prev">GNAT.CGI (g-cgi.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029-1"></a>
<h3 class="section">10.51 <code>GNAT.CGI.Cookie</code> (<samp>g-cgicoo.ads</samp>)</h3>
<a name="index-GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029"></a>
<a name="index-CGI-_0028Common-Gateway-Interface_0029-cookie-support"></a>
<a name="index-Cookie-support-in-CGI"></a>
<p>This is a package to interface a GNAT program with a Web server via the
Common Gateway Interface (CGI). It exports services to deal with Web
cookies (piece of information kept in the Web client software).
</p>
<hr>
<a name="GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029" accesskey="n" rel="next">GNAT.Command_Line (g-comlin.ads)</a>, Previous: <a href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029" accesskey="p" rel="prev">GNAT.CGI.Cookie (g-cgicoo.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029-1"></a>
<h3 class="section">10.52 <code>GNAT.CGI.Debug</code> (<samp>g-cgideb.ads</samp>)</h3>
<a name="index-GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029"></a>
<a name="index-CGI-_0028Common-Gateway-Interface_0029-debugging"></a>
<p>This is a package to help debugging CGI (Common Gateway Interface)
programs written in Ada.
</p>
<hr>
<a name="GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029" accesskey="n" rel="next">GNAT.Compiler_Version (g-comver.ads)</a>, Previous: <a href="#GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029" accesskey="p" rel="prev">GNAT.CGI.Debug (g-cgideb.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029-1"></a>
<h3 class="section">10.53 <code>GNAT.Command_Line</code> (<samp>g-comlin.ads</samp>)</h3>
<a name="index-GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029"></a>
<a name="index-Command-line"></a>
<p>Provides a high level interface to <code>Ada.Command_Line</code> facilities,
including the ability to scan for named switches with optional parameters
and expand file names using wild card notations.
</p>
<hr>
<a name="GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029" accesskey="n" rel="next">GNAT.Ctrl_C (g-ctrl_c.ads)</a>, Previous: <a href="#GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029" accesskey="p" rel="prev">GNAT.Command_Line (g-comlin.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029-1"></a>
<h3 class="section">10.54 <code>GNAT.Compiler_Version</code> (<samp>g-comver.ads</samp>)</h3>
<a name="index-GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029"></a>
<a name="index-Compiler-Version"></a>
<a name="index-Version_002c-of-compiler"></a>
<p>Provides a routine for obtaining the version of the compiler used to
compile the program. More accurately this is the version of the binder
used to bind the program (this will normally be the same as the version
of the compiler if a consistent tool set is used to compile all units
of a partition).
</p>
<hr>
<a name="GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029" accesskey="n" rel="next">GNAT.Current_Exception (g-curexc.ads)</a>, Previous: <a href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029" accesskey="p" rel="prev">GNAT.Compiler_Version (g-comver.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029-1"></a>
<h3 class="section">10.55 <code>GNAT.Ctrl_C</code> (<samp>g-ctrl_c.ads</samp>)</h3>
<a name="index-GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029"></a>
<a name="index-Interrupt"></a>
<p>Provides a simple interface to handle Ctrl-C keyboard events.
</p>
<hr>
<a name="GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029" accesskey="n" rel="next">GNAT.Debug_Pools (g-debpoo.ads)</a>, Previous: <a href="#GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029" accesskey="p" rel="prev">GNAT.Ctrl_C (g-ctrl_c.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029-1"></a>
<h3 class="section">10.56 <code>GNAT.Current_Exception</code> (<samp>g-curexc.ads</samp>)</h3>
<a name="index-GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029"></a>
<a name="index-Current-exception"></a>
<a name="index-Exception-retrieval"></a>
<p>Provides access to information on the current exception that has been raised
without the need for using the Ada 95 / Ada 2005 exception choice parameter
specification syntax.
This is particularly useful in simulating typical facilities for
obtaining information about exceptions provided by Ada 83 compilers.
</p>
<hr>
<a name="GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029" accesskey="n" rel="next">GNAT.Debug_Utilities (g-debuti.ads)</a>, Previous: <a href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029" accesskey="p" rel="prev">GNAT.Current_Exception (g-curexc.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029-1"></a>
<h3 class="section">10.57 <code>GNAT.Debug_Pools</code> (<samp>g-debpoo.ads</samp>)</h3>
<a name="index-GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029"></a>
<a name="index-Debugging"></a>
<a name="index-Debug-pools"></a>
<a name="index-Memory-corruption-debugging"></a>
<p>Provide a debugging storage pools that helps tracking memory corruption
problems. See <a href="gnat_ugn.html#The-GNAT-Debug-Pool-Facility">The GNAT Debug Pool Facility</a> in <cite>GNAT User’s Guide</cite>.
</p>
<hr>
<a name="GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029" accesskey="n" rel="next">GNAT.Decode_String (g-decstr.ads)</a>, Previous: <a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029" accesskey="p" rel="prev">GNAT.Debug_Pools (g-debpoo.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029-1"></a>
<h3 class="section">10.58 <code>GNAT.Debug_Utilities</code> (<samp>g-debuti.ads</samp>)</h3>
<a name="index-GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029"></a>
<a name="index-Debugging-1"></a>
<p>Provides a few useful utilities for debugging purposes, including conversion
to and from string images of address values. Supports both C and Ada formats
for hexadecimal literals.
</p>
<hr>
<a name="GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029" accesskey="n" rel="next">GNAT.Decode_UTF8_String (g-deutst.ads)</a>, Previous: <a href="#GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029" accesskey="p" rel="prev">GNAT.Debug_Utilities (g-debuti.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029-1"></a>
<h3 class="section">10.59 <code>GNAT.Decode_String</code> (<samp>g-decstr.ads</samp>)</h3>
<a name="index-GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029"></a>
<a name="index-Decoding-strings"></a>
<a name="index-String-decoding"></a>
<a name="index-Wide-character-encoding"></a>
<a name="index-UTF_002d8"></a>
<a name="index-Unicode"></a>
<p>A generic package providing routines for decoding wide character and wide wide
character strings encoded as sequences of 8-bit characters using a specified
encoding method. Includes validation routines, and also routines for stepping
to next or previous encoded character in an encoded string.
Useful in conjunction with Unicode character coding. Note there is a
preinstantiation for UTF-8. See next entry.
</p>
<hr>
<a name="GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029" accesskey="n" rel="next">GNAT.Directory_Operations (g-dirope.ads)</a>, Previous: <a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029" accesskey="p" rel="prev">GNAT.Decode_String (g-decstr.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029-1"></a>
<h3 class="section">10.60 <code>GNAT.Decode_UTF8_String</code> (<samp>g-deutst.ads</samp>)</h3>
<a name="index-GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029"></a>
<a name="index-Decoding-strings-1"></a>
<a name="index-Decoding-UTF_002d8-strings"></a>
<a name="index-UTF_002d8-string-decoding"></a>
<a name="index-Wide-character-decoding"></a>
<a name="index-UTF_002d8-1"></a>
<a name="index-Unicode-1"></a>
<p>A preinstantiation of GNAT.Decode_Strings for UTF-8 encoding.
</p>
<hr>
<a name="GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029" accesskey="n" rel="next">GNAT.Directory_Operations.Iteration (g-diopit.ads)</a>, Previous: <a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029" accesskey="p" rel="prev">GNAT.Decode_UTF8_String (g-deutst.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029-1"></a>
<h3 class="section">10.61 <code>GNAT.Directory_Operations</code> (<samp>g-dirope.ads</samp>)</h3>
<a name="index-GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029"></a>
<a name="index-Directory-operations"></a>
<p>Provides a set of routines for manipulating directories, including changing
the current directory, making new directories, and scanning the files in a
directory.
</p>
<hr>
<a name="GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029" accesskey="n" rel="next">GNAT.Dynamic_HTables (g-dynhta.ads)</a>, Previous: <a href="#GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029" accesskey="p" rel="prev">GNAT.Directory_Operations (g-dirope.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029-1"></a>
<h3 class="section">10.62 <code>GNAT.Directory_Operations.Iteration</code> (<samp>g-diopit.ads</samp>)</h3>
<a name="index-GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029"></a>
<a name="index-Directory-operations-iteration"></a>
<p>A child unit of GNAT.Directory_Operations providing additional operations
for iterating through directories.
</p>
<hr>
<a name="GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029" accesskey="n" rel="next">GNAT.Dynamic_Tables (g-dyntab.ads)</a>, Previous: <a href="#GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029" accesskey="p" rel="prev">GNAT.Directory_Operations.Iteration (g-diopit.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029-1"></a>
<h3 class="section">10.63 <code>GNAT.Dynamic_HTables</code> (<samp>g-dynhta.ads</samp>)</h3>
<a name="index-GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029"></a>
<a name="index-Hash-tables"></a>
<p>A generic implementation of hash tables that can be used to hash arbitrary
data. Provided in two forms, a simple form with built in hash functions,
and a more complex form in which the hash function is supplied.
</p>
<p>This package provides a facility similar to that of <code>GNAT.HTable</code>,
except that this package declares a type that can be used to define
dynamic instances of the hash table, while an instantiation of
<code>GNAT.HTable</code> creates a single instance of the hash table.
</p>
<hr>
<a name="GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029" accesskey="n" rel="next">GNAT.Encode_String (g-encstr.ads)</a>, Previous: <a href="#GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029" accesskey="p" rel="prev">GNAT.Dynamic_HTables (g-dynhta.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029-1"></a>
<h3 class="section">10.64 <code>GNAT.Dynamic_Tables</code> (<samp>g-dyntab.ads</samp>)</h3>
<a name="index-GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029"></a>
<a name="index-Table-implementation"></a>
<a name="index-Arrays_002c-extendable"></a>
<p>A generic package providing a single dimension array abstraction where the
length of the array can be dynamically modified.
</p>
<p>This package provides a facility similar to that of <code>GNAT.Table</code>,
except that this package declares a type that can be used to define
dynamic instances of the table, while an instantiation of
<code>GNAT.Table</code> creates a single instance of the table type.
</p>
<hr>
<a name="GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029" accesskey="n" rel="next">GNAT.Encode_UTF8_String (g-enutst.ads)</a>, Previous: <a href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029" accesskey="p" rel="prev">GNAT.Dynamic_Tables (g-dyntab.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029-1"></a>
<h3 class="section">10.65 <code>GNAT.Encode_String</code> (<samp>g-encstr.ads</samp>)</h3>
<a name="index-GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029"></a>
<a name="index-Encoding-strings"></a>
<a name="index-String-encoding"></a>
<a name="index-Wide-character-encoding-1"></a>
<a name="index-UTF_002d8-2"></a>
<a name="index-Unicode-2"></a>
<p>A generic package providing routines for encoding wide character and wide
wide character strings as sequences of 8-bit characters using a specified
encoding method. Useful in conjunction with Unicode character coding.
Note there is a preinstantiation for UTF-8. See next entry.
</p>
<hr>
<a name="GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029" accesskey="n" rel="next">GNAT.Exception_Actions (g-excact.ads)</a>, Previous: <a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029" accesskey="p" rel="prev">GNAT.Encode_String (g-encstr.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029-1"></a>
<h3 class="section">10.66 <code>GNAT.Encode_UTF8_String</code> (<samp>g-enutst.ads</samp>)</h3>
<a name="index-GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029"></a>
<a name="index-Encoding-strings-1"></a>
<a name="index-Encoding-UTF_002d8-strings"></a>
<a name="index-UTF_002d8-string-encoding"></a>
<a name="index-Wide-character-encoding-2"></a>
<a name="index-UTF_002d8-3"></a>
<a name="index-Unicode-3"></a>
<p>A preinstantiation of GNAT.Encode_Strings for UTF-8 encoding.
</p>
<hr>
<a name="GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029" accesskey="n" rel="next">GNAT.Exception_Traces (g-exctra.ads)</a>, Previous: <a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029" accesskey="p" rel="prev">GNAT.Encode_UTF8_String (g-enutst.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029-1"></a>
<h3 class="section">10.67 <code>GNAT.Exception_Actions</code> (<samp>g-excact.ads</samp>)</h3>
<a name="index-GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029"></a>
<a name="index-Exception-actions"></a>
<p>Provides callbacks when an exception is raised. Callbacks can be registered
for specific exceptions, or when any exception is raised. This
can be used for instance to force a core dump to ease debugging.
</p>
<hr>
<a name="GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029" accesskey="n" rel="next">GNAT.Exceptions (g-except.ads)</a>, Previous: <a href="#GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029" accesskey="p" rel="prev">GNAT.Exception_Actions (g-excact.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029-1"></a>
<h3 class="section">10.68 <code>GNAT.Exception_Traces</code> (<samp>g-exctra.ads</samp>)</h3>
<a name="index-GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029"></a>
<a name="index-Exception-traces"></a>
<a name="index-Debugging-2"></a>
<p>Provides an interface allowing to control automatic output upon exception
occurrences.
</p>
<hr>
<a name="GNAT_002eExceptions-_0028g_002dexcept_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eExpect-_0028g_002dexpect_002eads_0029" accesskey="n" rel="next">GNAT.Expect (g-expect.ads)</a>, Previous: <a href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029" accesskey="p" rel="prev">GNAT.Exception_Traces (g-exctra.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eExceptions-_0028g_002dexpect_002eads_0029"></a>
<h3 class="section">10.69 <code>GNAT.Exceptions</code> (<samp>g-expect.ads</samp>)</h3>
<a name="index-GNAT_002eExceptions-_0028g_002dexpect_002eads_0029"></a>
<a name="index-Exceptions_002c-Pure"></a>
<a name="index-Pure-packages_002c-exceptions"></a>
<p>Normally it is not possible to raise an exception with
a message from a subprogram in a pure package, since the
necessary types and subprograms are in <code>Ada.Exceptions</code>
which is not a pure unit. <code>GNAT.Exceptions</code> provides a
facility for getting around this limitation for a few
predefined exceptions, and for example allow raising
<code>Constraint_Error</code> with a message from a pure subprogram.
</p>
<hr>
<a name="GNAT_002eExpect-_0028g_002dexpect_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029" accesskey="n" rel="next">GNAT.Expect.TTY (g-exptty.ads)</a>, Previous: <a href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029" accesskey="p" rel="prev">GNAT.Exceptions (g-except.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eExpect-_0028g_002dexpect_002eads_0029-1"></a>
<h3 class="section">10.70 <code>GNAT.Expect</code> (<samp>g-expect.ads</samp>)</h3>
<a name="index-GNAT_002eExpect-_0028g_002dexpect_002eads_0029"></a>
<p>Provides a set of subprograms similar to what is available
with the standard Tcl Expect tool.
It allows you to easily spawn and communicate with an external process.
You can send commands or inputs to the process, and compare the output
with some expected regular expression. Currently <code>GNAT.Expect</code>
is implemented on all native GNAT ports except for OpenVMS.
It is not implemented for cross ports, and in particular is not
implemented for VxWorks or LynxOS.
</p>
<hr>
<a name="GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029" accesskey="n" rel="next">GNAT.Float_Control (g-flocon.ads)</a>, Previous: <a href="#GNAT_002eExpect-_0028g_002dexpect_002eads_0029" accesskey="p" rel="prev">GNAT.Expect (g-expect.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029-1"></a>
<h3 class="section">10.71 <code>GNAT.Expect.TTY</code> (<samp>g-exptty.ads</samp>)</h3>
<a name="index-GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029"></a>
<p>As GNAT.Expect but using pseudo-terminal.
Currently <code>GNAT.Expect.TTY</code> is implemented on all native GNAT
ports except for OpenVMS. It is not implemented for cross ports, and
in particular is not implemented for VxWorks or LynxOS.
</p>
<hr>
<a name="GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029" accesskey="n" rel="next">GNAT.Heap_Sort (g-heasor.ads)</a>, Previous: <a href="#GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029" accesskey="p" rel="prev">GNAT.Expect.TTY (g-exptty.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029-1"></a>
<h3 class="section">10.72 <code>GNAT.Float_Control</code> (<samp>g-flocon.ads</samp>)</h3>
<a name="index-GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029"></a>
<a name="index-Floating_002dPoint-Processor"></a>
<p>Provides an interface for resetting the floating-point processor into the
mode required for correct semantic operation in Ada. Some third party
library calls may cause this mode to be modified, and the Reset procedure
in this package can be used to reestablish the required mode.
</p>
<hr>
<a name="GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029" accesskey="n" rel="next">GNAT.Heap_Sort_A (g-hesora.ads)</a>, Previous: <a href="#GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029" accesskey="p" rel="prev">GNAT.Float_Control (g-flocon.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029-1"></a>
<h3 class="section">10.73 <code>GNAT.Heap_Sort</code> (<samp>g-heasor.ads</samp>)</h3>
<a name="index-GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029"></a>
<a name="index-Sorting-3"></a>
<p>Provides a general implementation of heap sort usable for sorting arbitrary
data items. Exchange and comparison procedures are provided by passing
access-to-procedure values. The algorithm used is a modified heap sort
that performs approximately N*log(N) comparisons in the worst case.
</p>
<hr>
<a name="GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029" accesskey="n" rel="next">GNAT.Heap_Sort_G (g-hesorg.ads)</a>, Previous: <a href="#GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029" accesskey="p" rel="prev">GNAT.Heap_Sort (g-heasor.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029-1"></a>
<h3 class="section">10.74 <code>GNAT.Heap_Sort_A</code> (<samp>g-hesora.ads</samp>)</h3>
<a name="index-GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029"></a>
<a name="index-Sorting-4"></a>
<p>Provides a general implementation of heap sort usable for sorting arbitrary
data items. Move and comparison procedures are provided by passing
access-to-procedure values. The algorithm used is a modified heap sort
that performs approximately N*log(N) comparisons in the worst case.
This differs from <code>GNAT.Heap_Sort</code> in having a less convenient
interface, but may be slightly more efficient.
</p>
<hr>
<a name="GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eHTable-_0028g_002dhtable_002eads_0029" accesskey="n" rel="next">GNAT.HTable (g-htable.ads)</a>, Previous: <a href="#GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029" accesskey="p" rel="prev">GNAT.Heap_Sort_A (g-hesora.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029-1"></a>
<h3 class="section">10.75 <code>GNAT.Heap_Sort_G</code> (<samp>g-hesorg.ads</samp>)</h3>
<a name="index-GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029"></a>
<a name="index-Sorting-5"></a>
<p>Similar to <code>Heap_Sort_A</code> except that the move and sorting procedures
are provided as generic parameters, this improves efficiency, especially
if the procedures can be inlined, at the expense of duplicating code for
multiple instantiations.
</p>
<hr>
<a name="GNAT_002eHTable-_0028g_002dhtable_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eIO-_0028g_002dio_002eads_0029" accesskey="n" rel="next">GNAT.IO (g-io.ads)</a>, Previous: <a href="#GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029" accesskey="p" rel="prev">GNAT.Heap_Sort_G (g-hesorg.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eHTable-_0028g_002dhtable_002eads_0029-1"></a>
<h3 class="section">10.76 <code>GNAT.HTable</code> (<samp>g-htable.ads</samp>)</h3>
<a name="index-GNAT_002eHTable-_0028g_002dhtable_002eads_0029"></a>
<a name="index-Hash-tables-1"></a>
<p>A generic implementation of hash tables that can be used to hash arbitrary
data. Provides two approaches, one a simple static approach, and the other
allowing arbitrary dynamic hash tables.
</p>
<hr>
<a name="GNAT_002eIO-_0028g_002dio_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029" accesskey="n" rel="next">GNAT.IO_Aux (g-io_aux.ads)</a>, Previous: <a href="#GNAT_002eHTable-_0028g_002dhtable_002eads_0029" accesskey="p" rel="prev">GNAT.HTable (g-htable.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eIO-_0028g_002dio_002eads_0029-1"></a>
<h3 class="section">10.77 <code>GNAT.IO</code> (<samp>g-io.ads</samp>)</h3>
<a name="index-GNAT_002eIO-_0028g_002dio_002eads_0029"></a>
<a name="index-Simple-I_002fO"></a>
<a name="index-Input_002fOutput-facilities"></a>
<p>A simple preelaborable input-output package that provides a subset of
simple Text_IO functions for reading characters and strings from
Standard_Input, and writing characters, strings and integers to either
Standard_Output or Standard_Error.
</p>
<hr>
<a name="GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029" accesskey="n" rel="next">GNAT.Lock_Files (g-locfil.ads)</a>, Previous: <a href="#GNAT_002eIO-_0028g_002dio_002eads_0029" accesskey="p" rel="prev">GNAT.IO (g-io.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029-1"></a>
<h3 class="section">10.78 <code>GNAT.IO_Aux</code> (<samp>g-io_aux.ads</samp>)</h3>
<a name="index-GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029"></a>
<a name="index-Text_005fIO"></a>
<a name="index-Input_002fOutput-facilities-1"></a>
<p>Provides some auxiliary functions for use with Text_IO, including a test
for whether a file exists, and functions for reading a line of text.
</p>
<hr>
<a name="GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029" accesskey="n" rel="next">GNAT.MBBS_Discrete_Random (g-mbdira.ads)</a>, Previous: <a href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029" accesskey="p" rel="prev">GNAT.IO_Aux (g-io_aux.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029-1"></a>
<h3 class="section">10.79 <code>GNAT.Lock_Files</code> (<samp>g-locfil.ads</samp>)</h3>
<a name="index-GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029"></a>
<a name="index-File-locking"></a>
<a name="index-Locking-using-files"></a>
<p>Provides a general interface for using files as locks. Can be used for
providing program level synchronization.
</p>
<hr>
<a name="GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029" accesskey="n" rel="next">GNAT.MBBS_Float_Random (g-mbflra.ads)</a>, Previous: <a href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029" accesskey="p" rel="prev">GNAT.Lock_Files (g-locfil.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029-1"></a>
<h3 class="section">10.80 <code>GNAT.MBBS_Discrete_Random</code> (<samp>g-mbdira.ads</samp>)</h3>
<a name="index-GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029"></a>
<a name="index-Random-number-generation-1"></a>
<p>The original implementation of <code>Ada.Numerics.Discrete_Random</code>. Uses
a modified version of the Blum-Blum-Shub generator.
</p>
<hr>
<a name="GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eMD5-_0028g_002dmd5_002eads_0029" accesskey="n" rel="next">GNAT.MD5 (g-md5.ads)</a>, Previous: <a href="#GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029" accesskey="p" rel="prev">GNAT.MBBS_Discrete_Random (g-mbdira.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029-1"></a>
<h3 class="section">10.81 <code>GNAT.MBBS_Float_Random</code> (<samp>g-mbflra.ads</samp>)</h3>
<a name="index-GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029"></a>
<a name="index-Random-number-generation-2"></a>
<p>The original implementation of <code>Ada.Numerics.Float_Random</code>. Uses
a modified version of the Blum-Blum-Shub generator.
</p>
<hr>
<a name="GNAT_002eMD5-_0028g_002dmd5_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029" accesskey="n" rel="next">GNAT.Memory_Dump (g-memdum.ads)</a>, Previous: <a href="#GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029" accesskey="p" rel="prev">GNAT.MBBS_Float_Random (g-mbflra.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eMD5-_0028g_002dmd5_002eads_0029-1"></a>
<h3 class="section">10.82 <code>GNAT.MD5</code> (<samp>g-md5.ads</samp>)</h3>
<a name="index-GNAT_002eMD5-_0028g_002dmd5_002eads_0029"></a>
<a name="index-Message-Digest-MD5"></a>
<p>Implements the MD5 Message-Digest Algorithm as described in RFC 1321.
</p>
<hr>
<a name="GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029" accesskey="n" rel="next">GNAT.Most_Recent_Exception (g-moreex.ads)</a>, Previous: <a href="#GNAT_002eMD5-_0028g_002dmd5_002eads_0029" accesskey="p" rel="prev">GNAT.MD5 (g-md5.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029-1"></a>
<h3 class="section">10.83 <code>GNAT.Memory_Dump</code> (<samp>g-memdum.ads</samp>)</h3>
<a name="index-GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029"></a>
<a name="index-Dump-Memory"></a>
<p>Provides a convenient routine for dumping raw memory to either the
standard output or standard error files. Uses GNAT.IO for actual
output.
</p>
<hr>
<a name="GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029" accesskey="n" rel="next">GNAT.OS_Lib (g-os_lib.ads)</a>, Previous: <a href="#GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029" accesskey="p" rel="prev">GNAT.Memory_Dump (g-memdum.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029-1"></a>
<h3 class="section">10.84 <code>GNAT.Most_Recent_Exception</code> (<samp>g-moreex.ads</samp>)</h3>
<a name="index-GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029"></a>
<a name="index-Exception_002c-obtaining-most-recent"></a>
<p>Provides access to the most recently raised exception. Can be used for
various logging purposes, including duplicating functionality of some
Ada 83 implementation dependent extensions.
</p>
<hr>
<a name="GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029" accesskey="n" rel="next">GNAT.Perfect_Hash_Generators (g-pehage.ads)</a>, Previous: <a href="#GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029" accesskey="p" rel="prev">GNAT.Most_Recent_Exception (g-moreex.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029-1"></a>
<h3 class="section">10.85 <code>GNAT.OS_Lib</code> (<samp>g-os_lib.ads</samp>)</h3>
<a name="index-GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029"></a>
<a name="index-Operating-System-interface"></a>
<a name="index-Spawn-capability"></a>
<p>Provides a range of target independent operating system interface functions,
including time/date management, file operations, subprocess management,
including a portable spawn procedure, and access to environment variables
and error return codes.
</p>
<hr>
<a name="GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029" accesskey="n" rel="next">GNAT.Random_Numbers (g-rannum.ads)</a>, Previous: <a href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029" accesskey="p" rel="prev">GNAT.OS_Lib (g-os_lib.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029-1"></a>
<h3 class="section">10.86 <code>GNAT.Perfect_Hash_Generators</code> (<samp>g-pehage.ads</samp>)</h3>
<a name="index-GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029"></a>
<a name="index-Hash-functions"></a>
<p>Provides a generator of static minimal perfect hash functions. No
collisions occur and each item can be retrieved from the table in one
probe (perfect property). The hash table size corresponds to the exact
size of the key set and no larger (minimal property). The key set has to
be know in advance (static property). The hash functions are also order
preserving. If w2 is inserted after w1 in the generator, their
hashcode are in the same order. These hashing functions are very
convenient for use with realtime applications.
</p>
<hr>
<a name="GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029" accesskey="n" rel="next">GNAT.Regexp (g-regexp.ads)</a>, Previous: <a href="#GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029" accesskey="p" rel="prev">GNAT.Perfect_Hash_Generators (g-pehage.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029-1"></a>
<h3 class="section">10.87 <code>GNAT.Random_Numbers</code> (<samp>g-rannum.ads</samp>)</h3>
<a name="index-GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029"></a>
<a name="index-Random-number-generation-3"></a>
<p>Provides random number capabilities which extend those available in the
standard Ada library and are more convenient to use.
</p>
<hr>
<a name="GNAT_002eRegexp-_0028g_002dregexp_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eRegistry-_0028g_002dregist_002eads_0029" accesskey="n" rel="next">GNAT.Registry (g-regist.ads)</a>, Previous: <a href="#GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029" accesskey="p" rel="prev">GNAT.Random_Numbers (g-rannum.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eRegexp-_0028g_002dregexp_002eads_0029-1"></a>
<h3 class="section">10.88 <code>GNAT.Regexp</code> (<samp>g-regexp.ads</samp>)</h3>
<a name="index-GNAT_002eRegexp-_0028g_002dregexp_002eads_0029"></a>
<a name="index-Regular-expressions"></a>
<a name="index-Pattern-matching"></a>
<p>A simple implementation of regular expressions, using a subset of regular
expression syntax copied from familiar Unix style utilities. This is the
simples of the three pattern matching packages provided, and is particularly
suitable for “file globbing” applications.
</p>
<hr>
<a name="GNAT_002eRegistry-_0028g_002dregist_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029" accesskey="n" rel="next">GNAT.Regpat (g-regpat.ads)</a>, Previous: <a href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029" accesskey="p" rel="prev">GNAT.Regexp (g-regexp.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eRegistry-_0028g_002dregist_002eads_0029-1"></a>
<h3 class="section">10.89 <code>GNAT.Registry</code> (<samp>g-regist.ads</samp>)</h3>
<a name="index-GNAT_002eRegistry-_0028g_002dregist_002eads_0029"></a>
<a name="index-Windows-Registry"></a>
<p>This is a high level binding to the Windows registry. It is possible to
do simple things like reading a key value, creating a new key. For full
registry API, but at a lower level of abstraction, refer to the Win32.Winreg
package provided with the Win32Ada binding
</p>
<hr>
<a name="GNAT_002eRegpat-_0028g_002dregpat_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029" accesskey="n" rel="next">GNAT.Secondary_Stack_Info (g-sestin.ads)</a>, Previous: <a href="#GNAT_002eRegistry-_0028g_002dregist_002eads_0029" accesskey="p" rel="prev">GNAT.Registry (g-regist.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eRegpat-_0028g_002dregpat_002eads_0029-1"></a>
<h3 class="section">10.90 <code>GNAT.Regpat</code> (<samp>g-regpat.ads</samp>)</h3>
<a name="index-GNAT_002eRegpat-_0028g_002dregpat_002eads_0029"></a>
<a name="index-Regular-expressions-1"></a>
<a name="index-Pattern-matching-1"></a>
<p>A complete implementation of Unix-style regular expression matching, copied
from the original V7 style regular expression library written in C by
Henry Spencer (and binary compatible with this C library).
</p>
<hr>
<a name="GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029" accesskey="n" rel="next">GNAT.Semaphores (g-semaph.ads)</a>, Previous: <a href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029" accesskey="p" rel="prev">GNAT.Regpat (g-regpat.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029-1"></a>
<h3 class="section">10.91 <code>GNAT.Secondary_Stack_Info</code> (<samp>g-sestin.ads</samp>)</h3>
<a name="index-GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029"></a>
<a name="index-Secondary-Stack-Info"></a>
<p>Provide the capability to query the high water mark of the current task’s
secondary stack.
</p>
<hr>
<a name="GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029" accesskey="n" rel="next">GNAT.Serial_Communications (g-sercom.ads)</a>, Previous: <a href="#GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029" accesskey="p" rel="prev">GNAT.Secondary_Stack_Info (g-sestin.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029-1"></a>
<h3 class="section">10.92 <code>GNAT.Semaphores</code> (<samp>g-semaph.ads</samp>)</h3>
<a name="index-GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029"></a>
<a name="index-Semaphores"></a>
<p>Provides classic counting and binary semaphores using protected types.
</p>
<hr>
<a name="GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSHA1-_0028g_002dsha1_002eads_0029" accesskey="n" rel="next">GNAT.SHA1 (g-sha1.ads)</a>, Previous: <a href="#GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029" accesskey="p" rel="prev">GNAT.Semaphores (g-semaph.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029-1"></a>
<h3 class="section">10.93 <code>GNAT.Serial_Communications</code> (<samp>g-sercom.ads</samp>)</h3>
<a name="index-GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029"></a>
<a name="index-Serial_005fCommunications"></a>
<p>Provides a simple interface to send and receive data over a serial
port. This is only supported on GNU/Linux and Windows.
</p>
<hr>
<a name="GNAT_002eSHA1-_0028g_002dsha1_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSHA224-_0028g_002dsha224_002eads_0029" accesskey="n" rel="next">GNAT.SHA224 (g-sha224.ads)</a>, Previous: <a href="#GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029" accesskey="p" rel="prev">GNAT.Serial_Communications (g-sercom.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSHA1-_0028g_002dsha1_002eads_0029-1"></a>
<h3 class="section">10.94 <code>GNAT.SHA1</code> (<samp>g-sha1.ads</samp>)</h3>
<a name="index-GNAT_002eSHA1-_0028g_002dsha1_002eads_0029"></a>
<a name="index-Secure-Hash-Algorithm-SHA_002d1"></a>
<p>Implements the SHA-1 Secure Hash Algorithm as described in FIPS PUB 180-3
and RFC 3174.
</p>
<hr>
<a name="GNAT_002eSHA224-_0028g_002dsha224_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSHA256-_0028g_002dsha256_002eads_0029" accesskey="n" rel="next">GNAT.SHA256 (g-sha256.ads)</a>, Previous: <a href="#GNAT_002eSHA1-_0028g_002dsha1_002eads_0029" accesskey="p" rel="prev">GNAT.SHA1 (g-sha1.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSHA224-_0028g_002dsha224_002eads_0029-1"></a>
<h3 class="section">10.95 <code>GNAT.SHA224</code> (<samp>g-sha224.ads</samp>)</h3>
<a name="index-GNAT_002eSHA224-_0028g_002dsha224_002eads_0029"></a>
<a name="index-Secure-Hash-Algorithm-SHA_002d224"></a>
<p>Implements the SHA-224 Secure Hash Algorithm as described in FIPS PUB 180-3.
</p>
<hr>
<a name="GNAT_002eSHA256-_0028g_002dsha256_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSHA384-_0028g_002dsha384_002eads_0029" accesskey="n" rel="next">GNAT.SHA384 (g-sha384.ads)</a>, Previous: <a href="#GNAT_002eSHA224-_0028g_002dsha224_002eads_0029" accesskey="p" rel="prev">GNAT.SHA224 (g-sha224.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSHA256-_0028g_002dsha256_002eads_0029-1"></a>
<h3 class="section">10.96 <code>GNAT.SHA256</code> (<samp>g-sha256.ads</samp>)</h3>
<a name="index-GNAT_002eSHA256-_0028g_002dsha256_002eads_0029"></a>
<a name="index-Secure-Hash-Algorithm-SHA_002d256"></a>
<p>Implements the SHA-256 Secure Hash Algorithm as described in FIPS PUB 180-3.
</p>
<hr>
<a name="GNAT_002eSHA384-_0028g_002dsha384_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSHA512-_0028g_002dsha512_002eads_0029" accesskey="n" rel="next">GNAT.SHA512 (g-sha512.ads)</a>, Previous: <a href="#GNAT_002eSHA256-_0028g_002dsha256_002eads_0029" accesskey="p" rel="prev">GNAT.SHA256 (g-sha256.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSHA384-_0028g_002dsha384_002eads_0029-1"></a>
<h3 class="section">10.97 <code>GNAT.SHA384</code> (<samp>g-sha384.ads</samp>)</h3>
<a name="index-GNAT_002eSHA384-_0028g_002dsha384_002eads_0029"></a>
<a name="index-Secure-Hash-Algorithm-SHA_002d384"></a>
<p>Implements the SHA-384 Secure Hash Algorithm as described in FIPS PUB 180-3.
</p>
<hr>
<a name="GNAT_002eSHA512-_0028g_002dsha512_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSignals-_0028g_002dsignal_002eads_0029" accesskey="n" rel="next">GNAT.Signals (g-signal.ads)</a>, Previous: <a href="#GNAT_002eSHA384-_0028g_002dsha384_002eads_0029" accesskey="p" rel="prev">GNAT.SHA384 (g-sha384.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSHA512-_0028g_002dsha512_002eads_0029-1"></a>
<h3 class="section">10.98 <code>GNAT.SHA512</code> (<samp>g-sha512.ads</samp>)</h3>
<a name="index-GNAT_002eSHA512-_0028g_002dsha512_002eads_0029"></a>
<a name="index-Secure-Hash-Algorithm-SHA_002d512"></a>
<p>Implements the SHA-512 Secure Hash Algorithm as described in FIPS PUB 180-3.
</p>
<hr>
<a name="GNAT_002eSignals-_0028g_002dsignal_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSockets-_0028g_002dsocket_002eads_0029" accesskey="n" rel="next">GNAT.Sockets (g-socket.ads)</a>, Previous: <a href="#GNAT_002eSHA512-_0028g_002dsha512_002eads_0029" accesskey="p" rel="prev">GNAT.SHA512 (g-sha512.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSignals-_0028g_002dsignal_002eads_0029-1"></a>
<h3 class="section">10.99 <code>GNAT.Signals</code> (<samp>g-signal.ads</samp>)</h3>
<a name="index-GNAT_002eSignals-_0028g_002dsignal_002eads_0029"></a>
<a name="index-Signals"></a>
<p>Provides the ability to manipulate the blocked status of signals on supported
targets.
</p>
<hr>
<a name="GNAT_002eSockets-_0028g_002dsocket_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029" accesskey="n" rel="next">GNAT.Source_Info (g-souinf.ads)</a>, Previous: <a href="#GNAT_002eSignals-_0028g_002dsignal_002eads_0029" accesskey="p" rel="prev">GNAT.Signals (g-signal.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSockets-_0028g_002dsocket_002eads_0029-1"></a>
<h3 class="section">10.100 <code>GNAT.Sockets</code> (<samp>g-socket.ads</samp>)</h3>
<a name="index-GNAT_002eSockets-_0028g_002dsocket_002eads_0029"></a>
<a name="index-Sockets"></a>
<p>A high level and portable interface to develop sockets based applications.
This package is based on the sockets thin binding found in
<code>GNAT.Sockets.Thin</code>. Currently <code>GNAT.Sockets</code> is implemented
on all native GNAT ports except for OpenVMS. It is not implemented
for the LynxOS cross port.
</p>
<hr>
<a name="GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029" accesskey="n" rel="next">GNAT.Spelling_Checker (g-speche.ads)</a>, Previous: <a href="#GNAT_002eSockets-_0028g_002dsocket_002eads_0029" accesskey="p" rel="prev">GNAT.Sockets (g-socket.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029-1"></a>
<h3 class="section">10.101 <code>GNAT.Source_Info</code> (<samp>g-souinf.ads</samp>)</h3>
<a name="index-GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029"></a>
<a name="index-Source-Information"></a>
<p>Provides subprograms that give access to source code information known at
compile time, such as the current file name and line number.
</p>
<hr>
<a name="GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029" accesskey="n" rel="next">GNAT.Spelling_Checker_Generic (g-spchge.ads)</a>, Previous: <a href="#GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029" accesskey="p" rel="prev">GNAT.Source_Info (g-souinf.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029-1"></a>
<h3 class="section">10.102 <code>GNAT.Spelling_Checker</code> (<samp>g-speche.ads</samp>)</h3>
<a name="index-GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029"></a>
<a name="index-Spell-checking"></a>
<p>Provides a function for determining whether one string is a plausible
near misspelling of another string.
</p>
<hr>
<a name="GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029" accesskey="n" rel="next">GNAT.Spitbol.Patterns (g-spipat.ads)</a>, Previous: <a href="#GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029" accesskey="p" rel="prev">GNAT.Spelling_Checker (g-speche.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029-1"></a>
<h3 class="section">10.103 <code>GNAT.Spelling_Checker_Generic</code> (<samp>g-spchge.ads</samp>)</h3>
<a name="index-GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029"></a>
<a name="index-Spell-checking-1"></a>
<p>Provides a generic function that can be instantiated with a string type for
determining whether one string is a plausible near misspelling of another
string.
</p>
<hr>
<a name="GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029" accesskey="n" rel="next">GNAT.Spitbol (g-spitbo.ads)</a>, Previous: <a href="#GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029" accesskey="p" rel="prev">GNAT.Spelling_Checker_Generic (g-spchge.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029-1"></a>
<h3 class="section">10.104 <code>GNAT.Spitbol.Patterns</code> (<samp>g-spipat.ads</samp>)</h3>
<a name="index-GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029"></a>
<a name="index-SPITBOL-pattern-matching"></a>
<a name="index-Pattern-matching-2"></a>
<p>A complete implementation of SNOBOL4 style pattern matching. This is the
most elaborate of the pattern matching packages provided. It fully duplicates
the SNOBOL4 dynamic pattern construction and matching capabilities, using the
efficient algorithm developed by Robert Dewar for the SPITBOL system.
</p>
<hr>
<a name="GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029" accesskey="n" rel="next">GNAT.Spitbol.Table_Boolean (g-sptabo.ads)</a>, Previous: <a href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029" accesskey="p" rel="prev">GNAT.Spitbol.Patterns (g-spipat.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029-1"></a>
<h3 class="section">10.105 <code>GNAT.Spitbol</code> (<samp>g-spitbo.ads</samp>)</h3>
<a name="index-GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029"></a>
<a name="index-SPITBOL-interface"></a>
<p>The top level package of the collection of SPITBOL-style functionality, this
package provides basic SNOBOL4 string manipulation functions, such as
Pad, Reverse, Trim, Substr capability, as well as a generic table function
useful for constructing arbitrary mappings from strings in the style of
the SNOBOL4 TABLE function.
</p>
<hr>
<a name="GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029" accesskey="n" rel="next">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a>, Previous: <a href="#GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029" accesskey="p" rel="prev">GNAT.Spitbol (g-spitbo.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029-1"></a>
<h3 class="section">10.106 <code>GNAT.Spitbol.Table_Boolean</code> (<samp>g-sptabo.ads</samp>)</h3>
<a name="index-GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029"></a>
<a name="index-Sets-of-strings"></a>
<a name="index-SPITBOL-Tables"></a>
<p>A library level of instantiation of <code>GNAT.Spitbol.Patterns.Table</code>
for type <code>Standard.Boolean</code>, giving an implementation of sets of
string values.
</p>
<hr>
<a name="GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029" accesskey="n" rel="next">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a>, Previous: <a href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029" accesskey="p" rel="prev">GNAT.Spitbol.Table_Boolean (g-sptabo.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029-1"></a>
<h3 class="section">10.107 <code>GNAT.Spitbol.Table_Integer</code> (<samp>g-sptain.ads</samp>)</h3>
<a name="index-GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029"></a>
<a name="index-Integer-maps"></a>
<a name="index-Maps"></a>
<a name="index-SPITBOL-Tables-1"></a>
<p>A library level of instantiation of <code>GNAT.Spitbol.Patterns.Table</code>
for type <code>Standard.Integer</code>, giving an implementation of maps
from string to integer values.
</p>
<hr>
<a name="GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSSE-_0028g_002dsse_002eads_0029" accesskey="n" rel="next">GNAT.SSE (g-sse.ads)</a>, Previous: <a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029" accesskey="p" rel="prev">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029-1"></a>
<h3 class="section">10.108 <code>GNAT.Spitbol.Table_VString</code> (<samp>g-sptavs.ads</samp>)</h3>
<a name="index-GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029"></a>
<a name="index-String-maps"></a>
<a name="index-Maps-1"></a>
<a name="index-SPITBOL-Tables-2"></a>
<p>A library level of instantiation of <code>GNAT.Spitbol.Patterns.Table</code> for
a variable length string type, giving an implementation of general
maps from strings to strings.
</p>
<hr>
<a name="GNAT_002eSSE-_0028g_002dsse_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029" accesskey="n" rel="next">GNAT.SSE.Vector_Types (g-ssvety.ads)</a>, Previous: <a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029" accesskey="p" rel="prev">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSSE-_0028g_002dsse_002eads_0029-1"></a>
<h3 class="section">10.109 <code>GNAT.SSE</code> (<samp>g-sse.ads</samp>)</h3>
<a name="index-GNAT_002eSSE-_0028g_002dsse_002eads_0029"></a>
<p>Root of a set of units aimed at offering Ada bindings to a subset of
the Intel(r) Streaming SIMD Extensions with GNAT on the x86 family of
targets. It exposes vector component types together with a general
introduction to the binding contents and use.
</p>
<hr>
<a name="GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eStrings-_0028g_002dstring_002eads_0029" accesskey="n" rel="next">GNAT.Strings (g-string.ads)</a>, Previous: <a href="#GNAT_002eSSE-_0028g_002dsse_002eads_0029" accesskey="p" rel="prev">GNAT.SSE (g-sse.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029-1"></a>
<h3 class="section">10.110 <code>GNAT.SSE.Vector_Types</code> (<samp>g-ssvety.ads</samp>)</h3>
<a name="index-GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029"></a>
<p>SSE vector types for use with SSE related intrinsics.
</p>
<hr>
<a name="GNAT_002eStrings-_0028g_002dstring_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029" accesskey="n" rel="next">GNAT.String_Split (g-strspl.ads)</a>, Previous: <a href="#GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029" accesskey="p" rel="prev">GNAT.SSE.Vector_Types (g-ssvety.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eStrings-_0028g_002dstring_002eads_0029-1"></a>
<h3 class="section">10.111 <code>GNAT.Strings</code> (<samp>g-string.ads</samp>)</h3>
<a name="index-GNAT_002eStrings-_0028g_002dstring_002eads_0029"></a>
<p>Common String access types and related subprograms. Basically it
defines a string access and an array of string access types.
</p>
<hr>
<a name="GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eTable-_0028g_002dtable_002eads_0029" accesskey="n" rel="next">GNAT.Table (g-table.ads)</a>, Previous: <a href="#GNAT_002eStrings-_0028g_002dstring_002eads_0029" accesskey="p" rel="prev">GNAT.Strings (g-string.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029-1"></a>
<h3 class="section">10.112 <code>GNAT.String_Split</code> (<samp>g-strspl.ads</samp>)</h3>
<a name="index-GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029"></a>
<a name="index-String-splitter"></a>
<p>Useful string manipulation routines: given a set of separators, split
a string wherever the separators appear, and provide direct access
to the resulting slices. This package is instantiated from
<code>GNAT.Array_Split</code>.
</p>
<hr>
<a name="GNAT_002eTable-_0028g_002dtable_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029" accesskey="n" rel="next">GNAT.Task_Lock (g-tasloc.ads)</a>, Previous: <a href="#GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029" accesskey="p" rel="prev">GNAT.String_Split (g-strspl.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eTable-_0028g_002dtable_002eads_0029-1"></a>
<h3 class="section">10.113 <code>GNAT.Table</code> (<samp>g-table.ads</samp>)</h3>
<a name="index-GNAT_002eTable-_0028g_002dtable_002eads_0029"></a>
<a name="index-Table-implementation-1"></a>
<a name="index-Arrays_002c-extendable-1"></a>
<p>A generic package providing a single dimension array abstraction where the
length of the array can be dynamically modified.
</p>
<p>This package provides a facility similar to that of <code>GNAT.Dynamic_Tables</code>,
except that this package declares a single instance of the table type,
while an instantiation of <code>GNAT.Dynamic_Tables</code> creates a type that can be
used to define dynamic instances of the table.
</p>
<hr>
<a name="GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029" accesskey="n" rel="next">GNAT.Time_Stamp (g-timsta.ads)</a>, Previous: <a href="#GNAT_002eTable-_0028g_002dtable_002eads_0029" accesskey="p" rel="prev">GNAT.Table (g-table.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029-1"></a>
<h3 class="section">10.114 <code>GNAT.Task_Lock</code> (<samp>g-tasloc.ads</samp>)</h3>
<a name="index-GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029"></a>
<a name="index-Task-synchronization"></a>
<a name="index-Task-locking"></a>
<a name="index-Locking"></a>
<p>A very simple facility for locking and unlocking sections of code using a
single global task lock. Appropriate for use in situations where contention
between tasks is very rarely expected.
</p>
<hr>
<a name="GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029" accesskey="n" rel="next">GNAT.Threads (g-thread.ads)</a>, Previous: <a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029" accesskey="p" rel="prev">GNAT.Task_Lock (g-tasloc.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029-1"></a>
<h3 class="section">10.115 <code>GNAT.Time_Stamp</code> (<samp>g-timsta.ads</samp>)</h3>
<a name="index-GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029"></a>
<a name="index-Time-stamp"></a>
<a name="index-Current-time"></a>
<p>Provides a simple function that returns a string YYYY-MM-DD HH:MM:SS.SS that
represents the current date and time in ISO 8601 format. This is a very simple
routine with minimal code and there are no dependencies on any other unit.
</p>
<hr>
<a name="GNAT_002eThreads-_0028g_002dthread_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029" accesskey="n" rel="next">GNAT.Traceback (g-traceb.ads)</a>, Previous: <a href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029" accesskey="p" rel="prev">GNAT.Time_Stamp (g-timsta.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eThreads-_0028g_002dthread_002eads_0029-1"></a>
<h3 class="section">10.116 <code>GNAT.Threads</code> (<samp>g-thread.ads</samp>)</h3>
<a name="index-GNAT_002eThreads-_0028g_002dthread_002eads_0029"></a>
<a name="index-Foreign-threads"></a>
<a name="index-Threads_002c-foreign"></a>
<p>Provides facilities for dealing with foreign threads which need to be known
by the GNAT run-time system. Consult the documentation of this package for
further details if your program has threads that are created by a non-Ada
environment which then accesses Ada code.
</p>
<hr>
<a name="GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029" accesskey="n" rel="next">GNAT.Traceback.Symbolic (g-trasym.ads)</a>, Previous: <a href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029" accesskey="p" rel="prev">GNAT.Threads (g-thread.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029-1"></a>
<h3 class="section">10.117 <code>GNAT.Traceback</code> (<samp>g-traceb.ads</samp>)</h3>
<a name="index-GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029"></a>
<a name="index-Trace-back-facilities"></a>
<p>Provides a facility for obtaining non-symbolic traceback information, useful
in various debugging situations.
</p>
<hr>
<a name="GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029" accesskey="n" rel="next">GNAT.UTF_32 (g-utf_32.ads)</a>, Previous: <a href="#GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029" accesskey="p" rel="prev">GNAT.Traceback (g-traceb.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029-1"></a>
<h3 class="section">10.118 <code>GNAT.Traceback.Symbolic</code> (<samp>g-trasym.ads</samp>)</h3>
<a name="index-GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029"></a>
<a name="index-Trace-back-facilities-1"></a>
<hr>
<a name="GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029" accesskey="n" rel="next">GNAT.UTF_32_Spelling_Checker (g-u3spch.ads)</a>, Previous: <a href="#GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029" accesskey="p" rel="prev">GNAT.Traceback.Symbolic (g-trasym.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eUTF_005f32-_0028g_002dtable_002eads_0029"></a>
<h3 class="section">10.119 <code>GNAT.UTF_32</code> (<samp>g-table.ads</samp>)</h3>
<a name="index-GNAT_002eUTF_005f32-_0028g_002dtable_002eads_0029"></a>
<a name="index-Wide-character-codes"></a>
<p>This is a package intended to be used in conjunction with the
<code>Wide_Character</code> type in Ada 95 and the
<code>Wide_Wide_Character</code> type in Ada 2005 (available
in <code>GNAT</code> in Ada 2005 mode). This package contains
Unicode categorization routines, as well as lexical
categorization routines corresponding to the Ada 2005
lexical rules for identifiers and strings, and also a
lower case to upper case fold routine corresponding to
the Ada 2005 rules for identifier equivalence.
</p>
<hr>
<a name="GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029" accesskey="n" rel="next">GNAT.Wide_Spelling_Checker (g-wispch.ads)</a>, Previous: <a href="#GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029" accesskey="p" rel="prev">GNAT.UTF_32 (g-utf_32.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eWide_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029"></a>
<h3 class="section">10.120 <code>GNAT.Wide_Spelling_Checker</code> (<samp>g-u3spch.ads</samp>)</h3>
<a name="index-GNAT_002eWide_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029"></a>
<a name="index-Spell-checking-2"></a>
<p>Provides a function for determining whether one wide wide string is a plausible
near misspelling of another wide wide string, where the strings are represented
using the UTF_32_String type defined in System.Wch_Cnv.
</p>
<hr>
<a name="GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029" accesskey="n" rel="next">GNAT.Wide_String_Split (g-wistsp.ads)</a>, Previous: <a href="#GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029" accesskey="p" rel="prev">GNAT.UTF_32_Spelling_Checker (g-u3spch.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029-1"></a>
<h3 class="section">10.121 <code>GNAT.Wide_Spelling_Checker</code> (<samp>g-wispch.ads</samp>)</h3>
<a name="index-GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029"></a>
<a name="index-Spell-checking-3"></a>
<p>Provides a function for determining whether one wide string is a plausible
near misspelling of another wide string.
</p>
<hr>
<a name="GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029" accesskey="n" rel="next">GNAT.Wide_Wide_Spelling_Checker (g-zspche.ads)</a>, Previous: <a href="#GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029" accesskey="p" rel="prev">GNAT.Wide_Spelling_Checker (g-wispch.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029-1"></a>
<h3 class="section">10.122 <code>GNAT.Wide_String_Split</code> (<samp>g-wistsp.ads</samp>)</h3>
<a name="index-GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029"></a>
<a name="index-Wide_005fString-splitter"></a>
<p>Useful wide string manipulation routines: given a set of separators, split
a wide string wherever the separators appear, and provide direct access
to the resulting slices. This package is instantiated from
<code>GNAT.Array_Split</code>.
</p>
<hr>
<a name="GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029" accesskey="n" rel="next">GNAT.Wide_Wide_String_Split (g-zistsp.ads)</a>, Previous: <a href="#GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029" accesskey="p" rel="prev">GNAT.Wide_String_Split (g-wistsp.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029-1"></a>
<h3 class="section">10.123 <code>GNAT.Wide_Wide_Spelling_Checker</code> (<samp>g-zspche.ads</samp>)</h3>
<a name="index-GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029"></a>
<a name="index-Spell-checking-4"></a>
<p>Provides a function for determining whether one wide wide string is a plausible
near misspelling of another wide wide string.
</p>
<hr>
<a name="GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029" accesskey="n" rel="next">Interfaces.C.Extensions (i-cexten.ads)</a>, Previous: <a href="#GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029" accesskey="p" rel="prev">GNAT.Wide_Wide_Spelling_Checker (g-zspche.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029-1"></a>
<h3 class="section">10.124 <code>GNAT.Wide_Wide_String_Split</code> (<samp>g-zistsp.ads</samp>)</h3>
<a name="index-GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029"></a>
<a name="index-Wide_005fWide_005fString-splitter"></a>
<p>Useful wide wide string manipulation routines: given a set of separators, split
a wide wide string wherever the separators appear, and provide direct access
to the resulting slices. This package is instantiated from
<code>GNAT.Array_Split</code>.
</p>
<hr>
<a name="Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029" accesskey="n" rel="next">Interfaces.C.Streams (i-cstrea.ads)</a>, Previous: <a href="#GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029" accesskey="p" rel="prev">GNAT.Wide_Wide_String_Split (g-zistsp.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029-1"></a>
<h3 class="section">10.125 <code>Interfaces.C.Extensions</code> (<samp>i-cexten.ads</samp>)</h3>
<a name="index-Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029"></a>
<p>This package contains additional C-related definitions, intended
for use with either manually or automatically generated bindings
to C libraries.
</p>
<hr>
<a name="Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029" accesskey="n" rel="next">Interfaces.CPP (i-cpp.ads)</a>, Previous: <a href="#Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029" accesskey="p" rel="prev">Interfaces.C.Extensions (i-cexten.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029-1"></a>
<h3 class="section">10.126 <code>Interfaces.C.Streams</code> (<samp>i-cstrea.ads</samp>)</h3>
<a name="index-Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029"></a>
<a name="index-C-streams_002c-interfacing"></a>
<p>This package is a binding for the most commonly used operations
on C streams.
</p>
<hr>
<a name="Interfaces_002eCPP-_0028i_002dcpp_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029" accesskey="n" rel="next">Interfaces.Packed_Decimal (i-pacdec.ads)</a>, Previous: <a href="#Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029" accesskey="p" rel="prev">Interfaces.C.Streams (i-cstrea.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfaces_002eCPP-_0028i_002dcpp_002eads_0029-1"></a>
<h3 class="section">10.127 <code>Interfaces.CPP</code> (<samp>i-cpp.ads</samp>)</h3>
<a name="index-Interfaces_002eCPP-_0028i_002dcpp_002eads_0029"></a>
<a name="index-C_002b_002b-interfacing"></a>
<a name="index-Interfacing_002c-to-C_002b_002b"></a>
<p>This package provides facilities for use in interfacing to C++. It
is primarily intended to be used in connection with automated tools
for the generation of C++ interfaces.
</p>
<hr>
<a name="Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029" accesskey="n" rel="next">Interfaces.VxWorks (i-vxwork.ads)</a>, Previous: <a href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029" accesskey="p" rel="prev">Interfaces.CPP (i-cpp.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029-1"></a>
<h3 class="section">10.128 <code>Interfaces.Packed_Decimal</code> (<samp>i-pacdec.ads</samp>)</h3>
<a name="index-Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029"></a>
<a name="index-IBM-Packed-Format"></a>
<a name="index-Packed-Decimal"></a>
<p>This package provides a set of routines for conversions to and
from a packed decimal format compatible with that used on IBM
mainframes.
</p>
<hr>
<a name="Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029" accesskey="n" rel="next">Interfaces.VxWorks.IO (i-vxwoio.ads)</a>, Previous: <a href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029" accesskey="p" rel="prev">Interfaces.Packed_Decimal (i-pacdec.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029-1"></a>
<h3 class="section">10.129 <code>Interfaces.VxWorks</code> (<samp>i-vxwork.ads</samp>)</h3>
<a name="index-Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029"></a>
<a name="index-Interfacing-to-VxWorks"></a>
<a name="index-VxWorks_002c-interfacing"></a>
<p>This package provides a limited binding to the VxWorks API.
In particular, it interfaces with the
VxWorks hardware interrupt facilities.
</p>
<hr>
<a name="Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029" accesskey="n" rel="next">System.Address_Image (s-addima.ads)</a>, Previous: <a href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029" accesskey="p" rel="prev">Interfaces.VxWorks (i-vxwork.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029-1"></a>
<h3 class="section">10.130 <code>Interfaces.VxWorks.IO</code> (<samp>i-vxwoio.ads</samp>)</h3>
<a name="index-Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029"></a>
<a name="index-Interfacing-to-VxWorks_0027-I_002fO"></a>
<a name="index-VxWorks_002c-I_002fO-interfacing"></a>
<a name="index-VxWorks_002c-Get_005fImmediate"></a>
<a name="index-Get_005fImmediate_002c-VxWorks"></a>
<p>This package provides a binding to the ioctl (IO/Control)
function of VxWorks, defining a set of option values and
function codes. A particular use of this package is
to enable the use of Get_Immediate under VxWorks.
</p>
<hr>
<a name="System_002eAddress_005fImage-_0028s_002daddima_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eAssertions-_0028s_002dassert_002eads_0029" accesskey="n" rel="next">System.Assertions (s-assert.ads)</a>, Previous: <a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029" accesskey="p" rel="prev">Interfaces.VxWorks.IO (i-vxwoio.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eAddress_005fImage-_0028s_002daddima_002eads_0029-1"></a>
<h3 class="section">10.131 <code>System.Address_Image</code> (<samp>s-addima.ads</samp>)</h3>
<a name="index-System_002eAddress_005fImage-_0028s_002daddima_002eads_0029"></a>
<a name="index-Address-image"></a>
<a name="index-Image_002c-of-an-address"></a>
<p>This function provides a useful debugging
function that gives an (implementation dependent)
string which identifies an address.
</p>
<hr>
<a name="System_002eAssertions-_0028s_002dassert_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eMemory-_0028s_002dmemory_002eads_0029" accesskey="n" rel="next">System.Memory (s-memory.ads)</a>, Previous: <a href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029" accesskey="p" rel="prev">System.Address_Image (s-addima.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eAssertions-_0028s_002dassert_002eads_0029-1"></a>
<h3 class="section">10.132 <code>System.Assertions</code> (<samp>s-assert.ads</samp>)</h3>
<a name="index-System_002eAssertions-_0028s_002dassert_002eads_0029"></a>
<a name="index-Assertions-1"></a>
<a name="index-Assert_005fFailure_002c-exception"></a>
<p>This package provides the declaration of the exception raised
by an run-time assertion failure, as well as the routine that
is used internally to raise this assertion.
</p>
<hr>
<a name="System_002eMemory-_0028s_002dmemory_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029" accesskey="n" rel="next">System.Partition_Interface (s-parint.ads)</a>, Previous: <a href="#System_002eAssertions-_0028s_002dassert_002eads_0029" accesskey="p" rel="prev">System.Assertions (s-assert.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eMemory-_0028s_002dmemory_002eads_0029-1"></a>
<h3 class="section">10.133 <code>System.Memory</code> (<samp>s-memory.ads</samp>)</h3>
<a name="index-System_002eMemory-_0028s_002dmemory_002eads_0029"></a>
<a name="index-Memory-allocation"></a>
<p>This package provides the interface to the low level routines used
by the generated code for allocation and freeing storage for the
default storage pool (analogous to the C routines malloc and free.
It also provides a reallocation interface analogous to the C routine
realloc. The body of this unit may be modified to provide alternative
allocation mechanisms for the default pool, and in addition, direct
calls to this unit may be made for low level allocation uses (for
example see the body of <code>GNAT.Tables</code>).
</p>
<hr>
<a name="System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029" accesskey="n" rel="next">System.Pool_Global (s-pooglo.ads)</a>, Previous: <a href="#System_002eMemory-_0028s_002dmemory_002eads_0029" accesskey="p" rel="prev">System.Memory (s-memory.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029-1"></a>
<h3 class="section">10.134 <code>System.Partition_Interface</code> (<samp>s-parint.ads</samp>)</h3>
<a name="index-System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029"></a>
<a name="index-Partition-interfacing-functions"></a>
<p>This package provides facilities for partition interfacing. It
is used primarily in a distribution context when using Annex E
with <code>GLADE</code>.
</p>
<hr>
<a name="System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029" accesskey="n" rel="next">System.Pool_Local (s-pooloc.ads)</a>, Previous: <a href="#System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029" accesskey="p" rel="prev">System.Partition_Interface (s-parint.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029-1"></a>
<h3 class="section">10.135 <code>System.Pool_Global</code> (<samp>s-pooglo.ads</samp>)</h3>
<a name="index-System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029"></a>
<a name="index-Storage-pool_002c-global"></a>
<a name="index-Global-storage-pool"></a>
<p>This package provides a storage pool that is equivalent to the default
storage pool used for access types for which no pool is specifically
declared. It uses malloc/free to allocate/free and does not attempt to
do any automatic reclamation.
</p>
<hr>
<a name="System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eRestrictions-_0028s_002drestri_002eads_0029" accesskey="n" rel="next">System.Restrictions (s-restri.ads)</a>, Previous: <a href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029" accesskey="p" rel="prev">System.Pool_Global (s-pooglo.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029-1"></a>
<h3 class="section">10.136 <code>System.Pool_Local</code> (<samp>s-pooloc.ads</samp>)</h3>
<a name="index-System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029"></a>
<a name="index-Storage-pool_002c-local"></a>
<a name="index-Local-storage-pool"></a>
<p>This package provides a storage pool that is intended for use with locally
defined access types. It uses malloc/free for allocate/free, and maintains
a list of allocated blocks, so that all storage allocated for the pool can
be freed automatically when the pool is finalized.
</p>
<hr>
<a name="System_002eRestrictions-_0028s_002drestri_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eRident-_0028s_002drident_002eads_0029" accesskey="n" rel="next">System.Rident (s-rident.ads)</a>, Previous: <a href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029" accesskey="p" rel="prev">System.Pool_Local (s-pooloc.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eRestrictions-_0028s_002drestri_002eads_0029-1"></a>
<h3 class="section">10.137 <code>System.Restrictions</code> (<samp>s-restri.ads</samp>)</h3>
<a name="index-System_002eRestrictions-_0028s_002drestri_002eads_0029"></a>
<a name="index-Run_002dtime-restrictions-access"></a>
<p>This package provides facilities for accessing at run time
the status of restrictions specified at compile time for
the partition. Information is available both with regard
to actual restrictions specified, and with regard to
compiler determined information on which restrictions
are violated by one or more packages in the partition.
</p>
<hr>
<a name="System_002eRident-_0028s_002drident_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029" accesskey="n" rel="next">System.Strings.Stream_Ops (s-ststop.ads)</a>, Previous: <a href="#System_002eRestrictions-_0028s_002drestri_002eads_0029" accesskey="p" rel="prev">System.Restrictions (s-restri.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eRident-_0028s_002drident_002eads_0029-1"></a>
<h3 class="section">10.138 <code>System.Rident</code> (<samp>s-rident.ads</samp>)</h3>
<a name="index-System_002eRident-_0028s_002drident_002eads_0029"></a>
<a name="index-Restrictions-definitions"></a>
<p>This package provides definitions of the restrictions
identifiers supported by GNAT, and also the format of
the restrictions provided in package System.Restrictions.
It is not normally necessary to <code>with</code> this generic package
since the necessary instantiation is included in
package System.Restrictions.
</p>
<hr>
<a name="System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029" accesskey="n" rel="next">System.Task_Info (s-tasinf.ads)</a>, Previous: <a href="#System_002eRident-_0028s_002drident_002eads_0029" accesskey="p" rel="prev">System.Rident (s-rident.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029-1"></a>
<h3 class="section">10.139 <code>System.Strings.Stream_Ops</code> (<samp>s-ststop.ads</samp>)</h3>
<a name="index-System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029"></a>
<a name="index-Stream-operations"></a>
<a name="index-String-stream-operations"></a>
<p>This package provides a set of stream subprograms for standard string types.
It is intended primarily to support implicit use of such subprograms when
stream attributes are applied to string types, but the subprograms in this
package can be used directly by application programs.
</p>
<hr>
<a name="System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029" accesskey="n" rel="next">System.Wch_Cnv (s-wchcnv.ads)</a>, Previous: <a href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029" accesskey="p" rel="prev">System.Strings.Stream_Ops (s-ststop.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029-1"></a>
<h3 class="section">10.140 <code>System.Task_Info</code> (<samp>s-tasinf.ads</samp>)</h3>
<a name="index-System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029"></a>
<a name="index-Task_005fInfo-pragma"></a>
<p>This package provides target dependent functionality that is used
to support the <code>Task_Info</code> pragma
</p>
<hr>
<a name="System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029" accesskey="n" rel="next">System.Wch_Con (s-wchcon.ads)</a>, Previous: <a href="#System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029" accesskey="p" rel="prev">System.Task_Info (s-tasinf.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029-1"></a>
<h3 class="section">10.141 <code>System.Wch_Cnv</code> (<samp>s-wchcnv.ads</samp>)</h3>
<a name="index-System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029"></a>
<a name="index-Wide-Character_002c-Representation"></a>
<a name="index-Wide-String_002c-Conversion"></a>
<a name="index-Representation-of-wide-characters"></a>
<p>This package provides routines for converting between
wide and wide wide characters and a representation as a value of type
<code>Standard.String</code>, using a specified wide character
encoding method. It uses definitions in
package <code>System.Wch_Con</code>.
</p>
<hr>
<a name="System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029"></a>
<div class="header">
<p>
Next: <a href="#Text_005fIO-Stream-Pointer-Positioning" accesskey="n" rel="next">Text_IO Stream Pointer Positioning</a>, Previous: <a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029" accesskey="p" rel="prev">System.Wch_Cnv (s-wchcnv.ads)</a>, Up: <a href="#The-GNAT-Library" accesskey="u" rel="up">The GNAT Library</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029-1"></a>
<h3 class="section">10.142 <code>System.Wch_Con</code> (<samp>s-wchcon.ads</samp>)</h3>
<a name="index-System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029"></a>
<p>This package provides definitions and descriptions of
the various methods used for encoding wide characters
in ordinary strings. These definitions are used by
the package <code>System.Wch_Cnv</code>.
</p>
<hr>
<a name="Interfacing-to-Other-Languages"></a>
<div class="header">
<p>
Next: <a href="#Specialized-Needs-Annexes" accesskey="n" rel="next">Specialized Needs Annexes</a>, Previous: <a href="#The-GNAT-Library" accesskey="p" rel="prev">The GNAT Library</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfacing-to-Other-Languages-1"></a>
<h2 class="chapter">11 Interfacing to Other Languages</h2>
<p>The facilities in annex B of the Ada Reference Manual are fully
implemented in GNAT, and in addition, a full interface to C++ is
provided.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Interfacing-to-C" accesskey="1">Interfacing to C</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-C_002b_002b" accesskey="2">Interfacing to C++</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-COBOL" accesskey="3">Interfacing to COBOL</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-Fortran" accesskey="4">Interfacing to Fortran</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Interfacing-to-non_002dGNAT-Ada-code" accesskey="5">Interfacing to non-GNAT Ada code</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Interfacing-to-C"></a>
<div class="header">
<p>
Next: <a href="#Interfacing-to-C_002b_002b" accesskey="n" rel="next">Interfacing to C++</a>, Previous: <a href="#Wide_005fWide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files" accesskey="p" rel="prev">Wide_Wide_Text_IO Reading and Writing Non-Regular Files</a>, Up: <a href="#Interfacing-to-Other-Languages" accesskey="u" rel="up">Interfacing to Other Languages</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfacing-to-C-1"></a>
<h3 class="section">11.1 Interfacing to C</h3>
<p>Interfacing to C with GNAT can use one of two approaches:
</p>
<ul>
<li> The types in the package <code>Interfaces.C</code> may be used.
</li><li> Standard Ada types may be used directly. This may be less portable to
other compilers, but will work on all GNAT compilers, which guarantee
correspondence between the C and Ada types.
</li></ul>
<p>Pragma <code>Convention C</code> may be applied to Ada types, but mostly has no
effect, since this is the default. The following table shows the
correspondence between Ada scalar types and the corresponding C types.
</p>
<dl compact="compact">
<dt><code>Integer</code></dt>
<dd><p><code>int</code>
</p></dd>
<dt><code>Short_Integer</code></dt>
<dd><p><code>short</code>
</p></dd>
<dt><code>Short_Short_Integer</code></dt>
<dd><p><code>signed char</code>
</p></dd>
<dt><code>Long_Integer</code></dt>
<dd><p><code>long</code>
</p></dd>
<dt><code>Long_Long_Integer</code></dt>
<dd><p><code>long long</code>
</p></dd>
<dt><code>Short_Float</code></dt>
<dd><p><code>float</code>
</p></dd>
<dt><code>Float</code></dt>
<dd><p><code>float</code>
</p></dd>
<dt><code>Long_Float</code></dt>
<dd><p><code>double</code>
</p></dd>
<dt><code>Long_Long_Float</code></dt>
<dd><p>This is the longest floating-point type supported by the hardware.
</p></dd>
</dl>
<p>Additionally, there are the following general correspondences between Ada
and C types:
</p><ul>
<li> Ada enumeration types map to C enumeration types directly if pragma
<code>Convention C</code> is specified, which causes them to have int
length. Without pragma <code>Convention C</code>, Ada enumeration types map to
8, 16, or 32 bits (i.e. C types <code>signed char</code>, <code>short</code>,
<code>int</code>, respectively) depending on the number of values passed.
This is the only case in which pragma <code>Convention C</code> affects the
representation of an Ada type.
</li><li> Ada access types map to C pointers, except for the case of pointers to
unconstrained types in Ada, which have no direct C equivalent.
</li><li> Ada arrays map directly to C arrays.
</li><li> Ada records map directly to C structures.
</li><li> Packed Ada records map to C structures where all members are bit fields
of the length corresponding to the <code><var>type</var>'Size</code> value in Ada.
</li></ul>
<hr>
<a name="Interfacing-to-C_002b_002b"></a>
<div class="header">
<p>
Next: <a href="#Interfacing-to-COBOL" accesskey="n" rel="next">Interfacing to COBOL</a>, Previous: <a href="#Interfacing-to-C" accesskey="p" rel="prev">Interfacing to C</a>, Up: <a href="#Interfacing-to-Other-Languages" accesskey="u" rel="up">Interfacing to Other Languages</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfacing-to-C_002b_002b-1"></a>
<h3 class="section">11.2 Interfacing to C++</h3>
<p>The interface to C++ makes use of the following pragmas, which are
primarily intended to be constructed automatically using a binding generator
tool, although it is possible to construct them by hand.
</p>
<p>Using these pragmas it is possible to achieve complete
inter-operability between Ada tagged types and C++ class definitions.
See <a href="#Implementation-Defined-Pragmas">Implementation Defined Pragmas</a>, for more details.
</p>
<dl compact="compact">
<dt><code>pragma CPP_Class ([Entity =>] <var>LOCAL_NAME</var>)</code></dt>
<dd><p>The argument denotes an entity in the current declarative region that is
declared as a tagged or untagged record type. It indicates that the type
corresponds to an externally declared C++ class type, and is to be laid
out the same way that C++ would lay out the type.
</p>
<p>Note: Pragma <code>CPP_Class</code> is currently obsolete. It is supported
for backward compatibility but its functionality is available
using pragma <code>Import</code> with <code>Convention</code> = <code>CPP</code>.
</p>
</dd>
<dt><code>pragma CPP_Constructor ([Entity =>] <var>LOCAL_NAME</var>)</code></dt>
<dd><p>This pragma identifies an imported function (imported in the usual way
with pragma <code>Import</code>) as corresponding to a C++ constructor.
</p></dd>
</dl>
<p>A few restrictions are placed on the use of the <code>Access</code> attribute
in conjunction with subprograms subject to convention <code>CPP</code>: the
attribute may be used neither on primitive operations of a tagged
record type with convention <code>CPP</code>, imported or not, nor on
subprograms imported with pragma <code>CPP_Constructor</code>.
</p>
<p>In addition, C++ exceptions are propagated and can be handled in an
<code>others</code> choice of an exception handler. The corresponding Ada
occurrence has no message, and the simple name of the exception identity
contains ‘<samp>Foreign_Exception</samp>’. Finalization and awaiting dependent
tasks works properly when such foreign exceptions are propagated.
</p>
<hr>
<a name="Interfacing-to-COBOL"></a>
<div class="header">
<p>
Next: <a href="#Interfacing-to-Fortran" accesskey="n" rel="next">Interfacing to Fortran</a>, Previous: <a href="#Interfacing-to-C_002b_002b" accesskey="p" rel="prev">Interfacing to C++</a>, Up: <a href="#Interfacing-to-Other-Languages" accesskey="u" rel="up">Interfacing to Other Languages</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfacing-to-COBOL-1"></a>
<h3 class="section">11.3 Interfacing to COBOL</h3>
<p>Interfacing to COBOL is achieved as described in section B.4 of
the Ada Reference Manual.
</p>
<hr>
<a name="Interfacing-to-Fortran"></a>
<div class="header">
<p>
Next: <a href="#Interfacing-to-non_002dGNAT-Ada-code" accesskey="n" rel="next">Interfacing to non-GNAT Ada code</a>, Previous: <a href="#Interfacing-to-COBOL" accesskey="p" rel="prev">Interfacing to COBOL</a>, Up: <a href="#Interfacing-to-Other-Languages" accesskey="u" rel="up">Interfacing to Other Languages</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfacing-to-Fortran-1"></a>
<h3 class="section">11.4 Interfacing to Fortran</h3>
<p>Interfacing to Fortran is achieved as described in section B.5 of the
Ada Reference Manual. The pragma <code>Convention Fortran</code>, applied to a
multi-dimensional array causes the array to be stored in column-major
order as required for convenient interface to Fortran.
</p>
<hr>
<a name="Interfacing-to-non_002dGNAT-Ada-code"></a>
<div class="header">
<p>
Next: <a href="#Machine-Code-Insertions" accesskey="n" rel="next">Machine Code Insertions</a>, Previous: <a href="#Interfacing-to-Fortran" accesskey="p" rel="prev">Interfacing to Fortran</a>, Up: <a href="#Interfacing-to-Other-Languages" accesskey="u" rel="up">Interfacing to Other Languages</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Interfacing-to-non_002dGNAT-Ada-code-1"></a>
<h3 class="section">11.5 Interfacing to non-GNAT Ada code</h3>
<p>It is possible to specify the convention <code>Ada</code> in a pragma
<code>Import</code> or pragma <code>Export</code>. However this refers to
the calling conventions used by GNAT, which may or may not be
similar enough to those used by some other Ada 83 / Ada 95 / Ada 2005
compiler to allow interoperation.
</p>
<p>If arguments types are kept simple, and if the foreign compiler generally
follows system calling conventions, then it may be possible to integrate
files compiled by other Ada compilers, provided that the elaboration
issues are adequately addressed (for example by eliminating the
need for any load time elaboration).
</p>
<p>In particular, GNAT running on VMS is designed to
be highly compatible with the DEC Ada 83 compiler, so this is one
case in which it is possible to import foreign units of this type,
provided that the data items passed are restricted to simple scalar
values or simple record types without variants, or simple array
types with fixed bounds.
</p>
<hr>
<a name="Specialized-Needs-Annexes"></a>
<div class="header">
<p>
Next: <a href="#Implementation-of-Specific-Ada-Features" accesskey="n" rel="next">Implementation of Specific Ada Features</a>, Previous: <a href="#Interfacing-to-Other-Languages" accesskey="p" rel="prev">Interfacing to Other Languages</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Specialized-Needs-Annexes-1"></a>
<h2 class="chapter">12 Specialized Needs Annexes</h2>
<p>Ada 95 and Ada 2005 define a number of Specialized Needs Annexes, which are not
required in all implementations. However, as described in this chapter,
GNAT implements all of these annexes:
</p>
<dl compact="compact">
<dt>Systems Programming (Annex C)</dt>
<dd><p>The Systems Programming Annex is fully implemented.
</p>
</dd>
<dt>Real-Time Systems (Annex D)</dt>
<dd><p>The Real-Time Systems Annex is fully implemented.
</p>
</dd>
<dt>Distributed Systems (Annex E)</dt>
<dd><p>Stub generation is fully implemented in the GNAT compiler. In addition,
a complete compatible PCS is available as part of the GLADE system,
a separate product. When the two
products are used in conjunction, this annex is fully implemented.
</p>
</dd>
<dt>Information Systems (Annex F)</dt>
<dd><p>The Information Systems annex is fully implemented.
</p>
</dd>
<dt>Numerics (Annex G)</dt>
<dd><p>The Numerics Annex is fully implemented.
</p>
</dd>
<dt>Safety and Security / High-Integrity Systems (Annex H)</dt>
<dd><p>The Safety and Security Annex (termed the High-Integrity Systems Annex
in Ada 2005) is fully implemented.
</p></dd>
</dl>
<hr>
<a name="Implementation-of-Specific-Ada-Features"></a>
<div class="header">
<p>
Next: <a href="#Implementation-of-Ada-2012-Features" accesskey="n" rel="next">Implementation of Ada 2012 Features</a>, Previous: <a href="#Specialized-Needs-Annexes" accesskey="p" rel="prev">Specialized Needs Annexes</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Implementation-of-Specific-Ada-Features-1"></a>
<h2 class="chapter">13 Implementation of Specific Ada Features</h2>
<p>This chapter describes the GNAT implementation of several Ada language
facilities.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Machine-Code-Insertions" accesskey="1">Machine Code Insertions</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT-Implementation-of-Tasking" accesskey="2">GNAT Implementation of Tasking</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#GNAT-Implementation-of-Shared-Passive-Packages" accesskey="3">GNAT Implementation of Shared Passive Packages</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Code-Generation-for-Array-Aggregates" accesskey="4">Code Generation for Array Aggregates</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#The-Size-of-Discriminated-Records-with-Default-Discriminants" accesskey="5">The Size of Discriminated Records with Default Discriminants</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Strict-Conformance-to-the-Ada-Reference-Manual" accesskey="6">Strict Conformance to the Ada Reference Manual</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Machine-Code-Insertions"></a>
<div class="header">
<p>
Next: <a href="#GNAT-Implementation-of-Tasking" accesskey="n" rel="next">GNAT Implementation of Tasking</a>, Previous: <a href="#Interfacing-to-non_002dGNAT-Ada-code" accesskey="p" rel="prev">Interfacing to non-GNAT Ada code</a>, Up: <a href="#Implementation-of-Specific-Ada-Features" accesskey="u" rel="up">Implementation of Specific Ada Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Machine-Code-Insertions-1"></a>
<h3 class="section">13.1 Machine Code Insertions</h3>
<a name="index-Machine-Code-insertions"></a>
<p>Package <code>Machine_Code</code> provides machine code support as described
in the Ada Reference Manual in two separate forms:
</p><ul>
<li> Machine code statements, consisting of qualified expressions that
fit the requirements of RM section 13.8.
</li><li> An intrinsic callable procedure, providing an alternative mechanism of
including machine instructions in a subprogram.
</li></ul>
<p>The two features are similar, and both are closely related to the mechanism
provided by the asm instruction in the GNU C compiler. Full understanding
and use of the facilities in this package requires understanding the asm
instruction, see <a href="http://gcc.gnu.org/onlinedocs/gcc/Extended-Asm.html#Extended-Asm">Assembler Instructions with C Expression
Operands</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>.
</p>
<p>Calls to the function <code>Asm</code> and the procedure <code>Asm</code> have identical
semantic restrictions and effects as described below. Both are provided so
that the procedure call can be used as a statement, and the function call
can be used to form a code_statement.
</p>
<p>The first example given in the GCC documentation is the C <code>asm</code>
instruction:
</p><div class="smallexample">
<pre class="smallexample"> asm ("fsinx %1 %0" : "=f" (result) : "f" (angle));
</pre></div>
<p>The equivalent can be written for GNAT as:
</p>
<div class="smallexample">
<pre class="smallexample">Asm ("fsinx %1 %0",
My_Float'Asm_Output ("=f", result),
My_Float'Asm_Input ("f", angle));
</pre></div>
<p>The first argument to <code>Asm</code> is the assembler template, and is
identical to what is used in GNU C. This string must be a static
expression. The second argument is the output operand list. It is
either a single <code>Asm_Output</code> attribute reference, or a list of such
references enclosed in parentheses (technically an array aggregate of
such references).
</p>
<p>The <code>Asm_Output</code> attribute denotes a function that takes two
parameters. The first is a string, the second is the name of a variable
of the type designated by the attribute prefix. The first (string)
argument is required to be a static expression and designates the
constraint for the parameter (e.g. what kind of register is
required). The second argument is the variable to be updated with the
result. The possible values for constraint are the same as those used in
the RTL, and are dependent on the configuration file used to build the
GCC back end. If there are no output operands, then this argument may
either be omitted, or explicitly given as <code>No_Output_Operands</code>.
</p>
<p>The second argument of <code><var>my_float</var>'Asm_Output</code> functions as
though it were an <code>out</code> parameter, which is a little curious, but
all names have the form of expressions, so there is no syntactic
irregularity, even though normally functions would not be permitted
<code>out</code> parameters. The third argument is the list of input
operands. It is either a single <code>Asm_Input</code> attribute reference, or
a list of such references enclosed in parentheses (technically an array
aggregate of such references).
</p>
<p>The <code>Asm_Input</code> attribute denotes a function that takes two
parameters. The first is a string, the second is an expression of the
type designated by the prefix. The first (string) argument is required
to be a static expression, and is the constraint for the parameter,
(e.g. what kind of register is required). The second argument is the
value to be used as the input argument. The possible values for the
constant are the same as those used in the RTL, and are dependent on
the configuration file used to built the GCC back end.
</p>
<p>If there are no input operands, this argument may either be omitted, or
explicitly given as <code>No_Input_Operands</code>. The fourth argument, not
present in the above example, is a list of register names, called the
<em>clobber</em> argument. This argument, if given, must be a static string
expression, and is a space or comma separated list of names of registers
that must be considered destroyed as a result of the <code>Asm</code> call. If
this argument is the null string (the default value), then the code
generator assumes that no additional registers are destroyed.
</p>
<p>The fifth argument, not present in the above example, called the
<em>volatile</em> argument, is by default <code>False</code>. It can be set to
the literal value <code>True</code> to indicate to the code generator that all
optimizations with respect to the instruction specified should be
suppressed, and that in particular, for an instruction that has outputs,
the instruction will still be generated, even if none of the outputs are
used. See <a href="http://gcc.gnu.org/onlinedocs/gcc/Extended-Asm.html#Extended-Asm">Assembler Instructions with C Expression Operands</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>, for the full description.
Generally it is strongly advisable to use Volatile for any ASM statement
that is missing either input or output operands, or when two or more ASM
statements appear in sequence, to avoid unwanted optimizations. A warning
is generated if this advice is not followed.
</p>
<p>The <code>Asm</code> subprograms may be used in two ways. First the procedure
forms can be used anywhere a procedure call would be valid, and
correspond to what the RM calls “intrinsic” routines. Such calls can
be used to intersperse machine instructions with other Ada statements.
Second, the function forms, which return a dummy value of the limited
private type <code>Asm_Insn</code>, can be used in code statements, and indeed
this is the only context where such calls are allowed. Code statements
appear as aggregates of the form:
</p>
<div class="smallexample">
<pre class="smallexample">Asm_Insn'(Asm (…));
Asm_Insn'(Asm_Volatile (…));
</pre></div>
<p>In accordance with RM rules, such code statements are allowed only
within subprograms whose entire body consists of such statements. It is
not permissible to intermix such statements with other Ada statements.
</p>
<p>Typically the form using intrinsic procedure calls is more convenient
and more flexible. The code statement form is provided to meet the RM
suggestion that such a facility should be made available. The following
is the exact syntax of the call to <code>Asm</code>. As usual, if named notation
is used, the arguments may be given in arbitrary order, following the
normal rules for use of positional and named arguments)
</p>
<div class="smallexample">
<pre class="smallexample">ASM_CALL ::= Asm (
[Template =>] static_string_EXPRESSION
[,[Outputs =>] OUTPUT_OPERAND_LIST ]
[,[Inputs =>] INPUT_OPERAND_LIST ]
[,[Clobber =>] static_string_EXPRESSION ]
[,[Volatile =>] static_boolean_EXPRESSION] )
OUTPUT_OPERAND_LIST ::=
[PREFIX.]No_Output_Operands
| OUTPUT_OPERAND_ATTRIBUTE
| (OUTPUT_OPERAND_ATTRIBUTE {,OUTPUT_OPERAND_ATTRIBUTE})
OUTPUT_OPERAND_ATTRIBUTE ::=
SUBTYPE_MARK'Asm_Output (static_string_EXPRESSION, NAME)
INPUT_OPERAND_LIST ::=
[PREFIX.]No_Input_Operands
| INPUT_OPERAND_ATTRIBUTE
| (INPUT_OPERAND_ATTRIBUTE {,INPUT_OPERAND_ATTRIBUTE})
INPUT_OPERAND_ATTRIBUTE ::=
SUBTYPE_MARK'Asm_Input (static_string_EXPRESSION, EXPRESSION)
</pre></div>
<p>The identifiers <code>No_Input_Operands</code> and <code>No_Output_Operands</code>
are declared in the package <code>Machine_Code</code> and must be referenced
according to normal visibility rules. In particular if there is no
<code>use</code> clause for this package, then appropriate package name
qualification is required.
</p>
<hr>
<a name="GNAT-Implementation-of-Tasking"></a>
<div class="header">
<p>
Next: <a href="#GNAT-Implementation-of-Shared-Passive-Packages" accesskey="n" rel="next">GNAT Implementation of Shared Passive Packages</a>, Previous: <a href="#Machine-Code-Insertions" accesskey="p" rel="prev">Machine Code Insertions</a>, Up: <a href="#Implementation-of-Specific-Ada-Features" accesskey="u" rel="up">Implementation of Specific Ada Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT-Implementation-of-Tasking-1"></a>
<h3 class="section">13.2 GNAT Implementation of Tasking</h3>
<p>This chapter outlines the basic GNAT approach to tasking (in particular,
a multi-layered library for portability) and discusses issues related
to compliance with the Real-Time Systems Annex.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Mapping-Ada-Tasks-onto-the-Underlying-Kernel-Threads" accesskey="1">Mapping Ada Tasks onto the Underlying Kernel Threads</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Ensuring-Compliance-with-the-Real_002dTime-Annex" accesskey="2">Ensuring Compliance with the Real-Time Annex</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="Mapping-Ada-Tasks-onto-the-Underlying-Kernel-Threads"></a>
<div class="header">
<p>
Next: <a href="#Ensuring-Compliance-with-the-Real_002dTime-Annex" accesskey="n" rel="next">Ensuring Compliance with the Real-Time Annex</a>, Up: <a href="#GNAT-Implementation-of-Tasking" accesskey="u" rel="up">GNAT Implementation of Tasking</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Mapping-Ada-Tasks-onto-the-Underlying-Kernel-Threads-1"></a>
<h4 class="subsection">13.2.1 Mapping Ada Tasks onto the Underlying Kernel Threads</h4>
<p>GNAT’s run-time support comprises two layers:
</p>
<ul>
<li> GNARL (GNAT Run-time Layer)
</li><li> GNULL (GNAT Low-level Library)
</li></ul>
<p>In GNAT, Ada’s tasking services rely on a platform and OS independent
layer known as GNARL. This code is responsible for implementing the
correct semantics of Ada’s task creation, rendezvous, protected
operations etc.
</p>
<p>GNARL decomposes Ada’s tasking semantics into simpler lower level
operations such as create a thread, set the priority of a thread,
yield, create a lock, lock/unlock, etc. The spec for these low-level
operations constitutes GNULLI, the GNULL Interface. This interface is
directly inspired from the POSIX real-time API.
</p>
<p>If the underlying executive or OS implements the POSIX standard
faithfully, the GNULL Interface maps as is to the services offered by
the underlying kernel. Otherwise, some target dependent glue code maps
the services offered by the underlying kernel to the semantics expected
by GNARL.
</p>
<p>Whatever the underlying OS (VxWorks, UNIX, Windows, etc.) the
key point is that each Ada task is mapped on a thread in the underlying
kernel. For example, in the case of VxWorks, one Ada task = one VxWorks task.
</p>
<p>In addition Ada task priorities map onto the underlying thread priorities.
Mapping Ada tasks onto the underlying kernel threads has several advantages:
</p>
<ul>
<li> The underlying scheduler is used to schedule the Ada tasks. This
makes Ada tasks as efficient as kernel threads from a scheduling
standpoint.
</li><li> Interaction with code written in C containing threads is eased
since at the lowest level Ada tasks and C threads map onto the same
underlying kernel concept.
</li><li> When an Ada task is blocked during I/O the remaining Ada tasks are
able to proceed.
</li><li> On multiprocessor systems Ada tasks can execute in parallel.
</li></ul>
<p>Some threads libraries offer a mechanism to fork a new process, with the
child process duplicating the threads from the parent.
GNAT does not
support this functionality when the parent contains more than one task.
<a name="index-Forking-a-new-process"></a>
</p>
<hr>
<a name="Ensuring-Compliance-with-the-Real_002dTime-Annex"></a>
<div class="header">
<p>
Previous: <a href="#Mapping-Ada-Tasks-onto-the-Underlying-Kernel-Threads" accesskey="p" rel="prev">Mapping Ada Tasks onto the Underlying Kernel Threads</a>, Up: <a href="#GNAT-Implementation-of-Tasking" accesskey="u" rel="up">GNAT Implementation of Tasking</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Ensuring-Compliance-with-the-Real_002dTime-Annex-1"></a>
<h4 class="subsection">13.2.2 Ensuring Compliance with the Real-Time Annex</h4>
<a name="index-Real_002dTime-Systems-Annex-compliance"></a>
<p>Although mapping Ada tasks onto
the underlying threads has significant advantages, it does create some
complications when it comes to respecting the scheduling semantics
specified in the real-time annex (Annex D).
</p>
<p>For instance the Annex D requirement for the <code>FIFO_Within_Priorities</code>
scheduling policy states:
</p>
<blockquote>
<p><em>When the active priority of a ready task that is not running
changes, or the setting of its base priority takes effect, the
task is removed from the ready queue for its old active priority
and is added at the tail of the ready queue for its new active
priority, except in the case where the active priority is lowered
due to the loss of inherited priority, in which case the task is
added at the head of the ready queue for its new active priority.</em>
</p></blockquote>
<p>While most kernels do put tasks at the end of the priority queue when
a task changes its priority, (which respects the main
FIFO_Within_Priorities requirement), almost none keep a thread at the
beginning of its priority queue when its priority drops from the loss
of inherited priority.
</p>
<p>As a result most vendors have provided incomplete Annex D implementations.
</p>
<p>The GNAT run-time, has a nice cooperative solution to this problem
which ensures that accurate FIFO_Within_Priorities semantics are
respected.
</p>
<p>The principle is as follows. When an Ada task T is about to start
running, it checks whether some other Ada task R with the same
priority as T has been suspended due to the loss of priority
inheritance. If this is the case, T yields and is placed at the end of
its priority queue. When R arrives at the front of the queue it
executes.
</p>
<p>Note that this simple scheme preserves the relative order of the tasks
that were ready to execute in the priority queue where R has been
placed at the end.
</p>
<hr>
<a name="GNAT-Implementation-of-Shared-Passive-Packages"></a>
<div class="header">
<p>
Next: <a href="#Code-Generation-for-Array-Aggregates" accesskey="n" rel="next">Code Generation for Array Aggregates</a>, Previous: <a href="#GNAT-Implementation-of-Tasking" accesskey="p" rel="prev">GNAT Implementation of Tasking</a>, Up: <a href="#Implementation-of-Specific-Ada-Features" accesskey="u" rel="up">Implementation of Specific Ada Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNAT-Implementation-of-Shared-Passive-Packages-1"></a>
<h3 class="section">13.3 GNAT Implementation of Shared Passive Packages</h3>
<a name="index-Shared-passive-packages"></a>
<p>GNAT fully implements the pragma <code>Shared_Passive</code> for
<a name="index-pragma-Shared_005fPassive"></a>
the purpose of designating shared passive packages.
This allows the use of passive partitions in the
context described in the Ada Reference Manual; i.e., for communication
between separate partitions of a distributed application using the
features in Annex E.
<a name="index-Annex-E"></a>
<a name="index-Distribution-Systems-Annex"></a>
</p>
<p>However, the implementation approach used by GNAT provides for more
extensive usage as follows:
</p>
<dl compact="compact">
<dt><em>Communication between separate programs</em></dt>
<dd>
<p>This allows separate programs to access the data in passive
partitions, using protected objects for synchronization where
needed. The only requirement is that the two programs have a
common shared file system. It is even possible for programs
running on different machines with different architectures
(e.g. different endianness) to communicate via the data in
a passive partition.
</p>
</dd>
<dt><em>Persistence between program runs</em></dt>
<dd>
<p>The data in a passive package can persist from one run of a
program to another, so that a later program sees the final
values stored by a previous run of the same program.
</p>
</dd>
</dl>
<p>The implementation approach used is to store the data in files. A
separate stream file is created for each object in the package, and
an access to an object causes the corresponding file to be read or
written.
</p>
<p>The environment variable <code>SHARED_MEMORY_DIRECTORY</code> should be
<a name="index-SHARED_005fMEMORY_005fDIRECTORY-environment-variable"></a>
set to the directory to be used for these files.
The files in this directory
have names that correspond to their fully qualified names. For
example, if we have the package
</p>
<div class="smallexample">
<pre class="smallexample">package X is
pragma Shared_Passive (X);
Y : Integer;
Z : Float;
end X;
</pre></div>
<p>and the environment variable is set to <code>/stemp/</code>, then the files created
will have the names:
</p>
<div class="smallexample">
<pre class="smallexample">/stemp/x.y
/stemp/x.z
</pre></div>
<p>These files are created when a value is initially written to the object, and
the files are retained until manually deleted. This provides the persistence
semantics. If no file exists, it means that no partition has assigned a value
to the variable; in this case the initial value declared in the package
will be used. This model ensures that there are no issues in synchronizing
the elaboration process, since elaboration of passive packages elaborates the
initial values, but does not create the files.
</p>
<p>The files are written using normal <code>Stream_IO</code> access.
If you want to be able
to communicate between programs or partitions running on different
architectures, then you should use the XDR versions of the stream attribute
routines, since these are architecture independent.
</p>
<p>If active synchronization is required for access to the variables in the
shared passive package, then as described in the Ada Reference Manual, the
package may contain protected objects used for this purpose. In this case
a lock file (whose name is <samp>___lock</samp> (three underscores)
is created in the shared memory directory.
<a name="index-_005f_005f_005flock-file-_0028for-shared-passive-packages_0029"></a>
This is used to provide the required locking
semantics for proper protected object synchronization.
</p>
<p>As of January 2003, GNAT supports shared passive packages on all platforms
except for OpenVMS.
</p>
<hr>
<a name="Code-Generation-for-Array-Aggregates"></a>
<div class="header">
<p>
Next: <a href="#The-Size-of-Discriminated-Records-with-Default-Discriminants" accesskey="n" rel="next">The Size of Discriminated Records with Default Discriminants</a>, Previous: <a href="#GNAT-Implementation-of-Shared-Passive-Packages" accesskey="p" rel="prev">GNAT Implementation of Shared Passive Packages</a>, Up: <a href="#Implementation-of-Specific-Ada-Features" accesskey="u" rel="up">Implementation of Specific Ada Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Code-Generation-for-Array-Aggregates-1"></a>
<h3 class="section">13.4 Code Generation for Array Aggregates</h3>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#Static-constant-aggregates-with-static-bounds" accesskey="1">Static constant aggregates with static bounds</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Constant-aggregates-with-unconstrained-nominal-types" accesskey="2">Constant aggregates with unconstrained nominal types</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Aggregates-with-static-bounds" accesskey="3">Aggregates with static bounds</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Aggregates-with-non_002dstatic-bounds" accesskey="4">Aggregates with non-static bounds</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#Aggregates-in-assignment-statements" accesskey="5">Aggregates in assignment statements</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<p>Aggregates have a rich syntax and allow the user to specify the values of
complex data structures by means of a single construct. As a result, the
code generated for aggregates can be quite complex and involve loops, case
statements and multiple assignments. In the simplest cases, however, the
compiler will recognize aggregates whose components and constraints are
fully static, and in those cases the compiler will generate little or no
executable code. The following is an outline of the code that GNAT generates
for various aggregate constructs. For further details, you will find it
useful to examine the output produced by the -gnatG flag to see the expanded
source that is input to the code generator. You may also want to examine
the assembly code generated at various levels of optimization.
</p>
<p>The code generated for aggregates depends on the context, the component values,
and the type. In the context of an object declaration the code generated is
generally simpler than in the case of an assignment. As a general rule, static
component values and static subtypes also lead to simpler code.
</p>
<hr>
<a name="Static-constant-aggregates-with-static-bounds"></a>
<div class="header">
<p>
Next: <a href="#Constant-aggregates-with-unconstrained-nominal-types" accesskey="n" rel="next">Constant aggregates with unconstrained nominal types</a>, Up: <a href="#Code-Generation-for-Array-Aggregates" accesskey="u" rel="up">Code Generation for Array Aggregates</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Static-constant-aggregates-with-static-bounds-1"></a>
<h4 class="subsection">13.4.1 Static constant aggregates with static bounds</h4>
<p>For the declarations:
</p><div class="smallexample">
<pre class="smallexample"> type One_Dim is array (1..10) of integer;
ar0 : constant One_Dim := (1, 2, 3, 4, 5, 6, 7, 8, 9, 0);
</pre></div>
<p>GNAT generates no executable code: the constant ar0 is placed in static memory.
The same is true for constant aggregates with named associations:
</p>
<div class="smallexample">
<pre class="smallexample"> Cr1 : constant One_Dim := (4 => 16, 2 => 4, 3 => 9, 1 => 1, 5 .. 10 => 0);
Cr3 : constant One_Dim := (others => 7777);
</pre></div>
<p>The same is true for multidimensional constant arrays such as:
</p>
<div class="smallexample">
<pre class="smallexample"> type two_dim is array (1..3, 1..3) of integer;
Unit : constant two_dim := ( (1,0,0), (0,1,0), (0,0,1));
</pre></div>
<p>The same is true for arrays of one-dimensional arrays: the following are
static:
</p>
<div class="smallexample">
<pre class="smallexample">type ar1b is array (1..3) of boolean;
type ar_ar is array (1..3) of ar1b;
None : constant ar1b := (others => false); -- fully static
None2 : constant ar_ar := (1..3 => None); -- fully static
</pre></div>
<p>However, for multidimensional aggregates with named associations, GNAT will
generate assignments and loops, even if all associations are static. The
following two declarations generate a loop for the first dimension, and
individual component assignments for the second dimension:
</p>
<div class="smallexample">
<pre class="smallexample">Zero1: constant two_dim := (1..3 => (1..3 => 0));
Zero2: constant two_dim := (others => (others => 0));
</pre></div>
<hr>
<a name="Constant-aggregates-with-unconstrained-nominal-types"></a>
<div class="header">
<p>
Next: <a href="#Aggregates-with-static-bounds" accesskey="n" rel="next">Aggregates with static bounds</a>, Previous: <a href="#Static-constant-aggregates-with-static-bounds" accesskey="p" rel="prev">Static constant aggregates with static bounds</a>, Up: <a href="#Code-Generation-for-Array-Aggregates" accesskey="u" rel="up">Code Generation for Array Aggregates</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Constant-aggregates-with-unconstrained-nominal-types-1"></a>
<h4 class="subsection">13.4.2 Constant aggregates with unconstrained nominal types</h4>
<p>In such cases the aggregate itself establishes the subtype, so that
associations with <code>others</code> cannot be used. GNAT determines the
bounds for the actual subtype of the aggregate, and allocates the
aggregate statically as well. No code is generated for the following:
</p>
<div class="smallexample">
<pre class="smallexample"> type One_Unc is array (natural range <>) of integer;
Cr_Unc : constant One_Unc := (12,24,36);
</pre></div>
<hr>
<a name="Aggregates-with-static-bounds"></a>
<div class="header">
<p>
Next: <a href="#Aggregates-with-non_002dstatic-bounds" accesskey="n" rel="next">Aggregates with non-static bounds</a>, Previous: <a href="#Constant-aggregates-with-unconstrained-nominal-types" accesskey="p" rel="prev">Constant aggregates with unconstrained nominal types</a>, Up: <a href="#Code-Generation-for-Array-Aggregates" accesskey="u" rel="up">Code Generation for Array Aggregates</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Aggregates-with-static-bounds-1"></a>
<h4 class="subsection">13.4.3 Aggregates with static bounds</h4>
<p>In all previous examples the aggregate was the initial (and immutable) value
of a constant. If the aggregate initializes a variable, then code is generated
for it as a combination of individual assignments and loops over the target
object. The declarations
</p>
<div class="smallexample">
<pre class="smallexample"> Cr_Var1 : One_Dim := (2, 5, 7, 11, 0, 0, 0, 0, 0, 0);
Cr_Var2 : One_Dim := (others > -1);
</pre></div>
<p>generate the equivalent of
</p>
<div class="smallexample">
<pre class="smallexample"> Cr_Var1 (1) := 2;
Cr_Var1 (2) := 3;
Cr_Var1 (3) := 5;
Cr_Var1 (4) := 11;
for I in Cr_Var2'range loop
Cr_Var2 (I) := -1;
end loop;
</pre></div>
<hr>
<a name="Aggregates-with-non_002dstatic-bounds"></a>
<div class="header">
<p>
Next: <a href="#Aggregates-in-assignment-statements" accesskey="n" rel="next">Aggregates in assignment statements</a>, Previous: <a href="#Aggregates-with-static-bounds" accesskey="p" rel="prev">Aggregates with static bounds</a>, Up: <a href="#Code-Generation-for-Array-Aggregates" accesskey="u" rel="up">Code Generation for Array Aggregates</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Aggregates-with-non_002dstatic-bounds-1"></a>
<h4 class="subsection">13.4.4 Aggregates with non-static bounds</h4>
<p>If the bounds of the aggregate are not statically compatible with the bounds
of the nominal subtype of the target, then constraint checks have to be
generated on the bounds. For a multidimensional array, constraint checks may
have to be applied to sub-arrays individually, if they do not have statically
compatible subtypes.
</p>
<hr>
<a name="Aggregates-in-assignment-statements"></a>
<div class="header">
<p>
Previous: <a href="#Aggregates-with-non_002dstatic-bounds" accesskey="p" rel="prev">Aggregates with non-static bounds</a>, Up: <a href="#Code-Generation-for-Array-Aggregates" accesskey="u" rel="up">Code Generation for Array Aggregates</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Aggregates-in-assignment-statements-1"></a>
<h4 class="subsection">13.4.5 Aggregates in assignment statements</h4>
<p>In general, aggregate assignment requires the construction of a temporary,
and a copy from the temporary to the target of the assignment. This is because
it is not always possible to convert the assignment into a series of individual
component assignments. For example, consider the simple case:
</p>
<div class="smallexample">
<pre class="smallexample"> A := (A(2), A(1));
</pre></div>
<p>This cannot be converted into:
</p>
<div class="smallexample">
<pre class="smallexample"> A(1) := A(2);
A(2) := A(1);
</pre></div>
<p>So the aggregate has to be built first in a separate location, and then
copied into the target. GNAT recognizes simple cases where this intermediate
step is not required, and the assignments can be performed in place, directly
into the target. The following sufficient criteria are applied:
</p>
<ul>
<li> The bounds of the aggregate are static, and the associations are static.
</li><li> The components of the aggregate are static constants, names of
simple variables that are not renamings, or expressions not involving
indexed components whose operands obey these rules.
</li></ul>
<p>If any of these conditions are violated, the aggregate will be built in
a temporary (created either by the front-end or the code generator) and then
that temporary will be copied onto the target.
</p>
<hr>
<a name="The-Size-of-Discriminated-Records-with-Default-Discriminants"></a>
<div class="header">
<p>
Next: <a href="#Strict-Conformance-to-the-Ada-Reference-Manual" accesskey="n" rel="next">Strict Conformance to the Ada Reference Manual</a>, Previous: <a href="#Code-Generation-for-Array-Aggregates" accesskey="p" rel="prev">Code Generation for Array Aggregates</a>, Up: <a href="#Implementation-of-Specific-Ada-Features" accesskey="u" rel="up">Implementation of Specific Ada Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="The-Size-of-Discriminated-Records-with-Default-Discriminants-1"></a>
<h3 class="section">13.5 The Size of Discriminated Records with Default Discriminants</h3>
<p>If a discriminated type <code>T</code> has discriminants with default values, it is
possible to declare an object of this type without providing an explicit
constraint:
</p>
<div class="smallexample">
<pre class="smallexample">type Size is range 1..100;
type Rec (D : Size := 15) is record
Name : String (1..D);
end T;
Word : Rec;
</pre></div>
<p>Such an object is said to be <em>unconstrained</em>.
The discriminant of the object
can be modified by a full assignment to the object, as long as it preserves the
relation between the value of the discriminant, and the value of the components
that depend on it:
</p>
<div class="smallexample">
<pre class="smallexample">Word := (3, "yes");
Word := (5, "maybe");
Word := (5, "no"); -- raises Constraint_Error
</pre></div>
<p>In order to support this behavior efficiently, an unconstrained object is
given the maximum size that any value of the type requires. In the case
above, <code>Word</code> has storage for the discriminant and for
a <code>String</code> of length 100.
It is important to note that unconstrained objects do not require dynamic
allocation. It would be an improper implementation to place on the heap those
components whose size depends on discriminants. (This improper implementation
was used by some Ada83 compilers, where the <code>Name</code> component above
would have
been stored as a pointer to a dynamic string). Following the principle that
dynamic storage management should never be introduced implicitly,
an Ada compiler should reserve the full size for an unconstrained declared
object, and place it on the stack.
</p>
<p>This maximum size approach
has been a source of surprise to some users, who expect the default
values of the discriminants to determine the size reserved for an
unconstrained object: “If the default is 15, why should the object occupy
a larger size?”
The answer, of course, is that the discriminant may be later modified,
and its full range of values must be taken into account. This is why the
declaration:
</p>
<div class="smallexample">
<pre class="smallexample">type Rec (D : Positive := 15) is record
Name : String (1..D);
end record;
Too_Large : Rec;
</pre></div>
<p>is flagged by the compiler with a warning:
an attempt to create <code>Too_Large</code> will raise <code>Storage_Error</code>,
because the required size includes <code>Positive'Last</code>
bytes. As the first example indicates, the proper approach is to declare an
index type of “reasonable” range so that unconstrained objects are not too
large.
</p>
<p>One final wrinkle: if the object is declared to be <code>aliased</code>, or if it is
created in the heap by means of an allocator, then it is <em>not</em>
unconstrained:
it is constrained by the default values of the discriminants, and those values
cannot be modified by full assignment. This is because in the presence of
aliasing all views of the object (which may be manipulated by different tasks,
say) must be consistent, so it is imperative that the object, once created,
remain invariant.
</p>
<hr>
<a name="Strict-Conformance-to-the-Ada-Reference-Manual"></a>
<div class="header">
<p>
Previous: <a href="#The-Size-of-Discriminated-Records-with-Default-Discriminants" accesskey="p" rel="prev">The Size of Discriminated Records with Default Discriminants</a>, Up: <a href="#Implementation-of-Specific-Ada-Features" accesskey="u" rel="up">Implementation of Specific Ada Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Strict-Conformance-to-the-Ada-Reference-Manual-1"></a>
<h3 class="section">13.6 Strict Conformance to the Ada Reference Manual</h3>
<p>The dynamic semantics defined by the Ada Reference Manual impose a set of
run-time checks to be generated. By default, the GNAT compiler will insert many
run-time checks into the compiled code, including most of those required by the
Ada Reference Manual. However, there are three checks that are not enabled
in the default mode for efficiency reasons: arithmetic overflow checking for
integer operations (including division by zero), checks for access before
elaboration on subprogram calls, and stack overflow checking (most operating
systems do not perform this check by default).
</p>
<p>Strict conformance to the Ada Reference Manual can be achieved by adding
three compiler options for overflow checking for integer operations
(<samp>-gnato</samp>), dynamic checks for access-before-elaboration on subprogram
calls and generic instantiations (<samp>-gnatE</samp>), and stack overflow
checking (<samp>-fstack-check</samp>).
</p>
<p>Note that the result of a floating point arithmetic operation in overflow and
invalid situations, when the <code>Machine_Overflows</code> attribute of the result
type is <code>False</code>, is to generate IEEE NaN and infinite values. This is the
case for machines compliant with the IEEE floating-point standard, but on
machines that are not fully compliant with this standard, such as Alpha, the
<samp>-mieee</samp> compiler flag must be used for achieving IEEE confirming
behavior (although at the cost of a significant performance penalty), so
infinite and NaN values are properly generated.
</p>
<hr>
<a name="Implementation-of-Ada-2012-Features"></a>
<div class="header">
<p>
Next: <a href="#Obsolescent-Features" accesskey="n" rel="next">Obsolescent Features</a>, Previous: <a href="#Implementation-of-Specific-Ada-Features" accesskey="p" rel="prev">Implementation of Specific Ada Features</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Implementation-of-Ada-2012-Features-1"></a>
<h2 class="chapter">14 Implementation of Ada 2012 Features</h2>
<a name="index-Ada-2012-implementation-status"></a>
<p>This chapter contains a complete list of Ada 2012 features that have been
implemented as of GNAT version 6.4. Generally, these features are only
available if the <samp>-gnat12</samp> (Ada 2012 features enabled) flag is set
<a name="index-_002dgnat12-option"></a>
or if the configuration pragma <code>Ada_2012</code> is used.
<a name="index-pragma-Ada_005f2012"></a>
<a name="index-configuration-pragma-Ada_005f2012"></a>
<a name="index-Ada_005f2012-configuration-pragma"></a>
However, new pragmas, attributes, and restrictions are
unconditionally available, since the Ada 95 standard allows the addition of
new pragmas, attributes, and restrictions (there are exceptions, which are
documented in the individual descriptions), and also certain packages
were made available in earlier versions of Ada.
</p>
<p>An ISO date (YYYY-MM-DD) appears in parentheses on the description line.
This date shows the implementation date of the feature. Any wavefront
subsequent to this date will contain the indicated feature, as will any
subsequent releases. A date of 0000-00-00 means that GNAT has always
implemented the feature, or implemented it as soon as it appeared as a
binding interpretation.
</p>
<p>Each feature corresponds to an Ada Issue (“AI”) approved by the Ada
standardization group (ISO/IEC JTC1/SC22/WG9) for inclusion in Ada 2012.
The features are ordered based on the relevant sections of the Ada
Reference Manual (“RM”). When a given AI relates to multiple points
in the RM, the earliest is used.
</p>
<p>A complete description of the AIs may be found in
<a href="www.ada-auth.org/ai05-summary.html">www.ada-auth.org/ai05-summary.html</a>.
</p>
<ul>
<li> <em>AI-0176 Quantified expressions (2010-09-29)</em>
<a name="index-AI_002d0176-_0028Ada-2012-feature_0029"></a>
<p>Both universally and existentially quantified expressions are implemented.
They use the new syntax for iterators proposed in AI05-139-2, as well as
the standard Ada loop syntax.
</p>
<p>RM References: 1.01.04 (12) 2.09 (2/2) 4.04 (7) 4.05.09 (0)
</p>
</li><li> <em>AI-0079 Allow <i>other_format</i> characters in source (2010-07-10)</em>
<a name="index-AI_002d0079-_0028Ada-2012-feature_0029"></a>
<p>Wide characters in the unicode category <i>other_format</i> are now allowed in
source programs between tokens, but not within a token such as an identifier.
</p>
<p>RM References: 2.01 (4/2) 2.02 (7)
</p>
</li><li> <em>AI-0091 Do not allow <i>other_format</i> in identifiers (0000-00-00)</em>
<a name="index-AI_002d0091-_0028Ada-2012-feature_0029"></a>
<p>Wide characters in the unicode category <i>other_format</i> are not permitted
within an identifier, since this can be a security problem. The error
message for this case has been improved to be more specific, but GNAT has
never allowed such characters to appear in identifiers.
</p>
<p>RM References: 2.03 (3.1/2) 2.03 (4/2) 2.03 (5/2) 2.03 (5.1/2) 2.03 (5.2/2) 2.03 (5.3/2) 2.09 (2/2)
</p>
</li><li> <em>AI-0100 Placement of pragmas (2010-07-01)</em>
<a name="index-AI_002d0100-_0028Ada-2012-feature_0029"></a>
<p>This AI is an earlier version of AI-163. It simplifies the rules
for legal placement of pragmas. In the case of lists that allow pragmas, if
the list may have no elements, then the list may consist solely of pragmas.
</p>
<p>RM References: 2.08 (7)
</p>
</li><li> <em>AI-0163 Pragmas in place of null (2010-07-01)</em>
<a name="index-AI_002d0163-_0028Ada-2012-feature_0029"></a>
<p>A statement sequence may be composed entirely of pragmas. It is no longer
necessary to add a dummy <code>null</code> statement to make the sequence legal.
</p>
<p>RM References: 2.08 (7) 2.08 (16)
</p>
</li><li> <em>AI-0080 “View of” not needed if clear from context (0000-00-00)</em>
<a name="index-AI_002d0080-_0028Ada-2012-feature_0029"></a>
<p>This is an editorial change only, described as non-testable in the AI.
</p>
<p>RM References: 3.01 (7)
</p>
</li><li> <em>AI-0183 Aspect specifications (2010-08-16)</em>
<a name="index-AI_002d0183-_0028Ada-2012-feature_0029"></a>
<p>Aspect specifications have been fully implemented except for pre and post-
conditions, and type invariants, which have their own separate AI’s. All
forms of declarations listed in the AI are supported. The following is a
list of the aspects supported (with GNAT implementation aspects marked)
</p>
<table>
<tr><td><code>Ada_2005</code></td><td>– GNAT</td></tr>
<tr><td><code>Ada_2012</code></td><td>– GNAT</td></tr>
<tr><td><code>Address</code></td><td></td></tr>
<tr><td><code>Alignment</code></td><td></td></tr>
<tr><td><code>Atomic</code></td><td></td></tr>
<tr><td><code>Atomic_Components</code></td><td></td></tr>
<tr><td><code>Bit_Order</code></td><td></td></tr>
<tr><td><code>Component_Size</code></td><td></td></tr>
<tr><td><code>Contract_Case</code></td><td>– GNAT</td></tr>
<tr><td><code>Discard_Names</code></td><td></td></tr>
<tr><td><code>External_Tag</code></td><td></td></tr>
<tr><td><code>Favor_Top_Level</code></td><td>– GNAT</td></tr>
<tr><td><code>Inline</code></td><td></td></tr>
<tr><td><code>Inline_Always</code></td><td>– GNAT</td></tr>
<tr><td><code>Invariant</code></td><td>– GNAT</td></tr>
<tr><td><code>Machine_Radix</code></td><td></td></tr>
<tr><td><code>No_Return</code></td><td></td></tr>
<tr><td><code>Object_Size</code></td><td>– GNAT</td></tr>
<tr><td><code>Pack</code></td><td></td></tr>
<tr><td><code>Persistent_BSS</code></td><td>– GNAT</td></tr>
<tr><td><code>Post</code></td><td></td></tr>
<tr><td><code>Pre</code></td><td></td></tr>
<tr><td><code>Predicate</code></td><td></td></tr>
<tr><td><code>Preelaborable_Initialization</code></td><td></td></tr>
<tr><td><code>Pure_Function</code></td><td>– GNAT</td></tr>
<tr><td><code>Remote_Access_Type</code></td><td>– GNAT</td></tr>
<tr><td><code>Shared</code></td><td>– GNAT</td></tr>
<tr><td><code>Size</code></td><td></td></tr>
<tr><td><code>Storage_Pool</code></td><td></td></tr>
<tr><td><code>Storage_Size</code></td><td></td></tr>
<tr><td><code>Stream_Size</code></td><td></td></tr>
<tr><td><code>Suppress</code></td><td></td></tr>
<tr><td><code>Suppress_Debug_Info</code></td><td>– GNAT</td></tr>
<tr><td><code>Test_Case</code></td><td>– GNAT</td></tr>
<tr><td><code>Type_Invariant</code></td><td></td></tr>
<tr><td><code>Unchecked_Union</code></td><td></td></tr>
<tr><td><code>Universal_Aliasing</code></td><td>– GNAT</td></tr>
<tr><td><code>Unmodified</code></td><td>– GNAT</td></tr>
<tr><td><code>Unreferenced</code></td><td>– GNAT</td></tr>
<tr><td><code>Unreferenced_Objects</code></td><td>– GNAT</td></tr>
<tr><td><code>Unsuppress</code></td><td></td></tr>
<tr><td><code>Value_Size</code></td><td>– GNAT</td></tr>
<tr><td><code>Volatile</code></td><td></td></tr>
<tr><td><code>Volatile_Components</code></td></tr>
<tr><td><code>Warnings</code></td><td>– GNAT</td></tr>
</table>
<p>Note that for aspects with an expression, e.g. <code>Size</code>, the expression is
treated like a default expression (visibility is analyzed at the point of
occurrence of the aspect, but evaluation of the expression occurs at the
freeze point of the entity involved.
</p>
<p>RM References: 3.02.01 (3) 3.02.02 (2) 3.03.01 (2/2) 3.08 (6)
3.09.03 (1.1/2) 6.01 (2/2) 6.07 (2/2) 9.05.02 (2/2) 7.01 (3) 7.03
(2) 7.03 (3) 9.01 (2/2) 9.01 (3/2) 9.04 (2/2) 9.04 (3/2)
9.05.02 (2/2) 11.01 (2) 12.01 (3) 12.03 (2/2) 12.04 (2/2) 12.05 (2)
12.06 (2.1/2) 12.06 (2.2/2) 12.07 (2) 13.01 (0.1/2) 13.03 (5/1)
13.03.01 (0)
</p>
</li><li> <em>AI-0128 Inequality is a primitive operation (0000-00-00)</em>
<a name="index-AI_002d0128-_0028Ada-2012-feature_0029"></a>
<p>If an equality operator ("=") is declared for a type, then the implicitly
declared inequality operator ("/=") is a primitive operation of the type.
This is the only reasonable interpretation, and is the one always implemented
by GNAT, but the RM was not entirely clear in making this point.
</p>
<p>RM References: 3.02.03 (6) 6.06 (6)
</p>
</li><li> <em>AI-0003 Qualified expressions as names (2010-07-11)</em>
<a name="index-AI_002d0003-_0028Ada-2012-feature_0029"></a>
<p>In Ada 2012, a qualified expression is considered to be syntactically a name,
meaning that constructs such as <code>A'(F(X)).B</code> are now legal. This is
useful in disambiguating some cases of overloading.
</p>
<p>RM References: 3.03 (11) 3.03 (21) 4.01 (2) 4.04 (7) 4.07 (3)
5.04 (7)
</p>
</li><li> <em>AI-0120 Constant instance of protected object (0000-00-00)</em>
<a name="index-AI_002d0120-_0028Ada-2012-feature_0029"></a>
<p>This is an RM editorial change only. The section that lists objects that are
constant failed to include the current instance of a protected object
within a protected function. This has always been treated as a constant
in GNAT.
</p>
<p>RM References: 3.03 (21)
</p>
</li><li> <em>AI-0008 General access to constrained objects (0000-00-00)</em>
<a name="index-AI_002d0008-_0028Ada-2012-feature_0029"></a>
<p>The wording in the RM implied that if you have a general access to a
constrained object, it could be used to modify the discriminants. This was
obviously not intended. <code>Constraint_Error</code> should be raised, and GNAT
has always done so in this situation.
</p>
<p>RM References: 3.03 (23) 3.10.02 (26/2) 4.01 (9) 6.04.01 (17) 8.05.01 (5/2)
</p>
</li><li> <em>AI-0093 Additional rules use immutably limited (0000-00-00)</em>
<a name="index-AI_002d0093-_0028Ada-2012-feature_0029"></a>
<p>This is an editorial change only, to make more widespread use of the Ada 2012
“immutably limited”.
</p>
<p>RM References: 3.03 (23.4/3)
</p>
</li><li> <em>AI-0096 Deriving from formal private types (2010-07-20)</em>
<a name="index-AI_002d0096-_0028Ada-2012-feature_0029"></a>
<p>In general it is illegal for a type derived from a formal limited type to be
nonlimited. This AI makes an exception to this rule: derivation is legal
if it appears in the private part of the generic, and the formal type is not
tagged. If the type is tagged, the legality check must be applied to the
private part of the package.
</p>
<p>RM References: 3.04 (5.1/2) 6.02 (7)
</p>
</li><li> <em>AI-0181 Soft hyphen is a non-graphic character (2010-07-23)</em>
<a name="index-AI_002d0181-_0028Ada-2012-feature_0029"></a>
<p>From Ada 2005 on, soft hyphen is considered a non-graphic character, which
means that it has a special name (<code>SOFT_HYPHEN</code>) in conjunction with the
<code>Image</code> and <code>Value</code> attributes for the character types. Strictly
speaking this is an inconsistency with Ada 95, but in practice the use of
these attributes is so obscure that it will not cause problems.
</p>
<p>RM References: 3.05.02 (2/2) A.01 (35/2) A.03.03 (21)
</p>
</li><li> <em>AI-0182 Additional forms for <code>Character'Value</code> (0000-00-00)</em>
<a name="index-AI_002d0182-_0028Ada-2012-feature_0029"></a>
<p>This AI allows <code>Character'Value</code> to accept the string <code>'?'</code> where
<code>?</code> is any character including non-graphic control characters. GNAT has
always accepted such strings. It also allows strings such as
<code>HEX_00000041</code> to be accepted, but GNAT does not take advantage of this
permission and raises <code>Constraint_Error</code>, as is certainly still
permitted.
</p>
<p>RM References: 3.05 (56/2)
</p>
</li><li> <em>AI-0214 Defaulted discriminants for limited tagged (2010-10-01)</em>
<a name="index-AI_002d0214-_0028Ada-2012-feature_0029"></a>
<p>Ada 2012 relaxes the restriction that forbids discriminants of tagged types
to have default expressions by allowing them when the type is limited. It
is often useful to define a default value for a discriminant even though
it can’t be changed by assignment.
</p>
<p>RM References: 3.07 (9.1/2) 3.07.02 (3)
</p>
</li><li> <em>AI-0102 Some implicit conversions are illegal (0000-00-00)</em>
<a name="index-AI_002d0102-_0028Ada-2012-feature_0029"></a>
<p>It is illegal to assign an anonymous access constant to an anonymous access
variable. The RM did not have a clear rule to prevent this, but GNAT has
always generated an error for this usage.
</p>
<p>RM References: 3.07 (16) 3.07.01 (9) 6.04.01 (6) 8.06 (27/2)
</p>
</li><li> <em>AI-0158 Generalizing membership tests (2010-09-16)</em>
<a name="index-AI_002d0158-_0028Ada-2012-feature_0029"></a>
<p>This AI extends the syntax of membership tests to simplify complex conditions
that can be expressed as membership in a subset of values of any type. It
introduces syntax for a list of expressions that may be used in loop contexts
as well.
</p>
<p>RM References: 3.08.01 (5) 4.04 (3) 4.05.02 (3) 4.05.02 (5) 4.05.02 (27)
</p>
</li><li> <em>AI-0173 Testing if tags represent abstract types (2010-07-03)</em>
<a name="index-AI_002d0173-_0028Ada-2012-feature_0029"></a>
<p>The function <code>Ada.Tags.Type_Is_Abstract</code> returns <code>True</code> if invoked
with the tag of an abstract type, and <code>False</code> otherwise.
</p>
<p>RM References: 3.09 (7.4/2) 3.09 (12.4/2)
</p>
</li><li> <em>AI-0076 function with controlling result (0000-00-00)</em>
<a name="index-AI_002d0076-_0028Ada-2012-feature_0029"></a>
<p>This is an editorial change only. The RM defines calls with controlling
results, but uses the term “function with controlling result” without an
explicit definition.
</p>
<p>RM References: 3.09.02 (2/2)
</p>
</li><li> <em>AI-0126 Dispatching with no declared operation (0000-00-00)</em>
<a name="index-AI_002d0126-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies dispatching rules, and simply confirms that dispatching
executes the operation of the parent type when there is no explicitly or
implicitly declared operation for the descendant type. This has always been
the case in all versions of GNAT.
</p>
<p>RM References: 3.09.02 (20/2) 3.09.02 (20.1/2) 3.09.02 (20.2/2)
</p>
</li><li> <em>AI-0097 Treatment of abstract null extension (2010-07-19)</em>
<a name="index-AI_002d0097-_0028Ada-2012-feature_0029"></a>
<p>The RM as written implied that in some cases it was possible to create an
object of an abstract type, by having an abstract extension inherit a non-
abstract constructor from its parent type. This mistake has been corrected
in GNAT and in the RM, and this construct is now illegal.
</p>
<p>RM References: 3.09.03 (4/2)
</p>
</li><li> <em>AI-0203 Extended return cannot be abstract (0000-00-00)</em>
<a name="index-AI_002d0203-_0028Ada-2012-feature_0029"></a>
<p>A return_subtype_indication cannot denote an abstract subtype. GNAT has never
permitted such usage.
</p>
<p>RM References: 3.09.03 (8/3)
</p>
</li><li> <em>AI-0198 Inheriting abstract operators (0000-00-00)</em>
<a name="index-AI_002d0198-_0028Ada-2012-feature_0029"></a>
<p>This AI resolves a conflict between two rules involving inherited abstract
operations and predefined operators. If a derived numeric type inherits
an abstract operator, it overrides the predefined one. This interpretation
was always the one implemented in GNAT.
</p>
<p>RM References: 3.09.03 (4/3)
</p>
</li><li> <em>AI-0073 Functions returning abstract types (2010-07-10)</em>
<a name="index-AI_002d0073-_0028Ada-2012-feature_0029"></a>
<p>This AI covers a number of issues regarding returning abstract types. In
particular generic functions cannot have abstract result types or access
result types designated an abstract type. There are some other cases which
are detailed in the AI. Note that this binding interpretation has not been
retrofitted to operate before Ada 2012 mode, since it caused a significant
number of regressions.
</p>
<p>RM References: 3.09.03 (8) 3.09.03 (10) 6.05 (8/2)
</p>
</li><li> <em>AI-0070 Elaboration of interface types (0000-00-00)</em>
<a name="index-AI_002d0070-_0028Ada-2012-feature_0029"></a>
<p>This is an editorial change only, there are no testable consequences short of
checking for the absence of generated code for an interface declaration.
</p>
<p>RM References: 3.09.04 (18/2)
</p>
</li><li> <em>AI-0208 Characteristics of incomplete views (0000-00-00)</em>
<a name="index-AI_002d0208-_0028Ada-2012-feature_0029"></a>
<p>The wording in the Ada 2005 RM concerning characteristics of incomplete views
was incorrect and implied that some programs intended to be legal were now
illegal. GNAT had never considered such programs illegal, so it has always
implemented the intent of this AI.
</p>
<p>RM References: 3.10.01 (2.4/2) 3.10.01 (2.6/2)
</p>
</li><li> <em>AI-0162 Incomplete type completed by partial view (2010-09-15)</em>
<a name="index-AI_002d0162-_0028Ada-2012-feature_0029"></a>
<p>Incomplete types are made more useful by allowing them to be completed by
private types and private extensions.
</p>
<p>RM References: 3.10.01 (2.5/2) 3.10.01 (2.6/2) 3.10.01 (3) 3.10.01 (4/2)
</p>
</li><li> <em>AI-0098 Anonymous subprogram access restrictions (0000-00-00)</em>
<a name="index-AI_002d0098-_0028Ada-2012-feature_0029"></a>
<p>An unintentional omission in the RM implied some inconsistent restrictions on
the use of anonymous access to subprogram values. These restrictions were not
intentional, and have never been enforced by GNAT.
</p>
<p>RM References: 3.10.01 (6) 3.10.01 (9.2/2)
</p>
</li><li> <em>AI-0199 Aggregate with anonymous access components (2010-07-14)</em>
<a name="index-AI_002d0199-_0028Ada-2012-feature_0029"></a>
<p>A choice list in a record aggregate can include several components of
(distinct) anonymous access types as long as they have matching designated
subtypes.
</p>
<p>RM References: 4.03.01 (16)
</p>
</li><li> <em>AI-0220 Needed components for aggregates (0000-00-00)</em>
<a name="index-AI_002d0220-_0028Ada-2012-feature_0029"></a>
<p>This AI addresses a wording problem in the RM that appears to permit some
complex cases of aggregates with non-static discriminants. GNAT has always
implemented the intended semantics.
</p>
<p>RM References: 4.03.01 (17)
</p>
</li><li> <em>AI-0147 Conditional expressions (2009-03-29)</em>
<a name="index-AI_002d0147-_0028Ada-2012-feature_0029"></a>
<p>Conditional expressions are permitted. The form of such an expression is:
</p>
<div class="smallexample">
<pre class="smallexample"> (<b>if</b> <i>expr</i> <b>then</b> <i>expr</i> {<b>elsif</b> <i>expr</i> <b>then</b> <i>expr</i>} [<b>else</b> <i>expr</i>])
</pre></div>
<p>The parentheses can be omitted in contexts where parentheses are present
anyway, such as subprogram arguments and pragma arguments. If the <b>else</b>
clause is omitted, <b>else True</b> is assumed;
thus <code>(<b>if</b> A <b>then</b> B)</code> is a way to conveniently represent
<em>(A implies B)</em> in standard logic.
</p>
<p>RM References: 4.03.03 (15) 4.04 (1) 4.04 (7) 4.05.07 (0) 4.07 (2)
4.07 (3) 4.09 (12) 4.09 (33) 5.03 (3) 5.03 (4) 7.05 (2.1/2)
</p>
</li><li> <em>AI-0037 Out-of-range box associations in aggregate (0000-00-00)</em>
<a name="index-AI_002d0037-_0028Ada-2012-feature_0029"></a>
<p>This AI confirms that an association of the form <code>Indx => <></code> in an
array aggregate must raise <code>Constraint_Error</code> if <code>Indx</code>
is out of range. The RM specified a range check on other associations, but
not when the value of the association was defaulted. GNAT has always inserted
a constraint check on the index value.
</p>
<p>RM References: 4.03.03 (29)
</p>
</li><li> <em>AI-0123 Composability of equality (2010-04-13)</em>
<a name="index-AI_002d0123-_0028Ada-2012-feature_0029"></a>
<p>Equality of untagged record composes, so that the predefined equality for a
composite type that includes a component of some untagged record type
<code>R</code> uses the equality operation of <code>R</code> (which may be user-defined
or predefined). This makes the behavior of untagged records identical to that
of tagged types in this respect.
</p>
<p>This change is an incompatibility with previous versions of Ada, but it
corrects a non-uniformity that was often a source of confusion. Analysis of
a large number of industrial programs indicates that in those rare cases
where a composite type had an untagged record component with a user-defined
equality, either there was no use of the composite equality, or else the code
expected the same composability as for tagged types, and thus had a bug that
would be fixed by this change.
</p>
<p>RM References: 4.05.02 (9.7/2) 4.05.02 (14) 4.05.02 (15) 4.05.02 (24)
8.05.04 (8)
</p>
</li><li> <em>AI-0088 The value of exponentiation (0000-00-00)</em>
<a name="index-AI_002d0088-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies the equivalence rule given for the dynamic semantics of
exponentiation: the value of the operation can be obtained by repeated
multiplication, but the operation can be implemented otherwise (for example
using the familiar divide-by-two-and-square algorithm, even if this is less
accurate), and does not imply repeated reads of a volatile base.
</p>
<p>RM References: 4.05.06 (11)
</p>
</li><li> <em>AI-0188 Case expressions (2010-01-09)</em>
<a name="index-AI_002d0188-_0028Ada-2012-feature_0029"></a>
<p>Case expressions are permitted. This allows use of constructs such as:
</p><div class="smallexample">
<pre class="smallexample"> X := (<b>case</b> Y <b>is when</b> 1 => 2, <b>when</b> 2 => 3, <b>when others</b> => 31)
</pre></div>
<p>RM References: 4.05.07 (0) 4.05.08 (0) 4.09 (12) 4.09 (33)
</p>
</li><li> <em>AI-0104 Null exclusion and uninitialized allocator (2010-07-15)</em>
<a name="index-AI_002d0104-_0028Ada-2012-feature_0029"></a>
<p>The assignment <code>Ptr := <b>new not null</b> Some_Ptr;</code> will raise
<code>Constraint_Error</code> because the default value of the allocated object is
<b>null</b>. This useless construct is illegal in Ada 2012.
</p>
<p>RM References: 4.08 (2)
</p>
</li><li> <em>AI-0157 Allocation/Deallocation from empty pool (2010-07-11)</em>
<a name="index-AI_002d0157-_0028Ada-2012-feature_0029"></a>
<p>Allocation and Deallocation from an empty storage pool (i.e. allocation or
deallocation of a pointer for which a static storage size clause of zero
has been given) is now illegal and is detected as such. GNAT
previously gave a warning but not an error.
</p>
<p>RM References: 4.08 (5.3/2) 13.11.02 (4) 13.11.02 (17)
</p>
</li><li> <em>AI-0179 Statement not required after label (2010-04-10)</em>
<a name="index-AI_002d0179-_0028Ada-2012-feature_0029"></a>
<p>It is not necessary to have a statement following a label, so a label
can appear at the end of a statement sequence without the need for putting a
null statement afterwards, but it is not allowable to have only labels and
no real statements in a statement sequence.
</p>
<p>RM References: 5.01 (2)
</p>
</li><li> <em>AI-139-2 Syntactic sugar for iterators (2010-09-29)</em>
<a name="index-AI_002d139_002d2-_0028Ada-2012-feature_0029"></a>
<p>The new syntax for iterating over arrays and containers is now implemented.
Iteration over containers is for now limited to read-only iterators. Only
default iterators are supported, with the syntax: <code><b>for</b> Elem <b>of</b> C</code>.
</p>
<p>RM References: 5.05
</p>
</li><li> <em>AI-0134 Profiles must match for full conformance (0000-00-00)</em>
<a name="index-AI_002d0134-_0028Ada-2012-feature_0029"></a>
<p>For full conformance, the profiles of anonymous-access-to-subprogram
parameters must match. GNAT has always enforced this rule.
</p>
<p>RM References: 6.03.01 (18)
</p>
</li><li> <em>AI-0207 Mode conformance and access constant (0000-00-00)</em>
<a name="index-AI_002d0207-_0028Ada-2012-feature_0029"></a>
<p>This AI confirms that access_to_constant indication must match for mode
conformance. This was implemented in GNAT when the qualifier was originally
introduced in Ada 2005.
</p>
<p>RM References: 6.03.01 (16/2)
</p>
</li><li> <em>AI-0046 Null exclusion match for full conformance (2010-07-17)</em>
<a name="index-AI_002d0046-_0028Ada-2012-feature_0029"></a>
<p>For full conformance, in the case of access parameters, the null exclusion
must match (either both or neither must have <code><b>not null</b></code>).
</p>
<p>RM References: 6.03.02 (18)
</p>
</li><li> <em>AI-0118 The association of parameter associations (0000-00-00)</em>
<a name="index-AI_002d0118-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies the rules for named associations in subprogram calls and
generic instantiations. The rules have been in place since Ada 83.
</p>
<p>RM References: 6.04.01 (2) 12.03 (9)
</p>
</li><li> <em>AI-0196 Null exclusion tests for out parameters (0000-00-00)</em>
<a name="index-AI_002d0196-_0028Ada-2012-feature_0029"></a>
<p>Null exclusion checks are not made for <code><b>out</b></code> parameters when
evaluating the actual parameters. GNAT has never generated these checks.
</p>
<p>RM References: 6.04.01 (13)
</p>
</li><li> <em>AI-0015 Constant return objects (0000-00-00)</em>
<a name="index-AI_002d0015-_0028Ada-2012-feature_0029"></a>
<p>The return object declared in an <i>extended_return_statement</i> may be
declared constant. This was always intended, and GNAT has always allowed it.
</p>
<p>RM References: 6.05 (2.1/2) 3.03 (10/2) 3.03 (21) 6.05 (5/2)
6.05 (5.7/2)
</p>
</li><li> <em>AI-0032 Extended return for class-wide functions (0000-00-00)</em>
<a name="index-AI_002d0032-_0028Ada-2012-feature_0029"></a>
<p>If a function returns a class-wide type, the object of an extended return
statement can be declared with a specific type that is covered by the class-
wide type. This has been implemented in GNAT since the introduction of
extended returns. Note AI-0103 complements this AI by imposing matching
rules for constrained return types.
</p>
<p>RM References: 6.05 (5.2/2) 6.05 (5.3/2) 6.05 (5.6/2) 6.05 (5.8/2)
6.05 (8/2)
</p>
</li><li> <em>AI-0103 Static matching for extended return (2010-07-23)</em>
<a name="index-AI_002d0103-_0028Ada-2012-feature_0029"></a>
<p>If the return subtype of a function is an elementary type or a constrained
type, the subtype indication in an extended return statement must match
statically this return subtype.
</p>
<p>RM References: 6.05 (5.2/2)
</p>
</li><li> <em>AI-0058 Abnormal completion of an extended return (0000-00-00)</em>
<a name="index-AI_002d0058-_0028Ada-2012-feature_0029"></a>
<p>The RM had some incorrect wording implying wrong treatment of abnormal
completion in an extended return. GNAT has always implemented the intended
correct semantics as described by this AI.
</p>
<p>RM References: 6.05 (22/2)
</p>
</li><li> <em>AI-0050 Raising Constraint_Error early for function call (0000-00-00)</em>
<a name="index-AI_002d0050-_0028Ada-2012-feature_0029"></a>
<p>The implementation permissions for raising <code>Constraint_Error</code> early on a function call when it was clear an exception would be raised were over-permissive and allowed mishandling of discriminants in some cases. GNAT did
not take advantage of these incorrect permissions in any case.
</p>
<p>RM References: 6.05 (24/2)
</p>
</li><li> <em>AI-0125 Nonoverridable operations of an ancestor (2010-09-28)</em>
<a name="index-AI_002d0125-_0028Ada-2012-feature_0029"></a>
<p>In Ada 2012, the declaration of a primitive operation of a type extension
or private extension can also override an inherited primitive that is not
visible at the point of this declaration.
</p>
<p>RM References: 7.03.01 (6) 8.03 (23) 8.03.01 (5/2) 8.03.01 (6/2)
</p>
</li><li> <em>AI-0062 Null exclusions and deferred constants (0000-00-00)</em>
<a name="index-AI_002d0062-_0028Ada-2012-feature_0029"></a>
<p>A full constant may have a null exclusion even if its associated deferred
constant does not. GNAT has always allowed this.
</p>
<p>RM References: 7.04 (6/2) 7.04 (7.1/2)
</p>
</li><li> <em>AI-0178 Incomplete views are limited (0000-00-00)</em>
<a name="index-AI_002d0178-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies the role of incomplete views and plugs an omission in the
RM. GNAT always correctly restricted the use of incomplete views and types.
</p>
<p>RM References: 7.05 (3/2) 7.05 (6/2)
</p>
</li><li> <em>AI-0087 Actual for formal nonlimited derived type (2010-07-15)</em>
<a name="index-AI_002d0087-_0028Ada-2012-feature_0029"></a>
<p>The actual for a formal nonlimited derived type cannot be limited. In
particular, a formal derived type that extends a limited interface but which
is not explicitly limited cannot be instantiated with a limited type.
</p>
<p>RM References: 7.05 (5/2) 12.05.01 (5.1/2)
</p>
</li><li> <em>AI-0099 Tag determines whether finalization needed (0000-00-00)</em>
<a name="index-AI_002d0099-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies that “needs finalization” is part of dynamic semantics,
and therefore depends on the run-time characteristics of an object (i.e. its
tag) and not on its nominal type. As the AI indicates: “we do not expect
this to affect any implementation”.
</p>
<p>RM References: 7.06.01 (6) 7.06.01 (7) 7.06.01 (8) 7.06.01 (9/2)
</p>
</li><li> <em>AI-0064 Redundant finalization rule (0000-00-00)</em>
<a name="index-AI_002d0064-_0028Ada-2012-feature_0029"></a>
<p>This is an editorial change only. The intended behavior is already checked
by an existing ACATS test, which GNAT has always executed correctly.
</p>
<p>RM References: 7.06.01 (17.1/1)
</p>
</li><li> <em>AI-0026 Missing rules for Unchecked_Union (2010-07-07)</em>
<a name="index-AI_002d0026-_0028Ada-2012-feature_0029"></a>
<p>Record representation clauses concerning Unchecked_Union types cannot mention
the discriminant of the type. The type of a component declared in the variant
part of an Unchecked_Union cannot be controlled, have controlled components,
nor have protected or task parts. If an Unchecked_Union type is declared
within the body of a generic unit or its descendants, then the type of a
component declared in the variant part cannot be a formal private type or a
formal private extension declared within the same generic unit.
</p>
<p>RM References: 7.06 (9.4/2) B.03.03 (9/2) B.03.03 (10/2)
</p>
</li><li> <em>AI-0205 Extended return declares visible name (0000-00-00)</em>
<a name="index-AI_002d0205-_0028Ada-2012-feature_0029"></a>
<p>This AI corrects a simple omission in the RM. Return objects have always
been visible within an extended return statement.
</p>
<p>RM References: 8.03 (17)
</p>
</li><li> <em>AI-0042 Overriding versus implemented-by (0000-00-00)</em>
<a name="index-AI_002d0042-_0028Ada-2012-feature_0029"></a>
<p>This AI fixes a wording gap in the RM. An operation of a synchronized
interface can be implemented by a protected or task entry, but the abstract
operation is not being overridden in the usual sense, and it must be stated
separately that this implementation is legal. This has always been the case
in GNAT.
</p>
<p>RM References: 9.01 (9.2/2) 9.04 (11.1/2)
</p>
</li><li> <em>AI-0030 Requeue on synchronized interfaces (2010-07-19)</em>
<a name="index-AI_002d0030-_0028Ada-2012-feature_0029"></a>
<p>Requeue is permitted to a protected, synchronized or task interface primitive
providing it is known that the overriding operation is an entry. Otherwise
the requeue statement has the same effect as a procedure call. Use of pragma
<code>Implemented</code> provides a way to impose a static requirement on the
overriding operation by adhering to one of the implementation kinds: entry,
protected procedure or any of the above.
</p>
<p>RM References: 9.05 (9) 9.05.04 (2) 9.05.04 (3) 9.05.04 (5)
9.05.04 (6) 9.05.04 (7) 9.05.04 (12)
</p>
</li><li> <em>AI-0201 Independence of atomic object components (2010-07-22)</em>
<a name="index-AI_002d0201-_0028Ada-2012-feature_0029"></a>
<p>If an Atomic object has a pragma <code>Pack</code> or a <code>Component_Size</code>
attribute, then individual components may not be addressable by independent
tasks. However, if the representation clause has no effect (is confirming),
then independence is not compromised. Furthermore, in GNAT, specification of
other appropriately addressable component sizes (e.g. 16 for 8-bit
characters) also preserves independence. GNAT now gives very clear warnings
both for the declaration of such a type, and for any assignment to its components.
</p>
<p>RM References: 9.10 (1/3) C.06 (22/2) C.06 (23/2)
</p>
</li><li> <em>AI-0009 Pragma Independent[_Components] (2010-07-23)</em>
<a name="index-AI_002d0009-_0028Ada-2012-feature_0029"></a>
<p>This AI introduces the new pragmas <code>Independent</code> and
<code>Independent_Components</code>,
which control guaranteeing independence of access to objects and components.
The AI also requires independence not unaffected by confirming rep clauses.
</p>
<p>RM References: 9.10 (1) 13.01 (15/1) 13.02 (9) 13.03 (13) C.06 (2)
C.06 (4) C.06 (6) C.06 (9) C.06 (13) C.06 (14)
</p>
</li><li> <em>AI-0072 Task signalling using ’Terminated (0000-00-00)</em>
<a name="index-AI_002d0072-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies that task signalling for reading <code>'Terminated</code> only
occurs if the result is True. GNAT semantics has always been consistent with
this notion of task signalling.
</p>
<p>RM References: 9.10 (6.1/1)
</p>
</li><li> <em>AI-0108 Limited incomplete view and discriminants (0000-00-00)</em>
<a name="index-AI_002d0108-_0028Ada-2012-feature_0029"></a>
<p>This AI confirms that an incomplete type from a limited view does not have
discriminants. This has always been the case in GNAT.
</p>
<p>RM References: 10.01.01 (12.3/2)
</p>
</li><li> <em>AI-0129 Limited views and incomplete types (0000-00-00)</em>
<a name="index-AI_002d0129-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies the description of limited views: a limited view of a
package includes only one view of a type that has an incomplete declaration
and a full declaration (there is no possible ambiguity in a client package).
This AI also fixes an omission: a nested package in the private part has no
limited view. GNAT always implemented this correctly.
</p>
<p>RM References: 10.01.01 (12.2/2) 10.01.01 (12.3/2)
</p>
</li><li> <em>AI-0077 Limited withs and scope of declarations (0000-00-00)</em>
<a name="index-AI_002d0077-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies that a declaration does not include a context clause,
and confirms that it is illegal to have a context in which both a limited
and a nonlimited view of a package are accessible. Such double visibility
was always rejected by GNAT.
</p>
<p>RM References: 10.01.02 (12/2) 10.01.02 (21/2) 10.01.02 (22/2)
</p>
</li><li> <em>AI-0122 Private with and children of generics (0000-00-00)</em>
<a name="index-AI_002d0122-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies the visibility of private children of generic units within
instantiations of a parent. GNAT has always handled this correctly.
</p>
<p>RM References: 10.01.02 (12/2)
</p>
</li><li> <em>AI-0040 Limited with clauses on descendant (0000-00-00)</em>
<a name="index-AI_002d0040-_0028Ada-2012-feature_0029"></a>
<p>This AI confirms that a limited with clause in a child unit cannot name
an ancestor of the unit. This has always been checked in GNAT.
</p>
<p>RM References: 10.01.02 (20/2)
</p>
</li><li> <em>AI-0132 Placement of library unit pragmas (0000-00-00)</em>
<a name="index-AI_002d0132-_0028Ada-2012-feature_0029"></a>
<p>This AI fills a gap in the description of library unit pragmas. The pragma
clearly must apply to a library unit, even if it does not carry the name
of the enclosing unit. GNAT has always enforced the required check.
</p>
<p>RM References: 10.01.05 (7)
</p>
</li><li> <em>AI-0034 Categorization of limited views (0000-00-00)</em>
<a name="index-AI_002d0034-_0028Ada-2012-feature_0029"></a>
<p>The RM makes certain limited with clauses illegal because of categorization
considerations, when the corresponding normal with would be legal. This is
not intended, and GNAT has always implemented the recommended behavior.
</p>
<p>RM References: 10.02.01 (11/1) 10.02.01 (17/2)
</p>
</li><li> <em>AI-0035 Inconsistencies with Pure units (0000-00-00)</em>
<a name="index-AI_002d0035-_0028Ada-2012-feature_0029"></a>
<p>This AI remedies some inconsistencies in the legality rules for Pure units.
Derived access types are legal in a pure unit (on the assumption that the
rule for a zero storage pool size has been enforced on the ancestor type).
The rules are enforced in generic instances and in subunits. GNAT has always
implemented the recommended behavior.
</p>
<p>RM References: 10.02.01 (15.1/2) 10.02.01 (15.4/2) 10.02.01 (15.5/2) 10.02.01 (17/2)
</p>
</li><li> <em>AI-0219 Pure permissions and limited parameters (2010-05-25)</em>
<a name="index-AI_002d0219-_0028Ada-2012-feature_0029"></a>
<p>This AI refines the rules for the cases with limited parameters which do not
allow the implementations to omit “redundant”. GNAT now properly conforms
to the requirements of this binding interpretation.
</p>
<p>RM References: 10.02.01 (18/2)
</p>
</li><li> <em>AI-0043 Rules about raising exceptions (0000-00-00)</em>
<a name="index-AI_002d0043-_0028Ada-2012-feature_0029"></a>
<p>This AI covers various omissions in the RM regarding the raising of
exceptions. GNAT has always implemented the intended semantics.
</p>
<p>RM References: 11.04.01 (10.1/2) 11 (2)
</p>
</li><li> <em>AI-0200 Mismatches in formal package declarations (0000-00-00)</em>
<a name="index-AI_002d0200-_0028Ada-2012-feature_0029"></a>
<p>This AI plugs a gap in the RM which appeared to allow some obviously intended
illegal instantiations. GNAT has never allowed these instantiations.
</p>
<p>RM References: 12.07 (16)
</p>
</li><li> <em>AI-0112 Detection of duplicate pragmas (2010-07-24)</em>
<a name="index-AI_002d0112-_0028Ada-2012-feature_0029"></a>
<p>This AI concerns giving names to various representation aspects, but the
practical effect is simply to make the use of duplicate
<code>Atomic</code>[<code>_Components</code>],
<code>Volatile</code>[<code>_Components</code>] and
<code>Independent</code>[<code>_Components</code>] pragmas illegal, and GNAT
now performs this required check.
</p>
<p>RM References: 13.01 (8)
</p>
</li><li> <em>AI-0106 No representation pragmas on generic formals (0000-00-00)</em>
<a name="index-AI_002d0106-_0028Ada-2012-feature_0029"></a>
<p>The RM appeared to allow representation pragmas on generic formal parameters,
but this was not intended, and GNAT has never permitted this usage.
</p>
<p>RM References: 13.01 (9.1/1)
</p>
</li><li> <em>AI-0012 Pack/Component_Size for aliased/atomic (2010-07-15)</em>
<a name="index-AI_002d0012-_0028Ada-2012-feature_0029"></a>
<p>It is now illegal to give an inappropriate component size or a pragma
<code>Pack</code> that attempts to change the component size in the case of atomic
or aliased components. Previously GNAT ignored such an attempt with a
warning.
</p>
<p>RM References: 13.02 (6.1/2) 13.02 (7) C.06 (10) C.06 (11) C.06 (21)
</p>
</li><li> <em>AI-0039 Stream attributes cannot be dynamic (0000-00-00)</em>
<a name="index-AI_002d0039-_0028Ada-2012-feature_0029"></a>
<p>The RM permitted the use of dynamic expressions (such as <code>ptr.<b>all</b>)</code>
for stream attributes, but these were never useful and are now illegal. GNAT
has always regarded such expressions as illegal.
</p>
<p>RM References: 13.03 (4) 13.03 (6) 13.13.02 (38/2)
</p>
</li><li> <em>AI-0095 Address of intrinsic subprograms (0000-00-00)</em>
<a name="index-AI_002d0095-_0028Ada-2012-feature_0029"></a>
<p>The prefix of <code>'Address</code> cannot statically denote a subprogram with
convention <code>Intrinsic</code>. The use of the <code>Address</code> attribute raises
<code>Program_Error</code> if the prefix denotes a subprogram with convention
<code>Intrinsic</code>.
</p>
<p>RM References: 13.03 (11/1)
</p>
</li><li> <em>AI-0116 Alignment of class-wide objects (0000-00-00)</em>
<a name="index-AI_002d0116-_0028Ada-2012-feature_0029"></a>
<p>This AI requires that the alignment of a class-wide object be no greater
than the alignment of any type in the class. GNAT has always followed this
recommendation.
</p>
<p>RM References: 13.03 (29) 13.11 (16)
</p>
</li><li> <em>AI-0146 Type invariants (2009-09-21)</em>
<a name="index-AI_002d0146-_0028Ada-2012-feature_0029"></a>
<p>Type invariants may be specified for private types using the aspect notation.
Aspect <code>Type_Invariant</code> may be specified for any private type,
<code>Type_Invariant'Class</code> can
only be specified for tagged types, and is inherited by any descendent of the
tagged types. The invariant is a boolean expression that is tested for being
true in the following situations: conversions to the private type, object
declarations for the private type that are default initialized, and
[<b>in</b>] <b>out</b>
parameters and returned result on return from any primitive operation for
the type that is visible to a client.
GNAT defines the synonyms <code>Invariant</code> for <code>Type_Invariant</code> and
<code>Invariant'Class</code> for <code>Type_Invariant'Class</code>.
</p>
<p>RM References: 13.03.03 (00)
</p>
</li><li> <em>AI-0078 Relax Unchecked_Conversion alignment rules (0000-00-00)</em>
<a name="index-AI_002d0078-_0028Ada-2012-feature_0029"></a>
<p>In Ada 2012, compilers are required to support unchecked conversion where the
target alignment is a multiple of the source alignment. GNAT always supported
this case (and indeed all cases of differing alignments, doing copies where
required if the alignment was reduced).
</p>
<p>RM References: 13.09 (7)
</p>
</li><li> <em>AI-0195 Invalid value handling is implementation defined (2010-07-03)</em>
<a name="index-AI_002d0195-_0028Ada-2012-feature_0029"></a>
<p>The handling of invalid values is now designated to be implementation
defined. This is a documentation change only, requiring Annex M in the GNAT
Reference Manual to document this handling.
In GNAT, checks for invalid values are made
only when necessary to avoid erroneous behavior. Operations like assignments
which cannot cause erroneous behavior ignore the possibility of invalid
values and do not do a check. The date given above applies only to the
documentation change, this behavior has always been implemented by GNAT.
</p>
<p>RM References: 13.09.01 (10)
</p>
</li><li> <em>AI-0193 Alignment of allocators (2010-09-16)</em>
<a name="index-AI_002d0193-_0028Ada-2012-feature_0029"></a>
<p>This AI introduces a new attribute <code>Max_Alignment_For_Allocation</code>,
analogous to <code>Max_Size_In_Storage_Elements</code>, but for alignment instead
of size.
</p>
<p>RM References: 13.11 (16) 13.11 (21) 13.11.01 (0) 13.11.01 (1)
13.11.01 (2) 13.11.01 (3)
</p>
</li><li> <em>AI-0177 Parameterized expressions (2010-07-10)</em>
<a name="index-AI_002d0177-_0028Ada-2012-feature_0029"></a>
<p>The new Ada 2012 notion of parameterized expressions is implemented. The form
is:
</p><div class="smallexample">
<pre class="smallexample"> <i>function specification</i> <b>is</b> (<i>expression</i>)
</pre></div>
<p>This is exactly equivalent to the
corresponding function body that returns the expression, but it can appear
in a package spec. Note that the expression must be parenthesized.
</p>
<p>RM References: 13.11.01 (3/2)
</p>
</li><li> <em>AI-0033 Attach/Interrupt_Handler in generic (2010-07-24)</em>
<a name="index-AI_002d0033-_0028Ada-2012-feature_0029"></a>
<p>Neither of these two pragmas may appear within a generic template, because
the generic might be instantiated at other than the library level.
</p>
<p>RM References: 13.11.02 (16) C.03.01 (7/2) C.03.01 (8/2)
</p>
</li><li> <em>AI-0161 Restriction No_Default_Stream_Attributes (2010-09-11)</em>
<a name="index-AI_002d0161-_0028Ada-2012-feature_0029"></a>
<p>A new restriction <code>No_Default_Stream_Attributes</code> prevents the use of any
of the default stream attributes for elementary types. If this restriction is
in force, then it is necessary to provide explicit subprograms for any
stream attributes used.
</p>
<p>RM References: 13.12.01 (4/2) 13.13.02 (40/2) 13.13.02 (52/2)
</p>
</li><li> <em>AI-0194 Value of Stream_Size attribute (0000-00-00)</em>
<a name="index-AI_002d0194-_0028Ada-2012-feature_0029"></a>
<p>The <code>Stream_Size</code> attribute returns the default number of bits in the
stream representation of the given type.
This value is not affected by the presence
of stream subprogram attributes for the type. GNAT has always implemented
this interpretation.
</p>
<p>RM References: 13.13.02 (1.2/2)
</p>
</li><li> <em>AI-0109 Redundant check in S’Class’Input (0000-00-00)</em>
<a name="index-AI_002d0109-_0028Ada-2012-feature_0029"></a>
<p>This AI is an editorial change only. It removes the need for a tag check
that can never fail.
</p>
<p>RM References: 13.13.02 (34/2)
</p>
</li><li> <em>AI-0007 Stream read and private scalar types (0000-00-00)</em>
<a name="index-AI_002d0007-_0028Ada-2012-feature_0029"></a>
<p>The RM as written appeared to limit the possibilities of declaring read
attribute procedures for private scalar types. This limitation was not
intended, and has never been enforced by GNAT.
</p>
<p>RM References: 13.13.02 (50/2) 13.13.02 (51/2)
</p>
</li><li> <em>AI-0065 Remote access types and external streaming (0000-00-00)</em>
<a name="index-AI_002d0065-_0028Ada-2012-feature_0029"></a>
<p>This AI clarifies the fact that all remote access types support external
streaming. This fixes an obvious oversight in the definition of the
language, and GNAT always implemented the intended correct rules.
</p>
<p>RM References: 13.13.02 (52/2)
</p>
</li><li> <em>AI-0019 Freezing of primitives for tagged types (0000-00-00)</em>
<a name="index-AI_002d0019-_0028Ada-2012-feature_0029"></a>
<p>The RM suggests that primitive subprograms of a specific tagged type are
frozen when the tagged type is frozen. This would be an incompatible change
and is not intended. GNAT has never attempted this kind of freezing and its
behavior is consistent with the recommendation of this AI.
</p>
<p>RM References: 13.14 (2) 13.14 (3/1) 13.14 (8.1/1) 13.14 (10) 13.14 (14) 13.14 (15.1/2)
</p>
</li><li> <em>AI-0017 Freezing and incomplete types (0000-00-00)</em>
<a name="index-AI_002d0017-_0028Ada-2012-feature_0029"></a>
<p>So-called “Taft-amendment types” (i.e., types that are completed in package
bodies) are not frozen by the occurrence of bodies in the
enclosing declarative part. GNAT always implemented this properly.
</p>
<p>RM References: 13.14 (3/1)
</p>
</li><li> <em>AI-0060 Extended definition of remote access types (0000-00-00)</em>
<a name="index-AI_002d0060-_0028Ada-2012-feature_0029"></a>
<p>This AI extends the definition of remote access types to include access
to limited, synchronized, protected or task class-wide interface types.
GNAT already implemented this extension.
</p>
<p>RM References: A (4) E.02.02 (9/1) E.02.02 (9.2/1) E.02.02 (14/2) E.02.02 (18)
</p>
</li><li> <em>AI-0114 Classification of letters (0000-00-00)</em>
<a name="index-AI_002d0114-_0028Ada-2012-feature_0029"></a>
<p>The code points 170 (<code>FEMININE ORDINAL INDICATOR</code>),
181 (<code>MICRO SIGN</code>), and
186 (<code>MASCULINE ORDINAL INDICATOR</code>) are technically considered
lower case letters by Unicode.
However, they are not allowed in identifiers, and they
return <code>False</code> to <code>Ada.Characters.Handling.Is_Letter/Is_Lower</code>.
This behavior is consistent with that defined in Ada 95.
</p>
<p>RM References: A.03.02 (59) A.04.06 (7)
</p>
</li><li> <em>AI-0185 Ada.Wide_[Wide_]Characters.Handling (2010-07-06)</em>
<a name="index-AI_002d0185-_0028Ada-2012-feature_0029"></a>
<p>Two new packages <code>Ada.Wide_[Wide_]Characters.Handling</code> provide
classification functions for <code>Wide_Character</code> and
<code>Wide_Wide_Character</code>, as well as providing
case folding routines for <code>Wide_[Wide_]Character</code> and
<code>Wide_[Wide_]String</code>.
</p>
<p>RM References: A.03.05 (0) A.03.06 (0)
</p>
</li><li> <em>AI-0031 Add From parameter to Find_Token (2010-07-25)</em>
<a name="index-AI_002d0031-_0028Ada-2012-feature_0029"></a>
<p>A new version of <code>Find_Token</code> is added to all relevant string packages,
with an extra parameter <code>From</code>. Instead of starting at the first
character of the string, the search for a matching Token starts at the
character indexed by the value of <code>From</code>.
These procedures are available in all versions of Ada
but if used in versions earlier than Ada 2012 they will generate a warning
that an Ada 2012 subprogram is being used.
</p>
<p>RM References: A.04.03 (16) A.04.03 (67) A.04.03 (68/1) A.04.04 (51)
A.04.05 (46)
</p>
</li><li> <em>AI-0056 Index on null string returns zero (0000-00-00)</em>
<a name="index-AI_002d0056-_0028Ada-2012-feature_0029"></a>
<p>The wording in the Ada 2005 RM implied an incompatible handling of the
<code>Index</code> functions, resulting in raising an exception instead of
returning zero in some situations.
This was not intended and has been corrected.
GNAT always returned zero, and is thus consistent with this AI.
</p>
<p>RM References: A.04.03 (56.2/2) A.04.03 (58.5/2)
</p>
</li><li> <em>AI-0137 String encoding package (2010-03-25)</em>
<a name="index-AI_002d0137-_0028Ada-2012-feature_0029"></a>
<p>The packages <code>Ada.Strings.UTF_Encoding</code>, together with its child
packages, <code>Conversions</code>, <code>Strings</code>, <code>Wide_Strings</code>,
and <code>Wide_Wide_Strings</code> have been
implemented. These packages (whose documentation can be found in the spec
files <samp>a-stuten.ads</samp>, <samp>a-suenco.ads</samp>, <samp>a-suenst.ads</samp>,
<samp>a-suewst.ads</samp>, <samp>a-suezst.ads</samp>) allow encoding and decoding of
<code>String</code>, <code>Wide_String</code>, and <code>Wide_Wide_String</code>
values using UTF coding schemes (including UTF-8, UTF-16LE, UTF-16BE, and
UTF-16), as well as conversions between the different UTF encodings. With
the exception of <code>Wide_Wide_Strings</code>, these packages are available in
Ada 95 and Ada 2005 mode as well as Ada 2012 mode.
The <code>Wide_Wide_Strings package</code>
is available in Ada 2005 mode as well as Ada 2012 mode (but not in Ada 95
mode since it uses <code>Wide_Wide_Character</code>).
</p>
<p>RM References: A.04.11
</p>
</li><li> <em>AI-0038 Minor errors in Text_IO (0000-00-00)</em>
<a name="index-AI_002d0038-_0028Ada-2012-feature_0029"></a>
<p>These are minor errors in the description on three points. The intent on
all these points has always been clear, and GNAT has always implemented the
correct intended semantics.
</p>
<p>RM References: A.10.05 (37) A.10.07 (8/1) A.10.07 (10) A.10.07 (12) A.10.08 (10) A.10.08 (24)
</p>
</li><li> <em>AI-0044 Restrictions on container instantiations (0000-00-00)</em>
<a name="index-AI_002d0044-_0028Ada-2012-feature_0029"></a>
<p>This AI places restrictions on allowed instantiations of generic containers.
These restrictions are not checked by the compiler, so there is nothing to
change in the implementation. This affects only the RM documentation.
</p>
<p>RM References: A.18 (4/2) A.18.02 (231/2) A.18.03 (145/2) A.18.06 (56/2) A.18.08 (66/2) A.18.09 (79/2) A.18.26 (5/2) A.18.26 (9/2)
</p>
</li><li> <em>AI-0127 Adding Locale Capabilities (2010-09-29)</em>
<a name="index-AI_002d0127-_0028Ada-2012-feature_0029"></a>
<p>This package provides an interface for identifying the current locale.
</p>
<p>RM References: A.19 A.19.01 A.19.02 A.19.03 A.19.05 A.19.06
A.19.07 A.19.08 A.19.09 A.19.10 A.19.11 A.19.12 A.19.13
</p>
</li><li> <em>AI-0002 Export C with unconstrained arrays (0000-00-00)</em>
<a name="index-AI_002d0002-_0028Ada-2012-feature_0029"></a>
<p>The compiler is not required to support exporting an Ada subprogram with
convention C if there are parameters or a return type of an unconstrained
array type (such as <code>String</code>). GNAT allows such declarations but
generates warnings. It is possible, but complicated, to write the
corresponding C code and certainly such code would be specific to GNAT and
non-portable.
</p>
<p>RM References: B.01 (17) B.03 (62) B.03 (71.1/2)
</p>
</li><li> <em>AI-0216 No_Task_Hierarchy forbids local tasks (0000-00-00)</em>
<a name="index-AI05_002d0216-_0028Ada-2012-feature_0029"></a>
<p>It is clearly the intention that <code>No_Task_Hierarchy</code> is intended to
forbid tasks declared locally within subprograms, or functions returning task
objects, and that is the implementation that GNAT has always provided.
However the language in the RM was not sufficiently clear on this point.
Thus this is a documentation change in the RM only.
</p>
<p>RM References: D.07 (3/3)
</p>
</li><li> <em>AI-0211 No_Relative_Delays forbids Set_Handler use (2010-07-09)</em>
<a name="index-AI_002d0211-_0028Ada-2012-feature_0029"></a>
<p>The restriction <code>No_Relative_Delays</code> forbids any calls to the subprogram
<code>Ada.Real_Time.Timing_Events.Set_Handler</code>.
</p>
<p>RM References: D.07 (5) D.07 (10/2) D.07 (10.4/2) D.07 (10.7/2)
</p>
</li><li> <em>AI-0190 pragma Default_Storage_Pool (2010-09-15)</em>
<a name="index-AI_002d0190-_0028Ada-2012-feature_0029"></a>
<p>This AI introduces a new pragma <code>Default_Storage_Pool</code>, which can be
used to control storage pools globally.
In particular, you can force every access
type that is used for allocation (<b>new</b>) to have an explicit storage pool,
or you can declare a pool globally to be used for all access types that lack
an explicit one.
</p>
<p>RM References: D.07 (8)
</p>
</li><li> <em>AI-0189 No_Allocators_After_Elaboration (2010-01-23)</em>
<a name="index-AI_002d0189-_0028Ada-2012-feature_0029"></a>
<p>This AI introduces a new restriction <code>No_Allocators_After_Elaboration</code>,
which says that no dynamic allocation will occur once elaboration is
completed.
In general this requires a run-time check, which is not required, and which
GNAT does not attempt. But the static cases of allocators in a task body or
in the body of the main program are detected and flagged at compile or bind
time.
</p>
<p>RM References: D.07 (19.1/2) H.04 (23.3/2)
</p>
</li><li> <em>AI-0171 Pragma CPU and Ravenscar Profile (2010-09-24)</em>
<a name="index-AI_002d0171-_0028Ada-2012-feature_0029"></a>
<p>A new package <code>System.Multiprocessors</code> is added, together with the
definition of pragma <code>CPU</code> for controlling task affinity. A new no
dependence restriction, on <code>System.Multiprocessors.Dispatching_Domains</code>,
is added to the Ravenscar profile.
</p>
<p>RM References: D.13.01 (4/2) D.16
</p>
</li><li> <em>AI-0210 Correct Timing_Events metric (0000-00-00)</em>
<a name="index-AI_002d0210-_0028Ada-2012-feature_0029"></a>
<p>This is a documentation only issue regarding wording of metric requirements,
that does not affect the implementation of the compiler.
</p>
<p>RM References: D.15 (24/2)
</p>
</li><li> <em>AI-0206 Remote types packages and preelaborate (2010-07-24)</em>
<a name="index-AI_002d0206-_0028Ada-2012-feature_0029"></a>
<p>Remote types packages are now allowed to depend on preelaborated packages.
This was formerly considered illegal.
</p>
<p>RM References: E.02.02 (6)
</p>
</li><li> <em>AI-0152 Restriction No_Anonymous_Allocators (2010-09-08)</em>
<a name="index-AI_002d0152-_0028Ada-2012-feature_0029"></a>
<p>Restriction <code>No_Anonymous_Allocators</code> prevents the use of allocators
where the type of the returned value is an anonymous access type.
</p>
<p>RM References: H.04 (8/1)
</p></li></ul>
<hr>
<a name="Obsolescent-Features"></a>
<div class="header">
<p>
Next: <a href="#GNU-Free-Documentation-License" accesskey="n" rel="next">GNU Free Documentation License</a>, Previous: <a href="#Implementation-of-Ada-2012-Features" accesskey="p" rel="prev">Implementation of Ada 2012 Features</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Obsolescent-Features-1"></a>
<h2 class="chapter">15 Obsolescent Features</h2>
<p>This chapter describes features that are provided by GNAT, but are
considered obsolescent since there are preferred ways of achieving
the same effect. These features are provided solely for historical
compatibility purposes.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">• <a href="#pragma-No_005fRun_005fTime" accesskey="1">pragma No_Run_Time</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#pragma-Ravenscar" accesskey="2">pragma Ravenscar</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">• <a href="#pragma-Restricted_005fRun_005fTime" accesskey="3">pragma Restricted_Run_Time</a>:</td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<hr>
<a name="pragma-No_005fRun_005fTime"></a>
<div class="header">
<p>
Next: <a href="#pragma-Ravenscar" accesskey="n" rel="next">pragma Ravenscar</a>, Up: <a href="#Obsolescent-Features" accesskey="u" rel="up">Obsolescent Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="pragma-No_005fRun_005fTime-1"></a>
<h3 class="section">15.1 pragma No_Run_Time</h3>
<p>The pragma <code>No_Run_Time</code> is used to achieve an affect similar
to the use of the "Zero Foot Print" configurable run time, but without
requiring a specially configured run time. The result of using this
pragma, which must be used for all units in a partition, is to restrict
the use of any language features requiring run-time support code. The
preferred usage is to use an appropriately configured run-time that
includes just those features that are to be made accessible.
</p>
<hr>
<a name="pragma-Ravenscar"></a>
<div class="header">
<p>
Next: <a href="#pragma-Restricted_005fRun_005fTime" accesskey="n" rel="next">pragma Restricted_Run_Time</a>, Previous: <a href="#pragma-No_005fRun_005fTime" accesskey="p" rel="prev">pragma No_Run_Time</a>, Up: <a href="#Obsolescent-Features" accesskey="u" rel="up">Obsolescent Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="pragma-Ravenscar-1"></a>
<h3 class="section">15.2 pragma Ravenscar</h3>
<p>The pragma <code>Ravenscar</code> has exactly the same effect as pragma
<code>Profile (Ravenscar)</code>. The latter usage is preferred since it
is part of the new Ada 2005 standard.
</p>
<hr>
<a name="pragma-Restricted_005fRun_005fTime"></a>
<div class="header">
<p>
Previous: <a href="#pragma-Ravenscar" accesskey="p" rel="prev">pragma Ravenscar</a>, Up: <a href="#Obsolescent-Features" accesskey="u" rel="up">Obsolescent Features</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="pragma-Restricted_005fRun_005fTime-1"></a>
<h3 class="section">15.3 pragma Restricted_Run_Time</h3>
<p>The pragma <code>Restricted_Run_Time</code> has exactly the same effect as
pragma <code>Profile (Restricted)</code>. The latter usage is
preferred since the Ada 2005 pragma <code>Profile</code> is intended for
this kind of implementation dependent addition.
</p>
<hr>
<a name="GNU-Free-Documentation-License"></a>
<div class="header">
<p>
Next: <a href="#Index" accesskey="n" rel="next">Index</a>, Previous: <a href="#Obsolescent-Features" accesskey="p" rel="prev">Obsolescent Features</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNU-Free-Documentation-License-1"></a>
<h2 class="unnumbered">GNU Free Documentation License</h2>
<a name="index-FDL_002c-GNU-Free-Documentation-License"></a>
<div align="center">Version 1.3, 3 November 2008
</div>
<div class="display">
<pre class="display">Copyright © 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
<a href="http://fsf.org/">http://fsf.org/</a>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
</pre></div>
<ol>
<li> PREAMBLE
<p>The purpose of this License is to make a manual, textbook, or other
functional and useful document <em>free</em> in the sense of freedom: to
assure everyone the effective freedom to copy and redistribute it,
with or without modifying it, either commercially or noncommercially.
Secondarily, this License preserves for the author and publisher a way
to get credit for their work, while not being considered responsible
for modifications made by others.
</p>
<p>This License is a kind of “copyleft”, which means that derivative
works of the document must themselves be free in the same sense. It
complements the GNU General Public License, which is a copyleft
license designed for free software.
</p>
<p>We have designed this License in order to use it for manuals for free
software, because free software needs free documentation: a free
program should come with manuals providing the same freedoms that the
software does. But this License is not limited to software manuals;
it can be used for any textual work, regardless of subject matter or
whether it is published as a printed book. We recommend this License
principally for works whose purpose is instruction or reference.
</p>
</li><li> APPLICABILITY AND DEFINITIONS
<p>This License applies to any manual or other work, in any medium, that
contains a notice placed by the copyright holder saying it can be
distributed under the terms of this License. Such a notice grants a
world-wide, royalty-free license, unlimited in duration, to use that
work under the conditions stated herein. The “Document”, below,
refers to any such manual or work. Any member of the public is a
licensee, and is addressed as “you”. You accept the license if you
copy, modify or distribute the work in a way requiring permission
under copyright law.
</p>
<p>A “Modified Version” of the Document means any work containing the
Document or a portion of it, either copied verbatim, or with
modifications and/or translated into another language.
</p>
<p>A “Secondary Section” is a named appendix or a front-matter section
of the Document that deals exclusively with the relationship of the
publishers or authors of the Document to the Document’s overall
subject (or to related matters) and contains nothing that could fall
directly within that overall subject. (Thus, if the Document is in
part a textbook of mathematics, a Secondary Section may not explain
any mathematics.) The relationship could be a matter of historical
connection with the subject or with related matters, or of legal,
commercial, philosophical, ethical or political position regarding
them.
</p>
<p>The “Invariant Sections” are certain Secondary Sections whose titles
are designated, as being those of Invariant Sections, in the notice
that says that the Document is released under this License. If a
section does not fit the above definition of Secondary then it is not
allowed to be designated as Invariant. The Document may contain zero
Invariant Sections. If the Document does not identify any Invariant
Sections then there are none.
</p>
<p>The “Cover Texts” are certain short passages of text that are listed,
as Front-Cover Texts or Back-Cover Texts, in the notice that says that
the Document is released under this License. A Front-Cover Text may
be at most 5 words, and a Back-Cover Text may be at most 25 words.
</p>
<p>A “Transparent” copy of the Document means a machine-readable copy,
represented in a format whose specification is available to the
general public, that is suitable for revising the document
straightforwardly with generic text editors or (for images composed of
pixels) generic paint programs or (for drawings) some widely available
drawing editor, and that is suitable for input to text formatters or
for automatic translation to a variety of formats suitable for input
to text formatters. A copy made in an otherwise Transparent file
format whose markup, or absence of markup, has been arranged to thwart
or discourage subsequent modification by readers is not Transparent.
An image format is not Transparent if used for any substantial amount
of text. A copy that is not “Transparent” is called “Opaque”.
</p>
<p>Examples of suitable formats for Transparent copies include plain
<small>ASCII</small> without markup, Texinfo input format, LaTeX input
format, <acronym>SGML</acronym> or <acronym>XML</acronym> using a publicly available
<acronym>DTD</acronym>, and standard-conforming simple <acronym>HTML</acronym>,
PostScript or <acronym>PDF</acronym> designed for human modification. Examples
of transparent image formats include <acronym>PNG</acronym>, <acronym>XCF</acronym> and
<acronym>JPG</acronym>. Opaque formats include proprietary formats that can be
read and edited only by proprietary word processors, <acronym>SGML</acronym> or
<acronym>XML</acronym> for which the <acronym>DTD</acronym> and/or processing tools are
not generally available, and the machine-generated <acronym>HTML</acronym>,
PostScript or <acronym>PDF</acronym> produced by some word processors for
output purposes only.
</p>
<p>The “Title Page” means, for a printed book, the title page itself,
plus such following pages as are needed to hold, legibly, the material
this License requires to appear in the title page. For works in
formats which do not have any title page as such, “Title Page” means
the text near the most prominent appearance of the work’s title,
preceding the beginning of the body of the text.
</p>
<p>The “publisher” means any person or entity that distributes copies
of the Document to the public.
</p>
<p>A section “Entitled XYZ” means a named subunit of the Document whose
title either is precisely XYZ or contains XYZ in parentheses following
text that translates XYZ in another language. (Here XYZ stands for a
specific section name mentioned below, such as “Acknowledgements”,
“Dedications”, “Endorsements”, or “History”.) To “Preserve the Title”
of such a section when you modify the Document means that it remains a
section “Entitled XYZ” according to this definition.
</p>
<p>The Document may include Warranty Disclaimers next to the notice which
states that this License applies to the Document. These Warranty
Disclaimers are considered to be included by reference in this
License, but only as regards disclaiming warranties: any other
implication that these Warranty Disclaimers may have is void and has
no effect on the meaning of this License.
</p>
</li><li> VERBATIM COPYING
<p>You may copy and distribute the Document in any medium, either
commercially or noncommercially, provided that this License, the
copyright notices, and the license notice saying this License applies
to the Document are reproduced in all copies, and that you add no other
conditions whatsoever to those of this License. You may not use
technical measures to obstruct or control the reading or further
copying of the copies you make or distribute. However, you may accept
compensation in exchange for copies. If you distribute a large enough
number of copies you must also follow the conditions in section 3.
</p>
<p>You may also lend copies, under the same conditions stated above, and
you may publicly display copies.
</p>
</li><li> COPYING IN QUANTITY
<p>If you publish printed copies (or copies in media that commonly have
printed covers) of the Document, numbering more than 100, and the
Document’s license notice requires Cover Texts, you must enclose the
copies in covers that carry, clearly and legibly, all these Cover
Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover. Both covers must also clearly and legibly identify
you as the publisher of these copies. The front cover must present
the full title with all words of the title equally prominent and
visible. You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve
the title of the Document and satisfy these conditions, can be treated
as verbatim copying in other respects.
</p>
<p>If the required texts for either cover are too voluminous to fit
legibly, you should put the first ones listed (as many as fit
reasonably) on the actual cover, and continue the rest onto adjacent
pages.
</p>
<p>If you publish or distribute Opaque copies of the Document numbering
more than 100, you must either include a machine-readable Transparent
copy along with each Opaque copy, or state in or with each Opaque copy
a computer-network location from which the general network-using
public has access to download using public-standard network protocols
a complete Transparent copy of the Document, free of added material.
If you use the latter option, you must take reasonably prudent steps,
when you begin distribution of Opaque copies in quantity, to ensure
that this Transparent copy will remain thus accessible at the stated
location until at least one year after the last time you distribute an
Opaque copy (directly or through your agents or retailers) of that
edition to the public.
</p>
<p>It is requested, but not required, that you contact the authors of the
Document well before redistributing any large number of copies, to give
them a chance to provide you with an updated version of the Document.
</p>
</li><li> MODIFICATIONS
<p>You may copy and distribute a Modified Version of the Document under
the conditions of sections 2 and 3 above, provided that you release
the Modified Version under precisely this License, with the Modified
Version filling the role of the Document, thus licensing distribution
and modification of the Modified Version to whoever possesses a copy
of it. In addition, you must do these things in the Modified Version:
</p>
<ol>
<li> Use in the Title Page (and on the covers, if any) a title distinct
from that of the Document, and from those of previous versions
(which should, if there were any, be listed in the History section
of the Document). You may use the same title as a previous version
if the original publisher of that version gives permission.
</li><li> List on the Title Page, as authors, one or more persons or entities
responsible for authorship of the modifications in the Modified
Version, together with at least five of the principal authors of the
Document (all of its principal authors, if it has fewer than five),
unless they release you from this requirement.
</li><li> State on the Title page the name of the publisher of the
Modified Version, as the publisher.
</li><li> Preserve all the copyright notices of the Document.
</li><li> Add an appropriate copyright notice for your modifications
adjacent to the other copyright notices.
</li><li> Include, immediately after the copyright notices, a license notice
giving the public permission to use the Modified Version under the
terms of this License, in the form shown in the Addendum below.
</li><li> Preserve in that license notice the full lists of Invariant Sections
and required Cover Texts given in the Document’s license notice.
</li><li> Include an unaltered copy of this License.
</li><li> Preserve the section Entitled “History”, Preserve its Title, and add
to it an item stating at least the title, year, new authors, and
publisher of the Modified Version as given on the Title Page. If
there is no section Entitled “History” in the Document, create one
stating the title, year, authors, and publisher of the Document as
given on its Title Page, then add an item describing the Modified
Version as stated in the previous sentence.
</li><li> Preserve the network location, if any, given in the Document for
public access to a Transparent copy of the Document, and likewise
the network locations given in the Document for previous versions
it was based on. These may be placed in the “History” section.
You may omit a network location for a work that was published at
least four years before the Document itself, or if the original
publisher of the version it refers to gives permission.
</li><li> For any section Entitled “Acknowledgements” or “Dedications”, Preserve
the Title of the section, and preserve in the section all the
substance and tone of each of the contributor acknowledgements and/or
dedications given therein.
</li><li> Preserve all the Invariant Sections of the Document,
unaltered in their text and in their titles. Section numbers
or the equivalent are not considered part of the section titles.
</li><li> Delete any section Entitled “Endorsements”. Such a section
may not be included in the Modified Version.
</li><li> Do not retitle any existing section to be Entitled “Endorsements” or
to conflict in title with any Invariant Section.
</li><li> Preserve any Warranty Disclaimers.
</li></ol>
<p>If the Modified Version includes new front-matter sections or
appendices that qualify as Secondary Sections and contain no material
copied from the Document, you may at your option designate some or all
of these sections as invariant. To do this, add their titles to the
list of Invariant Sections in the Modified Version’s license notice.
These titles must be distinct from any other section titles.
</p>
<p>You may add a section Entitled “Endorsements”, provided it contains
nothing but endorsements of your Modified Version by various
parties—for example, statements of peer review or that the text has
been approved by an organization as the authoritative definition of a
standard.
</p>
<p>You may add a passage of up to five words as a Front-Cover Text, and a
passage of up to 25 words as a Back-Cover Text, to the end of the list
of Cover Texts in the Modified Version. Only one passage of
Front-Cover Text and one of Back-Cover Text may be added by (or
through arrangements made by) any one entity. If the Document already
includes a cover text for the same cover, previously added by you or
by arrangement made by the same entity you are acting on behalf of,
you may not add another; but you may replace the old one, on explicit
permission from the previous publisher that added the old one.
</p>
<p>The author(s) and publisher(s) of the Document do not by this License
give permission to use their names for publicity for or to assert or
imply endorsement of any Modified Version.
</p>
</li><li> COMBINING DOCUMENTS
<p>You may combine the Document with other documents released under this
License, under the terms defined in section 4 above for modified
versions, provided that you include in the combination all of the
Invariant Sections of all of the original documents, unmodified, and
list them all as Invariant Sections of your combined work in its
license notice, and that you preserve all their Warranty Disclaimers.
</p>
<p>The combined work need only contain one copy of this License, and
multiple identical Invariant Sections may be replaced with a single
copy. If there are multiple Invariant Sections with the same name but
different contents, make the title of each such section unique by
adding at the end of it, in parentheses, the name of the original
author or publisher of that section if known, or else a unique number.
Make the same adjustment to the section titles in the list of
Invariant Sections in the license notice of the combined work.
</p>
<p>In the combination, you must combine any sections Entitled “History”
in the various original documents, forming one section Entitled
“History”; likewise combine any sections Entitled “Acknowledgements”,
and any sections Entitled “Dedications”. You must delete all
sections Entitled “Endorsements.”
</p>
</li><li> COLLECTIONS OF DOCUMENTS
<p>You may make a collection consisting of the Document and other documents
released under this License, and replace the individual copies of this
License in the various documents with a single copy that is included in
the collection, provided that you follow the rules of this License for
verbatim copying of each of the documents in all other respects.
</p>
<p>You may extract a single document from such a collection, and distribute
it individually under this License, provided you insert a copy of this
License into the extracted document, and follow this License in all
other respects regarding verbatim copying of that document.
</p>
</li><li> AGGREGATION WITH INDEPENDENT WORKS
<p>A compilation of the Document or its derivatives with other separate
and independent documents or works, in or on a volume of a storage or
distribution medium, is called an “aggregate” if the copyright
resulting from the compilation is not used to limit the legal rights
of the compilation’s users beyond what the individual works permit.
When the Document is included in an aggregate, this License does not
apply to the other works in the aggregate which are not themselves
derivative works of the Document.
</p>
<p>If the Cover Text requirement of section 3 is applicable to these
copies of the Document, then if the Document is less than one half of
the entire aggregate, the Document’s Cover Texts may be placed on
covers that bracket the Document within the aggregate, or the
electronic equivalent of covers if the Document is in electronic form.
Otherwise they must appear on printed covers that bracket the whole
aggregate.
</p>
</li><li> TRANSLATION
<p>Translation is considered a kind of modification, so you may
distribute translations of the Document under the terms of section 4.
Replacing Invariant Sections with translations requires special
permission from their copyright holders, but you may include
translations of some or all Invariant Sections in addition to the
original versions of these Invariant Sections. You may include a
translation of this License, and all the license notices in the
Document, and any Warranty Disclaimers, provided that you also include
the original English version of this License and the original versions
of those notices and disclaimers. In case of a disagreement between
the translation and the original version of this License or a notice
or disclaimer, the original version will prevail.
</p>
<p>If a section in the Document is Entitled “Acknowledgements”,
“Dedications”, or “History”, the requirement (section 4) to Preserve
its Title (section 1) will typically require changing the actual
title.
</p>
</li><li> TERMINATION
<p>You may not copy, modify, sublicense, or distribute the Document
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense, or distribute it is void, and
will automatically terminate your rights under this License.
</p>
<p>However, if you cease all violation of this License, then your license
from a particular copyright holder is reinstated (a) provisionally,
unless and until the copyright holder explicitly and finally
terminates your license, and (b) permanently, if the copyright holder
fails to notify you of the violation by some reasonable means prior to
60 days after the cessation.
</p>
<p>Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
</p>
<p>Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, receipt of a copy of some or all of the same material does
not give you any rights to use it.
</p>
</li><li> FUTURE REVISIONS OF THIS LICENSE
<p>The Free Software Foundation may publish new, revised versions
of the GNU Free Documentation License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns. See
<a href="http://www.gnu.org/copyleft/">http://www.gnu.org/copyleft/</a>.
</p>
<p>Each version of the License is given a distinguishing version number.
If the Document specifies that a particular numbered version of this
License “or any later version” applies to it, you have the option of
following the terms and conditions either of that specified version or
of any later version that has been published (not as a draft) by the
Free Software Foundation. If the Document does not specify a version
number of this License, you may choose any version ever published (not
as a draft) by the Free Software Foundation. If the Document
specifies that a proxy can decide which future versions of this
License can be used, that proxy’s public statement of acceptance of a
version permanently authorizes you to choose that version for the
Document.
</p>
</li><li> RELICENSING
<p>“Massive Multiauthor Collaboration Site” (or “MMC Site”) means any
World Wide Web server that publishes copyrightable works and also
provides prominent facilities for anybody to edit those works. A
public wiki that anybody can edit is an example of such a server. A
“Massive Multiauthor Collaboration” (or “MMC”) contained in the
site means any set of copyrightable works thus published on the MMC
site.
</p>
<p>“CC-BY-SA” means the Creative Commons Attribution-Share Alike 3.0
license published by Creative Commons Corporation, a not-for-profit
corporation with a principal place of business in San Francisco,
California, as well as future copyleft versions of that license
published by that same organization.
</p>
<p>“Incorporate” means to publish or republish a Document, in whole or
in part, as part of another Document.
</p>
<p>An MMC is “eligible for relicensing” if it is licensed under this
License, and if all works that were first published under this License
somewhere other than this MMC, and subsequently incorporated in whole
or in part into the MMC, (1) had no cover texts or invariant sections,
and (2) were thus incorporated prior to November 1, 2008.
</p>
<p>The operator of an MMC Site may republish an MMC contained in the site
under CC-BY-SA on the same site at any time before August 1, 2009,
provided the MMC is eligible for relicensing.
</p>
</li></ol>
<a name="ADDENDUM_003a-How-to-use-this-License-for-your-documents"></a>
<h3 class="unnumberedsec">ADDENDUM: How to use this License for your documents</h3>
<p>To use this License in a document you have written, include a copy of
the License in the document and put the following copyright and
license notices just after the title page:
</p>
<div class="smallexample">
<pre class="smallexample"> Copyright (C) <var>year</var> <var>your name</var>.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.3
or any later version published by the Free Software Foundation;
with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
Texts. A copy of the license is included in the section entitled ``GNU
Free Documentation License''.
</pre></div>
<p>If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
replace the “with...Texts.” line with this:
</p>
<div class="smallexample">
<pre class="smallexample"> with the Invariant Sections being <var>list their titles</var>, with
the Front-Cover Texts being <var>list</var>, and with the Back-Cover Texts
being <var>list</var>.
</pre></div>
<p>If you have Invariant Sections without Cover Texts, or some other
combination of the three, merge those two alternatives to suit the
situation.
</p>
<p>If your document contains nontrivial examples of program code, we
recommend releasing these examples in parallel under your choice of
free software license, such as the GNU General Public License,
to permit their use in free software.
</p>
<hr>
<a name="Index"></a>
<div class="header">
<p>
Previous: <a href="#GNU-Free-Documentation-License" accesskey="p" rel="prev">GNU Free Documentation License</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Index-1"></a>
<h2 class="unnumbered">Index</h2>
<table><tr><th valign="top">Jump to: </th><td><a class="summary-letter" href="#Index_cp_symbol-1"><b>-</b></a>
<a class="summary-letter" href="#Index_cp_symbol-2"><b>_</b></a>
<br>
<a class="summary-letter" href="#Index_cp_letter-A"><b>A</b></a>
<a class="summary-letter" href="#Index_cp_letter-B"><b>B</b></a>
<a class="summary-letter" href="#Index_cp_letter-C"><b>C</b></a>
<a class="summary-letter" href="#Index_cp_letter-D"><b>D</b></a>
<a class="summary-letter" href="#Index_cp_letter-E"><b>E</b></a>
<a class="summary-letter" href="#Index_cp_letter-F"><b>F</b></a>
<a class="summary-letter" href="#Index_cp_letter-G"><b>G</b></a>
<a class="summary-letter" href="#Index_cp_letter-H"><b>H</b></a>
<a class="summary-letter" href="#Index_cp_letter-I"><b>I</b></a>
<a class="summary-letter" href="#Index_cp_letter-K"><b>K</b></a>
<a class="summary-letter" href="#Index_cp_letter-L"><b>L</b></a>
<a class="summary-letter" href="#Index_cp_letter-M"><b>M</b></a>
<a class="summary-letter" href="#Index_cp_letter-N"><b>N</b></a>
<a class="summary-letter" href="#Index_cp_letter-O"><b>O</b></a>
<a class="summary-letter" href="#Index_cp_letter-P"><b>P</b></a>
<a class="summary-letter" href="#Index_cp_letter-R"><b>R</b></a>
<a class="summary-letter" href="#Index_cp_letter-S"><b>S</b></a>
<a class="summary-letter" href="#Index_cp_letter-T"><b>T</b></a>
<a class="summary-letter" href="#Index_cp_letter-U"><b>U</b></a>
<a class="summary-letter" href="#Index_cp_letter-V"><b>V</b></a>
<a class="summary-letter" href="#Index_cp_letter-W"><b>W</b></a>
<a class="summary-letter" href="#Index_cp_letter-X"><b>X</b></a>
<a class="summary-letter" href="#Index_cp_letter-Z"><b>Z</b></a>
</td></tr></table>
<table class="index-cp" border="0">
<tr><td></td><th align="left">Index Entry</th><td> </td><th align="left"> Section</th></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_symbol-1">-</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-_002dgnat12-option"><samp>-gnat12</samp> option</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-_002dgnatR-switch"><samp>-gnatR</samp> switch</a>:</td><td> </td><td valign="top"><a href="#Determining-the-Representations-chosen-by-GNAT">Determining the Representations chosen by GNAT</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_symbol-2">_</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-_005f_005f_005flock-file-_0028for-shared-passive-packages_0029"><samp>___lock</samp> file (for shared passive packages)</a>:</td><td> </td><td valign="top"><a href="#GNAT-Implementation-of-Shared-Passive-Packages">GNAT Implementation of Shared Passive Packages</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-A">A</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Abort_005fDefer"><code>Abort_Defer</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Abort_005fDefer">Pragma Abort_Defer</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Abort_005fSignal"><code>Abort_Signal</code></a>:</td><td> </td><td valign="top"><a href="#Abort_005fSignal">Abort_Signal</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Access-values_002c-testing-for">Access values, testing for</a>:</td><td> </td><td valign="top"><a href="#Has_005fAccess_005fValues">Has_Access_Values</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Access_002c-unrestricted"><code>Access</code>, unrestricted</a>:</td><td> </td><td valign="top"><a href="#Unrestricted_005fAccess">Unrestricted_Access</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Accuracy-requirements">Accuracy requirements</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Accuracy_002c-complex-arithmetic">Accuracy, complex arithmetic</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-2005-Language-Reference-Manual">Ada 2005 Language Reference Manual</a>:</td><td> </td><td valign="top"><a href="#What-This-Reference-Manual-Contains">What This Reference Manual Contains</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-2012-implementation-status">Ada 2012 implementation status</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-83-attributes">Ada 83 attributes</a>:</td><td> </td><td valign="top"><a href="#Emax">Emax</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-83-attributes-1">Ada 83 attributes</a>:</td><td> </td><td valign="top"><a href="#Epsilon">Epsilon</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-83-attributes-2">Ada 83 attributes</a>:</td><td> </td><td valign="top"><a href="#Large">Large</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-83-attributes-3">Ada 83 attributes</a>:</td><td> </td><td valign="top"><a href="#Mantissa">Mantissa</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-83-attributes-4">Ada 83 attributes</a>:</td><td> </td><td valign="top"><a href="#Safe_005fEmax">Safe_Emax</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-83-attributes-5">Ada 83 attributes</a>:</td><td> </td><td valign="top"><a href="#Safe_005fLarge">Safe_Large</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-83-attributes-6">Ada 83 attributes</a>:</td><td> </td><td valign="top"><a href="#Small">Small</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-95-Language-Reference-Manual">Ada 95 Language Reference Manual</a>:</td><td> </td><td valign="top"><a href="#What-This-Reference-Manual-Contains">What This Reference Manual Contains</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada-Extensions">Ada Extensions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Extensions_005fAllowed">Pragma Extensions_Allowed</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCharacters_002eHandling"><code>Ada.Characters.Handling</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029"><code>Ada.Characters.Latin_9</code> (<samp>a-chlat9.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029">Ada.Characters.Latin_9 (a-chlat9.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029"><code>Ada.Characters.Wide_Latin_1</code> (<samp>a-cwila1.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029">Ada.Characters.Wide_Latin_1 (a-cwila1.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila1_002eads_0029"><code>Ada.Characters.Wide_Latin_9</code> (<samp>a-cwila1.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029">Ada.Characters.Wide_Latin_9 (a-cwila9.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029"><code>Ada.Characters.Wide_Wide_Latin_1</code> (<samp>a-chzla1.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029">Ada.Characters.Wide_Wide_Latin_1 (a-chzla1.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029"><code>Ada.Characters.Wide_Wide_Latin_9</code> (<samp>a-chzla9.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029">Ada.Characters.Wide_Wide_Latin_9 (a-chzla9.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029"><code>Ada.Command_Line.Environment</code> (<samp>a-colien.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029">Ada.Command_Line.Environment (a-colien.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029"><code>Ada.Command_Line.Remove</code> (<samp>a-colire.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029">Ada.Command_Line.Remove (a-colire.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029"><code>Ada.Command_Line.Response_File</code> (<samp>a-clrefi.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029">Ada.Command_Line.Response_File (a-clrefi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029"><code>Ada.Containers.Formal_Doubly_Linked_Lists</code> (<samp>a-cfdlli.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029">Ada.Containers.Formal_Doubly_Linked_Lists (a-cfdlli.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029"><code>Ada.Containers.Formal_Hashed_Maps</code> (<samp>a-cfhama.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029">Ada.Containers.Formal_Hashed_Maps (a-cfhama.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029"><code>Ada.Containers.Formal_Hashed_Sets</code> (<samp>a-cfhase.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029">Ada.Containers.Formal_Hashed_Sets (a-cfhase.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029"><code>Ada.Containers.Formal_Ordered_Maps</code> (<samp>a-cforma.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029">Ada.Containers.Formal_Ordered_Maps (a-cforma.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029"><code>Ada.Containers.Formal_Ordered_Sets</code> (<samp>a-cforse.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029">Ada.Containers.Formal_Ordered_Sets (a-cforse.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029"><code>Ada.Containers.Formal_Vectors</code> (<samp>a-cofove.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029">Ada.Containers.Formal_Vectors (a-cofove.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029"><code>Ada.Direct_IO.C_Streams</code> (<samp>a-diocst.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029">Ada.Direct_IO.C_Streams (a-diocst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029"><code>Ada.Exceptions.Is_Null_Occurrence</code> (<samp>a-einuoc.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029">Ada.Exceptions.Is_Null_Occurrence (a-einuoc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029"><code>Ada.Exceptions.Last_Chance_Handler</code> (<samp>a-elchha.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029">Ada.Exceptions.Last_Chance_Handler (a-elchha.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029"><code>Ada.Exceptions.Traceback</code> (<samp>a-exctra.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029">Ada.Exceptions.Traceback (a-exctra.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029"><code>Ada.Sequential_IO.C_Streams</code> (<samp>a-siocst.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029">Ada.Sequential_IO.C_Streams (a-siocst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029"><code>Ada.Streams.Stream_IO.C_Streams</code> (<samp>a-ssicst.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029">Ada.Streams.Stream_IO.C_Streams (a-ssicst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029"><code>Ada.Strings.Unbounded.Text_IO</code> (<samp>a-suteio.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029">Ada.Strings.Unbounded.Text_IO (a-suteio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029"><code>Ada.Strings.Wide_Unbounded.Wide_Text_IO</code> (<samp>a-swuwti.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029">Ada.Strings.Wide_Unbounded.Wide_Text_IO (a-swuwti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029"><code>Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO</code> (<samp>a-szuzti.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029">Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO (a-szuzti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029"><code>Ada.Text_IO.C_Streams</code> (<samp>a-tiocst.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029">Ada.Text_IO.C_Streams (a-tiocst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029"><code>Ada.Text_IO.Reset_Standard_Files</code> (<samp>a-tirsfi.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029">Ada.Text_IO.Reset_Standard_Files (a-tirsfi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029"><code>Ada.Wide_Characters.Unicode</code> (<samp>a-wichun.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029">Ada.Wide_Characters.Unicode (a-wichun.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029"><code>Ada.Wide_Text_IO.C_Streams</code> (<samp>a-wtcstr.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029">Ada.Wide_Text_IO.C_Streams (a-wtcstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029"><code>Ada.Wide_Text_IO.Reset_Standard_Files</code> (<samp>a-wrstfi.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029">Ada.Wide_Text_IO.Reset_Standard_Files (a-wrstfi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029"><code>Ada.Wide_Wide_Characters.Unicode</code> (<samp>a-zchuni.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029">Ada.Wide_Wide_Characters.Unicode (a-zchuni.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029"><code>Ada.Wide_Wide_Text_IO.C_Streams</code> (<samp>a-ztcstr.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029">Ada.Wide_Wide_Text_IO.C_Streams (a-ztcstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029"><code>Ada.Wide_Wide_Text_IO.Reset_Standard_Files</code> (<samp>a-zrstfi.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029">Ada.Wide_Wide_Text_IO.Reset_Standard_Files (a-zrstfi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_005f05"><code>Ada_05</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ada_005f05">Pragma Ada_05</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_005f12"><code>Ada_12</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ada_005f12">Pragma Ada_12</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_005f2005"><code>Ada_2005</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ada_005f2005">Pragma Ada_2005</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_005f2005-1"><code>Ada_2005</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ada_005f2012">Pragma Ada_2012</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_005f2012-configuration-pragma"><code>Ada_2012</code> configuration pragma</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_005f83"><code>Ada_83</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ada_005f83">Pragma Ada_83</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ada_005f95"><code>Ada_95</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ada_005f95">Pragma Ada_95</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Address-Clause">Address Clause</a>:</td><td> </td><td valign="top"><a href="#Address-Clauses">Address Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Address-clauses"><code>Address</code> clauses</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Address-image">Address image</a>:</td><td> </td><td valign="top"><a href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029">System.Address_Image (s-addima.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Address-of-subprogram-code">Address of subprogram code</a>:</td><td> </td><td valign="top"><a href="#Code_005fAddress">Code_Address</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Address_002c-as-private-type"><code>Address</code>, as private type</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Address_002c-operations-of"><code>Address</code>, operations of</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Address_005fSize"><code>Address_Size</code></a>:</td><td> </td><td valign="top"><a href="#Address_005fSize">Address_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0002-_0028Ada-2012-feature_0029">AI-0002 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0003-_0028Ada-2012-feature_0029">AI-0003 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0007-_0028Ada-2012-feature_0029">AI-0007 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0008-_0028Ada-2012-feature_0029">AI-0008 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0009-_0028Ada-2012-feature_0029">AI-0009 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0012-_0028Ada-2012-feature_0029">AI-0012 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0015-_0028Ada-2012-feature_0029">AI-0015 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0017-_0028Ada-2012-feature_0029">AI-0017 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0019-_0028Ada-2012-feature_0029">AI-0019 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0026-_0028Ada-2012-feature_0029">AI-0026 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0030-_0028Ada-2012-feature_0029">AI-0030 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0031-_0028Ada-2012-feature_0029">AI-0031 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0032-_0028Ada-2012-feature_0029">AI-0032 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0033-_0028Ada-2012-feature_0029">AI-0033 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0034-_0028Ada-2012-feature_0029">AI-0034 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0035-_0028Ada-2012-feature_0029">AI-0035 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0037-_0028Ada-2012-feature_0029">AI-0037 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0038-_0028Ada-2012-feature_0029">AI-0038 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0039-_0028Ada-2012-feature_0029">AI-0039 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0040-_0028Ada-2012-feature_0029">AI-0040 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0042-_0028Ada-2012-feature_0029">AI-0042 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0043-_0028Ada-2012-feature_0029">AI-0043 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0044-_0028Ada-2012-feature_0029">AI-0044 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0046-_0028Ada-2012-feature_0029">AI-0046 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0050-_0028Ada-2012-feature_0029">AI-0050 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0056-_0028Ada-2012-feature_0029">AI-0056 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0058-_0028Ada-2012-feature_0029">AI-0058 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0060-_0028Ada-2012-feature_0029">AI-0060 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0062-_0028Ada-2012-feature_0029">AI-0062 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0064-_0028Ada-2012-feature_0029">AI-0064 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0065-_0028Ada-2012-feature_0029">AI-0065 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0070-_0028Ada-2012-feature_0029">AI-0070 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0072-_0028Ada-2012-feature_0029">AI-0072 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0073-_0028Ada-2012-feature_0029">AI-0073 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0076-_0028Ada-2012-feature_0029">AI-0076 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0077-_0028Ada-2012-feature_0029">AI-0077 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0078-_0028Ada-2012-feature_0029">AI-0078 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0079-_0028Ada-2012-feature_0029">AI-0079 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0080-_0028Ada-2012-feature_0029">AI-0080 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0087-_0028Ada-2012-feature_0029">AI-0087 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0088-_0028Ada-2012-feature_0029">AI-0088 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0091-_0028Ada-2012-feature_0029">AI-0091 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0093-_0028Ada-2012-feature_0029">AI-0093 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0095-_0028Ada-2012-feature_0029">AI-0095 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0096-_0028Ada-2012-feature_0029">AI-0096 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0097-_0028Ada-2012-feature_0029">AI-0097 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0098-_0028Ada-2012-feature_0029">AI-0098 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0099-_0028Ada-2012-feature_0029">AI-0099 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0100-_0028Ada-2012-feature_0029">AI-0100 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0102-_0028Ada-2012-feature_0029">AI-0102 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0103-_0028Ada-2012-feature_0029">AI-0103 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0104-_0028Ada-2012-feature_0029">AI-0104 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0106-_0028Ada-2012-feature_0029">AI-0106 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0108-_0028Ada-2012-feature_0029">AI-0108 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0109-_0028Ada-2012-feature_0029">AI-0109 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0112-_0028Ada-2012-feature_0029">AI-0112 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0114-_0028Ada-2012-feature_0029">AI-0114 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0116-_0028Ada-2012-feature_0029">AI-0116 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0118-_0028Ada-2012-feature_0029">AI-0118 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0120-_0028Ada-2012-feature_0029">AI-0120 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0122-_0028Ada-2012-feature_0029">AI-0122 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0123-_0028Ada-2012-feature_0029">AI-0123 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0125-_0028Ada-2012-feature_0029">AI-0125 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0126-_0028Ada-2012-feature_0029">AI-0126 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0127-_0028Ada-2012-feature_0029">AI-0127 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0128-_0028Ada-2012-feature_0029">AI-0128 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0129-_0028Ada-2012-feature_0029">AI-0129 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0132-_0028Ada-2012-feature_0029">AI-0132 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0134-_0028Ada-2012-feature_0029">AI-0134 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0137-_0028Ada-2012-feature_0029">AI-0137 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0146-_0028Ada-2012-feature_0029">AI-0146 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0147-_0028Ada-2012-feature_0029">AI-0147 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0152-_0028Ada-2012-feature_0029">AI-0152 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0157-_0028Ada-2012-feature_0029">AI-0157 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0158-_0028Ada-2012-feature_0029">AI-0158 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0161-_0028Ada-2012-feature_0029">AI-0161 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0162-_0028Ada-2012-feature_0029">AI-0162 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0163-_0028Ada-2012-feature_0029">AI-0163 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0171-_0028Ada-2012-feature_0029">AI-0171 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0173-_0028Ada-2012-feature_0029">AI-0173 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0176-_0028Ada-2012-feature_0029">AI-0176 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0177-_0028Ada-2012-feature_0029">AI-0177 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0178-_0028Ada-2012-feature_0029">AI-0178 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0179-_0028Ada-2012-feature_0029">AI-0179 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0181-_0028Ada-2012-feature_0029">AI-0181 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0182-_0028Ada-2012-feature_0029">AI-0182 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0183-_0028Ada-2012-feature_0029">AI-0183 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0185-_0028Ada-2012-feature_0029">AI-0185 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0188-_0028Ada-2012-feature_0029">AI-0188 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0189-_0028Ada-2012-feature_0029">AI-0189 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0190-_0028Ada-2012-feature_0029">AI-0190 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0193-_0028Ada-2012-feature_0029">AI-0193 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0194-_0028Ada-2012-feature_0029">AI-0194 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0195-_0028Ada-2012-feature_0029">AI-0195 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0196-_0028Ada-2012-feature_0029">AI-0196 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0198-_0028Ada-2012-feature_0029">AI-0198 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0199-_0028Ada-2012-feature_0029">AI-0199 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0200-_0028Ada-2012-feature_0029">AI-0200 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0201-_0028Ada-2012-feature_0029">AI-0201 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0203-_0028Ada-2012-feature_0029">AI-0203 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0205-_0028Ada-2012-feature_0029">AI-0205 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0206-_0028Ada-2012-feature_0029">AI-0206 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0207-_0028Ada-2012-feature_0029">AI-0207 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0208-_0028Ada-2012-feature_0029">AI-0208 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0210-_0028Ada-2012-feature_0029">AI-0210 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0211-_0028Ada-2012-feature_0029">AI-0211 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0214-_0028Ada-2012-feature_0029">AI-0214 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0219-_0028Ada-2012-feature_0029">AI-0219 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d0220-_0028Ada-2012-feature_0029">AI-0220 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI_002d139_002d2-_0028Ada-2012-feature_0029">AI-139-2 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AI05_002d0216-_0028Ada-2012-feature_0029">AI05-0216 (Ada 2012 feature)</a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignment-Clause">Alignment Clause</a>:</td><td> </td><td valign="top"><a href="#Alignment-Clauses">Alignment Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignment-clauses"><code>Alignment</code> clauses</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignment_002c-allocator">Alignment, allocator</a>:</td><td> </td><td valign="top"><a href="#System_005fAllocator_005fAlignment">System_Allocator_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignment_002c-default">Alignment, default</a>:</td><td> </td><td valign="top"><a href="#Alignment-Clauses">Alignment Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignment_002c-default-settings">Alignment, default settings</a>:</td><td> </td><td valign="top"><a href="#Pragma-Optimize_005fAlignment">Pragma Optimize_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignment_002c-maximum">Alignment, maximum</a>:</td><td> </td><td valign="top"><a href="#Maximum_005fAlignment">Maximum_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignment_002c-subtypes">Alignment, subtypes</a>:</td><td> </td><td valign="top"><a href="#Alignment-Clauses">Alignment Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alignments-of-components">Alignments of components</a>:</td><td> </td><td valign="top"><a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Alternative-Character-Sets">Alternative Character Sets</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AltiVec">AltiVec</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec-_0028g_002daltive_002eads_0029">GNAT.Altivec (g-altive.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AltiVec-1">AltiVec</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029">GNAT.Altivec.Conversions (g-altcon.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AltiVec-2">AltiVec</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029">GNAT.Altivec.Vector_Operations (g-alveop.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AltiVec-3">AltiVec</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029">GNAT.Altivec.Vector_Types (g-alvety.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AltiVec-4">AltiVec</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029">GNAT.Altivec.Vector_Views (g-alvevi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Annex-E">Annex E</a>:</td><td> </td><td valign="top"><a href="#GNAT-Implementation-of-Shared-Passive-Packages">GNAT Implementation of Shared Passive Packages</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Annotate"><code>Annotate</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Annotate">Pragma Annotate</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Argument-passing-mechanisms">Argument passing mechanisms</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fFunction">Pragma Export_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Array-packing">Array packing</a>:</td><td> </td><td valign="top"><a href="#Pragma-Implicit_005fPacking">Pragma Implicit_Packing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Array-splitter">Array splitter</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029">GNAT.Array_Split (g-arrspl.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Arrays_002c-extendable">Arrays, extendable</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029">GNAT.Dynamic_Tables (g-dyntab.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Arrays_002c-extendable-1">Arrays, extendable</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTable-_0028g_002dtable_002eads_0029">GNAT.Table (g-table.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Arrays_002c-multidimensional">Arrays, multidimensional</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Asm_005fInput"><code>Asm_Input</code></a>:</td><td> </td><td valign="top"><a href="#Asm_005fInput">Asm_Input</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Asm_005fOutput"><code>Asm_Output</code></a>:</td><td> </td><td valign="top"><a href="#Asm_005fOutput">Asm_Output</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Assert"><code>Assert</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Assert">Pragma Assert</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Assertions">Assertions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check">Pragma Check</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Assertions-1">Assertions</a>:</td><td> </td><td valign="top"><a href="#System_002eAssertions-_0028s_002dassert_002eads_0029">System.Assertions (s-assert.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Assertions_002c-control">Assertions, control</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Assert_005fFailure_002c-exception">Assert_Failure, exception</a>:</td><td> </td><td valign="top"><a href="#System_002eAssertions-_0028s_002dassert_002eads_0029">System.Assertions (s-assert.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Assume_005fNo_005fInvalid_005fValues"><code>Assume_No_Invalid_Values</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Assume_005fNo_005fInvalid_005fValues">Pragma Assume_No_Invalid_Values</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ast_005fEntry"><code>Ast_Entry</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ast_005fEntry">Pragma Ast_Entry</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AST_005fEntry"><code>AST_Entry</code></a>:</td><td> </td><td valign="top"><a href="#AST_005fEntry">AST_Entry</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Attribute"><code>Attribute</code></a>:</td><td> </td><td valign="top"><a href="#Address-Clauses">Address Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Attribute_005fDefinition"><code>Attribute_Definition</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Attribute_005fDefinition">Pragma Attribute_Definition</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AWK">AWK</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029">GNAT.AWK (g-awk.ads)</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-B">B</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Biased-representation">Biased representation</a>:</td><td> </td><td valign="top"><a href="#Biased-Representation">Biased Representation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Big-endian">Big endian</a>:</td><td> </td><td valign="top"><a href="#Default_005fBit_005fOrder">Default_Bit_Order</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bit"><code>Bit</code></a>:</td><td> </td><td valign="top"><a href="#Bit">Bit</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bit-ordering">Bit ordering</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bit-ordering">bit ordering</a>:</td><td> </td><td valign="top"><a href="#Bit_005fOrder-Clauses">Bit_Order Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bit_005fOrder-Clause">Bit_Order Clause</a>:</td><td> </td><td valign="top"><a href="#Bit_005fOrder-Clauses">Bit_Order Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bit_005fPosition"><code>Bit_Position</code></a>:</td><td> </td><td valign="top"><a href="#Bit_005fPosition">Bit_Position</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bounded-Buffers">Bounded Buffers</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029">GNAT.Bounded_Buffers (g-boubuf.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bounded-errors">Bounded errors</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bounded_002dlength-strings">Bounded-length strings</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bubble-sort">Bubble sort</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029">GNAT.Bubble_Sort (g-bubsor.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bubble-sort-1">Bubble sort</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029">GNAT.Bubble_Sort_A (g-busora.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bubble-sort-2">Bubble sort</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029">GNAT.Bubble_Sort_G (g-busorg.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-byte-ordering">byte ordering</a>:</td><td> </td><td valign="top"><a href="#Effect-of-Bit_005fOrder-on-Byte-Ordering">Effect of Bit_Order on Byte Ordering</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Byte-swapping">Byte swapping</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029">GNAT.Byte_Swapping (g-bytswa.ads)</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-C">C</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-C-streams_002c-interfacing">C streams, interfacing</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029">Interfaces.C.Streams (i-cstrea.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C-Streams_002c-Interfacing-with-Direct_005fIO">C Streams, Interfacing with Direct_IO</a>:</td><td> </td><td valign="top"><a href="#Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029">Ada.Direct_IO.C_Streams (a-diocst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C-Streams_002c-Interfacing-with-Sequential_005fIO">C Streams, Interfacing with Sequential_IO</a>:</td><td> </td><td valign="top"><a href="#Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029">Ada.Sequential_IO.C_Streams (a-siocst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C-Streams_002c-Interfacing-with-Stream_005fIO">C Streams, Interfacing with Stream_IO</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029">Ada.Streams.Stream_IO.C_Streams (a-ssicst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C-Streams_002c-Interfacing-with-Text_005fIO">C Streams, Interfacing with <code>Text_IO</code></a>:</td><td> </td><td valign="top"><a href="#Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029">Ada.Text_IO.C_Streams (a-tiocst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C-Streams_002c-Interfacing-with-Wide_005fText_005fIO">C Streams, Interfacing with <code>Wide_Text_IO</code></a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029">Ada.Wide_Text_IO.C_Streams (a-wtcstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C-Streams_002c-Interfacing-with-Wide_005fWide_005fText_005fIO">C Streams, Interfacing with <code>Wide_Wide_Text_IO</code></a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029">Ada.Wide_Wide_Text_IO.C_Streams (a-ztcstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_002b_002b-interfacing">C++ interfacing</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029">Interfaces.CPP (i-cpp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_002c-interfacing-with">C, interfacing with</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Calendar"><code>Calendar</code></a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCalendar-_0028g_002dcalend_002eads_0029">GNAT.Calendar (g-calend.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Calendar-1"><code>Calendar</code></a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029">GNAT.Calendar.Time_IO (g-catiio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Casing-of-External-names">Casing of External names</a>:</td><td> </td><td valign="top"><a href="#Pragma-External_005fName_005fCasing">Pragma External_Name_Casing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Casing-utilities">Casing utilities</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029">GNAT.Case_Util (g-casuti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CGI-_0028Common-Gateway-Interface_0029">CGI (Common Gateway Interface)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCGI-_0028g_002dcgi_002eads_0029">GNAT.CGI (g-cgi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CGI-_0028Common-Gateway-Interface_0029-cookie-support">CGI (Common Gateway Interface) cookie support</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029">GNAT.CGI.Cookie (g-cgicoo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CGI-_0028Common-Gateway-Interface_0029-debugging">CGI (Common Gateway Interface) debugging</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029">GNAT.CGI.Debug (g-cgideb.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Character-handling-_0028GNAT_002eCase_005fUtil_0029">Character handling (<code>GNAT.Case_Util</code>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029">GNAT.Case_Util (g-casuti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Character-Sets">Character Sets</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Check"><code>Check</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Check">Pragma Check</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Check-1"><code>Check</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Check-names_002c-defining">Check names, defining</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fName">Pragma Check_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Check-pragma-control">Check pragma control</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Checks_002c-postconditions">Checks, postconditions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Postcondition">Pragma Postcondition</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Checks_002c-preconditions">Checks, preconditions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Precondition">Pragma Precondition</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Checks_002c-suppression-of">Checks, suppression of</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Check_005fFloat_005fOverflow"><code>Check_Float_Overflow</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fFloat_005fOverflow">Pragma Check_Float_Overflow</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Check_005fName"><code>Check_Name</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fName">Pragma Check_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Child-Units">Child Units</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-COBOL-support">COBOL support</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-COBOL_002c-interfacing-with">COBOL, interfacing with</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Code_005fAddress"><code>Code_Address</code></a>:</td><td> </td><td valign="top"><a href="#Code_005fAddress">Code_Address</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Command-line">Command line</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029">GNAT.Command_Line (g-comlin.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Command-line_002c-argument-removal">Command line, argument removal</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029">Ada.Command_Line.Remove (a-colire.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Command-line_002c-handling-long-command-lines">Command line, handling long command lines</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029">Ada.Command_Line.Response_File (a-clrefi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Command-line_002c-response-file">Command line, response file</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029">Ada.Command_Line.Response_File (a-clrefi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Comment"><code>Comment</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Comment">Pragma Comment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Common_005fObject"><code>Common_Object</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Common_005fObject">Pragma Common_Object</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Compiler-Version">Compiler Version</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029">GNAT.Compiler_Version (g-comver.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Compiler_005fUnit"><code>Compiler_Unit</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Compiler_005fUnit">Pragma Compiler_Unit</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Compiler_005fVersion"><code>Compiler_Version</code></a>:</td><td> </td><td valign="top"><a href="#Compiler_005fVersion">Compiler_Version</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Compile_005fTime_005fError"><code>Compile_Time_Error</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Compile_005fTime_005fError">Pragma Compile_Time_Error</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Compile_005fTime_005fWarning"><code>Compile_Time_Warning</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Compile_005fTime_005fWarning">Pragma Compile_Time_Warning</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Complete_005fRepresentation"><code>Complete_Representation</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Complete_005fRepresentation">Pragma Complete_Representation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Complex-arithmetic-accuracy">Complex arithmetic accuracy</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Complex-elementary-functions">Complex elementary functions</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Complex-types">Complex types</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Complex_005fRepresentation"><code>Complex_Representation</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Complex_005fRepresentation">Pragma Complex_Representation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Component-Clause">Component Clause</a>:</td><td> </td><td valign="top"><a href="#Record-Representation-Clauses">Record Representation Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Component_005fAlignment"><code>Component_Alignment</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Component_005fSize"><code>Component_Size</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Component_005fSize-Clause">Component_Size Clause</a>:</td><td> </td><td valign="top"><a href="#Component_005fSize-Clauses">Component_Size Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Component_005fSize-clauses"><code>Component_Size</code> clauses</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Component_005fSize_005f4"><code>Component_Size_4</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-configuration-pragma-Ada_005f2012">configuration pragma <code>Ada_2012</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Contract-cases">Contract cases</a>:</td><td> </td><td valign="top"><a href="#Pragma-Contract_005fCase">Pragma Contract_Case</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Contract_005fCase"><code>Contract_Case</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Contract_005fCase">Pragma Contract_Case</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Controlling-assertions">Controlling assertions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Convention_002c-effect-on-representation">Convention, effect on representation</a>:</td><td> </td><td valign="top"><a href="#Effect-of-Convention-on-Representation">Effect of Convention on Representation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Conventions_002c-synonyms">Conventions, synonyms</a>:</td><td> </td><td valign="top"><a href="#Pragma-Convention_005fIdentifier">Pragma Convention_Identifier</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Conventions_002c-typographical">Conventions, typographical</a>:</td><td> </td><td valign="top"><a href="#Conventions">Conventions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Convention_005fIdentifier"><code>Convention_Identifier</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Convention_005fIdentifier">Pragma Convention_Identifier</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Cookie-support-in-CGI">Cookie support in CGI</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029">GNAT.CGI.Cookie (g-cgicoo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPP_005fClass"><code>CPP_Class</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fClass">Pragma CPP_Class</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPP_005fConstructor"><code>CPP_Constructor</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fConstructor">Pragma CPP_Constructor</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPP_005fVirtual"><code>CPP_Virtual</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fVirtual">Pragma CPP_Virtual</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPP_005fVtable"><code>CPP_Vtable</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fVtable">Pragma CPP_Vtable</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPU"><code>CPU</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-CPU">Pragma CPU</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CRC32">CRC32</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029">GNAT.CRC32 (g-crc32.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Current-exception">Current exception</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029">GNAT.Current_Exception (g-curexc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Current-time">Current time</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029">GNAT.Time_Stamp (g-timsta.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Cyclic-Redundancy-Check">Cyclic Redundancy Check</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029">GNAT.CRC32 (g-crc32.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_005fPass_005fBy_005fCopy"><code>C_Pass_By_Copy</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-C_005fPass_005fBy_005fCopy">Pragma C_Pass_By_Copy</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-D">D</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Debug"><code>Debug</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Debug">Pragma Debug</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Debug-pools">Debug pools</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029">GNAT.Debug_Pools (g-debpoo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Debugging">Debugging</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029">GNAT.Debug_Pools (g-debpoo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Debugging-1">Debugging</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029">GNAT.Debug_Utilities (g-debuti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Debugging-2">Debugging</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029">GNAT.Exception_Traces (g-exctra.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-debugging-with-Initialize_005fScalars">debugging with Initialize_Scalars</a>:</td><td> </td><td valign="top"><a href="#Pragma-Initialize_005fScalars">Pragma Initialize_Scalars</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Debug_005fPolicy"><code>Debug_Policy</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Assertion_005fPolicy">Pragma Assertion_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Debug_005fPolicy-1"><code>Debug_Policy</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Debug_005fPolicy">Pragma Debug_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Dec-Ada-83">Dec Ada 83</a>:</td><td> </td><td valign="top"><a href="#Pragma-Extend_005fSystem">Pragma Extend_System</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Dec-Ada-83-casing-compatibility">Dec Ada 83 casing compatibility</a>:</td><td> </td><td valign="top"><a href="#Pragma-External_005fName_005fCasing">Pragma External_Name_Casing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Decimal-radix-support">Decimal radix support</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Decoding-strings">Decoding strings</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Decoding-strings-1">Decoding strings</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Decoding-UTF_002d8-strings">Decoding UTF-8 strings</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Default_005fBit_005fOrder"><code>Default_Bit_Order</code></a>:</td><td> </td><td valign="top"><a href="#Default_005fBit_005fOrder">Default_Bit_Order</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Default_005fStorage_005fPool"><code>Default_Storage_Pool</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Default_005fStorage_005fPool">Pragma Default_Storage_Pool</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Deferring-aborts">Deferring aborts</a>:</td><td> </td><td valign="top"><a href="#Pragma-Abort_005fDefer">Pragma Abort_Defer</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Defining-check-names">Defining check names</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fName">Pragma Check_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Descriptor">Descriptor</a>:</td><td> </td><td valign="top"><a href="#Descriptor_005fSize">Descriptor_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Descriptor_005fSize"><code>Descriptor_Size</code></a>:</td><td> </td><td valign="top"><a href="#Descriptor_005fSize">Descriptor_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Detect_005fBlocking"><code>Detect_Blocking</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Detect_005fBlocking">Pragma Detect_Blocking</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Directory-operations">Directory operations</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029">GNAT.Directory_Operations (g-dirope.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Directory-operations-iteration">Directory operations iteration</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029">GNAT.Directory_Operations.Iteration (g-diopit.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Discriminants_002c-testing-for">Discriminants, testing for</a>:</td><td> </td><td valign="top"><a href="#Has_005fDiscriminants">Has_Discriminants</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Dispatching_005fDomain"><code>Dispatching_Domain</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Dispatching_005fDomain">Pragma Dispatching_Domain</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Distribution-Systems-Annex">Distribution Systems Annex</a>:</td><td> </td><td valign="top"><a href="#GNAT-Implementation-of-Shared-Passive-Packages">GNAT Implementation of Shared Passive Packages</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Dope-vector">Dope vector</a>:</td><td> </td><td valign="top"><a href="#Descriptor_005fSize">Descriptor_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Dump-Memory">Dump Memory</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029">GNAT.Memory_Dump (g-memdum.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Duration_0027Small"><code>Duration'Small</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-E">E</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Elaborated"><code>Elaborated</code></a>:</td><td> </td><td valign="top"><a href="#Elaborated">Elaborated</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Elaboration-control">Elaboration control</a>:</td><td> </td><td valign="top"><a href="#Pragma-Elaboration_005fChecks">Pragma Elaboration_Checks</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Elaboration_005fChecks"><code>Elaboration_Checks</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Elaboration_005fChecks">Pragma Elaboration_Checks</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Elab_005fBody"><code>Elab_Body</code></a>:</td><td> </td><td valign="top"><a href="#Elab_005fBody">Elab_Body</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Elab_005fSpec"><code>Elab_Spec</code></a>:</td><td> </td><td valign="top"><a href="#Elab_005fSpec">Elab_Spec</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Elab_005fSubp_005fBody"><code>Elab_Subp_Body</code></a>:</td><td> </td><td valign="top"><a href="#Elab_005fSubp_005fBody">Elab_Subp_Body</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Eliminate"><code>Eliminate</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Eliminate">Pragma Eliminate</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Elimination-of-unused-subprograms">Elimination of unused subprograms</a>:</td><td> </td><td valign="top"><a href="#Pragma-Eliminate">Pragma Eliminate</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Emax"><code>Emax</code></a>:</td><td> </td><td valign="top"><a href="#Emax">Emax</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Enabled"><code>Enabled</code></a>:</td><td> </td><td valign="top"><a href="#Enabled">Enabled</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Enclosing_005fEntity">Enclosing_Entity</a>:</td><td> </td><td valign="top"><a href="#Enclosing_005fEntity">Enclosing_Entity</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Encoding-strings">Encoding strings</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Encoding-strings-1">Encoding strings</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Encoding-UTF_002d8-strings">Encoding UTF-8 strings</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Endianness">Endianness</a>:</td><td> </td><td valign="top"><a href="#Scalar_005fStorage_005fOrder">Scalar_Storage_Order</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Endianness-1">Endianness</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029">GNAT.Byte_Swapping (g-bytswa.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Entry-queuing-policies">Entry queuing policies</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Enumeration-representation-clauses">Enumeration representation clauses</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Enumeration-values">Enumeration values</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Enum_005fRep"><code>Enum_Rep</code></a>:</td><td> </td><td valign="top"><a href="#Enum_005fRep">Enum_Rep</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Enum_005fVal"><code>Enum_Val</code></a>:</td><td> </td><td valign="top"><a href="#Enum_005fVal">Enum_Val</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Environment-entries">Environment entries</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029">Ada.Command_Line.Environment (a-colien.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Epsilon"><code>Epsilon</code></a>:</td><td> </td><td valign="top"><a href="#Epsilon">Epsilon</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Error-detection">Error detection</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception-actions">Exception actions</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029">GNAT.Exception_Actions (g-excact.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception-information">Exception information</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception-retrieval">Exception retrieval</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029">GNAT.Current_Exception (g-curexc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception-traces">Exception traces</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029">GNAT.Exception_Traces (g-exctra.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception_002c-obtaining-most-recent">Exception, obtaining most recent</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029">GNAT.Most_Recent_Exception (g-moreex.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exceptions_002c-Pure">Exceptions, Pure</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029">GNAT.Exceptions (g-except.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception_005fInformation_0027">Exception_Information’</a>:</td><td> </td><td valign="top"><a href="#Exception_005fInformation">Exception_Information</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception_005fMessage">Exception_Message</a>:</td><td> </td><td valign="top"><a href="#Exception_005fMessage">Exception_Message</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Exception_005fName">Exception_Name</a>:</td><td> </td><td valign="top"><a href="#Exception_005fName">Exception_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export"><code>Export</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export-1"><code>Export</code></a>:</td><td> </td><td valign="top"><a href="#Address-Clauses">Address Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export_005fException"><code>Export_Exception</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fException">Pragma Export_Exception</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export_005fFunction"><code>Export_Function</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fFunction">Pragma Export_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export_005fObject"><code>Export_Object</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fObject">Pragma Export_Object</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export_005fProcedure"><code>Export_Procedure</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fProcedure">Pragma Export_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export_005fValue"><code>Export_Value</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fValue">Pragma Export_Value</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Export_005fValued_005fProcedure"><code>Export_Valued_Procedure</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fValued_005fProcedure">Pragma Export_Valued_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Extend_005fSystem"><code>Extend_System</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Extend_005fSystem">Pragma Extend_System</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Extensions_005fAllowed"><code>Extensions_Allowed</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Extensions_005fAllowed">Pragma Extensions_Allowed</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-External"><code>External</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-External">Pragma External</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-External-Names_002c-casing">External Names, casing</a>:</td><td> </td><td valign="top"><a href="#Pragma-External_005fName_005fCasing">Pragma External_Name_Casing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-External_005fName_005fCasing"><code>External_Name_Casing</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-External_005fName_005fCasing">Pragma External_Name_Casing</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-F">F</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Fast_005fMath"><code>Fast_Math</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Fast_005fMath">Pragma Fast_Math</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Favor_005fTop_005fLevel"><code>Favor_Top_Level</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Favor_005fTop_005fLevel">Pragma Favor_Top_Level</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FDL_002c-GNU-Free-Documentation-License">FDL, GNU Free Documentation License</a>:</td><td> </td><td valign="top"><a href="#GNU-Free-Documentation-License">GNU Free Documentation License</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-File">File</a>:</td><td> </td><td valign="top"><a href="#File">File</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-File-locking">File locking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029">GNAT.Lock_Files (g-locfil.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Finalize_005fStorage_005fOnly"><code>Finalize_Storage_Only</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Finalize_005fStorage_005fOnly">Pragma Finalize_Storage_Only</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Fixed_005fValue"><code>Fixed_Value</code></a>:</td><td> </td><td valign="top"><a href="#Fixed_005fValue">Fixed_Value</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Float-types">Float types</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Floating_002dpoint-overflow">Floating-point overflow</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fFloat_005fOverflow">Pragma Check_Float_Overflow</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Floating_002dPoint-Processor">Floating-Point Processor</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029">GNAT.Float_Control (g-flocon.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Float_005fRepresentation"><code>Float_Representation</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Float_005fRepresentation">Pragma Float_Representation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Foreign-threads">Foreign threads</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029">GNAT.Threads (g-thread.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Forking-a-new-process">Forking a new process</a>:</td><td> </td><td valign="top"><a href="#Mapping-Ada-Tasks-onto-the-Underlying-Kernel-Threads">Mapping Ada Tasks onto the Underlying Kernel Threads</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Formal-container-for-doubly-linked-lists">Formal container for doubly linked lists</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029">Ada.Containers.Formal_Doubly_Linked_Lists (a-cfdlli.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Formal-container-for-hashed-maps">Formal container for hashed maps</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029">Ada.Containers.Formal_Hashed_Maps (a-cfhama.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Formal-container-for-hashed-sets">Formal container for hashed sets</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029">Ada.Containers.Formal_Hashed_Sets (a-cfhase.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Formal-container-for-ordered-maps">Formal container for ordered maps</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029">Ada.Containers.Formal_Ordered_Maps (a-cforma.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Formal-container-for-ordered-sets">Formal container for ordered sets</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029">Ada.Containers.Formal_Ordered_Sets (a-cforse.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Formal-container-for-vectors">Formal container for vectors</a>:</td><td> </td><td valign="top"><a href="#Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029">Ada.Containers.Formal_Vectors (a-cofove.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Fortran_002c-interfacing-with">Fortran, interfacing with</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-G">G</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Get_005fImmediate">Get_Immediate</a>:</td><td> </td><td valign="top"><a href="#Get_005fImmediate">Get_Immediate</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Get_005fImmediate-1"><code>Get_Immediate</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Get_005fImmediate_002c-VxWorks">Get_Immediate, VxWorks</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">Interfaces.VxWorks.IO (i-vxwoio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Global-storage-pool">Global storage pool</a>:</td><td> </td><td valign="top"><a href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029">System.Pool_Global (s-pooglo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT-Extensions">GNAT Extensions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Extensions_005fAllowed">Pragma Extensions_Allowed</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eAltivec-_0028g_002daltive_002eads_0029"><code>GNAT.Altivec</code> (<samp>g-altive.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec-_0028g_002daltive_002eads_0029">GNAT.Altivec (g-altive.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029"><code>GNAT.Altivec.Conversions</code> (<samp>g-altcon.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029">GNAT.Altivec.Conversions (g-altcon.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029"><code>GNAT.Altivec.Vector_Operations</code> (<samp>g-alveop.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029">GNAT.Altivec.Vector_Operations (g-alveop.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029"><code>GNAT.Altivec.Vector_Types</code> (<samp>g-alvety.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029">GNAT.Altivec.Vector_Types (g-alvety.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029"><code>GNAT.Altivec.Vector_Views</code> (<samp>g-alvevi.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029">GNAT.Altivec.Vector_Views (g-alvevi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029"><code>GNAT.Array_Split</code> (<samp>g-arrspl.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029">GNAT.Array_Split (g-arrspl.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eAWK-_0028g_002dawk_002eads_0029"><code>GNAT.AWK</code> (<samp>g-awk.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029">GNAT.AWK (g-awk.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029"><code>GNAT.Bounded_Buffers</code> (<samp>g-boubuf.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029">GNAT.Bounded_Buffers (g-boubuf.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029"><code>GNAT.Bounded_Mailboxes</code> (<samp>g-boumai.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029">GNAT.Bounded_Mailboxes (g-boumai.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029"><code>GNAT.Bubble_Sort</code> (<samp>g-bubsor.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029">GNAT.Bubble_Sort (g-bubsor.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029"><code>GNAT.Bubble_Sort_A</code> (<samp>g-busora.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029">GNAT.Bubble_Sort_A (g-busora.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029"><code>GNAT.Bubble_Sort_G</code> (<samp>g-busorg.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029">GNAT.Bubble_Sort_G (g-busorg.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029"><code>GNAT.Byte_Order_Mark</code> (<samp>g-byorma.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029">GNAT.Byte_Order_Mark (g-byorma.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029"><code>GNAT.Byte_Swapping</code> (<samp>g-bytswa.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029">GNAT.Byte_Swapping (g-bytswa.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCalendar-_0028g_002dcalend_002eads_0029"><code>GNAT.Calendar</code> (<samp>g-calend.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCalendar-_0028g_002dcalend_002eads_0029">GNAT.Calendar (g-calend.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029"><code>GNAT.Calendar.Time_IO</code> (<samp>g-catiio.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029">GNAT.Calendar.Time_IO (g-catiio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029"><code>GNAT.Case_Util</code> (<samp>g-casuti.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029">GNAT.Case_Util (g-casuti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCGI-_0028g_002dcgi_002eads_0029"><code>GNAT.CGI</code> (<samp>g-cgi.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCGI-_0028g_002dcgi_002eads_0029">GNAT.CGI (g-cgi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029"><code>GNAT.CGI.Cookie</code> (<samp>g-cgicoo.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029">GNAT.CGI.Cookie (g-cgicoo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029"><code>GNAT.CGI.Debug</code> (<samp>g-cgideb.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029">GNAT.CGI.Debug (g-cgideb.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029"><code>GNAT.Command_Line</code> (<samp>g-comlin.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029">GNAT.Command_Line (g-comlin.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029"><code>GNAT.Compiler_Version</code> (<samp>g-comver.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029">GNAT.Compiler_Version (g-comver.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029"><code>GNAT.CRC32</code> (<samp>g-crc32.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029">GNAT.CRC32 (g-crc32.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029"><code>GNAT.Ctrl_C</code> (<samp>g-ctrl_c.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029">GNAT.Ctrl_C (g-ctrl_c.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029"><code>GNAT.Current_Exception</code> (<samp>g-curexc.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029">GNAT.Current_Exception (g-curexc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029"><code>GNAT.Debug_Pools</code> (<samp>g-debpoo.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029">GNAT.Debug_Pools (g-debpoo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029"><code>GNAT.Debug_Utilities</code> (<samp>g-debuti.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029">GNAT.Debug_Utilities (g-debuti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029"><code>GNAT.Decode_String</code> (<samp>g-decstr.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029"><code>GNAT.Decode_UTF8_String</code> (<samp>g-deutst.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029"><code>GNAT.Directory_Operations</code> (<samp>g-dirope.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029">GNAT.Directory_Operations (g-dirope.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029"><code>GNAT.Directory_Operations.Iteration</code> (<samp>g-diopit.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029">GNAT.Directory_Operations.Iteration (g-diopit.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029"><code>GNAT.Dynamic_HTables</code> (<samp>g-dynhta.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029">GNAT.Dynamic_HTables (g-dynhta.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029"><code>GNAT.Dynamic_Tables</code> (<samp>g-dyntab.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029">GNAT.Dynamic_Tables (g-dyntab.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029"><code>GNAT.Encode_String</code> (<samp>g-encstr.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029"><code>GNAT.Encode_UTF8_String</code> (<samp>g-enutst.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eExceptions-_0028g_002dexpect_002eads_0029"><code>GNAT.Exceptions</code> (<samp>g-expect.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029">GNAT.Exceptions (g-except.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029"><code>GNAT.Exception_Actions</code> (<samp>g-excact.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029">GNAT.Exception_Actions (g-excact.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029"><code>GNAT.Exception_Traces</code> (<samp>g-exctra.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029">GNAT.Exception_Traces (g-exctra.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eExpect-_0028g_002dexpect_002eads_0029"><code>GNAT.Expect</code> (<samp>g-expect.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eExpect-_0028g_002dexpect_002eads_0029">GNAT.Expect (g-expect.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029"><code>GNAT.Expect.TTY</code> (<samp>g-exptty.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029">GNAT.Expect.TTY (g-exptty.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029"><code>GNAT.Float_Control</code> (<samp>g-flocon.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029">GNAT.Float_Control (g-flocon.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029"><code>GNAT.Heap_Sort</code> (<samp>g-heasor.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029">GNAT.Heap_Sort (g-heasor.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029"><code>GNAT.Heap_Sort_A</code> (<samp>g-hesora.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029">GNAT.Heap_Sort_A (g-hesora.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029"><code>GNAT.Heap_Sort_G</code> (<samp>g-hesorg.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029">GNAT.Heap_Sort_G (g-hesorg.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eHTable-_0028g_002dhtable_002eads_0029"><code>GNAT.HTable</code> (<samp>g-htable.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHTable-_0028g_002dhtable_002eads_0029">GNAT.HTable (g-htable.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eIO-_0028g_002dio_002eads_0029"><code>GNAT.IO</code> (<samp>g-io.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eIO-_0028g_002dio_002eads_0029">GNAT.IO (g-io.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029"><code>GNAT.IO_Aux</code> (<samp>g-io_aux.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029">GNAT.IO_Aux (g-io_aux.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029"><code>GNAT.Lock_Files</code> (<samp>g-locfil.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029">GNAT.Lock_Files (g-locfil.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029"><code>GNAT.MBBS_Discrete_Random</code> (<samp>g-mbdira.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029">GNAT.MBBS_Discrete_Random (g-mbdira.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029"><code>GNAT.MBBS_Float_Random</code> (<samp>g-mbflra.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029">GNAT.MBBS_Float_Random (g-mbflra.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eMD5-_0028g_002dmd5_002eads_0029"><code>GNAT.MD5</code> (<samp>g-md5.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMD5-_0028g_002dmd5_002eads_0029">GNAT.MD5 (g-md5.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029"><code>GNAT.Memory_Dump</code> (<samp>g-memdum.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029">GNAT.Memory_Dump (g-memdum.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029"><code>GNAT.Most_Recent_Exception</code> (<samp>g-moreex.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029">GNAT.Most_Recent_Exception (g-moreex.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029"><code>GNAT.OS_Lib</code> (<samp>g-os_lib.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029">GNAT.OS_Lib (g-os_lib.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029"><code>GNAT.Perfect_Hash_Generators</code> (<samp>g-pehage.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029">GNAT.Perfect_Hash_Generators (g-pehage.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029"><code>GNAT.Random_Numbers</code> (<samp>g-rannum.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029">GNAT.Random_Numbers (g-rannum.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eRegexp-_0028g_002dregexp_002eads_0029"><code>GNAT.Regexp</code> (<samp>g-regexp.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029">GNAT.Regexp (g-regexp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eRegistry-_0028g_002dregist_002eads_0029"><code>GNAT.Registry</code> (<samp>g-regist.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegistry-_0028g_002dregist_002eads_0029">GNAT.Registry (g-regist.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eRegpat-_0028g_002dregpat_002eads_0029"><code>GNAT.Regpat</code> (<samp>g-regpat.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029">GNAT.Regpat (g-regpat.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029"><code>GNAT.Secondary_Stack_Info</code> (<samp>g-sestin.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029">GNAT.Secondary_Stack_Info (g-sestin.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029"><code>GNAT.Semaphores</code> (<samp>g-semaph.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029">GNAT.Semaphores (g-semaph.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029"><code>GNAT.Serial_Communications</code> (<samp>g-sercom.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029">GNAT.Serial_Communications (g-sercom.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSHA1-_0028g_002dsha1_002eads_0029"><code>GNAT.SHA1</code> (<samp>g-sha1.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA1-_0028g_002dsha1_002eads_0029">GNAT.SHA1 (g-sha1.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSHA224-_0028g_002dsha224_002eads_0029"><code>GNAT.SHA224</code> (<samp>g-sha224.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA224-_0028g_002dsha224_002eads_0029">GNAT.SHA224 (g-sha224.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSHA256-_0028g_002dsha256_002eads_0029"><code>GNAT.SHA256</code> (<samp>g-sha256.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA256-_0028g_002dsha256_002eads_0029">GNAT.SHA256 (g-sha256.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSHA384-_0028g_002dsha384_002eads_0029"><code>GNAT.SHA384</code> (<samp>g-sha384.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA384-_0028g_002dsha384_002eads_0029">GNAT.SHA384 (g-sha384.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSHA512-_0028g_002dsha512_002eads_0029"><code>GNAT.SHA512</code> (<samp>g-sha512.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA512-_0028g_002dsha512_002eads_0029">GNAT.SHA512 (g-sha512.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSignals-_0028g_002dsignal_002eads_0029"><code>GNAT.Signals</code> (<samp>g-signal.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSignals-_0028g_002dsignal_002eads_0029">GNAT.Signals (g-signal.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSockets-_0028g_002dsocket_002eads_0029"><code>GNAT.Sockets</code> (<samp>g-socket.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSockets-_0028g_002dsocket_002eads_0029">GNAT.Sockets (g-socket.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029"><code>GNAT.Source_Info</code> (<samp>g-souinf.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029">GNAT.Source_Info (g-souinf.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029"><code>GNAT.Spelling_Checker</code> (<samp>g-speche.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029">GNAT.Spelling_Checker (g-speche.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029"><code>GNAT.Spelling_Checker_Generic</code> (<samp>g-spchge.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029">GNAT.Spelling_Checker_Generic (g-spchge.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029"><code>GNAT.Spitbol</code> (<samp>g-spitbo.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029">GNAT.Spitbol (g-spitbo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029"><code>GNAT.Spitbol.Patterns</code> (<samp>g-spipat.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029">GNAT.Spitbol.Patterns (g-spipat.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029"><code>GNAT.Spitbol.Table_Boolean</code> (<samp>g-sptabo.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029">GNAT.Spitbol.Table_Boolean (g-sptabo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029"><code>GNAT.Spitbol.Table_Integer</code> (<samp>g-sptain.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029"><code>GNAT.Spitbol.Table_VString</code> (<samp>g-sptavs.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSSE-_0028g_002dsse_002eads_0029"><code>GNAT.SSE</code> (<samp>g-sse.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSSE-_0028g_002dsse_002eads_0029">GNAT.SSE (g-sse.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029"><code>GNAT.SSE.Vector_Types</code> (<samp>g-ssvety.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029">GNAT.SSE.Vector_Types (g-ssvety.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eStrings-_0028g_002dstring_002eads_0029"><code>GNAT.Strings</code> (<samp>g-string.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eStrings-_0028g_002dstring_002eads_0029">GNAT.Strings (g-string.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029"><code>GNAT.String_Split</code> (<samp>g-strspl.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029">GNAT.String_Split (g-strspl.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eTable-_0028g_002dtable_002eads_0029"><code>GNAT.Table</code> (<samp>g-table.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTable-_0028g_002dtable_002eads_0029">GNAT.Table (g-table.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029"><code>GNAT.Task_Lock</code> (<samp>g-tasloc.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029">GNAT.Task_Lock (g-tasloc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eThreads-_0028g_002dthread_002eads_0029"><code>GNAT.Threads</code> (<samp>g-thread.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029">GNAT.Threads (g-thread.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029"><code>GNAT.Time_Stamp</code> (<samp>g-timsta.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029">GNAT.Time_Stamp (g-timsta.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029"><code>GNAT.Traceback</code> (<samp>g-traceb.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029">GNAT.Traceback (g-traceb.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029"><code>GNAT.Traceback.Symbolic</code> (<samp>g-trasym.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029">GNAT.Traceback.Symbolic (g-trasym.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eUTF_005f32-_0028g_002dtable_002eads_0029"><code>GNAT.UTF_32</code> (<samp>g-table.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029">GNAT.UTF_32 (g-utf_32.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eWide_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029"><code>GNAT.Wide_Spelling_Checker</code> (<samp>g-u3spch.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029">GNAT.UTF_32_Spelling_Checker (g-u3spch.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029"><code>GNAT.Wide_Spelling_Checker</code> (<samp>g-wispch.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029">GNAT.Wide_Spelling_Checker (g-wispch.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029"><code>GNAT.Wide_String_Split</code> (<samp>g-wistsp.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029">GNAT.Wide_String_Split (g-wistsp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029"><code>GNAT.Wide_Wide_Spelling_Checker</code> (<samp>g-zspche.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029">GNAT.Wide_Wide_Spelling_Checker (g-zspche.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029"><code>GNAT.Wide_Wide_String_Split</code> (<samp>g-zistsp.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029">GNAT.Wide_Wide_String_Split (g-zistsp.ads)</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-H">H</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Hash-functions">Hash functions</a>:</td><td> </td><td valign="top"><a href="#GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029">GNAT.Perfect_Hash_Generators (g-pehage.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Hash-tables">Hash tables</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029">GNAT.Dynamic_HTables (g-dynhta.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Hash-tables-1">Hash tables</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHTable-_0028g_002dhtable_002eads_0029">GNAT.HTable (g-htable.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Has_005fAccess_005fValues"><code>Has_Access_Values</code></a>:</td><td> </td><td valign="top"><a href="#Has_005fAccess_005fValues">Has_Access_Values</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Has_005fDiscriminants"><code>Has_Discriminants</code></a>:</td><td> </td><td valign="top"><a href="#Has_005fDiscriminants">Has_Discriminants</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Heap-usage_002c-implicit">Heap usage, implicit</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-I">I</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-IBM-Packed-Format">IBM Packed Format</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029">Interfaces.Packed_Decimal (i-pacdec.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ident"><code>Ident</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ident">Pragma Ident</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Image_002c-of-an-address">Image, of an address</a>:</td><td> </td><td valign="top"><a href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029">System.Address_Image (s-addima.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Img"><code>Img</code></a>:</td><td> </td><td valign="top"><a href="#Img">Img</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Immediate_005fReclamation"><code>Immediate_Reclamation</code></a>:</td><td> </td><td valign="top"><a href="#Immediate_005fReclamation">Immediate_Reclamation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Implementation_002ddependent-features">Implementation-dependent features</a>:</td><td> </td><td valign="top"><a href="#About-This-Guide">About This Guide</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Implementation_005fDefined"><code>Implementation_Defined</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Implementation_005fDefined">Pragma Implementation_Defined</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Implemented"><code>Implemented</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Implemented">Pragma Implemented</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Implicit_005fPacking"><code>Implicit_Packing</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Implicit_005fPacking">Pragma Implicit_Packing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Import"><code>Import</code></a>:</td><td> </td><td valign="top"><a href="#Address-Clauses">Address Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Import_005fException"><code>Import_Exception</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fException">Pragma Import_Exception</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Import_005fFunction"><code>Import_Function</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fFunction">Pragma Import_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Import_005fObject"><code>Import_Object</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fObject">Pragma Import_Object</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Import_005fProcedure"><code>Import_Procedure</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fProcedure">Pragma Import_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Import_005fValued_005fProcedure"><code>Import_Valued_Procedure</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fValued_005fProcedure">Pragma Import_Valued_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Independent"><code>Independent</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Independent">Pragma Independent</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Independent_005fComponents"><code>Independent_Components</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Independent_005fComponents">Pragma Independent_Components</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Initialization_002c-suppression-of">Initialization, suppression of</a>:</td><td> </td><td valign="top"><a href="#Pragma-Suppress_005fInitialization">Pragma Suppress_Initialization</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Initialize_005fScalars"><code>Initialize_Scalars</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Initialize_005fScalars">Pragma Initialize_Scalars</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Inline_005fAlways"><code>Inline_Always</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Inline_005fAlways">Pragma Inline_Always</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Inline_005fGeneric"><code>Inline_Generic</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Inline_005fGeneric">Pragma Inline_Generic</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Input_002fOutput-facilities">Input/Output facilities</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eIO-_0028g_002dio_002eads_0029">GNAT.IO (g-io.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Input_002fOutput-facilities-1">Input/Output facilities</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029">GNAT.IO_Aux (g-io_aux.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Integer-maps">Integer maps</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Integer-types">Integer types</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Integer_005fValue"><code>Integer_Value</code></a>:</td><td> </td><td valign="top"><a href="#Integer_005fValue">Integer_Value</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interface"><code>Interface</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Interface">Pragma Interface</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfaces"><code>Interfaces</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029"><code>Interfaces.C.Extensions</code> (<samp>i-cexten.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029">Interfaces.C.Extensions (i-cexten.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029"><code>Interfaces.C.Streams</code> (<samp>i-cstrea.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029">Interfaces.C.Streams (i-cstrea.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfaces_002eCPP-_0028i_002dcpp_002eads_0029"><code>Interfaces.CPP</code> (<samp>i-cpp.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029">Interfaces.CPP (i-cpp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029"><code>Interfaces.Packed_Decimal</code> (<samp>i-pacdec.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029">Interfaces.Packed_Decimal (i-pacdec.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029"><code>Interfaces.VxWorks</code> (<samp>i-vxwork.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029">Interfaces.VxWorks (i-vxwork.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029"><code>Interfaces.VxWorks.IO</code> (<samp>i-vxwoio.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">Interfaces.VxWorks.IO (i-vxwoio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interface_005fName"><code>Interface_Name</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Interface_005fName">Pragma Interface_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfacing-to-C_002b_002b">Interfacing to C++</a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fVirtual">Pragma CPP_Virtual</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfacing-to-VxWorks">Interfacing to VxWorks</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029">Interfaces.VxWorks (i-vxwork.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfacing-to-VxWorks_0027-I_002fO">Interfacing to VxWorks’ I/O</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">Interfaces.VxWorks.IO (i-vxwoio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfacing-with-C_002b_002b">Interfacing with C++</a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fClass">Pragma CPP_Class</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfacing-with-C_002b_002b-1">Interfacing with C++</a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fConstructor">Pragma CPP_Constructor</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfacing-with-C_002b_002b-2">Interfacing with C++</a>:</td><td> </td><td valign="top"><a href="#Pragma-CPP_005fVtable">Pragma CPP_Vtable</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interfacing_002c-to-C_002b_002b">Interfacing, to C++</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029">Interfaces.CPP (i-cpp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interrupt">Interrupt</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029">GNAT.Ctrl_C (g-ctrl_c.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interrupt-priority_002c-maximum">Interrupt priority, maximum</a>:</td><td> </td><td valign="top"><a href="#Max_005fInterrupt_005fPriority">Max_Interrupt_Priority</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interrupt-support">Interrupt support</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interrupts"><code>Interrupts</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interrupt_005fHandler"><code>Interrupt_Handler</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Interrupt_005fHandler">Pragma Interrupt_Handler</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Interrupt_005fState"><code>Interrupt_State</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Interrupt_005fState">Pragma Interrupt_State</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Intrinsic-operator">Intrinsic operator</a>:</td><td> </td><td valign="top"><a href="#Intrinsic-Operators">Intrinsic Operators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Intrinsic-Subprograms">Intrinsic Subprograms</a>:</td><td> </td><td valign="top"><a href="#Intrinsic-Subprograms">Intrinsic Subprograms</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Invalid-representations">Invalid representations</a>:</td><td> </td><td valign="top"><a href="#Pragma-Assume_005fNo_005fInvalid_005fValues">Pragma Assume_No_Invalid_Values</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Invalid-values">Invalid values</a>:</td><td> </td><td valign="top"><a href="#Pragma-Assume_005fNo_005fInvalid_005fValues">Pragma Assume_No_Invalid_Values</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Invalid_005fValue"><code>Invalid_Value</code></a>:</td><td> </td><td valign="top"><a href="#Invalid_005fValue">Invalid_Value</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Invariant"><code>Invariant</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Invariant">Pragma Invariant</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-K">K</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Keep_005fNames"><code>Keep_Names</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Keep_005fNames">Pragma Keep_Names</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-L">L</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Large"><code>Large</code></a>:</td><td> </td><td valign="top"><a href="#Large">Large</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Latin_005f1-constants-for-Wide_005fCharacter">Latin_1 constants for Wide_Character</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029">Ada.Characters.Wide_Latin_1 (a-cwila1.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Latin_005f1-constants-for-Wide_005fWide_005fCharacter">Latin_1 constants for Wide_Wide_Character</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029">Ada.Characters.Wide_Wide_Latin_1 (a-chzla1.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Latin_005f9-constants-for-Character">Latin_9 constants for Character</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029">Ada.Characters.Latin_9 (a-chlat9.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Latin_005f9-constants-for-Wide_005fCharacter">Latin_9 constants for Wide_Character</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029">Ada.Characters.Wide_Latin_9 (a-cwila9.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Latin_005f9-constants-for-Wide_005fWide_005fCharacter">Latin_9 constants for Wide_Wide_Character</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029">Ada.Characters.Wide_Wide_Latin_9 (a-chzla9.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-License"><code>License</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-License">Pragma License</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-License-checking">License checking</a>:</td><td> </td><td valign="top"><a href="#Pragma-License">Pragma License</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Line">Line</a>:</td><td> </td><td valign="top"><a href="#Line">Line</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Linker_005fAlias"><code>Linker_Alias</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Linker_005fAlias">Pragma Linker_Alias</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Linker_005fConstructor"><code>Linker_Constructor</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Linker_005fConstructor">Pragma Linker_Constructor</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Linker_005fDestructor"><code>Linker_Destructor</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Linker_005fDestructor">Pragma Linker_Destructor</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Linker_005fSection"><code>Linker_Section</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Linker_005fSection">Pragma Linker_Section</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Link_005fWith"><code>Link_With</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Link_005fWith">Pragma Link_With</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Little-endian">Little endian</a>:</td><td> </td><td valign="top"><a href="#Default_005fBit_005fOrder">Default_Bit_Order</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Local-storage-pool">Local storage pool</a>:</td><td> </td><td valign="top"><a href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029">System.Pool_Local (s-pooloc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Locking">Locking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029">GNAT.Task_Lock (g-tasloc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Locking-Policies">Locking Policies</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Locking-using-files">Locking using files</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029">GNAT.Lock_Files (g-locfil.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Long_005fFloat"><code>Long_Float</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Long_005fFloat">Pragma Long_Float</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Loop_005fOptimize"><code>Loop_Optimize</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Loop_005fOptimize">Pragma Loop_Optimize</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-M">M</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Machine-Code-insertions">Machine Code insertions</a>:</td><td> </td><td valign="top"><a href="#Machine-Code-Insertions">Machine Code Insertions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Machine-operations">Machine operations</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Machine_005fAttribute"><code>Machine_Attribute</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Machine_005fAttribute">Pragma Machine_Attribute</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Machine_005fSize"><code>Machine_Size</code></a>:</td><td> </td><td valign="top"><a href="#Machine_005fSize">Machine_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Mailboxes">Mailboxes</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029">GNAT.Bounded_Mailboxes (g-boumai.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Main"><code>Main</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Main">Pragma Main</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Main_005fStorage"><code>Main_Storage</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Main_005fStorage">Pragma Main_Storage</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Mantissa"><code>Mantissa</code></a>:</td><td> </td><td valign="top"><a href="#Mantissa">Mantissa</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Maps">Maps</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Maps-1">Maps</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Maximum_005fAlignment"><code>Maximum_Alignment</code></a>:</td><td> </td><td valign="top"><a href="#Maximum_005fAlignment">Maximum_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Maximum_005fAlignment-attribute"><code>Maximum_Alignment</code> attribute</a>:</td><td> </td><td valign="top"><a href="#Alignment-Clauses">Alignment Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fAsynchronous_005fSelect_005fNesting"><code>Max_Asynchronous_Select_Nesting</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fAsynchronous_005fSelect_005fNesting">Max_Asynchronous_Select_Nesting</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fEntry_005fQueue_005fLength"><code>Max_Entry_Queue_Length</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fEntry_005fQueue_005fLength">Max_Entry_Queue_Length</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fInterrupt_005fPriority"><code>Max_Interrupt_Priority</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fInterrupt_005fPriority">Max_Interrupt_Priority</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fPriority"><code>Max_Priority</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fPriority">Max_Priority</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fProtected_005fEntries"><code>Max_Protected_Entries</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fProtected_005fEntries">Max_Protected_Entries</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fSelect_005fAlternatives"><code>Max_Select_Alternatives</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fSelect_005fAlternatives">Max_Select_Alternatives</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fStorage_005fAt_005fBlocking"><code>Max_Storage_At_Blocking</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fStorage_005fAt_005fBlocking">Max_Storage_At_Blocking</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fTasks"><code>Max_Tasks</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fTasks">Max_Tasks</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Max_005fTask_005fEntries"><code>Max_Task_Entries</code></a>:</td><td> </td><td valign="top"><a href="#Max_005fTask_005fEntries">Max_Task_Entries</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Mechanism_005fCode"><code>Mechanism_Code</code></a>:</td><td> </td><td valign="top"><a href="#Mechanism_005fCode">Mechanism_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Memory-allocation">Memory allocation</a>:</td><td> </td><td valign="top"><a href="#System_002eMemory-_0028s_002dmemory_002eads_0029">System.Memory (s-memory.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Memory-corruption-debugging">Memory corruption debugging</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029">GNAT.Debug_Pools (g-debpoo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Message-Digest-MD5">Message Digest MD5</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMD5-_0028g_002dmd5_002eads_0029">GNAT.MD5 (g-md5.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Multidimensional-arrays">Multidimensional arrays</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-N">N</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Named-assertions">Named assertions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check">Pragma Check</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Named-assertions-1">Named assertions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Named-numbers_002c-representation-of">Named numbers, representation of</a>:</td><td> </td><td valign="top"><a href="#Universal_005fLiteral_005fString">Universal_Literal_String</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Normalize_005fScalars"><code>Normalize_Scalars</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Normalize_005fScalars">Pragma Normalize_Scalars</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fAbort_005fStatements"><code>No_Abort_Statements</code></a>:</td><td> </td><td valign="top"><a href="#No_005fAbort_005fStatements">No_Abort_Statements</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fAccess_005fParameter_005fAllocators"><code>No_Access_Parameter_Allocators</code></a>:</td><td> </td><td valign="top"><a href="#No_005fAccess_005fParameter_005fAllocators">No_Access_Parameter_Allocators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fAccess_005fSubprograms"><code>No_Access_Subprograms</code></a>:</td><td> </td><td valign="top"><a href="#No_005fAccess_005fSubprograms">No_Access_Subprograms</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fAllocators"><code>No_Allocators</code></a>:</td><td> </td><td valign="top"><a href="#No_005fAllocators">No_Allocators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fAnonymous_005fAllocators"><code>No_Anonymous_Allocators</code></a>:</td><td> </td><td valign="top"><a href="#No_005fAnonymous_005fAllocators">No_Anonymous_Allocators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fBody"><code>No_Body</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-No_005fBody">Pragma No_Body</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fCalendar"><code>No_Calendar</code></a>:</td><td> </td><td valign="top"><a href="#No_005fCalendar">No_Calendar</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fCoextensions"><code>No_Coextensions</code></a>:</td><td> </td><td valign="top"><a href="#No_005fCoextensions">No_Coextensions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDefault_005fInitialization"><code>No_Default_Initialization</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDefault_005fInitialization">No_Default_Initialization</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDelay"><code>No_Delay</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDelay">No_Delay</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDependence"><code>No_Dependence</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDependence">No_Dependence</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDirect_005fBoolean_005fOperators"><code>No_Direct_Boolean_Operators</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDirect_005fBoolean_005fOperators">No_Direct_Boolean_Operators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDispatch"><code>No_Dispatch</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDispatch">No_Dispatch</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDispatching_005fCalls"><code>No_Dispatching_Calls</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDispatching_005fCalls">No_Dispatching_Calls</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDynamic_005fAttachment"><code>No_Dynamic_Attachment</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDynamic_005fAttachment">No_Dynamic_Attachment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fDynamic_005fPriorities"><code>No_Dynamic_Priorities</code></a>:</td><td> </td><td valign="top"><a href="#No_005fDynamic_005fPriorities">No_Dynamic_Priorities</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fElaboration_005fCode"><code>No_Elaboration_Code</code></a>:</td><td> </td><td valign="top"><a href="#No_005fElaboration_005fCode">No_Elaboration_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode"><code>No_Entry_Calls_In_Elaboration_Code</code></a>:</td><td> </td><td valign="top"><a href="#No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode">No_Entry_Calls_In_Elaboration_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fEntry_005fQueue"><code>No_Entry_Queue</code></a>:</td><td> </td><td valign="top"><a href="#No_005fEntry_005fQueue">No_Entry_Queue</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fEnumeration_005fMaps"><code>No_Enumeration_Maps</code></a>:</td><td> </td><td valign="top"><a href="#No_005fEnumeration_005fMaps">No_Enumeration_Maps</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fExceptions"><code>No_Exceptions</code></a>:</td><td> </td><td valign="top"><a href="#No_005fExceptions">No_Exceptions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fException_005fHandlers"><code>No_Exception_Handlers</code></a>:</td><td> </td><td valign="top"><a href="#No_005fException_005fHandlers">No_Exception_Handlers</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fException_005fPropagation"><code>No_Exception_Propagation</code></a>:</td><td> </td><td valign="top"><a href="#No_005fException_005fPropagation">No_Exception_Propagation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fException_005fRegistration"><code>No_Exception_Registration</code></a>:</td><td> </td><td valign="top"><a href="#No_005fException_005fRegistration">No_Exception_Registration</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fFinalization"><code>No_Finalization</code></a>:</td><td> </td><td valign="top"><a href="#No_005fFinalization">No_Finalization</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fFixed_005fPoint"><code>No_Fixed_Point</code></a>:</td><td> </td><td valign="top"><a href="#No_005fFixed_005fPoint">No_Fixed_Point</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fFloating_005fPoint"><code>No_Floating_Point</code></a>:</td><td> </td><td valign="top"><a href="#No_005fFloating_005fPoint">No_Floating_Point</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplementation_005fAspect_005fSpecifications"><code>No_Implementation_Aspect_Specifications</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplementation_005fAspect_005fSpecifications">No_Implementation_Aspect_Specifications</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplementation_005fAttributes"><code>No_Implementation_Attributes</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplementation_005fAttributes">No_Implementation_Attributes</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplementation_005fIdentifiers"><code>No_Implementation_Identifiers</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplementation_005fIdentifiers">No_Implementation_Identifiers</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplementation_005fPragmas"><code>No_Implementation_Pragmas</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplementation_005fPragmas">No_Implementation_Pragmas</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplementation_005fRestrictions"><code>No_Implementation_Restrictions</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplementation_005fRestrictions">No_Implementation_Restrictions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplementation_005fUnits"><code>No_Implementation_Units</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplementation_005fUnits">No_Implementation_Units</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplicit_005fAliasing"><code>No_Implicit_Aliasing</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplicit_005fAliasing">No_Implicit_Aliasing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplicit_005fConditionals"><code>No_Implicit_Conditionals</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplicit_005fConditionals">No_Implicit_Conditionals</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplicit_005fDynamic_005fCode"><code>No_Implicit_Dynamic_Code</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplicit_005fDynamic_005fCode">No_Implicit_Dynamic_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplicit_005fHeap_005fAllocations"><code>No_Implicit_Heap_Allocations</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplicit_005fHeap_005fAllocations">No_Implicit_Heap_Allocations</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fImplicit_005fLoops"><code>No_Implicit_Loops</code></a>:</td><td> </td><td valign="top"><a href="#No_005fImplicit_005fLoops">No_Implicit_Loops</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fInitialize_005fScalars"><code>No_Initialize_Scalars</code></a>:</td><td> </td><td valign="top"><a href="#No_005fInitialize_005fScalars">No_Initialize_Scalars</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fInline"><code>No_Inline</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-No_005fInline">Pragma No_Inline</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fIO"><code>No_IO</code></a>:</td><td> </td><td valign="top"><a href="#No_005fIO">No_IO</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fLocal_005fAllocators"><code>No_Local_Allocators</code></a>:</td><td> </td><td valign="top"><a href="#No_005fLocal_005fAllocators">No_Local_Allocators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fLocal_005fProtected_005fObjects"><code>No_Local_Protected_Objects</code></a>:</td><td> </td><td valign="top"><a href="#No_005fLocal_005fProtected_005fObjects">No_Local_Protected_Objects</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fLocal_005fTiming_005fEvents"><code>No_Local_Timing_Events</code></a>:</td><td> </td><td valign="top"><a href="#No_005fLocal_005fTiming_005fEvents">No_Local_Timing_Events</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fNested_005fFinalization"><code>No_Nested_Finalization</code></a>:</td><td> </td><td valign="top"><a href="#No_005fNested_005fFinalization">No_Nested_Finalization</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fObsolescent_005fFeatures"><code>No_Obsolescent_Features</code></a>:</td><td> </td><td valign="top"><a href="#No_005fObsolescent_005fFeatures">No_Obsolescent_Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fProtected_005fTypes"><code>No_Protected_Types</code></a>:</td><td> </td><td valign="top"><a href="#No_005fProtected_005fTypes">No_Protected_Types</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fProtected_005fType_005fAllocators"><code>No_Protected_Type_Allocators</code></a>:</td><td> </td><td valign="top"><a href="#No_005fProtected_005fType_005fAllocators">No_Protected_Type_Allocators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fRecursion"><code>No_Recursion</code></a>:</td><td> </td><td valign="top"><a href="#No_005fRecursion">No_Recursion</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fReentrancy"><code>No_Reentrancy</code></a>:</td><td> </td><td valign="top"><a href="#No_005fReentrancy">No_Reentrancy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fRelative_005fDelay"><code>No_Relative_Delay</code></a>:</td><td> </td><td valign="top"><a href="#No_005fRelative_005fDelay">No_Relative_Delay</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fRequeue_005fStatements"><code>No_Requeue_Statements</code></a>:</td><td> </td><td valign="top"><a href="#No_005fRequeue_005fStatements">No_Requeue_Statements</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fReturn"><code>No_Return</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-No_005fReturn">Pragma No_Return</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fSecondary_005fStack"><code>No_Secondary_Stack</code></a>:</td><td> </td><td valign="top"><a href="#No_005fSecondary_005fStack">No_Secondary_Stack</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fSelect_005fStatements"><code>No_Select_Statements</code></a>:</td><td> </td><td valign="top"><a href="#No_005fSelect_005fStatements">No_Select_Statements</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fSpecification_005fof_005fAspect"><code>No_Specification_of_Aspect</code></a>:</td><td> </td><td valign="top"><a href="#No_005fSpecification_005fof_005fAspect">No_Specification_of_Aspect</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fSpecific_005fTermination_005fHandlers"><code>No_Specific_Termination_Handlers</code></a>:</td><td> </td><td valign="top"><a href="#No_005fSpecific_005fTermination_005fHandlers">No_Specific_Termination_Handlers</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fStandard_005fAllocators_005fAfter_005fElaboration"><code>No_Standard_Allocators_After_Elaboration</code></a>:</td><td> </td><td valign="top"><a href="#No_005fStandard_005fAllocators_005fAfter_005fElaboration">No_Standard_Allocators_After_Elaboration</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fStandard_005fStorage_005fPools"><code>No_Standard_Storage_Pools</code></a>:</td><td> </td><td valign="top"><a href="#No_005fStandard_005fStorage_005fPools">No_Standard_Storage_Pools</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fStreams"><code>No_Streams</code></a>:</td><td> </td><td valign="top"><a href="#No_005fStreams">No_Streams</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fStream_005fOptimizations"><code>No_Stream_Optimizations</code></a>:</td><td> </td><td valign="top"><a href="#No_005fStream_005fOptimizations">No_Stream_Optimizations</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fStrict_005fAliasing"><code>No_Strict_Aliasing</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-No_005fStrict_005fAliasing">Pragma No_Strict_Aliasing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fTasking"><code>No_Tasking</code></a>:</td><td> </td><td valign="top"><a href="#No_005fTasking">No_Tasking</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fTask_005fAllocators"><code>No_Task_Allocators</code></a>:</td><td> </td><td valign="top"><a href="#No_005fTask_005fAllocators">No_Task_Allocators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fTask_005fAttributes_005fPackage"><code>No_Task_Attributes_Package</code></a>:</td><td> </td><td valign="top"><a href="#No_005fTask_005fAttributes_005fPackage">No_Task_Attributes_Package</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fTask_005fHierarchy"><code>No_Task_Hierarchy</code></a>:</td><td> </td><td valign="top"><a href="#No_005fTask_005fHierarchy">No_Task_Hierarchy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fTask_005fTermination"><code>No_Task_Termination</code></a>:</td><td> </td><td valign="top"><a href="#No_005fTask_005fTermination">No_Task_Termination</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fTerminate_005fAlternatives"><code>No_Terminate_Alternatives</code></a>:</td><td> </td><td valign="top"><a href="#No_005fTerminate_005fAlternatives">No_Terminate_Alternatives</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fUnchecked_005fAccess"><code>No_Unchecked_Access</code></a>:</td><td> </td><td valign="top"><a href="#No_005fUnchecked_005fAccess">No_Unchecked_Access</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-No_005fWide_005fCharacters"><code>No_Wide_Characters</code></a>:</td><td> </td><td valign="top"><a href="#No_005fWide_005fCharacters">No_Wide_Characters</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Null_005fOccurrence_002c-testing-for">Null_Occurrence, testing for</a>:</td><td> </td><td valign="top"><a href="#Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029">Ada.Exceptions.Is_Null_Occurrence (a-einuoc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Null_005fOccurrence_002c-testing-for-1">Null_Occurrence, testing for</a>:</td><td> </td><td valign="top"><a href="#Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029">Ada.Exceptions.Last_Chance_Handler (a-elchha.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Null_005fParameter"><code>Null_Parameter</code></a>:</td><td> </td><td valign="top"><a href="#Null_005fParameter">Null_Parameter</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Numerics">Numerics</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-O">O</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Object_005fSize"><code>Object_Size</code></a>:</td><td> </td><td valign="top"><a href="#Object_005fSize">Object_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Object_005fSize-1"><code>Object_Size</code></a>:</td><td> </td><td valign="top"><a href="#Value_005fSize-and-Object_005fSize-Clauses">Value_Size and Object_Size Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Obsolescent"><code>Obsolescent</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Obsolescent">Pragma Obsolescent</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Ast_005fEntry">Pragma Ast_Entry</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-1">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-2">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fException">Pragma Export_Exception</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-3">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fFunction">Pragma Export_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-4">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fProcedure">Pragma Export_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-5">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fValued_005fProcedure">Pragma Export_Valued_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-6">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Float_005fRepresentation">Pragma Float_Representation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-7">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Ident">Pragma Ident</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-8">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fException">Pragma Import_Exception</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-9">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fFunction">Pragma Import_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-10">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Long_005fFloat">Pragma Long_Float</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-11">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Main">Pragma Main</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-12">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Main_005fStorage">Pragma Main_Storage</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-13">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Pragma-Time_005fSlice">Pragma Time_Slice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-14">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#AST_005fEntry">AST_Entry</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenVMS-15">OpenVMS</a>:</td><td> </td><td valign="top"><a href="#Mechanism_005fCode">Mechanism_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Operating-System-interface">Operating System interface</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029">GNAT.OS_Lib (g-os_lib.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Operations_002c-on-Address">Operations, on <code>Address</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Optimize_005fAlignment"><code>Optimize_Alignment</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Optimize_005fAlignment">Pragma Optimize_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ordered"><code>Ordered</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ordered">Pragma Ordered</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ordering_002c-of-bits">ordering, of bits</a>:</td><td> </td><td valign="top"><a href="#Bit_005fOrder-Clauses">Bit_Order Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ordering_002c-of-bytes">ordering, of bytes</a>:</td><td> </td><td valign="top"><a href="#Effect-of-Bit_005fOrder-on-Byte-Ordering">Effect of Bit_Order on Byte Ordering</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Overflow-checks"><code>Overflow checks</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Overflow_005fMode">Pragma Overflow_Mode</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Overflow-mode"><code>Overflow mode</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Overflow_005fMode">Pragma Overflow_Mode</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Overlaying-of-objects">Overlaying of objects</a>:</td><td> </td><td valign="top"><a href="#Address-Clauses">Address Clauses</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-P">P</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Package-Interfaces">Package <code>Interfaces</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Package-Interrupts">Package <code>Interrupts</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Package-Task_005fAttributes">Package <code>Task_Attributes</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Packed-Decimal">Packed Decimal</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029">Interfaces.Packed_Decimal (i-pacdec.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Packed-types">Packed types</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Parameters_002c-passing-mechanism">Parameters, passing mechanism</a>:</td><td> </td><td valign="top"><a href="#Mechanism_005fCode">Mechanism_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Parameters_002c-when-passed-by-reference">Parameters, when passed by reference</a>:</td><td> </td><td valign="top"><a href="#Passed_005fBy_005fReference">Passed_By_Reference</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Parameters_002c-when-passed-by-reference-1">Parameters, when passed by reference</a>:</td><td> </td><td valign="top"><a href="#Pool_005fAddress">Pool_Address</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Parsing">Parsing</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029">GNAT.AWK (g-awk.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Parsing-1">Parsing</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029">GNAT.Bounded_Buffers (g-boubuf.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Parsing-2">Parsing</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029">GNAT.Bounded_Mailboxes (g-boumai.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Partition-communication-subsystem">Partition communication subsystem</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Partition-interfacing-functions">Partition interfacing functions</a>:</td><td> </td><td valign="top"><a href="#System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029">System.Partition_Interface (s-parint.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Partition_005fElaboration_005fPolicy"><code>Partition_Elaboration_Policy</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Partition_005fElaboration_005fPolicy">Pragma Partition_Elaboration_Policy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Passed_005fBy_005fReference"><code>Passed_By_Reference</code></a>:</td><td> </td><td valign="top"><a href="#Passed_005fBy_005fReference">Passed_By_Reference</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Passing-by-copy">Passing by copy</a>:</td><td> </td><td valign="top"><a href="#Pragma-C_005fPass_005fBy_005fCopy">Pragma C_Pass_By_Copy</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Passing-by-descriptor">Passing by descriptor</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fFunction">Pragma Export_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Passing-by-descriptor-1">Passing by descriptor</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fProcedure">Pragma Export_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Passing-by-descriptor-2">Passing by descriptor</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fValued_005fProcedure">Pragma Export_Valued_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Passing-by-descriptor-3">Passing by descriptor</a>:</td><td> </td><td valign="top"><a href="#Pragma-Import_005fFunction">Pragma Import_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Passive"><code>Passive</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Passive">Pragma Passive</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pattern-matching">Pattern matching</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029">GNAT.Regexp (g-regexp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pattern-matching-1">Pattern matching</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029">GNAT.Regpat (g-regpat.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pattern-matching-2">Pattern matching</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029">GNAT.Spitbol.Patterns (g-spipat.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-PCS">PCS</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Persistent_005fBSS"><code>Persistent_BSS</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Persistent_005fBSS">Pragma Persistent_BSS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Polling"><code>Polling</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Polling">Pragma Polling</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pool_005fAddress"><code>Pool_Address</code></a>:</td><td> </td><td valign="top"><a href="#Pool_005fAddress">Pool_Address</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Portability">Portability</a>:</td><td> </td><td valign="top"><a href="#About-This-Guide">About This Guide</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Postconditions">Postconditions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Postcondition">Pragma Postcondition</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Postconditions-1"><code>Postconditions</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Postcondition">Pragma Postcondition</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pragma-Ada_005f2012">pragma <code>Ada_2012</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-of-Ada-2012-Features">Implementation of Ada 2012 Features</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pragma-Ordered"><code>pragma <code>Ordered</code></code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Ordered">Pragma Ordered</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pragma-Overflow_005fMode"><code>pragma <code>Overflow_Mode</code></code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Overflow_005fMode">Pragma Overflow_Mode</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pragma-Pack-_0028for-arrays_0029">Pragma Pack (for arrays)</a>:</td><td> </td><td valign="top"><a href="#Pragma-Pack-for-Arrays">Pragma Pack for Arrays</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pragma-Pack-_0028for-records_0029">Pragma Pack (for records)</a>:</td><td> </td><td valign="top"><a href="#Pragma-Pack-for-Records">Pragma Pack for Records</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pragma-Pack-_0028for-type-Natural_0029">Pragma Pack (for type Natural)</a>:</td><td> </td><td valign="top"><a href="#Pragma-Pack-for-Arrays">Pragma Pack for Arrays</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pragma-Pack-warning">Pragma Pack warning</a>:</td><td> </td><td valign="top"><a href="#Pragma-Pack-for-Arrays">Pragma Pack for Arrays</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pragma-Shared_005fPassive">pragma <code>Shared_Passive</code></a>:</td><td> </td><td valign="top"><a href="#GNAT-Implementation-of-Shared-Passive-Packages">GNAT Implementation of Shared Passive Packages</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pragma_002c-representation">Pragma, representation</a>:</td><td> </td><td valign="top"><a href="#Representation-Clauses-and-Pragmas">Representation Clauses and Pragmas</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pragmas">Pragmas</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pre_002delaboration-requirements">Pre-elaboration requirements</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Preconditions">Preconditions</a>:</td><td> </td><td valign="top"><a href="#Pragma-Precondition">Pragma Precondition</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Preconditions-1"><code>Preconditions</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Precondition">Pragma Precondition</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Preelaborable_005fInitialization"><code>Preelaborable_Initialization</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Preelaborable_005fInitialization">Pragma Preelaborable_Initialization</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Preemptive-abort">Preemptive abort</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Priority_002c-maximum">Priority, maximum</a>:</td><td> </td><td valign="top"><a href="#Max_005fPriority">Max_Priority</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Priority_005fSpecific_005fDispatching"><code>Priority_Specific_Dispatching</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Priority_005fSpecific_005fDispatching">Pragma Priority_Specific_Dispatching</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Protected-procedure-handlers">Protected procedure handlers</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Psect_005fObject"><code>Psect_Object</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Psect_005fObject">Pragma Psect_Object</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pure"><code>Pure</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Pure_005fFunction">Pragma Pure_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pure-packages_002c-exceptions">Pure packages, exceptions</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029">GNAT.Exceptions (g-except.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Pure_005fFunction"><code>Pure_Function</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Pure_005fFunction">Pragma Pure_Function</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-R">R</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Random-number-generation">Random number generation</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Random-number-generation-1">Random number generation</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029">GNAT.MBBS_Discrete_Random (g-mbdira.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Random-number-generation-2">Random number generation</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029">GNAT.MBBS_Float_Random (g-mbflra.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Random-number-generation-3">Random number generation</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029">GNAT.Random_Numbers (g-rannum.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Range_005fLength"><code>Range_Length</code></a>:</td><td> </td><td valign="top"><a href="#Range_005fLength">Range_Length</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Rational-compatibility-mode"><code>Rational compatibility mode</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Profile-_0028Rational_0029">Pragma Profile (Rational)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Rational-Profile">Rational Profile</a>:</td><td> </td><td valign="top"><a href="#Pragma-Implicit_005fPacking">Pragma Implicit_Packing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Rational-profile">Rational profile</a>:</td><td> </td><td valign="top"><a href="#Pragma-Use_005fVADS_005fSize">Pragma Use_VADS_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ravenscar"><code>Ravenscar</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Profile-_0028Ravenscar_0029">Pragma Profile (Ravenscar)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Read-attribute"><code>Read</code> attribute</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Real_002dTime-Systems-Annex-compliance">Real-Time Systems Annex compliance</a>:</td><td> </td><td valign="top"><a href="#Ensuring-Compliance-with-the-Real_002dTime-Annex">Ensuring Compliance with the Real-Time Annex</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Record-Representation-Clause">Record Representation Clause</a>:</td><td> </td><td valign="top"><a href="#Record-Representation-Clauses">Record Representation Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Record-representation-clauses">Record representation clauses</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Ref"><code>Ref</code></a>:</td><td> </td><td valign="top"><a href="#Ref">Ref</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Regular-expressions">Regular expressions</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029">GNAT.Regexp (g-regexp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Regular-expressions-1">Regular expressions</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029">GNAT.Regpat (g-regpat.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Relative_005fDeadline"><code>Relative_Deadline</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Relative_005fDeadline">Pragma Relative_Deadline</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Remote_005fAccess_005fType"><code>Remote_Access_Type</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Remote_005fAccess_005fType">Pragma Remote_Access_Type</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Removing-command-line-arguments">Removing command line arguments</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029">Ada.Command_Line.Remove (a-colire.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-Clause">Representation Clause</a>:</td><td> </td><td valign="top"><a href="#Representation-Clauses-and-Pragmas">Representation Clauses and Pragmas</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-clauses">Representation clauses</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-Clauses">Representation Clauses</a>:</td><td> </td><td valign="top"><a href="#Representation-Clauses-and-Pragmas">Representation Clauses and Pragmas</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-clauses_002c-enumeration">Representation clauses, enumeration</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-clauses_002c-records">Representation clauses, records</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-of-enums">Representation of enums</a>:</td><td> </td><td valign="top"><a href="#Enum_005fRep">Enum_Rep</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-of-enums-1">Representation of enums</a>:</td><td> </td><td valign="top"><a href="#Enum_005fVal">Enum_Val</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-of-wide-characters">Representation of wide characters</a>:</td><td> </td><td valign="top"><a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029">System.Wch_Cnv (s-wchcnv.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation-Pragma">Representation Pragma</a>:</td><td> </td><td valign="top"><a href="#Representation-Clauses-and-Pragmas">Representation Clauses and Pragmas</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Representation_002c-determination-of">Representation, determination of</a>:</td><td> </td><td valign="top"><a href="#Determining-the-Representations-chosen-by-GNAT">Determining the Representations chosen by GNAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Response-file-for-command-line">Response file for command line</a>:</td><td> </td><td valign="top"><a href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029">Ada.Command_Line.Response_File (a-clrefi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Restricted-Run-Time"><code>Restricted Run Time</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Profile-_0028Restricted_0029">Pragma Profile (Restricted)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Restrictions-definitions">Restrictions definitions</a>:</td><td> </td><td valign="top"><a href="#System_002eRident-_0028s_002drident_002eads_0029">System.Rident (s-rident.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Restriction_005fWarnings"><code>Restriction_Warnings</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Restriction_005fWarnings">Pragma Restriction_Warnings</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Result"><code>Result</code></a>:</td><td> </td><td valign="top"><a href="#Result">Result</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Return-values_002c-passing-mechanism">Return values, passing mechanism</a>:</td><td> </td><td valign="top"><a href="#Mechanism_005fCode">Mechanism_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Rotate_005fLeft">Rotate_Left</a>:</td><td> </td><td valign="top"><a href="#Shifts-and-Rotates">Shifts and Rotates</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Rotate_005fRight">Rotate_Right</a>:</td><td> </td><td valign="top"><a href="#Shifts-and-Rotates">Shifts and Rotates</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Run_002dtime-restrictions-access">Run-time restrictions access</a>:</td><td> </td><td valign="top"><a href="#System_002eRestrictions-_0028s_002drestri_002eads_0029">System.Restrictions (s-restri.ads)</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-S">S</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Safe_005fEmax"><code>Safe_Emax</code></a>:</td><td> </td><td valign="top"><a href="#Safe_005fEmax">Safe_Emax</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Safe_005fLarge"><code>Safe_Large</code></a>:</td><td> </td><td valign="top"><a href="#Safe_005fLarge">Safe_Large</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Scalar-storage-order">Scalar storage order</a>:</td><td> </td><td valign="top"><a href="#Scalar_005fStorage_005fOrder">Scalar_Storage_Order</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Scalar_005fStorage_005fOrder"><code>Scalar_Storage_Order</code></a>:</td><td> </td><td valign="top"><a href="#Scalar_005fStorage_005fOrder">Scalar_Storage_Order</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Secondary-Stack-Info">Secondary Stack Info</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029">GNAT.Secondary_Stack_Info (g-sestin.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Secure-Hash-Algorithm-SHA_002d1">Secure Hash Algorithm SHA-1</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA1-_0028g_002dsha1_002eads_0029">GNAT.SHA1 (g-sha1.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Secure-Hash-Algorithm-SHA_002d224">Secure Hash Algorithm SHA-224</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA224-_0028g_002dsha224_002eads_0029">GNAT.SHA224 (g-sha224.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Secure-Hash-Algorithm-SHA_002d256">Secure Hash Algorithm SHA-256</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA256-_0028g_002dsha256_002eads_0029">GNAT.SHA256 (g-sha256.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Secure-Hash-Algorithm-SHA_002d384">Secure Hash Algorithm SHA-384</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA384-_0028g_002dsha384_002eads_0029">GNAT.SHA384 (g-sha384.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Secure-Hash-Algorithm-SHA_002d512">Secure Hash Algorithm SHA-512</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSHA512-_0028g_002dsha512_002eads_0029">GNAT.SHA512 (g-sha512.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Semaphores">Semaphores</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029">GNAT.Semaphores (g-semaph.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sequential-elaboration-policy">Sequential elaboration policy</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Serial_005fCommunications">Serial_Communications</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029">GNAT.Serial_Communications (g-sercom.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sets-of-strings">Sets of strings</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029">GNAT.Spitbol.Table_Boolean (g-sptabo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Shared"><code>Shared</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Shared">Pragma Shared</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Shared-passive-packages">Shared passive packages</a>:</td><td> </td><td valign="top"><a href="#GNAT-Implementation-of-Shared-Passive-Packages">GNAT Implementation of Shared Passive Packages</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SHARED_005fMEMORY_005fDIRECTORY-environment-variable"><code>SHARED_MEMORY_DIRECTORY</code> environment variable</a>:</td><td> </td><td valign="top"><a href="#GNAT-Implementation-of-Shared-Passive-Packages">GNAT Implementation of Shared Passive Packages</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Shift_005fLeft">Shift_Left</a>:</td><td> </td><td valign="top"><a href="#Shifts-and-Rotates">Shifts and Rotates</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Shift_005fRight">Shift_Right</a>:</td><td> </td><td valign="top"><a href="#Shifts-and-Rotates">Shifts and Rotates</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Shift_005fRight_005fArithmetic">Shift_Right_Arithmetic</a>:</td><td> </td><td valign="top"><a href="#Shifts-and-Rotates">Shifts and Rotates</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Short_005fCircuit_005fAnd_005fOr"><code>Short_Circuit_And_Or</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Short_005fCircuit_005fAnd_005fOr">Pragma Short_Circuit_And_Or</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Short_005fDescriptors"><code>Short_Descriptors</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Short_005fDescriptors">Pragma Short_Descriptors</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Signals">Signals</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSignals-_0028g_002dsignal_002eads_0029">GNAT.Signals (g-signal.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Simple-I_002fO">Simple I/O</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eIO-_0028g_002dio_002eads_0029">GNAT.IO (g-io.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Simple-storage-pool">Simple storage pool</a>:</td><td> </td><td valign="top"><a href="#Pragma-Simple_005fStorage_005fPool_005fType">Pragma Simple_Storage_Pool_Type</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Simple-storage-pool-1">Simple storage pool</a>:</td><td> </td><td valign="top"><a href="#Simple_005fStorage_005fPool">Simple_Storage_Pool</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Simple_005fBarriers"><code>Simple_Barriers</code></a>:</td><td> </td><td valign="top"><a href="#Simple_005fBarriers">Simple_Barriers</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Simple_005fStorage_005fPool"><code>Simple_Storage_Pool</code></a>:</td><td> </td><td valign="top"><a href="#Simple_005fStorage_005fPool">Simple_Storage_Pool</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Simple_005fStorage_005fPool_005fType"><code>Simple_Storage_Pool_Type</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Simple_005fStorage_005fPool_005fType">Pragma Simple_Storage_Pool_Type</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size-Clause">Size Clause</a>:</td><td> </td><td valign="top"><a href="#Size-Clauses">Size Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size-clauses"><code>Size</code> clauses</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size-for-biased-representation">Size for biased representation</a>:</td><td> </td><td valign="top"><a href="#Biased-Representation">Biased Representation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size-of-Address">Size of <code>Address</code></a>:</td><td> </td><td valign="top"><a href="#Address_005fSize">Address_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size_002c-of-objects">Size, of objects</a>:</td><td> </td><td valign="top"><a href="#Value_005fSize-and-Object_005fSize-Clauses">Value_Size and Object_Size Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size_002c-setting-for-not_002dfirst-subtype"><code>Size</code>, setting for not-first subtype</a>:</td><td> </td><td valign="top"><a href="#Value_005fSize">Value_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size_002c-used-for-objects">Size, used for objects</a>:</td><td> </td><td valign="top"><a href="#Object_005fSize">Object_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size_002c-VADS-compatibility"><code>Size</code>, VADS compatibility</a>:</td><td> </td><td valign="top"><a href="#Pragma-Use_005fVADS_005fSize">Pragma Use_VADS_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size_002c-VADS-compatibility-1"><code>Size</code>, VADS compatibility</a>:</td><td> </td><td valign="top"><a href="#VADS_005fSize">VADS_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Size_002c-variant-record-objects">Size, variant record objects</a>:</td><td> </td><td valign="top"><a href="#Size-of-Variant-Record-Objects">Size of Variant Record Objects</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Small"><code>Small</code></a>:</td><td> </td><td valign="top"><a href="#Small">Small</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sockets">Sockets</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSockets-_0028g_002dsocket_002eads_0029">GNAT.Sockets (g-socket.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sorting">Sorting</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029">GNAT.Bubble_Sort (g-bubsor.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sorting-1">Sorting</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029">GNAT.Bubble_Sort_A (g-busora.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sorting-2">Sorting</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029">GNAT.Bubble_Sort_G (g-busorg.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sorting-3">Sorting</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029">GNAT.Heap_Sort (g-heasor.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sorting-4">Sorting</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029">GNAT.Heap_Sort_A (g-hesora.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Sorting-5">Sorting</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029">GNAT.Heap_Sort_G (g-hesorg.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Source-Information">Source Information</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029">GNAT.Source_Info (g-souinf.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Source_005fFile_005fName"><code>Source_File_Name</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Source_005fFile_005fName">Pragma Source_File_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Source_005fFile_005fName_005fProject"><code>Source_File_Name_Project</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Source_005fFile_005fName_005fProject">Pragma Source_File_Name_Project</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Source_005fLocation">Source_Location</a>:</td><td> </td><td valign="top"><a href="#Source_005fLocation">Source_Location</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Source_005fReference"><code>Source_Reference</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Source_005fReference">Pragma Source_Reference</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPARK"><code>SPARK</code></a>:</td><td> </td><td valign="top"><a href="#SPARK">SPARK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Spawn-capability">Spawn capability</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029">GNAT.OS_Lib (g-os_lib.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Spell-checking">Spell checking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029">GNAT.Spelling_Checker (g-speche.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Spell-checking-1">Spell checking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029">GNAT.Spelling_Checker_Generic (g-spchge.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Spell-checking-2">Spell checking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029">GNAT.UTF_32_Spelling_Checker (g-u3spch.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Spell-checking-3">Spell checking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029">GNAT.Wide_Spelling_Checker (g-wispch.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Spell-checking-4">Spell checking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029">GNAT.Wide_Wide_Spelling_Checker (g-zspche.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPITBOL-interface">SPITBOL interface</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029">GNAT.Spitbol (g-spitbo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPITBOL-pattern-matching">SPITBOL pattern matching</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029">GNAT.Spitbol.Patterns (g-spipat.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPITBOL-Tables">SPITBOL Tables</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029">GNAT.Spitbol.Table_Boolean (g-sptabo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPITBOL-Tables-1">SPITBOL Tables</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029">GNAT.Spitbol.Table_Integer (g-sptain.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPITBOL-Tables-2">SPITBOL Tables</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Static_005fElaboration_005fDesired"><code>Static_Elaboration_Desired</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Static_005fElaboration_005fDesired">Pragma Static_Elaboration_Desired</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Static_005fPriorities"><code>Static_Priorities</code></a>:</td><td> </td><td valign="top"><a href="#Static_005fPriorities">Static_Priorities</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Static_005fStorage_005fSize"><code>Static_Storage_Size</code></a>:</td><td> </td><td valign="top"><a href="#Static_005fStorage_005fSize">Static_Storage_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage-place-attributes">Storage place attributes</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage-pool_002c-global">Storage pool, global</a>:</td><td> </td><td valign="top"><a href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029">System.Pool_Global (s-pooglo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage-pool_002c-local">Storage pool, local</a>:</td><td> </td><td valign="top"><a href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029">System.Pool_Local (s-pooloc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage-pool_002c-simple">Storage pool, simple</a>:</td><td> </td><td valign="top"><a href="#Pragma-Simple_005fStorage_005fPool_005fType">Pragma Simple_Storage_Pool_Type</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage-pool_002c-simple-1">Storage pool, simple</a>:</td><td> </td><td valign="top"><a href="#Simple_005fStorage_005fPool">Simple_Storage_Pool</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage_005fSize-Clause">Storage_Size Clause</a>:</td><td> </td><td valign="top"><a href="#Storage_005fSize-Clauses">Storage_Size Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage_005fUnit"><code>Storage_Unit</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Storage_005fUnit-1"><code>Storage_Unit</code></a>:</td><td> </td><td valign="top"><a href="#Storage_005fUnit">Storage_Unit</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Stream-files">Stream files</a>:</td><td> </td><td valign="top"><a href="#Treating-Text_005fIO-Files-as-Streams">Treating Text_IO Files as Streams</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Stream-operations">Stream operations</a>:</td><td> </td><td valign="top"><a href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029">System.Strings.Stream_Ops (s-ststop.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Stream-oriented-attributes">Stream oriented attributes</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Stream-oriented-attributes-1">Stream oriented attributes</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Stream_005fConvert"><code>Stream_Convert</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Stream_005fConvert">Pragma Stream_Convert</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-String-decoding">String decoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-String-encoding">String encoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-String-maps">String maps</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029">GNAT.Spitbol.Table_VString (g-sptavs.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-String-splitter">String splitter</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029">GNAT.String_Split (g-strspl.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-String-stream-operations">String stream operations</a>:</td><td> </td><td valign="top"><a href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029">System.Strings.Stream_Ops (s-ststop.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Stub_005fType"><code>Stub_Type</code></a>:</td><td> </td><td valign="top"><a href="#Stub_005fType">Stub_Type</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Style_005fChecks"><code>Style_Checks</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Style_005fChecks">Pragma Style_Checks</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Subprogram-address">Subprogram address</a>:</td><td> </td><td valign="top"><a href="#Code_005fAddress">Code_Address</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Subtitle"><code>Subtitle</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Subtitle">Pragma Subtitle</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppress"><code>Suppress</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Suppress">Pragma Suppress</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppressing-external-name">Suppressing external name</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fFunction">Pragma Export_Function</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppressing-external-name-1">Suppressing external name</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fProcedure">Pragma Export_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppressing-external-name-2">Suppressing external name</a>:</td><td> </td><td valign="top"><a href="#Pragma-Export_005fValued_005fProcedure">Pragma Export_Valued_Procedure</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppressing-initialization">Suppressing initialization</a>:</td><td> </td><td valign="top"><a href="#Pragma-Suppress_005fInitialization">Pragma Suppress_Initialization</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppression-of-checks">Suppression of checks</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppress_005fAll"><code>Suppress_All</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Suppress_005fAll">Pragma Suppress_All</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppress_005fException_005fLocations"><code>Suppress_Exception_Locations</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Suppress_005fException_005fLocations">Pragma Suppress_Exception_Locations</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Suppress_005fInitialization"><code>Suppress_Initialization</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Suppress_005fInitialization">Pragma Suppress_Initialization</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-extending"><code>system</code>, extending</a>:</td><td> </td><td valign="top"><a href="#Pragma-Extend_005fSystem">Pragma Extend_System</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eAddress_005fImage-_0028s_002daddima_002eads_0029"><code>System.Address_Image</code> (<samp>s-addima.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029">System.Address_Image (s-addima.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eAssertions-_0028s_002dassert_002eads_0029"><code>System.Assertions</code> (<samp>s-assert.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eAssertions-_0028s_002dassert_002eads_0029">System.Assertions (s-assert.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eMemory-_0028s_002dmemory_002eads_0029"><code>System.Memory</code> (<samp>s-memory.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eMemory-_0028s_002dmemory_002eads_0029">System.Memory (s-memory.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029"><code>System.Partition_Interface</code> (<samp>s-parint.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029">System.Partition_Interface (s-parint.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029"><code>System.Pool_Global</code> (<samp>s-pooglo.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029">System.Pool_Global (s-pooglo.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029"><code>System.Pool_Local</code> (<samp>s-pooloc.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029">System.Pool_Local (s-pooloc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eRestrictions-_0028s_002drestri_002eads_0029"><code>System.Restrictions</code> (<samp>s-restri.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eRestrictions-_0028s_002drestri_002eads_0029">System.Restrictions (s-restri.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eRident-_0028s_002drident_002eads_0029"><code>System.Rident</code> (<samp>s-rident.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eRident-_0028s_002drident_002eads_0029">System.Rident (s-rident.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029"><code>System.Strings.Stream_Ops</code> (<samp>s-ststop.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029">System.Strings.Stream_Ops (s-ststop.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029"><code>System.Task_Info</code> (<samp>s-tasinf.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029">System.Task_Info (s-tasinf.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029"><code>System.Wch_Cnv</code> (<samp>s-wchcnv.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029">System.Wch_Cnv (s-wchcnv.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029"><code>System.Wch_Con</code> (<samp>s-wchcon.ads</samp>)</a>:</td><td> </td><td valign="top"><a href="#System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029">System.Wch_Con (s-wchcon.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-System_005fAllocator_005fAlignment"><code>System_Allocator_Alignment</code></a>:</td><td> </td><td valign="top"><a href="#System_005fAllocator_005fAlignment">System_Allocator_Alignment</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-T">T</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Table-implementation">Table implementation</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029">GNAT.Dynamic_Tables (g-dyntab.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Table-implementation-1">Table implementation</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTable-_0028g_002dtable_002eads_0029">GNAT.Table (g-table.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Target_005fName"><code>Target_Name</code></a>:</td><td> </td><td valign="top"><a href="#Target_005fName">Target_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task-locking">Task locking</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029">GNAT.Task_Lock (g-tasloc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task-specific-storage">Task specific storage</a>:</td><td> </td><td valign="top"><a href="#Pragma-Thread_005fLocal_005fStorage">Pragma Thread_Local_Storage</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task-synchronization">Task synchronization</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029">GNAT.Task_Lock (g-tasloc.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Tasking-restrictions">Tasking restrictions</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task_005fAttributes"><code>Task_Attributes</code></a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task_005fInfo"><code>Task_Info</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Task_005fInfo">Pragma Task_Info</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task_005fInfo-pragma">Task_Info pragma</a>:</td><td> </td><td valign="top"><a href="#System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029">System.Task_Info (s-tasinf.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task_005fName"><code>Task_Name</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Task_005fName">Pragma Task_Name</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Task_005fStorage"><code>Task_Storage</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Task_005fStorage">Pragma Task_Storage</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Test-cases">Test cases</a>:</td><td> </td><td valign="top"><a href="#Pragma-Test_005fCase">Pragma Test_Case</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Test_005fCase"><code>Test_Case</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Test_005fCase">Pragma Test_Case</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Text_005fIO">Text_IO</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029">GNAT.IO_Aux (g-io_aux.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Text_005fIO-extensions">Text_IO extensions</a>:</td><td> </td><td valign="top"><a href="#Text_005fIO-Extensions">Text_IO Extensions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Text_005fIO-for-unbounded-strings">Text_IO for unbounded strings</a>:</td><td> </td><td valign="top"><a href="#Text_005fIO-Facilities-for-Unbounded-Strings">Text_IO Facilities for Unbounded Strings</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Text_005fIO-resetting-standard-files"><code>Text_IO</code> resetting standard files</a>:</td><td> </td><td valign="top"><a href="#Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029">Ada.Text_IO.Reset_Standard_Files (a-tirsfi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Text_005fIO_002c-extensions-for-unbounded-strings"><code>Text_IO</code>, extensions for unbounded strings</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029">Ada.Strings.Unbounded.Text_IO (a-suteio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Text_005fIO_002c-extensions-for-unbounded-wide-strings"><code>Text_IO</code>, extensions for unbounded wide strings</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029">Ada.Strings.Wide_Unbounded.Wide_Text_IO (a-swuwti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Text_005fIO_002c-extensions-for-unbounded-wide-wide-strings"><code>Text_IO</code>, extensions for unbounded wide wide strings</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029">Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO (a-szuzti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Threads_002c-foreign">Threads, foreign</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029">GNAT.Threads (g-thread.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Thread_005fLocal_005fStorage"><code>Thread_Local_Storage</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Thread_005fLocal_005fStorage">Pragma Thread_Local_Storage</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Tick"><code>Tick</code></a>:</td><td> </td><td valign="top"><a href="#Tick">Tick</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Time">Time</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029">GNAT.Calendar.Time_IO (g-catiio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Time-stamp">Time stamp</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029">GNAT.Time_Stamp (g-timsta.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Time_002c-monotonic">Time, monotonic</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Time_005fSlice"><code>Time_Slice</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Time_005fSlice">Pragma Time_Slice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Title"><code>Title</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Title">Pragma Title</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TLS-_0028Thread-Local-Storage_0029">TLS (Thread Local Storage)</a>:</td><td> </td><td valign="top"><a href="#Pragma-Thread_005fLocal_005fStorage">Pragma Thread_Local_Storage</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-To_005fAddress"><code>To_Address</code></a>:</td><td> </td><td valign="top"><a href="#To_005fAddress">To_Address</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-To_005fAddress-1"><code>To_Address</code></a>:</td><td> </td><td valign="top"><a href="#Address-Clauses">Address Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Trace-back-facilities">Trace back facilities</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029">GNAT.Traceback (g-traceb.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Trace-back-facilities-1">Trace back facilities</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029">GNAT.Traceback.Symbolic (g-trasym.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Traceback-for-Exception-Occurrence">Traceback for Exception Occurrence</a>:</td><td> </td><td valign="top"><a href="#Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029">Ada.Exceptions.Traceback (a-exctra.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trampoline">trampoline</a>:</td><td> </td><td valign="top"><a href="#No_005fImplicit_005fDynamic_005fCode">No_Implicit_Dynamic_Code</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Type_005fClass"><code>Type_Class</code></a>:</td><td> </td><td valign="top"><a href="#Type_005fClass">Type_Class</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Typographical-conventions">Typographical conventions</a>:</td><td> </td><td valign="top"><a href="#Conventions">Conventions</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-U">U</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-UET_005fAddress"><code>UET_Address</code></a>:</td><td> </td><td valign="top"><a href="#UET_005fAddress">UET_Address</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unbounded_005fString_002c-IO-support"><code>Unbounded_String</code>, IO support</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029">Ada.Strings.Unbounded.Text_IO (a-suteio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unbounded_005fString_002c-Text_005fIO-operations">Unbounded_String, Text_IO operations</a>:</td><td> </td><td valign="top"><a href="#Text_005fIO-Facilities-for-Unbounded-Strings">Text_IO Facilities for Unbounded Strings</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unbounded_005fWide_005fString_002c-IO-support"><code>Unbounded_Wide_String</code>, IO support</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029">Ada.Strings.Wide_Unbounded.Wide_Text_IO (a-swuwti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unbounded_005fWide_005fWide_005fString_002c-IO-support"><code>Unbounded_Wide_Wide_String</code>, IO support</a>:</td><td> </td><td valign="top"><a href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029">Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO (a-szuzti.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unchecked-conversion">Unchecked conversion</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unchecked-deallocation">Unchecked deallocation</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unchecked_005fUnion"><code>Unchecked_Union</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Unchecked_005fUnion">Pragma Unchecked_Union</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unconstrained_005fArray"><code>Unconstrained_Array</code></a>:</td><td> </td><td valign="top"><a href="#Unconstrained_005fArray">Unconstrained_Array</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unicode">Unicode</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unicode-1">Unicode</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unicode-2">Unicode</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unicode-3">Unicode</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unicode-categorization_002c-Wide_005fCharacter">Unicode categorization, Wide_Character</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029">Ada.Wide_Characters.Unicode (a-wichun.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unicode-categorization_002c-Wide_005fWide_005fCharacter">Unicode categorization, Wide_Wide_Character</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029">Ada.Wide_Wide_Characters.Unicode (a-zchuni.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unimplemented_005fUnit"><code>Unimplemented_Unit</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Unimplemented_005fUnit">Pragma Unimplemented_Unit</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unions-in-C">Unions in C</a>:</td><td> </td><td valign="top"><a href="#Pragma-Unchecked_005fUnion">Pragma Unchecked_Union</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Universal_005fAliasing"><code>Universal_Aliasing</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Universal_005fAliasing">Pragma Universal_Aliasing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Universal_005fData"><code>Universal_Data</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Universal_005fData">Pragma Universal_Data</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Universal_005fLiteral_005fString"><code>Universal_Literal_String</code></a>:</td><td> </td><td valign="top"><a href="#Universal_005fLiteral_005fString">Universal_Literal_String</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unmodified"><code>Unmodified</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Unmodified">Pragma Unmodified</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unreferenced"><code>Unreferenced</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Unreferenced">Pragma Unreferenced</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unreferenced_005fObjects"><code>Unreferenced_Objects</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Unreferenced_005fObjects">Pragma Unreferenced_Objects</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unreserve_005fAll_005fInterrupts"><code>Unreserve_All_Interrupts</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Unreserve_005fAll_005fInterrupts">Pragma Unreserve_All_Interrupts</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unrestricted_005fAccess"><code>Unrestricted_Access</code></a>:</td><td> </td><td valign="top"><a href="#Unrestricted_005fAccess">Unrestricted_Access</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Unsuppress"><code>Unsuppress</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Unsuppress">Pragma Unsuppress</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Use_005fVADS_005fSize"><code>Use_VADS_Size</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Use_005fVADS_005fSize">Pragma Use_VADS_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UTF_002d8">UTF-8</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UTF_002d8-1">UTF-8</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UTF_002d8-2">UTF-8</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UTF_002d8-3">UTF-8</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UTF_002d8-representation">UTF-8 representation</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029">GNAT.Byte_Order_Mark (g-byorma.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UTF_002d8-string-decoding">UTF-8 string decoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UTF_002d8-string-encoding">UTF-8 string encoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-V">V</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-VADS_005fSize"><code>VADS_Size</code></a>:</td><td> </td><td valign="top"><a href="#VADS_005fSize">VADS_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Validity_005fChecks"><code>Validity_Checks</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Validity_005fChecks">Pragma Validity_Checks</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Valid_005fScalars"><code>Valid_Scalars</code></a>:</td><td> </td><td valign="top"><a href="#Valid_005fScalars">Valid_Scalars</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Value_005fSize"><code>Value_Size</code></a>:</td><td> </td><td valign="top"><a href="#Value_005fSize">Value_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Value_005fSize-1"><code>Value_Size</code></a>:</td><td> </td><td valign="top"><a href="#Value_005fSize-and-Object_005fSize-Clauses">Value_Size and Object_Size Clauses</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Variant-record-objects_002c-size">Variant record objects, size</a>:</td><td> </td><td valign="top"><a href="#Size-of-Variant-Record-Objects">Size of Variant Record Objects</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Version_002c-of-compiler">Version, of compiler</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029">GNAT.Compiler_Version (g-comver.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Volatile"><code>Volatile</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Volatile">Pragma Volatile</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-VxWorks_002c-Get_005fImmediate">VxWorks, Get_Immediate</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">Interfaces.VxWorks.IO (i-vxwoio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-VxWorks_002c-I_002fO-interfacing">VxWorks, I/O interfacing</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">Interfaces.VxWorks.IO (i-vxwoio.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-VxWorks_002c-interfacing">VxWorks, interfacing</a>:</td><td> </td><td valign="top"><a href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029">Interfaces.VxWorks (i-vxwork.ads)</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-W">W</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Warnings"><code>Warnings</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Warnings">Pragma Warnings</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Warnings_002c-unmodified">Warnings, unmodified</a>:</td><td> </td><td valign="top"><a href="#Pragma-Unmodified">Pragma Unmodified</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Warnings_002c-unreferenced">Warnings, unreferenced</a>:</td><td> </td><td valign="top"><a href="#Pragma-Unreferenced">Pragma Unreferenced</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Warnings_002c-unreferenced-1">Warnings, unreferenced</a>:</td><td> </td><td valign="top"><a href="#Pragma-Unreferenced_005fObjects">Pragma Unreferenced_Objects</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wchar_005fT_005fSize"><code>Wchar_T_Size</code></a>:</td><td> </td><td valign="top"><a href="#Wchar_005fT_005fSize">Wchar_T_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Weak_005fExternal"><code>Weak_External</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Weak_005fExternal">Pragma Weak_External</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-characte-representations">Wide characte representations</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029">GNAT.Byte_Order_Mark (g-byorma.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-character-codes">Wide character codes</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029">GNAT.UTF_32 (g-utf_32.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-character-decoding">Wide character decoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">GNAT.Decode_UTF8_String (g-deutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-character-encoding">Wide character encoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">GNAT.Decode_String (g-decstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-character-encoding-1">Wide character encoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">GNAT.Encode_String (g-encstr.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-character-encoding-2">Wide character encoding</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">GNAT.Encode_UTF8_String (g-enutst.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-Character_002c-Representation">Wide Character, Representation</a>:</td><td> </td><td valign="top"><a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029">System.Wch_Cnv (s-wchcnv.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide-String_002c-Conversion">Wide String, Conversion</a>:</td><td> </td><td valign="top"><a href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029">System.Wch_Cnv (s-wchcnv.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide_005fCharacter_005fEncoding"><code>Wide_Character_Encoding</code></a>:</td><td> </td><td valign="top"><a href="#Pragma-Wide_005fCharacter_005fEncoding">Pragma Wide_Character_Encoding</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide_005fString-splitter">Wide_String splitter</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029">GNAT.Wide_String_Split (g-wistsp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide_005fText_005fIO-resetting-standard-files"><code>Wide_Text_IO</code> resetting standard files</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029">Ada.Wide_Text_IO.Reset_Standard_Files (a-wrstfi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide_005fWide_005fString-splitter">Wide_Wide_String splitter</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029">GNAT.Wide_Wide_String_Split (g-zistsp.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wide_005fWide_005fText_005fIO-resetting-standard-files"><code>Wide_Wide_Text_IO</code> resetting standard files</a>:</td><td> </td><td valign="top"><a href="#Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029">Ada.Wide_Wide_Text_IO.Reset_Standard_Files (a-zrstfi.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Windows-Registry">Windows Registry</a>:</td><td> </td><td valign="top"><a href="#GNAT_002eRegistry-_0028g_002dregist_002eads_0029">GNAT.Registry (g-regist.ads)</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Word_005fSize"><code>Word_Size</code></a>:</td><td> </td><td valign="top"><a href="#Word_005fSize">Word_Size</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Write-attribute"><code>Write</code> attribute</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-X">X</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-XDR-representation">XDR representation</a>:</td><td> </td><td valign="top"><a href="#Implementation-Advice">Implementation Advice</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Index_cp_letter-Z">Z</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Zero-address_002c-passing">Zero address, passing</a>:</td><td> </td><td valign="top"><a href="#Null_005fParameter">Null_Parameter</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
</table>
<table><tr><th valign="top">Jump to: </th><td><a class="summary-letter" href="#Index_cp_symbol-1"><b>-</b></a>
<a class="summary-letter" href="#Index_cp_symbol-2"><b>_</b></a>
<br>
<a class="summary-letter" href="#Index_cp_letter-A"><b>A</b></a>
<a class="summary-letter" href="#Index_cp_letter-B"><b>B</b></a>
<a class="summary-letter" href="#Index_cp_letter-C"><b>C</b></a>
<a class="summary-letter" href="#Index_cp_letter-D"><b>D</b></a>
<a class="summary-letter" href="#Index_cp_letter-E"><b>E</b></a>
<a class="summary-letter" href="#Index_cp_letter-F"><b>F</b></a>
<a class="summary-letter" href="#Index_cp_letter-G"><b>G</b></a>
<a class="summary-letter" href="#Index_cp_letter-H"><b>H</b></a>
<a class="summary-letter" href="#Index_cp_letter-I"><b>I</b></a>
<a class="summary-letter" href="#Index_cp_letter-K"><b>K</b></a>
<a class="summary-letter" href="#Index_cp_letter-L"><b>L</b></a>
<a class="summary-letter" href="#Index_cp_letter-M"><b>M</b></a>
<a class="summary-letter" href="#Index_cp_letter-N"><b>N</b></a>
<a class="summary-letter" href="#Index_cp_letter-O"><b>O</b></a>
<a class="summary-letter" href="#Index_cp_letter-P"><b>P</b></a>
<a class="summary-letter" href="#Index_cp_letter-R"><b>R</b></a>
<a class="summary-letter" href="#Index_cp_letter-S"><b>S</b></a>
<a class="summary-letter" href="#Index_cp_letter-T"><b>T</b></a>
<a class="summary-letter" href="#Index_cp_letter-U"><b>U</b></a>
<a class="summary-letter" href="#Index_cp_letter-V"><b>V</b></a>
<a class="summary-letter" href="#Index_cp_letter-W"><b>W</b></a>
<a class="summary-letter" href="#Index_cp_letter-X"><b>X</b></a>
<a class="summary-letter" href="#Index_cp_letter-Z"><b>Z</b></a>
</td></tr></table>
<a name="SEC_Contents"></a>
<h2 class="contents-heading">Table of Contents</h2>
<div class="contents">
<ul class="no-bullet">
<li><a name="toc-About-This-Guide-1" href="#About-This-Guide">About This Guide</a>
<ul class="no-bullet">
<li><a name="toc-What-This-Reference-Manual-Contains-1" href="#What-This-Reference-Manual-Contains">What This Reference Manual Contains</a></li>
<li><a name="toc-Conventions-1" href="#Conventions">Conventions</a></li>
<li><a name="toc-Related-Information-1" href="#Related-Information">Related Information</a></li>
</ul></li>
<li><a name="toc-Implementation-Defined-Pragmas-1" href="#Implementation-Defined-Pragmas">1 Implementation Defined Pragmas</a>
<ul class="no-bullet">
<li><a name="toc-Pragma-Abort_005fDefer-1" href="#Pragma-Abort_005fDefer">Pragma Abort_Defer</a></li>
<li><a name="toc-Pragma-Ada_005f83-1" href="#Pragma-Ada_005f83">Pragma Ada_83</a></li>
<li><a name="toc-Pragma-Ada_005f95-1" href="#Pragma-Ada_005f95">Pragma Ada_95</a></li>
<li><a name="toc-Pragma-Ada_005f05-1" href="#Pragma-Ada_005f05">Pragma Ada_05</a></li>
<li><a name="toc-Pragma-Ada_005f2005-1" href="#Pragma-Ada_005f2005">Pragma Ada_2005</a></li>
<li><a name="toc-Pragma-Ada_005f12-1" href="#Pragma-Ada_005f12">Pragma Ada_12</a></li>
<li><a name="toc-Pragma-Ada_005f2012-1" href="#Pragma-Ada_005f2012">Pragma Ada_2012</a></li>
<li><a name="toc-Pragma-Annotate-1" href="#Pragma-Annotate">Pragma Annotate</a></li>
<li><a name="toc-Pragma-Assert-1" href="#Pragma-Assert">Pragma Assert</a></li>
<li><a name="toc-Pragma-Assertion_005fPolicy-1" href="#Pragma-Assertion_005fPolicy">Pragma Assertion_Policy</a></li>
<li><a name="toc-Pragma-Assume_005fNo_005fInvalid_005fValues-1" href="#Pragma-Assume_005fNo_005fInvalid_005fValues">Pragma Assume_No_Invalid_Values</a></li>
<li><a name="toc-Pragma-Ast_005fEntry-1" href="#Pragma-Ast_005fEntry">Pragma Ast_Entry</a></li>
<li><a name="toc-Pragma-Attribute_005fDefinition-1" href="#Pragma-Attribute_005fDefinition">Pragma Attribute_Definition</a></li>
<li><a name="toc-Pragma-C_005fPass_005fBy_005fCopy-1" href="#Pragma-C_005fPass_005fBy_005fCopy">Pragma C_Pass_By_Copy</a></li>
<li><a name="toc-Pragma-Check-1" href="#Pragma-Check">Pragma Check</a></li>
<li><a name="toc-Pragma-Check_005fFloat_005fOverflow-1" href="#Pragma-Check_005fFloat_005fOverflow">Pragma Check_Float_Overflow</a></li>
<li><a name="toc-Pragma-Check_005fName-1" href="#Pragma-Check_005fName">Pragma Check_Name</a></li>
<li><a name="toc-Pragma-Check_005fPolicy-1" href="#Pragma-Check_005fPolicy">Pragma Check_Policy</a></li>
<li><a name="toc-Pragma-Comment-1" href="#Pragma-Comment">Pragma Comment</a></li>
<li><a name="toc-Pragma-Common_005fObject-1" href="#Pragma-Common_005fObject">Pragma Common_Object</a></li>
<li><a name="toc-Pragma-Compile_005fTime_005fError-1" href="#Pragma-Compile_005fTime_005fError">Pragma Compile_Time_Error</a></li>
<li><a name="toc-Pragma-Compile_005fTime_005fWarning-1" href="#Pragma-Compile_005fTime_005fWarning">Pragma Compile_Time_Warning</a></li>
<li><a name="toc-Pragma-Compiler_005fUnit-1" href="#Pragma-Compiler_005fUnit">Pragma Compiler_Unit</a></li>
<li><a name="toc-Pragma-Complete_005fRepresentation-1" href="#Pragma-Complete_005fRepresentation">Pragma Complete_Representation</a></li>
<li><a name="toc-Pragma-Complex_005fRepresentation-1" href="#Pragma-Complex_005fRepresentation">Pragma Complex_Representation</a></li>
<li><a name="toc-Pragma-Component_005fAlignment-1" href="#Pragma-Component_005fAlignment">Pragma Component_Alignment</a></li>
<li><a name="toc-Pragma-Contract_005fCase-1" href="#Pragma-Contract_005fCase">Pragma Contract_Case</a></li>
<li><a name="toc-Pragma-Convention_005fIdentifier-1" href="#Pragma-Convention_005fIdentifier">Pragma Convention_Identifier</a></li>
<li><a name="toc-Pragma-CPP_005fClass-1" href="#Pragma-CPP_005fClass">Pragma CPP_Class</a></li>
<li><a name="toc-Pragma-CPP_005fConstructor-1" href="#Pragma-CPP_005fConstructor">Pragma CPP_Constructor</a></li>
<li><a name="toc-Pragma-CPP_005fVirtual-1" href="#Pragma-CPP_005fVirtual">Pragma CPP_Virtual</a></li>
<li><a name="toc-Pragma-CPP_005fVtable-1" href="#Pragma-CPP_005fVtable">Pragma CPP_Vtable</a></li>
<li><a name="toc-Pragma-CPU-1" href="#Pragma-CPU">Pragma CPU</a></li>
<li><a name="toc-Pragma-Debug-1" href="#Pragma-Debug">Pragma Debug</a></li>
<li><a name="toc-Pragma-Debug_005fPolicy-1" href="#Pragma-Debug_005fPolicy">Pragma Debug_Policy</a></li>
<li><a name="toc-Pragma-Default_005fStorage_005fPool-1" href="#Pragma-Default_005fStorage_005fPool">Pragma Default_Storage_Pool</a></li>
<li><a name="toc-Pragma-Detect_005fBlocking-1" href="#Pragma-Detect_005fBlocking">Pragma Detect_Blocking</a></li>
<li><a name="toc-Pragma-Dispatching_005fDomain-1" href="#Pragma-Dispatching_005fDomain">Pragma Dispatching_Domain</a></li>
<li><a name="toc-Pragma-Elaboration_005fChecks-1" href="#Pragma-Elaboration_005fChecks">Pragma Elaboration_Checks</a></li>
<li><a name="toc-Pragma-Eliminate-1" href="#Pragma-Eliminate">Pragma Eliminate</a></li>
<li><a name="toc-Pragma-Export_005fException-1" href="#Pragma-Export_005fException">Pragma Export_Exception</a></li>
<li><a name="toc-Pragma-Export_005fFunction-1" href="#Pragma-Export_005fFunction">Pragma Export_Function</a></li>
<li><a name="toc-Pragma-Export_005fObject-1" href="#Pragma-Export_005fObject">Pragma Export_Object</a></li>
<li><a name="toc-Pragma-Export_005fProcedure-1" href="#Pragma-Export_005fProcedure">Pragma Export_Procedure</a></li>
<li><a name="toc-Pragma-Export_005fValue-1" href="#Pragma-Export_005fValue">Pragma Export_Value</a></li>
<li><a name="toc-Pragma-Export_005fValued_005fProcedure-1" href="#Pragma-Export_005fValued_005fProcedure">Pragma Export_Valued_Procedure</a></li>
<li><a name="toc-Pragma-Extend_005fSystem-1" href="#Pragma-Extend_005fSystem">Pragma Extend_System</a></li>
<li><a name="toc-Pragma-Extensions_005fAllowed-1" href="#Pragma-Extensions_005fAllowed">Pragma Extensions_Allowed</a></li>
<li><a name="toc-Pragma-External-1" href="#Pragma-External">Pragma External</a></li>
<li><a name="toc-Pragma-External_005fName_005fCasing-1" href="#Pragma-External_005fName_005fCasing">Pragma External_Name_Casing</a></li>
<li><a name="toc-Pragma-Fast_005fMath-1" href="#Pragma-Fast_005fMath">Pragma Fast_Math</a></li>
<li><a name="toc-Pragma-Favor_005fTop_005fLevel-1" href="#Pragma-Favor_005fTop_005fLevel">Pragma Favor_Top_Level</a></li>
<li><a name="toc-Pragma-Finalize_005fStorage_005fOnly-1" href="#Pragma-Finalize_005fStorage_005fOnly">Pragma Finalize_Storage_Only</a></li>
<li><a name="toc-Pragma-Float_005fRepresentation-1" href="#Pragma-Float_005fRepresentation">Pragma Float_Representation</a></li>
<li><a name="toc-Pragma-Ident-1" href="#Pragma-Ident">Pragma Ident</a></li>
<li><a name="toc-Pragma-Implementation_005fDefined-1" href="#Pragma-Implementation_005fDefined">Pragma Implementation_Defined</a></li>
<li><a name="toc-Pragma-Implemented-1" href="#Pragma-Implemented">Pragma Implemented</a></li>
<li><a name="toc-Pragma-Implicit_005fPacking-1" href="#Pragma-Implicit_005fPacking">Pragma Implicit_Packing</a></li>
<li><a name="toc-Pragma-Import_005fException-1" href="#Pragma-Import_005fException">Pragma Import_Exception</a></li>
<li><a name="toc-Pragma-Import_005fFunction-1" href="#Pragma-Import_005fFunction">Pragma Import_Function</a></li>
<li><a name="toc-Pragma-Import_005fObject-1" href="#Pragma-Import_005fObject">Pragma Import_Object</a></li>
<li><a name="toc-Pragma-Import_005fProcedure-1" href="#Pragma-Import_005fProcedure">Pragma Import_Procedure</a></li>
<li><a name="toc-Pragma-Import_005fValued_005fProcedure-1" href="#Pragma-Import_005fValued_005fProcedure">Pragma Import_Valued_Procedure</a></li>
<li><a name="toc-Pragma-Independent-1" href="#Pragma-Independent">Pragma Independent</a></li>
<li><a name="toc-Pragma-Independent_005fComponents-1" href="#Pragma-Independent_005fComponents">Pragma Independent_Components</a></li>
<li><a name="toc-Pragma-Initialize_005fScalars-1" href="#Pragma-Initialize_005fScalars">Pragma Initialize_Scalars</a></li>
<li><a name="toc-Pragma-Inline_005fAlways-1" href="#Pragma-Inline_005fAlways">Pragma Inline_Always</a></li>
<li><a name="toc-Pragma-Inline_005fGeneric-1" href="#Pragma-Inline_005fGeneric">Pragma Inline_Generic</a></li>
<li><a name="toc-Pragma-Interface-1" href="#Pragma-Interface">Pragma Interface</a></li>
<li><a name="toc-Pragma-Interface_005fName-1" href="#Pragma-Interface_005fName">Pragma Interface_Name</a></li>
<li><a name="toc-Pragma-Interrupt_005fHandler-1" href="#Pragma-Interrupt_005fHandler">Pragma Interrupt_Handler</a></li>
<li><a name="toc-Pragma-Interrupt_005fState-1" href="#Pragma-Interrupt_005fState">Pragma Interrupt_State</a></li>
<li><a name="toc-Pragma-Invariant-1" href="#Pragma-Invariant">Pragma Invariant</a></li>
<li><a name="toc-Pragma-Keep_005fNames-1" href="#Pragma-Keep_005fNames">Pragma Keep_Names</a></li>
<li><a name="toc-Pragma-License-1" href="#Pragma-License">Pragma License</a></li>
<li><a name="toc-Pragma-Link_005fWith-1" href="#Pragma-Link_005fWith">Pragma Link_With</a></li>
<li><a name="toc-Pragma-Linker_005fAlias-1" href="#Pragma-Linker_005fAlias">Pragma Linker_Alias</a></li>
<li><a name="toc-Pragma-Linker_005fConstructor-1" href="#Pragma-Linker_005fConstructor">Pragma Linker_Constructor</a></li>
<li><a name="toc-Pragma-Linker_005fDestructor-1" href="#Pragma-Linker_005fDestructor">Pragma Linker_Destructor</a></li>
<li><a name="toc-Pragma-Linker_005fSection-1" href="#Pragma-Linker_005fSection">Pragma Linker_Section</a></li>
<li><a name="toc-Pragma-Long_005fFloat-1" href="#Pragma-Long_005fFloat">Pragma Long_Float</a></li>
<li><a name="toc-Pragma-Loop_005fOptimize-1" href="#Pragma-Loop_005fOptimize">Pragma Loop_Optimize</a></li>
<li><a name="toc-Pragma-Machine_005fAttribute-1" href="#Pragma-Machine_005fAttribute">Pragma Machine_Attribute</a></li>
<li><a name="toc-Pragma-Main-1" href="#Pragma-Main">Pragma Main</a></li>
<li><a name="toc-Pragma-Main_005fStorage-1" href="#Pragma-Main_005fStorage">Pragma Main_Storage</a></li>
<li><a name="toc-Pragma-No_005fBody-1" href="#Pragma-No_005fBody">Pragma No_Body</a></li>
<li><a name="toc-Pragma-No_005fInline-1" href="#Pragma-No_005fInline">Pragma No_Inline</a></li>
<li><a name="toc-Pragma-No_005fReturn-1" href="#Pragma-No_005fReturn">Pragma No_Return</a></li>
<li><a name="toc-Pragma-No_005fStrict_005fAliasing-1" href="#Pragma-No_005fStrict_005fAliasing">Pragma No_Strict_Aliasing</a></li>
<li><a name="toc-Pragma-Normalize_005fScalars-1" href="#Pragma-Normalize_005fScalars">Pragma Normalize_Scalars</a></li>
<li><a name="toc-Pragma-Obsolescent-1" href="#Pragma-Obsolescent">Pragma Obsolescent</a></li>
<li><a name="toc-Pragma-Optimize_005fAlignment-1" href="#Pragma-Optimize_005fAlignment">Pragma Optimize_Alignment</a></li>
<li><a name="toc-Pragma-Ordered-1" href="#Pragma-Ordered">Pragma Ordered</a></li>
<li><a name="toc-Pragma-Overflow_005fMode-1" href="#Pragma-Overflow_005fMode">Pragma Overflow_Mode</a></li>
<li><a name="toc-Pragma-Partition_005fElaboration_005fPolicy-1" href="#Pragma-Partition_005fElaboration_005fPolicy">Pragma Partition_Elaboration_Policy</a></li>
<li><a name="toc-Pragma-Passive-1" href="#Pragma-Passive">Pragma Passive</a></li>
<li><a name="toc-Pragma-Persistent_005fBSS-1" href="#Pragma-Persistent_005fBSS">Pragma Persistent_BSS</a></li>
<li><a name="toc-Pragma-Polling-1" href="#Pragma-Polling">Pragma Polling</a></li>
<li><a name="toc-Pragma-Postcondition-1" href="#Pragma-Postcondition">Pragma Postcondition</a></li>
<li><a name="toc-Pragma-Preelaborable_005fInitialization-1" href="#Pragma-Preelaborable_005fInitialization">Pragma Preelaborable_Initialization</a></li>
<li><a name="toc-Pragma-Priority_005fSpecific_005fDispatching-1" href="#Pragma-Priority_005fSpecific_005fDispatching">Pragma Priority_Specific_Dispatching</a></li>
<li><a name="toc-Pragma-Precondition-1" href="#Pragma-Precondition">Pragma Precondition</a></li>
<li><a name="toc-Pragma-Profile-_0028Ravenscar_0029-1" href="#Pragma-Profile-_0028Ravenscar_0029">Pragma Profile (Ravenscar)</a></li>
<li><a name="toc-Pragma-Profile-_0028Restricted_0029-1" href="#Pragma-Profile-_0028Restricted_0029">Pragma Profile (Restricted)</a></li>
<li><a name="toc-Pragma-Profile-_0028Rational_0029-1" href="#Pragma-Profile-_0028Rational_0029">Pragma Profile (Rational)</a></li>
<li><a name="toc-Pragma-Psect_005fObject-1" href="#Pragma-Psect_005fObject">Pragma Psect_Object</a></li>
<li><a name="toc-Pragma-Pure_005fFunction-1" href="#Pragma-Pure_005fFunction">Pragma Pure_Function</a></li>
<li><a name="toc-Pragma-Relative_005fDeadline-1" href="#Pragma-Relative_005fDeadline">Pragma Relative_Deadline</a></li>
<li><a name="toc-Pragma-Remote_005fAccess_005fType-1" href="#Pragma-Remote_005fAccess_005fType">Pragma Remote_Access_Type</a></li>
<li><a name="toc-Pragma-Restriction_005fWarnings-1" href="#Pragma-Restriction_005fWarnings">Pragma Restriction_Warnings</a></li>
<li><a name="toc-Pragma-Shared-1" href="#Pragma-Shared">Pragma Shared</a></li>
<li><a name="toc-Pragma-Short_005fCircuit_005fAnd_005fOr-1" href="#Pragma-Short_005fCircuit_005fAnd_005fOr">Pragma Short_Circuit_And_Or</a></li>
<li><a name="toc-Pragma-Short_005fDescriptors-1" href="#Pragma-Short_005fDescriptors">Pragma Short_Descriptors</a></li>
<li><a name="toc-Pragma-Simple_005fStorage_005fPool_005fType-1" href="#Pragma-Simple_005fStorage_005fPool_005fType">Pragma Simple_Storage_Pool_Type</a></li>
<li><a name="toc-Pragma-Source_005fFile_005fName-1" href="#Pragma-Source_005fFile_005fName">Pragma Source_File_Name</a></li>
<li><a name="toc-Pragma-Source_005fFile_005fName_005fProject-1" href="#Pragma-Source_005fFile_005fName_005fProject">Pragma Source_File_Name_Project</a></li>
<li><a name="toc-Pragma-Source_005fReference-1" href="#Pragma-Source_005fReference">Pragma Source_Reference</a></li>
<li><a name="toc-Pragma-Static_005fElaboration_005fDesired-1" href="#Pragma-Static_005fElaboration_005fDesired">Pragma Static_Elaboration_Desired</a></li>
<li><a name="toc-Pragma-Stream_005fConvert-1" href="#Pragma-Stream_005fConvert">Pragma Stream_Convert</a></li>
<li><a name="toc-Pragma-Style_005fChecks-1" href="#Pragma-Style_005fChecks">Pragma Style_Checks</a></li>
<li><a name="toc-Pragma-Subtitle-1" href="#Pragma-Subtitle">Pragma Subtitle</a></li>
<li><a name="toc-Pragma-Suppress-1" href="#Pragma-Suppress">Pragma Suppress</a></li>
<li><a name="toc-Pragma-Suppress_005fAll-1" href="#Pragma-Suppress_005fAll">Pragma Suppress_All</a></li>
<li><a name="toc-Pragma-Suppress_005fException_005fLocations-1" href="#Pragma-Suppress_005fException_005fLocations">Pragma Suppress_Exception_Locations</a></li>
<li><a name="toc-Pragma-Suppress_005fInitialization-1" href="#Pragma-Suppress_005fInitialization">Pragma Suppress_Initialization</a></li>
<li><a name="toc-Pragma-Task_005fInfo-1" href="#Pragma-Task_005fInfo">Pragma Task_Info</a></li>
<li><a name="toc-Pragma-Task_005fName-1" href="#Pragma-Task_005fName">Pragma Task_Name</a></li>
<li><a name="toc-Pragma-Task_005fStorage-1" href="#Pragma-Task_005fStorage">Pragma Task_Storage</a></li>
<li><a name="toc-Pragma-Test_005fCase-1" href="#Pragma-Test_005fCase">Pragma Test_Case</a></li>
<li><a name="toc-Pragma-Thread_005fLocal_005fStorage-1" href="#Pragma-Thread_005fLocal_005fStorage">Pragma Thread_Local_Storage</a></li>
<li><a name="toc-Pragma-Time_005fSlice-1" href="#Pragma-Time_005fSlice">Pragma Time_Slice</a></li>
<li><a name="toc-Pragma-Title-1" href="#Pragma-Title">Pragma Title</a></li>
<li><a name="toc-Pragma-Unchecked_005fUnion-1" href="#Pragma-Unchecked_005fUnion">Pragma Unchecked_Union</a></li>
<li><a name="toc-Pragma-Unimplemented_005fUnit-1" href="#Pragma-Unimplemented_005fUnit">Pragma Unimplemented_Unit</a></li>
<li><a name="toc-Pragma-Universal_005fAliasing-1" href="#Pragma-Universal_005fAliasing">Pragma Universal_Aliasing</a></li>
<li><a name="toc-Pragma-Universal_005fData-1" href="#Pragma-Universal_005fData">Pragma Universal_Data</a></li>
<li><a name="toc-Pragma-Unmodified-1" href="#Pragma-Unmodified">Pragma Unmodified</a></li>
<li><a name="toc-Pragma-Unreferenced-1" href="#Pragma-Unreferenced">Pragma Unreferenced</a></li>
<li><a name="toc-Pragma-Unreferenced_005fObjects-1" href="#Pragma-Unreferenced_005fObjects">Pragma Unreferenced_Objects</a></li>
<li><a name="toc-Pragma-Unreserve_005fAll_005fInterrupts-1" href="#Pragma-Unreserve_005fAll_005fInterrupts">Pragma Unreserve_All_Interrupts</a></li>
<li><a name="toc-Pragma-Unsuppress-1" href="#Pragma-Unsuppress">Pragma Unsuppress</a></li>
<li><a name="toc-Pragma-Use_005fVADS_005fSize-1" href="#Pragma-Use_005fVADS_005fSize">Pragma Use_VADS_Size</a></li>
<li><a name="toc-Pragma-Validity_005fChecks-1" href="#Pragma-Validity_005fChecks">Pragma Validity_Checks</a></li>
<li><a name="toc-Pragma-Volatile-1" href="#Pragma-Volatile">Pragma Volatile</a></li>
<li><a name="toc-Pragma-Warnings-1" href="#Pragma-Warnings">Pragma Warnings</a></li>
<li><a name="toc-Pragma-Weak_005fExternal-1" href="#Pragma-Weak_005fExternal">Pragma Weak_External</a></li>
<li><a name="toc-Pragma-Wide_005fCharacter_005fEncoding-1" href="#Pragma-Wide_005fCharacter_005fEncoding">Pragma Wide_Character_Encoding</a></li>
</ul></li>
<li><a name="toc-Implementation-Defined-Attributes-1" href="#Implementation-Defined-Attributes">2 Implementation Defined Attributes</a>
<ul class="no-bullet">
<li><a name="toc-Abort_005fSignal-1" href="#Abort_005fSignal">Abort_Signal</a></li>
<li><a name="toc-Address_005fSize-1" href="#Address_005fSize">Address_Size</a></li>
<li><a name="toc-Asm_005fInput-1" href="#Asm_005fInput">Asm_Input</a></li>
<li><a name="toc-Asm_005fOutput-1" href="#Asm_005fOutput">Asm_Output</a></li>
<li><a name="toc-AST_005fEntry-1" href="#AST_005fEntry">AST_Entry</a></li>
<li><a name="toc-Bit-1" href="#Bit">Bit</a></li>
<li><a name="toc-Bit_005fPosition-1" href="#Bit_005fPosition">Bit_Position</a></li>
<li><a name="toc-Compiler_005fVersion-1" href="#Compiler_005fVersion">Compiler_Version</a></li>
<li><a name="toc-Code_005fAddress-1" href="#Code_005fAddress">Code_Address</a></li>
<li><a name="toc-Default_005fBit_005fOrder-1" href="#Default_005fBit_005fOrder">Default_Bit_Order</a></li>
<li><a name="toc-Descriptor_005fSize-1" href="#Descriptor_005fSize">Descriptor_Size</a></li>
<li><a name="toc-Elaborated-1" href="#Elaborated">Elaborated</a></li>
<li><a name="toc-Elab_005fBody-1" href="#Elab_005fBody">Elab_Body</a></li>
<li><a name="toc-Elab_005fSpec-1" href="#Elab_005fSpec">Elab_Spec</a></li>
<li><a name="toc-Elab_005fSubp_005fBody-1" href="#Elab_005fSubp_005fBody">Elab_Subp_Body</a></li>
<li><a name="toc-Emax-1" href="#Emax">Emax</a></li>
<li><a name="toc-Enabled-1" href="#Enabled">Enabled</a></li>
<li><a name="toc-Enum_005fRep-1" href="#Enum_005fRep">Enum_Rep</a></li>
<li><a name="toc-Enum_005fVal-1" href="#Enum_005fVal">Enum_Val</a></li>
<li><a name="toc-Epsilon-1" href="#Epsilon">Epsilon</a></li>
<li><a name="toc-Fixed_005fValue-1" href="#Fixed_005fValue">Fixed_Value</a></li>
<li><a name="toc-Has_005fAccess_005fValues-1" href="#Has_005fAccess_005fValues">Has_Access_Values</a></li>
<li><a name="toc-Has_005fDiscriminants-1" href="#Has_005fDiscriminants">Has_Discriminants</a></li>
<li><a name="toc-Img-1" href="#Img">Img</a></li>
<li><a name="toc-Integer_005fValue-1" href="#Integer_005fValue">Integer_Value</a></li>
<li><a name="toc-Invalid_005fValue-1" href="#Invalid_005fValue">Invalid_Value</a></li>
<li><a name="toc-Large-1" href="#Large">Large</a></li>
<li><a name="toc-Machine_005fSize-1" href="#Machine_005fSize">Machine_Size</a></li>
<li><a name="toc-Mantissa-1" href="#Mantissa">Mantissa</a></li>
<li><a name="toc-Max_005fInterrupt_005fPriority-1" href="#Max_005fInterrupt_005fPriority">Max_Interrupt_Priority</a></li>
<li><a name="toc-Max_005fPriority-1" href="#Max_005fPriority">Max_Priority</a></li>
<li><a name="toc-Maximum_005fAlignment-1" href="#Maximum_005fAlignment">Maximum_Alignment</a></li>
<li><a name="toc-Mechanism_005fCode-1" href="#Mechanism_005fCode">Mechanism_Code</a></li>
<li><a name="toc-Null_005fParameter-1" href="#Null_005fParameter">Null_Parameter</a></li>
<li><a name="toc-Object_005fSize-1" href="#Object_005fSize">Object_Size</a></li>
<li><a name="toc-Passed_005fBy_005fReference-1" href="#Passed_005fBy_005fReference">Passed_By_Reference</a></li>
<li><a name="toc-Pool_005fAddress-1" href="#Pool_005fAddress">Pool_Address</a></li>
<li><a name="toc-Range_005fLength-1" href="#Range_005fLength">Range_Length</a></li>
<li><a name="toc-Ref-1" href="#Ref">Ref</a></li>
<li><a name="toc-Result-1" href="#Result">Result</a></li>
<li><a name="toc-Safe_005fEmax-1" href="#Safe_005fEmax">Safe_Emax</a></li>
<li><a name="toc-Safe_005fLarge-1" href="#Safe_005fLarge">Safe_Large</a></li>
<li><a name="toc-Scalar_005fStorage_005fOrder-1" href="#Scalar_005fStorage_005fOrder">Scalar_Storage_Order</a></li>
<li><a name="toc-Simple_005fStorage_005fPool-1" href="#Simple_005fStorage_005fPool">Simple_Storage_Pool</a></li>
<li><a name="toc-Small-1" href="#Small">Small</a></li>
<li><a name="toc-Storage_005fUnit-1" href="#Storage_005fUnit">Storage_Unit</a></li>
<li><a name="toc-Stub_005fType-1" href="#Stub_005fType">Stub_Type</a></li>
<li><a name="toc-System_005fAllocator_005fAlignment-1" href="#System_005fAllocator_005fAlignment">System_Allocator_Alignment</a></li>
<li><a name="toc-Target_005fName-1" href="#Target_005fName">Target_Name</a></li>
<li><a name="toc-Tick-1" href="#Tick">Tick</a></li>
<li><a name="toc-To_005fAddress-1" href="#To_005fAddress">To_Address</a></li>
<li><a name="toc-Type_005fClass-1" href="#Type_005fClass">Type_Class</a></li>
<li><a name="toc-UET_005fAddress-1" href="#UET_005fAddress">UET_Address</a></li>
<li><a name="toc-Unconstrained_005fArray-1" href="#Unconstrained_005fArray">Unconstrained_Array</a></li>
<li><a name="toc-Universal_005fLiteral_005fString-1" href="#Universal_005fLiteral_005fString">Universal_Literal_String</a></li>
<li><a name="toc-Unrestricted_005fAccess-1" href="#Unrestricted_005fAccess">Unrestricted_Access</a></li>
<li><a name="toc-Valid_005fScalars-1" href="#Valid_005fScalars">Valid_Scalars</a></li>
<li><a name="toc-VADS_005fSize-1" href="#VADS_005fSize">VADS_Size</a></li>
<li><a name="toc-Value_005fSize-1" href="#Value_005fSize">Value_Size</a></li>
<li><a name="toc-Wchar_005fT_005fSize-1" href="#Wchar_005fT_005fSize">Wchar_T_Size</a></li>
<li><a name="toc-Word_005fSize-1" href="#Word_005fSize">Word_Size</a></li>
</ul></li>
<li><a name="toc-Standard-and-Implementation-Defined-Restrictions-1" href="#Standard-and-Implementation-Defined-Restrictions">3 Standard and Implementation Defined Restrictions</a>
<ul class="no-bullet">
<li><a name="toc-Partition_002dWide-Restrictions-1" href="#Partition_002dWide-Restrictions">3.1 Partition-Wide Restrictions</a>
<ul class="no-bullet">
<li><a name="toc-Immediate_005fReclamation-1" href="#Immediate_005fReclamation">Immediate_Reclamation</a></li>
<li><a name="toc-Max_005fAsynchronous_005fSelect_005fNesting-1" href="#Max_005fAsynchronous_005fSelect_005fNesting">Max_Asynchronous_Select_Nesting</a></li>
<li><a name="toc-Max_005fEntry_005fQueue_005fLength-1" href="#Max_005fEntry_005fQueue_005fLength">Max_Entry_Queue_Length</a></li>
<li><a name="toc-Max_005fProtected_005fEntries-1" href="#Max_005fProtected_005fEntries">Max_Protected_Entries</a></li>
<li><a name="toc-Max_005fSelect_005fAlternatives-1" href="#Max_005fSelect_005fAlternatives">Max_Select_Alternatives</a></li>
<li><a name="toc-Max_005fStorage_005fAt_005fBlocking-1" href="#Max_005fStorage_005fAt_005fBlocking">Max_Storage_At_Blocking</a></li>
<li><a name="toc-Max_005fTask_005fEntries-1" href="#Max_005fTask_005fEntries">Max_Task_Entries</a></li>
<li><a name="toc-Max_005fTasks-1" href="#Max_005fTasks">Max_Tasks</a></li>
<li><a name="toc-No_005fAbort_005fStatements-1" href="#No_005fAbort_005fStatements">No_Abort_Statements</a></li>
<li><a name="toc-No_005fAccess_005fParameter_005fAllocators-1" href="#No_005fAccess_005fParameter_005fAllocators">No_Access_Parameter_Allocators</a></li>
<li><a name="toc-No_005fAccess_005fSubprograms-1" href="#No_005fAccess_005fSubprograms">No_Access_Subprograms</a></li>
<li><a name="toc-No_005fAllocators-1" href="#No_005fAllocators">No_Allocators</a></li>
<li><a name="toc-No_005fAnonymous_005fAllocators-1" href="#No_005fAnonymous_005fAllocators">No_Anonymous_Allocators</a></li>
<li><a name="toc-No_005fCalendar-1" href="#No_005fCalendar">No_Calendar</a></li>
<li><a name="toc-No_005fCoextensions-1" href="#No_005fCoextensions">No_Coextensions</a></li>
<li><a name="toc-No_005fDefault_005fInitialization-1" href="#No_005fDefault_005fInitialization">No_Default_Initialization</a></li>
<li><a name="toc-No_005fDelay-1" href="#No_005fDelay">No_Delay</a></li>
<li><a name="toc-No_005fDependence-1" href="#No_005fDependence">No_Dependence</a></li>
<li><a name="toc-No_005fDirect_005fBoolean_005fOperators-1" href="#No_005fDirect_005fBoolean_005fOperators">No_Direct_Boolean_Operators</a></li>
<li><a name="toc-No_005fDispatch-1" href="#No_005fDispatch">No_Dispatch</a></li>
<li><a name="toc-No_005fDispatching_005fCalls-1" href="#No_005fDispatching_005fCalls">No_Dispatching_Calls</a></li>
<li><a name="toc-No_005fDynamic_005fAttachment-1" href="#No_005fDynamic_005fAttachment">No_Dynamic_Attachment</a></li>
<li><a name="toc-No_005fDynamic_005fPriorities-1" href="#No_005fDynamic_005fPriorities">No_Dynamic_Priorities</a></li>
<li><a name="toc-No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode-1" href="#No_005fEntry_005fCalls_005fIn_005fElaboration_005fCode">No_Entry_Calls_In_Elaboration_Code</a></li>
<li><a name="toc-No_005fEnumeration_005fMaps-1" href="#No_005fEnumeration_005fMaps">No_Enumeration_Maps</a></li>
<li><a name="toc-No_005fException_005fHandlers-1" href="#No_005fException_005fHandlers">No_Exception_Handlers</a></li>
<li><a name="toc-No_005fException_005fPropagation-1" href="#No_005fException_005fPropagation">No_Exception_Propagation</a></li>
<li><a name="toc-No_005fException_005fRegistration-1" href="#No_005fException_005fRegistration">No_Exception_Registration</a></li>
<li><a name="toc-No_005fExceptions-1" href="#No_005fExceptions">No_Exceptions</a></li>
<li><a name="toc-No_005fFinalization-1" href="#No_005fFinalization">No_Finalization</a></li>
<li><a name="toc-No_005fFixed_005fPoint-1" href="#No_005fFixed_005fPoint">No_Fixed_Point</a></li>
<li><a name="toc-No_005fFloating_005fPoint-1" href="#No_005fFloating_005fPoint">No_Floating_Point</a></li>
<li><a name="toc-No_005fImplicit_005fConditionals-1" href="#No_005fImplicit_005fConditionals">No_Implicit_Conditionals</a></li>
<li><a name="toc-No_005fImplicit_005fDynamic_005fCode-1" href="#No_005fImplicit_005fDynamic_005fCode">No_Implicit_Dynamic_Code</a></li>
<li><a name="toc-No_005fImplicit_005fHeap_005fAllocations-1" href="#No_005fImplicit_005fHeap_005fAllocations">No_Implicit_Heap_Allocations</a></li>
<li><a name="toc-No_005fImplicit_005fLoops-1" href="#No_005fImplicit_005fLoops">No_Implicit_Loops</a></li>
<li><a name="toc-No_005fInitialize_005fScalars-1" href="#No_005fInitialize_005fScalars">No_Initialize_Scalars</a></li>
<li><a name="toc-No_005fIO-1" href="#No_005fIO">No_IO</a></li>
<li><a name="toc-No_005fLocal_005fAllocators-1" href="#No_005fLocal_005fAllocators">No_Local_Allocators</a></li>
<li><a name="toc-No_005fLocal_005fProtected_005fObjects-1" href="#No_005fLocal_005fProtected_005fObjects">No_Local_Protected_Objects</a></li>
<li><a name="toc-No_005fLocal_005fTiming_005fEvents-1" href="#No_005fLocal_005fTiming_005fEvents">No_Local_Timing_Events</a></li>
<li><a name="toc-No_005fNested_005fFinalization-1" href="#No_005fNested_005fFinalization">No_Nested_Finalization</a></li>
<li><a name="toc-No_005fProtected_005fType_005fAllocators-1" href="#No_005fProtected_005fType_005fAllocators">No_Protected_Type_Allocators</a></li>
<li><a name="toc-No_005fProtected_005fTypes-1" href="#No_005fProtected_005fTypes">No_Protected_Types</a></li>
<li><a name="toc-No_005fRecursion-1" href="#No_005fRecursion">No_Recursion</a></li>
<li><a name="toc-No_005fReentrancy-1" href="#No_005fReentrancy">No_Reentrancy</a></li>
<li><a name="toc-No_005fRelative_005fDelay-1" href="#No_005fRelative_005fDelay">No_Relative_Delay</a></li>
<li><a name="toc-No_005fRequeue_005fStatements-1" href="#No_005fRequeue_005fStatements">No_Requeue_Statements</a></li>
<li><a name="toc-No_005fSecondary_005fStack-1" href="#No_005fSecondary_005fStack">No_Secondary_Stack</a></li>
<li><a name="toc-No_005fSelect_005fStatements-1" href="#No_005fSelect_005fStatements">No_Select_Statements</a></li>
<li><a name="toc-No_005fSpecific_005fTermination_005fHandlers-1" href="#No_005fSpecific_005fTermination_005fHandlers">No_Specific_Termination_Handlers</a></li>
<li><a name="toc-No_005fSpecification_005fof_005fAspect-1" href="#No_005fSpecification_005fof_005fAspect">No_Specification_of_Aspect</a></li>
<li><a name="toc-No_005fStandard_005fAllocators_005fAfter_005fElaboration-1" href="#No_005fStandard_005fAllocators_005fAfter_005fElaboration">No_Standard_Allocators_After_Elaboration</a></li>
<li><a name="toc-No_005fStandard_005fStorage_005fPools-1" href="#No_005fStandard_005fStorage_005fPools">No_Standard_Storage_Pools</a></li>
<li><a name="toc-No_005fStream_005fOptimizations-1" href="#No_005fStream_005fOptimizations">No_Stream_Optimizations</a></li>
<li><a name="toc-No_005fStreams-1" href="#No_005fStreams">No_Streams</a></li>
<li><a name="toc-No_005fTask_005fAllocators-1" href="#No_005fTask_005fAllocators">No_Task_Allocators</a></li>
<li><a name="toc-No_005fTask_005fAttributes_005fPackage-1" href="#No_005fTask_005fAttributes_005fPackage">No_Task_Attributes_Package</a></li>
<li><a name="toc-No_005fTask_005fHierarchy-1" href="#No_005fTask_005fHierarchy">No_Task_Hierarchy</a></li>
<li><a name="toc-No_005fTask_005fTermination-1" href="#No_005fTask_005fTermination">No_Task_Termination</a></li>
<li><a name="toc-No_005fTasking-1" href="#No_005fTasking">No_Tasking</a></li>
<li><a name="toc-No_005fTerminate_005fAlternatives-1" href="#No_005fTerminate_005fAlternatives">No_Terminate_Alternatives</a></li>
<li><a name="toc-No_005fUnchecked_005fAccess-1" href="#No_005fUnchecked_005fAccess">No_Unchecked_Access</a></li>
<li><a name="toc-Simple_005fBarriers-1" href="#Simple_005fBarriers">Simple_Barriers</a></li>
<li><a name="toc-Static_005fPriorities-1" href="#Static_005fPriorities">Static_Priorities</a></li>
<li><a name="toc-Static_005fStorage_005fSize-1" href="#Static_005fStorage_005fSize">Static_Storage_Size</a></li>
</ul></li>
<li><a name="toc-Program-Unit-Level-Restrictions-1" href="#Program-Unit-Level-Restrictions">3.2 Program Unit Level Restrictions</a>
<ul class="no-bullet">
<li><a name="toc-No_005fElaboration_005fCode-1" href="#No_005fElaboration_005fCode">No_Elaboration_Code</a></li>
<li><a name="toc-No_005fEntry_005fQueue-1" href="#No_005fEntry_005fQueue">No_Entry_Queue</a></li>
<li><a name="toc-No_005fImplementation_005fAspect_005fSpecifications-1" href="#No_005fImplementation_005fAspect_005fSpecifications">No_Implementation_Aspect_Specifications</a></li>
<li><a name="toc-No_005fImplementation_005fAttributes-1" href="#No_005fImplementation_005fAttributes">No_Implementation_Attributes</a></li>
<li><a name="toc-No_005fImplementation_005fIdentifiers-1" href="#No_005fImplementation_005fIdentifiers">No_Implementation_Identifiers</a></li>
<li><a name="toc-No_005fImplementation_005fPragmas-1" href="#No_005fImplementation_005fPragmas">No_Implementation_Pragmas</a></li>
<li><a name="toc-No_005fImplementation_005fRestrictions-1" href="#No_005fImplementation_005fRestrictions">No_Implementation_Restrictions</a></li>
<li><a name="toc-No_005fImplementation_005fUnits-1" href="#No_005fImplementation_005fUnits">No_Implementation_Units</a></li>
<li><a name="toc-No_005fImplicit_005fAliasing-1" href="#No_005fImplicit_005fAliasing">No_Implicit_Aliasing</a></li>
<li><a name="toc-No_005fObsolescent_005fFeatures-1" href="#No_005fObsolescent_005fFeatures">No_Obsolescent_Features</a></li>
<li><a name="toc-No_005fWide_005fCharacters-1" href="#No_005fWide_005fCharacters">No_Wide_Characters</a></li>
<li><a name="toc-SPARK-1" href="#SPARK">SPARK</a></li>
</ul></li>
</ul></li>
<li><a name="toc-Implementation-Advice-1" href="#Implementation-Advice">4 Implementation Advice</a>
<ul class="no-bullet">
<li><a name="toc-1_002e1_002e3_002820_0029_003a-Error-Detection" href="#g_t1_002e1_002e3_002820_0029_003a-Error-Detection">1.1.3(20): Error Detection</a></li>
<li><a name="toc-1_002e1_002e3_002831_0029_003a-Child-Units" href="#g_t1_002e1_002e3_002831_0029_003a-Child-Units">1.1.3(31): Child Units</a></li>
<li><a name="toc-1_002e1_002e5_002812_0029_003a-Bounded-Errors" href="#g_t1_002e1_002e5_002812_0029_003a-Bounded-Errors">1.1.5(12): Bounded Errors</a></li>
<li><a name="toc-2_002e8_002816_0029_003a-Pragmas" href="#g_t2_002e8_002816_0029_003a-Pragmas">2.8(16): Pragmas</a></li>
<li><a name="toc-2_002e8_002817_002d19_0029_003a-Pragmas" href="#g_t2_002e8_002817_002d19_0029_003a-Pragmas">2.8(17-19): Pragmas</a></li>
<li><a name="toc-3_002e5_002e2_00285_0029_003a-Alternative-Character-Sets" href="#g_t3_002e5_002e2_00285_0029_003a-Alternative-Character-Sets">3.5.2(5): Alternative Character Sets</a></li>
<li><a name="toc-3_002e5_002e4_002828_0029_003a-Integer-Types" href="#g_t3_002e5_002e4_002828_0029_003a-Integer-Types">3.5.4(28): Integer Types</a></li>
<li><a name="toc-3_002e5_002e4_002829_0029_003a-Integer-Types" href="#g_t3_002e5_002e4_002829_0029_003a-Integer-Types">3.5.4(29): Integer Types</a></li>
<li><a name="toc-3_002e5_002e5_00288_0029_003a-Enumeration-Values" href="#g_t3_002e5_002e5_00288_0029_003a-Enumeration-Values">3.5.5(8): Enumeration Values</a></li>
<li><a name="toc-3_002e5_002e7_002817_0029_003a-Float-Types" href="#g_t3_002e5_002e7_002817_0029_003a-Float-Types">3.5.7(17): Float Types</a></li>
<li><a name="toc-3_002e6_002e2_002811_0029_003a-Multidimensional-Arrays" href="#g_t3_002e6_002e2_002811_0029_003a-Multidimensional-Arrays">3.6.2(11): Multidimensional Arrays</a></li>
<li><a name="toc-9_002e6_002830_002d31_0029_003a-Duration_0027Small" href="#g_t9_002e6_002830_002d31_0029_003a-Duration_0027Small">9.6(30-31): Duration’Small</a></li>
<li><a name="toc-10_002e2_002e1_002812_0029_003a-Consistent-Representation" href="#g_t10_002e2_002e1_002812_0029_003a-Consistent-Representation">10.2.1(12): Consistent Representation</a></li>
<li><a name="toc-11_002e4_002e1_002819_0029_003a-Exception-Information" href="#g_t11_002e4_002e1_002819_0029_003a-Exception-Information">11.4.1(19): Exception Information</a></li>
<li><a name="toc-11_002e5_002828_0029_003a-Suppression-of-Checks" href="#g_t11_002e5_002828_0029_003a-Suppression-of-Checks">11.5(28): Suppression of Checks</a></li>
<li><a name="toc-13_002e1-_002821_002d24_0029_003a-Representation-Clauses" href="#g_t13_002e1-_002821_002d24_0029_003a-Representation-Clauses">13.1 (21-24): Representation Clauses</a></li>
<li><a name="toc-13_002e2_00286_002d8_0029_003a-Packed-Types" href="#g_t13_002e2_00286_002d8_0029_003a-Packed-Types">13.2(6-8): Packed Types</a></li>
<li><a name="toc-13_002e3_002814_002d19_0029_003a-Address-Clauses" href="#g_t13_002e3_002814_002d19_0029_003a-Address-Clauses">13.3(14-19): Address Clauses</a></li>
<li><a name="toc-13_002e3_002829_002d35_0029_003a-Alignment-Clauses" href="#g_t13_002e3_002829_002d35_0029_003a-Alignment-Clauses">13.3(29-35): Alignment Clauses</a></li>
<li><a name="toc-13_002e3_002842_002d43_0029_003a-Size-Clauses" href="#g_t13_002e3_002842_002d43_0029_003a-Size-Clauses">13.3(42-43): Size Clauses</a></li>
<li><a name="toc-13_002e3_002850_002d56_0029_003a-Size-Clauses" href="#g_t13_002e3_002850_002d56_0029_003a-Size-Clauses">13.3(50-56): Size Clauses</a></li>
<li><a name="toc-13_002e3_002871_002d73_0029_003a-Component-Size-Clauses" href="#g_t13_002e3_002871_002d73_0029_003a-Component-Size-Clauses">13.3(71-73): Component Size Clauses</a></li>
<li><a name="toc-13_002e4_00289_002d10_0029_003a-Enumeration-Representation-Clauses" href="#g_t13_002e4_00289_002d10_0029_003a-Enumeration-Representation-Clauses">13.4(9-10): Enumeration Representation Clauses</a></li>
<li><a name="toc-13_002e5_002e1_002817_002d22_0029_003a-Record-Representation-Clauses" href="#g_t13_002e5_002e1_002817_002d22_0029_003a-Record-Representation-Clauses">13.5.1(17-22): Record Representation Clauses</a></li>
<li><a name="toc-13_002e5_002e2_00285_0029_003a-Storage-Place-Attributes" href="#g_t13_002e5_002e2_00285_0029_003a-Storage-Place-Attributes">13.5.2(5): Storage Place Attributes</a></li>
<li><a name="toc-13_002e5_002e3_00287_002d8_0029_003a-Bit-Ordering" href="#g_t13_002e5_002e3_00287_002d8_0029_003a-Bit-Ordering">13.5.3(7-8): Bit Ordering</a></li>
<li><a name="toc-13_002e7_002837_0029_003a-Address-as-Private" href="#g_t13_002e7_002837_0029_003a-Address-as-Private">13.7(37): Address as Private</a></li>
<li><a name="toc-13_002e7_002e1_002816_0029_003a-Address-Operations" href="#g_t13_002e7_002e1_002816_0029_003a-Address-Operations">13.7.1(16): Address Operations</a></li>
<li><a name="toc-13_002e9_002814_002d17_0029_003a-Unchecked-Conversion" href="#g_t13_002e9_002814_002d17_0029_003a-Unchecked-Conversion">13.9(14-17): Unchecked Conversion</a></li>
<li><a name="toc-13_002e11_002823_002d25_0029_003a-Implicit-Heap-Usage" href="#g_t13_002e11_002823_002d25_0029_003a-Implicit-Heap-Usage">13.11(23-25): Implicit Heap Usage</a></li>
<li><a name="toc-13_002e11_002e2_002817_0029_003a-Unchecked-De_002dallocation" href="#g_t13_002e11_002e2_002817_0029_003a-Unchecked-De_002dallocation">13.11.2(17): Unchecked De-allocation</a></li>
<li><a name="toc-13_002e13_002e2_002817_0029_003a-Stream-Oriented-Attributes" href="#g_t13_002e13_002e2_002817_0029_003a-Stream-Oriented-Attributes">13.13.2(17): Stream Oriented Attributes</a></li>
<li><a name="toc-A_002e1_002852_0029_003a-Names-of-Predefined-Numeric-Types" href="#A_002e1_002852_0029_003a-Names-of-Predefined-Numeric-Types">A.1(52): Names of Predefined Numeric Types</a></li>
<li><a name="toc-A_002e3_002e2_002849_0029_003a-Ada_002eCharacters_002eHandling" href="#A_002e3_002e2_002849_0029_003a-Ada_002eCharacters_002eHandling">A.3.2(49): <code>Ada.Characters.Handling</code></a></li>
<li><a name="toc-A_002e4_002e4_0028106_0029_003a-Bounded_002dLength-String-Handling" href="#A_002e4_002e4_0028106_0029_003a-Bounded_002dLength-String-Handling">A.4.4(106): Bounded-Length String Handling</a></li>
<li><a name="toc-A_002e5_002e2_002846_002d47_0029_003a-Random-Number-Generation" href="#A_002e5_002e2_002846_002d47_0029_003a-Random-Number-Generation">A.5.2(46-47): Random Number Generation</a></li>
<li><a name="toc-A_002e10_002e7_002823_0029_003a-Get_005fImmediate" href="#A_002e10_002e7_002823_0029_003a-Get_005fImmediate">A.10.7(23): <code>Get_Immediate</code></a></li>
<li><a name="toc-B_002e1_002839_002d41_0029_003a-Pragma-Export" href="#B_002e1_002839_002d41_0029_003a-Pragma-Export">B.1(39-41): Pragma <code>Export</code></a></li>
<li><a name="toc-B_002e2_002812_002d13_0029_003a-Package-Interfaces" href="#B_002e2_002812_002d13_0029_003a-Package-Interfaces">B.2(12-13): Package <code>Interfaces</code></a></li>
<li><a name="toc-B_002e3_002863_002d71_0029_003a-Interfacing-with-C" href="#B_002e3_002863_002d71_0029_003a-Interfacing-with-C">B.3(63-71): Interfacing with C</a></li>
<li><a name="toc-B_002e4_002895_002d98_0029_003a-Interfacing-with-COBOL" href="#B_002e4_002895_002d98_0029_003a-Interfacing-with-COBOL">B.4(95-98): Interfacing with COBOL</a></li>
<li><a name="toc-B_002e5_002822_002d26_0029_003a-Interfacing-with-Fortran" href="#B_002e5_002822_002d26_0029_003a-Interfacing-with-Fortran">B.5(22-26): Interfacing with Fortran</a></li>
<li><a name="toc-C_002e1_00283_002d5_0029_003a-Access-to-Machine-Operations" href="#C_002e1_00283_002d5_0029_003a-Access-to-Machine-Operations">C.1(3-5): Access to Machine Operations</a></li>
<li><a name="toc-C_002e1_002810_002d16_0029_003a-Access-to-Machine-Operations" href="#C_002e1_002810_002d16_0029_003a-Access-to-Machine-Operations">C.1(10-16): Access to Machine Operations</a></li>
<li><a name="toc-C_002e3_002828_0029_003a-Interrupt-Support" href="#C_002e3_002828_0029_003a-Interrupt-Support">C.3(28): Interrupt Support</a></li>
<li><a name="toc-C_002e3_002e1_002820_002d21_0029_003a-Protected-Procedure-Handlers" href="#C_002e3_002e1_002820_002d21_0029_003a-Protected-Procedure-Handlers">C.3.1(20-21): Protected Procedure Handlers</a></li>
<li><a name="toc-C_002e3_002e2_002825_0029_003a-Package-Interrupts" href="#C_002e3_002e2_002825_0029_003a-Package-Interrupts">C.3.2(25): Package <code>Interrupts</code></a></li>
<li><a name="toc-C_002e4_002814_0029_003a-Pre_002delaboration-Requirements" href="#C_002e4_002814_0029_003a-Pre_002delaboration-Requirements">C.4(14): Pre-elaboration Requirements</a></li>
<li><a name="toc-C_002e5_00288_0029_003a-Pragma-Discard_005fNames" href="#C_002e5_00288_0029_003a-Pragma-Discard_005fNames">C.5(8): Pragma <code>Discard_Names</code></a></li>
<li><a name="toc-C_002e7_002e2_002830_0029_003a-The-Package-Task_005fAttributes" href="#C_002e7_002e2_002830_0029_003a-The-Package-Task_005fAttributes">C.7.2(30): The Package Task_Attributes</a></li>
<li><a name="toc-D_002e3_002817_0029_003a-Locking-Policies" href="#D_002e3_002817_0029_003a-Locking-Policies">D.3(17): Locking Policies</a></li>
<li><a name="toc-D_002e4_002816_0029_003a-Entry-Queuing-Policies" href="#D_002e4_002816_0029_003a-Entry-Queuing-Policies">D.4(16): Entry Queuing Policies</a></li>
<li><a name="toc-D_002e6_00289_002d10_0029_003a-Preemptive-Abort" href="#D_002e6_00289_002d10_0029_003a-Preemptive-Abort">D.6(9-10): Preemptive Abort</a></li>
<li><a name="toc-D_002e7_002821_0029_003a-Tasking-Restrictions" href="#D_002e7_002821_0029_003a-Tasking-Restrictions">D.7(21): Tasking Restrictions</a></li>
<li><a name="toc-D_002e8_002847_002d49_0029_003a-Monotonic-Time" href="#D_002e8_002847_002d49_0029_003a-Monotonic-Time">D.8(47-49): Monotonic Time</a></li>
<li><a name="toc-E_002e5_002828_002d29_0029_003a-Partition-Communication-Subsystem" href="#E_002e5_002828_002d29_0029_003a-Partition-Communication-Subsystem">E.5(28-29): Partition Communication Subsystem</a></li>
<li><a name="toc-F_00287_0029_003a-COBOL-Support" href="#F_00287_0029_003a-COBOL-Support">F(7): COBOL Support</a></li>
<li><a name="toc-F_002e1_00282_0029_003a-Decimal-Radix-Support" href="#F_002e1_00282_0029_003a-Decimal-Radix-Support">F.1(2): Decimal Radix Support</a></li>
<li><a name="toc-G_003a-Numerics" href="#G_003a-Numerics">G: Numerics</a></li>
<li><a name="toc-G_002e1_002e1_002856_002d58_0029_003a-Complex-Types" href="#G_002e1_002e1_002856_002d58_0029_003a-Complex-Types">G.1.1(56-58): Complex Types</a></li>
<li><a name="toc-G_002e1_002e2_002849_0029_003a-Complex-Elementary-Functions" href="#G_002e1_002e2_002849_0029_003a-Complex-Elementary-Functions">G.1.2(49): Complex Elementary Functions</a></li>
<li><a name="toc-G_002e2_002e4_002819_0029_003a-Accuracy-Requirements" href="#G_002e2_002e4_002819_0029_003a-Accuracy-Requirements">G.2.4(19): Accuracy Requirements</a></li>
<li><a name="toc-G_002e2_002e6_002815_0029_003a-Complex-Arithmetic-Accuracy" href="#G_002e2_002e6_002815_0029_003a-Complex-Arithmetic-Accuracy">G.2.6(15): Complex Arithmetic Accuracy</a></li>
<li><a name="toc-H_002e6_002815_002f2_0029_003a-Pragma-Partition_005fElaboration_005fPolicy" href="#H_002e6_002815_002f2_0029_003a-Pragma-Partition_005fElaboration_005fPolicy">H.6(15/2): Pragma Partition_Elaboration_Policy</a></li>
</ul></li>
<li><a name="toc-Implementation-Defined-Characteristics-1" href="#Implementation-Defined-Characteristics">5 Implementation Defined Characteristics</a></li>
<li><a name="toc-Intrinsic-Subprograms-1" href="#Intrinsic-Subprograms">6 Intrinsic Subprograms</a>
<ul class="no-bullet">
<li><a name="toc-Intrinsic-Operators-1" href="#Intrinsic-Operators">6.1 Intrinsic Operators</a></li>
<li><a name="toc-Enclosing_005fEntity-1" href="#Enclosing_005fEntity">6.2 Enclosing_Entity</a></li>
<li><a name="toc-Exception_005fInformation-1" href="#Exception_005fInformation">6.3 Exception_Information</a></li>
<li><a name="toc-Exception_005fMessage-1" href="#Exception_005fMessage">6.4 Exception_Message</a></li>
<li><a name="toc-Exception_005fName-1" href="#Exception_005fName">6.5 Exception_Name</a></li>
<li><a name="toc-File-1" href="#File">6.6 File</a></li>
<li><a name="toc-Line-1" href="#Line">6.7 Line</a></li>
<li><a name="toc-Shifts-and-Rotates-1" href="#Shifts-and-Rotates">6.8 Shifts and Rotates</a></li>
<li><a name="toc-Source_005fLocation-1" href="#Source_005fLocation">6.9 Source_Location</a></li>
</ul></li>
<li><a name="toc-Representation-Clauses-and-Pragmas-1" href="#Representation-Clauses-and-Pragmas">7 Representation Clauses and Pragmas</a>
<ul class="no-bullet">
<li><a name="toc-Alignment-Clauses-1" href="#Alignment-Clauses">7.1 Alignment Clauses</a></li>
<li><a name="toc-Size-Clauses-1" href="#Size-Clauses">7.2 Size Clauses</a></li>
<li><a name="toc-Storage_005fSize-Clauses-1" href="#Storage_005fSize-Clauses">7.3 Storage_Size Clauses</a></li>
<li><a name="toc-Size-of-Variant-Record-Objects-1" href="#Size-of-Variant-Record-Objects">7.4 Size of Variant Record Objects</a></li>
<li><a name="toc-Biased-Representation-1" href="#Biased-Representation">7.5 Biased Representation</a></li>
<li><a name="toc-Value_005fSize-and-Object_005fSize-Clauses-1" href="#Value_005fSize-and-Object_005fSize-Clauses">7.6 Value_Size and Object_Size Clauses</a></li>
<li><a name="toc-Component_005fSize-Clauses-1" href="#Component_005fSize-Clauses">7.7 Component_Size Clauses</a></li>
<li><a name="toc-Bit_005fOrder-Clauses-1" href="#Bit_005fOrder-Clauses">7.8 Bit_Order Clauses</a></li>
<li><a name="toc-Effect-of-Bit_005fOrder-on-Byte-Ordering-1" href="#Effect-of-Bit_005fOrder-on-Byte-Ordering">7.9 Effect of Bit_Order on Byte Ordering</a></li>
<li><a name="toc-Pragma-Pack-for-Arrays-1" href="#Pragma-Pack-for-Arrays">7.10 Pragma Pack for Arrays</a></li>
<li><a name="toc-Pragma-Pack-for-Records-1" href="#Pragma-Pack-for-Records">7.11 Pragma Pack for Records</a></li>
<li><a name="toc-Record-Representation-Clauses-1" href="#Record-Representation-Clauses">7.12 Record Representation Clauses</a></li>
<li><a name="toc-Enumeration-Clauses-1" href="#Enumeration-Clauses">7.13 Enumeration Clauses</a></li>
<li><a name="toc-Address-Clauses-1" href="#Address-Clauses">7.14 Address Clauses</a></li>
<li><a name="toc-Effect-of-Convention-on-Representation-1" href="#Effect-of-Convention-on-Representation">7.15 Effect of Convention on Representation</a></li>
<li><a name="toc-Determining-the-Representations-chosen-by-GNAT-1" href="#Determining-the-Representations-chosen-by-GNAT">7.16 Determining the Representations chosen by GNAT</a></li>
</ul></li>
<li><a name="toc-Standard-Library-Routines-1" href="#Standard-Library-Routines">8 Standard Library Routines</a></li>
<li><a name="toc-The-Implementation-of-Standard-I_002fO-1" href="#The-Implementation-of-Standard-I_002fO">9 The Implementation of Standard I/O</a>
<ul class="no-bullet">
<li><a name="toc-Standard-I_002fO-Packages-1" href="#Standard-I_002fO-Packages">9.1 Standard I/O Packages</a></li>
<li><a name="toc-FORM-Strings-1" href="#FORM-Strings">9.2 FORM Strings</a></li>
<li><a name="toc-Direct_005fIO-1" href="#Direct_005fIO">9.3 Direct_IO</a></li>
<li><a name="toc-Sequential_005fIO-1" href="#Sequential_005fIO">9.4 Sequential_IO</a></li>
<li><a name="toc-Text_005fIO-1" href="#Text_005fIO">9.5 Text_IO</a>
<ul class="no-bullet">
<li><a name="toc-Stream-Pointer-Positioning" href="#Text_005fIO-Stream-Pointer-Positioning">9.5.1 Stream Pointer Positioning</a></li>
<li><a name="toc-Reading-and-Writing-Non_002dRegular-Files" href="#Text_005fIO-Reading-and-Writing-Non_002dRegular-Files">9.5.2 Reading and Writing Non-Regular Files</a></li>
<li><a name="toc-Get_005fImmediate-1" href="#Get_005fImmediate">9.5.3 Get_Immediate</a></li>
<li><a name="toc-Treating-Text_005fIO-Files-as-Streams-1" href="#Treating-Text_005fIO-Files-as-Streams">9.5.4 Treating Text_IO Files as Streams</a></li>
<li><a name="toc-Text_005fIO-Extensions-1" href="#Text_005fIO-Extensions">9.5.5 Text_IO Extensions</a></li>
<li><a name="toc-Text_005fIO-Facilities-for-Unbounded-Strings-1" href="#Text_005fIO-Facilities-for-Unbounded-Strings">9.5.6 Text_IO Facilities for Unbounded Strings</a></li>
</ul></li>
<li><a name="toc-Wide_005fText_005fIO-1" href="#Wide_005fText_005fIO">9.6 Wide_Text_IO</a>
<ul class="no-bullet">
<li><a name="toc-Stream-Pointer-Positioning-1" href="#Wide_005fText_005fIO-Stream-Pointer-Positioning">9.6.1 Stream Pointer Positioning</a></li>
<li><a name="toc-Reading-and-Writing-Non_002dRegular-Files-1" href="#Wide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files">9.6.2 Reading and Writing Non-Regular Files</a></li>
</ul></li>
<li><a name="toc-Wide_005fWide_005fText_005fIO-1" href="#Wide_005fWide_005fText_005fIO">9.7 Wide_Wide_Text_IO</a>
<ul class="no-bullet">
<li><a name="toc-Stream-Pointer-Positioning-2" href="#Wide_005fWide_005fText_005fIO-Stream-Pointer-Positioning">9.7.1 Stream Pointer Positioning</a></li>
<li><a name="toc-Reading-and-Writing-Non_002dRegular-Files-2" href="#Wide_005fWide_005fText_005fIO-Reading-and-Writing-Non_002dRegular-Files">9.7.2 Reading and Writing Non-Regular Files</a></li>
</ul></li>
<li><a name="toc-Stream_005fIO-1" href="#Stream_005fIO">9.8 Stream_IO</a></li>
<li><a name="toc-Text-Translation-1" href="#Text-Translation">9.9 Text Translation</a></li>
<li><a name="toc-Shared-Files-1" href="#Shared-Files">9.10 Shared Files</a></li>
<li><a name="toc-Filenames-encoding-1" href="#Filenames-encoding">9.11 Filenames encoding</a></li>
<li><a name="toc-Open-Modes-1" href="#Open-Modes">9.12 Open Modes</a></li>
<li><a name="toc-Operations-on-C-Streams-1" href="#Operations-on-C-Streams">9.13 Operations on C Streams</a></li>
<li><a name="toc-Interfacing-to-C-Streams-1" href="#Interfacing-to-C-Streams">9.14 Interfacing to C Streams</a></li>
</ul></li>
<li><a name="toc-The-GNAT-Library-1" href="#The-GNAT-Library">10 The GNAT Library</a>
<ul class="no-bullet">
<li><a name="toc-Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029-1" href="#Ada_002eCharacters_002eLatin_005f9-_0028a_002dchlat9_002eads_0029">10.1 <code>Ada.Characters.Latin_9</code> (<samp>a-chlat9.ads</samp>)</a></li>
<li><a name="toc-Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029-1" href="#Ada_002eCharacters_002eWide_005fLatin_005f1-_0028a_002dcwila1_002eads_0029">10.2 <code>Ada.Characters.Wide_Latin_1</code> (<samp>a-cwila1.ads</samp>)</a></li>
<li><a name="toc-Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila1_002eads_0029" href="#Ada_002eCharacters_002eWide_005fLatin_005f9-_0028a_002dcwila9_002eads_0029">10.3 <code>Ada.Characters.Wide_Latin_9</code> (<samp>a-cwila1.ads</samp>)</a></li>
<li><a name="toc-Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029-1" href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f1-_0028a_002dchzla1_002eads_0029">10.4 <code>Ada.Characters.Wide_Wide_Latin_1</code> (<samp>a-chzla1.ads</samp>)</a></li>
<li><a name="toc-Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029-1" href="#Ada_002eCharacters_002eWide_005fWide_005fLatin_005f9-_0028a_002dchzla9_002eads_0029">10.5 <code>Ada.Characters.Wide_Wide_Latin_9</code> (<samp>a-chzla9.ads</samp>)</a></li>
<li><a name="toc-Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029-1" href="#Ada_002eContainers_002eFormal_005fDoubly_005fLinked_005fLists-_0028a_002dcfdlli_002eads_0029">10.6 <code>Ada.Containers.Formal_Doubly_Linked_Lists</code> (<samp>a-cfdlli.ads</samp>)</a></li>
<li><a name="toc-Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029-1" href="#Ada_002eContainers_002eFormal_005fHashed_005fMaps-_0028a_002dcfhama_002eads_0029">10.7 <code>Ada.Containers.Formal_Hashed_Maps</code> (<samp>a-cfhama.ads</samp>)</a></li>
<li><a name="toc-Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029-1" href="#Ada_002eContainers_002eFormal_005fHashed_005fSets-_0028a_002dcfhase_002eads_0029">10.8 <code>Ada.Containers.Formal_Hashed_Sets</code> (<samp>a-cfhase.ads</samp>)</a></li>
<li><a name="toc-Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029-1" href="#Ada_002eContainers_002eFormal_005fOrdered_005fMaps-_0028a_002dcforma_002eads_0029">10.9 <code>Ada.Containers.Formal_Ordered_Maps</code> (<samp>a-cforma.ads</samp>)</a></li>
<li><a name="toc-Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029-1" href="#Ada_002eContainers_002eFormal_005fOrdered_005fSets-_0028a_002dcforse_002eads_0029">10.10 <code>Ada.Containers.Formal_Ordered_Sets</code> (<samp>a-cforse.ads</samp>)</a></li>
<li><a name="toc-Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029-1" href="#Ada_002eContainers_002eFormal_005fVectors-_0028a_002dcofove_002eads_0029">10.11 <code>Ada.Containers.Formal_Vectors</code> (<samp>a-cofove.ads</samp>)</a></li>
<li><a name="toc-Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029-1" href="#Ada_002eCommand_005fLine_002eEnvironment-_0028a_002dcolien_002eads_0029">10.12 <code>Ada.Command_Line.Environment</code> (<samp>a-colien.ads</samp>)</a></li>
<li><a name="toc-Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029-1" href="#Ada_002eCommand_005fLine_002eRemove-_0028a_002dcolire_002eads_0029">10.13 <code>Ada.Command_Line.Remove</code> (<samp>a-colire.ads</samp>)</a></li>
<li><a name="toc-Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029-1" href="#Ada_002eCommand_005fLine_002eResponse_005fFile-_0028a_002dclrefi_002eads_0029">10.14 <code>Ada.Command_Line.Response_File</code> (<samp>a-clrefi.ads</samp>)</a></li>
<li><a name="toc-Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029-1" href="#Ada_002eDirect_005fIO_002eC_005fStreams-_0028a_002ddiocst_002eads_0029">10.15 <code>Ada.Direct_IO.C_Streams</code> (<samp>a-diocst.ads</samp>)</a></li>
<li><a name="toc-Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029-1" href="#Ada_002eExceptions_002eIs_005fNull_005fOccurrence-_0028a_002deinuoc_002eads_0029">10.16 <code>Ada.Exceptions.Is_Null_Occurrence</code> (<samp>a-einuoc.ads</samp>)</a></li>
<li><a name="toc-Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029-1" href="#Ada_002eExceptions_002eLast_005fChance_005fHandler-_0028a_002delchha_002eads_0029">10.17 <code>Ada.Exceptions.Last_Chance_Handler</code> (<samp>a-elchha.ads</samp>)</a></li>
<li><a name="toc-Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029-1" href="#Ada_002eExceptions_002eTraceback-_0028a_002dexctra_002eads_0029">10.18 <code>Ada.Exceptions.Traceback</code> (<samp>a-exctra.ads</samp>)</a></li>
<li><a name="toc-Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029-1" href="#Ada_002eSequential_005fIO_002eC_005fStreams-_0028a_002dsiocst_002eads_0029">10.19 <code>Ada.Sequential_IO.C_Streams</code> (<samp>a-siocst.ads</samp>)</a></li>
<li><a name="toc-Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029-1" href="#Ada_002eStreams_002eStream_005fIO_002eC_005fStreams-_0028a_002dssicst_002eads_0029">10.20 <code>Ada.Streams.Stream_IO.C_Streams</code> (<samp>a-ssicst.ads</samp>)</a></li>
<li><a name="toc-Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029-1" href="#Ada_002eStrings_002eUnbounded_002eText_005fIO-_0028a_002dsuteio_002eads_0029">10.21 <code>Ada.Strings.Unbounded.Text_IO</code> (<samp>a-suteio.ads</samp>)</a></li>
<li><a name="toc-Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029-1" href="#Ada_002eStrings_002eWide_005fUnbounded_002eWide_005fText_005fIO-_0028a_002dswuwti_002eads_0029">10.22 <code>Ada.Strings.Wide_Unbounded.Wide_Text_IO</code> (<samp>a-swuwti.ads</samp>)</a></li>
<li><a name="toc-Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029-1" href="#Ada_002eStrings_002eWide_005fWide_005fUnbounded_002eWide_005fWide_005fText_005fIO-_0028a_002dszuzti_002eads_0029">10.23 <code>Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO</code> (<samp>a-szuzti.ads</samp>)</a></li>
<li><a name="toc-Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029-1" href="#Ada_002eText_005fIO_002eC_005fStreams-_0028a_002dtiocst_002eads_0029">10.24 <code>Ada.Text_IO.C_Streams</code> (<samp>a-tiocst.ads</samp>)</a></li>
<li><a name="toc-Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029-1" href="#Ada_002eText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dtirsfi_002eads_0029">10.25 <code>Ada.Text_IO.Reset_Standard_Files</code> (<samp>a-tirsfi.ads</samp>)</a></li>
<li><a name="toc-Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029-1" href="#Ada_002eWide_005fCharacters_002eUnicode-_0028a_002dwichun_002eads_0029">10.26 <code>Ada.Wide_Characters.Unicode</code> (<samp>a-wichun.ads</samp>)</a></li>
<li><a name="toc-Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029-1" href="#Ada_002eWide_005fText_005fIO_002eC_005fStreams-_0028a_002dwtcstr_002eads_0029">10.27 <code>Ada.Wide_Text_IO.C_Streams</code> (<samp>a-wtcstr.ads</samp>)</a></li>
<li><a name="toc-Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029-1" href="#Ada_002eWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dwrstfi_002eads_0029">10.28 <code>Ada.Wide_Text_IO.Reset_Standard_Files</code> (<samp>a-wrstfi.ads</samp>)</a></li>
<li><a name="toc-Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029-1" href="#Ada_002eWide_005fWide_005fCharacters_002eUnicode-_0028a_002dzchuni_002eads_0029">10.29 <code>Ada.Wide_Wide_Characters.Unicode</code> (<samp>a-zchuni.ads</samp>)</a></li>
<li><a name="toc-Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029-1" href="#Ada_002eWide_005fWide_005fText_005fIO_002eC_005fStreams-_0028a_002dztcstr_002eads_0029">10.30 <code>Ada.Wide_Wide_Text_IO.C_Streams</code> (<samp>a-ztcstr.ads</samp>)</a></li>
<li><a name="toc-Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029-1" href="#Ada_002eWide_005fWide_005fText_005fIO_002eReset_005fStandard_005fFiles-_0028a_002dzrstfi_002eads_0029">10.31 <code>Ada.Wide_Wide_Text_IO.Reset_Standard_Files</code> (<samp>a-zrstfi.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eAltivec-_0028g_002daltive_002eads_0029-1" href="#GNAT_002eAltivec-_0028g_002daltive_002eads_0029">10.32 <code>GNAT.Altivec</code> (<samp>g-altive.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029-1" href="#GNAT_002eAltivec_002eConversions-_0028g_002daltcon_002eads_0029">10.33 <code>GNAT.Altivec.Conversions</code> (<samp>g-altcon.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029-1" href="#GNAT_002eAltivec_002eVector_005fOperations-_0028g_002dalveop_002eads_0029">10.34 <code>GNAT.Altivec.Vector_Operations</code> (<samp>g-alveop.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029-1" href="#GNAT_002eAltivec_002eVector_005fTypes-_0028g_002dalvety_002eads_0029">10.35 <code>GNAT.Altivec.Vector_Types</code> (<samp>g-alvety.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029-1" href="#GNAT_002eAltivec_002eVector_005fViews-_0028g_002dalvevi_002eads_0029">10.36 <code>GNAT.Altivec.Vector_Views</code> (<samp>g-alvevi.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029-1" href="#GNAT_002eArray_005fSplit-_0028g_002darrspl_002eads_0029">10.37 <code>GNAT.Array_Split</code> (<samp>g-arrspl.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eAWK-_0028g_002dawk_002eads_0029-1" href="#GNAT_002eAWK-_0028g_002dawk_002eads_0029">10.38 <code>GNAT.AWK</code> (<samp>g-awk.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029-1" href="#GNAT_002eBounded_005fBuffers-_0028g_002dboubuf_002eads_0029">10.39 <code>GNAT.Bounded_Buffers</code> (<samp>g-boubuf.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029-1" href="#GNAT_002eBounded_005fMailboxes-_0028g_002dboumai_002eads_0029">10.40 <code>GNAT.Bounded_Mailboxes</code> (<samp>g-boumai.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029-1" href="#GNAT_002eBubble_005fSort-_0028g_002dbubsor_002eads_0029">10.41 <code>GNAT.Bubble_Sort</code> (<samp>g-bubsor.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029-1" href="#GNAT_002eBubble_005fSort_005fA-_0028g_002dbusora_002eads_0029">10.42 <code>GNAT.Bubble_Sort_A</code> (<samp>g-busora.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029-1" href="#GNAT_002eBubble_005fSort_005fG-_0028g_002dbusorg_002eads_0029">10.43 <code>GNAT.Bubble_Sort_G</code> (<samp>g-busorg.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029-1" href="#GNAT_002eByte_005fOrder_005fMark-_0028g_002dbyorma_002eads_0029">10.44 <code>GNAT.Byte_Order_Mark</code> (<samp>g-byorma.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029-1" href="#GNAT_002eByte_005fSwapping-_0028g_002dbytswa_002eads_0029">10.45 <code>GNAT.Byte_Swapping</code> (<samp>g-bytswa.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCalendar-_0028g_002dcalend_002eads_0029-1" href="#GNAT_002eCalendar-_0028g_002dcalend_002eads_0029">10.46 <code>GNAT.Calendar</code> (<samp>g-calend.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029-1" href="#GNAT_002eCalendar_002eTime_005fIO-_0028g_002dcatiio_002eads_0029">10.47 <code>GNAT.Calendar.Time_IO</code> (<samp>g-catiio.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029-1" href="#GNAT_002eCRC32-_0028g_002dcrc32_002eads_0029">10.48 <code>GNAT.CRC32</code> (<samp>g-crc32.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029-1" href="#GNAT_002eCase_005fUtil-_0028g_002dcasuti_002eads_0029">10.49 <code>GNAT.Case_Util</code> (<samp>g-casuti.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCGI-_0028g_002dcgi_002eads_0029-1" href="#GNAT_002eCGI-_0028g_002dcgi_002eads_0029">10.50 <code>GNAT.CGI</code> (<samp>g-cgi.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029-1" href="#GNAT_002eCGI_002eCookie-_0028g_002dcgicoo_002eads_0029">10.51 <code>GNAT.CGI.Cookie</code> (<samp>g-cgicoo.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029-1" href="#GNAT_002eCGI_002eDebug-_0028g_002dcgideb_002eads_0029">10.52 <code>GNAT.CGI.Debug</code> (<samp>g-cgideb.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029-1" href="#GNAT_002eCommand_005fLine-_0028g_002dcomlin_002eads_0029">10.53 <code>GNAT.Command_Line</code> (<samp>g-comlin.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029-1" href="#GNAT_002eCompiler_005fVersion-_0028g_002dcomver_002eads_0029">10.54 <code>GNAT.Compiler_Version</code> (<samp>g-comver.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029-1" href="#GNAT_002eCtrl_005fC-_0028g_002dctrl_005fc_002eads_0029">10.55 <code>GNAT.Ctrl_C</code> (<samp>g-ctrl_c.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029-1" href="#GNAT_002eCurrent_005fException-_0028g_002dcurexc_002eads_0029">10.56 <code>GNAT.Current_Exception</code> (<samp>g-curexc.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029-1" href="#GNAT_002eDebug_005fPools-_0028g_002ddebpoo_002eads_0029">10.57 <code>GNAT.Debug_Pools</code> (<samp>g-debpoo.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029-1" href="#GNAT_002eDebug_005fUtilities-_0028g_002ddebuti_002eads_0029">10.58 <code>GNAT.Debug_Utilities</code> (<samp>g-debuti.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029-1" href="#GNAT_002eDecode_005fString-_0028g_002ddecstr_002eads_0029">10.59 <code>GNAT.Decode_String</code> (<samp>g-decstr.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029-1" href="#GNAT_002eDecode_005fUTF8_005fString-_0028g_002ddeutst_002eads_0029">10.60 <code>GNAT.Decode_UTF8_String</code> (<samp>g-deutst.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029-1" href="#GNAT_002eDirectory_005fOperations-_0028g_002ddirope_002eads_0029">10.61 <code>GNAT.Directory_Operations</code> (<samp>g-dirope.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029-1" href="#GNAT_002eDirectory_005fOperations_002eIteration-_0028g_002ddiopit_002eads_0029">10.62 <code>GNAT.Directory_Operations.Iteration</code> (<samp>g-diopit.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029-1" href="#GNAT_002eDynamic_005fHTables-_0028g_002ddynhta_002eads_0029">10.63 <code>GNAT.Dynamic_HTables</code> (<samp>g-dynhta.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029-1" href="#GNAT_002eDynamic_005fTables-_0028g_002ddyntab_002eads_0029">10.64 <code>GNAT.Dynamic_Tables</code> (<samp>g-dyntab.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029-1" href="#GNAT_002eEncode_005fString-_0028g_002dencstr_002eads_0029">10.65 <code>GNAT.Encode_String</code> (<samp>g-encstr.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029-1" href="#GNAT_002eEncode_005fUTF8_005fString-_0028g_002denutst_002eads_0029">10.66 <code>GNAT.Encode_UTF8_String</code> (<samp>g-enutst.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029-1" href="#GNAT_002eException_005fActions-_0028g_002dexcact_002eads_0029">10.67 <code>GNAT.Exception_Actions</code> (<samp>g-excact.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029-1" href="#GNAT_002eException_005fTraces-_0028g_002dexctra_002eads_0029">10.68 <code>GNAT.Exception_Traces</code> (<samp>g-exctra.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eExceptions-_0028g_002dexpect_002eads_0029" href="#GNAT_002eExceptions-_0028g_002dexcept_002eads_0029">10.69 <code>GNAT.Exceptions</code> (<samp>g-expect.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eExpect-_0028g_002dexpect_002eads_0029-1" href="#GNAT_002eExpect-_0028g_002dexpect_002eads_0029">10.70 <code>GNAT.Expect</code> (<samp>g-expect.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029-1" href="#GNAT_002eExpect_002eTTY-_0028g_002dexptty_002eads_0029">10.71 <code>GNAT.Expect.TTY</code> (<samp>g-exptty.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029-1" href="#GNAT_002eFloat_005fControl-_0028g_002dflocon_002eads_0029">10.72 <code>GNAT.Float_Control</code> (<samp>g-flocon.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029-1" href="#GNAT_002eHeap_005fSort-_0028g_002dheasor_002eads_0029">10.73 <code>GNAT.Heap_Sort</code> (<samp>g-heasor.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029-1" href="#GNAT_002eHeap_005fSort_005fA-_0028g_002dhesora_002eads_0029">10.74 <code>GNAT.Heap_Sort_A</code> (<samp>g-hesora.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029-1" href="#GNAT_002eHeap_005fSort_005fG-_0028g_002dhesorg_002eads_0029">10.75 <code>GNAT.Heap_Sort_G</code> (<samp>g-hesorg.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eHTable-_0028g_002dhtable_002eads_0029-1" href="#GNAT_002eHTable-_0028g_002dhtable_002eads_0029">10.76 <code>GNAT.HTable</code> (<samp>g-htable.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eIO-_0028g_002dio_002eads_0029-1" href="#GNAT_002eIO-_0028g_002dio_002eads_0029">10.77 <code>GNAT.IO</code> (<samp>g-io.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029-1" href="#GNAT_002eIO_005fAux-_0028g_002dio_005faux_002eads_0029">10.78 <code>GNAT.IO_Aux</code> (<samp>g-io_aux.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029-1" href="#GNAT_002eLock_005fFiles-_0028g_002dlocfil_002eads_0029">10.79 <code>GNAT.Lock_Files</code> (<samp>g-locfil.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029-1" href="#GNAT_002eMBBS_005fDiscrete_005fRandom-_0028g_002dmbdira_002eads_0029">10.80 <code>GNAT.MBBS_Discrete_Random</code> (<samp>g-mbdira.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029-1" href="#GNAT_002eMBBS_005fFloat_005fRandom-_0028g_002dmbflra_002eads_0029">10.81 <code>GNAT.MBBS_Float_Random</code> (<samp>g-mbflra.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eMD5-_0028g_002dmd5_002eads_0029-1" href="#GNAT_002eMD5-_0028g_002dmd5_002eads_0029">10.82 <code>GNAT.MD5</code> (<samp>g-md5.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029-1" href="#GNAT_002eMemory_005fDump-_0028g_002dmemdum_002eads_0029">10.83 <code>GNAT.Memory_Dump</code> (<samp>g-memdum.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029-1" href="#GNAT_002eMost_005fRecent_005fException-_0028g_002dmoreex_002eads_0029">10.84 <code>GNAT.Most_Recent_Exception</code> (<samp>g-moreex.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029-1" href="#GNAT_002eOS_005fLib-_0028g_002dos_005flib_002eads_0029">10.85 <code>GNAT.OS_Lib</code> (<samp>g-os_lib.ads</samp>)</a></li>
<li><a name="toc-GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029-1" href="#GNAT_002ePerfect_005fHash_005fGenerators-_0028g_002dpehage_002eads_0029">10.86 <code>GNAT.Perfect_Hash_Generators</code> (<samp>g-pehage.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029-1" href="#GNAT_002eRandom_005fNumbers-_0028g_002drannum_002eads_0029">10.87 <code>GNAT.Random_Numbers</code> (<samp>g-rannum.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eRegexp-_0028g_002dregexp_002eads_0029-1" href="#GNAT_002eRegexp-_0028g_002dregexp_002eads_0029">10.88 <code>GNAT.Regexp</code> (<samp>g-regexp.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eRegistry-_0028g_002dregist_002eads_0029-1" href="#GNAT_002eRegistry-_0028g_002dregist_002eads_0029">10.89 <code>GNAT.Registry</code> (<samp>g-regist.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eRegpat-_0028g_002dregpat_002eads_0029-1" href="#GNAT_002eRegpat-_0028g_002dregpat_002eads_0029">10.90 <code>GNAT.Regpat</code> (<samp>g-regpat.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029-1" href="#GNAT_002eSecondary_005fStack_005fInfo-_0028g_002dsestin_002eads_0029">10.91 <code>GNAT.Secondary_Stack_Info</code> (<samp>g-sestin.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029-1" href="#GNAT_002eSemaphores-_0028g_002dsemaph_002eads_0029">10.92 <code>GNAT.Semaphores</code> (<samp>g-semaph.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029-1" href="#GNAT_002eSerial_005fCommunications-_0028g_002dsercom_002eads_0029">10.93 <code>GNAT.Serial_Communications</code> (<samp>g-sercom.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSHA1-_0028g_002dsha1_002eads_0029-1" href="#GNAT_002eSHA1-_0028g_002dsha1_002eads_0029">10.94 <code>GNAT.SHA1</code> (<samp>g-sha1.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSHA224-_0028g_002dsha224_002eads_0029-1" href="#GNAT_002eSHA224-_0028g_002dsha224_002eads_0029">10.95 <code>GNAT.SHA224</code> (<samp>g-sha224.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSHA256-_0028g_002dsha256_002eads_0029-1" href="#GNAT_002eSHA256-_0028g_002dsha256_002eads_0029">10.96 <code>GNAT.SHA256</code> (<samp>g-sha256.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSHA384-_0028g_002dsha384_002eads_0029-1" href="#GNAT_002eSHA384-_0028g_002dsha384_002eads_0029">10.97 <code>GNAT.SHA384</code> (<samp>g-sha384.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSHA512-_0028g_002dsha512_002eads_0029-1" href="#GNAT_002eSHA512-_0028g_002dsha512_002eads_0029">10.98 <code>GNAT.SHA512</code> (<samp>g-sha512.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSignals-_0028g_002dsignal_002eads_0029-1" href="#GNAT_002eSignals-_0028g_002dsignal_002eads_0029">10.99 <code>GNAT.Signals</code> (<samp>g-signal.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSockets-_0028g_002dsocket_002eads_0029-1" href="#GNAT_002eSockets-_0028g_002dsocket_002eads_0029">10.100 <code>GNAT.Sockets</code> (<samp>g-socket.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029-1" href="#GNAT_002eSource_005fInfo-_0028g_002dsouinf_002eads_0029">10.101 <code>GNAT.Source_Info</code> (<samp>g-souinf.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029-1" href="#GNAT_002eSpelling_005fChecker-_0028g_002dspeche_002eads_0029">10.102 <code>GNAT.Spelling_Checker</code> (<samp>g-speche.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029-1" href="#GNAT_002eSpelling_005fChecker_005fGeneric-_0028g_002dspchge_002eads_0029">10.103 <code>GNAT.Spelling_Checker_Generic</code> (<samp>g-spchge.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029-1" href="#GNAT_002eSpitbol_002ePatterns-_0028g_002dspipat_002eads_0029">10.104 <code>GNAT.Spitbol.Patterns</code> (<samp>g-spipat.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029-1" href="#GNAT_002eSpitbol-_0028g_002dspitbo_002eads_0029">10.105 <code>GNAT.Spitbol</code> (<samp>g-spitbo.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029-1" href="#GNAT_002eSpitbol_002eTable_005fBoolean-_0028g_002dsptabo_002eads_0029">10.106 <code>GNAT.Spitbol.Table_Boolean</code> (<samp>g-sptabo.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029-1" href="#GNAT_002eSpitbol_002eTable_005fInteger-_0028g_002dsptain_002eads_0029">10.107 <code>GNAT.Spitbol.Table_Integer</code> (<samp>g-sptain.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029-1" href="#GNAT_002eSpitbol_002eTable_005fVString-_0028g_002dsptavs_002eads_0029">10.108 <code>GNAT.Spitbol.Table_VString</code> (<samp>g-sptavs.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSSE-_0028g_002dsse_002eads_0029-1" href="#GNAT_002eSSE-_0028g_002dsse_002eads_0029">10.109 <code>GNAT.SSE</code> (<samp>g-sse.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029-1" href="#GNAT_002eSSE_002eVector_005fTypes-_0028g_002dssvety_002eads_0029">10.110 <code>GNAT.SSE.Vector_Types</code> (<samp>g-ssvety.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eStrings-_0028g_002dstring_002eads_0029-1" href="#GNAT_002eStrings-_0028g_002dstring_002eads_0029">10.111 <code>GNAT.Strings</code> (<samp>g-string.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029-1" href="#GNAT_002eString_005fSplit-_0028g_002dstrspl_002eads_0029">10.112 <code>GNAT.String_Split</code> (<samp>g-strspl.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eTable-_0028g_002dtable_002eads_0029-1" href="#GNAT_002eTable-_0028g_002dtable_002eads_0029">10.113 <code>GNAT.Table</code> (<samp>g-table.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029-1" href="#GNAT_002eTask_005fLock-_0028g_002dtasloc_002eads_0029">10.114 <code>GNAT.Task_Lock</code> (<samp>g-tasloc.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029-1" href="#GNAT_002eTime_005fStamp-_0028g_002dtimsta_002eads_0029">10.115 <code>GNAT.Time_Stamp</code> (<samp>g-timsta.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eThreads-_0028g_002dthread_002eads_0029-1" href="#GNAT_002eThreads-_0028g_002dthread_002eads_0029">10.116 <code>GNAT.Threads</code> (<samp>g-thread.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029-1" href="#GNAT_002eTraceback-_0028g_002dtraceb_002eads_0029">10.117 <code>GNAT.Traceback</code> (<samp>g-traceb.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029-1" href="#GNAT_002eTraceback_002eSymbolic-_0028g_002dtrasym_002eads_0029">10.118 <code>GNAT.Traceback.Symbolic</code> (<samp>g-trasym.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eUTF_005f32-_0028g_002dtable_002eads_0029" href="#GNAT_002eUTF_005f32-_0028g_002dutf_005f32_002eads_0029">10.119 <code>GNAT.UTF_32</code> (<samp>g-table.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eWide_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029" href="#GNAT_002eUTF_005f32_005fSpelling_005fChecker-_0028g_002du3spch_002eads_0029">10.120 <code>GNAT.Wide_Spelling_Checker</code> (<samp>g-u3spch.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029-1" href="#GNAT_002eWide_005fSpelling_005fChecker-_0028g_002dwispch_002eads_0029">10.121 <code>GNAT.Wide_Spelling_Checker</code> (<samp>g-wispch.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029-1" href="#GNAT_002eWide_005fString_005fSplit-_0028g_002dwistsp_002eads_0029">10.122 <code>GNAT.Wide_String_Split</code> (<samp>g-wistsp.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029-1" href="#GNAT_002eWide_005fWide_005fSpelling_005fChecker-_0028g_002dzspche_002eads_0029">10.123 <code>GNAT.Wide_Wide_Spelling_Checker</code> (<samp>g-zspche.ads</samp>)</a></li>
<li><a name="toc-GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029-1" href="#GNAT_002eWide_005fWide_005fString_005fSplit-_0028g_002dzistsp_002eads_0029">10.124 <code>GNAT.Wide_Wide_String_Split</code> (<samp>g-zistsp.ads</samp>)</a></li>
<li><a name="toc-Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029-1" href="#Interfaces_002eC_002eExtensions-_0028i_002dcexten_002eads_0029">10.125 <code>Interfaces.C.Extensions</code> (<samp>i-cexten.ads</samp>)</a></li>
<li><a name="toc-Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029-1" href="#Interfaces_002eC_002eStreams-_0028i_002dcstrea_002eads_0029">10.126 <code>Interfaces.C.Streams</code> (<samp>i-cstrea.ads</samp>)</a></li>
<li><a name="toc-Interfaces_002eCPP-_0028i_002dcpp_002eads_0029-1" href="#Interfaces_002eCPP-_0028i_002dcpp_002eads_0029">10.127 <code>Interfaces.CPP</code> (<samp>i-cpp.ads</samp>)</a></li>
<li><a name="toc-Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029-1" href="#Interfaces_002ePacked_005fDecimal-_0028i_002dpacdec_002eads_0029">10.128 <code>Interfaces.Packed_Decimal</code> (<samp>i-pacdec.ads</samp>)</a></li>
<li><a name="toc-Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029-1" href="#Interfaces_002eVxWorks-_0028i_002dvxwork_002eads_0029">10.129 <code>Interfaces.VxWorks</code> (<samp>i-vxwork.ads</samp>)</a></li>
<li><a name="toc-Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029-1" href="#Interfaces_002eVxWorks_002eIO-_0028i_002dvxwoio_002eads_0029">10.130 <code>Interfaces.VxWorks.IO</code> (<samp>i-vxwoio.ads</samp>)</a></li>
<li><a name="toc-System_002eAddress_005fImage-_0028s_002daddima_002eads_0029-1" href="#System_002eAddress_005fImage-_0028s_002daddima_002eads_0029">10.131 <code>System.Address_Image</code> (<samp>s-addima.ads</samp>)</a></li>
<li><a name="toc-System_002eAssertions-_0028s_002dassert_002eads_0029-1" href="#System_002eAssertions-_0028s_002dassert_002eads_0029">10.132 <code>System.Assertions</code> (<samp>s-assert.ads</samp>)</a></li>
<li><a name="toc-System_002eMemory-_0028s_002dmemory_002eads_0029-1" href="#System_002eMemory-_0028s_002dmemory_002eads_0029">10.133 <code>System.Memory</code> (<samp>s-memory.ads</samp>)</a></li>
<li><a name="toc-System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029-1" href="#System_002ePartition_005fInterface-_0028s_002dparint_002eads_0029">10.134 <code>System.Partition_Interface</code> (<samp>s-parint.ads</samp>)</a></li>
<li><a name="toc-System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029-1" href="#System_002ePool_005fGlobal-_0028s_002dpooglo_002eads_0029">10.135 <code>System.Pool_Global</code> (<samp>s-pooglo.ads</samp>)</a></li>
<li><a name="toc-System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029-1" href="#System_002ePool_005fLocal-_0028s_002dpooloc_002eads_0029">10.136 <code>System.Pool_Local</code> (<samp>s-pooloc.ads</samp>)</a></li>
<li><a name="toc-System_002eRestrictions-_0028s_002drestri_002eads_0029-1" href="#System_002eRestrictions-_0028s_002drestri_002eads_0029">10.137 <code>System.Restrictions</code> (<samp>s-restri.ads</samp>)</a></li>
<li><a name="toc-System_002eRident-_0028s_002drident_002eads_0029-1" href="#System_002eRident-_0028s_002drident_002eads_0029">10.138 <code>System.Rident</code> (<samp>s-rident.ads</samp>)</a></li>
<li><a name="toc-System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029-1" href="#System_002eStrings_002eStream_005fOps-_0028s_002dststop_002eads_0029">10.139 <code>System.Strings.Stream_Ops</code> (<samp>s-ststop.ads</samp>)</a></li>
<li><a name="toc-System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029-1" href="#System_002eTask_005fInfo-_0028s_002dtasinf_002eads_0029">10.140 <code>System.Task_Info</code> (<samp>s-tasinf.ads</samp>)</a></li>
<li><a name="toc-System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029-1" href="#System_002eWch_005fCnv-_0028s_002dwchcnv_002eads_0029">10.141 <code>System.Wch_Cnv</code> (<samp>s-wchcnv.ads</samp>)</a></li>
<li><a name="toc-System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029-1" href="#System_002eWch_005fCon-_0028s_002dwchcon_002eads_0029">10.142 <code>System.Wch_Con</code> (<samp>s-wchcon.ads</samp>)</a></li>
</ul></li>
<li><a name="toc-Interfacing-to-Other-Languages-1" href="#Interfacing-to-Other-Languages">11 Interfacing to Other Languages</a>
<ul class="no-bullet">
<li><a name="toc-Interfacing-to-C-1" href="#Interfacing-to-C">11.1 Interfacing to C</a></li>
<li><a name="toc-Interfacing-to-C_002b_002b-1" href="#Interfacing-to-C_002b_002b">11.2 Interfacing to C++</a></li>
<li><a name="toc-Interfacing-to-COBOL-1" href="#Interfacing-to-COBOL">11.3 Interfacing to COBOL</a></li>
<li><a name="toc-Interfacing-to-Fortran-1" href="#Interfacing-to-Fortran">11.4 Interfacing to Fortran</a></li>
<li><a name="toc-Interfacing-to-non_002dGNAT-Ada-code-1" href="#Interfacing-to-non_002dGNAT-Ada-code">11.5 Interfacing to non-GNAT Ada code</a></li>
</ul></li>
<li><a name="toc-Specialized-Needs-Annexes-1" href="#Specialized-Needs-Annexes">12 Specialized Needs Annexes</a></li>
<li><a name="toc-Implementation-of-Specific-Ada-Features-1" href="#Implementation-of-Specific-Ada-Features">13 Implementation of Specific Ada Features</a>
<ul class="no-bullet">
<li><a name="toc-Machine-Code-Insertions-1" href="#Machine-Code-Insertions">13.1 Machine Code Insertions</a></li>
<li><a name="toc-GNAT-Implementation-of-Tasking-1" href="#GNAT-Implementation-of-Tasking">13.2 GNAT Implementation of Tasking</a>
<ul class="no-bullet">
<li><a name="toc-Mapping-Ada-Tasks-onto-the-Underlying-Kernel-Threads-1" href="#Mapping-Ada-Tasks-onto-the-Underlying-Kernel-Threads">13.2.1 Mapping Ada Tasks onto the Underlying Kernel Threads</a></li>
<li><a name="toc-Ensuring-Compliance-with-the-Real_002dTime-Annex-1" href="#Ensuring-Compliance-with-the-Real_002dTime-Annex">13.2.2 Ensuring Compliance with the Real-Time Annex</a></li>
</ul></li>
<li><a name="toc-GNAT-Implementation-of-Shared-Passive-Packages-1" href="#GNAT-Implementation-of-Shared-Passive-Packages">13.3 GNAT Implementation of Shared Passive Packages</a></li>
<li><a name="toc-Code-Generation-for-Array-Aggregates-1" href="#Code-Generation-for-Array-Aggregates">13.4 Code Generation for Array Aggregates</a>
<ul class="no-bullet">
<li><a name="toc-Static-constant-aggregates-with-static-bounds-1" href="#Static-constant-aggregates-with-static-bounds">13.4.1 Static constant aggregates with static bounds</a></li>
<li><a name="toc-Constant-aggregates-with-unconstrained-nominal-types-1" href="#Constant-aggregates-with-unconstrained-nominal-types">13.4.2 Constant aggregates with unconstrained nominal types</a></li>
<li><a name="toc-Aggregates-with-static-bounds-1" href="#Aggregates-with-static-bounds">13.4.3 Aggregates with static bounds</a></li>
<li><a name="toc-Aggregates-with-non_002dstatic-bounds-1" href="#Aggregates-with-non_002dstatic-bounds">13.4.4 Aggregates with non-static bounds</a></li>
<li><a name="toc-Aggregates-in-assignment-statements-1" href="#Aggregates-in-assignment-statements">13.4.5 Aggregates in assignment statements</a></li>
</ul></li>
<li><a name="toc-The-Size-of-Discriminated-Records-with-Default-Discriminants-1" href="#The-Size-of-Discriminated-Records-with-Default-Discriminants">13.5 The Size of Discriminated Records with Default Discriminants</a></li>
<li><a name="toc-Strict-Conformance-to-the-Ada-Reference-Manual-1" href="#Strict-Conformance-to-the-Ada-Reference-Manual">13.6 Strict Conformance to the Ada Reference Manual</a></li>
</ul></li>
<li><a name="toc-Implementation-of-Ada-2012-Features-1" href="#Implementation-of-Ada-2012-Features">14 Implementation of Ada 2012 Features</a></li>
<li><a name="toc-Obsolescent-Features-1" href="#Obsolescent-Features">15 Obsolescent Features</a>
<ul class="no-bullet">
<li><a name="toc-pragma-No_005fRun_005fTime-1" href="#pragma-No_005fRun_005fTime">15.1 pragma No_Run_Time</a></li>
<li><a name="toc-pragma-Ravenscar-1" href="#pragma-Ravenscar">15.2 pragma Ravenscar</a></li>
<li><a name="toc-pragma-Restricted_005fRun_005fTime-1" href="#pragma-Restricted_005fRun_005fTime">15.3 pragma Restricted_Run_Time</a></li>
</ul></li>
<li><a name="toc-GNU-Free-Documentation-License-1" href="#GNU-Free-Documentation-License">GNU Free Documentation License</a>
<ul class="no-bullet">
<li><a name="toc-ADDENDUM_003a-How-to-use-this-License-for-your-documents" href="#ADDENDUM_003a-How-to-use-this-License-for-your-documents">ADDENDUM: How to use this License for your documents</a></li>
</ul></li>
<li><a name="toc-Index-1" href="#Index">Index</a></li>
</ul>
</div>
<hr>
</body>
</html>
|