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
|
/* Tags file maker to go with GNU Emacs
Copyright (C) 1984, 87, 88, 89, 93, 94, 95
Free Software Foundation, Inc. and Ken Arnold
This file is not considered part of GNU Emacs.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY 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
along with this program; if not, write to the Free Software Foundation,
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/*
* Authors:
* Ctags originally by Ken Arnold.
* Fortran added by Jim Kleckner.
* Ed Pelegri-Llopart added C typedefs.
* Gnu Emacs TAGS format and modifications by RMS?
* Sam Kendall added C++.
* Francesco Potorti` reorganised C and C++ based on work by Joe Wells.
* Regexp tags by Tom Tromey.
*
* Francesco Potorti` (F.Potorti@cnuce.cnr.it) is the current maintainer.
*/
char pot_etags_version[] = "@(#) pot revision number is 12.28";
/* Prototyping magic snarfed from gmalloc.c */
#if defined (__cplusplus) || defined (__STDC__)
#undef PP
#define PP(args) args
#undef __ptr_t
#define __ptr_t void *
#else /* Not C++ or ANSI C. */
#undef PP
#define PP(args) ()
#undef const
#define const
#undef __ptr_t
#define __ptr_t char *
#endif /* C++ or ANSI C. */
#ifdef HAVE_CONFIG_H
# include <config.h>
/* On some systems, Emacs defines static as nothing for the sake
of unexec. We don't want that here since we don't use unexec. */
# undef static
# define ETAGS_REGEXPS /* use the regexp features */
# define LONG_OPTIONS /* accept long options */
#endif /* HAVE_CONFIG_H */
#define TRUE 1
#define FALSE 0
#ifndef DEBUG
# define DEBUG FALSE
#endif
#ifdef WIN32_NATIVE
# include <stdlib.h>
# include <fcntl.h>
# include <string.h>
# include <io.h>
# define MAXPATHLEN _MAX_PATH
# ifndef HAVE_CONFIG_H
# define HAVE_GETCWD
# endif /* not HAVE_CONFIG_H */
#endif /* WIN32_NATIVE */
#if !defined (WIN32_NATIVE) && defined (STDC_HEADERS)
#include <stdlib.h>
#include <string.h>
#endif
#ifdef HAVE_UNISTD_H
# include <unistd.h>
#else
# ifdef HAVE_GETCWD
extern char *getcwd ();
# endif
#endif /* HAVE_UNISTD_H */
#include <stdio.h>
#include <ctype.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/stat.h>
#if !defined (S_ISREG) && defined (S_IFREG)
# define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
#endif
#ifdef LONG_OPTIONS
# include <getopt.h>
#else
# define getopt_long(argc,argv,optstr,lopts,lind) getopt (argc, argv, optstr)
extern char *optarg;
extern int optind, opterr;
#endif /* LONG_OPTIONS */
#ifdef ETAGS_REGEXPS
# include <regex.h>
#endif /* ETAGS_REGEXPS */
/* Define CTAGS to make the program "ctags" compatible with the usual one.
Leave it undefined to make the program "etags", which makes emacs-style
tag tables and tags typedefs, #defines and struct/union/enum by default. */
#ifdef CTAGS
# undef CTAGS
# define CTAGS TRUE
#else
# define CTAGS FALSE
#endif
/* Exit codes for success and failure. */
#ifdef VMS
# define GOOD 1
# define BAD 0
#else
# define GOOD 0
# define BAD 1
#endif
/* C extensions. */
#define C_PLPL 0x00001 /* C++ */
#define C_STAR 0x00003 /* C* */
#define C_JAVA 0x00005 /* JAVA */
#define YACC 0x10000 /* yacc file */
#define streq(s,t) ((DEBUG && (s) == NULL && (t) == NULL \
&& (abort (), 1)) || !strcmp (s, t))
#define strneq(s,t,n) ((DEBUG && (s) == NULL && (t) == NULL \
&& (abort (), 1)) || !strncmp (s, t, n))
#define lowcase(c) tolower ((char)c)
#define CHARS 256 /* 2^sizeof(char) */
#define CHAR(x) ((unsigned int)x & (CHARS - 1))
#define iswhite(c) (_wht[CHAR(c)]) /* c is white */
#define notinname(c) (_nin[CHAR(c)]) /* c is not in a name */
#define begtoken(c) (_btk[CHAR(c)]) /* c can start token */
#define intoken(c) (_itk[CHAR(c)]) /* c can be in token */
#define endtoken(c) (_etk[CHAR(c)]) /* c ends tokens */
/*#ifdef INFODOCK*/
/*#undef OO_BROWSER*/
/* Due to the way this file is constructed, this unfortunately doesn't */
/* work except for documentation purposes. -slb */
#define OO_BROWSER 1
/*#endif*/
#ifdef OO_BROWSER
#define set_construct(construct) \
if (!oo_browser_construct) oo_browser_construct = construct
void oo_browser_clear_all_globals(void);
void oo_browser_clear_some_globals(void);
void oo_browser_check_and_clear_structtype(void);
#endif
/*
* xnew, xrnew -- allocate, reallocate storage
*
* SYNOPSIS: Type *xnew (int n, Type);
* Type *xrnew (OldPointer, int n, Type);
*/
#ifdef chkmalloc
# include "chkmalloc.h"
# define xnew(n,Type) ((Type *) trace_malloc (__FILE__, __LINE__, \
(n) * sizeof (Type)))
# define xrnew(op,n,Type) ((Type *) trace_realloc (__FILE__, __LINE__, \
(op), (n) * sizeof (Type)))
#else
# define xnew(n,Type) ((Type *) xmalloc ((n) * sizeof (Type)))
# define xrnew(op,n,Type) ((Type *) xrealloc ((op), (n) * sizeof (Type)))
#endif
typedef int bool;
typedef void Lang_function (FILE *);
typedef struct
{
char *name;
Lang_function *function;
char **suffixes;
char **interpreters;
} language;
typedef struct node_st
{ /* sorting structure */
char *name; /* function or type name */
#ifdef OO_BROWSER
short int construct; /* Construct type for the OO-Browser */
#endif
char *file; /* file name */
bool is_func; /* use pattern or line no */
bool been_warned; /* set if noticed dup */
int lno; /* line number tag is on */
long cno; /* character number line starts on */
char *pat; /* search pattern */
struct node_st *left, *right; /* left and right sons */
} node;
#ifdef OO_BROWSER
/* If you add to this array, you must add a corresponding entry to the
following enum. */
static char *oo_browser_default_classes[] =
/* Lack of square brackets around some of these entries are intentional. */
{"null", "class", "method", "[constant]", "[enumeration]", "[enum_label]",
"extern", "[function]", "[macro]", "objc", "[structure]", "[type]",
"[union]", "[variable]"};
/* If you add to this enum, you must add a corresponding entry to the
preceding array. */
enum oo_browser_constructs {C_NULL, C_CLASS, C_METHOD, C_CONSTANT, C_ENUMERATION,
C_ENUM_LABEL, C_EXTERN, C_FUNCTION, C_MACRO,
C_OBJC, C_STRUCTURE, C_TYPE, C_UNION, C_VARIABLE};
enum oo_browser_constructs oo_browser_construct = C_NULL;
#endif
/*
* A `linebuffer' is a structure which holds a line of text.
* `readline_internal' reads a line from a stream into a linebuffer
* and works regardless of the length of the line.
* SIZE is the size of BUFFER, LEN is the length of the string in
* BUFFER after readline reads it.
*/
typedef struct
{
long size;
int len;
char *buffer;
} linebuffer;
extern char *getenv PP ((const char *envvar));
/* Many compilers barf on this:
Lang_function Asm_labels;
so let's write it this way */
void Asm_labels PP ((FILE *inf));
void C_entries PP ((int c_ext, FILE *inf));
void default_C_entries PP ((FILE *inf));
void plain_C_entries PP ((FILE *inf));
void Cjava_entries PP ((FILE *inf));
void Cplusplus_entries PP ((FILE *inf));
void Yacc_entries PP ((FILE *inf));
void Cobol_paragraphs PP ((FILE *inf));
void Cstar_entries PP ((FILE *inf));
void Erlang_functions PP ((FILE *inf));
void Fortran_functions PP ((FILE *inf));
void Lisp_functions PP ((FILE *inf));
void Pascal_functions PP ((FILE *inf));
void Perl_functions PP ((FILE *inf));
void Postscript_functions PP ((FILE *inf));
void Prolog_functions PP ((FILE *inf));
void Python_functions PP ((FILE *inf));
void Scheme_functions PP ((FILE *inf));
void TeX_functions PP ((FILE *inf));
void just_read_file PP ((FILE *inf));
void print_language_names PP ((void));
void print_version PP ((void));
void print_help PP ((void));
language *get_language_from_name PP ((char *name));
language *get_language_from_interpreter PP ((char *interpreter));
language *get_language_from_suffix PP ((char *suffix));
int total_size_of_entries PP ((node *np));
long readline PP ((linebuffer *lbp, FILE *stream));
long readline_internal PP ((linebuffer *lbp, FILE *stream));
#ifdef ETAGS_REGEXPS
void analyse_regex PP ((char *regex_arg));
void add_regex PP ((char *regexp_pattern, language *lang));
void free_patterns PP ((void));
#endif /* ETAGS_REGEXPS */
void error PP ((const char *s1, const char *s2));
void suggest_asking_for_help PP ((void));
void fatal PP ((char *s1, char *s2));
void pfatal PP ((char *s1));
void add_node PP ((node *np, node **cur_node_p));
void init PP ((void));
void initbuffer PP ((linebuffer *lbp));
void find_entries PP ((char *file, FILE *inf));
void free_tree PP ((node *np));
void pfnote PP ((char *name, bool is_func, char *linestart, int linelen, int lno, long cno));
void new_pfnote PP ((char *name, int namelen, bool is_func, char *linestart, int linelen, int lno, long cno));
void process_file PP ((char *file));
void put_entries PP ((node *np));
void takeprec PP ((void));
char *concat PP ((char *s1, char *s2, char *s3));
char *skip_spaces PP ((char *cp));
char *skip_non_spaces PP ((char *cp));
char *savenstr PP ((char *cp, int len));
char *savestr PP ((char *cp));
char *etags_strchr PP ((char *sp, int c));
char *etags_strrchr PP ((char *sp, int c));
char *etags_getcwd PP ((void));
char *relative_filename PP ((char *file, char *dir));
char *absolute_filename PP ((char *file, char *dir));
char *absolute_dirname PP ((char *file, char *dir));
bool filename_is_absolute PP ((char *fn));
void canonicalize_filename PP ((char *fn));
void grow_linebuffer PP ((linebuffer *lbp, int toksize));
long *xmalloc PP ((unsigned int size));
long *xrealloc PP ((char *ptr, unsigned int size));
char searchar = '/'; /* use /.../ searches */
char *tagfile; /* output file */
char *progname; /* name this program was invoked with */
char *cwd; /* current working directory */
char *tagfiledir; /* directory of tagfile */
FILE *tagf; /* ioptr for tags file */
char *curfile; /* current input file name */
language *curlang; /* current language */
int lineno; /* line number of current line */
long charno; /* current character number */
long linecharno; /* charno of start of current line */
char *dbp; /* pointer to start of current tag */
node *head; /* the head of the binary tree of tags */
linebuffer lb; /* the current line */
linebuffer token_name; /* used by C_entries as a temporary area */
struct
{
long linepos;
linebuffer lb; /* used by C_entries instead of lb */
} lbs[2];
/* boolean "functions" (see init) */
bool _wht[CHARS], _nin[CHARS], _itk[CHARS], _btk[CHARS], _etk[CHARS];
char
/* white chars */
*white = " \f\t\n\r",
/* not in a name */
*nonam = " \f\t\n\r(=,[;",
/* token ending chars */
*endtk = " \t\n\r\"'#()[]{}=-+%*/&|^~!<>;,.:?",
/* token starting chars */
*begtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$~@",
/* valid in-token chars */
*midtk = "ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz$0123456789";
bool append_to_tagfile; /* -a: append to tags */
/* The following four default to TRUE for etags, but to FALSE for ctags. */
bool typedefs; /* -t: create tags for C typedefs */
bool typedefs_and_cplusplus; /* -T: create tags for C typedefs, level */
/* 0 struct/enum/union decls, and C++ */
/* member functions. */
bool constantypedefs; /* -d: create tags for C #define, enum */
/* constants and variables. */
/* -D: opposite of -d. Default under ctags. */
bool globals; /* create tags for global variables */
bool members; /* create tags for C member variables */
bool update; /* -u: update tags */
bool vgrind_style; /* -v: create vgrind style index output */
bool no_warnings; /* -w: suppress warnings */
bool cxref_style; /* -x: create cxref style output */
bool cplusplus; /* .[hc] means C++, not C */
bool noindentypedefs; /* -I: ignore indentation in C */
#ifdef OO_BROWSER
bool oo_browser_format; /* -O: OO-Browser tags format */
#endif
#ifdef LONG_OPTIONS
struct option longopts[] =
{
{ "append", no_argument, NULL, 'a' },
{ "backward-search", no_argument, NULL, 'B' },
{ "c++", no_argument, NULL, 'C' },
{ "cxref", no_argument, NULL, 'x' },
{ "defines", no_argument, NULL, 'd' },
{ "no-defines", no_argument, NULL, 'D' },
{ "globals", no_argument, &globals, TRUE },
{ "no-globals", no_argument, &globals, FALSE },
{ "help", no_argument, NULL, 'h' },
{ "help", no_argument, NULL, 'H' },
{ "ignore-indentation", no_argument, NULL, 'I' },
{ "include", required_argument, NULL, 'i' },
{ "language", required_argument, NULL, 'l' },
{ "members", no_argument, &members, TRUE },
{ "no-members", no_argument, &members, FALSE },
{ "no-warn", no_argument, NULL, 'w' },
{ "output", required_argument, NULL, 'o' },
#ifdef OO_BROWSER
{ "oo-browser", no_argument, NULL, 'O' },
#endif
#ifdef ETAGS_REGEXPS
{ "regex", required_argument, NULL, 'r' },
{ "no-regex", no_argument, NULL, 'R' },
#endif /* ETAGS_REGEXPS */
{ "typedefs", no_argument, NULL, 't' },
{ "typedefs-and-c++", no_argument, NULL, 'T' },
{ "update", no_argument, NULL, 'u' },
{ "version", no_argument, NULL, 'V' },
{ "vgrind", no_argument, NULL, 'v' },
{ 0 }
};
#endif /* LONG_OPTIONS */
#ifdef ETAGS_REGEXPS
/* Structure defining a regular expression. Elements are
the compiled pattern, and the name string. */
typedef struct pattern
{
struct pattern *p_next;
language *language;
char *regex;
struct re_pattern_buffer *pattern;
struct re_registers regs;
char *name_pattern;
bool error_signaled;
} pattern;
/* Array of all regexps. */
pattern *p_head = NULL;
#endif /* ETAGS_REGEXPS */
/*
* Language stuff.
*/
/* Non-NULL if language fixed. */
language *forced_lang = NULL;
/* Assembly code */
char *Asm_suffixes [] = { "a", /* Unix assembler */
"asm", /* Microcontroller assembly */
"def", /* BSO/Tasking definition includes */
"inc", /* Microcontroller include files */
"ins", /* Microcontroller include files */
"s", "sa", /* Unix assembler */
"src", /* BSO/Tasking C compiler output */
NULL
};
/* Note that .c and .h can be considered C++, if the --c++ flag was
given. That is why default_C_entries is called here. */
char *default_C_suffixes [] =
{ "c", "h", NULL };
char *Cplusplus_suffixes [] =
{ "C", "H", "c++", "cc", "cpp", "cxx", "h++", "hh", "hpp", "hxx",
"M", /* Objective C++ */
"pdb", /* Postscript with C syntax */
NULL };
char *Cjava_suffixes [] =
{ "java", NULL };
char *Cobol_suffixes [] =
{ "COB", "cob", NULL };
char *Cstar_suffixes [] =
{ "cs", "hs", NULL };
char *Erlang_suffixes [] =
{ "erl", "hrl", NULL };
char *Fortran_suffixes [] =
{ "F", "f", "f90", "for", NULL };
char *Lisp_suffixes [] =
{ "cl", "clisp", "el", "l", "lisp", "lsp", "ml", NULL };
char *Pascal_suffixes [] =
{ "p", "pas", NULL };
char *Perl_suffixes [] =
{ "pl", "pm", NULL };
char *Perl_interpreters [] =
{ "perl", "@PERL@", NULL };
char *plain_C_suffixes [] =
{ "pc", /* Pro*C file */
"m", /* Objective C file */
"lm", /* Objective lex file */
NULL };
char *Postscript_suffixes [] =
{ "ps", NULL };
char *Prolog_suffixes [] =
{ "prolog", NULL };
char *Python_suffixes [] =
{ "py", NULL };
/* Can't do the `SCM' or `scm' prefix with a version number. */
char *Scheme_suffixes [] =
{ "SCM", "SM", "oak", "sch", "scheme", "scm", "sm", "ss", "t", NULL };
char *TeX_suffixes [] =
{ "TeX", "bib", "clo", "cls", "ltx", "sty", "tex", NULL };
char *Yacc_suffixes [] =
{ "y", "ym", NULL }; /* .ym is Objective yacc file */
/*
* Table of languages.
*
* It is ok for a given function to be listed under more than one
* name. I just didn't.
*/
language lang_names [] =
{
{ "asm", Asm_labels, Asm_suffixes, NULL },
{ "c", default_C_entries, default_C_suffixes, NULL },
{ "c++", Cplusplus_entries, Cplusplus_suffixes, NULL },
{ "c*", Cstar_entries, Cstar_suffixes, NULL },
{ "cobol", Cobol_paragraphs, Cobol_suffixes, NULL },
{ "erlang", Erlang_functions, Erlang_suffixes, NULL },
{ "fortran", Fortran_functions, Fortran_suffixes, NULL },
{ "java", Cjava_entries, Cjava_suffixes, NULL },
{ "lisp", Lisp_functions, Lisp_suffixes, NULL },
{ "pascal", Pascal_functions, Pascal_suffixes, NULL },
{ "perl", Perl_functions, Perl_suffixes, Perl_interpreters },
{ "postscript", Postscript_functions, Postscript_suffixes, NULL },
{ "proc", plain_C_entries, plain_C_suffixes, NULL },
{ "prolog", Prolog_functions, Prolog_suffixes, NULL },
{ "python", Python_functions, Python_suffixes, NULL },
{ "scheme", Scheme_functions, Scheme_suffixes, NULL },
{ "tex", TeX_functions, TeX_suffixes, NULL },
{ "yacc", Yacc_entries, Yacc_suffixes, NULL },
{ "auto", NULL }, /* default guessing scheme */
{ "none", just_read_file }, /* regexp matching only */
{ NULL, NULL } /* end of list */
};
void
print_language_names ()
{
language *lang;
char **ext;
puts ("\nThese are the currently supported languages, along with the\n\
default file name suffixes:");
for (lang = lang_names; lang->name != NULL; lang++)
{
printf ("\t%s\t", lang->name);
if (lang->suffixes != NULL)
for (ext = lang->suffixes; *ext != NULL; ext++)
printf (" .%s", *ext);
puts ("");
}
puts ("Where `auto' means use default language for files based on file\n\
name suffix, and `none' means only do regexp processing on files.\n\
If no language is specified and no matching suffix is found,\n\
the first line of the file is read for a sharp-bang (#!) sequence\n\
followed by the name of an interpreter. If no such sequence is found,\n\
Fortran is tried first; if no tags are found, C is tried next.");
}
#ifndef VERSION
# define VERSION "20"
#endif
void
print_version ()
{
printf ("%s (GNU Emacs %s)\n", (CTAGS) ? "ctags" : "etags", VERSION);
puts ("Copyright (C) 1996 Free Software Foundation, Inc. and Ken Arnold");
puts ("This program is distributed under the same terms as Emacs");
exit (GOOD);
}
void
print_help ()
{
printf ("Usage: %s [options] [[regex-option ...] file-name] ...\n\
\n\
These are the options accepted by %s.\n", progname, progname);
#ifdef LONG_OPTIONS
puts ("You may use unambiguous abbreviations for the long option names.");
#else
puts ("Long option names do not work with this executable, as it is not\n\
linked with GNU getopt.");
#endif /* LONG_OPTIONS */
puts ("A - as file name means read names from stdin (one per line).");
if (!CTAGS)
printf (" Absolute names are stored in the output file as they are.\n\
Relative ones are stored relative to the output file's directory.");
puts ("\n");
puts ("-a, --append\n\
Append tag entries to existing tags file.");
if (CTAGS)
puts ("-B, --backward-search\n\
Write the search commands for the tag entries using '?', the\n\
backward-search command instead of '/', the forward-search command.");
puts ("-C, --c++\n\
Treat files whose name suffix defaults to C language as C++ files.");
if (CTAGS)
puts ("-d, --defines\n\
Create tag entries for C #define constants and enum constants, too.");
else
puts ("-D, --no-defines\n\
Don't create tag entries for C #define constants and enum constants.\n\
This makes the tags file smaller.");
if (!CTAGS)
{
puts ("-i FILE, --include=FILE\n\
Include a note in tag file indicating that, when searching for\n\
a tag, one should also consult the tags file FILE after\n\
checking the current file.");
puts ("-l LANG, --language=LANG\n\
Force the following files to be considered as written in the\n\
named language up to the next --language=LANG option.");
}
if (CTAGS)
puts ("--globals\n\
Create tag entries for global variables in some languages.");
else
puts ("--no-globals\n\
Do not create tag entries for global variables in some\n\
languages. This makes the tags file smaller.");
puts ("--members\n\
Create tag entries for member variables in C and derived languages.");
#ifdef ETAGS_REGEXPS
puts ("-r /REGEXP/, --regex=/REGEXP/ or --regex=@regexfile\n\
Make a tag for each line matching pattern REGEXP in the\n\
following files. regexfile is a file containing one REGEXP\n\
per line. REGEXP is anchored (as if preceded by ^).\n\
The form /REGEXP/NAME/ creates a named tag. For example Tcl\n\
named tags can be created with:\n\
--regex=/proc[ \\t]+\\([^ \\t]+\\)/\\1/.");
puts ("-R, --no-regex\n\
Don't create tags from regexps for the following files.");
#endif /* ETAGS_REGEXPS */
puts ("-o FILE, --output=FILE\n\
Write the tags to FILE.");
#ifdef OO_BROWSER
puts ("-O, --oo-browser\n\
Generate a specialized tags format used only by the Altrasoft OO-Browser.");
#endif
puts ("-I, --ignore-indentation\n\
Don't rely on indentation quite as much as normal. Currently,\n\
this means not to assume that a closing brace in the first\n\
column is the final brace of a function or structure\n\
definition in C and C++.");
if (CTAGS)
{
puts ("-t, --typedefs\n\
Generate tag entries for C typedefs.");
puts ("-T, --typedefs-and-c++\n\
Generate tag entries for C typedefs, C struct/enum/union tags,\n\
and C++ member functions.");
puts ("-u, --update\n\
Update the tag entries for the given files, leaving tag\n\
entries for other files in place. Currently, this is\n\
implemented by deleting the existing entries for the given\n\
files and then rewriting the new entries at the end of the\n\
tags file. It is often faster to simply rebuild the entire\n\
tag file than to use this.");
puts ("-v, --vgrind\n\
Generates an index of items intended for human consumption,\n\
similar to the output of vgrind. The index is sorted, and\n\
gives the page number of each item.");
puts ("-w, --no-warn\n\
Suppress warning messages about entries defined in multiple\n\
files.");
puts ("-x, --cxref\n\
Like --vgrind, but in the style of cxref, rather than vgrind.\n\
The output uses line numbers instead of page numbers, but\n\
beyond that the differences are cosmetic; try both to see\n\
which you like.");
}
puts ("-V, --version\n\
Print the version of the program.\n\
-h, --help\n\
Print this help message.");
print_language_names ();
puts ("");
puts ("Report bugs to bug-gnu-emacs@prep.ai.mit.edu");
exit (GOOD);
}
enum argument_type
{
at_language,
at_regexp,
at_filename
};
/* This structure helps us allow mixing of --lang and file names. */
typedef struct
{
enum argument_type arg_type;
char *what;
language *lang;
} argument;
#ifdef VMS /* VMS specific functions */
#define EOS '\0'
/* This is a BUG! ANY arbitrary limit is a BUG!
Won't someone please fix this? */
#define MAX_FILE_SPEC_LEN 255
typedef struct {
short curlen;
char body[MAX_FILE_SPEC_LEN + 1];
} vspec;
/*
v1.05 nmm 26-Jun-86 fn_exp - expand specification of list of file names
returning in each successive call the next file name matching the input
spec. The function expects that each in_spec passed
to it will be processed to completion; in particular, up to and
including the call following that in which the last matching name
is returned, the function ignores the value of in_spec, and will
only start processing a new spec with the following call.
If an error occurs, on return out_spec contains the value
of in_spec when the error occurred.
With each successive file name returned in out_spec, the
function's return value is one. When there are no more matching
names the function returns zero. If on the first call no file
matches in_spec, or there is any other error, -1 is returned.
*/
#include <rmsdef.h>
#include <descrip.h>
#define OUTSIZE MAX_FILE_SPEC_LEN
short
fn_exp (out, in)
vspec *out;
char *in;
{
static long context = 0;
static struct dsc$descriptor_s o;
static struct dsc$descriptor_s i;
static bool pass1 = TRUE;
long status;
short retval;
if (pass1)
{
pass1 = FALSE;
o.dsc$a_pointer = (char *) out;
o.dsc$w_length = (short)OUTSIZE;
i.dsc$a_pointer = in;
i.dsc$w_length = (short)strlen(in);
i.dsc$b_dtype = DSC$K_DTYPE_T;
i.dsc$b_class = DSC$K_CLASS_S;
o.dsc$b_dtype = DSC$K_DTYPE_VT;
o.dsc$b_class = DSC$K_CLASS_VS;
}
if ((status = lib$find_file(&i, &o, &context, 0, 0)) == RMS$_NORMAL)
{
out->body[out->curlen] = EOS;
return 1;
}
else if (status == RMS$_NMF)
retval = 0;
else
{
strcpy(out->body, in);
retval = -1;
}
lib$find_file_end(&context);
pass1 = TRUE;
return retval;
}
/*
v1.01 nmm 19-Aug-85 gfnames - return in successive calls the
name of each file specified by the provided arg expanding wildcards.
*/
char *
gfnames (arg, p_error)
char *arg;
bool *p_error;
{
static vspec filename = {MAX_FILE_SPEC_LEN, "\0"};
switch (fn_exp (&filename, arg))
{
case 1:
*p_error = FALSE;
return filename.body;
case 0:
*p_error = FALSE;
return NULL;
default:
*p_error = TRUE;
return filename.body;
}
}
#ifndef OLD /* Newer versions of VMS do provide `system'. */
system (cmd)
char *cmd;
{
error ("%s", "system() function not implemented under VMS");
}
#endif
#define VERSION_DELIM ';'
char *massage_name (s)
char *s;
{
char *start = s;
for ( ; *s; s++)
if (*s == VERSION_DELIM)
{
*s = EOS;
break;
}
else
*s = lowcase (*s);
return start;
}
#endif /* VMS */
int
main (int argc, char *argv[])
{
int i;
unsigned int nincluded_files;
char **included_files;
char *this_file;
argument *argbuffer;
int current_arg, file_count;
linebuffer filename_lb;
#ifdef VMS
bool got_err;
#endif
#ifdef WIN32_NATIVE
_fmode = O_BINARY; /* all of files are treated as binary files */
#endif /* WIN32_NATIVE */
progname = argv[0];
nincluded_files = 0;
included_files = xnew (argc, char *);
current_arg = 0;
file_count = 0;
/* Allocate enough no matter what happens. Overkill, but each one
is small. */
argbuffer = xnew (argc, argument);
#ifdef ETAGS_REGEXPS
/* Set syntax for regular expression routines. */
re_set_syntax (RE_SYNTAX_EMACS | RE_INTERVALS);
#endif /* ETAGS_REGEXPS */
/*
* If etags, always find typedefs and structure tags. Why not?
* Also default is to find macro constants, enum constants and
* global variables.
*/
if (!CTAGS)
{
typedefs = typedefs_and_cplusplus = constantypedefs = TRUE;
globals = TRUE;
members = FALSE;
}
while (1)
{
int opt;
char *optstring;
#ifdef ETAGS_REGEXPS
#ifndef OO_BROWSER
optstring = "-aCdDf:Il:o:r:RStTi:BuvxwVhH";
#else
optstring = "-aCdDf:Il:o:r:RStTi:BOuvxwVhH";
#endif
#else
#ifndef OO_BROWSER
optstring = "-aCdDf:Il:o:StTi:BuvxwVhH";
#else
optstring = "-aCdDf:Il:o:StTi:BOuvxwVhH";
#endif
#endif /* ETAGS_REGEXPS */
#ifndef LONG_OPTIONS
optstring = optstring + 1;
#endif /* LONG_OPTIONS */
opt = getopt_long (argc, argv, optstring, longopts, 0);
if (opt == EOF)
break;
switch (opt)
{
case 0:
/* If getopt returns 0, then it has already processed a
long-named option. We should do nothing. */
break;
case 1:
/* This means that a file name has been seen. Record it. */
argbuffer[current_arg].arg_type = at_filename;
argbuffer[current_arg].what = optarg;
++current_arg;
++file_count;
break;
/* Common options. */
case 'a': append_to_tagfile = TRUE; break;
case 'C': cplusplus = TRUE; break;
case 'd': constantypedefs = TRUE; break;
case 'D': constantypedefs = FALSE; break;
case 'f': /* for compatibility with old makefiles */
case 'o':
if (tagfile)
{
/* convert char to string, to call error with */
char buf[2];
sprintf (buf, "%c", opt);
error ("-%s option may only be given once.", buf);
suggest_asking_for_help ();
}
tagfile = optarg;
break;
#ifdef OO_BROWSER
case 'O':
oo_browser_format = TRUE;
break;
#endif
case 'I':
case 'S': /* for backward compatibility */
noindentypedefs = TRUE;
break;
case 'l':
{
language *lang = get_language_from_name (optarg);
if (lang != NULL)
{
argbuffer[current_arg].lang = lang;
argbuffer[current_arg].arg_type = at_language;
++current_arg;
}
}
break;
#ifdef ETAGS_REGEXPS
case 'r':
argbuffer[current_arg].arg_type = at_regexp;
argbuffer[current_arg].what = optarg;
++current_arg;
break;
case 'R':
argbuffer[current_arg].arg_type = at_regexp;
argbuffer[current_arg].what = NULL;
++current_arg;
break;
#endif /* ETAGS_REGEXPS */
case 'V':
print_version ();
break;
case 'h':
case 'H':
print_help ();
break;
case 't':
typedefs = TRUE;
break;
case 'T':
typedefs = typedefs_and_cplusplus = TRUE;
break;
#if (!CTAGS)
/* Etags options */
case 'i':
included_files[nincluded_files++] = optarg;
break;
#else /* CTAGS */
/* Ctags options. */
case 'B': searchar = '?'; break;
case 'u': update = TRUE; break;
case 'v': vgrind_style = TRUE; /*FALLTHRU*/
case 'x': cxref_style = TRUE; break;
case 'w': no_warnings = TRUE; break;
#endif /* CTAGS */
default:
suggest_asking_for_help ();
}
}
for (; optind < argc; ++optind)
{
argbuffer[current_arg].arg_type = at_filename;
argbuffer[current_arg].what = argv[optind];
++current_arg;
++file_count;
}
if (nincluded_files == 0 && file_count == 0)
{
error ("no input files specified.", 0);
suggest_asking_for_help ();
}
if (tagfile == NULL)
tagfile = CTAGS ? "tags" : "TAGS";
cwd = etags_getcwd (); /* the current working directory */
if (cwd[strlen (cwd) - 1] != '/')
{
char *oldcwd = cwd;
cwd = concat (oldcwd, "/", "");
free (oldcwd);
}
if (streq (tagfile, "-"))
tagfiledir = cwd;
else
tagfiledir = absolute_dirname (tagfile, cwd);
init (); /* set up boolean "functions" */
initbuffer (&lb);
initbuffer (&token_name);
initbuffer (&lbs[0].lb);
initbuffer (&lbs[1].lb);
initbuffer (&filename_lb);
if (!CTAGS)
{
if (streq (tagfile, "-"))
{
tagf = stdout;
#ifdef WIN32_NATIVE
/* Switch redirected `stdout' to binary mode (setting `_fmode'
doesn't take effect until after `stdout' is already open). */
if (!isatty (fileno (stdout)))
setmode (fileno (stdout), O_BINARY);
#endif /* WIN32_NATIVE */
}
else
tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
if (tagf == NULL)
pfatal (tagfile);
}
/*
* Loop through files finding functions.
*/
for (i = 0; i < current_arg; ++i)
{
switch (argbuffer[i].arg_type)
{
case at_language:
forced_lang = argbuffer[i].lang;
break;
#ifdef ETAGS_REGEXPS
case at_regexp:
analyse_regex (argbuffer[i].what);
break;
#endif
case at_filename:
#ifdef VMS
while ((this_file = gfnames (argbuffer[i].what, &got_err)) != NULL)
{
if (got_err)
{
error ("can't find file %s\n", this_file);
argc--, argv++;
}
else
{
this_file = massage_name (this_file);
}
#else
this_file = argbuffer[i].what;
#endif
#ifdef OO_BROWSER
oo_browser_clear_all_globals();
#endif
/* Input file named "-" means read file names from stdin
(one per line) and use them. */
if (streq (this_file, "-"))
while (readline_internal (&filename_lb, stdin) > 0)
#ifdef OO_BROWSER
{
oo_browser_clear_some_globals();
#endif
process_file (filename_lb.buffer);
#ifdef OO_BROWSER
}
#endif
else
process_file (this_file);
#ifdef VMS
}
#endif
break;
}
}
#ifdef ETAGS_REGEXPS
free_patterns ();
#endif /* ETAGS_REGEXPS */
if (!CTAGS)
{
while (nincluded_files-- > 0)
fprintf (tagf, "\f\n%s,include\n", *included_files++);
fclose (tagf);
exit (GOOD);
}
/* If CTAGS, we are here. process_file did not write the tags yet,
because we want them ordered. Let's do it now. */
if (cxref_style)
{
put_entries (head);
exit (GOOD);
}
if (update)
{
char cmd[BUFSIZ];
for (i = 0; i < current_arg; ++i)
{
if (argbuffer[i].arg_type != at_filename)
continue;
sprintf (cmd,
"mv %s OTAGS;fgrep -v '\t%s\t' OTAGS >%s;rm OTAGS",
tagfile, argbuffer[i].what, tagfile);
if (system (cmd) != GOOD)
fatal ("failed to execute shell command", (char *)NULL);
}
append_to_tagfile = TRUE;
}
tagf = fopen (tagfile, append_to_tagfile ? "a" : "w");
if (tagf == NULL)
pfatal (tagfile);
put_entries (head);
fclose (tagf);
if (update)
{
char cmd[BUFSIZ];
sprintf (cmd, "sort %s -o %s", tagfile, tagfile);
exit (system (cmd));
}
return GOOD;
}
/*
* Return a language given the name.
*/
language *
get_language_from_name (name)
char *name;
{
language *lang;
if (name == NULL)
error ("empty language name", (char *)NULL);
else
{
for (lang = lang_names; lang->name != NULL; lang++)
if (streq (name, lang->name))
return lang;
error ("unknown language \"%s\"", name);
}
return NULL;
}
/*
* Return a language given the interpreter name.
*/
language *
get_language_from_interpreter (interpreter)
char *interpreter;
{
language *lang;
char **iname;
if (interpreter == NULL)
return NULL;
for (lang = lang_names; lang->name != NULL; lang++)
if (lang->interpreters != NULL)
for (iname = lang->interpreters; *iname != NULL; iname++)
if (streq (*iname, interpreter))
return lang;
return NULL;
}
/*
* Return a language given the file suffix.
*/
language *
get_language_from_suffix (suffix)
char *suffix;
{
language *lang;
char **ext;
if (suffix == NULL)
return NULL;
for (lang = lang_names; lang->name != NULL; lang++)
if (lang->suffixes != NULL)
for (ext = lang->suffixes; *ext != NULL; ext++)
if (streq (*ext, suffix))
return lang;
return NULL;
}
/*
* This routine is called on each file argument.
*/
void
process_file (file)
char *file;
{
struct stat stat_buf;
FILE *inf;
canonicalize_filename (file);
if (stat (file, &stat_buf) == 0 && !S_ISREG (stat_buf.st_mode))
{
error ("skipping %s: it is not a regular file.", file);
return;
}
if (streq (file, tagfile) && !streq (tagfile, "-"))
{
error ("skipping inclusion of %s in self.", file);
return;
}
inf = fopen (file, "r");
if (inf == NULL)
{
perror (file);
return;
}
find_entries (file, inf);
if (!CTAGS)
{
char *filename;
if (filename_is_absolute (file))
{
/* file is an absolute file name. Canonicalise it. */
filename = absolute_filename (file, cwd);
}
else
{
/* file is a file name relative to cwd. Make it relative
to the directory of the tags file. */
filename = relative_filename (file, tagfiledir);
}
#ifdef OO_BROWSER
if (oo_browser_format)
fprintf (tagf, "\f\n%s\n", filename);
else
#endif
fprintf (tagf, "\f\n%s,%d\n", filename, total_size_of_entries (head));
free (filename);
put_entries (head);
free_tree (head);
head = NULL;
}
}
/*
* This routine sets up the boolean pseudo-functions which work
* by setting boolean flags dependent upon the corresponding character.
* Every char which is NOT in that string is not a white char. Therefore,
* all of the array "_wht" is set to FALSE, and then the elements
* subscripted by the chars in "white" are set to TRUE. Thus "_wht"
* of a char is TRUE if it is the string "white", else FALSE.
*/
void
init ()
{
register char *sp;
register int i;
for (i = 0; i < CHARS; i++)
iswhite(i) = notinname(i) = begtoken(i) = intoken(i) = endtoken(i) = FALSE;
for (sp = white; *sp != '\0'; sp++) iswhite (*sp) = TRUE;
for (sp = nonam; *sp != '\0'; sp++) notinname (*sp) = TRUE;
for (sp = begtk; *sp != '\0'; sp++) begtoken (*sp) = TRUE;
for (sp = midtk; *sp != '\0'; sp++) intoken (*sp) = TRUE;
for (sp = endtk; *sp != '\0'; sp++) endtoken (*sp) = TRUE;
iswhite('\0') = iswhite('\n');
notinname('\0') = notinname('\n');
begtoken('\0') = begtoken('\n');
intoken('\0') = intoken('\n');
endtoken('\0') = endtoken('\n');
}
/*
* This routine opens the specified file and calls the function
* which finds the function and type definitions.
*/
node *last_node = NULL;
void
find_entries (file, inf)
char *file;
FILE *inf;
{
char *cp;
language *lang;
node *old_last_node;
curfile = savestr (file);
/* If user specified a language, use it. */
lang = forced_lang;
if (lang != NULL && lang->function != NULL)
{
curlang = lang;
lang->function (inf);
free (curfile);
fclose (inf);
return;
}
cp = etags_strrchr (file, '.');
if (cp != NULL)
{
cp += 1;
lang = get_language_from_suffix (cp);
if (lang != NULL && lang->function != NULL)
{
curlang = lang;
lang->function (inf);
free (curfile);
fclose (inf);
return;
}
}
/* Look for sharp-bang as the first two characters. */
if (readline_internal (&lb, inf) > 0
&& lb.len >= 2
&& lb.buffer[0] == '#'
&& lb.buffer[1] == '!')
{
char *lp;
/* Set lp to point at the first char after the last slash in the
line or, if no slashes, at the first nonblank. Then set cp to
the first successive blank and terminate the string. */
lp = etags_strrchr (lb.buffer+2, '/');
if (lp != NULL)
lp += 1;
else
lp = skip_spaces (lb.buffer + 2);
cp = skip_non_spaces (lp);
*cp = '\0';
if (strlen (lp) > 0)
{
lang = get_language_from_interpreter (lp);
if (lang != NULL && lang->function != NULL)
{
curlang = lang;
lang->function (inf);
fclose (inf);
free (curfile);
return;
}
}
}
rewind (inf);
/* Try Fortran. */
old_last_node = last_node;
curlang = get_language_from_name ("fortran");
Fortran_functions (inf);
/* No Fortran entries found. Try C. */
if (old_last_node == last_node)
{
rewind (inf);
curlang = get_language_from_name (cplusplus ? "c++" : "c");
default_C_entries (inf);
}
free (curfile);
fclose (inf);
return;
}
/* Record a tag. */
void
pfnote (name, is_func, linestart, linelen, lno, cno)
char *name; /* tag name, or NULL if unnamed */
bool is_func; /* tag is a function */
char *linestart; /* start of the line where tag is */
int linelen; /* length of the line where tag is */
int lno; /* line number */
long cno; /* character number */
{
register node *np;
if (CTAGS && name == NULL)
return;
np = xnew (1, node);
/* If ctags mode, change name "main" to M<thisfilename>. */
if (CTAGS && !cxref_style && streq (name, "main"))
{
register char *fp = etags_strrchr (curfile, '/');
np->name = concat ("M", fp == 0 ? curfile : fp + 1, "");
fp = etags_strrchr (np->name, '.');
if (fp && fp[1] != '\0' && fp[2] == '\0')
fp[0] = 0;
}
else
np->name = name;
np->been_warned = FALSE;
np->file = curfile;
np->is_func = is_func;
np->lno = lno;
/* Our char numbers are 0-base, because of C language tradition?
ctags compatibility? old versions compatibility? I don't know.
Anyway, since emacs's are 1-base we expect etags.el to take care
of the difference. If we wanted to have 1-based numbers, we would
uncomment the +1 below. */
np->cno = cno /* + 1 */ ;
np->left = np->right = NULL;
if (CTAGS && !cxref_style)
{
if (strlen (linestart) < 50)
np->pat = concat (linestart, "$", "");
else
np->pat = savenstr (linestart, 50);
}
else
np->pat = savenstr (linestart, linelen);
#ifdef OO_BROWSER
if (oo_browser_format)
np->construct = oo_browser_construct;
oo_browser_construct = C_NULL;
oo_browser_check_and_clear_structtype();
#endif
add_node (np, &head);
}
/* Date: Wed, 22 Jan 1997 02:56:31 -0500 [last amended 18 Sep 1997]
* From: Sam Kendall <kendall@mv.mv.com>
* Subject: Proposal for firming up the TAGS format specification
* To: F.Potorti@cnuce.cnr.it
*
* pfnote should emit the optimized form [unnamed tag] only if:
* 1. name does not contain any of the characters " \t\r\n(),;";
* 2. linestart contains name as either a rightmost, or rightmost but
* one character, substring;
* 3. the character, if any, immediately before name in linestart must
* be one of the characters " \t(),;";
* 4. the character, if any, immediately after name in linestart must
* also be one of the characters " \t(),;".
*
* The real implementation uses the notinname() macro, which recognises
* characters slightly different form " \t\r\n(),;". See the variable
* `nonam'.
*/
#define traditional_tag_style TRUE
void
new_pfnote (name, namelen, is_func, linestart, linelen, lno, cno)
char *name; /* tag name, or NULL if unnamed */
int namelen; /* tag length */
bool is_func; /* tag is a function */
char *linestart; /* start of the line where tag is */
int linelen; /* length of the line where tag is */
int lno; /* line number */
long cno; /* character number */
{
register char *cp;
bool named;
named = TRUE;
if (!CTAGS)
{
for (cp = name; !notinname (*cp); cp++)
continue;
if (*cp == '\0') /* rule #1 */
{
cp = linestart + linelen - namelen;
if (notinname (linestart[linelen-1]))
cp -= 1; /* rule #4 */
#ifdef OO_BROWSER
if (!oo_browser_format
&& cp >= linestart /* rule #2 */
#else
if (cp >= linestart /* rule #2 */
#endif
&& (cp == linestart
|| notinname (cp[-1])) /* rule #3 */
&& strneq (name, cp, namelen)) /* rule #2 */
named = FALSE; /* use unnamed tag */
}
}
if (named)
name = savenstr (name, namelen);
else
name = NULL;
pfnote (name, is_func, linestart, linelen, lno, cno);
}
/*
* free_tree ()
* recurse on left children, iterate on right children.
*/
void
free_tree (np)
register node *np;
{
while (np)
{
register node *node_right = np->right;
free_tree (np->left);
if (np->name != NULL)
free (np->name);
free (np->pat);
free (np);
np = node_right;
}
}
/*
* add_node ()
* Adds a node to the tree of nodes. In etags mode, we don't keep
* it sorted; we just keep a linear list. In ctags mode, maintain
* an ordered tree, with no attempt at balancing.
*
* add_node is the only function allowed to add nodes, so it can
* maintain state.
*/
void
add_node (np, cur_node_p)
node *np, **cur_node_p;
{
register int dif;
register node *cur_node = *cur_node_p;
if (cur_node == NULL)
{
*cur_node_p = np;
last_node = np;
return;
}
if (!CTAGS)
{
/* Etags Mode */
if (last_node == NULL)
fatal ("internal error in add_node", (char *)NULL);
last_node->right = np;
last_node = np;
}
else
{
/* Ctags Mode */
dif = strcmp (np->name, cur_node->name);
/*
* If this tag name matches an existing one, then
* do not add the node, but maybe print a warning.
*/
if (!dif)
{
if (streq (np->file, cur_node->file))
{
if (!no_warnings)
{
fprintf (stderr, "Duplicate entry in file %s, line %d: %s\n",
np->file, lineno, np->name);
fprintf (stderr, "Second entry ignored\n");
}
}
else if (!cur_node->been_warned && !no_warnings)
{
fprintf
(stderr,
"Duplicate entry in files %s and %s: %s (Warning only)\n",
np->file, cur_node->file, np->name);
cur_node->been_warned = TRUE;
}
return;
}
/* Actually add the node */
add_node (np, dif < 0 ? &cur_node->left : &cur_node->right);
}
}
#ifdef OO_BROWSER
/* Default class name for the current OO-Browser tag. */
static char *oo_browser_class;
/* Prefix character to use in OO-Browser listings for the current tag. */
static char oo_browser_prefix;
#endif
void
put_entries (node *np)
{
register char *sp;
if (np == NULL)
return;
/* Output subentries that precede this one */
put_entries (np->left);
/* Output this entry */
if (!CTAGS)
{
#ifdef OO_BROWSER
if (oo_browser_format)
{
/* Omit C++ `class' and `method' entries as well as Objective-C
entries from this OO-Browser tags file since the browser handles
them independently of this file. Omit `extern' variable declarations
as they are unused by the OO-Browser. */
if (np->construct != C_CLASS
&& np->construct != C_METHOD
&& np->construct != C_EXTERN
&& np->construct != C_OBJC)
{
oo_browser_class = oo_browser_default_classes[np->construct];
switch (np->construct)
{
case C_CONSTANT:
case C_ENUMERATION:
case C_ENUM_LABEL:
case C_STRUCTURE:
case C_TYPE:
case C_UNION:
case C_VARIABLE:
oo_browser_prefix = '=';
break;
case C_FUNCTION:
case C_MACRO:
oo_browser_prefix = '-';
break;
}
if (np->name != NULL)
fprintf (tagf, "%s@%c %s@%s\n",
oo_browser_class, oo_browser_prefix,
np->name, np->pat);
else
fprintf (tagf, "%s@%c ???@%s\n",
oo_browser_class, oo_browser_prefix, np->pat);
}
}
else
{
#endif
if (np->name != NULL)
fprintf (tagf, "%s\177%s\001%d,%ld\n",
np->pat, np->name, np->lno, np->cno);
else
fprintf (tagf, "%s\177%d,%ld\n",
np->pat, np->lno, np->cno);
#ifdef OO_BROWSER
}
#endif
}
else
{
if (np->name == NULL)
error ("internal error: NULL name in ctags mode.", (char *)NULL);
if (cxref_style)
{
if (vgrind_style)
fprintf (stdout, "%s %s %d\n",
np->name, np->file, (np->lno + 63) / 64);
else
fprintf (stdout, "%-16s %3d %-16s %s\n",
np->name, np->lno, np->file, np->pat);
}
else
{
fprintf (tagf, "%s\t%s\t", np->name, np->file);
if (np->is_func)
{ /* a function */
putc (searchar, tagf);
putc ('^', tagf);
for (sp = np->pat; *sp; sp++)
{
if (*sp == '\\' || *sp == searchar)
putc ('\\', tagf);
putc (*sp, tagf);
}
putc (searchar, tagf);
}
else
{ /* a typedef; text pattern inadequate */
fprintf (tagf, "%d", np->lno);
}
putc ('\n', tagf);
}
}
/* Output subentries that follow this one */
put_entries (np->right);
}
/* Length of a number's decimal representation. */
int number_len PP ((long num));
int
number_len (num)
long num;
{
int len = 1;
while ((num /= 10) > 0)
len += 1;
return len;
}
/*
* Return total number of characters that put_entries will output for
* the nodes in the subtree of the specified node. Works only if
* we are not ctags, but called only in that case. This count
* is irrelevant with the new tags.el, but is still supplied for
* backward compatibility.
*/
int
total_size_of_entries (np)
register node *np;
{
register int total;
if (np == NULL)
return 0;
for (total = 0; np != NULL; np = np->right)
{
/* Count left subentries. */
total += total_size_of_entries (np->left);
/* Count this entry */
total += strlen (np->pat) + 1;
total += number_len ((long) np->lno) + 1 + number_len (np->cno) + 1;
if (np->name != NULL)
total += 1 + strlen (np->name); /* \001name */
}
return total;
}
/*
* The C symbol tables.
*/
enum sym_type
{
st_none,
st_C_objprot, st_C_objimpl, st_C_objend,
st_C_gnumacro,
st_C_ignore,
st_C_javastruct,
st_C_struct, st_C_enum, st_C_define, st_C_typedef, st_C_typespec,
st_C_const
#ifdef OO_BROWSER
, st_C_union, st_C_class, st_C_extern, st_C_inline
#endif
};
/* Feed stuff between (but not including) %[ and %] lines to:
gperf -c -k 1,3 -o -p -r -t
%[
struct C_stab_entry { char *name; int c_ext; enum sym_type type; }
%%
@interface, 0, st_C_objprot
@protocol, 0, st_C_objprot
@implementation,0, st_C_objimpl
@end, 0, st_C_objend
import, C_JAVA, st_C_ignore
package, C_JAVA, st_C_ignore
friend, C_PLPL, st_C_ignore
extends, C_JAVA, st_C_javastruct
implements, C_JAVA, st_C_javastruct
interface, C_JAVA, st_C_struct
class, C_PLPL, st_C_class
namespace, C_PLPL, st_C_struct
domain, C_STAR, st_C_struct
union, 0, st_C_union
struct, 0, st_C_struct
enum, 0, st_C_enum
typedef, 0, st_C_typedef
define, 0, st_C_define
inline, 0, st_C_inline
bool, C_PLPL, st_C_typespec
long, 0, st_C_typespec
short, 0, st_C_typespec
int, 0, st_C_typespec
char, 0, st_C_typespec
float, 0, st_C_typespec
double, 0, st_C_typespec
signed, 0, st_C_typespec
unsigned, 0, st_C_typespec
auto, 0, st_C_typespec
void, 0, st_C_typespec
extern, 0, st_C_extern
static, 0, st_C_typespec
const, 0, st_C_const
volatile, 0, st_C_typespec
explicit, C_PLPL, st_C_typespec
mutable, C_PLPL, st_C_typespec
typename, C_PLPL, st_C_typespec
# DEFUN used in emacs, the next three used in glibc (SYSCALL only for mach).
DEFUN, 0, st_C_gnumacro
SYSCALL, 0, st_C_gnumacro
ENTRY, 0, st_C_gnumacro
PSEUDO, 0, st_C_gnumacro
# These are defined inside C functions, so currently they are not met.
# EXFUN used in glibc, DEFVAR_* in emacs.
#EXFUN, 0, st_C_gnumacro
#DEFVAR_, 0, st_C_gnumacro
%]
and replace lines between %< and %> with its output. */
/*%<*/
/* C code produced by gperf version 2.5 (GNU C++ version) */
/* Command-line: gperf -c -k 1,3 -o -p -r -t */
struct C_stab_entry { char *name; int c_ext; enum sym_type type; };
#define TOTAL_KEYWORDS 41
#define MIN_WORD_LENGTH 3
#define MAX_WORD_LENGTH 15
#define MIN_HASH_VALUE 13
#define MAX_HASH_VALUE 129
/* maximum key range = 117, duplicates = 0 */
static unsigned int
hash (char *str, unsigned int len)
{
static unsigned char asso_values[] =
{
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 13, 130, 130, 130, 33, 32,
47, 130, 130, 130, 130, 130, 130, 130, 130, 130,
5, 130, 130, 20, 32, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 47, 55, 8,
15, 33, 61, 38, 130, 60, 130, 130, 2, 9,
10, 62, 59, 130, 28, 27, 50, 19, 3, 130,
130, 130, 130, 130, 130, 130, 130, 130,
};
return len +
asso_values[(unsigned char) str[2]] +
asso_values[(unsigned char) str[0]];
}
static struct C_stab_entry *
in_word_set (char *str, unsigned int len)
{
static struct C_stab_entry wordlist[] =
{
{"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
{"",}, {"",}, {"",}, {"",},
{"volatile", 0, st_C_typespec},
{"",}, {"",},
{"long", 0, st_C_typespec},
{"",}, {"",}, {"",}, {"",}, {"",}, {"",},
{"const", 0, st_C_const},
{"",}, {"",}, {"",},
{"@end", 0, st_C_objend},
{"namespace", C_PLPL, st_C_struct},
{"",},
{"domain", C_STAR, st_C_struct},
{"",}, {"",},
{"@interface", 0, st_C_objprot},
{"",}, {"",}, {"",},
{"@implementation", 0, st_C_objimpl},
{"",}, {"",},
{"double", 0, st_C_typespec},
{"",}, {"",},
{"PSEUDO", 0, st_C_gnumacro},
{"",}, {"",}, {"",},
{"SYSCALL", 0, st_C_gnumacro},
{"",}, {"",},
{"@protocol", 0, st_C_objprot},
{"",}, {"",}, {"",},
{"unsigned", 0, st_C_typespec},
{"",},
{"enum", 0, st_C_enum},
{"",}, {"",},
{"char", 0, st_C_typespec},
{"class", C_PLPL, st_C_class},
{"struct", 0, st_C_struct},
{"",}, {"",}, {"",}, {"",},
{"mutable", C_PLPL, st_C_typespec},
{"void", 0, st_C_typespec},
{"inline", 0, st_C_inline},
{"ENTRY", 0, st_C_gnumacro},
{"",},
{"signed", 0, st_C_typespec},
{"",}, {"",},
{"package", C_JAVA, st_C_ignore},
{"",}, {"",}, {"",}, {"",}, {"",},
{"static", 0, st_C_typespec},
{"",},
{"define", 0, st_C_define},
{"",},
{"union", 0, st_C_union},
{"DEFUN", 0, st_C_gnumacro},
{"",}, {"",}, {"",},
{"extern", 0, st_C_extern},
{"extends", C_JAVA, st_C_javastruct},
{"",}, {"",}, {"",},
{"short", 0, st_C_typespec},
{"",}, {"",}, {"",}, {"",}, {"",},
{"explicit", C_PLPL, st_C_typespec},
{"auto", 0, st_C_typespec},
{"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",},
{"",}, {"",},
{"int", 0, st_C_typespec},
{"",}, {"",},
{"typedef", 0, st_C_typedef},
{"typename", C_PLPL, st_C_typespec},
{"",},
{"interface", C_JAVA, st_C_struct},
{"",},
{"bool", C_PLPL, st_C_typespec},
{"",}, {"",}, {"",},
{"import", C_JAVA, st_C_ignore},
{"",},
{"friend", C_PLPL, st_C_ignore},
{"float", 0, st_C_typespec},
{"implements", C_JAVA, st_C_javastruct},
};
if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
{
register int key = hash (str, len);
if (key <= MAX_HASH_VALUE && key >= 0)
{
register char *s = wordlist[key].name;
if (*s == *str && !strncmp (str + 1, s + 1, len - 1))
return &wordlist[key];
}
}
return 0;
}
/*%>*/
enum sym_type C_symtype PP ((char *str, int len, int c_ext));
enum sym_type
C_symtype (str, len, c_ext)
char *str;
int len;
int c_ext;
{
register struct C_stab_entry *se = in_word_set (str, len);
if (se == NULL || (se->c_ext && !(c_ext & se->c_ext)))
return st_none;
return se->type;
}
/*
* C functions and variables are recognized using a simple
* finite automaton. fvdef is its state variable.
*/
enum
{
fvnone, /* nothing seen */
fvnameseen, /* function or variable name seen */
fstartlist, /* func: just after open parenthesis */
finlist, /* func: in parameter list */
flistseen, /* func: after parameter list */
fignore, /* func: before open brace */
vignore /* var-like: ignore until ';' */
} fvdef;
/*
* typedefs are recognized using a simple finite automaton.
* typdef is its state variable.
*/
enum
{
tnone, /* nothing seen */
ttypedseen, /* typedef keyword seen */
tinbody, /* inside typedef body */
tend, /* just before typedef tag */
tignore /* junk after typedef tag */
} typdef;
/*
* struct-like structures (enum, struct and union) are recognized
* using another simple finite automaton. `structdef' is its state
* variable.
*/
enum
{
snone, /* nothing seen yet */
skeyseen, /* struct-like keyword seen */
stagseen, /* struct-like tag seen */
scolonseen, /* colon seen after struct-like tag */
sinbody /* in struct body: recognize member func defs*/
} structdef;
/*
* When structdef is stagseen, scolonseen, or sinbody, structtag is the
* struct tag, and structtype is the type of the preceding struct-like
* keyword.
*/
char *structtag = "<uninited>";
enum sym_type structtype;
#ifdef OO_BROWSER
void
oo_browser_check_and_clear_structtype(void)
{
/* Allow for multiple enum_label tags. */
if (structtype != st_C_enum)
structtype = st_none;
}
#endif
/*
* When objdef is different from onone, objtag is the name of the class.
*/
char *objtag = "<uninited>";
/*
* Yet another little state machine to deal with preprocessor lines.
*/
enum
{
dnone, /* nothing seen */
dsharpseen, /* '#' seen as first char on line */
ddefineseen, /* '#' and 'define' seen */
dignorerest /* ignore rest of line */
} definedef;
/*
* State machine for Objective C protocols and implementations.
* Tom R.Hageman <tom@basil.icce.rug.nl>
*/
enum
{
onone, /* nothing seen */
oprotocol, /* @interface or @protocol seen */
oimplementation, /* @implementations seen */
otagseen, /* class name seen */
oparenseen, /* parenthesis before category seen */
ocatseen, /* category name seen */
oinbody, /* in @implementation body */
omethodsign, /* in @implementation body, after +/- */
omethodtag, /* after method name */
omethodcolon, /* after method colon */
omethodparm, /* after method parameter */
oignore /* wait for @end */
} objdef;
/*
* Use this structure to keep info about the token read, and how it
* should be tagged. Used by the make_C_tag function to build a tag.
*/
typedef struct
{
bool valid;
char *str;
bool named;
int linelen;
int lineno;
long linepos;
char *buffer;
} token;
token tok; /* latest token read */
/*
* Set this to TRUE, and the next token considered is called a function.
* Used only for GNU emacs's function-defining macros.
*/
bool next_token_is_func;
/*
* TRUE in the rules part of a yacc file, FALSE outside (parse as C).
*/
bool yacc_rules;
/*
* methodlen is the length of the method name stored in token_name.
*/
int methodlen;
#ifdef OO_BROWSER
void
oo_browser_clear_all_globals(void)
{
/* Initialize globals so there is no carry over between files. */
oo_browser_construct = C_NULL;
fvdef = fvnone; typdef = tnone; structdef = snone;
definedef = dnone; objdef = onone;
structtype = st_none;
next_token_is_func = yacc_rules = FALSE;
}
void
oo_browser_clear_some_globals(void)
{
oo_browser_construct = C_NULL;
structtype = st_none;
}
#endif
/*
* consider_token ()
* checks to see if the current token is at the start of a
* function or variable, or corresponds to a typedef, or
* is a struct/union/enum tag, or #define, or an enum constant.
*
* *IS_FUNC gets TRUE iff the token is a function or #define macro
* with args. C_EXT is which language we are looking at.
*
* In the future we will need some way to adjust where the end of
* the token is; for instance, implementing the C++ keyword
* `operator' properly will adjust the end of the token to be after
* whatever follows `operator'.
*
* Globals
* fvdef IN OUT
* structdef IN OUT
* definedef IN OUT
* typdef IN OUT
* objdef IN OUT
* next_token_is_func IN OUT
*/
bool consider_token PP ((char *str, int len, int c, int c_ext,
int cblev, int parlev, bool *is_func_or_var));
bool
consider_token (str, len, c, c_ext, cblev, parlev, is_func_or_var)
register char *str; /* IN: token pointer */
register int len; /* IN: token length */
register int c; /* IN: first char after the token */
int c_ext; /* IN: C extensions mask */
int cblev; /* IN: curly brace level */
int parlev; /* IN: parenthesis level */
bool *is_func_or_var; /* OUT: function or variable found */
{
enum sym_type toktype = C_symtype (str, len, c_ext);
#ifdef OO_BROWSER
switch (toktype)
{
case st_C_struct:
set_construct(C_STRUCTURE);
break;
case st_C_union:
set_construct(C_UNION);
break;
case st_C_class:
set_construct(C_CLASS);
break;
case st_C_enum:
set_construct(C_ENUMERATION);
break;
case st_C_typedef:
set_construct(C_TYPE);
break;
case st_C_extern:
set_construct(C_EXTERN);
break;
case st_C_inline:
set_construct(C_FUNCTION);
break;
}
#endif
/*
* Advance the definedef state machine.
*/
switch (definedef)
{
case dnone:
/* We're not on a preprocessor line. */
break;
case dsharpseen:
if (toktype == st_C_define)
{
definedef = ddefineseen;
}
else
{
definedef = dignorerest;
}
return FALSE;
case ddefineseen:
/*
* Make a tag for any macro, unless it is a constant
* and constantypedefs is FALSE.
*/
definedef = dignorerest;
#ifndef OO_BROWSER
*is_func_or_var = (c == '(');
#else
{
char *p = str + len * sizeof(char);
if (*p == '(')
/* This must be a macro since there is no
whitespace between the opening parenthesis
and the definition name. */
*is_func_or_var = TRUE;
else
{
*is_func_or_var = FALSE;
/* Handle possible whitespace between macro tag and opening
parenthesis and ensure this is an actual macro.
-- Bob Weiner, Altrasoft, 11/19/1997 */
while (*p && isspace(*p)) p++;
if (*p) c = *p;
/* Skip over nested parentheses. */
if (c == '(')
{
short depth = 1;
while (*++p && depth > 0 && *p != '\n')
{
switch (*p)
{
case '(':
depth++; break;
case ')':
depth--; break;
}
}
/* If this is a macro, we have just passed
the arguments and there will be more on
the line before the NULL character that marks
the end of the line token. */
while (*p == ' ' || *p == '\t') p++;
if (*p) *is_func_or_var = TRUE;
}
}
}
set_construct((*is_func_or_var) ? C_MACRO : C_CONSTANT);
#endif
if (!*is_func_or_var && !constantypedefs)
return FALSE;
else
return TRUE;
case dignorerest:
return FALSE;
default:
error ("internal error: definedef value.", (char *)NULL);
}
/*
* Now typedefs
*/
switch (typdef)
{
case tnone:
if (toktype == st_C_typedef)
{
if (typedefs)
typdef = ttypedseen;
fvdef = fvnone;
return FALSE;
}
break;
case ttypedseen:
switch (toktype)
{
case st_C_const:
set_construct(C_CONSTANT);
/* fall through */
case st_none:
case st_C_typespec:
#ifdef OO_BROWSER
case st_C_extern:
#endif
typdef = tend;
break;
case st_C_struct:
case st_C_enum:
#ifdef OO_BROWSER
case st_C_union:
case st_C_class:
#endif
break;
}
/* Do not return here, so the structdef stuff has a chance. */
break;
case tend:
switch (toktype)
{
case st_C_const:
set_construct(C_CONSTANT);
/* fall through */
case st_C_typespec:
case st_C_struct:
case st_C_enum:
#ifdef OO_BROWSER
case st_C_extern:
case st_C_union:
case st_C_class:
#endif
return FALSE;
}
return TRUE;
}
/*
* This structdef business is currently only invoked when cblev==0.
* It should be recursively invoked whatever the curly brace level,
* and a stack of states kept, to allow for definitions of structs
* within structs.
*
* This structdef business is NOT invoked when we are ctags and the
* file is plain C. This is because a struct tag may have the same
* name as another tag, and this loses with ctags.
*/
switch (toktype)
{
case st_C_javastruct:
if (structdef == stagseen)
structdef = scolonseen;
return FALSE;
case st_C_struct:
case st_C_enum:
#ifdef OO_BROWSER
case st_C_union:
case st_C_class:
case st_C_extern:
#endif
if (typdef == ttypedseen
|| (typedefs_and_cplusplus && cblev == 0 && structdef == snone))
{
structdef = skeyseen;
structtype = toktype;
}
return FALSE;
}
if (structdef == skeyseen)
{
/* Save the tag for struct/union/class, for functions and variables
that may be defined inside. */
#ifndef OO_BROWSER
if (structtype == st_C_struct)
#else
if (structtype == st_C_struct
|| structtype == st_C_union
|| structtype == st_C_class)
#endif
structtag = savenstr (str, len);
else
structtag = "<enum>";
structdef = stagseen;
return TRUE;
}
/* Avoid entering fvdef stuff if typdef is going on. */
if (typdef != tnone)
{
definedef = dnone;
return FALSE;
}
/* Detect GNU macros.
DEFUN note for writers of emacs C code:
The DEFUN macro, used in emacs C source code, has a first arg
that is a string (the lisp function name), and a second arg that
is a C function name. Since etags skips strings, the second arg
is tagged. This is unfortunate, as it would be better to tag the
first arg. The simplest way to deal with this problem would be
to name the tag with a name built from the function name, by
removing the initial 'F' character and substituting '-' for '_'.
Anyway, this assumes that the conventions of naming lisp
functions will never change. Currently, this method is not
implemented, so writers of emacs code are recommended to put the
first two args of a DEFUN on the same line. */
if (definedef == dnone && toktype == st_C_gnumacro)
{
next_token_is_func = TRUE;
return FALSE;
}
if (next_token_is_func)
{
next_token_is_func = FALSE;
fvdef = fignore;
*is_func_or_var = TRUE;
return TRUE;
}
/* Detect Objective C constructs. */
switch (objdef)
{
case onone:
switch (toktype)
{
case st_C_objprot:
#ifdef OO_BROWSER
set_construct(C_OBJC);
#endif
objdef = oprotocol;
return FALSE;
case st_C_objimpl:
#ifdef OO_BROWSER
set_construct(C_OBJC);
#endif
objdef = oimplementation;
return FALSE;
}
break;
case oimplementation:
/* Save the class tag for functions or variables defined inside. */
objtag = savenstr (str, len);
objdef = oinbody;
return FALSE;
case oprotocol:
/* Save the class tag for categories. */
objtag = savenstr (str, len);
objdef = otagseen;
*is_func_or_var = TRUE;
return TRUE;
case oparenseen:
objdef = ocatseen;
*is_func_or_var = TRUE;
return TRUE;
case oinbody:
break;
case omethodsign:
if (parlev == 0)
{
objdef = omethodtag;
methodlen = len;
grow_linebuffer (&token_name, methodlen + 1);
strncpy (token_name.buffer, str, len);
token_name.buffer[methodlen] = '\0';
token_name.len = methodlen;
return TRUE;
}
return FALSE;
case omethodcolon:
if (parlev == 0)
objdef = omethodparm;
return FALSE;
case omethodparm:
if (parlev == 0)
{
objdef = omethodtag;
methodlen += len;
grow_linebuffer (&token_name, methodlen + 1);
strncat (token_name.buffer, str, len);
token_name.len = methodlen;
return TRUE;
}
return FALSE;
case oignore:
if (toktype == st_C_objend)
{
/* Memory leakage here: the string pointed by objtag is
never released, because many tests would be needed to
avoid breaking on incorrect input code. The amount of
memory leaked here is the sum of the lengths of the
class tags.
free (objtag); */
objdef = onone;
}
return FALSE;
}
/* A function, variable or enum constant? */
switch (toktype)
{
case st_C_const:
set_construct(C_CONSTANT);
/* fall through */
case st_C_typespec:
#ifdef OO_BROWSER
case st_C_extern:
#endif
if (fvdef != finlist && fvdef != fignore && fvdef != vignore)
fvdef = fvnone; /* should be useless */
return FALSE;
case st_C_ignore:
fvdef = vignore;
return FALSE;
case st_none:
if (constantypedefs && structdef == sinbody && structtype == st_C_enum)
#ifdef OO_BROWSER
{
oo_browser_construct = C_ENUM_LABEL;
#endif
return TRUE;
#ifdef OO_BROWSER
}
#endif
if (fvdef == fvnone)
{
fvdef = fvnameseen; /* function or variable */
*is_func_or_var = TRUE;
return TRUE;
}
}
return FALSE;
}
/*
* C_entries ()
* This routine finds functions, variables, typedefs,
* #define's, enum constants and struct/union/enum definitions in
* #C syntax and adds them to the list.
*/
#define current_lb_is_new (newndx == curndx)
#define switch_line_buffers() (curndx = 1 - curndx)
#define curlb (lbs[curndx].lb)
#define othlb (lbs[1-curndx].lb)
#define newlb (lbs[newndx].lb)
#define curlinepos (lbs[curndx].linepos)
#define othlinepos (lbs[1-curndx].linepos)
#define newlinepos (lbs[newndx].linepos)
#define CNL_SAVE_DEFINEDEF() \
do { \
curlinepos = charno; \
lineno++; \
linecharno = charno; \
charno += readline (&curlb, inf); \
lp = curlb.buffer; \
quotednl = FALSE; \
newndx = curndx; \
} while (0)
#define CNL() \
do { \
CNL_SAVE_DEFINEDEF(); \
if (savetok.valid) \
{ \
tok = savetok; \
savetok.valid = FALSE; \
} \
definedef = dnone; \
} while (0)
void make_C_tag PP ((bool isfun));
void
make_C_tag (isfun)
bool isfun;
{
/* This function should never be called when tok.valid is FALSE, but
we must protect against invalid input or internal errors. */
if (tok.valid)
{
if (traditional_tag_style)
{
/* This was the original code. Now we call new_pfnote instead,
which uses the new method for naming tags (see new_pfnote). */
char *name = NULL;
if (CTAGS || tok.named)
name = savestr (token_name.buffer);
pfnote (name, isfun,
tok.buffer, tok.linelen, tok.lineno, tok.linepos);
}
else
new_pfnote (token_name.buffer, token_name.len, isfun,
tok.buffer, tok.linelen, tok.lineno, tok.linepos);
tok.valid = FALSE;
}
else if (DEBUG)
abort ();
}
void
C_entries (c_ext, inf)
int c_ext; /* extension of C */
FILE *inf; /* input file */
{
register char c; /* latest char read; '\0' for end of line */
register char *lp; /* pointer one beyond the character `c' */
int curndx, newndx; /* indices for current and new lb */
register int tokoff; /* offset in line of start of current token */
register int toklen; /* length of current token */
char *qualifier; /* string used to qualify names */
int qlen; /* length of qualifier */
int cblev; /* current curly brace level */
int parlev; /* current parenthesis level */
bool incomm, inquote, inchar, quotednl, midtoken;
bool cplpl, cjava;
token savetok; /* token saved during preprocessor handling */
tokoff = toklen = 0; /* keep compiler quiet */
curndx = newndx = 0;
lineno = 0;
charno = 0;
lp = curlb.buffer;
*lp = 0;
fvdef = fvnone; typdef = tnone; structdef = snone;
definedef = dnone; objdef = onone;
next_token_is_func = yacc_rules = FALSE;
midtoken = inquote = inchar = incomm = quotednl = FALSE;
tok.valid = savetok.valid = FALSE;
cblev = 0;
parlev = 0;
cplpl = (c_ext & C_PLPL) == C_PLPL;
cjava = (c_ext & C_JAVA) == C_JAVA;
if (cjava)
{ qualifier = "."; qlen = 1; }
else
{ qualifier = "::"; qlen = 2; }
while (!feof (inf))
{
c = *lp++;
if (c == '\\')
{
/* If we're at the end of the line, the next character is a
'\0'; don't skip it, because it's the thing that tells us
to read the next line. */
if (*lp == '\0')
{
quotednl = TRUE;
continue;
}
lp++;
c = ' ';
}
else if (incomm)
{
switch (c)
{
case '*':
if (*lp == '/')
{
c = *lp++;
incomm = FALSE;
}
break;
case '\0':
/* Newlines inside comments do not end macro definitions in
traditional cpp. */
CNL_SAVE_DEFINEDEF ();
break;
}
continue;
}
else if (inquote)
{
switch (c)
{
case '"':
inquote = FALSE;
break;
case '\0':
/* Newlines inside strings do not end macro definitions
in traditional cpp, even though compilers don't
usually accept them. */
CNL_SAVE_DEFINEDEF ();
break;
}
continue;
}
else if (inchar)
{
switch (c)
{
case '\0':
/* Hmmm, something went wrong. */
CNL ();
/* FALLTHRU */
case '\'':
inchar = FALSE;
break;
}
continue;
}
else
switch (c)
{
case '"':
inquote = TRUE;
if (fvdef != finlist && fvdef != fignore && fvdef !=vignore)
fvdef = fvnone;
continue;
case '\'':
inchar = TRUE;
if (fvdef != finlist && fvdef != fignore && fvdef !=vignore)
fvdef = fvnone;
continue;
case '/':
if (*lp == '*')
{
lp++;
incomm = TRUE;
continue;
}
else if (/* cplpl && */ *lp == '/')
{
c = '\0';
break;
}
else
break;
case '%':
if ((c_ext & YACC) && *lp == '%')
{
/* entering or exiting rules section in yacc file */
lp++;
definedef = dnone; fvdef = fvnone;
typdef = tnone; structdef = snone;
next_token_is_func = FALSE;
midtoken = inquote = inchar = incomm = quotednl = FALSE;
cblev = 0;
yacc_rules = !yacc_rules;
continue;
}
else
break;
case '#':
if (definedef == dnone)
{
char *cp;
bool cpptoken = TRUE;
/* Look back on this line. If all blanks, or nonblanks
followed by an end of comment, this is a preprocessor
token. */
for (cp = newlb.buffer; cp < lp-1; cp++)
if (!iswhite (*cp))
{
if (*cp == '*' && *(cp+1) == '/')
{
cp++;
cpptoken = TRUE;
}
else
cpptoken = FALSE;
}
if (cpptoken)
definedef = dsharpseen;
} /* if (definedef == dnone) */
continue;
} /* switch (c) */
/* Consider token only if some complicated conditions are satisfied. */
if ((definedef != dnone
|| (cblev == 0 && structdef != scolonseen)
|| (cblev == 1 && cplpl && structdef == sinbody)
|| (structdef == sinbody && structtype == st_C_enum))
&& typdef != tignore
&& definedef != dignorerest
&& fvdef != finlist)
{
if (midtoken)
{
if (endtoken (c))
{
if (c == ':' && cplpl && *lp == ':' && begtoken(*(lp + 1)))
{
/*
* This handles :: in the middle, but not at the
* beginning of an identifier.
*/
lp += 2;
toklen += 3;
#ifdef OO_BROWSER
set_construct(C_METHOD);
#endif
}
else
{
bool funorvar = FALSE;
if (yacc_rules
|| consider_token (newlb.buffer + tokoff, toklen, c,
c_ext, cblev, parlev, &funorvar))
{
tok.named = FALSE;
if (structdef == sinbody
&& definedef == dnone
&& funorvar)
/* function or var defined in C++ class body */
{
int len = strlen (structtag) + qlen + toklen;
grow_linebuffer (&token_name, len + 1);
strcpy (token_name.buffer, structtag);
strcat (token_name.buffer, qualifier);
strncat (token_name.buffer,
newlb.buffer + tokoff, toklen);
token_name.len = len;
tok.named = TRUE;
#ifdef OO_BROWSER
oo_browser_construct = C_METHOD;
#endif
}
else if (objdef == ocatseen)
/* Objective C category */
{
int len = strlen (objtag) + 2 + toklen;
grow_linebuffer (&token_name, len + 1);
strcpy (token_name.buffer, objtag);
strcat (token_name.buffer, "(");
strncat (token_name.buffer,
newlb.buffer + tokoff, toklen);
strcat (token_name.buffer, ")");
token_name.len = len;
tok.named = TRUE;
#ifdef OO_BROWSER
oo_browser_construct = C_OBJC;
#endif
}
else if (objdef == omethodtag
|| objdef == omethodparm)
/* Objective C method */
{
tok.named = TRUE;
#ifdef OO_BROWSER
oo_browser_construct = C_OBJC;
#endif
}
else
{
grow_linebuffer (&token_name, toklen + 1);
strncpy (token_name.buffer,
newlb.buffer + tokoff, toklen);
token_name.buffer[toklen] = '\0';
token_name.len = toklen;
/* Name macros. */
tok.named
= (structdef == stagseen
|| typdef == tend
#ifdef OO_BROWSER
/* Also name #define constants,
enumerations and enum_labels.
Conditionalize `funorvar' reference
here or #defines will appear without
their #names.
-- Bob Weiner, Altrasoft, 4/25/1998 */
|| ((oo_browser_format || funorvar)
&& definedef == dignorerest)
|| (oo_browser_format
&& (oo_browser_construct == C_ENUMERATION
|| oo_browser_construct == C_ENUM_LABEL))
#else
|| (funorvar
&& definedef == dignorerest)
#endif
);
}
tok.lineno = lineno;
tok.linelen = tokoff + toklen + 1;
tok.buffer = newlb.buffer;
tok.linepos = newlinepos;
tok.valid = TRUE;
if (definedef == dnone
&& (fvdef == fvnameseen
|| structdef == stagseen
|| typdef == tend
|| objdef != onone))
{
if (current_lb_is_new)
switch_line_buffers ();
}
else
make_C_tag (funorvar);
}
midtoken = FALSE;
}
} /* if (endtoken (c)) */
else if (intoken (c))
{
toklen++;
continue;
}
} /* if (midtoken) */
else if (begtoken (c))
{
switch (definedef)
{
case dnone:
switch (fvdef)
{
case fstartlist:
fvdef = finlist;
continue;
case flistseen:
#ifdef OO_BROWSER
set_construct(C_MACRO);
#endif
make_C_tag (TRUE); /* a function */
fvdef = fignore;
break;
case fvnameseen:
fvdef = fvnone;
break;
}
if (structdef == stagseen && !cjava)
structdef = snone;
break;
case dsharpseen:
savetok = tok;
}
if (!yacc_rules || lp == newlb.buffer + 1)
{
tokoff = lp - 1 - newlb.buffer;
toklen = 1;
midtoken = TRUE;
}
continue;
} /* if (begtoken) */
} /* if must look at token */
/* Detect end of line, colon, comma, semicolon and various braces
after having handled a token.*/
switch (c)
{
case ':':
if (definedef != dnone)
break;
switch (objdef)
{
case otagseen:
objdef = oignore;
make_C_tag (TRUE); /* an Objective C class */
break;
case omethodtag:
case omethodparm:
objdef = omethodcolon;
methodlen += 1;
grow_linebuffer (&token_name, methodlen + 1);
strcat (token_name.buffer, ":");
token_name.len = methodlen;
break;
}
if (structdef == stagseen)
structdef = scolonseen;
else
switch (fvdef)
{
case fvnameseen:
if (yacc_rules)
{
make_C_tag (FALSE); /* a yacc function */
fvdef = fignore;
}
break;
case fstartlist:
fvdef = fvnone;
break;
}
break;
case ';':
if (definedef != dnone)
break;
if (cblev == 0)
switch (typdef)
{
case tend:
#ifdef OO_BROWSER
set_construct(C_TYPE);
#endif
make_C_tag (FALSE); /* a typedef */
/* FALLTHRU */
default:
typdef = tnone;
}
switch (fvdef)
{
case fignore:
break;
case fvnameseen:
if ((globals && cblev == 0) || (members && cblev == 1))
#ifndef OO_BROWSER
make_C_tag (FALSE); /* a variable */
#else
/* if (constantypedefs && structdef == snone)*/
{
tok.named = TRUE;
switch (structtype)
{
case st_C_enum:
set_construct(C_ENUMERATION);
break;
case st_C_class:
set_construct(C_CLASS);
break;
default:
set_construct(C_VARIABLE);
break;
}
make_C_tag (FALSE);
/* Force reset of st_C_enum structtype value. */
structtype = st_none;
}
#endif
/* FALLTHRU */
default:
fvdef = fvnone;
/* The following instruction invalidates the token.
Probably the token should be invalidated in all
other cases where some state machine is reset. */
tok.valid = FALSE;
}
if (structdef == stagseen)
structdef = snone;
break;
case ',':
if (definedef != dnone)
break;
switch (objdef)
{
case omethodtag:
case omethodparm:
make_C_tag (TRUE); /* an Objective C method */
objdef = oinbody;
break;
}
switch (fvdef)
{
case finlist:
case fignore:
case vignore:
break;
case fvnameseen:
if ((globals && cblev == 0) || (members && cblev == 1))
make_C_tag (FALSE); /* a variable */
break;
default:
fvdef = fvnone;
}
if (structdef == stagseen)
structdef = snone;
break;
case '[':
if (definedef != dnone)
break;
if (cblev == 0 && typdef == tend)
{
#ifdef OO_BROWSER
set_construct(C_TYPE);
#endif
typdef = tignore;
make_C_tag (FALSE); /* a typedef */
break;
}
switch (fvdef)
{
case finlist:
case fignore:
case vignore:
break;
case fvnameseen:
#ifndef OO_BROWSER
if ((globals && cblev == 0) || (members && cblev == 1))
make_C_tag (FALSE); /* a variable */
#else
if (constantypedefs && structdef == snone)
{
tok.named = TRUE;
switch (structtype)
{
case st_C_enum:
set_construct(C_ENUMERATION);
break;
case st_C_class:
set_construct(C_CLASS);
break;
default:
set_construct(C_VARIABLE);
break;
}
make_C_tag (FALSE);
/* Force reset of st_C_enum structtype value. */
structtype = st_none;
}
#endif
/* FALLTHRU */
default:
fvdef = fvnone;
}
if (structdef == stagseen)
structdef = snone;
break;
case '(':
if (definedef != dnone)
break;
if (objdef == otagseen && parlev == 0)
objdef = oparenseen;
switch (fvdef)
{
case fvnone:
switch (typdef)
{
case ttypedseen:
case tend:
if (tok.valid && *lp != '*')
{
/* This handles constructs like:
typedef void OperatorFun (int fun); */
typdef = tignore;
#ifdef OO_BROWSER
set_construct(C_TYPE);
#endif
make_C_tag (FALSE);
}
break;
} /* switch (typdef) */
break;
case fvnameseen:
fvdef = fstartlist;
break;
case flistseen:
fvdef = finlist;
break;
}
parlev++;
break;
case ')':
if (definedef != dnone)
break;
if (objdef == ocatseen && parlev == 1)
{
make_C_tag (TRUE); /* an Objective C category */
objdef = oignore;
}
if (--parlev == 0)
{
switch (fvdef)
{
case fstartlist:
case finlist:
fvdef = flistseen;
break;
}
if (cblev == 0 && typdef == tend)
{
#ifdef OO_BROWSER
set_construct(C_TYPE);
#endif
typdef = tignore;
make_C_tag (FALSE); /* a typedef */
}
}
else if (parlev < 0) /* can happen due to ill-conceived #if's. */
parlev = 0;
break;
case '{':
if (definedef != dnone)
break;
if (typdef == ttypedseen)
typdef = tinbody;
switch (structdef)
{
case skeyseen: /* unnamed struct */
structdef = sinbody;
structtag = "_anonymous_";
break;
case stagseen:
case scolonseen: /* named struct */
structdef = sinbody;
make_C_tag (FALSE); /* a struct */
break;
}
switch (fvdef)
{
case flistseen:
#ifdef OO_BROWSER
set_construct(C_FUNCTION);
/* Ensure function name is recorded.
-- Bob Weiner, Altrasoft */
tok.named = TRUE;
#endif
make_C_tag (TRUE); /* a function */
/* FALLTHRU */
case fignore:
fvdef = fvnone;
break;
case fvnone:
switch (objdef)
{
case otagseen:
make_C_tag (TRUE); /* an Objective C class */
objdef = oignore;
break;
case omethodtag:
case omethodparm:
make_C_tag (TRUE); /* an Objective C method */
objdef = oinbody;
break;
default:
/* Neutralize `extern "C" {' grot. */
if (cblev == 0 && structdef == snone && typdef == tnone)
cblev = -1;
}
}
cblev++;
break;
case '*':
if (definedef != dnone)
break;
if (fvdef == fstartlist)
fvdef = fvnone; /* avoid tagging `foo' in `foo (*bar()) ()' */
break;
case '}':
if (definedef != dnone)
break;
if (!noindentypedefs && lp == newlb.buffer + 1)
{
cblev = 0; /* reset curly brace level if first column */
parlev = 0; /* also reset paren level, just in case... */
}
else if (cblev > 0)
cblev--;
if (cblev == 0)
{
if (typdef == tinbody)
typdef = tend;
/* Memory leakage here: the string pointed by structtag is
never released, because I fear to miss something and
break things while freeing the area. The amount of
memory leaked here is the sum of the lengths of the
struct tags.
if (structdef == sinbody)
free (structtag); */
structdef = snone;
structtag = "<error>";
#ifdef OO_BROWSER
/* Next line added to avoid any state carryover between
functions. -- Bob Weiner, Altrasoft, 11/19/1997 */
fvdef = fvnone; oo_browser_construct = C_NULL;
#endif
}
break;
case '=':
if (definedef != dnone)
break;
#ifdef OO_BROWSER
{
int is_method = 0;
#endif
switch (fvdef)
{
case finlist:
case fignore:
case vignore:
break;
case fvnameseen:
if ((globals && cblev == 0) || (members && cblev == 1))
#ifndef OO_BROWSER
make_C_tag (FALSE); /* a variable */
#else
{
tok.named = TRUE;
switch (structtype)
{
case st_C_enum:
set_construct(C_ENUMERATION);
break;
case st_C_class:
set_construct(C_CLASS);
break;
default:
/* a global variable */
set_construct(C_VARIABLE);
break;
}
/* ootags categorizes each tag found whereas etags doesn't.
Set the is_method flag if this tag has been marked as
such by an earlier section of code.
-- Steve Baur, Altrasoft, 5/7/1998 */
is_method = (oo_browser_construct == C_METHOD);
make_C_tag (FALSE);
/* Force reset of st_C_enum structtype value. */
structtype = st_none;
}
#endif
/* FALLTHRU */
default:
#ifdef OO_BROWSER
fvdef = is_method ? fignore : vignore;
#else
fvdef = vignore;
#endif
}
#ifdef OO_BROWSER
}
#endif
break;
case '+':
case '-':
if (objdef == oinbody && cblev == 0)
{
objdef = omethodsign;
break;
}
/* FALLTHRU */
case '#': case '~': case '&': case '%': case '/': case '|':
case '^': case '!': case '<': case '>': case '.': case '?': case ']':
if (definedef != dnone)
break;
#ifdef OO_BROWSER
if (!cplpl)
{
#endif
/* The above characters cannot follow a function tag in C, so
unmark this as a function entry. For C++, these characters
may follow an `operator' function construct, so skip the
unmarking conditional below.
-- Steve Baur, Altrasoft, 5/7/1998 */
if (fvdef != finlist && fvdef != fignore && fvdef != vignore)
fvdef = fvnone;
#ifdef OO_BROWSER
}
#endif
break;
case '\0':
if (objdef == otagseen)
{
make_C_tag (TRUE); /* an Objective C class */
objdef = oignore;
}
/* If a macro spans multiple lines don't reset its state. */
if (quotednl)
CNL_SAVE_DEFINEDEF ();
else
CNL ();
break;
} /* switch (c) */
} /* while not eof */
}
/*
* Process either a C++ file or a C file depending on the setting
* of a global flag.
*/
void
default_C_entries (inf)
FILE *inf;
{
C_entries (cplusplus ? C_PLPL : 0, inf);
}
/* Always do plain ANSI C. */
void
plain_C_entries (inf)
FILE *inf;
{
C_entries (0, inf);
}
/* Always do C++. */
void
Cplusplus_entries (inf)
FILE *inf;
{
C_entries (C_PLPL, inf);
}
/* Always do Java. */
void
Cjava_entries (inf)
FILE *inf;
{
C_entries (C_JAVA, inf);
}
/* Always do C*. */
void
Cstar_entries (inf)
FILE *inf;
{
C_entries (C_STAR, inf);
}
/* Always do Yacc. */
void
Yacc_entries (inf)
FILE *inf;
{
C_entries (YACC, inf);
}
/* A useful macro. */
#define LOOP_ON_INPUT_LINES(file_pointer, line_buffer, char_pointer) \
for (lineno = charno = 0; /* loop initialization */ \
!feof (file_pointer) /* loop test */ \
&& (lineno++, /* instructions at start of loop */ \
linecharno = charno, \
charno += readline (&line_buffer, file_pointer), \
char_pointer = lb.buffer, \
TRUE); \
)
/*
* Read a file, but do no processing. This is used to do regexp
* matching on files that have no language defined.
*/
void
just_read_file (inf)
FILE *inf;
{
register char *dummy;
LOOP_ON_INPUT_LINES (inf, lb, dummy)
continue;
}
/* Fortran parsing */
bool tail PP ((char *cp));
bool
tail (cp)
char *cp;
{
register int len = 0;
while (*cp && lowcase(*cp) == lowcase(dbp[len]))
cp++, len++;
if (*cp == '\0' && !intoken(dbp[len]))
{
dbp += len;
return TRUE;
}
return FALSE;
}
void
takeprec ()
{
dbp = skip_spaces (dbp);
if (*dbp != '*')
return;
dbp++;
dbp = skip_spaces (dbp);
if (strneq (dbp, "(*)", 3))
{
dbp += 3;
return;
}
if (!isdigit (*dbp))
{
--dbp; /* force failure */
return;
}
do
dbp++;
while (isdigit (*dbp));
}
void getit PP ((FILE *inf));
void
getit (inf)
FILE *inf;
{
register char *cp;
dbp = skip_spaces (dbp);
if (*dbp == '\0')
{
lineno++;
linecharno = charno;
charno += readline (&lb, inf);
dbp = lb.buffer;
if (dbp[5] != '&')
return;
dbp += 6;
dbp = skip_spaces (dbp);
}
if (!isalpha (*dbp)
&& *dbp != '_'
&& *dbp != '$')
return;
for (cp = dbp + 1; *cp && intoken (*cp); cp++)
continue;
pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
void
Fortran_functions (inf)
FILE *inf;
{
LOOP_ON_INPUT_LINES (inf, lb, dbp)
{
if (*dbp == '%')
dbp++; /* Ratfor escape to fortran */
dbp = skip_spaces (dbp);
if (*dbp == '\0')
continue;
switch (lowcase (*dbp))
{
case 'i':
if (tail ("integer"))
takeprec ();
break;
case 'r':
if (tail ("real"))
takeprec ();
break;
case 'l':
if (tail ("logical"))
takeprec ();
break;
case 'c':
if (tail ("complex") || tail ("character"))
takeprec ();
break;
case 'd':
if (tail ("double"))
{
dbp = skip_spaces (dbp);
if (*dbp == '\0')
continue;
if (tail ("precision"))
break;
continue;
}
break;
}
dbp = skip_spaces (dbp);
if (*dbp == '\0')
continue;
switch (lowcase (*dbp))
{
case 'f':
if (tail ("function"))
getit (inf);
continue;
case 's':
if (tail ("subroutine"))
getit (inf);
continue;
case 'e':
if (tail ("entry"))
getit (inf);
continue;
case 'p':
if (tail ("program"))
{
getit (inf);
continue;
}
if (tail ("procedure"))
getit (inf);
continue;
}
}
}
/*
* Bob Weiner, Motorola Inc., 4/3/94
* Unix and microcontroller assembly tag handling
* look for '^[a-zA-Z_.$][a-zA_Z0-9_.$]*[: ^I^J]'
*/
void
Asm_labels (FILE *inf)
{
register char *cp;
LOOP_ON_INPUT_LINES (inf, lb, cp)
{
/* If first char is alphabetic or one of [_.$], test for colon
following identifier. */
if (isalpha (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
{
/* Read past label. */
cp++;
while (isalnum (*cp) || *cp == '_' || *cp == '.' || *cp == '$')
cp++;
if (*cp == ':' || isspace (*cp))
{
/* Found end of label, so copy it and add it to the table. */
pfnote ((CTAGS) ? savenstr(lb.buffer, cp-lb.buffer) : NULL, TRUE,
lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
}
}
}
/*
* Perl support by Bart Robinson <lomew@cs.utah.edu>
* enhanced by Michael Ernst <mernst@alum.mit.edu>
* Perl sub names: look for /^sub[ \t\n]+[^ \t\n{]+/
* Perl variable names: /^(my|local).../
*/
void
Perl_functions (inf)
FILE *inf;
{
register char *cp;
LOOP_ON_INPUT_LINES (inf, lb, cp)
{
if (*cp++ == 's'
&& *cp++ == 'u'
&& *cp++ == 'b' && isspace (*cp++))
{
cp = skip_spaces (cp);
if (*cp != '\0')
{
while (*cp != '\0'
&& !isspace (*cp) && *cp != '{' && *cp != '(')
cp++;
pfnote ((CTAGS) ? savenstr(lb.buffer, cp-lb.buffer) : NULL, TRUE,
lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
}
else if (globals /* only if tagging global vars is enabled */
&& ((cp = lb.buffer,
*cp++ == 'm'
&& *cp++ == 'y')
|| (cp = lb.buffer,
*cp++ == 'l'
&& *cp++ == 'o'
&& *cp++ == 'c'
&& *cp++ == 'a'
&& *cp++ == 'l'))
&& (*cp == '(' || isspace (*cp)))
{
/* After "my" or "local", but before any following paren or space. */
char *varname = NULL;
cp = skip_spaces (cp);
if (*cp == '$' || *cp == '@' || *cp == '%')
{
char* varstart = ++cp;
while (isalnum (*cp) || *cp == '_')
cp++;
varname = savenstr (varstart, cp-varstart);
}
else
{
/* Should be examining a variable list at this point;
could insist on seeing an open parenthesis. */
while (*cp != '\0' && *cp != ';' && *cp != '=' && *cp != ')')
cp++;
}
/* Perhaps I should back cp up one character, so the TAGS table
doesn't mention (and so depend upon) the following char. */
pfnote ((CTAGS) ? savenstr (lb.buffer, cp-lb.buffer) : varname,
FALSE, lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
}
}
/*
* Python support by Eric S. Raymond <esr@thyrsus.com>
* Look for /^def[ \t\n]+[^ \t\n(:]+/ or /^class[ \t\n]+[^ \t\n(:]+/
*/
void
Python_functions (inf)
FILE *inf;
{
register char *cp;
LOOP_ON_INPUT_LINES (inf, lb, cp)
{
if (*cp++ == 'd'
&& *cp++ == 'e'
&& *cp++ == 'f' && isspace (*cp++))
{
cp = skip_spaces (cp);
while (*cp != '\0' && !isspace (*cp) && *cp != '(' && *cp != ':')
cp++;
pfnote ((char *) NULL, TRUE,
lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
cp = lb.buffer;
if (*cp++ == 'c'
&& *cp++ == 'l'
&& *cp++ == 'a'
&& *cp++ == 's'
&& *cp++ == 's' && isspace (*cp++))
{
cp = skip_spaces (cp);
while (*cp != '\0' && !isspace (*cp) && *cp != '(' && *cp != ':')
cp++;
pfnote ((char *) NULL, TRUE,
lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
}
}
/* Idea by Corny de Souza
* Cobol tag functions
* We could look for anything that could be a paragraph name.
* i.e. anything that starts in column 8 is one word and ends in a full stop.
*/
void
Cobol_paragraphs (inf)
FILE *inf;
{
register char *bp, *ep;
LOOP_ON_INPUT_LINES (inf, lb, bp)
{
if (lb.len < 9)
continue;
bp += 8;
/* If eoln, compiler option or comment ignore whole line. */
if (bp[-1] != ' ' || !isalnum (bp[0]))
continue;
for (ep = bp; isalnum (*ep) || *ep == '-'; ep++)
continue;
if (*ep++ == '.')
pfnote ((CTAGS) ? savenstr (bp, ep-bp) : NULL, TRUE,
lb.buffer, ep - lb.buffer + 1, lineno, linecharno);
}
}
/* Added by Mosur Mohan, 4/22/88 */
/* Pascal parsing */
/*
* Locates tags for procedures & functions. Doesn't do any type- or
* var-definitions. It does look for the keyword "extern" or
* "forward" immediately following the procedure statement; if found,
* the tag is skipped.
*/
void
Pascal_functions (inf)
FILE *inf;
{
linebuffer tline; /* mostly copied from C_entries */
long save_lcno;
int save_lineno, save_len;
char c, *cp, *namebuf;
bool /* each of these flags is TRUE iff: */
incomment, /* point is inside a comment */
inquote, /* point is inside '..' string */
get_tagname, /* point is after PROCEDURE/FUNCTION
keyword, so next item = potential tag */
found_tag, /* point is after a potential tag */
inparms, /* point is within parameter-list */
verify_tag; /* point has passed the parm-list, so the
next token will determine whether this
is a FORWARD/EXTERN to be ignored, or
whether it is a real tag */
save_lcno = save_lineno = save_len = 0; /* keep compiler quiet */
namebuf = NULL; /* keep compiler quiet */
lineno = 0;
charno = 0;
dbp = lb.buffer;
*dbp = '\0';
initbuffer (&tline);
incomment = inquote = FALSE;
found_tag = FALSE; /* have a proc name; check if extern */
get_tagname = FALSE; /* have found "procedure" keyword */
inparms = FALSE; /* found '(' after "proc" */
verify_tag = FALSE; /* check if "extern" is ahead */
while (!feof (inf)) /* long main loop to get next char */
{
c = *dbp++;
if (c == '\0') /* if end of line */
{
lineno++;
linecharno = charno;
charno += readline (&lb, inf);
dbp = lb.buffer;
if (*dbp == '\0')
continue;
if (!((found_tag && verify_tag)
|| get_tagname))
c = *dbp++; /* only if don't need *dbp pointing
to the beginning of the name of
the procedure or function */
}
if (incomment)
{
if (c == '}') /* within { } comments */
incomment = FALSE;
else if (c == '*' && *dbp == ')') /* within (* *) comments */
{
dbp++;
incomment = FALSE;
}
continue;
}
else if (inquote)
{
if (c == '\'')
inquote = FALSE;
continue;
}
else
switch (c)
{
case '\'':
inquote = TRUE; /* found first quote */
continue;
case '{': /* found open { comment */
incomment = TRUE;
continue;
case '(':
if (*dbp == '*') /* found open (* comment */
{
incomment = TRUE;
dbp++;
}
else if (found_tag) /* found '(' after tag, i.e., parm-list */
inparms = TRUE;
continue;
case ')': /* end of parms list */
if (inparms)
inparms = FALSE;
continue;
case ';':
if (found_tag && !inparms) /* end of proc or fn stmt */
{
verify_tag = TRUE;
break;
}
continue;
}
if (found_tag && verify_tag && (*dbp != ' '))
{
/* check if this is an "extern" declaration */
if (*dbp == '\0')
continue;
if (lowcase (*dbp == 'e'))
{
if (tail ("extern")) /* superfluous, really! */
{
found_tag = FALSE;
verify_tag = FALSE;
}
}
else if (lowcase (*dbp) == 'f')
{
if (tail ("forward")) /* check for forward reference */
{
found_tag = FALSE;
verify_tag = FALSE;
}
}
if (found_tag && verify_tag) /* not external proc, so make tag */
{
found_tag = FALSE;
verify_tag = FALSE;
pfnote (namebuf, TRUE,
tline.buffer, save_len, save_lineno, save_lcno);
continue;
}
}
if (get_tagname) /* grab name of proc or fn */
{
if (*dbp == '\0')
continue;
/* save all values for later tagging */
grow_linebuffer (&tline, lb.len + 1);
strcpy (tline.buffer, lb.buffer);
save_lineno = lineno;
save_lcno = linecharno;
/* grab block name */
for (cp = dbp + 1; *cp != '\0' && !endtoken (*cp); cp++)
continue;
namebuf = (CTAGS) ? savenstr (dbp, cp-dbp) : NULL;
dbp = cp; /* set dbp to e-o-token */
save_len = dbp - lb.buffer + 1;
get_tagname = FALSE;
found_tag = TRUE;
continue;
/* and proceed to check for "extern" */
}
else if (!incomment && !inquote && !found_tag)
{
/* check for proc/fn keywords */
switch (lowcase (c))
{
case 'p':
if (tail ("rocedure")) /* c = 'p', dbp has advanced */
get_tagname = TRUE;
continue;
case 'f':
if (tail ("unction"))
get_tagname = TRUE;
continue;
}
}
} /* while not eof */
free (tline.buffer);
}
/*
* lisp tag functions
* look for (def or (DEF, quote or QUOTE
*/
int L_isdef PP ((char *strp));
int
L_isdef (strp)
register char *strp;
{
return ((strp[1] == 'd' || strp[1] == 'D')
&& (strp[2] == 'e' || strp[2] == 'E')
&& (strp[3] == 'f' || strp[3] == 'F'));
}
int L_isquote PP ((char *strp));
int
L_isquote (strp)
register char *strp;
{
return ((*++strp == 'q' || *strp == 'Q')
&& (*++strp == 'u' || *strp == 'U')
&& (*++strp == 'o' || *strp == 'O')
&& (*++strp == 't' || *strp == 'T')
&& (*++strp == 'e' || *strp == 'E')
&& isspace (*++strp));
}
void L_getit PP ((void));
void
L_getit ()
{
register char *cp;
if (*dbp == '\'') /* Skip prefix quote */
dbp++;
else if (*dbp == '(')
{
if (L_isquote (dbp))
dbp += 7; /* Skip "(quote " */
else
dbp += 1; /* Skip "(" before name in (defstruct (foo)) */
dbp = skip_spaces (dbp);
}
for (cp = dbp /*+1*/;
*cp != '\0' && *cp != '(' && *cp != ' ' && *cp != ')';
cp++)
continue;
if (cp == dbp)
return;
pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
void
Lisp_functions (inf)
FILE *inf;
{
LOOP_ON_INPUT_LINES (inf, lb, dbp)
{
if (dbp[0] == '(')
{
if (L_isdef (dbp))
{
dbp = skip_non_spaces (dbp);
dbp = skip_spaces (dbp);
L_getit ();
}
else
{
/* Check for (foo::defmumble name-defined ... */
do
dbp++;
while (*dbp != '\0' && !isspace (*dbp)
&& *dbp != ':' && *dbp != '(' && *dbp != ')');
if (*dbp == ':')
{
do
dbp++;
while (*dbp == ':');
if (L_isdef (dbp - 1))
{
dbp = skip_non_spaces (dbp);
dbp = skip_spaces (dbp);
L_getit ();
}
}
}
}
}
}
/*
* Postscript tag functions
* Just look for lines where the first character is '/'
* Richard Mlynarik <mly@adoc.xerox.com>
*/
void
Postscript_functions (inf)
FILE *inf;
{
register char *bp, *ep;
LOOP_ON_INPUT_LINES (inf, lb, bp)
{
if (bp[0] == '/')
{
for (ep = bp+1;
*ep != '\0' && *ep != ' ' && *ep != '{';
ep++)
continue;
pfnote ((CTAGS) ? savenstr (bp, ep-bp) : NULL, TRUE,
lb.buffer, ep - lb.buffer + 1, lineno, linecharno);
}
}
}
/*
* Scheme tag functions
* look for (def... xyzzy
* look for (def... (xyzzy
* look for (def ... ((...(xyzzy ....
* look for (set! xyzzy
*/
void get_scheme PP ((void));
void
Scheme_functions (inf)
FILE *inf;
{
LOOP_ON_INPUT_LINES (inf, lb, dbp)
{
if (dbp[0] == '('
&& (dbp[1] == 'D' || dbp[1] == 'd')
&& (dbp[2] == 'E' || dbp[2] == 'e')
&& (dbp[3] == 'F' || dbp[3] == 'f'))
{
dbp = skip_non_spaces (dbp);
/* Skip over open parens and white space */
while (isspace (*dbp) || *dbp == '(')
dbp++;
get_scheme ();
}
if (dbp[0] == '('
&& (dbp[1] == 'S' || dbp[1] == 's')
&& (dbp[2] == 'E' || dbp[2] == 'e')
&& (dbp[3] == 'T' || dbp[3] == 't')
&& (dbp[4] == '!' || dbp[4] == '!')
&& (isspace (dbp[5])))
{
dbp = skip_non_spaces (dbp);
dbp = skip_spaces (dbp);
get_scheme ();
}
}
}
void
get_scheme ()
{
register char *cp;
if (*dbp == '\0')
return;
/* Go till you get to white space or a syntactic break */
for (cp = dbp + 1;
*cp != '\0' && *cp != '(' && *cp != ')' && !isspace (*cp);
cp++)
continue;
pfnote ((CTAGS) ? savenstr (dbp, cp-dbp) : NULL, TRUE,
lb.buffer, cp - lb.buffer + 1, lineno, linecharno);
}
/* Find tags in TeX and LaTeX input files. */
/* TEX_toktab is a table of TeX control sequences that define tags.
Each TEX_tabent records one such control sequence.
CONVERT THIS TO USE THE Stab TYPE!! */
struct TEX_tabent
{
char *name;
int len;
};
struct TEX_tabent *TEX_toktab = NULL; /* Table with tag tokens */
/* Default set of control sequences to put into TEX_toktab.
The value of environment var TEXTAGS is prepended to this. */
char *TEX_defenv = "\
:chapter:section:subsection:subsubsection:eqno:label:ref:cite:bibitem\
:part:appendix:entry:index";
void TEX_mode PP ((FILE *inf));
struct TEX_tabent *TEX_decode_env PP ((char *evarname, char *defenv));
int TEX_Token PP ((char *cp));
char TEX_esc = '\\';
char TEX_opgrp = '{';
char TEX_clgrp = '}';
/*
* TeX/LaTeX scanning loop.
*/
void
TeX_functions (inf)
FILE *inf;
{
char *cp, *lasthit;
register int i;
/* Select either \ or ! as escape character. */
TEX_mode (inf);
/* Initialize token table once from environment. */
if (!TEX_toktab)
TEX_toktab = TEX_decode_env ("TEXTAGS", TEX_defenv);
LOOP_ON_INPUT_LINES (inf, lb, cp)
{
lasthit = cp;
/* Look at each esc in line. */
while ((cp = etags_strchr (cp, TEX_esc)) != NULL)
{
if (*++cp == '\0')
break;
linecharno += cp - lasthit;
lasthit = cp;
i = TEX_Token (lasthit);
if (i >= 0)
{
/* We seem to include the TeX command in the tag name.
register char *p;
for (p = lasthit + TEX_toktab[i].len;
*p != '\0' && *p != TEX_clgrp;
p++)
continue; */
pfnote (/*savenstr (lasthit, p-lasthit)*/ (char *)NULL, TRUE,
lb.buffer, lb.len, lineno, linecharno);
break; /* We only tag a line once */
}
}
}
}
#define TEX_LESC '\\'
#define TEX_SESC '!'
#define TEX_cmt '%'
/* Figure out whether TeX's escapechar is '\\' or '!' and set grouping
chars accordingly. */
void
TEX_mode (inf)
FILE *inf;
{
int c;
while ((c = getc (inf)) != EOF)
{
/* Skip to next line if we hit the TeX comment char. */
if (c == TEX_cmt)
while (c != '\n')
c = getc (inf);
else if (c == TEX_LESC || c == TEX_SESC )
break;
}
if (c == TEX_LESC)
{
TEX_esc = TEX_LESC;
TEX_opgrp = '{';
TEX_clgrp = '}';
}
else
{
TEX_esc = TEX_SESC;
TEX_opgrp = '<';
TEX_clgrp = '>';
}
rewind (inf);
}
/* Read environment and prepend it to the default string.
Build token table. */
struct TEX_tabent *
TEX_decode_env (evarname, defenv)
char *evarname;
char *defenv;
{
register char *env, *p;
struct TEX_tabent *tab;
int size, i;
/* Append default string to environment. */
env = getenv (evarname);
if (!env)
env = defenv;
else
{
char *oldenv = env;
env = concat (oldenv, defenv, "");
free (oldenv);
}
/* Allocate a token table */
for (size = 1, p = env; p;)
if ((p = etags_strchr (p, ':')) && *++p != '\0')
size++;
/* Add 1 to leave room for null terminator. */
tab = xnew (size + 1, struct TEX_tabent);
/* Unpack environment string into token table. Be careful about */
/* zero-length strings (leading ':', "::" and trailing ':') */
for (i = 0; *env;)
{
p = etags_strchr (env, ':');
if (!p) /* End of environment string. */
p = env + strlen (env);
if (p - env > 0)
{ /* Only non-zero strings. */
tab[i].name = savenstr (env, p - env);
tab[i].len = strlen (tab[i].name);
i++;
}
if (*p)
env = p + 1;
else
{
tab[i].name = NULL; /* Mark end of table. */
tab[i].len = 0;
break;
}
}
return tab;
}
/* If the text at CP matches one of the tag-defining TeX command names,
return the pointer to the first occurrence of that command in TEX_toktab.
Otherwise return -1.
Keep the capital `T' in `token' for dumb truncating compilers
(this distinguishes it from `TEX_toktab' */
int
TEX_Token (cp)
char *cp;
{
int i;
for (i = 0; TEX_toktab[i].len > 0; i++)
if (strneq (TEX_toktab[i].name, cp, TEX_toktab[i].len))
return i;
return -1;
}
/*
* Prolog support (rewritten) by Anders Lindgren, Mar. 96
*
* Assumes that the predicate starts at column 0.
* Only the first clause of a predicate is added.
*/
int prolog_pred PP ((char *s, char *last));
void prolog_skip_comment PP ((linebuffer *plb, FILE *inf));
int prolog_atom PP ((char *s, int pos));
void
Prolog_functions (inf)
FILE *inf;
{
char *cp, *last;
int len;
int allocated;
allocated = 0;
len = 0;
last = NULL;
LOOP_ON_INPUT_LINES (inf, lb, cp)
{
if (cp[0] == '\0') /* Empty line */
continue;
else if (isspace (cp[0])) /* Not a predicate */
continue;
else if (cp[0] == '/' && cp[1] == '*') /* comment. */
prolog_skip_comment (&lb, inf);
else if ((len = prolog_pred (cp, last)) > 0)
{
/* Predicate. Store the function name so that we only
generate a tag for the first clause. */
if (last == NULL)
last = xnew(len + 1, char);
else if (len + 1 > allocated)
last = xrnew (last, len + 1, char);
allocated = len + 1;
strncpy (last, cp, len);
last[len] = '\0';
}
}
}
void
prolog_skip_comment (plb, inf)
linebuffer *plb;
FILE *inf;
{
char *cp;
do
{
for (cp = plb->buffer; *cp != '\0'; cp++)
if (cp[0] == '*' && cp[1] == '/')
return;
lineno++;
linecharno += readline (plb, inf);
}
while (!feof(inf));
}
/*
* A predicate definition is added if it matches:
* <beginning of line><Prolog Atom><whitespace>(
*
* It is added to the tags database if it doesn't match the
* name of the previous clause header.
*
* Return the size of the name of the predicate, or 0 if no header
* was found.
*/
int
prolog_pred (s, last)
char *s;
char *last; /* Name of last clause. */
{
int pos;
int len;
pos = prolog_atom (s, 0);
if (pos < 1)
return 0;
len = pos;
pos = skip_spaces (s + pos) - s;
if ((s[pos] == '(') || (s[pos] == '.'))
{
if (s[pos] == '(')
pos++;
/* Save only the first clause. */
if (last == NULL
|| len != (int) strlen (last)
|| !strneq (s, last, len))
{
pfnote ((CTAGS) ? savenstr (s, len) : NULL, TRUE,
s, pos, lineno, linecharno);
return len;
}
}
return 0;
}
/*
* Consume a Prolog atom.
* Return the number of bytes consumed, or -1 if there was an error.
*
* A prolog atom, in this context, could be one of:
* - An alphanumeric sequence, starting with a lower case letter.
* - A quoted arbitrary string. Single quotes can escape themselves.
* Backslash quotes everything.
*/
int
prolog_atom (s, pos)
char *s;
int pos;
{
int origpos;
origpos = pos;
if (islower(s[pos]) || (s[pos] == '_'))
{
/* The atom is unquoted. */
pos++;
while (isalnum(s[pos]) || (s[pos] == '_'))
{
pos++;
}
return pos - origpos;
}
else if (s[pos] == '\'')
{
pos++;
while (1)
{
if (s[pos] == '\'')
{
pos++;
if (s[pos] != '\'')
break;
pos++; /* A double quote */
}
else if (s[pos] == '\0')
/* Multiline quoted atoms are ignored. */
return -1;
else if (s[pos] == '\\')
{
if (s[pos+1] == '\0')
return -1;
pos += 2;
}
else
pos++;
}
return pos - origpos;
}
else
return -1;
}
/*
* Support for Erlang -- Anders Lindgren, Feb 1996.
*
* Generates tags for functions, defines, and records.
*
* Assumes that Erlang functions start at column 0.
*/
int erlang_func PP ((char *s, char *last));
void erlang_attribute PP ((char *s));
int erlang_atom PP ((char *s, int pos));
void
Erlang_functions (inf)
FILE *inf;
{
char *cp, *last;
int len;
int allocated;
allocated = 0;
len = 0;
last = NULL;
LOOP_ON_INPUT_LINES (inf, lb, cp)
{
if (cp[0] == '\0') /* Empty line */
continue;
else if (isspace (cp[0])) /* Not function nor attribute */
continue;
else if (cp[0] == '%') /* comment */
continue;
else if (cp[0] == '"') /* Sometimes, strings start in column one */
continue;
else if (cp[0] == '-') /* attribute, e.g. "-define" */
{
erlang_attribute (cp);
last = NULL;
}
else if ((len = erlang_func (cp, last)) > 0)
{
/*
* Function. Store the function name so that we only
* generates a tag for the first clause.
*/
if (last == NULL)
last = xnew (len + 1, char);
else if (len + 1 > allocated)
last = xrnew (last, len + 1, char);
allocated = len + 1;
strncpy (last, cp, len);
last[len] = '\0';
}
}
}
/*
* A function definition is added if it matches:
* <beginning of line><Erlang Atom><whitespace>(
*
* It is added to the tags database if it doesn't match the
* name of the previous clause header.
*
* Return the size of the name of the function, or 0 if no function
* was found.
*/
int
erlang_func (s, last)
char *s;
char *last; /* Name of last clause. */
{
int pos;
int len;
pos = erlang_atom (s, 0);
if (pos < 1)
return 0;
len = pos;
pos = skip_spaces (s + pos) - s;
/* Save only the first clause. */
if (s[pos++] == '('
&& (last == NULL
|| len != (int) strlen (last)
|| !strneq (s, last, len)))
{
pfnote ((CTAGS) ? savenstr (s, len) : NULL, TRUE,
s, pos, lineno, linecharno);
return len;
}
return 0;
}
/*
* Handle attributes. Currently, tags are generated for defines
* and records.
*
* They are on the form:
* -define(foo, bar).
* -define(Foo(M, N), M+N).
* -record(graph, {vtab = notable, cyclic = true}).
*/
void
erlang_attribute (s)
char *s;
{
int pos;
int len;
if (strneq (s, "-define", 7) || strneq (s, "-record", 7))
{
pos = skip_spaces (s + 7) - s;
if (s[pos++] == '(')
{
pos = skip_spaces (s + pos) - s;
len = erlang_atom (s, pos);
if (len != 0)
pfnote ((CTAGS) ? savenstr (& s[pos], len) : NULL, TRUE,
s, pos + len, lineno, linecharno);
}
}
return;
}
/*
* Consume an Erlang atom (or variable).
* Return the number of bytes consumed, or -1 if there was an error.
*/
int
erlang_atom (s, pos)
char *s;
int pos;
{
int origpos;
origpos = pos;
if (isalpha (s[pos]) || s[pos] == '_')
{
/* The atom is unquoted. */
pos++;
while (isalnum (s[pos]) || s[pos] == '_')
pos++;
return pos - origpos;
}
else if (s[pos] == '\'')
{
pos++;
while (1)
{
if (s[pos] == '\'')
{
pos++;
break;
}
else if (s[pos] == '\0')
/* Multiline quoted atoms are ignored. */
return -1;
else if (s[pos] == '\\')
{
if (s[pos+1] == '\0')
return -1;
pos += 2;
}
else
pos++;
}
return pos - origpos;
}
else
return -1;
}
#ifdef ETAGS_REGEXPS
/* Take a string like "/blah/" and turn it into "blah", making sure
that the first and last characters are the same, and handling
quoted separator characters. Actually, stops on the occurrence of
an unquoted separator. Also turns "\t" into a Tab character.
Returns pointer to terminating separator. Works in place. Null
terminates name string. */
char * scan_separators PP ((char *name));
char *
scan_separators (name)
char *name;
{
char sep = name[0];
char *copyto = name;
bool quoted = FALSE;
for (++name; *name != '\0'; ++name)
{
if (quoted)
{
if (*name == 't')
*copyto++ = '\t';
else if (*name == sep)
*copyto++ = sep;
else
{
/* Something else is quoted, so preserve the quote. */
*copyto++ = '\\';
*copyto++ = *name;
}
quoted = FALSE;
}
else if (*name == '\\')
quoted = TRUE;
else if (*name == sep)
break;
else
*copyto++ = *name;
}
/* Terminate copied string. */
*copyto = '\0';
return name;
}
/* Look at the argument of --regex or --no-regex and do the right
thing. Same for each line of a regexp file. */
void
analyse_regex (regex_arg)
char *regex_arg;
{
if (regex_arg == NULL)
free_patterns (); /* --no-regex: remove existing regexps */
/* A real --regexp option or a line in a regexp file. */
switch (regex_arg[0])
{
/* Comments in regexp file or null arg to --regex. */
case '\0':
case ' ':
case '\t':
break;
/* Read a regex file. This is recursive and may result in a
loop, which will stop when the file descriptors are exhausted. */
case '@':
{
FILE *regexfp;
linebuffer regexbuf;
char *regexfile = regex_arg + 1;
/* regexfile is a file containing regexps, one per line. */
regexfp = fopen (regexfile, "r");
if (regexfp == NULL)
{
pfatal (regexfile);
return;
}
initbuffer (®exbuf);
while (readline_internal (®exbuf, regexfp) > 0)
analyse_regex (regexbuf.buffer);
free (regexbuf.buffer);
fclose (regexfp);
}
break;
/* Regexp to be used for a specific language only. */
case '{':
{
language *lang;
char *lang_name = regex_arg + 1;
char *cp;
for (cp = lang_name; *cp != '}'; cp++)
if (*cp == '\0')
{
error ("unterminated language name in regex: %s", regex_arg);
return;
}
*cp = '\0';
lang = get_language_from_name (lang_name);
if (lang == NULL)
return;
add_regex (cp + 1, lang);
}
break;
/* Regexp to be used for any language. */
default:
add_regex (regex_arg, NULL);
break;
}
}
/* Turn a name, which is an ed-style (but Emacs syntax) regular
expression, into a real regular expression by compiling it. */
void
add_regex (regexp_pattern, lang)
char *regexp_pattern;
language *lang;
{
char *name;
const char *err;
struct re_pattern_buffer *patbuf;
pattern *pp;
if (regexp_pattern[strlen(regexp_pattern)-1] != regexp_pattern[0])
{
error ("%s: unterminated regexp", regexp_pattern);
return;
}
name = scan_separators (regexp_pattern);
if (regexp_pattern[0] == '\0')
{
error ("null regexp", (char *)NULL);
return;
}
(void) scan_separators (name);
patbuf = xnew (1, struct re_pattern_buffer);
patbuf->translate = NULL;
patbuf->fastmap = NULL;
patbuf->buffer = NULL;
patbuf->allocated = 0;
err = re_compile_pattern (regexp_pattern, strlen (regexp_pattern), patbuf);
if (err != NULL)
{
error ("%s while compiling pattern", err);
return;
}
pp = p_head;
p_head = xnew (1, pattern);
p_head->regex = savestr (regexp_pattern);
p_head->p_next = pp;
p_head->language = lang;
p_head->pattern = patbuf;
p_head->name_pattern = savestr (name);
p_head->error_signaled = FALSE;
}
/*
* Do the substitutions indicated by the regular expression and
* arguments.
*/
char * substitute PP ((char *in, char *out, struct re_registers *regs));
char *
substitute (in, out, regs)
char *in, *out;
struct re_registers *regs;
{
char *result, *t;
int size, dig, diglen;
result = NULL;
size = strlen (out);
/* Pass 1: figure out how much to allocate by finding all \N strings. */
if (out[size - 1] == '\\')
fatal ("pattern error in \"%s\"", out);
for (t = etags_strchr (out, '\\');
t != NULL;
t = etags_strchr (t + 2, '\\'))
if (isdigit (t[1]))
{
dig = t[1] - '0';
diglen = regs->end[dig] - regs->start[dig];
size += diglen - 2;
}
else
size -= 1;
/* Allocate space and do the substitutions. */
result = xnew (size + 1, char);
for (t = result; *out != '\0'; out++)
if (*out == '\\' && isdigit (*++out))
{
/* Using "dig2" satisfies my debugger. Bleah. */
dig = *out - '0';
diglen = regs->end[dig] - regs->start[dig];
strncpy (t, in + regs->start[dig], diglen);
t += diglen;
}
else
*t++ = *out;
*t = '\0';
if (DEBUG && (t > result + size || t - result != strlen (result)))
abort ();
return result;
}
/* Deallocate all patterns. */
void
free_patterns ()
{
pattern *pp;
while (p_head != NULL)
{
pp = p_head->p_next;
free (p_head->regex);
free (p_head->name_pattern);
free (p_head);
p_head = pp;
}
return;
}
#endif /* ETAGS_REGEXPS */
/* Initialize a linebuffer for use */
void
initbuffer (lbp)
linebuffer *lbp;
{
lbp->size = 200;
lbp->buffer = xnew (200, char);
}
/*
* Read a line of text from `stream' into `lbp', excluding the
* newline or CR-NL, if any. Return the number of characters read from
* `stream', which is the length of the line including the newline.
*
* On DOS or Windows we do not count the CR character, if any, before the
* NL, in the returned length; this mirrors the behavior of emacs on those
* platforms (for text files, it translates CR-NL to NL as it reads in the
* file).
*/
long
readline_internal (lbp, stream)
linebuffer *lbp;
register FILE *stream;
{
char *buffer = lbp->buffer;
register char *p = lbp->buffer;
register char *pend;
int chars_deleted;
pend = p + lbp->size; /* Separate to avoid 386/IX compiler bug. */
while (1)
{
register int c = getc (stream);
if (p == pend)
{
/* We're at the end of linebuffer: expand it. */
lbp->size *= 2;
buffer = xrnew (buffer, lbp->size, char);
p += buffer - lbp->buffer;
pend = buffer + lbp->size;
lbp->buffer = buffer;
}
if (c == EOF)
{
*p = '\0';
chars_deleted = 0;
break;
}
if (c == '\n')
{
if (p > buffer && p[-1] == '\r')
{
p -= 1;
#ifdef WIN32_NATIVE
/* Assume CRLF->LF translation will be performed by Emacs
when loading this file, so CRs won't appear in the buffer.
It would be cleaner to compensate within Emacs;
however, Emacs does not know how many CRs were deleted
before any given point in the file. */
chars_deleted = 1;
#else
chars_deleted = 2;
#endif
}
else
{
chars_deleted = 1;
}
*p = '\0';
break;
}
*p++ = c;
}
lbp->len = p - buffer;
return lbp->len + chars_deleted;
}
/*
* Like readline_internal, above, but in addition try to match the
* input line against relevant regular expressions.
*/
long
readline (lbp, stream)
linebuffer *lbp;
FILE *stream;
{
/* Read new line. */
long result = readline_internal (lbp, stream);
#ifdef ETAGS_REGEXPS
int match;
pattern *pp;
/* Match against relevant patterns. */
if (lbp->len > 0)
for (pp = p_head; pp != NULL; pp = pp->p_next)
{
/* Only use generic regexps or those for the current language. */
if (pp->language != NULL && pp->language != curlang)
continue;
match = re_match (pp->pattern, lbp->buffer, lbp->len, 0, &pp->regs);
switch (match)
{
case -2:
/* Some error. */
if (!pp->error_signaled)
{
error ("error while matching \"%s\"", pp->regex);
pp->error_signaled = TRUE;
}
break;
case -1:
/* No match. */
break;
default:
/* Match occurred. Construct a tag. */
if (pp->name_pattern[0] != '\0')
{
/* Make a named tag. */
char *name = substitute (lbp->buffer,
pp->name_pattern, &pp->regs);
if (name != NULL)
pfnote (name, TRUE, lbp->buffer, match, lineno, linecharno);
}
else
{
/* Make an unnamed tag. */
pfnote ((char *)NULL, TRUE,
lbp->buffer, match, lineno, linecharno);
}
break;
}
}
#endif /* ETAGS_REGEXPS */
return result;
}
/*
* Return a pointer to a space of size strlen(cp)+1 allocated
* with xnew where the string CP has been copied.
*/
char *
savestr (cp)
char *cp;
{
return savenstr (cp, strlen (cp));
}
/*
* Return a pointer to a space of size LEN+1 allocated with xnew where
* the string CP has been copied for at most the first LEN characters.
*/
char *
savenstr (cp, len)
char *cp;
int len;
{
register char *dp;
dp = xnew (len + 1, char);
strncpy (dp, cp, len);
dp[len] = '\0';
return dp;
}
/*
* Return the ptr in sp at which the character c last
* appears; NULL if not found
*
* Identical to System V strrchr, included for portability.
*/
char *
etags_strrchr (sp, c)
register char *sp;
register int c;
{
register char *r;
r = NULL;
do
{
if (*sp == c)
r = sp;
} while (*sp++);
return r;
}
/*
* Return the ptr in sp at which the character c first
* appears; NULL if not found
*
* Identical to System V strchr, included for portability.
*/
char *
etags_strchr (sp, c)
register char *sp;
register int c;
{
do
{
if (*sp == c)
return sp;
} while (*sp++);
return NULL;
}
/* Skip spaces, return new pointer. */
char *
skip_spaces (cp)
char *cp;
{
while (isspace (*cp)) /* isspace('\0')==FALSE */
cp++;
return cp;
}
/* Skip non spaces, return new pointer. */
char *
skip_non_spaces (cp)
char *cp;
{
while (!iswhite (*cp)) /* iswhite('\0')==TRUE */
cp++;
return cp;
}
/* Print error message and exit. */
void
fatal (s1, s2)
char *s1, *s2;
{
error (s1, s2);
exit (BAD);
}
void
pfatal (s1)
char *s1;
{
perror (s1);
exit (BAD);
}
void
suggest_asking_for_help ()
{
fprintf (stderr, "\tTry `%s %s' for a complete list of options.\n",
progname,
#ifdef LONG_OPTIONS
"--help"
#else
"-h"
#endif
);
exit (BAD);
}
/* Print error message. `s1' is printf control string, `s2' is arg for it. */
void
error (s1, s2)
const char *s1, *s2;
{
fprintf (stderr, "%s: ", progname);
fprintf (stderr, s1, s2);
fprintf (stderr, "\n");
}
/* Return a newly-allocated string whose contents
concatenate those of s1, s2, s3. */
char *
concat (s1, s2, s3)
char *s1, *s2, *s3;
{
int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3);
char *result = xnew (len1 + len2 + len3 + 1, char);
strcpy (result, s1);
strcpy (result + len1, s2);
strcpy (result + len1 + len2, s3);
result[len1 + len2 + len3] = '\0';
return result;
}
/* Does the same work as the system V getcwd, but does not need to
guess the buffer size in advance. */
char *
etags_getcwd ()
{
#ifdef HAVE_GETCWD
int bufsize = 200;
char *path = xnew (bufsize, char);
while (getcwd (path, bufsize) == NULL)
{
if (errno != ERANGE)
pfatal ("getcwd");
bufsize *= 2;
free (path);
path = xnew (bufsize, char);
}
canonicalize_filename (path);
return path;
#else /* not HAVE_GETCWD */
linebuffer path;
FILE *pipe;
initbuffer (&path);
pipe = (FILE *) popen ("pwd 2>/dev/null", "r");
if (pipe == NULL || readline_internal (&path, pipe) == 0)
pfatal ("pwd");
pclose (pipe);
return path.buffer;
#endif /* not HAVE_GETCWD */
}
/* Return a newly allocated string containing the file name of FILE
relative to the absolute directory DIR (which should end with a slash). */
char *
relative_filename (file, dir)
char *file, *dir;
{
char *fp, *dp, *afn, *res;
int i;
/* Find the common root of file and dir (with a trailing slash). */
afn = absolute_filename (file, cwd);
fp = afn;
dp = dir;
while (*fp++ == *dp++)
continue;
fp--, dp--; /* back to the first differing char */
do /* look at the equal chars until '/' */
fp--, dp--;
while (*fp != '/');
/* Build a sequence of "../" strings for the resulting relative file name. */
i = 0;
while ((dp = etags_strchr (dp + 1, '/')) != NULL)
i += 1;
res = xnew (3*i + strlen (fp + 1) + 1, char);
res[0] = '\0';
while (i-- > 0)
strcat (res, "../");
/* Add the file name relative to the common root of file and dir. */
strcat (res, fp + 1);
free (afn);
return res;
}
/* Return a newly allocated string containing the absolute file name
of FILE given DIR (which should end with a slash). */
char *
absolute_filename (file, dir)
char *file, *dir;
{
char *slashp, *cp, *res;
if (filename_is_absolute (file))
res = savestr (file);
#ifdef WIN32_NATIVE
/* We don't support non-absolute file names with a drive
letter, like `d:NAME' (it's too much hassle). */
else if (file[1] == ':')
fatal ("%s: relative file names with drive letters not supported", file);
#endif
else
res = concat (dir, file, "");
/* Delete the "/dirname/.." and "/." substrings. */
slashp = etags_strchr (res, '/');
while (slashp != NULL && slashp[0] != '\0')
{
if (slashp[1] == '.')
{
if (slashp[2] == '.'
&& (slashp[3] == '/' || slashp[3] == '\0'))
{
cp = slashp;
do
cp--;
while (cp >= res && !filename_is_absolute (cp));
if (cp < res)
cp = slashp; /* the absolute name begins with "/.." */
#ifdef WIN32_NATIVE
/* Under Windows we get `d:/NAME' as absolute
file name, so the luser could say `d:/../NAME'.
We silently treat this as `d:/NAME'. */
else if (cp[0] != '/')
cp = slashp;
#endif
strcpy (cp, slashp + 3);
slashp = cp;
continue;
}
else if (slashp[2] == '/' || slashp[2] == '\0')
{
strcpy (slashp, slashp + 2);
continue;
}
}
slashp = etags_strchr (slashp + 1, '/');
}
if (res[0] == '\0')
return savestr ("/");
else
return res;
}
/* Return a newly allocated string containing the absolute
file name of dir where FILE resides given DIR (which should
end with a slash). */
char *
absolute_dirname (file, dir)
char *file, *dir;
{
char *slashp, *res;
char save;
canonicalize_filename (file);
slashp = etags_strrchr (file, '/');
if (slashp == NULL)
return savestr (dir);
save = slashp[1];
slashp[1] = '\0';
res = absolute_filename (file, dir);
slashp[1] = save;
return res;
}
/* Whether the argument string is an absolute file name. The argument
string must have been canonicalized with canonicalize_filename. */
bool
filename_is_absolute (fn)
char *fn;
{
return (fn[0] == '/'
#ifdef WIN32_NATIVE
|| (isalpha(fn[0]) && fn[1] == ':' && fn[2] == '/')
#endif
);
}
/* Translate backslashes into slashes. Works in place. */
void
canonicalize_filename (fn)
register char *fn;
{
#ifdef WIN32_NATIVE
for (; *fn != '\0'; fn++)
if (*fn == '\\')
*fn = '/';
#else
/* No action. */
#endif
}
/* Increase the size of a linebuffer. */
void
grow_linebuffer (lbp, toksize)
linebuffer *lbp;
int toksize;
{
while (lbp->size < toksize)
lbp->size *= 2;
lbp->buffer = xrnew (lbp->buffer, lbp->size, char);
}
/* Like malloc but get fatal error if memory is exhausted. */
long *
xmalloc (size)
unsigned int size;
{
long *result = (long *) malloc (size);
if (result == NULL)
fatal ("virtual memory exhausted", (char *)NULL);
return result;
}
long *
xrealloc (ptr, size)
char *ptr;
unsigned int size;
{
long *result = (long *) realloc (ptr, size);
if (result == NULL)
fatal ("virtual memory exhausted", (char *)NULL);
return result;
}
|