pike.git/src/stralloc.c:c77edbc5d9a675ea07759c2588047a440cfbc3c1

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 /* || 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 "buffer.h" #include "pike_macros.h" #include "pike_memory.h" #include "pike_error.h" #include "gc.h" #include "bignum.h" #include "interpret.h" #include "operators.h" #include "pike_float.h" #include "pike_types.h" #include "block_allocator.h" #include "whitespace.h" #include "stuff.h" #include <errno.h> #define SET_HSIZE(X) htable_mask=(htable_size=(X))-1 #define HMODULO(X) ((X) & (htable_mask)) static unsigned INT32 htable_mask; #if (SIZEOF_LONG == 4) && defined(_LP64) /* Kludge for gcc and the system header files not using the same model... */ #undef LONG_MIN #undef LONG_MAX #undef ULONG_MAX #define LONG_MIN INT_MIN #define LONG_MAX INT_MAX #define ULONG_MAX UINT_MAX #endif #define BEGIN_HASH_SIZE 1024 static unsigned int hash_prefix_len=64; static unsigned int need_more_hash_prefix_depth=0; static unsigned int need_new_hashkey_depth=0; static size_t hashkey = 0; static unsigned INT32 htable_size=0; static struct pike_string **base_table=0; static unsigned INT32 num_strings=0; PMOD_EXPORT struct pike_string *empty_pike_string = 0; /*** Main string hash function ***/ #define StrHash(s,len) low_do_hash(s,len,0) #define low_do_hash(STR,LEN,SHIFT) low_hashmem( (STR), (LEN)<<(SHIFT), hash_prefix_len<<(SHIFT), hashkey ) #define do_hash(STR) low_do_hash(STR->str,STR->len,STR->size_shift) /* Returns true if str could contain n. */ PMOD_EXPORT int string_range_contains( struct pike_string *str, int n ) { INT32 min, max; check_string_range( str, 1, &min, &max ); if( n >= min && n <= max ) return 1; return 0; } /* Returns true if str2 could be in str1. */ PMOD_EXPORT int string_range_contains_string( struct pike_string *str1, struct pike_string *str2 ) { INT32 max1, min1; INT32 max2, min2; if( !str2->len ) return 1; /* Empty string is part of every string */ check_string_range( str1, 1, &min1, &max1 ); check_string_range( str2, 1, &min2, &max2 ); if( (min2 < min1) || (max2 > max1) ) { if( (str1->flags & STRING_CONTENT_CHECKED) == (str2->flags & STRING_CONTENT_CHECKED) ) return 0; /* fallback to simple size-shift check. */ return str1->size_shift >= str2->size_shift; } return 1; } PMOD_EXPORT void check_string_range( struct pike_string *str, int loose, INT32 *min, INT32 *max ) { INT32 s_min = MAX_INT32; INT32 s_max = MIN_INT32; ptrdiff_t i; if( loose || ((str->flags & STRING_CONTENT_CHECKED ) && (!str->size_shift || !max)) ) { if( str->flags & STRING_CONTENT_CHECKED ) { switch (str->size_shift) { case eightbit: s_min = str->min; s_max = str->max; break; case sixteenbit: s_min = str->min; s_max = str->max; s_min *= 256; s_max *= 256; s_max += 255; break; case thirtytwobit: { unsigned INT32 tmp; tmp = str->min; tmp *= (1 << 24); s_min = tmp; tmp = str->max; tmp *= (1 << 24); tmp += (1 << 24) - 1; s_max = tmp; break; } } } else { switch( str->size_shift ) { case 2: s_min = MIN_INT32; s_max=MAX_INT32; break; case 1: s_min = 0; s_max = 65535; break; case 0: s_min = 0; s_max = 255; break; } } } else { str->flags |= STRING_CONTENT_CHECKED; switch( str->size_shift ) { case 0: { p_wchar0 *p = (p_wchar0*)str->str; int upper = 0, lower = 0; for( i=0; i<str->len; i++,p++ ) { /* For 7-bit strings it's easy to check for * lower/uppercase, so do that here as well. */ if( *p >= 'A' && *p <= 'Z') upper++; if( *p >= 'a' && *p <= 'z') lower++; if( *p > s_max ) s_max = *p; if( *p < s_min ) s_min = *p; } if( s_max < 128 ) { if( !lower ) str->flags |= STRING_IS_UPPERCASE; if( !upper ) str->flags |= STRING_IS_LOWERCASE; } } str->min = s_min; str->max = s_max; break; case 1: { p_wchar1 *p = (p_wchar1*)str->str; for( i=0; i<str->len; i++,p++ ) { if( *p > s_max ) s_max = *p; if( *p < s_min ) s_min = *p; } } str->min = s_min / 256; str->max = s_max / 256; break; case 2: { p_wchar2 *p = (p_wchar2*)str->str; for( i=0; i<str->len; i++,p++ ) { if( *p > s_max ) s_max = *p; if( *p < s_min ) s_min = *p; } } str->min = (unsigned INT32)s_min / (1 << 24); str->max = (unsigned INT32)s_max / (1 << 24); break; } } if( min ) *min = s_min; if( max ) *max = s_max; } void low_set_index(struct pike_string *s, ptrdiff_t pos, int value) { #ifdef PIKE_DEBUG if(pos > s->len || pos<0) { if (s->len) { Pike_fatal("String index %"PRINTPTRDIFFT"d is out of " "range 0..%"PRINTPTRDIFFT"d.\n", pos, s->len-1); } else { Pike_fatal("Attempt to index the empty string with %"PRINTPTRDIFFT"d.\n", pos); } } if(pos == s->len && value) Pike_fatal("string zero termination foul!\n"); #endif s->flags |= STRING_NOT_HASHED; if(!s->size_shift) STR0(s)[pos]=value; else if(s->size_shift == 1) STR1(s)[pos]=value; else STR2(s)[pos]=value; } #ifdef PIKE_DEBUG PMOD_EXPORT struct pike_string *debug_check_size_shift(const struct pike_string *a, enum size_shift shift) { if(a->size_shift != shift) Pike_fatal("Wrong STRX macro used!\n"); return (struct pike_string*)a; } #endif #define CONVERT(FROM,TO) \ void PIKE_CONCAT4(convert_,FROM,_to_,TO) (PIKE_CONCAT(p_wchar,TO) *to, \ const PIKE_CONCAT(p_wchar,FROM) *from, \ ptrdiff_t len) \ { \ while(--len>=0) *(to++)= (PIKE_CONCAT (p_wchar, TO)) *(from++); \ } CONVERT(0,1) CONVERT(0,2) CONVERT(1,0) CONVERT(1,2) CONVERT(2,0) CONVERT(2,1) #define TWO_SIZES(X,Y) (((X)<<2)+(Y)) void generic_memcpy(PCHARP to, const PCHARP from, ptrdiff_t len) { #ifdef PIKE_DEBUG if(len<0) Pike_fatal("Cannot copy %ld bytes!\n", (long)len); #endif switch(TWO_SIZES(from.shift,to.shift)) { case TWO_SIZES(0,0): convert_0_to_0((p_wchar0 *)to.ptr,(p_wchar0 *)from.ptr,len); break; case TWO_SIZES(0,1): convert_0_to_1((p_wchar1 *)to.ptr,(p_wchar0 *)from.ptr,len); break; case TWO_SIZES(0,2): convert_0_to_2((p_wchar2 *)to.ptr,(p_wchar0 *)from.ptr,len); break; case TWO_SIZES(1,0): convert_1_to_0((p_wchar0 *)to.ptr,(p_wchar1 *)from.ptr,len); break; case TWO_SIZES(1,1): convert_1_to_1((p_wchar1 *)to.ptr,(p_wchar1 *)from.ptr,len); break; case TWO_SIZES(1,2): convert_1_to_2((p_wchar2 *)to.ptr,(p_wchar1 *)from.ptr,len); break; case TWO_SIZES(2,0): convert_2_to_0((p_wchar0 *)to.ptr,(p_wchar2 *)from.ptr,len); break; case TWO_SIZES(2,1): convert_2_to_1((p_wchar1 *)to.ptr,(p_wchar2 *)from.ptr,len); break; case TWO_SIZES(2,2): convert_2_to_2((p_wchar2 *)to.ptr,(p_wchar2 *)from.ptr,len); break; } } PMOD_EXPORT void pike_string_cpy(PCHARP to, const struct pike_string *from) { generic_memcpy(to,MKPCHARP_STR(from),from->len); } #ifdef PIKE_DEBUG #ifdef DEBUG_MALLOC #define DM(X) X #else #define DM(X) #endif PMOD_EXPORT p_wchar2 index_shared_string(const struct pike_string *s, ptrdiff_t pos) { if(pos > s->len || pos<0) { if (s->len) { Pike_fatal("String index %"PRINTPTRDIFFT"d is out of " "range 0..%"PRINTPTRDIFFT"d.\n", pos, s->len-1); } else { Pike_fatal("Attempt to index the empty string with %"PRINTPTRDIFFT"d.\n", pos); } } return generic_extract(s->str,s->size_shift,pos); } PMOD_EXPORT p_wchar2 generic_extract (const void *str, int size, ptrdiff_t pos) { switch(size) { case 0: return ((p_wchar0 *)str)[pos]; case 1: return ((p_wchar1 *)str)[pos]; case 2: return ((p_wchar2 *)str)[pos]; } UNREACHABLE(return 0); } static void locate_problem(int (*isproblem)(const struct pike_string *)) { unsigned INT32 e; struct pike_string *s; DM(struct memhdr *yes=alloc_memhdr()); DM(struct memhdr *no=alloc_memhdr()); for(e=0;e<htable_size;e++) { for(s=base_table[e];s;s=s->next) { if(isproblem(s)) { fprintf(stderr,"***Guilty string:\n"); debug_dump_pike_string(s, 70); DM(add_marks_to_memhdr(yes,s)); }else{ DM(add_marks_to_memhdr(no,s)); } } } DM(fprintf(stderr,"Plausible problem location(s):\n")); DM(dump_memhdr_locations(yes,0,0)); DM(fprintf(stderr,"More Plausible problem location(s):\n")); DM(dump_memhdr_locations(yes,no,0)); } static int bad_pointer(const struct pike_string *s) { return (((ptrdiff_t)s)&(sizeof(struct pike_string *)-1)); } static int has_zero_refs(const struct pike_string *s) { return s->refs<=0; } static int wrong_hash(const struct pike_string *s) { return s->hval != do_hash(s); } static int improper_zero_termination(const struct pike_string *s) { return index_shared_string(s,s->len); } #else #define locate_problem(X) #endif /* PIKE_DEBUG */ /* Find a string in the shared string table. * This assumes that the string is minimized!!!! */ static struct pike_string *internal_findstring(const char *s, ptrdiff_t len, enum size_shift size_shift, size_t hval) { struct pike_string *curr; //,**prev, **base; unsigned int depth=0; unsigned int prefix_depth=0; size_t h; h=HMODULO(hval); for(curr = base_table[h]; curr; curr = curr->next) { #ifdef PIKE_DEBUG if(curr->refs<1) { debug_dump_pike_string(curr, 70); locate_problem(has_zero_refs); Pike_fatal("String with no references.\n"); } #endif debug_malloc_touch(curr); if ( len == curr->len && size_shift == curr->size_shift && hval == curr->hval && ( curr->str == s || !memcmp(curr->str, s,len<<size_shift))) /* found it */ return curr; depth++; if (curr->len > (ptrdiff_t)hash_prefix_len) prefix_depth++; } if (depth > need_new_hashkey_depth) { /* Keep track of whether the hashtable is getting unbalanced. */ need_new_hashkey_depth = depth; } /* These heuruistics might require tuning! /Hubbe */ if (prefix_depth > need_more_hash_prefix_depth) { #if 0 fprintf(stderr, "prefix_depth=%d num_strings=%d need_more_hash_prefix_depth=%d\n" " hash_prefix_len=%d\n", prefix_depth, num_strings, need_more_hash_prefix_depth, hash_prefix_len); #endif /* 0 */ need_more_hash_prefix_depth = prefix_depth; } return 0; /* not found */ } /** * Finds an 8-bit string in the shared string table. Returns 0 on failure. * @param str Pointer to the start of the string. * @param len The number of characters in the string. */ struct pike_string *binary_findstring(const char *str, ptrdiff_t len) { return internal_findstring(str, len, 0, StrHash(str,len)); } struct pike_string *findstring(const char *foo) { return binary_findstring(foo, strlen(foo)); } /*** rehash ***/ static void rehash_string_backwards(struct pike_string *s) { struct pike_string *prev = NULL; struct pike_string *next; if(!s) return; /* Reverse the hash list. */ while ((next = s->next)) { s->next = prev; prev = s; s = next; } s->next = prev; /* Rehash the strings for this list. */ do { ptrdiff_t h = HMODULO(s->hval); next = s->next; s->next = base_table[h]; base_table[h] = s; } while ((s = next)); } static void stralloc_rehash(void) { int h,old; struct pike_string **old_base; old=htable_size; old_base=base_table; SET_HSIZE(htable_size<<1); base_table=xcalloc(sizeof(struct pike_string *), htable_size); need_more_hash_prefix_depth = 0; for(h=0;h<old;h++) rehash_string_backwards(old_base[h]); if(old_base) free(old_base); } /* Allocation of strings */ #define STRING_BLOCK 2048 static struct block_allocator string_allocator = BA_INIT_PAGES(sizeof(struct pike_string), 2); static struct block_allocator substring_allocator = BA_INIT_PAGES(sizeof(struct substring_pike_string), 1); static void free_string_content(struct pike_string * s) { switch (s->alloc_type) { case STRING_ALLOC_STATIC: break; case STRING_ALLOC_MALLOC: free(s->str); break; case STRING_ALLOC_BA: ba_free(&string_allocator, s->str); break; case STRING_ALLOC_SUBSTRING: free_string(((struct substring_pike_string*)s)->parent); break; } } static void free_unlinked_pike_string(struct pike_string * s) { free_string_content(s); switch(s->struct_type) { case STRING_STRUCT_STRING: ba_free(&string_allocator, s); break; case STRING_STRUCT_SUBSTRING: ba_free(&substring_allocator, s); break; } } /* note that begin_shared_string expects the _exact_ size of the string, * not the maximum size */ PMOD_EXPORT struct pike_string *debug_begin_shared_string(size_t len) { return debug_begin_wide_shared_string(len, 0); } static void link_pike_string(struct pike_string *s, size_t hval) { size_t h; #ifdef PIKE_DEBUG if (!(s->flags & STRING_NOT_SHARED)) { debug_dump_pike_string(s, 70); Pike_fatal("String already linked.\n"); } if (PIKE_MEM_NOT_DEF_RANGE (s->str, (s->len + 1) << s->size_shift)) Pike_fatal ("Got undefined contents in pike string %p.\n", s); #endif h=HMODULO(hval); s->next = base_table[h]; base_table[h] = s; s->hval=hval; s->flags &= ~(STRING_NOT_HASHED|STRING_NOT_SHARED); num_strings++; if(num_strings > htable_size) { stralloc_rehash(); } /* These heuristics might require tuning! /Hubbe */ if((need_more_hash_prefix_depth > 4) || (need_new_hashkey_depth > 128)) { /* Changed heuristic 2005-01-17: * * Increase hash_prefix_len if there's some bucket containing * more than 4 strings that are longer * than hash_prefix_len. * /grubba * * Changed heuristic 2011-12-30: * * Generate a new hash key if there's some bucket containing * more than 16 strings. This ought to * suffice to alleviate the #hashdos vulnerability. * * /grubba */ /* This could in theory have a pretty ugly complexity * /Hubbe */ if (need_new_hashkey_depth > 128) { /* A simple mixing function. */ hashkey ^= (hashkey << 5) ^ (current_time.tv_sec ^ current_time.tv_usec); need_new_hashkey_depth = 0; } if (need_more_hash_prefix_depth > 4) hash_prefix_len=hash_prefix_len*2; /* NOTE: No need to update to the correct values, since that will * be done on demand. */ need_more_hash_prefix_depth=0; for(h=0;h<htable_size;h++) { struct pike_string *tmp=base_table[h]; base_table[h]=0; while(tmp) { size_t h2; struct pike_string *tmp2=tmp; /* First unlink */ tmp=tmp2->next; tmp2->hval=do_hash(tmp2); /* compute new hash value */ h2=HMODULO(tmp2->hval); tmp2->next=base_table[h2]; /* and re-hash */ base_table[h2]=tmp2; } } } } PMOD_EXPORT struct pike_string *debug_begin_wide_shared_string(size_t len, enum size_shift shift) { struct pike_string *t = NULL; size_t bytes; ONERROR fe; if ((ptrdiff_t)len < 0 || DO_SIZE_T_ADD_OVERFLOW(len, 1, &bytes) || DO_SIZE_T_MUL_OVERFLOW(bytes, 1 << shift, &bytes)) { Pike_error("String is too large.\n"); } #ifdef PIKE_DEBUG if(d_flag>10) verify_shared_strings_tables(); #endif #ifdef PIKE_DEBUG if (shift > 2) Pike_fatal("Unsupported string shift: %d\n", shift); #endif /* PIKE_DEBUG */ t=ba_alloc(&string_allocator); /* we mark the string as static here, to avoid double free if the * allocations fail */ t->flags = STRING_NOT_HASHED|STRING_NOT_SHARED; t->alloc_type = STRING_ALLOC_STATIC; t->struct_type = STRING_STRUCT_STRING; SET_ONERROR(fe,free_unlinked_pike_string,t); if (bytes <= sizeof(struct pike_string)) { t->str = ba_alloc(&string_allocator); t->alloc_type = STRING_ALLOC_BA; } else { t->str = xalloc(bytes); t->alloc_type = STRING_ALLOC_MALLOC; } t->refs = 0; t->size_shift=shift; add_ref(t); /* For DMALLOC */ t->len=len; DO_IF_DEBUG(t->next = NULL); UNSET_ONERROR(fe); low_set_index(t,len,0); return t; } static struct pike_string * make_static_string(const char * str, size_t len, enum size_shift shift) { struct pike_string * t = ba_alloc(&string_allocator); t->flags = STRING_NOT_HASHED|STRING_NOT_SHARED; t->size_shift = shift; t->alloc_type = STRING_ALLOC_STATIC; t->struct_type = STRING_STRUCT_STRING; t->str = (char *)str; t->refs = 0; t->len = len; add_ref(t); /* For DMALLOC */ return t; } PMOD_EXPORT struct pike_string * make_shared_static_string(const char *str, size_t len, enum size_shift shift) { struct pike_string *s; ptrdiff_t h = StrHash(str, len); s = internal_findstring(str,len,shift,h); if (!s) { s = make_static_string(str, len, shift); link_pike_string(s, h); } else { if (!string_is_static(s)) { free_string_content(s); s->alloc_type = STRING_ALLOC_STATIC; s->str = (char*)str; } add_ref(s); } return s; } PMOD_EXPORT struct pike_string * make_shared_malloc_string(char *str, size_t len, enum size_shift shift) { struct pike_string *s; ptrdiff_t h = StrHash(str, len); s = internal_findstring(str,len,shift,h); if (!s) { s = ba_alloc(&string_allocator); s->flags = STRING_NOT_HASHED|STRING_NOT_SHARED; s->size_shift = shift; s->alloc_type = STRING_ALLOC_MALLOC; s->struct_type = STRING_STRUCT_STRING; s->str = str; s->refs = 0; s->len = len; add_ref(s); link_pike_string(s, h); } else { free(str); add_ref(s); } return s; } /* * This function assumes that the shift size is already the minimum it * can be. */ struct pike_string *low_end_shared_string(struct pike_string *s) { ptrdiff_t len; size_t h=0; struct pike_string *s2; #ifdef PIKE_DEBUG if (d_flag) { switch (s->size_shift) { case 0: break; case 1: if(!find_magnitude1(STR1(s),s->len)) Pike_fatal ("String %p that should have shift 1 really got 0.\n", s); break; case 2: { int m = find_magnitude2 (STR2 (s), s->len); if (m != 2) Pike_fatal ("String %p that should have shift 2 really got %d.\n", s, m); break; } default: Pike_fatal("ARGHEL! size_shift:%d\n", s->size_shift); } } #endif len = s->len; if (s->flags & STRING_NOT_HASHED) { h = s->hval = do_hash(s); s->flags &= ~STRING_NOT_HASHED; } s2 = internal_findstring(s->str, len, s->size_shift, h); #ifdef PIKE_DEBUG if(s2==s) Pike_fatal("end_shared_string called twice! (or something like that)\n"); #endif if(s2) { free_string(s); s = s2; add_ref(s); }else{ link_pike_string(s, h); } return s; } /* * This function checks if the shift size can be decreased before * entering the string in the shared string table */ PMOD_EXPORT struct pike_string *end_shared_string(struct pike_string *s) { struct pike_string *s2; switch(UNLIKELY(s->size_shift)) { case 2: switch(find_magnitude2(STR2(s),s->len)) { case 0: s2=begin_shared_string(s->len); convert_2_to_0(STR0(s2),STR2(s),s->len); free_string(s); s=s2; break; case 1: s2=begin_wide_shared_string(s->len,1); convert_2_to_1(STR1(s2),STR2(s),s->len); free_string(s); s=s2; /* Fall though */ } break; case 1: if(!find_magnitude1(STR1(s),s->len)) { s2=begin_shared_string(s->len); convert_1_to_0(STR0(s2),STR1(s),s->len); free_string(s); s=s2; } break; case 0: break; } return low_end_shared_string(s); } PMOD_EXPORT struct pike_string *end_and_resize_shared_string(struct pike_string *str, ptrdiff_t len) { struct pike_string *tmp; #ifdef PIKE_DEBUG if(len > str->len) Pike_fatal("Cannot extend string here!\n"); #endif if (len == str->len) { return end_shared_string(str); } tmp = make_shared_binary_pcharp(MKPCHARP_STR(str),len); free_string(str); return tmp; } PMOD_EXPORT struct pike_string * debug_make_shared_binary_string(const char *str,size_t len) { struct pike_string *s; ptrdiff_t h = StrHash(str, len); s = internal_findstring(str,len,0,h); if (!s) { s=begin_shared_string(len); memcpy(s->str, str, len); link_pike_string(s, h); } else { add_ref(s); } return s; } PMOD_EXPORT struct pike_string * debug_make_shared_binary_pcharp(const PCHARP str,size_t len) { switch(str.shift) { case 0: return make_shared_binary_string((char *)(str.ptr), len); case 1: return make_shared_binary_string1((p_wchar1 *)(str.ptr), len); case 2: return make_shared_binary_string2((p_wchar2 *)(str.ptr), len); } UNREACHABLE(return NULL); } PMOD_EXPORT struct pike_string * debug_make_shared_pcharp(const PCHARP str) { return debug_make_shared_binary_pcharp(str, pcharp_strlen(str)); } PMOD_EXPORT struct pike_string * debug_make_shared_binary_string0(const p_wchar0 *str,size_t len) { return debug_make_shared_binary_string((const char *)str, len); } PMOD_EXPORT struct pike_string * debug_make_shared_binary_string1(const p_wchar1 *str,size_t len) { struct pike_string *s; ptrdiff_t h; if(!find_magnitude1(str,len)) { /* Wrong size, convert */ s=begin_shared_string(len); convert_1_to_0(STR0(s),str,len); return end_shared_string(s); } h=low_do_hash(str, len, 1); s = internal_findstring((char *)str,len,1,h); if (!s) { s=begin_wide_shared_string(len,1); memcpy(s->str, str, len<<1); link_pike_string(s, h); } else { add_ref(s); } return s; } PMOD_EXPORT struct pike_string * debug_make_shared_binary_string2(const p_wchar2 *str,size_t len) { struct pike_string *s; ptrdiff_t h; switch(find_magnitude2(str,len)) { case 0: /* Wrong size, convert */ s=begin_shared_string(len); convert_2_to_0(STR0(s),str,len); return end_shared_string(s); case 1: /* Wrong size, convert */ s=begin_wide_shared_string(len,1); convert_2_to_1(STR1(s),str,len); return end_shared_string(s); /* not entirely optimal */ } h=low_do_hash(str, len, 2); s = internal_findstring((char *)str,len,2,h); if (!s) { s=begin_wide_shared_string(len,2); memcpy(s->str, str, len<<2); link_pike_string(s, h); } else { add_ref(s); } return s; } PMOD_EXPORT struct pike_string *debug_make_shared_string(const char *str) { return make_shared_binary_string(str, strlen(str)); } PMOD_EXPORT struct pike_string *debug_make_shared_string0(const p_wchar0 *str) { return debug_make_shared_string((const char *)str); } PMOD_EXPORT struct pike_string *debug_make_shared_string1(const p_wchar1 *str) { INT32 len; for(len=0;str[len];len++); return debug_make_shared_binary_string1(str,len); } PMOD_EXPORT struct pike_string *debug_make_shared_string2(const p_wchar2 *str) { INT32 len; for(len=0;str[len];len++); return debug_make_shared_binary_string2(str,len); } /*** Free strings ***/ void unlink_pike_string(struct pike_string *s) { size_t h=HMODULO(s->hval); struct pike_string *tmp=base_table[h], *p=NULL; while( tmp ) { if( tmp == s ) { if( p ) p->next = s->next; else base_table[h] = s->next; break; } p = tmp; tmp = tmp->next; } if( !tmp ) Pike_fatal("unlink on non-shared string\n"); s->next=(struct pike_string *)(ptrdiff_t)-1; num_strings--; s->flags |= STRING_NOT_SHARED; } PMOD_EXPORT void do_free_string(struct pike_string *s) { if (s) free_string(s); } PMOD_EXPORT void do_free_unlinked_pike_string(struct pike_string *s) { if (s) free_unlinked_pike_string(s); } PMOD_EXPORT void really_free_string(struct pike_string *s) { #ifdef PIKE_DEBUG if (s->refs) { #ifdef DEBUG_MALLOC describe_something(s, T_STRING, 0,2,0, NULL); #endif Pike_fatal("Freeing string with %d references.\n", s->refs); } if(d_flag > 2 && !(s->flags & STRING_NOT_SHARED)) { if(s->next == (struct pike_string *)(ptrdiff_t)-1) Pike_fatal("Freeing shared string again!\n"); if(((ptrdiff_t)s->next) & 1) Pike_fatal("Freeing shared string again, memory corrupt or other bug!\n"); } if (s->size_shift > 2) { Pike_fatal("Freeing string with bad shift (0x%08x); could it be a type?\n", s->size_shift); } #endif if (!(s->flags & STRING_NOT_SHARED)) unlink_pike_string(s); if (s->flags & STRING_CLEAR_ON_EXIT) guaranteed_memset(s->str, 0, s->len<<s->size_shift); free_unlinked_pike_string(s); GC_FREE_SIMPLE_BLOCK(s); } void do_really_free_string(struct pike_string *s) { if (s) really_free_string(s); } PMOD_EXPORT void debug_free_string(struct pike_string *s) { if(!sub_ref(s)) really_free_string(s); } /* * String table status */ struct pike_string *add_string_status(int verbose) { struct string_builder s; init_string_builder(&s, 0); if (verbose) { long alloced_strings[8] = {0,0,0,0,0,0,0,0}; long alloced_bytes[8] = {0,0,0,0,0,0,0,0}; long num_distinct_strings[8] = {0,0,0,0,0,0,0,0}; long bytes_distinct_strings[8] = {0,0,0,0,0,0,0,0}; long overhead_bytes[8] = {0,0,0,0,0,0,0,0}; unsigned INT32 e; struct pike_string *p; for(e=0;e<htable_size;e++) { for(p=base_table[e];p;p=p->next) { int key = p->size_shift + (string_is_malloced(p)?4:0); num_distinct_strings[key]++; alloced_bytes[key] += p->refs*sizeof(struct pike_string); alloced_strings[key] += p->refs; if (string_is_block_allocated(p)) { alloced_bytes[key] += p->refs*sizeof(struct pike_string); } else { alloced_bytes[key] += p->refs*DO_ALIGN((p->len+3) << p->size_shift,sizeof(void *)); } } } string_builder_sprintf(&s, "\nShared string hash table:\n" "-------------------------\n" "\n" "Type Count Distinct Bytes Actual Overhead %%\n" "------------------------------------------------------------\n"); for(e = 0; e < 8; e++) { int shift = e & 3; ptrdiff_t overhead; if (!num_distinct_strings[e]) continue; if (shift != 3) { if (e < 4) { string_builder_sprintf(&s, "Short/%-2d ", 8<<shift); } else { string_builder_sprintf(&s, "Long/%-2d ", 8<<shift); } overhead_bytes[e] = (long)sizeof(struct pike_string) * num_distinct_strings[e]; alloced_strings[e|3] += alloced_strings[e]; alloced_bytes[e|3] += alloced_bytes[e]; num_distinct_strings[e|3] += num_distinct_strings[e]; bytes_distinct_strings[e|3] += bytes_distinct_strings[e]; overhead_bytes[e|3] += overhead_bytes[e]; } else { if (e < 4) { string_builder_sprintf(&s, "Total short"); } else { string_builder_sprintf(&s, "Total long "); } } string_builder_sprintf(&s, "%8ld %8ld %8ld %8ld %8ld ", alloced_strings[e], num_distinct_strings[e], alloced_bytes[e], bytes_distinct_strings[e], overhead_bytes[e]); if (alloced_bytes[e]) { string_builder_sprintf(&s, "%4d\n", (bytes_distinct_strings[e] + overhead_bytes[e]) * 100 / alloced_bytes[e]); } else { string_builder_strcat(&s, " -\n"); } } alloced_strings[7] += alloced_strings[3]; alloced_bytes[7] += alloced_bytes[3]; num_distinct_strings[7] += num_distinct_strings[3]; bytes_distinct_strings[7] += bytes_distinct_strings[3]; overhead_bytes[7] += overhead_bytes[3]; string_builder_sprintf(&s, "------------------------------------------------------------\n" "Total %8ld %8ld %8ld %8ld %8ld ", alloced_strings[7], num_distinct_strings[7], alloced_bytes[7], bytes_distinct_strings[7], overhead_bytes[7]); if (alloced_bytes[7]) { string_builder_sprintf(&s, "%4d\n", (bytes_distinct_strings[7] + overhead_bytes[7]) * 100 / alloced_bytes[7]); } else { string_builder_strcat(&s, " -\n"); } } /* sprintf(b,"Searches: %ld Average search length: %6.3f\n", (long)num_str_searches, (double)search_len / num_str_searches); my_strcat(b); */ return finish_string_builder(&s); } #ifdef PIKE_DEBUG static long last_stralloc_verify=0; extern long current_do_debug_cycle; PMOD_EXPORT void check_string(struct pike_string *s) { if(current_do_debug_cycle == last_stralloc_verify) { if(debug_findstring(s) != s) Pike_fatal("Shared string not shared.\n"); }else{ switch (s->size_shift) { case 0: break; case 1: { ptrdiff_t i; p_wchar1 *str = STR1 (s); for (i = 0; i < s->len; i++) if (str[i] > 0xff) goto size_shift_check_done; Pike_fatal ("Shared string is too wide.\n"); } case 2: { ptrdiff_t i; p_wchar2 *str = STR2 (s); for (i = 0; i < s->len; i++) if ((str[i] > 0xffff) || (str[i] < 0)) goto size_shift_check_done; Pike_fatal ("Shared string is too wide.\n"); } default: Pike_fatal ("Invalid size shift %d.\n", s->size_shift); } size_shift_check_done:; if(do_hash(s) != s->hval) { locate_problem(wrong_hash); Pike_fatal("Hash value changed?\n"); } if(debug_findstring(s) != s) Pike_fatal("Shared string not shared.\n"); if(index_shared_string(s,s->len)) { locate_problem(improper_zero_termination); Pike_fatal("Shared string is not zero terminated properly.\n"); } } } PMOD_EXPORT void verify_shared_strings_tables(void) { unsigned INT32 e, h, num=0; struct pike_string *s; last_stralloc_verify=current_do_debug_cycle; for(e=0;e<htable_size;e++) { h=0; for(s=base_table[e];s;s=s->next) { num++; h++; if (bad_pointer(s)) { Pike_fatal("Odd string pointer in string table!\n"); } if(s->len < 0) Pike_fatal("Shared string shorter than zero bytes.\n"); if(s->refs <= 0) { locate_problem(has_zero_refs); Pike_fatal("Shared string had too few references.\n"); } if(index_shared_string(s,s->len)) { locate_problem(improper_zero_termination); Pike_fatal("Shared string didn't end with a zero.\n"); } if(do_hash(s) != s->hval) { locate_problem(wrong_hash); Pike_fatal("Shared string hashed to other number.\n"); } if(HMODULO(s->hval) != e) { locate_problem(wrong_hash); Pike_fatal("Shared string hashed to wrong place.\n"); } if(h>10000) { struct pike_string *s2; for(s2=s;s2;s2=s2->next) if(s2 == s) Pike_fatal("Shared string table is cyclic.\n"); h=0; } } } if(num != num_strings) Pike_fatal("Num strings is wrong %d!=%d\n",num,num_strings); } /* For once, this is actually a debug function! * * This function is mostly used to check that the argument * is a finished string. */ const struct pike_string *debug_findstring(const struct pike_string *s) { size_t h; struct pike_string *p; if(!base_table) return NULL; h = HMODULO(s->hval); for(p=base_table[h];p;p=p->next) { if(p==s) { return s; } } return NULL; } int safe_debug_findstring(const struct pike_string *foo) { unsigned INT32 e; if(!base_table) return 0; for(e=0;e<htable_size;e++) { struct pike_string *p; for(p=base_table[e];p;p=p->next) { if(p==foo) { return 1; } } } return 0; } PMOD_EXPORT void debug_dump_pike_string(const struct pike_string *s, INT32 max) { INT32 e; fprintf(stderr,"0x%p: %ld refs, len=%ld, size_shift=%d, hval=%lux (%lx)\n", s, (long)s->refs, (long)s->len, s->size_shift, (unsigned long)s->hval, (unsigned long)StrHash(s->str, s->len)); fprintf(stderr," \""); for(e=0;e<s->len && max>0;e++) { int c=EXTRACT_UCHAR(s->str+e); switch(c) { case '\t': fprintf(stderr,"\\t"); max-=2; break; case '\n': fprintf(stderr,"\\n"); max-=2; break; case '\r': fprintf(stderr,"\\r"); max-=2; break; case '\b': fprintf(stderr,"\\b"); max-=2; break; default: if(isprint(c)) { putc(c,stderr); max--; }else{ fprintf(stderr,"\\%03o",c); max-=4; } } } if(!max) fprintf(stderr,"...\n"); else fprintf(stderr,"\"\n"); } void dump_stralloc_strings(void) { unsigned INT32 e; struct pike_string *p; for(e=0;e<htable_size;e++) { for(p=base_table[e];p;p=p->next) { debug_dump_pike_string(p, 70); #ifdef DEBUG_MALLOC debug_malloc_dump_references (p, 2, 1, 0); #endif } } } #endif /* PIKE_DEBUG */ /*** String compare functions ***/ /* does not take locale into account */ int low_quick_binary_strcmp(const char *a, ptrdiff_t alen, const char *b, ptrdiff_t blen) { int tmp; if(alen > blen) { tmp=memcmp(a, b, blen); if(tmp) return tmp; return 1; }else if(alen < blen){ tmp=memcmp(a, b, alen); if(tmp) return tmp; return -1; }else{ return memcmp(a, b, alen); } } /* does not take locale into account */ ptrdiff_t generic_quick_binary_strcmp(const char *a, ptrdiff_t alen, int asize, const char *b, ptrdiff_t blen, int bsize) { ptrdiff_t pos; if(!asize && !bsize) return low_quick_binary_strcmp(a, alen, b, blen); for(pos=0;pos< MINIMUM(alen,blen) ;pos++) { p_wchar2 ac=generic_extract(a,asize,pos); p_wchar2 bc=generic_extract(b,bsize,pos); if(ac != bc) { if (ac < bc) return -1; return 1; } } return alen-blen; } /* Does not take locale into account * * Similar to (and could be used in place of) generic_quick_binary_strcmp(), * but returns +/- (offset + 1) to the first difference beween the strings. * * This can be used by eg replace_many() to speed up the comparisons. */ ptrdiff_t generic_find_binary_prefix(const char *a, ptrdiff_t alen, int asize, const char *b, ptrdiff_t blen, int bsize) { ptrdiff_t pos; ptrdiff_t len = MINIMUM(alen, blen); switch(TWO_SIZES(asize, bsize)) { #define CASE(AZ, BZ) \ case TWO_SIZES(AZ, BZ): { \ PIKE_CONCAT(p_wchar, AZ) *a_arr = \ (PIKE_CONCAT(p_wchar, AZ) *)a; \ PIKE_CONCAT(p_wchar, BZ) *b_arr = \ (PIKE_CONCAT(p_wchar, BZ) *)b; \ for (pos=0; pos<len; pos++) { \ if (a_arr[pos] == b_arr[pos]) \ continue; \ if (a_arr[pos] < b_arr[pos]) \ return ~pos; \ return pos+1; \ } \ } break CASE(0,0); CASE(0,1); CASE(0,2); CASE(1,0); CASE(1,1); CASE(1,2); CASE(2,0); CASE(2,1); CASE(2,2); #undef CASE } if (alen == blen) return 0; if (alen < blen) return ~alen; return blen+1; } PMOD_EXPORT int c_compare_string(const struct pike_string *s, const char *foo, int len) { return s->len == len && s->size_shift == 0 && !memcmp(s->str,foo,len); } /* Does not take locale into account */ PMOD_EXPORT ptrdiff_t my_quick_strcmp(const struct pike_string *a, const struct pike_string *b) { if(a==b) return 0; return generic_quick_binary_strcmp(a->str, a->len, a->size_shift, b->str, b->len, b->size_shift); } struct pike_string *realloc_unlinked_string(struct pike_string *a, ptrdiff_t size) { char * s = NULL; size_t nbytes = (size_t)(size+1) << a->size_shift; size_t obytes = (size_t)a->len << a->size_shift; if( size < a->len && size-a->len<(signed)sizeof(void*) ) goto done; if( nbytes < sizeof(struct pike_string) ) { if( a->alloc_type == STRING_ALLOC_BA ) goto done; s = ba_alloc(&string_allocator); memcpy(s, a->str, MINIMUM(nbytes,obytes)); free_string_content(a); a->alloc_type = STRING_ALLOC_BA; } else if( a->alloc_type == STRING_ALLOC_MALLOC) { s = xrealloc(a->str,nbytes); } else { s = xalloc(nbytes); memcpy(s,a->str,MINIMUM(nbytes,obytes)); free_string_content(a); a->alloc_type = STRING_ALLOC_MALLOC; } a->str = s; done: a->len=size; low_set_index(a,size,0); return a; } /* Returns an unlinked string ready for end_shared_string */ static struct pike_string *realloc_shared_string(struct pike_string *a, ptrdiff_t size) { if(string_may_modify_len(a)) { unlink_pike_string(a); return realloc_unlinked_string(a, size); }else{ struct pike_string *r=begin_wide_shared_string(size,a->size_shift); memcpy(r->str, a->str, a->len<<a->size_shift); r->flags |= a->flags & STRING_CHECKED_MASK; r->min = a->min; r->max = a->max; free_string(a); return r; } } struct pike_string *new_realloc_shared_string(struct pike_string *a, INT32 size, enum size_shift shift) { struct pike_string *r; if(shift == a->size_shift) return realloc_shared_string(a,size); r=begin_wide_shared_string(size,shift); pike_string_cpy(MKPCHARP_STR(r),a); r->flags |= (a->flags & STRING_CHECKED_MASK); r->min = a->min; r->max = a->max; free_string(a); return r; } /* Modify one index in a shared string * Not suitable for building new strings or changing multiple characters * within a string! * * Phew, this function become complicated when I inserted magic for wide * characters... */ struct pike_string *modify_shared_string(struct pike_string *a, INT32 index, INT32 c) { INT32 old_value; #ifdef PIKE_DEBUG if(index<0 || index>=a->len) Pike_fatal("Index out of range in modify_shared_string()\n"); #endif old_value=index_shared_string(a,index); if(old_value==c) return a; /* First test if the string needs to be grown: * ie; the new value does not fit in the char size of * the old string */ if(min_magnitude(c) > a->size_shift) { /* String must be grown */ struct pike_string *b; switch(TWO_SIZES(min_magnitude(c),a->size_shift)) { case TWO_SIZES(1,0): b=begin_wide_shared_string(a->len,1); convert_0_to_1(STR1(b),(p_wchar0 *)a->str,a->len); STR1(b)[index]=c; free_string(a); return end_shared_string(b); case TWO_SIZES(2,0): b=begin_wide_shared_string(a->len,2); convert_0_to_2(STR2(b),(p_wchar0 *)a->str,a->len); STR2(b)[index]=c; free_string(a); return end_shared_string(b); case TWO_SIZES(2,1): b=begin_wide_shared_string(a->len,2); convert_1_to_2(STR2(b),STR1(a),a->len); STR2(b)[index]=c; free_string(a); return end_shared_string(b); #ifdef PIKE_DEBUG default: Pike_fatal("Odd wide string conversion!\n"); #endif } } /* Next we test if the new string can be shrunk * if all characters in the new string can fit in a string * of a lower magnitude, it must be shrunk */ if(min_magnitude(old_value) == a->size_shift && min_magnitude(c) < min_magnitude(old_value)) { /* We *might* need to shrink the string */ struct pike_string *b; unsigned int size,tmp; switch(a->size_shift) { case 0: Pike_fatal("Unshrinkable!\n"); case 1: /* Test if we *actually* can shrink it.. */ if(find_magnitude1(STR1(a),index)) break; if(find_magnitude1(STR1(a)+index+1,a->len-index-1)) break; b=begin_shared_string(a->len); convert_1_to_0((p_wchar0 *)b->str,STR1(a),a->len); b->str[index]=c; free_string(a); return end_shared_string(b); case 2: /* Test if we *actually* can shrink it.. */ size=find_magnitude2(STR2(a),index); if(size==2) break; /* nope */ tmp=find_magnitude2(STR2(a)+index+1,a->len-index-1); if(tmp==2) break; /* nope */ size=MAXIMUM(MAXIMUM(size,tmp),min_magnitude(c)); switch(size) { case 0: b=begin_shared_string(a->len); convert_2_to_0((p_wchar0 *)b->str,STR2(a),a->len); b->str[index]=c; free_string(a); return end_shared_string(b); case 1: b=begin_wide_shared_string(a->len,1); convert_2_to_1((p_wchar1 *)b->str,STR2(a),a->len); STR1(b)[index]=c; free_string(a); return end_shared_string(b); } } } /* We now know that the string has the right character size */ if(string_may_modify(a)) { /* One ref - destructive mode */ unlink_pike_string(a); low_set_index(a, index, c); CLEAR_STRING_CHECKED(a); if((((unsigned int)index) >= hash_prefix_len) && (index < a->len-8) ) { struct pike_string *old; /* Doesn't change hash value - sneak it in there */ #ifdef PIKE_DEBUG if (wrong_hash(a)) { Pike_fatal("Broken hash optimization.\n"); } #endif old = internal_findstring(a->str, a->len, a->size_shift, a->hval); if (old) { /* The new string is equal to some old string. */ free_string(a); add_ref(a = old); } else { link_pike_string(a, a->hval); } }else{ a = end_shared_string(a); } return a; }else{ struct pike_string *r; r=begin_wide_shared_string(a->len,a->size_shift); memcpy(r->str, a->str, a->len << a->size_shift); low_set_index(r,index,c); free_string(a); return end_shared_string(r); } } static void set_flags_for_add( struct pike_string *ret, unsigned char aflags, unsigned char amin, unsigned char amax, const struct pike_string *b) { if( !b->len ) { ret->flags |= aflags & STRING_CHECKED_MASK; ret->min = amin; ret->max = amax; return; } if( aflags & b->flags & STRING_CONTENT_CHECKED ) { ret->min = MINIMUM( amin, b->min ); ret->max = MAXIMUM( amax, b->max ); ret->flags |= STRING_CONTENT_CHECKED; } else ret->flags &= ~STRING_CONTENT_CHECKED; ret->flags &= ~(STRING_IS_LOWERCASE | STRING_IS_UPPERCASE); ret->flags |= (aflags & b->flags & (STRING_IS_LOWERCASE | STRING_IS_UPPERCASE)); } void update_flags_for_add( struct pike_string *a, const struct pike_string *b) { if( !b->len ) return; if( a->flags & STRING_CONTENT_CHECKED ) { if(b->flags & STRING_CONTENT_CHECKED) { if (a->len) { if( b->min < a->min ) a->min = b->min; if( b->max > a->max ) a->max = b->max; } else { a->min = b->min; a->max = b->max; } } else a->flags &= ~STRING_CONTENT_CHECKED; } a->flags &= ~(STRING_IS_LOWERCASE | STRING_IS_UPPERCASE) | b->flags; } /*** Add strings ***/ PMOD_EXPORT struct pike_string *add_shared_strings(const struct pike_string *a, const struct pike_string *b) { struct pike_string *ret; PCHARP tmp; int target_size=MAXIMUM(a->size_shift,b->size_shift); ret=begin_wide_shared_string(a->len+b->len,target_size); tmp=MKPCHARP_STR(ret); pike_string_cpy(tmp,a); INC_PCHARP(tmp,a->len); pike_string_cpy(tmp,b); set_flags_for_add( ret, a->flags, a->min, a->max, b ); return low_end_shared_string(ret); } PMOD_EXPORT struct pike_string *add_and_free_shared_strings(struct pike_string *a, struct pike_string *b) { ptrdiff_t alen = a->len; if(a->size_shift == b->size_shift) { a = realloc_shared_string(a, alen + b->len); update_flags_for_add( a, b ); memcpy(a->str+(alen<<a->size_shift),b->str,b->len<<b->size_shift); free_string(b); a->flags |= STRING_NOT_HASHED; return end_shared_string(a); }else{ struct pike_string *ret=add_shared_strings(a,b); free_string(a); free_string(b); return ret; } } PMOD_EXPORT ptrdiff_t string_search(struct pike_string *haystack, struct pike_string *needle, ptrdiff_t start) { SearchMojt mojt; char *r; if( !string_range_contains_string( haystack, needle ) ) return -1; if(start + needle->len > haystack->len) return -1; if(!needle->len) return start; mojt=compile_memsearcher(MKPCHARP_STR(needle), needle->len, haystack->len, needle); r = (char *)mojt.vtab->funcN(mojt.data, ADD_PCHARP(MKPCHARP_STR(haystack), start), haystack->len - start).ptr; if (mojt.container) free_object (mojt.container); if(!r) return -1; #ifdef PIKE_DEBUG if((r < haystack->str) || (r - haystack->str)>>haystack->size_shift > haystack->len) Pike_fatal("string_search did a bobo!\n"); #endif return (r-haystack->str)>>haystack->size_shift; } static struct pike_string *make_shared_substring( struct pike_string *s, ptrdiff_t start, ptrdiff_t len, enum size_shift shift) { struct pike_string *existing; struct substring_pike_string *res; void *strstart = s->str+(start<<shift); size_t hval = low_do_hash(strstart,len,shift); if( (existing = internal_findstring(strstart, len, shift, hval)) ) { add_ref(existing); return existing; } res = ba_alloc(&substring_allocator); res->parent = s; add_ref(s); existing = &res->str; existing->flags = STRING_NOT_SHARED; existing->size_shift = shift; existing->alloc_type = STRING_ALLOC_SUBSTRING; existing->struct_type = STRING_STRUCT_SUBSTRING; existing->hval = hval; existing->str = strstart; existing->len = len; #ifdef PIKE_DEBUG if( existing->len + start != s->len ) Pike_fatal("Substrings must be terminated at end of string for now.\n"); #endif existing->refs = 0; add_ref(existing); link_pike_string(existing,hval); return existing; } PMOD_EXPORT struct pike_string *string_slice(struct pike_string *s, ptrdiff_t start, ptrdiff_t len) { #ifdef PIKE_DEBUG if(start < 0 || len<0 || start+len>s->len ) { Pike_fatal("string_slice, start = %ld, len = %ld, s->len = %ld\n", (long)start, (long)len, (long)s->len); } #endif if( len == 0) { add_ref(empty_pike_string); return empty_pike_string; } if(start==0 && len==s->len) { add_ref(s); return s; } /* Actually create a substring. */ /* If the string to take a substring of is a substring, take from the original. */ if( s->alloc_type == STRING_ALLOC_SUBSTRING ) { struct pike_string *pr= substring_content_string(s); /* Note: If substrings are ever anywhere except at the end, this might need to change. */ start += (s->str-pr->str)>>s->size_shift; s = pr; } if( (len+start == s->len) && start < (s->len>>1) && (!s->size_shift || (s->size_shift==1 && find_magnitude1(((p_wchar1*)s->str)+start,len)==1) || (s->size_shift==2 && find_magnitude2(((p_wchar2*)s->str)+start,len)==2))) { /* If there is no change of maginute, make a substring. */ return make_shared_substring( s, start, len, s->size_shift ); } switch(s->size_shift) { case 0: return make_shared_binary_string((char *)STR0(s)+start,len); case 1: return make_shared_binary_string1(STR1(s)+start,len); case 2: return make_shared_binary_string2(STR2(s)+start,len); } UNREACHABLE(return 0); } /*** replace function ***/ typedef char *(* replace_searchfunc)(void *,void *,size_t); PMOD_EXPORT struct pike_string *string_replace(struct pike_string *str, struct pike_string *del, struct pike_string *to) { struct pike_string *ret; char *s,*tmp,*end; PCHARP r; enum size_shift shift; SearchMojt mojt; ONERROR mojt_uwp; replace_searchfunc f = (replace_searchfunc)0; if(!str->len || !string_range_contains_string(str, del)) { add_ref(str); return str; } shift=MAXIMUM(str->size_shift,to->size_shift); if(!del->len) { int e,pos; ret=begin_wide_shared_string(str->len + to->len * (str->len -1),shift); low_set_index(ret,0,index_shared_string(str,0)); for(pos=e=1;e<str->len;e++) { pike_string_cpy(MKPCHARP_STR_OFF(ret,pos),to); pos+=to->len; low_set_index(ret,pos++,index_shared_string(str,e)); } return end_shared_string(ret); } s=str->str; end=s+(str->len<<str->size_shift); if(del->len == to->len) { mojt=compile_memsearcher(MKPCHARP_STR(del), del->len, str->len, del); SET_ONERROR (mojt_uwp, do_free_object, mojt.container); ret=begin_wide_shared_string(str->len,shift); switch(str->size_shift) { case 0: f=(replace_searchfunc)mojt.vtab->func0; break; case 1: f=(replace_searchfunc)mojt.vtab->func1; break; case 2: f=(replace_searchfunc)mojt.vtab->func2; break; } }else{ INT32 delimeters=0; mojt=compile_memsearcher(MKPCHARP_STR(del), del->len, str->len*2, del); SET_ONERROR (mojt_uwp, do_free_object, mojt.container); switch(str->size_shift) { case 0: f=(replace_searchfunc)mojt.vtab->func0; break; case 1: f=(replace_searchfunc)mojt.vtab->func1; break; case 2: f=(replace_searchfunc)mojt.vtab->func2; break; } while((s = f(mojt.data, s, (end-s)>>str->size_shift))) { delimeters++; s+=del->len << str->size_shift; } if(!delimeters) { CALL_AND_UNSET_ONERROR (mojt_uwp); add_ref(str); return str; } ret=begin_wide_shared_string(str->len + (to->len-del->len)*delimeters, shift); } s=str->str; r=MKPCHARP_STR(ret); while((tmp = f(mojt.data, s, (end-s)>>str->size_shift))) { #ifdef PIKE_DEBUG if(tmp + (del->len << str->size_shift) > end) Pike_fatal("SearchMojt found a match beyond end of string!!!\n"); #endif generic_memcpy(r,MKPCHARP(s,str->size_shift),(tmp-s)>>str->size_shift); INC_PCHARP(r,(tmp-s)>>str->size_shift); pike_string_cpy(r,to); INC_PCHARP(r,to->len); s=tmp+(del->len << str->size_shift); } generic_memcpy(r,MKPCHARP(s,str->size_shift),(end-s)>>str->size_shift); CALL_AND_UNSET_ONERROR (mojt_uwp); return end_shared_string(ret); } /*** init/exit memory ***/ void init_shared_string_table(void) { SET_HSIZE(BEGIN_HASH_SIZE); base_table=xcalloc(sizeof(struct pike_string *), htable_size); empty_pike_string = make_shared_string(""); empty_pike_string->flags |= STRING_IS_LOWERCASE | STRING_IS_UPPERCASE; } #ifdef DO_PIKE_CLEANUP PMOD_EXPORT struct shared_string_location *all_shared_string_locations; #endif void cleanup_shared_string_table(void) { unsigned INT32 e; struct pike_string *s,*next; if (empty_pike_string) { free_string(empty_pike_string); empty_pike_string = 0; } #ifdef DO_PIKE_CLEANUP while(all_shared_string_locations) { struct shared_string_location *x=all_shared_string_locations; all_shared_string_locations=x->next; free_string(x->s); x->s=0; } if (exit_with_cleanup) { size_t num,size; count_memory_in_strings(&num,&size); if(num) { fprintf(stderr,"Strings left: %"PRINTSIZET"d " "(%"PRINTSIZET"d bytes) (zapped)\n",num,size); #ifdef PIKE_DEBUG dump_stralloc_strings(); #endif } } #endif for(e=0;e<htable_size;e++) { for(s=base_table[e];s;s=next) { next=s->next; s->next=0; } base_table[e]=0; } free(base_table); base_table=0; num_strings=0; #ifdef DO_PIKE_CLEANUP ba_destroy(&string_allocator); #endif /* DO_PIKE_CLEANUP */ } void count_string_types() { unsigned INT32 e; size_t num_static = 0, num_short = 0, num_substring = 0, num_malloc = 0; for (e = 0; e < htable_size; e++) { struct pike_string * s; for (s = base_table[e]; s; s = s->next) switch (s->alloc_type) { case STRING_ALLOC_BA: num_short ++; break; case STRING_ALLOC_STATIC: num_static ++; break; case STRING_ALLOC_SUBSTRING: num_substring ++; break; case STRING_ALLOC_MALLOC: num_malloc ++; break; } } push_static_text("num_short_strings"); push_ulongest(num_short); push_static_text("num_static_strings"); push_ulongest(num_static); push_static_text("num_substrings"); push_ulongest(num_substring); push_static_text("num_malloced_strings"); push_ulongest(num_malloc); } size_t count_memory_in_string(const struct pike_string * s) { size_t size = sizeof(struct pike_string); switch (s->alloc_type) { case STRING_ALLOC_SUBSTRING: size += sizeof( struct pike_string *); break; case STRING_ALLOC_BA: size += sizeof(struct pike_string); break; case STRING_ALLOC_MALLOC: size += PIKE_ALIGNTO(((s->len + 1) << s->size_shift), 4); break; case STRING_ALLOC_STATIC: break; } return size; } void count_memory_in_strings(size_t *num, size_t *_size) { unsigned INT32 e; size_t size = 0; *num = num_strings; size+=htable_size * sizeof(struct pike_string *); for (e = 0; e < htable_size; e++) { struct pike_string * s; for (s = base_table[e]; s; s = s->next) { size += count_memory_in_string(s); } } *_size = size; } PMOD_EXPORT void visit_string (struct pike_string *s, int action, void *extra) { visit_enter(s, T_STRING, extra); switch (action & VISIT_MODE_MASK) { #ifdef PIKE_DEBUG default: Pike_fatal ("Unknown visit action %d.\n", action); case VISIT_NORMAL: case VISIT_COMPLEX_ONLY: break; #endif case VISIT_COUNT_BYTES: mc_counted_bytes += count_memory_in_string (s); break; } visit_leave(s, T_STRING, extra); } #ifdef PIKE_DEBUG unsigned gc_touch_all_strings(void) { unsigned INT32 e; unsigned n = 0; if (!base_table) return 0; for(e=0;e<htable_size;e++) { struct pike_string *p; for(p=base_table[e];p;p=p->next) debug_gc_touch(p), n++; } return n; } void gc_mark_all_strings(void) { unsigned INT32 e; if(!base_table) return; for(e=0;e<htable_size;e++) { struct pike_string *p; for(p=base_table[e];p;p=p->next) gc_is_referenced(p); } } #endif PMOD_EXPORT struct pike_string *next_pike_string (const struct pike_string *s) { struct pike_string *next = s->next; if (!next) { size_t h = s->hval; do { h++; h = HMODULO(h); next = base_table[h]; } while (!next); } return next; } PMOD_EXPORT PCHARP MEMCHR_PCHARP(const PCHARP ptr, int chr, ptrdiff_t len) { switch(ptr.shift) { case 0: return MKPCHARP(memchr(ptr.ptr,chr,len),0); case 1: return MKPCHARP(MEMCHR1((p_wchar1 *)ptr.ptr,chr,len),1); case 2: return MKPCHARP(MEMCHR2((p_wchar2 *)ptr.ptr,chr,len),2); } UNREACHABLE(MKPCHARP(0,0)); } #define DIGIT(x) ( (x)<256 ? hexdecode[x] : 16 ) #define MBASE ('z' - 'a' + 1 + 10) PMOD_EXPORT long STRTOL_PCHARP(PCHARP str, PCHARP *ptr, int base) { /* Note: Code duplication in pcharp_to_svalue_inumber. */ unsigned long val, mul_limit; int c; int xx, neg = 0, add_limit, overflow = 0; if (ptr) *ptr = str; if (base < 0 || base > MBASE) return 0; if (!WIDE_ISALNUM(c = EXTRACT_PCHARP(str))) { while (wide_isspace(c)) { INC_PCHARP(str,1); c=EXTRACT_PCHARP(str); } switch (c) { case '-': neg++; /* FALL_THROUGH */ case '+': INC_PCHARP(str,1); c=EXTRACT_PCHARP(str); } } if (!base) { if (c != '0') base = 10; else if (INDEX_PCHARP(str,1) == 'x' || INDEX_PCHARP(str,1) == 'X') base = 16; else base = 8; } if (DIGIT(c) >= base) return 0; /* no number formed */ if (base == 16 && c == '0' && DIGIT(INDEX_PCHARP(str,2))<16 && (INDEX_PCHARP(str,1) == 'x' || INDEX_PCHARP(str,1) == 'X')) { INC_PCHARP(str,2); c = EXTRACT_PCHARP(str); /* skip over leading "0x" or "0X" */ } mul_limit = ((unsigned long)LONG_MAX)/base; add_limit = (int) (LONG_MAX % base); if (neg) { if (++add_limit == base) { add_limit = 0; mul_limit++; } } val=DIGIT(c); while(1) { INC_PCHARP(str,1); c=EXTRACT_PCHARP(str); if( (xx=DIGIT(c)) >= base ) break; if (val > mul_limit || (val == mul_limit && xx > add_limit)) { overflow = 1; } else val = base * val + xx; } if (ptr) *ptr = str; if (overflow) { errno = ERANGE; return neg ? LONG_MIN : LONG_MAX; } else { if (neg) return (long)(~val + 1); else return (long) val; } } int wide_string_to_svalue_inumber(struct svalue *r, void * str, void *ptr, int base, ptrdiff_t maxlength, enum size_shift shift) { PCHARP tmp; int ret=pcharp_to_svalue_inumber(r, MKPCHARP(str,shift), &tmp, base, maxlength); if(ptr) *(p_wchar0 **)ptr=tmp.ptr; return ret; } int safe_wide_string_to_svalue_inumber(struct svalue *r, void * str, void *ptr, int base, ptrdiff_t maxlength, enum size_shift shift) /* For use from the lexer where we can't let errors be thrown. */ { PCHARP tmp; JMP_BUF recovery; int ret = 0; free_svalue (&throw_value); mark_free_svalue (&throw_value); if (SETJMP (recovery)) { /* We know that pcharp_to_svalue_inumber has initialized the * svalue before any error might be thrown. */ call_handle_error(); ret = 0; } else ret = pcharp_to_svalue_inumber(r, MKPCHARP(str,shift), &tmp, base, maxlength); UNSETJMP (recovery); if(ptr) *(p_wchar0 **)ptr=tmp.ptr; return ret; } PMOD_EXPORT int pcharp_to_svalue_inumber(struct svalue *r, PCHARP str, PCHARP *ptr, int base, ptrdiff_t maxlength) { /* Note: Code duplication in STRTOL_PCHARP. */ PCHARP str_start; unsigned INT_TYPE val, mul_limit; int c; int xx, neg = 0, add_limit, overflow = 0; maxlength--; /* max_length <= 0 means no max length. */ str_start = str; /* In case no number is formed. */ SET_SVAL(*r, T_INT, NUMBER_NUMBER, integer, 0); if(ptr != 0) *ptr = str; if(base < 0 || MBASE < base) return 0; if(!WIDE_ISALNUM(c = EXTRACT_PCHARP(str))) { while(wide_isspace(c)) { INC_PCHARP(str,1); c = EXTRACT_PCHARP(str); } switch (c) { case '-': neg++; /* Fall-through. */ case '+': INC_PCHARP(str,1); c = EXTRACT_PCHARP(str); } } if(base == 0) { if(c != '0') base = 10; else if(INDEX_PCHARP(str,1) == 'x' || INDEX_PCHARP(str,1) == 'X') base = 16; else if(INDEX_PCHARP(str,1) == 'b' || INDEX_PCHARP(str,1) == 'B') base = 2; else base = 8; } /* * For any base > 10, the digits incrementally following * 9 are assumed to be "abc...z" or "ABC...Z". */ if(DIGIT(c) >= base) return 0; /* No number formed. */ if(c == '0' && ((base==16 && (INDEX_PCHARP(str,1)=='x' || INDEX_PCHARP(str,1)=='X')) || (base==2 && (INDEX_PCHARP(str,1)=='b' || INDEX_PCHARP(str,1)=='B'))) && DIGIT(INDEX_PCHARP(str,2))<16 ) { /* Skip over leading "0x", "0X", "0b" or "0B". */ INC_PCHARP(str,2); c=EXTRACT_PCHARP(str); } str_start=str; if (neg) { mul_limit = (unsigned INT_TYPE) MIN_INT_TYPE / base; add_limit = (int) ((unsigned INT_TYPE) MIN_INT_TYPE % base); } else { mul_limit = MAX_INT_TYPE / base; add_limit = (int) (MAX_INT_TYPE % base); } for(val = DIGIT(c); (INC_PCHARP(str,1), WIDE_ISALNUM(c = EXTRACT_PCHARP(str) )) && (xx = DIGIT(c)) < base && 0 != maxlength--; ) { if (val > mul_limit || (val == mul_limit && xx > add_limit)) overflow = 1; else val = base * val + xx; } if(ptr != 0) *ptr = str; if (overflow) { push_string(make_shared_binary_pcharp(str_start, SUBTRACT_PCHARP(str,str_start))); /* Note that this can conceivably throw errors() * in some situations that might not be desirable... * take care. * /Hubbe * * It could probably also be faster... */ push_int(base); convert_stack_top_with_base_to_bignum(); if(neg) o_negate(); *r = *--Pike_sp; dmalloc_touch_svalue (r); } else { if (neg) r->u.integer = val > (unsigned INT_TYPE) MAX_INT_TYPE ? -(INT_TYPE) (val - (unsigned INT_TYPE) MAX_INT_TYPE) - MAX_INT_TYPE : -(INT_TYPE) val; else r->u.integer = (INT_TYPE) val; } return 1; } PMOD_EXPORT int convert_stack_top_string_to_inumber(int base) { struct svalue r; int i; if(TYPEOF(Pike_sp[-1]) != T_STRING) Pike_error("Cannot convert stack top to integer number.\n"); i=pcharp_to_svalue_inumber(&r, MKPCHARP_STR(Pike_sp[-1].u.string), 0, base, 0); free_string(Pike_sp[-1].u.string); Pike_sp[-1] = r; return i; } /* Convert PCHARP to a double. If ENDPTR is not NULL, a pointer to the character after the last one used in the number is put in *ENDPTR. */ PMOD_EXPORT double STRTOD_PCHARP(const PCHARP nptr, PCHARP *endptr) { /* Note: Code duplication in strtod. */ PCHARP s; short int sign; /* The number so far. */ double num; int got_dot; /* Found a decimal point. */ int got_digit; /* Seen any digits. */ /* The exponent of the number. */ long int exponent; if (nptr.ptr == NULL) { errno = EINVAL; goto noconv; } s = nptr; /* Eat whitespace. */ while (wide_isspace(EXTRACT_PCHARP(s))) INC_PCHARP(s,1); /* Get the sign. */ sign = EXTRACT_PCHARP(s) == '-' ? -1 : 1; if (EXTRACT_PCHARP(s) == '-' || EXTRACT_PCHARP(s) == '+') INC_PCHARP(s,1); num = 0.0; got_dot = 0; got_digit = 0; exponent = 0; for (;; INC_PCHARP(s,1)) { if (WIDE_ISDIGIT (EXTRACT_PCHARP(s))) { got_digit = 1; /* Make sure that multiplication by 10 will not overflow. */ if (num > DBL_MAX * 0.1) /* The value of the digit doesn't matter, since we have already gotten as many digits as can be represented in a `double'. This doesn't necessarily mean the result will overflow. The exponent may reduce it to within range. We just need to record that there was another digit so that we can multiply by 10 later. */ ++exponent; else num = (num * 10.0) + (EXTRACT_PCHARP(s) - '0'); /* Keep track of the number of digits after the decimal point. If we just divided by 10 here, we would lose precision. */ if (got_dot) --exponent; } else if (!got_dot && (char) EXTRACT_PCHARP(s) == '.') /* Record that we have found the decimal point. */ got_dot = 1; else /* Any other character terminates the number. */ break; } if (!got_digit) goto noconv; if (EXTRACT_PCHARP(s) == 'E' || EXTRACT_PCHARP(s) == 'e') { /* Get the exponent specified after the `e' or `E'. */ int save = errno; PCHARP end; long int exp; errno = 0; INC_PCHARP(s,1); exp = STRTOL_PCHARP(s, &end, 10); if (errno == ERANGE) { /* The exponent overflowed a `long int'. It is probably a safe assumption that an exponent that cannot be represented by a `long int' exceeds the limits of a `double'. */ /* NOTE: Don't trust the value returned from strtol. * We need to find the sign of the exponent by hand. */ p_wchar2 c; while(wide_isspace(c = EXTRACT_PCHARP(s))) { INC_PCHARP(s, 1); } if (endptr != NULL) *endptr = end; if (c == '-') goto underflow; else goto overflow; } else if (COMPARE_PCHARP(end,==,s)) /* There was no exponent. Reset END to point to the 'e' or 'E', so *ENDPTR will be set there. */ end = ADD_PCHARP(s,-1); errno = save; s = end; exponent += exp; } if(got_dot && INDEX_PCHARP(s,-1)=='.') INC_PCHARP(s,-1); if (endptr != NULL) *endptr = s; if (num == 0.0) return 0.0; /* Multiply NUM by 10 to the EXPONENT power, checking for overflow and underflow. */ if (exponent < 0) { if (num < DBL_MIN * pow(10.0, (double) -exponent)) goto underflow; } else if (exponent > 0) { if (num > DBL_MAX * pow(10.0, (double) -exponent)) goto overflow; } if(exponent < 0 && exponent >-100) /* make sure we don't underflow */ num /= pow(10.0, (double) -exponent); else num *= pow(10.0, (double) exponent); return num * sign; overflow: /* Return an overflow error. */ errno = ERANGE; return HUGE_VAL * sign; underflow: /* Return an underflow error. */ errno = ERANGE; return 0.0; noconv: /* There was no number. */ if (endptr != NULL) *endptr = nptr; return 0.0; } PMOD_EXPORT p_wchar0 *require_wstring0(const struct pike_string *s, char **to_free) { switch(s->size_shift) { case 0: *to_free=0; return STR0(s); case 1: case 2: return 0; } UNREACHABLE(return 0); } PMOD_EXPORT p_wchar1 *require_wstring1(const struct pike_string *s, char **to_free) { switch(s->size_shift) { case 0: *to_free=xalloc((s->len+1)*2); convert_0_to_1((p_wchar1 *)*to_free, STR0(s),s->len+1); return (p_wchar1 *)*to_free; case 1: *to_free=0; return STR1(s); case 2: return 0; } UNREACHABLE(return 0); } PMOD_EXPORT p_wchar2 *require_wstring2(const struct pike_string *s, char **to_free) { switch(s->size_shift) { case 0: *to_free=xalloc((s->len+1)*4); convert_0_to_2((p_wchar2 *)*to_free, STR0(s),s->len+1); return (p_wchar2 *)*to_free; case 1: *to_free=xalloc((s->len+1)*4); convert_1_to_2((p_wchar2 *)*to_free, STR1(s),s->len+1); return (p_wchar2 *)*to_free; case 2: *to_free=0; return STR2(s); } UNREACHABLE(return 0); } PMOD_EXPORT int wide_isspace(int c) { switch(c) { SPACECASE16; return 1; } return 0; } PMOD_EXPORT int wide_isidchar(int c) { if(c<0) return 0; if(c<256) return isidchar(c); if(wide_isspace(c)) return 0; return 1; } /* * UTF8 encoding functions. This code uses the following observation: * * For codepoints c > 0x7f, the length of the resulting utf8 encoding is * 1 + (fls32(c) - 2)/5. * * This is used to calculate the resulting length without any branches. */ #if defined(HAS___BUILTIN_POPCOUNTLL) && SIZEOF_CHARP == 8 # define poptype unsigned long long # define POPCOUNT __builtin_popcountll #elif defined(HAS___BUILTIN_POPCOUNTL) # define poptype unsigned long # define POPCOUNT __builtin_popcountl #else # if SIZEOF_CHARP == 8 # define poptype unsigned INT64 # else # define poptype unsigned INT32 # endif # define POPCOUNT popcount_fallback const poptype m1 = (poptype)0x5555555555555555ULL; const poptype m2 = (poptype)0x3333333333333333ULL; const poptype m4 = (poptype)0x0f0f0f0f0f0f0f0fULL; static unsigned int popcount_fallback(poptype x) { x -= (x >> 1) & m1; x = (x & m2) + ((x >> 2) & m2); x = (x + (x >> 4)) & m4; x += x >> 8; x += x >> 16; # if SIZEOF_CHARP == 8 x += x >> 32; # endif return x & 0x7f; } #endif /* The reason for using handmade divide is that on some arm32 targets there is * no integer divisions. The reason why we can do better than the compiler is * that we know that the argument is smaller than 32. */ static inline unsigned INT32 div5_8bit(unsigned INT32 x) { return ((x * 0xCD) >> 8) >> 2; } PMOD_EXPORT size_t pike_string_utf8_length(const struct pike_string *s, INT32 args, int extended) { size_t len = s->len; size_t elen = s->len; /* This 8bit version counts the number of high bits in each byte. * The loop is unrolled 4 times and starts with a Duff's device style * loop entry to process the tail. */ if (LIKELY(s->size_shift == eightbit)) { /* * We force the compiler to load this constant only once. Otherwise, * GCC will decide to reload it into a register 4 times per loop. */ static volatile poptype foo = (poptype)0x8080808080808080ULL; const unsigned char *in; const poptype mask = foo; const poptype *in8 = (poptype*)STR0(s); const poptype *end8 = in8 + (s->len / sizeof(poptype)); if (in8 < end8) { const size_t tail = (size_t)(end8 - in8) % 4; poptype a = 0, b = 0, c = 0, d = 0; in8 += tail; switch (tail) { do { case 0: in8 += 4; a = in8[-4]; case 3: b = in8[-3]; case 2: c = in8[-2]; case 1: d = in8[-1]; a &= mask; b &= mask; c &= mask; d &= mask; b >>= 1; c >>= 2; d >>= 3; elen += POPCOUNT(a | b | c | d); } while (in8 < end8); break; default: UNREACHABLE(break); } } in = (unsigned char*)end8; switch ((size_t)s->len % sizeof(poptype)) { case 7: elen += (*in++) >> 7; case 6: elen += (*in++) >> 7; case 5: elen += (*in++) >> 7; case 4: elen += (*in++) >> 7; case 3: elen += (*in++) >> 7; case 2: elen += (*in++) >> 7; case 1: elen += (*in++) >> 7; case 0: break; default: UNREACHABLE(break); } return elen; #undef poptype #undef POPCOUNT } else { unsigned INT32 c; size_t i; if (s->size_shift == sixteenbit) { unsigned INT16 *in = (unsigned INT16*)STR1(s); for (i = 0; i < len; i++) { c = in[i]; if (c <= 0x7f) continue; elen += div5_8bit(fls32(c) - 2); if (extended) continue; if (UNLIKELY(c >= 0xd800 && c <= 0xdfff)) goto surrogate_error; } } else { unsigned INT32 *in = (unsigned INT32*)STR2(s); for (i = 0; i < len; i++) { c = in[i]; if (c <= 0x7f) continue; elen += div5_8bit(fls32(c) - 2); if (extended) continue; if (UNLIKELY(c >= 0xd800 && c <= 0xdfff)) goto surrogate_error; if (UNLIKELY(c > 0x10ffff)) goto extended_error; } } return elen; surrogate_error: bad_arg_error ("string_to_utf8", Pike_sp - args, args, 1, NULL, Pike_sp - args, "Character 0x%08x at index %"PRINTPTRDIFFT"d is " "in the surrogate range and therefore invalid.\n", c, i); extended_error: bad_arg_error ("string_to_utf8", Pike_sp - args, args, 1, NULL, Pike_sp - args, "Character 0x%08x at index %"PRINTPTRDIFFT"d is " "outside the allowed range.\n", c, i); } UNREACHABLE(return 0); } PMOD_EXPORT unsigned char *pike_string_utf8_encode(unsigned char *dst, const struct pike_string *s) { size_t len = s->len; switch (s->size_shift) { case eightbit: { const unsigned char *in = STR0(s); for (size_t i = 0; i < len; i++) { unsigned char c = *in++; if (c & 0x80) { *dst++ = 0xc0 | (c >> 6); *dst++ = 0x80 | (c & 0x3f); } else *dst++ = c; } break; } case sixteenbit: { const unsigned INT16 *in = STR1(s); for (size_t i = 0; i < len; i++) { unsigned INT16 c = *in++; if (LIKELY(c <= 0x7f)) { *dst++ = c; continue; } if (c <= 0x7ff) { /* 11bit */ *dst++ = 0xc0 | (c >> 6); *dst++ = 0x80 | (c & 0x3f); } else { /* 16bit */ *dst++ = 0xe0 | (c >> 12); *dst++ = 0x80 | ((c >> 6) & 0x3f); *dst++ = 0x80 | (c & 0x3f); } } break; } case thirtytwobit: { const unsigned INT32 *in = (unsigned INT32*)STR2(s); for (size_t i = 0; i < len; i++) { unsigned INT32 bytes, shift, first; unsigned INT32 c = in[i]; if (c <= 0x7f) { *dst++ = c; continue; } bytes = 1 + div5_8bit(fls32(c) - 2); shift = 6 * (bytes - 1); first = -0x40 >> (bytes - 2); /* the > 31bit case */ if (UNLIKELY(bytes >= 7)) { bytes = 7; shift = 32; } *dst = first | (c >> shift); dst += bytes; bytes -= 2; switch (bytes) { case 5: dst[-6] = 0x80 | ((c >> 30) & 0x3f); case 4: dst[-5] = 0x80 | ((c >> 24) & 0x3f); case 3: dst[-4] = 0x80 | ((c >> 18) & 0x3f); case 2: dst[-3] = 0x80 | ((c >> 12) & 0x3f); case 1: dst[-2] = 0x80 | ((c >> 6) & 0x3f); case 0: dst[-1] = 0x80 | (c & 0x3f); break; default: UNREACHABLE(break); } } break; } } return dst; }

pike.git/ src/ stralloc.c > c77edbc5d9a675ea07759c2588047a440cfbc3c1 [Annotate]