1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576
|
/*===========================================================================*
* *
* sflhead.h - SFL header file *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: This header file is GENERATED by the Boom installer. DO NOT
MODIFY THIS FILE. If you change prelude.h, or any of the
other SFL header files, re-run boomake to recreate this file.
------------------------------------------------------------------</Prolog>-*/
/*===========================================================================*
* *
* prelude.h - Portability abstraction header file *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: This header file encapsulates many generally-useful include
files and defines lots of good stuff. The intention of this
header file is to hide the messy #ifdef's that you typically
need to make real programs compile & run. To use, specify
as the first include file in your program.
------------------------------------------------------------------</Prolog>-*/
#ifndef PRELUDE_INCLUDED /* Allow multiple inclusions */
#define PRELUDE_INCLUDED
/*- Establish the compiler and computer system ------------------------------*/
/*
* Defines zero or more of these symbols, for use in any non-portable
* code:
*
* __WINDOWS__ Microsoft C/C++ with Windows calls
* __MSDOS__ System is MS-DOS (set if __WINDOWS__ set)
* __VMS__ System is VAX/VMS or Alpha/OpenVMS
* __UNIX__ System is UNIX
* __OS2__ System is OS/2
*
* __IS_32BIT__ OS/compiler is 32 bits
* __IS_64BIT__ OS/compiler is 64 bits
*
* When __UNIX__ is defined, we also define exactly one of these:
*
* __UTYPE_AUX Apple AUX
* __UTYPE_BEOS BeOS
* __UTYPE_BSDOS BSD/OS
* __UTYPE_DECALPHA Digital UNIX (Alpha)
* __UTYPE_IBMAIX IBM RS/6000 AIX
* __UTYPE_FREEBSD FreeBSD
* __UTYPE_HPUX HP/UX
* __UTYPE_LINUX Linux
* __UTYPE_MIPS MIPS (BSD 4.3/System V mixture)
* __UTYPE_NETBSD NetBSD
* __UTYPE_NEXT NeXT
* __UTYPE_OPENBSD OpenBSD
* __UTYPE_OSX Apple Macintosh OS X
* __UTYPE_QNX QNX
* __UTYPE_SCO SCO Unix
* __UTYPE_IRIX Silicon Graphics IRIX
* __UTYPE_SINIX SINIX-N (Siemens-Nixdorf Unix)
* __UTYPE_SUNOS SunOS
* __UTYPE_SUNSOLARIS Sun Solaris
* __UTYPE_UNIXWARE SCO UnixWare
* ... these are the ones I know about so far.
* __UTYPE_GENERIC Any other UNIX
*
* When __VMS__ is defined, we may define one or more of these:
*
* __VMS_XOPEN Supports XOPEN functions
*/
#if (defined (__64BIT__) || defined (__x86_64__) || defined (__AARCH64EL__) \
|| defined (__PPC64__) || defined (__powerpc64__) || defined (__ppc64__) \
|| defined (__s390x__) || (defined (__sparc__) && defined (__arch64__)) \
|| defined (__ia64) || defined (__itanium__) || defined (_M_IA64) \
|| defined (__riscv64) || (defined (__riscv_xlen) && __riscv_xlen == 64) \
|| (defined (__mips__) && defined (_MIPSEL) && _MIPS_SIM == _ABI64) \
|| defined (__loongarch64))
# define __IS_64BIT__ /* May have 64-bit OS/compiler */
#else
# define __IS_32BIT__ /* Else assume 32-bit OS/compiler */
#endif
#if (defined WIN32 || defined _WIN32)
# undef __WINDOWS__
# define __WINDOWS__
# undef __MSDOS__
# define __MSDOS__
#endif
#if (defined WINDOWS || defined _WINDOWS || defined __WINDOWS__)
# undef __WINDOWS__
# define __WINDOWS__
# undef __MSDOS__
# define __MSDOS__
#endif
/* MSDOS Microsoft C */
/* _MSC_VER Microsoft C */
/* __TURBOC__ Borland Turbo C */
#if (defined (MSDOS) || defined (_MSC_VER) || defined (__TURBOC__))
# undef __MSDOS__
# define __MSDOS__
# if (defined (_DEBUG) && !defined (DEBUG))
# define DEBUG
# endif
#endif
#if (defined (__EMX__) && defined (__i386__))
# undef __OS2__
# define __OS2__
#endif
/* VMS VAX C (VAX/VMS) */
/* __VMS Dec C (Alpha/OpenVMS) */
/* __vax__ gcc */
#if (defined (VMS) || defined (__VMS) || defined (__vax__))
# undef __VMS__
# define __VMS__
# if (__VMS_VER >= 70000000)
# define __VMS_XOPEN
# endif
#endif
/* Try to define a __UTYPE_xxx symbol... */
/* unix SunOS at least */
/* __unix__ gcc */
/* _POSIX_SOURCE is various UNIX systems, maybe also VAX/VMS */
#if (defined (unix) || defined (__unix__) || defined (_POSIX_SOURCE))
# if (!defined (__VMS__))
# undef __UNIX__
# define __UNIX__
# if (defined (__alpha)) /* Digital UNIX is 64-bit */
# undef __IS_32BIT__
# define __IS_64BIT__
# define __UTYPE_DECALPHA
# endif
# endif
#endif
#if (defined (_AUX))
# define __UTYPE_AUX
# define __UNIX__
#elif (defined (__BEOS__))
# define __UTYPE_BEOS
# define __UNIX__
#elif (defined (__hpux))
# define __UTYPE_HPUX
# define __UNIX__
# define _INCLUDE_HPUX_SOURCE
# define _INCLUDE_XOPEN_SOURCE
# define _INCLUDE_POSIX_SOURCE
#elif (defined (_AIX) || defined (AIX))
# define __UTYPE_IBMAIX
# define __UNIX__
#elif (defined (BSD) || defined (bsd))
# define __UTYPE_BSDOS
# define __UNIX__
#elif (defined (linux))
# define __UTYPE_LINUX
# define __UNIX__
# define __NO_CTYPE /* Suppress warnings on tolower() */
#elif (defined (Mips))
# define __UTYPE_MIPS
# define __UNIX__
#elif (defined (FreeBSD) || defined (__FreeBSD__))
# define __UTYPE_FREEBSD
# define __UNIX__
#elif (defined (NetBSD) || defined (__NetBSD__))
# define __UTYPE_NETBSD
# define __UNIX__
#elif (defined (OpenBSD) || defined (__OpenBSD__))
# define __UTYPE_OPENBSD
# define __UNIX__
#elif (defined (__APPLE__))
# define __UTYPE_OSX
# define __UNIX__
#elif (defined (NeXT))
# define __UTYPE_NEXT
# define __UNIX__
#elif (defined (__QNX__))
# define __UTYPE_QNX
# define __UNIX__
#elif (defined (sco))
# define __UTYPE_SCO
# define __UNIX__
#elif (defined (sgi))
# define __UTYPE_IRIX
# define __UNIX__
#elif (defined (sinix))
# define __UTYPE_SINIX
# define __UNIX__
#elif (defined (SOLARIS) || defined (__SRV4))
# define __UTYPE_SUNSOLARIS
# define __UNIX__
#elif (defined (SUNOS) || defined (SUN) || defined (sun))
# define __UTYPE_SUNOS
# define __UNIX__
#elif (defined (__USLC__) || defined (UnixWare))
# define __UTYPE_UNIXWARE
# define __UNIX__
#elif (defined (__CYGWIN__))
# define __UTYPE_CYGWIN
# define __UNIX__
#elif (defined (__UNIX__))
# define __UTYPE_GENERIC
#endif
/*- Standard ANSI include files ---------------------------------------------*/
#include <ctype.h>
#include <limits.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <string.h>
#include <time.h>
#include <errno.h>
#include <float.h>
#include <math.h>
#include <signal.h>
#include <setjmp.h>
#include <assert.h>
/*- System-specific include files -------------------------------------------*/
#if (defined (__MSDOS__))
# if (defined (__WINDOWS__)) /* When __WINDOWS__ is defined, */
# define FD_SETSIZE 1024 /* Max. filehandles/sockets */
# include <direct.h>
# include <windows.h>
# include <winsock.h> /* May cause trouble on VC 1.x */
# include <process.h>
# endif
# if (defined (__TURBOC__))
# include <dir.h>
# include <alloc.h> /* Okay for Turbo C */
# else
# include <malloc.h> /* But will it work for others? */
# endif
# include <dos.h>
# include <io.h>
# include <fcntl.h>
# include <sys\types.h>
# include <sys\stat.h>
# include <sys\utime.h>
# include <share.h>
# if _MSC_VER == 1500
# ifndef _CRT_SECURE_NO_DEPRECATE
# define _CRT_SECURE_NO_DEPRECATE 1
# endif
# pragma warning(disable: 4996)
# endif
#endif
#if (defined (__UNIX__))
# if defined (__GNUC__) && (__GNUC__ >= 2)
# define __STRICT_ANSI__
# endif
# include <fcntl.h>
# include <netdb.h>
# include <unistd.h>
# include <dirent.h>
# include <pwd.h>
# include <grp.h>
# include <utime.h>
# include <sys/types.h>
# include <sys/param.h>
# include <sys/socket.h>
# include <sys/time.h>
# include <sys/stat.h>
# include <sys/ioctl.h>
# include <sys/file.h>
# include <sys/wait.h>
# include <netinet/in.h> /* Must come before arpa/inet.h */
# if (!defined (__UTYPE_BEOS))
# include <arpa/inet.h>
# if (!defined (TCP_NODELAY))
# include <netinet/tcp.h>
# endif
# endif
# if (defined (__UTYPE_IBMAIX) || defined(__UTYPE_QNX))
# include <sys/select.h>
# endif
# if (defined (__UTYPE_BEOS))
# include <NetKit.h>
# endif
# if ((defined (_XOPEN_REALTIME) && (_XOPEN_REALTIME >= 1)) || \
(defined (_POSIX_VERSION) && (_POSIX_VERSION >= 199309L)))
# include <sched.h>
# endif
# if (defined (__UTYPE_OSX))
# include <crt_externs.h> /* For _NSGetEnviron() */
# endif
#endif
#if (defined (__VMS__))
# if (!defined (vaxc))
# include <fcntl.h> /* Not provided by Vax C */
# endif
# include <netdb.h>
# include <unistd.h>
# include <unixio.h>
# include <unixlib.h>
# include <types.h>
# include <file.h>
# include <socket.h>
# include <dirent.h>
# include <time.h>
# include <pwd.h>
# include <stat.h>
# include <in.h>
# include <inet.h>
#endif
#if (defined (__OS2__))
# include <sys/types.h> /* Required near top */
# include <fcntl.h>
# include <malloc.h>
# include <netdb.h>
# include <unistd.h>
# include <dirent.h>
# include <pwd.h>
# include <grp.h>
# include <io.h>
# include <process.h>
# include <sys/param.h>
# include <sys/socket.h>
# include <sys/select.h>
# include <sys/time.h>
# include <sys/stat.h>
# include <sys/ioctl.h>
# include <sys/file.h>
# include <sys/wait.h>
# include <netinet/in.h> /* Must come before arpa/inet.h */
# include <arpa/inet.h>
# include <utime.h>
# if (!defined (TCP_NODELAY))
# include <netinet/tcp.h>
# endif
#endif
/*- Data types --------------------------------------------------------------*/
typedef unsigned short Bool; /* Boolean TRUE/FALSE value */
typedef unsigned char byte; /* Single unsigned byte = 8 bits */
typedef unsigned short dbyte; /* Double byte = 16 bits */
typedef unsigned short word; /* Alternative for double-byte */
typedef unsigned long dword; /* Double word >= 32 bits */
#if (defined (__IS_32BIT__))
typedef unsigned long qbyte; /* Quad byte = 32 bits */
#else
typedef unsigned int qbyte; /* Quad byte = 32 bits */
#endif
typedef void (*function) (void); /* Address of simple function */
#define local static void /* Shorthand for local functions */
typedef struct { /* Memory descriptor */
size_t size; /* Size of data part */
byte *data; /* Data part follows here */
} DESCR;
typedef struct { /* Variable-size descriptor */
size_t max_size; /* Maximum size of data part */
size_t cur_size; /* Current size of data part */
byte *data; /* Data part follows here */
} VDESCR;
/* ATTENTION: a VDESCR is always a DESCR plus max_size in front!
All functions that accept a DESCR can also be passed a VDESCR using
this macro */
#define UNVDESCR(v) (DESCR *)((size_t *)(v) + 1)
/*- Check compiler data type sizes ------------------------------------------*/
#if (UCHAR_MAX != 0xFF)
# error "Cannot compile: must change definition of 'byte'."
#endif
#if (USHRT_MAX != 0xFFFFU)
# error "Cannot compile: must change definition of 'dbyte'."
#endif
#if (defined (__IS_32BIT__))
# if (ULONG_MAX != 0xFFFFFFFFUL)
# error "Cannot compile: must change definition of 'qbyte'."
# endif
#else
# if (UINT_MAX != 0xFFFFFFFFU)
# error "Cannot compile: must change definition of 'qbyte'."
# endif
#endif
/*- Pseudo-functions --------------------------------------------------------*/
#define FOREVER for (;;) /* FOREVER { ... } */
#define until(expr) while (!(expr)) /* do { ... } until (expr) */
#define streq(s1,s2) (!strcmp ((s1), (s2)))
#define strneq(s1,s2) (strcmp ((s1), (s2)))
#define strused(s) (*(s) != 0)
#define strnull(s) (*(s) == 0)
#define strclr(s) (*(s) = 0)
#define strlast(s) ((s) [strlen (s) - 1])
#define strterm(s) ((s) [strlen (s)])
#define bit_msk(bit) (1 << (bit))
#define bit_set(x,bit) ((x) |= bit_msk (bit))
#define bit_clr(x,bit) ((x) &= ~bit_msk (bit))
#define bit_tst(x,bit) ((x) & bit_msk (bit))
#define tblsize(x) (sizeof (x) / sizeof ((x) [0]))
#define tbllast(x) (x [tblsize (x) - 1])
#if (!defined (random))
# define random(num) (int) ((float) num * rand () / (RAND_MAX + 1.0))
# define randomize() srand ((unsigned) time (NULL))
#endif
#if (!defined (min))
# define min(a,b) (((a) < (b))? (a): (b))
# define max(a,b) (((a) > (b))? (a): (b))
#endif
#define ASSERT assert
/*- Boolean operators and constants -----------------------------------------*/
#if (!defined (TRUE))
# define TRUE 1 /* ANSI standard */
# define FALSE 0
#endif
/*- Symbolic constants ------------------------------------------------------*/
#define FORK_ERROR -1 /* Return codes from fork() */
#define FORK_CHILD 0
#undef LINE_MAX
#define LINE_MAX 1024 /* Length of line from text file */
#if (!defined (PATH_MAX)) /* Length of path variable */
# define PATH_MAX 2048 /* if not previously #define'd */
#endif /* EDM 96/05/28 */
#if (!defined (EXIT_SUCCESS)) /* ANSI, and should be in stdlib.h */
# define EXIT_SUCCESS 0 /* but not defined on SunOs with */
# define EXIT_FAILURE 1 /* GCC, sometimes. */
#endif
/*- System-specific definitions ---------------------------------------------*/
/* Most of these are to bring older systems up to an acceptable POSIX or
C99 standard.
*/
/* A number of C99 keywords and data types */
#if (defined (__WINDOWS__))
# define inline __inline
typedef unsigned int uint;
typedef __int64 int64_t;
#elif (defined (__VMS__))
typedef __int64 int64_t;
#endif
/* On most systems, 'timezone' is an external long variable. On a few, it
* is a function that returns a string. We define TIMEZONE to be the long
* value. */
#undef TIMEZONE
#if (defined (__WINDOWS__) || defined (__CYGWIN__))
# define TIMEZONE _timezone
#else
# define TIMEZONE timezone /* Unless redefined later */
#endif
/* UNIX defines sleep() in terms of second; Win32 defines Sleep() in
* terms of milliseconds. We want to be able to use sleep() anywhere. */
#if (defined (__WINDOWS__))
# undef sleep
# if (defined (WIN32))
# define sleep(a) Sleep(a*1000) /* UNIX sleep() is seconds */
# else
# define sleep(a) /* Do nothing? */
# endif
/* MSVC 1.x does not define standard signals if in Windows */
# if (!defined (SIGINT))
# define SIGINT 2 /* Ctrl-C sequence */
# define SIGILL 4 /* Illegal instruction */
# define SIGSEGV 11 /* Segment violation */
# define SIGTERM 15 /* Kill signal */
# define SIGABRT 22 /* Termination by abort() */
# endif
/* MSVC 4.x does not define SIGALRM, so we pinch SIGFPE */
# if (!defined (SIGALRM))
# define SIGALRM SIGFPE /* Must be a known signal */
# endif
# if (defined __TURBOC__)
extern char **environ; /* Not defined in include files */
# endif
/* On SunOs, the ANSI C compiler costs extra, so many people install gcc
* but using the standard non-ANSI C library. We have to make a few extra
* definitions for this case. (Here we defined just what we needed for
* Libero and SMT -- we'll add more code as required.) */
#elif (defined (__UTYPE_SUNOS) || defined (__UTYPE_SUNSOLARIS))
# if (!defined (_SIZE_T)) /* Non-ANSI headers/libraries */
# define strerror(n) sys_errlist [n]
# define memmove(d,s,l) bcopy (s,d,l)
extern char *sys_errlist [];
# endif
#elif (defined (__UTYPE_BSDOS) || defined (__UTYPE_FREEBSD) \
|| defined (__UTYPE_NETBSD) || defined (__UTYPE_OPENBSD) \
|| defined (__UTYPE_OSX))
# undef TIMEZONE
#elif (defined (__VMS__))
/* This data structure is often used in OpenVMS library functions */
typedef struct { /* Fixed-string descriptor: */
word length; /* Length of string in bytes */
byte dtype; /* Must be DSC$K_DTYPE_T = 14 */
byte class; /* Must be DSC$K_CLASS_S = 1 */
char *value; /* Address of start of string */
} STRING_DESC;
#define VMS_STRING(name,value) STRING_DESC name = \
{ sizeof (value) - 1, 14, 1, value }
#endif
#if (defined (__UNIX__) || defined (__VMS__))
# if (defined (__UTYPE_OSX))
# define environ (* _NSGetEnviron())
# else
extern char **environ; /* Not defined in include files */
# endif
#endif
#if (!defined (SFL_STDIN_FILENO))
# if (defined (__WINDOWS__))
# define SFL_STDIN_FILENO _fileno (stdin)
# define SFL_STDOUT_FILENO _fileno (stdout)
# define SFL_STDERR_FILENO _fileno (stderr)
# else
# define SFL_STDIN_FILENO STDIN_FILENO
# define SFL_STDOUT_FILENO STDOUT_FILENO
# define SFL_STDERR_FILENO STDERR_FILENO
# endif
#endif
/* On some systems (older Vaxen and Unixes) O_BINARY is not defined. */
#if (!defined (O_BINARY))
# define O_BINARY 0
#endif
/* On some systems SIGALRM is not defined; we allow it in code anyhow */
#if (!defined (SIGALRM))
# define SIGALRM 1
#endif
/* On some systems O_NDELAY is used instead of O_NONBLOCK */
#if (!defined (O_NONBLOCK))
# if (!defined (O_NDELAY))
# define O_NDELAY 0
# endif
# if (defined (__VMS__))
# define O_NONBLOCK 0 /* Can't use O_NONBLOCK on files */
# else
# define O_NONBLOCK O_NDELAY
# endif
#endif
/* We define constants for the way the current system formats filenames;
* we assume that the system has some type of path concept. */
#if (defined (WIN32)) /* Windows 95/NT */
# define PATHSEP ";" /* Separates path components */
# define PATHEND '\\' /* Delimits directory and filename */
# define PATHFOLD FALSE /* Convert pathvalue to uppercase? */
# define NAMEFOLD FALSE /* Convert filenames to uppercase? */
# define GATES_FILESYSTEM /* MS-DOS derivative */
#elif (defined (__MSDOS__)) /* 16-bit Windows, MS-DOS */
# define PATHSEP ";"
# define PATHEND '\\'
# if defined LFN /* Support DRDOS long file names */
# define PATHFOLD FALSE
# define NAMEFOLD FALSE
# else
# define PATHFOLD TRUE
# define NAMEFOLD TRUE
# endif
# define GATES_FILESYSTEM /* MS-DOS derivative */
#elif (defined (__VMS__)) /* Digital OpenVMS */
# define PATHSEP "," /* We work with POSIX filenames */
# define PATHEND '/'
# define PATHFOLD TRUE
# define NAMEFOLD TRUE
#elif (defined (__UNIX__)) /* All UNIXes */
# define PATHSEP ":"
# define PATHEND '/'
# define PATHFOLD FALSE
# define NAMEFOLD FALSE
#elif (defined (__OS2__)) /* OS/2 using EMX/GCC */
# define PATHSEP ";" /* EDM 96/05/28 */
# define PATHEND '\\'
# define PATHFOLD TRUE
# define NAMEFOLD FALSE
# define GATES_FILESYSTEM /* MS-DOS derivative */
#else
# error "No definitions for PATH constants"
#endif
/*- Capability definitions --------------------------------------------------*/
/*
* Defines zero or more of these symbols, for use in any non-portable
* code:
*
* DOES_SOCKETS We can use (at least some) BSD socket functions
* DOES_UID We can use (at least some) uid access functions
* DOES_SNPRINTF Supports snprintf and vsnprintf functions
* DOES_BSDSIGNALS Supports BSD signal model (e.g. siginterrupt)
* DOES_SETENV Supports setenv/unsetenv (else we provide our own)
*/
#if (defined (AF_INET))
# define DOES_SOCKETS /* System supports BSD sockets */
#else
# undef DOES_SOCKETS
#endif
#if (defined (__UNIX__) || defined (__VMS__) || defined (__OS2__))
# define DOES_UID /* System supports uid functions */
#else
# undef DOES_UID
typedef int gid_t; /* Group id type */
typedef int uid_t; /* User id type */
#endif
#if (defined (__OS2__) || defined (__UTYPE_SCO) || defined (__UTYPE_LINUX) \
|| defined(__UTYPE_OSX) || defined (__CYGWIN__))
# define DOES_SNPRINTF
#elif (defined (__WINDOWS__))
# define DOES_SNPRINTF
# define snprintf _snprintf
# define vsnprintf _vsnprintf
#else
# undef DOES_SNPRINTF
#endif
/* SunOS 5 (Solaris) does not support BSD-style signal handling */
#if (!defined (__UTYPE_SUNSOLARIS))
# define DOES_BSDSIGNALS
#else
# undef DOES_BSDSIGNALS
#endif
#endif /* Include PRELUDE.H */
/*===========================================================================*
* *
* sflbits.h - Large bitmap manipulation functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides operations to manipulate large bitstrings. The
bitstrings are compressed. Intended for bit-based index
techniques, where bitstrings can be millions of bits long.
These functions are still in development; this is an early
version that provides basic functionality. Simple tests
on large bitmaps with random filling show a cost of about
3 bytes per bit, after compression. This includes all the
indexing information.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLBITS_INCLUDED /* Allow multiple inclusions */
#define SFLBITS_INCLUDED
/* Definitions */
#define BIT_DATASIZE 500 /* Size of block data part */
#define BIT_INDEXSIZE BIT_DATASIZE/2 /* Size of block index part */
#define BIT_SECTSIZE 8192 /* Size of one bitstring section */
#define BIT_MAXBLOCKS 1024 /* Max. size of bitstring */
#define BIT_MAXBITS 16384000L /* Max. possible bit number */
typedef struct { /* Bitstring block */
union {
byte data [BIT_DATASIZE]; /* Data record part */
dbyte index [BIT_INDEXSIZE]; /* Index record part */
} block;
dbyte right; /* Pointer to right (data too) */
int size; /* Size of data part */
} BITBLOCK;
typedef struct { /* Bitstring object */
BITBLOCK
*block [BIT_MAXBLOCKS]; /* Table of allocated blocks */
int
block_count; /* How many allocated blocks */
dbyte
free_list; /* Block free list */
} BITS;
#ifdef __cplusplus
extern "C" {
#endif
extern long bits_free_count; /* We count free() and malloc() */
extern long bits_alloc_count;
/* Function prototypes */
BITS *bits_create (void);
void bits_destroy (BITS *bits);
int bits_set (BITS *bits, long bit);
int bits_clear (BITS *bits, long bit);
int bits_fput (FILE *file, const BITS *bits);
BITS *bits_fget (FILE *file);
char *bits_save (BITS *bits);
BITS *bits_load (const char *buffer);
int bits_test (const BITS *bits, long bit);
long bits_search_set (const BITS *bits, long bit, Bool reverse);
long bits_set_count (const BITS *bits);
BITS *bits_and (const BITS *bits1, const BITS *bits2);
BITS *bits_or (const BITS *bits1, const BITS *bits2);
BITS *bits_xor (const BITS *bits1, const BITS *bits2);
BITS *bits_invert (const BITS *bits);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflcomp.h - Compression functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Various compression/decompression functions. The LZ-type
algorith (LZRW1/KH) was originally written by Kurt Haenen
<ghgaea8@blekul11> and made portable by P. Hintjens. This
is a reasonable LZ/RLE algorithm, very fast, but about 30%
less efficient than a ZIP-type algorithm in terms of space.
The RLE algorithms are better suited to compressing sparse
data. The nulls variant is specifically tuned to data that
consists mostly of binary zeroes. The bits variant is
tuned for compressing sparse bitmaps.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLCOMP_INCLUDED /* Allow multiple inclusions */
#define SFLCOMP_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
word compress_block (const byte *source, byte *dest, word source_size);
word expand_block (const byte *source, byte *dest, word source_size);
word compress_rle ( byte *source, byte *dest, word source_size);
word expand_rle (const byte *source, byte *dest, word source_size);
word compress_nulls ( byte *source, byte *dest, word source_size);
word expand_nulls (const byte *source, byte *dest, word source_size);
word compress_bits ( byte *source, byte *dest, word source_size);
word expand_bits (const byte *source, byte *dest, word source_size);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflcons.h - Console output functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides redirectable console output: use the coprintf() and
coputs() calls instead of printf() and puts() in a real-time
application. Then, you can call console_send() to send all
console output to a specified function. This is a useful
way to get output into -- for example -- a GUI window.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLCONS_INCLUDED /* Allow multiple inclusions */
#define SFLCONS_INCLUDED
/* Type definition for operator redirection function */
typedef void (CONSOLE_FCT) (const char *);
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
void console_send (CONSOLE_FCT *console_fct, Bool echo);
void console_enable (void);
void console_disable (void);
void console_set_mode (int CONSOLE_MODE);
int console_capture (const char *filename, char mode);
int coputs (const char *string);
int coprintf (const char *format, ...);
int coputc (int character);
#ifdef __cplusplus
}
#endif
/* Constant definitions */
enum {
CONSOLE_PLAIN, /* Print as requested */
CONSOLE_DATETIME, /* Prefix with date and time */
CONSOLE_TIME, /* Prefix with time only */
CONSOLE_DEBUG /* Datetime, fully flushed to disk */
};
#endif
/*===========================================================================*
* *
* sflconv.h - Global variables for conversion functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: These functions provide conversion between a set of datatypes
(dates, times, numbers, Booleans) and external strings that
represent the values. The objective is to format datatypes
for display or printing, and to validate and convert strings
supplied by the user. Conversion is controlled by a set of
options specific to each datatype. Additionally, dates and
times may be formatted using picture strings. The functions
were written for use in an interactive 'forms' environment.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLCONV_INCLUDED /* Allow multiple inclusions */
#define SFLCONV_INCLUDED
#ifdef __cplusplus
extern "C" {
#endif
char *conv_number_str (const char *number, int flags, char point,
int decimals, int decimal_format, int width,
int sign_format);
char *conv_str_number (const char *string, int flags, char point,
int decimals, int decimal_format, int width);
char *conv_date_str (long date, int flags, int format, int order,
char datesep, int width);
long conv_str_date (const char *string, int flags, int format, int order);
int conv_str_day (const char *day_name);
char *conv_time_str (long time, int flags, char timesep, int width);
long conv_str_time (const char *string);
char *conv_bool_str (Bool boolean, int format);
int conv_str_bool (const char *string);
char *conv_time_pict (long time, const char *picture);
char *conv_date_pict (long date, const char *picture);
/** Not Yet Implemented **/
char *conv_float_str (double number, int flags, int sign_format, char
point, int decimals, int decimal_format, int width
/* Srcdoc: IGNORE */
);
/** Not Yet Implemented **/
double conv_str_float (char *string, int flags, int sign_format,
char point, int decimals, int decimal_format
/* Srcdoc: IGNORE */
);
#ifdef __cplusplus
}
#endif
#define FORMAT_MAX 80 /* Max. size of formatted field */
#define CONV_MAX_DECS 100 /* Up to 100 decimal positions */
/* Global variables for error reporting */
#ifdef __cplusplus
extern "C" {
#endif
extern int conv_reason; /* Reason for last conversion error */
/* 0 = okay; >0 = error */
extern char *conv_reason_text []; /* Array of error messages 1..n */
/* Index using conv_reason */
#ifdef __cplusplus
}
#endif
/* Possible values for conv_reason */
#define CONV_NO_ERRORS 0 /* No errors */
#define CONV_ERR_INVALID_INPUT 1 /* Unrecognised char in input */
#define CONV_ERR_OUT_OF_RANGE 2 /* Value out of valid range */
/* conv_str_bool () */
#define CONV_ERR_NOT_BOOLEAN 3 /* Not a yes/no or true/false value */
/* conv_str_time () */
#define CONV_ERR_MULTIPLE_AM 4 /* More than one 'am' or 'pm' */
/* conv_date_str () */
#define CONV_ERR_DATE_OVERFLOW 5 /* Result too large for output */
/* conv_str_date () */
#define CONV_ERR_DATE_SIZE 6 /* Too few or too many digits */
#define CONV_ERR_MULTIPLE_DELIM 7 /* Too many delimiters */
#define CONV_ERR_BAD_MONTH 8 /* Unknown month name */
#define CONV_ERR_REJECT_3_5 9 /* 3/5 digits in a row not allowed */
#define CONV_ERR_MULTIPLE_MONTH 10 /* More than one month name */
/* conv_number_str () */
#define CONV_ERR_DECS_MISSING 11 /* Not enough decimals supplied */
#define CONV_ERR_NUM_OVERFLOW 12 /* Result too large for output */
/* conv_str_number () */
#define CONV_ERR_MULTIPLE_SIGN 13 /* More than one sign character */
#define CONV_ERR_SIGN_REJECTED 14 /* Sign not allowed if unsigned */
#define CONV_ERR_SIGN_BAD_FIN 15 /* Malformed financial negative */
#define CONV_ERR_MULTIPLE_POINT 16 /* More than one decimal point */
#define CONV_ERR_DECS_REJECTED 17 /* Decimals not allowed if integer */
#define CONV_ERR_DECS_HIDDEN 18 /* Decimals not allowed if hidden */
#define CONV_ERR_DECS_OVERFLOW 19 /* Too many decimal positions */
#define CONV_ERR_TOO_MANY_DIGITS 20 /* Too many digits for number */
/* Constants used for dedicated formatting functions */
#define DATE_ORDER_FIRST 1 /* Values for date_order */
#define DATE_ORDER_YMD 1
#define DATE_ORDER_DMY 2
#define DATE_ORDER_MDY 3
#define DATE_ORDER_LAST 3
#define FLAG_N_SIGNED 1 /* Number field flags */
#define FLAG_N_DECIMALS 2
#define FLAG_N_LEFT 4
#define FLAG_N_ZERO_FILL 8
#define FLAG_N_ZERO_BLANK 16
#define FLAG_N_THOUSANDS 32
#define SIGN_NEG_TRAIL 1 /* Number field formatting */
#define SIGN_ALL_TRAIL 2
#define SIGN_NEG_LEAD 3
#define SIGN_ALL_LEAD 4
#define SIGN_FINANCIAL 5
#define DECS_SHOW_ALL 1
#define DECS_DROP_ZEROS 2
#define DECS_HIDE_ALL 3
#define DECS_SCIENTIFIC 4
#define DATE_FORMAT_FIRST 0 /* Date field formatting */
#define DATE_YMD_COMPACT 0
#define DATE_YMD_DELIM 1
#define DATE_YMD_SPACE 2
#define DATE_YMD_COMMA 3
#define DATE_YMD_LAST 3
#define DATE_YM_COMPACT 4
#define DATE_YM_DELIM 5
#define DATE_YM_SPACE 6
#define DATE_YM_LAST 6
#define DATE_MD_COMPACT 7
#define DATE_MD_DELIM 8
#define DATE_MD_SPACE 9
#define DATE_MD_LAST 9
#define DATE_FORMAT_LAST 9
#define FLAG_D_DD_AS_D 1 /* Date field flags */
#define FLAG_D_MM_AS_M 2
#define FLAG_D_MONTH_ABC 4
#define FLAG_D_CENTURY 8
#define FLAG_D_UPPER 16
#define FLAG_D_ORDER_YMD 32
#define FLAG_D_ORDER_DMY 64
#define FLAG_D_ORDER_MDY 128
#define FLAG_T_HH_AS_H 1 /* Time field flags */
#define FLAG_T_MM_AS_M 2
#define FLAG_T_SS_AS_S 4
#define FLAG_T_CC_AS_C 8
#define FLAG_T_COMPACT 16
#define FLAG_T_12_HOUR 32
#define BOOL_YES_NO 0 /* Boolean field formatting */
#define BOOL_Y_N 1
#define BOOL_TRUE_FALSE 2
#define BOOL_T_F 3
#define BOOL_1_0 4
#endif
/*===========================================================================*
* *
* sflcryp.h - simple encryption functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
#ifndef SFLCRYP_INCLUDED /* Allow multiple inclusions */
#define SFLCRYP_INCLUDED
/* Definitions of the encryption algorithms we support */
#define CRYPT_IDEA 0 /* IDEA algorithm */
#define CRYPT_MDC 1 /* MDC algorithm */
#define CRYPT_DES 2 /* DES algorithm */
#define CRYPT_XOR 3 /* A basic XOR algorithm */
#define CRYPT_TOP 4 /* We support 4 algorithms */
/* We define some tables that key off the encryption algorithm */
#if (defined (DEFINE_CRYPT_TABLES))
static int
crypt_block_size [] = { /* Block size for each algorithm */
8, 32, 8, 16
};
#define CRYPT_MAX_BLOCK_SIZE 32 /* Largest block size, in bytes */
#endif
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
Bool crypt_encode (byte *buffer, word buffer_size, int algorithm,
const byte *key);
Bool crypt_decode (byte *buffer, word buffer_size, int algorithm,
const byte *key);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sfldate.h - Date and time manipulation functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Includes functions to get the current date/time, calculate
the day or week, week of year and leap year. Dates and times
are each stored in a 32-bit long value of 8 digits: dates are
CCYYMMDD; times are HHMMSSCC. You can compare dates and times
directly - e.g. if (date_wanted >= date_now), but not do
arithmetic on them directly.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLDATE_INCLUDED /* Allow multiple inclusions */
#define SFLDATE_INCLUDED
/* Macros */
#define GET_CENTURY(d) (int) ( (d) / 1000000L)
#define GET_CCYEAR(d) (int) ( (d) / 10000L)
#define GET_YEAR(d) (int) (((d) % 1000000L) / 10000L)
#define GET_MONTH(d) (int) (((d) % 10000L) / 100)
#define GET_DAY(d) (int) ( (d) % 100)
#define GET_HOUR(t) (int) ( (t) / 1000000L)
#define GET_MINUTE(t) (int) (((t) % 1000000L) / 10000L)
#define GET_SECOND(t) (int) (((t) % 10000L) / 100)
#define GET_CENTI(t) (int) ( (t) % 100)
#define MAKE_DATE(c,y,m,d) (long) (c) * 1000000L + \
(long) (y) * 10000L + \
(long) (m) * 100 + (d)
#define MAKE_TIME(h,m,s,c) (long) (h) * 1000000L + \
(long) (m) * 10000L + \
(long) (s) * 100 + (c)
#define timeeq(d1,t1,d2,t2) ((d1) == (d2) && (t1) == (t2))
#define timeneq(d1,t1,d2,t2) ((d1) != (d2) || (t1) != (t2))
#define timelt(d1,t1,d2,t2) ((d1) < (d2) || ((d1) == (d2) && (t1) < (t2)))
#define timele(d1,t1,d2,t2) ((d1) < (d2) || ((d1) == (d2) && (t1) <= (t2)))
#define timegt(d1,t1,d2,t2) ((d1) > (d2) || ((d1) == (d2) && (t1) > (t2)))
#define timege(d1,t1,d2,t2) ((d1) > (d2) || ((d1) == (d2) && (t1) >= (t2)))
/* Days are numbered from 0=Sunday to 6=Saturday */
#define DAY_SUNDAY 0
#define DAY_MONDAY 1
#define DAY_TUESDAY 2
#define DAY_WEDNESDAY 3
#define DAY_THURSDAY 4
#define DAY_FRIDAY 5
#define DAY_SATURDAY 6
/* Interval values, specified in centiseconds */
#define INTERVAL_CENTI 1
#define INTERVAL_SEC 100
#define INTERVAL_MIN 6000
#define INTERVAL_HOUR 360000L
#define INTERVAL_DAY 8640000L
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
long date_now (void);
long time_now (void);
void get_date_time_now (long *current_date, long *current_time);
long micro_time (void);
Bool leap_year (int year);
int julian_date (long date);
int day_of_week (long date);
int week_of_year (long date);
int year_quarter (long date);
long next_weekday (long date);
long prev_weekday (long date);
word pack_date (long date);
word pack_time (long time);
long unpack_date (word packdate);
long unpack_time (word packtime);
long default_century (long *date);
long date_to_days (long date);
long days_to_date (long days);
time_t date_to_timer (long date, long time);
long timer_to_date (time_t time_secs);
long timer_to_time (time_t time_secs);
long timer_to_gmdate (time_t time_secs);
long timer_to_gmtime (time_t time_secs);
long time_to_csecs (long time);
long csecs_to_time (long csecs);
void future_date (long *date, long *time, long days, long csecs);
void past_date (long *date, long *time, long days, long csecs);
void date_diff (long date1, long time1, long date2, long time2,
long *days, long *csecs);
Bool valid_date (long date);
Bool valid_time (long time);
Bool date_is_future (long date, long time);
Bool date_is_past (long date, long time);
char *timezone_string (void);
void local_to_gmt (long date, long time, long *gmdate, long *gmtime);
void gmt_to_local (long gmdate, long gmtime, long *date, long *time);
struct tm *safe_localtime (const time_t *time_secs);
struct tm *safe_gmtime (const time_t *time_secs);
double timestamp_now (void);
double gmtimestamp_now (void);
double make_timestamp (long date, long time);
char *gmtimestamp_to_iso (double timestamp);
double iso_to_gmtimestamp (const char *iso_time);
long timestamp_date (double timestamp);
long timestamp_time (double timestamp);
long local_tz (void);
int local_dst (void);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sfldescr.h - String descriptor manipulation functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
*===========================================================================*/
#ifndef SFLDESCR_INCLUDED /* Allow multiple inclusions */
#define SFLDESCR_INCLUDED
#define STR_DESCR(s) { sizeof(s), (s) }
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char *descr_str (const DESCR *descr);
Bool descr_streq (const DESCR *descr, const char *string);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflexdr.h - External data representation *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to read and write data in a portable
format that is suitable for transmission to other systems.
The principle is similar to the ONC XDR standard used in
RPC, but somewhat simpler. The streams produced by these
functions are not compatible with ONC XDR.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLEXDR_INCLUDED /* Allow multiple inclusions */
#define SFLEXDR_INCLUDED
/*---------------------------------------------------------------------------
* Function prototypes
*/
#ifdef __cplusplus
extern "C" {
#endif
int exdr_write (byte *buffer, const char *format, ...);
int exdr_writed (DESCR *buffer, const char *format, ...);
int exdr_read (const byte *buffer, const char *format, ...);
#ifdef __cplusplus
}
#endif
#endif /* Include sflexdr.h */
/*===========================================================================*
* *
* sflfile.h - File manipulation functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to read and write files with explicit
new-line/carriage-return control; to find files on a path;
to copy files, check files' protection, etc.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLFILE_INCLUDED /* Allow multiple inclusions */
#define SFLFILE_INCLUDED
/* System-specific definitions */
#if (defined (__MSDOS__))
# define FOPEN_READ_TEXT "rt" /* Under DOS we can be explict */
# define FOPEN_READ_BINARY "rb" /* and use 't' or 'b' in fopen */
# define FOPEN_WRITE_TEXT "wt"
# define FOPEN_WRITE_BINARY "wb"
# define FOPEN_APPEND_TEXT "at"
# define FOPEN_APPEND_BINARY "ab"
#elif (defined (__VMS__))
# define FOPEN_READ_TEXT "r" /* Dec C does not like 't' or 'b' */
# define FOPEN_READ_BINARY "r"
# define FOPEN_WRITE_TEXT "w"
# define FOPEN_WRITE_BINARY "w"
# define FOPEN_APPEND_TEXT "a"
# define FOPEN_APPEND_BINARY "a"
#elif (defined (__UNIX__))
# define FOPEN_READ_TEXT "rt" /* Under UNIX we can be explict */
# define FOPEN_READ_BINARY "rb" /* and use 't' or 'b' in fopen */
# define FOPEN_WRITE_TEXT "wt"
# define FOPEN_WRITE_BINARY "wb"
# define FOPEN_APPEND_TEXT "at"
# define FOPEN_APPEND_BINARY "ab"
#elif (defined (__OS2__))
# define FOPEN_READ_TEXT "rt" /* Under OS/2 we can be explict */
# define FOPEN_READ_BINARY "rb" /* and use 't' or 'b' in fopen */
# define FOPEN_WRITE_TEXT "wt"
# define FOPEN_WRITE_BINARY "wb"
# define FOPEN_APPEND_TEXT "at"
# define FOPEN_APPEND_BINARY "ab"
#else
# error "No definitions for FOPEN constants"
#endif
/* Constants */
enum {
CYCLE_ALWAYS = 0, /* Cycle file unconditionally */
CYCLE_HOURLY = 1, /* Cycle file if hour has changed */
CYCLE_DAILY = 2, /* Cycle file if day has changed */
CYCLE_WEEKLY = 3, /* Cycle file if week has changed */
CYCLE_MONTHLY = 4, /* Cycle file if month has changed */
CYCLE_NEVER = 5 /* Don't cycle the file */
};
/* External variables */
#ifdef __cplusplus
extern "C" {
#endif
extern Bool file_crlf; /* TRUE or FALSE */
/* Function prototypes */
FILE *file_open (const char *filename, char mode);
FILE *file_locate (const char *path, const char *name,
const char *ext);
int file_close (FILE *stream);
Bool file_read (FILE *stream, char *string);
Bool file_readn (FILE *stream, char *string, int line_max);
char *file_write (FILE *stream, const char *string);
int file_copy (const char *dest, const char *src, char mode);
int file_copy_text (const char *dest, const char *src);
int file_concat (const char *dest, const char *src);
int file_rename (const char *oldname, const char *newname);
int file_delete (const char *filename);
char *file_where (char mode, const char *path, const char *name,
const char *ext);
char *file_where_ext (char mode, const char *path, const char *name,
const char **ext);
Bool file_exists (const char *filename);
Bool file_stable (const char *filename);
Bool file_cycle (const char *filename, int how);
Bool file_cycle_needed (const char *filename, int how);
Bool file_has_changed (const char *filename, long old_date, long old_time);
Bool safe_to_extend (const char *filename);
char *default_extension (char *dest, const char *src, const char *ext);
char *fixed_extension (char *dest, const char *src, const char *ext);
char *strip_extension (char *filename);
char *add_extension (char *dest, const char *src, const char *ext);
char *strip_file_path (char *filename);
char *strip_file_name (char *filename);
char *get_new_filename (const char *filename);
Bool file_is_readable (const char *filename);
Bool file_is_writeable (const char *filename);
Bool file_is_executable (const char *filename);
Bool file_is_directory (const char *filename);
Bool file_is_program (const char *filename);
Bool file_is_legal (const char *filename);
int file_is_text (const char *filename);
char *file_exec_name (const char *filename);
long get_file_size (const char *filename);
time_t get_file_time (const char *filename);
Bool set_file_time (const char *filename, long date, long time);
long get_file_lines (const char *filename);
DESCR *file_slurp (const char *filename);
DESCR *file_slurpl (const char *filename);
int descr2file (const DESCR *descr, const char *filename);
dbyte file_set_eoln (char *dest, const char *src, dbyte src_size,
Bool add_cr);
char *get_tmp_file_name (const char *path, qbyte *index, const char *ext);
int file_fhredirect (int source, int dest);
void file_fhrestore (int source, int dest);
FILE *ftmp_open (char **pathname);
void ftmp_close (FILE *tempstream);
#ifdef __cplusplus
}
#endif
/* Symbols, macros */
#define FILE_NAME_MAX 160 /* Max size of filename */
#define FILE_DIR_MAX 64 /* Max size of directory name */
#define file_lines(f) get_file_lines(f) /* Changed 98/07/23 */
#endif
/*===========================================================================*
* *
* sflfind.h - String and data searching functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Searches for a pattern within a string or block of memory
using a variant of the Boyer-Moore algorithm (improved by
Horspool and Sunday). As fast or faster than the normal
Boyer-Moore algorithm for most search strings, and much
simpler. Includes a basic function for searching blocks of
memory with known sizes, plus an envelope that searches
null-delimited strings. Provides the option of repeatedly
searching for the same pattern without re-parsing the pattern
each time. Original algorithm published by BOYER, R., and S.
MOORE 1977, "A Fast String Searching Algorithm." CACM, 20,
762-72. Simplifications by HORSPOOL, R. N. 1980, "Practical
Fast Searching in Strings." Software - Practice and Experience,
10, 501-06. More improvements by HUME, A., and D. M. SUNDAY
1991, "Fast String Searching." AT&T Bell Labs Computing Science
Technical Report No. 156. Implemented in C by P. Hintjens.
strfind_r() and memfind_r(), are reentrant versions of
strfind() and memfind() for single searches, and
strfind_rb() and memfind_rb() are reentrant versions of
strfind() and memfind() supporting repeat searches against
the same pattern.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLFIND_INCLUDED /* Allow multiple inclusions */
#define SFLFIND_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char *strfind (const char *string, const char *pattern, Bool repeat_find);
char *strfind_r (const char *string, const char *pattern);
char *strfind_rb (const char *string, const char *pattern,
size_t *shift, Bool *repeat_find);
void *memfind (const void *block, size_t block_size,
const void *pattern, size_t pattern_size, Bool repeat_find);
void *memfind_r (const void *block, size_t block_size,
const void *pattern, size_t pattern_size);
void *memfind_rb (const void *block, size_t block_size,
const void *pattern, size_t pattern_size,
size_t *shift, Bool *repeat_find);
char *txtfind (const char *string, const char *pattern);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflfort.h - Fortune cookie functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to create compressed or simple fortune
cookie files, and functions to read from such files.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLFORT_INCLUDED /* Allow multiple inclusions */
#define SFLFORT_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
int fortune_build (const char *in, const char *out, Bool compress);
char *fortune_read (const char *fortune_file);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflheap.h - Heap management functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to handle a disk-based heap. Data can be
added to a heap with a unique key, and can be retrieved using
that key.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLHEAP_INCLUDED /* Allow multiple inclusions */
#define SFLHEAP_INCLUDED
/* Constants */
enum {
HEAP_OK = 0,
HEAP_DATA_NOT_FOUND ,
HEAP_CANNOT_OPEN_FILE ,
HEAP_IO_FAILED ,
HEAP_MEMORY_ERROR ,
HEAP_INVALID_PATH ,
HEAP_CANNOT_CREATE_PATH ,
HEAP_DATA_ALREADY_EXISTS ,
HEAP_CANNOT_DELETE_DATA ,
HEAP_EMPTY_DATA ,
HEAP_RECOVERY_ERROR
};
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
int heap_init (const char *heappath);
int heap_recover (const char *heappath);
int heap_dispose (void);
int heap_add (const char *key, const DESCR *data);
int heap_update (const char *key, const DESCR *data);
int heap_remove (const char *key);
Bool heap_exists (const char *key);
int heap_get (const char *key, DESCR **data);
int heap_first ( char **key, DESCR **data);
int heap_next ( char **key, DESCR **data);
int heap_rename (const char *src_name, const char *src_key,
const char *dst_name, const char *dst_key);
#ifdef __cplusplus
}
#endif
#endif /* SFLHEAP_INCLUDED */
/*===========================================================================*
* *
* sfllang.h - Multilingual date/time/number representation *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides hard-coded multilanguage dictionaries for dates and
numbers, The hard-coded dictionaries work with most European
languages.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLLANG_INCLUDED /* Allow multiple inclusions */
#define SFLLANG_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
int set_userlang (int language);
int set_userlang_str (const char *language);
int get_userlang (void);
char *get_userlang_str (void);
int set_accents (Bool accents);
Bool get_accents (void);
char *get_units_name (int units);
char *get_tens_name (int tens);
char *get_day_name (int day);
char *get_day_abbrev (int day, Bool upper);
char *get_month_name (int month);
char *get_month_abbrev (int month, Bool upper);
char *timestamp_string (char *buffer, const char *pattern);
char *certify_the_number (char *buffer, int buffer_size, long number,
char *language, int code_page);
#ifdef __cplusplus
}
#endif
/* Constant definitions */
enum {
USERLANG_DEFAULT = 0, /* Default language */
USERLANG_DA, /* Danish */
USERLANG_DE, /* German */
USERLANG_EN, /* English */
USERLANG_ES, /* Castillian Spanish */
USERLANG_FB, /* Belgian or Swiss French */
USERLANG_FR, /* French */
USERLANG_IS, /* Icelandic */
USERLANG_IT, /* Italian */
USERLANG_NL, /* Dutch */
USERLANG_NO, /* Norwegian */
USERLANG_PO, /* Portuguese */
USERLANG_SV /* Swedish */
};
#define USERLANG_TOP USERLANG_SV + 1
#endif
/*===========================================================================*
* *
* sfllbuf.h - Line buffering routines *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides circular line buffering functions. A line buffer
is a data structure that holds a fixed amount of data in a
serial fashion; the oldest data gets discarded as new data
is added.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLLBUF_INCLUDED /* Allow multiple inclusions */
#define SFLLBUF_INCLUDED
/*- Type definitions --------------------------------------------------------*/
typedef struct {
char *data; /* Buffer contents */
char *head; /* Where we add new data */
char *tail; /* Oldest data is here */
size_t size; /* Actual size of buffer */
char *top; /* Address of top of buffer */
} LINEBUF; /* Empty when tail == head */
/*- Function Prototypes -----------------------------------------------------*/
#ifdef __cplusplus
extern "C" {
#endif
LINEBUF *linebuf_create (size_t maxsize);
void linebuf_destroy (LINEBUF *buffer);
void linebuf_reset (LINEBUF *buffer);
void linebuf_append (LINEBUF *buffer, const char *line);
char *linebuf_first (LINEBUF *buffer, DESCR *line);
char *linebuf_next (LINEBUF *buffer, DESCR *line, const char *cur);
char *linebuf_last (LINEBUF *buffer, DESCR *line);
char *linebuf_prev (LINEBUF *buffer, DESCR *line, const char *cur);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sfllist.h - Doubly-linked lists *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to maintain doubly-linked lists. You can
use these functions to work with lists of any structure. To
make this work, all structures must start with two pointers,
"void *next, *prev;". When you want to attach a linked-list
to another structure, declare the list head as a list. You
can then refer to this variable when you attach items to the
list head. The code sets the global list_unsafe to TRUE
whenever it is changing a list.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLLIST_INCLUDED /* Allow multiple inclusions */
#define SFLLIST_INCLUDED
/*- Types -------------------------------------------------------------------*/
/* The list descriptor simply contains two pointers. All blocks that are */
/* descriptors that are held in lists. We can (a) allocate a dummy list */
/* instead of a complete block for a list head, and (b) use the same list */
/* handling functions for all descriptors. */
typedef struct { /* list descriptor */
void *next, *prev; /* for a doubly-linked list */
} LIST;
/* Function type for comparing nodes. A function of this type is passed */
/* to the list sorting functions which use it to compare nodes. A function */
/* of this type should return TRUE iff the two nodes need swapping. */
typedef Bool (*NODE_COMPARE) (LIST *t1, LIST *t2);
/* Global variables */
#ifdef __cplusplus
extern "C" {
#endif
extern Bool
list_unsafe; /* TRUE if we're changing a list */
/*- Function prototypes -----------------------------------------------------*/
void *list_relink (void *left, void *list, void *right);
void *list_unlink ( void *list );
void *list_attach (LIST *list, void *data, size_t size);
void list_remove (LIST *list, void *data, size_t size);
void list_sort (void *list, NODE_COMPARE comp);
#ifdef __cplusplus
}
#endif
/* -------------------------------------------------------------------------
Macro: list_relink_after
Synopsis: Links a list into a doubly-linked list after a point in the
list. Generally a linked list is attached to a 'head': an empty list
consists of just the head list. To attach a list to the start of the
list, link after the head. To attach a list to the end of the list,
link before the head using list_relink_before(). In this way you can
build doubly-ended queues, fifo queue, lists, etc. Returns the address
of the list.
-------------------------------------------------------------------------*/
#define list_relink_after(l,a) (list_relink (a, l, ((LIST *) a)-> next))
/* -------------------------------------------------------------------------
Macro: list_relink_before
Synopsis: Links a list into a doubly-linked list before a point in the
list. To link a list to the end of a doubly-linked list, link it before
the list header list.
-------------------------------------------------------------------------*/
#define list_relink_before(l,b) (list_relink (((LIST *) b)-> prev, l, b))
/* Other macros */
#define list_reset(list) (list)-> prev = (list)-> next = (list)
#define list_empty(list) ((list)-> prev == (list))
#define list_create(node,size) if (((node) = mem_alloc (size)) != NULL) \
list_reset (node)
/* Macro to do all nodes on a linked list */
#define FORLIST(node,root) for ((node) = (root).next; \
(void *) (node) != &(root); \
(node) = (node)-> next)
/* Macros to use lists as stacks and queues */
#define list_push(list,item) list_attach (list, \
&item, \
sizeof (item))
#define list_queue(list,item) list_attach (((LIST *)list)-> prev, \
&item, \
sizeof (item))
#define list_pop(list,item) list_remove (list, \
&item, \
sizeof (item))
#define list_destroy(list) while (!list_empty(list)) \
{ \
LIST *item = ((LIST *)list)-> next; \
list_unlink (item); \
mem_free (item); \
}
#endif
/*===========================================================================*
* *
* sflnode.h - Linked list functions, deprecated *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to maintain doubly-linked lists. You can
use these functions to work with lists of any structure. To
make this work, all structures must start with two pointers,
"void *next, *prev;". When you want to attach a linked-list
to another structure, declare the list head as a NODE. You
can then refer to this variable when you attach items to the
list head. The code sets the global node_unsafe to TRUE
whenever it is changing a list. NOTE: DEPRECATED IN FAVOUR
OF SFLLIST.C.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLNODE_INCLUDED /* Allow multiple inclusions */
#define SFLNODE_INCLUDED
/* The node descriptor simply contains two pointers. All blocks that are */
/* descriptors that are held in lists. We can (a) allocate a dummy node */
/* instead of a complete block for a list head, and (b) use the same list */
/* handling functions for all descriptors. */
typedef struct { /* Node descriptor */
void *next, *prev; /* for a doubly-linked list */
} NODE;
/* Global variables */
extern Bool
node_unsafe; /* TRUE if we're changing a list */
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
void *node_create (void *after, size_t size);
void node_destroy (void *node);
void *node_unlink (void *node);
void *node_relink (void *left, void *node, void *right);
void *node_relink_after (void *node, void *after);
void *node_relink_before (void *node, void *before);
#ifdef __cplusplus
}
#endif
/* Macros */
#define node_reset(node) (node)-> prev = (node)-> next = (node)
#endif
/*===========================================================================*
* *
* sflmath.h - Mathematical functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides miscellaneous mathematical functions, including
calculation of points within areas, and CRC calculation.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLMATH_INCLUDED /* Allow multiple inclusions */
#define SFLMATH_INCLUDED
/* Structure declarations */
typedef struct _STAT_STRUCT STAT_STRUCT;
typedef struct
{
double x;
double y;
} FPOINT;
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
STAT_STRUCT *
stat_create (void);
void stat_free (STAT_STRUCT *stat_struct);
void stat_add_datum (STAT_STRUCT *stat_struct, int datum);
void stat_release_data (STAT_STRUCT *stat_struct);
void stat_release_datum (STAT_STRUCT *stat_struct, int index);
int stat_get_struct_value (STAT_STRUCT *stat_struct, int index);
int stat_data_count (STAT_STRUCT *stat_struct);
double stat_mean (STAT_STRUCT *stat_struct);
double stat_standard_deviation (STAT_STRUCT *stat_struct);
double compute_data_sd_factor (STAT_STRUCT *stat_struct, int index);
int point_in_rect (const FPOINT *point, const FPOINT *coords);
int point_in_circle (const FPOINT *point, const FPOINT *coords);
int point_in_poly (const FPOINT *point, const FPOINT *coords, int nb_point);
qbyte calculate_crc (byte *block, size_t length);
void calculate_continuing_crc (byte *block, size_t length,
qbyte *crc_value);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflmem.h - Memory allocation/deallocation tracking *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Encapsulated memory allocation functions. Based on an
article by Jim Schimandle in DDJ August 1990. Provides
'safe' versions of malloc(), realloc(), free(), and strdup().
These functions protect the programmer from errors in calling
memory allocation/free routines. When these calls are used,
the allocation routines in this module add a data structure
to the top of allocated memory blocks which tags them as legal
memory blocks. When the free routine is called, the memory
block to be freed is checked for legality. If the block
is not legal, the memory list is dumped to stderr and the
program is terminated. Some of these functions are called
through macros that add the filename and line number of the
call, for tracing. Do not call these functions directly.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLMEM_INCLUDED /* Allow multiple inclusions */
#define SFLMEM_INCLUDED
/*- Type definitions --------------------------------------------------------*/
typedef Bool (*scavenger) (void *); /* Memory scavenger function */
typedef struct _MEMHDR MEMHDR; /* Memory block header */
typedef struct _MEMTRN MEMTRN; /* Transaction block identifier */
/*- Function prototypes -----------------------------------------------------*/
#ifdef __cplusplus
extern "C" {
#endif
/* General memory allocation functions */
void *mem_alloc_ (MEMTRN *trn, size_t size,
const char *source_file, size_t source_line);
void *mem_realloc_ (void *block, size_t size,
const char *source_file, size_t source_line);
void mem_free_ (void *block,
const char *source_file, size_t source_line);
void *mem_copy_ (MEMTRN *trn, void *block,
const char *source_file, size_t source_line);
char *mem_strdup_ (MEMTRN *trn, const char *string,
const char *source_file, size_t source_line);
char *mem_strndup_ (MEMTRN *trn, const char *string, const size_t length,
const char *source_file, size_t source_line);
void mem_strfree_ (char **string,
const char *source_file, size_t source_line);
DESCR *mem_descr_ (MEMTRN *trn, const void *block, size_t size,
const char *source_file, size_t source_line);
VDESCR *mem_vdescr_ (MEMTRN *trn, const void *block, size_t size,
const char *source_file, size_t source_line);
/* Functions on transactions */
MEMTRN *mem_new_trans_ (const char *source_file, size_t source_line);
void mem_save_ (MEMTRN *to, MEMTRN *from,
const char *source_file, size_t source_line);
void mem_rollback_ (MEMTRN *trn,
const char *source_file, size_t source_line);
/* Hidden control functions */
void mem_checkall_ (const char *source_file, size_t source_line);
void mem_check_ (const void *block,
const char *source_file, size_t source_line);
void mem_assert_ (MEMTRN *trn, \
const char *source_file, size_t source_line);
/* Visible control functions */
size_t mem_size_ (const void *block,
const char *source_file, size_t source_line);
long mem_used (void);
long mem_allocs (void);
long mem_frees (void);
void mem_freeall (void);
void mem_display (FILE *save_to);
int mem_scavenger (scavenger scav_fct, void *scav_arg);
#ifdef __cplusplus
}
#endif
/*- Define macros to encapsulate calls to the hidden functions --------------*/
#if (defined (DEBUG))
/* Transaction-based allocation macros */
# define memt_alloc(t,n) mem_alloc_ ((t), (n), __FILE__, __LINE__)
# define memt_copy(t,p) mem_copy_ ((t), (p), __FILE__, __LINE__)
# define memt_strdup(t,s) mem_strdup_ ((t), (s), __FILE__, __LINE__)
# define memt_strndup(t,s,n) mem_strndup_ ((t), (s), (n), __FILE__, __LINE__)
# define memt_descr(t,p,n) mem_descr_ ((t), (p), (n), __FILE__, __LINE__)
# define memt_vdescr(t,p,n) mem_vdescr_ ((t), (p), (n), __FILE__, __LINE__)
# define memt_assert(t) mem_assert_ ((t), __FILE__, __LINE__)
/* Basic allocation macros */
# define mem_alloc(n) mem_alloc_ (NULL, (n), __FILE__, __LINE__)
# define mem_copy(p) mem_copy_ (NULL, (p), __FILE__, __LINE__)
# define mem_strdup(s) mem_strdup_ (NULL, (s), __FILE__, __LINE__)
# define mem_strndup(s,n) mem_strndup_ (NULL, (s), (n), __FILE__, __LINE__)
# define mem_descr(p,n) mem_descr_ (NULL, (p), (n), __FILE__, __LINE__)
# define mem_vdescr(p,n) mem_vdescr_ (NULL, (p), (n), __FILE__, __LINE__)
/* Commit means save to default transaction */
# define mem_commit_(t,f,l) mem_save_ (NULL, (t), (f), (l))
# define mem_commit(t) mem_save_ (NULL, (t), __FILE__, __LINE__)
# define mem_save(t,f) mem_save_ ((t), (f), __FILE__, __LINE__)
/* Other functions requiring __FILE__ & __LINE__ substitution */
# define mem_new_trans() mem_new_trans_ ( __FILE__, __LINE__)
# define mem_rollback(t) mem_rollback_ ((t), __FILE__, __LINE__)
# define mem_realloc(p,n) mem_realloc_ ((p), (n), __FILE__, __LINE__)
# define mem_free(p) mem_free_ ((p), __FILE__, __LINE__)
# define mem_strfree(ps) mem_strfree_ ((ps), __FILE__, __LINE__)
# define mem_assert() mem_assert_ (NULL, __FILE__, __LINE__)
# define mem_checkall() mem_checkall_ ( __FILE__, __LINE__)
# define mem_check(p) mem_check_ ((p), __FILE__, __LINE__)
# define mem_size(p) mem_size_ ((p), __FILE__, __LINE__)
#else
/* Transaction-based allocation macros */
# define memt_alloc(t,n) mem_alloc_ ((t), (n), NULL, 0)
# define memt_copy(t,p) mem_copy_ ((t), (p), NULL, 0)
# define memt_strdup(t,s) mem_strdup_ ((t), (s), NULL, 0)
# define memt_strndup(t,s,n) mem_strndup_ ((t), (s), (n), NULL, 0)
# define memt_descr(t,p,n) mem_descr_ ((t), (p), (n), NULL, 0)
# define memt_vdescr(t,p,n) mem_vdescr_ ((t), (p), (n), NULL, 0)
# define memt_assert(t) mem_assert_ ((t), NULL, 0)
/* Basic allocation macros */
# define mem_alloc(n) mem_alloc_ (NULL, (n), NULL, 0)
# define mem_copy(p) mem_copy_ (NULL, (p), NULL, 0)
# define mem_strdup(s) mem_strdup_ (NULL, (s), NULL, 0)
# define mem_strndup(s,n) mem_strndup_ (NULL, (s), (n), NULL, 0)
# define mem_descr(p,n) mem_descr_ (NULL, (p), (n), NULL, 0)
# define mem_vdescr(p,n) mem_vdescr_ (NULL, (p), (n), NULL, 0)
/* Commit means save to default transaction */
# define mem_commit_(t,f,l) mem_save_ (NULL, (t), (f), (l))
# define mem_commit(t) mem_save_ (NULL, (t), NULL, 0)
# define mem_save(t,f) mem_save_ ((t), (f), NULL, 0)
/* Other functions requiring __FILE__ & __LINE__ substitution */
# define mem_new_trans() mem_new_trans_ ( NULL, 0)
# define mem_rollback(t) mem_rollback_ ((t), NULL, 0)
# define mem_realloc(p,n) mem_realloc_ ((p), (n), NULL, 0)
# define mem_free(p) mem_free_ ((p), NULL, 0)
# define mem_strfree(ps) mem_strfree_ ((ps), NULL, 0)
# define mem_assert() mem_assert_ (NULL, NULL, 0)
# define mem_checkall() mem_checkall_ ( NULL, 0)
# define mem_check(p) mem_check_ ((p), NULL, 0)
# define mem_size(p) mem_size_ ((p), NULL, 0)
#endif
#endif
/*===========================================================================*
* *
* sflmesg.h - Error message access functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to read and format messages from a message
file. The intention of such a file is to provide a single
location for all error messages: you can easier translate
these into foreign languages, and you can control the
consistency of an application's error messages.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLMESG_INCLUDED /* Allow multiple inclusions */
#define SFLMESG_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
int open_message_file (const char *filename);
void close_message_file (void);
void print_message (int msgid, ...);
char *message_text (int msgid);
#ifdef __cplusplus
}
#endif
/* Symbols, macros */
#define ERROR_ANY 0000 /* Generic error message */
#endif
/*===========================================================================*
* *
* sflmime.h - MIME support functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides various functions that support MIME encoding and
decoding. See RFC 1521 for details.
Notes:
Extract from RFC1521 for Base64 Content-Transfer-Encoding
---------------------------------------------------------
The Base64 Content-Transfer-Encoding is designed to represent
arbitrary sequences of octets in a form that need not be humanly
readable. The encoding and decoding algorithms are simple, but the
encoded data are consistently only about 33 percent larger than the
unencoded data. This encoding is virtually identical to the one used
in Privacy Enhanced Mail (PEM) applications, as defined in RFC 1421.
The base64 encoding is adapted from RFC 1421, with one change: base64
eliminates the "*" mechanism for embedded clear text.
A 65-character subset of US-ASCII is used, enabling 6 bits to be
represented per printable character. (The extra 65th character, "=",
is used to signify a special processing function.)
\NOTE: This subset has the important property that it is
represented identically in all versions of ISO 646, including US
ASCII, and all characters in the subset are also represented
identically in all versions of EBCDIC. Other popular encodings,
such as the encoding used by the uuencode utility and the base85
encoding specified as part of Level 2 PostScript, do not share
these properties, and thus do not fulfill the portability
requirements a binary transport encoding for mail must meet.
The encoding process represents 24-bit groups of input bits as output
strings of 4 encoded characters. Proceeding from left to right, a
24-bit input group is formed by concatenating 3 8-bit input groups.
These 24 bits are then treated as 4 concatenated 6-bit groups, each
of which is translated into a single digit in the base64 alphabet.
When encoding a bit stream via the base64 encoding, the bit stream
must be presumed to be ordered with the most-significant-bit first.
That is, the first bit in the stream will be the high-order bit in
the first byte, and the eighth bit will be the low-order bit in the
first byte, and so on.
Each 6-bit group is used as an index into an array of 64 printable
characters. The character referenced by the index is placed in the
output string. These characters, identified in Table 1, below, are
selected so as to be universally representable, and the set excludes
characters with particular significance to SMTP (e.g., ".", CR, LF)
and to the encapsulation boundaries defined in this document (e.g.,
"-").
Table 1: The Base64 Alphabet
Value Encoding Value Encoding Value Encoding Value Encoding
0 A 17 R 34 i 51 z
1 B 18 S 35 j 52 0
2 C 19 T 36 k 53 1
3 D 20 U 37 l 54 2
4 E 21 V 38 m 55 3
5 F 22 W 39 n 56 4
6 G 23 X 40 o 57 5
7 H 24 Y 41 p 58 6
8 I 25 Z 42 q 59 7
9 J 26 a 43 r 60 8
10 K 27 b 44 s 61 9
11 L 28 c 45 t 62 +
12 M 29 d 46 u 63 /
13 N 30 e 47 v
14 O 31 f 48 w (pad) =
15 P 32 g 49 x
16 Q 33 h 50 y
The output stream (encoded bytes) must be represented in lines of no
more than 76 characters each. All line breaks or other characters
not found in Table 1 must be ignored by decoding software. In base64
data, characters other than those in Table 1, line breaks, and other
white space probably indicate a transmission error, about which a
warning message or even a message rejection might be appropriate
under some circumstances.
Special processing is performed if fewer than 24 bits are available
at the end of the data being encoded. A full encoding quantum is
always completed at the end of a body. When fewer than 24 input bits
are available in an input group, zero bits are added (on the right)
to form an integral number of 6-bit groups. Padding at the end of
the data is performed using the '=' character. Since all base64
input is an integral number of octets, only the following cases can
\arise: (1) the final quantum of encoding input is an integral
multiple of 24 bits; here, the final unit of encoded output will be
an integral multiple of 4 characters with no "=" padding, (2) the
final quantum of encoding input is exactly 8 bits; here, the final
unit of encoded output will be two characters followed by two "="
padding characters, or (3) the final quantum of encoding input is
exactly 16 bits; here, the final unit of encoded output will be three
characters followed by one "=" padding character.
Because it is used only for padding at the end of the data, the
occurrence of any '=' characters may be taken as evidence that the
end of the data has been reached (without truncation in transit). No
such assurance is possible, however, when the number of octets
transmitted was a multiple of three.
Any characters outside of the base64 alphabet are to be ignored in
base64-encoded data. The same applies to any illegal sequence of
characters in the base64 encoding, such as "====="
Care must be taken to use the proper octets for line breaks if base64
encoding is applied directly to text material that has not been
converted to canonical form. In particular, text line breaks must be
converted into CRLF sequences prior to base64 encoding. The important
thing to note is that this may be done directly by the encoder rather
than in a prior canonicalization step in some implementations.
\NOTE: There is no need to worry about quoting apparent
encapsulation boundaries within base64-encoded parts of multipart
entities because no hyphen characters are used in the base64
encoding.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLMIME_INCLUDED /* Allow multiple inclusions */
#define SFLMIME_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
size_t encode_base64 (const void *source, void *target, size_t source_size);
size_t decode_base64 (const void *source, void *target, size_t source_size);
Bool isbase64 (char c);
Bool decode_mime_time (const char *mime_date, long *date, long *time);
char *encode_mime_time (long date, long time);
char *get_mime_type (char *extension);
char *encode_quoted_string (char *target, size_t target_size, const byte *source,
const char *charset);
char *encode_mimeb_string (char *target, size_t target_size, const byte *source,
const char *charset);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflnode.h - Linked list functions, deprecated *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to maintain doubly-linked lists. You can
use these functions to work with lists of any structure. To
make this work, all structures must start with two pointers,
"void *next, *prev;". When you want to attach a linked-list
to another structure, declare the list head as a NODE. You
can then refer to this variable when you attach items to the
list head. The code sets the global node_unsafe to TRUE
whenever it is changing a list. NOTE: DEPRECATED IN FAVOUR
OF SFLLIST.C.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLNODE_INCLUDED /* Allow multiple inclusions */
#define SFLNODE_INCLUDED
/* The node descriptor simply contains two pointers. All blocks that are */
/* descriptors that are held in lists. We can (a) allocate a dummy node */
/* instead of a complete block for a list head, and (b) use the same list */
/* handling functions for all descriptors. */
typedef struct { /* Node descriptor */
void *next, *prev; /* for a doubly-linked list */
} NODE;
/* Global variables */
extern Bool
node_unsafe; /* TRUE if we're changing a list */
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
void *node_create (void *after, size_t size);
void node_destroy (void *node);
void *node_unlink (void *node);
void *node_relink (void *left, void *node, void *right);
void *node_relink_after (void *node, void *after);
void *node_relink_before (void *node, void *before);
#ifdef __cplusplus
}
#endif
/* Macros */
#define node_reset(node) (node)-> prev = (node)-> next = (node)
#endif
/*===========================================================================*
* *
* sfldir.h - Directory handling functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: The directory access functions provide a portable interface
to the system's file directory structure. In general these
functions are modelled around the UNIX opendir and readdir
functions, but they are also similar to the DOS interface.
These functions can fail on SVr4 if the <dirent.h> file
does not match the C library. Recompile with the switch
-D _USE_BSD_DIRENT and they should work a bit better.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLDIR_INCLUDED /* Allow multiple inclusions */
#define SFLDIR_INCLUDED
#if !(defined (NAME_MAX)) /* Posix uses NAME_MAX */
# if !(defined (MAXNAMLEN)) /* BSD uses MAXNAMLEN */
# if (defined (__WINDOWS__))
# define MAXNAMLEN 259 /* MSVC uses 259 */
# elif (defined (__MS_DOS__) && !defined LFN) /* Support for DRDOS LFN */
# define MAXNAMLEN 12 /* DOS uses 8.3 */
# else
# define MAXNAMLEN 255 /* And for everyone else, 255 */
# endif
# endif
# define NAME_MAX MAXNAMLEN
#endif
#define UID_CACHE_MAX 10 /* Max. different uid's we cache */
#define GID_CACHE_MAX 10 /* Max. different gid's we cache */
/* DOS-ish file attributes, provided as an alternative to the UNIX-ish */
/* file mode bits. Both fields are always filled-out as far as possible. */
/* These bits correspond to the normal DOS values. */
#define ATTR_RDONLY 0x01 /* Read only file */
#define ATTR_HIDDEN 0x02 /* Hidden file */
#define ATTR_SYSTEM 0x04 /* System file */
#define ATTR_SUBDIR 0x10 /* Subdirectory */
#define ATTR_MASK 0x17 /* All bits together */
/* For portability we need to define types for the various fields that */
/* stat() returns. If the compiler complains about these definitions, */
/* you need to add conditional definitions accordingly. SMOP. */
/* For now, I assume that DOES_UID defines the stat types correctly. */
/* Note that prelude.h already defines uid_t and gid_t. */
#if (!defined DOES_UID)
typedef unsigned short mode_t;
typedef unsigned short nlink_t;
#if (!defined __LCC__)
typedef long off_t;
#endif
#endif
/* Microsoft tends to use _stat instead of stat. */
#if (defined (_MSC_VER))
# define stat _stat
#endif
/* BeOS does not define S_IEXEC so we build this mask ourselves */
#if (!defined (S_IEXEC))
# define S_IEXEC 00100 /* Owner may execute */
#endif
/* We define DEFAULT_DIR as the default current directory, so that we */
/* can call open_dir() with a null or empty directory argument. On most */
/* systems this is ".". */
#if (defined (__VMS__))
# define DEFAULT_DIR " "
#else
# define DEFAULT_DIR "."
#endif
/* Under SVr4 it can happen that the <dirent.h> file does not match the */
/* C library. Typically the library readdir() function returns the BSD */
/* structure while the <dirent.h> file defines dirent using the System V */
/* standards. This is weird but apparently quite common. Solution: at */
/* compile-time, force the switch -D _USE_BSD_DIRENT, and we define our */
/* own BSD-like structure. Hey, I hate second-guessing the include files */
/* but if it's broke, you gotta fix it. This problem appears at least on */
/* SunOS, to our knowledge. */
#if (defined (_USE_BSD_DIRENT))
struct Dirent
{
unsigned long d_fileno; /* File number of entry */
unsigned short d_reclen; /* Length of this record */
unsigned short d_namlen; /* Length of string in d_name */
char d_name [255 + 1]; /* Maximum name length */
};
#else
# define Dirent dirent /* We'll always refer to Dirent */
#endif
/* Directory stream structure - this contains private fields starting */
/* with '_' and public fields. If you use the private fields, be warned */
/* that these may change as we see fit. If you add strings to this block, */
/* be sure to check fix_dir() and free_dir(). */
typedef struct
{
Bool _fixed; /* TRUE if processed by fix_dir() */
#if (defined (__UNIX__) || defined (__VMS_XOPEN) || defined (__OS2__))
DIR *_dir_handle; /* a directory handle */
struct Dirent /* and a file desc. structure, */
*_dir_entry; /* both transient blocks */
#elif (defined (WIN32)) /* Win32: */
HANDLE _dir_handle; /* a directory handle */
WIN32_FIND_DATA _dir_entry; /* and a file descriptor */
#elif (defined (_MSC_VER)) /* MSC Win16 */
long _dir_handle; /* a directory handle */
struct _find_t _dir_entry; /* and a file desc. structure */
#elif (defined (__TURBOC__))
struct ffblk /* a file desc. structure */
_dir_entry;
#elif (defined (__VMS__)) /* OpenVMS V5.x and lower */
long _dir_handle; /* lib$find_file context */
#endif
/* Public fields */
char *dir_name; /* Directory name + sep */
char *owner; /* File owner name */
char *group; /* File owner group name */
char *file_name; /* Name of the file */
time_t file_time; /* Time of modification for file */
off_t file_size; /* Size of the file */
mode_t file_mode; /* UNIX-ish permission bits */
byte file_attrs; /* MS-DOS-ish permission bits */
nlink_t file_nlink; /* Number of links to file */
} DIRST;
typedef struct _FILEINFO
{
struct _FILEINFO /* Pointer for the linked list */
*next,
*prev;
DIRST
dir; /* File information */
Bool
directory; /* TRUE if file is directory */
} FILEINFO;
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
Bool open_dir (DIRST *dir, const char *dir_name);
Bool read_dir (DIRST *dir);
Bool close_dir (DIRST *dir);
char *format_dir (DIRST *dir, Bool full);
int fix_dir (DIRST *dir);
int free_dir (DIRST *dir);
char *resolve_path (const char *path);
char *locate_path (const char *root, const char *path);
char *clean_path (const char *path);
LIST *load_dir_list (const char *dir_name, const char *sort);
void sort_dir_list (LIST *filelist, const char *sort);
FILEINFO *add_dir_list (LIST *filelist, const DIRST *dir);
void free_dir_list (LIST *filelist);
char *get_curdir (void);
int set_curdir (const char *path);
Bool file_matches (const char *filename, const char *pattern);
int make_dir (const char *path);
int remove_dir (const char *path);
qbyte dir_usage (const char *path, Bool recurse);
qbyte dir_files (const char *path, Bool recurse);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflslot.h - Time slot functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: The time-slot functions provide long-running programs with
a means to 'switch-on' and 'switch-off' depending on the time
of day, and day of year. The intention is that the user can
configure such programs to be active only between certain
hours, on certain days, etc. The time-slot functions work
with 'range' bitmaps for a day (in seconds) and a year (in
days), and provide functions to set, clear, and test these
ranges.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLSLOT_INCLUDED /* Allow multiple inclusions */
#define SFLSLOT_INCLUDED
#define MAX_DAY 366 /* Max. days in a normal year */
#define MAX_MIN 1440 /* Max. minutes in a normal day */
typedef byte year_range [46]; /* 366 bits (1 per day) */
typedef byte day_range [180]; /* 1440 bits (1 per minute) */
#ifdef __cplusplus
extern "C" {
#endif
void year_range_empty (byte *range);
void year_range_fill (byte *range);
int year_slot_set (byte *range, int day_from, int day_to);
int year_slot_clear (byte *range, int day_from, int day_to);
Bool year_slot_filled (const byte *range, int day);
void day_range_empty (byte *range);
void day_range_fill (byte *range);
int day_slot_set (byte *range, int min_from, int min_to);
int day_slot_clear (byte *range, int min_from, int min_to);
Bool day_slot_filled (const byte *range, int minute);
int date_to_day (long date);
int time_to_min (long time);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflsock.h - Socket handling functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to create, read, and write TCP and UDP
sockets. Encapsulates system dependencies. Tested under
MS Winsock, UNIX (Linux, AIX, SunOs), OpenVMS. Some of the
code in this module was based on the book "Internetworking
With TCP/IP Volume III: Client-Server Programming And
Applications BSD Socket Version" by Douglas E. Comer and
David L. Stevens, published 1993 by Prentice-Hall Inc.
ISBN 0-13-020272-X. Defines sock_t which you should use
for all sockets. If you need to call a native socket
function, use a (SOCKET) cast on the sock_t handle.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLSOCK_INCLUDED /* Allow multiple inclusions */
#define SFLSOCK_INCLUDED
/*---------------------------------------------------------------------------
* Non-portable definitions - currently for Winsocks
* winsock.h is included in the prelude.h file.
*/
#if (defined (__WINDOWS__))
# define sockerrno winsock_last_error ()
# undef INVALID_SOCKET /* MSVC defines it in winsock.h */
# if (defined (WIN32) && defined (_MSC_VER))
# pragma comment (lib, "wsock32")
# if defined (FD_SET)
# undef FD_SET
# define FD_SET(fd, set) do { \
if (((fd_set FAR *)(set))->fd_count < FD_SETSIZE \
&& !FD_ISSET ((fd), (set))) \
((fd_set FAR *)(set))-> fd_array [((fd_set FAR *)(set))->fd_count++] \
= (fd);\
} while(0)
# endif
# endif
#else
# define sockerrno errno /* Use sockerrno for error number */
# undef SOCKET_ERROR
# define SOCKET_ERROR -1 /* Error on socket function */
typedef int SOCKET; /* Use (SOCKET) for system calls */
#endif
/*---------------------------------------------------------------------------
* Standard TCP/IP constants
*/
#define DNS_PORT 53 /* Domain Name server port */
/*---------------------------------------------------------------------------
* Define the socket type 'sock_t' and various types and constants.
*/
typedef qbyte sock_t; /* Use sock_t for all sockets */
/* Argument sizes are "int", on most systems, even though negative values
* do not make sense. GNU libc 2 (aka Linux libc6) changed argument sizes
* to be "socklen_t", ie unsigned int, at least as of GNU libc 2.0.7.
* OpenVMS Dec C defines these as "unsigned int".
*/
#if (defined (__GLIBC__) && (__GLIBC__ > 1))
typedef socklen_t argsize_t; /* GNU libc: size arg for sock func */
#elif (defined (__VMS__) && !defined (vaxc))
typedef unsigned int argsize_t; /* OpenVMS: size arg for sock func */
#else
typedef int argsize_t; /* Traditional: size for sock func */
#endif
#undef INVALID_SOCKET
#define INVALID_SOCKET (sock_t) -1 /* Invalid socket handle */
#undef SOCKET_LOOPBACK
#define SOCKET_LOOPBACK 0x7f000001L /* Loopback address 127.0.0.1 */
/*---------------------------------------------------------------------------
* Fake socket definitions
*
* If the system does not support sockets, we'll fake it so that the code
* still works. Under crippleware OS's this will work so that all devices
* are always ready for I/O. Most of this code is adapted from the Linux
* time.h file. We also define some useful structures.
*/
#if (!defined (DOES_SOCKETS))
# undef INADDR_ANY
# define INADDR_ANY 0
/* If FAKE_SOCKETS is set, sflsock will fake basic socket i/o */
# define FAKE_SOCKETS 1
/* Number of descriptors that can fit in an `fd_set'. */
# undef FD_SETSIZE
# define FD_SETSIZE 256
/* It's easier to assume 8-bit bytes than to get CHAR_BIT. */
# define NFDBITS (sizeof (unsigned long int) * 8)
# define __FDELT(d) ((d) / NFDBITS)
# define __FDMASK(d) (1 << ((d) % NFDBITS))
# define FD_ZERO(set) ((void) memset((void *) (set), 0, sizeof(fd_set)))
# define FD_SET(d,set) ((set)->__bits[__FDELT(d)] |= __FDMASK(d))
# define FD_CLR(d,set) ((set)->__bits[__FDELT(d)] &= ~__FDMASK(d))
# define FD_ISSET(d,set) ((set)->__bits[__FDELT(d)] & __FDMASK(d))
/* Fake the inet conversion functions */
# define inet_addr(x) 1
# define inet_ntoa(x) "127.0.0.1"
# if (0)
/* Define the fd_set structure for select() */
typedef struct {
qbyte __bits [(FD_SETSIZE + (NFDBITS - 1)) / NFDBITS];
} fd_set;
/* Define the timeval structure for select() */
struct timeval {
long tv_sec; /* Seconds */
long tv_usec; /* Microseconds */
};
# endif
# undef AF_INET
# define AF_INET 0
/* Define net-to-host conversion macros */
# if (!defined ntohs)
# if (defined __MSDOS__)
# define ntohs(x) (((x) & 0xff00U) >> 8) + \
(((x) & 0x00ffU) << 8)
# define ntohl(x) (((x) & 0xff000000UL) >> 24) + \
(((x) & 0x00ff0000UL) >> 8 ) + \
(((x) & 0x0000ff00UL) << 8 ) + \
(((x) & 0x000000ffUL) << 24)
# define htons(x) ntohs(x)
# define htonl(x) ntohl(x)
# else
# define ntohs(x) (x)
# define ntohl(x) (x)
# define htons(x) (x)
# define htonl(x) (x)
# endif /* msdos */
# endif
#endif /* Define fake sockets */
/*---------------------------------------------------------------------------
* Fix for BeOS and other systems which don't have a working select() function.
*/
#if (defined FAKE_SOCKETS || defined __UTYPE_BEOS)
/* Fake a select() function that just returns 1 */
# define select(n,rf,wf,xf,t) 1
#endif
/*---------------------------------------------------------------------------
* Definitions for compilers which don't have net support
* in their header libraries. Expand as required.
*/
#if (defined __UTYPE_BEOS)
struct protoent { /* Protocol entry */
char *p_name;
char **p_aliases;
int p_proto;
};
struct protoent *getprotobynumber (int);
struct protoent *getprotobyname (const char *);
struct servent *getservbyport (int, const char *);
#endif
/*---------------------------------------------------------------------------
* Required definitions
*
* These are symbols used by calling programs: if the compiler does not
* define them, we do it.
*/
#if (!defined (EWOULDBLOCK)) /* BSD tends to use EWOULDBLOCK */
# if (defined (__WINDOWS__))
# define EWOULDBLOCK WSAEWOULDBLOCK
# else
# define EWOULDBLOCK -1
# endif
#endif
#if (!defined (EINPROGRESS)) /* Return code for asynch I/O */
# if (defined (__WINDOWS__))
# define EINPROGRESS WSAEINPROGRESS
# else
# define EINPROGRESS EWOULDBLOCK
# endif
#endif
#if (!defined (EAGAIN)) /* Return code for asynch I/O */
# define EAGAIN EWOULDBLOCK
#endif
#if (!defined (EPIPE)) /* Return code for closed socket */
# define EPIPE -1
#endif
#if (!defined (ECONNRESET)) /* Return code for closed socket */
# if (defined (__WINDOWS__))
# define ECONNRESET WSAECONNRESET
# else
# define ECONNRESET EPIPE
# endif
#endif
#if (defined (__UTYPE_HPUX))
# define FD_SETTYPE (int *) /* Some systems use the older */
#else /* select() format */
# define FD_SETTYPE /* Most use fd_set's */
#endif
#if (!defined (MAXHOSTNAMELEN)) /* Some guys don't define this */
# define MAXHOSTNAMELEN 256 /* constant */
#endif
#if (!defined (INADDR_NONE)) /* Some guys don't define this */
# define INADDR_NONE -1 /* constant */
#endif
/*---------------------------------------------------------------------------
* Error values returned by connect_error(). These reflect the last problem
* detected by one of the passive/connect connection functions.
*/
#define IP_NOERROR 0 /* No errors */
#define IP_NOSOCKETS 1 /* Sockets not supported */
#define IP_BADHOST 2 /* Host not known */
#define IP_BADSERVICE 3 /* Service or port not known */
#define IP_BADPROTOCOL 4 /* Invalid protocol specified */
#define IP_SOCKETERROR 5 /* Error creating socket */
#define IP_CONNECTERROR 6 /* Error making connection */
#define IP_BINDERROR 7 /* Error binding socket */
#define IP_LISTENERROR 8 /* Error preparing to listen */
#ifdef __cplusplus
extern "C" {
#endif
/*---------------------------------------------------------------------------
* The ip_portbase is added to the port number when creating a service;
* you can set this variable before calling passive_TCP or passive_UDP.
*/
extern int
ip_portbase;
/*---------------------------------------------------------------------------
* The ip_nonblock flag determines whether sockets are blocking or not.
* Under Windows sockets are never blocking. Under UNIX they may be, or
* not. For portability to Windows, this flag is set to TRUE by default.
* The main consequence of this is that after a connect_xxx() call you may
* need to perform a select() on the socket for writing to determine when
* the connection has suceeded.
*/
extern Bool
ip_nonblock;
/*---------------------------------------------------------------------------
* The connect_errlist table provides messages for the connect_error()
* values.
*/
extern char
*connect_errlist [];
/*---------------------------------------------------------------------------
* The ip_passive address is used for passive socket connections. Initially
* this is set to INADDR_ANY. It is used for one passive socket creation
* and reset to INADDR_ANY thereafter.
*/
extern qbyte
ip_passive;
extern int
ip_sockets; /* Number of open sockets */
/*---------------------------------------------------------------------------
* Function prototypes
*/
int sock_init (void);
int sock_term (void);
sock_t passive_TCP (const char *service, int queue);
sock_t passive_UDP (const char *service);
sock_t passive_socket (const char *service, const char *protocol,
int queue);
sock_t connect_TCP (const char *host, const char *service);
sock_t connect_UDP (const char *host, const char *service);
sock_t connect_TCP_fast (const struct sockaddr_in *sin);
sock_t connect_UDP_fast (const struct sockaddr_in *sin);
sock_t connect_socket (const char *host, const char *service, const char
*protocol, const struct sockaddr_in *sin,
int retry_max, int retry_delay);
int connect_to_peer (sock_t handle,
const struct sockaddr_in *sin);
int connect_error (void);
sock_t accept_socket (sock_t master);
sock_t create_socket (const char *protocol);
int address_end_point (const char *host, const char *service, const
char *protocol, struct sockaddr_in *sin);
int get_sock_addr (sock_t handle, struct sockaddr_in *sin,
char *name, int namesize);
int get_peer_addr (sock_t handle, struct sockaddr_in *sin,
char *name, int namesize);
void build_sockaddr (struct sockaddr_in *sin, qbyte host, dbyte port);
char *socket_localaddr (sock_t handle);
char *socket_peeraddr (sock_t handle);
Bool socket_is_alive (sock_t handle);
int socket_error (sock_t handle);
int socket_nodelay (sock_t handle);
int read_TCP (sock_t handle, void *buffer, size_t length);
int write_TCP (sock_t handle, const void *buffer, size_t length);
int read_UDP (sock_t handle, void *buffer, size_t length,
const struct sockaddr_in *sin);
int write_UDP (sock_t handle, const void *buffer, size_t length,
const struct sockaddr_in *sin);
int close_socket (sock_t handle);
int sock_select (int nfds, fd_set *readfds, fd_set *writefds,
fd_set *errorfds, struct timeval *timeout);
char *get_hostname (void);
qbyte get_hostaddr (void);
qbyte *get_hostaddrs (void);
const char *sockmsg (void);
Bool socket_is_permitted (const char *address, const char *mask);
char *sock_ntoa (qbyte address);
char *get_host_file (void);
int get_name_server (struct sockaddr_in *ns_address, int ns_max);
#if (defined (__WINDOWS__))
int winsock_last_error (void);
#endif
#ifdef __cplusplus
}
#endif
/* Macros for compatibility with previous versions */
#define socket_hostaddr(handle) socket_peeraddr (handle)
#endif /* Include sflsock.h */
/*===========================================================================*
* *
* $(filename) - $(description) *
* *
* $(project) $(version) *
* $(copyright) *
* *
* $(license) *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Functions to format and send SMTP messages. Messages
can contain attachments, and be sent with "cc"'s "bcc"'s as
well as the normal "to" receivers.
------------------------------------------------------------------</Prolog>-*/
#ifndef _sflmail_included /* allow multiple inclusions */
#define _sflmail_included
typedef struct SMTP {
char *strSmtpServer;
char *strMessageBody;
char *strHtmlMessageBody;
char *strSubject;
char *strSenderUserId;
char *strFullSenderUserId; /* to be filled with: "realname" <e-mail> */
char *strDestUserIds;
char *strFullDestUserIds; /* to be filled with: "realname" <e-mail> */
char *strCcUserIds;
char *strFullCcUserIds; /* to be filled with: "realname" <e-mail> */
char *strBccUserIds;
char *strFullBccUserIds;
char *strRetPathUserId;
char *strRrcpUserId;
char *strMsgComment;
char *strMailerName;
char *strBinFiles;
char *strTxtFiles;
char strlast_smtp_message[513];
int debug;
char *strDebugFile;
int mime;
int encode_type;
int connect_retry_cnt;
int retry_wait_time;
char *strCharSet; /* Character Set (default is US-ASCII)*/
} SMTP;
/* Structure used in POP3 */
typedef struct POP_MSG {
char *from; /* Sender name */
char *subject; /* Subject of message */
char *body; /* Body of message */
long date; /* Date of message */
long time; /* Time of message */
long size; /* Total size of message */
Bool multipart;
} POP_MSG;
typedef struct POP3 {
Bool leave_on_server; /* Leave message on server */
long nb_messages; /* Number of messages */
long total_size; /* Total message size */
POP_MSG **messages; /* Table of messages */
sock_t handle; /* Handle of tcp/ip socket */
int message_max_size; /* Max size for message in KBytes */
} POP3;
/* SMTP Error value */
#define SMTP_NO_ERROR 0
#define SMTP_ERROR_CONNECT 1
#define SMTP_ERROR_INIT 2
#define SMTP_ERROR_INVALID_SENDER 3
#define SMTP_ERROR_INVALID_RECEIPT_USER 4
#define SMTP_ERROR_INVALID_DATA 5
#define SMTP_ERROR_MISSING_ATTACH_FILE 6
#define SMTP_ERROR_ON_CLOSE 7
#define SMTP_ERROR_ON_QUIT 8
#define SMTP_ERROR_MISSING_DESTINATION 9
#define SMTP_ERROR_MISSING_SUBJECT 10
#define SMTP_ERROR_MISSING_SERVER_NAME 11
#define SMTP_ERROR_MEMORY 12
#define MAX_SMTP_ERROR 13
#define ENCODE_BASE64 0
#define ENCODE_UUENCODE 1
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
int smtp_send_mail_ex (SMTP *smtp);
int smtp_send_mail (char *strSmtpServer, char *strMessageBody,
char *strSubject, char *strSenderUserId,
char *strFullSenderUserId, char *strDestUserIds,
char *strFullDestUserIds, char *strCcUserIds,
char *strFullCcUserIds, char *strBccUserIds,
char *strFullBccUserIds, char *strRetPathUserId,
char *strRrcpUserId, char *strMsgComment,
char *strMailerName, char *strBinFiles,
char *strTxtFiles, char *strDebugFile,
char *charset );
char *smtp_error_description (int error_value);
POP3 *pop3_begin (char *server, char *user, char *passw,
Bool secure, Bool leave_on_server,
int message_max_size);
int pop3_list_message (POP3 **context);
int pop3_get_message (POP3 **context, int message_nb);
int pop3_delete_message (POP3 **context, int message_nb);
Bool pop3_end (POP3 **context);
Bool pop3_free (POP3 **context);
void set_email_debug (Bool mode);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflsort.h - Sorting functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
#ifndef SFLSORT_INCLUDED /* Allow multiple inclusions */
#define SFLSORT_INCLUDED
/*- Function type for comparison function used for sorting ------------------*/
typedef int (*LIST_COMPARE) (LIST *t1, LIST *t2);
/*- Function prototypes -----------------------------------------------------*/
#ifdef __cplusplus
extern "C" {
#endif
void comb_sort (void *list, LIST_COMPARE comp);
char *build_sort_key (char *data, char *format);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflsha.c - message digest functions (SHA1) *
* *
* Note: contributed to the SFL, provenance not yet checked. *
* The copyright belongs to the original authors according to *
* their license agreement. Parts are copyright (c) 2003 iMatix *
* Corporation *
*===========================================================================*/
#ifndef _SFLSHA_INCLUDED /* Allow multiple inclusions */
#define _SFLSHA_INCLUDED
/*- Definitions -------------------------------------------------------------*/
#define SHA_DATA_SIZE 64
#define SHA_DIGEST_SIZE 20
/*- Structure ---------------------------------------------------------------*/
typedef struct {
qbyte digest [5]; /* Message digest */
qbyte data [16]; /* SHS data buffer */
qbyte count_low;
qbyte count_hi; /* 64-bit bit count */
} SHA_CONTEXT;
/*- Function prototypes -----------------------------------------------------*/
#ifdef __cplusplus
extern "C" {
#endif
void sha_init (SHA_CONTEXT *context);
void sha_update (SHA_CONTEXT *context, const byte *input,
const qbyte input_length);
void sha_final (SHA_CONTEXT *context, byte *digest);
byte *sha (const byte *input, const qbyte input_length, byte *digest);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflstr.h - String manipulation functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides various string-handling functions. Some of these
functions are available on some but not all platforms; others
are useful tools for string handling.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLSTR_INCLUDED /* Allow multiple inclusions */
#define SFLSTR_INCLUDED
/* Macro to prepare call to xstrcpy */
#if (defined (DEBUG))
# define xstrcpy_debug() { xstrcpy_file = __FILE__; xstrcpy_line = __LINE__;}
#else
# define xstrcpy_debug()
#endif
extern char *xstrcpy_file;
extern long xstrcpy_line;
/* Structure defines simple unsorted lookup table */
typedef struct {
char *key;
int value;
} LOOKUP;
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char *strdupl (const char *string);
char *strndupl (const char *string, const size_t length);
char **strfree (char **string);
char *strskp (const char *string);
char *strcset (char *string, char ch);
char *strpad (char *string, char ch, int length);
char *strlwc (char *string);
char *strupc (char *string);
char *strcrop (char *string);
char *stropen (char *string, Bool align);
char *strclose (char *string, Bool align);
char *strunique (char *string, char unique);
int strmatch (const char *string1, const char *string2);
qbyte strhash (const char *string);
Bool strprefixed (const char *string, const char *prefix);
char *strprefix (const char *string, const char *delims);
char *strdefix (const char *string, const char *prefix);
char *strconvch (char *string, char from, char to);
char *strconvchs (char *string, char from, char *to);
char *xstrcat (char *dest, const char *src, ...);
char *xstrcpy (char *dest, const char *src, ...);
int lexcmp (const char *string1, const char *string2);
int lexncmp (const char *string1, const char *string2,
const int count);
int lexwcmp (const char *string1, const char *string2);
char *soundex (const char *string);
char *soundexn (const char *string, int size, Bool fold);
DESCR *strt2descr (char **strings);
char **descr2strt (const DESCR *descr);
void strtfree (char **strings);
int strcntch (const char *string, char value);
int strlookup (const LOOKUP *lookup, const char *key);
char *strjustify (const char *source, size_t width);
char *strprefixlines (const char *source, const char *prefix);
char *strreformat (const char *source, size_t width, const char *prefix);
size_t xstrlcat (char *dst, const char *src, size_t siz);
size_t xstrlcpy (char *dst, const char *src, size_t siz);
char *replacechrswith (char *str, char *chrs, char ctorlcwth);
char *insertstring (char *str, char *chrstoins, int pos);
char *insertchar (char *str, char chrtoins, int pos);
char *leftfill (char *str, char chrtofill, unsigned len);
char *rightfill (char *str, char chrtofill, unsigned len);
char *searchreplace (char *str, char *strtofnd, char *strtoins, size_t max_length);
char *deletestring (char *str, char *strtodel, int ignorecase);
char *getstrfld (char *str, int fln, int ofset,
char *sep, char *ret);
char *setstrfld (char *str, int fln, int ofset,
char *sep, char *ins);
int getstrfldlen (char *str, int fln, int ofset, char *sep);
int matchtable (char *str, char *strmatch,
char *strsept, int ncse);
char *stringreplace (char *strbuf, char *strpattern, size_t max_length);
char *wordwrapstr (char *strbuff, int iwid);
char *stricstr (const char *str1, const char *str2);
int strtempcmp (const char *str1, const char *strPat);
Bool match_pattern (char *string, char *pattern, Bool ignore_case);
Bool is_text (const byte characters);
#ifdef __cplusplus
}
#endif
/* Macros & defines */
#define IGNORECASE 0
#define SENSECASE 1
#define lexeq(s1,s2) (!lexcmp ((s1), (s2)))
#define lexneq(s1,s2) (lexcmp ((s1), (s2)))
#endif
/*===========================================================================*
* *
* sflsymb.h - Symbol table functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Symbol lookup is by name. Symbols contain a string value
and a pointer to an caller-defined memory block.
The symbol-table functions let you create and manage symbol
tables. The functions are designed to be as general as
possible (to support a wide variety of applications), but at
the same time fast. The symbol table data structure is based
on a combined linked list & hash table representation. The
file sflsymb.h contains definitions for the various structures
and external functions used in the sflsymb.c. Both the
linked-list and hash-table representations have a guaranteed
order. In the linked-list, new symbols are pushed on to the
head of the list. In the hash table each bucket just contains
a pointer to a linked-list of symbols. When a new symbol is
created, it is pushed onto the front of this list. The reason
that both data structures are used is to make the algorithm
faster. Each representation has its stengths and weaknesses.
For instance, if you wanted to lookup a symbol table entry
for a given name using the hash table you could find it
immediately, whereas with the linked-list, you would need to
traverse most of the table to find the symbol. Some of these
functions are called through macros that add the filename and
line number of the call, for tracing. Do NOT call these
functions directly.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLSYMB_INCLUDED /* Allow multiple inclusions */
#define SFLSYMB_INCLUDED
/* Structure of a symbol */
typedef struct _SYMBOL {
struct _SYMBOL
*next, /* Next symbol in table */
*prev, /* Previous symbol in table */
*h_next, /* Next symbol in bucket */
*h_prev; /* Previous symbol in bucket */
char *name; /* Copy of name */
char *value; /* String value, or null */
void *data; /* Caller data, or null */
byte hash; /* Hash bucket # */
} SYMBOL;
#define SYM_HASH_SIZE 256 /* Assumed by sym_hash () */
/* Structure of a symbol table */
typedef struct {
SYMBOL *symbols; /* Pointer to list of symbols */
SYMBOL *hash [SYM_HASH_SIZE]; /* Table of hash buckets */
int size; /* Number of symbols defined */
} SYMTAB;
/* Function that handles a symbol */
typedef Bool (*symfunc) (SYMBOL *);
/* Function to compare two symbols, for sorting */
typedef int (*symsort) (const void *symb1, const void *symb2);
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
SYMTAB *sym_create_table_ (const char *source_file, size_t source_line);
void sym_delete_table (SYMTAB *symtab);
void sym_empty_table (SYMTAB *symtab);
int sym_merge_tables (SYMTAB *symtab, const SYMTAB *import);
SYMBOL *sym_lookup_symbol (const SYMTAB *symtab, const char *name);
SYMBOL *sym_create_symbol_ (SYMTAB *symtab, const char *name, const char *val,
const char *source_file, size_t source_line);
SYMBOL *sym_assume_symbol_ (SYMTAB *symtab, const char *name, const char *val,
const char *source_file, size_t source_line);
SYMBOL *sym_delete_symbol (SYMTAB *symtab, SYMBOL *symbol);
const char *sym_get_name (const SYMBOL *sym);
char *sym_get_value (const SYMTAB *symtab, const char *name,
const char *default_value);
long sym_get_number (const SYMTAB *symtab, const char *key,
const long default_value);
Bool sym_get_boolean (const SYMTAB *symtab, const char *key,
const Bool default_value);
void sym_set_value (SYMBOL *symbol, const char *value);
int sym_exec_all (const SYMTAB *symtab, symfunc handler);
int sym_hash (const char *name);
void sym_sort_table (SYMTAB *symtab, symsort sort_function);
char **symb2strt_ (const SYMTAB *symtab,
const char *source_file, size_t source_line);
SYMTAB *strt2symb_ (char **strings,
const char *source_file, size_t source_line);
DESCR *symb2descr_ (const SYMTAB *symtab,
const char *source_file, size_t source_line);
SYMTAB *descr2symb_ (const DESCR *descr,
const char *source_file, size_t source_line);
#ifdef __cplusplus
}
#endif
/*- Define macros to encapsulate calls to the hidden functions --------------*/
#if (defined (DEBUG))
# define sym_create_table() sym_create_table_ (__FILE__, __LINE__)
# define sym_create_symbol(t,n,v) sym_create_symbol_ ((t), (n), (v), \
__FILE__, __LINE__)
# define sym_assume_symbol(t,n,v) sym_assume_symbol_ ((t), (n), (v), \
__FILE__, __LINE__)
# define symb2strt(t) symb2strt_ ((t), __FILE__, __LINE__)
# define strt2symb(s) strt2symb_ ((s), __FILE__, __LINE__)
# define symb2descr(t) symb2descr_ ((t), __FILE__, __LINE__)
# define descr2symb(d) descr2symb_ ((d), __FILE__, __LINE__)
#else
# define sym_create_table() sym_create_table_ (NULL, 0)
# define sym_create_symbol(t,n,v) sym_create_symbol_ ((t), (n), (v), NULL, 0)
# define sym_assume_symbol(t,n,v) sym_assume_symbol_ ((t), (n), (v), NULL, 0)
# define symb2strt(t) symb2strt_ ((t), NULL, 0)
# define strt2symb(s) strt2symb_ ((s), NULL, 0)
# define symb2descr(t) symb2descr_ ((t), NULL, 0)
# define descr2symb(d) descr2symb_ ((d), NULL, 0)
#endif
#endif /* Include SFLSYMB.H */
/*===========================================================================*
* *
* sflproc.h - Process control functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to create and manage processes. The main
set of functions lets you create, monitor, and end processes.
A secondary function lets you run the current process as a
background process.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLPROC_INCLUDED /* Allow multiple inclusions */
#define SFLPROC_INCLUDED
/* Type definitions */
#if (defined (WIN32))
typedef struct {
HANDLE process;
DESCR *envd; /* Environment data */
} PROC_HANDLE;
typedef PROC_HANDLE *PROCESS; /* Process ID type */
#define NULL_PROCESS NULL /* and null process */
#elif (defined (__VMS__))
typedef struct {
long id;
long status;
} PROC_HANDLE;
typedef PROC_HANDLE *PROCESS; /* Process ID type */
#define NULL_PROCESS NULL /* and null process */
#else
typedef pid_t PROCESS; /* Process ID type */
# define NULL_PROCESS 0 /* and null process */
#endif
#define NULL_HANDLE -2 /* File handle set to nothing */
/* Process creation data structure -- contains all the information needed */
/* to create a new process, including I/O redirection, changing directories */
/* changing UID/GID. The uid/gid values are applicable only to unix. */
/* The rootdir option does a chroot() under unix, and a _chdir() under DOS, */
/* Windows, and OS/2 (which will also change drive). */
/* */
/* The macro PROCESS_DATA_INIT can be used to initialised this struct */
/* at variable declaration time. */
typedef struct {
/* Program name and arguments ----------------------------------------- */
/* The filename string can contain arguments (which will be parsed) */
/* if argv == NULL. If argv != NULL filename will not be parsed for */
/* arguments. */
/* The searchext field is relevant only to DOS-like systems, and lists */
/* extensions to try adding to the file to find it. The default is */
/* operating system specific, covering standard executable extensions. */
const char *filename;
char **argv;
const char *path; /* Override PATH, if not null */
const char *shell; /* Override default shell, if ! null*/
const char **searchext; /* Extensions to try, to find file */
Bool searchpath; /* Look in path for filename */
Bool useshell; /* Invoked via shell */
Bool createdaemon; /* Create daemon process (detached) */
Bool wait; /* Wait for process to finish */
int delay; /* ms to wait to see if exec worked */
/* Directories to change to ------------------------------------------- */
const char *rootdir; /* Dir to chroot() to, if not NULL */
const char *workdir; /* Work dir; done after any chroot()*/
/* I/O Redirection ---------------------------------------------------- */
/* A handle of NULL_HANDLE means "no change". */
/* no_handles specifies the number of handles that should be inherited */
/* by the child process, where this can be controlled (eg under unix, */
/* where handles above that number will be marked to close on exec()) */
int in;
int out;
int err;
int no_handles; /* File handles inherited; default 3*/
/* Environment -------------------------------------------------------- */
/* Default is to inherit the current environment, without change. This */
/* can either be replaced entirely by supplying envv != NULL, or things */
/* can be added/removed from the current environment to get a new one. */
char **envv; /* Whole replacement environment */
SYMTAB *envadd; /* Entries to add to environment */
SYMTAB *envrm; /* Keys to remove from environment */
/* Security ----------------------------------------------------------- */
/* If user name and group are not null, tries to run the process under */
/* the specified user name. Under Windows, the group name is the name */
/* of the domain. The password field is needed if the calling process */
/* does not run as a priviliged process. */
char *username;
char *groupname;
char *password;
Bool preserveroot; /* Retain root privileges? */
/* Output ------------------------------------------------------------- */
/* This section contains elements set by process_create_full(). */
PROCESS pid;
int returncode; /* Return code from process */
int error; /* Error code from functionc call */
} PROCESS_DATA;
/* Macros:
* FILEHANDLE_MAX Maximum possible number of open files
* PROCESS_DATA_INIT Process data structure (empty) initialisation
*/
/* getdtablesize () is not available on all systems */
#if (defined (__UNIX__))
# if (defined (__UTYPE_UNIXWARE))
# define FILEHANDLE_MAX sysconf (_SC_OPEN_MAX)
# elif (defined (__UTYPE_HPUX))
# define FILEHANDLE_MAX FD_SETSIZE
# elif (defined (__UTYPE_SINIX))
# define FILEHANDLE_MAX FD_SETSIZE
# else
# define FILEHANDLE_MAX getdtablesize ()
# endif
#elif (defined (FD_SETSIZE))
# define FILEHANDLE_MAX FD_SETSIZE
#else
# define FILEHANDLE_MAX 32 /* Arbitrary */
#endif
/* Usage: PROCESS_DATA myproc = PROCESS_DATA_INIT; */
#define PROCESS_DATA_INIT {\
/* Filename, args, */ NULL, NULL, NULL, NULL, NULL, \
/* flags */ FALSE, FALSE, FALSE, FALSE, 1000, \
/* Directories */ NULL, NULL, \
/* I/O redirection */ NULL_HANDLE, NULL_HANDLE, NULL_HANDLE, 3,\
/* Environment */ NULL, NULL, NULL, \
/* Security */ NULL, NULL, NULL, FALSE, \
/* Output */ NULL_PROCESS, 0, 0 \
}
/* Global variables */
#ifdef __cplusplus
extern "C" {
#endif
extern int process_errno; /* Last process exit code */
extern Bool process_compatible; /* Try to be compatible */
extern const char **sfl_default_ext; /* Default extensions */
PROCESS process_create_full (PROCESS_DATA *procinfo);
PROCESS process_create (const char *file, char *argv [], const char *dir,
const char *in, const char *out, const char *err,
char *envv [], Bool wait);
int process_setinfo (PROCESS_DATA *procinfo, const char *in,
const char *out, Bool scratch_out,
const char *err, Bool scratch_err);
int process_open_io (const char *filename, char access_type);
void process_close_io (PROCESS_DATA *procinfo);
int process_status (PROCESS process_id);
int process_kill (PROCESS process_id);
void process_close (PROCESS process_id);
int process_server (const char *workdir, const char *lockfile,
int argc, char *argv [], const char *sswitch []);
Bool process_alarm (long delay);
int process_sleep (qbyte msec);
char *process_esc (char *dest, const char *src);
char *process_unesc (char *dest, const char *src);
int process_priority (int priority);
#ifdef __cplusplus
}
#endif
/* Return values from process_status() */
#define PROCESS_RUNNING 0
#define PROCESS_ENDED_OK 1
#define PROCESS_ENDED_ERROR 2
#define PROCESS_INTERRUPTED 3
/* Values for process_priority() */
#define PRIORITY_LOW 0
#define PRIORITY_NORMAL 1
#define PRIORITY_HIGH 2
/* Is process_create_full() implemented? */
#if (defined (__UNIX__) || defined (__OS2__) || defined (WIN32))
# define DOES_FULL_PROCESS
#else
# undef DOES_FULL_PROCESS
#endif
/* Return values from process_sleep() */
#define PROCESS_SLEEP_OK 0
#define PROCESS_SLEEP_ERROR -1
#define PROCESS_SLEEP_INTR -2
#endif
/*===========================================================================*
* *
* sflprint.h - Printing functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides printing functions which may be absent on some
systems. In particular ensures that the system has
snprintf()/vsnprintf() functions which can be called. The
functions supplied here are not as good as the vender
supplied ones, but are better than having none at all.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLPRINT_INCLUDED /* Allow multiple inclusions */
#define SFLPRINT_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
#if (!defined (DOES_SNPRINTF))
int snprintf (char *str, size_t n, const char *format, ...);
int vsnprintf (char *str, size_t n, const char *format, va_list ap);
#endif
char *strprintf (const char *format, ...);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflsyst.h - System type identification *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides miscellaneous system-level functions.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLSYST_INCLUDED /* Allow multiple inclusions */
#define SFLSYST_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char *sys_name (Bool full);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflsearch.h - Full-text searching functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
*===========================================================================*/
#ifndef SFLSEARCH_INCLUDED /* Allow multiple inclusions */
#define SFLSEARCH_INCLUDED
/* Function types for accessing index sets. */
typedef BITS * (*INDEX_GET) (char *field, char *value, char type);
typedef int (*INDEX_PUT) (char *field, char *value, char type, BITS *bits, Bool create);
/* This structure holds a single search criterion, taken from a data
string (value, type are defined), or taken from a search query (all
properties are defined).
*/
typedef struct {
char *value; /* Criterion value */
char type; /* t=text, n=numeric, p=phonetic */
char method; /* '+'=or '*'=and '-'=not */
char scope; /* = eq > ge < le [ from ] to */
} SCRIT;
#define SEARCH_METHOD_OR '+'
#define SEARCH_METHOD_AND '*'
#define SEARCH_METHOD_NOT '-'
#define SEARCH_SCOPE_EQ '='
#define SEARCH_SCOPE_LE '<'
#define SEARCH_SCOPE_GE '>'
#define SEARCH_SCOPE_FROM '['
#define SEARCH_SCOPE_TO ']'
/* This structure holds a single index criterion, taken from a data
string (value, type are defined), and referring to an object id and
field name so that it can be sorted for building bitstrings.
*/
typedef struct {
qbyte itemid; /* Object identifier */
char *field; /* Name of field being indexed */
char *value; /* Criterion value */
char type; /* t=text, n=numeric, p=phonetic */
} ICRIT;
/* This structure holds an active search */
typedef struct {
char mode; /* * = all, + = any fields */
INDEX_GET loadfct; /* Function to read the index */
BITS *result_bits; /* Results set so far */
LIST *result_hits; /* Weighted results set */
long item_bit; /* For iterating through results */
LIST *item_hit; /* For iterating through results */
long count; /* Size of results set */
Bool weighted; /* If TRUE, sort results by weight */
Bool sorted; /* Do we still need to sort? */
} SEARCH;
/* This structure holds a search hit, in a list/set of hits */
typedef struct {
long itemid; /* Object identifier */
int weight; /* Total hits for this itemid */
} HIT; /* We assume the 'S' */
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
LIST *search_build_scrit (char *string, char decimal);
void search_free_scrit (LIST **scrit_list);
LIST *search_init_icrit (void);
void search_build_icrit (LIST *icrit_list, qbyte id, char *field, char *value);
long search_merge_icrit (LIST *icrit_list, INDEX_GET loadfct, INDEX_PUT savefct);
long search_unset_icrit (LIST *icrit_list, INDEX_GET loadfct, INDEX_PUT savefct);
void search_free_icrit (LIST **icrit_list);
SEARCH *search_open (Bool match_all, INDEX_GET loadfct);
void search_ordered (SEARCH *search, char *field, char *value, Bool mask);
void search_weighted (SEARCH *search, char *field, char *value, Bool mask);
long search_count (SEARCH *search);
long search_first (SEARCH *search);
long search_next (SEARCH *search);
void search_close (SEARCH *search);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflhttp.h - HTTP processing functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides various functions that support HTTP and CGI
programming, including escaping/unescaping, and CGI data
manipulation.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLHTTP_INCLUDED /* Allow multiple inclusions */
#define SFLHTTP_INCLUDED
/* Macro's and defines */
/* Macro to free up the input line that GetCgiInput created. */
#define cgi_free_input(strBuf) free((strBuf))
/* Defines for input methods. */
#define CGIGET 0
#define CGIPOST 1
#define CGIETHER 2
typedef struct _UPLOADFILE
{
char file_name [255]; /* File name */
char mime_type [255]; /* Mime type of file */
long size; /* Size of file data */
byte *data; /* File data */
} UPLOADFILE;
/* Structure to represent the authority component of http and https urls */
typedef struct {
char
*host;
int
port;
} URL_HTTP;
/* Structure to represent generic URLs as per RFC 2396 */
typedef struct {
char
*scheme,
*authority,
*path,
*query,
*fragment;
URL_HTTP
*http; /* HTTP authority components */
} URL;
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char *http_escape (const char *string, char *result,
size_t outmax);
char *http_escape_hex (const char *string, char *result,
size_t outmax);
size_t http_escape_size (const char *string);
char *http_escape_bin (const byte *string, size_t string_size,
char *result, size_t outmax);
size_t http_escape_bin_size (const byte *string, size_t string_size);
char *http_unescape (char *string, char *result);
char *http_unescape_hex (char *string, char *result);
char **http_query2strt (const char *query);
SYMTAB *http_query2symb (const char *query);
DESCR *http_query2descr (const char *query);
size_t http_encode_meta (char *output, char **input,
size_t outmax, Bool html);
size_t encode_meta_char (char *output, char meta_char,
size_t outmax, Bool html);
size_t http_decode_meta (char *output, char **input, size_t outmax);
char decode_meta_charn (const char *meta_char, size_t length);
int cgi_parse_query_vars (SYMTAB *symtab, const char *query,
const char *prefix);
int cgi_parse_file_vars (SYMTAB *symtab, FILE *file, const char *prefix,
size_t size);
DESCR *http_multipart_decode (const char *mime_file, const char *store_path,
const char *local_format);
int http_multipart_mem (const byte *buffer, const long buffer_size,
SYMTAB ** form_field, SYMTAB **files);
Bool is_full_url (const char *string);
char *build_full_url (const char *uri, const char *base_uri);
char *http_time_str (void);
UPLOADFILE *alloc_upload (char *file_name, char *mime_type, long size,
byte *data);
void free_upload (UPLOADFILE *file_uploaded);
URL_HTTP *url_http_new (void);
void url_http_free (URL_HTTP *http);
URL *url_new (void);
void url_free (URL *url);
URL *url_from_string (const char *string);
char *url_to_string (const URL *url);
#ifdef __cplusplus
}
#endif
#define decode_meta_char(string) decode_meta_charn (string, sizeof (string))
#endif
/*===========================================================================*
* *
* sflini.h - Configuration file processing *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to read an initialisation file that follows
the MS-Windows style, i.e. consists of [Sections] followed by
keyword = value lines.
------------------------------------------------------------------</Prolog>-*/
#ifndef SLFINI_INCLUDED /* Allow multiple inclusions */
#define SLFINI_INCLUDED
#ifdef __cplusplus
extern "C" {
#endif
Bool ini_find_section (FILE *inifile, char *section, Bool top);
Bool ini_scan_section (FILE *inifile, char **keyword, char **value);
SYMTAB *ini_dyn_load (SYMTAB *symtab, const char *filename);
SYMTAB *ini_dyn_loade (SYMTAB *symtab, const char *filename);
int ini_dyn_save (SYMTAB *symtab, const char *filename);
Bool ini_dyn_changed (SYMTAB *symtab);
Bool ini_dyn_refresh (SYMTAB *symtab);
char *ini_dyn_value (SYMTAB *symtab, const char *section,
const char *keyword, const char *default_value);
char **ini_dyn_values (SYMTAB *symtab, const char *section,
const char *keyword, const char *default_value);
char *ini_dyn_assume (SYMTAB *symtab, const char *section,
const char *keyword, const char *default_value);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflenv.h - Environment manipulation *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to read environment variables (also called
shell variables or logical variables.) Provides translation
into numeric and Boolean values. Provides functions to work
with the environment block.
------------------------------------------------------------------</Prolog>-*/
#ifndef _SFLENV_INCLUDED /* Allow multiple inclusions */
#define _SFLENV_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char *env_get_string (const char *name, const char *default_value);
long env_get_number (const char *name, long default_value);
Bool env_get_boolean (const char *name, Bool default_value);
DESCR *env2descr (void);
char **descr2env (const DESCR *descr);
SYMTAB *env2symb (void);
char **symb2env (const SYMTAB *symtab);
char **env_copy (char **environment);
int env_set (const char *name, const char *value, int overwrite);
void env_clear (const char *name);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sfltok.h - String tokenisation *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to break strings into tokens and handle
symbol substitution in strings.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLTOK_INCLUDED /* Allow multiple inclusions */
#define SFLTOK_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char **tok_split (const char *string);
char **tok_split_ex (const char *string, char separator);
char **tok_split_rich (const char *string, const char *delims);
void tok_free (char **token_list);
char **tok_push (char **token_list, const char *string);
int tok_size (char **token_list);
size_t tok_text_size (char **token_list);
char *tok_subst (const char *string, SYMTAB *symbols);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sfltree.h - Binary trees *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to maintain 'Red-Black' balanced binary
trees. You can use these functions to work with trees of any
structure. To make this work, all structures must start with
the following: "void *left, *right, *parent; TREE_COLOUR
colour;". All trees need a pointer to the root of type TREE
which should be initialised with tree_init - you can test
whether a tree is empty by comparing its root with TREE_NULL.
The order of nodes in the tree is determined by calling a
node comparison function provided by the caller - this
accepts two node pointers and returns zero if the two nodes
are equal, -1 if the first is smaller and 1 if the first is
larger.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLTREE_INCLUDED /* Allow multiple inclusions */
#define SFLTREE_INCLUDED
/* Red-Black tree description */
typedef enum {BLACK, RED} TREE_COLOUR;
/* Node descriptor */
typedef struct _TREE {
struct _TREE
*left, *right, *parent;
TREE_COLOUR
colour;
} TREE;
/* The tree algorithm needs to know how to sort the data. It does this */
/* using a functions provided by the calling program. */
typedef int (TREE_COMPARE) (void *t1, void *t2);
/* Define a function type for use with the tree traversal function */
typedef void (TREE_PROCESS) (void *t);
/* Global variables */
extern TREE
TREE_EMPTY;
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
void tree_init (TREE **root);
int tree_insert (TREE **root, void *tree, TREE_COMPARE *comp,
Bool allow_duplicates);
void tree_delete (TREE **root, void *tree);
void *tree_find_eq (TREE **root, void *tree, TREE_COMPARE *comp);
void *tree_find_lt (TREE **root, void *tree, TREE_COMPARE *comp);
void *tree_find_le (TREE **root, void *tree, TREE_COMPARE *comp);
void *tree_find_gt (TREE **root, void *tree, TREE_COMPARE *comp);
void *tree_find_ge (TREE **root, void *tree, TREE_COMPARE *comp);
void tree_traverse (void *tree, TREE_PROCESS *process, int method);
void *tree_next (void *tree);
void *tree_prev (void *tree);
void *tree_first (void *tree);
void *tree_last (void *tree);
#ifdef __cplusplus
}
#endif
/* Return codes */
#define TREE_DUPLICATE -1
#define TREE_OK 0
/* Macros */
#define TREE_NULL &TREE_EMPTY
#endif
/*===========================================================================*
* *
* sfltron.h - Tracing functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions for a programmer who needs to insert
long-term tracing code in software. The tracing code is
activated and disactivated at run-time, for instance when
problems are suspected.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLTRON_INCLUDED /* Allow multiple inclusions */
#define SFLTRON_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
void enable_trace (void);
void disable_trace (void);
void push_trace (Bool new_state);
void pop_trace (void);
void set_trace_file (const char *filename, char mode);
void trace (const char *format, ...);
#ifdef __cplusplus
}
#endif
/* External variables */
extern Bool TraceState; /* TRUE or FALSE */
extern FILE *TraceFile; /* Current trace output file */
#endif
/*===========================================================================*
* *
* sfluid.h - User and group ID functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to access user and group id names and
manage the current real/effective uid's and gid's for a
process. These functions are only meaningful on UNIX
systems, and partially on VMS systems, but may be used by
portable programs that must operate under UNIX as well as
other environments. Some uid functions are non-portable
between UNIX systems; this package provides a single API.
Changes for OS/2 were done by Ewen McNeill <ewen@naos.co.nz>.
------------------------------------------------------------------</Prolog>-*/
#ifndef SFLUID_INCLUDED /* Allow multiple inclusions */
#define SFLUID_INCLUDED
/* Function prototypes */
#ifdef __cplusplus
extern "C" {
#endif
char *get_uid_name (uid_t uid);
char *get_gid_name (gid_t gid);
int set_uid_user (void);
int set_uid_root (void);
int set_gid_user (void);
int set_gid_root (void);
int set_uid_gid (char *new_uid, char *new_gid);
char *get_login (void);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflxml.h - XML navigation functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to read and write XML files, and manipulate
XML data in memory as list structures. XML is the Extensible
Markup Language. Accepts this XML syntax:
<item [attr=["]value["]]...>value [child]</item>
------------------------------------------------------------------</Prolog>-*/
#ifndef SLFXML_INCLUDED /* Allow multiple inclusions */
#define SLFXML_INCLUDED
/* -------------------------------------------------------------------------
An XML tree is built as the following recursive structure:
.---------. .----------.
.-: Attr :<-->: 0..n : Attributes are not sorted.
.----------. : : Head : : attrs :
: Item :-' `---------' `----------'
: node :-. .---------. .----------.
`----------' : : Child/ :<-->: 0..n : Each child node is the root
`-: Value : : children : of its own tree of nodes.
`---------' `----------'
------------------------------------------------------------------------- */
/*- Structure definitions -------------------------------------------------- */
typedef struct _XML_ITEM XML_ITEM;
typedef struct _XML_ATTR XML_ATTR;
/*- Function prototypes ---------------------------------------------------- */
#ifdef __cplusplus
extern "C" {
#endif
/* XML item functions */
XML_ITEM *_xml_new (XML_ITEM *parent,
const char *name,
const char *value,
Bool duplicate);
#define xml_new(parent, name, value) _xml_new(parent, name, value, TRUE)
#define xml_new_no_dup(parent, name, value) _xml_new(parent, name, value, FALSE)
#define xml_new_child(parent, name) _xml_new(parent, name, NULL, TRUE)
#define xml_new_value(parent, value) _xml_new(parent, NULL, value, TRUE)
XML_ITEM *_xml_create (const char *name,
const char *value,
Bool duplicate);
#define xml_create(name, value) _xml_create(name, value, TRUE)
#define xml_create_no_dup(name, value) _xml_create(name, value, FALSE)
void xml_modify_value (XML_ITEM *item,
const char *value);
void xml_rename (XML_ITEM *item,
const char *name);
char *xml_item_name (XML_ITEM *item);
char *xml_item_value (XML_ITEM *item);
char *xml_item_child_value (XML_ITEM *item);
void *xml_get_data (XML_ITEM *item);
void xml_set_data (XML_ITEM *item,
void *data);
void xml_free (XML_ITEM *item);
/* XML tree manipulation */
void xml_attach_child (XML_ITEM *parent, XML_ITEM *item);
void xml_attach_sibling (XML_ITEM *sibling, XML_ITEM *item);
void xml_detach (XML_ITEM *item);
int xml_copy (XML_ITEM *to, XML_ITEM *from);
/* XML family navigation */
XML_ITEM *xml_first_child (XML_ITEM *item);
XML_ITEM *xml_last_child (XML_ITEM *item);
XML_ITEM *xml_next_sibling (XML_ITEM *item);
XML_ITEM *xml_prev_sibling (XML_ITEM *item);
XML_ITEM *xml_parent (XML_ITEM *item);
/* XML tree traversal */
typedef Bool (*xmlfunc) (XML_ITEM *);
int xml_exec_all (XML_ITEM *item, xmlfunc handler);
/* XML path navigation */
XML_ITEM *xml_find_item (XML_ITEM *xml_root,
const char *p_path);
/* XML attribute functions */
int xml_put_attr_ic (XML_ITEM *item,
const char *name,
const char *value,
Bool ignore_case,
Bool duplicate);
XML_ATTR *xml_attr_ic (XML_ITEM *item,
const char *name,
Bool ignore_case);
char *xml_attr_name (XML_ATTR *item);
char *xml_attr_value (XML_ATTR *item);
char *xml_get_attr_ic (XML_ITEM *item,
const char *name,
const char *deflt,
Bool ignore_case);
void xml_free_attr (XML_ATTR *attr);
#define xml_put_attr(item, name, value) \
xml_put_attr_ic (item, name, value, FALSE, TRUE)
#define xml_put_attr_no_dup(item, name, value) \
xml_put_attr_ic (item, name, value, FALSE, FALSE)
#define xml_attr(item, name) \
xml_attr_ic (item, name, FALSE)
#define xml_get_attr(item, name, dflt) \
xml_get_attr_ic (item, name, dflt, FALSE)
/* XML attribute navigation */
XML_ATTR *xml_first_attr (XML_ITEM *item);
XML_ATTR *xml_last_attr (XML_ITEM *item);
XML_ATTR *xml_next_attr (XML_ATTR *attr);
XML_ATTR *xml_prev_attr (XML_ATTR *attr);
/* XML housekeeping functions */
Bool xml_changed (XML_ITEM *item);
Bool xml_refresh (XML_ITEM **item);
/* Macros to treat all children and all attributes */
#define FORCHILDREN(child,item) for (child = xml_first_child (item); \
child != NULL; \
child = xml_next_sibling (child)) \
if (xml_item_name (child))
#define FORVALUES(child,item) for (child = xml_first_child (item); \
child != NULL; \
child = xml_next_sibling (child)) \
if (!xml_item_name (child))
#define FORATTRIBUTES(attr,item) for (attr = xml_first_attr (item); \
attr != NULL; \
attr = xml_next_attr (attr))
/* functions for generated XML parser. */
XML_ITEM *alloc_xml_item (void);
Bool set_xml_item_name (XML_ITEM *item, char *name);
Bool set_xml_item_value (XML_ITEM *item, char *value);
Bool link_xml_child (XML_ITEM *parent, XML_ITEM *item);
Bool check_xml_closing_name (XML_ITEM *item, char *name);
XML_ATTR *alloc_xml_attr (void);
Bool set_xml_attr_name (XML_ATTR *attr, char *name);
Bool set_xml_attr_value (XML_ATTR *attr, char *value);
Bool link_xml_attr (XML_ITEM *item, XML_ATTR *attr);
#ifdef __cplusplus
}
#endif
#endif
/*===========================================================================*
* *
* sflxmll.h - XML loading and saving functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/* ----------------------------------------------------------------<Prolog>-
Synopsis: Provides functions to load and save XML files. An XML file
is held in memory as a tree of nodes, of type XML_ITEM. The
XML functions do not currently accept DTDs in the XML data.
------------------------------------------------------------------</Prolog>-*/
#ifndef SLFXMLL_INCLUDED /* Allow multiple inclusions */
#define SLFXMLL_INCLUDED
/*- Function prototypes ---------------------------------------------------- */
#ifdef __cplusplus
extern "C" {
#endif
/* Error values */
#define XML_NOERROR 0 /* No errors */
#define XML_FILEERROR 1 /* Error in file i/o */
#define XML_LOADERROR 2 /* Error loading XML */
/* Function prototypes */
int xml_seems_to_be (const char *path, const char *filename);
char *xml_error (void);
int xml_load_file (XML_ITEM **item, const char *path, const char *filename, Bool extend);
int xml_save_file (XML_ITEM *item, const char *filename);
int xml_load_string (XML_ITEM **item, const char *xmlstring, Bool extend);
char *xml_save_string (XML_ITEM *item);
int xml_load_descr (XML_ITEM **item, const DESCR *descr, Bool extend);
DESCR *xml_save_descr (XML_ITEM *item);
SYMTAB *xml_load_symtab (SYMTAB *load_symtab, XML_ITEM *xml_root, const char *path);
SYMTAB *xml_load_symtab_file (SYMTAB *load_symtab, const char *filename, const char *path);
/* Macros */
#define xml_load_extended(item, path, filename) xml_load_file (item, path, filename, TRUE)
#define xml_load(item, path, filename) xml_load_file (item, path, filename, FALSE)
#ifdef __cplusplus
}
#endif
#endif /* Included */
/*===========================================================================*
* *
* sflxmls.h - XML Store functions *
* *
* Copyright (c) 1991-2010 iMatix Corporation *
* *
* ------------------ GPL Licensed Source Code ------------------ *
* iMatix makes this software available under the GNU General *
* Public License (GPL) license for open source projects. For *
* details of the GPL license please see www.gnu.org or read the *
* file license.gpl provided in this package. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program in the file 'license.gpl'; if *
* not, see <http://www.gnu.org/licenses/>. *
* *
* You can also license this software under iMatix's General Terms *
* of Business (GTB) for commercial projects. If you have not *
* explicitly licensed this software under the iMatix GTB you may *
* only use it under the terms of the GNU General Public License. *
* *
* For more information, send an email to info@imatix.com. *
* -------------------------------------------------------------- *
*===========================================================================*/
/*
Synopsis: Provides functions to Manage XML data.
*/
#ifndef SLFXMLS_INCLUDED /* Allow multiple inclusions */
#define SLFXMLS_INCLUDED
/*- Definition ------------------------------------------------------------- */
typedef struct _XML_STORE XML_STORE;
/*- Function prototypes ---------------------------------------------------- */
#ifdef __cplusplus
extern "C" {
#endif
/* Function prototypes */
XML_STORE *xmls_new (char *xml_buffer);
XML_STORE *xmls_load (char *file_name);
int xmls_save (XML_STORE *store, char *file_name);
char *xmls_save_string (XML_STORE *store);
Bool xmls_free (XML_STORE *store);
void xmls_index (XML_STORE *store, int tree_level);
char *xmls_get_value (XML_STORE *store, char *path, char *default_value);
Bool xmls_set_value (XML_STORE *store, char *path, char *value);
long xmls_count_item (XML_STORE *store, char *path);
Bool xmls_add (XML_STORE *store, char *path, char *value);
Bool xmls_delete (XML_STORE *store, char *path);
#ifdef __cplusplus
}
#endif
#endif /* Included */
|