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
|
------------------------------------------------------------------------------
-- --
-- GNATPP COMPONENTS --
-- --
-- G N A T P P . P O S T _ O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2013, AdaCore --
-- --
-- GNATPP 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 2, or (at your option) any later ver- --
-- sion. GNATPP is distributed in the hope that it will be useful, but --
-- WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABI- --
-- LITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public --
-- License for more details. You should have received a copy of the GNU --
-- General Public License distributed with GNAT; see file COPYING. If not, --
-- write to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, --
-- --
-- GNATPP is maintained by AdaCore (http://www.adacore.com) --
-- --
------------------------------------------------------------------------------
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Asis.Elements; use Asis.Elements;
with Asis.Declarations; use Asis.Declarations;
with Asis.Definitions; use Asis.Definitions;
with Asis.Statements; use Asis.Statements;
with Asis.Expressions; use Asis.Expressions;
with Asis.Clauses; use Asis.Clauses;
with Asis.Extensions; use Asis.Extensions;
with Ada_Trees.Formatting; use Ada_Trees.Formatting;
with GNATPP.PP_Output; use GNATPP.PP_Output;
with GNATPP.State; use GNATPP.State;
with GNATPP.Source_Line_Buffer; use GNATPP.Source_Line_Buffer;
with GNATPP.Comments; use GNATPP.Comments;
with GNATPP.Options; use GNATPP.Options;
with GNATPP.Utilities; use GNATPP.Utilities;
with GNATPP.Asis_Utilities; use GNATPP.Asis_Utilities;
with GNATPP.General_Traversal_Stacks; use GNATPP.General_Traversal_Stacks;
with GNATPP.Layout; use GNATPP.Layout;
with GNATPP.Paragraphs; use GNATPP.Paragraphs;
with A4G.Skip_TB;
package body GNATPP.Post_Operations is
------------------------
-- Local Subprograms --
------------------------
procedure Finalize_Declaration (Element : Asis.Element);
-- Encapsulates actions which are in common for various declarations:
-- printing out ';', checking the next keyword (such as 'begin', 'private')
-- and printing it out if needed
----------------------------------
-- A_Compound_Statement_Post_Op --
----------------------------------
procedure A_Compound_Statement_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
begin
if (Arg_Kind = A_Case_Statement and then
Statement_Paths (Element)'Length < Case_Threshold)
or else
(Arg_Kind = A_Variant_Part and then
Variants (Element)'Length < Case_Threshold)
or else
Arg_Kind = An_Extended_Return_Statement
then
Decrease_Indentation;
end if;
PP_New_Line;
PP_Keyword (KW_End);
Get_Next_Ada_Lexem;
PP_Continue_Line;
Detect_Keyword;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
A_General_Statement_Post_Op (Element, Control, State);
end A_Compound_Statement_Post_Op;
---------------------------
-- A_Declaration_Post_Op --
---------------------------
procedure A_Declaration_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
begin
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
if (Arg_Kind = A_Single_Task_Declaration and then
Is_Nil (Object_Declaration_View (Element)))
or else
(Arg_Kind = A_Task_Type_Declaration and then
Is_Nil (Type_Declaration_View (Element)))
then
Decrease_Indentation;
end if;
Finalize_Declaration (Element);
end A_Declaration_Post_Op;
-----------------------------
-- A_Defining_Name_Post_Op --
-----------------------------
procedure A_Defining_Name_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
Enclosing_El_Kind : constant Flat_Element_Kinds := Get_Enclosing_Kind;
Colon_At : Natural := 0;
Adjust : Integer := 1;
begin
-- The problem with a defining name is that it can be followed by
-- some keyword(s) or delimiter (left parenthesis etc)
-- In case of a defining identifier in a defining expanded name we do
-- nothing leaving all the processing for the whole expanded name
if Enclosing_El_Kind = A_Defining_Expanded_Name or else
Is_Label (Element)
then
return;
end if;
Detect_Delimiter;
case Delimiter is
when Colon_Dlm =>
if Enclosing_El_Kind = A_Parameter_Specification then
Colon_At := Colon_Start_Pos;
elsif Enclosing_El_Kind = A_Discriminant_Specification and then
not Discriminants_On_Separate_Lines
then
-- Here we have the paragraph-specific colon position
-- computed, but this is meaningless if we have to place
-- the discriminants in one line)
Colon_At := 0;
else
Colon_At := Colon_In_Paragraph;
end if;
if Colon_At > 0 then
PP_Pad_Up_To (Colon_At);
elsif not RM_Style_Spacing
or else
Enclosing_El_Kind not in Flat_Statement_Kinds
then
PP_Continue_Line;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
case Enclosing_El_Kind is
when A_Discriminant_Specification |
A_Parameter_Specification |
A_Formal_Object_Declaration |
An_Object_Renaming_Declaration =>
-- Here we may have a null exclusion (Ada 2005)
Detect_Keyword;
while Keyword /= Not_A_KW loop
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
end loop;
PP_Continue_Line_Postponed;
when A_Component_Declaration |
A_Choice_Parameter_Specification =>
PP_Continue_Line;
when others =>
null;
end case;
when Comma_Dlm =>
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
case Enclosing_El_Kind is
when A_Loop_Statement .. A_Block_Statement =>
null;
when others =>
PP_Continue_Line;
end case;
when others =>
null;
end case;
Detect_Keyword;
-- ??? The rest should be rewritten on the base of standard keyword
-- processing
if Keyword = KW_Aliased then
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
end if;
case Keyword is
when KW_Is =>
if not (Is_New_Output_Line) then
PP_Space;
else
if Adds_Indentation (Enclosing_El_Kind) then
Adjust := -1;
else
Adjust := 0;
end if;
PP_New_Line (Adjust_Depth => Adjust);
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem
(Keep_Empty_Lines => Adds_Indentation (Enclosing_El_Kind));
Detect_Keyword;
case Keyword is
when KW_Begin =>
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
when KW_Private =>
if Enclosing_El_Kind = A_Package_Declaration
or else
Enclosing_El_Kind = A_Generic_Package_Declaration
then
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
end if;
when KW_New =>
if Enclosing_El_Kind in A_Flat_Generic_Instantiation
or else
Enclosing_El_Kind in A_Formal_Package_Declaration ..
A_Formal_Package_Declaration_With_Box
or else
Enclosing_El_Kind in A_Task_Type_Declaration ..
A_Protected_Type_Declaration
or else
Enclosing_El_Kind in A_Single_Task_Declaration ..
A_Single_Protected_Declaration
then
if Available_In_Output > 3 then
PP_Space;
else
PP_New_Continuation_Line;
end if;
PP_Keyword (KW_New);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
end if;
when KW_Tagged =>
if Available_In_Output > 7 then
PP_Space;
else
PP_New_Continuation_Line;
end if;
PP_Keyword (KW_Tagged);
Get_Next_Ada_Lexem;
when others =>
null;
end case;
when KW_Return |
KW_Renames |
KW_When =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
if Keyword = KW_Return then
-- Keyword = KW_Return here and in Ada 2005 we may have a null
-- exclusion:
Detect_Keyword;
while Keyword /= Not_A_KW loop
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
end loop;
end if;
PP_Continue_Line_Postponed;
when KW_Constant =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Delimiter;
if Delimiter = Assignment_Dlm then
if Available_In_Output > 3 then
PP_Space;
else
PP_New_Line (Adjust_Depth => 1);
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
end if;
when KW_Exception =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
if Keyword = KW_Renames then
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
end if;
when KW_In |
KW_Out |
KW_Access =>
if not (ASIS_2005_Mode
and then
Keyword = KW_Access)
then
if Enclosing_El_Kind = A_Loop_Parameter_Specification or else
Enclosing_El_Kind = An_Entry_Index_Specification
then
PP_Continue_Line;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
Detect_Keyword;
if Keyword /= Not_A_KW then
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
end if;
end if;
when KW_Declare |
KW_Begin |
KW_Loop |
KW_For |
KW_While =>
-- block statement, something similar should be for named loops
-- ??? What about labels???
if Separate_Line_For_Stmt_Name then
PP_New_Line (Adjust_Depth => -1);
elsif not Compact_Layout then
Increase_Indentation;
PP_New_Line (Adjust_Depth => -1);
elsif not Is_New_Output_Line then
PP_Space;
else
PP_New_Line (Adjust_Depth => -1);
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem
(Keep_Empty_Lines => True);
if Keyword = KW_Declare then
Detect_Keyword;
if Keyword = KW_Begin then
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
end if;
when others =>
-- ??? non-implemented case
null;
end case;
end A_Defining_Name_Post_Op;
-------------------------------------------
-- A_Discrete_Subtype_Definition_Post_Op --
-------------------------------------------
procedure A_Discrete_Subtype_Definition_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Encl_Kind : constant Flat_Element_Kinds := Get_Enclosing_Kind;
begin
Detect_Delimiter;
case Delimiter is
when Comma_Dlm =>
PP_Delimiter (Comma_Dlm);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
when Right_Parenthesis_Dlm =>
PP_Delimiter (Right_Parenthesis_Dlm);
Get_Next_Ada_Lexem;
if not (Encl_Kind = An_Entry_Declaration or else
Encl_Kind = An_Entry_Index_Specification)
then
if Start_Index_Def_From_New_Line then
PP_New_Line_For_Index_Def;
else
PP_Space;
end if;
PP_Keyword (KW_Of);
Get_Next_Ada_Lexem;
Detect_Keyword;
if Keyword = KW_Aliased then
if Available_In_Output > 7 then
PP_Space;
else
PP_New_Line_For_Index_Def;
end if;
PP_Continue_Line_Postponed;
PP_Keyword (KW_Aliased);
Get_Next_Ada_Lexem;
end if;
-- ???This will not work correctly for long lines
end if;
when others =>
null;
end case;
end A_Discrete_Subtype_Definition_Post_Op;
------------------------------------------
-- A_Discriminant_Specification_Post_Op --
------------------------------------------
procedure A_Discriminant_Specification_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Detect_Delimiter;
if Delimiter = Semicolon_Dlm then
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
end if;
end A_Discriminant_Specification_Post_Op;
----------------------------------
-- A_Formal_Declaration_Post_Op --
----------------------------------
procedure A_Formal_Declaration_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
begin
Is_First_Parameter_Spec := True;
if Arg_Kind = A_Formal_Procedure_Declaration and then
Default_Kind (Element) = A_Box_Default
then
PP_Continue_Line;
PP_Delimiter (Box_Dlm);
Get_Next_Ada_Lexem;
elsif Arg_Kind = A_Formal_Package_Declaration_With_Box then
PP_Delimiter (Box_Dlm);
Get_Next_Ada_Lexem;
PP_Delimiter (Right_Parenthesis_Dlm);
Get_Next_Ada_Lexem;
end if;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
-- Check if we have an abstract subprogram
if Trait_Kind (Element) = An_Abstract_Trait then
-- "is" is already printed out
if Available_In_Output >= 10 then
PP_Continue_Line;
else
PP_New_Continuation_Line;
end if;
PP_Keyword (KW_Abstract);
Get_Next_Ada_Lexem;
end if;
PP_Delimiter (Semicolon_Dlm);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
Detect_Keyword;
case Keyword is
when KW_Procedure |
KW_Function |
KW_Package =>
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
if Keyword = KW_Procedure or else
Keyword = KW_Function
then
Decrease_Indentation;
end if;
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
when others =>
null;
end case;
end A_Formal_Declaration_Post_Op;
----------------------------------------------
-- A_Formal_Derived_Type_Definition_Post_Op --
----------------------------------------------
procedure A_Formal_Derived_Type_Definition_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Detect_Keyword;
if Keyword = KW_Private then
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
end if;
end A_Formal_Derived_Type_Definition_Post_Op;
-----------------------------
-- A_Function_Call_Post_Op --
-----------------------------
procedure A_Function_Call_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
An_Expression_Post_Op (Element, Control, State);
end A_Function_Call_Post_Op;
---------------------------------
-- A_General_Statement_Post_Op --
---------------------------------
procedure A_General_Statement_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
PP_Delimiter (Semicolon_Dlm);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
Detect_Keyword;
if Keyword = KW_Exception then
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
end A_General_Statement_Post_Op;
---------------------------------------
-- A_Known_Discriminant_Part_Post_Op --
---------------------------------------
procedure A_Known_Discriminant_Part_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Right_Parenthesis_Dlm);
Get_Next_Ada_Lexem;
Detect_Keyword;
if Keyword = KW_Is then
if Discriminants_On_Separate_Lines or else
Available_In_Output < 3
then
PP_New_Line;
else
PP_Space;
end if;
PP_Keyword (KW_Is);
Get_Next_Ada_Lexem;
end if;
if Get_Enclosing_Kind = A_Tagged_Incomplete_Type_Declaration then
if Available_In_Output > 7 then
PP_Space;
else
PP_New_Continuation_Line;
end if;
PP_Keyword (KW_Tagged);
Get_Next_Ada_Lexem;
end if;
end A_Known_Discriminant_Part_Post_Op;
--------------------------------------------
-- A_Loop_Parameter_Specification_Post_Op --
--------------------------------------------
procedure A_Loop_Parameter_Specification_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
if not Separate_Line_For_THEN_and_LOOP
and then
Available_In_Output > 5
and then
(Last_Loop_Start = Current_Out_Line
or else
No_Separate_Line_For_THEN_and_LOOP)
then
PP_Continue_Line;
else
PP_New_Line (Adjust_Depth => -1);
end if;
PP_Keyword (KW_Loop);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end A_Loop_Parameter_Specification_Post_Op;
-------------------------------
-- A_Named_Statement_Post_Op --
-------------------------------
procedure A_Named_Statement_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Control);
pragma Unreferenced (State);
-- ??? We should think about possible unification of post-ops for
-- ??? constructs which end with 'end [name];'
Decrease_Indentation;
PP_New_Line;
PP_Keyword (KW_End);
Get_Next_Ada_Lexem;
Detect_Keyword;
if Keyword = KW_Loop then
if Is_New_Output_Line then
PP_New_Continuation_Line;
else
PP_Space;
end if;
PP_Keyword (KW_Loop);
Get_Next_Ada_Lexem;
end if;
Detect_Delimiter;
if Delimiter = Not_A_Dlm then
-- In the legal Ada code there can be only the block or loop name
if not Is_New_Output_Line then
PP_Space;
else
PP_New_Continuation_Line;
end if;
PP_Word (Capitalize (Statement_Identifier (Element), PP_Name_Casing));
Get_Next_Ada_Lexem;
end if;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Semicolon_Dlm);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
if not Compact_Layout
and then
not Separate_Line_For_Stmt_Name
and then
Asis.Statements.Is_Name_Repeated (Element)
then
Decrease_Indentation;
end if;
Detect_Keyword;
if Keyword = KW_Exception then
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
end A_Named_Statement_Post_Op;
---------------------------------------
-- A_Parameter_Specification_Post_Op --
---------------------------------------
procedure A_Parameter_Specification_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Ident : Integer := 0;
New_Line_Adjust : Integer := 0;
Tmp_El : Asis.Element := Nil_Element;
Tmp_Len : Natural;
Tmp_Bool : Boolean;
pragma Warnings (Off, Tmp_Bool);
-- Next_Space is used as placeholder parameter in the call to
-- Detect_Possible_Layout
begin
case Get_Enclosing_Kind is
when A_Procedure_Declaration |
A_Null_Procedure_Declaration |
A_Function_Declaration |
A_Formal_Procedure_Declaration |
A_Formal_Function_Declaration |
A_Procedure_Renaming_Declaration |
A_Function_Renaming_Declaration |
An_Entry_Declaration |
A_Procedure_Body_Stub |
A_Function_Body_Stub |
A_Generic_Procedure_Declaration |
A_Generic_Function_Declaration |
An_Access_To_Procedure |
An_Access_To_Protected_Procedure |
An_Access_To_Function |
An_Access_To_Protected_Function |
An_Anonymous_Access_To_Procedure |
An_Anonymous_Access_To_Protected_Procedure |
An_Anonymous_Access_To_Function |
An_Anonymous_Access_To_Protected_Function =>
Ident := 1;
when others =>
New_Line_Adjust := -1;
null;
end case;
Detect_Delimiter;
case Delimiter is
when Semicolon_Dlm =>
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Semicolon_Dlm);
Get_Next_Ada_Lexem;
if not Par_Spec_On_Separate_Lines then
PP_Continue_Line (Adjust_New_Line_Depth => New_Line_Adjust);
end if;
when Right_Parenthesis_Dlm =>
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Right_Parenthesis_Dlm);
Get_Next_Ada_Lexem;
when others =>
null;
end case;
-- In Ada 2005 we may have something like
--
-- Put_Message : access procedure (Msg : in String) :=
-- Ada.Text_IO.Put_Line'Access;
--
-- so:
Detect_Delimiter;
if Delimiter = Assignment_Dlm then
if Available_In_Output > 3 then
PP_Space;
else
PP_New_Line (Adjust_Depth => 1);
end if;
PP_Delimiter (Assignment_Dlm);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
end if;
Detect_Keyword;
case Keyword is
when KW_Return =>
if Par_Spec_On_Separate_Lines then
PP_New_Line (Adjust_Depth => Ident);
else
PP_Continue_Line;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
-- Here we may have a null exclusion (Ada 2005)
if Is_Not_Null_Return (Get_Enclosing_Element) then
Detect_Keyword;
while Keyword /= Not_A_KW loop
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
end loop;
end if;
if not Is_New_Output_Line then
if Flat_Element_Kind (Get_Enclosing_Element) =
An_Access_To_Function
or else
Flat_Element_Kind (Get_Enclosing_Element) in
An_Anonymous_Access_To_Function ..
An_Anonymous_Access_To_Protected_Function
or else
Flat_Element_Kind (Get_Enclosing_Element) in
A_Formal_Access_To_Function ..
A_Formal_Access_To_Protected_Function
then
Tmp_El :=
Access_To_Function_Result_Profile (Get_Enclosing_Element);
else
Tmp_El := Result_Profile (Get_Enclosing_Element);
end if;
Detect_Possible_Layout
(The_Element => Tmp_El,
Space_In_Output => Tmp_Len,
Comment_Inside => Tmp_Bool);
if Colon_Start_Pos + 1 + Tmp_Len + 1 < Max_Line_Length then
PP_Pad_Up_To (Colon_Start_Pos + 1);
end if;
if Definition_Kind (Tmp_El) = An_Access_Definition then
Detect_Keyword;
while Keyword /= Not_A_KW loop
PP_Continue_Line;
if Colon_Start_Pos /= 0 then
PP_Space;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
end loop;
end if;
end if;
when KW_Renames |
KW_When =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
if Keyword = KW_Renames then -- ??? Not a good solution!!!
PP_Continue_Line_Postponed;
end if;
when KW_Is =>
if Get_Enclosing_Kind = A_Formal_Procedure_Declaration
or else
Get_Enclosing_Kind = A_Null_Procedure_Declaration
then
Ident := 0;
else
Ident := -1;
end if;
if (Par_Spec_On_Separate_Lines
and then
Separate_Line_For_IS)
or else
Available_In_Output < 3
or else
Is_New_Output_Line
then
PP_New_Line (Adjust_Depth => Ident);
else
PP_Continue_Line;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
Detect_Keyword;
case Keyword is
when KW_Begin =>
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (KW_Begin);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
when KW_Null =>
-- Ada 2005 null procedure:
if Available_In_Output >= 5 then
PP_Continue_Line;
else
PP_New_Continuation_Line;
end if;
PP_Keyword (KW_Null);
Get_Next_Ada_Lexem;
when others =>
null;
end case;
when KW_Do =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
when others =>
null;
end case;
end A_Parameter_Specification_Post_Op;
--------------------
-- A_Path_Post_Op --
--------------------
procedure A_Path_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Decrease_Indentation;
end A_Path_Post_Op;
----------------------
-- A_Pragma_Post_Op --
----------------------
procedure A_Pragma_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Control);
pragma Unreferenced (State);
Finalize_Declaration (Element);
Prev_Element_Kind := Flat_Element_Kind (Element);
end A_Pragma_Post_Op;
--------------------------------------------
-- A_Private_Extension_Definition_Post_Op --
--------------------------------------------
procedure A_Private_Extension_Definition_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
-- Note that if we have a discriminant constraint, the WITH keyword
-- is not printed out by An_Expression_Post_Op (D105-004)
loop
Detect_Keyword;
if Available_In_Output > KW_Length (Keyword) then
PP_Continue_Line;
else
PP_New_Line (Adjust_Depth => 1);
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
exit when Keyword = KW_Private;
PP_Continue_Line;
end loop;
end A_Private_Extension_Definition_Post_Op;
----------------------------------------
-- A_Program_Unit_Declaration_Post_Op --
----------------------------------------
procedure A_Program_Unit_Declaration_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
begin
Is_First_Parameter_Spec := True;
Detect_Keyword;
if Keyword /= Not_A_KW then
-- Two possibilities:
-- - 'is separate'
-- - ''is abstract'
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
end if;
Finalize_Declaration (Element);
end A_Program_Unit_Declaration_Post_Op;
----------------------------
-- A_Program_Unit_Post_Op --
----------------------------
procedure A_Program_Unit_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
Name_Elem : Asis.Element := Element;
Casing : PP_Casing := PP_Name_Casing;
begin
Is_First_Parameter_Spec := True;
Decrease_Indentation;
-- We have to print out 'end [Name];
Detect_Keyword;
if Keyword = KW_End then
-- This code can also be applied to an accept statement which may not
-- have the trailing 'end' keyword!
PP_New_Line;
Skip_Blanks; -- ???
PP_Keyword (KW_End);
Get_Next_Ada_Lexem;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
if End_Labels or else Line_Buf (Line_Pos) /= ';' then
-- We have to reproduce the name in the end of the construct
if not Is_New_Output_Line then
PP_Space;
end if;
if Arg_Kind = An_Accept_Statement then
Name_Elem := Accept_Entry_Direct_Name (Element);
Name_Elem := Corresponding_Name_Definition (Name_Elem);
else
if Arg_Kind = A_Task_Definition or else
Arg_Kind = A_Protected_Definition
then
Name_Elem := Get_Enclosing_Element;
end if;
if Declaration_Kind (Name_Elem) in
A_Task_Body_Declaration .. A_Protected_Body_Declaration
then
if Is_Subunit (Name_Elem) then
Name_Elem := Corresponding_Body_Stub (Name_Elem);
end if;
Name_Elem := Corresponding_Declaration (Name_Elem);
end if;
if Declaration_Kind (Name_Elem) in
A_Task_Type_Declaration .. A_Protected_Type_Declaration
then
Casing := PP_Type_Casing;
end if;
Name_Elem := Def_Name (Name_Elem);
end if;
if Line_Buf (Line_Pos) /= ';' then
if Flat_Element_Kind (Name_Elem) in
Flat_Defining_Operator_Kinds
then
PP_Word
(Capitalize_Image
(Defining_Name_Image (Name_Elem), PP_Keyword_Casing));
else
PP_Word (Capitalize (Name_Elem, Casing));
end if;
Get_Next_Ada_Lexem;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
else
if Flat_Element_Kind (Name_Elem) in
Flat_Defining_Operator_Kinds
then
PP_Word_No_Move
(Capitalize_Image
(Defining_Name_Image (Name_Elem), PP_Keyword_Casing));
else
PP_Word_No_Move (Capitalize (Name_Elem, Casing));
end if;
end if;
end if;
end if;
Finalize_Declaration (Element);
end A_Program_Unit_Post_Op;
---------------------------------
-- A_Record_Definition_Post_Op --
---------------------------------
procedure A_Record_Definition_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Decrease_Indentation;
PP_New_Line;
PP_Keyword (KW_End);
Get_Next_Ada_Lexem;
PP_Continue_Line;
PP_Keyword (KW_Record);
Get_Next_Ada_Lexem;
if not Compact_Layout or else
Impose_Extra_Indentation
then
Decrease_Indentation;
end if;
end A_Record_Definition_Post_Op;
--------------------------------------------
-- A_Record_Representation_Clause_Post_Op --
--------------------------------------------
procedure A_Record_Representation_Clause_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Control);
pragma Unreferenced (State);
Decrease_Indentation;
PP_New_Line;
PP_Keyword (KW_End);
Get_Next_Ada_Lexem;
PP_Continue_Line;
PP_Keyword (KW_Record);
Get_Next_Ada_Lexem;
if not Compact_Layout then
Decrease_Indentation;
end if;
Finalize_Declaration (Element);
end A_Record_Representation_Clause_Post_Op;
--------------------------------------------
-- A_Requeue_Statement_With_Abort_Post_Op --
--------------------------------------------
procedure A_Requeue_Statement_With_Abort_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State) is
begin
PP_Continue_Line;
PP_Keyword (KW_Abort);
Get_Next_Ada_Lexem;
A_General_Statement_Post_Op (Element, Control, State);
end A_Requeue_Statement_With_Abort_Post_Op;
----------------------------------
-- A_Subtype_Indication_Post_Op --
----------------------------------
procedure A_Subtype_Indication_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Detect_Delimiter;
case Delimiter is
when Assignment_Dlm =>
if Available_In_Output > 3 then
PP_Space;
else
PP_New_Line (Adjust_Depth => 1);
end if;
PP_Delimiter (Assignment_Dlm);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
when Comma_Dlm =>
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
when others =>
null;
end case;
end A_Subtype_Indication_Post_Op;
--------------------------
-- A_Use_Clause_Post_Op --
--------------------------
procedure A_Use_Clause_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
-- ??? Compare with A_Declaration_Post_Op
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
List_Start_Stack.Pop;
if Get_Enclosing_Kind in A_Flat_Generic_Declaration and then
Is_Part_Of_Generic_Formal_Part (Element)
then
A_Formal_Declaration_Post_Op (Element, Control, State);
else
Finalize_Declaration (Element);
end if;
end A_Use_Clause_Post_Op;
----------------------------
-- An_Association_Post_Op --
----------------------------
procedure An_Association_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
Pref : Asis.Element;
Is_Pref_Call : Boolean := False;
begin
if Arg_Kind = A_Parameter_Association then
Is_Pref_Call :=
Get_Enclosing_Kind /= A_Function_Call or else
Is_Prefix_Call (Get_Enclosing_Element);
if Is_First_Par_Association then
if not Is_Pref_Call then
Pref := Prefix (Get_Enclosing_Element);
if not Is_Unary (Flat_Element_Kind (Pref)) then
if Operator_Len (Pref) + 1 <= Available_In_Output then
PP_Space;
else
PP_New_Line_And_Pad (Start_Par_Pos);
end if;
PP_Operator (Flat_Element_Kind (Pref));
Get_Next_Ada_Lexem;
if not Pars_On_Sep_Lines then
PP_Continue_Line; -- ???
end if;
return;
end if;
end if;
end if;
end if;
Detect_Delimiter;
case Delimiter is
when Comma_Dlm =>
if not (Arg_Kind = A_Parameter_Association
and then not Is_Pref_Call)
then
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Comma_Dlm);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
if not (((Arg_Kind = A_Parameter_Association or else
Arg_Kind = A_Pragma_Argument_Association)
and then
Pars_On_Sep_Lines)
or else
((Arg_Kind in A_Record_Component_Association ..
An_Array_Component_Association
or else
Arg_Kind = A_Discriminant_Association)
and then
Comp_Asctns_On_Sep_Lines)
or else
(Arg_Kind = A_Generic_Association and then
Generic_Associations_On_Separate_Lines))
then
PP_Continue_Line;
end if;
end if;
when Right_Parenthesis_Dlm =>
if not (Arg_Kind = A_Parameter_Association and then
not Is_Pref_Call)
then
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
if Arg_Kind /= A_Discriminant_Association then
PP_Delimiter (Right_Parenthesis_Dlm);
Get_Next_Ada_Lexem;
end if;
end if;
when others =>
null;
end case;
end An_Association_Post_Op;
--------------------------
-- An_Attribute_Post_Op --
--------------------------
procedure An_Attribute_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
begin
Detect_Delimiter;
if Delimiter = Right_Parenthesis_Dlm
and then
(Arg_Kind = A_First_Attribute or else
Arg_Kind = A_Last_Attribute or else
Arg_Kind = A_Length_Attribute or else
Arg_Kind = A_Range_Attribute or else
Arg_Kind = An_Implementation_Defined_Attribute or else
Arg_Kind = An_Unknown_Attribute)
and then
not Is_Nil (Attribute_Designator_Expressions (Element))
then
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
end if;
An_Expression_Post_Op (Element, Control, State);
end An_Attribute_Post_Op;
------------------------------------------
-- An_Entry_Index_Specification_Post_Op --
------------------------------------------
procedure An_Entry_Index_Specification_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
Detect_Keyword;
if Keyword = KW_When then
-- entry with no parameter
PP_Continue_Line;
PP_Keyword (KW_When);
Get_Next_Ada_Lexem;
PP_Continue_Line;
end if;
end An_Entry_Index_Specification_Post_Op;
--------------------------------------------
-- An_Enumeration_Type_Definition_Post_Op --
--------------------------------------------
procedure An_Enumeration_Type_Definition_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Right_Parenthesis_Dlm);
Get_Next_Ada_Lexem;
end An_Enumeration_Type_Definition_Post_Op;
-------------------------------------
-- An_Explicit_Dereference_Post_Op --
-------------------------------------
procedure An_Explicit_Dereference_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Keyword (KW_All);
Get_Next_Ada_Lexem;
An_Expression_Post_Op (Element, Control, State);
end An_Explicit_Dereference_Post_Op;
---------------------------
-- An_Expression_Post_Op --
---------------------------
procedure An_Expression_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
Encl_Elmt : constant Asis.Element := Get_Enclosing_Element;
Encl_Kind : Flat_Element_Kinds := Get_Enclosing_Kind;
Delim_At : Natural := 0;
function Not_Need_Left_Par_Printed return Boolean;
-- Describes the condition when the left parenthesis should not be
-- printed here. Just a patch, should go away at some point
function Is_From_Anc_Part return Boolean;
-- Checks if Element is an ancestor part of the extension aggregate or
-- a component thereof. In case if this function returns True, as a
-- side-effect it sets Extension_Aggr (below) to the corresponding
-- extension aggregate. Otherwise Extension_Aggr is set to Nil_Element
-- function Choices_Need_Splitting return Boolean;
-- -- It is supposed to be called after printing out the separator in the
-- -- choces list of an aggregate. Tries to figure out if choices
-- -- indeed should be split.
-- Split_Choices : Boolean := TRue;
Extension_Aggr : Asis.Element;
Tmp_El : Asis.Element;
Needed_Space : Natural;
Contains_Comments : Boolean;
pragma Warnings (Off, Contains_Comments);
-- Next_Space is used as placeholder parameter in the call to
-- Detect_Possible_Layout
----------------------------
-- Choices_Need_Splitting --
----------------------------
-- function Choices_Need_Splitting return Boolean is
-- Step_To_Vert_Bar : Natural := 1;
-- Step_To_Arrow : Natural := 1;
-- Tmp : Traversal_Step_Record;
-- Result : Boolean := True;
-- begin
-- Tmp := Top (Step_To_Vert_Bar);
-- while Element_Kind (Tmp.The_Element) /= An_Association loop
-- if Association_Kind (Tmp.The_Element) not in
-- A_Record_Component_Association .. An_Array_Component_Association
-- return Result
-- end if;
-- Step_To_Vert_Bar := Step_To_Vert_Bar + 1;
-- Tmp := Top (Step_To_Vert_Bar);
-- end loop;
-- Step_To_Arrow := Step_To_Vert_Bar + 1;
-- while not (Expression_Kind (Tmp.The_Element) = A_Record_Aggregate
-- or else
-- Expression_Kind (Tmp.The_Element) = A_Named_Array_Aggregate
-- or else
-- Expression_Kind (Tmp.The_Element) = An_Extension_Aggregate)
-- loop
-- Step_To_Arrow := Step_To_Arrow + 1;
-- Tmp := Top (Step_To_Vert_Bar);
-- end loop;
-- return Result;
-- end Choices_Need_Splitting;
----------------------
-- Is_From_Anc_Part --
----------------------
function Is_From_Anc_Part return Boolean is
Result : Boolean := False;
Steps_Up : Natural := 0;
Tmp_Kind : Flat_Element_Kinds := Get_Enclosing_Kind;
Tmp_El : Asis.Element;
begin
while not (Tmp_Kind = An_Extension_Aggregate
or else
Tmp_Kind not in Flat_Expression_Kinds)
loop
Steps_Up := Steps_Up + 1;
Tmp_Kind := Get_Enclosing_Kind (Steps_Up);
end loop;
if Tmp_Kind = An_Extension_Aggregate then
if Steps_Up > 0 then
Tmp_El := Get_Enclosing_Element (Steps_Up - 1);
else
Tmp_El := Element;
end if;
Extension_Aggr := Get_Enclosing_Element (Steps_Up);
Result :=
Is_Equal (Tmp_El,
Extension_Aggregate_Expression (Extension_Aggr));
end if;
return Result;
end Is_From_Anc_Part;
-------------------------------
-- Not_Need_Left_Par_Printed --
-------------------------------
function Not_Need_Left_Par_Printed return Boolean is
Result : Boolean := False;
Tmp, Tmp1 : Asis.Element;
begin
if Last_Dlm = Arrow_Dlm
or else
Last_KW = KW_At
then
Result := True;
elsif Is_Call (Encl_Elmt) or else
Encl_Kind in A_Flat_Generic_Instantiation or else
Encl_Kind = A_Formal_Package_Declaration or else
Encl_Kind = An_Exit_Statement
then
Result := True;
elsif Encl_Kind = A_Subtype_Indication and then
Flat_Element_Kind (Subtype_Constraint (Encl_Elmt)) =
A_Discriminant_Constraint
then
Result := True;
elsif Encl_Kind = A_Component_Clause then
Result := True;
else
Tmp1 := Encl_Elmt;
Tmp := Enclosing_Element (Encl_Elmt);
if not (Encl_Kind = An_Indexed_Component
or else
Encl_Kind = A_Type_Conversion)
and then
Is_Call (Tmp)
then
Result := True;
else
while Flat_Element_Kind (Tmp) in Flat_Expression_Kinds loop
Tmp1 := Tmp;
Tmp := Enclosing_Element (Tmp);
end loop;
if Flat_Element_Kind (Tmp) = A_Subtype_Indication
-- Something like
-- S : array (1 .. 10) of Integer range 1 .. G * 100
-- := ( 1 .. G => 13);
-- see D626-001
or else
(Flat_Element_Kind (Tmp) = An_Array_Component_Association
and then
(Flat_Element_Kind (Tmp1) in Flat_Discrete_Range_Kinds
or else
Flat_Element_Kind (Tmp1) = An_Others_Choice))
-- Something like
-- C : A := (-6 .. -4 => (4 .. 5 => S(2)));
-- see D707-008
then
Result := True;
end if;
end if;
end if;
return Result;
end Not_Need_Left_Par_Printed;
begin
if Encl_Kind = A_Selected_Component and then
Is_Equal (Element, Selector (Encl_Elmt))
then
-- everything should be done for the whole name
return;
end if;
loop
Detect_Delimiter;
case Delimiter is
when Not_A_Dlm =>
if Last_KW = KW_Range or else
Last_Dlm = Comma_Dlm or else
Last_Dlm = Dot_Dlm
then
exit;
end if;
when Semicolon_Dlm =>
-- This delimiter is processed in Pre- and Post-Operations for
-- specific constructs, except for a mod clause expression
if Encl_Kind = A_Record_Representation_Clause and then
Is_Equal (Element, Mod_Clause_Expression (Encl_Elmt))
then
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
exit;
when Right_Parenthesis_Dlm =>
if Encl_Kind = An_Unconstrained_Array_Definition or else
Encl_Kind = A_Formal_Unconstrained_Array_Definition or else
Encl_Kind = An_Accept_Statement
then
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if Start_Index_Def_From_New_Line then
PP_New_Line_For_Index_Def;
end if;
else
exit;
end if;
when Assignment_Dlm =>
if Encl_Kind not in Flat_Expression_Kinds then
Delim_At := Assign_Start_Pos;
if Delim_At = 0 then
Delim_At := Assign_In_Paragraph;
end if;
if Delim_At /= 0 and then
Delim_At > Output_Pos and then
Delim_At <= Max_Line_Length - 2
then
PP_Pad_Up_To (Delim_At);
else
if Available_In_Output > 3 then
PP_Space;
else
PP_New_Line (Adjust_Depth => 1);
end if;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
end if;
exit;
when Double_Dot_Dlm =>
if Encl_Kind in Flat_Expression_Kinds or else
Encl_Kind = A_Parameter_Association
then
exit;
end if;
PP_Continue_Line;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if not Start_Upper_Range_Expression_From_New_Line then
PP_Continue_Line_Postponed;
end if;
exit;
when Left_Parenthesis_Dlm =>
if Not_Need_Left_Par_Printed then
exit;
end if;
if Is_New_Output_Line then
PP_New_Continuation_Line;
elsif not RM_Style_Spacing then
PP_Space;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
exit;
when Dot_Dlm =>
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
exit;
when Comma_Dlm =>
case Encl_Kind is
when An_Abort_Statement |
A_Discrete_Range_Attribute_Reference |
An_Indexed_Component |
Flat_Context_Clause_Kinds |
An_Unconstrained_Array_Definition |
A_Formal_Unconstrained_Array_Definition |
A_Discrete_Simple_Expression_Range =>
null;
when others =>
exit;
end case;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if Start_Index_Def_From_New_Line then
PP_New_Line_For_Index_Def;
else
PP_Continue_Line_Postponed;
end if;
exit;
when Tick_Dlm =>
if (Encl_Kind in Flat_Attribute_Reference_Kinds and then
Is_Equal (Element, Prefix (Encl_Elmt)))
or else
(Encl_Kind = A_Qualified_Expression and then
Is_Equal (Element,
Converted_Or_Qualified_Subtype_Mark (Encl_Elmt)))
then
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
end if;
exit;
when Arrow_Dlm =>
if Encl_Kind in Flat_Expression_Kinds then
exit;
end if;
if Align_Arrow_As_Vert_Line then
Delim_At := Vert_Line_Start_Pos;
else
Delim_At := Arrow_Start_Pos;
end if;
if Delim_At > 0 then
PP_Pad_Up_To (Delim_At);
else
PP_Continue_Line;
end if;
PP_Delimiter (Arrow_Dlm);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
if Encl_Kind in Flat_Association_Kinds
or else
((Encl_Kind = A_Simple_Expression_Range or else
Encl_Kind = A_Discrete_Simple_Expression_Range or else
Encl_Kind = A_Discrete_Subtype_Indication)
and then
Get_Enclosing_Kind (1) in Flat_Association_Kinds)
then
PP_Continue_Line_Postponed;
end if;
Detect_Delimiter;
if Delimiter /= Box_Dlm then
exit;
end if;
when Box_Dlm =>
PP_Continue_Line;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
when Vertical_Line_Dlm |
Exclamation_Mark_Dlm =>
if Encl_Kind in Flat_Expression_Kinds then
exit;
elsif Encl_Kind in A_Discrete_Subtype_Indication ..
A_Discrete_Simple_Expression_Range
then
Encl_Kind := Get_Enclosing_Kind (1);
end if;
Delim_At := 0;
-- if Encl_Kind in A_Record_Component_Association ..
-- An_Array_Component_Association
-- then
-- Split_Choices := Choices_Need_Splitting;
-- end if;
if
-- Split_Choices
-- and then
Has_Choices (Encl_Kind)
and then
Choice_On_Separate_Line
then
Delim_At := Vert_Line_Start_Pos;
end if;
if Delim_At /= 0 then
PP_Pad_Up_To (Delim_At);
else
PP_Continue_Line;
end if;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if not Is_New_Output_Line then
if Delim_At /= 0 then
if Encl_Kind in A_Record_Component_Association ..
An_Array_Component_Association
then
PP_New_Line (1);
else
PP_New_Line;
end if;
else
PP_Continue_Line_Postponed;
end if;
end if;
exit;
when Plus_Dlm |
Asterisk_Dlm |
Minus_Dlm |
Divide_Dlm |
Double_Star_Dlm |
Ampersand_Dlm |
Equals_Dlm |
Inequality_Dlm |
Less_Than_Dlm |
Greater_Than_Dlm |
Greater_Or_Equal_Dlm |
Left_Label_Bracket_Dlm |
Less_Or_Equal_Dlm =>
exit;
when others =>
PP_Continue_Line;
PP_Delimiter (Delimiter);
Get_Next_Ada_Lexem;
if not Is_New_Output_Line then
PP_Space;
end if;
exit;
end case;
Detect_Keyword;
case Keyword is
when KW_Digits |
KW_Delta |
KW_Renames =>
if Available_In_Output > KW_Length (Keyword) then
PP_Space;
else
PP_New_Line (Adjust_Depth => 1);
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
exit;
when KW_In =>
if Available_In_Output > KW_Length (Keyword) then
PP_Continue_Line;
else
PP_New_Line (Adjust_Depth => 1);
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
exit;
when KW_Aliased |
KW_Do |
KW_All =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
exit;
when KW_With =>
if Available_In_Output > 5 then
PP_Continue_Line;
else
PP_New_Line;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line_Postponed;
if Is_From_Anc_Part
and then
Is_Nil (Record_Component_Associations (Extension_Aggr))
then
-- 'with null record' case
Detect_Keyword;
if Keyword = KW_Null then
if Comp_Asctns_On_Sep_Lines then
PP_New_Line (Adjust_Depth => 1);
PP_Pad_Up_To (Comp_Asctns_Start_Pos);
else
PP_Space;
end if;
PP_Keyword (KW_Null);
Get_Next_Ada_Lexem;
if Available_In_Output < 9 then
PP_New_Continuation_Line;
else
PP_Space;
end if;
PP_Keyword (KW_Record);
Get_Next_Ada_Lexem;
PP_Delimiter (Right_Parenthesis_Dlm);
end if;
end if;
exit;
when KW_At =>
if (Last_KW /= KW_Record
or else
Is_Nil (Mod_Clause_Expression (Get_Enclosing_Element (1))))
and then
Align_Ats
and then
At_In_Paragraph > 0
and then
At_In_Paragraph <= Max_Line_Length - 2
then
PP_Pad_Up_To (At_In_Paragraph);
else
PP_Continue_Line;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
when KW_Not =>
if Encl_Kind = A_Not_In_Membership_Test then
-- ??? Should be rewritten as an infix operation call
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
else
exit;
end if;
when KW_Is =>
if Encl_Kind in Flat_Expression_Kinds then
exit;
end if;
if Has_Parameters (Encl_Kind) and then
Par_Spec_On_Separate_Lines and then
Separate_Line_For_IS
then
if Trait_Kind (Encl_Elmt) = An_Abstract_Trait or else
Encl_Kind = A_Formal_Function_Declaration or else
Encl_Kind in A_Flat_Body_Stub
then
PP_New_Line;
else
PP_New_Line (Adjust_Depth => -1);
end if;
else
PP_Continue_Line;
end if;
PP_Keyword (Keyword);
case Encl_Kind is
when A_Case_Statement =>
-- This list is not complete!!!
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
when others =>
Get_Next_Ada_Lexem;
end case;
when KW_Of =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
when KW_Then =>
if Encl_Kind in Flat_Expression_Kinds or else
Encl_Kind in Flat_Association_Kinds
then
exit;
end if;
if not Separate_Line_For_THEN_and_LOOP
and then
Available_In_Output > 5
and then
(Last_If_Path_Start = Current_Out_Line
or else
No_Separate_Line_For_THEN_and_LOOP)
then
PP_Continue_Line;
else
PP_New_Line (Adjust_Depth => -1);
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
when KW_Begin =>
if Last_KW /= KW_Then then
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
exit;
when KW_Range =>
if In_Unconstrained_Array_Definition (Element) or else
Encl_Kind = A_Formal_Unconstrained_Array_Definition or else
Encl_Kind = A_Discrete_Subtype_Indication or else
Encl_Kind = A_Component_Clause or else
Encl_Kind = A_Digits_Constraint or else
Encl_Kind = A_Delta_Constraint
then
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
if Encl_Kind = A_Component_Clause then
PP_Continue_Line;
end if;
else
exit;
end if;
when KW_Loop =>
if Encl_Kind = A_While_Loop_Statement then
if not Separate_Line_For_THEN_and_LOOP
and then
Available_In_Output > 5
and then
(Last_Loop_Start = Current_Out_Line
or else
No_Separate_Line_For_THEN_and_LOOP)
then
PP_Continue_Line;
else
PP_New_Line (Adjust_Depth => -1);
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
exit;
when KW_When =>
if Encl_Kind = An_Exit_Statement then
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
else
exit;
end if;
when KW_New |
KW_Abs |
KW_Access |
KW_Null |
KW_Generic |
KW_Separate |
KW_Abstract |
KW_Goto |
KW_Exit |
KW_Case |
KW_If |
KW_For |
KW_While |
KW_Function |
KW_Procedure |
KW_Declare |
KW_Package |
KW_Pragma |
KW_Type |
KW_Subtype |
KW_Raise |
KW_Return |
KW_Select |
KW_Abort |
KW_Delay |
KW_Accept |
KW_Mod |
KW_Rem |
KW_Xor |
KW_Requeue =>
exit;
when KW_And =>
if Is_And_Then_Arg then
if Pars_On_Sep_Lines then
PP_New_Line_And_Pad (Short_Circuit_Padding);
else
PP_Continue_Line;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
PP_Keyword (KW_Then);
Get_Next_Ada_Lexem;
if not Pars_On_Sep_Lines then
PP_Continue_Line_Postponed;
end if;
else
case Encl_Kind is
when A_Derived_Record_Extension_Definition |
Flat_Interface_Kinds |
A_Formal_Derived_Type_Definition |
Flat_Formal_Interface_Kinds |
A_Private_Extension_Definition |
A_Private_Type_Declaration |
A_Task_Type_Declaration |
A_Protected_Type_Declaration |
A_Single_Task_Declaration |
A_Single_Protected_Declaration |
A_Subtype_Indication =>
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
when others =>
null;
end case;
end if;
exit;
when KW_Or =>
if Is_Or_Else_Arg then
if Pars_On_Sep_Lines then
PP_New_Line_And_Pad (Short_Circuit_Padding);
else
PP_Continue_Line;
end if;
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
PP_Keyword (KW_Else);
Get_Next_Ada_Lexem;
if not Pars_On_Sep_Lines then
PP_Continue_Line_Postponed;
end if;
end if;
exit;
when KW_Use =>
-- representation clause or use clause?
if Encl_Kind in Flat_Representation_Clause_Kinds then
if Encl_Kind = An_Attribute_Definition_Clause or else
Encl_Kind = An_At_Clause
then
Tmp_El := Representation_Clause_Expression (Encl_Elmt);
end if;
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
if Encl_Kind = An_Enumeration_Representation_Clause then
PP_Continue_Line_Postponed;
exit;
elsif Encl_Kind = An_At_Clause then
PP_Continue_Line;
PP_Keyword (KW_At);
Get_Next_Ada_Lexem;
end if;
Detect_Possible_Layout
(The_Element => Tmp_El,
Space_In_Output => Needed_Space,
Comment_Inside => Contains_Comments);
if Needed_Space + 1 <= Available_In_Output then
PP_Continue_Line_Postponed;
else
PP_New_Continuation_Line;
end if;
if Encl_Kind = An_Attribute_Definition_Clause then
exit;
end if;
else
exit;
end if;
when KW_Record =>
-- record representation clause
if not Compact_Layout then
Increase_Indentation;
PP_New_Line;
else
if Available_In_Output > 6 then
PP_Space;
else
PP_New_Line;
end if;
end if;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
if Keyword = KW_At then
-- mod clause
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
Detect_Keyword;
PP_Continue_Line;
PP_Keyword (Keyword);
Get_Next_Ada_Lexem;
PP_Continue_Line;
end if;
Increase_Indentation;
exit;
when others =>
-- If we didn't consume a delimiter or a keyword, then we need
-- to exit; otherwise, this will be an infinite loop.
if Delimiter = Not_A_Dlm then
exit;
end if;
end case;
if Delimiter = Not_A_Dlm
and then
(Keyword = Not_A_KW or else
-- We have to allow to use Ada 2005 keywords as identifiers in
-- Ada 95 programs, see F406-003
Keyword = KW_Overriding or else
Keyword = KW_Interface or else
Keyword = KW_Synchronized)
then
exit;
end if;
end loop;
end An_Expression_Post_Op;
------------------------------------------
-- An_Extended_Return_Statement_Post_Op --
------------------------------------------
procedure An_Extended_Return_Statement_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
pragma Unreferenced (Control);
pragma Unreferenced (State);
begin
Decrease_Indentation;
Detect_Keyword;
if Keyword = KW_End then
PP_New_Line;
Skip_Blanks; -- ???
PP_Keyword (KW_End);
Get_Next_Ada_Lexem;
PP_Continue_Line;
PP_Keyword (KW_Return);
Get_Next_Ada_Lexem;
end if;
Finalize_Declaration (Element);
end An_Extended_Return_Statement_Post_Op;
---------------------------------
-- An_Index_Constraint_Post_Op --
---------------------------------
procedure An_Index_Constraint_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
if Is_New_Output_Line then
PP_Pad (List_Start_Stack.Top);
end if;
PP_Delimiter (Right_Parenthesis_Dlm);
List_Start_Stack.Pop;
Get_Next_Ada_Lexem;
-- The rest is for the constraint that is a part of
-- A_Return_Object_Declaration
Detect_Keyword;
if Keyword = KW_Do then
PP_Continue_Line;
PP_Keyword (KW_Do);
Get_Next_Ada_Lexem;
end if;
end An_Index_Constraint_Post_Op;
----------------------------------
-- An_Indexed_Component_Post_Op --
----------------------------------
procedure An_Indexed_Component_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
Is_Double_Dot : constant Boolean := Delimiter = Double_Dot_Dlm;
begin
-- ??? Also used for A_Type_Conversion and A_Qualified_Expression
if not (Flat_Element_Kind (Element) = A_Qualified_Expression and then
Flat_Element_Kind (Converted_Or_Qualified_Expression (Element))
in A_Record_Aggregate .. A_Named_Array_Aggregate and then
not A4G.Skip_TB.Needs_Extra_Parentheses
(Converted_Or_Qualified_Expression (Element)))
then
if Is_New_Output_Line then
PP_New_Continuation_Line;
end if;
PP_Delimiter (Right_Parenthesis_Dlm);
if Is_Double_Dot then
Line_Pos := Line_Pos - 1;
PP_Delimiter (Double_Dot_Dlm);
end if;
Get_Next_Ada_Lexem;
end if;
An_Expression_Post_Op (Element, Control, State);
end An_Indexed_Component_Post_Op;
----------------------
-- Clean_List_Stack --
----------------------
procedure Clean_List_Stack
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
pragma Unreferenced (Element);
pragma Unreferenced (Control);
pragma Unreferenced (State);
List_Start_Stack.Pop;
end Clean_List_Stack;
--------------------------
-- Finalize_Declaration --
--------------------------
procedure Finalize_Declaration (Element : Asis.Element) is
Arg_Kind : constant Flat_Element_Kinds := Flat_Element_Kind (Element);
begin
if Arg_Kind = A_Task_Definition or else
Arg_Kind = A_Protected_Definition
then
-- For A_Task_Definition the declaration post-op is used
return;
end if;
PP_Delimiter (Semicolon_Dlm);
if Add_FF and then Arg_Kind = A_Page_Pragma then
PP_Word_No_Move (To_Wide_String (String'(1 => ASCII.FF)));
end if;
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
Detect_Keyword;
case Keyword is
when KW_Begin |
KW_Private |
KW_Exception =>
if Get_Enclosing_Kind /= Not_An_Element then
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
when KW_Procedure |
KW_Function |
KW_Package =>
if Flat_Element_Kind (Element) in A_Flat_Formal_Declaration
or else
Is_Last_Pragma_In_Formal_Part (Element)
then
PP_New_Line (Adjust_Depth => -1);
PP_Keyword (Keyword);
Get_Next_Ada_Lexem (Keep_Empty_Lines => True);
end if;
when others =>
null;
end case;
end Finalize_Declaration;
-- Ada 2012:
-------------------------------------------------
-- A_Generalized_Iterator_Specification_Post_Op --
-------------------------------------------------
procedure A_Generalized_Iterator_Specification_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end A_Generalized_Iterator_Specification_Post_Op;
----------------------------------------------
-- An_Element_Iterator_Specification_Post_Op --
----------------------------------------------
procedure An_Element_Iterator_Specification_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end An_Element_Iterator_Specification_Post_Op;
-----------------------------------------------
-- An_Expression_Function_Declaration_Post_Op --
-----------------------------------------------
procedure An_Expression_Function_Declaration_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end An_Expression_Function_Declaration_Post_Op;
-------------------------------------------------
-- A_Formal_Incomplete_Type_Declaration_Post_Op --
-------------------------------------------------
procedure A_Formal_Incomplete_Type_Declaration_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end A_Formal_Incomplete_Type_Declaration_Post_Op;
------------------------------------
-- An_Aspect_Specification_Post_Op --
------------------------------------
procedure An_Aspect_Specification_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end An_Aspect_Specification_Post_Op;
------------------------------
-- A_Case_Expression_Post_Op --
------------------------------
procedure A_Case_Expression_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end A_Case_Expression_Post_Op;
-----------------------------
-- An_If_Expression_Post_Op --
-----------------------------
procedure An_If_Expression_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end An_If_Expression_Post_Op;
--------------------------------------------
-- A_For_All_Quantified_Expression_Post_Op --
--------------------------------------------
procedure A_For_All_Quantified_Expression_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end A_For_All_Quantified_Expression_Post_Op;
---------------------------------------------
-- A_For_Some_Quantified_Expression_Post_Op --
---------------------------------------------
procedure A_For_Some_Quantified_Expression_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end A_For_Some_Quantified_Expression_Post_Op;
-----------------------------------
-- A_Case_Expression_Path_Post_Op --
-----------------------------------
procedure A_Case_Expression_Path_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end A_Case_Expression_Path_Post_Op;
----------------------------------
-- An_If_Expression_Path_Post_Op --
----------------------------------
procedure An_If_Expression_Path_Post_Op
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out Source_Traversal_State)
is
begin
Non_Implemented_ASIS_2005_Feature (Element, Control, State);
end An_If_Expression_Path_Post_Op;
end GNATPP.Post_Operations;
|