pike.git/src/program.c:790114bb1511aa73d24cba0979e57ddd516f9537

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 /*\ ||| This file a part of Pike, and is copyright by Fredrik Hubinette ||| Pike is distributed as GPL (General Public License) ||| See the files COPYING and DISCLAIMER for more information. \*/ /**/ #include "global.h" RCSID("$Id: program.c,v 1.261 2000/08/15 15:52:55 grubba Exp $"); #include "program.h" #include "object.h" #include "dynamic_buffer.h" #include "pike_types.h" #include "stralloc.h" #include "las.h" #include "language.h" #include "lex.h" #include "pike_macros.h" #include "fsort.h" #include "error.h" #include "docode.h" #include "interpret.h" #include "hashtable.h" #include "main.h" #include "gc.h" #include "threads.h" #include "constants.h" #include "operators.h" #include "builtin_functions.h" #include "stuff.h" #include "mapping.h" #include "cyclic.h" #include "security.h" #include "pike_types.h" #include "opcodes.h" #include <errno.h> #include <fcntl.h> #undef ATTRIBUTE #define ATTRIBUTE(X) /* #define COMPILER_DEBUG */ /* #define PROGRAM_BUILD_DEBUG */ #ifdef COMPILER_DEBUG #define CDFPRINTF(X) fprintf X #else /* !COMPILER_DEBUG */ #define CDFPRINTF(X) #endif /* COMPILER_DEBUG */ /* * Define the size of the cache that is used for method lookup. */ #define FIND_FUNCTION_HASHSIZE 4711 #define DECLARE #include "compilation.h" struct pike_string *this_program_string=0; char *lfun_names[] = { "__INIT", "create", "destroy", "`+", "`-", "`&", "`|", "`^", "`<<", "`>>", "`*", "`/", "`%", "`~", "`==", "`<", "`>", "__hash", "cast", "`!", "`[]", "`[]=", "`->", "`->=", "_sizeof", "_indices", "_values", "`()", "``+", "``-", "``&", "``|", "``^", "``<<", "``>>", "``*", "``/", "``%", "`+=", "_is_type", "_sprintf", "_equal", }; /* mapping(string:type) */ static struct mapping *lfun_types; static char *raw_lfun_types[] = { tFuncV(tNone,tVoid,tVoid), /* "__INIT", */ tFuncV(tNone,tZero,tVoid), /* "create", */ tFuncV(tNone,tVoid,tVoid), /* "destroy", */ tFuncV(tNone,tZero,tMix), /* "`+", */ tFuncV(tNone,tZero,tMix), /* "`-", */ tFuncV(tNone,tZero,tMix), /* "`&", */ tFuncV(tNone,tZero,tMix), /* "`|", */ tFuncV(tNone,tZero,tMix), /* "`^", */ tFuncV(tZero,tVoid,tMix), /* "`<<", */ tFuncV(tZero,tVoid,tMix), /* "`>>", */ tFuncV(tNone,tZero,tMix), /* "`*", */ tFuncV(tNone,tZero,tMix), /* "`/", */ tFuncV(tNone,tZero,tMix), /* "`%", */ tFuncV(tNone,tVoid,tMix), /* "`~", */ tFuncV(tMix,tVoid,tInt), /* "`==", */ tFuncV(tMix,tVoid,tInt), /* "`<", */ tFuncV(tMix,tVoid,tInt), /* "`>", */ tFuncV(tNone,tVoid,tInt), /* "__hash", */ tFuncV(tString,tVoid,tMix), /* "cast", */ tFuncV(tNone,tVoid,tInt), /* "`!", */ tFuncV(tZero,tVoid,tMix), /* "`[]", */ tFuncV(tZero tSetvar(0,tZero),tVoid,tVar(0)), /* "`[]=", */ tFuncV(tStr,tVoid,tMix), /* "`->", */ tFuncV(tStr tSetvar(0,tZero),tVoid,tVar(0)), /* "`->=", */ tFuncV(tNone,tVoid,tInt), /* "_sizeof", */ tFuncV(tNone,tVoid,tArray), /* "_indices", */ tFuncV(tNone,tVoid,tArray), /* "_values", */ tFuncV(tNone,tZero,tMix), /* "`()", */ tFuncV(tNone,tZero,tMix), /* "``+", */ tFuncV(tNone,tZero,tMix), /* "``-", */ tFuncV(tNone,tZero,tMix), /* "``&", */ tFuncV(tNone,tZero,tMix), /* "``|", */ tFuncV(tNone,tZero,tMix), /* "``^", */ tFuncV(tZero,tVoid,tMix), /* "``<<", */ tFuncV(tZero,tVoid,tMix), /* "``>>", */ tFuncV(tNone,tZero,tMix), /* "``*", */ tFuncV(tNone,tZero,tMix), /* "``/", */ tFuncV(tNone,tZero,tMix), /* "``%", */ tFuncV(tZero,tVoid,tMix), /* "`+=", */ tFuncV(tStr,tVoid,tInt), /* "_is_type", */ tFuncV(tInt tOr(tMap(tStr,tInt),tVoid),tVoid,tStr), /* "_sprintf", */ tFuncV(tMix,tVoid,tInt), /* "_equal", */ }; struct program *first_program = 0; static int current_program_id=0x10000; struct object *error_handler=0; struct program *gc_internal_program = 0; static struct program *gc_mark_program_pos = 0; int compilation_depth; dynamic_buffer used_modules; static struct mapping *resolve_cache=0; int get_small_number(char **q); /* So what if we don't have templates? / Hubbe */ #ifdef PIKE_DEBUG #define CHECK_FOO(NUMTYPE,TYPE,NAME) \ if(Pike_compiler->malloc_size_program-> PIKE_CONCAT(num_,NAME) < Pike_compiler->new_program-> PIKE_CONCAT(num_,NAME)) \ fatal("Pike_compiler->new_program->num_" #NAME " is out of order\n"); \ if(Pike_compiler->new_program->flags & PROGRAM_OPTIMIZED) \ fatal("Tried to reallocate fixed program.\n") #else #define CHECK_FOO(NUMTYPE,TYPE,NAME) #endif #define FOO(NUMTYPE,TYPE,NAME) \ void PIKE_CONCAT(low_add_to_,NAME) (struct program_state *state, \ TYPE ARG) { \ if(state->malloc_size_program->PIKE_CONCAT(num_,NAME) == \ state->new_program->PIKE_CONCAT(num_,NAME)) { \ void *tmp; \ state->malloc_size_program->PIKE_CONCAT(num_,NAME) *= 2; \ state->malloc_size_program->PIKE_CONCAT(num_,NAME)++; \ tmp=realloc((char *)state->new_program->NAME, \ sizeof(TYPE) * \ state->malloc_size_program-> \ PIKE_CONCAT(num_,NAME)); \ if(!tmp) fatal("Out of memory.\n"); \ state->new_program->NAME=tmp; \ } \ state->new_program-> \ NAME[state->new_program->PIKE_CONCAT(num_,NAME)++]=(ARG); \ } \ void PIKE_CONCAT(add_to_,NAME) (TYPE ARG) { \ CHECK_FOO(NUMTYPE,TYPE,NAME); \ PIKE_CONCAT(low_add_to_,NAME) ( Pike_compiler, ARG ); \ } #include "program_areas.h" void ins_int(INT32 i, void (*func)(char tmp)) { int e; for(e=0;e<(long)sizeof(i);e++) func(EXTRACT_UCHAR(((char *)&i)+e)); } void ins_short(INT16 i, void (*func)(char tmp)) { int e; for(e=0;e<(long)sizeof(i);e++) func(EXTRACT_UCHAR(((char *)&i)+e)); } void use_module(struct svalue *s) { if( (1<<s->type) & (BIT_MAPPING | BIT_OBJECT | BIT_PROGRAM)) { Pike_compiler->num_used_modules++; assign_svalue_no_free((struct svalue *) low_make_buf_space(sizeof(struct svalue), &used_modules), s); if(Pike_compiler->module_index_cache) { free_mapping(Pike_compiler->module_index_cache); Pike_compiler->module_index_cache=0; } }else{ yyerror("Module is neither mapping nor object"); } } void unuse_modules(INT32 howmany) { if(!howmany) return; #ifdef PIKE_DEBUG if(howmany *sizeof(struct svalue) > used_modules.s.len) fatal("Unusing too many modules.\n"); #endif Pike_compiler->num_used_modules-=howmany; low_make_buf_space(-sizeof(struct svalue)*howmany, &used_modules); free_svalues((struct svalue *)low_make_buf_space(0, &used_modules), howmany, BIT_MAPPING | BIT_OBJECT | BIT_PROGRAM); if(Pike_compiler->module_index_cache) { free_mapping(Pike_compiler->module_index_cache); Pike_compiler->module_index_cache=0; } } int low_find_shared_string_identifier(struct pike_string *name, struct program *prog); static struct node_s *index_modules(struct pike_string *ident, struct mapping **module_index_cache, int num_used_modules, struct svalue *modules) { struct node_s *ret; JMP_BUF tmp; if(*module_index_cache) { struct svalue *tmp=low_mapping_string_lookup(*module_index_cache,ident); if(tmp) { if(!(IS_ZERO(tmp) && tmp->subtype==1)) return mksvaluenode(tmp); return 0; } } /* fprintf(stderr,"index_module: %s\n",ident->str); */ if(SETJMP(tmp)) { ONERROR tmp; SET_ONERROR(tmp,exit_on_error,"Error in handle_error in master object!"); assign_svalue_no_free(Pike_sp++, & throw_value); APPLY_MASTER("handle_error", 1); pop_stack(); UNSET_ONERROR(tmp); yyerror("Couldn't index module."); }else{ int e=num_used_modules; modules-=num_used_modules; while(--e>=0) { push_svalue(modules+e); ref_push_string(ident); f_index(2); if(!IS_UNDEFINED(Pike_sp-1)) { UNSETJMP(tmp); if(!*module_index_cache) *module_index_cache=allocate_mapping(10); mapping_string_insert(*module_index_cache, ident, Pike_sp-1); ret=mksvaluenode(Pike_sp-1); pop_stack(); return ret; } pop_stack(); } } UNSETJMP(tmp); /* fprintf(stderr,"***Undefined.\n"); */ return 0; } struct node_s *find_module_identifier(struct pike_string *ident, int see_inherit) { struct node_s *ret; struct svalue *modules=(struct svalue *) (used_modules.s.str + used_modules.s.len); if((ret=index_modules(ident, &Pike_compiler->module_index_cache, Pike_compiler->num_used_modules, modules))) return ret; modules-=Pike_compiler->num_used_modules; { struct program_state *p=Pike_compiler->previous; int n; for(n=0;n<compilation_depth;n++,p=p->previous) { int i; if(see_inherit) { i=really_low_find_shared_string_identifier(ident, p->new_program, SEE_STATIC); if(i!=-1) { return mkexternalnode(p->new_program, i); } } if((ret=index_modules(ident, &p->module_index_cache, p->num_used_modules, modules))) return ret; modules-=p->num_used_modules; #ifdef PIKE_DEBUG if( ((char *)modules ) < used_modules.s.str) fatal("Modules out of whack!\n"); #endif } } /* Handle this_program */ if (ident == this_program_string) { struct svalue s; s.type=T_PROGRAM; s.u.program=Pike_compiler->new_program; return mkconstantsvaluenode(&s); } if(resolve_cache) { struct svalue *tmp=low_mapping_string_lookup(resolve_cache,ident); if(tmp) { if(!(IS_ZERO(tmp) && tmp->subtype==1)) return mkconstantsvaluenode(tmp); return 0; } } if(!Pike_compiler->num_parse_error && get_master()) { DECLARE_CYCLIC(); node *ret=0; if(BEGIN_CYCLIC(ident, lex.current_file)) { my_yyerror("Recursive module dependency in %s.", ident->str); }else{ int i; SET_CYCLIC_RET(1); ref_push_string(ident); ref_push_string(lex.current_file); if(error_handler && (i=find_identifier("resolv",error_handler->prog))!=-1) { safe_apply_low(error_handler, i, 2); }else{ SAFE_APPLY_MASTER("resolv", 2); } if(throw_value.type == T_STRING) { if(Pike_compiler->compiler_pass==2) my_yyerror("%s",throw_value.u.string->str); } else { if(!resolve_cache) resolve_cache=dmalloc_touch(struct mapping *, allocate_mapping(10)); mapping_string_insert(resolve_cache,ident,Pike_sp-1); if(!(IS_ZERO(Pike_sp-1) && Pike_sp[-1].subtype==1)) { ret=mkconstantsvaluenode(Pike_sp-1); } } pop_stack(); } END_CYCLIC(); if(ret) return ret; } return 0; } /* Fixme: allow level=0 to return the current level */ struct program *parent_compilation(int level) { int n; struct program_state *p=Pike_compiler->previous; for(n=0;n<level;n++) { if(n>=compilation_depth) return 0; p=p->previous; if(!p) return 0; } return p->new_program; } #define ID_TO_PROGRAM_CACHE_SIZE 512 struct program *id_to_program_cache[ID_TO_PROGRAM_CACHE_SIZE]; struct program *id_to_program(INT32 id) { struct program *p; INT32 h; if(!id) return 0; h=id & (ID_TO_PROGRAM_CACHE_SIZE-1); if((p=id_to_program_cache[h])) if(p->id==id) return p; if(id) { for(p=first_program;p;p=p->next) { if(id==p->id) { id_to_program_cache[h]=p; return p; } } } return 0; } /* Here starts routines which are used to build new programs */ /* Re-allocate all the memory in the program in one chunk. because: * 1) The individual blocks are munch bigger than they need to be * 2) cuts down on malloc overhead (maybe) * 3) localizes memory access (decreases paging) */ void optimize_program(struct program *p) { size_t size=0; char *data; /* Already done (shouldn't happen, but who knows?) */ if(p->flags & PROGRAM_OPTIMIZED) return; #define FOO(NUMTYPE,TYPE,NAME) \ size=DO_ALIGN(size, ALIGNOF(TYPE)); \ size+=p->PIKE_CONCAT(num_,NAME)*sizeof(p->NAME[0]); #include "program_areas.h" data=malloc(size); if(!data) return; /* We are out of memory, but we don't care! */ size=0; #define FOO(NUMTYPE,TYPE,NAME) \ size=DO_ALIGN(size, ALIGNOF(TYPE)); \ MEMCPY(data+size,p->NAME,p->PIKE_CONCAT(num_,NAME)*sizeof(p->NAME[0])); \ dmfree((char *)p->NAME); \ p->NAME=(TYPE *)(data+size); \ size+=p->PIKE_CONCAT(num_,NAME)*sizeof(p->NAME[0]); #include "program_areas.h" p->total_size=size + sizeof(struct program); p->flags |= PROGRAM_OPTIMIZED; } /* internal function to make the index-table */ int program_function_index_compare(const void *a,const void *b) { return DO_NOT_WARN((int)my_order_strcmp(ID_FROM_INT(Pike_compiler->new_program, *(unsigned short *)a)->name, ID_FROM_INT(Pike_compiler->new_program, *(unsigned short *)b)->name)); } #ifdef PIKE_DEBUG char *find_program_name(struct program *p, INT32 *line) { #ifdef DEBUG_MALLOC char *tmp; #endif INT32 pos; INT32 l; if(!line) line=&l; #ifdef DEBUG_MALLOC tmp=dmalloc_find_name(p); *line=0; if(tmp) return tmp; #endif /* Didn't find a given name, revert to ad-hoc method */ for(pos=0;pos<100;pos++) { char *tmp=get_line(p->program+pos, p, line); if(tmp && *line) return tmp; if(pos+1>=(long)p->num_program) break; } *line=0; return 0; } #endif void fixate_program(void) { INT32 i,e,t; if(Pike_compiler->new_program->flags & PROGRAM_FIXED) return; #ifdef PIKE_DEBUG if(Pike_compiler->new_program->flags & PROGRAM_OPTIMIZED) fatal("Cannot fixate optimized program\n"); #endif /* Ok, sort for binsearch */ for(e=i=0;i<(int)Pike_compiler->new_program->num_identifier_references;i++) { struct reference *funp; struct identifier *fun; funp=Pike_compiler->new_program->identifier_references+i; if(funp->id_flags & (ID_HIDDEN|ID_STATIC)) continue; if(funp->id_flags & ID_INHERITED) { if(funp->id_flags & ID_PRIVATE) continue; fun=ID_FROM_PTR(Pike_compiler->new_program, funp); /* if(fun->func.offset == -1) continue; * prototype */ /* check for multiple definitions */ for(t=i+1;t>=0 && t<(int)Pike_compiler->new_program->num_identifier_references;t++) { struct reference *funpb; struct identifier *funb; funpb=Pike_compiler->new_program->identifier_references+t; if(funpb->id_flags & (ID_HIDDEN|ID_STATIC)) continue; funb=ID_FROM_PTR(Pike_compiler->new_program,funpb); /* if(funb->func.offset == -1) continue; * prototype */ if(fun->name==funb->name) t=-10; } if(t<0) continue; } add_to_identifier_index(i); } fsort((void *)Pike_compiler->new_program->identifier_index, Pike_compiler->new_program->num_identifier_index, sizeof(unsigned short),(fsortfun)program_function_index_compare); /* Yes, it is supposed to start at 1 /Hubbe */ for(i=1;i<NUM_LFUNS;i++) { Pike_compiler->new_program->lfuns[i] = low_find_lfun(Pike_compiler->new_program, i); } Pike_compiler->new_program->flags |= PROGRAM_FIXED; #ifdef DEBUG_MALLOC { #define DBSTR(X) ((X)?(X)->str:"") int e,v; INT32 line; char *tmp; struct memory_map *m=0;; if(lex.current_file && lex.current_file->str && lex.current_file->len && !strcmp(lex.current_file->str,"-")) { m=dmalloc_alloc_mmap( DBSTR(lex.current_file), lex.current_line); } else if( (tmp=find_program_name(Pike_compiler->new_program, &line)) ) { m=dmalloc_alloc_mmap( tmp, line); }else{ m=dmalloc_alloc_mmap( "program id", Pike_compiler->new_program->id); } for(e=0;e<Pike_compiler->new_program->num_inherits;e++) { struct inherit *i=Pike_compiler->new_program->inherits+e; char *tmp; char buffer[50]; for(v=0;v<i->prog->num_variable_index;v++) { int d=i->prog->variable_index[v]; struct identifier *id=i->prog->identifiers+d; dmalloc_add_mmap_entry(m, id->name->str, /* OFFSETOF(object,storage) + */ i->storage_offset + id->func.offset, sizeof_variable(id->run_time_type), 1, /* count */ 0,0); } if(i->name) { tmp=i->name->str; } else if(!(tmp=find_program_name(i->prog, &line))) { sprintf(buffer,"inherit[%d]",e); tmp=buffer; } dmalloc_add_mmap_entry(m, tmp, /* OFFSETOF(object, storage) + */ i->storage_offset, i->prog->storage_needed - i->prog->inherits[0].storage_offset, 1, /* count */ 0,0); } dmalloc_set_mmap_template(Pike_compiler->new_program, m); } #endif } struct program *low_allocate_program(void) { struct program *p; p=ALLOC_STRUCT(program); MEMSET(p, 0, sizeof(struct program)); p->alignment_needed=1; GC_ALLOC(p); p->refs=1; p->id=++current_program_id; DOUBLELINK(first_program, p); GETTIMEOFDAY(& p->timestamp); INITIALIZE_PROT(p); return p; } /* * Start building a new program */ void low_start_new_program(struct program *p, struct pike_string *name, int flags, int *idp) { int e,id=0; struct svalue tmp; #if 0 #ifdef SHARED_NODES if (!node_hash.table) { node_hash.table = malloc(sizeof(node *)*16411); if (!node_hash.table) { fatal("Out of memory!\n"); } MEMSET(node_hash.table, 0, sizeof(node *)*16411); node_hash.size = 16411; } #endif /* SHARED_NODES */ #endif /* 0 */ /* We don't want to change thread, but we don't want to * wait for the other threads to complete. */ low_init_threads_disable(); compilation_depth++; CDFPRINTF((stderr, "th(%ld) low_start_new_program() pass=%d: compilation_depth:%d\n", (long)th_self(),compilation_depth,Pike_compiler->compiler_pass)); tmp.type=T_PROGRAM; if(!p) { p=low_allocate_program(); if(name) { tmp.u.program=p; id=add_constant(name, &tmp, flags & ~ID_EXTERN); } e=1; }else{ tmp.u.program=p; add_ref(p); if(name) { struct identifier *i; id=isidentifier(name); if (id < 0) fatal("Program constant disappeared in second pass.\n"); i=ID_FROM_INT(Pike_compiler->new_program, id); free_string(i->type); i->type=get_type_of_svalue(&tmp); } e=2; } if(idp) *idp=id; init_type_stack(); #define PUSH #include "compilation.h" Pike_compiler->compiler_pass=e; Pike_compiler->num_used_modules=0; if(p && (p->flags & PROGRAM_FINISHED)) { yyerror("Pass2: Program already done"); p=0; } Pike_compiler->malloc_size_program = ALLOC_STRUCT(program); #ifdef PIKE_DEBUG Pike_compiler->fake_object=alloc_object(); Pike_compiler->fake_object->storage=(char *)xalloc(256 * sizeof(struct svalue)); /* Stipple to find illegal accesses */ MEMSET(Pike_compiler->fake_object->storage,0x55,256*sizeof(struct svalue)); #else Pike_compiler->fake_object=ALLOC_STRUCT(object); Pike_compiler->fake_object->storage=0; #endif /* Can't use GC_ALLOC on fake objects, but still it's good to know * that they never take over a stale gc marker. */ if (Pike_in_gc) remove_marker(Pike_compiler->fake_object); Pike_compiler->fake_object->next=Pike_compiler->fake_object; Pike_compiler->fake_object->prev=Pike_compiler->fake_object; Pike_compiler->fake_object->refs=1; Pike_compiler->fake_object->parent=0; Pike_compiler->fake_object->parent_identifier=0; Pike_compiler->fake_object->prog=p; add_ref(p); #ifdef PIKE_DEBUG Pike_compiler->fake_object->program_id=p->id; #endif #ifdef PIKE_SECURITY Pike_compiler->fake_object->prot=0; #endif debug_malloc_touch(Pike_compiler->fake_object); debug_malloc_touch(Pike_compiler->fake_object->storage); if(name) { if((Pike_compiler->fake_object->parent=Pike_compiler->previous->fake_object)) add_ref(Pike_compiler->fake_object->parent); Pike_compiler->fake_object->parent_identifier=id; } Pike_compiler->new_program=p; #ifdef PROGRAM_BUILD_DEBUG if (name) { fprintf (stderr, "%.*sstarting program %d (pass=%d): ", compilation_depth, " ", Pike_compiler->new_program->id, Pike_compiler->compiler_pass); push_string (name); print_svalue (stderr, --Pike_sp); putc ('\n', stderr); } else fprintf (stderr, "%.*sstarting program %d (pass=%d)\n", compilation_depth, " ", Pike_compiler->new_program->id, Pike_compiler->compiler_pass); #endif debug_malloc_touch(Pike_compiler->fake_object); debug_malloc_touch(Pike_compiler->fake_object->storage); if(Pike_compiler->new_program->program) { #define FOO(NUMTYPE,TYPE,NAME) \ Pike_compiler->malloc_size_program->PIKE_CONCAT(num_,NAME)=Pike_compiler->new_program->PIKE_CONCAT(num_,NAME); #include "program_areas.h" { INT32 line=0, off=0; char *file=0; char *cnt=Pike_compiler->new_program->linenumbers; while(cnt < Pike_compiler->new_program->linenumbers + Pike_compiler->new_program->num_linenumbers) { if(*cnt == 127) { file=cnt+1; cnt=file+strlen(file)+1; } off+=get_small_number(&cnt); line+=get_small_number(&cnt); } Pike_compiler->last_line=line; Pike_compiler->last_pc=off; if(file) { if(Pike_compiler->last_file) free_string(Pike_compiler->last_file); Pike_compiler->last_file=make_shared_string(file); } } }else{ static struct pike_string *s; struct inherit i; #define START_SIZE 64 #define FOO(NUMTYPE,TYPE,NAME) \ Pike_compiler->malloc_size_program->PIKE_CONCAT(num_,NAME)=START_SIZE; \ Pike_compiler->new_program->NAME=(TYPE *)xalloc(sizeof(TYPE) * START_SIZE); #include "program_areas.h" i.prog=Pike_compiler->new_program; i.identifier_level=0; i.storage_offset=0; i.inherit_level=0; i.parent=0; i.parent_identifier=0; i.parent_offset=1; i.name=0; add_to_inherits(i); } Pike_compiler->init_node=0; Pike_compiler->num_parse_error=0; push_compiler_frame(0); add_ref(Pike_compiler->compiler_frame->current_return_type=void_type_string); debug_malloc_touch(Pike_compiler->fake_object); debug_malloc_touch(Pike_compiler->fake_object->storage); } PMOD_EXPORT void debug_start_new_program(PROGRAM_LINE_ARGS) { CDFPRINTF((stderr, "th(%ld) start_new_program(): threads_disabled:%d, compilation_depth:%d\n", (long)th_self(),threads_disabled, compilation_depth)); low_start_new_program(0,0,0,0); #ifdef PIKE_DEBUG { struct pike_string *s=make_shared_string(file); store_linenumber(line,s); free_string(s); debug_malloc_name(Pike_compiler->new_program, file, line); } #endif } PMOD_EXPORT void really_free_program(struct program *p) { unsigned INT16 e; if(id_to_program_cache[p->id & (ID_TO_PROGRAM_CACHE_SIZE-1)]==p) id_to_program_cache[p->id & (ID_TO_PROGRAM_CACHE_SIZE-1)]=0; if(p->strings) for(e=0; e<p->num_strings; e++) if(p->strings[e]) free_string(p->strings[e]); if(p->identifiers) { for(e=0; e<p->num_identifiers; e++) { if(p->identifiers[e].name) free_string(p->identifiers[e].name); if(p->identifiers[e].type) free_string(p->identifiers[e].type); } } if(p->constants) { for(e=0;e<p->num_constants;e++) { free_svalue(& p->constants[e].sval); if(p->constants[e].name) free_string(p->constants[e].name); } } if(p->inherits) for(e=0; e<p->num_inherits; e++) { if(p->inherits[e].name) free_string(p->inherits[e].name); if(e) { if(p->inherits[e].prog) free_program(p->inherits[e].prog); } if(p->inherits[e].parent) free_object(p->inherits[e].parent); } if (gc_internal_program) { if (p == gc_internal_program) gc_internal_program = p->next; if (p == gc_mark_program_pos) gc_mark_program_pos = p->next; } DOUBLEUNLINK(first_program, p); if(p->flags & PROGRAM_OPTIMIZED) { if(p->program) dmfree(p->program); #define FOO(NUMTYPE,TYPE,NAME) p->NAME=0; #include "program_areas.h" }else{ #define FOO(NUMTYPE,TYPE,NAME) \ if(p->NAME) { dmfree((char *)p->NAME); p->NAME=0; } #include "program_areas.h" } FREE_PROT(p); dmfree((char *)p); GC_FREE(); } #ifdef PIKE_DEBUG void dump_program_desc(struct program *p) { int e,d,q; /* fprintf(stderr,"Program '%s':\n",p->name->str); */ fprintf(stderr,"All inherits:\n"); for(e=0;e<p->num_inherits;e++) { for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"%3d:\n",e); for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"inherited program: %d\n",p->inherits[e].prog->id); if(p->inherits[e].name) { for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"name : %s\n",p->inherits[e].name->str); } for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"inherit_level: %d\n",p->inherits[e].inherit_level); for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"identifier_level: %d\n",p->inherits[e].identifier_level); for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"parent_identifier: %d\n",p->inherits[e].parent_identifier); for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"parent_offset: %d\n",p->inherits[e].parent_offset); for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"storage_offset: %ld\n", DO_NOT_WARN((long)p->inherits[e].storage_offset)); for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"parent: %p\n",p->inherits[e].parent); if(p->inherits[e].parent && p->inherits[e].parent->prog && p->inherits[e].parent->prog->num_linenumbers>1) { for(d=0;d<p->inherits[e].inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"parent: %s\n",p->inherits[e].parent->prog->linenumbers+1); } } fprintf(stderr,"All identifiers:\n"); for(e=0;e<(int)p->num_identifier_references;e++) { fprintf(stderr,"%3d:",e); for(d=0;d<INHERIT_FROM_INT(p,e)->inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"%s;\n",ID_FROM_INT(p,e)->name->str); } fprintf(stderr,"All sorted identifiers:\n"); for(q=0;q<(int)p->num_identifier_index;q++) { e=p->identifier_index[q]; fprintf(stderr,"%3d (%3d):",e,q); for(d=0;d<INHERIT_FROM_INT(p,e)->inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"%s;\n", ID_FROM_INT(p,e)->name->str); } } #endif static void toss_compilation_resources(void) { if(Pike_compiler->fake_object) { free_program(Pike_compiler->fake_object->prog); Pike_compiler->fake_object->prog=0; free_object(Pike_compiler->fake_object); Pike_compiler->fake_object=0; } free_program(Pike_compiler->new_program); Pike_compiler->new_program=0; if(Pike_compiler->malloc_size_program) { dmfree((char *)Pike_compiler->malloc_size_program); Pike_compiler->malloc_size_program=0; } if(Pike_compiler->module_index_cache) { free_mapping(Pike_compiler->module_index_cache); Pike_compiler->module_index_cache=0; } while(Pike_compiler->compiler_frame) pop_compiler_frame(); if(Pike_compiler->last_identifier) { free_string(Pike_compiler->last_identifier); Pike_compiler->last_identifier=0; } if(Pike_compiler->last_file) { free_string(Pike_compiler->last_file); Pike_compiler->last_file=0; } unuse_modules(Pike_compiler->num_used_modules); } int sizeof_variable(int run_time_type) { switch(run_time_type) { case T_FUNCTION: case T_MIXED: return sizeof(struct svalue); case T_FLOAT: return sizeof(FLOAT_TYPE); case T_INT: return sizeof(INT_TYPE); default: return sizeof(char *); } } static ptrdiff_t alignof_variable(int run_time_type) { switch(run_time_type) { case T_FUNCTION: case T_MIXED: return ALIGNOF(struct svalue); case T_FLOAT: return ALIGNOF(FLOAT_TYPE); case T_INT: return ALIGNOF(INT_TYPE); default: return ALIGNOF(char *); } } #ifdef PIKE_DEBUG void check_program(struct program *p) { INT32 size; unsigned INT32 checksum, e; int variable_positions[1024]; if(p->flags & PROGRAM_AVOID_CHECK) return; for(e=0;e<NELEM(variable_positions);e++) variable_positions[e]=-1; if(p->id > current_program_id) fatal("Program id is out of sync! (p->id=%d, current_program_id=%d)\n",p->id,current_program_id); if(p->refs <=0) fatal("Program has zero refs.\n"); if(p->next && p->next->prev != p) fatal("Program ->next->prev != program.\n"); if(p->prev) { if(p->prev->next != p) fatal("Program ->prev->next != program.\n"); }else{ if(first_program != p) fatal("Program ->prev == 0 but first_program != program.\n"); } if(p->id > current_program_id || p->id <= 0) fatal("Program id is wrong.\n"); if(p->storage_needed < 0) fatal("Program->storage_needed < 0.\n"); if(p->num_identifier_index > p->num_identifier_references) fatal("Too many identifier index entries in program!\n"); for(e=0;e<p->num_constants;e++) { check_svalue(& p->constants[e].sval); if(p->constants[e].name) check_string(p->constants[e].name); } for(e=0;e<p->num_strings;e++) check_string(p->strings[e]); for(e=0;e<p->num_inherits;e++) { if(!p->inherits[e].prog) { /* This inherit is not yet initialized, ignore rest of tests.. */ return; } if(p->inherits[e].storage_offset < 0) fatal("Inherit->storage_offset is wrong.\n"); if(p->inherits[e].prog && p->inherits[e].storage_offset + STORAGE_NEEDED(p->inherits[e].prog) > p->storage_needed) fatal("Not enough room allocated by inherit!\n"); if(e) { if(p->inherits[e-1].storage_offset > p->inherits[e].storage_offset) fatal("Overlapping inherits! (1)\n"); if(p->inherits[e-1].prog && p->inherits[e-1].inherit_level >= p->inherits[e].inherit_level && ( p->inherits[e-1].storage_offset + STORAGE_NEEDED(p->inherits[e-1].prog)) > p->inherits[e].storage_offset) fatal("Overlapping inherits! (3)\n"); } } if(p->flags & PROGRAM_FINISHED) for(e=0;e<p->num_identifiers;e++) { check_string(p->identifiers[e].name); check_string(p->identifiers[e].type); if(p->identifiers[e].identifier_flags & ~IDENTIFIER_MASK) fatal("Unknown flags in identifier flag field.\n"); if(p->identifiers[e].run_time_type!=T_MIXED) check_type(p->identifiers[e].run_time_type); if(IDENTIFIER_IS_VARIABLE(p->identifiers[e].identifier_flags)) { if( (p->identifiers[e].func.offset /* + OFFSETOF(object,storage)*/ ) & (alignof_variable(p->identifiers[e].run_time_type)-1)) { fatal("Variable %s offset is not properly aligned (%d).\n",p->identifiers[e].name->str,p->identifiers[e].func.offset); } } } for(e=0;e<p->num_identifier_references;e++) { struct identifier *i; if(p->identifier_references[e].inherit_offset > p->num_inherits) fatal("Inherit offset is wrong!\n"); if(!p->inherits[p->identifier_references[e].inherit_offset].prog) { if(!(p->flags & PROGRAM_FINISHED)) continue; fatal("p->inherit[%d].prog = NULL!\n",p->identifier_references[e].inherit_offset); } if(p->identifier_references[e].identifier_offset > p->inherits[p->identifier_references[e].inherit_offset].prog->num_identifiers) fatal("Identifier offset is wrong!\n"); i=ID_FROM_INT(p, e); if( !(i->identifier_flags & (IDENTIFIER_FUNCTION | IDENTIFIER_CONSTANT))) { size_t q, size; /* Variable */ ptrdiff_t offset = INHERIT_FROM_INT(p, e)->storage_offset+i->func.offset; size=sizeof_variable(i->run_time_type); if((offset+size > (size_t)p->storage_needed) || offset<0) fatal("Variable outside storage! (%s)\n",i->name->str); for(q=0;q<size;q++) { if(offset+q >= NELEM(variable_positions)) break; if(variable_positions[offset+q] != -1) { if(ID_FROM_INT(p,variable_positions[offset+q])->run_time_type != i->run_time_type) { fatal("Variable '%s' and '%s' overlap\n", ID_FROM_INT(p,variable_positions[offset+q])->name->str, i->name->str); } } variable_positions[offset+q]=e; } } } for(e=0;e<p->num_identifier_index;e++) { if(p->identifier_index[e] > p->num_identifier_references) fatal("Program->identifier_indexes[%ld] is wrong\n",(long)e); } } #endif struct program *end_first_pass(int finish) { int e; struct program *prog; struct pike_string *s; debug_malloc_touch(Pike_compiler->fake_object); debug_malloc_touch(Pike_compiler->fake_object->storage); MAKE_CONSTANT_SHARED_STRING(s,"__INIT"); /* Collect references to inherited __INIT functions */ for(e=Pike_compiler->new_program->num_inherits-1;e;e--) { int id; if(Pike_compiler->new_program->inherits[e].inherit_level!=1) continue; id=low_reference_inherited_identifier(0, e, s, SEE_STATIC); if(id!=-1) { Pike_compiler->init_node=mknode(F_COMMA_EXPR, mkcastnode(void_type_string, mkapplynode(mkidentifiernode(id),0)), Pike_compiler->init_node); } } /* * Define the __INIT function, but only if there was any code * to initialize. */ if(Pike_compiler->init_node) { union idptr tmp; e=dooptcode(s, mknode(F_COMMA_EXPR, Pike_compiler->init_node,mknode(F_RETURN,mkintnode(0),0)), function_type_string, ID_STATIC); Pike_compiler->init_node=0; }else{ e=-1; } Pike_compiler->new_program->lfuns[LFUN___INIT]=e; free_string(s); pop_compiler_frame(); /* Pop __INIT local variables */ if(Pike_compiler->num_parse_error > 0) { prog=0; }else{ prog=Pike_compiler->new_program; add_ref(prog); #ifdef PIKE_DEBUG check_program(prog); if(l_flag) dump_program_desc(prog); #endif Pike_compiler->new_program->flags |= PROGRAM_PASS_1_DONE; if(finish) { fixate_program(); optimize_program(Pike_compiler->new_program); Pike_compiler->new_program->flags |= PROGRAM_FINISHED; } } #ifdef PROGRAM_BUILD_DEBUG fprintf (stderr, "%.*sfinishing program %d (pass=%d)\n", compilation_depth, " ", Pike_compiler->new_program->id, Pike_compiler->compiler_pass); #endif toss_compilation_resources(); CDFPRINTF((stderr, "th(%ld),end_first_pass(): compilation_depth:%d, Pike_compiler->compiler_pass:%d\n", (long)th_self(), compilation_depth, Pike_compiler->compiler_pass)); if(!Pike_compiler->compiler_frame && (Pike_compiler->compiler_pass==2 || !prog) && resolve_cache) { free_mapping(dmalloc_touch(struct mapping *, resolve_cache)); resolve_cache=0; } #ifdef SHARED_NODES /* free(node_hash.table); */ #endif /* SHARED_NODES */ #define POP #include "compilation.h" exit_type_stack(); compilation_depth--; exit_threads_disable(NULL); free_all_nodes(); return prog; } /* * Finish this program, returning the newly built program */ PMOD_EXPORT struct program *debug_end_program(void) { return end_first_pass(1); } /* * Allocate needed for this program in the object structure. * An offset to the data is returned. */ PMOD_EXPORT size_t low_add_storage(size_t size, size_t alignment, ptrdiff_t modulo_orig) { ptrdiff_t offset; ptrdiff_t modulo; if(!size) return Pike_compiler->new_program->storage_needed; #ifdef PIKE_DEBUG if(alignment <=0 || (alignment & (alignment-1)) || alignment > 256) fatal("Alignment must be 1,2,4,8,16,32,64,128 or 256 not %d\n",alignment); #endif modulo=( modulo_orig /* +OFFSETOF(object,storage) */ ) % alignment; offset=DO_ALIGN(Pike_compiler->new_program->storage_needed-modulo,alignment)+modulo; if(!Pike_compiler->new_program->storage_needed) { /* Shouldn't Pike_compiler->new_program->storage_needed be set here? * Otherwise the debug code below ought to be trigged. * But since it isn't, I guess this is dead code? * /grubba 1999-09-28 * * No, the below offset represents the storage in the beginning * of obj->storage which is not used because of alignment constraints. * However, for historical reasons, prog->storage_offset needs to * contain this unused space as well. This means that the real * space used by all variables in an object is really: * o->prog->storage_needed - o->prog->inherits[0].storage_offset, * This can also be written as STORAGE_NEEDED(o->prog) * STORAGE_NEEDED() is defined in program.h. * /Hubbe 1999-09-29 * * Oops, seems I read the test below the wrong way around. * /grubba 1999-09-29 */ Pike_compiler->new_program->inherits[0].storage_offset=offset; } if(Pike_compiler->new_program->alignment_needed<alignment) Pike_compiler->new_program->alignment_needed = DO_NOT_WARN((unsigned INT8)alignment); #ifdef PIKE_DEBUG if(offset < Pike_compiler->new_program->storage_needed) fatal("add_storage failed horribly!\n"); if( (offset /* + OFFSETOF(object,storage) */ - modulo_orig ) % alignment ) fatal("add_storage failed horribly(2) %ld %ld %ld %ld!\n", DO_NOT_WARN((long)offset), (long)0 /* + OFFSETOF(object,storage) */, DO_NOT_WARN((long)modulo_orig), DO_NOT_WARN((long)alignment)); #endif Pike_compiler->new_program->storage_needed = offset + size; return (size_t) offset; } /* * set a callback used to initialize clones of this program * the init function is called at clone time */ PMOD_EXPORT void set_init_callback(void (*init)(struct object *)) { Pike_compiler->new_program->init=init; } /* * set a callback used to de-initialize clones of this program * the exit function is called at destruct */ PMOD_EXPORT void set_exit_callback(void (*exit)(struct object *)) { Pike_compiler->new_program->exit=exit; } /* * This callback is used by the gc to traverse all references to * objects. It should call some gc_recurse_* function exactly once for * each reference that the pike internals doesn't know about. * * If a reference is shared between objects, it should be traversed * once for every instance sharing it. * * The callback might be called more than once for the same instance * during a gc pass. The gc assumes that the references are enumerated * in the same order in that case. */ PMOD_EXPORT void set_gc_recurse_callback(void (*m)(struct object *)) { Pike_compiler->new_program->gc_recurse_func=m; } /* * This callback is used by the gc to count all references to objects. * It should call gc_check, gc_check_(weak_)svalues or * gc_check_(weak_)short_svalue exactly once for each reference that * the pike internals doesn't know about. * * If a reference is shared between objects, it should be counted once * for all shared instances. The return value from gc_check is useful * to ensure this; it's zero when called the first time for its * argument. */ PMOD_EXPORT void set_gc_check_callback(void (*m)(struct object *)) { Pike_compiler->new_program->gc_check_func=m; } int low_reference_inherited_identifier(struct program_state *q, int e, struct pike_string *name, int flags) { struct program *np=(q?q:Pike_compiler)->new_program; struct reference funp; struct program *p; int i,d; p=np->inherits[e].prog; i=find_shared_string_identifier(name,p); if(i==-1) { i=really_low_find_shared_string_identifier(name,p, flags); if(i==-1) return -1; } if(p->identifier_references[i].id_flags & ID_HIDDEN) return -1; if(p->identifier_references[i].id_flags & ID_PRIVATE) if(!(flags & SEE_PRIVATE)) return -1; funp=p->identifier_references[i]; funp.inherit_offset+=e; funp.id_flags|=ID_HIDDEN; for(d=0;d<(int)np->num_identifier_references;d++) { struct reference *refp; refp=np->identifier_references+d; if(!MEMCMP((char *)refp,(char *)&funp,sizeof funp)) return d; } if(q) low_add_to_identifier_references(q,funp); else add_to_identifier_references(funp); return np->num_identifier_references -1; } int find_inherit(struct program *p, struct pike_string *name) { int e; #if 0 fprintf(stderr, "find_inherit(0x%08lx, \"%s\")...\n", (unsigned long)p, name->str); #endif /* 0 */ for(e = p->num_inherits-1; e>0; e--) { #if 0 fprintf(stderr, " %04d: %04d %s\n", e, p->inherits[e].inherit_level, p->inherits[e].name?p->inherits[e].name->str:"NULL"); #endif /* 0 */ if (p->inherits[e].inherit_level > 1) continue; if (name == p->inherits[e].name) return e; } return 0; } node *reference_inherited_identifier(struct pike_string *super_name, struct pike_string *function_name) { int n,e,id; struct program_state *state=Pike_compiler->previous; struct program *p; #ifdef PIKE_DEBUG if(function_name!=debug_findstring(function_name)) fatal("reference_inherited_function on nonshared string.\n"); #endif p=Pike_compiler->new_program; for(e=p->num_inherits-1;e>0;e--) { if(p->inherits[e].inherit_level!=1) continue; if(!p->inherits[e].name) continue; if(super_name) if(super_name != p->inherits[e].name) continue; id=low_reference_inherited_identifier(0, e, function_name, SEE_STATIC); if(id!=-1) return mkidentifiernode(id); if(ISCONSTSTR(function_name,"`->") || ISCONSTSTR(function_name,"`[]")) { return mknode(F_MAGIC_INDEX,mknewintnode(e),mknewintnode(0)); } if(ISCONSTSTR(function_name,"`->=") || ISCONSTSTR(function_name,"`[]=")) { return mknode(F_MAGIC_SET_INDEX,mknewintnode(e),mknewintnode(0)); } } for(n=0;n<compilation_depth;n++,state=state->previous) { struct program *p=state->new_program; for(e=p->num_inherits-1;e>0;e--) { if(p->inherits[e].inherit_level!=1) continue; if(!p->inherits[e].name) continue; if(super_name) if(super_name != p->inherits[e].name) continue; id=low_reference_inherited_identifier(state,e,function_name,SEE_STATIC); if(id!=-1) return mkexternalnode(p, id); if(ISCONSTSTR(function_name,"`->") || ISCONSTSTR(function_name,"`[]")) { return mknode(F_MAGIC_INDEX, mknewintnode(e),mknewintnode(n+1)); } if(ISCONSTSTR(function_name,"`->=") || ISCONSTSTR(function_name,"`[]=")) { return mknode(F_MAGIC_SET_INDEX, mknewintnode(e),mknewintnode(n+1)); } } } return 0; } void rename_last_inherit(struct pike_string *n) { if(Pike_compiler->new_program->inherits[Pike_compiler->new_program->num_inherits].name) free_string(Pike_compiler->new_program->inherits[Pike_compiler->new_program->num_inherits].name); copy_shared_string(Pike_compiler->new_program->inherits[Pike_compiler->new_program->num_inherits].name, n); } /* * make this program inherit another program */ void low_inherit(struct program *p, struct object *parent, int parent_identifier, int parent_offset, INT32 flags, struct pike_string *name) { int e; ptrdiff_t inherit_offset, storage_offset; struct inherit inherit; struct pike_string *s; if(!p) { yyerror("Illegal program pointer."); return; } if(p->flags & PROGRAM_USES_PARENT) { if(!parent && !parent_offset) { yyerror("Parent pointer lost, cannot inherit!"); /* We inherit it anyway, to avoid causing more errors */ } } /* parent offset was increased by one for above test.. */ if(parent_offset) parent_offset--; if(!(p->flags & (PROGRAM_FINISHED | PROGRAM_PASS_1_DONE))) { yyerror("Cannot inherit program which is not fully compiled yet."); return; } inherit_offset = Pike_compiler->new_program->num_inherits; /* alignment magic */ storage_offset=p->inherits[0].storage_offset % p->alignment_needed; storage_offset=low_add_storage(STORAGE_NEEDED(p), p->alignment_needed, storage_offset); /* Without this, the inherit becomes skewed */ storage_offset-=p->inherits[0].storage_offset; for(e=0; e<(int)p->num_inherits; e++) { inherit=p->inherits[e]; add_ref(inherit.prog); inherit.identifier_level += Pike_compiler->new_program->num_identifier_references; inherit.storage_offset += storage_offset; inherit.inherit_level ++; if(!e) { if(parent) { if(parent->next == parent) { struct object *o; for(o=Pike_compiler->fake_object->parent;o!=parent;o=o->parent) { #ifdef PIKE_DEBUG if(!o) fatal("low_inherit with odd Pike_compiler->fake_object as parent!\n"); #endif inherit.parent_offset++; } }else{ inherit.parent=parent; inherit.parent_identifier=parent_identifier; inherit.parent_offset=0; } }else{ inherit.parent_offset+=parent_offset; inherit.parent_identifier=parent_identifier; } }else{ if(!inherit.parent) { if(parent && parent->next != parent && inherit.parent_offset) { struct object *par=parent; int e,pid=parent_identifier; for(e=1;e<inherit.parent_offset;e++) { struct inherit *in; if(!par->prog) { par=0; pid=0; break; } in=INHERIT_FROM_INT(par->prog, pid); if(in->parent_offset) { pid=par->parent_identifier; par=par->parent; e-=in->parent_offset-1; }else{ pid=in->parent_identifier; par=in->parent; } } inherit.parent=par; inherit.parent_offset=0; }else{ inherit.parent_offset+=parent_offset; } } } if(inherit.parent) add_ref(inherit.parent); if(name) { if(e==0) { copy_shared_string(inherit.name,name); } else if(inherit.name) { struct pike_string *s; s=begin_shared_string(inherit.name->len + name->len + 2); MEMCPY(s->str,name->str,name->len); MEMCPY(s->str+name->len,"::",2); MEMCPY(s->str+name->len+2,inherit.name->str,inherit.name->len); inherit.name=end_shared_string(s); } else { inherit.name=0; } }else{ inherit.name=0; } add_to_inherits(inherit); } for (e=0; e < (int)p->num_identifier_references; e++) { struct reference fun; struct pike_string *name; fun = p->identifier_references[e]; /* Make a copy */ name=ID_FROM_PTR(p,&fun)->name; fun.inherit_offset += inherit_offset; if (fun.id_flags & ID_NOMASK) { int n; n = isidentifier(name); if (n != -1 && ID_FROM_INT(Pike_compiler->new_program,n)->func.offset != -1) my_yyerror("Illegal to redefine 'nomask' function/variable \"%s\"",name->str); } if(fun.id_flags & ID_PRIVATE) fun.id_flags|=ID_HIDDEN; if (fun.id_flags & ID_PUBLIC) fun.id_flags |= flags & ~ID_PRIVATE; else fun.id_flags |= flags; fun.id_flags |= ID_INHERITED; add_to_identifier_references(fun); } } PMOD_EXPORT void do_inherit(struct svalue *s, INT32 flags, struct pike_string *name) { struct program *p=program_from_svalue(s); low_inherit(p, s->type == T_FUNCTION ? s->u.object : 0, s->subtype, 0, flags, name); } void compiler_do_inherit(node *n, INT32 flags, struct pike_string *name) { struct program *p; struct identifier *i; INT32 numid, offset; if(!n) { yyerror("Unable to inherit"); return; } switch(n->token) { case F_IDENTIFIER: p=Pike_compiler->new_program; offset=0; numid=n->u.id.number; goto continue_inherit; case F_EXTERNAL: { struct program_state *state = Pike_compiler->previous; offset = 0; /* FIXME: Should this be zero or 1? */ while (state && (state->new_program->id != n->u.integer.a)) { state = state->previous; offset++; } if (!state) { yyerror("Failed to resolv external constant.\n"); return; } p = state->new_program; numid = n->u.integer.b; } continue_inherit: i=ID_FROM_INT(p, numid); if(IDENTIFIER_IS_CONSTANT(i->identifier_flags)) { struct svalue *s=&PROG_FROM_INT(p, numid)-> constants[i->func.offset].sval; if(s->type != T_PROGRAM) { do_inherit(s,flags,name); return; }else{ p=s->u.program; } }else{ yyerror("Inherit identifier is not a constant program"); return; } low_inherit(p, 0, numid, offset+1, flags, name); break; default: resolv_class(n); do_inherit(Pike_sp-1, flags, name); pop_stack(); } } void simple_do_inherit(struct pike_string *s, INT32 flags, struct pike_string *name) { reference_shared_string(s); push_string(s); ref_push_string(lex.current_file); SAFE_APPLY_MASTER("handle_inherit", 2); if(Pike_sp[-1].type != T_PROGRAM) { my_yyerror("Couldn't find file to inherit %s",s->str); pop_stack(); return; } if(name) { free_string(s); s=name; } do_inherit(Pike_sp-1, flags, s); free_string(s); pop_stack(); } /* * Return the index of the identifier found, otherwise -1. */ int isidentifier(struct pike_string *s) { INT32 e; for(e=Pike_compiler->new_program->num_identifier_references-1;e>=0;e--) { if(Pike_compiler->new_program->identifier_references[e].id_flags & ID_HIDDEN) continue; if(ID_FROM_INT(Pike_compiler->new_program, e)->name == s) return e; } return -1; } /* argument must be a shared string */ int low_define_variable(struct pike_string *name, struct pike_string *type, INT32 flags, size_t offset, INT32 run_time_type) { int n; struct identifier dummy; struct reference ref; #ifdef PIKE_DEBUG if(Pike_compiler->new_program->flags & (PROGRAM_FIXED | PROGRAM_OPTIMIZED)) fatal("Attempting to add variable to fixed program\n"); if(Pike_compiler->compiler_pass==2) fatal("Internal error: Not allowed to add more identifiers during second compiler pass.\n" "Added identifier: \"%s\"\n", name->str); #endif copy_shared_string(dummy.name, name); copy_shared_string(dummy.type, type); dummy.identifier_flags = 0; dummy.run_time_type=run_time_type; dummy.func.offset=offset - Pike_compiler->new_program->inherits[0].storage_offset; #ifdef PROFILING dummy.self_time=0; dummy.num_calls=0; dummy.total_time=0; #endif ref.id_flags=flags; ref.identifier_offset=Pike_compiler->new_program->num_identifiers; ref.inherit_offset=0; add_to_variable_index(ref.identifier_offset); add_to_identifiers(dummy); n=Pike_compiler->new_program->num_identifier_references; add_to_identifier_references(ref); return n; } PMOD_EXPORT int map_variable(char *name, char *type, INT32 flags, size_t offset, INT32 run_time_type) { int ret; struct pike_string *n,*t; #ifdef PROGRAM_BUILD_DEBUG fprintf (stderr, "%.*sdefining variable (pass=%d): %s %s\n", compilation_depth, " ", Pike_compiler->compiler_pass, type, name); #endif n=make_shared_string(name); t=parse_type(type); ret=low_define_variable(n,t,flags,offset,run_time_type); free_string(n); free_string(t); return ret; } PMOD_EXPORT int quick_map_variable(char *name, int name_length, size_t offset, char *type, int type_length, INT32 run_time_type, INT32 flags) { int ret; struct pike_string *n,*t; #ifdef PROGRAM_BUILD_DEBUG fprintf (stderr, "%.*sdefining variable (pass=%d): %s %s\n", compilation_depth, " ", Pike_compiler->compiler_pass, type, name); #endif n=make_shared_binary_string(name,name_length); t=make_shared_binary_string(type,type_length); ret=low_define_variable(n,t,flags,offset,run_time_type); free_string(n); free_string(t); return ret; } /* argument must be a shared string */ int define_variable(struct pike_string *name, struct pike_string *type, INT32 flags) { int n, run_time_type; #ifdef PIKE_DEBUG if(name!=debug_findstring(name)) fatal("define_variable on nonshared string.\n"); #endif #ifdef PROGRAM_BUILD_DEBUG { struct pike_string *d = describe_type (type); fprintf (stderr, "%.*sdefining variable (pass=%d): %s ", compilation_depth, " ", Pike_compiler->compiler_pass, d->str); free_string (d); push_string (name); print_svalue (stderr, --Pike_sp); putc ('\n', stderr); } #endif if(type == void_type_string) yyerror("Variables can't be of type void"); n = isidentifier(name); if(Pike_compiler->new_program->flags & PROGRAM_PASS_1_DONE) { if(n==-1) yyerror("Pass2: Variable disappeared!"); else { struct identifier *id; id=ID_FROM_INT(Pike_compiler->new_program,n); free_string(id->type); copy_shared_string(id->type, type); return n; } } #ifdef PIKE_DEBUG if(Pike_compiler->new_program->flags & (PROGRAM_FIXED | PROGRAM_OPTIMIZED)) fatal("Attempting to add variable to fixed program\n"); #endif if(n != -1) { /* not inherited */ if(Pike_compiler->new_program->identifier_references[n].inherit_offset == 0) { if (!((IDENTIFIERP(n)->id_flags | flags) & ID_EXTERN)) { my_yyerror("Identifier '%s' defined twice.",name->str); return n; } if (flags & ID_EXTERN) { /* FIXME: Check type */ return n; } } if (!(IDENTIFIERP(n)->id_flags & ID_EXTERN)) { if (IDENTIFIERP(n)->id_flags & ID_NOMASK) my_yyerror("Illegal to redefine 'nomask/final' " "variable/functions \"%s\"", name->str); if(!(IDENTIFIERP(n)->id_flags & ID_INLINE) || Pike_compiler->compiler_pass!=1) { if(!match_types(ID_FROM_INT(Pike_compiler->new_program, n)->type, type)) my_yyerror("Illegal to redefine inherited variable " "with different type."); if(!IDENTIFIER_IS_VARIABLE(ID_FROM_INT(Pike_compiler->new_program, n)-> identifier_flags)) { my_yyerror("Illegal to redefine inherited variable " "with different type."); } IDENTIFIERP(n)->id_flags = flags & ~ID_EXTERN; return n; } } } run_time_type=compile_type_to_runtime_type(type); switch(run_time_type) { #ifdef AUTO_BIGNUM #if 0 case T_OBJECT: /* This is to allow room for integers in variables declared as * 'object', however, this could be changed in the future to only * make room for integers if the variable was declared as * 'object(Gmp.mpz)' /Hubbe */ #endif case T_INT: #endif case T_FUNCTION: case T_PROGRAM: run_time_type = T_MIXED; } n=low_define_variable(name,type,flags, low_add_storage(sizeof_variable(run_time_type), alignof_variable(run_time_type),0), run_time_type); return n; } PMOD_EXPORT int simple_add_variable(char *name, char *type, INT32 flags) { INT32 ret; struct pike_string *name_s, *type_s; name_s=make_shared_string(name); type_s=parse_type(type); ret=define_variable(name_s, type_s, flags); free_string(name_s); free_string(type_s); return ret; } PMOD_EXPORT int add_constant(struct pike_string *name, struct svalue *c, INT32 flags) { int n; struct identifier dummy; struct reference ref; #ifdef PROGRAM_BUILD_DEBUG { if (c) { struct pike_string *t = get_type_of_svalue (c); struct pike_string *d = describe_type (t); fprintf (stderr, "%.*sdefining constant (pass=%d): %s ", compilation_depth, " ", Pike_compiler->compiler_pass, d->str); free_string (t); free_string (d); } else fprintf (stderr, "%.*sdeclaring constant (pass=%d): ", compilation_depth, " ", Pike_compiler->compiler_pass); push_string (name); print_svalue (stderr, --Pike_sp); putc ('\n', stderr); } #endif #ifdef PIKE_DEBUG if(name!=debug_findstring(name)) fatal("define_constant on nonshared string.\n"); #endif n = isidentifier(name); /* * FIXME: * No constants should be allowed to contain * any fake objects. (Fake objects can be * detected thus: fake_ob->next == fake_ob * * I would prefer to find a way to detect * this without recursing through arrays, * mapping etc. etc. * * /Hubbe */ if(Pike_compiler->new_program->flags & PROGRAM_PASS_1_DONE) { if(n==-1) { yyerror("Pass2: Constant disappeared!"); }else{ struct identifier *id; id=ID_FROM_INT(Pike_compiler->new_program,n); if(id->func.offset>=0) { struct pike_string *s; struct svalue *c=&PROG_FROM_INT(Pike_compiler->new_program,n)-> constants[id->func.offset].sval; s=get_type_of_svalue(c); free_string(id->type); id->type=s; } else { #ifdef PIKE_DEBUG if (!c) fatal("Can't declare constant during second compiler pass\n"); #endif free_string(id->type); id->type = get_type_of_svalue(c); id->run_time_type = c->type; id->func.offset = store_constant(c, 0, 0); } return n; } } #ifdef PIKE_DEBUG if(Pike_compiler->new_program->flags & (PROGRAM_FIXED | PROGRAM_OPTIMIZED)) fatal("Attempting to add constant to fixed program\n"); if(Pike_compiler->compiler_pass==2) fatal("Internal error: Not allowed to add more identifiers during second compiler pass.\n"); #endif copy_shared_string(dummy.name, name); dummy.identifier_flags = IDENTIFIER_CONSTANT; if (c) { dummy.type = get_type_of_svalue(c); dummy.run_time_type=c->type; dummy.func.offset=store_constant(c, 0, 0); } else { reference_shared_string(mixed_type_string); dummy.type = mixed_type_string; dummy.run_time_type=T_MIXED; dummy.func.offset=-1; } ref.id_flags=flags; ref.identifier_offset=Pike_compiler->new_program->num_identifiers; ref.inherit_offset=0; #ifdef PROFILING dummy.self_time=0; dummy.num_calls=0; dummy.total_time=0; #endif add_to_identifiers(dummy); if(n != -1) { if(IDENTIFIERP(n)->id_flags & ID_NOMASK) my_yyerror("Illegal to redefine 'nomask' identifier \"%s\"", name->str); /* not inherited */ if(Pike_compiler->new_program->identifier_references[n].inherit_offset == 0) { my_yyerror("Identifier '%s' defined twice.",name->str); return n; } if(!(IDENTIFIERP(n)->id_flags & ID_INLINE)) { /* override */ Pike_compiler->new_program->identifier_references[n]=ref; return n; } } n=Pike_compiler->new_program->num_identifier_references; add_to_identifier_references(ref); return n; } PMOD_EXPORT int simple_add_constant(char *name, struct svalue *c, INT32 flags) { INT32 ret; struct pike_string *id; id=make_shared_string(name); ret=add_constant(id, c, flags); free_string(id); return ret; } PMOD_EXPORT int add_integer_constant(char *name, INT32 i, INT32 flags) { struct svalue tmp; tmp.u.integer=i; tmp.type=T_INT; tmp.subtype=NUMBER_NUMBER; return simple_add_constant(name, &tmp, flags); } PMOD_EXPORT int quick_add_integer_constant(char *name, int name_length, INT32 i, INT32 flags) { struct svalue tmp; struct pike_string *id; INT32 ret; tmp.u.integer=i; tmp.type=T_INT; tmp.subtype=NUMBER_NUMBER; id=make_shared_binary_string(name,name_length); ret=add_constant(id, &tmp, flags); free_string(id); return ret; } PMOD_EXPORT int add_float_constant(char *name, double f, INT32 flags) { struct svalue tmp; tmp.type=T_FLOAT; tmp.u.float_number=f; tmp.subtype=0; return simple_add_constant(name, &tmp, flags); } PMOD_EXPORT int add_string_constant(char *name, char *str, INT32 flags) { INT32 ret; struct svalue tmp; tmp.type=T_STRING; tmp.subtype=0; tmp.u.string=make_shared_string(str); ret=simple_add_constant(name, &tmp, flags); free_svalue(&tmp); return ret; } PMOD_EXPORT int add_program_constant(char *name, struct program *p, INT32 flags) { INT32 ret; struct svalue tmp; tmp.type=T_PROGRAM; tmp.subtype=0; tmp.u.program=p; ret=simple_add_constant(name, &tmp, flags); return ret; } PMOD_EXPORT int add_object_constant(char *name, struct object *o, INT32 flags) { INT32 ret; struct svalue tmp; tmp.type=T_OBJECT; tmp.subtype=0; tmp.u.object=o; ret=simple_add_constant(name, &tmp, flags); return ret; } PMOD_EXPORT int add_function_constant(char *name, void (*cfun)(INT32), char * type, INT16 flags) { struct svalue s; struct pike_string *n; INT32 ret; s.type=T_FUNCTION; s.subtype=FUNCTION_BUILTIN; s.u.efun=make_callable(cfun, name, type, flags, 0, 0); ret=simple_add_constant(name, &s, 0); free_svalue(&s); return ret; } PMOD_EXPORT int debug_end_class(char *name, ptrdiff_t namelen, INT32 flags) { INT32 ret; struct svalue tmp; struct pike_string *id; tmp.type=T_PROGRAM; tmp.subtype=0; tmp.u.program=end_program(); if(!tmp.u.program) fatal("Failed to initialize class '%s'\n",name); id=make_shared_binary_string(name,namelen); ret=add_constant(id, &tmp, flags); free_string(id); free_svalue(&tmp); return ret; } /* * define a new function * if func isn't given, it is supposed to be a prototype. */ INT32 define_function(struct pike_string *name, struct pike_string *type, INT16 flags, INT8 function_flags, union idptr *func) { struct identifier *funp,fun; struct reference ref; struct svalue *lfun_type; INT32 i; #ifdef PROGRAM_BUILD_DEBUG { struct pike_string *d = describe_type (type); fprintf (stderr, "%.*sdefining function (pass=%d): %s ", compilation_depth, " ", Pike_compiler->compiler_pass, d->str); free_string (d); push_string (name); print_svalue (stderr, --Pike_sp); putc ('\n', stderr); } #endif #ifdef PROFILING fun.self_time=0; fun.num_calls=0; fun.total_time=0; #endif /* If this is an lfun, match against the predefined type. */ if ((lfun_type = low_mapping_string_lookup(lfun_types, name))) { #ifdef PIKE_DEBUG if (lfun_type->type != T_TYPE) { fatal("Bad entry in lfun_types for key \"%s\"\n", name->str); } #endif /* PIKE_DEBUG */ if (!pike_types_le(type, lfun_type->u.string)) { if (!match_types(type, lfun_type->u.string)) { yytype_error("Function type mismatch", lfun_type->u.string, type, 0); } else if (lex.pragmas & ID_STRICT_TYPES) { yytype_error("Function type mismatch", lfun_type->u.string, type, YYTE_IS_WARNING); } } } if(function_flags & IDENTIFIER_C_FUNCTION) Pike_compiler->new_program->flags |= PROGRAM_HAS_C_METHODS; i=isidentifier(name); if(i >= 0) { /* already defined */ funp=ID_FROM_INT(Pike_compiler->new_program, i); ref=Pike_compiler->new_program->identifier_references[i]; if(ref.inherit_offset == 0) /* not inherited */ { if( !( IDENTIFIER_IS_FUNCTION(funp->identifier_flags) && ( (!func || func->offset == -1) || (funp->func.offset == -1)))) { my_yyerror("Identifier '%s' defined twice.",name->str); return i; } /* match types against earlier prototype or vice versa */ if(!match_types(type, funp->type)) { if (!(flags & ID_VARIANT)) { my_yyerror("Prototype doesn't match for function %s.",name->str); } } } /* We modify the old definition if it is in this program */ if(ref.inherit_offset==0) { if(func) funp->func = *func; #if 0 /* prototypes does not override non-prototypes, ok? */ else funp->func.offset = -1; #endif funp->identifier_flags=function_flags; free_string(funp->type); copy_shared_string(funp->type, type); }else{ if((ref.id_flags & ID_NOMASK) #if 0 && !(funp->func.offset == -1) #endif ) { my_yyerror("Illegal to redefine 'nomask' function %s.",name->str); } if(ref.id_flags & ID_INLINE) { goto make_a_new_def; } /* Otherwise we make a new definition */ copy_shared_string(fun.name, name); copy_shared_string(fun.type, type); fun.run_time_type=T_FUNCTION; fun.identifier_flags=function_flags; if(function_flags & IDENTIFIER_C_FUNCTION) Pike_compiler->new_program->flags |= PROGRAM_HAS_C_METHODS; if(func) fun.func = *func; else fun.func.offset = -1; ref.identifier_offset=Pike_compiler->new_program->num_identifiers; add_to_identifiers(fun); } ref.inherit_offset = 0; ref.id_flags = flags; #if 0 Pike_compiler->new_program->identifier_references[i]=ref; #else { int z; /* This loop could possibly be optimized by looping over * each inherit and looking up 'name' in each inherit * and then see if should be overwritten * /Hubbe */ for(z=0;z<Pike_compiler->new_program->num_identifier_references;z++) { /* Do zapp hidden identifiers */ if(Pike_compiler->new_program->identifier_references[z].id_flags & ID_HIDDEN) continue; /* Do not zapp inline ('local') identifiers */ if(Pike_compiler->new_program->identifier_references[z].inherit_offset && (Pike_compiler->new_program->identifier_references[z].id_flags & ID_INLINE)) continue; /* Do not zapp functions with the wrong name... */ if(ID_FROM_INT(Pike_compiler->new_program, z)->name != name) continue; Pike_compiler->new_program->identifier_references[z]=ref; } #ifdef PIKE_DEBUG if(MEMCMP(Pike_compiler->new_program->identifier_references+i, &ref,sizeof(ref))) fatal("New function overloading algorithm failed!\n"); #endif } #endif return i; } make_a_new_def: #ifdef PIKE_DEBUG if(Pike_compiler->compiler_pass==2) fatal("Internal error: Not allowed to add more identifiers during second compiler pass.\n"); #endif /* define a new function */ copy_shared_string(fun.name, name); copy_shared_string(fun.type, type); fun.identifier_flags=function_flags; fun.run_time_type=T_FUNCTION; if(func) fun.func = *func; else fun.func.offset = -1; i=Pike_compiler->new_program->num_identifiers; add_to_identifiers(fun); ref.id_flags = flags; ref.identifier_offset = i; ref.inherit_offset = 0; i=Pike_compiler->new_program->num_identifier_references; add_to_identifier_references(ref); return i; } int really_low_find_shared_string_identifier(struct pike_string *name, struct program *prog, int flags) { struct reference *funp; struct identifier *fun; int i,t; #if 0 CDFPRINTF((stderr,"th(%ld) Trying to find %s flags=%d\n", (long)th_self(),name->str, flags)); #endif #ifdef PIKE_DEBUG if (!prog) { fatal("really_low_find_shared_string_identifier(\"%s\", NULL, %d)\n" "prog is NULL!\n", name->str, flags); } #endif /* PIKE_DEBUG */ for(i=0;i<(int)prog->num_identifier_references;i++) { funp = prog->identifier_references + i; if(funp->id_flags & ID_HIDDEN) continue; if(funp->id_flags & ID_STATIC) if(!(flags & SEE_STATIC)) continue; fun = ID_FROM_PTR(prog, funp); /* if(fun->func.offset == -1) continue; * Prototype */ if(!is_same_string(fun->name,name)) continue; if(funp->id_flags & ID_INHERITED) { if(funp->id_flags & ID_PRIVATE) continue; for(t=0; t>=0 && t<(int)prog->num_identifier_references; t++) { struct reference *funpb; struct identifier *funb; if(t==i) continue; funpb=prog->identifier_references+t; if(funpb->id_flags & ID_HIDDEN) continue; if(funpb->id_flags & ID_STATIC) if(!(flags & SEE_STATIC)) continue; if((funpb->id_flags & ID_INHERITED) && t<i) continue; funb=ID_FROM_PTR(prog,funpb); /* if(funb->func.offset == -1) continue; * prototype */ if(fun->name==funb->name) t=-10; } if(t < 0) continue; } return i; } return -1; } int low_find_lfun(struct program *p, ptrdiff_t lfun) { struct pike_string *lfun_name = findstring(lfun_names[lfun]); unsigned int flags = 0; if (!lfun_name) return -1; return really_low_find_shared_string_identifier(lfun_name, dmalloc_touch(struct program *, p), SEE_STATIC); } /* * lookup the number of a function in a program given the name in * a shared_string */ int low_find_shared_string_identifier(struct pike_string *name, struct program *prog) { int max,min,tst; struct identifier *fun; if(prog->flags & PROGRAM_FIXED) { unsigned short *funindex = prog->identifier_index; #ifdef PIKE_DEBUG if(!funindex) fatal("No funindex in fixed program\n"); #endif max = prog->num_identifier_index; min = 0; while(max != min) { tst=(max + min) >> 1; fun = ID_FROM_INT(prog, funindex[tst]); if(is_same_string(fun->name,name)) return funindex[tst]; if(my_order_strcmp(fun->name, name) > 0) max=tst; else min=tst+1; } }else{ return really_low_find_shared_string_identifier(name,prog,0); } return -1; } #ifdef FIND_FUNCTION_HASHSIZE #if FIND_FUNCTION_HASHSIZE == 0 #undef FIND_FUNCTION_HASHSIZE #endif #endif #ifdef FIND_FUNCTION_HASHSIZE struct ff_hash { struct pike_string *name; int id; int fun; }; static struct ff_hash cache[FIND_FUNCTION_HASHSIZE]; #endif int find_shared_string_identifier(struct pike_string *name, struct program *prog) { #ifdef PIKE_DEBUG if (!prog) { fatal("find_shared_string_identifier(): No program!\n" "Identifier: %s%s%s\n", name?"\"":"", name?name->str:"NULL", name?"\"":""); } #endif /* PIKE_DEBUG */ #ifdef FIND_FUNCTION_HASHSIZE if(prog -> flags & PROGRAM_FIXED) { size_t hashval; hashval = my_hash_string(name); hashval += prog->id; hashval ^= (size_t)prog; hashval -= name->str[0]; hashval %= FIND_FUNCTION_HASHSIZE; if(is_same_string(cache[hashval].name,name) && cache[hashval].id==prog->id) return cache[hashval].fun; if(cache[hashval].name) free_string(cache[hashval].name); copy_shared_string(cache[hashval].name,name); cache[hashval].id=prog->id; return cache[hashval].fun=low_find_shared_string_identifier(name,prog); } #endif /* FIND_FUNCTION_HASHSIZE */ return low_find_shared_string_identifier(name,prog); } PMOD_EXPORT int find_identifier(char *name,struct program *prog) { struct pike_string *n; if(!prog) { if (strlen(name) < 1024) { error("Lookup of identifier %s in destructed object.\n", name); } else { error("Lookup of long identifier in destructed object.\n"); } } n=findstring(name); if(!n) return -1; return find_shared_string_identifier(n,prog); } int store_prog_string(struct pike_string *str) { unsigned int i; for (i=0;i<Pike_compiler->new_program->num_strings;i++) if (Pike_compiler->new_program->strings[i] == str) return i; reference_shared_string(str); add_to_strings(str); return i; } int store_constant(struct svalue *foo, int equal, struct pike_string *constant_name) { struct program_constant tmp; unsigned int e; JMP_BUF tmp2; if(SETJMP(tmp2)) { ONERROR tmp; struct svalue zero; SET_ONERROR(tmp,exit_on_error,"Error in store_constant in compiler!"); assign_svalue_no_free(Pike_sp++, & throw_value); APPLY_MASTER("handle_error", 1); pop_stack(); UNSET_ONERROR(tmp); yyerror("Couldn't store constant."); zero.type = T_INT; zero.subtype = NUMBER_NUMBER; zero.u.integer=0; UNSETJMP(tmp2); return store_constant(&zero, equal, constant_name); }else{ for(e=0;e<Pike_compiler->new_program->num_constants;e++) { struct program_constant *c= Pike_compiler->new_program->constants+e; if((equal ? is_equal(& c->sval,foo) : is_eq(& c->sval,foo)) && c->name == constant_name) { UNSETJMP(tmp2); return e; } } assign_svalue_no_free(&tmp.sval,foo); if((tmp.name=constant_name)) add_ref(constant_name); add_to_constants(tmp); UNSETJMP(tmp2); return e; } } /* * program examination functions available from Pike. */ struct array *program_indices(struct program *p) { int e; int n = 0; struct array *res; for (e = p->num_identifier_references; e--; ) { struct identifier *id; if (p->identifier_references[e].id_flags & ID_HIDDEN) { continue; } id = ID_FROM_INT(p, e); if (IDENTIFIER_IS_CONSTANT(id->identifier_flags)) { ref_push_string(ID_FROM_INT(p, e)->name); n++; } } f_aggregate(n); res = Pike_sp[-1].u.array; add_ref(res); pop_stack(); return(res); } struct array *program_values(struct program *p) { int e; int n = 0; struct array *res; for(e = p->num_identifier_references; e--; ) { struct identifier *id; if (p->identifier_references[e].id_flags & ID_HIDDEN) { continue; } id = ID_FROM_INT(p, e); if (IDENTIFIER_IS_CONSTANT(id->identifier_flags)) { struct program *p2 = PROG_FROM_INT(p, e); push_svalue( & p2->constants[id->func.offset].sval); n++; } } f_aggregate(n); res = Pike_sp[-1].u.array; add_ref(res); pop_stack(); return(res); } void program_index_no_free(struct svalue *to, struct program *p, struct svalue *ind) { int e; struct pike_string *s; if (ind->type != T_STRING) { error("Can't index a program with a %s (expected string)\n", get_name_of_type(ind->type)); } s = ind->u.string; e=find_shared_string_identifier(s, p); if(e!=-1) { struct identifier *id; id=ID_FROM_INT(p, e); if (IDENTIFIER_IS_CONSTANT(id->identifier_flags)) { struct program *p2 = PROG_FROM_INT(p, e); assign_svalue_no_free(to, ( & p2->constants[id->func.offset].sval)); return; } else { if (s->len < 1024) { error("Index \"%s\" is not constant.\n", s->str); } else { error("Index is not constant.\n"); } } } #if 1 to->type=T_INT; to->subtype=NUMBER_UNDEFINED; to->u.integer=0; #else if (s->len < 1024) { error("No such index \"%s\".\n", s->str); } else { error("No such index.\n"); } #endif } /* * Line number support routines, now also tells what file we are in */ int get_small_number(char **q) { /* This is a workaround for buggy cc & Tru64 */ int ret; ret=*(signed char *)*q; (*q)++; switch(ret) { case -127: ret=EXTRACT_WORD((unsigned char*)*q); *q+=2; return ret; case -128: ret=EXTRACT_INT((unsigned char*)*q); *q+=4; return ret; default: return ret; } } void start_line_numbering(void) { if(Pike_compiler->last_file) { free_string(Pike_compiler->last_file); Pike_compiler->last_file=0; } Pike_compiler->last_pc=Pike_compiler->last_line=0; } static void insert_small_number(INT32 a) { if(a>-127 && a<127) { add_to_linenumbers(a); }else if(a>=-32768 && a<32768){ add_to_linenumbers(-127); ins_short(a, add_to_linenumbers); }else{ add_to_linenumbers(-128); ins_int(a, add_to_linenumbers); } } void store_linenumber(INT32 current_line, struct pike_string *current_file) { /* if(!store_linenumbers) fatal("Fnord.\n"); */ #ifdef PIKE_DEBUG if(d_flag) { INT32 line=0, off=0; char *file=0; char *cnt=Pike_compiler->new_program->linenumbers; while(cnt < Pike_compiler->new_program->linenumbers + Pike_compiler->new_program->num_linenumbers) { if(*cnt == 127) { file=cnt+1; cnt=file+strlen(file)+1; } off+=get_small_number(&cnt); line+=get_small_number(&cnt); } if(Pike_compiler->last_line != line || Pike_compiler->last_pc != off || (Pike_compiler->last_file && file && strcmp(Pike_compiler->last_file->str, file))) { fatal("Line numbering out of whack\n" " (line: %d ?= %d)!\n" " ( pc: %d ?= %d)!\n" " (file: %s ?= %s)!\n", Pike_compiler->last_line, line, Pike_compiler->last_pc, off, Pike_compiler->last_file?Pike_compiler->last_file->str:"N/A", file?file:"N/A"); } } #endif if(Pike_compiler->last_line!=current_line || Pike_compiler->last_file != current_file) { if(Pike_compiler->last_file != current_file) { char *tmp; if(Pike_compiler->last_file) free_string(Pike_compiler->last_file); add_to_linenumbers(127); for(tmp=current_file->str; *tmp; tmp++) add_to_linenumbers(*tmp); add_to_linenumbers(0); copy_shared_string(Pike_compiler->last_file, current_file); } insert_small_number(PC-Pike_compiler->last_pc); insert_small_number(current_line-Pike_compiler->last_line); Pike_compiler->last_line=current_line; Pike_compiler->last_pc=PC; } } /* * return the file in which we were executing. * pc should be the program counter, prog the current * program, and line will be initialized to the line * in that file. */ PMOD_EXPORT char *get_line(unsigned char *pc,struct program *prog,INT32 *linep) { static char *file, *cnt; static INT32 off,line,pid; ptrdiff_t offset; if (prog == 0) return "Unkown program"; offset = pc - prog->program; if(prog == Pike_compiler->new_program) { linep[0]=0; return "Optimizer"; } #if 0 if(prog->id != pid || offset < off) #endif { cnt=prog->linenumbers; off=line=0; file="Line not found"; pid=prog->id; } if (offset > (INT32)prog->num_program || offset<0) return file; while(cnt < prog->linenumbers + prog->num_linenumbers) { int oline; if(*cnt == 127) { file=cnt+1; cnt=file+strlen(file)+1; } off+=get_small_number(&cnt); oline=line; line+=get_small_number(&cnt); if(off > offset) { linep[0]=oline; return file; } } linep[0]=line; return file; } void my_yyerror(char *fmt,...) ATTRIBUTE((format(printf,1,2))) { va_list args; char buf[8192]; va_start(args,fmt); #ifdef HAVE_VSNPRINTF vsnprintf(buf, 8190, fmt, args); #else /* !HAVE_VSNPRINTF */ VSPRINTF(buf, fmt, args); #endif /* HAVE_VSNPRINTF */ if((size_t)strlen(buf) >= (size_t)sizeof(buf)) fatal("Buffer overflow in my_yyerror.\n"); yyerror(buf); va_end(args); } struct program *compile(struct pike_string *prog, struct object *handler) { #ifdef PIKE_DEBUG ONERROR tmp; #endif struct program *p; struct lex save_lex; int save_depth=compilation_depth; int saved_threads_disabled; struct object *saved_handler = error_handler; dynamic_buffer used_modules_save = used_modules; INT32 num_used_modules_save = Pike_compiler->num_used_modules; extern void yyparse(void); struct mapping *resolve_cache_save = resolve_cache; resolve_cache = 0; CDFPRINTF((stderr, "th(%ld) compile() starting compilation_depth=%d\n", (long)th_self(),compilation_depth)); error_handler = handler; if(error_handler) { /* FIXME: support '#Pike 0.6' here */ apply(error_handler,"get_default_module",0); if(IS_ZERO(Pike_sp-1)) { pop_stack(); ref_push_mapping(get_builtin_constants()); } }else{ ref_push_mapping(get_builtin_constants()); } low_init_threads_disable(); saved_threads_disabled = threads_disabled; #ifdef PIKE_DEBUG SET_ONERROR(tmp, fatal_on_error,"Compiler exited with longjump!\n"); #endif Pike_compiler->num_used_modules=0; save_lex=lex; lex.end = prog->str + (prog->len << prog->size_shift); switch(prog->size_shift) { case 0: lex.current_lexer = yylex0; break; case 1: lex.current_lexer = yylex1; break; case 2: lex.current_lexer = yylex2; break; default: fatal("Program has bad shift %d!\n", prog->size_shift); break; } lex.current_line=1; lex.current_file=make_shared_string("-"); if (runtime_options & RUNTIME_STRICT_TYPES) { lex.pragmas = ID_STRICT_TYPES; } else { lex.pragmas = 0; } low_start_new_program(0,0,0,0); initialize_buf(&used_modules); use_module(Pike_sp-1); if(lex.current_file) { store_linenumber(lex.current_line, lex.current_file); #ifdef DEBUG_MALLOC if(strcmp(lex.current_file->str,"-") || lex.current_line!=1) debug_malloc_name(Pike_compiler->new_program, lex.current_file->str, lex.current_line); #endif } compilation_depth=0; /* start_line_numbering(); */ Pike_compiler->compiler_pass=1; lex.pos=prog->str; CDFPRINTF((stderr, "compile(): First pass\n")); yyparse(); /* Parse da program */ p=end_first_pass(0); #ifdef PIKE_DEBUG if (compilation_depth != -1) { fprintf(stderr, "compile(): compilation_depth is %d at end of pass 1.\n", compilation_depth); } #endif /* PIKE_DEBUG */ if(p) { low_start_new_program(p,0,0,0); free_program(p); p=0; Pike_compiler->compiler_pass=2; lex.pos=prog->str; use_module(Pike_sp-1); CDFPRINTF((stderr, "compile(): Second pass\n")); yyparse(); /* Parse da program again */ p=end_program(); #ifdef PIKE_DEBUG if (compilation_depth != -1) { fprintf(stderr, "compile(): compilation_depth is %d at end of pass 2.\n", compilation_depth); } #endif /* PIKE_DEBUG */ } #ifdef PIKE_DEBUG if (threads_disabled != saved_threads_disabled) { fatal("compile(): threads_disabled:%d saved_threads_disabled:%d\n", threads_disabled, saved_threads_disabled); } #endif /* PIKE_DEBUG */ /* threads_disabled = saved_threads_disabled + 1; /Hubbe: UGGA! */ CDFPRINTF((stderr, "th(%ld) compile() Leave: threads_disabled:%d, compilation_depth:%d\n", (long)th_self(),threads_disabled, compilation_depth)); exit_threads_disable(NULL); free_string(lex.current_file); lex=save_lex; /* unuse_modules(1); */ #ifdef PIKE_DEBUG if(Pike_compiler->num_used_modules) fatal("Failed to pop modules properly.\n"); #endif toss_buffer(&used_modules); compilation_depth=save_depth; used_modules = used_modules_save; Pike_compiler->num_used_modules = num_used_modules_save ; error_handler = saved_handler; #ifdef PIKE_DEBUG if (resolve_cache) fatal("resolve_cache not freed at end of compilation.\n"); #endif resolve_cache = resolve_cache_save; #ifdef PIKE_DEBUG UNSET_ONERROR(tmp); #endif pop_stack(); /* pop the 'default' module */ if(!p) error("Compilation failed.\n"); return p; } PMOD_EXPORT int pike_add_function(char *name,void (*cfun)(INT32),char *type,INT16 flags) { int ret; struct pike_string *name_tmp,*type_tmp; union idptr tmp; name_tmp=make_shared_string(name); type_tmp=parse_type(type); if(cfun) { tmp.c_fun=cfun; ret=define_function(name_tmp, type_tmp, flags, IDENTIFIER_C_FUNCTION, &tmp); }else{ ret=define_function(name_tmp, type_tmp, flags, IDENTIFIER_C_FUNCTION, 0); } free_string(name_tmp); free_string(type_tmp); return ret; } PMOD_EXPORT int quick_add_function(char *name, int name_length, void (*cfun)(INT32), char *type, int type_length, INT16 flags, int opt_flags) { int ret; struct pike_string *name_tmp,*type_tmp; union idptr tmp; /* fprintf(stderr,"ADD_FUNC: %s\n",name); */ name_tmp=make_shared_binary_string(name,name_length); type_tmp=make_shared_binary_string(type,type_length); if(cfun) { tmp.c_fun=cfun; ret=define_function(name_tmp, type_tmp, flags, IDENTIFIER_C_FUNCTION, &tmp); }else{ ret=define_function(name_tmp, type_tmp, flags, IDENTIFIER_C_FUNCTION, 0); } free_string(name_tmp); free_string(type_tmp); return ret; } #ifdef PIKE_DEBUG void check_all_programs(void) { struct program *p; for(p=first_program;p;p=p->next) check_program(p); #ifdef FIND_FUNCTION_HASHSIZE { unsigned long e; for(e=0;e<FIND_FUNCTION_HASHSIZE;e++) { if(cache[e].name) { check_string(cache[e].name); if(cache[e].id<0 || cache[e].id > current_program_id) fatal("Error in find_function_cache[%ld].id\n",(long)e); if(cache[e].fun < -1 || cache[e].fun > 65536) fatal("Error in find_function_cache[%ld].fun\n",(long)e); } } } #endif } #endif #undef THIS #define THIS ((struct pike_trampoline *)(CURRENT_STORAGE)) struct program *pike_trampoline_program=0; static void apply_trampoline(INT32 args) { error("Internal error: Trampoline magic failed!\n"); } static void init_trampoline(struct object *o) { THIS->frame=0; } static void exit_trampoline(struct object *o) { if(THIS->frame) { free_pike_frame(THIS->frame); THIS->frame=0; } } static void gc_check_frame(struct pike_frame *f) { if(!f) return; if(!debug_gc_check(f,T_UNKNOWN,f) && f->malloced_locals) { if(f->current_object) gc_check(f->current_object); if(f->context.prog) gc_check(f->context.prog); if(f->context.parent) gc_check(f->context.parent); if(f->malloced_locals)gc_check_svalues(f->locals,f->num_locals); if(f->scope) gc_check_frame(f->scope); } } static void gc_check_trampoline(struct object *o) { gc_check_frame(THIS->frame); } static void gc_recurse_frame(struct pike_frame *f) { if(!f) return; if(f->current_object) gc_recurse_object(f->current_object); if(f->context.prog) gc_recurse_program(f->context.prog); if(f->context.parent) gc_recurse_object(f->context.parent); if(f->malloced_locals)gc_recurse_svalues(f->locals,f->num_locals); if(f->scope) gc_recurse_frame(f->scope); } static void gc_recurse_trampoline(struct object *o) { gc_recurse_frame(THIS->frame); } void init_program(void) { int i; struct svalue key; struct svalue val; MAKE_CONSTANT_SHARED_STRING(this_program_string,"this_program"); lfun_types = allocate_mapping(NUM_LFUNS); key.type = T_STRING; val.type = T_TYPE; for (i=0; i < NUM_LFUNS; i++) { key.u.string = make_shared_string(lfun_names[i]); val.u.string = make_pike_type(raw_lfun_types[i]); mapping_insert(lfun_types, &key, &val); free_string(val.u.string); free_string(key.u.string); } start_new_program(); debug_malloc_touch(Pike_compiler->fake_object); debug_malloc_touch(Pike_compiler->fake_object->storage); ADD_STORAGE(struct pike_trampoline); add_function("`()",apply_trampoline,"function(mixed...:mixed)",0); set_init_callback(init_trampoline); set_exit_callback(exit_trampoline); set_gc_check_callback(gc_check_trampoline); set_gc_recurse_callback(gc_recurse_trampoline); debug_malloc_touch(Pike_compiler->fake_object); debug_malloc_touch(Pike_compiler->fake_object->storage); pike_trampoline_program=end_program(); } void cleanup_program(void) { int e; free_string(this_program_string); free_mapping(lfun_types); #ifdef FIND_FUNCTION_HASHSIZE for(e=0;e<FIND_FUNCTION_HASHSIZE;e++) { if(cache[e].name) { free_string(cache[e].name); cache[e].name=0; } } #endif #ifdef DO_PIKE_CLEANUP if(resolve_cache) { free_mapping(dmalloc_touch (struct mapping *, resolve_cache)); resolve_cache=0; } if(pike_trampoline_program) { free_program(pike_trampoline_program); pike_trampoline_program=0; } #endif } #ifdef GC2 void gc_mark_program_as_referenced(struct program *p) { debug_malloc_touch(p); if (p->flags & PROGRAM_AVOID_CHECK) { /* Program is in an inconsistent state. * don't look closer at it. */ debug_malloc_touch(p); if (gc_mark(p)) { if (p == gc_mark_program_pos) gc_mark_program_pos = p->next; if (p == gc_internal_program) gc_internal_program = p->next; else { DOUBLEUNLINK(first_program, p); DOUBLELINK(first_program, p); /* Linked in first. */ } } return; } if(gc_mark(p)) { int e; if (p == gc_mark_program_pos) gc_mark_program_pos = p->next; if (p == gc_internal_program) gc_internal_program = p->next; else { DOUBLEUNLINK(first_program, p); DOUBLELINK(first_program, p); /* Linked in first. */ } for(e=0;e<p->num_constants;e++) gc_mark_svalues(& p->constants[e].sval, 1); for(e=0;e<p->num_inherits;e++) { if(p->inherits[e].parent) gc_mark_object_as_referenced(p->inherits[e].parent); if(e && p->inherits[e].prog) gc_mark_program_as_referenced(p->inherits[e].prog); } } } void real_gc_cycle_check_program(struct program *p, int weak) { GC_CYCLE_ENTER(p, weak) { int e; if (p->flags & PROGRAM_AVOID_CHECK) /* Program is in an inconsistent state. * don't look closer at it. */ return; for(e=0;e<p->num_constants;e++) gc_cycle_check_svalues(& p->constants[e].sval, 1); for(e=0;e<p->num_inherits;e++) { if(p->inherits[e].parent) gc_cycle_check_object(p->inherits[e].parent, 0); if(e && p->inherits[e].prog) gc_cycle_check_program(p->inherits[e].prog, 0); } } GC_CYCLE_LEAVE; } static void gc_check_program(struct program *p) { int e; #ifdef PIKE_DEBUG extern void * check_for; #endif debug_malloc_touch(p); if (p->flags & PROGRAM_AVOID_CHECK) { /* Program is in an inconsistant state. * don't look closer at it. */ debug_malloc_touch(p); return; } for(e=0;e<p->num_constants;e++) { debug_gc_check_svalues(& p->constants[e].sval, 1, T_PROGRAM, p); } for(e=0;e<p->num_inherits;e++) { if(p->inherits[e].parent) { #ifdef PIKE_DEBUG if(debug_gc_check(p->inherits[e].parent,T_PROGRAM,p)==-2) fprintf(stderr,"(program at 0x%lx -> inherit[%d].parent)\n", DO_NOT_WARN((long)p), e); #else debug_gc_check(p->inherits[e].parent, T_PROGRAM, p); #endif } #ifdef PIKE_DEBUG if(d_flag && p->inherits[e].name && check_for != (void *)(ptrdiff_t)1) debug_gc_check(p->inherits[e].name, T_PROGRAM, p); #endif if(e && p->inherits[e].prog) debug_gc_check(p->inherits[e].prog, T_PROGRAM, p); } #ifdef PIKE_DEBUG if(d_flag && check_for != (void *)(ptrdiff_t)1) { int e; for(e=0;e<(int)p->num_strings;e++) debug_gc_check(p->strings[e], T_PROGRAM, p); for(e=0;e<(int)p->num_identifiers;e++) { debug_gc_check(p->identifiers[e].name, T_PROGRAM, p); debug_gc_check(p->identifiers[e].type, T_PROGRAM, p); } } #endif } #ifdef PIKE_DEBUG unsigned gc_touch_all_programs(void) { unsigned n = 0; struct program *p; struct program_state *ps; if (first_program && first_program->prev) fatal("Error in program link list.\n"); for (p = first_program; p; p = p->next) { debug_gc_touch(p); n++; if (p->next && p->next->prev != p) fatal("Error in program link list.\n"); } return n; } #endif void gc_check_all_programs(void) { struct program *p; for(p=first_program;p;p=p->next) gc_check_program(p); } void gc_mark_all_programs(void) { gc_mark_program_pos = gc_internal_program; while (gc_mark_program_pos) { struct program *p = gc_mark_program_pos; gc_mark_program_pos = p->next; if(gc_is_referenced(p)) { gc_mark_program_as_referenced(debug_malloc_pass(p)); } } } void gc_cycle_check_all_programs(void) { struct program *p; for (p = gc_internal_program; p; p = p->next) { real_gc_cycle_check_program(p, 0); gc_cycle_run_queue(); } } void gc_zap_ext_weak_refs_in_programs(void) { gc_mark_program_pos = first_program; while (gc_mark_program_pos != gc_internal_program && gc_ext_weak_refs) { struct program *p = gc_mark_program_pos; gc_mark_program_pos = p->next; gc_mark_program_as_referenced(p); } discard_queue(&gc_mark_queue); } void gc_free_all_unreferenced_programs(void) { struct program *p,*next; for(p=gc_internal_program;p;p=next) { debug_malloc_touch(p); if(gc_do_free(p)) { /* Got an extra ref from gc_cycle_pop_object(). */ int e; for(e=0;e<p->num_constants;e++) { free_svalue(& p->constants[e].sval); p->constants[e].sval.type=T_INT; DO_IF_DMALLOC(p->constants[e].sval.u.refs=(void *)-1); } for(e=0;e<p->num_inherits;e++) { if(p->inherits[e].parent) { free_object(p->inherits[e].parent); p->inherits[e].parent=0; } } /* FIXME: Is there anything else that needs to be freed here? */ gc_free_extra_ref(p); SET_NEXT_AND_FREE(p, free_program); }else{ next=p->next; } } #ifdef PIKE_DEBUG if (gc_debug) for (p = first_program; p != gc_internal_program; p = p->next) { int e,tmp=0; if (!p) fatal("gc_internal_program was bogus.\n"); for(e=0;e<p->num_constants;e++) { if(p->constants[e].sval.type == T_PROGRAM && p->constants[e].sval.u.program == p) tmp++; } if(tmp >= p->refs) gc_fatal(p, 1 ,"garbage collector failed to free program!!!\n"); } #endif } #endif /* GC2 */ void count_memory_in_programs(INT32 *num_, INT32 *size_) { INT32 size=0, num=0; struct program *p; for(p=first_program;p;p=p->next) { num++; size+=p->total_size; } *num_=num; *size_=size; } void push_compiler_frame(int lexical_scope) { struct compiler_frame *f; f=ALLOC_STRUCT(compiler_frame); f->previous=Pike_compiler->compiler_frame; f->lexical_scope=lexical_scope; f->current_type=0; f->current_return_type=0; f->current_number_of_locals=0; f->max_number_of_locals=0; f->current_function_number=-2; /* no function */ f->recur_label=-1; f->is_inline=0; f->num_args=-1; Pike_compiler->compiler_frame=f; } void pop_local_variables(int level) { while(Pike_compiler->compiler_frame->current_number_of_locals > level) { int e; e=--(Pike_compiler->compiler_frame->current_number_of_locals); free_string(Pike_compiler->compiler_frame->variable[e].name); free_string(Pike_compiler->compiler_frame->variable[e].type); if(Pike_compiler->compiler_frame->variable[e].def) free_node(Pike_compiler->compiler_frame->variable[e].def); } } void pop_compiler_frame(void) { struct compiler_frame *f; int e; f=Pike_compiler->compiler_frame; #ifdef PIKE_DEBUG if(!f) fatal("Popping out of compiler frames\n"); #endif pop_local_variables(0); if(f->current_type) free_string(f->current_type); if(f->current_return_type) free_string(f->current_return_type); Pike_compiler->compiler_frame=f->previous; dmfree((char *)f); } #define GET_STORAGE_CACHE_SIZE 1024 static struct get_storage_cache { INT32 oid, pid, offset; } get_storage_cache[GET_STORAGE_CACHE_SIZE]; ptrdiff_t low_get_storage(struct program *o, struct program *p) { INT32 oid, pid; ptrdiff_t offset; unsigned INT32 hval; if(!o) return 0; oid=o->id; pid=p->id; hval=oid*9248339 + pid; hval%=GET_STORAGE_CACHE_SIZE; #ifdef PIKE_DEBUG if(hval>GET_STORAGE_CACHE_SIZE) fatal("hval>GET_STORAGE_CACHE_SIZE"); #endif if(get_storage_cache[hval].oid == oid && get_storage_cache[hval].pid == pid) { offset=get_storage_cache[hval].offset; }else{ INT32 e; offset=-1; for(e=0;e<o->num_inherits;e++) { if(o->inherits[e].prog==p) { offset=o->inherits[e].storage_offset; break; } } get_storage_cache[hval].oid=oid; get_storage_cache[hval].pid=pid; get_storage_cache[hval].offset=offset; } return offset; } PMOD_EXPORT char *get_storage(struct object *o, struct program *p) { int offset; #ifdef _REENTRANT if(d_flag) CHECK_INTERPRETER_LOCK(); #endif offset= low_get_storage(o->prog, p); if(offset == -1) return 0; return o->storage + offset; } struct program *low_program_from_function(struct program *p, INT32 i) { struct svalue *f; struct identifier *id=ID_FROM_INT(p, i); if(!IDENTIFIER_IS_CONSTANT(id->identifier_flags)) return 0; if(id->func.offset==-1) return 0; f=& PROG_FROM_INT(p,i)->constants[id->func.offset].sval; if(f->type!=T_PROGRAM) return 0; return f->u.program; } PMOD_EXPORT struct program *program_from_function(struct svalue *f) { struct identifier *id; if(f->type != T_FUNCTION) return 0; if(f->subtype == FUNCTION_BUILTIN) return 0; if(!f->u.object->prog) return 0; return low_program_from_function(f->u.object->prog, f->subtype); } PMOD_EXPORT struct program *program_from_svalue(struct svalue *s) { switch(s->type) { case T_OBJECT: { struct program *p = s->u.object->prog; int call_fun; if (!p) return 0; if ((call_fun = FIND_LFUN(p, LFUN_CALL)) >= 0) { /* Get the program from the return type. */ struct identifier *id = ID_FROM_INT(p, call_fun); /* FIXME: do it. */ /* fprintf(stderr, "Object type has `()().\n"); */ return 0; } push_svalue(s); f_object_program(1); p=program_from_svalue(Pike_sp-1); pop_stack(); return p; /* We trust that there is a reference somewhere... */ } case T_FUNCTION: return program_from_function(s); case T_PROGRAM: return s->u.program; default: return 0; } } #define FIND_CHILD_HASHSIZE 5003 struct find_child_cache_s { INT32 pid,cid,id; }; static struct find_child_cache_s find_child_cache[FIND_CHILD_HASHSIZE]; int find_child(struct program *parent, struct program *child) { unsigned INT32 h=(parent->id * 9248339 + child->id); h= h % FIND_CHILD_HASHSIZE; #ifdef PIKE_DEBUG if(h>=FIND_CHILD_HASHSIZE) fatal("find_child failed to hash within boundaries.\n"); #endif if(find_child_cache[h].pid == parent->id && find_child_cache[h].cid == child->id) { return find_child_cache[h].id; }else{ INT32 i; for(i=0;i<parent->num_identifier_references;i++) { if(low_program_from_function(parent, i)==child) { find_child_cache[h].pid=parent->id; find_child_cache[h].cid=child->id; find_child_cache[h].id=i; return i; } } } return -1; } void yywarning(char *fmt, ...) ATTRIBUTE((format(printf,1,2))) { char buf[4711]; va_list args; /* If we have parse errors we might get erroneous warnings, * so don't print them. * This has the additional benefit of making it easier to * visually locate the actual error message. */ if (Pike_compiler->num_parse_error) return; va_start(args,fmt); VSPRINTF(buf, fmt, args); va_end(args); if(strlen(buf)>sizeof(buf)) fatal("Buffer overflow in yywarning!\n"); if ((error_handler && error_handler->prog) || get_master()) { ref_push_string(lex.current_file); push_int(lex.current_line); push_text(buf); if (error_handler && error_handler->prog) { safe_apply(error_handler, "compile_warning", 3); } else { SAFE_APPLY_MASTER("compile_warning",3); } pop_stack(); } } /* returns 1 if a implements b */ static int low_implements(struct program *a, struct program *b) { int e; struct pike_string *s=findstring("__INIT"); for(e=0;e<b->num_identifier_references;e++) { struct identifier *bid; int i; if (b->identifier_references[e].id_flags & (ID_STATIC|ID_HIDDEN)) continue; /* Skip static & hidden */ bid = ID_FROM_INT(b,e); if(s == bid->name) continue; /* Skip __INIT */ i = find_shared_string_identifier(bid->name,a); if (i == -1) { if (b->identifier_references[e].id_flags & (ID_OPTIONAL)) continue; /* It's ok... */ #if 0 fprintf(stderr, "Missing identifier \"%s\"\n", bid->name->str); #endif /* 0 */ return 0; } if(!match_types(ID_FROM_INT(a,i)->type, bid->type)) { #if 0 fprintf(stderr, "Identifier \"%s\" is incompatible.\n", bid->name->str); #endif /* 0 */ return 0; } } return 1; } #define IMPLEMENTS_CACHE_SIZE 4711 struct implements_cache_s { INT32 aid, bid, ret; }; static struct implements_cache_s implements_cache[IMPLEMENTS_CACHE_SIZE]; /* returns 1 if a implements b, but faster */ PMOD_EXPORT int implements(struct program *a, struct program *b) { unsigned long hval; if(!a || !b) return -1; if(a==b) return 1; hval = a->id*9248339 + b->id; hval %= IMPLEMENTS_CACHE_SIZE; #ifdef PIKE_DEBUG if(hval >= IMPLEMENTS_CACHE_SIZE) fatal("Implements_cache failed!\n"); #endif if(implements_cache[hval].aid==a->id && implements_cache[hval].bid==b->id) { return implements_cache[hval].ret; } /* Do it the tedious way */ implements_cache[hval].aid=a->id; implements_cache[hval].bid=b->id; implements_cache[hval].ret=low_implements(a,b); return implements_cache[hval].ret; } /* Returns 1 if a is compatible with b */ static int low_is_compatible(struct program *a, struct program *b) { int e; struct pike_string *s=findstring("__INIT"); /* Optimize the loop somewhat */ if (a->num_identifier_references < b->num_identifier_references) { struct program *tmp = a; a = b; b = tmp; } for(e=0;e<b->num_identifier_references;e++) { struct identifier *bid; int i; if (b->identifier_references[e].id_flags & (ID_STATIC|ID_HIDDEN)) continue; /* Skip static & hidden */ /* FIXME: What if they aren't static & hidden in a? */ bid = ID_FROM_INT(b,e); if(s == bid->name) continue; /* Skip __INIT */ i = find_shared_string_identifier(bid->name,a); if (i == -1) { continue; /* It's ok... */ } if(!match_types(ID_FROM_INT(a,i)->type, bid->type)) { #if 0 fprintf(stderr, "Identifier \"%s\" is incompatible.\n", bid->name->str); #endif /* 0 */ return 0; } } return 1; } static struct implements_cache_s is_compatible_cache[IMPLEMENTS_CACHE_SIZE]; /* Returns 1 if a is compatible with b * ie it's possible to write a hypothetical c that implements both. */ PMOD_EXPORT int is_compatible(struct program *a, struct program *b) { unsigned long hval; unsigned long rhval; int aid, bid; if(!a || !b) return -1; if(a==b) return 1; /* Order the id's so we don't need double entries in the cache. */ aid = a->id; bid = b->id; if (aid > bid) { int tmp = aid; aid = bid; bid = tmp; } hval = aid*9248339 + bid; hval %= IMPLEMENTS_CACHE_SIZE; #ifdef PIKE_DEBUG if(hval >= IMPLEMENTS_CACHE_SIZE) fatal("Implements_cache failed!\n"); #endif if(is_compatible_cache[hval].aid==aid && is_compatible_cache[hval].bid==bid) { return is_compatible_cache[hval].ret; } if(implements_cache[hval].aid==aid && implements_cache[hval].bid==bid && implements_cache[hval].ret) { /* a implements b */ return 1; } rhval = bid*9248339 + aid; rhval %= IMPLEMENTS_CACHE_SIZE; #ifdef PIKE_DEBUG if(rhval >= IMPLEMENTS_CACHE_SIZE) fatal("Implements_cache failed!\n"); #endif if(implements_cache[rhval].aid==bid && implements_cache[rhval].bid==aid && implements_cache[rhval].ret) { /* b implements a */ return 1; } /* Do it the tedious way */ is_compatible_cache[hval].aid=aid; is_compatible_cache[hval].bid=bid; is_compatible_cache[hval].ret=low_is_compatible(a,b); return is_compatible_cache[hval].ret; } /* returns 1 if a implements b */ int yyexplain_not_implements(struct program *a, struct program *b, int flags) { int e; struct pike_string *s=findstring("__INIT"); for(e=0;e<b->num_identifier_references;e++) { struct identifier *bid; int i; if (b->identifier_references[e].id_flags & (ID_STATIC|ID_HIDDEN)) continue; /* Skip static & hidden */ bid = ID_FROM_INT(b,e); if(s == bid->name) continue; /* Skip __INIT */ i = find_shared_string_identifier(bid->name,a); if (i == -1) { if (b->identifier_references[e].id_flags & (ID_OPTIONAL)) continue; /* It's ok... */ if(flags & YYTE_IS_WARNING) yywarning("Missing identifier \"%s\".", bid->name->str); else my_yyerror("Missing identifier \"%s\".", bid->name->str); return 0; } if(!match_types(ID_FROM_INT(a,i)->type, bid->type)) { struct pike_string *s1,*s2; my_yyerror("Type of identifier dentifier \"%s\" does not match.", bid->name->str); s1=describe_type(ID_FROM_INT(a,i)->type); s2=describe_type(bid->type); if(flags & YYTE_IS_WARNING) { yywarning("Expected: %s",s1->str); yywarning("Got : %s",s2->str); }else{ my_yyerror("Expected: %s",s1->str); my_yyerror("Got : %s",s2->str); } free_string(s1); free_string(s2); return 0; } } return 1; } PMOD_EXPORT void *parent_storage(int depth) { struct inherit *inherit; struct program *p; struct object *o; INT32 i; inherit=&Pike_fp->context; o=Pike_fp->current_object; if(!o) error("Current object is destructed\n"); while(1) { if(inherit->parent_offset) { i=o->parent_identifier; o=o->parent; depth+=inherit->parent_offset-1; }else{ i=inherit->parent_identifier; o=inherit->parent; } if(!o) return 0; if(!(p=o->prog)) return 0; #ifdef DEBUG_MALLOC if (o->refs == 0x55555555) { fprintf(stderr, "The object %p has been zapped!\n", o); describe(p); fatal("Object zapping detected.\n"); } if (p->refs == 0x55555555) { fprintf(stderr, "The program %p has been zapped!\n", p); describe(p); fprintf(stderr, "Which taken from the object %p\n", o); describe(o); fatal("Looks like the program %p has been zapped!\n", p); } #endif /* DEBUG_MALLOC */ #ifdef PIKE_DEBUG if(i < 0 || i > p->num_identifier_references) fatal("Identifier out of range!\n"); #endif inherit=INHERIT_FROM_INT(p, i); #ifdef DEBUG_MALLOC if (inherit->storage_offset == 0x55555555) { fprintf(stderr, "The inherit %p has been zapped!\n", inherit); debug_malloc_dump_references(inherit,0,2,0); fprintf(stderr, "It was extracted from the program %p %d\n", p, i); describe(p); fprintf(stderr, "Which was in turn taken from the object %p\n", o); describe(o); fatal("Looks like the program %p has been zapped!\n", p); } #endif /* DEBUG_MALLOC */ if(!depth) break; --depth; } return o->storage + inherit->storage_offset; }

pike.git/ src/ program.c > 790114bb1511aa73d24cba0979e57ddd516f9537 [Annotate]