pike.git/src/program.c:766bc8e5ea1aba0688315a1bf996c95f644326c7

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917 5918 5919 5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981 5982 5983 5984 5985 5986 5987 5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054 6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165 6166 6167 6168 6169 6170 6171 6172 6173 6174 6175 6176 6177 6178 6179 6180 6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202 6203 6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 6245 6246 6247 6248 6249 6250 6251 6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 6262 6263 6264 6265 6266 6267 6268 6269 6270 6271 6272 6273 6274 6275 6276 6277 6278 6279 6280 6281 6282 6283 6284 6285 6286 6287 6288 6289 6290 6291 6292 6293 6294 6295 6296 6297 6298 6299 6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 6328 6329 6330 6331 6332 6333 6334 6335 6336 6337 6338 6339 6340 6341 6342 6343 6344 6345 6346 6347 6348 6349 6350 6351 6352 6353 6354 6355 6356 6357 6358 6359 6360 6361 6362 6363 6364 6365 6366 6367 6368 6369 6370 6371 6372 6373 6374 6375 6376 6377 6378 6379 6380 6381 6382 6383 6384 6385 6386 6387 6388 6389 6390 6391 6392 6393 6394 6395 6396 6397 6398 6399 6400 6401 6402 6403 6404 6405 6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437 6438 6439 6440 6441 6442 6443 6444 6445 6446 6447 6448 6449 6450 6451 6452 6453 6454 6455 6456 6457 6458 6459 6460 6461 6462 6463 6464 6465 6466 6467 6468 6469 6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492 6493 6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505 6506 6507 6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535 6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564 6565 6566 6567 6568 6569 6570 6571 6572 6573 6574 6575 6576 6577 6578 6579 6580 6581 6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616 6617 6618 6619 6620 6621 6622 6623 6624 6625 6626 6627 6628 6629 6630 6631 6632 6633 6634 6635 6636 6637 6638 6639 6640 6641 6642 6643 6644 6645 6646 6647 6648 6649 6650 6651 6652 6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674 6675 6676 6677 6678 6679 6680 6681 6682 6683 6684 6685 6686 6687 6688 6689 6690 6691 6692 6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714 6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728 6729 6730 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 6751 6752 6753 6754 6755 6756 6757 6758 6759 6760 6761 6762 6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776 6777 6778 6779 6780 6781 6782 6783 6784 6785 6786 6787 6788 6789 6790 6791 6792 6793 6794 6795 6796 6797 6798 6799 6800 6801 6802 6803 6804 6805 6806 6807 6808 6809 6810 6811 6812 6813 6814 6815 6816 6817 6818 6819 6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 6850 6851 6852 6853 6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 6867 6868 6869 6870 6871 6872 6873 6874 6875 6876 6877 6878 6879 6880 6881 6882 6883 6884 6885 6886 6887 6888 6889 6890 6891 6892 6893 6894 6895 6896 6897 6898 6899 6900 6901 6902 6903 6904 6905 6906 6907 6908 6909 6910 6911 6912 6913 6914 6915 6916 6917 6918 6919 6920 6921 6922 6923 6924 6925 6926 6927 6928 6929 6930 6931 6932 6933 6934 6935 6936 6937 6938 6939 6940 6941 6942 6943 6944 6945 6946 6947 6948 6949 6950 6951 6952 6953 6954 6955 6956 6957 6958 6959 6960 6961 6962 6963 6964 6965 6966 6967 6968 6969 6970 6971 6972 6973 6974 6975 6976 6977 6978 6979 6980 6981 6982 6983 6984 6985 6986 6987 6988 6989 6990 6991 6992 6993 6994 6995 6996 6997 6998 6999 7000 7001 7002 7003 7004 7005 7006 7007 7008 7009 7010 7011 7012 7013 7014 7015 7016 7017 7018 7019 7020 7021 7022 7023 7024 7025 7026 7027 7028 7029 7030 7031 7032 7033 7034 7035 7036 7037 7038 7039 7040 7041 7042 7043 7044 7045 7046 7047 7048 7049 7050 7051 7052 7053 7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065 7066 7067 7068 7069 7070 7071 7072 7073 7074 7075 7076 7077 7078 7079 7080 7081 7082 7083 7084 7085 7086 7087 7088 7089 7090 7091 7092 7093 7094 7095 7096 7097 7098 7099 7100 7101 7102 7103 7104 7105 7106 7107 7108 7109 7110 7111 7112 7113 7114 7115 7116 7117 7118 7119 7120 7121 7122 7123 7124 7125 7126 7127 7128 7129 7130 7131 7132 7133 7134 7135 7136 7137 7138 7139 7140 7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152 7153 7154 7155 7156 7157 7158 7159 7160 7161 7162 7163 7164 7165 7166 7167 7168 7169 7170 7171 7172 7173 7174 7175 7176 7177 7178 7179 7180 7181 7182 7183 7184 7185 7186 7187 7188 7189 7190 7191 7192 7193 7194 7195 7196 7197 7198 7199 7200 7201 7202 7203 7204 7205 7206 7207 7208 7209 7210 7211 7212 7213 7214 7215 7216 7217 7218 7219 7220 7221 7222 7223 7224 7225 7226 7227 7228 7229 7230 7231 7232 7233 7234 7235 7236 7237 7238 7239 7240 7241 7242 7243 7244 7245 7246 7247 7248 7249 7250 7251 7252 7253 7254 7255 7256 7257 7258 7259 7260 7261 7262 7263 7264 7265 7266 7267 7268 7269 7270 7271 7272 7273 7274 7275 7276 7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290 7291 7292 7293 7294 7295 7296 7297 7298 7299 7300 7301 7302 7303 7304 7305 7306 7307 7308 7309 7310 7311 7312 7313 7314 7315 7316 7317 7318 7319 7320 7321 7322 7323 7324 7325 7326 7327 7328 7329 7330 7331 7332 7333 7334 7335 7336 7337 7338 7339 7340 7341 7342 7343 7344 7345 7346 7347 7348 7349 7350 7351 7352 7353 7354 7355 7356 7357 7358 7359 7360 7361 7362 7363 7364 7365 7366 7367 7368 7369 7370 7371 7372 7373 7374 7375 7376 7377 7378 7379 7380 7381 7382 7383 7384 7385 7386 7387 7388 7389 7390 7391 7392 7393 7394 7395 7396 7397 7398 7399 7400 7401 7402 7403 7404 7405 7406 7407 7408 7409 7410 7411 7412 7413 7414 7415 7416 7417 7418 7419 7420 7421 7422 7423 7424 7425 7426 7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437 7438 7439 7440 7441 7442 7443 7444 7445 7446 7447 7448 7449 7450 7451 7452 7453 7454 7455 7456 7457 7458 7459 7460 7461 7462 7463 7464 7465 7466 7467 7468 7469 7470 7471 7472 7473 7474 7475 7476 7477 7478 7479 7480 7481 7482 7483 7484 7485 7486 7487 7488 7489 7490 7491 7492 7493 7494 7495 7496 7497 7498 7499 7500 7501 7502 7503 7504 7505 7506 7507 7508 7509 7510 7511 7512 7513 7514 7515 7516 7517 7518 7519 7520 7521 7522 7523 7524 7525 7526 7527 7528 7529 7530 7531 7532 7533 7534 7535 7536 7537 7538 7539 7540 7541 7542 7543 7544 7545 7546 7547 7548 7549 7550 7551 7552 7553 7554 7555 7556 7557 7558 7559 7560 7561 7562 7563 7564 7565 7566 7567 7568 7569 7570 7571 7572 7573 7574 7575 7576 7577 7578 7579 7580 7581 7582 7583 7584 7585 7586 7587 7588 7589 7590 7591 7592 7593 7594 7595 7596 7597 7598 7599 7600 7601 7602 7603 7604 7605 7606 7607 7608 7609 7610 7611 7612 7613 7614 7615 7616 7617 7618 7619 7620 7621 7622 7623 7624 7625 7626 7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638 7639 7640 7641 7642 7643 7644 7645 7646 7647 7648 7649 7650 7651 7652 7653 7654 7655 7656 7657 7658 7659 7660 7661 7662 7663 7664 7665 7666 7667 7668 7669 7670 7671 7672 7673 7674 7675 7676 7677 7678 7679 7680 7681 7682 7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699 7700 7701 7702 7703 7704 7705 7706 7707 7708 7709 7710 7711 7712 7713 7714 7715 7716 7717 7718 7719 7720 7721 7722 7723 7724 7725 7726 7727 7728 7729 7730 7731 7732 7733 7734 7735 7736 7737 7738 7739 7740 7741 7742 7743 7744 7745 7746 7747 7748 7749 7750 7751 7752 7753 7754 7755 7756 7757 7758 7759 7760 7761 7762 7763 7764 7765 7766 7767 7768 7769 7770 7771 7772 7773 7774 7775 7776 7777 7778 7779 7780 7781 7782 7783 7784 7785 7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804 7805 7806 7807 7808 7809 7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830 7831 7832 7833 7834 7835 7836 7837 7838 7839 7840 7841 7842 7843 7844 7845 7846 7847 7848 7849 7850 7851 7852 7853 7854 7855 7856 7857 7858 7859 7860 7861 7862 7863 7864 7865 7866 7867 7868 7869 7870 7871 7872 7873 7874 7875 7876 7877 7878 7879 7880 7881 7882 7883 7884 7885 7886 7887 7888 7889 7890 7891 7892 7893 7894 7895 7896 7897 7898 7899 7900 7901 7902 7903 7904 7905 7906 7907 7908 7909 7910 7911 7912 7913 7914 7915 7916 7917 7918 7919 7920 7921 7922 7923 7924 7925 7926 7927 7928 7929 7930 7931 7932 7933 7934 7935 7936 7937 7938 7939 7940 7941 7942 7943 7944 7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958 7959 7960 7961 7962 7963 7964 7965 7966 7967 7968 7969 7970 7971 7972 7973 7974 7975 7976 7977 7978 7979 7980 7981 7982 7983 7984 7985 7986 /* || This file is part of Pike. For copyright information see COPYRIGHT. || Pike is distributed under GPL, LGPL and MPL. See the file COPYING || for more information. || $Id: program.c,v 1.570 2004/10/16 07:27:29 agehall Exp $ */ #include "global.h" #include "program.h" #include "object.h" #include "dynamic_buffer.h" #include "pike_types.h" #include "stralloc.h" #include "las.h" #include "lex.h" #include "pike_macros.h" #include "fsort.h" #include "pike_error.h" #include "docode.h" #include "interpret.h" #include "hashtable.h" #include "main.h" #include "pike_memory.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 "pike_security.h" #include "pike_types.h" #include "opcodes.h" #include "version.h" #include "block_alloc.h" #include "pikecode.h" #include <errno.h> #include <fcntl.h> #define sp Pike_sp #undef ATTRIBUTE #define ATTRIBUTE(X) static void exit_program_struct(struct program *); static size_t add_xstorage(size_t size, size_t alignment, ptrdiff_t modulo_orig); #undef EXIT_BLOCK #define EXIT_BLOCK(P) exit_program_struct( (P) ) #undef COUNT_OTHER #define COUNT_OTHER() do{ \ struct program *p; \ for(p=first_program;p;p=p->next) \ { \ size+=p->total_size; \ } \ }while(0) BLOCK_ALLOC_FILL_PAGES(program, 4) /* #define COMPILER_DEBUG */ /* #define PROGRAM_BUILD_DEBUG */ #ifdef COMPILER_DEBUG #define CDFPRINTF(X) fprintf X #else /* !COMPILER_DEBUG */ #define CDFPRINTF(X) #endif /* COMPILER_DEBUG */ /* * These two values should probably be fine-tuned, but doing so * more or less requires running a predictable 'typical' application * and testing different hashsizes and tresholds. I tried to do it * mathematically by measuring the extremes (no cache hits, 100% * cache hits etc.) but it seems that the processor cache becomes * exhausted in some of my measurements, which renders my mathematical * model useless. * * Further measurements seems to indicate that this cache can slow * things down a bit if the hit/miss rate is not fairly high. * For normal applications, the hitrate is most likely well over 90%, * but that should be verified. * - Holistiska Centralbyrån (Hubbe) */ /* Define the size of the cache that is used for method lookup. */ /* A value of zero disables this cache */ #define FIND_FUNCTION_HASHSIZE 15013 /* Programs with less methods will not use the cache for method lookups.. */ #define FIND_FUNCTION_HASH_TRESHOLD 9 #define DECLARE #include "compilation.h" struct pike_string *this_program_string, *this_string; static struct pike_string *UNDEFINED_string; const char *const lfun_names[] = { "__INIT", "create", "destroy", "`+", "`-", "`&", "`|", "`^", "`<<", "`>>", "`*", "`/", "`%", "`~", "`==", "`<", "`>", "__hash", "cast", "`!", "`[]", "`[]=", "`->", "`->=", "_sizeof", "_indices", "_values", "`()", "``+", "``-", "``&", "``|", "``^", "``<<", "``>>", "``*", "``/", "``%", "`+=", "_is_type", "_sprintf", "_equal", "_m_delete", "_get_iterator", /* NOTE: After this point there are only fake lfuns. */ "_search", }; struct pike_string *lfun_strings[NELEM(lfun_names)]; static struct mapping *lfun_ids; /* 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(tZero,tZero,tMix), /* "`+", */ tFunc(tOr(tVoid,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(tZero,tZero,tMix), /* "``+", */ tFuncV(tZero,tVoid,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,tZero,tMix), /* "`+=", */ tFuncV(tStr,tVoid,tInt), /* "_is_type", */ tFuncV(tInt tOr(tMap(tStr,tInt),tVoid),tVoid,tStr), /* "_sprintf", */ tFuncV(tMix,tVoid,tInt), /* "_equal", */ tFuncV(tZero,tVoid,tMix), /* "_m_delete", */ tFuncV(tNone,tVoid,tObj), /* "_get_iterator", */ /* NOTE: After this point there are only fake lfuns. */ tFuncV(tZero tOr(tZero, tVoid), tVoid, tMix), /* "_search", */ }; /*! @namespace lfun:: *! *! Callback functions used to overload various builtin functions. *! *! The functions can be grouped into a few sets: *! *! @ul *! @item *! Object initialization and destruction. *! *! @[__INIT()], @[create()], @[destroy()] *! *! @item *! Unary operator overloading. *! *! @[`~()], @[`!()], *! @[_values()], @[cast()], *! @[_sizeof()], @[_indices()], *! @[__hash()] *! *! @item *! Binary asymmetric operator overloading. *! *! @[`+()], @[``+()], *! @[`-()], @[``-()], *! @[`&()], @[``&()], *! @[`|()], @[``|()], *! @[`^()], @[``^()], *! @[`<<()], @[``<<()], *! @[`>>()], @[``>>()], *! @[`*()], @[``*()], *! @[`/()], @[``/()], *! @[`%()], @[``%()] *! *! @item *! Binary symmetric operator overloading. *! *! The optimizer will make assumptions about the relations *! between these functions. *! *! @[`==()], @[_equal()], @[`<()], @[`>()] *! *! @item *! Other binary operator overloading. *! *! @[`[]()], @[`[]=()], @[`->()], *! @[`->=()], @[`+=()], @[`()()] *! *! @item *! Overloading of other builtin functions. *! *! @[_is_type()], @[_sprintf()], @[_m_delete()], *! @[_get_iterator()], @[_search()] *! @endul *! *! @note *! Although these functions are called from outside the object *! they exist in, they will still be used even if they are *! declared @expr{static@}. It is in fact recommended to declare *! them @expr{static@}, since that will hinder them being used *! for other purposes. *! *! @seealso *! @[::] */ /*! @decl void lfun::__INIT() *! *! Inherit and variable initialization. *! *! This function is generated automatically by the compiler. It's *! called just before @[lfun::create()] when an object is *! instantiated. *! *! It first calls any @expr{__INIT@} functions in inherited classes *! (regardless of modifiers on the inherits). It then executes all *! the variable initialization expressions in this class, in the *! order they occur. *! *! @note *! This function can not be overloaded or blocked from executing. *! *! @seealso *! @[lfun::create()] */ /*! @decl void lfun::create(zero ... args) *! *! Object creation callback. *! *! This function is called right after @[lfun::__INIT()]. *! *! @[args] are the arguments passed when the program was called. *! *! @note *! In Pike 7.2 and later this function can be created implicitly *! by the compiler using the new syntax: *! @code *! class Foo(int foo) { *! int bar; *! } *! @endcode *! In the above case an implicit @[lfun::create()] is created, and *! it's equvivalent to: *! @code *! class Foo { *! int foo; *! int bar; *! static void create(int foo) *! { *! local::foo = foo; *! } *! } *! @endcode *! *! @seealso *! @[lfun::__INIT()], @[lfun::destroy()] */ /*! @decl void lfun::destroy() *! *! Object destruction callback. *! *! This function is called by @[predef::destruct()] right before it *! zeroes all the object variables and destroys the object. *! *! @note *! Note that it's also called on implicit destruct, i.e. when there *! are no more references to the object, or when the garbage *! collector decides to destruct it. *! *! @note *! Regarding destruction order during garbage collection: *! *! If an object is destructed by the garbage collector, it's part of *! a reference cycle with other things but with no external *! references. If there are other objects with @expr{destroy@} *! functions in the same cycle, it becomes a problem which to call *! first. *! *! E.g. if this object has a variable with another object which *! (directly or indirectly) points back to this one, you might find *! that the other object already has been destructed and the variable *! thus contains zero. *! *! The garbage collector tries to minimize such problems by defining *! an order as far as possible: *! *! @ul *! @item *! If an object A contains an @[lfun::destroy] and an object B does *! not, then A is destructed before B. *! @item *! If A references B single way, then A is destructed before B. *! @item *! If A and B are in a cycle, and there is a reference somewhere *! from B to A that is weaker than any reference from A to B, then *! A is destructed before B. *! @item *! Weak references (e.g. set with @[predef::set_weak_flag()]) are considered *! weaker than normal references, and both are considered weaker *! than strong references. *! @item *! Strong references are those from objects to the objects of their *! lexically surrounding classes. There can never be a cycle *! consisting only of strong references. (This means the gc never *! destructs a parent object before all children have been *! destructed.) *! @endul *! *! An example with well defined destruct order due to strong *! references: *! *! @code *! class Super { *! class Sub { *! static void destroy() { *! if (!Super::this) *! error ("My parent has been destructed!\n"); *! } *! } *! Sub sub = Sub(); *! static void destroy() { *! if (!sub) *! werror ("sub already destructed.\n"); *! } *! } *! @endcode *! *! The garbage collector ensures that these objects are destructed in *! an order so that @expr{werror@} in @expr{Super@} is called and not *! @expr{error@} in @expr{Sub@}. *! *! @note *! When the garbage collector calls @[lfun::destroy], all accessible *! non-objects and objects without @expr{destroy@} functions are *! still intact. They are not freed if the @expr{destroy@} function *! adds external references to them. However, all objects with *! @[lfun::destroy] in the cycle are already scheduled for *! destruction and are thus be destroyed even if external references *! are added to them. *! *! @note *! The garbage collector had completely random destruct order in *! versions prior to 7.2. *! *! @seealso *! @[lfun::create()], @[predef::destruct()] */ /*! @decl mixed lfun::`+(zero arg, zero ... rest) *! *! Left side addition/concatenation callback. *! *! This is used by @[predef::`+]. It's called with any arguments *! that follow this object in the argument list of the call to *! @[predef::`+]. The returned value should be a new instance that *! represents the addition/concatenation between this object and *! the arguments in the order they are given. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``+()], @[lfun::`+=()], @[predef::`+()] */ /*! @decl this_program lfun::`+=(zero arg, zero ... rest) *! *! Destructive addition/concatenation callback. *! *! This is used by @[predef::`+]. It's called with any arguments *! that follow this object in the argument list of the call to *! @[predef::`+]. It should update this object to represent the *! addition/concatenation between it and the arguments in the order *! they are given. It should always return this object. *! *! @note *! This function should only be implemented if @[lfun::`+()] also *! is. It should only work as a more optimized alternative to that *! one, for the case when it's safe to change the object *! destructively and use it directly as the result. *! *! @note *! This function is not an lfun for the @expr{+=@} operator. It's *! only whether or not it's safe to do a destructive change that *! decides if this function or @[lfun::`+()] is called; both the *! @expr{+@} operator and the @expr{+=@} operator can call either *! one. *! *! @seealso *! @[lfun::`+()], @[predef::`+()] */ /*! @decl mixed lfun::``+(zero arg, zero ... rest) *! *! Right side addition/concatenation callback. *! *! This is used by @[predef::`+]. It's called with any arguments *! that precedes this object in the argument list of the call to *! @[predef::`+]. The returned value should be a new instance that *! represents the addition/concatenation between the arguments in *! the order they are given and this object. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`+()], @[predef::`+()] */ /*! @decl mixed lfun::`-(void|zero arg) *! *! Negation and left side subtraction/set difference callback. *! *! This is used by @[predef::`-]. When called without an argument *! the result should be a new instance that represents the negation *! of this object, otherwise the result should be a new instance *! that represents the difference between this object and @[arg]. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``-()], @[predef::`-()] */ /*! @decl mixed lfun::``-(zero arg) *! *! Right side subtraction/set difference callback. *! *! This is used by @[predef::`-]. The result should be a new *! instance that represents the difference between @[arg] and this *! object. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`-()], @[predef::`-()] */ /*! @decl mixed lfun::`&(zero ... args) *! *! Left side bitwise and/intersection callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``&()], @[predef::`&()] */ /*! @decl mixed lfun::``&(zero ... args) *! *! Right side bitwise and/intersection callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`&()], @[predef::`&()] */ /*! @decl mixed lfun::`|(zero ... args) *! *! Left side bitwise or/union callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``|()], @[predef::`|()] */ /*! @decl mixed lfun::``|(zero ... args) *! *! Right side bitwise or/union callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`|()], @[predef::`|()] */ /*! @decl mixed lfun::`^(zero ... args) *! *! Left side exclusive or callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``^()], @[predef::`^()] */ /*! @decl mixed lfun::``^(zero ... args) *! *! Right side exclusive or callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`^()], @[predef::`^()] */ /*! @decl mixed lfun::`<<(zero arg) *! *! Left side left shift callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``<<()], @[predef::`<<()] */ /*! @decl mixed lfun::``<<(zero arg) *! *! Right side left shift callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`<<()], @[predef::`<<()] */ /*! @decl mixed lfun::`>>(zero arg) *! *! Left side right shift callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``>>()], @[predef::`>>()] */ /*! @decl mixed lfun::``>>(zero arg) *! *! Right side right shift callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`>>()], @[predef::`>>()] */ /*! @decl mixed lfun::`*(zero ... args) *! *! Left side multiplication/repetition/implosion callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``*()], @[predef::`*()] */ /*! @decl mixed lfun::``*(zero ... args) *! *! Right side multiplication/repetition/implosion callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`*()], @[predef::`*()] */ /*! @decl mixed lfun::`/(zero ... args) *! *! Left side division/split callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``/()], @[predef::`/()] */ /*! @decl mixed lfun::``/(zero ... args) *! *! Right side division/split callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`/()], @[predef::`/()] */ /*! @decl mixed lfun::`%(zero ... args) *! *! Left side modulo callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::``%()], @[predef::`%()] */ /*! @decl mixed lfun::``%(zero ... args) *! *! Right side modulo callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`%()], @[predef::`%()] */ /*! @decl int lfun::`!() *! *! Logical not callback. *! *! @returns *! Returns non-zero if the object should be evaluated as false, *! and @expr{0@} (zero) otherwise. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::`!()] */ /*! @decl mixed lfun::`~() *! *! Complement/inversion callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::`~()] */ /*! @decl int(0..1) lfun::`==(mixed arg) *! *! Equality test callback. *! *! @note *! If this is implemented it might be necessary to implement *! @[lfun::__hash] too. Otherwise mappings might hold several *! objects as indices which are duplicates according to this *! function. Various other functions that use hashing also might *! not work correctly, e.g. @[predef::Array.uniq]. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::`==()], @[lfun::__hash] */ /*! @decl int(0..1) lfun::`<(mixed arg) *! *! Less than test callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::`<()] */ /*! @decl int(0..1) lfun::`>(mixed arg) *! *! Greater than test callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::`>()] */ /*! @decl int lfun::__hash() *! *! Hashing callback. *! *! This function gets called by various mapping operations when the *! object is used as index in a mapping. It should return an *! integer that corresponds to the object in such a way that all *! values which @[lfun::`==] considers equal to the object gets the *! same hash value. *! *! @note *! The function @[predef::hash] does not return hash values that *! are compatible with this one. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[lfun::`==] */ /*! @decl mixed lfun::cast(string requested_type) *! *! Value cast callback. *! *! @param requested_type *! Type to cast to. *! *! @returns *! Expected to return the object value-casted (converted) to *! the type described by @[requested_type]. *! *! @note *! The argument is currently a string with the name *! of the type, but might in the future be a value of the type type. *! *! @note *! Currently casting between object types is a noop. *! *! @note *! If the returned value is not deemed to be of the requested type *! a runtime error may be thrown. *! *! @note *! It's assumed that this function is side-effect free. */ /*! @decl mixed lfun::`[](zero arg1, zero|void arg2) *! *! Index/subrange callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::`[]()] */ /*! @decl mixed lfun::`[]=(zero arg1, zero arg2) *! *! Index assignment callback. *! *! @seealso *! @[predef::`[]=()], @[lfun::`->=()] */ /*! @decl mixed lfun::`->(string arg) *! *! Arrow index callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::`->()] */ /*! @decl mixed lfun::`->=(string arg1, zero arg2) *! *! Arrow index assignment callback. *! *! @seealso *! @[predef::`->=()], @[lfun::`[]=()] */ /*! @decl int lfun::_sizeof() *! *! Size query callback. *! *! Called by @[predef::sizeof()] to determine the number of elements *! in an object. If this function is not present, the number *! of public symbols in the object will be returned. *! *! @returns *! Expected to return the number of valid indices in the object. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::sizeof()] */ /*! @decl array lfun::_indices() *! *! List indices callback. *! *! @returns *! Expected to return an array with the valid indices in the object. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::indices()], @[lfun::_values()] */ /*! @decl array lfun::_values() *! *! List values callback. *! *! @returns *! Expected to return an array with the values corresponding to *! the indices returned by @[lfun::_indices()]. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::values()], @[lfun::_indices()] */ /*! @decl mixed lfun::`()(zero ... args) *! *! Apply callback. *! *! @seealso *! @[predef::`()] */ /*! @decl int(0..1) lfun::_is_type(string basic_type) *! *! Type comparison callback. *! *! Called by the cast operator to determine if an object *! simulates a basic type. *! *! @param basic_type *! One of: *! @string *! @value "array" *! @value "float" *! @value "function" *! @value "int" *! @value "mapping" *! @value "multiset" *! @value "object" *! @value "program" *! @value "string" *! @value "type" *! @value "void" *! @value "zero" *! @endstring *! *! The following five shouldn't occurr, but are here for completeness: *! @string *! @value "lvalue" *! @value "mapping_data" *! @value "object storage" *! @value "pike_frame" *! @value "unknown" *! @endstring *! *! @returns *! Expected to return @expr{1@} if the object is to be regarded as a *! simulation of the type specified by @[basic_type]. *! *! @note *! The argument is currently a string with the name *! of the type, but might in the future be a value of the type type. *! *! @note *! It's assumed that this function is side-effect free. */ /*! @decl string lfun::_sprintf(int conversion_type, @ *! mapping(string:int)|void params) *! *! Sprintf callback. *! *! This method is called by @[predef::sprintf()] to print objects. If it is *! not present, printing of the object will not be supported for any *! conversion-type except for the @tt{%O@}-conversion-type, which *! will output @expr{"object"@}. *! *! @param conversion_type *! One of: *! @int *! @value 'b' *! Signed binary integer. *! @value 'd' *! Signed decimal integer. *! @value 'u' *! Unsigned decimal integer. *! @value 'o' *! Signed octal integer. *! @value 'x' *! Lowercase signed hexadecimal integer. *! @value 'X' *! Uppercase signed hexadecimal integer. *! @value 'c' *! Character. If a fieldsize has been specified this will output *! the low-order bytes of the integer in network byte order. *! @value 'f' *! Float. *! @value 'g' *! Heuristically chosen representation of float. *! @value 'G' *! Like @tt{%g@}, but uses uppercase @tt{E@} for exponent. *! @value 'e' *! Exponential notation float. *! @value 'E' *! Like @tt{%e@}, but uses uppercase @tt{E@} for exponent. *! @value 's' *! String. *! @value 'O' *! Any value (debug style). *! @value 't' *! Type of the argument. *! @endint *! *! @param params *! Conversion parameters. The following parameters may be supplied: *! @mapping *! @member int "precision" *! Precision. *! @member int "width" *! Field width. *! @member int(1..1) "flag_left" *! Indicates that the output should be left-aligned. *! @member int "indent" *! Indentation level in @tt{%O@}-mode. *! @endmapping *! *! @returns *! Is expected to return a string describing the object formatted *! according to @[conversion_type]. *! *! @note *! @[_sprintf()] is currently not called for the following *! conversion-types: *! @int *! @value 'F' *! Binary IEEE representation of float (@tt{%4F@} gives *! single precision, @tt{%8F@} gives double precision.) *! @endint *! *! @note *! This function might be called at odd times, e.g. before *! @[lfun::create] has been called or when an error has occurred. *! The reason is typically that it gets called when a backtrace is *! being formatted to report an error. It should therefore be very *! robust and not make any assumptions about its own internal *! state, at least not when @[conversion_type] is @expr{'O'@}. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::sprintf()] */ /*! @decl int lfun::_equal(mixed arg) *! *! Recursive equality callback. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::equal()], @[lfun::`==()] */ /*! @decl mixed lfun::_m_delete(mixed arg) *! *! Delete index callback. *! *! @seealso *! @[predef::m_delete()] */ /*! @decl predef::Iterator lfun::_get_iterator() *! *! Iterator creation callback. *! *! The returned @[predef::Iterator] instance works as a cursor that *! references a specific item contained (in some arbitrary sense) *! in this one. *! *! @note *! It's assumed that this function is side-effect free. *! *! @seealso *! @[predef::Iterator], @[predef::get_iterator], @[predef::foreach()] */ /*! @decl mixed lfun::_search(mixed needle, mixed|void start) *! *! Search callback. *! *! @seealso *! @[predef::search()] */ /*! @endnamespace */ /*! @class MasterObject */ /*! @decl void unregister(program p) *! *! Unregister a program that was only partially compiled. *! *! Called by @[compile()] to clean up references to partially compiled *! programs. *! *! @param p *! Partially compiled program that should no longer be referenced. *! *! @fixme *! Shouldn't this function be in the compilation handler? */ /*! @endclass */ /*! @class CompilationHandler */ /*! @decl mapping(string:mixed)|object get_default_module() *! *! Returns the default module from which global symbols will *! be fetched. *! *! @returns *! Returns the default module, or @expr{0@} (zero). *! *! If @expr{0@} (zero) is returned the compiler use the mapping *! returned by @[all_constants()] as fallback. *! *! @seealso *! @[get_predefines()] */ /*! @decl void compile_warning(string filename, int line, string msg) *! *! Called by @[compile()] to report warnings. *! *! @param filename *! File which triggered the warning. *! *! @param line *! Line which triggered the warning. *! *! @param msg *! Warning message. *! *! @seealso *! @[compile_error()] */ /*! @endclass */ struct program *first_program = 0; static int current_program_id = PROG_DYNAMIC_ID_START; struct program *null_program=0; struct object *error_handler=0; struct object *compat_handler=0; struct program *gc_internal_program = 0; static struct program *gc_mark_program_pos = 0; int compilation_depth=-1; dynamic_buffer used_modules; static struct mapping *resolve_cache=0; #ifdef PIKE_DEBUG #define CHECK_FILE_ENTRY(PROG, POS, LEN, SHIFT) \ do { \ if (SHIFT < 0 || SHIFT > 2 || \ POS + (LEN << SHIFT) > PROG->linenumbers + PROG->num_linenumbers) \ Pike_fatal ("Invalid file entry in linenumber info.\n"); \ } while (0) #else #define CHECK_FILE_ENTRY(PROG, POS, LEN, SHIFT) do {} while (0) #endif 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)) \ Pike_fatal("Pike_compiler->new_program->num_" #NAME " is out of order\n");\ if(Pike_compiler->new_program->flags & PROGRAM_OPTIMIZED) \ Pike_fatal("Tried to reallocate fixed program.\n") #else #define CHECK_FOO(NUMTYPE,TYPE,NAME) #endif #ifndef RELOCATE_program #define RELOCATE_program(ORIG, NEW) #endif /* !RELOCATE_program */ #define RELOCATE_linenumbers(ORIG,NEW) #define RELOCATE_identifier_index(ORIG,NEW) #define RELOCATE_variable_index(ORIG,NEW) #define RELOCATE_identifier_references(ORIG,NEW) #define RELOCATE_strings(ORIG,NEW) #define RELOCATE_inherits(ORIG,NEW) #define RELOCATE_identifiers(ORIG,NEW) #define RELOCATE_constants(ORIG,NEW) #define RELOCATE_relocations(ORIG,NEW) #if SIZEOF_LONG_LONG == 8 /* we have 8 byte ints, hopefully this constant works on all these systems */ #define MAXVARS(NUMTYPE) \ (NUMTYPE)(sizeof(NUMTYPE)==1?254: \ (sizeof(NUMTYPE)==2?65534: \ (sizeof(NUMTYPE)==4?4294967294U:18446744073709551614ULL))) #else #define MAXVARS(NUMTYPE) \ (NUMTYPE)(sizeof(NUMTYPE)==1?254: (sizeof(NUMTYPE)==2?65534:4294967294U)) #endif /* Funny guys use the uppermost value for nonexistant variables and the like. Hence -2 and not -1. Y2K. */ #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) \ void PIKE_CONCAT(low_add_to_,NAME) (struct program_state *state, \ TYPE ARG) { \ NUMTYPE m = state->malloc_size_program->PIKE_CONCAT(num_,NAME); \ CHECK_FOO(NUMTYPE,TYPE,NAME); \ if(m == state->new_program->PIKE_CONCAT(num_,NAME)) { \ TYPE *tmp; \ if(m==MAXVARS(NUMTYPE)) { \ yyerror("Too many " #NAME "."); \ return; \ } \ m = MINIMUM(m*2+1,MAXVARS(NUMTYPE)); \ tmp = realloc((void *)state->new_program->NAME, \ sizeof(TYPE) * m); \ if(!tmp) Pike_fatal("Out of memory.\n"); \ PIKE_CONCAT(RELOCATE_,NAME)(state->new_program, tmp); \ state->malloc_size_program->PIKE_CONCAT(num_,NAME)=m; \ state->new_program->NAME=tmp; \ } \ state->new_program-> \ NAME[state->new_program->PIKE_CONCAT(num_,NAME)++]=(ARG); \ } \ void PIKE_CONCAT(add_to_,NAME) (ARGTYPE ARG) { \ PIKE_CONCAT(low_add_to_,NAME) ( Pike_compiler, ARG ); \ } #include "program_areas.h" #define add_to_program(ARG) do { \ debug_malloc_touch(Pike_compiler->new_program->program); \ add_to_program(ARG); \ } while(0) void ins_int(INT32 i, void (*func)(char tmp)) { int e; unsigned char *p = (unsigned char *)&i; for(e=0;e<(long)sizeof(i);e++) { func(p[e]); } } void ins_short(int i, void (*func)(char tmp)) { int e; unsigned char *p = (unsigned char *)&i; for(e=0;e<(long)sizeof(i);e++) { func(p[e]); } } #ifdef PIKE_DEBUG static void debug_add_to_identifiers (struct identifier id) { if (d_flag) { int i; for (i = 0; i < Pike_compiler->new_program->num_identifiers; i++) if (Pike_compiler->new_program->identifiers[i].name == id.name) { dump_program_tables (Pike_compiler->new_program, 0); Pike_fatal ("Adding identifier twice, old at %d.\n", i); } } add_to_identifiers (id); } #else #define debug_add_to_identifiers(ARG) add_to_identifiers(ARG) #endif void add_relocated_int_to_program(INT32 i) { add_to_relocations(Pike_compiler->new_program->num_program); ins_int(i, (void (*)(char))add_to_program); } 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) Pike_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) { if(*module_index_cache) { struct svalue *tmp=low_mapping_string_lookup(*module_index_cache,ident); if(tmp) { if(!(SAFE_IS_ZERO(tmp) && tmp->subtype==1)) return mksvaluenode(tmp); return 0; } } /* fprintf(stderr,"index_module: %s\n",ident->str); */ { JMP_BUF tmp; if(SETJMP(tmp)) { if (!ident->size_shift) { handle_compile_exception ("Couldn't index a module with '%s'.", ident->str); } else { handle_compile_exception ("Couldn't index a module."); } } else { int e = num_used_modules; struct svalue *m = modules - num_used_modules; while(--e>=0) { push_svalue(m+e); ref_push_string(ident); f_index(2); if(!IS_UNDEFINED(Pike_sp-1)) { struct node_s *ret; UNSETJMP(tmp); if (Pike_compiler->compiler_pass == 2 && ((Pike_sp[-1].type == T_OBJECT && Pike_sp[-1].u.object == placeholder_object) || (Pike_sp[-1].type == T_PROGRAM && Pike_sp[-1].u.program == placeholder_program))) { my_yyerror("Got placeholder %s (resolver problem) " "when indexing a module with %S.", get_name_of_type (Pike_sp[-1].type), ident); ret = 0; } else { 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; } /*! @decl constant UNDEFINED *! *! The undefined value; ie a zero for which @[zero_type()] returns 1. */ struct node_s *resolve_identifier(struct pike_string *ident); 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); { struct program_state *p=Pike_compiler; 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|SEE_PRIVATE); if(i!=-1) { return p == Pike_compiler ? mkidentifiernode(i) : 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) Pike_fatal("Modules out of whack!\n"); #endif } } /* Handle UNDEFINED */ if (ident == UNDEFINED_string) { struct svalue s; s.type = T_INT; s.subtype = NUMBER_UNDEFINED; s.u.integer = 0; return mkconstantsvaluenode(&s); } return resolve_identifier(ident); } struct node_s *resolve_identifier(struct pike_string *ident) { if(resolve_cache) { struct svalue *tmp=low_mapping_string_lookup(resolve_cache,ident); if(tmp) { if(!(SAFE_IS_ZERO(tmp) && tmp->subtype==1)) return mkconstantsvaluenode(tmp); return 0; } } if(get_master()) { DECLARE_CYCLIC(); node *ret=0; if(BEGIN_CYCLIC(ident, lex.current_file)) { my_yyerror("Recursive module dependency in %S.", ident); }else{ SET_CYCLIC_RET(1); ref_push_string(ident); ref_push_string(lex.current_file); if (error_handler) { ref_push_object(error_handler); } else { push_int(0); } if (safe_apply_handler("resolv", error_handler, compat_handler, 3, 0)) { if (Pike_compiler->compiler_pass == 2 && ((Pike_sp[-1].type == T_OBJECT && Pike_sp[-1].u.object == placeholder_object) || (Pike_sp[-1].type == T_PROGRAM && Pike_sp[-1].u.program == placeholder_program))) { my_yyerror("Got placeholder %s (resolver problem) " "when resolving %S.", get_name_of_type (Pike_sp[-1].type), ident->str); } else { if(!resolve_cache) resolve_cache=dmalloc_touch(struct mapping *, allocate_mapping(10)); mapping_string_insert(resolve_cache,ident,Pike_sp-1); if(!(SAFE_IS_ZERO(Pike_sp-1) && Pike_sp[-1].subtype==1)) { ret=mkconstantsvaluenode(Pike_sp-1); } } pop_stack(); } else if(Pike_compiler->compiler_pass==2) { if (throw_value.type == T_STRING) { my_yyerror("%O", throw_value); free_svalue(&throw_value); throw_value.type = T_INT; } else { handle_compile_exception ("Error resolving %S.", ident); } } } END_CYCLIC(); return ret; } return 0; } /*! @decl constant this *! *! Builtin read only variable that evaluates to the current object. *! *! @seealso *! @[this_program], @[this_object()] */ /*! @decl constant this_program *! *! Builtin constant that evaluates to the current program. *! *! @seealso *! @[this], @[this_object()] */ /* If the identifier is recognized as one of the magic identifiers, * like "this", "this_program" or "`->" when preceded by ::, then a * suitable node is returned, NULL otherwise. inherit_num is -1 when * accessing all inherits (i.e. when :: is used without any identifier * before). */ struct node_s *program_magic_identifier (struct program_state *state, int state_depth, int inherit_num, struct pike_string *ident, int colon_colon_ref) { #if 0 fprintf (stderr, "magic_identifier (state, %d, %d, %s, %d)\n", state_depth, inherit_num, ident->str, colon_colon_ref); #endif if (!inherit_num) { /* These are only recognized when looking in the current program * and not an inherited one. */ /* Handle this by referring to the magic this identifier at index 0. */ if (ident == this_string) { if (state_depth > 0) return mkexternalnode (state->new_program, IDREF_MAGIC_THIS); else return mkidentifiernode (IDREF_MAGIC_THIS); } /* Handle this_program */ if (ident == this_program_string) { node *n = mkefuncallnode ("object_program", state_depth > 0 ? mkexternalnode (state->new_program, IDREF_MAGIC_THIS) : mkidentifiernode (IDREF_MAGIC_THIS)); /* We know this expression is constant. */ n->node_info &= ~OPT_NOT_CONST; n->tree_info &= ~OPT_NOT_CONST; return n; } } if (colon_colon_ref) { /* These are only recognized when prefixed with the :: operator. */ if (inherit_num < 0) inherit_num = 0; if(ident == lfun_strings[LFUN_ARROW] || ident == lfun_strings[LFUN_INDEX]) { return mknode(F_MAGIC_INDEX, mknewintnode(inherit_num), mknewintnode(state_depth)); } else if(ident == lfun_strings[LFUN_ASSIGN_ARROW] || ident == lfun_strings[LFUN_ASSIGN_INDEX]) { return mknode(F_MAGIC_SET_INDEX, mknewintnode(inherit_num), mknewintnode(state_depth)); } else if(ident == lfun_strings[LFUN__INDICES]) { return mknode(F_MAGIC_INDICES, mknewintnode(inherit_num), mknewintnode(state_depth)); } else if(ident == lfun_strings[LFUN__VALUES]) { return mknode(F_MAGIC_VALUES, mknewintnode(inherit_num), mknewintnode(state_depth)); } } return NULL; } /* 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; for(p=first_program;p;p=p->next) { if(id==p->id) { id_to_program_cache[h]=p; return p; } } if ((id > 0) && (id < PROG_DYNAMIC_ID_START)) { /* Reserved id. Attempt to load the proper dynamic module * to resolv the id. */ char *module = NULL; switch(id) { case PROG_PARSER_HTML_ID: module = "Parser._parser"; break; case PROG_GMP_MPZ_ID: module = "Gmp"; break; case PROG_MODULE_MIME_ID: module = "___MIME"; break; default: if ((id >= 100) && (id <= 300)) { module = "Image"; } else if ((id >= 1000) && (id <= 2000)) { module = "___GTK"; } break; } if (module) { push_text(module); SAFE_APPLY_MASTER("resolv", 1); pop_stack(); /* Try again... */ 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 much 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,ARGTYPE,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) { make_program_executable(p); return; /* We are out of memory, but we don't care! */ } size=0; #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) \ size=DO_ALIGN(size, ALIGNOF(TYPE)); \ if (p->PIKE_CONCAT (num_, NAME)) \ MEMCPY(data+size,p->NAME,p->PIKE_CONCAT(num_,NAME)*sizeof(p->NAME[0])); \ PIKE_CONCAT(RELOCATE_,NAME)(p, (TYPE *)(data+size)); \ dmfree(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; make_program_executable(p); } /* internal function to make the index-table */ static int program_identifier_index_compare(int a, int b, const struct program *p) { size_t val_a = PTR_TO_INT (ID_FROM_INT(p, a)->name); size_t val_b = PTR_TO_INT (ID_FROM_INT(p, b)->name); return val_a < val_b ? -1 : (val_a == val_b ? 0 : 1); } #define CMP(X,Y) program_identifier_index_compare(*(X), *(Y), prog) #define EXTRA_ARGS , struct program *prog #define XARGS , prog #define ID fsort_program_identifier_index #define TYPE unsigned short #include "fsort_template.h" #undef TYPE #undef ID #undef XARGS #undef EXTRA_ARGS #undef CMP #ifdef PIKE_DEBUG struct pike_string *find_program_name(struct program *p, INT32 *line) { INT32 l; if(!line) line=&l; #ifdef DEBUG_MALLOC { char *tmp=dmalloc_find_name(p); if (tmp) { char *p = STRCHR (tmp, ':'); if (p) { char *pp; while ((pp = STRCHR (p + 1, ':'))) p = pp; *line = atoi (p + 1); return make_shared_binary_string (tmp, p - tmp); } else { *line=0; return make_shared_string(tmp); } } } #endif return get_program_line(p, line); } #endif int override_identifier (struct reference *ref, struct pike_string *name) { int id = -1, cur_id = 0; int new_is_variable = IDENTIFIER_IS_VARIABLE(ID_FROM_PTR(Pike_compiler->new_program, ref)->identifier_flags); /* 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(;cur_id<Pike_compiler->new_program->num_identifier_references;cur_id++) { /* Do not zapp hidden identifiers */ if(Pike_compiler->new_program->identifier_references[cur_id].id_flags & ID_HIDDEN) continue; /* Do not zapp inherited inline ('local') identifiers */ if((Pike_compiler->new_program->identifier_references[cur_id].id_flags & (ID_INLINE|ID_INHERITED)) == (ID_INLINE|ID_INHERITED)) continue; /* Do not zapp functions with the wrong name... */ if(ID_FROM_INT(Pike_compiler->new_program, cur_id)->name != name) continue; #ifdef PROGRAM_BUILD_DEBUG fprintf(stderr, "%.*soverloaded reference %d (id_flags:0x%04x)\n", compilation_depth, " ", cur_id, Pike_compiler->new_program->identifier_references[cur_id].id_flags); #endif if (!new_is_variable && IDENTIFIER_IS_VARIABLE(ID_FROM_INT(Pike_compiler->new_program, cur_id)->identifier_flags)) { /* Overloading a variable with a constant or a function. * This is generally a bad idea. */ Pike_compiler->new_program->identifier_references[cur_id].id_flags |= ID_INLINE|ID_HIDDEN; yywarning("Attempt to override a non local variable %S " "with a non variable.", name); continue; } Pike_compiler->new_program->identifier_references[cur_id]=*ref; id = cur_id; } return id; } void fixate_program(void) { INT32 i,e,t; struct program *p=Pike_compiler->new_program; if(p->flags & PROGRAM_FIXED) return; #ifdef PIKE_DEBUG if(p->flags & PROGRAM_OPTIMIZED) Pike_fatal("Cannot fixate optimized program\n"); #endif /* Fixup identifier_flags. */ for (i=0; i < p->num_identifiers; i++) { if (IDENTIFIER_IS_FUNCTION(p->identifiers[i].identifier_flags) == IDENTIFIER_FUNCTION) { /* Get rid of any remaining tentative type markers. */ p->identifiers[i].identifier_flags &= ~IDENTIFIER_C_FUNCTION; } } /* Fixup identifier overrides. */ for (i = 0; i < p->num_identifier_references; i++) { struct reference *ref = p->identifier_references + i; if (ref->id_flags & ID_HIDDEN) continue; if (ref->inherit_offset != 0) continue; override_identifier (ref, ID_FROM_PTR (p, ref)->name); } /* Ok, sort for binsearch */ for(e=i=0;i<(int)p->num_identifier_references;i++) { struct reference *funp; struct identifier *fun; funp=p->identifier_references+i; if(funp->id_flags & (ID_HIDDEN|ID_STATIC)) continue; fun=ID_FROM_PTR(p, funp); if(funp->id_flags & ID_INHERITED) { int found_better=-1; int funa_is_prototype; if(funp->id_flags & ID_PRIVATE) continue; funa_is_prototype = fun->func.offset == -1; /* if(fun->func.offset == -1) continue; * prototype */ /* check for multiple definitions */ for(t=i+1;t<(int)p->num_identifier_references;t++) { struct reference *funpb; struct identifier *funb; funpb=p->identifier_references+t; if(funpb->id_flags & (ID_HIDDEN|ID_STATIC)) continue; funb=ID_FROM_PTR(p,funpb); /* if(funb->func.offset == -1) continue; * prototype */ if(fun->name==funb->name) { found_better=t; /* FIXME: Is this stuff needed? * It looks like it already is done by define_function(). */ if(funa_is_prototype && (funb->func.offset != -1) && !(funp->id_flags & ID_INLINE)) { funp->inherit_offset = funpb->inherit_offset; funp->identifier_offset = funpb->identifier_offset; } if(!funa_is_prototype && funb->func.offset == -1) { funpb->inherit_offset = funp->inherit_offset; funpb->identifier_offset = funp->identifier_offset; } } } if(found_better!=-1) continue; } if ((fun->func.offset == -1) && (funp->id_flags & ID_INLINE) && IDENTIFIER_IS_PIKE_FUNCTION(fun->identifier_flags)) { if (fun->name->len < 900) { my_yyerror("Missing definition for local function %S.", fun->name); } else { yyerror("Missing definition for local function."); } } add_to_identifier_index(i); } fsort_program_identifier_index(p->identifier_index, p->identifier_index + p->num_identifier_index - 1, p); p->flags |= PROGRAM_FIXED; /* Yes, it is supposed to start at 1 /Hubbe */ for(i=1;i<NUM_LFUNS;i++) { p->lfuns[i] = low_find_lfun(p, i); } if(Pike_compiler->flags & COMPILATION_CHECK_FINAL) { for(i=0;i<(int)p->num_identifier_references;i++) { if((p->identifier_references[i].id_flags & (ID_NOMASK|ID_HIDDEN)) == ID_NOMASK) { struct pike_string *name=ID_FROM_INT(p, i)->name; e=find_shared_string_identifier(name,p); if(e == -1) e=really_low_find_shared_string_identifier(name, p, SEE_STATIC|SEE_PRIVATE); if((e != i) && (e != -1)) { if(name->len < 1024) my_yyerror("Illegal to redefine final identifier %S", name); else my_yyerror("Illegal to redefine final identifier (name too large to print)."); } } } } #ifdef DEBUG_MALLOC { #define DBSTR(X) ((X)?(X)->str:"") int e,v; INT32 line; struct pike_string *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->str, line); free_string(tmp); }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; struct pike_string *tmp2 = NULL; 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(!(tmp2 = find_program_name(i->prog, &line))) { sprintf(buffer,"inherit[%d]",e); tmp=buffer; } else { tmp = tmp2->str; } 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); if (tmp2) { free_string(tmp2); } } dmalloc_set_mmap_template(Pike_compiler->new_program, m); } #endif } struct program *low_allocate_program(void) { struct program *p=alloc_program(); MEMSET(p, 0, sizeof(struct program)); p->flags|=PROGRAM_VIRGIN; p->alignment_needed=1; GC_ALLOC(p); p->id=++current_program_id; INIT_PIKE_MEMOBJ(p); DOUBLELINK(first_program, p); GETTIMEOFDAY(& p->timestamp); return p; } /* * Start building a new program */ void low_start_new_program(struct program *p, int pass, struct pike_string *name, int flags, int *idp) { int id=0; struct svalue tmp; #if 0 #ifdef SHARED_NODES if (!node_hash.table) { node_hash.table = malloc(sizeof(node *)*32831); if (!node_hash.table) { Pike_fatal("Out of memory!\n"); } MEMSET(node_hash.table, 0, sizeof(node *)*32831); node_hash.size = 32831; } #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++; tmp.type=T_PROGRAM; if(!p) { p=low_allocate_program(); if(name) { tmp.u.program=p; id=add_constant(name, &tmp, flags & ~ID_EXTERN); #if 0 fprintf(stderr,"Compiling class %s, depth=%d\n",name->str,compilation_depth); }else{ fprintf(stderr,"Compiling file %s, depth=%d\n", lex.current_file ? lex.current_file->str : "-", compilation_depth); #endif } }else{ tmp.u.program=p; add_ref(p); if((pass == 2) && name) { struct identifier *i; id=isidentifier(name); if (id < 0) Pike_fatal("Program constant disappeared in second pass.\n"); i=ID_FROM_INT(Pike_compiler->new_program, id); free_type(i->type); i->type=get_type_of_svalue(&tmp); } } if (pass == 1) { if(compilation_depth >= 1) add_ref(p->parent = Pike_compiler->new_program); } p->flags &=~ PROGRAM_VIRGIN; Pike_compiler->parent_identifier=id; if(idp) *idp=id; CDFPRINTF((stderr, "th(%ld) %p low_start_new_program() %s " "pass=%d: threads_disabled:%d, compilation_depth:%d\n", (long)th_self(), p, name ? name->str : "-", Pike_compiler->compiler_pass, threads_disabled, compilation_depth)); init_type_stack(); #define PUSH #include "compilation.h" Pike_compiler->compiler_pass = pass; 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); Pike_compiler->fake_object=alloc_object(); #ifdef PIKE_DEBUG 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->storage=(char *)malloc(sizeof(struct parent_info)); #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=0; add_ref(Pike_compiler->fake_object); /* For DMALLOC... */ 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) { /* Fake objects have parents regardless of PROGRAM_USE_PARENT */ if((((struct parent_info *)Pike_compiler->fake_object->storage)->parent=Pike_compiler->previous->fake_object)) add_ref(Pike_compiler->previous->fake_object); ((struct parent_info *)Pike_compiler->fake_object->storage)->parent_identifier=id; }else{ ((struct parent_info *)Pike_compiler->fake_object->storage)->parent=0; ((struct parent_info *)Pike_compiler->fake_object->storage)->parent_identifier=0; } 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 if (compilation_depth >= 1) { if(TEST_COMPAT(7,2) || (lex.pragmas & ID_SAVE_PARENT)) { p->flags |= PROGRAM_USES_PARENT; }else if (!(lex.pragmas & ID_DONT_SAVE_PARENT)) { struct pike_string *tmp=findstring("__pragma_save_parent__"); if(tmp) { struct node_s *n=find_module_identifier(tmp, 0); if(n) { int do_save_parent = !node_is_false(n); /* Default to true. */ free_node(n); if (do_save_parent) p->flags |= PROGRAM_USES_PARENT; } } } } 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,ARGTYPE,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; size_t len = 0; INT32 shift = 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) { cnt++; len = get_small_number(&cnt); shift = *cnt; file = ++cnt; CHECK_FILE_ENTRY (Pike_compiler->new_program, cnt, len, shift); cnt += len<<shift; } off+=get_small_number(&cnt); line+=get_small_number(&cnt); } Pike_compiler->last_line=line; Pike_compiler->last_pc=off; if(file) { struct pike_string *str = begin_wide_shared_string(len, shift); if(Pike_compiler->last_file) free_string(Pike_compiler->last_file); memcpy(str->str, file, len<<shift); Pike_compiler->last_file = end_shared_string(str); } } }else{ static struct pike_string *s; struct inherit i; #define START_SIZE 64 #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) \ if (Pike_compiler->new_program->NAME) { \ free (Pike_compiler->new_program->NAME); \ Pike_compiler->new_program->PIKE_CONCAT(num_,NAME) = 0; \ } \ 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.identifier_ref_offset=0; i.parent=0; i.parent_identifier=-1; i.parent_offset=OBJECT_PARENT; i.name=0; add_to_inherits(i); } Pike_compiler->init_node=0; Pike_compiler->num_parse_error=0; push_compiler_frame(0); copy_pike_type(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(int line, const char *file) { struct pike_string *save_file = lex.current_file; int save_line = lex.current_line; { /* Trim off the leading path of the compilation environment. */ const char *p = DEFINETOSTR(PIKE_SRC_ROOT), *f = file; while (*p && *p == *f) p++, f++; while (*f == '/' || *f == '\\') f++; lex.current_file = make_shared_string(f); lex.current_line = line; } CDFPRINTF((stderr, "th(%ld) start_new_program(%d, %s): " "threads_disabled:%d, compilation_depth:%d\n", (long)th_self(), line, file, threads_disabled, compilation_depth)); low_start_new_program(0,1,0,0,0); store_linenumber(line,lex.current_file); debug_malloc_name(Pike_compiler->new_program, file, line); free_string(lex.current_file); lex.current_file = save_file; lex.current_line = save_line; } static void exit_program_struct(struct program *p) { unsigned e; #ifdef PIKE_DEBUG if (p->refs) { #ifdef DEBUG_MALLOC fprintf (stderr, "Program to be freed still got %d references:\n", p->refs); describe_something(p, T_PROGRAM, 0,2,0, NULL); #endif Pike_fatal("Program to be freed still got %d references.\n", p->refs); } #endif if(p->parent) { /* Make sure to break the circularity... */ struct program *parent = p->parent; p->parent = NULL; free_program(parent); } 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_type(p->identifiers[e].type); } } if(p->constants) { for(e=0;e<p->num_constants;e++) { free_svalue(& p->constants[e].sval); #if 0 if(p->constants[e].name) free_string(p->constants[e].name); #endif /* 0 */ } } 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); } DOUBLEUNLINK(first_program, p); if(p->flags & PROGRAM_OPTIMIZED) { if(p->program) { #ifdef PIKE_USE_MACHINE_CODE #ifdef VALGRIND_DISCARD_TRANSLATIONS VALGRIND_DISCARD_TRANSLATIONS(p->program, p->num_program*sizeof(p->program[0])); #endif /* VALGRIND_DISCARD_TRANSLATIONS */ #endif /* PIKE_USE_MACHINE_CODE */ dmfree(p->program); } #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) p->NAME=0; #include "program_areas.h" }else{ #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) \ if(p->NAME) { dmfree((char *)p->NAME); p->NAME=0; } #include "program_areas.h" } EXIT_PIKE_MEMOBJ(p); GC_FREE(p); } #ifdef PIKE_DEBUG void dump_program_desc(struct program *p) { int e,d,q; /* fprintf(stderr,"Program '%s':\n",p->name->str); */ fprintf(stderr,"$$$$$ dump_program_desc for %p\n", p); 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 identifier references:\n"); for(e=0;e<(int)p->num_identifier_references;e++) { struct inherit *inh = INHERIT_FROM_INT(p,e); fprintf(stderr,"%3d: ",e); for(d=0;d<inh->inherit_level;d++) fprintf(stderr," "); fprintf(stderr,"%-40s flags 0x%x",ID_FROM_INT(p,e)->name->str, p->identifier_references[e].id_flags); for (q = 0; q < p->num_inherits; q++) if (p->inherits + q == inh) { fprintf (stderr, " inherit %d\n", q); goto inherit_found; } fprintf (stderr, " inherit not found!\n"); inherit_found:; } 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); } fprintf(stderr,"$$$$$ dump_program_desc for %p done\n", p); } #endif static void toss_compilation_resources(void) { if(Pike_compiler->fake_object) { if( ((struct parent_info *)Pike_compiler->fake_object->storage)->parent ) { free_object(((struct parent_info *)Pike_compiler->fake_object->storage)->parent); ((struct parent_info *)Pike_compiler->fake_object->storage)->parent=0; } 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(void *); } } 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(void *); } } #ifdef PIKE_DEBUG void dump_program_tables (struct program *p, int indent) { int d; if (!p) { fprintf(stderr, "%*sProgram: NULL\n\n", indent, ""); return; } fprintf(stderr, "%*sProgram flags: 0x%04x\n\n", indent, "", p->flags); fprintf(stderr, "%*sReference table:\n" "%*s ####: Flags Inherit Identifier\n", indent, "", indent, ""); for (d=0; d < p->num_identifier_references; d++) { struct reference *ref = p->identifier_references + d; fprintf(stderr, "%*s %4d: %5x %7d %10d %s\n", indent, "", d, ref->id_flags, ref->inherit_offset, ref->identifier_offset, ID_FROM_PTR(p,ref)->name->size_shift ? "(wide)" : ID_FROM_PTR(p,ref)->name->str); if (IDENTIFIER_IS_PIKE_FUNCTION(ID_FROM_PTR(p,ref)->identifier_flags)) { INT32 line; struct program *inh_p = INHERIT_FROM_PTR(p,ref)->prog; struct pike_string *file = get_line (ID_FROM_PTR(p,ref)->func.offset + inh_p->program, inh_p, &line); if (!file->size_shift) fprintf (stderr, "%*s %s:%d\n", indent, "", file->str, line); free_string (file); } } fprintf(stderr, "\n" "%*sIdentifier index table:\n" "%*s ####: Index\n", indent, "", indent, ""); for (d = 0; d < p->num_identifier_index; d++) { fprintf(stderr, "%*s %4d: %5d\n", indent, "", d, p->identifier_index[d]); } fprintf(stderr, "\n" "%*sInherit table:\n" "%*s ####: Level prog_id id_level storage_offs " "par_id par_offs par_obj_id id_ref_offs\n", indent, "", indent, ""); for (d=0; d < p->num_inherits; d++) { struct inherit *inh = p->inherits + d; fprintf(stderr, "%*s %4d: %5d %7d %8d %12d %6d %8d %10d %11d\n", indent, "", d, inh->inherit_level, inh->prog ? inh->prog->id : -1, inh->identifier_level, inh->storage_offset, inh->parent_identifier, inh->parent_offset, inh->parent ? inh->parent->program_id : -1, inh->identifier_ref_offset); } fprintf(stderr, "\n" "%*sIdentifier table:\n" "%*s ####: Flags Offset Type Name\n", indent, "", indent, ""); for (d=0; d < p->num_identifiers; d++) { struct identifier *id = p->identifiers + d; fprintf(stderr, "%*s %4d: %5x %6d %4d \"%s\"\n", indent, "", d, id->identifier_flags, id->func.offset, id->run_time_type, id->name->str); } fprintf(stderr, "\n" "%*sVariable table:\n" "%*s ####: Index\n", indent, "", indent, ""); for (d = 0; d < p->num_variable_index; d++) { fprintf(stderr, "%*s %4d: %5d\n", indent, "", d, p->variable_index[d]); } fprintf(stderr, "\n" "%*sConstant table:\n" "%*s ####: Type Name\n", indent, "", indent, ""); for (d = 0; d < p->num_constants; d++) { struct program_constant *c = p->constants + d; #if 0 fprintf(stderr, "%*s %4d: %-15s %s%s%s\n", indent, "", d, get_name_of_type (c->sval.type), c->name?"\"":"",c->name?c->name->str:"NULL",c->name?"\"":""); #else /* !0 */ fprintf(stderr, "%*s %4d: %-15s %d\n", indent, "", d, get_name_of_type (c->sval.type), c->offset); #endif /* 0 */ } fprintf(stderr, "\n" "%*sLinenumber table:\n", indent, ""); { INT32 off = 0, line = 0; char *cnt = p->linenumbers; while (cnt < p->linenumbers + p->num_linenumbers) { if (*cnt == 127) { int len, shift; char *file; cnt++; len = get_small_number(&cnt); shift = *cnt; file = ++cnt; CHECK_FILE_ENTRY (p, cnt, len, shift); cnt += len << shift; if (!shift) { fprintf(stderr, "%*s Filename: \"%s\"\n", indent, "", file); } else { fprintf(stderr, "%*s Filename: len:%d, shift:%d\n", indent, "", len, shift); } } off += get_small_number(&cnt); line += get_small_number(&cnt); fprintf(stderr, "%*s %8d:%8d\n", indent, "", off, line); } } fprintf(stderr, "\n"); } 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) Pike_fatal("Program id is out of sync! (p->id=%d, current_program_id=%d)\n",p->id,current_program_id); if(p->refs <=0) Pike_fatal("Program has zero refs.\n"); if(p->next && p->next->prev != p) Pike_fatal("Program ->next->prev != program.\n"); if(p->prev) { if(p->prev->next != p) Pike_fatal("Program ->prev->next != program.\n"); }else{ if(first_program != p) Pike_fatal("Program ->prev == 0 but first_program != program.\n"); } if(p->id > current_program_id || p->id <= 0) Pike_fatal("Program id is wrong.\n"); if(p->storage_needed < 0) Pike_fatal("Program->storage_needed < 0.\n"); if(p->num_identifier_index > p->num_identifier_references) Pike_fatal("Too many identifier index entries in program!\n"); for(e=0;e<p->num_constants;e++) { struct svalue *s = & p->constants[e].sval; check_svalue(s); if (p->flags & PROGRAM_FINISHED && s->type == T_OBJECT && s->u.object->next == s->u.object) Pike_fatal ("Got fake object in constant in finished program.\n"); #if 0 if(p->constants[e].name) check_string(p->constants[e].name); #else /* ! 0 */ if (p->constants[e].offset >= p->num_identifiers) { Pike_fatal("Constant initializer outside num_identifiers (%d >= %d).\n", p->constants[e].offset, p->num_identifiers); } #endif /* 0 */ } 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) Pike_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) Pike_fatal("Not enough room allocated by inherit!\n"); if (p->inherits[e].inherit_level == 1 && p->inherits[e].identifier_level != (INT32) p->inherits[e].identifier_ref_offset) { dump_program_tables (p, 0); Pike_fatal ("Unexpected difference between identifier_level " "and identifier_ref_offset in inherit %d.\n", e); } if(e) { if(p->inherits[e-1].storage_offset > p->inherits[e].storage_offset) Pike_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) Pike_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_type_string(p->identifiers[e].type); switch (p->identifiers[e].identifier_flags & IDENTIFIER_TYPE_MASK) { case IDENTIFIER_VARIABLE: case IDENTIFIER_PIKE_FUNCTION: case IDENTIFIER_C_FUNCTION: case IDENTIFIER_CONSTANT: break; default: Pike_fatal("Invalid identifier type.\n"); } if(p->identifiers[e].identifier_flags & ~IDENTIFIER_MASK) Pike_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)) { Pike_fatal("Variable %s offset is not properly aligned (%ld).\n", p->identifiers[e].name->str, PTRDIFF_T_TO_LONG(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) Pike_fatal("Inherit offset is wrong!\n"); if(!p->inherits[p->identifier_references[e].inherit_offset].prog) { if(!(p->flags & PROGRAM_FINISHED)) continue; Pike_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) Pike_fatal("Identifier offset %d is wrong! %d > %d\n", e, p->identifier_references[e].identifier_offset, p->inherits[p->identifier_references[e].inherit_offset].prog->num_identifiers); i=ID_FROM_INT(p, e); if(IDENTIFIER_IS_VARIABLE(i->identifier_flags)) { 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) Pike_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) { fprintf(stderr, "Storage offset: 0x%08x vs 0x%08x\n" "Func offset: 0x%08x vs 0x%08x\n" "Type: %s vs %s\n", INHERIT_FROM_INT(p, variable_positions[offset+q])-> storage_offset, INHERIT_FROM_INT(p, e)->storage_offset, ID_FROM_INT(p, variable_positions[offset+q])->func.offset, i->func.offset, get_name_of_type(ID_FROM_INT(p,variable_positions[offset+q] )->run_time_type), get_name_of_type(i->run_time_type)); if (i->name) { Pike_fatal("Variable '%s' and '%s' overlap\n" "Offset 0x%08x - 0x%08x overlaps with 0x%08x - 0x%08x\n", ID_FROM_INT(p, variable_positions[offset+q])->name->str, i->name->str, INHERIT_FROM_INT(p, variable_positions[offset+q])-> storage_offset + ID_FROM_INT(p, variable_positions[offset+q])->func.offset, INHERIT_FROM_INT(p, variable_positions[offset+q])-> storage_offset + ID_FROM_INT(p, variable_positions[offset+q])->func.offset + sizeof_variable(ID_FROM_INT(p, variable_positions[offset+q] )->run_time_type)-1, offset, offset+size-1); } else { Pike_fatal("Variable '%s' and anonymous variable (%d) overlap\n" "Offset 0x%08x - 0x%08x overlaps with 0x%08x - 0x%08x\n", ID_FROM_INT(p, variable_positions[offset+q])->name->str, e, INHERIT_FROM_INT(p, variable_positions[offset+q])-> storage_offset + ID_FROM_INT(p, variable_positions[offset+q])->func.offset, INHERIT_FROM_INT(p, variable_positions[offset+q])-> storage_offset + ID_FROM_INT(p, variable_positions[offset+q])->func.offset + sizeof_variable(ID_FROM_INT(p, variable_positions[offset+q] )->run_time_type)-1, offset, offset+size-1); } } } variable_positions[offset+q]=e; } } } for(e=0;e<p->num_identifier_index;e++) { if(p->identifier_index[e] > p->num_identifier_references) Pike_fatal("Program->identifier_indexes[%ld] is wrong\n",(long)e); if (e && (program_identifier_index_compare(p->identifier_index[e-1], p->identifier_index[e], p) > 0)) { Pike_fatal("Program->identifier_index[%ld] > " "Program->identifier_index[%ld]\n", (long)(e-1), (long)e); } } } #endif /* Note: This function is misnamed, since it's run after both passes. /mast */ /* finish-states: * * 0: First pass. * 1: Last pass. * 2: Called from decode_value(). */ 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_CONST_STRING(s,"__INIT"); /* Collect references to inherited __INIT functions */ if (!(Pike_compiler->new_program->flags & PROGRAM_AVOID_CHECK)) { 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) { Pike_compiler->compiler_frame->current_function_number = -2; 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 if (finish == 2) { /* Called from decode_value(). */ e = low_find_lfun(Pike_compiler->new_program, LFUN___INIT); }else{ e=-1; } Pike_compiler->new_program->lfuns[LFUN___INIT]=e; pop_compiler_frame(); /* Pop __INIT local variables */ if(Pike_compiler->num_parse_error > 0) { CDFPRINTF((stderr, "th(%ld) Compilation errors (%d).\n", (long)th_self(), Pike_compiler->num_parse_error)); prog=0; }else{ prog=Pike_compiler->new_program; add_ref(prog); Pike_compiler->new_program->flags |= PROGRAM_PASS_1_DONE; if(finish) { if(Pike_compiler->new_program->flags & PROGRAM_USES_PARENT) { Pike_compiler->new_program->parent_info_storage = add_xstorage(sizeof(struct parent_info), ALIGNOF(struct parent_info), 0); }else{ /* Cause errors if used hopefully */ Pike_compiler->new_program->parent_info_storage=-1; } fixate_program(); if(Pike_compiler->num_parse_error) { free_program(prog); prog=0; }else{ optimize_program(Pike_compiler->new_program); Pike_compiler->new_program->flags |= PROGRAM_FINISHED; } } #ifdef PIKE_DEBUG check_program(prog); if(l_flag) dump_program_desc(prog); #endif } #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(); #if 0 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)); #endif 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(); free_all_nodes(); CDFPRINTF((stderr, "th(%ld) %p end_first_pass(%d): " "threads_disabled:%d, compilation_depth:%d\n", (long)th_self(), prog, finish, threads_disabled, compilation_depth)); compilation_depth--; exit_threads_disable(NULL); return prog; } /* * Finish this program, returning the newly built program */ PMOD_EXPORT struct program *debug_end_program(void) { Pike_compiler->compiler_pass = 2; 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) Pike_fatal("Alignment must be 1,2,4,8,16,32,64,128 or 256 not %ld\n", PTRDIFF_T_TO_LONG(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) Pike_fatal("add_storage failed horribly!\n"); if( (offset /* + OFFSETOF(object,storage) */ - modulo_orig ) % alignment ) Pike_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; } /* * Internal function. * Adds object storage that will *not* be inherited. */ static size_t add_xstorage(size_t size, size_t alignment, ptrdiff_t modulo_orig) { ptrdiff_t offset, modulo, available; int e; if(!size) return Pike_compiler->new_program->xstorage; modulo=( modulo_orig /* +OFFSETOF(object,storage) */ ) % alignment; offset=DO_ALIGN(Pike_compiler->new_program->xstorage-modulo,alignment)+modulo; Pike_compiler->new_program->xstorage = offset + size; /* Move all inherits to make room */ available = Pike_compiler->new_program->inherits[0].storage_offset; if(available < (ptrdiff_t)(offset+size)) { available= DO_ALIGN( ((offset + size) - available), Pike_compiler->new_program->alignment_needed); for(e=0;e<Pike_compiler->new_program->num_inherits;e++) Pike_compiler->new_program->inherits[e].storage_offset+=available; Pike_compiler->new_program->storage_needed+=available; } return (size_t) offset; } typedef void (*oldhandlertype)(struct object *); static void compat_event_handler(int e) { oldhandlertype handler; debug_malloc_touch(Pike_fp->current_object); handler=((oldhandlertype *)Pike_fp->context.prog->program)[e]; if(handler) handler(Pike_fp->current_object); debug_malloc_touch(Pike_fp->current_object); } static void add_compat_event_handler(void) { if(Pike_compiler->new_program->event_handler != compat_event_handler) { unsigned int e,d; unsigned char *tmp=(unsigned char *)&Pike_compiler->new_program->event_handler; for(d=0;d<NUM_PROG_EVENTS;d++) { /* FIXME: This looks like it might be broken. */ /* Broken how? -Hubbe */ #ifdef HAVE_COMPUTED_GOTO add_to_program(Pike_compiler->new_program->event_handler); #else /* !HAVE_COMPUTED_GOTO */ for(e=0;e<sizeof(Pike_compiler->new_program->event_handler);e++) add_to_program(tmp[e]); #endif /* HAVE_COMPUTED_GOTO */ } Pike_compiler->new_program->event_handler=compat_event_handler; } } /* * set a callback used to initialize clones of this program * the init function is called at clone time * This function is obsolete, use pike_set_prog_event_callback instead. */ PMOD_EXPORT void set_init_callback(void (*init)(struct object *)) { add_compat_event_handler(); ((oldhandlertype *)Pike_compiler->new_program->program)[PROG_EVENT_INIT]=init; } /* * set a callback used to de-initialize clones of this program * the exit function is called at destruct * This function is obsolete, use pike_set_prog_event_callback instead. */ PMOD_EXPORT void set_exit_callback(void (*exit)(struct object *)) { add_compat_event_handler(); ((oldhandlertype *)Pike_compiler->new_program->program)[PROG_EVENT_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. * * The callback is called after any mapped variables on the object * have been recursed (and possibly freed). * * This function is obsolete, use pike_set_prog_event_callback instead. */ PMOD_EXPORT void set_gc_recurse_callback(void (*m)(struct object *)) { add_compat_event_handler(); ((oldhandlertype *)Pike_compiler->new_program->program)[PROG_EVENT_GC_RECURSE]=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. * * This function is obsolete, use pike_set_prog_event_callback instead. */ PMOD_EXPORT void set_gc_check_callback(void (*m)(struct object *)) { add_compat_event_handler(); ((oldhandlertype *)Pike_compiler->new_program->program)[PROG_EVENT_GC_CHECK]=m; } void pike_set_prog_event_callback(void (*cb)(int)) { #ifdef PIKE_DEBUG if(Pike_compiler->new_program->event_handler) Pike_fatal("Program already has an event handler!\n"); #endif Pike_compiler->new_program->event_handler=cb; } void pike_set_prog_optimize_callback(node *(*opt)(node *)) { #ifdef PIKE_DEBUG if(Pike_compiler->new_program->optimize) Pike_fatal("Program already has an optimize handler!\n"); #endif Pike_compiler->new_program->optimize = opt; } int really_low_reference_inherited_identifier(struct program_state *q, int e, int i) { struct program *np=(q?q:Pike_compiler)->new_program; struct reference funp; struct program *p; int d, num_id_refs; if(i==-1) return -1; p = np->inherits[e].prog; funp = p->identifier_references[i]; funp.inherit_offset += e; funp.id_flags = (funp.id_flags & ~ID_INHERITED) | ID_INLINE|ID_HIDDEN; num_id_refs = np->num_identifier_references; for(d = 0; d < num_id_refs; 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); /* NOTE: np->num_identifier_references has been increased by one by * {low_,}add_to_identifier_references(). */ #ifdef PIKE_DEBUG if (num_id_refs != np->num_identifier_references-1) { fatal("Unexpected number of identifier references: %d != %d\n", num_id_refs, np->num_identifier_references-1); } #endif /* PIKE_DEBUG */ return num_id_refs; /* aka np->num_identifier_references - 1 */ } 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,refs; 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; return really_low_reference_inherited_identifier(q, e, i); } 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)) Pike_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)); } if(ISCONSTSTR(function_name,"_indices")) { return mknode(F_MAGIC_INDICES,mknewintnode(e),mknewintnode(0)); } if(ISCONSTSTR(function_name,"_values")) { return mknode(F_MAGIC_VALUES,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)); } if(ISCONSTSTR(function_name,"_indices")) { return mknode(F_MAGIC_INDICES, mknewintnode(e),mknewintnode(n+1)); } if(ISCONSTSTR(function_name,"_values")) { return mknode(F_MAGIC_VALUES, 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); } #if 0 static int locate_parent_state(struct program_state **state, struct inherit **i, int *parent_identifier, int depth) { int result=1; if(depth<=0) return depth; while(depth-->0) { if( (*i)->parent_offset != INHERIT_PARENT) { int tmp=(*i)->parent_identifier; if( (*i)->parent_offset > 0) { int po=(*i)->parent_offset; *parent_identifier = (*state)->parent_identifier; *state = (*state)->previous; result++; fprintf(stderr,"INHERIT: state=state->previous (po=%d)\n",po); if(po>1) { *i=INHERIT_FROM_INT( (*state)->new_program, *parent_identifier); result+=locate_parent_state(state,i,parent_identifier, po-1); } } if(tmp != -1) { if( *parent_identifier == -4711) { *parent_identifier = tmp; }else{ *parent_identifier = tmp + INHERIT_FROM_INT( (*state)->new_program, *parent_identifier)->identifier_level; } } }else{ fprintf(stderr,"INHERIT: Bailout!\n"); return result+depth+1; } *i = INHERIT_FROM_INT( (*state)->new_program, *parent_identifier); } return result; } static int find_depth(struct program_state *state, struct inherit *i, int parent_identifier, int depth) { #if 0 int e; struct inherit *oi; for(e=0;e<=parent_offset;e++) state=state->previous; oi=INHERIT_FROM_INT(state->new_program, parent_identifier); parent_offset+=i->parent_offset; #endif return locate_parent_state(&state, &i, &parent_identifier, depth); } #endif /* * 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; #if 0 fprintf(stderr,"%p low_inherit(pid=%d, parent=%p, parid=%d, " "paroff=%d, flags=0x%x, name=%s);\n", Pike_compiler->new_program, p ? p->id : 0, parent, parent_identifier, parent_offset, flags, name? name->str : ""); #endif CDFPRINTF((stderr, "th(%ld) %p inherit %p\n", (long) th_self(), Pike_compiler->new_program, p)); if(!p) { yyerror("Illegal program pointer."); return; } if (p == placeholder_program) { yyerror("Trying to inherit placeholder program (resolver problem)."); return; } if(p->flags & PROGRAM_NEEDS_PARENT) { struct program_state *state=Pike_compiler; if(!parent && !parent_offset) { yyerror("Parent pointer lost, cannot inherit!"); /* We inherit it anyway, to avoid causing more errors */ } #if 0 /* FIXME: we don't really need to set this flag on ALL * previous compilations, but I'm too lazy to figure out * exactly how deep down we need to go... */ for(e=0;e<compilation_depth;e++,state=state->previous) state->new_program->flags |= PROGRAM_USES_PARENT; #endif } /* parent offset was increased by 42 for above test.. */ if(parent_offset) parent_offset-=42; 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) { #if 0 struct object *o; inherit.parent_offset=0; for(o=Pike_compiler->fake_object;o!=parent;o=o->parent) { #ifdef PIKE_DEBUG if(!o) Pike_fatal("low_inherit with odd Pike_compiler->fake_object as parent!\n"); #endif inherit.parent_offset++; } #else struct program_state *state=Pike_compiler; inherit.parent_offset=0; for(;state->fake_object!=parent;state=state->previous) { #ifdef PIKE_DEBUG if(!state->fake_object) Pike_fatal("low_inherit with odd Pike_compiler->fake_object as parent!\n"); #endif inherit.parent_offset++; } #endif }else{ inherit.parent=parent; inherit.parent_identifier=parent_identifier; inherit.parent_offset=INHERIT_PARENT; } }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=-1; break; } in=INHERIT_FROM_INT(par->prog, pid); switch(in->parent_offset) { default: { struct external_variable_context tmp; struct inherit *in2=in; while(in2->inherit_level >= in->inherit_level) in2--; tmp.o=par; tmp.inherit=in2; tmp.parent_identifier=pid; find_external_context(&tmp, in->parent_offset); par = tmp.o; pid = tmp.parent_identifier; } break; case INHERIT_PARENT: pid = in->parent_identifier; par = in->parent; break; case OBJECT_PARENT: /* Ponder: Can we be sure that PROGRAM_USES_PARENT * doesn't get set later? /mast */ if(par->prog->flags & PROGRAM_USES_PARENT) { pid = PARENT_INFO(par)->parent_identifier; par = PARENT_INFO(par)->parent; }else{ pid=-1; par=0; } } } inherit.parent=par; inherit.parent_offset=INHERIT_PARENT; } } } if(inherit.parent) add_ref(inherit.parent); if(name) { if(e==0) { copy_shared_string(inherit.name,name); } else if(inherit.name) { /* FIXME: Wide string handling. */ 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); } /* This value is used by encode_value() to reverse the inherit operation. */ Pike_compiler->new_program->inherits[inherit_offset].identifier_ref_offset = Pike_compiler->new_program->num_identifier_references; 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) { Pike_compiler->flags |= COMPILATION_CHECK_FINAL; } 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->type == T_FUNCTION ? s->subtype : -1, 0, flags, name); } void compiler_do_inherit(node *n, INT32 flags, struct pike_string *name) { struct program *p; struct identifier *i; INT32 numid=-1, offset=0; if(!n) { yyerror("Unable to inherit"); return; } switch(n->token) { case F_IDENTIFIER: p=Pike_compiler->new_program; offset=0;

pike.git/ src/ program.c > 766bc8e5ea1aba0688315a1bf996c95f644326c7 [Annotate]