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
|
/* zp v1.00 archiver and file compressor.
Written by Matt Mahoney, matmahoney@yahoo.com, Apr. 26, 2010.
Copyright (C) 2010, Ocarina Networks, Inc.
LICENSE
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 3 of
the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details at
Visit <http://www.gnu.org/copyleft/gpl.html>.
Usage: zp command archive.zpaq files...
Commands:
l - list contents of archive.zpaq
x - extract with full path names (files... overrides stored names)
e - extract to current directory
xN, eN - extract block N only (starting with 1)
cN - create new archive with compression option N
aN - append to archive with option N
Compression options N are 1=fast, 2=medium (default), 3=small.
Archives created with zp conform to the ZPAQ level 1 standard described
at http://mattmahoney.net/dc/
Archives are read/write compatible with other compliant programs such
as zpaq, unzpaq, and zpipe.
Recommended options for Windows/g++ 4.4.0:
g++ -O2 -s -march=pentiumpro -fomit-frame-pointer zp.cpp -o zp.exe
upx zp.exe
Compile with -Dunix in Linux. (Usually this is automatic).
Compile with -DDEBUG to enable run time checks.
Command details:
The archive name must end with ".zpaq". All commands will add the
extension automatically if you don't specify it. For example:
zp c3 arc file1 file2
zp a1 arc file3
will create archive arc.zpaq, compress file1 and file2 with smallest
(slowest) compression, and append file3 with the fastest (least)
compression. The commands "c" and "a" are equivalent to "c2" and "a2"
(medium compression). The files are grouped into one block (solid archive)
for each command.
zp l arc
will show the contents of arc.zpaq. It will show that file1 and file2
are stored in block 1, and file3 in block 2.
zp x arc
will extract file1, file2, and file3. You can extract from just one
block:
zp x1 arc
will extract file1 and file2 only.
zp x2 arc
will extract file3 only. If you specify file names on the command line
then the output files will be renamed in the order they are listed
and extracted.
zp x arc newfile1
will extract file1 as newfile1. It will not extract file2 or file3.
zp x2 arc newfile3
will extract the first file of block 2 (file3) as newfile3. Blocks
are "solid" which means you cannot extract files within a block
without extracting the earlier files. For example, you cannot extract
file2 without also extracting file1.
zp will not clobber existing files during extraction unless you specify
the filenames on the command line.
zp x arc (Error: file1 exists)
zp x arc file1 file2 file3 (Overwrites file1, file2, file3)
File names are stored in the archive as they appear on the command line.
If you specify a path to a different directory, the path is stored,
and created during extraction. The "e" command extracts to the current
directory.
zp c arc dir1\dir2\file1
zp x arc
will create dir1 and dir1\dir2 in the current directory if they do
not already exist, then create dir1\dir2\file1
zp e arc
will create file1 in the current directory (unless it exists).
If you specify the output filenames, then "e" behaves the same as "x".
If you compress in Windows and extract in Linux, then the program will
change "\" to "/" during extraction and vice versa. Slashes can be stored
with either convention. (The program guesses the operating system
by counting "/" and "\" in the PATH environment variable. If this
heuristic fails (PATH not defined) then no slash translation is done).
Paths must be relative to the current directory. The program will warn
if you store an absolute path. You can only extract such files with
"e" or by overriding the filename.
zp c arc \dir1\dir2\file1 (Warning: starts with "\")
zp x arc (Error: bad filename)
zp e arc (OK: extracts file1 to current directory)
zp x arc newfile (OK: extracts newfile to current directory)
zp x arc \dir3\dir4\newfile (OK: creates \dir3\dir4 if needed)
Also, the same rule applies to file names containing control characters,
or longer than 511 characters, or that start with a drive letter like "C:"
or that go up directories (contain ../ or ..\).
If this program is run in Linux or UNIX or compiled with g++ in Windows
then it will interpret wildcards on the command line in the usual way.
A * matches any string and ? matches any character.
zp c arc *
will compress all files in the current directory to arc.zpaq. However, it
will not recurse directories. You need to specify the files in each
directory that you want to add.
The program does not save file timestamps or permissions like some other
archivers do. Extracted files are dated from the time of extraction
with default permissions. If you need these capabilities, then create a
tar file and compress that instead.
The compression option 1, 2, or 3 means compress fast, medium, or small
respectively. Better compression requires more time and memory.
Decompression speed and memory are the same as for compression. Speed
(T3200, 2.0 GHz) and memory usage are as follows. zip -9 compression is
shown for comparison. All modes compress better (but slower) than zip.
Memory Speed Calgary corpus
------ ----------- ---------------
1 (fast) 38 MB 0.7 sec/MB 807,214 bytes
2 (default) 111 MB 2.3 sec/MB 699,586 bytes
3 (small) 246 MB 6.4 sec/MB 644,545 bytes
zip -9 <1 MB 0.13 sec/MB 1,020,719 bytes
Options 1, 2, 3 are equivalent to fast.cfg, mid.cfg, and max.cfg
respectively. For example, "zp c3 arc file" is equivalent to
"zpaq ocmax.cfg arc.zpaq file".
mid.cfg and max.cfg are the same as in the ZPAQ 1.10 distribution.
(There is also a min.cfg which is different from fast.cfg.
This program used compiled ZPAQL (generated by "zpaq oc") to compress
and extract in each of the 3 modes about twice as fast as using
interpreted code. It automatically recognizes these configurations
even if they are produced by other programs. The default compression
is the same as the default produced by zpaq and zpipe. If another
program produces a different configuration, then this program will still
correctly decompress it by interpreting the code, which is slower.
Also, zpaq, unzpaq, and zpipe can decompress archives produced by this
program.
The config files are as follows (with $1 defaulted to 0). See the
ZPAQ standard and ZPAQ 1.10 source code comments to interpret these
configuation files. fast.cfg uses an order 2 ICM (indirect context model)
and order 4 ISSE (indirect secondary symbol estimation) with no mixer.
mid.cfg uses an order 0..5 ICM/ISSE chain, an order 7 match model and
an order 1 mixer. max.cfg uses an order 0..5, 7 ICM/ISSE
chain, order 8 mixer, models for text (order 0 and 1 words),
sparse models (order 0 with gaps of 1, 2, 3), CCITT images, 2 parallel
mixers (order 0 and 1), and 2 serial SSE stages (orders 0 and 1)
with adaptive bypass.
(fast.cfg (c1, a1))
comp 1 2 0 0 2 (hh hm ph pm n)
0 icm 16 (order 2)
1 isse 19 0 (order 4)
hcomp
*b=a a=0 (save in rotating buffer M)
d=0 hash b-- hash *d=a
d++ b-- hash b-- hash *d=a
halt
post
0
end
(mid.cfg (c2, a2))
comp 3 3 0 0 8 (hh hm ph pm n)
0 icm 5 (order 0...5 chain)
1 isse 13 0
2 isse $1+17 1
3 isse $1+18 2
4 isse $1+18 3
5 isse $1+19 4
6 match $1+22 $1+24 (order 7)
7 mix 16 0 7 24 255 (order 1)
hcomp
c++ *c=a b=c a=0 (save in rotating buffer M)
d= 1 hash *d=a (orders 1...5 for isse)
b-- d++ hash *d=a
b-- d++ hash *d=a
b-- d++ hash *d=a
b-- d++ hash *d=a
b-- d++ hash b-- hash *d=a (order 7 for match)
d++ a=*c a<<= 8 *d=a (order 1 for mix)
halt
post
0
end
(max.cfg (c3, a3))
comp 5 9 0 0 22 (hh hm ph pm n)
0 const 160
1 icm 5 (orders 0-6)
2 isse 13 1 (sizebits j)
3 isse $1+16 2
4 isse $1+18 3
5 isse $1+19 4
6 isse $1+19 5
7 isse $1+20 6
8 match $1+22 $1+24
9 icm $1+17 (order 0 word)
10 isse $1+19 9 (order 1 word)
11 icm 13 (sparse with gaps 1-3)
12 icm 13
13 icm 13
14 icm 14 (pic)
15 mix 16 0 15 24 255 (mix orders 1 and 0)
16 mix 8 0 16 10 255 (including last mixer)
17 mix2 0 15 16 24 0
18 sse 8 17 32 255 (order 0)
19 mix2 8 17 18 16 255
20 sse 16 19 32 255 (order 1)
21 mix2 0 19 20 16 0
hcomp
c++ *c=a b=c a=0 (save in rotating buffer)
d= 2 hash *d=a b-- (orders 1,2,3,4,5,7)
d++ hash *d=a b--
d++ hash *d=a b--
d++ hash *d=a b--
d++ hash *d=a b--
d++ hash b-- hash *d=a b--
d++ hash *d=a b-- (match, order 8)
d++ a=*c a&~ 32 (lowercase words)
a> 64 if
a< 91 if (if a-z)
d++ hashd d-- (update order 1 word hash)
*d<>a a+=*d a*= 20 *d=a (order 0 word hash)
jmp 9
endif
endif
(else not a letter)
a=*d a== 0 ifnot (move word order 0 to 1)
d++ *d=a d--
endif
*d=0 (clear order 0 word hash)
(end else)
d++
d++ b=c b-- a=0 hash *d=a (sparse 2)
d++ b-- a=0 hash *d=a (sparse 3)
d++ b-- a=0 hash *d=a (sparse 4)
d++ a=b a-= 212 b=a a=0 hash
*d=a b<>a a-= 216 b<>a a=*b a&= 60 hashd (pic)
d++ a=*c a<<= 9 *d=a (mix)
d++
d++
d++ d++
d++ *d=a (sse)
halt
post
0
end
This program stores a filename, comment, and SHA-1 checksum for each file.
Other programs may omit these, but this program will still be able to
decompress them. This program follows the convention
that if the name is omitted, then the contents should be appended to
the previous file. If the first filename is omitted, then you must supply it
on the command line during extraction. Each filename on the command line
replaces one named file in the archive.
The comment is the original file size as a decimal string (exact to
2^52, over 4000 TB).
*/
#ifndef DEBUG // compile with -DDEBUG to enable debugging
#define NDEBUG
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <time.h>
#include <errno.h>
#include <assert.h>
#ifdef unix
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#endif
const int LEVEL=1; // ZPAQ level 0=experimental 1=final
// 1, 2, 4 byte unsigned integers
typedef unsigned char U8;
typedef unsigned short U16;
typedef unsigned int U32;
// Print an error message and exit
static void error(const char* msg="") {
fprintf(stderr, "\nError: %s\n", msg);
exit(1);
}
// An Array of T is cleared and aligned on a 64 byte address
// with no constructors called. No copy or assignment.
// Array<T> a(n, ex=0); - creates n<<ex elements of type T
// a[i] - index
// a(i) - index mod n, n must be a power of 2
// a.size() - gets n
template <class T>
class Array {
private:
T *data; // user location of [0] on a 64 byte boundary
int n; // user size-1
int offset; // distance back in bytes to start of actual allocation
void operator=(const Array&); // no assignment
Array(const Array&); // no copy
public:
Array(int sz=0, int ex=0): data(0), n(-1), offset(0) {
resize(sz, ex);} // [0..sz-1] = 0
void resize(int sz, int ex=0); // change size, erase content to zeros
~Array() {resize(0);} // free memory
int size() const {return n+1;} // get size
T& operator[](int i) {assert(n>=0 && i>=0 && U32(i)<=U32(n)); return data[i];}
T& operator()(int i) {assert(n>=0 && (n&(n+1))==0); return data[i&n];}
};
// Change size to sz<<ex elements of 0
template<class T>
void Array<T>::resize(int sz, int ex) {
while (ex>0) {
if (sz<0 || sz>=(1<<30)) error("Array too big");
sz*=2, --ex;
}
if (sz<0) error("Array too big");
if (n>-1) {
assert(offset>0 && offset<=64);
assert((char*)data-offset);
free((char*)data-offset);
}
n=-1;
if (sz<=0) return;
n=sz-1;
data=(T*)calloc(64+(n+1)*sizeof(T), 1);
if (!data) error("Out of memory");
offset=64-int((long)data&63);
assert(offset>0 && offset<=64);
data=(T*)((char*)data+offset);
}
// A Reader reads from a file or an array U8 p[n]
class Reader {
FILE *in;
const U8 *ptr;
int len;
public:
Reader(FILE *f): in(f), ptr(0), len(0) {} // Read from file
Reader(const U8 *p, int n): in(0), ptr(p), len(n) {} // Read from p[n]
int get() { // return 1 byte or EOF
if (in) return getc(in);
else if (ptr && len) return --len, *ptr++;
return EOF;
}
};
// Append string s to array a, enlarging as needed
static void append(Array<char>& a, const char* s) {
if (!s) return;
if (!a.size()) a.resize(strlen(s)+1);
int len=strlen(&a[0])+strlen(s)+1;
if (len>a.size()) {
Array<char> tmp(a.size());
strcpy(&tmp[0], &a[0]);
a.resize(len*5/4+64);
strcpy(&a[0], &tmp[0]);
}
strcat(&a[0], s);
}
//////////////////////////// SHA-1 //////////////////////////////
// The SHA1 class is used to compute segment checksums.
// SHA-1 code modified from RFC 3174.
// http://www.faqs.org/rfcs/rfc3174.html
enum
{
shaSuccess = 0,
shaNull, /* Null pointer parameter */
shaInputTooLong, /* input data too long */
shaStateError /* called Input after Result */
};
const int SHA1HashSize=20;
class SHA1 {
U32 Intermediate_Hash[SHA1HashSize/4]; /* Message Digest */
U32 Length_Low; /* Message length in bits */
U32 Length_High; /* Message length in bits */
int Message_Block_Index; /* Index into message block array */
U8 Message_Block[64]; /* 512-bit message blocks */
int Computed; /* Is the digest computed? */
int Corrupted; /* Is the message digest corrupted? */
U8 result_buf[20]; // Place to put result
void SHA1PadMessage();
void SHA1ProcessMessageBlock();
U32 SHA1CircularShift(int bits, U32 word) {
return (((word) << (bits)) | ((word) >> (32-(bits))));
}
int SHA1Reset(); // Initalize
int SHA1Input(const U8 *, unsigned int n); // Hash n bytes
int SHA1Result(U8 Message_Digest[SHA1HashSize]); // Store result
public:
SHA1() {SHA1Reset();} // Begin hash
void put(int c) { // Hash 1 byte
U8 ch=c;
SHA1Input(&ch, 1);
}
int result(int i); // Finish and return byte i (0..19) of SHA1 hash
double size() const { // Number of bytes hashed so far
return (Length_Low+4294967296.0*Length_High)/8;}
};
int SHA1::result(int i) {
assert(i>=0 && i<20);
if (!Computed && shaSuccess != SHA1Result(result_buf))
error("SHA1 failed\n");
return result_buf[i];
}
/*
* SHA1Reset
*
* Description:
* This function will initialize the SHA1Context in preparation
* for computing a new SHA1 message digest.
*
* Parameters: none
*
* Returns:
* sha Error Code.
*
*/
int SHA1::SHA1Reset()
{
Length_Low = 0;
Length_High = 0;
Message_Block_Index = 0;
Intermediate_Hash[0] = 0x67452301;
Intermediate_Hash[1] = 0xEFCDAB89;
Intermediate_Hash[2] = 0x98BADCFE;
Intermediate_Hash[3] = 0x10325476;
Intermediate_Hash[4] = 0xC3D2E1F0;
Computed = 0;
Corrupted = 0;
return shaSuccess;
}
/*
* SHA1Result
*
* Description:
* This function will return the 160-bit message digest into the
* Message_Digest array provided by the caller.
* NOTE: The first octet of hash is stored in the 0th element,
* the last octet of hash in the 19th element.
*
* Parameters:
* Message_Digest: [out]
* Where the digest is returned.
*
* Returns:
* sha Error Code.
*
*/
int SHA1::SHA1Result(U8 Message_Digest[SHA1HashSize])
{
int i;
if (!Message_Digest)
{
return shaNull;
}
if (Corrupted)
{
return Corrupted;
}
if (!Computed)
{
SHA1PadMessage();
for(i=0; i<64; ++i)
{
/* message may be sensitive, clear it out */
Message_Block[i] = 0;
}
// Length_Low = 0; /* and DON'T clear length */
// Length_High = 0;
Computed = 1;
}
for(i = 0; i < SHA1HashSize; ++i)
{
Message_Digest[i] = Intermediate_Hash[i>>2]
>> 8 * ( 3 - ( i & 0x03 ) );
}
return shaSuccess;
}
/*
* SHA1Input
*
* Description:
* This function accepts an array of octets as the next portion
* of the message.
*
* Parameters:
* message_array: [in]
* An array of characters representing the next portion of
* the message.
* length: [in]
* The length of the message in message_array
*
* Returns:
* sha Error Code.
*
*/
int SHA1::SHA1Input(const U8 *message_array, unsigned length)
{
if (!length)
{
return shaSuccess;
}
if (!message_array)
{
return shaNull;
}
if (Computed)
{
Corrupted = shaStateError;
return shaStateError;
}
if (Corrupted)
{
return Corrupted;
}
while(length-- && !Corrupted)
{
Message_Block[Message_Block_Index++] =
(*message_array & 0xFF);
Length_Low += 8;
if (Length_Low == 0)
{
Length_High++;
if (Length_High == 0)
{
/* Message is too long */
Corrupted = 1;
}
}
if (Message_Block_Index == 64)
{
SHA1ProcessMessageBlock();
}
message_array++;
}
return shaSuccess;
}
/*
* SHA1ProcessMessageBlock
*
* Description:
* This function will process the next 512 bits of the message
* stored in the Message_Block array.
*
* Parameters:
* None.
*
* Returns:
* Nothing.
*
* Comments:
* Many of the variable names in this code, especially the
* single character names, were used because those were the
* names used in the publication.
*
*
*/
void SHA1::SHA1ProcessMessageBlock()
{
const U32 K[] = { /* Constants defined in SHA-1 */
0x5A827999,
0x6ED9EBA1,
0x8F1BBCDC,
0xCA62C1D6
};
int t; /* Loop counter */
U32 temp; /* Temporary word value */
U32 W[80]; /* Word sequence */
U32 A, B, C, D, E; /* Word buffers */
/*
* Initialize the first 16 words in the array W
*/
for(t = 0; t < 16; t++)
{
W[t] = Message_Block[t * 4] << 24;
W[t] |= Message_Block[t * 4 + 1] << 16;
W[t] |= Message_Block[t * 4 + 2] << 8;
W[t] |= Message_Block[t * 4 + 3];
}
for(t = 16; t < 80; t++)
{
W[t] = SHA1CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]);
}
A = Intermediate_Hash[0];
B = Intermediate_Hash[1];
C = Intermediate_Hash[2];
D = Intermediate_Hash[3];
E = Intermediate_Hash[4];
for(t = 0; t < 20; t++)
{
temp = SHA1CircularShift(5,A) +
((B & C) | ((~B) & D)) + E + W[t] + K[0];
E = D;
D = C;
C = SHA1CircularShift(30,B);
B = A;
A = temp;
}
for(t = 20; t < 40; t++)
{
temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1];
E = D;
D = C;
C = SHA1CircularShift(30,B);
B = A;
A = temp;
}
for(t = 40; t < 60; t++)
{
temp = SHA1CircularShift(5,A) +
((B & C) | (B & D) | (C & D)) + E + W[t] + K[2];
E = D;
D = C;
C = SHA1CircularShift(30,B);
B = A;
A = temp;
}
for(t = 60; t < 80; t++)
{
temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];
E = D;
D = C;
C = SHA1CircularShift(30,B);
B = A;
A = temp;
}
Intermediate_Hash[0] += A;
Intermediate_Hash[1] += B;
Intermediate_Hash[2] += C;
Intermediate_Hash[3] += D;
Intermediate_Hash[4] += E;
Message_Block_Index = 0;
}
/*
* SHA1PadMessage
*
* Description:
* According to the standard, the message must be padded to an even
* 512 bits. The first padding bit must be a '1'. The last 64
* bits represent the length of the original message. All bits in
* between should be 0. This function will pad the message
* according to those rules by filling the Message_Block array
* accordingly. It will also call the ProcessMessageBlock function
* provided appropriately. When it returns, it can be assumed that
* the message digest has been computed.
*
* Parameters:
* ProcessMessageBlock: [in]
* The appropriate SHA*ProcessMessageBlock function
* Returns:
* Nothing.
*
*/
void SHA1::SHA1PadMessage()
{
/*
* Check to see if the current message block is too small to hold
* the initial padding bits and length. If so, we will pad the
* block, process it, and then continue padding into a second
* block.
*/
if (Message_Block_Index > 55)
{
Message_Block[Message_Block_Index++] = 0x80;
while(Message_Block_Index < 64)
{
Message_Block[Message_Block_Index++] = 0;
}
SHA1ProcessMessageBlock();
while(Message_Block_Index < 56)
{
Message_Block[Message_Block_Index++] = 0;
}
}
else
{
Message_Block[Message_Block_Index++] = 0x80;
while(Message_Block_Index < 56)
{
Message_Block[Message_Block_Index++] = 0;
}
}
/*
* Store the message length as the last 8 octets
*/
Message_Block[56] = Length_High >> 24;
Message_Block[57] = Length_High >> 16;
Message_Block[58] = Length_High >> 8;
Message_Block[59] = Length_High;
Message_Block[60] = Length_Low >> 24;
Message_Block[61] = Length_Low >> 16;
Message_Block[62] = Length_Low >> 8;
Message_Block[63] = Length_Low;
SHA1ProcessMessageBlock();
}
//////////////////////////// ZPAQL //////////////////////////////
// Symbolic constants, instruction size, and names
typedef enum {NONE,CONS,CM,ICM,MATCH,AVG,MIX2,MIX,ISSE,SSE} CompType;
static const int compsize[256]={0,2,3,2,3,4,6,6,3,5};
// A ZPAQL machine COMP+HCOMP or PCOMP.
class ZPAQL {
public:
ZPAQL();
int read(Reader r); // Read header from archive or array
int write(FILE* out); // Write header to archive
void inith(); // Initialize as HCOMP to run
void initp(); // Initialize as PCOMP to run
U32 H(int i) {return h(i);} // get element of h
void run(U32 input); // Execute with input
FILE* output; // Destination for OUT instruction, or 0 to suppress
SHA1* sha1; // Points to checksum computer
double memory(); // Return memory requirement in bytes
void selectModel(int sel); // Match header to sel
// ZPAQ1 block header
Array<U8> header; // hsize[2] hh hm ph pm n COMP (guard) HCOMP (guard)
int cend; // COMP in header[7...cend-1]
int hbegin, hend; // HCOMP/PCOMP in header[hbegin...hend-1]
int select; // Which optimized version of run()? (default 0)
private:
// Machine state for executing HCOMP
Array<U8> m; // memory array M for HCOMP
Array<U32> h; // hash array H for HCOMP
Array<U32> r; // 256 element register array
U32 a, b, c, d; // machine registers
int f; // condition flag
int pc; // program counter
// Support code
void init(int hbits, int mbits); // initialize H and M sizes
int execute(); // execute 1 instruction, return 0 after HALT, else 1
void run0(U32 input); // default run() when select==0
void div(U32 x) {if (x) a/=x; else a=0;}
void mod(U32 x) {if (x) a%=x; else a=0;}
void swap(U32& x) {a^=x; x^=a; a^=x;}
void swap(U8& x) {a^=x; x^=a; a^=x;}
void err(); // exit with run time error
};
// Constructor
ZPAQL::ZPAQL() {
cend=hbegin=hend=0; // COMP and HCOMP locations
a=b=c=d=f=pc=0; // machine state
output=0;
sha1=0;
select=0;
}
// Read header, return number of bytes read
int ZPAQL::read(Reader r) {
// Get header size and allocate
int hsize=r.get();
hsize+=r.get()*256;
header.resize(hsize+300);
cend=hbegin=hend=0;
header[cend++]=hsize&255;
header[cend++]=hsize>>8;
while (cend<7) header[cend++]=r.get(); // hh hm ph pm n
// Read COMP
int n=header[cend-1];
for (int i=0; i<n; ++i) {
int type=r.get(); // component type
if (type==EOF) error("unexpected end of file");
header[cend++]=type; // component type
int size=compsize[type];
if (size<1) error("Invalid component type");
if (cend+size>header.size()-8) error("COMP list too big");
for (int j=1; j<size; ++j)
header[cend++]=r.get();
}
if ((header[cend++]=r.get())!=0) error("missing COMP END");
// Insert a guard gap and read HCOMP
hbegin=hend=cend+128;
while (hend<hsize+129) {
assert(hend<header.size()-8);
int op=r.get();
if (op==EOF) error("unexpected end of file");
header[hend++]=op;
}
if ((header[hend++]=r.get())!=0) error("missing HCOMP END");
assert(cend>=7 && cend<header.size());
assert(hbegin==cend+128 && hbegin<header.size());
assert(hend>hbegin && hend<header.size());
assert(hsize==header[0]+256*header[1]);
assert(hsize==cend-2+hend-hbegin);
selectModel(0); // set select if an optimization is available
return cend+hend-hbegin;
}
// Write header. Return number of bytes written.
int ZPAQL::write(FILE* out) {
assert(out);
assert(cend>=7 && cend<header.size());
assert(hbegin==cend+128 && hbegin<header.size());
assert(hend>hbegin && hend<header.size());
assert(header[0]+256*header[1]==cend-2+hend-hbegin);
fwrite(&header[0], 1, cend, out);
fwrite(&header[hbegin], 1, hend-hbegin, out);
return cend+hend-hbegin;
}
// Initialize machine state as HCOMP
void ZPAQL::inith() {
assert(header.size()>6);
init(header[2], header[3]); // hh, hm
}
// Initialize machine state as PCOMP
void ZPAQL::initp() {
assert(header.size()>6);
init(header[4], header[5]); // ph, pm
}
// Return memory requirement in bytes
double ZPAQL::memory() {
double mem=pow(2.0,header[2]+2)+pow(2.0,header[3]) // hh hm
+pow(2.0,header[4]+2)+pow(2.0,header[5]) // ph pm
+header.size();
int cp=7; // start of comp list
for (int i=0; i<header[6]; ++i) { // n
assert(cp<cend);
double size=pow(2.0, header[cp+1]); // sizebits
switch(header[cp]) {
case CM: mem+=4*size; break;
case ICM: mem+=64*size+1024; break;
case MATCH: mem+=4*size+pow(2.0, header[cp+2]); break; // bufbits
case MIX2: mem+=2*size; break;
case MIX: mem+=4*size*header[cp+3]; break; // m
case ISSE: mem+=64*size+2048; break;
case SSE: mem+=128*size; break;
}
cp+=compsize[header[cp]];
}
return mem;
}
// Initialize machine state to run a program.
// Set select to nonzero if header matches anything in the cache
// or else add it.
void ZPAQL::init(int hbits, int mbits) {
assert(header.size()>0);
assert(h.size()==0);
assert(m.size()==0);
assert(cend>=7);
assert(hbegin>=cend+128);
assert(hend>=hbegin);
assert(hend<header.size()-130);
assert(header[0]+256*header[1]==cend-2+hend-hbegin);
h.resize(1, hbits);
m.resize(1, mbits);
r.resize(256);
a=b=c=d=pc=f=0;
}
// Run program on input by interpreting header
void ZPAQL::run0(U32 input) {
assert(cend>6);
assert(hbegin>=cend+128);
assert(hend>=hbegin);
assert(hend<header.size()-130);
assert(m.size()>0);
assert(h.size()>0);
assert(header[0]+256*header[1]==cend+hend-hbegin-2);
pc=hbegin;
a=input;
while (execute()) ;
}
// Execute one instruction, return 0 after HALT else 1
inline int ZPAQL::execute() {
switch(header[pc++]) {
case 0: err(); break; // ERROR
case 1: ++a; break; // A++
case 2: --a; break; // A--
case 3: a = ~a; break; // A!
case 4: a = 0; break; // A=0
case 7: a = r[header[pc++]]; break; // A=R N
case 8: swap(b); break; // B<>A
case 9: ++b; break; // B++
case 10: --b; break; // B--
case 11: b = ~b; break; // B!
case 12: b = 0; break; // B=0
case 15: b = r[header[pc++]]; break; // B=R N
case 16: swap(c); break; // C<>A
case 17: ++c; break; // C++
case 18: --c; break; // C--
case 19: c = ~c; break; // C!
case 20: c = 0; break; // C=0
case 23: c = r[header[pc++]]; break; // C=R N
case 24: swap(d); break; // D<>A
case 25: ++d; break; // D++
case 26: --d; break; // D--
case 27: d = ~d; break; // D!
case 28: d = 0; break; // D=0
case 31: d = r[header[pc++]]; break; // D=R N
case 32: swap(m(b)); break; // *B<>A
case 33: ++m(b); break; // *B++
case 34: --m(b); break; // *B--
case 35: m(b) = ~m(b); break; // *B!
case 36: m(b) = 0; break; // *B=0
case 39: if (f) pc+=((header[pc]+128)&255)-127; else ++pc; break; // JT N
case 40: swap(m(c)); break; // *C<>A
case 41: ++m(c); break; // *C++
case 42: --m(c); break; // *C--
case 43: m(c) = ~m(c); break; // *C!
case 44: m(c) = 0; break; // *C=0
case 47: if (!f) pc+=((header[pc]+128)&255)-127; else ++pc; break; // JF N
case 48: swap(h(d)); break; // *D<>A
case 49: ++h(d); break; // *D++
case 50: --h(d); break; // *D--
case 51: h(d) = ~h(d); break; // *D!
case 52: h(d) = 0; break; // *D=0
case 55: r[header[pc++]] = a; break; // R=A N
case 56: return 0 ; // HALT
case 57: if (output) putc(a, output); if (sha1) sha1->put(a); break; // OUT
case 59: a = (a+m(b)+512)*773; break; // HASH
case 60: h(d) = (h(d)+a+512)*773; break; // HASHD
case 63: pc+=((header[pc]+128)&255)-127; break; // JMP N
case 64: a = a; break; // A=A
case 65: a = b; break; // A=B
case 66: a = c; break; // A=C
case 67: a = d; break; // A=D
case 68: a = m(b); break; // A=*B
case 69: a = m(c); break; // A=*C
case 70: a = h(d); break; // A=*D
case 71: a = header[pc++]; break; // A= N
case 72: b = a; break; // B=A
case 73: b = b; break; // B=B
case 74: b = c; break; // B=C
case 75: b = d; break; // B=D
case 76: b = m(b); break; // B=*B
case 77: b = m(c); break; // B=*C
case 78: b = h(d); break; // B=*D
case 79: b = header[pc++]; break; // B= N
case 80: c = a; break; // C=A
case 81: c = b; break; // C=B
case 82: c = c; break; // C=C
case 83: c = d; break; // C=D
case 84: c = m(b); break; // C=*B
case 85: c = m(c); break; // C=*C
case 86: c = h(d); break; // C=*D
case 87: c = header[pc++]; break; // C= N
case 88: d = a; break; // D=A
case 89: d = b; break; // D=B
case 90: d = c; break; // D=C
case 91: d = d; break; // D=D
case 92: d = m(b); break; // D=*B
case 93: d = m(c); break; // D=*C
case 94: d = h(d); break; // D=*D
case 95: d = header[pc++]; break; // D= N
case 96: m(b) = a; break; // *B=A
case 97: m(b) = b; break; // *B=B
case 98: m(b) = c; break; // *B=C
case 99: m(b) = d; break; // *B=D
case 100: m(b) = m(b); break; // *B=*B
case 101: m(b) = m(c); break; // *B=*C
case 102: m(b) = h(d); break; // *B=*D
case 103: m(b) = header[pc++]; break; // *B= N
case 104: m(c) = a; break; // *C=A
case 105: m(c) = b; break; // *C=B
case 106: m(c) = c; break; // *C=C
case 107: m(c) = d; break; // *C=D
case 108: m(c) = m(b); break; // *C=*B
case 109: m(c) = m(c); break; // *C=*C
case 110: m(c) = h(d); break; // *C=*D
case 111: m(c) = header[pc++]; break; // *C= N
case 112: h(d) = a; break; // *D=A
case 113: h(d) = b; break; // *D=B
case 114: h(d) = c; break; // *D=C
case 115: h(d) = d; break; // *D=D
case 116: h(d) = m(b); break; // *D=*B
case 117: h(d) = m(c); break; // *D=*C
case 118: h(d) = h(d); break; // *D=*D
case 119: h(d) = header[pc++]; break; // *D= N
case 128: a += a; break; // A+=A
case 129: a += b; break; // A+=B
case 130: a += c; break; // A+=C
case 131: a += d; break; // A+=D
case 132: a += m(b); break; // A+=*B
case 133: a += m(c); break; // A+=*C
case 134: a += h(d); break; // A+=*D
case 135: a += header[pc++]; break; // A+= N
case 136: a -= a; break; // A-=A
case 137: a -= b; break; // A-=B
case 138: a -= c; break; // A-=C
case 139: a -= d; break; // A-=D
case 140: a -= m(b); break; // A-=*B
case 141: a -= m(c); break; // A-=*C
case 142: a -= h(d); break; // A-=*D
case 143: a -= header[pc++]; break; // A-= N
case 144: a *= a; break; // A*=A
case 145: a *= b; break; // A*=B
case 146: a *= c; break; // A*=C
case 147: a *= d; break; // A*=D
case 148: a *= m(b); break; // A*=*B
case 149: a *= m(c); break; // A*=*C
case 150: a *= h(d); break; // A*=*D
case 151: a *= header[pc++]; break; // A*= N
case 152: div(a); break; // A/=A
case 153: div(b); break; // A/=B
case 154: div(c); break; // A/=C
case 155: div(d); break; // A/=D
case 156: div(m(b)); break; // A/=*B
case 157: div(m(c)); break; // A/=*C
case 158: div(h(d)); break; // A/=*D
case 159: div(header[pc++]); break; // A/= N
case 160: mod(a); break; // A%=A
case 161: mod(b); break; // A%=B
case 162: mod(c); break; // A%=C
case 163: mod(d); break; // A%=D
case 164: mod(m(b)); break; // A%=*B
case 165: mod(m(c)); break; // A%=*C
case 166: mod(h(d)); break; // A%=*D
case 167: mod(header[pc++]); break; // A%= N
case 168: a &= a; break; // A&=A
case 169: a &= b; break; // A&=B
case 170: a &= c; break; // A&=C
case 171: a &= d; break; // A&=D
case 172: a &= m(b); break; // A&=*B
case 173: a &= m(c); break; // A&=*C
case 174: a &= h(d); break; // A&=*D
case 175: a &= header[pc++]; break; // A&= N
case 176: a &= ~ a; break; // A&~A
case 177: a &= ~ b; break; // A&~B
case 178: a &= ~ c; break; // A&~C
case 179: a &= ~ d; break; // A&~D
case 180: a &= ~ m(b); break; // A&~*B
case 181: a &= ~ m(c); break; // A&~*C
case 182: a &= ~ h(d); break; // A&~*D
case 183: a &= ~ header[pc++]; break; // A&~ N
case 184: a |= a; break; // A|=A
case 185: a |= b; break; // A|=B
case 186: a |= c; break; // A|=C
case 187: a |= d; break; // A|=D
case 188: a |= m(b); break; // A|=*B
case 189: a |= m(c); break; // A|=*C
case 190: a |= h(d); break; // A|=*D
case 191: a |= header[pc++]; break; // A|= N
case 192: a ^= a; break; // A^=A
case 193: a ^= b; break; // A^=B
case 194: a ^= c; break; // A^=C
case 195: a ^= d; break; // A^=D
case 196: a ^= m(b); break; // A^=*B
case 197: a ^= m(c); break; // A^=*C
case 198: a ^= h(d); break; // A^=*D
case 199: a ^= header[pc++]; break; // A^= N
case 200: a <<= (a&31); break; // A<<=A
case 201: a <<= (b&31); break; // A<<=B
case 202: a <<= (c&31); break; // A<<=C
case 203: a <<= (d&31); break; // A<<=D
case 204: a <<= (m(b)&31); break; // A<<=*B
case 205: a <<= (m(c)&31); break; // A<<=*C
case 206: a <<= (h(d)&31); break; // A<<=*D
case 207: a <<= (header[pc++]&31); break; // A<<= N
case 208: a >>= (a&31); break; // A>>=A
case 209: a >>= (b&31); break; // A>>=B
case 210: a >>= (c&31); break; // A>>=C
case 211: a >>= (d&31); break; // A>>=D
case 212: a >>= (m(b)&31); break; // A>>=*B
case 213: a >>= (m(c)&31); break; // A>>=*C
case 214: a >>= (h(d)&31); break; // A>>=*D
case 215: a >>= (header[pc++]&31); break; // A>>= N
case 216: f = (a == a); break; // A==A
case 217: f = (a == b); break; // A==B
case 218: f = (a == c); break; // A==C
case 219: f = (a == d); break; // A==D
case 220: f = (a == U32(m(b))); break; // A==*B
case 221: f = (a == U32(m(c))); break; // A==*C
case 222: f = (a == h(d)); break; // A==*D
case 223: f = (a == U32(header[pc++])); break; // A== N
case 224: f = (a < a); break; // A<A
case 225: f = (a < b); break; // A<B
case 226: f = (a < c); break; // A<C
case 227: f = (a < d); break; // A<D
case 228: f = (a < U32(m(b))); break; // A<*B
case 229: f = (a < U32(m(c))); break; // A<*C
case 230: f = (a < h(d)); break; // A<*D
case 231: f = (a < U32(header[pc++])); break; // A< N
case 232: f = (a > a); break; // A>A
case 233: f = (a > b); break; // A>B
case 234: f = (a > c); break; // A>C
case 235: f = (a > d); break; // A>D
case 236: f = (a > U32(m(b))); break; // A>*B
case 237: f = (a > U32(m(c))); break; // A>*C
case 238: f = (a > h(d)); break; // A>*D
case 239: f = (a > U32(header[pc++])); break; // A> N
case 255: if((pc=hbegin+header[pc]+256*header[pc+1])>=hend)err();break;//LJ
default: err();
}
return 1;
}
// Print illegal instruction error message and exit
void ZPAQL::err() {
error("ZPAQL execution error");
}
//////////////////////////// Component ////////////////////////////
// A Component is a context model, indirect context model, match model,
// fixed weight mixer, adaptive 2 input mixer without or with current
// partial byte as context, adaptive m input mixer (without or with),
// or SSE (without or with).
struct Component {
int limit; // max count for cm
U32 cxt; // saved context
int a, b, c; // multi-purpose variables
Array<U32> cm; // cm[cxt] -> p in bits 31..10, n in 9..0; MATCH index
Array<U8> ht; // ICM hash table[0..size1][0..15] of bit histories; MATCH buf
Array<U16> a16; // multi-use
Component(); // initialize to all 0
};
Component::Component(): limit(0), cxt(0), a(0), b(0), c(0) {}
////////////////////////// StateTable //////////////////////////
// Next state table generator
class StateTable {
enum {B=6, N=64}; // sizes of b, t
static U8 ns[1024]; // state*4 -> next state if 0, if 1, n0, n1
static const int bound[B]; // n0 -> max n1, n1 -> max n0
int num_states(int n0, int n1); // compute t[n0][n1][1]
void discount(int& n0); // set new value of n0 after 1 or n1 after 0
void next_state(int& n0, int& n1, int y); // new (n0,n1) after bit y
public:
int next(int state, int y) { // next state for bit y
assert(state>=0 && state<256);
assert(y>=0 && y<4);
return ns[state*4+y];
}
int cminit(int state) { // initial probability of 1 * 2^23
assert(state>=0 && state<256);
return ((ns[state*4+3]*2+1)<<22)/(ns[state*4+2]+ns[state*4+3]+1);
}
StateTable();
};
U8 StateTable::ns[1024]={0};
const int StateTable::bound[B]={20,48,15,8,6,5}; // n0 -> max n1, n1 -> max n0
// How many states with count of n0 zeros, n1 ones (0...2)
int StateTable::num_states(int n0, int n1) {
if (n0<n1) return num_states(n1, n0);
if (n0<0 || n1<0 || n0>=N || n1>=N || n1>=B || n0>bound[n1]) return 0;
return 1+(n1>0 && n0+n1<=17);
}
// New value of count n0 if 1 is observed (and vice versa)
void StateTable::discount(int& n0) {
n0=(n0>=1)+(n0>=2)+(n0>=3)+(n0>=4)+(n0>=5)+(n0>=7)+(n0>=8);
}
// compute next n0,n1 (0 to N) given input y (0 or 1)
void StateTable::next_state(int& n0, int& n1, int y) {
if (n0<n1)
next_state(n1, n0, 1-y);
else {
if (y) {
++n1;
discount(n0);
}
else {
++n0;
discount(n1);
}
// 20,0,0 -> 20,0
// 48,1,0 -> 48,1
// 15,2,0 -> 8,1
// 8,3,0 -> 6,2
// 8,3,1 -> 5,3
// 6,4,0 -> 5,3
// 5,5,0 -> 5,4
// 5,5,1 -> 4,5
while (!num_states(n0, n1)) {
if (n1<2) --n0;
else {
n0=(n0*(n1-1)+(n1/2))/n1;
--n1;
}
}
}
}
// Initialize next state table ns[state*4] -> next if 0, next if 1, n0, n1
StateTable::StateTable() {
// Assign states by increasing priority
U8 t[N][N][2]={{{0}}}; // (n0,n1,y) -> state number
int state=0;
for (int i=0; i<N; ++i) {
for (int n1=0; n1<=i; ++n1) {
int n0=i-n1;
int n=num_states(n0, n1);
assert(n>=0 && n<=2);
if (n) {
t[n0][n1][0]=state;
t[n0][n1][1]=state+n-1;
state+=n;
}
}
}
// Generate next state table
for (int n0=0; n0<N; ++n0) {
for (int n1=0; n1<N; ++n1) {
for (int y=0; y<num_states(n0, n1); ++y) {
int s=t[n0][n1][y];
assert(s>=0 && s<256);
int s0=n0, s1=n1;
next_state(s0, s1, 0);
assert(s0>=0 && s0<N && s1>=0 && s1<N);
ns[s*4+0]=t[s0][s1][0];
s0=n0, s1=n1;
next_state(s0, s1, 1);
assert(s0>=0 && s0<N && s1>=0 && s1<N);
ns[s*4+1]=t[s0][s1][1];
ns[s*4+2]=n0;
ns[s*4+3]=n1;
}
}
}
}
//////////////////////////// Predictor ////////////////////////////
// A predictor guesses the next bit
class Predictor {
public:
Predictor(ZPAQL&); // build model
int predict(); // probability that next bit is a 1 (0..4095)
void update(int y); // train on bit y (0..1)
void stat(); // print statistics
private:
// Predictor state
int c8; // last 0...7 bits.
int hmap4; // c8 split into nibbles
int p[256]; // predictions
ZPAQL& z; // VM to compute context hashes, includes H, n
Component comp[256]; // the model, includes P
// Modeling support functions
int predict0(); // default
int predict1(); // optimized
void update0(int y); // default
void update1(int y); // optimized
int dt[1024]; // division table for cm: dt[i] = 2^16/(i+1.5)
U16 squasht[4096]; // squash() lookup table
short stretcht[32768];// stretch() lookup table
StateTable st; // next, cminit functions
// reduce prediction error in cr.cm
void train(Component& cr, int y) {
assert(y==0 || y==1);
U32& pn=cr.cm(cr.cxt);
int count=pn&0x3ff;
int error=y*32767-(cr.cm(cr.cxt)>>17);
pn+=(error*dt[count]&-1024)+(count<cr.limit);
}
// x -> floor(32768/(1+exp(-x/64)))
int squash(int x) {
assert(x>=-2048 && x<=2047);
return squasht[x+2048];
}
// x -> round(64*log((x+0.5)/(32767.5-x))), approx inverse of squash
int stretch(int x) {
assert(x>=0 && x<=32767);
return stretcht[x];
}
// bound x to a 12 bit signed int
int clamp2k(int x) {
if (x<-2048) return -2048;
else if (x>2047) return 2047;
else return x;
}
// bound x to a 20 bit signed int
int clamp512k(int x) {
if (x<-(1<<19)) return -(1<<19);
else if (x>=(1<<19)) return (1<<19)-1;
else return x;
}
// Get cxt in ht, creating a new row if needed
int find(Array<U8>& ht, int sizebits, U32 cxt);
};
// Initailize the model
Predictor::Predictor(ZPAQL& zr): c8(1), hmap4(1), z(zr) {
assert(sizeof(U8)==1);
assert(sizeof(U16)==2);
assert(sizeof(U32)==4);
assert(sizeof(short)==2);
assert(sizeof(int)==4);
// Initialize tables
for (int i=0; i<1024; ++i)
dt[i]=(1<<17)/(i*2+3)*2;
for (int i=0; i<32768; ++i)
stretcht[i]=int(log((i+0.5)/(32767.5-i))*64+0.5+100000)-100000;
for (int i=0; i<4096; ++i)
squasht[i]=int(32768.0/(1+exp((i-2048)*(-1.0/64))));
// Verify floating point math for squash() and stretch()
U32 sqsum=0, stsum=0;
for (int i=32767; i>=0; --i)
stsum=stsum*3+stretch(i);
for (int i=4095; i>=0; --i)
sqsum=sqsum*3+squash(i-2048);
assert(stsum==3887533746u);
assert(sqsum==2278286169u);
// Initialize context hash function
z.inith();
// Initialize predictions
for (int i=0; i<256; ++i) p[i]=0;
// Initialize components
int n=z.header[6]; // hsize[0..1] hh hm ph pm n (comp)[n] END 0[128] (hcomp) END
if (n<1 || n>255) error("n must be 1..255 components");
const U8* cp=&z.header[7]; // start of component list
for (int i=0; i<n; ++i) {
assert(cp<&z.header[z.cend]);
assert(cp>&z.header[0] && cp<&z.header[z.header.size()-8]);
Component& cr=comp[i];
switch(cp[0]) {
case CONS: // c
p[i]=(cp[1]-128)*4;
break;
case CM: // sizebits limit
cr.cm.resize(1, cp[1]); // packed CM (22 bits) + CMCOUNT (10 bits)
cr.limit=cp[2]*4;
for (int j=0; j<cr.cm.size(); ++j)
cr.cm[j]=0x80000000;
break;
case ICM: // sizebits
cr.limit=1023;
cr.cm.resize(256);
cr.ht.resize(64, cp[1]);
for (int j=0; j<cr.cm.size(); ++j)
cr.cm[j]=st.cminit(j);
break;
case MATCH: // sizebits
cr.cm.resize(1, cp[1]); // index
cr.ht.resize(1, cp[2]); // buf
cr.ht(0)=1;
break;
case AVG: // j k wt
break;
case MIX2: // sizebits j k rate mask
if (cp[3]>=i) error("MIX2 k >= i");
if (cp[2]>=i) error("MIX2 j >= i");
cr.c=(1<<cp[1]); // size (number of contexts)
cr.a16.resize(1, cp[1]); // wt[size][m]
for (int j=0; j<cr.a16.size(); ++j)
cr.a16[j]=32768;
break;
case MIX: { // sizebits j m rate mask
if (cp[2]>=i) error("MIX j >= i");
if (cp[3]<1 || cp[3]>i-cp[2])
error("MIX m not in 1..i-j");
int m=cp[3]; // number of inputs
assert(m>=1);
cr.c=(1<<cp[1]); // size (number of contexts)
cr.cm.resize(m, cp[1]); // wt[size][m]
for (int j=0; j<cr.cm.size(); ++j)
cr.cm[j]=65536/m;
break;
}
case ISSE: // sizebits j
if (cp[2]>=i) error("ISSE j >= i");
cr.ht.resize(64, cp[1]);
cr.cm.resize(512);
for (int j=0; j<256; ++j) {
cr.cm[j*2]=1<<15;
cr.cm[j*2+1]=clamp512k(stretch(st.cminit(j)>>8)<<10);
}
break;
case SSE: // sizebits j start limit
if (cp[2]>=i) error("SSE j >= i");
if (cp[3]>cp[4]*4) error("SSE start > limit*4");
cr.cm.resize(32, cp[1]);
cr.limit=cp[4]*4;
for (int j=0; j<cr.cm.size(); ++j)
cr.cm[j]=squash((j&31)*64-992)<<17|cp[3];
break;
default: error("unknown component type");
}
assert(compsize[*cp]>0);
cp+=compsize[*cp];
assert(cp>=&z.header[7] && cp<&z.header[z.cend]);
}
}
int Predictor::predict0() {
assert(c8>=1 && c8<=255);
// Predict next bit
int n=z.header[6];
assert(n>0 && n<=255);
const U8* cp=&z.header[7];
assert(cp[-1]==n);
for (int i=0; i<n; ++i) {
assert(cp>&z.header[0] && cp<&z.header[z.header.size()-8]);
Component& cr=comp[i];
switch(cp[0]) {
case CONS: // c
break;
case CM: // sizebits limit
cr.cxt=z.H(i)^hmap4;
p[i]=stretch(cr.cm(cr.cxt)>>17);
break;
case ICM: // sizebits
assert((hmap4&15)>0);
if (c8==1 || (c8&0xf0)==16) cr.c=find(cr.ht, cp[1]+2, z.H(i)+16*c8);
cr.cxt=cr.ht[cr.c+(hmap4&15)];
p[i]=stretch(cr.cm(cr.cxt)>>8);
break;
case MATCH: // sizebits bufbits: a=len, b=offset, c=bit, cxt=256/len,
// ht=buf, limit=8*pos+bp
assert(cr.a>=0 && cr.a<=255);
if (cr.a==0) p[i]=0;
else {
cr.c=cr.ht((cr.limit>>3)-cr.b)>>(7-(cr.limit&7))&1; // predicted bit
p[i]=stretch(cr.cxt*(cr.c*-2+1)&32767);
}
break;
case AVG: // j k wt
p[i]=(p[cp[1]]*cp[3]+p[cp[2]]*(256-cp[3]))>>8;
break;
case MIX2: { // sizebits j k rate mask
// c=size cm=wt[size][m] cxt=input
cr.cxt=((z.H(i)+(c8&cp[5]))&(cr.c-1));
assert(int(cr.cxt)>=0 && int(cr.cxt)<cr.a16.size());
int w=cr.a16[cr.cxt];
assert(w>=0 && w<65536);
p[i]=(w*p[cp[2]]+(65536-w)*p[cp[3]])>>16;
assert(p[i]>=-2048 && p[i]<2048);
}
break;
case MIX: { // sizebits j m rate mask
// c=size cm=wt[size][m] cxt=index of wt in cm
int m=cp[3];
assert(m>=1 && m<=i);
cr.cxt=z.H(i)+(c8&cp[5]);
cr.cxt=(cr.cxt&(cr.c-1))*m; // pointer to row of weights
assert(int(cr.cxt)>=0 && int(cr.cxt)<=cr.cm.size()-m);
int* wt=(int*)&cr.cm[cr.cxt];
p[i]=0;
for (int j=0; j<m; ++j)
p[i]+=(wt[j]>>8)*p[cp[2]+j];
p[i]=clamp2k(p[i]>>8);
}
break;
case ISSE: { // sizebits j -- c=hi, cxt=bh
assert((hmap4&15)>0);
if (c8==1 || (c8&0xf0)==16)
cr.c=find(cr.ht, cp[1]+2, z.H(i)+16*c8);
cr.cxt=cr.ht[cr.c+(hmap4&15)]; // bit history
int *wt=(int*)&cr.cm[cr.cxt*2];
p[i]=clamp2k((wt[0]*p[cp[2]]+wt[1]*64)>>16);
}
break;
case SSE: { // sizebits j start limit
cr.cxt=(z.H(i)+c8)*32;
int pq=p[cp[2]]+992;
if (pq<0) pq=0;
if (pq>1983) pq=1983;
int wt=pq&63;
pq>>=6;
assert(pq>=0 && pq<=30);
cr.cxt+=pq;
p[i]=stretch(((cr.cm(cr.cxt)>>10)*(64-wt)+(cr.cm(cr.cxt+1)>>10)*wt)>>13);
cr.cxt+=wt>>5;
}
break;
default:
error("component predict not implemented");
}
cp+=compsize[cp[0]];
assert(cp<&z.header[z.cend]);
assert(p[i]>=-2048 && p[i]<2048);
}
assert(cp[0]==NONE);
return squash(p[n-1]);
}
// Update model with decoded bit y (0...1)
void Predictor::update0(int y) {
assert(y==0 || y==1);
assert(c8>=1 && c8<=255);
assert(hmap4>=1 && hmap4<=511);
// Update components
const U8* cp=&z.header[7];
int n=z.header[6];
assert(n>=1 && n<=255);
assert(cp[-1]==n);
for (int i=0; i<n; ++i) {
Component& cr=comp[i];
switch(cp[0]) {
case CONS: // c
break;
case CM: // sizebits limit
train(cr, y);
break;
case ICM: { // sizebits: cxt=ht[b]=bh, ht[c][0..15]=bh row, cxt=bh
cr.ht[cr.c+(hmap4&15)]=st.next(cr.ht[cr.c+(hmap4&15)], y);
U32& pn=cr.cm(cr.cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
break;
case MATCH: // sizebits bufbits:
// a=len, b=offset, c=bit, cm=index, cxt=256/len
// ht=buf, limit=8*pos+bp
{
assert(cr.a>=0 && cr.a<=255);
assert(cr.c==0 || cr.c==1);
if (cr.c!=y) cr.a=0; // mismatch?
cr.ht(cr.limit>>3)+=cr.ht(cr.limit>>3)+y;
if ((++cr.limit&7)==0) {
int pos=cr.limit>>3;
if (cr.a==0) { // look for a match
cr.b=pos-cr.cm(z.H(i));
if (cr.b&(cr.ht.size()-1))
while (cr.a<255 && cr.ht(pos-cr.a-1)==cr.ht(pos-cr.a-cr.b-1))
++cr.a;
}
else cr.a+=cr.a<255;
cr.cm(z.H(i))=pos;
if (cr.a>0) cr.cxt=2048/cr.a;
}
}
break;
case AVG: // j k wt
break;
case MIX2: { // sizebits j k rate mask
// cm=input[2],wt[size][2], cxt=weight row
assert(cr.a16.size()==cr.c);
assert(int(cr.cxt)>=0 && int(cr.cxt)<cr.a16.size());
int err=(y*32767-squash(p[i]))*cp[4]>>5;
int w=cr.a16[cr.cxt];
w+=(err*(p[cp[2]]-p[cp[3]])+(1<<12))>>13;
if (w<0) w=0;
if (w>65535) w=65535;
cr.a16[cr.cxt]=w;
}
break;
case MIX: { // sizebits j m rate mask
// cm=wt[size][m], cxt=input
int m=cp[3];
assert(m>0 && m<=i);
assert(cr.cm.size()==m*cr.c);
assert(int(cr.cxt)>=0 && int(cr.cxt)<=cr.cm.size()-m);
int err=(y*32767-squash(p[i]))*cp[4]>>4;
int* wt=(int*)&cr.cm[cr.cxt];
for (int j=0; j<m; ++j)
wt[j]=clamp512k(wt[j]+((err*p[cp[2]+j]+(1<<12))>>13));
}
break;
case ISSE: { // sizebits j -- c=hi, cxt=bh
assert(cr.cxt==cr.ht[cr.c+(hmap4&15)]);
int err=y*32767-squash(p[i]);
int *wt=(int*)&cr.cm[cr.cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[cp[2]]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
cr.ht[cr.c+(hmap4&15)]=st.next(cr.cxt, y);
}
break;
case SSE: // sizebits j start limit
train(cr, y);
break;
default:
assert(0);
}
cp+=compsize[cp[0]];
assert(cp>=&z.header[7] && cp<&z.header[z.cend]
&& cp<&z.header[z.header.size()-8]);
}
assert(cp[0]==NONE);
// Save bit y in c8, hmap4
c8+=c8+y;
if (c8>=256) {
z.run(c8-256);
hmap4=1;
c8=1;
}
else if (c8>=16 && c8<32)
hmap4=(hmap4&0xf)<<5|y<<4|1;
else
hmap4=(hmap4&0x1f0)|(((hmap4&0xf)*2+y)&0xf);
}
// Find cxt row in hash table ht. ht has rows of 16 indexed by the
// low sizebits of cxt with element 0 having the next higher 8 bits for
// collision detection. If not found after 3 adjacent tries, replace the
// row with lowest element 1 as priority. Return index of row.
int Predictor::find(Array<U8>& ht, int sizebits, U32 cxt) {
assert(ht.size()==16<<sizebits);
int chk=cxt>>sizebits&255;
int h0=(cxt*16)&(ht.size()-16);
if (ht[h0]==chk) return h0;
int h1=h0^16;
if (ht[h1]==chk) return h1;
int h2=h0^32;
if (ht[h2]==chk) return h2;
if (ht[h0+1]<=ht[h1+1] && ht[h0+1]<=ht[h2+1])
return memset(&ht[h0], 0, 16), ht[h0]=chk, h0;
else if (ht[h1+1]<ht[h2+1])
return memset(&ht[h1], 0, 16), ht[h1]=chk, h1;
else
return memset(&ht[h2], 0, 16), ht[h2]=chk, h2;
}
//////////////////////// optimizations ////////////////////
// Optimization code can be generated by "zpaq oc" with various
// config files. Case labels and goto labels must be edited to remove
// duplicates.
// If sel > 0 then load the selected header and set select=sel.
// Otherwise search header for an optimization and set select>0 if found.
void ZPAQL::selectModel(int sel) {
// A list of headers for which optimizations are available
static const U8 models[]={
// fast.cfg
26,0,1,2,0,0,2,3,16,8,19,0,0,
// HCOMP
96,4,28,
59,10,59,112,25,10,59,10,59,112,56,0,
// mid.cfg
69,0,3,3,0,0,8,3,5,8,13,0,8,17,1,8,
18,2,8,18,3,8,19,4,4,22,24,7,16,0,7,24,
255,0,
// HCOMP
17,104,74,4,95,1,59,112,10,25,59,112,10,25,59,112,
10,25,59,112,10,25,59,112,10,25,59,10,59,112,25,69,
207,8,112,56,0,
// max.cfg
196,0,5,9,0,0,22,1,160,3,5,8,13,1,8,16,
2,8,18,3,8,19,4,8,19,5,8,20,6,4,22,24,
3,17,8,19,9,3,13,3,13,3,13,3,14,7,16,0,
15,24,255,7,8,0,16,10,255,6,0,15,16,24,0,9,
8,17,32,255,6,8,17,18,16,255,9,16,19,32,255,6,
0,19,20,16,0,0,
// HCOMP
17,104,74,4,95,2,59,112,10,25,
59,112,10,25,59,112,10,25,59,112,10,25,59,112,10,25,
59,10,59,112,10,25,59,112,10,25,69,183,32,239,64,47,
14,231,91,47,10,25,60,26,48,134,151,20,112,63,9,70,
223,0,39,3,25,112,26,52,25,25,74,10,4,59,112,25,
10,4,59,112,25,10,4,59,112,25,65,143,212,72,4,59,
112,8,143,216,8,68,175,60,60,25,69,207,9,112,25,25,
25,25,25,112,56,0,
// end of list
0,0};
// If sel>0 then load the selected optimized header
int p=0, len=0, count=0;
while (p<=int(sizeof(models))-2) {
++count;
len=models[p]+256*models[p+1];
if (len<1) break;
if (sel>0 && count==sel) { // load header
read(Reader(models+p, len+2));
select=count;
break;
}
else if (sel==0) {
if (cend+hend-hbegin==len+2 && memcmp(&header[0], models+p, cend)==0
&& memcmp(&header[hbegin], models+p+cend, hend-hbegin)==0) {
select=count;
}
}
p+=len+2;
}
if (cend<7) error("Invalid compression option");
}
// Optimized predict
int Predictor::predict() {
switch(z.select) {
// fast.cfg
case 1: {
// 2 components
// 0 ICM 16
if (c8==1 || (c8&0xf0)==16)
comp[0].c=find(comp[0].ht, 16+2, z.H(0)+16*c8);
comp[0].cxt=comp[0].ht[comp[0].c+(hmap4&15)];
p[0]=stretch(comp[0].cm(comp[0].cxt)>>8);
// 1 ISSE 19 0
{
if (c8==1 || (c8&0xf0)==16)
comp[1].c=find(comp[1].ht, 21, z.H(1)+16*c8);
comp[1].cxt=comp[1].ht[comp[1].c+(hmap4&15)];
int *wt=(int*)&comp[1].cm[comp[1].cxt*2];
p[1]=clamp2k((wt[0]*p[0]+wt[1]*64)>>16);
}
return squash(p[1]);
}
// mid.cfg
case 2: {
// 8 components
// 0 ICM 5
if (c8==1 || (c8&0xf0)==16)
comp[0].c=find(comp[0].ht, 5+2, z.H(0)+16*c8);
comp[0].cxt=comp[0].ht[comp[0].c+(hmap4&15)];
p[0]=stretch(comp[0].cm(comp[0].cxt)>>8);
// 1 ISSE 13 0
{
if (c8==1 || (c8&0xf0)==16)
comp[1].c=find(comp[1].ht, 15, z.H(1)+16*c8);
comp[1].cxt=comp[1].ht[comp[1].c+(hmap4&15)];
int *wt=(int*)&comp[1].cm[comp[1].cxt*2];
p[1]=clamp2k((wt[0]*p[0]+wt[1]*64)>>16);
}
// 2 ISSE 17 1
{
if (c8==1 || (c8&0xf0)==16)
comp[2].c=find(comp[2].ht, 19, z.H(2)+16*c8);
comp[2].cxt=comp[2].ht[comp[2].c+(hmap4&15)];
int *wt=(int*)&comp[2].cm[comp[2].cxt*2];
p[2]=clamp2k((wt[0]*p[1]+wt[1]*64)>>16);
}
// 3 ISSE 18 2
{
if (c8==1 || (c8&0xf0)==16)
comp[3].c=find(comp[3].ht, 20, z.H(3)+16*c8);
comp[3].cxt=comp[3].ht[comp[3].c+(hmap4&15)];
int *wt=(int*)&comp[3].cm[comp[3].cxt*2];
p[3]=clamp2k((wt[0]*p[2]+wt[1]*64)>>16);
}
// 4 ISSE 18 3
{
if (c8==1 || (c8&0xf0)==16)
comp[4].c=find(comp[4].ht, 20, z.H(4)+16*c8);
comp[4].cxt=comp[4].ht[comp[4].c+(hmap4&15)];
int *wt=(int*)&comp[4].cm[comp[4].cxt*2];
p[4]=clamp2k((wt[0]*p[3]+wt[1]*64)>>16);
}
// 5 ISSE 19 4
{
if (c8==1 || (c8&0xf0)==16)
comp[5].c=find(comp[5].ht, 21, z.H(5)+16*c8);
comp[5].cxt=comp[5].ht[comp[5].c+(hmap4&15)];
int *wt=(int*)&comp[5].cm[comp[5].cxt*2];
p[5]=clamp2k((wt[0]*p[4]+wt[1]*64)>>16);
}
// 6 MATCH 22 24
if (comp[6].a==0) p[6]=0;
else {
comp[6].c=comp[6].ht((comp[6].limit>>3)
-comp[6].b)>>(7-(comp[6].limit&7))&1;
p[6]=stretch(comp[6].cxt*(comp[6].c*-2+1)&32767);
}
// 7 MIX 16 0 7 24 255
{
comp[7].cxt=z.H(7)+(c8&255);
comp[7].cxt=(comp[7].cxt&(comp[7].c-1))*7;
int* wt=(int*)&comp[7].cm[comp[7].cxt];
p[7]=(wt[0]>>8)*p[0];
p[7]+=(wt[1]>>8)*p[1];
p[7]+=(wt[2]>>8)*p[2];
p[7]+=(wt[3]>>8)*p[3];
p[7]+=(wt[4]>>8)*p[4];
p[7]+=(wt[5]>>8)*p[5];
p[7]+=(wt[6]>>8)*p[6];
p[7]=clamp2k(p[7]>>8);
}
return squash(p[7]);
}
// max.cfg
case 3: {
// 22 components
// 0 CONST 160
// 1 ICM 5
if (c8==1 || (c8&0xf0)==16)
comp[1].c=find(comp[1].ht, 5+2, z.H(1)+16*c8);
comp[1].cxt=comp[1].ht[comp[1].c+(hmap4&15)];
p[1]=stretch(comp[1].cm(comp[1].cxt)>>8);
// 2 ISSE 13 1
{
if (c8==1 || (c8&0xf0)==16)
comp[2].c=find(comp[2].ht, 15, z.H(2)+16*c8);
comp[2].cxt=comp[2].ht[comp[2].c+(hmap4&15)];
int *wt=(int*)&comp[2].cm[comp[2].cxt*2];
p[2]=clamp2k((wt[0]*p[1]+wt[1]*64)>>16);
}
// 3 ISSE 16 2
{
if (c8==1 || (c8&0xf0)==16)
comp[3].c=find(comp[3].ht, 18, z.H(3)+16*c8);
comp[3].cxt=comp[3].ht[comp[3].c+(hmap4&15)];
int *wt=(int*)&comp[3].cm[comp[3].cxt*2];
p[3]=clamp2k((wt[0]*p[2]+wt[1]*64)>>16);
}
// 4 ISSE 18 3
{
if (c8==1 || (c8&0xf0)==16)
comp[4].c=find(comp[4].ht, 20, z.H(4)+16*c8);
comp[4].cxt=comp[4].ht[comp[4].c+(hmap4&15)];
int *wt=(int*)&comp[4].cm[comp[4].cxt*2];
p[4]=clamp2k((wt[0]*p[3]+wt[1]*64)>>16);
}
// 5 ISSE 19 4
{
if (c8==1 || (c8&0xf0)==16)
comp[5].c=find(comp[5].ht, 21, z.H(5)+16*c8);
comp[5].cxt=comp[5].ht[comp[5].c+(hmap4&15)];
int *wt=(int*)&comp[5].cm[comp[5].cxt*2];
p[5]=clamp2k((wt[0]*p[4]+wt[1]*64)>>16);
}
// 6 ISSE 19 5
{
if (c8==1 || (c8&0xf0)==16)
comp[6].c=find(comp[6].ht, 21, z.H(6)+16*c8);
comp[6].cxt=comp[6].ht[comp[6].c+(hmap4&15)];
int *wt=(int*)&comp[6].cm[comp[6].cxt*2];
p[6]=clamp2k((wt[0]*p[5]+wt[1]*64)>>16);
}
// 7 ISSE 20 6
{
if (c8==1 || (c8&0xf0)==16)
comp[7].c=find(comp[7].ht, 22, z.H(7)+16*c8);
comp[7].cxt=comp[7].ht[comp[7].c+(hmap4&15)];
int *wt=(int*)&comp[7].cm[comp[7].cxt*2];
p[7]=clamp2k((wt[0]*p[6]+wt[1]*64)>>16);
}
// 8 MATCH 22 24
if (comp[8].a==0) p[8]=0;
else {
comp[8].c=comp[8].ht((comp[8].limit>>3)
-comp[8].b)>>(7-(comp[8].limit&7))&1;
p[8]=stretch(comp[8].cxt*(comp[8].c*-2+1)&32767);
}
// 9 ICM 17
if (c8==1 || (c8&0xf0)==16)
comp[9].c=find(comp[9].ht, 17+2, z.H(9)+16*c8);
comp[9].cxt=comp[9].ht[comp[9].c+(hmap4&15)];
p[9]=stretch(comp[9].cm(comp[9].cxt)>>8);
// 10 ISSE 19 9
{
if (c8==1 || (c8&0xf0)==16)
comp[10].c=find(comp[10].ht, 21, z.H(10)+16*c8);
comp[10].cxt=comp[10].ht[comp[10].c+(hmap4&15)];
int *wt=(int*)&comp[10].cm[comp[10].cxt*2];
p[10]=clamp2k((wt[0]*p[9]+wt[1]*64)>>16);
}
// 11 ICM 13
if (c8==1 || (c8&0xf0)==16)
comp[11].c=find(comp[11].ht, 13+2, z.H(11)+16*c8);
comp[11].cxt=comp[11].ht[comp[11].c+(hmap4&15)];
p[11]=stretch(comp[11].cm(comp[11].cxt)>>8);
// 12 ICM 13
if (c8==1 || (c8&0xf0)==16)
comp[12].c=find(comp[12].ht, 13+2, z.H(12)+16*c8);
comp[12].cxt=comp[12].ht[comp[12].c+(hmap4&15)];
p[12]=stretch(comp[12].cm(comp[12].cxt)>>8);
// 13 ICM 13
if (c8==1 || (c8&0xf0)==16)
comp[13].c=find(comp[13].ht, 13+2, z.H(13)+16*c8);
comp[13].cxt=comp[13].ht[comp[13].c+(hmap4&15)];
p[13]=stretch(comp[13].cm(comp[13].cxt)>>8);
// 14 ICM 14
if (c8==1 || (c8&0xf0)==16)
comp[14].c=find(comp[14].ht, 14+2, z.H(14)+16*c8);
comp[14].cxt=comp[14].ht[comp[14].c+(hmap4&15)];
p[14]=stretch(comp[14].cm(comp[14].cxt)>>8);
// 15 MIX 16 0 15 24 255
{
comp[15].cxt=z.H(15)+(c8&255);
comp[15].cxt=(comp[15].cxt&(comp[15].c-1))*15;
int* wt=(int*)&comp[15].cm[comp[15].cxt];
p[15]=(wt[0]>>8)*p[0];
p[15]+=(wt[1]>>8)*p[1];
p[15]+=(wt[2]>>8)*p[2];
p[15]+=(wt[3]>>8)*p[3];
p[15]+=(wt[4]>>8)*p[4];
p[15]+=(wt[5]>>8)*p[5];
p[15]+=(wt[6]>>8)*p[6];
p[15]+=(wt[7]>>8)*p[7];
p[15]+=(wt[8]>>8)*p[8];
p[15]+=(wt[9]>>8)*p[9];
p[15]+=(wt[10]>>8)*p[10];
p[15]+=(wt[11]>>8)*p[11];
p[15]+=(wt[12]>>8)*p[12];
p[15]+=(wt[13]>>8)*p[13];
p[15]+=(wt[14]>>8)*p[14];
p[15]=clamp2k(p[15]>>8);
}
// 16 MIX 8 0 16 10 255
{
comp[16].cxt=z.H(16)+(c8&255);
comp[16].cxt=(comp[16].cxt&(comp[16].c-1))*16;
int* wt=(int*)&comp[16].cm[comp[16].cxt];
p[16]=(wt[0]>>8)*p[0];
p[16]+=(wt[1]>>8)*p[1];
p[16]+=(wt[2]>>8)*p[2];
p[16]+=(wt[3]>>8)*p[3];
p[16]+=(wt[4]>>8)*p[4];
p[16]+=(wt[5]>>8)*p[5];
p[16]+=(wt[6]>>8)*p[6];
p[16]+=(wt[7]>>8)*p[7];
p[16]+=(wt[8]>>8)*p[8];
p[16]+=(wt[9]>>8)*p[9];
p[16]+=(wt[10]>>8)*p[10];
p[16]+=(wt[11]>>8)*p[11];
p[16]+=(wt[12]>>8)*p[12];
p[16]+=(wt[13]>>8)*p[13];
p[16]+=(wt[14]>>8)*p[14];
p[16]+=(wt[15]>>8)*p[15];
p[16]=clamp2k(p[16]>>8);
}
// 17 MIX2 0 15 16 24 0
{
comp[17].cxt=((z.H(17)+(c8&0))&(comp[17].c-1));
int w=comp[17].a16[comp[17].cxt];
p[17]=(w*p[15]+(65536-w)*p[16])>>16;
}
// 18 SSE 8 17 32 255
{
comp[18].cxt=(z.H(18)+c8)*32;
int pq=p[17]+992;
if (pq<0) pq=0;
if (pq>1983) pq=1983;
int wt=pq&63;
pq>>=6;
comp[18].cxt+=pq;
p[18]=stretch(((comp[18].cm(comp[18].cxt)>>10)*(64-wt)
+(comp[18].cm(comp[18].cxt+1)>>10)*wt)>>13);
comp[18].cxt+=wt>>5;
}
// 19 MIX2 8 17 18 16 255
{
comp[19].cxt=((z.H(19)+(c8&255))&(comp[19].c-1));
int w=comp[19].a16[comp[19].cxt];
p[19]=(w*p[17]+(65536-w)*p[18])>>16;
}
// 20 SSE 16 19 32 255
{
comp[20].cxt=(z.H(20)+c8)*32;
int pq=p[19]+992;
if (pq<0) pq=0;
if (pq>1983) pq=1983;
int wt=pq&63;
pq>>=6;
comp[20].cxt+=pq;
p[20]=stretch(((comp[20].cm(comp[20].cxt)>>10)*(64-wt)
+(comp[20].cm(comp[20].cxt+1)>>10)*wt)>>13);
comp[20].cxt+=wt>>5;
}
// 21 MIX2 0 19 20 16 0
{
comp[21].cxt=((z.H(21)+(c8&0))&(comp[21].c-1));
int w=comp[21].a16[comp[21].cxt];
p[21]=(w*p[19]+(65536-w)*p[20])>>16;
}
return squash(p[21]);
}
// Not optimized
default: return predict0();
}
}
void Predictor::update(int y) {
switch(z.select) {
// fast.cfg
case 1: {
// 2 components
// 0 ICM 16
{
comp[0].ht[comp[0].c+(hmap4&15)]=
st.next(comp[0].ht[comp[0].c+(hmap4&15)], y);
U32& pn=comp[0].cm(comp[0].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 1 ISSE 19 0
{
int err=y*32767-squash(p[1]);
int *wt=(int*)&comp[1].cm[comp[1].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[0]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[1].ht[comp[1].c+(hmap4&15)]=st.next(comp[1].cxt, y);
}
break;
}
// mid.cfg
case 2: {
// 8 components
// 0 ICM 5
{
comp[0].ht[comp[0].c+(hmap4&15)]=
st.next(comp[0].ht[comp[0].c+(hmap4&15)], y);
U32& pn=comp[0].cm(comp[0].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 1 ISSE 13 0
{
int err=y*32767-squash(p[1]);
int *wt=(int*)&comp[1].cm[comp[1].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[0]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[1].ht[comp[1].c+(hmap4&15)]=st.next(comp[1].cxt, y);
}
// 2 ISSE 17 1
{
int err=y*32767-squash(p[2]);
int *wt=(int*)&comp[2].cm[comp[2].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[1]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[2].ht[comp[2].c+(hmap4&15)]=st.next(comp[2].cxt, y);
}
// 3 ISSE 18 2
{
int err=y*32767-squash(p[3]);
int *wt=(int*)&comp[3].cm[comp[3].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[2]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[3].ht[comp[3].c+(hmap4&15)]=st.next(comp[3].cxt, y);
}
// 4 ISSE 18 3
{
int err=y*32767-squash(p[4]);
int *wt=(int*)&comp[4].cm[comp[4].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[3]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[4].ht[comp[4].c+(hmap4&15)]=st.next(comp[4].cxt, y);
}
// 5 ISSE 19 4
{
int err=y*32767-squash(p[5]);
int *wt=(int*)&comp[5].cm[comp[5].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[4]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[5].ht[comp[5].c+(hmap4&15)]=st.next(comp[5].cxt, y);
}
// 6 MATCH 22 24
{
if (comp[6].c!=y) comp[6].a=0;
comp[6].ht(comp[6].limit>>3)+=comp[6].ht(comp[6].limit>>3)+y;
if ((++comp[6].limit&7)==0) {
int pos=comp[6].limit>>3;
if (comp[6].a==0) {
comp[6].b=pos-comp[6].cm(z.H(6));
if (comp[6].b&(comp[6].ht.size()-1))
while (comp[6].a<255 && comp[6].ht(pos-comp[6].a-1)
==comp[6].ht(pos-comp[6].a-comp[6].b-1))
++comp[6].a;
}
else comp[6].a+=comp[6].a<255;
comp[6].cm(z.H(6))=pos;
if (comp[6].a>0) comp[6].cxt=2048/comp[6].a;
}
}
// 7 MIX 16 0 7 24 255
{
int err=(y*32767-squash(p[7]))*24>>4;
int* wt=(int*)&comp[7].cm[comp[7].cxt];
wt[0]=clamp512k(wt[0]+((err*p[0]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err*p[1]+(1<<12))>>13));
wt[2]=clamp512k(wt[2]+((err*p[2]+(1<<12))>>13));
wt[3]=clamp512k(wt[3]+((err*p[3]+(1<<12))>>13));
wt[4]=clamp512k(wt[4]+((err*p[4]+(1<<12))>>13));
wt[5]=clamp512k(wt[5]+((err*p[5]+(1<<12))>>13));
wt[6]=clamp512k(wt[6]+((err*p[6]+(1<<12))>>13));
}
break;
}
// max.cfg
case 3: {
// 22 components
// 0 CONST 160
// 1 ICM 5
{
comp[1].ht[comp[1].c+(hmap4&15)]=
st.next(comp[1].ht[comp[1].c+(hmap4&15)], y);
U32& pn=comp[1].cm(comp[1].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 2 ISSE 13 1
{
int err=y*32767-squash(p[2]);
int *wt=(int*)&comp[2].cm[comp[2].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[1]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[2].ht[comp[2].c+(hmap4&15)]=st.next(comp[2].cxt, y);
}
// 3 ISSE 16 2
{
int err=y*32767-squash(p[3]);
int *wt=(int*)&comp[3].cm[comp[3].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[2]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[3].ht[comp[3].c+(hmap4&15)]=st.next(comp[3].cxt, y);
}
// 4 ISSE 18 3
{
int err=y*32767-squash(p[4]);
int *wt=(int*)&comp[4].cm[comp[4].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[3]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[4].ht[comp[4].c+(hmap4&15)]=st.next(comp[4].cxt, y);
}
// 5 ISSE 19 4
{
int err=y*32767-squash(p[5]);
int *wt=(int*)&comp[5].cm[comp[5].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[4]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[5].ht[comp[5].c+(hmap4&15)]=st.next(comp[5].cxt, y);
}
// 6 ISSE 19 5
{
int err=y*32767-squash(p[6]);
int *wt=(int*)&comp[6].cm[comp[6].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[5]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[6].ht[comp[6].c+(hmap4&15)]=st.next(comp[6].cxt, y);
}
// 7 ISSE 20 6
{
int err=y*32767-squash(p[7]);
int *wt=(int*)&comp[7].cm[comp[7].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[6]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[7].ht[comp[7].c+(hmap4&15)]=st.next(comp[7].cxt, y);
}
// 8 MATCH 22 24
{
if (comp[8].c!=y) comp[8].a=0;
comp[8].ht(comp[8].limit>>3)+=comp[8].ht(comp[8].limit>>3)+y;
if ((++comp[8].limit&7)==0) {
int pos=comp[8].limit>>3;
if (comp[8].a==0) {
comp[8].b=pos-comp[8].cm(z.H(8));
if (comp[8].b&(comp[8].ht.size()-1))
while (comp[8].a<255 && comp[8].ht(pos-comp[8].a-1)
==comp[8].ht(pos-comp[8].a-comp[8].b-1))
++comp[8].a;
}
else comp[8].a+=comp[8].a<255;
comp[8].cm(z.H(8))=pos;
if (comp[8].a>0) comp[8].cxt=2048/comp[8].a;
}
}
// 9 ICM 17
{
comp[9].ht[comp[9].c+(hmap4&15)]=
st.next(comp[9].ht[comp[9].c+(hmap4&15)], y);
U32& pn=comp[9].cm(comp[9].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 10 ISSE 19 9
{
int err=y*32767-squash(p[10]);
int *wt=(int*)&comp[10].cm[comp[10].cxt*2];
wt[0]=clamp512k(wt[0]+((err*p[9]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err+16)>>5));
comp[10].ht[comp[10].c+(hmap4&15)]=st.next(comp[10].cxt, y);
}
// 11 ICM 13
{
comp[11].ht[comp[11].c+(hmap4&15)]=
st.next(comp[11].ht[comp[11].c+(hmap4&15)], y);
U32& pn=comp[11].cm(comp[11].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 12 ICM 13
{
comp[12].ht[comp[12].c+(hmap4&15)]=
st.next(comp[12].ht[comp[12].c+(hmap4&15)], y);
U32& pn=comp[12].cm(comp[12].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 13 ICM 13
{
comp[13].ht[comp[13].c+(hmap4&15)]=
st.next(comp[13].ht[comp[13].c+(hmap4&15)], y);
U32& pn=comp[13].cm(comp[13].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 14 ICM 14
{
comp[14].ht[comp[14].c+(hmap4&15)]=
st.next(comp[14].ht[comp[14].c+(hmap4&15)], y);
U32& pn=comp[14].cm(comp[14].cxt);
pn+=int(y*32767-(pn>>8))>>2;
}
// 15 MIX 16 0 15 24 255
{
int err=(y*32767-squash(p[15]))*24>>4;
int* wt=(int*)&comp[15].cm[comp[15].cxt];
wt[0]=clamp512k(wt[0]+((err*p[0]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err*p[1]+(1<<12))>>13));
wt[2]=clamp512k(wt[2]+((err*p[2]+(1<<12))>>13));
wt[3]=clamp512k(wt[3]+((err*p[3]+(1<<12))>>13));
wt[4]=clamp512k(wt[4]+((err*p[4]+(1<<12))>>13));
wt[5]=clamp512k(wt[5]+((err*p[5]+(1<<12))>>13));
wt[6]=clamp512k(wt[6]+((err*p[6]+(1<<12))>>13));
wt[7]=clamp512k(wt[7]+((err*p[7]+(1<<12))>>13));
wt[8]=clamp512k(wt[8]+((err*p[8]+(1<<12))>>13));
wt[9]=clamp512k(wt[9]+((err*p[9]+(1<<12))>>13));
wt[10]=clamp512k(wt[10]+((err*p[10]+(1<<12))>>13));
wt[11]=clamp512k(wt[11]+((err*p[11]+(1<<12))>>13));
wt[12]=clamp512k(wt[12]+((err*p[12]+(1<<12))>>13));
wt[13]=clamp512k(wt[13]+((err*p[13]+(1<<12))>>13));
wt[14]=clamp512k(wt[14]+((err*p[14]+(1<<12))>>13));
}
// 16 MIX 8 0 16 10 255
{
int err=(y*32767-squash(p[16]))*10>>4;
int* wt=(int*)&comp[16].cm[comp[16].cxt];
wt[0]=clamp512k(wt[0]+((err*p[0]+(1<<12))>>13));
wt[1]=clamp512k(wt[1]+((err*p[1]+(1<<12))>>13));
wt[2]=clamp512k(wt[2]+((err*p[2]+(1<<12))>>13));
wt[3]=clamp512k(wt[3]+((err*p[3]+(1<<12))>>13));
wt[4]=clamp512k(wt[4]+((err*p[4]+(1<<12))>>13));
wt[5]=clamp512k(wt[5]+((err*p[5]+(1<<12))>>13));
wt[6]=clamp512k(wt[6]+((err*p[6]+(1<<12))>>13));
wt[7]=clamp512k(wt[7]+((err*p[7]+(1<<12))>>13));
wt[8]=clamp512k(wt[8]+((err*p[8]+(1<<12))>>13));
wt[9]=clamp512k(wt[9]+((err*p[9]+(1<<12))>>13));
wt[10]=clamp512k(wt[10]+((err*p[10]+(1<<12))>>13));
wt[11]=clamp512k(wt[11]+((err*p[11]+(1<<12))>>13));
wt[12]=clamp512k(wt[12]+((err*p[12]+(1<<12))>>13));
wt[13]=clamp512k(wt[13]+((err*p[13]+(1<<12))>>13));
wt[14]=clamp512k(wt[14]+((err*p[14]+(1<<12))>>13));
wt[15]=clamp512k(wt[15]+((err*p[15]+(1<<12))>>13));
}
// 17 MIX2 0 15 16 24 0
{
int err=(y*32767-squash(p[17]))*24>>5;
int w=comp[17].a16[comp[17].cxt];
w+=(err*(p[15]-p[16])+(1<<12))>>13;
if (w<0) w=0;
if (w>65535) w=65535;
comp[17].a16[comp[17].cxt]=w;
}
// 18 SSE 8 17 32 255
train(comp[18], y);
// 19 MIX2 8 17 18 16 255
{
int err=(y*32767-squash(p[19]))*16>>5;
int w=comp[19].a16[comp[19].cxt];
w+=(err*(p[17]-p[18])+(1<<12))>>13;
if (w<0) w=0;
if (w>65535) w=65535;
comp[19].a16[comp[19].cxt]=w;
}
// 20 SSE 16 19 32 255
train(comp[20], y);
// 21 MIX2 0 19 20 16 0
{
int err=(y*32767-squash(p[21]))*16>>5;
int w=comp[21].a16[comp[21].cxt];
w+=(err*(p[19]-p[20])+(1<<12))>>13;
if (w<0) w=0;
if (w>65535) w=65535;
comp[21].a16[comp[21].cxt]=w;
}
break;
}
// Not optimized
default: return update0(y);
}
c8+=c8+y;
if (c8>=256) {
z.run(c8-256);
hmap4=1;
c8=1;
}
else if (c8>=16 && c8<32)
hmap4=(hmap4&0xf)<<5|y<<4|1;
else
hmap4=(hmap4&0x1f0)|(((hmap4&0xf)*2+y)&0xf);
}
void ZPAQL::run(U32 input) {
switch(select) {
// fast.cfg
case 1: {
a = input;
m(b) = a;
a = 0;
d = 0;
a = (a+m(b)+512)*773;
--b;
a = (a+m(b)+512)*773;
h(d) = a;
++d;
--b;
a = (a+m(b)+512)*773;
--b;
a = (a+m(b)+512)*773;
h(d) = a;
return;
break;
}
// mid.cfg
case 2: {
a = input;
++c;
m(c) = a;
b = c;
a = 0;
d = 1;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
--b;
a = (a+m(b)+512)*773;
h(d) = a;
++d;
a = m(c);
a <<= (8&31);
h(d) = a;
return;
break;
}
// max.cfg
case 3: {
a = input;
++c;
m(c) = a;
b = c;
a = 0;
d = 2;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
--b;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = (a+m(b)+512)*773;
h(d) = a;
--b;
++d;
a = m(c);
a &= ~ 32;
f = (a > U32(64));
if (!f) goto L300057;
f = (a < U32(91));
if (!f) goto L300057;
++d;
h(d) = (h(d)+a+512)*773;
--d;
swap(h(d));
a += h(d);
a *= 20;
h(d) = a;
goto L300066;
L300057:
a = h(d);
f = (a == U32(0));
if (f) goto L300065;
++d;
h(d) = a;
--d;
L300065:
h(d) = 0;
L300066:
++d;
++d;
b = c;
--b;
a = 0;
a = (a+m(b)+512)*773;
h(d) = a;
++d;
--b;
a = 0;
a = (a+m(b)+512)*773;
h(d) = a;
++d;
--b;
a = 0;
a = (a+m(b)+512)*773;
h(d) = a;
++d;
a = b;
a -= 212;
b = a;
a = 0;
a = (a+m(b)+512)*773;
h(d) = a;
swap(b);
a -= 216;
swap(b);
a = m(b);
a &= 60;
h(d) = (h(d)+a+512)*773;
++d;
a = m(c);
a <<= (9&31);
h(d) = a;
++d;
++d;
++d;
++d;
++d;
h(d) = a;
return;
break;
}
// Not optimized
default: run0(input);
}
}
////////////////////////////// Decoder ////////////////////////////
// Decoder decompresses using an arithmetic code
class Decoder {
FILE* in; // destination
U32 low, high; // range
U32 curr; // last 4 bytes of archive
Predictor pr; // to get p
int decode(int p); // return decoded bit (0..1) with probability p (0..8191)
public:
Decoder(FILE* f, ZPAQL& z);
int decompress(); // return a byte or EOF
int skip(); // skip to the end of the segment, return next byte
};
Decoder::Decoder(FILE* f, ZPAQL& z):
in(f), low(1), high(0xFFFFFFFF), curr(0), pr(z) {}
inline int Decoder::decode(int p) {
assert(p>=0 && p<65536);
assert(high>low && low>0);
if (curr<low || curr>high) error("archive corrupted");
assert(curr>=low && curr<=high);
U32 mid=low+((high-low)>>16)*p+((((high-low)&0xffff)*p)>>16); // split range
assert(high>mid && mid>=low);
int y=curr<=mid;
if (y) high=mid; else low=mid+1; // pick half
while ((high^low)<0x1000000) { // shift out identical leading bytes
high=high<<8|255;
low=low<<8;
low+=(low==0);
int c=getc(in);
if (c==EOF) error("unexpected end of file");
curr=curr<<8|c;
}
return y;
}
int Decoder::decompress() {
if (curr==0) { // finish initialization
for (int i=0; i<4; ++i)
curr=curr<<8|getc(in);
}
if (decode(0)) {
if (curr!=0) error("decoding end of stream");
return EOF;
}
else {
int c=1;
while (c<256) { // get 8 bits
int p=pr.predict()*2+1;
c+=c+decode(p);
pr.update(c&1);
}
return c-256;
}
}
// Find end of compressed data and return next byte
int Decoder::skip() {
int c=0;
while (curr==0) // at start?
curr=getc(in);
while (curr && (c=getc(in))!=EOF) // find 4 zeros
curr=curr<<8|c;
while ((c=getc(in))==0) ; // might be more than 4
return c;
}
/////////////////////////// PostProcessor ////////////////////
class PostProcessor {
int state; // input parse state
int hsize; // header size
int ph, pm; // sizes of H and M in z
public:
ZPAQL z; // holds PCOMP
PostProcessor(ZPAQL& hz);
void set(FILE* out, SHA1* p) {z.output=out; z.sha1=p;} // Set output
int write(int c); // Input a byte, return state
};
// Copy ph, pm from block header
PostProcessor::PostProcessor(ZPAQL& hz) {
state=hsize=0;
ph=hz.header[4];
pm=hz.header[5];
}
// (PASS=0 | PROG=1 psize[0..1] pcomp[0..psize-1]) data... EOB=-1
// Return state: 1=PASS, 2..4=loading PROG, 5=PROG loaded
int PostProcessor::write(int c) {
assert(c>=-1 && c<=255);
switch (state) {
case 0: // initial state
if (c<0) error("Unexpected EOS");
state=c+1; // 1=PASS, 2=PROG
if (state>2) error("unknown post processing type");
break;
case 1: // PASS
if (z.output && c>=0) putc(c, z.output); // data
if (z.sha1 && c>=0) z.sha1->put(c);
break;
case 2: // PROG
if (c<0) error("Unexpected EOS");
hsize=c; // low byte of size
state=3;
break;
case 3: // PROG psize[0]
if (c<0) error("Unexpected EOS");
hsize+=c*256; // high byte of psize
z.header.resize(hsize+300);
z.cend=8;
z.hbegin=z.hend=z.cend+128;
z.header[4]=ph;
z.header[5]=pm;
state=4;
break;
case 4: // PROG psize[0..1] pcomp[0...]
if (c<0) error("Unexpected EOS");
assert(z.hend<z.header.size());
z.header[z.hend++]=c; // one byte of pcomp
if (z.hend-z.hbegin==hsize) { // last byte of pcomp?
hsize=z.cend-2+z.hend-z.hbegin;
z.header[0]=hsize&255; // header size with empty COMP
z.header[1]=hsize>>8;
z.initp();
z.selectModel(0);
state=5;
}
break;
case 5: // PROG ... data
z.run(c);
break;
}
return state;
}
/////////////////////////// Decompress ///////////////////////
// Open archive. Append .zpaq to file name if missing.
// filename and mode are as in fopen(). Error if cannot open.
FILE *open_archive(const char *filename, const char *mode) {
assert(filename);
assert(mode);
int len=strlen(filename);
Array<char> newname(len+6);
append(newname, filename);
if (len<5 || strcmp(filename+len-5, ".zpaq"))
append(newname, ".zpaq");
FILE *f=fopen(&newname[0], mode);
if (!f) perror(&newname[0]), error("cannot open archive");
switch(mode[0]) {
case 'r': printf("Reading from archive %s\n", &newname[0]); break;
case 'w': printf("Created archive %s\n", &newname[0]); break;
case 'a': printf("Appending to archive %s\n", &newname[0]); break;
}
return f;
}
// Reject archive filenames with absolute paths, drive letters
// or control characters or that are too long.
static bool validate_filename(const char* filename) {
int len=strlen(filename);
if (len<1) return true; // No name is OK
if (len>511) return false; // name too long
if (strstr(filename, "../")) return false; // no backward paths
if (strstr(filename, "..\\")) return false;
if (filename[0]=='/' || filename[0]=='\\') return false; // no absolute path
for (int i=0; i<len; ++i) // no control chars or drive letters
if ((filename[i]&255)<32 || (i==1 && filename[i]==':')) return false;
return true;
}
// Advance 'in' past "zPQ" at its current location. If something
// else is there, search for the following 16 byte string
// which ends with "zPQ":
// 37 6B 53 74 A0 31 83 D3 8C B2 28 B0 D3 7A 50 51 (hex)
// Return true if found, false at EOF.
static bool find_start(FILE *in) {
U32 h1=0x3D49B113, h2=0x29EB7F93, h3=0x2614BE13, h4=0x3828EB13;
// Rolling hashes initialized to hash of first 13 bytes
int c;
while ((c=getc(in))!=EOF) {
h1=h1*12+c;
h2=h2*20+c;
h3=h3*28+c;
h4=h4*44+c;
if (h1==0xB16B88F1 && h2==0xFF5376F1 && h3==0x72AC5BF1 && h4==0x2F909AF1)
return true; // hash of 16 byte string
}
return false;
}
// Advance in to start of next block. Return number of segments skipped.
static int skip_block(FILE *in) {
assert(in);
int segments=0;
// Find start of next block
int c;
if (!find_start(in)) return 0; // EOF
if ((c=getc(in))>LEVEL || c<1 || getc(in)!=1)
error("not ZPAQ");
// Skip block header
int hsize=getc(in);
hsize+=getc(in)*256;
if (hsize<6 || hsize>65535) error("hsize missing");
while (hsize-->0) getc(in);
// Skip segments
while ((c=getc(in))==1) {
++segments;
while (getc(in)>0) ; // skip filename
while (getc(in)>0) ; // skip comment
if (getc(in)!=0) error("reserved 0 missing");
// Skip to end of data
U32 c4=0xFFFFFFFF; // last 4 bytes will be all 0
while ((c=getc(in))!=EOF && (c4=c4<<8|c)!=0) ;
if (c==EOF) error("unexpected end of file");
while ((c=getc(in))==0) ;
if (c==253) { // Skip SHA1
for (int i=0; i<20; ++i)
getc(in);
}
else if (c!=254) error("missing end of segment marker");
}
if (c!=255) error("missing end of block marker");
return segments;
}
// Remove path from filename
static char* strip(char* filename) {
assert(filename);
int len=strlen(filename);
char *result=filename;
for (int i=0; i<len; ++i) {
if (filename[i]=='/' || filename[i]=='\\' || (i==1 && filename[i]==':'))
result=filename+i+1;
}
return result;
}
// Open filename. Depending on OS, change slashes to / or \.
// If this fails then try creating directories in its path.
// If it fails again, return 0, else return FILE*.
static FILE* create(char* filename) {
assert(filename);
// Find last slash in filename
int slash=-1;
for (int i=0; filename[i]; ++i)
if (filename[i]=='/' || filename[i]=='\\')
slash=i;
// If there is no path, then open file and return
if (slash<0)
return fopen(filename, "wb");
// Guess the OS by counting / (Linux) or \ (Windows) in PATH
const char* path=getenv("PATH");
static int os=0; // <0 if Windows, >0 if Linux, 0 if unknown
if (os==0) {
for (int i=0; path && path[i]; ++i) {
if (path[i]=='/') ++os;
if (path[i]=='\\') --os;
}
}
// Change slashes in filename per OS if known.
for (int i=0; filename[i]; ++i) {
if (os>0 && filename[i]=='\\') filename[i]='/';
if (os<0 && filename[i]=='/') filename[i]='\\';
}
// Try opening file
FILE *f=fopen(filename, "wb");
if (f) return f;
// If this doesn't work, try creating a directory for it using "mkdir"
if (os && errno==ENOENT) {
Array<char> cmd(slash+16);
strcpy(&cmd[0], os<=0 ? "mkdir " : "mkdir -p ");
strncat(&cmd[0], filename, slash);
printf("%s\n", &cmd[0]);
system(&cmd[0]);
// Last try
return fopen(filename, "wb");
}
return 0;
}
// Decompress: eN|xN archive [files...]
static void decompress(int argc, char** argv) {
assert(argc>=3);
// Open archive
FILE* in=open_archive(argv[2], "rb");
// If user specifies N then skip N-1 blocks
int block=atoi(argv[1]+1);
if (block>0) {
for (; block>1; --block)
skip_block(in);
}
// Read the archive
int filecount=0; // number of files extracted
FILE *out=0; // output file
int c;
while (find_start(in)) {
if (getc(in)!=LEVEL || getc(in)!=1)
error("Not ZPAQ");
// Read block header
ZPAQL z;
z.read(Reader(in));
// PostProcessor and Decoder is created and and destroyed for each block
PostProcessor pp(z);
Decoder dec(in, z);
// Read segments
bool first=true; // first segment of block?
while ((c=getc(in))==1) {
// Read the filename
char filename[512]={0};
int i;
for (i=0; (c=getc(in))>0; ++i)
if (i<511) filename[i]=c;
if (i>0 && i<512) filename[i]=0;
printf("%s ", filename);
// Get comment
char comment[20]={0};
i=0;
while ((c=getc(in))!=EOF && c!=0) {
if (i<19) comment[i]=c;
++i;
}
printf("%s -> ", comment);
if (getc(in)) error("reserved"); // reserved 0
// open output file
// if filename is empty, use the previously opened file
if (filename[0] || !out) {
// close last file
if (out) {
fclose(out);
out=0;
++filecount;
}
// if the user gave an output file starting at argv[3], use it instead.
if (argc>3) {
if (filecount+3>=argc) {
printf("and remaining files not extracted\n");
goto end;
}
char* name=argv[filecount+3];
out=create(name);
if (!out) {
perror(name);
goto end;
}
else
printf("%s ", name);
}
// Otherwise, use the names in the archive, but don't clobber
// or use suspicious filenames
else {
char* newname=filename;
if (argv[1][0]=='e') newname=strip(filename);
if (newname!=filename)
printf("%s -> ", newname);
if (!validate_filename(newname)) {
printf("Error: bad filename\n");
goto end;
}
out=fopen(newname, "rb");
if (out) {
fclose(out);
out=0;
printf("Error: won't overwrite\n");
goto end;
}
else {
out=create(newname);
if (!out) {
perror(newname);
goto end;
}
}
}
}
// Decompress
SHA1 sha1;
pp.set(out, &sha1);
// Extract the current segment
{
time_t now=time(0);
int len=0;
while ((c=dec.decompress())!=EOF) {
if (pp.write(c)==5 && first) {
first=false;
}
if (!(len++&0xfff) && time(0)!=now) {
for (int i=printf("%1.0f ", sha1.size()); i>0; --i)
putchar('\b');
fflush(stdout);
now=time(0);
}
}
pp.write(-1);
}
// Check for end of segment and block markers
int eos=c;
eos=getc(in); // 253=SHA1 follows, 254=EOS
if (eos==253) {
U8 hash[20];
bool match=true;
for (int i=0; i<20; ++i) {
hash[i]=getc(in);
if (hash[i]!=sha1.result(i))
match=false;
}
if (1) {
if (match) {
printf("Checksum OK ");
}
else {
fprintf(stderr,
"CHECKSUM FAILED: FILE IS NOT IDENTICAL\n Archive SHA1: ");
for (int i=0; i<20; ++i)
fprintf(stderr, "%02x", hash[i]);
fprintf(stderr, "\n File SHA1: ");
for (int i=0; i<20; ++i)
fprintf(stderr, "%02x", sha1.result(i));
fprintf(stderr, "\n");
}
}
}
else if (eos!=254)
error("missing end of segment marker");
else
printf("OK, no checksum ");
printf("\n");
}
if (c!=255) error("missing end of block marker");
if (block) break;
}
// Close files
end:
if (out) fclose(out), ++filecount;
fclose(in);
printf("%d file(s) extracted\n", filecount);
}
//////////////////////////// Encoder ///////////////////////////////
// Encoder compresses using an arithmetic code
class Encoder {
FILE* out; // destination
U32 low, high; // range
Predictor pr; // to get p
void encode(int y, int p); // encode bit y (0..1) with probability p (0..8191)
U32 in_low, in_high; // number of input, output bytes (64 bits)
U32 out_low, out_high;
public:
Encoder(FILE* f, ZPAQL& z);
void compress(int c); // c is 0..255 or EOF
// void stat() {pr.stat();} // print predictor statistics
void setOutput(FILE* f) {out=f;}
double in_size() const {return in_low+4294967296.0*in_high;}
double out_size() const {return out_low+4294967296.0*out_high;}
void reset() {in_low=in_high=out_low=out_high=0;} // clear sizes
};
// Compress to file f using model z
Encoder::Encoder(FILE* f, ZPAQL& z):
out(f), low(1), high(0xFFFFFFFF), pr(z) {
reset();
}
// compress bit y having probability p/64K
inline void Encoder::encode(int y, int p) {
assert(out);
assert(p>=0 && p<65536);
assert(y==0 || y==1);
assert(high>low && low>0);
U32 mid=low+((high-low)>>16)*p+((((high-low)&0xffff)*p)>>16); // split range
assert(high>mid && mid>=low);
if (y) high=mid; else low=mid+1; // pick half
while ((high^low)<0x1000000) { // write identical leading bytes
putc(high>>24, out); // same as low>>24
high=high<<8|255;
low=low<<8;
low+=(low==0); // so we don't code 4 0 bytes in a row
out_high+=(++out_low==0);
}
}
// compress byte c (0..255 or -1=EOS)
void Encoder::compress(int c) {
assert(out);
if (c==-1)
encode(1, 0);
else {
assert(c>=0 && c<=255);
in_high+=(++in_low==0);
encode(0, 0);
for (int i=7; i>=0; --i) {
int p=pr.predict()*2+1;
assert(p>0 && p<65536);
int y=c>>i&1;
encode(y, p);
pr.update(y);
}
}
}
//////////////////////////// Compress ////////////////////////////
// Test for regular file (Linux)
static bool is_file(const char* filename) {
#ifdef unix
struct stat st;
return stat(filename, &st)==0 && (st.st_mode & S_IFREG);
#endif
return true;
}
// Compress files: c|a archive files...
static void compress(int argc, char** argv) {
assert(argc>=3);
ZPAQL z, pz; // compression and postprocessing models
// Select compression option
int sel=atoi(argv[1]+1);
if (sel<1) sel=2;
z.selectModel(sel);
// Compress files in argv[3...argc-1]
FILE *out=0; // archive opened when ready to compress first file
Encoder enc(out, z); // compressor
double outsum=0; // total output size
for (int i=3; i<argc; ++i) {
// Ignore directories
if (!is_file(argv[i])) {
fprintf(stderr, "%s: not a regular file\n", argv[i]);
continue;
}
// Open input file
FILE *in=fopen(argv[i], "rb");
if (!in) {
perror(argv[i]);
continue;
}
// Get checksum and file size
SHA1 check1;
int c;
while ((c=getc(in))!=EOF) check1.put(c);
double insize=check1.size(); // input size of file
double presize=insize; // preprocessed size
double outsize=(outsum==0); // output size including header, EOB
rewind(in);
// Open archive for first file
bool first=false; // first file?
if (!out) {
// Create or append archive
out=open_archive(argv[2], argv[1][0]=='a'?"ab":"wb");
// Write block header
enc.setOutput(out);
outsize+=fprintf(out, "%cPQ%c%c", 'z', LEVEL, 1);
outsize+=z.write(out);
first=true;
}
// Code segment header
putc(1, out); // start of segment
outsize+=fprintf(out, "%s", argv[i]); // filename
putc(0, out); // filename terminator
outsize+=fprintf(out, "%1.0f", insize); // size as comment
putc(0, out); // comment terminator
putc(0, out); // reserved
outsize+=4;
enc.reset(); // size=0
// Compress PCOMP or POST 0
if (first) {
const int psize=pz.hend-pz.hbegin;
assert(psize>=0 && psize<0x10000);
assert(pz.header.size()>=pz.hend);
if (psize==0)
enc.compress(0); // PASS
else {
enc.compress(1); // POST
enc.compress(psize&255); // size low byte
enc.compress(psize>>8&255); // size high byte
for (int j=0; j<psize; ++j) // PCOMP code
enc.compress(pz.header[pz.hbegin+j]);
}
}
// Compress
if (!validate_filename(argv[i]))
printf("Warning: file name not valid for extraction: %s\n",
argv[i]);
printf("%s %1.0f ", argv[i], insize);
if (insize!=presize)
printf("-> %1.0f ", presize);
int len=0;
time_t now=time(0);
while ((c=getc(in))!=EOF) {
enc.compress(c);
if (!(len++&0xfff) && now!=time(0)) {
for (int j=printf("%1.0f -> %1.0f ",
enc.in_size(), outsize+enc.out_size()); j>0; --j)
putchar('\b');
fflush(stdout);
now=time(0);
}
}
enc.compress(-1);
// Write segment trailer
outsize+=20+fprintf(out, "%c%c%c%c%c", 0, 0, 0, 0, 253);
for (int j=0; j<20; ++j)
putc(check1.result(j), out);
fclose(in);
in=0;
printf("-> %1.0f \n", outsize+enc.out_size());
outsum+=outsize+enc.out_size();
}
// Code end of block and close archive
if (out) {
putc(255, out); // block trailer
printf("-> %1.0f\n", outsum);
fclose(out);
}
else
printf("Archive %s not updated\n", argv[2]);
}
////////////////////////// list //////////////////////////
// List archive contents: l archive
static void list(int argc, char** argv) {
assert(argc>2 && argv[2]);
// Open archive
FILE* in=open_archive(argv[2], "rb");
// Read the file
int c, blocks=0;
while (find_start(in)) {
// Read block header
if (getc(in)!=LEVEL || getc(in)!=1)
error("not ZPAQ");
ZPAQL z;
double size=6+z.read(in); // compressed size
printf("Block %d: compressed with option %d, requires %1.3f MB memory\n",
++blocks, z.select, z.memory()/1000000);
// Read segments
while ((c=getc(in))==1) {
// Print filename and comments
printf(" ");
while ((c=getc(in))!=EOF && c) putchar(c), size+=1;
printf(" ");
while ((c=getc(in))!=EOF && c) putchar(c), size+=1;
if (getc(in)!=0) error("reserved data");
size+=6;
// Skip to end of data
U32 c4=0xFFFFFFFF; // last 4 bytes will be all 0
while ((c=getc(in))!=EOF && (c4=c4<<8|c)!=0)
size+=1;
if (c==EOF) error("unexpected end of file");
while ((c=getc(in))==0)
size+=1;
if (c==253) { // print SHA1
printf(" SHA1=");
size+=20;
for (int i=0; i<20; ++i) {
int c=getc(in);
if (i<4) printf("%02x", c);
}
printf("...");
}
else if (c!=254) error("missing end of segment marker");
printf(" -> %1.0f\n", size);
size=0;
}
if (c!=255) error("missing end of block marker");
}
}
///////////////////////////// Main ///////////////////////////
// Print help message and exit
static void usage() {
printf("ZP v1.00 archiver, (C) 2010, Ocarina Networks Inc.\n"
"Written by Matt Mahoney, " __DATE__ ".\n"
"Licensed under GPL v3, http://www.gnu.org/copyleft/gpl.html\n"
"\n"
"Usage: zp command archive.zpaq [files...]\n"
"Commands:\n"
" l List archive contents\n"
" x Extract with full path names (files... overrides stored names)\n"
" e Extract to current directory\n"
" xN, eN Extract only block N (1, 2, 3...)\n"
" c Create new archive\n"
" a Append to archive\n"
" cN, aN Compress with option N\n"
"Compression options:\n"
" 1,2,3 Fast, medium, small (default is 2)\n"
);
exit(0);
}
// Command syntax as in usage()
int main(int argc, char** argv) {
// Check usage
if (argc<2)
usage();
// Do the command
char cmd=argv[1][0];
if (argc>=4 && (cmd=='a' || cmd=='c'))
compress(argc, argv);
else if (argc>=3 && (cmd=='x' || cmd=='e'))
decompress(argc, argv);
else if (argc>=3 && cmd=='l')
list(argc, argv);
else
usage();
// Print time used
printf("Elapsed time %1.2f seconds.\n",
double(clock())/CLOCKS_PER_SEC);
return 0;
}
|