/usr/share/ada/adainclude/gnatvsn/atree.adb is in libgnatvsn4.9-dev 4.9.2-1.
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 | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A T R E E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2013, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram ordering check for this package
-- WARNING: There is a C version of this package. Any changes to this source
-- file must be properly reflected in the file atree.h which is a C header
-- file containing equivalent definitions for use by gigi.
with Aspects; use Aspects;
with Debug; use Debug;
with Nlists; use Nlists;
with Output; use Output;
with Sinput; use Sinput;
with Tree_IO; use Tree_IO;
package body Atree is
Reporting_Proc : Report_Proc := null;
-- Record argument to last call to Set_Reporting_Proc
---------------
-- Debugging --
---------------
-- Suppose you find that node 12345 is messed up. You might want to find
-- the code that created that node. There are two ways to do this:
-- One way is to set a conditional breakpoint on New_Node_Debugging_Output
-- (nickname "nnd"):
-- break nnd if n = 12345
-- and run gnat1 again from the beginning.
-- The other way is to set a breakpoint near the beginning (e.g. on
-- gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
-- ww := 12345
-- and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
-- Either way, gnat1 will stop when node 12345 is created
-- The second method is much faster
-- Similarly, rr and rrd allow breaking on rewriting of a given node
ww : Node_Id'Base := Node_Id'First - 1;
pragma Export (Ada, ww); -- trick the optimizer
Watch_Node : Node_Id'Base renames ww;
-- Node to "watch"; that is, whenever a node is created, we check if it
-- is equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
-- presumably set a breakpoint on New_Node_Breakpoint. Note that the
-- initial value of Node_Id'First - 1 ensures that by default, no node
-- will be equal to Watch_Node.
procedure nn;
pragma Export (Ada, nn);
procedure New_Node_Breakpoint renames nn;
-- This doesn't do anything interesting; it's just for setting breakpoint
-- on as explained above.
procedure nnd (N : Node_Id);
pragma Export (Ada, nnd);
procedure New_Node_Debugging_Output (N : Node_Id) renames nnd;
-- For debugging. If debugging is turned on, New_Node and New_Entity call
-- this. If debug flag N is turned on, this prints out the new node.
--
-- If Node = Watch_Node, this prints out the new node and calls
-- New_Node_Breakpoint. Otherwise, does nothing.
procedure rr;
pragma Export (Ada, rr);
procedure Rewrite_Breakpoint renames rr;
-- This doesn't do anything interesting; it's just for setting breakpoint
-- on as explained above.
procedure rrd (Old_Node, New_Node : Node_Id);
pragma Export (Ada, rrd);
procedure Rewrite_Debugging_Output
(Old_Node, New_Node : Node_Id) renames rrd;
-- For debugging. If debugging is turned on, Rewrite calls this. If debug
-- flag N is turned on, this prints out the new node.
--
-- If Old_Node = Watch_Node, this prints out the old and new nodes and
-- calls Rewrite_Breakpoint. Otherwise, does nothing.
procedure Node_Debug_Output (Op : String; N : Node_Id);
-- Common code for nnd and rrd, writes Op followed by information about N
-----------------------------
-- Local Objects and Types --
-----------------------------
Node_Count : Nat;
-- Count allocated nodes for Num_Nodes function
use Unchecked_Access;
-- We are allowed to see these from within our own body
use Atree_Private_Part;
-- We are also allowed to see our private data structures
-- Functions used to store Entity_Kind value in Nkind field
-- The following declarations are used to store flags 65-72 in the
-- Nkind field of the third component of an extended (entity) node.
type Flag_Byte is record
Flag65 : Boolean;
Flag66 : Boolean;
Flag67 : Boolean;
Flag68 : Boolean;
Flag69 : Boolean;
Flag70 : Boolean;
Flag71 : Boolean;
Flag72 : Boolean;
end record;
pragma Pack (Flag_Byte);
for Flag_Byte'Size use 8;
type Flag_Byte_Ptr is access all Flag_Byte;
type Node_Kind_Ptr is access all Node_Kind;
function To_Flag_Byte is new
Unchecked_Conversion (Node_Kind, Flag_Byte);
function To_Flag_Byte_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
-- The following declarations are used to store flags 239-246 in the
-- Nkind field of the fourth component of an extended (entity) node.
type Flag_Byte2 is record
Flag239 : Boolean;
Flag240 : Boolean;
Flag241 : Boolean;
Flag242 : Boolean;
Flag243 : Boolean;
Flag244 : Boolean;
Flag245 : Boolean;
Flag246 : Boolean;
end record;
pragma Pack (Flag_Byte2);
for Flag_Byte2'Size use 8;
type Flag_Byte2_Ptr is access all Flag_Byte2;
function To_Flag_Byte2 is new
Unchecked_Conversion (Node_Kind, Flag_Byte2);
function To_Flag_Byte2_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte2_Ptr);
-- The following declarations are used to store flags 247-254 in the
-- Nkind field of the fifth component of an extended (entity) node.
type Flag_Byte3 is record
Flag247 : Boolean;
Flag248 : Boolean;
Flag249 : Boolean;
Flag250 : Boolean;
Flag251 : Boolean;
Flag252 : Boolean;
Flag253 : Boolean;
Flag254 : Boolean;
end record;
pragma Pack (Flag_Byte3);
for Flag_Byte3'Size use 8;
type Flag_Byte3_Ptr is access all Flag_Byte3;
function To_Flag_Byte3 is new
Unchecked_Conversion (Node_Kind, Flag_Byte3);
function To_Flag_Byte3_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte3_Ptr);
-- The following declarations are used to store flags 310-317 in the
-- Nkind field of the sixth component of an extended (entity) node.
type Flag_Byte4 is record
Flag310 : Boolean;
Flag311 : Boolean;
Flag312 : Boolean;
Flag313 : Boolean;
Flag314 : Boolean;
Flag315 : Boolean;
Flag316 : Boolean;
Flag317 : Boolean;
end record;
pragma Pack (Flag_Byte4);
for Flag_Byte4'Size use 8;
type Flag_Byte4_Ptr is access all Flag_Byte4;
function To_Flag_Byte4 is new
Unchecked_Conversion (Node_Kind, Flag_Byte4);
function To_Flag_Byte4_Ptr is new
Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte4_Ptr);
-- The following declarations are used to store flags 73-96 and the
-- Convention field in the Field12 field of the third component of an
-- extended (Entity) node.
type Flag_Word is record
Flag73 : Boolean;
Flag74 : Boolean;
Flag75 : Boolean;
Flag76 : Boolean;
Flag77 : Boolean;
Flag78 : Boolean;
Flag79 : Boolean;
Flag80 : Boolean;
Flag81 : Boolean;
Flag82 : Boolean;
Flag83 : Boolean;
Flag84 : Boolean;
Flag85 : Boolean;
Flag86 : Boolean;
Flag87 : Boolean;
Flag88 : Boolean;
Flag89 : Boolean;
Flag90 : Boolean;
Flag91 : Boolean;
Flag92 : Boolean;
Flag93 : Boolean;
Flag94 : Boolean;
Flag95 : Boolean;
Flag96 : Boolean;
Convention : Convention_Id;
end record;
pragma Pack (Flag_Word);
for Flag_Word'Size use 32;
for Flag_Word'Alignment use 4;
type Flag_Word_Ptr is access all Flag_Word;
type Union_Id_Ptr is access all Union_Id;
function To_Flag_Word is new
Unchecked_Conversion (Union_Id, Flag_Word);
function To_Flag_Word_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
-- The following declarations are used to store flags 97-128 in the
-- Field12 field of the fourth component of an extended (entity) node.
type Flag_Word2 is record
Flag97 : Boolean;
Flag98 : Boolean;
Flag99 : Boolean;
Flag100 : Boolean;
Flag101 : Boolean;
Flag102 : Boolean;
Flag103 : Boolean;
Flag104 : Boolean;
Flag105 : Boolean;
Flag106 : Boolean;
Flag107 : Boolean;
Flag108 : Boolean;
Flag109 : Boolean;
Flag110 : Boolean;
Flag111 : Boolean;
Flag112 : Boolean;
Flag113 : Boolean;
Flag114 : Boolean;
Flag115 : Boolean;
Flag116 : Boolean;
Flag117 : Boolean;
Flag118 : Boolean;
Flag119 : Boolean;
Flag120 : Boolean;
Flag121 : Boolean;
Flag122 : Boolean;
Flag123 : Boolean;
Flag124 : Boolean;
Flag125 : Boolean;
Flag126 : Boolean;
Flag127 : Boolean;
Flag128 : Boolean;
end record;
pragma Pack (Flag_Word2);
for Flag_Word2'Size use 32;
for Flag_Word2'Alignment use 4;
type Flag_Word2_Ptr is access all Flag_Word2;
function To_Flag_Word2 is new
Unchecked_Conversion (Union_Id, Flag_Word2);
function To_Flag_Word2_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
-- The following declarations are used to store flags 152-183 in the
-- Field11 field of the fourth component of an extended (entity) node.
type Flag_Word3 is record
Flag152 : Boolean;
Flag153 : Boolean;
Flag154 : Boolean;
Flag155 : Boolean;
Flag156 : Boolean;
Flag157 : Boolean;
Flag158 : Boolean;
Flag159 : Boolean;
Flag160 : Boolean;
Flag161 : Boolean;
Flag162 : Boolean;
Flag163 : Boolean;
Flag164 : Boolean;
Flag165 : Boolean;
Flag166 : Boolean;
Flag167 : Boolean;
Flag168 : Boolean;
Flag169 : Boolean;
Flag170 : Boolean;
Flag171 : Boolean;
Flag172 : Boolean;
Flag173 : Boolean;
Flag174 : Boolean;
Flag175 : Boolean;
Flag176 : Boolean;
Flag177 : Boolean;
Flag178 : Boolean;
Flag179 : Boolean;
Flag180 : Boolean;
Flag181 : Boolean;
Flag182 : Boolean;
Flag183 : Boolean;
end record;
pragma Pack (Flag_Word3);
for Flag_Word3'Size use 32;
for Flag_Word3'Alignment use 4;
type Flag_Word3_Ptr is access all Flag_Word3;
function To_Flag_Word3 is new
Unchecked_Conversion (Union_Id, Flag_Word3);
function To_Flag_Word3_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
-- The following declarations are used to store flags 184-215 in the
-- Field12 field of the fifth component of an extended (entity) node.
type Flag_Word4 is record
Flag184 : Boolean;
Flag185 : Boolean;
Flag186 : Boolean;
Flag187 : Boolean;
Flag188 : Boolean;
Flag189 : Boolean;
Flag190 : Boolean;
Flag191 : Boolean;
Flag192 : Boolean;
Flag193 : Boolean;
Flag194 : Boolean;
Flag195 : Boolean;
Flag196 : Boolean;
Flag197 : Boolean;
Flag198 : Boolean;
Flag199 : Boolean;
Flag200 : Boolean;
Flag201 : Boolean;
Flag202 : Boolean;
Flag203 : Boolean;
Flag204 : Boolean;
Flag205 : Boolean;
Flag206 : Boolean;
Flag207 : Boolean;
Flag208 : Boolean;
Flag209 : Boolean;
Flag210 : Boolean;
Flag211 : Boolean;
Flag212 : Boolean;
Flag213 : Boolean;
Flag214 : Boolean;
Flag215 : Boolean;
end record;
pragma Pack (Flag_Word4);
for Flag_Word4'Size use 32;
for Flag_Word4'Alignment use 4;
type Flag_Word4_Ptr is access all Flag_Word4;
function To_Flag_Word4 is new
Unchecked_Conversion (Union_Id, Flag_Word4);
function To_Flag_Word4_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
-- The following declarations are used to store flags 255-286 in the
-- Field12 field of the sixth component of an extended (entity) node.
type Flag_Word5 is record
Flag255 : Boolean;
Flag256 : Boolean;
Flag257 : Boolean;
Flag258 : Boolean;
Flag259 : Boolean;
Flag260 : Boolean;
Flag261 : Boolean;
Flag262 : Boolean;
Flag263 : Boolean;
Flag264 : Boolean;
Flag265 : Boolean;
Flag266 : Boolean;
Flag267 : Boolean;
Flag268 : Boolean;
Flag269 : Boolean;
Flag270 : Boolean;
Flag271 : Boolean;
Flag272 : Boolean;
Flag273 : Boolean;
Flag274 : Boolean;
Flag275 : Boolean;
Flag276 : Boolean;
Flag277 : Boolean;
Flag278 : Boolean;
Flag279 : Boolean;
Flag280 : Boolean;
Flag281 : Boolean;
Flag282 : Boolean;
Flag283 : Boolean;
Flag284 : Boolean;
Flag285 : Boolean;
Flag286 : Boolean;
end record;
pragma Pack (Flag_Word5);
for Flag_Word5'Size use 32;
for Flag_Word5'Alignment use 4;
type Flag_Word5_Ptr is access all Flag_Word5;
function To_Flag_Word5 is new
Unchecked_Conversion (Union_Id, Flag_Word5);
function To_Flag_Word5_Ptr is new
Unchecked_Conversion (Union_Id_Ptr, Flag_Word5_Ptr);
--------------------------------------------------
-- Implementation of Tree Substitution Routines --
--------------------------------------------------
-- A separate table keeps track of the mapping between rewritten nodes
-- and their corresponding original tree nodes. Rewrite makes an entry
-- in this table for use by Original_Node. By default, if no call is
-- Rewrite, the entry in this table points to the original unwritten node.
-- Note: eventually, this should be a field in the Node directly, but
-- for now we do not want to disturb the efficiency of a power of 2
-- for the node size
package Orig_Nodes is new Table.Table (
Table_Component_Type => Node_Id,
Table_Index_Type => Node_Id'Base,
Table_Low_Bound => First_Node_Id,
Table_Initial => Alloc.Orig_Nodes_Initial,
Table_Increment => Alloc.Orig_Nodes_Increment,
Table_Name => "Orig_Nodes");
--------------------------
-- Paren_Count Handling --
--------------------------
-- As noted in the spec, the paren count in a sub-expression node has
-- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
-- and we use an auxiliary serially scanned table to record the actual
-- count. A serial search is fine, only pathological programs will use
-- entries in this table. Normal programs won't use it at all.
type Paren_Count_Entry is record
Nod : Node_Id;
-- The node to which this count applies
Count : Nat range 3 .. Nat'Last;
-- The count of parentheses, which will be in the indicated range
end record;
package Paren_Counts is new Table.Table (
Table_Component_Type => Paren_Count_Entry,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => 10,
Table_Increment => 200,
Table_Name => "Paren_Counts");
-----------------------
-- Local Subprograms --
-----------------------
procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id);
-- Fixup parent pointers for the syntactic children of Fix_Node after
-- a copy, setting them to Fix_Node when they pointed to Ref_Node.
function Allocate_Initialize_Node
(Src : Node_Id;
With_Extension : Boolean) return Node_Id;
-- Allocate a new node or node extension. If Src is not empty, the
-- information for the newly-allocated node is copied from it.
------------------------------
-- Allocate_Initialize_Node --
------------------------------
function Allocate_Initialize_Node
(Src : Node_Id;
With_Extension : Boolean) return Node_Id
is
New_Id : Node_Id;
begin
if Present (Src)
and then not Has_Extension (Src)
and then With_Extension
and then Src = Nodes.Last
then
New_Id := Src;
else
-- We are allocating a new node, or extending a node
-- other than Nodes.Last.
if Present (Src) then
Nodes.Append (Nodes.Table (Src));
Flags.Append (Flags.Table (Src));
else
Nodes.Append (Default_Node);
Flags.Append (Default_Flags);
end if;
New_Id := Nodes.Last;
Orig_Nodes.Append (New_Id);
Node_Count := Node_Count + 1;
end if;
-- Specifically copy Paren_Count to deal with creating new table entry
-- if the parentheses count is at the maximum possible value already.
if Present (Src) and then Nkind (Src) in N_Subexpr then
Set_Paren_Count (New_Id, Paren_Count (Src));
end if;
-- Set extension nodes if required
if With_Extension then
if Present (Src) and then Has_Extension (Src) then
for J in 1 .. Num_Extension_Nodes loop
Nodes.Append (Nodes.Table (Src + J));
Flags.Append (Flags.Table (Src + J));
end loop;
else
for J in 1 .. Num_Extension_Nodes loop
Nodes.Append (Default_Node_Extension);
Flags.Append (Default_Flags);
end loop;
end if;
end if;
Orig_Nodes.Set_Last (Nodes.Last);
Allocate_List_Tables (Nodes.Last);
-- Invoke the reporting procedure (if available)
if Reporting_Proc /= null then
Reporting_Proc.all (Target => New_Id, Source => Src);
end if;
return New_Id;
end Allocate_Initialize_Node;
--------------
-- Analyzed --
--------------
function Analyzed (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Analyzed;
end Analyzed;
--------------------------
-- Basic_Set_Convention --
--------------------------
procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id) is
begin
pragma Assert (Nkind (E) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
end Basic_Set_Convention;
--------------------------
-- Check_Error_Detected --
--------------------------
procedure Check_Error_Detected is
begin
-- An anomaly has been detected which is assumed to be a consequence of
-- a previous serious error or configurable run time violation. Raise
-- an exception if no such error has been detected.
if Serious_Errors_Detected = 0
and then Configurable_Run_Time_Violations = 0
then
raise Program_Error;
end if;
end Check_Error_Detected;
-----------------
-- Change_Node --
-----------------
procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
Save_Sloc : constant Source_Ptr := Sloc (N);
Save_In_List : constant Boolean := Nodes.Table (N).In_List;
Save_Link : constant Union_Id := Nodes.Table (N).Link;
Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
Par_Count : Nat := 0;
begin
if Nkind (N) in N_Subexpr then
Par_Count := Paren_Count (N);
end if;
Nodes.Table (N) := Default_Node;
Nodes.Table (N).Sloc := Save_Sloc;
Nodes.Table (N).In_List := Save_In_List;
Nodes.Table (N).Link := Save_Link;
Nodes.Table (N).Comes_From_Source := Save_CFS;
Nodes.Table (N).Nkind := New_Node_Kind;
Nodes.Table (N).Error_Posted := Save_Posted;
Flags.Table (N) := Default_Flags;
if New_Node_Kind in N_Subexpr then
Set_Paren_Count (N, Par_Count);
end if;
end Change_Node;
-----------------------
-- Comes_From_Source --
-----------------------
function Comes_From_Source (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Comes_From_Source;
end Comes_From_Source;
----------------
-- Convention --
----------------
function Convention (E : Entity_Id) return Convention_Id is
begin
pragma Assert (Nkind (E) in N_Entity);
return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
end Convention;
---------------
-- Copy_Node --
---------------
procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
begin
Nodes.Table (Destination) := Nodes.Table (Source);
Nodes.Table (Destination).In_List := Save_In_List;
Nodes.Table (Destination).Link := Save_Link;
Flags.Table (Destination) := Flags.Table (Source);
-- Specifically set Paren_Count to make sure auxiliary table entry
-- gets correctly made if the parentheses count is at the max value.
if Nkind (Destination) in N_Subexpr then
Set_Paren_Count (Destination, Paren_Count (Source));
end if;
-- Deal with copying extension nodes if present. No need to copy flags
-- table entries, since they are always zero for extending components.
if Has_Extension (Source) then
pragma Assert (Has_Extension (Destination));
for J in 1 .. Num_Extension_Nodes loop
Nodes.Table (Destination + J) := Nodes.Table (Source + J);
end loop;
else
pragma Assert (not Has_Extension (Source));
null;
end if;
end Copy_Node;
------------------------
-- Copy_Separate_List --
------------------------
function Copy_Separate_List (Source : List_Id) return List_Id is
Result : constant List_Id := New_List;
Nod : Node_Id;
begin
Nod := First (Source);
while Present (Nod) loop
Append (Copy_Separate_Tree (Nod), Result);
Next (Nod);
end loop;
return Result;
end Copy_Separate_List;
------------------------
-- Copy_Separate_Tree --
------------------------
function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
New_Id : Node_Id;
function Copy_Entity (E : Entity_Id) return Entity_Id;
-- Copy Entity, copying only the Ekind and Chars fields
function Copy_List (List : List_Id) return List_Id;
-- Copy list
function Possible_Copy (Field : Union_Id) return Union_Id;
-- Given a field, returns a copy of the node or list if its parent
-- is the current source node, and otherwise returns the input
-----------------
-- Copy_Entity --
-----------------
function Copy_Entity (E : Entity_Id) return Entity_Id is
New_Ent : Entity_Id;
begin
-- Build appropriate node
case N_Entity (Nkind (E)) is
when N_Defining_Identifier =>
New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
when N_Defining_Character_Literal =>
New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
when N_Defining_Operator_Symbol =>
New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
end case;
Set_Chars (New_Ent, Chars (E));
return New_Ent;
end Copy_Entity;
---------------
-- Copy_List --
---------------
function Copy_List (List : List_Id) return List_Id is
NL : List_Id;
E : Node_Id;
begin
if List = No_List then
return No_List;
else
NL := New_List;
E := First (List);
while Present (E) loop
if Has_Extension (E) then
Append (Copy_Entity (E), NL);
else
Append (Copy_Separate_Tree (E), NL);
end if;
Next (E);
end loop;
return NL;
end if;
end Copy_List;
-------------------
-- Possible_Copy --
-------------------
function Possible_Copy (Field : Union_Id) return Union_Id is
New_N : Union_Id;
begin
if Field in Node_Range then
New_N :=
Union_Id (Copy_Separate_Tree (Node_Id (Field)));
if Parent (Node_Id (Field)) = Source then
Set_Parent (Node_Id (New_N), New_Id);
end if;
return New_N;
elsif Field in List_Range then
New_N := Union_Id (Copy_List (List_Id (Field)));
if Parent (List_Id (Field)) = Source then
Set_Parent (List_Id (New_N), New_Id);
end if;
return New_N;
else
return Field;
end if;
end Possible_Copy;
-- Start of processing for Copy_Separate_Tree
begin
if Source <= Empty_Or_Error then
return Source;
elsif Has_Extension (Source) then
return Copy_Entity (Source);
else
New_Id := New_Copy (Source);
-- Recursively copy descendents
Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
-- Set Entity field to Empty to ensure that no entity references
-- are shared between the two, if the source is already analyzed.
if Nkind (New_Id) in N_Has_Entity
or else Nkind (New_Id) = N_Freeze_Entity
then
Set_Entity (New_Id, Empty);
end if;
-- Reset all Etype fields and Analyzed flags, because input tree may
-- have been fully or partially analyzed.
if Nkind (New_Id) in N_Has_Etype then
Set_Etype (New_Id, Empty);
end if;
Set_Analyzed (New_Id, False);
-- Rather special case, if we have an expanded name, then change
-- it back into a selected component, so that the tree looks the
-- way it did coming out of the parser. This will change back
-- when we analyze the selected component node.
if Nkind (New_Id) = N_Expanded_Name then
-- The following code is a bit kludgy. It would be cleaner to
-- Add an entry Change_Expanded_Name_To_Selected_Component to
-- Sinfo.CN, but that's an earthquake, because it has the wrong
-- license, and Atree is used outside the compiler, e.g. in the
-- binder and in ASIS, so we don't want to add that dependency.
-- Consequently we have no choice but to hold our noses and do
-- the change manually. At least we are Atree, so this odd use
-- of Atree.Unchecked_Access is at least all in the family.
-- Change the node type
Atree.Unchecked_Access.Set_Nkind (New_Id, N_Selected_Component);
-- Clear the Chars field which is not present in a selected
-- component node, so we don't want a junk value around.
Set_Node1 (New_Id, Empty);
end if;
-- All done, return copied node
return New_Id;
end if;
end Copy_Separate_Tree;
-----------
-- Ekind --
-----------
function Ekind (E : Entity_Id) return Entity_Kind is
begin
pragma Assert (Nkind (E) in N_Entity);
return N_To_E (Nodes.Table (E + 1).Nkind);
end Ekind;
--------------
-- Ekind_In --
--------------
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6 or else
T = V7;
end Ekind_In;
function Ekind_In
(T : Entity_Kind;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind) return Boolean
is
begin
return T = V1 or else
T = V2 or else
T = V3 or else
T = V4 or else
T = V5 or else
T = V6 or else
T = V7 or else
T = V8;
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6, V7);
end Ekind_In;
function Ekind_In
(E : Entity_Id;
V1 : Entity_Kind;
V2 : Entity_Kind;
V3 : Entity_Kind;
V4 : Entity_Kind;
V5 : Entity_Kind;
V6 : Entity_Kind;
V7 : Entity_Kind;
V8 : Entity_Kind) return Boolean
is
begin
return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6, V7, V8);
end Ekind_In;
------------------------
-- Set_Reporting_Proc --
------------------------
procedure Set_Reporting_Proc (P : Report_Proc) is
begin
pragma Assert (Reporting_Proc = null);
Reporting_Proc := P;
end Set_Reporting_Proc;
------------------
-- Error_Posted --
------------------
function Error_Posted (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Error_Posted;
end Error_Posted;
-----------------------
-- Exchange_Entities --
-----------------------
procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
Temp_Ent : Node_Record;
Temp_Flg : Flags_Byte;
begin
pragma Assert (True
and then Has_Extension (E1)
and then Has_Extension (E2)
and then not Nodes.Table (E1).In_List
and then not Nodes.Table (E2).In_List);
-- Exchange the contents of the two entities
for J in 0 .. Num_Extension_Nodes loop
Temp_Ent := Nodes.Table (E1 + J);
Nodes.Table (E1 + J) := Nodes.Table (E2 + J);
Nodes.Table (E2 + J) := Temp_Ent;
end loop;
-- Exchange flag bytes for first component. No need to do the exchange
-- for the other components, since the flag bytes are always zero.
Temp_Flg := Flags.Table (E1);
Flags.Table (E1) := Flags.Table (E2);
Flags.Table (E2) := Temp_Flg;
-- That exchange exchanged the parent pointers as well, which is what
-- we want, but we need to patch up the defining identifier pointers
-- in the parent nodes (the child pointers) to match this switch
-- unless for Implicit types entities which have no parent, in which
-- case we don't do anything otherwise we won't be able to revert back
-- to the original situation.
-- Shouldn't this use Is_Itype instead of the Parent test
if Present (Parent (E1)) and then Present (Parent (E2)) then
Set_Defining_Identifier (Parent (E1), E1);
Set_Defining_Identifier (Parent (E2), E2);
end if;
end Exchange_Entities;
-----------------
-- Extend_Node --
-----------------
function Extend_Node (Node : Node_Id) return Entity_Id is
Result : Entity_Id;
procedure Debug_Extend_Node;
pragma Inline (Debug_Extend_Node);
-- Debug routine for debug flag N
-----------------------
-- Debug_Extend_Node --
-----------------------
procedure Debug_Extend_Node is
begin
if Debug_Flag_N then
Write_Str ("Extend node ");
Write_Int (Int (Node));
if Result = Node then
Write_Str (" in place");
else
Write_Str (" copied to ");
Write_Int (Int (Result));
end if;
-- Write_Eol;
end if;
end Debug_Extend_Node;
-- Start of processing for Extend_Node
begin
pragma Assert (not (Has_Extension (Node)));
Result := Allocate_Initialize_Node (Node, With_Extension => True);
pragma Debug (Debug_Extend_Node);
return Result;
end Extend_Node;
-----------------
-- Fix_Parents --
-----------------
procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id) is
procedure Fix_Parent (Field : Union_Id);
-- Fixup one parent pointer. Field is checked to see if it points to
-- a node, list, or element list that has a parent that points to
-- Ref_Node. If so, the parent is reset to point to Fix_Node.
----------------
-- Fix_Parent --
----------------
procedure Fix_Parent (Field : Union_Id) is
begin
-- Fix parent of node that is referenced by Field. Note that we must
-- exclude the case where the node is a member of a list, because in
-- this case the parent is the parent of the list.
if Field in Node_Range
and then Present (Node_Id (Field))
and then not Nodes.Table (Node_Id (Field)).In_List
and then Parent (Node_Id (Field)) = Ref_Node
then
Set_Parent (Node_Id (Field), Fix_Node);
-- Fix parent of list that is referenced by Field
elsif Field in List_Range
and then Present (List_Id (Field))
and then Parent (List_Id (Field)) = Ref_Node
then
Set_Parent (List_Id (Field), Fix_Node);
end if;
end Fix_Parent;
-- Start of processing for Fix_Parents
begin
Fix_Parent (Field1 (Fix_Node));
Fix_Parent (Field2 (Fix_Node));
Fix_Parent (Field3 (Fix_Node));
Fix_Parent (Field4 (Fix_Node));
Fix_Parent (Field5 (Fix_Node));
end Fix_Parents;
-------------------
-- Flags_Address --
-------------------
function Flags_Address return System.Address is
begin
return Flags.Table (First_Node_Id)'Address;
end Flags_Address;
-----------------------------------
-- Get_Comes_From_Source_Default --
-----------------------------------
function Get_Comes_From_Source_Default return Boolean is
begin
return Default_Node.Comes_From_Source;
end Get_Comes_From_Source_Default;
-----------------
-- Has_Aspects --
-----------------
function Has_Aspects (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Has_Aspects;
end Has_Aspects;
-------------------
-- Has_Extension --
-------------------
function Has_Extension (N : Node_Id) return Boolean is
begin
return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
end Has_Extension;
----------------
-- Initialize --
----------------
procedure Initialize is
Dummy : Node_Id;
pragma Warnings (Off, Dummy);
begin
Node_Count := 0;
Atree_Private_Part.Nodes.Init;
Atree_Private_Part.Flags.Init;
Orig_Nodes.Init;
Paren_Counts.Init;
-- Allocate Empty node
Dummy := New_Node (N_Empty, No_Location);
Set_Name1 (Empty, No_Name);
-- Allocate Error node, and set Error_Posted, since we certainly
-- only generate an Error node if we do post some kind of error.
Dummy := New_Node (N_Error, No_Location);
Set_Name1 (Error, Error_Name);
Set_Error_Posted (Error, True);
end Initialize;
--------------------------
-- Is_Rewrite_Insertion --
--------------------------
function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
begin
return Nodes.Table (Node).Rewrite_Ins;
end Is_Rewrite_Insertion;
-----------------------------
-- Is_Rewrite_Substitution --
-----------------------------
function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
begin
return Orig_Nodes.Table (Node) /= Node;
end Is_Rewrite_Substitution;
------------------
-- Last_Node_Id --
------------------
function Last_Node_Id return Node_Id is
begin
return Nodes.Last;
end Last_Node_Id;
----------
-- Lock --
----------
procedure Lock is
begin
Nodes.Locked := True;
Flags.Locked := True;
Orig_Nodes.Locked := True;
Nodes.Release;
Flags.Release;
Orig_Nodes.Release;
end Lock;
----------------------------
-- Mark_Rewrite_Insertion --
----------------------------
procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
begin
Nodes.Table (New_Node).Rewrite_Ins := True;
end Mark_Rewrite_Insertion;
--------------
-- New_Copy --
--------------
function New_Copy (Source : Node_Id) return Node_Id is
New_Id : Node_Id := Source;
begin
if Source > Empty_Or_Error then
New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
Nodes.Table (New_Id).Link := Empty_List_Or_Node;
Nodes.Table (New_Id).In_List := False;
-- If the original is marked as a rewrite insertion, then unmark the
-- copy, since we inserted the original, not the copy.
Nodes.Table (New_Id).Rewrite_Ins := False;
pragma Debug (New_Node_Debugging_Output (New_Id));
-- Clear Is_Overloaded since we cannot have semantic interpretations
-- of this new node.
if Nkind (Source) in N_Subexpr then
Set_Is_Overloaded (New_Id, False);
end if;
-- Always clear Has_Aspects, the caller must take care of copying
-- aspects if this is required for the particular situation.
Set_Has_Aspects (New_Id, False);
end if;
return New_Id;
end New_Copy;
----------------
-- New_Entity --
----------------
function New_Entity
(New_Node_Kind : Node_Kind;
New_Sloc : Source_Ptr) return Entity_Id
is
Ent : Entity_Id;
begin
pragma Assert (New_Node_Kind in N_Entity);
Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
-- If this is a node with a real location and we are generating
-- source nodes, then reset Current_Error_Node. This is useful
-- if we bomb during parsing to get a error location for the bomb.
if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
Current_Error_Node := Ent;
end if;
Nodes.Table (Ent).Nkind := New_Node_Kind;
Nodes.Table (Ent).Sloc := New_Sloc;
pragma Debug (New_Node_Debugging_Output (Ent));
return Ent;
end New_Entity;
--------------
-- New_Node --
--------------
function New_Node
(New_Node_Kind : Node_Kind;
New_Sloc : Source_Ptr) return Node_Id
is
Nod : Node_Id;
begin
pragma Assert (New_Node_Kind not in N_Entity);
Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
Nodes.Table (Nod).Nkind := New_Node_Kind;
Nodes.Table (Nod).Sloc := New_Sloc;
pragma Debug (New_Node_Debugging_Output (Nod));
-- If this is a node with a real location and we are generating source
-- nodes, then reset Current_Error_Node. This is useful if we bomb
-- during parsing to get an error location for the bomb.
if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
Current_Error_Node := Nod;
end if;
return Nod;
end New_Node;
-------------------------
-- New_Node_Breakpoint --
-------------------------
procedure nn is
begin
Write_Str ("Watched node ");
Write_Int (Int (Watch_Node));
Write_Str (" created");
Write_Eol;
end nn;
-------------------------------
-- New_Node_Debugging_Output --
-------------------------------
procedure nnd (N : Node_Id) is
Node_Is_Watched : constant Boolean := N = Watch_Node;
begin
if Debug_Flag_N or else Node_Is_Watched then
Node_Debug_Output ("Allocate", N);
if Node_Is_Watched then
New_Node_Breakpoint;
end if;
end if;
end nnd;
-----------
-- Nkind --
-----------
function Nkind (N : Node_Id) return Node_Kind is
begin
return Nodes.Table (N).Nkind;
end Nkind;
--------------
-- Nkind_In --
--------------
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind;
V7 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind;
V7 : Node_Kind;
V8 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
end Nkind_In;
function Nkind_In
(N : Node_Id;
V1 : Node_Kind;
V2 : Node_Kind;
V3 : Node_Kind;
V4 : Node_Kind;
V5 : Node_Kind;
V6 : Node_Kind;
V7 : Node_Kind;
V8 : Node_Kind;
V9 : Node_Kind) return Boolean
is
begin
return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8, V9);
end Nkind_In;
--------
-- No --
--------
function No (N : Node_Id) return Boolean is
begin
return N = Empty;
end No;
-----------------------
-- Node_Debug_Output --
-----------------------
procedure Node_Debug_Output (Op : String; N : Node_Id) is
begin
Write_Str (Op);
if Nkind (N) in N_Entity then
Write_Str (" entity");
else
Write_Str (" node");
end if;
Write_Str (" Id = ");
Write_Int (Int (N));
Write_Str (" ");
Write_Location (Sloc (N));
Write_Str (" ");
Write_Str (Node_Kind'Image (Nkind (N)));
Write_Eol;
end Node_Debug_Output;
-------------------
-- Nodes_Address --
-------------------
function Nodes_Address return System.Address is
begin
return Nodes.Table (First_Node_Id)'Address;
end Nodes_Address;
---------------
-- Num_Nodes --
---------------
function Num_Nodes return Nat is
begin
return Node_Count;
end Num_Nodes;
-------------------
-- Original_Node --
-------------------
function Original_Node (Node : Node_Id) return Node_Id is
begin
return Orig_Nodes.Table (Node);
end Original_Node;
-----------------
-- Paren_Count --
-----------------
function Paren_Count (N : Node_Id) return Nat is
C : Nat := 0;
begin
pragma Assert (N <= Nodes.Last);
if Nodes.Table (N).Pflag1 then
C := C + 1;
end if;
if Nodes.Table (N).Pflag2 then
C := C + 2;
end if;
-- Value of 0,1,2 returned as is
if C <= 2 then
return C;
-- Value of 3 means we search the table, and we must find an entry
else
for J in Paren_Counts.First .. Paren_Counts.Last loop
if N = Paren_Counts.Table (J).Nod then
return Paren_Counts.Table (J).Count;
end if;
end loop;
raise Program_Error;
end if;
end Paren_Count;
------------
-- Parent --
------------
function Parent (N : Node_Id) return Node_Id is
begin
if Is_List_Member (N) then
return Parent (List_Containing (N));
else
return Node_Id (Nodes.Table (N).Link);
end if;
end Parent;
-------------
-- Present --
-------------
function Present (N : Node_Id) return Boolean is
begin
return N /= Empty;
end Present;
--------------------------------
-- Preserve_Comes_From_Source --
--------------------------------
procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
begin
Nodes.Table (NewN).Comes_From_Source :=
Nodes.Table (OldN).Comes_From_Source;
end Preserve_Comes_From_Source;
-------------------
-- Relocate_Node --
-------------------
function Relocate_Node (Source : Node_Id) return Node_Id is
New_Node : Node_Id;
begin
if No (Source) then
return Empty;
end if;
New_Node := New_Copy (Source);
Fix_Parents (Ref_Node => Source, Fix_Node => New_Node);
-- We now set the parent of the new node to be the same as the
-- parent of the source. Almost always this parent will be
-- replaced by a new value when the relocated node is reattached
-- to the tree, but by doing it now, we ensure that this node is
-- not even temporarily disconnected from the tree. Note that this
-- does not happen free, because in the list case, the parent does
-- not get set.
Set_Parent (New_Node, Parent (Source));
-- If the node being relocated was a rewriting of some original
-- node, then the relocated node has the same original node.
if Orig_Nodes.Table (Source) /= Source then
Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
end if;
return New_Node;
end Relocate_Node;
-------------
-- Replace --
-------------
procedure Replace (Old_Node, New_Node : Node_Id) is
Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
Old_HasA : constant Boolean := Nodes.Table (Old_Node).Has_Aspects;
Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
begin
pragma Assert
(not Has_Extension (Old_Node)
and not Has_Extension (New_Node)
and not Nodes.Table (New_Node).In_List);
-- Do copy, preserving link and in list status and required flags
Copy_Node (Source => New_Node, Destination => Old_Node);
Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
Nodes.Table (Old_Node).Error_Posted := Old_Post;
Nodes.Table (Old_Node).Has_Aspects := Old_HasA;
-- Fix parents of substituted node, since it has changed identity
Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
-- Since we are doing a replace, we assume that the original node
-- is intended to become the new replaced node. The call would be
-- to Rewrite if there were an intention to save the original node.
Orig_Nodes.Table (Old_Node) := Old_Node;
-- Invoke the reporting procedure (if available)
if Reporting_Proc /= null then
Reporting_Proc.all (Target => Old_Node, Source => New_Node);
end if;
end Replace;
-------------
-- Rewrite --
-------------
procedure Rewrite (Old_Node, New_Node : Node_Id) is
Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
-- This field is always preserved in the new node
Old_Has_Aspects : constant Boolean := Nodes.Table (Old_Node).Has_Aspects;
-- This field is always preserved in the new node
Old_Paren_Count : Nat;
Old_Must_Not_Freeze : Boolean;
-- These fields are preserved in the new node only if the new node
-- and the old node are both subexpression nodes.
-- Note: it is a violation of abstraction levels for Must_Not_Freeze
-- to be referenced like this. ???
Sav_Node : Node_Id;
begin
pragma Assert
(not Has_Extension (Old_Node)
and not Has_Extension (New_Node)
and not Nodes.Table (New_Node).In_List);
pragma Debug (Rewrite_Debugging_Output (Old_Node, New_Node));
if Nkind (Old_Node) in N_Subexpr then
Old_Paren_Count := Paren_Count (Old_Node);
Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
else
Old_Paren_Count := 0;
Old_Must_Not_Freeze := False;
end if;
-- Allocate a new node, to be used to preserve the original contents
-- of the Old_Node, for possible later retrival by Original_Node and
-- make an entry in the Orig_Nodes table. This is only done if we have
-- not already rewritten the node, as indicated by an Orig_Nodes entry
-- that does not reference the Old_Node.
if Orig_Nodes.Table (Old_Node) = Old_Node then
Sav_Node := New_Copy (Old_Node);
Orig_Nodes.Table (Sav_Node) := Sav_Node;
Orig_Nodes.Table (Old_Node) := Sav_Node;
-- Both the old and new copies of the node will share the same list
-- of aspect specifications if aspect specifications are present.
if Old_Has_Aspects then
Set_Aspect_Specifications
(Sav_Node, Aspect_Specifications (Old_Node));
end if;
end if;
-- Copy substitute node into place, preserving old fields as required
Copy_Node (Source => New_Node, Destination => Old_Node);
Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
Nodes.Table (Old_Node).Has_Aspects := Old_Has_Aspects;
if Nkind (New_Node) in N_Subexpr then
Set_Paren_Count (Old_Node, Old_Paren_Count);
Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
end if;
Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
-- Invoke the reporting procedure (if available)
if Reporting_Proc /= null then
Reporting_Proc.all (Target => Old_Node, Source => New_Node);
end if;
end Rewrite;
-------------------------
-- Rewrite_Breakpoint --
-------------------------
procedure rr is
begin
Write_Str ("Watched node ");
Write_Int (Int (Watch_Node));
Write_Str (" rewritten");
Write_Eol;
end rr;
------------------------------
-- Rewrite_Debugging_Output --
------------------------------
procedure rrd (Old_Node, New_Node : Node_Id) is
Node_Is_Watched : constant Boolean := Old_Node = Watch_Node;
begin
if Debug_Flag_N or else Node_Is_Watched then
Node_Debug_Output ("Rewrite", Old_Node);
Node_Debug_Output ("into", New_Node);
if Node_Is_Watched then
Rewrite_Breakpoint;
end if;
end if;
end rrd;
------------------
-- Set_Analyzed --
------------------
procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
begin
Nodes.Table (N).Analyzed := Val;
end Set_Analyzed;
---------------------------
-- Set_Comes_From_Source --
---------------------------
procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Comes_From_Source := Val;
end Set_Comes_From_Source;
-----------------------------------
-- Set_Comes_From_Source_Default --
-----------------------------------
procedure Set_Comes_From_Source_Default (Default : Boolean) is
begin
Default_Node.Comes_From_Source := Default;
end Set_Comes_From_Source_Default;
---------------
-- Set_Ekind --
---------------
procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
begin
pragma Assert (Nkind (E) in N_Entity);
Nodes.Table (E + 1).Nkind := E_To_N (Val);
end Set_Ekind;
----------------------
-- Set_Error_Posted --
----------------------
procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
begin
Nodes.Table (N).Error_Posted := Val;
end Set_Error_Posted;
---------------------
-- Set_Has_Aspects --
---------------------
procedure Set_Has_Aspects (N : Node_Id; Val : Boolean := True) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Has_Aspects := Val;
end Set_Has_Aspects;
-----------------------
-- Set_Original_Node --
-----------------------
procedure Set_Original_Node (N : Node_Id; Val : Node_Id) is
begin
Orig_Nodes.Table (N) := Val;
end Set_Original_Node;
---------------------
-- Set_Paren_Count --
---------------------
procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
begin
pragma Assert (Nkind (N) in N_Subexpr);
-- Value of 0,1,2 stored as is
if Val <= 2 then
Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
Nodes.Table (N).Pflag2 := (Val = 2);
-- Value of 3 or greater stores 3 in node and makes table entry
else
Nodes.Table (N).Pflag1 := True;
Nodes.Table (N).Pflag2 := True;
for J in Paren_Counts.First .. Paren_Counts.Last loop
if N = Paren_Counts.Table (J).Nod then
Paren_Counts.Table (J).Count := Val;
return;
end if;
end loop;
Paren_Counts.Append ((Nod => N, Count => Val));
end if;
end Set_Paren_Count;
----------------
-- Set_Parent --
----------------
procedure Set_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (not Nodes.Table (N).In_List);
Nodes.Table (N).Link := Union_Id (Val);
end Set_Parent;
--------------
-- Set_Sloc --
--------------
procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
begin
Nodes.Table (N).Sloc := Val;
end Set_Sloc;
----------
-- Sloc --
----------
function Sloc (N : Node_Id) return Source_Ptr is
begin
return Nodes.Table (N).Sloc;
end Sloc;
-------------------
-- Traverse_Func --
-------------------
function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
function Traverse_Field
(Nod : Node_Id;
Fld : Union_Id;
FN : Field_Num) return Traverse_Final_Result;
-- Fld is one of the fields of Nod. If the field points to syntactic
-- node or list, then this node or list is traversed, and the result is
-- the result of this traversal. Otherwise a value of True is returned
-- with no processing. FN is the number of the field (1 .. 5).
--------------------
-- Traverse_Field --
--------------------
function Traverse_Field
(Nod : Node_Id;
Fld : Union_Id;
FN : Field_Num) return Traverse_Final_Result
is
begin
if Fld = Union_Id (Empty) then
return OK;
-- Descendent is a node
elsif Fld in Node_Range then
-- Traverse descendent that is syntactic subtree node
if Is_Syntactic_Field (Nkind (Nod), FN) then
return Traverse_Func (Node_Id (Fld));
-- Node that is not a syntactic subtree
else
return OK;
end if;
-- Descendent is a list
elsif Fld in List_Range then
-- Traverse descendent that is a syntactic subtree list
if Is_Syntactic_Field (Nkind (Nod), FN) then
declare
Elmt : Node_Id := First (List_Id (Fld));
begin
while Present (Elmt) loop
if Traverse_Func (Elmt) = Abandon then
return Abandon;
else
Next (Elmt);
end if;
end loop;
return OK;
end;
-- List that is not a syntactic subtree
else
return OK;
end if;
-- Field was not a node or a list
else
return OK;
end if;
end Traverse_Field;
Cur_Node : Node_Id := Node;
-- Start of processing for Traverse_Func
begin
-- We walk Field2 last, and if it is a node, we eliminate the tail
-- recursion by jumping back to this label. This is because Field2 is
-- where the Left_Opnd field of N_Op_Concat is stored, and in practice
-- concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
-- trick prevents us from running out of memory in that case. We don't
-- bother eliminating the tail recursion if Field2 is a list.
<<Tail_Recurse>>
case Process (Cur_Node) is
when Abandon =>
return Abandon;
when Skip =>
return OK;
when OK =>
null;
when OK_Orig =>
Cur_Node := Original_Node (Cur_Node);
end case;
if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
or else -- skip Field2 here
Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
or else
Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
or else
Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
then
return Abandon;
end if;
if Field2 (Cur_Node) not in Node_Range then
return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
elsif Is_Syntactic_Field (Nkind (Cur_Node), 2)
and then Field2 (Cur_Node) /= Empty_List_Or_Node
then
-- Here is the tail recursion step, we reset Cur_Node and jump back
-- to the start of the procedure, which has the same semantic effect
-- as a call.
Cur_Node := Node_Id (Field2 (Cur_Node));
goto Tail_Recurse;
end if;
return OK;
end Traverse_Func;
-------------------
-- Traverse_Proc --
-------------------
procedure Traverse_Proc (Node : Node_Id) is
function Traverse is new Traverse_Func (Process);
Discard : Traverse_Final_Result;
pragma Warnings (Off, Discard);
begin
Discard := Traverse (Node);
end Traverse_Proc;
---------------
-- Tree_Read --
---------------
procedure Tree_Read is
begin
Tree_Read_Int (Node_Count);
Nodes.Tree_Read;
Flags.Tree_Read;
Orig_Nodes.Tree_Read;
Paren_Counts.Tree_Read;
end Tree_Read;
----------------
-- Tree_Write --
----------------
procedure Tree_Write is
begin
Tree_Write_Int (Node_Count);
Nodes.Tree_Write;
Flags.Tree_Write;
Orig_Nodes.Tree_Write;
Paren_Counts.Tree_Write;
end Tree_Write;
------------------------------
-- Unchecked Access Package --
------------------------------
package body Unchecked_Access is
function Field1 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field1;
end Field1;
function Field2 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field2;
end Field2;
function Field3 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field3;
end Field3;
function Field4 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field4;
end Field4;
function Field5 (N : Node_Id) return Union_Id is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Field5;
end Field5;
function Field6 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field6;
end Field6;
function Field7 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field7;
end Field7;
function Field8 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field8;
end Field8;
function Field9 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field9;
end Field9;
function Field10 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field10;
end Field10;
function Field11 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field11;
end Field11;
function Field12 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Field12;
end Field12;
function Field13 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field6;
end Field13;
function Field14 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field7;
end Field14;
function Field15 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field8;
end Field15;
function Field16 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field9;
end Field16;
function Field17 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field10;
end Field17;
function Field18 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Field11;
end Field18;
function Field19 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field6;
end Field19;
function Field20 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field7;
end Field20;
function Field21 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field8;
end Field21;
function Field22 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field9;
end Field22;
function Field23 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Field10;
end Field23;
function Field24 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field6;
end Field24;
function Field25 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field7;
end Field25;
function Field26 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field8;
end Field26;
function Field27 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field9;
end Field27;
function Field28 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field10;
end Field28;
function Field29 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Field11;
end Field29;
function Field30 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field6;
end Field30;
function Field31 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field7;
end Field31;
function Field32 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field8;
end Field32;
function Field33 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field9;
end Field33;
function Field34 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field10;
end Field34;
function Field35 (N : Node_Id) return Union_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Field11;
end Field35;
function Node1 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field1);
end Node1;
function Node2 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field2);
end Node2;
function Node3 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field3);
end Node3;
function Node4 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field4);
end Node4;
function Node5 (N : Node_Id) return Node_Id is
begin
pragma Assert (N <= Nodes.Last);
return Node_Id (Nodes.Table (N).Field5);
end Node5;
function Node6 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field6);
end Node6;
function Node7 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field7);
end Node7;
function Node8 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field8);
end Node8;
function Node9 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field9);
end Node9;
function Node10 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field10);
end Node10;
function Node11 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field11);
end Node11;
function Node12 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 1).Field12);
end Node12;
function Node13 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field6);
end Node13;
function Node14 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field7);
end Node14;
function Node15 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field8);
end Node15;
function Node16 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field9);
end Node16;
function Node17 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field10);
end Node17;
function Node18 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 2).Field11);
end Node18;
function Node19 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field6);
end Node19;
function Node20 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field7);
end Node20;
function Node21 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field8);
end Node21;
function Node22 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field9);
end Node22;
function Node23 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 3).Field10);
end Node23;
function Node24 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field6);
end Node24;
function Node25 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field7);
end Node25;
function Node26 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field8);
end Node26;
function Node27 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field9);
end Node27;
function Node28 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field10);
end Node28;
function Node29 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 4).Field11);
end Node29;
function Node30 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field6);
end Node30;
function Node31 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field7);
end Node31;
function Node32 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field8);
end Node32;
function Node33 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field9);
end Node33;
function Node34 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field10);
end Node34;
function Node35 (N : Node_Id) return Node_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return Node_Id (Nodes.Table (N + 5).Field11);
end Node35;
function List1 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field1);
end List1;
function List2 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field2);
end List2;
function List3 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field3);
end List3;
function List4 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field4);
end List4;
function List5 (N : Node_Id) return List_Id is
begin
pragma Assert (N <= Nodes.Last);
return List_Id (Nodes.Table (N).Field5);
end List5;
function List10 (N : Node_Id) return List_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return List_Id (Nodes.Table (N + 1).Field10);
end List10;
function List14 (N : Node_Id) return List_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return List_Id (Nodes.Table (N + 2).Field7);
end List14;
function List25 (N : Node_Id) return List_Id is
begin
pragma Assert (Nkind (N) in N_Entity);
return List_Id (Nodes.Table (N + 4).Field7);
end List25;
function Elist1 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field1;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist1;
function Elist2 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field2;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist2;
function Elist3 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field3;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist3;
function Elist4 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field4;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist4;
function Elist5 (N : Node_Id) return Elist_Id is
pragma Assert (N <= Nodes.Last);
Value : constant Union_Id := Nodes.Table (N).Field5;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist5;
function Elist8 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 1).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist8;
function Elist9 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 1).Field9;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist9;
function Elist10 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 1).Field10;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist10;
function Elist13 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field6;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist13;
function Elist15 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist15;
function Elist16 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field9;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist16;
function Elist18 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 2).Field11;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist18;
function Elist21 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 3).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist21;
function Elist23 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 3).Field10;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist23;
function Elist24 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 4).Field6;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist24;
function Elist25 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 4).Field7;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist25;
function Elist26 (N : Node_Id) return Elist_Id is
pragma Assert (Nkind (N) in N_Entity);
Value : constant Union_Id := Nodes.Table (N + 4).Field8;
begin
if Value = 0 then
return No_Elist;
else
return Elist_Id (Value);
end if;
end Elist26;
function Name1 (N : Node_Id) return Name_Id is
begin
pragma Assert (N <= Nodes.Last);
return Name_Id (Nodes.Table (N).Field1);
end Name1;
function Name2 (N : Node_Id) return Name_Id is
begin
pragma Assert (N <= Nodes.Last);
return Name_Id (Nodes.Table (N).Field2);
end Name2;
function Str3 (N : Node_Id) return String_Id is
begin
pragma Assert (N <= Nodes.Last);
return String_Id (Nodes.Table (N).Field3);
end Str3;
function Uint2 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field2;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint2;
function Uint3 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field3;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint3;
function Uint4 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field4;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint4;
function Uint5 (N : Node_Id) return Uint is
pragma Assert (N <= Nodes.Last);
U : constant Union_Id := Nodes.Table (N).Field5;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint5;
function Uint8 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field8;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint8;
function Uint9 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field9;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint9;
function Uint10 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field10;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint10;
function Uint11 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field11;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint11;
function Uint12 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 1).Field12;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint12;
function Uint13 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field6;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint13;
function Uint14 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field7;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint14;
function Uint15 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field8;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint15;
function Uint16 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field9;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint16;
function Uint17 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 2).Field10;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint17;
function Uint22 (N : Node_Id) return Uint is
pragma Assert (Nkind (N) in N_Entity);
U : constant Union_Id := Nodes.Table (N + 3).Field9;
begin
if U = 0 then
return Uint_0;
else
return From_Union (U);
end if;
end Uint22;
function Ureal3 (N : Node_Id) return Ureal is
begin
pragma Assert (N <= Nodes.Last);
return From_Union (Nodes.Table (N).Field3);
end Ureal3;
function Ureal18 (N : Node_Id) return Ureal is
begin
pragma Assert (Nkind (N) in N_Entity);
return From_Union (Nodes.Table (N + 2).Field11);
end Ureal18;
function Ureal21 (N : Node_Id) return Ureal is
begin
pragma Assert (Nkind (N) in N_Entity);
return From_Union (Nodes.Table (N + 3).Field8);
end Ureal21;
function Flag0 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag0;
end Flag0;
function Flag1 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag1;
end Flag1;
function Flag2 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag2;
end Flag2;
function Flag3 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Flags.Table (N).Flag3;
end Flag3;
function Flag4 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag4;
end Flag4;
function Flag5 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag5;
end Flag5;
function Flag6 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag6;
end Flag6;
function Flag7 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag7;
end Flag7;
function Flag8 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag8;
end Flag8;
function Flag9 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag9;
end Flag9;
function Flag10 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag10;
end Flag10;
function Flag11 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag11;
end Flag11;
function Flag12 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag12;
end Flag12;
function Flag13 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag13;
end Flag13;
function Flag14 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag14;
end Flag14;
function Flag15 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag15;
end Flag15;
function Flag16 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag16;
end Flag16;
function Flag17 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag17;
end Flag17;
function Flag18 (N : Node_Id) return Boolean is
begin
pragma Assert (N <= Nodes.Last);
return Nodes.Table (N).Flag18;
end Flag18;
function Flag19 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).In_List;
end Flag19;
function Flag20 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Has_Aspects;
end Flag20;
function Flag21 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Rewrite_Ins;
end Flag21;
function Flag22 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Analyzed;
end Flag22;
function Flag23 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Comes_From_Source;
end Flag23;
function Flag24 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Error_Posted;
end Flag24;
function Flag25 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag4;
end Flag25;
function Flag26 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag5;
end Flag26;
function Flag27 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag6;
end Flag27;
function Flag28 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag7;
end Flag28;
function Flag29 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag8;
end Flag29;
function Flag30 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag9;
end Flag30;
function Flag31 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag10;
end Flag31;
function Flag32 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag11;
end Flag32;
function Flag33 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag12;
end Flag33;
function Flag34 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag13;
end Flag34;
function Flag35 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag14;
end Flag35;
function Flag36 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag15;
end Flag36;
function Flag37 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag16;
end Flag37;
function Flag38 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag17;
end Flag38;
function Flag39 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Flag18;
end Flag39;
function Flag40 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).In_List;
end Flag40;
function Flag41 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Has_Aspects;
end Flag41;
function Flag42 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Rewrite_Ins;
end Flag42;
function Flag43 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Analyzed;
end Flag43;
function Flag44 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Comes_From_Source;
end Flag44;
function Flag45 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Error_Posted;
end Flag45;
function Flag46 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag4;
end Flag46;
function Flag47 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag5;
end Flag47;
function Flag48 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag6;
end Flag48;
function Flag49 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag7;
end Flag49;
function Flag50 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag8;
end Flag50;
function Flag51 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag9;
end Flag51;
function Flag52 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag10;
end Flag52;
function Flag53 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag11;
end Flag53;
function Flag54 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag12;
end Flag54;
function Flag55 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag13;
end Flag55;
function Flag56 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag14;
end Flag56;
function Flag57 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag15;
end Flag57;
function Flag58 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag16;
end Flag58;
function Flag59 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag17;
end Flag59;
function Flag60 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Flag18;
end Flag60;
function Flag61 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Pflag1;
end Flag61;
function Flag62 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 1).Pflag2;
end Flag62;
function Flag63 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Pflag1;
end Flag63;
function Flag64 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 2).Pflag2;
end Flag64;
function Flag65 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
end Flag65;
function Flag66 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
end Flag66;
function Flag67 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
end Flag67;
function Flag68 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
end Flag68;
function Flag69 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
end Flag69;
function Flag70 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
end Flag70;
function Flag71 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
end Flag71;
function Flag72 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
end Flag72;
function Flag73 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
end Flag73;
function Flag74 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
end Flag74;
function Flag75 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
end Flag75;
function Flag76 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
end Flag76;
function Flag77 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
end Flag77;
function Flag78 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
end Flag78;
function Flag79 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
end Flag79;
function Flag80 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
end Flag80;
function Flag81 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
end Flag81;
function Flag82 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
end Flag82;
function Flag83 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
end Flag83;
function Flag84 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
end Flag84;
function Flag85 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
end Flag85;
function Flag86 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
end Flag86;
function Flag87 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
end Flag87;
function Flag88 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
end Flag88;
function Flag89 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
end Flag89;
function Flag90 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
end Flag90;
function Flag91 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
end Flag91;
function Flag92 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
end Flag92;
function Flag93 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
end Flag93;
function Flag94 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
end Flag94;
function Flag95 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
end Flag95;
function Flag96 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
end Flag96;
function Flag97 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
end Flag97;
function Flag98 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
end Flag98;
function Flag99 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
end Flag99;
function Flag100 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
end Flag100;
function Flag101 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
end Flag101;
function Flag102 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
end Flag102;
function Flag103 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
end Flag103;
function Flag104 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
end Flag104;
function Flag105 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
end Flag105;
function Flag106 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
end Flag106;
function Flag107 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
end Flag107;
function Flag108 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
end Flag108;
function Flag109 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
end Flag109;
function Flag110 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
end Flag110;
function Flag111 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
end Flag111;
function Flag112 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
end Flag112;
function Flag113 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
end Flag113;
function Flag114 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
end Flag114;
function Flag115 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
end Flag115;
function Flag116 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
end Flag116;
function Flag117 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
end Flag117;
function Flag118 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
end Flag118;
function Flag119 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
end Flag119;
function Flag120 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
end Flag120;
function Flag121 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
end Flag121;
function Flag122 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
end Flag122;
function Flag123 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
end Flag123;
function Flag124 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
end Flag124;
function Flag125 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
end Flag125;
function Flag126 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
end Flag126;
function Flag127 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
end Flag127;
function Flag128 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
end Flag128;
function Flag129 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).In_List;
end Flag129;
function Flag130 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Has_Aspects;
end Flag130;
function Flag131 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Rewrite_Ins;
end Flag131;
function Flag132 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Analyzed;
end Flag132;
function Flag133 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Comes_From_Source;
end Flag133;
function Flag134 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Error_Posted;
end Flag134;
function Flag135 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag4;
end Flag135;
function Flag136 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag5;
end Flag136;
function Flag137 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag6;
end Flag137;
function Flag138 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag7;
end Flag138;
function Flag139 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag8;
end Flag139;
function Flag140 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag9;
end Flag140;
function Flag141 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag10;
end Flag141;
function Flag142 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag11;
end Flag142;
function Flag143 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag12;
end Flag143;
function Flag144 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag13;
end Flag144;
function Flag145 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag14;
end Flag145;
function Flag146 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag15;
end Flag146;
function Flag147 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag16;
end Flag147;
function Flag148 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag17;
end Flag148;
function Flag149 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Flag18;
end Flag149;
function Flag150 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Pflag1;
end Flag150;
function Flag151 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 3).Pflag2;
end Flag151;
function Flag152 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
end Flag152;
function Flag153 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
end Flag153;
function Flag154 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
end Flag154;
function Flag155 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
end Flag155;
function Flag156 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
end Flag156;
function Flag157 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
end Flag157;
function Flag158 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
end Flag158;
function Flag159 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
end Flag159;
function Flag160 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
end Flag160;
function Flag161 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
end Flag161;
function Flag162 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
end Flag162;
function Flag163 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
end Flag163;
function Flag164 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
end Flag164;
function Flag165 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
end Flag165;
function Flag166 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
end Flag166;
function Flag167 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
end Flag167;
function Flag168 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
end Flag168;
function Flag169 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
end Flag169;
function Flag170 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
end Flag170;
function Flag171 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
end Flag171;
function Flag172 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
end Flag172;
function Flag173 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
end Flag173;
function Flag174 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
end Flag174;
function Flag175 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
end Flag175;
function Flag176 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
end Flag176;
function Flag177 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
end Flag177;
function Flag178 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
end Flag178;
function Flag179 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
end Flag179;
function Flag180 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
end Flag180;
function Flag181 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
end Flag181;
function Flag182 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
end Flag182;
function Flag183 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
end Flag183;
function Flag184 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag184;
end Flag184;
function Flag185 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag185;
end Flag185;
function Flag186 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag186;
end Flag186;
function Flag187 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag187;
end Flag187;
function Flag188 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag188;
end Flag188;
function Flag189 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag189;
end Flag189;
function Flag190 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag190;
end Flag190;
function Flag191 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag191;
end Flag191;
function Flag192 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag192;
end Flag192;
function Flag193 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag193;
end Flag193;
function Flag194 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag194;
end Flag194;
function Flag195 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag195;
end Flag195;
function Flag196 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag196;
end Flag196;
function Flag197 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag197;
end Flag197;
function Flag198 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag198;
end Flag198;
function Flag199 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag199;
end Flag199;
function Flag200 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag200;
end Flag200;
function Flag201 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag201;
end Flag201;
function Flag202 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag202;
end Flag202;
function Flag203 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag203;
end Flag203;
function Flag204 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag204;
end Flag204;
function Flag205 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag205;
end Flag205;
function Flag206 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag206;
end Flag206;
function Flag207 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag207;
end Flag207;
function Flag208 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag208;
end Flag208;
function Flag209 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag209;
end Flag209;
function Flag210 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag210;
end Flag210;
function Flag211 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag211;
end Flag211;
function Flag212 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag212;
end Flag212;
function Flag213 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag213;
end Flag213;
function Flag214 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag214;
end Flag214;
function Flag215 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word4 (Nodes.Table (N + 4).Field12).Flag215;
end Flag215;
function Flag216 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).In_List;
end Flag216;
function Flag217 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Has_Aspects;
end Flag217;
function Flag218 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Rewrite_Ins;
end Flag218;
function Flag219 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Analyzed;
end Flag219;
function Flag220 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Comes_From_Source;
end Flag220;
function Flag221 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Error_Posted;
end Flag221;
function Flag222 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag4;
end Flag222;
function Flag223 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag5;
end Flag223;
function Flag224 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag6;
end Flag224;
function Flag225 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag7;
end Flag225;
function Flag226 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag8;
end Flag226;
function Flag227 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag9;
end Flag227;
function Flag228 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag10;
end Flag228;
function Flag229 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag11;
end Flag229;
function Flag230 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag12;
end Flag230;
function Flag231 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag13;
end Flag231;
function Flag232 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag14;
end Flag232;
function Flag233 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag15;
end Flag233;
function Flag234 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag16;
end Flag234;
function Flag235 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag17;
end Flag235;
function Flag236 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Flag18;
end Flag236;
function Flag237 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Pflag1;
end Flag237;
function Flag238 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 4).Pflag2;
end Flag238;
function Flag239 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag239;
end Flag239;
function Flag240 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag240;
end Flag240;
function Flag241 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag241;
end Flag241;
function Flag242 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag242;
end Flag242;
function Flag243 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag243;
end Flag243;
function Flag244 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag244;
end Flag244;
function Flag245 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag245;
end Flag245;
function Flag246 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte2 (Nodes.Table (N + 3).Nkind).Flag246;
end Flag246;
function Flag247 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag247;
end Flag247;
function Flag248 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag248;
end Flag248;
function Flag249 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag249;
end Flag249;
function Flag250 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag250;
end Flag250;
function Flag251 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag251;
end Flag251;
function Flag252 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag252;
end Flag252;
function Flag253 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag253;
end Flag253;
function Flag254 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte3 (Nodes.Table (N + 4).Nkind).Flag254;
end Flag254;
function Flag255 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag255;
end Flag255;
function Flag256 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag256;
end Flag256;
function Flag257 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag257;
end Flag257;
function Flag258 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag258;
end Flag258;
function Flag259 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag259;
end Flag259;
function Flag260 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag260;
end Flag260;
function Flag261 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag261;
end Flag261;
function Flag262 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag262;
end Flag262;
function Flag263 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag263;
end Flag263;
function Flag264 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag264;
end Flag264;
function Flag265 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag265;
end Flag265;
function Flag266 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag266;
end Flag266;
function Flag267 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag267;
end Flag267;
function Flag268 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag268;
end Flag268;
function Flag269 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag269;
end Flag269;
function Flag270 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag270;
end Flag270;
function Flag271 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag271;
end Flag271;
function Flag272 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag272;
end Flag272;
function Flag273 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag273;
end Flag273;
function Flag274 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag274;
end Flag274;
function Flag275 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag275;
end Flag275;
function Flag276 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag276;
end Flag276;
function Flag277 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag277;
end Flag277;
function Flag278 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag278;
end Flag278;
function Flag279 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag279;
end Flag279;
function Flag280 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag280;
end Flag280;
function Flag281 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag281;
end Flag281;
function Flag282 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag282;
end Flag282;
function Flag283 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag283;
end Flag283;
function Flag284 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag284;
end Flag284;
function Flag285 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag285;
end Flag285;
function Flag286 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Word5 (Nodes.Table (N + 5).Field12).Flag286;
end Flag286;
function Flag287 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).In_List;
end Flag287;
function Flag288 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Has_Aspects;
end Flag288;
function Flag289 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Rewrite_Ins;
end Flag289;
function Flag290 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Analyzed;
end Flag290;
function Flag291 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Comes_From_Source;
end Flag291;
function Flag292 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Error_Posted;
end Flag292;
function Flag293 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag4;
end Flag293;
function Flag294 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag5;
end Flag294;
function Flag295 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag6;
end Flag295;
function Flag296 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag7;
end Flag296;
function Flag297 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag8;
end Flag297;
function Flag298 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag9;
end Flag298;
function Flag299 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag10;
end Flag299;
function Flag300 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag11;
end Flag300;
function Flag301 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag12;
end Flag301;
function Flag302 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag13;
end Flag302;
function Flag303 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag14;
end Flag303;
function Flag304 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag15;
end Flag304;
function Flag305 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag16;
end Flag305;
function Flag306 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag17;
end Flag306;
function Flag307 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Flag18;
end Flag307;
function Flag308 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Pflag1;
end Flag308;
function Flag309 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return Nodes.Table (N + 5).Pflag2;
end Flag309;
function Flag310 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag310;
end Flag310;
function Flag311 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag311;
end Flag311;
function Flag312 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag312;
end Flag312;
function Flag313 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag313;
end Flag313;
function Flag314 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag314;
end Flag314;
function Flag315 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag315;
end Flag315;
function Flag316 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag316;
end Flag316;
function Flag317 (N : Node_Id) return Boolean is
begin
pragma Assert (Nkind (N) in N_Entity);
return To_Flag_Byte4 (Nodes.Table (N + 5).Nkind).Flag317;
end Flag317;
procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Nkind := Val;
end Set_Nkind;
procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Val;
end Set_Field1;
procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Val;
end Set_Field2;
procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Val;
end Set_Field3;
procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := Val;
end Set_Field4;
procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := Val;
end Set_Field5;
procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field6 := Val;
end Set_Field6;
procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field7 := Val;
end Set_Field7;
procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := Val;
end Set_Field8;
procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := Val;
end Set_Field9;
procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Val;
end Set_Field10;
procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field11 := Val;
end Set_Field11;
procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field12 := Val;
end Set_Field12;
procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := Val;
end Set_Field13;
procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := Val;
end Set_Field14;
procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := Val;
end Set_Field15;
procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := Val;
end Set_Field16;
procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field10 := Val;
end Set_Field17;
procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := Val;
end Set_Field18;
procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field6 := Val;
end Set_Field19;
procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field7 := Val;
end Set_Field20;
procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := Val;
end Set_Field21;
procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field9 := Val;
end Set_Field22;
procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field10 := Val;
end Set_Field23;
procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field6 := Val;
end Set_Field24;
procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Val;
end Set_Field25;
procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field8 := Val;
end Set_Field26;
procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field9 := Val;
end Set_Field27;
procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field10 := Val;
end Set_Field28;
procedure Set_Field29 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field11 := Val;
end Set_Field29;
procedure Set_Field30 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field6 := Val;
end Set_Field30;
procedure Set_Field31 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field7 := Val;
end Set_Field31;
procedure Set_Field32 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field8 := Val;
end Set_Field32;
procedure Set_Field33 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field9 := Val;
end Set_Field33;
procedure Set_Field34 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field10 := Val;
end Set_Field34;
procedure Set_Field35 (N : Node_Id; Val : Union_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field11 := Val;
end Set_Field35;
procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_Node1;
procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_Node2;
procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_Node3;
procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := Union_Id (Val);
end Set_Node4;
procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := Union_Id (Val);
end Set_Node5;
procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field6 := Union_Id (Val);
end Set_Node6;
procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field7 := Union_Id (Val);
end Set_Node7;
procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := Union_Id (Val);
end Set_Node8;
procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := Union_Id (Val);
end Set_Node9;
procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Union_Id (Val);
end Set_Node10;
procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field11 := Union_Id (Val);
end Set_Node11;
procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field12 := Union_Id (Val);
end Set_Node12;
procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := Union_Id (Val);
end Set_Node13;
procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := Union_Id (Val);
end Set_Node14;
procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := Union_Id (Val);
end Set_Node15;
procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := Union_Id (Val);
end Set_Node16;
procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field10 := Union_Id (Val);
end Set_Node17;
procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := Union_Id (Val);
end Set_Node18;
procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field6 := Union_Id (Val);
end Set_Node19;
procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field7 := Union_Id (Val);
end Set_Node20;
procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := Union_Id (Val);
end Set_Node21;
procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field9 := Union_Id (Val);
end Set_Node22;
procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field10 := Union_Id (Val);
end Set_Node23;
procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field6 := Union_Id (Val);
end Set_Node24;
procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Union_Id (Val);
end Set_Node25;
procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field8 := Union_Id (Val);
end Set_Node26;
procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field9 := Union_Id (Val);
end Set_Node27;
procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field10 := Union_Id (Val);
end Set_Node28;
procedure Set_Node29 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field11 := Union_Id (Val);
end Set_Node29;
procedure Set_Node30 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field6 := Union_Id (Val);
end Set_Node30;
procedure Set_Node31 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field7 := Union_Id (Val);
end Set_Node31;
procedure Set_Node32 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field8 := Union_Id (Val);
end Set_Node32;
procedure Set_Node33 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field9 := Union_Id (Val);
end Set_Node33;
procedure Set_Node34 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field10 := Union_Id (Val);
end Set_Node34;
procedure Set_Node35 (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Field11 := Union_Id (Val);
end Set_Node35;
procedure Set_List1 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_List1;
procedure Set_List2 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_List2;
procedure Set_List3 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_List3;
procedure Set_List4 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := Union_Id (Val);
end Set_List4;
procedure Set_List5 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := Union_Id (Val);
end Set_List5;
procedure Set_List10 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Union_Id (Val);
end Set_List10;
procedure Set_List14 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := Union_Id (Val);
end Set_List14;
procedure Set_List25 (N : Node_Id; Val : List_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Union_Id (Val);
end Set_List25;
procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
begin
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_Elist1;
procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
begin
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_Elist2;
procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
begin
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_Elist3;
procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
begin
Nodes.Table (N).Field4 := Union_Id (Val);
end Set_Elist4;
procedure Set_Elist5 (N : Node_Id; Val : Elist_Id) is
begin
Nodes.Table (N).Field5 := Union_Id (Val);
end Set_Elist5;
procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := Union_Id (Val);
end Set_Elist8;
procedure Set_Elist9 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := Union_Id (Val);
end Set_Elist9;
procedure Set_Elist10 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := Union_Id (Val);
end Set_Elist10;
procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := Union_Id (Val);
end Set_Elist13;
procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := Union_Id (Val);
end Set_Elist15;
procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := Union_Id (Val);
end Set_Elist16;
procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := Union_Id (Val);
end Set_Elist18;
procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := Union_Id (Val);
end Set_Elist21;
procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field10 := Union_Id (Val);
end Set_Elist23;
procedure Set_Elist24 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field6 := Union_Id (Val);
end Set_Elist24;
procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field7 := Union_Id (Val);
end Set_Elist25;
procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Field8 := Union_Id (Val);
end Set_Elist26;
procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field1 := Union_Id (Val);
end Set_Name1;
procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := Union_Id (Val);
end Set_Name2;
procedure Set_Str3 (N : Node_Id; Val : String_Id) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := Union_Id (Val);
end Set_Str3;
procedure Set_Uint2 (N : Node_Id; Val : Uint) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field2 := To_Union (Val);
end Set_Uint2;
procedure Set_Uint3 (N : Node_Id; Val : Uint) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := To_Union (Val);
end Set_Uint3;
procedure Set_Uint4 (N : Node_Id; Val : Uint) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field4 := To_Union (Val);
end Set_Uint4;
procedure Set_Uint5 (N : Node_Id; Val : Uint) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field5 := To_Union (Val);
end Set_Uint5;
procedure Set_Uint8 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field8 := To_Union (Val);
end Set_Uint8;
procedure Set_Uint9 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field9 := To_Union (Val);
end Set_Uint9;
procedure Set_Uint10 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field10 := To_Union (Val);
end Set_Uint10;
procedure Set_Uint11 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field11 := To_Union (Val);
end Set_Uint11;
procedure Set_Uint12 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Field12 := To_Union (Val);
end Set_Uint12;
procedure Set_Uint13 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field6 := To_Union (Val);
end Set_Uint13;
procedure Set_Uint14 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field7 := To_Union (Val);
end Set_Uint14;
procedure Set_Uint15 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field8 := To_Union (Val);
end Set_Uint15;
procedure Set_Uint16 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field9 := To_Union (Val);
end Set_Uint16;
procedure Set_Uint17 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field10 := To_Union (Val);
end Set_Uint17;
procedure Set_Uint22 (N : Node_Id; Val : Uint) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field9 := To_Union (Val);
end Set_Uint22;
procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Field3 := To_Union (Val);
end Set_Ureal3;
procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Field11 := To_Union (Val);
end Set_Ureal18;
procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Field8 := To_Union (Val);
end Set_Ureal21;
procedure Set_Flag0 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag0 := Val;
end Set_Flag0;
procedure Set_Flag1 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag1 := Val;
end Set_Flag1;
procedure Set_Flag2 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag2 := Val;
end Set_Flag2;
procedure Set_Flag3 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Flags.Table (N).Flag3 := Val;
end Set_Flag3;
procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag4 := Val;
end Set_Flag4;
procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag5 := Val;
end Set_Flag5;
procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag6 := Val;
end Set_Flag6;
procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag7 := Val;
end Set_Flag7;
procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag8 := Val;
end Set_Flag8;
procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag9 := Val;
end Set_Flag9;
procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag10 := Val;
end Set_Flag10;
procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag11 := Val;
end Set_Flag11;
procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag12 := Val;
end Set_Flag12;
procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag13 := Val;
end Set_Flag13;
procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag14 := Val;
end Set_Flag14;
procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag15 := Val;
end Set_Flag15;
procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag16 := Val;
end Set_Flag16;
procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag17 := Val;
end Set_Flag17;
procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (N <= Nodes.Last);
Nodes.Table (N).Flag18 := Val;
end Set_Flag18;
procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).In_List := Val;
end Set_Flag19;
procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Has_Aspects := Val;
end Set_Flag20;
procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Rewrite_Ins := Val;
end Set_Flag21;
procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Analyzed := Val;
end Set_Flag22;
procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Comes_From_Source := Val;
end Set_Flag23;
procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Error_Posted := Val;
end Set_Flag24;
procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag4 := Val;
end Set_Flag25;
procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag5 := Val;
end Set_Flag26;
procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag6 := Val;
end Set_Flag27;
procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag7 := Val;
end Set_Flag28;
procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag8 := Val;
end Set_Flag29;
procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag9 := Val;
end Set_Flag30;
procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag10 := Val;
end Set_Flag31;
procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag11 := Val;
end Set_Flag32;
procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag12 := Val;
end Set_Flag33;
procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag13 := Val;
end Set_Flag34;
procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag14 := Val;
end Set_Flag35;
procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag15 := Val;
end Set_Flag36;
procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag16 := Val;
end Set_Flag37;
procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag17 := Val;
end Set_Flag38;
procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Flag18 := Val;
end Set_Flag39;
procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).In_List := Val;
end Set_Flag40;
procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Has_Aspects := Val;
end Set_Flag41;
procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Rewrite_Ins := Val;
end Set_Flag42;
procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Analyzed := Val;
end Set_Flag43;
procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Comes_From_Source := Val;
end Set_Flag44;
procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Error_Posted := Val;
end Set_Flag45;
procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag4 := Val;
end Set_Flag46;
procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag5 := Val;
end Set_Flag47;
procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag6 := Val;
end Set_Flag48;
procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag7 := Val;
end Set_Flag49;
procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag8 := Val;
end Set_Flag50;
procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag9 := Val;
end Set_Flag51;
procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag10 := Val;
end Set_Flag52;
procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag11 := Val;
end Set_Flag53;
procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag12 := Val;
end Set_Flag54;
procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag13 := Val;
end Set_Flag55;
procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag14 := Val;
end Set_Flag56;
procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag15 := Val;
end Set_Flag57;
procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag16 := Val;
end Set_Flag58;
procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag17 := Val;
end Set_Flag59;
procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Flag18 := Val;
end Set_Flag60;
procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Pflag1 := Val;
end Set_Flag61;
procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 1).Pflag2 := Val;
end Set_Flag62;
procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Pflag1 := Val;
end Set_Flag63;
procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 2).Pflag2 := Val;
end Set_Flag64;
procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
end Set_Flag65;
procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
end Set_Flag66;
procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
end Set_Flag67;
procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
end Set_Flag68;
procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
end Set_Flag69;
procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
end Set_Flag70;
procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
end Set_Flag71;
procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
end Set_Flag72;
procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
end Set_Flag73;
procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
end Set_Flag74;
procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
end Set_Flag75;
procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
end Set_Flag76;
procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
end Set_Flag77;
procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
end Set_Flag78;
procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
end Set_Flag79;
procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
end Set_Flag80;
procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
end Set_Flag81;
procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
end Set_Flag82;
procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
end Set_Flag83;
procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
end Set_Flag84;
procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
end Set_Flag85;
procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
end Set_Flag86;
procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
end Set_Flag87;
procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
end Set_Flag88;
procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
end Set_Flag89;
procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
end Set_Flag90;
procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
end Set_Flag91;
procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
end Set_Flag92;
procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
end Set_Flag93;
procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
end Set_Flag94;
procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
end Set_Flag95;
procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
end Set_Flag96;
procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
end Set_Flag97;
procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
end Set_Flag98;
procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
end Set_Flag99;
procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
end Set_Flag100;
procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
end Set_Flag101;
procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
end Set_Flag102;
procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
end Set_Flag103;
procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
end Set_Flag104;
procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
end Set_Flag105;
procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
end Set_Flag106;
procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
end Set_Flag107;
procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
end Set_Flag108;
procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
end Set_Flag109;
procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
end Set_Flag110;
procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
end Set_Flag111;
procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
end Set_Flag112;
procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
end Set_Flag113;
procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
end Set_Flag114;
procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
end Set_Flag115;
procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
end Set_Flag116;
procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
end Set_Flag117;
procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
end Set_Flag118;
procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
end Set_Flag119;
procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
end Set_Flag120;
procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
end Set_Flag121;
procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
end Set_Flag122;
procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
end Set_Flag123;
procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
end Set_Flag124;
procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
end Set_Flag125;
procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
end Set_Flag126;
procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
end Set_Flag127;
procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word2_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
end Set_Flag128;
procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).In_List := Val;
end Set_Flag129;
procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Has_Aspects := Val;
end Set_Flag130;
procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Rewrite_Ins := Val;
end Set_Flag131;
procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Analyzed := Val;
end Set_Flag132;
procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Comes_From_Source := Val;
end Set_Flag133;
procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Error_Posted := Val;
end Set_Flag134;
procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag4 := Val;
end Set_Flag135;
procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag5 := Val;
end Set_Flag136;
procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag6 := Val;
end Set_Flag137;
procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag7 := Val;
end Set_Flag138;
procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag8 := Val;
end Set_Flag139;
procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag9 := Val;
end Set_Flag140;
procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag10 := Val;
end Set_Flag141;
procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag11 := Val;
end Set_Flag142;
procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag12 := Val;
end Set_Flag143;
procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag13 := Val;
end Set_Flag144;
procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag14 := Val;
end Set_Flag145;
procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag15 := Val;
end Set_Flag146;
procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag16 := Val;
end Set_Flag147;
procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag17 := Val;
end Set_Flag148;
procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Flag18 := Val;
end Set_Flag149;
procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Pflag1 := Val;
end Set_Flag150;
procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 3).Pflag2 := Val;
end Set_Flag151;
procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
end Set_Flag152;
procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
end Set_Flag153;
procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
end Set_Flag154;
procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
end Set_Flag155;
procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
end Set_Flag156;
procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
end Set_Flag157;
procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
end Set_Flag158;
procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
end Set_Flag159;
procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
end Set_Flag160;
procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
end Set_Flag161;
procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
end Set_Flag162;
procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
end Set_Flag163;
procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
end Set_Flag164;
procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
end Set_Flag165;
procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
end Set_Flag166;
procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
end Set_Flag167;
procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
end Set_Flag168;
procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
end Set_Flag169;
procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
end Set_Flag170;
procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
end Set_Flag171;
procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
end Set_Flag172;
procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
end Set_Flag173;
procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
end Set_Flag174;
procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
end Set_Flag175;
procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
end Set_Flag176;
procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
end Set_Flag177;
procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
end Set_Flag178;
procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
end Set_Flag179;
procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
end Set_Flag180;
procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
end Set_Flag181;
procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
end Set_Flag182;
procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word3_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
end Set_Flag183;
procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag184 := Val;
end Set_Flag184;
procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag185 := Val;
end Set_Flag185;
procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag186 := Val;
end Set_Flag186;
procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag187 := Val;
end Set_Flag187;
procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag188 := Val;
end Set_Flag188;
procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag189 := Val;
end Set_Flag189;
procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag190 := Val;
end Set_Flag190;
procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag191 := Val;
end Set_Flag191;
procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag192 := Val;
end Set_Flag192;
procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag193 := Val;
end Set_Flag193;
procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag194 := Val;
end Set_Flag194;
procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag195 := Val;
end Set_Flag195;
procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag196 := Val;
end Set_Flag196;
procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag197 := Val;
end Set_Flag197;
procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag198 := Val;
end Set_Flag198;
procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag199 := Val;
end Set_Flag199;
procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag200 := Val;
end Set_Flag200;
procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag201 := Val;
end Set_Flag201;
procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag202 := Val;
end Set_Flag202;
procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag203 := Val;
end Set_Flag203;
procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag204 := Val;
end Set_Flag204;
procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag205 := Val;
end Set_Flag205;
procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag206 := Val;
end Set_Flag206;
procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag207 := Val;
end Set_Flag207;
procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag208 := Val;
end Set_Flag208;
procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag209 := Val;
end Set_Flag209;
procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag210 := Val;
end Set_Flag210;
procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag211 := Val;
end Set_Flag211;
procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag212 := Val;
end Set_Flag212;
procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag213 := Val;
end Set_Flag213;
procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag214 := Val;
end Set_Flag214;
procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word4_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag215 := Val;
end Set_Flag215;
procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).In_List := Val;
end Set_Flag216;
procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Has_Aspects := Val;
end Set_Flag217;
procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Rewrite_Ins := Val;
end Set_Flag218;
procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Analyzed := Val;
end Set_Flag219;
procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Comes_From_Source := Val;
end Set_Flag220;
procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Error_Posted := Val;
end Set_Flag221;
procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag4 := Val;
end Set_Flag222;
procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag5 := Val;
end Set_Flag223;
procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag6 := Val;
end Set_Flag224;
procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag7 := Val;
end Set_Flag225;
procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag8 := Val;
end Set_Flag226;
procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag9 := Val;
end Set_Flag227;
procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag10 := Val;
end Set_Flag228;
procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag11 := Val;
end Set_Flag229;
procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag12 := Val;
end Set_Flag230;
procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag13 := Val;
end Set_Flag231;
procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag14 := Val;
end Set_Flag232;
procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag15 := Val;
end Set_Flag233;
procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag16 := Val;
end Set_Flag234;
procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag17 := Val;
end Set_Flag235;
procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Flag18 := Val;
end Set_Flag236;
procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Pflag1 := Val;
end Set_Flag237;
procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 4).Pflag2 := Val;
end Set_Flag238;
procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag239 := Val;
end Set_Flag239;
procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag240 := Val;
end Set_Flag240;
procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag241 := Val;
end Set_Flag241;
procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag242 := Val;
end Set_Flag242;
procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag243 := Val;
end Set_Flag243;
procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag244 := Val;
end Set_Flag244;
procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag245 := Val;
end Set_Flag245;
procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte2_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 3).Nkind'Unrestricted_Access)).Flag246 := Val;
end Set_Flag246;
procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag247 := Val;
end Set_Flag247;
procedure Set_Flag248 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag248 := Val;
end Set_Flag248;
procedure Set_Flag249 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag249 := Val;
end Set_Flag249;
procedure Set_Flag250 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag250 := Val;
end Set_Flag250;
procedure Set_Flag251 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag251 := Val;
end Set_Flag251;
procedure Set_Flag252 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag252 := Val;
end Set_Flag252;
procedure Set_Flag253 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag253 := Val;
end Set_Flag253;
procedure Set_Flag254 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte3_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 4).Nkind'Unrestricted_Access)).Flag254 := Val;
end Set_Flag254;
procedure Set_Flag255 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag255 := Val;
end Set_Flag255;
procedure Set_Flag256 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag256 := Val;
end Set_Flag256;
procedure Set_Flag257 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag257 := Val;
end Set_Flag257;
procedure Set_Flag258 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag258 := Val;
end Set_Flag258;
procedure Set_Flag259 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag259 := Val;
end Set_Flag259;
procedure Set_Flag260 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag260 := Val;
end Set_Flag260;
procedure Set_Flag261 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag261 := Val;
end Set_Flag261;
procedure Set_Flag262 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag262 := Val;
end Set_Flag262;
procedure Set_Flag263 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag263 := Val;
end Set_Flag263;
procedure Set_Flag264 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag264 := Val;
end Set_Flag264;
procedure Set_Flag265 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag265 := Val;
end Set_Flag265;
procedure Set_Flag266 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag266 := Val;
end Set_Flag266;
procedure Set_Flag267 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag267 := Val;
end Set_Flag267;
procedure Set_Flag268 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag268 := Val;
end Set_Flag268;
procedure Set_Flag269 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag269 := Val;
end Set_Flag269;
procedure Set_Flag270 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag270 := Val;
end Set_Flag270;
procedure Set_Flag271 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag271 := Val;
end Set_Flag271;
procedure Set_Flag272 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag272 := Val;
end Set_Flag272;
procedure Set_Flag273 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag273 := Val;
end Set_Flag273;
procedure Set_Flag274 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag274 := Val;
end Set_Flag274;
procedure Set_Flag275 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag275 := Val;
end Set_Flag275;
procedure Set_Flag276 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag276 := Val;
end Set_Flag276;
procedure Set_Flag277 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag277 := Val;
end Set_Flag277;
procedure Set_Flag278 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag278 := Val;
end Set_Flag278;
procedure Set_Flag279 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag279 := Val;
end Set_Flag279;
procedure Set_Flag280 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag280 := Val;
end Set_Flag280;
procedure Set_Flag281 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag281 := Val;
end Set_Flag281;
procedure Set_Flag282 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag282 := Val;
end Set_Flag282;
procedure Set_Flag283 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag283 := Val;
end Set_Flag283;
procedure Set_Flag284 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag284 := Val;
end Set_Flag284;
procedure Set_Flag285 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag285 := Val;
end Set_Flag285;
procedure Set_Flag286 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Word5_Ptr
(Union_Id_Ptr'
(Nodes.Table (N + 5).Field12'Unrestricted_Access)).Flag286 := Val;
end Set_Flag286;
procedure Set_Flag287 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).In_List := Val;
end Set_Flag287;
procedure Set_Flag288 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Has_Aspects := Val;
end Set_Flag288;
procedure Set_Flag289 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Rewrite_Ins := Val;
end Set_Flag289;
procedure Set_Flag290 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Analyzed := Val;
end Set_Flag290;
procedure Set_Flag291 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Comes_From_Source := Val;
end Set_Flag291;
procedure Set_Flag292 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Error_Posted := Val;
end Set_Flag292;
procedure Set_Flag293 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag4 := Val;
end Set_Flag293;
procedure Set_Flag294 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag5 := Val;
end Set_Flag294;
procedure Set_Flag295 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag6 := Val;
end Set_Flag295;
procedure Set_Flag296 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag7 := Val;
end Set_Flag296;
procedure Set_Flag297 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag8 := Val;
end Set_Flag297;
procedure Set_Flag298 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag9 := Val;
end Set_Flag298;
procedure Set_Flag299 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag10 := Val;
end Set_Flag299;
procedure Set_Flag300 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag11 := Val;
end Set_Flag300;
procedure Set_Flag301 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag12 := Val;
end Set_Flag301;
procedure Set_Flag302 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag13 := Val;
end Set_Flag302;
procedure Set_Flag303 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag14 := Val;
end Set_Flag303;
procedure Set_Flag304 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag15 := Val;
end Set_Flag304;
procedure Set_Flag305 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag16 := Val;
end Set_Flag305;
procedure Set_Flag306 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag17 := Val;
end Set_Flag306;
procedure Set_Flag307 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Flag18 := Val;
end Set_Flag307;
procedure Set_Flag308 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Pflag1 := Val;
end Set_Flag308;
procedure Set_Flag309 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
Nodes.Table (N + 5).Pflag2 := Val;
end Set_Flag309;
procedure Set_Flag310 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag310 := Val;
end Set_Flag310;
procedure Set_Flag311 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag311 := Val;
end Set_Flag311;
procedure Set_Flag312 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag312 := Val;
end Set_Flag312;
procedure Set_Flag313 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag313 := Val;
end Set_Flag313;
procedure Set_Flag314 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag314 := Val;
end Set_Flag314;
procedure Set_Flag315 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag315 := Val;
end Set_Flag315;
procedure Set_Flag316 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag316 := Val;
end Set_Flag316;
procedure Set_Flag317 (N : Node_Id; Val : Boolean) is
begin
pragma Assert (Nkind (N) in N_Entity);
To_Flag_Byte4_Ptr
(Node_Kind_Ptr'
(Nodes.Table (N + 5).Nkind'Unrestricted_Access)).Flag317 := Val;
end Set_Flag317;
procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node1 (N, Val);
end Set_Node1_With_Parent;
procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node2 (N, Val);
end Set_Node2_With_Parent;
procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node3 (N, Val);
end Set_Node3_With_Parent;
procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node4 (N, Val);
end Set_Node4_With_Parent;
procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val > Error then
Set_Parent (N => Val, Val => N);
end if;
Set_Node5 (N, Val);
end Set_Node5_With_Parent;
procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List1 (N, Val);
end Set_List1_With_Parent;
procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List2 (N, Val);
end Set_List2_With_Parent;
procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List3 (N, Val);
end Set_List3_With_Parent;
procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List4 (N, Val);
end Set_List4_With_Parent;
procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
begin
pragma Assert (N <= Nodes.Last);
if Val /= No_List and then Val /= Error_List then
Set_Parent (Val, N);
end if;
Set_List5 (N, Val);
end Set_List5_With_Parent;
end Unchecked_Access;
------------
-- Unlock --
------------
procedure Unlock is
begin
Nodes.Locked := False;
Flags.Locked := False;
Orig_Nodes.Locked := False;
end Unlock;
end Atree;
|