pike.git/src/encode.c:68843207c7e637af849c1e5c2915b9d7e4021649

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 /* || 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. */ #include "global.h" #include "stralloc.h" #include "pike_macros.h" #include "object.h" #include "constants.h" #include "interpret.h" #include "svalue.h" #include "mapping.h" #include "array.h" #include "multiset.h" #include "lex.h" #include "dynamic_buffer.h" #include "pike_error.h" #include "operators.h" #include "builtin_functions.h" #include "module_support.h" #include "fsort.h" #include "threads.h" #include "stuff.h" #include "version.h" #include "bignum.h" #include "pikecode.h" #include "pike_types.h" #include "opcodes.h" #include "peep.h" #include "pike_compiler.h" #include "bitvector.h" /* #define ENCODE_DEBUG */ /* Use the old encoding method for programs. */ /* #define OLD_PIKE_ENCODE_PROGRAM */ #ifdef ENCODE_DEBUG /* Pass a nonzero integer as the third arg to encode_value, * encode_value_canonic and decode_value to activate this debug. It * both enables debug messages and also lessens the pickyness to * sort-of be able to decode programs with the wrong codec. */ #define EDB(N,X) do { debug_malloc_touch(data); if (data->debug>=N) {X;} } while (0) #ifndef PIKE_DEBUG #error ENCODE_DEBUG requires PIKE_DEBUG #endif #else #define EDB(N,X) do { debug_malloc_touch(data); } while (0) #endif #ifdef _AIX #include <net/nh.h> #endif #ifdef HAVE_NETINET_IN_H #include <netinet/in.h> #endif #ifdef HAVE_SYS_SOCKET_H #include <sys/socket.h> #endif #ifdef HAVE_IEEEFP_H #include <ieeefp.h> #endif /* HAVE_IEEEFP_H */ #include <math.h> #ifdef PIKE_DEBUG #define encode_value2 encode_value2_ #define decode_value2 decode_value2_ #endif /* Tags used by encode value. * * Currently they differ from the old PIKE_T variants by * TAG_FLOAT == OLD_PIKE_T_TYPE == 7 * and * TAG_TYPE == OLD_PIKE_T_FLOAT == 9 * * The old PIKE_T variants in turn differ from the current for values * less than 16 (aka MAX_TYPE) by bit 3 (mask 0x0008 (aka MIN_REF_TYPE)) * being inverted. * * These are NOT to be renumbered unless the file-format version is changed! */ /* Current encoding: ¶ke0 * * +---+-+-+-------+ * |s z|s|n| t a g | * +---+-+-+-------+ * sz size/small int * s small int indicator * n negative (or rather inverted) * tag TAG_type (4 bits) */ #define TAG_ARRAY 0 #define TAG_MAPPING 1 #define TAG_MULTISET 2 #define TAG_OBJECT 3 #define TAG_FUNCTION 4 #define TAG_PROGRAM 5 #define TAG_STRING 6 #define TAG_FLOAT 7 #define TAG_INT 8 #define TAG_TYPE 9 /* Not supported yet */ #define TAG_DELAYED 14 /* Note: Coincides with T_ZERO. */ #define TAG_AGAIN 15 #define TAG_MASK 15 #define TAG_NEG 16 #define TAG_SMALL 32 #define SIZE_SHIFT 6 #define MAX_SMALL (1<<(8-SIZE_SHIFT)) #define COUNTER_START (-MAX_SMALL) /* Entries used to encode the identifier_references table. */ #define ID_ENTRY_TYPE_CONSTANT -4 #define ID_ENTRY_EFUN_CONSTANT -3 #define ID_ENTRY_RAW -2 #define ID_ENTRY_EOT -1 #define ID_ENTRY_VARIABLE 0 #define ID_ENTRY_FUNCTION 1 #define ID_ENTRY_CONSTANT 2 #define ID_ENTRY_INHERIT 3 #define ID_ENTRY_ALIAS 4 static struct object *lookup_codec (struct pike_string *codec_name) { struct object *m = get_master(); if (!m) { /* Use a dummy if there's no master around yet. This will cause an * error in apply later, so we don't need to bother. */ return clone_object (null_program, 0); } else { ref_push_object (m); ref_push_string (codec_name); o_index(); if (UNSAFE_IS_ZERO (Pike_sp - 1)) { add_ref (m); return m; } else { apply_svalue (Pike_sp - 1, 0); if (TYPEOF(Pike_sp[-1]) != T_OBJECT) Pike_error ("master()->%s() did not return an object. Got: %O\n", codec_name->str, Pike_sp - 1); m = (--Pike_sp)->u.object; pop_stack(); return m; } } } struct encode_data { int canonic; struct object *codec; struct svalue counter; struct mapping *encoded; /* The encoded mapping maps encoded things to their entry IDs. A * value less than COUNTER_START means that it's a forward reference * to a thing not yet encoded. */ struct array *delayed; dynamic_buffer buf; #ifdef ENCODE_DEBUG int debug, depth; #endif }; static struct object *encoder_codec (struct encode_data *data) { struct pike_string *encoder_str; if (data->codec) return data->codec; MAKE_CONST_STRING (encoder_str, "Encoder"); return data->codec = lookup_codec (encoder_str); } /* Convert to/from forward reference ID. */ #define CONVERT_ENTRY_ID(ID) (-((ID) - COUNTER_START) - (-COUNTER_START + 1)) static void encode_value2(struct svalue *val, struct encode_data *data, int force_encode); #define addstr(s, l) low_my_binary_strcat((s), (l), &(data->buf)) #define addchar(t) low_my_putchar((char)(t), &(data->buf)) /* Code a pike string */ #if PIKE_BYTEORDER == 4321 #define ENCODE_DATA(S) \ addstr( (S)->str, (S)->len << (S)->size_shift ); #else #define ENCODE_DATA(S) \ switch((S)->size_shift) \ { \ case 1: \ for(q=0;q<(S)->len;q++) { \ INT16 s=htons( STR1(S)[q] ); \ addstr( (char *)&s, sizeof(s)); \ } \ break; \ case 2: \ for(q=0;q<(S)->len;q++) { \ INT32 s=htonl( STR2(S)[q] ); \ addstr( (char *)&s, sizeof(s)); \ } \ break; \ case 0: /* Silence clang warning */ \ break; \ } #endif #define adddata(S) do { \ if((S)->size_shift) \ { \ int q; \ code_entry(TAG_STRING,-1, data); \ code_entry((S)->size_shift, (S)->len, data); \ ENCODE_DATA(S); \ }else{ \ code_entry(TAG_STRING, (S)->len, data); \ addstr((char *)((S)->str),(S)->len); \ } \ }while(0) #define adddata2(s,l) addstr((char *)(s),(l) * sizeof((s)[0])); #ifdef ENCODE_DEBUG /* NOTE: Fix when type encodings change. */ static int tag_to_type(int tag) { if (tag == TAG_FLOAT) return T_FLOAT; if (tag == TAG_TYPE) return T_TYPE; if (tag <= MAX_TYPE) return tag ^ MIN_REF_TYPE; return tag; } #endif /* Let's cram those bits... */ static void code_entry(int tag, INT64 num, struct encode_data *data) { int t; EDB(5, fprintf(stderr,"%*sencode: code_entry(tag=%d (%s), num=%ld)\n", data->depth, "", tag, get_name_of_type(tag_to_type(tag)), (long)num) ); if(num<0) { tag |= TAG_NEG; num = ~num; } if(num < MAX_SMALL) { tag |= TAG_SMALL | (num << SIZE_SHIFT); addchar((char)tag); return; }else{ num -= MAX_SMALL; } /* NB: There's only space for two bits of length info. */ for(t = 0; (size_t)t < 3; t++) { if(num >= (((INT64)256) << (t<<3))) num -= (((INT64)256) << (t<<3)); else break; } tag |= t << SIZE_SHIFT; addchar((char)tag); switch(t) { #if 0 case 7: addchar(DO_NOT_WARN((char)((num >> 56)&0xff))); case 6: addchar(DO_NOT_WARN((char)((num >> 48)&0xff))); case 5: addchar(DO_NOT_WARN((char)((num >> 40)&0xff))); case 4: addchar(DO_NOT_WARN((char)((num >> 32)&0xff))); #endif /* 0 */ case 3: addchar(DO_NOT_WARN((char)((num >> 24)&0xff))); case 2: addchar(DO_NOT_WARN((char)((num >> 16)&0xff))); case 1: addchar(DO_NOT_WARN((char)((num >> 8)&0xff))); case 0: addchar(DO_NOT_WARN((char)(num&0xff))); } } static void code_number(ptrdiff_t num, struct encode_data *data) { EDB(5, fprintf(stderr, "%*scode_number(%d)\n", data->depth, "", num)); code_entry(DO_NOT_WARN(num & 15), num >> 4, data); } /* NOTE: Take care to encode it exactly as the corresponing * type string would have been encoded (cf T_FUNCTION, T_MANY, * T_STRING, PIKE_T_NSTRING). */ static void encode_type(struct pike_type *t, struct encode_data *data) { one_more_type: if (t->type == T_MANY) { addchar(T_FUNCTION ^ MIN_REF_TYPE); addchar(T_MANY); } else if (t->type == T_STRING) { if (t->car == int_type_string) { addchar(T_STRING ^ MIN_REF_TYPE); } else { /* Narrow string */ addchar(PIKE_T_NSTRING); encode_type(t->car, data); } return; } else if (t->type <= MAX_TYPE) { addchar(t->type ^ MIN_REF_TYPE); } else { addchar(t->type); } switch(t->type) { default: Pike_fatal("error in type tree: %d.\n", t->type); /*NOTREACHED*/ break; case PIKE_T_ATTRIBUTE: /* FIXME: Strip this in compat mode. */ case PIKE_T_NAME: { struct svalue sval; SET_SVAL(sval, PIKE_T_STRING, 0, string, (void *)t->car); encode_value2(&sval, data, 0); } t=t->cdr; goto one_more_type; case T_ASSIGN: { ptrdiff_t marker = CAR_TO_INT(t); if ((marker < 0) || (marker > 9)) { Pike_fatal("Bad assign marker: %ld\n", (long)marker); } addchar('0' + marker); t = t->cdr; } goto one_more_type; case T_FUNCTION: while(t->type == T_FUNCTION) { encode_type(t->car, data); t = t->cdr; } addchar(T_MANY); /* FALL_THROUGH */ case T_MANY: encode_type(t->car, data); t = t->cdr; goto one_more_type; case T_SCOPE: { ptrdiff_t val = CAR_TO_INT(t); addchar(val & 0xff); } t = t->cdr; goto one_more_type; case T_MAPPING: case T_OR: case T_AND: encode_type(t->car, data); t = t->cdr; goto one_more_type; case T_TYPE: case T_PROGRAM: case T_ARRAY: case T_MULTISET: case T_NOT: t = t->car; goto one_more_type; case T_INT: { ptrdiff_t val; val = CAR_TO_INT(t); addchar((val >> 24)&0xff); addchar((val >> 16)&0xff); addchar((val >> 8)&0xff); addchar(val & 0xff); val = CDR_TO_INT(t); addchar((val >> 24)&0xff); addchar((val >> 16)&0xff); addchar((val >> 8)&0xff); addchar(val & 0xff); } break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': case T_FLOAT: case T_MIXED: case T_ZERO: case T_VOID: case PIKE_T_UNKNOWN: break; case T_OBJECT: { addchar(CAR_TO_INT(t)); if(t->cdr) { ptrdiff_t id = CDR_TO_INT(t); if( id >= PROG_DYNAMIC_ID_START ) { struct program *p=id_to_program(id); if(p) { ref_push_program(p); }else{ push_int(0); } } else push_int( id ); }else{ push_int(0); } /* If it's a program that should be encoded recursively then we * must delay it. Consider: * * class A {B b;} * class B {inherit A;} * * We can't dump B when the type is encountered inside A, since * upon decode B won't have a complete A to inherit then. */ encode_value2(Pike_sp-1, data, 0); pop_stack(); break; } } } /* force_encode == 0: Maybe dump the thing later, and only a forward * reference here (applies to programs only). * * force_encode == 1: Dump the thing now. * * force_encode == 2: A forward reference has been encoded to this * thing. Now it's time to dump it. */ static void encode_value2(struct svalue *val, struct encode_data *data, int force_encode) #ifdef PIKE_DEBUG #undef encode_value2 #define encode_value2(X,Y,Z) do { \ struct svalue *_=Pike_sp; \ struct svalue *X_ = (X); \ encode_value2_(X_,Y,Z); \ if(Pike_sp != _) { \ fprintf(stderr, "Stack error when encoding:\n"); \ print_svalue(stderr, X_); \ fprintf(stderr, "\n"); \ if (TYPEOF(*X_) == T_PROGRAM) { \ dump_program_tables(X_->u.program, 2); \ } \ Pike_fatal("encode_value2() failed %p != %p!\n", \ Pike_sp, _); \ } \ } while(0) #endif { static struct svalue dested = SVALUE_INIT (T_INT, NUMBER_DESTRUCTED, 0); INT32 i; struct svalue *tmp; struct svalue entry_id; #ifdef ENCODE_DEBUG data->depth += 2; #endif if((TYPEOF(*val) == T_OBJECT || (TYPEOF(*val) == T_FUNCTION && SUBTYPEOF(*val) != FUNCTION_BUILTIN)) && !val->u.object->prog) val = &dested; if((tmp=low_mapping_lookup(data->encoded, val))) { entry_id = *tmp; /* It's always a small integer. */ if (entry_id.u.integer < COUNTER_START) entry_id.u.integer = CONVERT_ENTRY_ID (entry_id.u.integer); if (force_encode && tmp->u.integer < COUNTER_START) { EDB(1, fprintf(stderr, "%*sEncoding delayed thing to <%d>: ", data->depth, "", entry_id.u.integer); if(data->debug == 1) { fprintf(stderr,"TAG%d", TYPEOF(*val)); }else{ print_svalue(stderr, val); } fputc('\n', stderr);); code_entry (TAG_DELAYED, entry_id.u.integer, data); tmp->u.integer = entry_id.u.integer; } else { EDB(1,fprintf(stderr, "%*sEncoding TAG_AGAIN from <%d>\n", data->depth, "", entry_id.u.integer)); code_entry(TAG_AGAIN, entry_id.u.integer, data); goto encode_done; } }else { #ifdef PIKE_DEBUG if (force_encode == 2) Pike_fatal ("Didn't find old entry for delay encoded thing.\n"); #endif if (TYPEOF(*val) != T_TYPE) { entry_id = data->counter; /* It's always a small integer. */ EDB(1,fprintf(stderr, "%*sEncoding to <%d>: ", data->depth, "", entry_id.u.integer); if(data->debug == 1) { fprintf(stderr,"TAG%d", TYPEOF(*val)); }else{ print_svalue(stderr, val); } fputc('\n', stderr);); if( TYPEOF(*val) < MIN_REF_TYPE || val->u.dummy->refs > 1 ) mapping_insert(data->encoded, val, &entry_id); data->counter.u.integer++; } } switch(TYPEOF(*val)) { case T_INT: /* NOTE: Doesn't encode NUMBER_UNDEFINED et al. */ { INT_TYPE i=val->u.integer; #if SIZEOF_INT_TYPE > 4 if (i != (INT32)i) { MP_INT tmp; /* Note: Assumes sizeof_int_type is a multiple of 8. */ #if (SIZEOF_INT_TYPE > SIZEOF_LONG) || (SIZEOF_INT_TYPE&7) # error Assumption about size of int type not true. #endif char buffer[16*(SIZEOF_INT_TYPE/8)]; size_t l; /* Note: conversion to base 36 could be done directly here using / and % instead. Doing it like this is actually only slightly slower, however, and saves on code size. */ mpz_init_set_si( &tmp, i ); mpz_get_str( buffer, 36, &tmp ); mpz_clear( &tmp ); l = strlen(buffer); code_entry(TAG_OBJECT, 2, data); code_entry(TAG_STRING, l, data); addstr(buffer,l); } else #endif code_entry(TAG_INT, i, data); } break; case T_STRING: adddata(val->u.string); break; case T_TYPE: /* NOTE: Types are added to the encoded mapping AFTER they have * been encoded, to simplify decoding. */ if (data->canonic) Pike_error("Canonical encoding of the type type not supported.\n"); code_entry(TAG_TYPE, 0, data); /* Type encoding #0 */ encode_type(val->u.type, data); EDB(2,fprintf(stderr, "%*sEncoded type to <%d>: ", data->depth, "", data->counter.u.integer); print_svalue(stderr, val); fputc('\n', stderr);); mapping_insert(data->encoded, val, &data->counter); data->counter.u.integer++; break; case T_FLOAT: { double d = val->u.float_number; #define Pike_FP_SNAN -4 /* Signal Not A Number */ #define Pike_FP_QNAN -3 /* Quiet Not A Number */ #define Pike_FP_NINF -2 /* Negative infinity */ #define Pike_FP_PINF -1 /* Positive infinity */ #define Pike_FP_ZERO 0 /* Backwards compatible zero */ #define Pike_FP_NZERO 1 /* Negative Zero */ #define Pike_FP_PZERO 0 /* Positive zero */ #define Pike_FP_UNKNOWN -4711 /* Positive zero */ #ifdef HAVE_FPCLASS switch(fpclass(d)) { case FP_SNAN: code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,Pike_FP_SNAN,data); break; case FP_QNAN: code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,Pike_FP_QNAN,data); break; case FP_NINF: code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,Pike_FP_NINF,data); break; case FP_PINF: code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,Pike_FP_PINF,data); break; case FP_NZERO: code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,Pike_FP_NZERO,data); break; case FP_PZERO: code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,Pike_FP_ZERO,data); /* normal zero */ break; /* Ugly, but switch gobbles breaks -Hubbe */ default: goto encode_normal_float; } break; encode_normal_float: #else { int pike_ftype=Pike_FP_UNKNOWN; #ifdef HAVE_ISINF if(isinf(d)) pike_ftype=Pike_FP_PINF; else #endif #ifdef HAVE_ISNAN if(isnan(d)) { pike_ftype=Pike_FP_SNAN; } else #endif #ifdef HAVE_ISZERO if(iszero(d)) pike_ftype=Pike_FP_PZERO; else #endif #ifdef HAVE_FINITE if(!finite(d)) pike_ftype=Pike_FP_PINF; #endif ; /* Terminate any remaining else */ if( #ifdef HAVE_SIGNBIT signbit(d) #else d<0.0 #endif ) { switch(pike_ftype) { case Pike_FP_PINF: pike_ftype=Pike_FP_NINF; break; case Pike_FP_PZERO: pike_ftype=Pike_FP_NZERO; break; } } if(pike_ftype != Pike_FP_UNKNOWN) { code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,pike_ftype,data); break; } } #endif if(d == 0.0) { code_entry(TAG_FLOAT,0,data); code_entry(TAG_FLOAT,0,data); }else{ INT64 x; int y; double tmp; tmp = frexp(d, &y); x = DO_NOT_WARN((INT64)((((INT64)1)<<(sizeof(INT64)*8 - 2))*tmp)); y -= sizeof(INT64)*8 - 2; EDB(2,fprintf(stderr, "Encoding float... tmp: %10g, x: 0x%016llx, y: %d\n", tmp, x, y)); #if 0 if (x && !(x & 0xffffffffUL)) { #endif /* 0 */ x >>= 32; y += 32; EDB(2,fprintf(stderr, "Reducing float... x: 0x%08llx, y: %d\n", x, y)); #if 0 } #endif /* 0 */ #if 0 while(x && y && !(x&1)) { x>>=1; y++; } #endif code_entry(TAG_FLOAT,x,data); code_entry(TAG_FLOAT,y,data); } break; } case T_ARRAY: code_entry(TAG_ARRAY, val->u.array->size, data); for(i=0; i<val->u.array->size; i++) encode_value2(ITEM(val->u.array)+i, data, 0); break; case T_MAPPING: check_stack(2); ref_push_mapping(val->u.mapping); f_indices(1); ref_push_mapping(val->u.mapping); f_values(1); if (data->canonic) { INT32 *order; if (val->u.mapping->data->ind_types & ~(BIT_BASIC & ~BIT_TYPE)) { mapping_fix_type_field(val->u.mapping); if (val->u.mapping->data->ind_types & ~(BIT_BASIC & ~BIT_TYPE)) /* This doesn't let bignums through. That's necessary as * long as they aren't handled deterministically by the * sort function. */ /* They should be handled deterministically now - Hubbe */ Pike_error("Canonical encoding requires basic types in indices.\n"); } order = get_switch_order(Pike_sp[-2].u.array); order_array(Pike_sp[-2].u.array, order); order_array(Pike_sp[-1].u.array, order); free(order); } code_entry(TAG_MAPPING, Pike_sp[-2].u.array->size,data); for(i=0; i<Pike_sp[-2].u.array->size; i++) { encode_value2(ITEM(Pike_sp[-2].u.array)+i, data, 0); /* indices */ encode_value2(ITEM(Pike_sp[-1].u.array)+i, data, 0); /* values */ } pop_n_elems(2); /* FIXME: What about flags? */ break; case T_MULTISET: { struct multiset *l = val->u.multiset; if (TYPEOF(*multiset_get_cmp_less(l)) != T_INT) Pike_error ("FIXME: Encoding of multisets with " "custom sort function not yet implemented.\n"); else { /* Encode valueless multisets without compare functions in a * compatible way. */ code_entry(TAG_MULTISET, multiset_sizeof (l), data); if (data->canonic) { INT32 *order; if (multiset_ind_types(l) & ~(BIT_BASIC & ~BIT_TYPE)) { multiset_fix_type_field(l); if (multiset_ind_types(l) & ~(BIT_BASIC & ~BIT_TYPE)) /* This doesn't let bignums through. That's necessary as * long as they aren't handled deterministically by the * sort function. */ Pike_error("Canonical encoding requires basic types in indices.\n"); } check_stack(1); push_array(multiset_indices(l)); order = get_switch_order(Pike_sp[-1].u.array); order_array(Pike_sp[-1].u.array, order); free(order); for (i = 0; i < Pike_sp[-1].u.array->size; i++) encode_value2(ITEM(Pike_sp[-1].u.array)+i, data, 0); pop_stack(); } else { struct svalue ind; union msnode *node = low_multiset_first (l->msd); for (; node; node = low_multiset_next (node)) encode_value2 (low_use_multiset_index (node, ind), data, 0); } } break; } case T_OBJECT: check_stack(1); /* This could be implemented a lot more generic, * but that will have to wait until next time. /Hubbe */ if(is_bignum_object(val->u.object)) { MP_INT *i = (MP_INT*)val->u.object->storage; char *buffer; size_t l; buffer = xalloc(mpz_sizeinbase(i, 36)+2); mpz_get_str( buffer, 36, i ); l = strlen(buffer); code_entry(TAG_OBJECT, 2, data); code_entry(TAG_STRING, l, data); addstr(buffer,l); free(buffer); break; } if (data->canonic) Pike_error("Canonical encoding of objects not supported.\n"); push_svalue(val); apply(encoder_codec (data), "nameof", 1); EDB(5, fprintf(stderr, "%*s->nameof: ", data->depth, ""); print_svalue(stderr, Pike_sp-1); fputc('\n', stderr);); switch(TYPEOF(Pike_sp[-1])) { case T_INT: if(SUBTYPEOF(Pike_sp[-1]) == NUMBER_UNDEFINED) { int to_change = data->buf.s.len; struct svalue tmp = entry_id; EDB(5,fprintf(stderr, "%*s(UNDEFINED)\n", data->depth, "")); if (SUBTYPEOF(*val)) { /* Subtyped object. * * Encode the subtype, and then try encoding the plain object. */ code_entry(TAG_OBJECT, 4, data); code_number(SUBTYPEOF(*val), data); pop_stack(); ref_push_object(val->u.object); break; } /* We have to remove ourself from the cache */ map_delete(data->encoded, val); pop_stack(); push_svalue(val); f_object_program(1); /* Code the program */ code_entry(TAG_OBJECT, 3,data); encode_value2(Pike_sp-1, data, 1); pop_stack(); push_svalue(val); /* If we do not exist in cache, use backwards- * compatible method, otherwise use newfangled * style=3. -Hubbe */ if(!low_mapping_lookup(data->encoded, val)) { int fun; EDB(1,fprintf(stderr, "%*sZapping 3 -> 1 in TAG_OBJECT\n", data->depth, "")); /* This causes the code_entry above to * become: code_entry(TAG_OBJECT, 1, data); * -Hubbe */ data->buf.s.str[to_change] = 99; fun = find_identifier("encode_object", encoder_codec (data)->prog); if (fun < 0) Pike_error("Cannot encode objects without an " "\"encode_object\" function in the codec.\n"); apply_low(data->codec,fun,1); /* Put value back in cache for future reference -Hubbe */ mapping_insert(data->encoded, val, &tmp); } break; } /* FALL THROUGH */ default: code_entry(TAG_OBJECT, 0,data); break; } encode_value2(Pike_sp-1, data, 0); pop_stack(); break; case T_FUNCTION: /* FIXME: Ought to have special treatment of trampolines. */ if (data->canonic) Pike_error("Canonical encoding of functions not supported.\n"); check_stack(1); push_svalue(val); apply(encoder_codec (data),"nameof", 1); if(TYPEOF(Pike_sp[-1]) == T_INT && SUBTYPEOF(Pike_sp[-1]) == NUMBER_UNDEFINED) { if(SUBTYPEOF(*val) != FUNCTION_BUILTIN) { if(really_low_find_shared_string_identifier( ID_FROM_INT(val->u.object->prog, SUBTYPEOF(*val))->name, val->u.object->prog, SEE_PROTECTED|SEE_PRIVATE) == SUBTYPEOF(*val)) { /* We have to remove ourself from the cache for now */ struct svalue tmp = entry_id; map_delete(data->encoded, val); code_entry(TAG_FUNCTION, 1, data); ref_push_object(val->u.object); encode_value2(Pike_sp-1, data, 0); ref_push_string(ID_FROM_INT(val->u.object->prog, SUBTYPEOF(*val))->name); encode_value2(Pike_sp-1, data, 0); pop_n_elems(3); /* Put value back in cache */ mapping_insert(data->encoded, val, &tmp); goto encode_done; } else { /* FIXME: Encode the object, the inherit and the name. */ Pike_error("Cannot encode overloaded functions (yet).\n"); } } Pike_error("Cannot encode builtin functions.\n"); } code_entry(TAG_FUNCTION, 0, data); encode_value2(Pike_sp-1, data, 0); pop_stack(); break; case T_PROGRAM: { int d; if (val->u.program->id < PROG_DYNAMIC_ID_START) { code_entry(TAG_PROGRAM, 3, data); push_int(val->u.program->id); encode_value2(Pike_sp-1, data, 0); pop_stack(); break; } if (data->canonic) Pike_error("Canonical encoding of programs not supported.\n"); if (!(val->u.program->flags & PROGRAM_FIXED)) Pike_error("Encoding of unfixated programs not supported.\n"); check_stack(1); push_svalue(val); apply(encoder_codec (data),"nameof", 1); if(TYPEOF(Pike_sp[-1]) == TYPEOF(*val)) Pike_error("Error in master()->nameof(), same type returned.\n"); if(TYPEOF(Pike_sp[-1]) == T_INT && SUBTYPEOF(Pike_sp[-1]) == NUMBER_UNDEFINED) { struct program *p=val->u.program; debug_malloc_touch(p); pop_stack(); if( (p->flags & PROGRAM_HAS_C_METHODS) || p->event_handler ) { int has_local_c_methods = 0; for (d = 0; d < p->num_identifiers; d++) { struct identifier *id = p->identifiers + d; if (IDENTIFIER_IS_C_FUNCTION(id->identifier_flags) && !low_is_variant_dispatcher(id)) { has_local_c_methods = 1; break; } } if (has_local_c_methods) { if(p->parent) { /* We have to remove ourselves from the cache for now */ struct svalue tmp = entry_id; EDB(1, fprintf(stderr, "%*sencode: encoding C program via parent.\n", data->depth, "")); map_delete(data->encoded, val); code_entry(TAG_PROGRAM, 2, data); ref_push_program(p->parent); encode_value2(Pike_sp-1, data, 0); ref_push_program(p); f_function_name(1); #if 0 if(TYPEOF(Pike_sp[-1]) == PIKE_T_INT) Pike_error("Cannot encode C programs.\n"); #endif encode_value2(Pike_sp-1, data, 0); pop_n_elems(2); /* Put value back in cache */ mapping_insert(data->encoded, val, &tmp); goto encode_done; } if( p->event_handler ) Pike_error("Cannot encode programs with event handlers.\n"); #if 0 Pike_error("Cannot encode C programs.\n"); #endif } else { EDB(1, fprintf(stderr, "%*sencode: encoding program overloading a C program.\n", data->depth, "")); } } /* Portable encoding (4 and 5). */ if (!force_encode) { /* Encode later (5). */ EDB(1, fprintf(stderr, "%*sencode: delayed encoding of program\n", data->depth, "")); code_entry (TAG_PROGRAM, 5, data); data->delayed = append_array (data->delayed, val); tmp = low_mapping_lookup (data->encoded, val); if (!tmp) Pike_error("Internal error in delayed encoder of programs.\n"); tmp->u.integer = CONVERT_ENTRY_ID (tmp->u.integer); goto encode_done; } EDB(1, fprintf(stderr, "%*sencode: encoding program in new style\n", data->depth, "")); code_entry(TAG_PROGRAM, 4, data); /* Byte-order. */ code_number(PIKE_BYTEORDER, data); /* flags */ code_number(p->flags,data); /* version */ push_compact_version(); encode_value2(Pike_sp-1, data, 0); pop_stack(); /* parent */ if (p->parent) { ref_push_program(p->parent); } else { push_int(0); } encode_value2(Pike_sp-1, data, 0); pop_stack(); /* num_* */ #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) \ code_number( p->PIKE_CONCAT(num_,NAME), data); #include "program_areas.h" /* Byte-code method */ #ifdef PIKE_PORTABLE_BYTECODE code_number(PIKE_BYTECODE_PORTABLE, data); #else /* !PIKE_PORTABLE_BYTECODE */ code_number(PIKE_BYTECODE_METHOD, data); #ifdef PIKE_USE_MACHINE_CODE /* Add the checksum of the instrs array. */ code_number(instrs_checksum, data); #endif /* PIKE_USE_MACHINE_CODE */ /* program */ #ifdef ENCODE_PROGRAM #ifdef PIKE_DEBUG { ptrdiff_t bufpos = data->buf.s.len; #endif /* PIKE_DEBUG */ ENCODE_PROGRAM(p, &(data->buf)); #ifdef PIKE_DEBUG if (p->num_program * sizeof(p->program[0]) != data->buf.s.len - bufpos) { Pike_fatal("ENCODE_PROGRAM() failed:\n" "Encoded data len: %ld\n" "Expected data len: %ld\n", DO_NOT_WARN((long)(p->num_program * sizeof(p->program[0]))), DO_NOT_WARN((long)(data->buf.s.len - bufpos))); } } #endif /* PIKE_DEBUG */ #else /* !ENCODE_PROGRAM */ adddata2(p->program, p->num_program); #endif /* ENCODE_PROGRAM */ /* relocations */ for(d=0; d<(int)p->num_relocations; d++) { code_number(p->relocations[d], data); } /* linenumbers */ adddata2(p->linenumbers, p->num_linenumbers); #endif /* PIKE_PORTABLE_BYTECODE */ { struct svalue str_sval; SET_SVAL(str_sval, T_STRING, 0, string, NULL); /* strings */ for(d=0;d<p->num_strings;d++) { str_sval.u.string = p->strings[d]; encode_value2(&str_sval, data, 0); } } EDB(5, dump_program_tables(p, data->depth)); #ifdef PIKE_PORTABLE_BYTECODE /* Encode the efun constants since they are needed by the optimizer. */ { struct svalue str_sval; SET_SVAL(str_sval, T_STRING, 0, string, NULL); /* constants */ for(d=0;d<p->num_constants;d++) { if ((TYPEOF(p->constants[d].sval) == T_FUNCTION) && (SUBTYPEOF(p->constants[d].sval) == FUNCTION_BUILTIN)) { code_number(ID_ENTRY_EFUN_CONSTANT, data); } else if (TYPEOF(p->constants[d].sval) == T_TYPE) { code_number(ID_ENTRY_TYPE_CONSTANT, data); } else { continue; } code_number(d, data); /* value */ encode_value2(&p->constants[d].sval, data, 0); /* name */ #if 0 if (p->constants[d].name) { str_sval.u.string = p->constants[d].name; encode_value2(&str_sval, data, 0); } else { #endif /* 0 */ push_int(0); encode_value2(Pike_sp-1, data, 0); dmalloc_touch_svalue(Pike_sp-1); Pike_sp--; #if 0 } #endif /* 0 */ } } #endif /* PIKE_PORTABLE_BYTECODE */ /* Dump the identifiers in a portable manner... */ { int inherit_num = 1; struct svalue str_sval; char *id_dumped = alloca(p->num_identifiers); int d_min = 0; memset(id_dumped,0,p->num_identifiers); SET_SVAL(str_sval, T_STRING, 0, string, NULL); EDB(2, fprintf(stderr, "%*sencode: encoding references\n", data->depth, "")); #ifdef ENCODE_DEBUG data->depth += 2; #endif /* NOTE: d is incremented by hand inside the loop. */ for (d=0; d < p->num_identifier_references;) { int d_max = p->num_identifier_references; /* Find insertion point of next inherit. */ if (inherit_num < p->num_inherits) { d_max = p->inherits[inherit_num].identifier_ref_offset; } EDB (4, fprintf (stderr, "%*sencode: inherit_num: %d, d_max: %d\n", data->depth, "", inherit_num, d_max);); /* Fix locally defined identifiers. */ for (; d < d_max; d++) { struct reference *ref = p->identifier_references + d; struct inherit *inh = INHERIT_FROM_PTR(p, ref); struct identifier *id = ID_FROM_PTR(p, ref); /* Skip identifiers that haven't been overloaded. */ if (ref->id_flags & ID_INHERITED) { if ((ref->id_flags & (ID_VARIANT|ID_HIDDEN)) == ID_VARIANT) { /* Find the dispatcher. */ int i = really_low_find_shared_string_identifier(id->name, p, SEE_PROTECTED|SEE_PRIVATE); /* NB: We use the id_dumped flag for the * dispatcher to mark whether we have * dumped the first variant of this * name in this program. */ if ((i >= 0) && !is_variant_dispatcher(p, i) && !PTR_FROM_INT(p, i)->inherit_offset) { /* Overloaded in this program. * * Make sure later variants don't clear this one. */ id_dumped[PTR_FROM_INT(p, i)->identifier_offset] = 1; } } continue; } /* Skip getter/setter variables; they get pulled in * by their respective functions. */ if (!IDENTIFIER_IS_ALIAS(id->identifier_flags) && IDENTIFIER_IS_VARIABLE(id->identifier_flags) && (id->run_time_type == PIKE_T_GET_SET)) continue; EDB(3, fprintf(stderr, "%*sencoding identifier ref %d: %4x \"%s\"\n", data->depth, "", d, id->identifier_flags, id->name->str)); #ifdef ENCODE_DEBUG data->depth += 2; #endif /* Variable, constant or function. */ if (ref->inherit_offset || ref->id_flags & ID_HIDDEN) { int ref_no = -1; /* Explicit reference to inherited symbol. */ EDB(3, fprintf(stderr, "%*sencode: encoding raw reference\n", data->depth, "")); code_number(ID_ENTRY_RAW, data); code_number(ref->id_flags, data); /* inherit_offset */ code_number(ref->inherit_offset, data); /* identifier_offset */ /* Find the corresponding identifier reference * in the inherit. */ { struct program *p2 = p->inherits[ref->inherit_offset].prog; int i; debug_malloc_touch(p); debug_malloc_touch(p2); for (i=0; i < p2->num_identifier_references; i++) { struct reference *ref2 = p2->identifier_references + i; if (!(ref2->inherit_offset) && !(ref2->id_flags & ID_HIDDEN) && (ref2->identifier_offset == ref->identifier_offset)) { ref_no = i; break; } } } if (ref_no == -1) { Pike_error("Failed to reverse explicit reference\n"); } code_number(ref_no, data); } else { int gs_flags = -1; if (id_dumped[ref->identifier_offset]) { EDB(3, fprintf(stderr, "%*sencode: already encoded reference\n", data->depth, "")); goto next_identifier_ref; } id_dumped[ref->identifier_offset] = 1; if (id->name && (id->name->len>3) && (index_shared_string(id->name, 0) == '`') && (index_shared_string(id->name, 1) == '-') && (index_shared_string(id->name, 2) == '>')) { /* Potential old-style getter/setter. */ struct pike_string *symbol = NULL; if (index_shared_string(id->name, id->name->len-1) != '=') { /* Getter callback. */ symbol = string_slice(id->name, 3, id->name->len - 3); } else if (id->name->len > 4) { /* Setter callback. */ symbol = string_slice(id->name, 3, id->name->len - 4); } if (symbol) { int i = really_low_find_shared_string_identifier(symbol, p, SEE_PROTECTED|SEE_PRIVATE); if (i >= 0) { /* Found the symbol. */ gs_flags = PTR_FROM_INT(p, i)->id_flags; } free_string(symbol); } } else if (id->name && (id->name->len>1) && (index_shared_string(id->name, 0) == '`') && ((((unsigned)index_shared_string(id->name, 1)) >= 256) || isidchar(index_shared_string(id->name, 1)))) { /* New-style getter/setter. */ struct pike_string *symbol = NULL; if (index_shared_string(id->name, id->name->len-1) != '=') { /* Getter callback. */ symbol = string_slice(id->name, 1, id->name->len - 1); } else if (id->name->len > 2) { /* Setter callback. */ symbol = string_slice(id->name, 1, id->name->len - 2); } if (symbol) { int i = really_low_find_shared_string_identifier(symbol, p, SEE_PROTECTED|SEE_PRIVATE); if (i >= 0) { /* Found the symbol. */ gs_flags = PTR_FROM_INT(p, i)->id_flags; } free_string(symbol); } } else if (ref->id_flags & ID_VARIANT) { /* Find the dispatcher. */ int i = really_low_find_shared_string_identifier(id->name, p, SEE_PROTECTED|SEE_PRIVATE); /* NB: We use the id_dumped flag for the * dispatcher to mark whether we have * dumped the first variant of this * name in this program. */ if ((i < 0) || !is_variant_dispatcher(p, i)) { Pike_error("Failed to find dispatcher for inherited " "variant function: %S\n", id->name); } if (PTR_FROM_INT(p, i)->inherit_offset) { Pike_error("Dispatcher for variant function %S " "is inherited.\n", id->name); } gs_flags = ref->id_flags & PTR_FROM_INT(p, i)->id_flags; if (id_dumped[PTR_FROM_INT(p, i)->identifier_offset]) { /* Either already dumped, or the dispatcher is in * front of us, which indicates that we are overloading * an inherited function with a variant. */ gs_flags |= ID_VARIANT; } else { /* First variant. */ id_dumped[PTR_FROM_INT(p, i)->identifier_offset] = 1; } } if (IDENTIFIER_IS_ALIAS(id->identifier_flags)) { if ((!id->func.ext_ref.depth) && IDENTIFIER_IS_VARIABLE(id->identifier_flags)) { struct identifier *other = ID_FROM_INT(p, id->func.ext_ref.id); if (other->name == id->name) { /* Let define_variable() handle the decoding. */ EDB(3, fprintf(stderr, "%*sencode: encoding aliased variable\n", data->depth, "")); goto encode_entry_variable; } } EDB(3, fprintf(stderr, "%*sencode: encoding alias\n", data->depth, "")); code_number(ID_ENTRY_ALIAS, data); /* flags */ code_number(ref->id_flags, data); /* name */ str_sval.u.string = id->name; encode_value2(&str_sval, data, 0); /* type */ ref_push_type_value(id->type); encode_value2(Pike_sp-1, data, 0); pop_stack(); /* filename */ code_number(id->filename_strno, data); /* linenumber */ code_number(id->linenumber, data); /* depth */ code_number(id->func.ext_ref.depth, data); /* refno */ code_number(id->func.ext_ref.id, data); } else switch (id->identifier_flags & IDENTIFIER_TYPE_MASK) { case IDENTIFIER_CONSTANT: EDB(3, fprintf(stderr, "%*sencode: encoding constant\n", data->depth, "")); code_number(ID_ENTRY_CONSTANT, data); if (gs_flags >= 0) { code_number(gs_flags, data); } else { code_number(ref->id_flags, data); } /* name */ str_sval.u.string = id->name; encode_value2(&str_sval, data, 0); /* type */ ref_push_type_value(id->type); encode_value2(Pike_sp-1, data, 0); pop_stack(); /* filename */ code_number(id->filename_strno, data); /* linenumber */ code_number(id->linenumber, data); /* offset */ code_number(id->func.const_info.offset, data); /* run-time type */ code_number(id->run_time_type, data); /* opt flags */ code_number(id->opt_flags, data); break; case IDENTIFIER_PIKE_FUNCTION: EDB(3, fprintf(stderr, "%*sencode: encoding function\n", data->depth, "")); code_number(ID_ENTRY_FUNCTION, data); if (gs_flags >= 0) { code_number(gs_flags, data); } else { code_number(ref->id_flags, data); } /* name */ str_sval.u.string = id->name; encode_value2(&str_sval, data, 0); /* type */ ref_push_type_value(id->type); encode_value2(Pike_sp-1, data, 0); pop_stack(); /* filename */ code_number(id->filename_strno, data); /* linenumber */ code_number(id->linenumber, data); /* func_flags (aka identifier_flags) */ code_number(id->identifier_flags, data); /* func */ #ifdef PIKE_PORTABLE_BYTECODE if (id->func.offset >= 0) { /* Code the number of the string containing * the raw bytecode. */ code_number(read_program_data(p->program + id->func.offset, -1), data); } else { /* Prototype */ code_number(-1, data); } #else /* !PIKE_PORTABLE_BYTECODE */ code_number(id->func.offset, data); #endif /* PIKE_PORTABLE_BYTECODE */ /* opt_flags */ code_number(id->opt_flags, data); break; case IDENTIFIER_C_FUNCTION: if (is_variant_dispatcher(p, d)) { /* This is handled by end_first_pass() et all. */ /* NB: This can be reached even though id_dumped * for it gets set by the variant functions, * if it is overriding an old definition. * * Note that this means that even the first local * function must have the variant modifier (since * otherwise it would have overridden the old def * and not the dispatcher). This is handled * automatically by the use of id_dumped for the * dispatcher as marker for whether the first * variant has been added or not. */ continue; } /* Not supported. */ Pike_error("Cannot encode functions implemented in C " "(identifier=\"%S\").\n", id->name); break; case IDENTIFIER_VARIABLE: if (d < d_min) { EDB(3, fprintf(stderr, "%*sencode: Skipping overloaded variable \"%s\"\n", data->depth, "", id->name->str)); /* We still want to dump it later... */ id_dumped[ref->identifier_offset] = 0; goto next_identifier_ref; } EDB(3, fprintf(stderr, "%*sencode: encoding variable\n", data->depth, "")); encode_entry_variable: code_number(ID_ENTRY_VARIABLE, data); if (gs_flags >= 0) { code_number(gs_flags, data); } else { code_number(ref->id_flags, data); } /* name */ str_sval.u.string = id->name; encode_value2(&str_sval, data, 0); /* type */ ref_push_type_value(id->type); encode_value2(Pike_sp-1, data, 0); pop_stack(); /* filename */ code_number(id->filename_strno, data); /* linenumber */ code_number(id->linenumber, data); break; #ifdef PIKE_DEBUG default: Pike_fatal ("Unknown identifier type: 0x%04x for symbol \"%s\".\n", id->identifier_flags & IDENTIFIER_TYPE_MASK, id->name->str); #endif } } /* Identifier reference number */ code_number(d, data); next_identifier_ref: ; /* C requires a statement after lables. */ #ifdef ENCODE_DEBUG data->depth -= 2; #endif } /* Encode next inherit. */ if (inherit_num < p->num_inherits) { /* Inherit */ /* Flags that have been set by/after the inherit. */ INT16 inherit_flags_set = 0; /* Mask of flags that may have been affected by * the inherit. */ INT16 inherit_flags_mask = ~(ID_HIDDEN|ID_INHERITED); struct inherit *inh = p->inherits + inherit_num; struct reference *ref = p->identifier_references + d; int i; /* The references from this inherit stop at this point. */ d_min = inh->identifier_level + inh->prog->num_identifier_references; EDB(3, fprintf(stderr, "%*sencode: encoding inherit\n", data->depth, "")); #ifdef ENCODE_DEBUG data->depth += 2; #endif code_number(ID_ENTRY_INHERIT, data); /* Calculate id_flags */ for (i = 0; i < inh->prog->num_identifier_references; i++) { if (ref[i].inherit_offset) { INT16 id_flags = ref[i].id_flags; INT16 inh_id_flags = inh->prog->identifier_references[i].id_flags; /* Ignore identifiers that have been hidden. */ if (!(id_flags & ID_HIDDEN)) { inherit_flags_set |= id_flags & ~inh_id_flags; if (inh_id_flags & ID_PUBLIC) { /* Public symbols aren't affected by a * private inherit. */ inherit_flags_mask &= id_flags | ID_PRIVATE; } else { inherit_flags_mask &= id_flags; } } } else { /* If an inherited identifiers has been overloaded, * it can not have been a local inherit. */ inherit_flags_mask &= ~ID_LOCAL; } } EDB(5, fprintf(stderr, "%*sraw inherit_flags_set: %04x:%04x\n", data->depth, "", inherit_flags_set, inherit_flags_mask)); inherit_flags_set &= inherit_flags_mask; code_number(inherit_flags_set, data); EDB(5, fprintf(stderr, "%*sinherit_flags: %04x\n", data->depth, "", inherit_flags_set)); /* Identifier reference level at insertion. */ code_number(d_max, data); /* name */ if (!inh->name) Pike_error("Cannot encode programs with unnamed inherits.\n"); str_sval.u.string = inh->name; encode_value2(&str_sval, data, 0); /* prog */ ref_push_program(inh->prog); encode_value2(Pike_sp-1, data, 1); pop_stack(); /* parent */ if (inh->parent) { ref_push_object(inh->parent); } else { push_int(0); } encode_value2(Pike_sp-1, data, 0); pop_stack(); /* parent_identifier */ code_number(inh->parent_identifier, data); /* parent_offset */ code_number(inh->parent_offset, data); /* Number of identifier references. */ code_number(inh->prog->num_identifier_references, data); inherit_num += inh->prog->num_inherits; #ifdef ENCODE_DEBUG data->depth -= 2; #endif } } /* End-marker */ code_number(ID_ENTRY_EOT, data); #ifdef ENCODE_DEBUG data->depth -= 2; #endif } /* Encode the constant values table. */ { struct svalue str_sval; SET_SVAL(str_sval, T_STRING, 0, string, NULL); EDB(2, fprintf(stderr, "%*sencode: encoding constants\n", data->depth, "")); /* constants */ for(d=0;d<p->num_constants;d++) { EDB(5, fprintf(stderr, "%*sencode: encoding constant #%d\n", data->depth, "", d)); #ifdef PIKE_PORTABLE_BYTECODE if (((TYPEOF(p->constants[d].sval) == T_FUNCTION) && (SUBTYPEOF(p->constants[d].sval) == FUNCTION_BUILTIN)) || (TYPEOF(p->constants[d].sval) == T_TYPE)) { /* Already encoded above. */ continue; } #endif /* PIKE_PORTABLE_BYTECODE */ /* value */ encode_value2(&p->constants[d].sval, data, 0); /* name */ #if 0 if (p->constants[d].name) { str_sval.u.string = p->constants[d].name; encode_value2(&str_sval, data, 0); } else { #endif /* 0 */ push_int(0); encode_value2(Pike_sp-1, data, 0); dmalloc_touch_svalue(Pike_sp-1); Pike_sp--; #if 0 } #endif /* 0 */ } } }else{ code_entry(TAG_PROGRAM, 0, data); encode_value2(Pike_sp-1, data, 0); pop_stack(); } break; } } encode_done:; #ifdef ENCODE_DEBUG data->depth -= 2; #endif } static void free_encode_data(struct encode_data *data) { toss_buffer(& data->buf); if (data->codec) free_object (data->codec); free_mapping(data->encoded); free_array(data->delayed); } /*! @decl string encode_value(mixed value, Codec|void codec) *! *! Code a value into a string. *! *! This function takes a value, and converts it to a string. This string *! can then be saved, sent to another Pike process, packed or used in *! any way you like. When you want your value back you simply send this *! string to @[decode_value()] and it will return the value you encoded. *! *! Almost any value can be coded, mappings, floats, arrays, circular *! structures etc. *! *! If @[codec] is specified, it's used as the codec for the encode. *! If none is specified, then one is instantiated through *! @expr{master()->Encoder()@}. As a compatibility fallback, the *! master itself is used if it has no @expr{Encoder@} class. *! *! If @expr{@[codec]->nameof(o)@} returns @tt{UNDEFINED@} for an *! object, @expr{val = o->encode_object(o)@} will be called. The *! returned value will be passed to @expr{o->decode_object(o, val)@} *! when the object is decoded. *! *! @note *! *! When only simple types like int, floats, strings, mappings, *! multisets and arrays are encoded, the produced string is very *! portable between pike versions. It can at least be read by any *! later version. *! *! The portability when objects, programs and functions are involved *! depends mostly on the codec. If the byte code is encoded, i.e. *! when Pike programs are actually dumped in full, then the string *! can probably only be read by the same pike version. *! *! @seealso *! @[decode_value()], @[sprintf()], @[encode_value_canonic()] */ void f_encode_value(INT32 args) { ONERROR tmp; struct encode_data d, *data; int i; data=&d; check_all_args("encode_value", args, BIT_MIXED, BIT_VOID | BIT_OBJECT | BIT_ZERO, #ifdef ENCODE_DEBUG /* This argument is only an internal debug helper. * It's intentionally not part of the function * prototype, to keep the argument position free for * other uses in the future. */ BIT_VOID | BIT_INT, #endif 0); initialize_buf(&data->buf); data->canonic = 0; data->encoded=allocate_mapping(128); data->delayed = allocate_array (0); SET_SVAL(data->counter, T_INT, NUMBER_NUMBER, integer, COUNTER_START); #ifdef ENCODE_DEBUG data->debug = args > 2 ? Pike_sp[2-args].u.integer : 0; data->depth = -2; #endif if(args > 1 && TYPEOF(Pike_sp[1-args]) == T_OBJECT) { if (SUBTYPEOF(Pike_sp[1-args])) Pike_error("The codec may not be a subtyped object yet.\n"); data->codec=Pike_sp[1-args].u.object; add_ref (data->codec); }else{ data->codec=NULL; } SET_ONERROR(tmp, free_encode_data, data); addstr("\266ke0", 4); encode_value2(Pike_sp-args, data, 1); for (i = 0; i < data->delayed->size; i++) encode_value2 (ITEM(data->delayed) + i, data, 2); UNSET_ONERROR(tmp); if (data->codec) free_object (data->codec); free_mapping(data->encoded); free_array (data->delayed); pop_n_elems(args); push_string(low_free_buf(&data->buf)); } /*! @decl string encode_value_canonic(mixed value, object|void codec) *! *! Code a value into a string on canonical form. *! *! Takes a value and converts it to a string on canonical form, much like *! @[encode_value()]. The canonical form means that if an identical value is *! encoded, it will produce exactly the same string again, even if it's *! done at a later time and/or in another Pike process. The produced *! string is compatible with @[decode_value()]. *! *! @note *! Note that this function is more restrictive than @[encode_value()] with *! respect to the types of values it can encode. It will throw an error *! if it can't encode to a canonical form. *! *! @seealso *! @[encode_value()], @[decode_value()] */ void f_encode_value_canonic(INT32 args) { ONERROR tmp; struct encode_data d, *data; int i; data=&d; check_all_args("encode_value_canonic", args, BIT_MIXED, BIT_VOID | BIT_OBJECT | BIT_ZERO, #ifdef ENCODE_DEBUG /* This argument is only an internal debug helper. * It's intentionally not part of the function * prototype, to keep the argument position free for * other uses in the future. */ BIT_VOID | BIT_INT, #endif 0); initialize_buf(&data->buf); data->canonic = 1; data->encoded=allocate_mapping(128); data->delayed = allocate_array (0); SET_SVAL(data->counter, T_INT, NUMBER_NUMBER, integer, COUNTER_START); #ifdef ENCODE_DEBUG data->debug = args > 2 ? Pike_sp[2-args].u.integer : 0; data->depth = -2; #endif if(args > 1 && TYPEOF(Pike_sp[1-args]) == T_OBJECT) { if (SUBTYPEOF(Pike_sp[1-args])) Pike_error("The codec may not be a subtyped object yet.\n"); data->codec=Pike_sp[1-args].u.object; add_ref (data->codec); }else{ data->codec=NULL; } SET_ONERROR(tmp, free_encode_data, data); addstr("\266ke0", 4); encode_value2(Pike_sp-args, data, 1); for (i = 0; i < data->delayed->size; i++) encode_value2 (ITEM(data->delayed) + i, data, 2); UNSET_ONERROR(tmp); if (data->codec) free_object (data->codec); free_mapping(data->encoded); free_array (data->delayed); pop_n_elems(args); push_string(low_free_buf(&data->buf)); } struct unfinished_prog_link { struct unfinished_prog_link *next; struct program *prog; }; struct unfinished_obj_link { struct unfinished_obj_link *next; struct object *o; struct svalue decode_arg; }; struct decode_data { struct pike_string *data_str; unsigned char *data; ptrdiff_t len; ptrdiff_t ptr; struct mapping *decoded; struct unfinished_prog_link *unfinished_programs; struct unfinished_obj_link *unfinished_objects; struct unfinished_obj_link *unfinished_placeholders; struct svalue counter; struct object *codec; int explicit_codec; int pickyness; int pass; int delay_counter; struct pike_string *raw; struct decode_data *next; #ifdef PIKE_THREADS struct thread_state *thread_state; struct object *thread_obj; #endif #ifdef ENCODE_DEBUG int debug, depth; #endif #if TWO_PASS_DECODE_WORKS /* The delay stuff can trig a second pass through the decoder, * but it doesn't seem to really handle that. /mast */ struct Supporter supporter; #endif }; static struct object *decoder_codec (struct decode_data *data) { struct pike_string *decoder_str; if (data->codec) return data->codec; MAKE_CONST_STRING (decoder_str, "Decoder"); return data->codec = lookup_codec (decoder_str); } static void decode_value2(struct decode_data *data); static int my_extract_char(struct decode_data *data) { if(data->ptr >= data->len) Pike_error("Not enough data in string.\n"); return data->data [ data->ptr++ ]; } static DECLSPEC(noreturn) void decode_error ( struct decode_data *data, struct svalue *decoding, const char *msg, ...) ATTRIBUTE((noinline,noreturn)); static DECLSPEC(noreturn) void decode_error ( struct decode_data *data, struct svalue *decoding, const char *msg, ...) { int n = 0; va_list args; struct string_builder sb; struct object *o = fast_clone_object (decode_error_program); struct decode_error_struct *dec = (struct decode_error_struct *) (o->storage + decode_error_offset); struct generic_error_struct *gen = get_storage (o, generic_error_program); ASSERT_THREAD_SWAPPED_IN(); copy_shared_string (dec->decode_string, data->data_str); if (decoding) { push_text ("Error while decoding "); n++; push_text ("%O"); push_svalue (decoding); f_sprintf (2); n++; push_text (":\n"); n++; } else { push_text ("Decode error: "); n++; } init_string_builder (&sb, 0); va_start (args, msg); string_builder_vsprintf (&sb, msg, args); va_end (args); push_string (finish_string_builder (&sb)); n++; f_add (n); gen->error_message = (--Pike_sp)->u.string; generic_error_va (o, NULL, NULL, 0, NULL, NULL); } #define GETC() my_extract_char(data) #define DECODE(Z) do { \ EDB(5, \ fprintf(stderr,"%*sdecode(%s) at %d: ", \ data->depth,"",(Z),__LINE__)); \ what=GETC(); \ e=what>>SIZE_SHIFT; \ if(what & TAG_SMALL) { \ num=e; \ } else { \ num = 0; \ while(e-->=0) num = ((unsigned INT64)num<<8) \ + (GETC()+1); \ num += MAX_SMALL - 1; \ } \ if(what & TAG_NEG) { \ num = ~num; \ } \ EDB(5, \ fprintf(stderr,"type=%d (%s), num=%ld\n", \ (what & TAG_MASK), \ get_name_of_type(tag_to_type(what & TAG_MASK)), \ (long)num) ); \ } while (0) #define decode_entry(X,Y,Z) \ do { \ INT32 what, e; \ INT64 num; \ DECODE("decode_entry"); \ if((what & TAG_MASK) != (X)) \ decode_error(data, NULL, "Wrong bits (%d).\n", what & TAG_MASK); \ (Y)=num; \ } while(0); #if PIKE_BYTEORDER == 4321 #define BITFLIP(S) #else #define BITFLIP(S) \ switch(what) \ { \ case 1: for(e=0;e<num;e++) STR1(S)[e]=ntohs(STR1(S)[e]); break; \ case 2: for(e=0;e<num;e++) STR2(S)[e]=ntohl(STR2(S)[e]); break; \ } #endif #define get_string_data(STR,LEN, data) do { \ if((LEN) == -1) \ { \ INT32 what, e; \ INT64 num; \ ptrdiff_t sz; \ DECODE("get_string_data"); \ what &= TAG_MASK; \ if(what<0 || what>2) \ decode_error (data, NULL, "Illegal size shift %d.\n", what); \ sz = (ptrdiff_t) num << what; \ if (sz < 0) \ decode_error (data, NULL, "Illegal negative size %td.\n", sz); \ if (sz > data->len - data->ptr) \ decode_error (data, NULL, "Too large size %td (max is %td).\n", \ sz, data->len - data->ptr); \ STR=begin_wide_shared_string(num, what); \ memcpy(STR->str, data->data + data->ptr, sz); \ data->ptr += sz; \ BITFLIP(STR); \ STR=end_shared_string(STR); \ }else{ \ ptrdiff_t sz = (LEN); \ if (sz < 0) \ decode_error (data, NULL, "Illegal negative size %td.\n", sz); \ if (sz > data->len - data->ptr) \ decode_error (data, NULL, "Too large size %td (max is %td).\n", \ sz, data->len - data->ptr); \ STR=make_shared_binary_string((char *)(data->data + data->ptr), sz); \ data->ptr += sz; \ } \ }while(0) #define decode_number(X,data) do { \ INT32 what, e; \ INT64 num; \ DECODE("decode_number"); \ X=(what & TAG_MASK) | ((unsigned INT64)num<<4); \ EDB(5, fprintf(stderr, "%*s ==>%ld\n", \ data->depth, "", (long) X)); \ }while(0) \ static void restore_type_stack(struct pike_type **old_stackp) { #if 0 fprintf(stderr, "Restoring type-stack: %p => %p\n", Pike_compiler->type_stackp, old_stackp); #endif /* 0 */ #ifdef PIKE_DEBUG if (old_stackp > Pike_compiler->type_stackp) { Pike_fatal("type stack out of sync!\n"); } #endif /* PIKE_DEBUG */ while(Pike_compiler->type_stackp > old_stackp) { free_type(*(Pike_compiler->type_stackp--)); } } static void restore_type_mark(struct pike_type ***old_type_mark_stackp) { #if 0 fprintf(stderr, "Restoring type-mark: %p => %p\n", Pike_compiler->pike_type_mark_stackp, old_type_mark_stackp); #endif /* 0 */ #ifdef PIKE_DEBUG if (old_type_mark_stackp > Pike_compiler->pike_type_mark_stackp) { Pike_fatal("type Pike_interpreter.mark_stack out of sync!\n"); } #endif /* PIKE_DEBUG */ Pike_compiler->pike_type_mark_stackp = old_type_mark_stackp; } static void low_decode_type(struct decode_data *data) { /* FIXME: Probably ought to use the tag encodings too. */ int tmp; ONERROR err1; ONERROR err2; SET_ONERROR(err1, restore_type_stack, Pike_compiler->type_stackp); SET_ONERROR(err2, restore_type_mark, Pike_compiler->pike_type_mark_stackp); tmp = GETC(); if (tmp <= MAX_TYPE) tmp ^= MIN_REF_TYPE; switch(tmp) { default: decode_error(data, NULL, "Error in type string (%d).\n", tmp); /*NOTREACHED*/ break; case T_ASSIGN: tmp = GETC(); if ((tmp < '0') || (tmp > '9')) { decode_error(data, NULL, "Bad marker in type string (%d).\n", tmp); } low_decode_type(data); push_assign_type(tmp); /* Actually reverse, but they're the same */ break; case T_SCOPE: tmp = GETC(); low_decode_type(data); push_scope_type(tmp); /* Actually reverse, but they're the same */ break; case T_FUNCTION: { int narg = 0; while (GETC() != T_MANY) { data->ptr--; low_decode_type(data); narg++; } low_decode_type(data); /* Many */ low_decode_type(data); /* Return */ push_reverse_type(T_MANY); while(narg-- > 0) { push_reverse_type(T_FUNCTION); } } break; case T_MAPPING: case T_OR: case T_AND: low_decode_type(data); low_decode_type(data); push_reverse_type(tmp); break; case T_TYPE: case T_PROGRAM: case T_ARRAY: case T_MULTISET: case T_NOT: low_decode_type(data); push_type(tmp); break; case T_INT: { INT32 min=0, max=0; if(data->ptr + 8 > data->len) decode_error(data, NULL, "Not enough data.\n"); min = get_unaligned_be32(data->data + data->ptr); data->ptr += 4; max = get_unaligned_be32(data->data + data->ptr); data->ptr += 4; if (min > max) decode_error(data, NULL, "Error in int type (min (%d) > max (%d)).\n", min, max); push_int_type(min, max); } break; case T_STRING: /* Common case and compat */ push_finished_type(int_type_string); push_type(T_STRING); break; case PIKE_T_NSTRING: { low_decode_type(data); push_type(T_STRING); } break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': case T_FLOAT: case T_MIXED: case T_ZERO: case T_VOID: case PIKE_T_UNKNOWN: push_type(tmp); break; case PIKE_T_ATTRIBUTE: decode_value2(data); if (TYPEOF(Pike_sp[-1]) != PIKE_T_STRING) { decode_error(data, NULL, "Type attribute is not a string: %O\n", Pike_sp - 1); } low_decode_type(data); push_type_attribute(Pike_sp[-1].u.string); pop_stack(); break; case PIKE_T_NAME: decode_value2(data); if (TYPEOF(Pike_sp[-1]) != PIKE_T_STRING) { decode_error(data, NULL, "Type name is not a string: %O\n", Pike_sp - 1); } low_decode_type(data); push_type_name(Pike_sp[-1].u.string); pop_stack(); break; case T_OBJECT: { int flag = GETC(); decode_value2(data); switch(TYPEOF(Pike_sp[-1])) { case T_INT: push_object_type_backwards(flag, Pike_sp[-1].u.integer ); break; case T_PROGRAM: push_object_type_backwards(flag, Pike_sp[-1].u.program->id); break; case T_FUNCTION: { struct program *prog; if (SUBTYPEOF(Pike_sp[-1]) == FUNCTION_BUILTIN) { decode_error(data, NULL, "Failed to decode object type.\n"); } prog = program_from_svalue(Pike_sp-1); if (!prog) { decode_error(data, NULL, "Failed to decode object type.\n"); } debug_malloc_touch(prog); push_object_type_backwards(flag, prog->id); } break; default: decode_error(data, NULL, "Failed to decode type " "(object(%s), expected object(zero|program)).\n", get_name_of_type(TYPEOF(Pike_sp[-1]))); } pop_stack(); } } UNSET_ONERROR(err2); UNSET_ONERROR(err1); } #define SETUP_DECODE_MEMOBJ(TYPE, U, VAR, ALLOCATE,SCOUR) do { \ struct svalue *tmpptr; \ struct svalue tmp; \ if(data->pass > 1 && \ (tmpptr=low_mapping_lookup(data->decoded, & entry_id))) \ { \ tmp=*tmpptr; \ VAR=tmp.u.U; \ SCOUR; \ }else{ \ SET_SVAL(tmp, TYPE, 0, U, (VAR = ALLOCATE)); \ mapping_insert(data->decoded, & entry_id, &tmp); \ /* Since a reference to the object is stored in the mapping, we can \ * safely decrease this reference here. Thus it will be automatically \ * freed if something goes wrong. \ */ \ sub_ref(VAR); \ } \ }while(0) /* This really needs to disable threads.... */ #define decode_type(X,data) do { \ type_stack_mark(); \ low_decode_type(data); \ (X)=pop_unfinished_type(); \ } while(0) static void cleanup_new_program_decode (void *UNUSED(ignored)) { debug_malloc_touch(Pike_compiler->new_program); debug_malloc_touch(Pike_compiler->new_program->parent); /* The program is consistent enough to be freed... */ Pike_compiler->new_program->flags &= ~PROGRAM_AVOID_CHECK; end_first_pass(0); } static void restore_current_file(void *save_current_file) { struct compilation *c = THIS_COMPILATION; free_string(c->lex.current_file); c->lex.current_file = save_current_file; } /* Decode bytecode string @[string_no]. * Returns resulting offset in p->program. */ static INT32 decode_portable_bytecode(struct decode_data *data, INT32 string_no) { struct program *p = Pike_compiler->new_program; struct pike_string *bytecode; struct pike_string *current_file=NULL; INT_TYPE current_line = 0; int e; ONERROR err; debug_malloc_touch(p); if ((string_no < 0) || (string_no >= p->num_strings)) { decode_error(data, NULL, "Bad bytecode string number: %d (expected 0 - %d).\n", string_no, p->num_strings-1); } bytecode = p->strings[string_no]; if (bytecode->len % 3) { decode_error(data, NULL, "Bad bytecode string length: " "%td (expected multiple of 3).\n", bytecode->len); } init_bytecode(); SET_ONERROR(err, exit_bytecode, NULL); switch(bytecode->size_shift) { #define SIGNED_CHAR(X) X #if SIZEOF_INT_TYPE > 4 #define DO_HIGH(X) (X) #else #define DO_HIGH(X) 0 #endif /* The EMIT_BYTECODE2 macro will generate the warning * "comparison is always false due to limited range of data type" * if used on STR0. Thus, the need to have two macros here. */ #define EMIT_BYTECODE2(STR) \ if (STR(bytecode)[e] == F_FILENAME) { \ INT32 strno = STR(bytecode)[e+1]; \ if (SIGNED_CHAR(strno < 0) || \ (strno >= p->num_strings)) { \ decode_error(data, NULL, "Bad filename directive number:" \ " %d (expected 0 - %d).\n", \ strno, p->num_strings); \ } \ current_file = p->strings[strno]; \ } else if (STR(bytecode)[e] == F_LINE) { \ current_line = \ ((unsigned INT32)STR(bytecode)[e+1]) | \ DO_HIGH(((INT_TYPE)STR(bytecode)[e+2])<<32); \ } else if (!current_file) { \ decode_error(data, NULL, "Missing filename directive in " \ "byte code.\n"); \ } else if (!current_line) { \ decode_error(data, NULL, "Missing line directive in " \ "byte code.\n"); \ } else #define EMIT_BYTECODE(STR, X) do { \ for (e = 0; e < bytecode->len; e += 3) { \ X(STR) \ { \ insert_opcode2(STR(bytecode)[e], \ STR(bytecode)[e+1], \ STR(bytecode)[e+2], \ current_line, \ current_file); \ } \ } \ } while(0) case 2: EMIT_BYTECODE(STR2, EMIT_BYTECODE2); break; #undef SIGNED_CHAR #define SIGNED_CHAR(X) 0 case 1: EMIT_BYTECODE(STR1, EMIT_BYTECODE2); break; case 0: #undef EMIT_BYTECODE2 #define EMIT_BYTECODE2(X) \ if (!current_file) { \ decode_error(data, NULL, "Missing filename directive in " \ "byte code.\n"); \ } else if (!current_line) { \ decode_error(data, NULL, "Missing line directive in " \ "byte code.\n"); \ } else EMIT_BYTECODE(STR0, EMIT_BYTECODE2); break; #undef SIGNED_CHAR #undef EMIT_BYTECODE #undef EMIT_BYTECODE2 #ifdef PIKE_DEBUG default: Pike_fatal("Bad size_shift: %d\n", bytecode->size_shift); #endif } UNSET_ONERROR(err); return assemble(1); } static void decode_value2(struct decode_data *data) #ifdef PIKE_DEBUG #undef decode_value2 #define decode_value2(X) do { struct svalue *_=Pike_sp; decode_value2_(X); if(Pike_sp!=_+1) Pike_fatal("decode_value2 failed!\n"); } while(0) #endif { INT32 what, e; INT64 num; struct svalue entry_id, *tmp2; struct svalue *delayed_enc_val; #ifdef ENCODE_DEBUG data->depth += 2; #endif check_c_stack(1024); DECODE("decode_value2"); switch(what & TAG_MASK) { case TAG_DELAYED: EDB (2, fprintf(stderr, "%*sDecoding delay encoded from <%d>\n", data->depth, "", num);); SET_SVAL(entry_id, T_INT, NUMBER_NUMBER, integer, num); if (!(delayed_enc_val = low_mapping_lookup (data->decoded, &entry_id))) decode_error (data, NULL, "Failed to find previous record of " "delay encoded entry <%d>.\n", num); DECODE ("decode_value2"); break; case TAG_AGAIN: EDB (1, fprintf(stderr, "%*sDecoding TAG_AGAIN from <%d>\n", data->depth, "", num);); SET_SVAL(entry_id, T_INT, NUMBER_NUMBER, integer, num); if((tmp2=low_mapping_lookup(data->decoded, &entry_id))) { push_svalue(tmp2); }else{ decode_error(data, NULL, "Failed to decode TAG_AGAIN entry <%d>.\n", num); } goto decode_done; default: entry_id = data->counter; data->counter.u.integer++; /* Fall through. */ case TAG_TYPE: EDB (2, fprintf(stderr, "%*sDecoding to <%d>: TAG%d (%d)\n", data->depth, "", entry_id.u.integer , what & TAG_MASK, num);); /* Types are added to the encoded mapping AFTER they have been * encoded. */ delayed_enc_val = NULL; break; } check_stack(1); switch(what & TAG_MASK) { case TAG_INT: push_int(num); break; case TAG_STRING: { struct pike_string *str; get_string_data(str, num, data); push_string(str); break; } case TAG_FLOAT: { double res; EDB(2,fprintf(stderr, "Decoding float... num:0x%016" PRINTINT64 "x\n", num)); res = (double)num; EDB(2,fprintf(stderr, "Mantissa: %10g\n", res)); DECODE("float"); EDB(2,fprintf(stderr, "Exponent: %d\n", num)); if(!res) { DECLARE_INF DECLARE_NAN switch(num) { case Pike_FP_SNAN: /* Signal Not A Number */ case Pike_FP_QNAN: /* Quiet Not A Number */ push_float(DO_NOT_WARN((FLOAT_TYPE)MAKE_NAN())); break; case Pike_FP_NINF: /* Negative infinity */ push_float(DO_NOT_WARN((FLOAT_TYPE)MAKE_INF(-1))); break; case Pike_FP_PINF: /* Positive infinity */ push_float(DO_NOT_WARN((FLOAT_TYPE)MAKE_INF(1))); break; case Pike_FP_NZERO: /* Negative Zero */ push_float(-0.0); /* Does this do what we want? */ break; default: push_float(DO_NOT_WARN((FLOAT_TYPE)ldexp(res, num))); break; } break; } push_float(DO_NOT_WARN((FLOAT_TYPE)ldexp(res, num))); break; } case TAG_TYPE: { struct pike_type *t; decode_type(t, data); push_type_value(t); entry_id = data->counter; data->counter.u.integer++; } break; case TAG_ARRAY: { struct array *a; TYPE_FIELD types; if(num < 0) decode_error(data, NULL, "Failed to decode array (array size is negative).\n"); /* Heruetical */ if(num > data->len - data->ptr) decode_error(data, NULL, "Failed to decode array (not enough data).\n"); EDB(2,fprintf(stderr, "%*sDecoding array of size %d to <%d>\n", data->depth, "", num, entry_id.u.integer)); SETUP_DECODE_MEMOBJ(T_ARRAY, array, a, allocate_array(num), free_svalues(ITEM(a), a->size, a->type_field)); types = 0; for(e=0;e<num;e++) { decode_value2(data); stack_pop_to_no_free (ITEM(a) + e); types |= 1 << TYPEOF(ITEM(a)[e]); } a->type_field = types; ref_push_array(a); goto decode_done; } case TAG_MAPPING: { struct mapping *m; if(num<0) decode_error(data, NULL, "Failed to decode mapping " "(mapping size is negative).\n"); /* Heuristical */ if(num > data->len - data->ptr) decode_error(data, NULL, "Failed to decode mapping " "(not enough data).\n"); EDB(2,fprintf(stderr, "%*sDecoding mapping of size %d to <%d>\n", data->depth, "", num, entry_id.u.integer)); SETUP_DECODE_MEMOBJ(T_MAPPING, mapping, m, allocate_mapping(num), ; ); for(e=0;e<num;e++) { decode_value2(data); decode_value2(data); mapping_insert(m, Pike_sp-2, Pike_sp-1); pop_n_elems(2); } ref_push_mapping(m); goto decode_done; } case TAG_MULTISET: { struct multiset *m; struct array *a; TYPE_FIELD types; if(num<0) decode_error(data, NULL, "Failed to decode multiset " "(multiset size is negative).\n"); /* Heruetical */ if(num > data->len - data->ptr) decode_error(data, NULL, "Failed to decode multiset " "(not enough data).\n"); /* NOTE: This code knows stuff about the implementation of multisets...*/ EDB(2,fprintf(stderr, "%*sDecoding multiset of size %d to <%d>\n", data->depth, "", num, entry_id.u.integer)); SETUP_DECODE_MEMOBJ (T_MULTISET, multiset, m, allocate_multiset (0, 0, NULL), ;); /* FIXME: This array could be avoided by building the multiset directly. */ a = low_allocate_array (num, 0); types = 0; for(e=0;e<num;e++) { decode_value2(data); stack_pop_to_no_free (ITEM(a) + e); types |= 1 << TYPEOF(ITEM(a)[e]); } a->type_field = types; { struct multiset *l = mkmultiset (a); free_array (a); /* This special case is handled efficiently by merge_multisets. */ merge_multisets (m, l, PIKE_MERGE_DESTR_A | PIKE_ARRAY_OP_ADD); free_multiset (l); } ref_push_multiset(m); goto decode_done; } case TAG_OBJECT: { int subtype = 0; if (num == 4) { decode_number(subtype, data); } decode_value2(data); switch(num) { case 0: apply(decoder_codec (data),"objectof", 1); break; case 1: { int fun; /* decode_value_clone_object does not call __INIT, so * we want to do that ourselves... */ struct object *o=decode_value_clone_object(Pike_sp-1); if (!o) { if (data->pickyness) decode_error (data, NULL, "Failed to decode program for object. Got: %O\n", Pike_sp - 1); EDB(1,fprintf(stderr, "%*sDecoded a failed object to <%d>: ", data->depth, "", entry_id.u.integer); print_svalue(stderr, Pike_sp-1); fputc('\n', stderr);); decode_value2(data); pop_n_elems(2); push_undefined(); break; } debug_malloc_touch(o); pop_stack(); push_object(o); if(o->prog) { if(o->prog->flags & PROGRAM_FINISHED) { int lfun = FIND_LFUN(o->prog, LFUN___INIT); if (lfun >= 0) { apply_low(o, lfun, 0); pop_stack(); } /* FIXME: Should call LFUN_CREATE here in <= 7.2 * compatibility mode. */ }else{ struct unfinished_obj_link *ol=ALLOC_STRUCT(unfinished_obj_link); EDB(2,fprintf(stderr, "%*sDecoded an unfinished object to <%d>: ", data->depth, "", entry_id.u.integer); print_svalue(stderr, Pike_sp-1); fputc('\n', stderr);); add_ref(ol->o = o); ol->next=data->unfinished_objects; SET_SVAL(ol->decode_arg, PIKE_T_INT, NUMBER_UNDEFINED, integer, 0); data->unfinished_objects=ol; decode_value2(data); assign_svalue(&ol->decode_arg, Pike_sp-1); pop_stack(); break; } } EDB(2,fprintf(stderr, "%*sDecoded an object to <%d>: ", data->depth, "", entry_id.u.integer); print_svalue(stderr, Pike_sp-1); fputc('\n', stderr);); ref_push_object(o); decode_value2(data); fun = find_identifier("decode_object", decoder_codec (data)->prog); if (fun < 0) decode_error(data, Pike_sp - 1, "Cannot decode objects without a " "\"decode_object\" function in the codec.\n"); apply_low(data->codec,fun,2); if ((TYPEOF(Pike_sp[-1]) == T_ARRAY) && o->prog && ((fun = FIND_LFUN(o->prog, LFUN_CREATE)) != -1)) { /* Call lfun::create(@args). */ INT32 args; Pike_sp--; args = Pike_sp->u.array->size; if (args) { /* Note: Eats reference */ push_array_items(Pike_sp->u.array); } else { free_array(Pike_sp->u.array); } apply_low(o, fun, args); } pop_stack(); } break; case 2: { check_stack(2); /* 256 would be better, but then negative numbers * doesn't work... /Hubbe */ push_int(36); convert_stack_top_with_base_to_bignum(); reduce_stack_top_bignum(); break; } case 3: pop_stack(); decode_value2(data); break; case 4: /* Subtyped object. */ if ((TYPEOF(Pike_sp[-1]) != T_OBJECT) || SUBTYPEOF(Pike_sp[-1]) || !Pike_sp[-1].u.object->prog) { decode_error(data, NULL, "Expected plain object. Got: %O\n", Pike_sp-1); } if ((subtype < 0) || (subtype >= Pike_sp[-1].u.object->prog->num_inherits)) { decode_error(data, NULL, "Invalid subtype for object: %d (max: %d). " "Object: %O\n", subtype, Pike_sp[-1].u.object->prog->num_inherits, Pike_sp-1); } SET_SVAL_SUBTYPE(Pike_sp[-1], subtype); break; default: decode_error(data, NULL, "Object coding not compatible: %d\n", num); break; } if((TYPEOF(Pike_sp[-1]) != T_OBJECT) && data->pickyness) { if (num != 2) { decode_error(data, NULL, "Failed to decode object. Got: %O\n", Pike_sp - 1); } else if (TYPEOF(Pike_sp[-1]) != PIKE_T_INT) { decode_error(data, NULL, "Failed to decode bignum. Got: %O\n", Pike_sp - 1); } } break; } case TAG_FUNCTION: decode_value2(data); stack_dup(); /* For diagnostic purposes... */ switch(num) { case 0: apply(decoder_codec (data),"functionof", 1); break; case 1: { struct program *p; if(TYPEOF(Pike_sp[-1]) != T_OBJECT && data->pickyness) decode_error(data, NULL, "Failed to decode function object. Got: %O\n", Pike_sp - 1); decode_value2(data); if(TYPEOF(Pike_sp[-1]) != T_STRING && data->pickyness) decode_error(data, NULL, "Failed to decode function identifier. Got: %O\n", Pike_sp - 1); if (TYPEOF(Pike_sp[-2]) == T_OBJECT && TYPEOF(Pike_sp[-1]) == T_STRING && (p = Pike_sp[-2].u.object->prog)) { int f = really_low_find_shared_string_identifier( Pike_sp[-1].u.string, p->inherits[SUBTYPEOF(Pike_sp[-2])].prog, SEE_PROTECTED|SEE_PRIVATE); debug_malloc_touch(p); if (f >= 0) { struct svalue func; low_object_index_no_free(&func, Pike_sp[-2].u.object, f); debug_malloc_touch(p); pop_n_elems(2); *Pike_sp++ = func; dmalloc_touch_svalue(Pike_sp-1); break; } else if (data->pickyness) { debug_malloc_touch(p); if (Pike_sp[-1].u.string->size_shift) decode_error(data, NULL, "Couldn't find identifier in %O.\n", Pike_sp - 2); else decode_error(data, NULL, "Couldn't find identifier %s in %O.\n", Pike_sp[-1].u.string->str, Pike_sp - 2); } debug_malloc_touch(p); } pop_stack(); break; } default: decode_error(data, NULL, "Function coding not compatible: %d\n", num); break; } if((TYPEOF(Pike_sp[-1]) != T_FUNCTION) && (TYPEOF(Pike_sp[-1]) != T_PROGRAM) && data->pickyness) decode_error(data, Pike_sp - 2, "Failed to decode function. Got: %O\n", Pike_sp - 1); stack_pop_keep_top(); break; case TAG_PROGRAM: EDB(3, fprintf(stderr, "%*s TAG_PROGRAM(%d)\n", data->depth, "", num)); switch(num) { case 0: { struct program *p; decode_value2(data); apply(decoder_codec (data),"programof", 1); p = program_from_svalue(Pike_sp-1); if (!p) { if(data->pickyness) decode_error(data, NULL, "Failed to decode program. Got: %O\n", Pike_sp - 1); pop_stack(); push_undefined(); break; } if ((p->flags & PROGRAM_NEEDS_PARENT)) { EDB(2, fprintf(stderr, "%*sKeeping %s to keep parent pointer.\n", data->depth, "", get_name_of_type(TYPEOF(Pike_sp[-1])))); break; } add_ref(p); pop_stack(); push_program(p); break; } case 1: /* Old-style encoding. */ { decode_error(data, NULL, "Failed to decode program. Old-style program encoding is not supported, anymore.\n"); } case 2: decode_value2(data); decode_value2(data); if(TYPEOF(Pike_sp[-2]) == T_INT) { pop_stack(); }else{ f_arrow(2); } if(TYPEOF(Pike_sp[-1]) != T_PROGRAM && data->pickyness) decode_error(data, NULL, "Failed to decode program. Got: %O\n", Pike_sp - 1); break; case 3: decode_value2(data); if ((TYPEOF(Pike_sp[-1]) == T_INT) && (Pike_sp[-1].u.integer < PROG_DYNAMIC_ID_START) && (Pike_sp[-1].u.integer > 0)) { struct program *p = id_to_program(Pike_sp[-1].u.integer); if (!p) { decode_error(data, NULL, "Failed to get program from ID %O.\n", Pike_sp - 1); } pop_stack(); ref_push_program(p); } else { decode_error(data, NULL, "Failed to decode program by ID. " "Expected integer, got: %O\n", Pike_sp - 1); } break; case 5: { /* Forward reference for new-style encoding. */ struct program *p = low_allocate_program(); push_program (p); EDB(2, fprintf (stderr, "%*sInited an embryo for a delay encoded program " "to <%d>: ", data->depth, "", entry_id.u.integer); print_svalue (stderr, Pike_sp - 1); fputc ('\n', stderr);); data->delay_counter++; #if 0 /* Is this necessary? In that case, how do we pass an * adequate context to __register_new_program so that it * knows which program is being decoded? */ ref_push_program (p); apply (decoder_codec (data), "__register_new_program", 1); /* Returns a placeholder. */ if (TYPEOF(Pike_sp[-1]) == T_OBJECT) { if (Pike_sp[-1].u.object->prog != null_program) decode_error (data, NULL, "Placeholder object is not " "a null_program clone.\n"); } else if (TYPEOF(Pike_sp[-1]) != T_INT || Pike_sp[-1].u.integer) decode_error (data, NULL, "Expected placeholder object or zero " "from __register_new_program.\n"); pop_stack(); #endif break; } case 4: /* New-style encoding. */ { struct program *p; ONERROR err; ONERROR err2; int byteorder; int bytecode_method; int entry_type; INT16 id_flags; INT16 p_flags; ptrdiff_t old_pragmas; struct compilation *c; struct pike_string *save_current_file; struct object *placeholder = NULL; INT_TYPE save_current_line; #define FOO(NUMTYPE,Y,ARGTYPE,NAME) \ NUMTYPE PIKE_CONCAT(local_num_, NAME) = 0; #include "program_areas.h" #ifdef ENCODE_DEBUG data->depth += 2; #endif /* Decode byte-order. */ decode_number(byteorder, data); EDB(4, fprintf(stderr, "%*sbyte order:%d\n", data->depth, "", byteorder)); if ((byteorder != PIKE_BYTEORDER) #if (PIKE_BYTEORDER == 1234) && (byteorder != 4321) #else #if (PIKE_BYTEORDER == 4321) && (byteorder != 1234) #endif #endif ) { decode_error (data, NULL, "Unsupported byte-order. " "Native:%d Encoded:%d\n", PIKE_BYTEORDER, byteorder); } /* Decode flags. */ decode_number(p_flags,data); p_flags &= ~(PROGRAM_FINISHED | PROGRAM_OPTIMIZED | PROGRAM_FIXED | PROGRAM_PASS_1_DONE); p_flags |= PROGRAM_AVOID_CHECK; if (delayed_enc_val) { EDB(2,fprintf(stderr, "%*sdecoding a delay encoded program: ", data->depth, ""); print_svalue(stderr, delayed_enc_val); fputc('\n', stderr);); if (TYPEOF(*delayed_enc_val) != T_PROGRAM || delayed_enc_val->u.program->flags != PROGRAM_VIRGIN) { decode_error (data, NULL, "Didn't get program embryo " "for delay encoded program <%O>: %O\n", &entry_id, delayed_enc_val); } /* No new ref here; low_start_new_program will add one for * Pike_compiler->new_program and we want ride on that one * just like when it's created there. */ p = delayed_enc_val->u.program; debug_malloc_touch(p); } else p = NULL; enter_compiler(NULL, 0); c = THIS_COMPILATION; /* We don't want to be affected by #pragma save_parent or * __pragma_save_parent__. */ old_pragmas = c->lex.pragmas; c->lex.pragmas = (old_pragmas & ~ID_SAVE_PARENT)|ID_DONT_SAVE_PARENT; /* Start the new program. */ low_start_new_program(p, 1, NULL, 0, NULL); p = Pike_compiler->new_program; #if TWO_PASS_DECODE_WORKS if(! data->supporter.prog) data->supporter.prog = p; #endif p->flags = p_flags; /* Kludge to get end_first_pass() to free the program. */ Pike_compiler->num_parse_error++; SET_ONERROR(err, cleanup_new_program_decode, NULL); { int fun = find_identifier("__register_new_program", decoder_codec (data)->prog); if (fun >= 0) { ref_push_program(p); apply_low(data->codec, fun, 1); /* Returned a placeholder */ if(TYPEOF(Pike_sp[-1]) == T_OBJECT) { add_ref(c->placeholder=Pike_sp[-1].u.object); if(c->placeholder->prog != null_program) { decode_error(data, NULL, "Placeholder object is not " "a __null_program clone.\n"); } } else if (TYPEOF(Pike_sp[-1]) != T_INT || Pike_sp[-1].u.integer) { decode_error (data, NULL, "Expected placeholder object or zero " "from __register_new_program.\n"); } pop_stack(); } } copy_shared_string(save_current_file, c->lex.current_file); save_current_line = c->lex.current_line; SET_ONERROR(err2, restore_current_file, save_current_file); if (!delayed_enc_val) { struct svalue prog; SET_SVAL(prog, T_PROGRAM, 0, program, p); EDB(2,fprintf(stderr, "%*sDecoding a program to <%d>: ", data->depth, "", entry_id.u.integer); print_svalue(stderr, &prog); fputc('\n', stderr);); mapping_insert(data->decoded, &entry_id, &prog); debug_malloc_touch(p); } else { data->delay_counter--; } debug_malloc_touch(p); /* Check the version. */ decode_value2(data); push_compact_version(); if(!is_eq(Pike_sp-1,Pike_sp-2) #ifdef ENCODE_DEBUG && !data->debug #endif ) decode_error(data, NULL, "Cannot decode programs encoded with " "other pike version %O.\n", Pike_sp - 2); pop_n_elems(2); debug_malloc_touch(p); #ifdef ENCODE_DEBUG if (!data->debug) #endif data->pickyness++; /* parent */ decode_value2(data); if (TYPEOF(Pike_sp[-1]) == T_PROGRAM) { p->parent = Pike_sp[-1].u.program; debug_malloc_touch(p->parent); } else if ((TYPEOF(Pike_sp[-1]) == T_INT) && (!Pike_sp[-1].u.integer)) { p->parent = NULL; } else { decode_error (data, NULL, "Bad type for parent program (%s).\n", get_name_of_type(TYPEOF(Pike_sp[-1]))); } dmalloc_touch_svalue(Pike_sp-1); Pike_sp--; /* Decode lengths. */ #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) \ decode_number(PIKE_CONCAT(local_num_, NAME), data); #include "program_areas.h" /* Byte-code method */ decode_number(bytecode_method, data); if (bytecode_method == PIKE_BYTECODE_PORTABLE) { } else if (bytecode_method != PIKE_BYTECODE_METHOD) { decode_error(data, NULL, "Unsupported byte-code method: %d\n", bytecode_method); } else { #ifdef PIKE_PORTABLE_BYTECODE fprintf(stderr, "Warning: Decoding non-portable bytecode.\n"); #endif /* PIKE_PORTABLE_BYTECODE */ #ifdef PIKE_USE_MACHINE_CODE { size_t csum; /* Check the checksum of the instrs array. */ decode_number(csum, data); if (csum != instrs_checksum) { decode_error(data, NULL, "Bad instruction checksum: %d (expected %d)\n", csum, instrs_checksum); } } #endif /* PIKE_USE_MACHINE_CODE */ /* Decode program */ if (SIZE_T_MUL_OVERFLOW(local_num_program, sizeof(PIKE_OPCODE_T)) || local_num_program * sizeof(PIKE_OPCODE_T) >= (size_t)(data->len - data->ptr)) { decode_error(data, NULL, "Failed to decode program (string too short).\n"); } low_add_many_to_program(Pike_compiler, (PIKE_OPCODE_T *)(data->data + data->ptr), local_num_program); data->ptr += local_num_program * sizeof(PIKE_OPCODE_T); /* Decode relocations */ for (e=0; e<(int)local_num_relocations; e++) { size_t reloc; decode_number(reloc, data); CHECK_RELOC(reloc, (size_t) local_num_program); add_to_relocations(reloc); } /* Perform relocation. */ #ifdef DECODE_PROGRAM DECODE_PROGRAM(p); #endif /* DECODE_PROGRAM */ make_program_executable(p); /* Decode linenumbers */ if (local_num_linenumbers >= (size_t)(data->len - data->ptr)) { decode_error(data, NULL, "Failed to decode linenumbers " "(string too short).\n"); } for (e=0; e<(int)local_num_linenumbers; e++) { char lineno_info; lineno_info = *(data->data + data->ptr++); add_to_linenumbers(lineno_info); } /* Now with the linenumber info in place it gets useful to * include the program in error messages. */ EDB(2, fprintf(stderr, "%*sThe program is: ", data->depth, ""); push_program (p); print_svalue (stderr, --Pike_sp); fputc('\n', stderr)); } /* identifier_index & variable_index are created by * fixate_program() and optimize_program(). */ /* Decode strings */ for (e=0; e<local_num_strings; e++) { decode_value2(data); if (TYPEOF(Pike_sp[-1]) != T_STRING) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Nonstrings in string table: %O\n", Pike_sp - 2); } add_to_strings(Pike_sp[-1].u.string); dmalloc_touch_svalue(Pike_sp-1); Pike_sp--; } /* First pass constants. * * These will be replaced later on. */ { struct program_constant constant; SET_SVAL(constant.sval, T_INT, NUMBER_UNDEFINED, integer, 0); constant.offset = -1; for(e=0;e<local_num_constants;e++) { add_to_constants(constant); } } /* Decode identifier_references, inherits and identifiers. */ decode_number(entry_type, data); EDB(4, fprintf(stderr, "%*sDecoding identifier references.\n", data->depth, "")); #ifdef ENCODE_DEBUG data->depth+=2; #endif while ((entry_type == ID_ENTRY_EFUN_CONSTANT) || (entry_type == ID_ENTRY_TYPE_CONSTANT)) { INT32 efun_no; struct program_constant *constant; decode_number(efun_no, data); EDB(2, fprintf(stderr, "%*sDecoding efun/type constant #%d.\n", data->depth, "", efun_no)); if ((efun_no < 0) || (efun_no >= local_num_constants)) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad efun/type number: %d (expected 0 - %d).\n", efun_no, local_num_constants-1); } constant = p->constants+efun_no; /* value */ decode_value2(data); switch(entry_type) { case ID_ENTRY_EFUN_CONSTANT: if (((TYPEOF(Pike_sp[-1]) != T_FUNCTION) || (SUBTYPEOF(Pike_sp[-1]) != FUNCTION_BUILTIN)) && data->pickyness) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Expected efun constant: %O\n", Pike_sp - 2); } break; case ID_ENTRY_TYPE_CONSTANT: if (TYPEOF(Pike_sp[-1]) != T_TYPE && data->pickyness) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Expected type constant: %O\n", Pike_sp - 2); } break; default: if (data->pickyness) decode_error(data, NULL, "Internal error: " "Unsupported early constant (%d).\n", entry_type); break; } /* name */ decode_value2(data); #if 0 if (TYPEOF(Pike_sp[-1]) == T_STRING) { constant->name = Pike_sp[-1].u.string; } else if ((TYPEOF(Pike_sp[-1]) == T_INT) && !Pike_sp[-1].u.integer) { constant->name = NULL; } else { ref_push_program (p); decode_error(data, Pike_sp - 1, "Name of constant is not a string: %O\n", Pike_sp - 2); } constant->sval = Pike_sp[-2]; dmalloc_touch_svalue(Pike_sp-1); dmalloc_touch_svalue(Pike_sp-2); Pike_sp -= 2; #else /* !0 */ constant->offset = -1; pop_stack(); constant->sval = Pike_sp[-1]; dmalloc_touch_svalue(Pike_sp-1); Pike_sp -= 1; #endif /* 0 */ decode_number(entry_type, data); } while (entry_type != ID_ENTRY_EOT) { decode_number(id_flags, data); if ((entry_type != ID_ENTRY_RAW) && (entry_type != ID_ENTRY_INHERIT)) { /* Common identifier fields. */ unsigned INT32 filename_strno; /* name */ decode_value2(data); if (TYPEOF(Pike_sp[-1]) != T_STRING) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad identifier name (not a string): %O\n", Pike_sp - 2); } /* type */ decode_value2(data); if (TYPEOF(Pike_sp[-1]) != T_TYPE) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad identifier type (not a type): %O\n", Pike_sp - 2); } /* filename */ decode_number(filename_strno, data); if (filename_strno >= p->num_strings) { ref_push_program(p); decode_error(data, NULL, "String number out of range: %ld >= %ld", (long)filename_strno, (long)p->num_strings); } free_string(c->lex.current_file); copy_shared_string(c->lex.current_file, p->strings[filename_strno]); /* linenumber */ decode_number(c->lex.current_line, data); /* Identifier name and type on the pike stack. * Definition location in c->lex. */ } switch(entry_type) { case ID_ENTRY_RAW: { int no; int ref_no; struct reference ref; /* id_flags */ ref.id_flags = id_flags; /* inherit_offset */ decode_number(ref.inherit_offset, data); /* identifier_offset */ /* Actually the id ref number from the inherited program */ decode_number(ref_no, data); if (ref.inherit_offset >= p->num_inherits) decode_error(data, NULL, "Inherit offset out of range %u vs %u.\n", ref.inherit_offset, p->num_inherits); if (ref_no < 0 || ref_no >= p->inherits[ref.inherit_offset].prog->num_identifier_references) decode_error(data, NULL, "Identifier reference out of range %u vs %u.\n", ref_no, p->inherits[ref.inherit_offset].prog->num_identifier_references); ref.identifier_offset = p->inherits[ref.inherit_offset].prog-> identifier_references[ref_no].identifier_offset; ref.run_time_type = PIKE_T_UNKNOWN; ref.func.offset = 0; /* Expected identifier reference number */ decode_number(no, data); if (no < 0 || no > p->num_identifier_references) { EDB (3, dump_program_tables (p, data->depth)); ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad identifier reference offset: %d != %d\n", no, Pike_compiler->new_program-> num_identifier_references); } else if (no == p->num_identifier_references) { add_to_identifier_references(ref); } else { p->identifier_references[no] = ref; } } break; case ID_ENTRY_VARIABLE: { int no, n; /* Expected identifier offset */ decode_number(no, data); EDB(5, fprintf(stderr, "%*sdefine_variable(\"%s\", X, 0x%04x)\n", data->depth, "", Pike_sp[-2].u.string->str, id_flags)); /* Alters * * storage, variable_index, identifiers and * identifier_references */ n = define_variable(Pike_sp[-2].u.string, Pike_sp[-1].u.type, id_flags); if (no != n) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad variable identifier offset " "(got %d, expected %d).\n", n, no); } pop_n_elems(2); } break; case ID_ENTRY_FUNCTION: { union idptr func; unsigned INT8 func_flags; unsigned INT16 opt_flags; int no; int n; /* func_flags (aka identifier_flags) */ decode_number(func_flags, data); /* func */ decode_number(func.offset, data); if (bytecode_method == PIKE_BYTECODE_PORTABLE && func.offset != -1) { #ifdef ENCODE_DEBUG int old_a_flag; #endif EDB(2, { fprintf(stderr, "%*sDecoding portable bytecode.\n", data->depth, ""); old_a_flag = a_flag; a_flag = (a_flag > (data->debug-1))?a_flag:(data->debug-1); }); func.offset = decode_portable_bytecode(data, func.offset); EDB(2, a_flag = old_a_flag); } /* opt_flags */ decode_number(opt_flags, data); /* FIXME: * Verify validity of func_flags, func.offset & opt_flags */ /* Expected identifier offset */ decode_number(no, data); EDB(5, { INT_TYPE line; struct pike_string *file = get_line(func.offset + p->program, p, &line); fprintf(stderr, "%*sdefine_function(\"%s\", X, 0x%04x, 0x%04x,\n" "%*s 0x%04x, 0x%04x)\n" "%*s @ %s:%ld\n", data->depth, "", Pike_sp[-2].u.string->str, id_flags, func_flags, data->depth, "", func.offset, opt_flags, data->depth, "", file->str, (long)line); }); /* Alters * * identifiers, identifier_references */ n = define_function(Pike_sp[-2].u.string, Pike_sp[-1].u.type, id_flags, func_flags, &func, opt_flags); if ((no < 0 || no >= p->num_identifier_references) || (no != n && (p->identifier_references[no].id_flags != id_flags || p->identifier_references[no].identifier_offset != p->identifier_references[n].identifier_offset || p->identifier_references[no].inherit_offset != 0))) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad function identifier offset: %d\n", no); } pop_n_elems(2); } break; case ID_ENTRY_CONSTANT: { struct identifier id; struct reference ref; int no; int n; id.filename_strno = store_prog_string(c->lex.current_file); id.linenumber = c->lex.current_line; id.name = Pike_sp[-2].u.string; id.type = Pike_sp[-1].u.type; /* identifier_flags */ id.identifier_flags = IDENTIFIER_CONSTANT; /* offset */ decode_number(id.func.const_info.offset, data); /* FIXME: * Verify validity of func.const_info.offset */ /* run_time_type */ decode_number(id.run_time_type, data); /* opt_flags */ decode_number(id.opt_flags, data); ref.run_time_type = PIKE_T_UNKNOWN; ref.func.offset = 0; /* Expected identifier number. */ decode_number(no, data); n = isidentifier(id.name); #ifdef PROFILING id.self_time=0; id.num_calls=0; id.recur_depth=0; id.total_time=0; #endif /* id_flags */ ref.id_flags = id_flags; EDB(5, fprintf(stderr, "%*sdefining constant(\"%s\", X, 0x%04x)\n", data->depth, "", Pike_sp[-2].u.string->str, id_flags)); /* identifier_offset */ ref.identifier_offset = Pike_compiler->new_program->num_identifiers; add_to_identifiers(id); /* References now held by the new program identifier. */ dmalloc_touch_svalue(Pike_sp-1); dmalloc_touch_svalue(Pike_sp-2); Pike_sp -= 2; /* ref.inherit_offset */ ref.inherit_offset = 0; /* Alters * * identifiers, identifier_references */ if (n < 0 || (n = override_identifier (&ref, id.name, 0)) < 0) { n = p->num_identifier_references; add_to_identifier_references(ref); } if (no != n) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad function identifier offset " "(expected %d, got %d) for %S.\n", no, n, id.name); } } break; case ID_ENTRY_ALIAS: { int depth; int refno; int no; int n; /* depth */ decode_number(depth, data); /* refno */ decode_number(refno, data); /* FIXME: * Verify validity of depth and refno. */ /* Expected identifier number. */ decode_number(no, data); EDB(5, fprintf(stderr, "%*slow_define_alias(\"%s\", X, 0x%04x)\n", data->depth, "", Pike_sp[-2].u.string->str, id_flags)); /* Alters * * variable_index, identifiers and * identifier_references */ n = low_define_alias(Pike_sp[-2].u.string, Pike_sp[-1].u.type, id_flags, depth, refno); if (no != n) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad alias identifier offset " "(expected %d, got %d) for %O.\n", no, n, Pike_sp - 3); } pop_n_elems(2); } break; case ID_ENTRY_INHERIT: { struct program *prog; struct object *parent = NULL; int parent_identifier; int parent_offset; struct pike_string *name = NULL; int no; decode_number(no, data); if (no != Pike_compiler->new_program->num_identifier_references) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad inherit identifier offset: %d\n", no); } /* name */ decode_value2(data); if (TYPEOF(Pike_sp[-1]) == T_STRING) { name = Pike_sp[-1].u.string; } else if ((TYPEOF(Pike_sp[-1]) != T_INT) || Pike_sp[-1].u.integer) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad inherit name (not a string): %O\n", Pike_sp - 2); } /* prog */ decode_value2(data); if (!(prog = program_from_svalue(Pike_sp-1))) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad inherit: Expected program, got: %O\n", Pike_sp - 2); } if (prog == placeholder_program) { ref_push_program (p); decode_error (data, Pike_sp - 1, "Trying to inherit placeholder program " "(resolver or codec problem).\n"); } if(!(prog->flags & (PROGRAM_FINISHED | PROGRAM_PASS_1_DONE))) { ref_push_program (p); decode_error (data, Pike_sp - 1, "Cannot inherit a program which is not " "fully compiled yet (resolver or codec " "problem): %O\n", Pike_sp - 2); } /* parent */ decode_value2(data); if (TYPEOF(Pike_sp[-1]) == T_OBJECT) { parent = Pike_sp[-1].u.object; } else if ((TYPEOF(Pike_sp[-1]) != T_INT) || Pike_sp[-1].u.integer) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad inherit: Parent isn't an object: %O\n", Pike_sp - 2); } /* parent_identifier */ decode_number(parent_identifier, data); /* parent_offset */ decode_number(parent_offset, data); /* Expected number of identifier references. */ decode_number(no, data); if (prog->num_identifier_references != no) { ref_push_program (p); decode_error(data, Pike_sp - 1, "Bad number of identifiers " "in inherit (%d != %d).\n", no, prog->num_identifier_references); } EDB(5, fprintf(stderr, "%*slower_inherit(..., \"%s\")\n", data->depth, "", name?name->str:"NULL")); /* Alters * * storage, inherits and identifier_references */ lower_inherit(prog, parent, parent_identifier, parent_offset + 42, id_flags, name); pop_n_elems(3); } break; default: decode_error(data, NULL, "Unsupported id entry type: %d\n", entry_type); } decode_number(entry_type, data); } /* Restore c->lex. */ CALL_AND_UNSET_ONERROR(err2); c->lex.current_line = save_current_line; #ifdef ENCODE_DEBUG data->depth-=2; #endif UNSET_ONERROR(err); /* De-kludge to get end_first_pass() to free the program. */ Pike_compiler->num_parse_error--; p->flags |= PROGRAM_PASS_1_DONE; /* Fixate & optimize * * lfuns and identifier_index */ ref_push_program (p); if (!(p = end_first_pass(2))) { decode_error(data, Pike_sp - 1, "Failed to decode program.\n"); } pop_stack(); push_program(p); if (c->placeholder) { push_object(placeholder = c->placeholder); c->placeholder = NULL; } exit_compiler(); EDB(5, dump_program_tables(p, data->depth)); #ifdef PIKE_DEBUG check_program (p); #endif if (bytecode_method == PIKE_BYTECODE_PORTABLE) { /* We've regenerated p->program, so these may be off. */ local_num_program = p->num_program; local_num_relocations = p->num_relocations; local_num_linenumbers = p->num_linenumbers; } /* Verify... */ #define FOO(NUMTYPE,TYPE,ARGTYPE,NAME) \ if (PIKE_CONCAT(local_num_, NAME) != p->PIKE_CONCAT(num_,NAME)) { \ ref_push_program (p); \ decode_error(data, Pike_sp - 1, \ "Value mismatch for num_" TOSTR(NAME) ": " \ "%zd != %zd (bytecode method: %d)\n", \ (size_t) PIKE_CONCAT(local_num_, NAME), \ (size_t) p->PIKE_CONCAT(num_, NAME), \ bytecode_method); \ } #include "program_areas.h" /* Decode the actual constants * * This must be done after the program has been ended. */ for (e=0; e<local_num_constants; e++) { struct program_constant *constant = p->constants+e; if ((TYPEOF(constant->sval) != T_INT) || (SUBTYPEOF(constant->sval) != NUMBER_UNDEFINED)) { /* Already initialized. */ EDB(5, fprintf(stderr, "%*sskipping constant %d\n", data->depth, "", e)); continue; } /* value */ decode_value2(data); /* name */ decode_value2(data); #if 0 if (TYPEOF(Pike_sp[-1]) == T_STRING) { constant->name = Pike_sp[-1].u.string; } else if ((TYPEOF(Pike_sp[-1]) == T_INT) && !Pike_sp[-1].u.integer) { constant->name = NULL; } else { ref_push_program (p); decode_error(data, Pike_sp - 1, "Name of constant is not a string: %O\n", Pike_sp - 2); } constant->sval = Pike_sp[-2]; dmalloc_touch_svalue(Pike_sp-1); dmalloc_touch_svalue(Pike_sp-2); Pike_sp -= 2; #else /* !0 */ constant->offset = -1; pop_stack(); constant->sval = Pike_sp[-1]; dmalloc_touch_svalue(Pike_sp-1); Pike_sp -= 1; #endif /* 0 */ EDB(5, fprintf(stderr, "%*sDecoded constant %d to a %s\n", data->depth, "", e, get_name_of_type(TYPEOF(constant->sval)))); } #ifdef ENCODE_DEBUG if (!data->debug) #endif data->pickyness--; /* The program should be consistent now. */ p->flags &= ~PROGRAM_AVOID_CHECK; EDB(5, fprintf(stderr, "%*sProgram flags: 0x%04x\n", data->depth, "", p->flags)); if (placeholder) { if (placeholder->prog != null_program) { decode_error(data, NULL, "Placeholder has been zapped during decoding.\n"); } debug_malloc_touch(placeholder); free_program(placeholder->prog); add_ref(placeholder->prog = p); placeholder->storage = p->storage_needed ? (char *)xcalloc(p->storage_needed, 1) : (char *)NULL; call_c_initializers(placeholder); if (!data->delay_counter) { call_pike_initializers(placeholder, 0); } else { /* It's not safe to call __INIT() or create() yet, since * there are delayed programs left. */ struct unfinished_obj_link *up = ALLOC_STRUCT(unfinished_obj_link); up->next = data->unfinished_placeholders; data->unfinished_placeholders = up; add_ref(up->o = placeholder); } pop_stack(); } if (!data->delay_counter) { /* Call the Pike initializers for the delayed placeholders. */ struct unfinished_obj_link *up; while ((up = data->unfinished_placeholders)) { struct object *o; data->unfinished_placeholders = up->next; push_object(o = up->o); free(up); call_pike_initializers(o, 0); pop_stack(); } } #ifdef ENCODE_DEBUG data->depth -= 2; #endif goto decode_done; } default: decode_error(data, NULL, "Cannot decode program encoding type %d\n",num); } break; default: decode_error(data, NULL, "Failed to restore string (illegal type %d).\n", what & TAG_MASK); } mapping_insert(data->decoded, &entry_id, Pike_sp-1); decode_done:; EDB(2,fprintf(stderr, "%*sDecoded to <%d>: ", data->depth, "", entry_id.u.integer); print_svalue(stderr, Pike_sp-1); fputc('\n', stderr);); #ifdef ENCODE_DEBUG data->depth -= 2; #endif } static struct decode_data *current_decode = NULL; static void free_decode_data (struct decode_data *data, int delay, int DEBUGUSED(free_after_error)) { #ifdef PIKE_DEBUG int e; struct keypair *k; #endif debug_malloc_touch(data); if (current_decode == data) { current_decode = data->next; } else { struct decode_data *d; for (d = current_decode; d; d=d->next) { if (d->next == data) { d->next = d->next->next; break; } } } if(delay) { debug_malloc_touch(data); /* We have been delayed */ return; } #ifdef PIKE_DEBUG if (!free_after_error) { NEW_MAPPING_LOOP (data->decoded->data) { if (TYPEOF(k->val) == T_PROGRAM && !(k->val.u.program->flags & PROGRAM_FINISHED)) { decode_error (data, NULL, "Got unfinished program <%O> after decode: %O\n", &k->ind, &k->val); } } if(data->unfinished_programs) Pike_fatal("We have unfinished programs left in decode()!\n"); if(data->unfinished_objects) Pike_fatal("We have unfinished objects left in decode()!\n"); if(data->unfinished_placeholders) Pike_fatal("We have unfinished placeholders left in decode()!\n"); } #endif free_string (data->data_str); if (data->codec) free_object (data->codec); free_mapping(data->decoded); while(data->unfinished_programs) { struct unfinished_prog_link *tmp=data->unfinished_programs; data->unfinished_programs=tmp->next; free(tmp); } while(data->unfinished_objects) { struct unfinished_obj_link *tmp=data->unfinished_objects; data->unfinished_objects=tmp->next; free_svalue(&tmp->decode_arg); free_object(tmp->o); free(tmp); } while(data->unfinished_placeholders) { struct unfinished_obj_link *tmp=data->unfinished_placeholders; data->unfinished_placeholders=tmp->next; free_object(tmp->o); free(tmp); } #ifdef PIKE_THREADS data->thread_state = NULL; free_object (data->thread_obj); #endif free( (char *) data); } static void low_do_decode (struct decode_data *data) { current_decode = data; decode_value2(data); while (data->ptr < data->len) { decode_value2 (data); pop_stack(); } } #if TWO_PASS_DECODE_WORKS /* Run pass2 */ int re_decode(struct decode_data *data, int ignored) { JMP_BUF recovery; struct svalue orig_thrown; move_svalue (&orig_thrown, &throw_value); mark_free_svalue (&throw_value); if (SETJMP (recovery)) { UNSETJMP (recovery); call_handle_error(); move_svalue (&throw_value, &orig_thrown); free_decode_data (data, 0, 1); return 0; } else { data->next = current_decode; low_do_decode (data); UNSETJMP (recovery); move_svalue (&throw_value, &orig_thrown); free_decode_data (data, 0, 0); return 1; } } #endif static void error_free_decode_data (struct decode_data *data) { int delay; debug_malloc_touch (data); #if TWO_PASS_DECODE_WORKS delay=unlink_current_supporter(&data->supporter); call_dependants(& data->supporter, 1); #else delay = 0; #endif free_decode_data (data, delay, 1); } static INT32 my_decode(struct pike_string *tmp, struct object *codec #ifdef ENCODE_DEBUG , int debug #endif ) { struct decode_data *data; ONERROR err; /* Attempt to avoid infinite recursion on circular structures. */ for (data = current_decode; data; data=data->next) { if (data->raw == tmp && (codec ? data->codec == codec : !data->explicit_codec) #ifdef PIKE_THREADS && data->thread_state == Pike_interpreter.thread_state #endif ) { struct svalue *res; struct svalue val = SVALUE_INIT_INT (COUNTER_START); #ifndef HAVE_UNION_INIT val.u.integer = COUNTER_START; #endif if ((res = low_mapping_lookup(data->decoded, &val))) { push_svalue(res); return 1; } /* Possible recursion detected. */ /* return 0; */ } } data=ALLOC_STRUCT(decode_data); SET_SVAL(data->counter, T_INT, NUMBER_NUMBER, integer, COUNTER_START); data->data_str = tmp; data->data=(unsigned char *)tmp->str; data->len=tmp->len; data->ptr=0; data->codec=codec; data->explicit_codec = codec ? 1 : 0; data->pickyness=0; data->pass=1; data->unfinished_programs=0; data->unfinished_objects=0; data->unfinished_placeholders = NULL; data->delay_counter = 0; data->raw = tmp; data->next = current_decode; #ifdef PIKE_THREADS data->thread_state = Pike_interpreter.thread_state; data->thread_obj = Pike_interpreter.thread_state->thread_obj; #endif #ifdef ENCODE_DEBUG data->debug = debug; data->depth = -2; #endif if (tmp->size_shift || data->len < 5 || GETC() != 182 || GETC() != 'k' || GETC() != 'e' || GETC() != '0') { free( (char *) data); return 0; } data->decoded=allocate_mapping(128); add_ref (data->data_str); if (data->codec) add_ref (data->codec); #ifdef PIKE_THREADS add_ref (data->thread_obj); #endif SET_ONERROR(err, error_free_decode_data, data); #if TWO_PASS_DECODE_WORKS init_supporter(& data->supporter, (supporter_callback *) re_decode, (void *)data); #endif low_do_decode (data); { int delay; #if TWO_PASS_DECODE_WORKS delay=unlink_current_supporter(&data->supporter); call_dependants(& data->supporter, 1); #else delay = 0; #endif free_decode_data (data, delay, 0); } UNSET_ONERROR(err); return 1; } /*! @class MasterObject */ /*! @decl program Encoder; *! *! This program in the master is cloned and used as codec by *! @[encode_value] if it wasn't given any codec. An instance is only *! created on-demand the first time @[encode_value] encounters *! something for which it needs a codec, i.e. an object, program, or *! function. *! *! @seealso *! @[Encoder], @[Pike.Encoder] */ /*! @decl program Decoder; *! *! This program in the master is cloned and used as codec by *! @[decode_value] if it wasn't given any codec. An instance is only *! created on-demand the first time @[decode_value] encounters *! something for which it needs a codec, i.e. the result of a call to *! @[Pike.Encoder.nameof]. *! *! @seealso *! @[Decoder], @[Pike.Decoder] */ /*! @endclass */ /*! @class Encoder *! *! Codec used by @[encode_value()] to encode objects, functions and *! programs. Its purpose is to look up some kind of identifier for *! them, so they can be mapped back to the corresponding instance *! by @[decode_value()], rather than creating a new copy. */ /*! @decl mixed nameof(object|function|program x) *! *! Called by @[encode_value()] to encode objects, functions and programs. *! *! @returns *! Returns something encodable on success, typically a string. *! The returned value will be passed to the corresponding *! @[objectof()], @[functionof()] or @[programof()] by *! @[decode_value()]. *! *! If it returns @[UNDEFINED] then @[encode_value] starts to encode *! the thing recursively, so that @[decode_value] later will *! rebuild a copy. *! *! @note *! @[encode_value()] has fallbacks for some classes of objects, *! functions and programs. *! *! @seealso *! @[Decoder.objectof()], @[Decoder.functionof()], *! @[Decoder.objectof()] */ /*! @endclass */ /*! @class Decoder *! *! Codec used by @[decode_value()] to decode objects, functions and *! programs which have been encoded by @[Encoder.nameof] in the *! corresponding @[Encoder] object. */ /*! @decl object objectof(string data) *! *! Decode object encoded in @[data]. *! *! This function is called by @[decode_value()] when it encounters *! encoded objects. *! *! @param data *! Encoding of some object as returned by @[Encoder.nameof()]. *! *! @returns *! Returns the decoded object. *! *! @seealso *! @[functionof()], @[programof()] */ /*! @decl function functionof(string data) *! *! Decode function encoded in @[data]. *! *! This function is called by @[decode_value()] when it encounters *! encoded functions. *! *! @param data *! Encoding of some function as returned by @[Encoder.nameof()]. *! *! @returns *! Returns the decoded function. *! *! @seealso *! @[objectof()], @[programof()] */ /*! @decl program programof(string data) *! *! Decode program encoded in @[data]. *! *! This function is called by @[decode_value()] when it encounters *! encoded programs. *! *! @param data *! Encoding of some program as returned by @[Encoder.nameof()]. *! *! @returns *! Returns the decoded program. *! *! @seealso *! @[functionof()], @[objectof()] */ /*! @decl object __register_new_program(program p) *! *! Called to register the program that is being decoded. Might get *! called repeatedly with several other programs that are being *! decoded recursively. The only safe assumption is that when the *! top level thing being decoded is a program, then the first call *! will be with the unfinished embryo that will later become that *! program. *! *! @returns *! Returns either zero or a placeholder object. A placeholder *! object must be a clone of @[__null_program]. When the program is *! finished, the placeholder object will be converted to a clone of *! it. This is used for pike module objects. */ /*! @endclass */ /*! @class Codec *! *! An @[Encoder] and a @[Decoder] lumped into a single instance which *! can be used for both encoding and decoding. */ /*! @decl inherit Encoder; */ /*! @decl inherit Decoder; */ /*! @endclass */ /* Compatibility decoder */ static unsigned char extract_char(char **v, ptrdiff_t *l) { if(!*l) decode_error(current_decode, NULL, "Not enough place for char.\n"); else (*l)--; (*v)++; return ((unsigned char *)(*v))[-1]; } static ptrdiff_t extract_int(char **v, ptrdiff_t *l) { INT32 j; ptrdiff_t i; j=extract_char(v,l); if(j & 0x80) return (j & 0x7f); if((j & ~8) > 4) decode_error(current_decode, NULL, "Invalid integer.\n"); i=0; while(j & 7) { i=(i<<8) | extract_char(v,l); j--; } if(j & 8) return -i; return i; } static void rec_restore_value(char **v, ptrdiff_t *l) { ptrdiff_t t, i; i = extract_int(v,l); t = extract_int(v,l); switch(i) { case TAG_INT: push_int(DO_NOT_WARN(t)); return; case TAG_FLOAT: if(sizeof(ptrdiff_t) < sizeof(FLOAT_TYPE)) /* FIXME FIXME FIXME FIXME */ decode_error(current_decode, NULL, "Float architecture not supported.\n"); push_int(DO_NOT_WARN(t)); /* WARNING! */ SET_SVAL_TYPE(Pike_sp[-1], T_FLOAT); return; case TAG_TYPE: { decode_error(current_decode, NULL, "TAG_TYPE not supported yet.\n"); } return; case TAG_STRING: if(t<0) decode_error(current_decode, NULL, "length of string is negative.\n"); if(*l < t) decode_error(current_decode, NULL, "string too short\n"); push_string(make_shared_binary_string(*v, t)); (*l)-= t; (*v)+= t; return; case TAG_ARRAY: if(t<0) decode_error(current_decode, NULL, "length of array is negative.\n"); check_stack(t); for(i=0;i<t;i++) rec_restore_value(v,l); f_aggregate(DO_NOT_WARN(t)); /* FIXME: Unbounded stack consumption. */ return; case TAG_MULTISET: if(t<0) decode_error(current_decode, NULL, "length of multiset is negative.\n"); check_stack(t); for(i=0;i<t;i++) rec_restore_value(v,l); f_aggregate_multiset(DO_NOT_WARN(t)); /* FIXME: Unbounded stack consumption. */ return; case TAG_MAPPING: if(t<0) decode_error(current_decode, NULL, "length of mapping is negative.\n"); check_stack(t*2); for(i=0;i<t;i++) { rec_restore_value(v,l); rec_restore_value(v,l); } f_aggregate_mapping(DO_NOT_WARN(t*2)); /* FIXME: Unbounded stack consumption. */ return; case TAG_OBJECT: if(t<0) decode_error(current_decode, NULL, "length of object is negative.\n"); if(*l < t) decode_error(current_decode, NULL, "string too short\n"); push_string(make_shared_binary_string(*v, t)); (*l) -= t; (*v) += t; APPLY_MASTER("objectof", 1); return; case TAG_FUNCTION: if(t<0) decode_error(current_decode, NULL, "length of function is negative.\n"); if(*l < t) decode_error(current_decode, NULL, "string too short\n"); push_string(make_shared_binary_string(*v, t)); (*l) -= t; (*v) += t; APPLY_MASTER("functionof", 1); return; case TAG_PROGRAM: if(t<0) decode_error(current_decode, NULL, "length of program is negative.\n"); if(*l < t) decode_error(current_decode, NULL, "string too short\n"); push_string(make_shared_binary_string(*v, t)); (*l) -= t; (*v) += t; APPLY_MASTER("programof", 1); return; default: decode_error(current_decode, NULL, "Unknown type tag %ld:%ld\n", PTRDIFF_T_TO_LONG(i), PTRDIFF_T_TO_LONG(t)); } } static void restore_current_decode (struct decode_data *old_data) { current_decode = old_data; } /* Defined in builtin.cmod. */ extern struct program *MasterCodec_program; /*! @decl mixed decode_value(string coded_value, void|Codec codec) *! *! Decode a value from the string @[coded_value]. *! *! This function takes a string created with @[encode_value()] or *! @[encode_value_canonic()] and converts it back to the value that was *! coded. *! *! If @[codec] is specified, it's used as the codec for the decode. *! If none is specified, then one is instantiated through *! @expr{master()->Decoder()@}. As a compatibility fallback, the *! master itself is used if it has no @expr{Decoder@} class. *! *! @seealso *! @[encode_value()], @[encode_value_canonic()] */ void f_decode_value(INT32 args) { struct pike_string *s; struct object *codec; #ifdef ENCODE_DEBUG int debug = 0; #endif /* ENCODE_DEBUG */ check_all_args("decode_value", args, BIT_STRING, BIT_VOID | BIT_OBJECT | BIT_ZERO, #ifdef ENCODE_DEBUG /* This argument is only an internal debug helper. * It's intentionally not part of the function * prototype, to keep the argument position free for * other uses in the future. */ BIT_VOID | BIT_INT, #endif 0); s = Pike_sp[-args].u.string; switch (args) { default: #ifdef ENCODE_DEBUG debug = Pike_sp[2-args].u.integer; /* Fall through. */ case 2: #endif if (TYPEOF(Pike_sp[1-args]) == T_OBJECT) { if (SUBTYPEOF(Pike_sp[1-args])) { struct decode_data data; memset (&data, 0, sizeof (data)); data.data_str = s; /* Not refcounted. */ decode_error(&data, NULL, "The codec may not be a subtyped object yet.\n"); } codec = Pike_sp[1-args].u.object; break; } /* Fall through. */ case 1: if (!get_master()) { /* The codec used for decoding the master program. */ push_object (clone_object (MasterCodec_program, 0)); args++; codec = Pike_sp[-1].u.object; } else codec = NULL; } if(!my_decode(s, codec #ifdef ENCODE_DEBUG , debug #endif )) { char *v=s->str; ptrdiff_t l=s->len; struct decode_data data; ONERROR uwp; memset (&data, 0, sizeof (data)); data.data_str = s; /* Not refcounted. */ SET_ONERROR (uwp, restore_current_decode, current_decode); current_decode = &data; rec_restore_value(&v, &l); CALL_AND_UNSET_ONERROR (uwp); } assign_svalue(Pike_sp-args-1, Pike_sp-1); pop_n_elems(args); }

pike.git/ src/ encode.c > 68843207c7e637af849c1e5c2915b9d7e4021649 [Annotate]