1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877
|
#define VERSION "2.18"
/*
* units, a program for units conversion
* Copyright (C) 1996, 1997, 1999, 2000-2007, 2009, 2011-2018
* Free Software Foundation, Inc
*
* 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; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301 USA
*
* This program was written by Adrian Mariano (adrianm@gnu.org)
*/
#define LICENSE "\
Copyright (C) 2018 Free Software Foundation, Inc.\n\
GNU Units comes with ABSOLUTELY NO WARRANTY.\n\
You may redistribute copies of GNU Units\n\
under the terms of the GNU General Public License."
#define _XOPEN_SOURCE 600
#if defined (_WIN32) && defined (_MSC_VER)
# include <windows.h>
# include <winbase.h>
#endif
#if defined (_WIN32) && defined (HAVE_MKS_TOOLKIT)
# include <sys/types.h>
# include <sys/stat.h>
#endif
#include <ctype.h>
#include <float.h>
#include <stdio.h>
#include <signal.h>
#include <stdarg.h>
#include <time.h>
#ifndef NO_SETLOCALE
# include<locale.h>
#endif
#ifdef SUPPORT_UTF8
/* Apparently this define is needed to get wcswidth() prototype */
# include <wchar.h>
# include <langinfo.h>
# define UTF8VERSTR "with utf8"
#else
# define UTF8VERSTR "without utf8"
#endif
#ifdef READLINE
# define RVERSTR "with readline"
# include <readline/readline.h>
# include <readline/history.h>
# define HISTORY_FILE ".units_history"
# if defined (_WIN32) && defined (_MSC_VER)
# include <io.h>
# define isatty _isatty
# endif
#else
# define RVERSTR "without readline"
#endif
#include "getopt.h"
#include "units.h"
#ifndef UNITSFILE
# define UNITSFILE "definitions.units"
#endif
#ifndef LOCALEMAP
# define LOCALEMAP "locale_map.txt"
#endif
#ifndef DATADIR
# define DATADIR "../share/units"
#endif
#if defined (_WIN32) && defined (_MSC_VER)
# include <direct.h>
# define getcwd _getcwd
#else
# include <unistd.h>
#endif
#ifdef _WIN32
# define EXE_EXT ".exe"
# define PATHSEP ';'
#else
# define EXE_EXT ""
# define PATHSEP ':'
#endif
#define PRIMITIVECHAR '!' /* Character that marks irreducible units */
#define COMMENTCHAR '#' /* Comments marked by this character */
#define COMMANDCHAR '!' /* Unit database commands marked with this */
#define UNITSEPCHAR ';' /* Separator for unit lists. Include this */
/* char in rl_basic_word_break_characters */
/* and in nonunitchars defined in parse.y */
#define FUNCSEPCHAR ';' /* Separates forward and inverse definitions */
#define REDEFCHAR '+' /* Mark unit as redefinition to suppress warning message */
#define DEFAULTPAGER "/usr/bin/pager" /* Default pager program */
#define DEFAULTLOCALE "en_US" /* Default locale */
#define MAXINCLUDE 5 /* Max depth of include files */
#define MAXFILES 25 /* Max number of units files on command line */
#define NODIM "!dimensionless" /* Marks dimensionless primitive units, such */
/* as the radian, which are ignored when */
/* doing unit comparisons */
#define NOPOINT -1 /* suppress display of pointer in processunit*/
#define NOERRMSG -2 /* no error messages in checkunitlist() */
#define MAXHISTORYFILE 5000 /* max length of history file for readline */
/* values for output number format */
#define BASE_FORMATS "gGeEf" /* printf() format types recognized pre-C99 */
#define DEFAULTPRECISION 8 /* default significant digits for printf() */
#define DEFAULTTYPE 'g' /* default number format type for printf() */
#define MAXPRECISION DBL_DIG /* maximum number precision for printf() */
#define HOME_UNITS_ENV "MYUNITSFILE" /* Personal units file environment var */
#define NOERROR_KEYWORD "noerror " /* The trailing space is important */
#define CO_NOARG -1
#define HELPCOMMAND "help" /* Command to request help at prompt */
#define SEARCHCOMMAND "search" /* Command to request text search of units */
#define UNITMATCH "?" /* Command to request conformable units */
char *exit_commands[]={"quit","exit",0};
char *all_commands[]={"quit","exit",HELPCOMMAND,SEARCHCOMMAND,UNITMATCH,0};
/* Key words for function definitions */
struct {
char *word;
char delimit;
int checkopen; /* allow open intervals with parentheses */
} fnkeywords[]={ {"units=", FUNCSEPCHAR, 0},
{"domain=", ',', 1},
{"range=", ',',1},
{NOERROR_KEYWORD, ' ',CO_NOARG},
{0,0}};
#define FN_UNITS 0
#define FN_DOMAIN 1
#define FN_RANGE 2
#define FN_NOERROR 3
char *builtins[] = {"sin", "cos", "tan","ln", "log", "exp",
"acos", "atan", "asin", "sqrt", "cuberoot", "per",
"sinh", "cosh", "tanh", "asinh", "atanh", "acosh", 0};
struct {
char *format; /* printf() format specification for numeric output */
int width; /* printf() width from format */
int precision; /* printf() precision from format */
char type; /* printf() type from format */
} num_format;
struct { /* Program command line option flags */
int
unitlists, /* Perform unit list output if set */
oneline, /* Suppresses the second line of output */
quiet, /* Supress prompting (-q option) */
round, /* Round the last of unit list output to nearest integer */
showfactor, /* */
strictconvert, /* Strict conversion (disables reciprocals) */
unitcheck, /* Enable unit checking: 1 for regular check, 2 for verbose*/
verbose, /* Flag for output verbosity */
readline; /* Using readline library? */
} flags;
#define UTF8MARKER "\xEF\xBB\xBF" /* UTF-8 marker inserted by some Windows */
/* programs at start of a UTF-8 file */
struct parseflag parserflags; /* parser options */
char *homeunitsfile = ".units"; /* Units filename in home directory */
char *pager; /* Actual pager (from PAGER environment var) */
char *mylocale; /* Locale in effect (from LC_CTYPE or LANG) */
int utf8mode; /* Activate UTF8 support */
char *powerstring = "^"; /* Exponent character used in output */
char *unitsfiles[MAXFILES+1]; /* Null terminated list of units file names */
char *logfilename=0; /* Filename for logging */
FILE *logfile=0; /* File for logging */
char *promptprefix=0; /* Prefix added to prompt */
char *progname; /* Used in error messages */
char *fullprogname; /* Full path of program; printversion() uses */
char *progdir; /* Used to find supporting files */
char *datadir; /* Used to find supporting files */
char *deftext=" Definition: ";/* Output text when printing definition */
char *digits = "0123456789.,";
#define QUERYHAVE "You have: " /* Prompt text for units to convert from */
#define QUERYWANT "You want: " /* Prompt text for units to convert to */
#define LOGFROM "From: " /* tag for log file */
#define LOGTO "To: " /* tag for log file */
#define HASHSIZE 101 /* Values from K&R 2nd ed., Sect. 6.6 */
#define HASHNUMBER 31
#define SIMPLEHASHSIZE 128
#define simplehash(str) (*(str) & 127) /* "hash" value for prefixes */
char *errormsg[]={"Successful completion",
"Parse error",
"Product overflow",
"Unit reduction error (bad unit definition)",
"Invalid sum or difference of non-conformable units",
"Unit not dimensionless",
"Unit not a root",
"Unknown unit",
"Bad argument",
"Weird nonlinear unit type (bug in program)",
"Function argument has wrong dimension",
"Argument of function outside domain",
"Nonlinear unit definition has unit error",
"No inverse defined",
"Parser memory overflow (recursive function definition?)",
"Argument wrong dimension or bad nonlinear unit definition",
"Cannot open units file",
"Units file contains errors",
"Memory allocation error",
"Malformed number",
"Unit name ends with nonzero digit without preceding '_'",
"No previous result; '_' not set",
"Base unit not dimensionless; rational exponent required",
"Base unit not a root",
"Exponent not dimensionless",
"Unknown function name",
};
char *invalid_utf8 = "invalid/nonprinting UTF-8";
char *irreducible=0; /* Name of last irreducible unit */
/* Hash table for unit definitions. */
struct unitlist {
char *name; /* unit name */
char *value; /* unit value */
int linenumber; /* line in units data file where defined */
char *file; /* file where defined */
struct unitlist *next; /* next item in list */
} *utab[HASHSIZE];
/* Table for prefix definitions. */
struct prefixlist {
int len; /* length of name string */
char *name; /* prefix name */
char *value; /* prefix value */
int linenumber; /* line in units data file where defined */
char *file; /* file where defined */
struct prefixlist *next; /* next item in list */
} *ptab[SIMPLEHASHSIZE];
struct wantalias {
char *name;
char *definition;
struct wantalias *next;
int linenumber;
char *file;
};
struct wantalias *firstalias = 0;
struct wantalias **aliaslistend = &firstalias; /* Next list entry goes here */
/* Table for function definitions */
struct func *ftab[SIMPLEHASHSIZE];
/*
Used for passing parameters to the parser when we are in the process
of parsing a unit function. If function_parameter is non-nil, then
whenever the text in function_parameter appears in a unit expression
it is replaced by the unit value stored in parameter_value.
*/
char *function_parameter = 0;
struct unittype *parameter_value = 0;
/* Stores the last result value for replacement with '_' */
int lastunitset = 0;
struct unittype lastunit;
char *NULLUNIT = ""; /* Used for units that are canceled during reduction */
#define startswith(string, prefix) (!strncmp(string, prefix, strlen(prefix)))
#define lastchar(string) (*((string)+strlen(string)-1))
#define emptystr(string) (*(string)==0)
#ifdef READLINE
char *historyfile; /* Filename for readline history */
int init_history_length; /* Length of history read from the history file*/
int init_history_base;
void
save_history(void)
{
int newentries;
int err;
newentries = history_length-init_history_length;
if (history_max_entries > 0){
newentries += history_base - init_history_base;
if (newentries > history_max_entries)
newentries = history_max_entries;
}
err = append_history(newentries,historyfile);
if (err){
if (err == ENOENT)
err = write_history(historyfile);
if (err) {
printf("Unable to write history to '%s': %s\n",historyfile,strerror(err));
return;
}
}
history_truncate_file(historyfile,MAXHISTORYFILE);
}
#endif
/* Increases the buffer by BUFGROW bytes and leaves the new pointer in buf
and the new buffer size in bufsize. */
#define BUFGROW 100
void
growbuffer(char **buf, int *bufsize)
{
int usemalloc;
usemalloc = !*buf || !*bufsize;
*bufsize += BUFGROW;
if (usemalloc)
*buf = malloc(*bufsize);
else
*buf = realloc(*buf,*bufsize);
if (!*buf){
fprintf(stderr, "%s: memory allocation error (growbuffer)\n",progname);
exit(EXIT_FAILURE);
}
}
void
logprintf(const char *format, ...)
{
va_list args;
va_start(args, format);
vprintf(format, args);
va_end(args);
if (logfile) {
va_start(args, format);
vfprintf(logfile, format, args);
va_end(args);
}
}
void
logputchar(char c)
{
putchar(c);
if (logfile) fputc(c, logfile);
}
void
logputs(const char *s)
{
fputs(s, stdout);
if (logfile) fputs(s, logfile);
}
/* Look for a subscript in the input string. A subscript starts with
'_' and is followed by a sequence of only digits (matching the
regexp "_[0-9]+"). The function returns 1 if it finds a subscript
and zero otherwise. Note that it returns 1 for an input that is
entirely subscript, with the '_' appearing in the first position. */
int
hassubscript(const char *str)
{
const char *ptr = &lastchar(str);
while (ptr>str){
if (!strchr(digits, *ptr))
return 0;
ptr--;
if (*ptr=='_')
return 1;
}
return 0;
}
/* replace various Unicode minus symbols with ASCII hyphen-minus U+002D */
void
replace_minus(char *input)
{
char *unicode_minus[] = {
"\xE2\x80\x92", /* U+2012: figure dash */
"\xE2\x80\x93", /* U+2013: en dash */
"\xE2\x88\x92", /* U+2212: minus */
0
};
char *inptr, *outptr, *ptr, **minus;
for (minus=unicode_minus; *minus; minus++) {
inptr = outptr = input;
do {
ptr = strstr(inptr, *minus); /* find next unicode minus */
if (ptr) {
while (inptr < ptr) /* copy the input up to the minus symbol */
*outptr++ = *inptr++;
*outptr++ = '-'; /* U+002D: hyphen-minus */
inptr = ptr + strlen(*minus);
}
} while (ptr);
/* if no replacements were made, the input isn't changed */
if (inptr > input) {
while (*inptr)
*outptr++ = *inptr++;
*outptr = '\0';
}
}
}
/* Replace all control chars with a space */
void
replacectrlchars(char *string)
{
for(;*string;string++)
if (iscntrl(*string))
*string = ' ';
}
/*
Fetch a line of data with backslash for continuation. The
parameter count is incremented to report the number of newlines
that are read so that line numbers can be accurately reported.
*/
char *
fgetscont(char *buf, int size, FILE *file, int *count)
{
if (!fgets(buf,size,file))
return 0;
(*count)++;
while(strlen(buf)>=2 && 0==strcmp(buf+strlen(buf)-2,"\\\n")){
(*count)++;
buf[strlen(buf)-2] = 0; /* delete trailing \n and \ char */
if (strlen(buf)>=size-1) /* return if the buffer is full */
return buf;
if (!fgets(buf+strlen(buf), size - strlen(buf), file))
return buf; /* already read some data so return success */
}
if (lastchar(buf) == '\\') { /* If last char of buffer is \ then */
ungetc('\\', file); /* we don't know if it is followed by */
lastchar(buf) = 0; /* a \n, so put it back and try again */
}
return buf;
}
/*
Gets arbitrarily long input data into a buffer using growbuffer().
Returns 0 if no data is read. Increments count by the number of
newlines read unless it points to NULL.
Replaces tabs and newlines with spaces before returning the result.
*/
char *
fgetslong(char **buf, int *bufsize, FILE *file, int *count)
{
int dummy;
if (!count)
count = &dummy;
if (!*bufsize) growbuffer(buf,bufsize);
if (!fgetscont(*buf, *bufsize, file, count))
return 0;
while (lastchar(*buf) != '\n' && !feof(file)){
growbuffer(buf, bufsize);
fgetscont(*buf+strlen(*buf), *bufsize-strlen(*buf), file, count);
(*count)--;
}
/* These nonprinting characters must be removed so that the test
for UTF-8 validity will work. */
replacectrlchars(*buf);
return *buf;
}
/* Allocates memory and aborts if malloc fails. */
void *
mymalloc(int bytes,const char *mesg)
{
void *pointer;
pointer = malloc(bytes);
if (!pointer){
fprintf(stderr, "%s: memory allocation error %s\n", progname, mesg);
exit(EXIT_FAILURE);
}
return pointer;
}
/* Duplicates a string */
char *
dupstr(const char *str)
{
char *ret;
ret = mymalloc(strlen(str) + 1,"(dupstr)");
strcpy(ret, str);
return ret;
}
/* Duplicates a string that is not null-terminated,
adding the null to the copy */
char *
dupnstr(const char *string, int length)
{
char *newstr;
newstr = mymalloc(length+1,"(dupnstr)");
strncpy(newstr, string, length);
newstr[length]=0;
return newstr;
}
#ifdef SUPPORT_UTF8
/*
The strwidth function gives the printed width of a UTF-8 byte sequence.
It will return -1 if the sequence is an invalid UTF-8 sequence or
if the sequence contains "nonprinting" characters. Note that \n and \t are
"nonprinting" characters.
*/
int
strwidth(const char *str)
{
wchar_t *widestr;
int len;
if (!utf8mode)
return strlen(str);
len = strlen(str)+1;
widestr = mymalloc(sizeof(wchar_t)*len, "(strwidth)");
len = mbsrtowcs(widestr, &str, len, NULL);
if (len==-1){
free(widestr);
return -1; /* invalid multibyte sequence */
}
len=wcswidth(widestr, len);
free(widestr);
return len;
}
#else
# define strwidth strlen
#endif
/* hashing algorithm for units */
unsigned
uhash(const char *str)
{
unsigned hashval;
for (hashval = 0; *str; str++)
hashval = *str + HASHNUMBER * hashval;
return (hashval % HASHSIZE);
}
/* Lookup a unit in the units table. Returns the definition, or NULL
if the unit isn't found in the table. */
struct unitlist *
ulookup(const char *str)
{
struct unitlist *uptr;
for (uptr = utab[uhash(str)]; uptr; uptr = uptr->next)
if (strcmp(str, uptr->name) == 0)
return uptr;
return NULL;
}
/* Lookup a prefix in the prefix table. Finds the longest prefix that
matches the beginning of the input string. Returns NULL if no
prefixes match. */
struct prefixlist *
plookup(const char *str)
{
struct prefixlist *prefix;
struct prefixlist *bestprefix=NULL;
int bestlength=0;
for (prefix = ptab[simplehash(str)]; prefix; prefix = prefix->next) {
if (prefix->len > bestlength && !strncmp(str, prefix->name, prefix->len)){
bestlength = prefix->len;
bestprefix = prefix;
}
}
return bestprefix;
}
/* Look up function in the function linked list */
struct func *
fnlookup(const char *str)
{
struct func *funcptr;
for(funcptr=ftab[simplehash(str)];funcptr;funcptr = funcptr->next)
if (!strcmp(funcptr->name, str))
return funcptr;
return 0;
}
struct wantalias *
aliaslookup(const char *str)
{
struct wantalias *aliasptr;
for(aliasptr = firstalias; aliasptr; aliasptr=aliasptr->next)
if (!strcmp(aliasptr->name, str))
return aliasptr;
return 0;
}
/* Insert a new function into the linked list of functions */
void
addfunction(struct func *newfunc)
{
int val;
val = simplehash(newfunc->name);
newfunc->next = ftab[val];
ftab[val] = newfunc;
}
/* Free the fields in the function except for the name so that it
can be redefined. It remains in position in the linked list. */
void
freefunction(struct func *funcentry)
{
if (funcentry->table){
free(funcentry->table);
free(funcentry->tableunit);
} else {
free(funcentry->forward.param);
free(funcentry->forward.def);
if (funcentry->forward.domain_min) free(funcentry->forward.domain_min);
if (funcentry->forward.domain_max) free(funcentry->forward.domain_max);
if (funcentry->inverse.domain_min) free(funcentry->inverse.domain_min);
if (funcentry->inverse.domain_max) free(funcentry->inverse.domain_max);
if (funcentry->forward.dimen) free(funcentry->forward.dimen);
if (funcentry->inverse.dimen) free(funcentry->inverse.dimen);
if (funcentry->inverse.def) free(funcentry->inverse.def);
if (funcentry->inverse.param) free(funcentry->inverse.param);
}
}
/* Remove leading and trailing spaces from the input */
void
removespaces(char *in)
{
char *ptr;
if (*in) {
for(ptr = &lastchar(in); *ptr==' '; ptr--); /* Last non-space */
*(ptr+1)=0;
if (*in==' '){
ptr = in + strspn(in," ");
memmove(in, ptr, strlen(ptr)+1);
}
}
}
/*
Looks up an inverse function given as a ~ character followed by
spaces and then the function name. The spaces will be deleted as a
side effect. If an inverse function is found returns the function
pointer, otherwise returns null.
*/
struct func *
invfnlookup(char *str)
{
if (*str != '~')
return 0;
removespaces(str+1);
return fnlookup(str+1);
}
char *
strip_comment(char *line)
{
char *comment = 0;
if ((line = strchr(line,COMMENTCHAR))) {
comment = line+1;
*line = 0;
}
return comment;
}
/* Print string but replace two consecutive spaces with one space. */
void
tightprint(FILE *outfile, char *string)
{
while(*string){
fputc(*string, outfile);
if (*string != ' ') string++;
else while(*string==' ') string++;
}
}
#define readerror (goterr=1) && errfile && fprintf
#define VAGUE_ERR "%s: error in units file '%s' line %d\n", \
progname, file, linenum
/* Print out error message encountered while reading the units file. */
/*
Splits the line into two parts. The first part is space delimited.
The second part is everything else. Removes trailing spaces from
the second part. Returned items are null if no parameter was found.
*/
void
splitline(char *line, char **first, char **second)
{
*second = 0;
*first = strtok(line, " ");
if (*first){
*second = strtok(0, "\n");
if (*second){
removespaces(*second);
if (emptystr(*second))
*second = 0;
}
}
}
/* see if character is part of a valid decimal number */
int
isdecimal(char c)
{
return strchr(digits, c) != NULL;
}
/*
Check for some invalid unit names. Print error message. Returns 1 if
unit name is bad, zero otherwise.
*/
int
checkunitname(char *name, int linenum, char *file, FILE *errfile)
{
char nonunitchars[] = "~;+-*/|^)"; /* Also defined in parse.y with a few more characters */
char **ptr;
char *cptr;
if ((cptr=strpbrk(name, nonunitchars))){
if (errfile) fprintf(errfile,
"%s: unit '%s' in units file '%s' on line %d ignored. It contains invalid character '%c'\n",
progname, name, file, linenum, *cptr);
return 1;
}
if (strchr(digits, name[0])){
if (errfile) fprintf(errfile,
"%s: unit '%s' in units file '%s' on line %d ignored. It starts with a digit\n",
progname, name, file, linenum);
return 1;
}
for(ptr=builtins;*ptr;ptr++)
if (!strcmp(name, *ptr)){
if (errfile) fprintf(errfile,
"%s: redefinition of built-in function '%s' in file '%s' on line %d ignored.\n",
progname, name, file, linenum);
return 1;
}
for(ptr=all_commands;*ptr;ptr++)
if (!strcmp(name, *ptr)){
if (errfile) fprintf(errfile,
"%s: unit name '%s' in file '%s' on line %d may be hidden by command with the same name.\n",
progname, name, file, linenum);
}
return 0;
}
int
newunit(char *unitname, char *unitdef, int *count, int linenum,
char *file,FILE *errfile, int redefine)
{
struct unitlist *uptr;
unsigned hashval;
/* units ending with '_' create ambiguity for exponents */
if (unitname[0]=='_' || lastchar(unitname)=='_'){
if (errfile) fprintf(errfile,
"%s: unit '%s' on line %d of '%s' ignored. It starts or ends with '_'\n",
progname, unitname, linenum, file);
return E_BADFILE;
}
/* Units that end in [2-9] can never be accessed */
if (strchr(".,23456789", lastchar(unitname)) && !hassubscript(unitname)){
if (errfile) fprintf(errfile,
"%s: unit '%s' on line %d of '%s' ignored. %s\n",
progname, unitname, linenum, file,errormsg[E_UNITEND]);
return E_BADFILE;
}
if (checkunitname(unitname, linenum, file, errfile))
return E_BADFILE;
if ((uptr=ulookup(unitname))) { /* Is it a redefinition? */
if (flags.unitcheck && errfile && !redefine)
fprintf(errfile,
"%s: unit '%s' defined on line %d of '%s' is redefined on line %d of '%s'.\n",
progname, unitname, uptr->linenumber,uptr->file,
linenum, file);
free(uptr->value);
} else {
/* make new units table entry */
uptr = (struct unitlist *) mymalloc(sizeof(*uptr),"(newunit)");
uptr->name = dupstr(unitname);
/* install unit name/value pair in list */
hashval = uhash(uptr->name);
uptr->next = utab[hashval];
utab[hashval] = uptr;
(*count)++;
}
uptr->value = dupstr(unitdef);
uptr->linenumber = linenum;
uptr->file = file;
return 0;
}
int
newprefix(char *unitname, char *unitdef, int *count, int linenum,
char *file,FILE *errfile, int redefine)
{
struct prefixlist *pfxptr;
unsigned pval;
lastchar(unitname) = 0;
if (checkunitname(unitname,linenum,file,errfile))
return E_BADFILE;
if ((pfxptr = plookup(unitname)) /* already there: redefinition */
&& !strcmp(pfxptr->name, unitname)){
if (flags.unitcheck && errfile && !redefine)
fprintf(errfile,
"%s: prefix '%s-' defined on line %d of '%s' is redefined on line %d of '%s'.\n",
progname, unitname, pfxptr->linenumber,pfxptr->file,
linenum, file);
free(pfxptr->value);
} else {
pfxptr = (struct prefixlist *) mymalloc(sizeof(*pfxptr),"(newprefix)");
pfxptr->name = dupstr(unitname);
pfxptr->len = strlen(unitname);
pval = simplehash(unitname);
pfxptr->next = ptab[pval];
ptab[pval] = pfxptr;
(*count)++;
}
pfxptr->value = dupstr(unitdef);
pfxptr->linenumber = linenum;
pfxptr->file = file;
return 0;
}
/*
parsepair() looks for data of the form [text1,text2] where the ',' is a
specified delimiter. The second argument, text2, is optional and if it's
missing then second is set to NULL. The parameters are allowed to be
empty strings. The function returns the first character after the
closing bracket if no errors occur or the NULL pointer on error.
*/
char *
parsepair(char *input, char **first, char **second,
int *firstopen, int *secondopen, char delimiter, int checkopen,
char *unitname, int linenum, char *file,FILE *errfile)
{
char *start, *end, *middle;
start = strpbrk(input, checkopen?"[(":"[");
if (!start){
if (errfile) fprintf(errfile,
"%s: expecting '[' %s in definition of '%s' in '%s' line %d\n",
progname, checkopen ? "or '('":"", unitname, file, linenum);
return 0;
}
if (*start=='(') *firstopen=1;
else *firstopen=0;
*start++=0;
removespaces(input);
if (!emptystr(input)){
if (errfile) fprintf(errfile,
"%s: unexpected characters before '%c' in definition of '%s' in '%s' line %d\n",
progname, *firstopen?'(':'[',unitname, file, linenum);
return 0;
}
end = strpbrk(start, checkopen?"])":"]");
if (!end){
if (errfile) fprintf(errfile,
"%s: expecting ']' %s in definition of '%s' in '%s' line %d\n",
progname, checkopen?"or ')'":"",unitname, file, linenum);
return 0;
}
if (*end==')') *secondopen=1;
else *secondopen=0;
*end++=0;
middle = strchr(start,delimiter);
if (middle){
*middle++=0;
removespaces(middle);
*second = middle;
} else
*second = 0;
removespaces(start);
*first = start;
return end;
}
/*
Extract numbers from two text strings and place them into pointers.
Has two error codes for decreasing interval or bad numbers in the
text strings. Returns 0 on success.
*/
#define EI_ERR_DEC 1 /* Decreasing interval */
#define EI_ERR_MALF 2 /* Malformed number */
int
extract_interval(char *first, char *second,
double **firstout, double **secondout)
{
double val;
char *end;
if (!emptystr(first)){
val = strtod(first, &end);
if (*end)
return EI_ERR_MALF;
else {
*firstout=(double *)mymalloc(sizeof(double), "(extract_interval)");
**firstout = val;
}
}
if (second && !emptystr(second)){
val = strtod(second, &end);
if (*end)
return EI_ERR_MALF;
else if (*firstout && **firstout>=val)
return EI_ERR_DEC;
else {
*secondout=(double *)mymalloc(sizeof(double), "(extract_interval)");
**secondout = val;
}
}
return 0;
}
void
copyfunctype(struct functype *dest, struct functype *src)
{
dest->domain_min_open = src->domain_min_open;
dest->domain_max_open = src->domain_max_open;
dest->param = dest->def = dest->dimen = NULL;
dest->domain_min = dest->domain_max = NULL;
if (src->param) dest->param = dupstr(src->param);
if (src->def) dest->def = dupstr(src->def);
if (src->dimen) dest->dimen = dupstr(src->dimen);
if (src->domain_min){
dest->domain_min = (double *) mymalloc(sizeof(double), "(copyfunctype)");
*dest->domain_min = *src->domain_min;
}
if (src->domain_max){
dest->domain_max = (double *) mymalloc(sizeof(double), "(copyfunctype)");
*dest->domain_max = *src->domain_max;
}
}
int
copyfunction(char *unitname, char *funcname, int *count, int linenum,
char *file, FILE *errfile)
{
struct func *source, *funcentry;
int i;
if (checkunitname(unitname, linenum, file, errfile))
return E_BADFILE;
removespaces(funcname);
i = strlen(funcname)-2; /* strip trailing () if present */
if (i>0 && !strcmp(funcname+i,"()"))
funcname[i]=0;
source = fnlookup(funcname);
if (!source) {
if (errfile){
if (!strpbrk(funcname," ;][()+*/-^"))
fprintf(errfile,"%s: bad definition for '%s' in '%s' line %d, function '%s' not defined\n",
progname, unitname, file, linenum, funcname);
else
fprintf(errfile,"%s: bad function definition of '%s' in '%s' line %d\n",
progname,unitname,file,linenum);
}
return E_BADFILE;
}
if ((funcentry=fnlookup(unitname))){
if (flags.unitcheck && errfile)
fprintf(errfile,
"%s: function '%s' defined on line %d of '%s' is redefined on line %d of '%s'.\n",
progname, unitname, funcentry->linenumber,funcentry->file,
linenum, file);
freefunction(funcentry);
} else {
funcentry = (struct func*)mymalloc(sizeof(struct func),"(newfunction)");
funcentry->name = dupstr(unitname);
addfunction(funcentry);
(*count)++;
}
funcentry->linenumber = linenum;
funcentry->file = file;
funcentry->skip_error_check = source->skip_error_check;
if (source->table){
funcentry->tablelen = source->tablelen;
funcentry->tableunit = dupstr(source->tableunit);
funcentry->table = (struct pair *)
mymalloc(sizeof(struct pair)*funcentry->tablelen, "(copyfunction)");
for(i=0;i<funcentry->tablelen;i++){
funcentry->table[i].location = source->table[i].location;
funcentry->table[i].value = source->table[i].value;
}
} else {
funcentry->table = 0;
copyfunctype(&funcentry->forward, &source->forward);
copyfunctype(&funcentry->inverse, &source->inverse);
}
return 0;
}
#define FREE_STUFF {if (forward_dim) free(forward_dim);\
if (inverse_dim) free(inverse_dim);\
if (domain_min) free(domain_min);\
if (domain_max) free(domain_max);\
if (range_min) free(range_min);\
if (range_max) free(range_max);}
#define REPEAT_ERR \
if (errfile) fprintf(errfile, \
"%s: keyword '%s' repeated in definition of '%s' on line %d of '%s'.\n",\
progname,fnkeywords[i].word,unitname, linenum, file)
int
newfunction(char *unitname, char *unitdef, int *count,
int linenum, char *file,FILE *errfile, int redefine)
{
char *start, *end, *inv, *forward_dim, *inverse_dim, *first, *second;
double *domain_min, *domain_max, *range_min, *range_max;
struct func *funcentry;
int looking_for_keywords,i, firstopen, secondopen;
int domain_min_open, domain_max_open, range_min_open, range_max_open;
int noerror = 0;
if (*unitname=='('){
if (errfile) fprintf(errfile,
"%s: unit '%s' on line %d of '%s' ignored. It starts with a '('\n",
progname, unitname, linenum, file);
return E_BADFILE;
}
/* coverity[returned_null] */
start = strchr(unitname,'(');
end = strchr(unitname,')');
*start++ = 0;
if (checkunitname(unitname,linenum,file,errfile))
return E_BADFILE;
if (start==end) /* no argument: function() so make a function copy */
return copyfunction(unitname, unitdef, count, linenum, file, errfile);
if (!end || strlen(end)>1){
if (errfile) fprintf(errfile,
"%s: bad function definition of '%s' in '%s' line %d\n",
progname,unitname,file,linenum);
return E_BADFILE;
}
*end=0;
forward_dim = NULL;
inverse_dim = NULL;
domain_min = NULL;
domain_max = NULL;
range_min = NULL;
range_max = NULL;
domain_min_open = 0;
domain_max_open = 0;
range_min_open = 0;
range_max_open = 0;
looking_for_keywords=1;
while (looking_for_keywords) {
looking_for_keywords = 0;
for(i=0;fnkeywords[i].word;i++){
if (startswith(unitdef, fnkeywords[i].word)){
looking_for_keywords = 1; /* found keyword so keep looking */
unitdef+=strlen(fnkeywords[i].word);
if (fnkeywords[i].checkopen!=CO_NOARG){
unitdef = parsepair(unitdef,&first, &second, &firstopen, &secondopen,
fnkeywords[i].delimit, fnkeywords[i].checkopen,
unitname, linenum, file,errfile);
if (!unitdef){
FREE_STUFF;
return E_BADFILE;
}
removespaces(unitdef);
}
if (i==FN_NOERROR)
noerror = 1;
if (i==FN_UNITS){
if (forward_dim || inverse_dim){
REPEAT_ERR;
return E_BADFILE;
}
forward_dim = dupstr(first);
if (second)
inverse_dim = dupstr(second);
}
if (i==FN_DOMAIN){
int err=0;
if (domain_min || domain_max){
REPEAT_ERR;
return E_BADFILE;
}
err = extract_interval(first,second,&domain_min, &domain_max);
domain_min_open = firstopen;
domain_max_open = secondopen;
if (err)
FREE_STUFF;
if (err==EI_ERR_DEC){
if (errfile) fprintf(errfile,
"%s: second endpoint for domain must be greater than the first\n in definition of '%s' in '%s' line %d\n",
progname, unitname, file, linenum);
return E_BADFILE;
}
if (err==EI_ERR_MALF){
if (errfile) fprintf(errfile,
"%s: malformed domain in definition of '%s' in '%s' line %d\n",
progname, unitname, file, linenum);
return E_BADFILE;
}
}
if (i==FN_RANGE){
int err=0;
if (range_min || range_max){
REPEAT_ERR;
FREE_STUFF;
return E_BADFILE;
}
err = extract_interval(first,second,&range_min, &range_max);
range_min_open = firstopen;
range_max_open = secondopen;
if (err)
FREE_STUFF;
if (err==EI_ERR_DEC){
if (errfile) fprintf(errfile,
"%s: second endpoint for range must be greater than the first\n in definition of '%s' in '%s' line %d\n",
progname, unitname, file, linenum);
return E_BADFILE;
}
if (err==EI_ERR_MALF){
if (errfile) fprintf(errfile,
"%s: malformed range in definition of '%s' in '%s' line %d\n",
progname, unitname, file, linenum);
return E_BADFILE;
}
}
}
}
}
if (emptystr(unitdef)){
if (errfile) fprintf(errfile,
"%s: function '%s' lacks a definition at line %d of '%s'\n",
progname, unitname, linenum, file);
FREE_STUFF;
return E_BADFILE;
}
if (*unitdef=='['){
if (errfile) fprintf(errfile,
"%s: function '%s' missing keyword before '[' on line %d of '%s'\n",
progname, unitname, linenum, file);
FREE_STUFF;
return E_BADFILE;
}
/* Check that if domain and range are specified and nonzero then the
units are given. Otherwise these are meaningless. */
if (!forward_dim &&
((domain_min && *domain_min) || (domain_max && *domain_max))){
if (errfile)
fprintf(errfile,"%s: function '%s' defined on line %d of '%s' has domain with no units.\n",
progname, unitname, linenum, file);
FREE_STUFF;
return E_BADFILE;
}
if (!inverse_dim &&
((range_min && *range_min) || (range_max && *range_max))){
if (errfile)
fprintf(errfile,"%s: function '%s' defined on line %d of '%s' has range with no units.\n",
progname, unitname, linenum, file);
FREE_STUFF;
return E_BADFILE;
}
if ((funcentry=fnlookup(unitname))){
if (flags.unitcheck && errfile && !redefine)
fprintf(errfile,
"%s: function '%s' defined on line %d of '%s' is redefined on line %d of '%s'.\n",
progname, unitname, funcentry->linenumber,funcentry->file,
linenum, file);
freefunction(funcentry);
} else {
funcentry = (struct func*)mymalloc(sizeof(struct func),"(newfunction)");
funcentry->name = dupstr(unitname);
addfunction(funcentry);
(*count)++;
}
funcentry->table = 0;
funcentry->skip_error_check = noerror;
funcentry->forward.dimen = forward_dim;
funcentry->inverse.dimen = inverse_dim;
funcentry->forward.domain_min = domain_min;
funcentry->forward.domain_max = domain_max;
funcentry->inverse.domain_min = range_min;
funcentry->inverse.domain_max = range_max;
funcentry->forward.domain_min_open = domain_min_open;
funcentry->forward.domain_max_open = domain_max_open;
funcentry->inverse.domain_min_open = range_min_open;
funcentry->inverse.domain_max_open = range_max_open;
inv = strchr(unitdef,FUNCSEPCHAR);
if (inv)
*inv++ = 0;
funcentry->forward.param = dupstr(start);
removespaces(unitdef);
funcentry->forward.def = dupstr(unitdef);
if (inv){
removespaces(inv);
funcentry->inverse.def = dupstr(inv);
funcentry->inverse.param = dupstr(unitname);
}
else {
funcentry->inverse.def = 0;
funcentry->inverse.param = 0;
}
funcentry->linenumber = linenum;
funcentry->file = file;
return 0;
}
int
newtable(char *unitname,char *unitdef, int *count,
int linenum, char *file,FILE *errfile, int redefine)
{
char *start, *end;
char *tableunit;
int tablealloc, tabpt;
struct pair *tab;
struct func *funcentry;
int noerror = 0;
/* coverity[returned_null] */
tableunit = strchr(unitname,'[');
end = strchr(unitname,']');
*tableunit++=0;
if (checkunitname(unitname, linenum, file, errfile))
return E_BADFILE;
if (!end){
if (errfile) fprintf(errfile,"%s: missing ']' in units file '%s' line %d\n",
progname,file,linenum);
return E_BADFILE;
}
if (strlen(end)>1){
if (errfile) fprintf(errfile,
"%s: unexpected characters after ']' in units file '%s' line %d\n",
progname,file,linenum);
return E_BADFILE;
}
*end=0;
tab = (struct pair *)mymalloc(sizeof(struct pair)*20, "(newtable)");
tablealloc=20;
tabpt = 0;
start = unitdef;
if (startswith(start, NOERROR_KEYWORD)) {
noerror = 1;
start += strlen(NOERROR_KEYWORD);
removespaces(start);
}
while (1) {
if (tabpt>=tablealloc){
tablealloc+=20;
tab = (struct pair *)realloc(tab,sizeof(struct pair)*tablealloc);
if (!tab){
if (errfile) fprintf(errfile, "%s: memory allocation error (newtable)\n",
progname);
return E_MEMORY;
}
}
tab[tabpt].location = strtod(start,&end);
if (start==end || (!emptystr(end) && *end !=' ')){
if (!emptystr(start)) {
if (strlen(start)>15) start[15]=0; /* Truncate for error msg display */
if (errfile) fprintf(errfile,
"%s: cannot parse table definition %s at '%s' on line %d of '%s'\n",
progname, unitname, start, linenum, file);
free(tab);
return E_BADFILE;
}
break;
}
if (tabpt>0 && tab[tabpt].location<=tab[tabpt-1].location){
if (errfile)
fprintf(errfile,"%s: points don't increase (%.8g to %.8g) in units file '%s' line %d\n",
progname, tab[tabpt-1].location, tab[tabpt].location,
file, linenum);
free(tab);
return E_BADFILE;
}
start=end+strspn(end," ");
tab[tabpt].value = strtod(start,&end);
if (start==end){
if (errfile)
fprintf(errfile,"%s: missing value after %.8g in units file '%s' line %d\n",
progname, tab[tabpt].location, file, linenum);
free(tab);
return E_BADFILE;
}
tabpt++;
start=end+strspn(end," ,");
}
if ((funcentry=fnlookup(unitname))){
if (flags.unitcheck && errfile && !redefine)
fprintf(errfile,
"%s: unit '%s' defined on line %d of '%s' is redefined on line %d of '%s'.\n",
progname, unitname, funcentry->linenumber,funcentry->file,
linenum, file);
freefunction(funcentry);
} else {
funcentry = (struct func *)mymalloc(sizeof(struct func),"(newtable)");
funcentry->name = dupstr(unitname);
addfunction(funcentry);
(*count)++;
}
funcentry->tableunit = dupstr(tableunit);
funcentry->tablelen = tabpt;
funcentry->table = tab;
funcentry->skip_error_check = noerror;
funcentry->linenumber = linenum;
funcentry->file = file;
return 0;
}
int
newalias(char *unitname, char *unitdef,int linenum, char *file,FILE *errfile)
{
struct wantalias *aliasentry;
if (!strchr(unitdef, UNITSEPCHAR)){
if (errfile) fprintf(errfile,
"%s: unit list missing '%c' on line %d of '%s'\n",
progname, UNITSEPCHAR, linenum, file);
return E_BADFILE;
}
if ((aliasentry=aliaslookup(unitname))){ /* duplicate alias */
if (flags.unitcheck && errfile)
fprintf(errfile,
"%s: unit list '%s' defined on line %d of '%s' is redefined on line %d of '%s'.\n",
progname, unitname, aliasentry->linenumber,
aliasentry->file, linenum, file);
free(aliasentry->definition);
} else {
aliasentry = (struct wantalias *)
mymalloc(sizeof(struct wantalias),"(newalias)");
aliasentry->name = dupstr(unitname);
aliasentry->next = 0;
*aliaslistend = aliasentry;
aliaslistend = &aliasentry->next;
}
aliasentry->definition = dupstr(unitdef);
aliasentry->linenumber = linenum;
aliasentry->file = file;
return 0;
}
/*
Check environment variable name to see if its value appears on the
space delimited text string pointed to by list. Returns 2 if the
environment variable is not set, return 1 if its value appears on
the list and zero otherwise.
*/
int
checkvar(char *name, char *list)
{
char *listitem;
name = getenv(name);
if (!name)
return 2;
listitem = strtok(list," ");
while (listitem){
if (!strcmp(name, listitem))
return 1;
listitem = strtok(0," ");
}
return 0;
}
#ifdef NO_SETENV
int
setenv(const char *name, const char *val, int overwrite)
{
char *environment;
if (!overwrite && getenv(name) != NULL)
return 0;
environment = (char *) malloc(strlen(name) + strlen(val) + 2);
if (!environment)
return 1;
strcpy(environment, name);
strcat(environment, "=");
strcat(environment, val);
/* putenv() doesn't copy its argument, so don't free environment */
#if defined (_WIN32) && defined (_MSC_VER)
return _putenv(environment);
#else
return putenv(environment);
#endif
}
#endif
#ifdef _WIN32
# define isdirsep(c) ((c) == '/' || (c) == '\\')
# define hasdirsep(s) strpbrk((s),"/\\")
#else
# define isdirsep(c) ((c) == '/')
# define hasdirsep(s) strchr((s),'/')
#endif
#define isexe(s) ((strlen(s) == 4) && (tolower(s[1]) == 'e') \
&& (tolower(s[2]) == 'x') && (tolower(s[3]) == 'e'))
/* Returns a pointer to the end of the pathname part of the
specified filename */
char *
pathend(char *filename)
{
char *pointer;
for(pointer=filename+strlen(filename);pointer>filename;pointer--){
if (isdirsep(*pointer)) {
pointer++;
break;
}
}
return pointer;
}
int
isfullpath(char *path)
{
#ifdef _WIN32
/* handle Windows drive specifier */
if (isalpha(*path) && *(path + 1) == ':')
path += 2;
#endif
return isdirsep(*path);
}
/*
Read in units data.
file - Filename to load
errfile - File to receive messages about errors in the units database.
Set it to 0 to suppress errors.
unitcount, prefixcount, funccount - Return statistics to the caller.
Must initialize to zero before calling.
depth - Used to prevent recursive includes. Call with it set to zero.
The global variable progname is used in error messages.
*/
int
readunits(char *file, FILE *errfile,
int *unitcount, int *prefixcount, int *funccount, int depth)
{
FILE *unitfile;
char *line = 0, *lineptr, *unitdef, *unitname, *permfile;
int linenum, linebufsize, goterr, retcode;
int locunitcount, locprefixcount, locfunccount, redefinition;
int wronglocale = 0; /* If set then we are currently reading data */
int inlocale = 0; /* for the wrong locale so we should skip it */
int in_utf8 = 0; /* If set we are reading utf8 data */
int invar = 0; /* If set we are in data for an env variable.*/
int wrongvar = 0; /* If set then we are not processing */
locunitcount = 0;
locprefixcount = 0;
locfunccount = 0;
linenum = 0;
linebufsize = 0;
goterr = 0;
unitfile = fopen(file, "rt");
if (!unitfile)
return E_FILE;
growbuffer(&line,&linebufsize);
/* coverity[alloc_fn] */
permfile = dupstr(file); /* This is a permanent copy to reference in */
/* the database. It is never freed. */
while (!feof(unitfile)) {
if (!fgetslong(&line, &linebufsize, unitfile, &linenum))
break;
if (linenum==1 && startswith(line, UTF8MARKER)){
int i;
for(lineptr=line,i=0;i<strlen(UTF8MARKER);i++, lineptr++)
*lineptr=' ';
}
strip_comment(line);
if (-1 == strwidth(line)){
readerror(errfile, "%s: %s on line %d of '%s'\n",
progname, invalid_utf8, linenum, file);
continue;
}
replace_minus(line);
if (*line == COMMANDCHAR) { /* Process units file commands */
unitname = strtok(line+1, " ");
if (!unitname){
readerror(errfile, VAGUE_ERR);
continue;
}
/* Check for locale and utf8 declarations. Any other commands
most likely belong after these tests. */
if (!strcmp(unitname,"var") || !strcmp(unitname,"varnot")){
int not = 0;
if (unitname[3]=='n')
not = 1;
unitname=strtok(0," ");
unitdef=strtok(0,""); /* Get rest of the line */
if (!unitname)
readerror(errfile,
"%s: no variable name specified on line %d of '%s'\n",
progname, linenum, file);
else if (!unitdef)
readerror(errfile,
"%s: no value specified on line %d of '%s'\n",
progname, linenum, file);
else if (invar)
readerror(errfile,
"%s: nested var statements not allowed, line %d of '%s'\n",
progname, linenum, file);
else {
int check;
invar = 1;
check = checkvar(unitname, unitdef);
if (check==2){
readerror(errfile,
"%s: environment variable %s not set at line %d of '%s'\n",
progname, unitname, linenum, file);
wrongvar = 1;
}
else if (!(not^check))
wrongvar = 1;
}
continue;
}
else if (!strcmp(unitname, "endvar")){
if (!invar)
readerror(errfile,
"%s: unmatched !endvar on line %d of '%s'\n",
progname, linenum, file);
wrongvar = 0;
invar = 0;
continue;
}
else if (!strcmp(unitname,"locale")){
unitname = strtok(0, " ");
if (!unitname)
readerror(errfile,
"%s: no locale specified on line %d of '%s'\n",
progname, linenum, file);
else if (inlocale)
readerror(errfile,
"%s: nested locales not allowed, line %d of '%s'\n",
progname, linenum, file);
else {
inlocale = 1;
if (strcmp(unitname,mylocale)) /* locales don't match */
wronglocale = 1;
}
continue;
}
else if (!strcmp(unitname, "endlocale")){
if (!inlocale)
readerror(errfile,
"%s: unmatched !endlocale on line %d of '%s'\n",
progname, linenum, file);
wronglocale = 0;
inlocale = 0;
continue;
}
else if (!strcmp(unitname, "utf8")){
if (in_utf8)
readerror(errfile,"%s: nested utf8 not allowed, line %d of '%s'\n",
progname, linenum, file);
else in_utf8 = 1;
continue;
}
else if (!strcmp(unitname, "endutf8")){
if (!in_utf8)
readerror(errfile,"%s: unmatched !endutf8 on line %d of '%s'\n",
progname, linenum, file);
in_utf8 = 0;
continue;
}
if (in_utf8 && !utf8mode) continue;
if (wronglocale || wrongvar) continue;
if (!strcmp(unitname,"prompt")){
unitname = strtok(0,""); /* Rest of the line */
if (promptprefix)
free(promptprefix);
if (!unitname)
promptprefix=0;
else
promptprefix = dupstr(unitname);
continue;
}
if (!strcmp(unitname,"message")){
unitname = strtok(0,""); /* Rest of the line */
if (!flags.quiet){
if (unitname) logputs(unitname);
logputchar('\n');
}
continue;
}
else if (!strcmp(unitname,"set")) {
unitname = strtok(0," ");
unitdef = strtok(0," ");
if (!unitname)
readerror(errfile,
"%s: no variable name specified on line %d of '%s'\n",
progname, linenum, file);
else if (!unitdef)
readerror(errfile,
"%s: no value specified on line %d of '%s'\n",
progname, linenum, file);
else
setenv(unitname, unitdef, 0);
continue;
}
else if (!strcmp(unitname,"unitlist")){
splitline(0,&unitname, &unitdef); /* 0 continues strtok call */
if (!unitname || !unitdef)
readerror(errfile,VAGUE_ERR);
else {
if (newalias(unitname, unitdef, linenum, permfile, errfile))
goterr = 1;
}
continue;
}
else if (!strcmp(unitname, "include")){
if (depth>MAXINCLUDE){
readerror(errfile,
"%s: max include depth of %d exceeded in file '%s' line %d\n",
progname, MAXINCLUDE, file, linenum);
} else {
int readerr;
char *includefile;
unitname = strtok(0, " ");
if (!unitname){
readerror(errfile,
"%s: missing include filename on line %d of '%s'\n",
progname, linenum, file);
continue;
}
includefile = mymalloc(strlen(file)+strlen(unitname)+1, "(readunits)");
if (isfullpath(unitname))
strcpy(includefile,unitname);
else {
strcpy(includefile,file);
strcpy(pathend(includefile), unitname);
}
readerr = readunits(includefile, errfile, unitcount, prefixcount,
funccount, depth+1);
if (readerr == E_MEMORY){
fclose(unitfile);
free(line);
free(includefile);
return readerr;
}
if (readerr == E_FILE) {
readerror(errfile, "%s: cannot open included file '%s' at line %d of file '%s\n",
progname, includefile, linenum, file);
}
if (readerr)
goterr = 1;
free(includefile);
}
} else /* not a valid command */
readerror(errfile,VAGUE_ERR);
continue;
}
if (in_utf8 && !utf8mode) continue;
if (wronglocale || wrongvar) continue;
splitline(line, &unitname, &unitdef);
if (!unitname) continue;
if (!unitdef){
readerror(errfile,
"%s: unit '%s' lacks a definition at line %d of '%s'\n",
progname, unitname, linenum, file);
continue;
}
if (*unitname == REDEFCHAR){
unitname++;
redefinition=1;
} else
redefinition=0;
if (lastchar(unitname) == '-'){ /* it's a prefix definition */
if (newprefix(unitname,unitdef,&locprefixcount,linenum,
permfile,errfile,redefinition))
goterr=1;
}
else if (strchr(unitname,'[')){ /* table definition */
retcode=newtable(unitname,unitdef,&locfunccount,linenum,
permfile,errfile,redefinition);
if (retcode){
if (retcode != E_BADFILE){
fclose(unitfile);
free(line);
return retcode;
}
goterr=1;
}
}
else if (strchr(unitname,'(')){ /* function definition */
if (newfunction(unitname,unitdef,&locfunccount,linenum,
permfile,errfile,redefinition))
goterr = 1;
}
else { /* ordinary unit definition */
if (newunit(unitname,unitdef,&locunitcount,linenum,permfile,errfile,redefinition))
goterr = 1;
}
}
fclose(unitfile);
free(line);
if (unitcount)
*unitcount+=locunitcount;
if (prefixcount)
*prefixcount+=locprefixcount;
if (funccount)
*funccount+=locfunccount;
if (goterr)
return E_BADFILE;
else return 0;
}
/* Initialize a unit to be equal to 1. */
void
initializeunit(struct unittype *theunit)
{
theunit->factor = 1.0;
theunit->numerator[0] = theunit->denominator[0] = NULL;
}
/* Free a unit: frees all the strings used in the unit structure.
Does not free the unit structure itself. */
void
freeunit(struct unittype *theunit)
{
char **ptr;
for(ptr = theunit->numerator; *ptr; ptr++)
if (*ptr != NULLUNIT) free(*ptr);
for(ptr = theunit->denominator; *ptr; ptr++)
if (*ptr != NULLUNIT) free(*ptr);
/* protect against repeated calls to freeunit() */
theunit->numerator[0] = 0;
theunit->denominator[0] = 0;
}
/* Print out a unit */
void
showunit(struct unittype *theunit)
{
char **ptr;
int printedslash;
int counter = 1;
logprintf(num_format.format, theunit->factor);
for (ptr = theunit->numerator; *ptr; ptr++) {
if (ptr > theunit->numerator && **ptr &&
!strcmp(*ptr, *(ptr - 1)))
counter++;
else {
if (counter > 1)
logprintf("%s%d", powerstring, counter);
if (**ptr)
logprintf(" %s", *ptr);
counter = 1;
}
}
if (counter > 1)
logprintf("%s%d", powerstring, counter);
counter = 1;
printedslash = 0;
for (ptr = theunit->denominator; *ptr; ptr++) {
if (ptr > theunit->denominator && **ptr &&
!strcmp(*ptr, *(ptr - 1)))
counter++;
else {
if (counter > 1)
logprintf("%s%d", powerstring, counter);
if (**ptr) {
if (!printedslash)
logprintf(" /");
printedslash = 1;
logprintf(" %s", *ptr);
}
counter = 1;
}
}
if (counter > 1)
logprintf("%s%d", powerstring, counter);
}
/* qsort comparison function */
int
compare(const void *item1, const void *item2)
{
return strcmp(*(char **) item1, *(char **) item2);
}
/* Sort numerator and denominator of a unit so we can compare different
units */
void
sortunit(struct unittype *theunit)
{
char **ptr;
int count;
for (count = 0, ptr = theunit->numerator; *ptr; ptr++, count++);
qsort(theunit->numerator, count, sizeof(char *), compare);
for (count = 0, ptr = theunit->denominator; *ptr; ptr++, count++);
qsort(theunit->denominator, count, sizeof(char *), compare);
}
/* Cancels duplicate units that appear in the numerator and
denominator. The input unit must be sorted. */
void
cancelunit(struct unittype *theunit)
{
char **den, **num;
int comp;
den = theunit->denominator;
num = theunit->numerator;
while (*num && *den) {
comp = strcmp(*den, *num);
if (!comp) { /* units match, so cancel them */
if (*den!=NULLUNIT) free(*den);
if (*num!=NULLUNIT) free(*num);
*den++ = NULLUNIT;
*num++ = NULLUNIT;
} else if (comp < 0) /* Move up whichever pointer is alphabetically */
den++; /* behind to look for future matches */
else
num++;
}
}
/*
Looks up the definition for the specified unit including prefix processing
and plural removal.
Returns a pointer to the definition or a null pointer
if the specified unit does not appear in the units table.
Sometimes the returned pointer will be a pointer to the special
buffer created to hold the data. This buffer grows as needed during
program execution.
Note that if you pass the output of lookupunit() back into the function
again you will get correct results, but the data you passed in may get
clobbered if it happened to be the internal buffer.
*/
static int bufsize=0;
static char *buffer; /* buffer for lookupunit answers with prefixes */
/*
Plural rules for english: add -s
after x, sh, ch, ss add -es
-y becomes -ies except after a vowel when you just add -s as usual
*/
char *
lookupunit(char *unit,int prefixok)
{
char *copy;
struct prefixlist *pfxptr;
struct unitlist *uptr;
if ((uptr = ulookup(unit)))
return uptr->value;
if (strwidth(unit)>2 && lastchar(unit) == 's') {
copy = dupstr(unit);
lastchar(copy) = 0;
if (lookupunit(copy,prefixok)){
while(strlen(copy)+1 > bufsize) {
growbuffer(&buffer, &bufsize);
}
strcpy(buffer, copy); /* Note: returning looked up result seems */
free(copy); /* better but it causes problems when it */
return buffer; /* contains PRIMITIVECHAR. */
}
if (strlen(copy)>2 && lastchar(copy) == 'e') {
lastchar(copy) = 0;
if (lookupunit(copy,prefixok)){
while (strlen(copy)+1 > bufsize) {
growbuffer(&buffer,&bufsize);
}
strcpy(buffer,copy);
free(copy);
return buffer;
}
}
if (strlen(copy)>2 && lastchar(copy) == 'i') {
lastchar(copy) = 'y';
if (lookupunit(copy,prefixok)){
while (strlen(copy)+1 > bufsize) {
growbuffer(&buffer,&bufsize);
}
strcpy(buffer,copy);
free(copy);
return buffer;
}
}
free(copy);
}
if (prefixok && (pfxptr = plookup(unit))) {
copy = unit + pfxptr->len;
if (emptystr(copy) || lookupunit(copy,0)) {
char *tempbuf;
while (strlen(pfxptr->value)+strlen(copy)+2 > bufsize){
growbuffer(&buffer, &bufsize);
}
tempbuf = dupstr(copy); /* copy might point into buffer */
strcpy(buffer, pfxptr->value);
strcat(buffer, " ");
strcat(buffer, tempbuf);
free(tempbuf);
return buffer;
}
}
return 0;
}
/* Points entries of product[] to the strings stored in tomove[].
Leaves tomove pointing to a list of NULLUNITS. */
int
moveproduct(char *product[], char *tomove[])
{
char **dest, **src;
dest=product;
for(src = tomove; *src; src++){
if (*src == NULLUNIT) continue;
for(; *dest && *dest != NULLUNIT; dest++);
if (dest - product >= MAXSUBUNITS - 1) {
return E_PRODOVERFLOW;
}
if (!*dest)
*(dest + 1) = 0;
*dest = *src;
*src=NULLUNIT;
}
return 0;
}
/*
Make a copy of a product list. Note that no error checking is done
for overflowing the product list because it is assumed that the
source list doesn't overflow, so the destination list shouldn't
overflow either. (This assumption could be false if the
destination is not actually at the start of a product buffer.)
*/
void
copyproduct(char **dest, char **source)
{
for(;*source;source++,dest++) {
if (*source==NULLUNIT)
*dest = NULLUNIT;
else
*dest=dupstr(*source);
}
*dest=0;
}
/* Make a copy of a unit */
void
unitcopy(struct unittype *dest, struct unittype *source)
{
dest->factor = source->factor;
copyproduct(dest->numerator, source->numerator);
copyproduct(dest->denominator, source->denominator);
}
/* Multiply left by right. In the process, all of the units are
deleted from right (but it is not freed) */
int
multunit(struct unittype *left, struct unittype *right)
{
int myerr;
left->factor *= right->factor;
myerr = moveproduct(left->numerator, right->numerator);
if (!myerr)
myerr = moveproduct(left->denominator, right->denominator);
return myerr;
}
int
divunit(struct unittype *left, struct unittype *right)
{
int myerr;
left->factor /= right->factor;
myerr = moveproduct(left->numerator, right->denominator);
if (!myerr)
myerr = moveproduct(left->denominator, right->numerator);
return myerr;
}
/*
reduces a product of symbolic units to primitive units.
The three low bits are used to return flags:
bit 0 set if reductions were performed without error.
bit 1 set if no reductions are performed.
bit 2 set if an unknown unit is discovered.
Return values from multiple calls will be ORed together later.
*/
#define DIDREDUCTION (1<<0)
#define NOREDUCTION (1<<1)
#define REDUCTIONERROR (1<<2)
int
reduceproduct(struct unittype *theunit, int flip)
{
char *toadd;
char **product;
int didsomething = NOREDUCTION;
struct unittype newunit;
int ret;
if (flip)
product = theunit->denominator;
else
product = theunit->numerator;
for (; *product; product++) {
for (;;) {
if (!strlen(*product))
break;
toadd = lookupunit(*product,1);
if (!toadd) {
if (!irreducible)
irreducible = dupstr(*product);
return REDUCTIONERROR;
}
if (strchr(toadd, PRIMITIVECHAR))
break;
didsomething = DIDREDUCTION;
if (*product != NULLUNIT) {
free(*product);
*product = NULLUNIT;
}
if (parseunit(&newunit, toadd, 0, 0))
return REDUCTIONERROR;
if (flip) ret=divunit(theunit,&newunit);
else ret=multunit(theunit,&newunit);
freeunit(&newunit);
if (ret)
return REDUCTIONERROR;
}
}
return didsomething;
}
/*
Reduces numerator and denominator of the specified unit.
Returns 0 on success, or 1 on unknown unit error.
*/
int
reduceunit(struct unittype *theunit)
{
int ret;
if (irreducible)
free(irreducible);
irreducible=0;
ret = DIDREDUCTION;
/* Keep calling reduceproduct until it doesn't do anything */
while (ret & DIDREDUCTION) {
ret = reduceproduct(theunit, 0);
if (!(ret & REDUCTIONERROR))
ret |= reduceproduct(theunit, 1);
if (ret & REDUCTIONERROR){
if (irreducible)
return E_UNKNOWNUNIT;
else
return E_REDUCE;
}
}
return 0;
}
/*
Returns one if the argument unit is defined in the data file as a
dimensionless unit. This is determined by comparing its definition to
the string NODIM.
*/
int
ignore_dimless(char *name)
{
struct unitlist *ul;
if (!name)
return 0;
ul = ulookup(name);
if (ul && !strcmp(ul->value, NODIM))
return 1;
return 0;
}
int
ignore_nothing(char *name)
{
return 0;
}
int
ignore_primitive(char *name)
{
struct unitlist *ul;
if (!name)
return 0;
ul = ulookup(name);
if (ul && strchr(ul->value, PRIMITIVECHAR))
return 1;
return 0;
}
/*
Compare two product lists, return zero if they match and one if
they do not match. They may contain embedded NULLUNITs which are
ignored in the comparison. Units defined as NODIM are also ignored
in the comparison.
*/
int
compareproducts(char **one, char **two, int (*isdimless)(char *name))
{
int oneblank, twoblank;
while (*one || *two) {
oneblank = (*one==NULLUNIT) || isdimless(*one);
twoblank = (*two==NULLUNIT) || isdimless(*two);
if (!*one && !twoblank)
return 1;
if (!*two && !oneblank)
return 1;
if (oneblank)
one++;
else if (twoblank)
two++;
else if (strcmp(*one, *two))
return 1;
else
one++, two++;
}
return 0;
}
/* Return zero if units are compatible, nonzero otherwise. The units
must be reduced, sorted and canceled for this to work. */
int
compareunits(struct unittype *first, struct unittype *second,
int (*isdimless)(char *name))
{
return
compareproducts(first->numerator, second->numerator, isdimless) ||
compareproducts(first->denominator, second->denominator, isdimless);
}
/* Reduce a unit as much as possible */
int
completereduce(struct unittype *unit)
{
int err;
if ((err=reduceunit(unit)))
return err;
sortunit(unit);
cancelunit(unit);
return 0;
}
/* Raise theunit to the specified power. This function does not fill
in NULLUNIT gaps, which could be considered a deficiency. */
int
expunit(struct unittype *theunit, int power)
{
char **numptr, **denptr;
double thefactor;
int i, uind, denlen, numlen;
if (power==0){
freeunit(theunit);
initializeunit(theunit);
return 0;
}
numlen=0;
for(numptr=theunit->numerator;*numptr;numptr++) numlen++;
denlen=0;
for(denptr=theunit->denominator;*denptr;denptr++) denlen++;
thefactor=theunit->factor;
for(i=1;i<power;i++){
theunit->factor *= thefactor;
for(uind=0;uind<numlen;uind++){
if (theunit->numerator[uind]!=NULLUNIT){
if (numptr-theunit->numerator>=MAXSUBUNITS-1) {
*numptr=*denptr=0;
return E_PRODOVERFLOW;
}
*numptr++=dupstr(theunit->numerator[uind]);
}
}
for(uind=0;uind<denlen;uind++){
if (theunit->denominator[uind]!=NULLUNIT){
*denptr++=dupstr(theunit->denominator[uind]);
if (denptr-theunit->denominator>=MAXSUBUNITS-1) {
*numptr=*denptr=0;
return E_PRODOVERFLOW;
}
}
}
}
*numptr=0;
*denptr=0;
return 0;
}
int
unit2num(struct unittype *input)
{
struct unittype one;
int err;
initializeunit(&one);
if ((err=completereduce(input)))
return err;
if (compareunits(input,&one,ignore_nothing))
return E_NOTANUMBER;
freeunit(input);
return 0;
}
int
unitdimless(struct unittype *input)
{
struct unittype one;
initializeunit(&one);
if (compareunits(input, &one, ignore_dimless))
return 0;
freeunit(input); /* Eliminate dimensionless units from list */
return 1;
}
#if 0
void showunitdetail(struct unittype *foo)
{
char **ptr;
printf("%.17g ", foo->factor);
for(ptr=foo->numerator;*ptr;ptr++)
if (*ptr==NULLUNIT) printf("NULL ");
else printf("`%s' ", *ptr);
printf(" / ");
for(ptr=foo->denominator;*ptr;ptr++)
if (*ptr==NULLUNIT) printf("NULL ");
else printf("`%s' ", *ptr);
putchar('\n');
}
#endif
/*
The unitroot function takes the nth root of an input unit which has
been completely reduced. Returns 1 if the unit is not a power of n.
Input data can contain NULLUNITs.
*/
int
subunitroot(int n,char *current[], char *out[])
{
char **ptr;
int count=0;
while(*current==NULLUNIT) current++; /* skip past NULLUNIT entries */
ptr=current;
while(*ptr){
while(*ptr){
if (*ptr!=NULLUNIT){
if (strcmp(*current,*ptr)) break;
count++;
}
ptr++;
}
if (count % n != 0){ /* If not dimensionless generate error, otherwise */
if (!ignore_dimless(*current)) /* just skip over it */
return E_NOTROOT;
} else {
for(count /= n;count>0;count--) *(out++) = dupstr(*current);
}
current=ptr;
}
*out = 0;
return 0;
}
int
rootunit(struct unittype *inunit,int n)
{
struct unittype outunit;
int err;
initializeunit(&outunit);
if ((err=completereduce(inunit)))
return err;
/* Roots of negative numbers fail in pow(), even odd roots */
if (inunit->factor < 0)
return E_NOTROOT;
outunit.factor = pow(inunit->factor,1.0/(double)n);
if ((err = subunitroot(n, inunit->numerator, outunit.numerator)))
return err;
if ((err = subunitroot(n, inunit->denominator, outunit.denominator)))
return err;
freeunit(inunit);
initializeunit(inunit);
return multunit(inunit,&outunit);
}
/* Compute the inverse of a unit (1/theunit) */
void
invertunit(struct unittype *theunit)
{
char **ptr, *swap;
int numlen, length, ind;
theunit->factor = 1.0/theunit->factor;
length=numlen=0;
for(ptr=theunit->denominator;*ptr;ptr++,length++);
for(ptr=theunit->numerator;*ptr;ptr++,numlen++);
if (numlen>length)
length=numlen;
for(ind=0;ind<=length;ind++){
swap = theunit->numerator[ind];
theunit->numerator[ind] = theunit->denominator[ind];
theunit->denominator[ind] = swap;
}
}
int
float2rat(double y, int *p, int *q)
{
int coef[20]; /* How long does this buffer need to be? */
int i,termcount,saveq;
double fracpart,x;
/* Compute continued fraction approximation */
x=y;
termcount=0;
while(1){
coef[termcount] = (int) floor(x);
fracpart = x-coef[termcount];
if (fracpart < .001 || termcount==19) break;
x = 1/fracpart;
termcount++;
}
/* Compress continued fraction into rational p/q */
*p=0;
*q=1;
for(i=termcount;i>=1;i--) {
saveq=*q;
*q = coef[i] * *q + *p;
*p = saveq;
}
*p+=*q*coef[0];
return *q<MAXSUBUNITS && fabs((double)*p / (double)*q - y) < DBL_EPSILON;
}
/* Raise a unit to a power */
int
unitpower(struct unittype *base, struct unittype *exponent)
{
int errcode, p, q;
errcode = unit2num(exponent);
if (errcode == E_NOTANUMBER)
return E_DIMEXPONENT;
if (errcode)
return errcode;
errcode = unit2num(base);
if (!errcode){ /* Exponent base is dimensionless */
base->factor = pow(base->factor,exponent->factor);
if (errno)
return E_FUNC;
}
else if (errcode==E_NOTANUMBER) { /* Base not dimensionless */
if (!float2rat(exponent->factor,&p,&q)){ /* Exponent must be rational */
if (unitdimless(base)){
base->factor = pow(base->factor,exponent->factor);
if (errno)
return E_FUNC;
}
else
return E_IRRATIONAL_EXPONENT;
} else {
if (q!=1) {
errcode = rootunit(base, q);
if (errcode == E_NOTROOT)
return E_BASE_NOTROOT;
if (errcode)
return errcode;
}
errcode = expunit(base, abs(p));
if (errcode)
return errcode;
if (p<0)
invertunit(base);
}
}
else return errcode;
return 0;
}
/* Old units program would give message about what each operand
reduced to, showing that they weren't conformable. Can this
be achieved here? */
int
addunit(struct unittype *unita, struct unittype *unitb)
{
int err;
if ((err=completereduce(unita)))
return err;
if ((err=completereduce(unitb)))
return err;
if (compareunits(unita,unitb,ignore_nothing))
return E_BADSUM;
unita->factor += unitb->factor;
freeunit(unitb);
return 0;
}
double
linearinterp(double a, double b, double aval, double bval, double c)
{
double lambda;
lambda = (b-c)/(b-a);
return lambda*aval + (1-lambda)*bval;
}
/* evaluate a user function */
#define INVERSE 1
#define FUNCTION 0
#define ALLERR 1
#define NORMALERR 0
int
evalfunc(struct unittype *theunit, struct func *infunc, int inverse,
int allerrors)
{
struct unittype result;
struct functype *thefunc;
int err;
double value;
int foundit, count;
struct unittype *save_value;
char *save_function;
if (infunc->table) { /* Tables are short, so use dumb search algorithm */
err = parseunit(&result, infunc->tableunit, 0, 0);
if (err)
return E_BADFUNCDIMEN;
if (inverse){
err = divunit(theunit, &result);
if (err)
return err;
err = unit2num(theunit);
if (err==E_NOTANUMBER)
return E_BADFUNCARG;
if (err)
return err;
value = theunit->factor;
foundit=0;
for(count=0;count<infunc->tablelen-1;count++)
if ((infunc->table[count].value<=value &&
value<=infunc->table[count+1].value) ||
(infunc->table[count+1].value<=value &&
value<=infunc->table[count].value)){
foundit=1;
value = linearinterp(infunc->table[count].value,
infunc->table[count+1].value,
infunc->table[count].location,
infunc->table[count+1].location,
value);
break;
}
if (!foundit)
return E_NOTINDOMAIN;
freeunit(&result);
freeunit(theunit);
theunit->factor = value;
return 0;
} else {
err=unit2num(theunit);
if (err)
return err;
value=theunit->factor;
foundit=0;
for(count=0;count<infunc->tablelen-1;count++)
if (infunc->table[count].location<=value &&
value<=infunc->table[count+1].location){
foundit=1;
value = linearinterp(infunc->table[count].location,
infunc->table[count+1].location,
infunc->table[count].value,
infunc->table[count+1].value,
value);
break;
}
if (!foundit)
return E_NOTINDOMAIN;
result.factor *= value;
}
} else { /* it's a function */
if (inverse){
thefunc=&(infunc->inverse);
if (!thefunc->def)
return E_NOINVERSE;
}
else
thefunc=&(infunc->forward);
err = completereduce(theunit);
if (err)
return err;
if (thefunc->dimen){
err = parseunit(&result, thefunc->dimen, 0, 0);
if (err)
return E_BADFUNCDIMEN;
err = completereduce(&result);
if (err)
return E_BADFUNCDIMEN;
if (compareunits(&result, theunit, ignore_nothing))
return E_BADFUNCARG;
value = theunit->factor/result.factor;
} else
value = theunit->factor;
if (thefunc->domain_max &&
(value > *thefunc->domain_max ||
(thefunc->domain_max_open && value == *thefunc->domain_max)))
return E_NOTINDOMAIN;
if (thefunc->domain_min &&
(value < *thefunc->domain_min ||
(thefunc->domain_min_open && value == *thefunc->domain_min)))
return E_NOTINDOMAIN;
save_value = parameter_value;
save_function = function_parameter;
parameter_value = theunit;
function_parameter = thefunc->param;
err = parseunit(&result, thefunc->def, 0,0);
function_parameter = save_function;
parameter_value = save_value;
if (err && (allerrors == ALLERR || err==E_PARSEMEM || err==E_PRODOVERFLOW
|| err==E_NOTROOT || err==E_BADFUNCTYPE))
return err;
if (err)
return E_FUNARGDEF;
}
freeunit(theunit);
initializeunit(theunit);
multunit(theunit, &result);
return 0;
}
/*
If the given character string has only one unit name in it, then print out
the rule for that unit. In any case, print out the reduced form for
the unit.
*/
void
showdefinition(char *unitstr, struct unittype *theunit)
{
logputs(deftext);
while((unitstr = lookupunit(unitstr,1))
&& strspn(unitstr,digits) != strlen(unitstr)
&& !strchr(unitstr,PRIMITIVECHAR)) {
tightprint(stdout,unitstr);
if (logfile) tightprint(logfile,unitstr);
logputs(" = ");
}
showunit(theunit);
logputchar('\n');
}
void
showfunction(struct functype *func)
{
struct unittype unit;
int not_dimensionless, i;
if (!func->def) {
logputs(" is undefined");
return;
}
if (func->dimen){ /* coverity[check_return] */
parseunit(&unit,func->dimen,0,0); /* unit2num returns 0 for */
not_dimensionless = unit2num(&unit); /* dimensionless units */
}
logprintf("(%s) = %s", func->param, func->def);
if (func->domain_min || func->domain_max){
logputchar('\n');
for(i=strwidth(deftext);i;i--) logputchar(' ');
logputs("defined for ");
if (func->domain_min && func->domain_max) {
logprintf(num_format.format, *func->domain_min);
if (func->dimen && (not_dimensionless || unit.factor != 1)){
if (isdecimal(*func->dimen))
logputs(" *");
logprintf(" %s",func->dimen);
}
logputs(func->domain_min_open?" < ":" <= ");
}
logputs(func->param);
if (func->domain_max){
logputs(func->domain_max_open?" < ":" <= ");
logprintf(num_format.format, *func->domain_max);
}
else {
logputs(func->domain_min_open?" > ":" >= ");
logprintf(num_format.format, *func->domain_min);
}
if (func->dimen && (not_dimensionless || unit.factor != 1)){
if (isdecimal(*func->dimen))
logputs(" *");
logprintf(" %s",func->dimen);
}
if (!func->dimen) logputs(" (any units)");
} else if (func->dimen){
logputchar('\n');
for(i=strwidth(deftext);i;i--) logputchar(' ');
if (not_dimensionless)
logprintf("%s has units %s",func->param, func->dimen);
else
logprintf("%s is dimensionless",func->param);
}
logputchar('\n');
}
void
showtable(struct func *fun, int inverse)
{
int i;
logprintf("%sinterpolated table with points\n",deftext);
if (inverse){
int reverse, j;
reverse = (fun->table[0].value > fun->table[fun->tablelen-1].value);
for(i=0;i<fun->tablelen;i++){
if (reverse) j = fun->tablelen-i-1;
else j=i;
if (flags.verbose>0)
logputs("\t\t ");
logprintf("~%s(", fun->name);
logprintf(num_format.format, fun->table[j].value);
if (isdecimal(fun->tableunit[0]))
logputs(" *");
logprintf(" %s",fun->tableunit);
logputs(") = ");
logprintf(num_format.format, fun->table[j].location);
logputchar('\n');
}
} else {
for(i=0;i<fun->tablelen;i++){
if (flags.verbose>0)
logputs("\t\t ");
logprintf("%s(", fun->name);
logprintf(num_format.format, fun->table[i].location);
logputs(") = ");
logprintf(num_format.format, fun->table[i].value);
if (isdecimal(fun->tableunit[0]))
logputs(" *");
logprintf(" %s\n",fun->tableunit);
}
}
}
void
showfuncdefinition(struct func *fun, int inverse)
{
if (fun->table) /* It's a table */
showtable(fun, inverse);
else {
logprintf("%s%s%s", deftext,inverse?"~":"", fun->name);
if (inverse)
showfunction(&fun->inverse);
else
showfunction(&fun->forward);
}
}
void
showunitlistdef(struct wantalias *alias)
{
logprintf("%sunit list, ",deftext);
tightprint(stdout,alias->definition);
if (logfile) tightprint(logfile,alias->definition);
logputchar('\n');
}
/* Show conversion to a function. Input unit 'have' is replaced by the
function inverse and completely reduced. */
int
showfunc(char *havestr, struct unittype *have, struct func *fun)
{
int err;
char *dimen;
err = evalfunc(have, fun, INVERSE, NORMALERR);
if (!err)
err = completereduce(have);
if (err) {
if (err==E_BADFUNCARG){
logputs("conformability error");
if (fun->table)
dimen = fun->tableunit;
else if (fun->inverse.dimen)
dimen = fun->inverse.dimen;
else
dimen = 0;
if (!dimen)
logputchar('\n');
else {
struct unittype want;
if (emptystr(dimen))
dimen = "1";
logprintf(": conversion requires dimensions of '%s'\n",dimen);
if (flags.verbose==2) logprintf("\t%s = ",havestr);
else if (flags.verbose==1) logputchar('\t');
showunit(have);
if (flags.verbose==2) logprintf("\n\t%s = ",dimen);
else if (flags.verbose==1) logprintf("\n\t");
else logputchar('\n'); /* coverity[check_return] */
parseunit(&want, dimen, 0, 0); /* coverity[check_return] */
completereduce(&want); /* dimen was already checked for */
showunit(&want); /* errors so no need to check here */
logputchar('\n');
}
} else if (err==E_NOTINDOMAIN)
logprintf("Value '%s' is not in the function's range\n",havestr);
else
logputs("Function evaluation error (bad function definition)\n");
return 1;
}
if (flags.verbose==2)
logprintf("\t%s = %s(", havestr, fun->inverse.param);
else if (flags.verbose==1)
logputchar('\t');
showunit(have);
if (flags.verbose==2)
logputchar(')');
logputchar('\n');
return 0;
}
/* Print the conformability error message */
void
showconformabilityerr(char *havestr,struct unittype *have,
char *wantstr,struct unittype *want)
{
logputs("conformability error\n");
if (flags.verbose==2)
logprintf("\t%s = ",havestr);
else if (flags.verbose==1)
logputchar('\t');
showunit(have);
if (flags.verbose==2)
logprintf("\n\t%s = ",wantstr);
else if (flags.verbose==1)
logputs("\n\t");
else
logputchar('\n');
showunit(want);
logputchar('\n');
} /* end showconformabilityerr */
/*
determine whether a unit string begins with a fraction; assume it
does if it starts with an integer, '|', and another integer
*/
int
isfract(const char *unitstr)
{
char *enddouble=0, *endlong=0;
while (isdigit(*unitstr))
unitstr++;
if (*unitstr++ == '|') {
(void)strtod(unitstr, &enddouble);
(void)strtol(unitstr, &endlong, 10);
if (enddouble == endlong)
return 1;
}
return 0;
}
int
checksigdigits(char *arg)
{
int errors, ival;
char *nonum;
errors = 0;
if (!strcmp(arg, "max"))
num_format.precision = MAXPRECISION;
else {
ival = (int) strtol(arg, &nonum, 10);
if (!emptystr(nonum)) {
fprintf(stderr,
"%s: invalid significant digits (%s)--integer value or 'max' required\n",
progname, arg);
errors++;
}
else if (ival <= 0) {
fprintf(stderr, "%s: number of significant digits must be positive\n",
progname);
errors++;
}
else if (ival > MAXPRECISION) {
fprintf(stderr,
"%s: too many significant digits (%d)--using maximum value (%d)\n",
progname, ival, MAXPRECISION);
num_format.precision = MAXPRECISION;
}
else
num_format.precision = ival;
}
if (errors)
return -1;
else
return 0;
}
/* set output number format specification from significant digits and type */
int
setnumformat()
{
size_t len;
if (strchr("Ee", num_format.type))
num_format.precision--;
len = 4; /* %, decimal point, type, terminating NUL */
if (num_format.precision > 0)
len += (size_t) floor(log10((double) num_format.precision))+1;
num_format.format = (char *) mymalloc(len, "(setnumformat)");
sprintf(num_format.format, "%%.%d%c", num_format.precision, num_format.type);
return 0;
}
/*
parse and validate the output number format specification and
extract its type and precision into the num_format structure.
Returns nonzero for invalid format.
*/
int
parsenumformat()
{
static char *format_types = NULL;
static char *format_flags = "+-# 0'";
static char badflag;
char *two = "0x1p+1";
char *valid="ABCDEFGHIJKLMNOPQRSTUVWXYXabcdefghijklmnopqrstuvwxyx.01234567890";
char *dotptr, *lptr, *nonum, *p;
char testbuf[80];
int errors, ndx;
if (format_types == NULL){
format_types = (char *) mymalloc(strlen(BASE_FORMATS)+4, "(parsenumformat)");
strcpy(format_types,BASE_FORMATS);
/* check for support of type 'F' (MS VS 2012 doesn't have it) */
sprintf(testbuf, "%.1F", 1.2);
if (strlen(testbuf) == 3 && testbuf[0] == '1' && testbuf[2] == '2')
strcat(format_types,"F");
/* check for support of hexadecimal floating point */
sprintf(testbuf, "%.0a", 2.0);
if (!strcmp(testbuf,two))
strcat(format_types, "aA");
/* check for support of digit-grouping (') flag */
sprintf(testbuf, "%'.0f", 1234.0);
if (strlen(testbuf) > 2 && testbuf[0] == '1' && testbuf[2] == '2')
badflag = '\0'; /* supported */
else
badflag = '\''; /* not supported */
}
errors = 0;
p = num_format.format;
if (*p != '%') {
fprintf(stderr, "%s: number format specification must start with '%%'\n",
progname);
errors++;
}
else if (strrchr(num_format.format, '%') != num_format.format) {
fprintf(stderr, "%s: only one '%%' allowed in number format specification\n",
progname);
errors++;
p++;
}
else
p++;
dotptr = strchr(num_format.format, '.');
if (dotptr && strrchr(num_format.format, '.') != dotptr) {
fprintf(stderr, "%s: only one '.' allowed in number format specification\n",
progname);
errors++;
}
/* skip over flags */
while (*p && strchr(format_flags, *p)) {
if (*p == badflag) { /* only if digit-grouping flag (') not supported */
fprintf(stderr, "%s: digit-grouping flag (') not supported\n", progname);
errors++;
}
p++;
}
/* check for type length modifiers, which aren't allowed */
if ((lptr = strstr(num_format.format, "hh"))
|| (lptr = strstr(num_format.format, "ll"))) {
fprintf(stderr, "%s: type length modifier (%.2s) not supported\n", progname, lptr);
errors++;
}
else if ((lptr = strpbrk(num_format.format, "hjLltz"))) {
fprintf(stderr, "%s: type length modifier (%c) not supported\n", progname, lptr[0]);
errors++;
}
/* check for other invalid characters */
ndx = strspn(p, valid);
if (ndx < strlen(p)) {
fprintf(stderr, "%s: invalid character (%c) in width, precision, or type\n",
progname, p[ndx]);
errors++;
}
if (errors) { /* results of any other checks are likely to be misleading */
fprintf(stderr, "%s: invalid number format specification (%s)\n",
progname, num_format.format);
fprintf(stderr, "%s: valid specification is %%[flags][width][.precision]type\n",
progname);
return -1;
}
/* get width and precision if specified; check precision */
num_format.width = (int) strtol(p, &nonum, 10);
if (*nonum == '.'){
if (isdigit(nonum[1]))
num_format.precision = (int) strtol(nonum+1, &nonum, 10);
else {
num_format.precision = 0;
nonum++;
}
}
else /* precision not given--use printf() default */
num_format.precision = 6;
/* check for valid format type */
if (emptystr(nonum)) {
fprintf(stderr, "%s: missing format type\n", progname);
errors++;
}
else {
if (strchr(format_types, *nonum)) {
if (nonum[1]) {
fprintf(stderr, "%s: invalid character(s) (%s) after format type\n",
progname, nonum + 1);
errors++;
}
else
num_format.type = *nonum;
}
else {
fprintf(stderr,
"%s: invalid format type (%c)--valid types are [%s]\n",
progname, *nonum, format_types);
errors++;
}
}
if (num_format.precision == 0 &&
(num_format.type == 'G' || num_format.type == 'g'))
num_format.precision = 1;
if (errors) {
fprintf(stderr, "%s: invalid number format specification (%s)\n",
progname, num_format.format);
fprintf(stderr, "%s: valid specification is %%[flags][width][.precision]type\n",
progname);
return -1;
}
else
return 0;
}
/* round a number to the displayed precision; indicate in hasnondigits
if a number will contain any character other than the digits 0-9 in
the current display format. */
double
round_to_displayed(double value, int *hasnondigits)
{
int buflen;
char *buf;
double rounded;
if (!isfinite(value)){
if (hasnondigits)
*hasnondigits = 1;
return value;
}
/* allow for sign (1), radix (1), exponent (5), E or E formats (1), NUL */
buflen = num_format.precision + 9;
if (num_format.width > buflen)
buflen = num_format.width;
if (strchr("Ff", num_format.type)) {
int len=num_format.precision+2;
if (fabs(value) > 1.0)
len += (int) floor(log10(fabs(value))) + 1;
if (len > buflen)
buflen = len;
}
/* allocate space for thousands separators with digit-grouping (') flag */
/* assume worst case--that all groups are two digits */
if (strchr(num_format.format, '\'') && strchr("FfGg", num_format.type))
buflen = buflen*3/2;
buf = (char *) mymalloc(buflen, "(round_to_displayed)");
sprintf(buf, num_format.format, value);
if (hasnondigits){
if (strspn(buf, "1234567890") != strlen(buf))
*hasnondigits = 1;
else
*hasnondigits = 0;
}
rounded = strtod(buf, NULL);
free(buf);
return rounded;
}
/* Print the unit in 'unitstr' along with any necessary punctuation.
The 'value' is the multiplier for the unit. If printnum is set
to PRINTNUM then this value is printed, or set it to NOPRINTNUM
to prevent the value from being printed.
*/
#define PRINTNUM 1
#define NOPRINTNUM 0
void
showunitname(double value, char *unitstr, int printnum)
{
int hasnondigits; /* flag to indicate nondigits in displayed value */
double rnd_value; /* value rounded to displayed precision */
rnd_value = round_to_displayed(value, &hasnondigits);
if (printnum && !(rnd_value == 1 && isdecimal(*unitstr)))
logprintf(num_format.format, value);
if (strpbrk(unitstr, "+-")) /* show sums and differences of units */
logprintf(" (%s)", unitstr); /* in parens */
/* fractional unit 1|x and multiplier is all digits and not one-- */
/* no space or asterisk or numerator (3|8 in instead of 3 * 1|8 in) */
else if (printnum && !flags.showfactor
&& startswith(unitstr,"1|") && isfract(unitstr)
&& rnd_value != 1 && !hasnondigits)
logputs(unitstr+1);
/* multiplier is unity and unit begins with a number--no space or */
/* asterisk (multiplier was not shown, and the space was already output)*/
else if (rnd_value == 1 && isdecimal(*unitstr))
logputs(unitstr);
/* unitstr begins with a non-fraction number and multiplier was */
/* shown--prefix a spaced asterisk */
else if (isdecimal(unitstr[0]))
logprintf(" * %s", unitstr);
else
logprintf(" %s", unitstr);
}
/* Show the conversion factors or print the conformability error message */
int
showanswer(char *havestr,struct unittype *have,
char *wantstr,struct unittype *want)
{
struct unittype invhave;
int doingrec; /* reciprocal conversion? */
char *right = NULL, *left = NULL;
doingrec=0;
if (compareunits(have, want, ignore_dimless)) {
char **src,**dest;
invhave.factor=1/have->factor;
for(src=have->numerator,dest=invhave.denominator;*src;src++,dest++)
*dest=*src;
*dest=0;
for(src=have->denominator,dest=invhave.numerator;*src;src++,dest++)
*dest=*src;
*dest=0;
if (flags.strictconvert || compareunits(&invhave, want, ignore_dimless)){
showconformabilityerr(havestr, have, wantstr, want);
return -1;
}
if (flags.verbose>0)
logputchar('\t');
logputs("reciprocal conversion\n");
have=&invhave;
doingrec=1;
}
if (flags.verbose==2) {
if (!doingrec)
left=right="";
else if (strchr(havestr,'/')) {
left="1 / (";
right=")";
} else {
left="1 / ";
right="";
}
}
/* Print the first line of output. */
if (flags.verbose==2)
logprintf("\t%s%s%s = ",left,havestr,right);
else if (flags.verbose==1)
logputs("\t* ");
if (flags.verbose==2)
showunitname(have->factor / want->factor, wantstr, PRINTNUM);
else
logprintf(num_format.format, have->factor / want->factor);
/* Print the second line of output. */
if (!flags.oneline){
if (flags.verbose==2)
logprintf("\n\t%s%s%s = (1 / ",left,havestr,right);
else if (flags.verbose==1)
logputs("\n\t/ ");
else
logputchar('\n');
logprintf(num_format.format, want->factor / have->factor);
if (flags.verbose==2) {
logputchar(')');
showunitname(0,wantstr, NOPRINTNUM);
}
}
logputchar('\n');
return 0;
}
/* Checks that the function definition has a valid inverse
Prints a message to stdout if function has bad definition or
invalid inverse.
*/
#define SIGN(x) ( (x) > 0.0 ? 1 : \
( (x) < 0.0 ? (-1) : \
0 ))
void
checkfunc(struct func *infunc, int verbose)
{
struct unittype theunit, saveunit;
struct prefixlist *prefix;
int err, i;
double direction;
if (infunc->skip_error_check){
if (verbose)
printf("skipped function '%s'\n", infunc->name);
return;
}
if (verbose)
printf("doing function '%s'\n", infunc->name);
if ((prefix=plookup(infunc->name))
&& strlen(prefix->name)==strlen(infunc->name))
printf("Warning: '%s' defined as prefix and function\n",infunc->name);
if (infunc->table){
/* Check for valid unit for the table */
if (parseunit(&theunit, infunc->tableunit, 0, 0) ||
completereduce(&theunit))
printf("Table '%s' has invalid units '%s'\n",
infunc->name, infunc->tableunit);
freeunit(&theunit);
/* Check for monotonicity which is needed for unique inverses */
if (infunc->tablelen<=1){
printf("Table '%s' has only one data point\n", infunc->name);
return;
}
direction = SIGN(infunc->table[1].value - infunc->table[0].value);
for(i=2;i<infunc->tablelen;i++)
if (SIGN(infunc->table[i].value-infunc->table[i-1].value) != direction){
printf("Table '%s' lacks unique inverse around entry %.8g\n",
infunc->name, infunc->table[i].location);
return;
}
return;
}
if (infunc->forward.dimen){
if (parseunit(&theunit, infunc->forward.dimen, 0, 0) ||
completereduce(&theunit)){
printf("Function '%s' has invalid units '%s'\n",
infunc->name, infunc->forward.dimen);
freeunit(&theunit);
return;
}
} else initializeunit(&theunit);
if (infunc->forward.domain_max && infunc->forward.domain_min)
theunit.factor *=
(*infunc->forward.domain_max+*infunc->forward.domain_min)/2;
else if (infunc->forward.domain_max)
theunit.factor = theunit.factor * *infunc->forward.domain_max - 1;
else if (infunc->forward.domain_min)
theunit.factor = theunit.factor * *infunc->forward.domain_min + 1;
else
theunit.factor *= 7; /* Arbitrary choice where we evaluate inverse */
if (infunc->forward.dimen){
unitcopy(&saveunit, &theunit);
err = evalfunc(&theunit, infunc, FUNCTION, ALLERR);
if (err) {
printf("Error in definition %s(%s) as '%s':\n",
infunc->name, infunc->forward.param, infunc->forward.def);
printf(" %s\n",errormsg[err]);
freeunit(&theunit);
freeunit(&saveunit);
return;
}
} else {
# define MAXPOWERTOCHECK 4
struct unittype resultunit, arbunit;
char unittext[9];
double factor;
int errors[MAXPOWERTOCHECK], errcount=0;
char *indent;
strcpy(unittext,"(kg K)^ ");
factor = theunit.factor;
initializeunit(&saveunit);
initializeunit(&resultunit);
for(i=0;i<MAXPOWERTOCHECK;i++){
lastchar(unittext) = '0'+i;
err = parseunit(&arbunit, unittext, 0, 0);
if (err) initializeunit(&arbunit);
arbunit.factor = factor;
unitcopy(&resultunit, &arbunit);
errors[i] = evalfunc(&resultunit, infunc, FUNCTION, ALLERR);
if (errors[i]) errcount++;
else {
freeunit(&saveunit);
freeunit(&theunit);
unitcopy(&saveunit, &arbunit);
unitcopy(&theunit, &resultunit);
}
freeunit(&resultunit);
freeunit(&arbunit);
}
if (!errors[0] && errcount==3) {
printf("Warning: function '%s(%s)' defined as '%s'\n",
infunc->name, infunc->forward.param, infunc->forward.def);
printf(" appears to require a dimensionless argument, 'units' keyword not given\n");
indent = " ";
}
else if (errcount==MAXPOWERTOCHECK) {
printf("Error or missing 'units' keyword in definion %s(%s) as '%s'\n",
infunc->name, infunc->forward.param, infunc->forward.def);
indent=" ";
}
else if (errcount){
printf("Warning: function '%s(%s)' defined as '%s'\n",
infunc->name, infunc->forward.param, infunc->forward.def);
printf(" failed for some test inputs:\n");
indent = " ";
}
for(i=0;i<MAXPOWERTOCHECK;i++)
if (errors[i]) {
lastchar(unittext) = '0'+i;
printf("%s%s(",indent,infunc->name);
printf(num_format.format, factor);
printf("%s): %s\n", unittext, errormsg[errors[i]]);
}
}
if (completereduce(&theunit)){
printf("Definition %s(%s) as '%s' is irreducible\n",
infunc->name, infunc->forward.param, infunc->forward.def);
freeunit(&theunit);
freeunit(&saveunit);
return;
}
if (!(infunc->inverse.def)){
printf("Warning: no inverse for function '%s'\n", infunc->name);
freeunit(&theunit);
freeunit(&saveunit);
return;
}
err = evalfunc(&theunit, infunc, INVERSE, ALLERR);
if (err){
printf("Error in inverse ~%s(%s) as '%s':\n",
infunc->name,infunc->inverse.param, infunc->inverse.def);
printf(" %s\n",errormsg[err]);
freeunit(&theunit);
freeunit(&saveunit);
return;
}
divunit(&theunit, &saveunit);
if (unit2num(&theunit) || fabs(theunit.factor-1)>1e-12)
printf("Inverse is not the inverse for function '%s'\n", infunc->name);
freeunit(&theunit);
}
struct namedef {
char *name;
char *def;
};
#define CONFORMABLE 1
#define TEXTMATCH 2
void
addtolist(struct unittype *have, char *searchstring, char *rname, char *name,
char *def, struct namedef **list, int *listsize,
int *maxnamelen, int *count, int searchtype)
{
struct unittype want;
int len = 0;
int keepit = 0;
if (!name)
return;
if (searchtype==CONFORMABLE){
initializeunit(&want);
if (!parseunit(&want, name,0,0) && !completereduce(&want))
keepit = !compareunits(have,&want,ignore_dimless);
} else if (searchtype == TEXTMATCH) {
keepit = (strstr(rname,searchstring) != NULL);
}
if (keepit){
if (*count==*listsize){
*listsize += 100;
*list = (struct namedef *)
realloc(*list,*listsize*sizeof(struct namedef));
if (!*list){
fprintf(stderr, "%s: memory allocation error (addtolist)\n",
progname);
exit(EXIT_FAILURE);
}
}
(*list)[*count].name = rname;
if (strchr(def, PRIMITIVECHAR))
(*list)[*count].def = "<primitive unit>";
else
(*list)[*count].def = def;
(*count)++;
len = strwidth(name);
if (len>*maxnamelen)
*maxnamelen = len;
}
if (searchtype == CONFORMABLE)
freeunit(&want);
}
int
compnd(const void *a, const void *b)
{
return strcmp(((struct namedef *)a)->name, ((struct namedef *)b)->name);
}
/* Ideally this would return the actual screen height, but it's so
hard to code that portably... */
int
screensize()
{
return 20;
}
/*
If have is non-NULL then search through all units and print the ones
which are conformable with have. Otherwise search through all the
units for ones whose names contain the second argument as a substring.
*/
void
tryallunits(struct unittype *have, char *searchstring)
{
struct unitlist *uptr;
struct namedef *list;
int listsize, maxnamelen, count;
struct func *funcptr;
struct wantalias *aliasptr;
int i, j, searchtype;
FILE *outfile;
char *seploc, *firstunit;
list = (struct namedef *) mymalloc( 100 * sizeof(struct namedef),
"(tryallunits)");
listsize = 100;
maxnamelen = 0;
count = 0;
if (have)
searchtype = CONFORMABLE;
else {
if (!searchstring)
searchstring="";
searchtype = TEXTMATCH;
}
for(i=0;i<HASHSIZE;i++)
for (uptr = utab[i]; uptr; uptr = uptr->next)
addtolist(have, searchstring, uptr->name, uptr->name, uptr->value,
&list, &listsize, &maxnamelen, &count, searchtype);
for(i=0;i<SIMPLEHASHSIZE;i++)
for(funcptr=ftab[i];funcptr;funcptr=funcptr->next){
if (funcptr->table)
addtolist(have, searchstring, funcptr->name, funcptr->tableunit,
"<piecewise linear>", &list, &listsize, &maxnamelen, &count,
searchtype);
else
addtolist(have, searchstring, funcptr->name, funcptr->inverse.dimen,
"<nonlinear>", &list, &listsize, &maxnamelen, &count,
searchtype);
}
for(aliasptr=firstalias;aliasptr;aliasptr=aliasptr->next){
firstunit = dupstr(aliasptr->definition);/* coverity[var_assigned] */
seploc = strchr(firstunit,UNITSEPCHAR); /* Alias definitions allowed in */
*seploc = 0; /* database contain UNITSEPCHAR */
addtolist(have, searchstring, aliasptr->name, firstunit,
aliasptr->definition, &list, &listsize, &maxnamelen, &count,
searchtype);
free(firstunit);
}
qsort(list, count, sizeof(struct namedef), compnd);
outfile = 0;
if (count==0)
puts("No matching units found.");
#ifdef SIGPIPE
signal(SIGPIPE, SIG_IGN);
#endif
if (count>screensize()){
outfile = popen(pager, "w");
}
if (!outfile)
outfile = stdout;
for(i=0;i<count;i++){
fputs(list[i].name,outfile);
for(j=strwidth(list[i].name);j<=maxnamelen;j++)
putc(' ',outfile);
tightprint(outfile,list[i].def);
fputc('\n',outfile);
}
if (outfile != stdout)
pclose(outfile);
#ifdef SIGPIPE
signal(SIGPIPE, SIG_DFL);
#endif
}
/* If quiet is false then prompt user with the query.
Fetch one line of input and return it in *buffer.
The bufsize argument is a dummy argument if we are using readline.
The readline version frees buffer if it is non-null. The other
version keeps the same buffer and grows it as needed.
If no data is read, then this function exits the program.
*/
void
getuser_noreadline(char **buffer, int *bufsize, const char *query)
{
#ifdef SUPPORT_UTF8
int valid = 0;
while(!valid){
fputs(query, stdout);
if (!fgetslong(buffer, bufsize, stdin,0)){
if (!flags.quiet)
putchar('\n');
exit(EXIT_SUCCESS);
}
replacectrlchars(*buffer);
valid = strwidth(*buffer)>=0;
if (!valid)
printf("Error: %s\n",invalid_utf8);
}
#else
fputs(query, stdout);
if (!fgetslong(buffer, bufsize, stdin,0)){
if (!flags.quiet)
putchar('\n');
exit(EXIT_SUCCESS);
}
replacectrlchars(*buffer);
#endif
}
#ifndef READLINE
# define getuser getuser_noreadline
#else
/* we DO have readline */
void
getuser_readline(char **buffer, int *bufsize, const char *query)
{
#ifdef SUPPORT_UTF8
int valid = 0;
while (!valid){
if (*buffer) free(*buffer);
*buffer = readline(query);
if (*buffer)
replacectrlchars(*buffer);
if (!*buffer || strwidth(*buffer)>=0)
valid=1;
else
printf("Error: %s\n",invalid_utf8);
}
#else
if (*buffer) free(*buffer);
*buffer = readline(query);
if (*buffer)
replacectrlchars(*buffer);
#endif
if (*buffer && **buffer) add_history(*buffer);
if (!*buffer){
if (!flags.quiet)
putchar('\n');
exit(EXIT_SUCCESS);
}
}
void
getuser(char **buffer, int *bufsize, const char *query)
{
if (flags.readline)
getuser_readline(buffer,bufsize,query);
else
getuser_noreadline(buffer,bufsize,query);
}
/* Unit name completion for readline.
Complete function names or alias names or builtin functions.
Complete to the end of a prefix or complete to the end of a unit.
If the text includes a full prefix plus part of a unit and if the
prefix is longer than one character then complete that compound.
Don't complete a prefix fragment into prefix plus anything.
*/
#define CU_ALIAS 0
#define CU_BUILTIN 1
#define CU_FUNC 2
#define CU_PREFIX 3
#define CU_UNITS 4
#define CU_DONE 5
char *
completeunits(char *text, int state)
{
static int uhash, fhash, phash, checktype;
static struct prefixlist *curprefix, *unitprefix;
static struct unitlist *curunit;
static struct func *curfunc;
static struct wantalias *curalias;
static char **curbuiltin;
char *output = 0;
#ifndef NO_SUPPRESS_APPEND
rl_completion_suppress_append = 1;
#endif
if (!state){ /* state == 0 means this is the first call, so initialize */
checktype = 0; /* start at first type */
fhash = uhash = phash = 0;
unitprefix=0; /* search for unit continuations starting with this prefix */
curfunc=ftab[fhash];
curunit=utab[uhash];
curprefix=ptab[phash];
curbuiltin = builtins;
curalias = firstalias;
}
while (checktype != CU_DONE){
if (checktype == CU_ALIAS){
while(curalias){
if (startswith(curalias->name,text))
output = dupstr(curalias->name);
curalias = curalias->next;
if (output) return output;
}
checktype++;
}
if (checktype == CU_BUILTIN){
while(*curbuiltin){
if (startswith(*curbuiltin,text))
output = dupstr(*curbuiltin);
curbuiltin++;
if (output) return output;
}
checktype++;
}
while (checktype == CU_FUNC){
while (!curfunc && fhash<SIMPLEHASHSIZE-1){
fhash++;
curfunc = ftab[fhash];
}
if (!curfunc)
checktype++;
else {
if (startswith(curfunc->name,text))
output = dupstr(curfunc->name);
curfunc = curfunc->next;
if (output) return output;
}
}
while (checktype == CU_PREFIX){
while (!curprefix && phash<SIMPLEHASHSIZE-1){
phash++;
curprefix = ptab[phash];
}
if (!curprefix)
checktype++;
else {
if (startswith(curprefix->name,text))
output = dupstr(curprefix->name);
curprefix = curprefix->next;
if (output) return output;
}
}
while (checktype == CU_UNITS){
while (!curunit && uhash<HASHSIZE-1){
uhash++;
curunit = utab[uhash];
}
/* If we're done with the units go through them again with */
/* the largest possible prefix stripped off */
if (!curunit && !unitprefix
&& (unitprefix = plookup(text)) && strlen(unitprefix->name)>1){
uhash = 0;
curunit = utab[uhash];
}
if (!curunit) {
checktype++;
break;
}
if (unitprefix){
if (startswith(curunit->name, text+unitprefix->len)){
output = (char *)mymalloc(1+strlen(curunit->name)+unitprefix->len,
"(completeunits)");
strcpy(output, unitprefix->name);
strcat(output, curunit->name);
}
}
else if (startswith(curunit->name,text))
output = dupstr(curunit->name);
curunit=curunit->next;
if (output)
return output;
}
}
return 0;
}
#endif /* READLINE */
/* see if current directory contains an executable file */
int
checkcwd (char *file)
{
FILE *fp;
char *p;
fp = fopen(file, "r");
if (fp){
fclose(fp);
return 1;
}
#ifdef _WIN32
else if (!((p = strrchr(file, '.')) && isexe(p))) {
char *pathname;
pathname = mymalloc(strlen(file) + strlen(EXE_EXT) + 1,
"(checkcwd)");
strcpy(pathname, file);
strcat(pathname, EXE_EXT);
fp = fopen(pathname, "r");
free(pathname);
if (fp) {
fclose(fp);
return 1;
}
}
#endif
return 0;
}
/*
return the last component of a pathname, and remove a .exe extension
if one exists.
*/
char *
getprogramname(char *path)
{
size_t proglen;
char *p;
path = pathend(path);
/* get rid of filename extensions in Windows */
proglen = strlen(path);
if ((p = strrchr(path, '.')) && isexe(p))
proglen -= 4;
return dupnstr(path, proglen);
}
/*
Find the directory that contains the invoked executable.
*/
char *
getprogdir(char *progname, char **fullprogname)
{
char *progdir = NULL;
char *p;
#if defined (_WIN32) && defined (_MSC_VER)
char buf[FILENAME_MAX + 1];
/* get the full pathname of the current executable and be done with it */
/* TODO: is there way to do this with gcc? */
if (GetModuleFileName(NULL, buf, FILENAME_MAX + 1))
progdir = dupstr(buf);
#endif
/* If path name is absolute or includes more than one component use it */
if (!progdir && (isfullpath(progname) || hasdirsep(progname)))
progdir = dupstr(progname);
/*
command.com and cmd.exe under Windows always run a program that's in the
current directory whether or not the current directory is in PATH, so we need
to check the current directory.
This could return a false positive if units is run from a Unix-like command
interpreter under Windows if the current directory is not in PATH but
contains 'units' or 'units.exe'
*/
#if defined (_WIN32) && !defined (_MSC_VER)
if (!progdir && checkcwd(progname))
progdir = dupstr(progname);
#endif
/* search PATH to find the executable */
if (!progdir) {
char *env;
env = getenv("PATH");
if (env) {
/* search PATH */
char *direc, *direc_end, *pathname;
int len;
FILE *fp;
pathname = mymalloc(strlen(env)+strlen(progname)+strlen(EXE_EXT)+2,
"(getprogdir)");
direc = env;
while (direc) {
direc_end = strchr(direc,PATHSEP);
if (!direc_end)
len = strlen(direc);
else
len = direc_end-direc;
strncpy(pathname, direc, len);
if (len>0) pathname[len++]='/';
strcpy(pathname+len, progname);
fp = fopen(pathname, "r");
if (fp){
progdir = dupstr(pathname);
break;
}
#ifdef _WIN32
/*
executable may or may not have '.exe' suffix, so we need to
look for both
*/
if (!((p = strrchr(pathname, '.')) && isexe(p))) {
strcat(pathname, EXE_EXT);
fp = fopen(pathname, "r");
if (fp){
progdir = dupstr(pathname);
break;
}
}
#endif
direc = direc_end;
if (direc) direc++;
}
free(pathname);
if (fp)
fclose(fp);
}
}
if (!progdir) {
fprintf(stderr, "%s: cannot find program directory\n", progname);
exit(EXIT_FAILURE);
}
*fullprogname = dupstr(progdir); /* used by printversion() */
p = pathend(progdir);
*p = '\0';
return progdir;
}
/*
find a possible data directory relative to a 'bin' directory that
contains the executable
*/
char *
getdatadir()
{
int progdirlen;
char *p;
progdirlen = strlen(progdir);
datadir = (char *) mymalloc(progdirlen + strlen(DATADIR) + 2,
"(getdatadir)");
strcpy(datadir, progdir);
if (isdirsep(progdir[progdirlen - 1]))
datadir[progdirlen - 1] = '\0'; /* so pathend() can work */
p = pathend(datadir);
if ((strlen(p) == 3) && (tolower(p[0]) == 'b') \
&& (tolower(p[1]) == 'i') && (tolower(p[2]) == 'n')) {
p = DATADIR;
while (*p == '.') /* ignore "./", "../" */
p++;
if (isdirsep(*p))
p++;
strcpy(pathend(datadir), p);
return datadir;
}
else
return NULL;
}
char *
findlocalemap(int checkonly)
{
FILE *map = NULL;
char *filename = NULL;
char *file;
/*
Try the environment variable UNITSLOCALEMAP, then the #defined
value LOCALEMAP, then the directory containing the units
executable, then the directory given by DATADIR (relative to the
directory with the executable), and finally, the directory
containing the units data file.
*/
file = getenv("UNITSLOCALEMAP");
if (file && *file) {
map = fopen(file,"rt");
if (!map) {
if (!checkonly) {
fprintf(stderr,
"%s: cannot open locale map '%s'\n specified in UNITSLOCALEMAP environment variable. ",
progname, file);
perror((char *) NULL);
}
return NULL;
}
else
filename = dupstr(file);
}
if (!map) {
file = LOCALEMAP;
map = fopen(file,"rt");
if (map)
filename = dupstr(file);
}
if (!map && !progdir) {
if (!checkonly) {
fprintf(stderr,
"%s: cannot find locale map--program directory not set\n",
progname);
exit(EXIT_FAILURE);
}
else
return NULL;
}
/* check the directory with the units executable */
if (!map) {
filename = (char *) mymalloc(strlen(progdir) + strlen(file) + 2,
"(findlocalemap)");
strcpy(filename, progdir);
strcat(filename, file);
map = fopen(filename,"rt");
}
if (!map && !emptystr(DATADIR)) {
/* check data directory relative to the units executable directory */
if (!datadir)
datadir = getdatadir();
if (datadir) {
if (filename)
free(filename);
filename = (char *) mymalloc(strlen(datadir) + strlen(DATADIR) + strlen(file) + 2,
"(findlocalemap)");
strcpy(filename, datadir);
strcat(filename, "/");
strcat(filename, file);
map = fopen(filename, "rt");
}
}
/* check the directory with the units data file */
if (!map) {
if (filename)
free(filename);
filename = (char *) mymalloc(strlen(unitsfiles[0]) + strlen(file) + 2,
"(findlocalemap)");
strcpy(filename, unitsfiles[0]);
strcpy(pathend(filename), file);
map = fopen(filename,"rt");
}
if (map) {
fclose(map);
return filename;
}
else {
if (filename)
free(filename);
return NULL;
}
}
char *
findunitsfile(int noerrmsg)
{
FILE *testfile=0;
char *file;
file = getenv("UNITSFILE");
if (file && *file) {
testfile = fopen(file, "rt");
if (!testfile) {
if (!noerrmsg) {
fprintf(stderr,
"%s: cannot open units file '%s' in environment variable UNITSFILE. ",
progname, file);
perror((char *) NULL);
}
return NULL;
}
}
if (!testfile && isfullpath(UNITSFILE)){
file = UNITSFILE;
testfile = fopen(file, "rt");
if (!testfile) {
if (!noerrmsg) {
fprintf(stderr,
"%s: cannot open units data file '%s'. ", progname, UNITSFILE);
perror((char *) NULL);
}
return NULL;
}
}
if (!testfile && !progdir) {
if (!noerrmsg) {
fprintf(stderr,
"%s: cannot open units file '%s' and cannot find program directory.\n", progname, UNITSFILE);
perror((char *) NULL);
}
return NULL;
}
if (!testfile) {
/* check the directory containing the units executable */
file = (char *) mymalloc(strlen(progdir)+strlen(UNITSFILE)+1,
"(findunitsfile)");
strcpy(file, progdir);
strcat(file, UNITSFILE);
testfile = fopen(file, "rt");
if (!testfile)
free(file);
}
if (!testfile && !emptystr(DATADIR)) {
/* check data directory relative to the units executable directory */
if (!datadir)
datadir = getdatadir();
if (datadir) {
file = (char *) mymalloc(strlen(datadir) + strlen(UNITSFILE) + 2,
"(findunitsfile)");
strcpy(file, datadir);
strcat(file, "/");
strcat(file, UNITSFILE);
testfile = fopen(file, "rt");
if (!testfile)
free(file);
}
}
if (!testfile) {
if (!noerrmsg)
fprintf(stderr,"%s: cannot find units file '%s'\n", progname, UNITSFILE);
return NULL;
}
else {
fclose(testfile);
return file;
}
}
/*
Find a personal file. First checks the specified environment variable
(envname) for the filename to use. If this is unset then search user's
home directory for basename. If home directory cannot be found, returns
NULL. Otherwise if the file exists then returns its name in newly allocated
space and sets *exists to 1. If the file does not exist then sets *exist to
zero and:
With checkonly == 0, prints error message and returns NULL
With checkonly != 0, returns filename (does not print error message)
*/
char *
personalfile(const char *envname, const char *basename,
int checkonly, int *exists)
{
FILE *testfile=0;
char *homedir, *filename=0;
*exists = 0;
/* First check the specified environment variable for a file name */
if (envname)
filename = getenv(envname);
if (filename && *filename){ /* environment variable exists */
testfile = fopen(filename, "rt");
if (testfile){
fclose(testfile);
*exists = 1;
return filename;
}
if (checkonly) return filename;
else {
fprintf(stderr, "%s: cannot open file '%s' specified in %s environment variable. ", progname, filename, envname);
perror((char *) NULL);
return 0;
}
}
/* The environment variable was not set so identify the user's home
directory. Under Windows if HOME is set we assume it's meant to override
HOMEDRIVE, HOMEPATH, and USERPROFILE */
homedir = getenv("HOME");
if (homedir) {
filename = mymalloc(strlen(homedir)+strlen(basename)+2,
"(personalfile)");
strcpy(filename,homedir);
}
else
#ifndef _WIN32
{ /* If not running Windows there is nothing else to try */
return 0;
}
#else
{ /* If running Windows try a few other places */
/* try HOMEDRIVE and HOMEPATH */
char *homedrive, *homepath;
if ((homedrive = getenv("HOMEDRIVE")) && (homepath = getenv("HOMEPATH"))) {
filename = mymalloc(strlen(homedrive)+strlen(homepath)
+strlen(basename)+2,"(personalfile)");
strcpy(filename,homedrive);
strcat(filename,homepath);
}
/* finally, try USERPROFILE */
else if ((homedir = getenv("USERPROFILE"))) {
filename = mymalloc(strlen(homedir)+strlen(basename)+2,
"(personalfile)");
strcpy(filename,homedir);
}
else return 0;
}
#endif /* _WIN32 */
/* With home directory in hand we now look for the file */
strcat(filename,"/");
strcat(filename,basename);
testfile = fopen(filename, "rt");
if (testfile){
fclose(testfile);
*exists = 1;
return filename;
}
if (checkonly) return filename;
else {
if (errno==EACCES) {
fprintf(stderr,"%s: cannot read file '%s'. ",progname,filename);
perror(0);
}
free(filename);
return 0;
}
}
/* print usage message */
void
usage()
{
char *unitsfile;
/* nonzero argument suppresses error messages */
unitsfile = findunitsfile(1);
printf("\nUsage: %s [options] ['from-unit' 'to-unit']\n",progname);
printf("\n\
Options:\n\
-h, --help show this help and exit\n\
-c, --check check that all units reduce to primitive units\n\
--check-verbose like --check, but lists units as they are checked\n\
--verbose-check so you can find units that cause endless loops\n\
-d, --digits show output to specified number of digits (default: %d)\n\
-e, --exponential exponential format output\n\
-f, --file specify a units data file (-f '' loads default file)\n",
DEFAULTPRECISION);
#ifdef READLINE
printf("\
-H, --history specify readline history file (-H '' disables history)\n");
#endif
printf("\
-L, --log specify a file to log conversions\n\
-l, --locale specify a desired locale\n\
-m, --minus make - into a subtraction operator (default)\n\
--oldstar use old '*' precedence, higher than '/'\n\
--newstar use new '*' precedence, equal to '/'\n\
-n, --nolists disable conversion to unit lists\n\
-S, --show-factor show non-unity factor before 1|x in multi-unit output\n\
-o, --output-format specify printf numeric output format (default: %%.%d%c)\n\
-p, --product make '-' into a product operator\n\
-q, --quiet suppress prompting\n\
--silent same as --quiet\n\
-s, --strict suppress reciprocal unit conversion (e.g. Hz<->s)\n\
-v, --verbose show slightly more verbose output\n\
--compact suppress printing of tab, '*', and '/' character\n\
-1, --one-line suppress the second line of output\n\
-t, --terse terse output (--strict --compact --quiet --one-line)\n\
-r, --round round last element of unit list output to an integer\n\
-U, --unitsfile show units data filename and exit\n\
-u, --units specify a CGS unit system (gauss[ian]|esu|emu)\n\
-V, --version show version, data filenames (with -t: version only)\n\
-I, --info show version, files, and program properties\n",
DEFAULTTYPE,DEFAULTPRECISION);
if (!unitsfile)
printf("Units data file '%s' not found.\n\n", UNITSFILE);
else
printf("To learn about the available units look in '%s'\n\n", unitsfile);
puts("Report bugs to adrianm@gnu.org.\n\n");
}
/* Print message about how to get help */
void
helpmsg()
{
fprintf(stderr,"\nTry '%s --help' for more information.\n",progname);
exit(EXIT_FAILURE);
}
/* show units version, and optionally, additional information */
void
printversion()
{
int exists;
char *unitsfile, *localemap;
if (flags.verbose == 0) {
printf("GNU Units version %s\n", VERSION);
return;
}
printf("GNU Units version %s\n%s, %s, locale %s\n",
VERSION, RVERSTR,UTF8VERSTR,mylocale);
#if defined (_WIN32) && defined (HAVE_MKS_TOOLKIT)
puts("With MKS Toolkit");
#endif
if (flags.verbose == 2) {
if (!fullprogname)
getprogdir(progname, &fullprogname);
if (fullprogname)
printf("\n%s program is %s\n", progname, fullprogname);
}
/* units data file */
if (flags.verbose == 2) {
putchar('\n');
unitsfile = getenv("UNITSFILE");
if (unitsfile)
printf("Environment variable UNITSFILE set to '%s'\n", unitsfile);
else
puts("Environment variable UNITSFILE not set");
if (isfullpath(UNITSFILE))
printf("Default units data file is '%s'\n", UNITSFILE);
else
printf("Default units data file is '%s';\n %s will search for this file\n",
UNITSFILE, progname);
}
unitsfile = findunitsfile(1);
if (unitsfile && flags.verbose == 2 && !isfullpath(UNITSFILE))
printf("Found data file '%s'\n", unitsfile);
else if (unitsfile)
printf("Units data file is '%s'\n", unitsfile);
else
puts("*** Units data file not found ***");
/* personal units data file */
if (flags.verbose == 2) {
putchar('\n');
unitsfile = getenv(HOME_UNITS_ENV);
if (unitsfile)
printf("Environment variable %s set to '%s'\n", HOME_UNITS_ENV,unitsfile);
else
printf("Environment variable %s not set\n", HOME_UNITS_ENV);
}
unitsfile = personalfile(HOME_UNITS_ENV, homeunitsfile, 1, &exists);
if (unitsfile) {
printf("Personal units data file is '%s'", unitsfile);
if (!exists)
puts("\n (file does not exist)");
else
putchar('\n');
}
else
puts("Personal units data file not found: no home directory");
#ifdef READLINE
if (flags.verbose == 2) {
historyfile = personalfile(NULL,HISTORY_FILE,1,&exists);
if (historyfile)
printf("\nDefault readline history file is '%s'\n", historyfile);
else
puts("\nReadline history file unusable: no home directory");
}
#endif
#ifdef _WIN32
/* locale map */
if (flags.verbose == 2) {
putchar('\n');
localemap = getenv("UNITSLOCALEMAP");
if (localemap)
printf("Environment variable UNITSLOCALEMAP set to '%s'\n", localemap);
else
puts("Environment variable UNITSLOCALEMAP not set");
if (isfullpath(LOCALEMAP))
printf("Default locale map is '%s'\n", LOCALEMAP);
else
printf("Default locale map is '%s';\n %s will search for this file\n",
LOCALEMAP, progname);
localemap = findlocalemap(1);
if (localemap && !isfullpath(LOCALEMAP))
printf("Found locale map '%s'\n", localemap);
else if (localemap)
printf("Locale map is '%s'\n", localemap);
else
puts("*** Locale map not found ***");
}
#endif
printf("\n\n%s\n\n", LICENSE);
}
void
showunitsfile()
{
char *unitsfile;
unitsfile = findunitsfile(1);
if (unitsfile)
printf("%s\n", unitsfile);
else
puts("Units data file not found");
}
char *shortoptions = "VIUu:vqechSstf:o:d:mnpr1l:L:"
#ifdef READLINE
"H:"
#endif
;
struct option longoptions[] = {
{"check", no_argument, &flags.unitcheck, 1},
{"check-verbose", no_argument, &flags.unitcheck, 2},
{"compact", no_argument, &flags.verbose, 0},
{"digits", required_argument, 0, 'd'},
{"exponential", no_argument, 0, 'e'},
{"file", required_argument, 0, 'f'},
{"help", no_argument, 0, 'h'},
#ifdef READLINE
{"history", required_argument, 0, 'H'},
#endif
{"info", no_argument, 0, 'I'},
{"locale", required_argument, 0, 'l'},
{"log", required_argument, 0, 'L'},
{"minus", no_argument, &parserflags.minusminus, 1},
{"newstar", no_argument, &parserflags.oldstar, 0},
{"nolists", no_argument, 0, 'n'},
{"oldstar", no_argument, &parserflags.oldstar, 1},
{"one-line", no_argument, &flags.oneline, 1},
{"output-format", required_argument, 0, 'o'},
{"product", no_argument, &parserflags.minusminus, 0},
{"quiet", no_argument, &flags.quiet, 1},
{"round",no_argument, 0, 'r'},
{"show-factor", no_argument, 0, 'S'},
{"silent", no_argument, &flags.quiet, 1},
{"strict",no_argument,&flags.strictconvert, 1},
{"terse",no_argument, 0, 't'},
{"unitsfile", no_argument, 0, 'U'},
{"units", required_argument, 0, 'u'},
{"verbose", no_argument, &flags.verbose, 2},
{"verbose-check", no_argument, &flags.unitcheck, 2},
{"version", no_argument, 0, 'V'},
{0,0,0,0} };
/* Process the args. Returns 1 if interactive mode is desired, and 0
for command line operation. If units appear on the command line
they are returned in the from and to parameters. */
int
processargs(int argc, char **argv, char **from, char **to)
{
extern char *optarg;
extern int optind;
int optchar, optindex;
int ind;
int doprintversion=0;
char *unitsys=0;
while ( -1 !=
(optchar =
getopt_long(argc, argv,shortoptions,longoptions, &optindex ))) {
switch (optchar) {
case 'm':
parserflags.minusminus = 1;
break;
case 'p':
parserflags.minusminus = 0;
break;
case 't':
flags.oneline = 1;
flags.quiet = 1;
flags.strictconvert = 1;
flags.verbose = 0;
break;
/* numeric output format */
case 'd':
if (checksigdigits(optarg) < 0)
exit(EXIT_FAILURE);
else /* ignore anything given with 'o' option */
num_format.format = NULL;
break;
case 'e': /* ignore anything given with 'o' option */
num_format.format = NULL;
num_format.type = 'e';
break;
case 'o':
num_format.format = optarg;
break;
case 'c':
flags.unitcheck = 1;
break;
case 'f':
for(ind=0;unitsfiles[ind];ind++);
if (ind==MAXFILES){
fprintf(stderr, "At most %d -f specifications are allowed\n",
MAXFILES);
exit(EXIT_FAILURE);
}
if (optarg && *optarg)
unitsfiles[ind] = optarg;
else {
unitsfiles[ind] = findunitsfile(0);
if (!unitsfiles[ind])
exit(EXIT_FAILURE);
}
unitsfiles[ind+1] = 0;
break;
case 'L':
logfilename = optarg;
break;
case 'l':
mylocale = optarg;
break;
case 'n':
flags.unitlists = 0;
break;
case 'q':
flags.quiet = 1;
break;
case 'r':
flags.round = 1;
break;
case 'S':
flags.showfactor = 1;
break;
case 's':
flags.strictconvert = 1;
break;
case 'v':
flags.verbose = 2;
break;
case '1':
flags.oneline = 1;
break;
case 'I':
flags.verbose = 2; /* fall through */
case 'V':
doprintversion = 1;
break;
case 'U':
showunitsfile();
exit(EXIT_SUCCESS);
break;
case 'u':
unitsys = optarg;
for(ind=0;unitsys[ind];ind++)
unitsys[ind] = tolower(unitsys[ind]);
break;
case 'h':
usage();
exit(EXIT_SUCCESS);
#ifdef READLINE
case 'H':
if (emptystr(optarg))
historyfile=NULL;
else
historyfile = optarg;
break;
#endif
case 0: break; /* This is reached if a long option is
processed with no return value set. */
case '?': /* Invalid option or missing argument returns '?' */
default:
helpmsg(); /* helpmsg() exits with error */
}
}
if (doprintversion){
printversion();
exit(EXIT_SUCCESS);
}
/* command-line option overwrites environment */
if (unitsys)
setenv("UNITS_SYSTEM", unitsys, 1);
if (flags.unitcheck) {
if (optind != argc){
fprintf(stderr,
"Too many arguments (arguments are not allowed with -c).\n");
helpmsg(); /* helpmsg() exits with error */
}
} else {
if (optind == argc - 2) {
flags.quiet=1;
*from = argv[optind];
*to = dupstr(argv[optind+1]); /* This string may get rewritten later */
return 0; /* and we might call free() on it */
}
if (optind == argc - 1) {
flags.quiet=1;
*from = argv[optind];
*to=0;
return 0;
}
if (optind < argc - 2) {
fprintf(stderr,"Too many arguments (maybe you need quotes).\n");
helpmsg(); /* helpmsg() exits with error */
}
}
return 1;
}
/*
Show a pointer under the input to indicate a problem.
Prints 'position' spaces and then the pointer.
If 'position' is negative, nothing is printed.
*/
void
showpointer(int position)
{
if (position >= 0){
while (position--) putchar(' ');
puts("^");
}
} /* end showpointer */
/*
Process the string 'unitstr' as a unit, placing the processed data
in the unit structure 'theunit'. Returns 0 on success and 1 on
failure. If an error occurs an error message is printed to stdout.
A pointer ('^') will be printed if an error is detected, and promptlen
should be set to the printing width of the prompt string, or set
it to NOPOINT to supress printing of the pointer.
*/
int
processunit(struct unittype *theunit, char *unitstr, int promptlen)
{
char *errmsg;
int errloc,err;
char savechar;
if (flags.unitlists && strchr(unitstr, UNITSEPCHAR)){
puts("Unit list not allowed");
return 1;
}
if ((err=parseunit(theunit, unitstr, &errmsg, &errloc))){
if (promptlen >= 0){
if (err!=E_UNKNOWNUNIT || !irreducible){
if (errloc>0) {
savechar = unitstr[errloc];
unitstr[errloc] = 0;
showpointer(promptlen+strwidth(unitstr)-1);
unitstr[errloc] = savechar;
}
else showpointer(promptlen);
}
}
else
printf("Error in '%s': ", unitstr);
fputs(errmsg,stdout);
if (err==E_UNKNOWNUNIT && irreducible)
printf(" '%s'", irreducible);
putchar('\n');
return 1;
}
if ((err=completereduce(theunit))){
fputs(errormsg[err],stdout);
if (err==E_UNKNOWNUNIT)
printf(" '%s'", irreducible);
putchar('\n');
return 1;
}
return 0;
}
/*
Checks the input parameter unitstr (a list of units separated by
UNITSEPCHAR) for errors. All units must be parseable and
conformable to each other. Returns 0 on success and 1 on failure.
I an error is found then print an error message on stdout. A
pointer ('^') will be printed to mark the error. The promptlen
parameter should be set to the printing width of the prompt string
so that the pointer is correctly aligned.
To suppress the printing of the pointer set promptlen to NOPOINT.
To suppress printing of error messages entirely set promptlen to
NOERRMSG.
*/
int
checkunitlist(char *unitstr, int promptlen)
{
struct unittype unit[2], one;
char *firstunitstr,*nextunitstr;
int unitidx = 0;
int printerror = promptlen != NOERRMSG;
initializeunit(&one);
firstunitstr = unitstr;
initializeunit(unit);
initializeunit(unit+1);
while (unitstr) {
if ((nextunitstr = strchr(unitstr, UNITSEPCHAR)) != 0)
*nextunitstr = '\0';
if (!unitstr[strspn(unitstr, " ")]) { /* unitstr is blank */
if (!nextunitstr) { /* terminal UNITSEPCHAR indicates repetition */
freeunit(unit); /* of last unit and is permitted */
return 0;
}
else { /* internal blank units are not allowed */
if (printerror){
showpointer(promptlen);
puts("Error: blank unit not allowed");
}
freeunit(unit);
return 1;
}
}
/* processunit() prints error messages; avoid it to supress them */
if ((printerror && processunit(unit+unitidx,unitstr,promptlen)) ||
(!printerror &&
(parseunit(unit+unitidx, unitstr,0,0)
|| completereduce(unit+unitidx)
|| compareunits(unit+unitidx,&one, ignore_primitive)))){
if (printerror)
printf("Error in unit list entry: %s\n",unitstr);
freeunit(unit);
freeunit(unit+1);
return 1;
}
if (unitidx == 0)
unitidx = 1;
else {
if (compareunits(unit, unit+1, ignore_dimless)){
if (printerror){
int wasverbose = flags.verbose;
FILE *savelog = logfile;
logfile=0;
flags.verbose = 2; /* always use verbose form to be unambiguous */
/* coverity[returned_null] */
*(strchr(firstunitstr, UNITSEPCHAR)) = '\0';
removespaces(firstunitstr);
removespaces(unitstr);
showpointer(promptlen);
showconformabilityerr(firstunitstr, unit, unitstr, unit+1);
flags.verbose = wasverbose;
logfile = savelog;
}
freeunit(unit);
freeunit(unit+1);
return 1;
}
freeunit(unit+1);
}
if (nextunitstr) {
if (promptlen >= 0) promptlen += strwidth(unitstr)+1;
*(nextunitstr++) = UNITSEPCHAR;
}
unitstr = nextunitstr;
}
freeunit(unit);
return 0;
} /* end checkunitlist */
/*
Call either processunit or checkunitlist, depending on whether the
string 'unitstr' contains a separator character. Returns 0 on
success and 1 on failure. If an error occurs an error message is
printed to stdout.
A pointer will be printed if an error is detected, and promptlen
should be set to the printing width of the prompt string, or set
it to NOPOINT to supress printing of the pointer.
*/
int
processwant(struct unittype *theunit, char *unitstr, int promptlen)
{
if (flags.unitlists && strchr(unitstr, UNITSEPCHAR))
return checkunitlist(unitstr, promptlen);
else
return processunit(theunit, unitstr, promptlen);
}
void
checkallaliases(int verbose)
{
struct wantalias *aliasptr;
for(aliasptr = firstalias; aliasptr; aliasptr=aliasptr->next){
if (verbose)
printf("doing unit list '%s'\n", aliasptr->name);
if (checkunitlist(aliasptr->definition,NOERRMSG))
printf("Unit list '%s' contains errors\n", aliasptr->name);
if (ulookup(aliasptr->name))
printf("Unit list '%s' hides a unit definition.\n", aliasptr->name);
if (fnlookup(aliasptr->name))
printf("Unit list '%s' hides a function definition.\n", aliasptr->name);
}
}
/*
Check that all units and prefixes are reducible to primitive units and that
function definitions are valid and have correct inverses. A message is
printed for every unit that does not reduce to primitive units.
*/
void
checkunits(int verbosecheck)
{
struct unittype have,second,one;
struct unitlist *uptr;
struct prefixlist *pptr;
struct func *funcptr;
char *prefixbuf, *testunit;
int i;
initializeunit(&one);
/* Check all functions for valid definition and correct inverse */
for(i=0;i<SIMPLEHASHSIZE;i++)
for(funcptr=ftab[i];funcptr;funcptr=funcptr->next)
checkfunc(funcptr, verbosecheck);
checkallaliases(verbosecheck);
/* Now check all units for validity */
for(i=0;i<HASHSIZE;i++)
for (uptr = utab[i]; uptr; uptr = uptr->next){
if (verbosecheck)
printf("doing '%s'\n",uptr->name);
if (parseunit(&have, uptr->name,0,0)
|| completereduce(&have)
|| compareunits(&have,&one, ignore_primitive)){
if (fnlookup(uptr->name))
printf("Unit '%s' hidden by function '%s'\n", uptr->name, uptr->name);
else
printf("'%s' defined as '%s' irreducible\n",uptr->name, uptr->value);
} else {
parserflags.minusminus = !parserflags.minusminus;
/* coverity[check_return] */
parseunit(&second, uptr->name, 0, 0); /* coverity[check_return] */
completereduce(&second); /* Can't fail because it worked above */
if (compareunits(&have, &second, ignore_nothing)){
printf("'%s': replace '-' with '+-' for subtraction or '*' to multiply\n", uptr->name);
}
freeunit(&second);
parserflags.minusminus=!parserflags.minusminus;
}
freeunit(&have);
}
/* Check prefixes */
testunit="meter";
for(i=0;i<SIMPLEHASHSIZE;i++)
for(pptr = ptab[i]; pptr; pptr = pptr->next){
if (verbosecheck)
printf("doing '%s-'\n",pptr->name);
prefixbuf = mymalloc(strlen(pptr->name) + strlen(testunit) + 1,
"(checkunits)");
strcpy(prefixbuf,pptr->name);
strcat(prefixbuf,testunit);
if (parseunit(&have, prefixbuf,0,0) || completereduce(&have) ||
compareunits(&have,&one,ignore_primitive))
printf("'%s-' defined as '%s' irreducible\n",pptr->name, pptr->value);
else {
int plevel; /* check for bad '/' character in prefix */
char *ch;
plevel = 0;
for(ch=pptr->value;*ch;ch++){
if (*ch==')') plevel--;
else if (*ch=='(') plevel++;
else if (plevel==0 && *ch=='/'){
printf(
"'%s-' defined as '%s' contains a bad '/'. (Add parentheses.)\n",
pptr->name, pptr->value);
break;
}
}
}
freeunit(&have);
free(prefixbuf);
}
}
/*
Converts the input value 'havestr' (which is already parsed into
the unit structure 'have') into a sum of the UNITSEPCHAR-separated
units listed in 'wantstr'. You must call checkunitlist first to
ensure 'wantstr' is error-free. Prints the results (or an error message)
on stdout. Returns 0 on success and 1 on failure.
*/
int
showunitlist(char *havestr, struct unittype *have, char *wantstr)
{
struct unittype want, lastwant;
char *lastunitstr, *nextunitstr, *lastwantstr=0;
double remainder; /* portion of have->factor remaining */
double round_dir; /* direction of rounding */
double value; /* value (rounded to integer with 'r' option) */
int firstunit = 1; /* first unit in a multi-unit string */
int value_shown = 0; /* has a value been shown? */
initializeunit(&want);
remainder = have->factor;
lastunitstr = 0;
nextunitstr = 0;
round_dir = 0;
if (flags.round) {
/* disable unit repetition with terminal UNITSEPCHAR when rounding */
if (lastchar(wantstr) == UNITSEPCHAR)
lastchar(wantstr) = 0;
if ((lastwantstr = strrchr(wantstr, UNITSEPCHAR)))
lastwantstr++;
}
while (wantstr) {
if ((nextunitstr = strchr(wantstr, UNITSEPCHAR)))
*(nextunitstr++) = '\0';
removespaces(wantstr);
/*
if wantstr ends in UNITSEPCHAR, repeat last unit--to give integer
and fractional parts (3 oz + 0.371241 oz rather than 3.371241 oz)
*/
if (emptystr(wantstr)) /* coverity[alias_transfer] */
wantstr = lastunitstr;
if (processunit(&want, wantstr, NOPOINT)) {
freeunit(&want);
return 1;
}
if (firstunit){
/* checkunitlist() ensures conformability within 'wantstr',
so we just need to check the first unit to see if it conforms
to 'have' */
if (compareunits(have, &want, ignore_dimless)) {
showconformabilityerr(havestr, have, wantstr, &want);
freeunit(&want);
return 1;
}
/* round to nearest integral multiple of last unit */
if (flags.round) {
value = remainder;
if (lastwantstr && *lastwantstr) { /* more than one unit */
removespaces(lastwantstr);
initializeunit(&lastwant);
if (processunit(&lastwant, lastwantstr, NOPOINT)) {
freeunit(&lastwant);
return 1;
}
remainder = floor(remainder / lastwant.factor + 0.5) * lastwant.factor;
}
else /* first unit is last unit */
remainder = floor(remainder / want.factor + 0.5) * want.factor;
round_dir = remainder - value;
}
if (flags.verbose == 2) {
removespaces(havestr);
logprintf("\t%s = ", havestr);
} else if (flags.verbose == 1)
logputchar('\t');
} /* end if first unit */
if (nextunitstr) {
remainder = want.factor * modf(remainder / want.factor, &value);
if (round_to_displayed(remainder / want.factor, NULL) == 1) {
value++; /* at displayed precision, value rounds up */
remainder = 0; /* and remainder is zero */
}
else if (fabs(remainder / have->factor) < DBL_EPSILON)
remainder = 0; /* remainder is just rounding error */
}
else { /* last unit */
value = remainder / want.factor;
if (!flags.round) { /* round to displayed precision */
value = round_to_displayed(value, NULL);
}
}
if (!flags.verbose){
if (!firstunit)
logputchar(UNITSEPCHAR);
logprintf(num_format.format,value);
value_shown=1;
} else { /* verbose case */
if (value != 0) {
if (value_shown) /* have already displayed a number so need a '+' */
logputs(" + ");
showunitname(value, wantstr, PRINTNUM);
value_shown=1;
}
}
freeunit(&want);
lastunitstr = wantstr;
wantstr = nextunitstr;
firstunit = 0;
}
/* if the final unit value was rounded print indication */
if (!value_shown) { /* provide output if every value rounded to zero */
logputs("0 ");
if (isdecimal(*lastunitstr))
logputs("* ");
logputs(lastunitstr);
}
if (round_dir != 0) {
if (flags.verbose){
if (round_dir > 0)
logprintf(" (rounded up to nearest %s) ", lastunitstr);
else
logprintf(" (rounded down to nearest %s) ", lastunitstr);
} else
logprintf("%c%c", UNITSEPCHAR, round_dir > 0 ?'-':'+');
}
logputchar('\n');
return 0;
} /* end showunitlist */
#if defined (_WIN32) && defined (HAVE_MKS_TOOLKIT)
int
ismksmore(char *pager)
{
static int mksmore = -1;
if (mksmore >= 0)
return mksmore;
/*
Tries to determine whether the MKS Toolkit version of more(1) or
less(1) will run. Neither accepts '+<lineno>', so if either will
run, we need to give the option as '+<lineno>g'.
*/
if (strstr(pager, "more") || strstr(pager, "less")) {
char *mypager, *mkspager, *mksroot, *p;
char pathbuf[FILENAME_MAX + 1];
struct _stat mybuf, mksbuf;
mypager = NULL;
mkspager = NULL;
mksmore = 0;
if (strlen(pager) > FILENAME_MAX) {
fprintf(stderr, "%s: cannot invoke pager--value '%s' in PAGER too long\n",
progname, pager);
return 0; /* TODO: this really isn't the right value */
}
else if (!isfullpath(pager)) {
mypager = (char *) mymalloc(strlen(pager) + strlen(EXE_EXT) + 1, "(ishelpquery)");
strcpy(mypager, pager);
if (!((p = strrchr(mypager, '.')) && isexe(p)))
strcat(mypager, EXE_EXT);
_searchenv(mypager, "PATH", pathbuf);
}
else
strcpy(pathbuf, pager);
mksroot = getenv("ROOTDIR");
if (mksroot) {
char * mksprog;
if (strstr(pager, "more"))
mksprog = "more.exe";
else
mksprog = "less.exe";
mkspager = (char *) mymalloc(strlen(mksroot) + strlen("/mksnt/") + strlen(mksprog) + 1,
"(ishelpquery)");
strcpy(mkspager, mksroot);
strcat(mkspager, "/mksnt/");
strcat(mkspager, mksprog);
}
if (*pathbuf && mksroot) {
if (_stat(mkspager, &mksbuf)) {
fprintf(stderr, "%s: cannot stat file '%s'. ", progname, mkspager);
perror((char *) NULL);
return 0;
}
if (_stat(pathbuf, &mybuf)) {
fprintf(stderr, "%s: cannot stat file '%s'. ", progname, pathbuf);
perror((char *) NULL);
return 0;
}
/*
if we had inodes, this would be simple ... but if it walks
like a duck and swims like a duck and quacks like a duck ...
*/
if (mybuf.st_size == mksbuf.st_size
&& mybuf.st_ctime == mksbuf.st_ctime
&& mybuf.st_mtime == mksbuf.st_mtime
&& mybuf.st_atime == mksbuf.st_atime
&& mybuf.st_mode == mksbuf.st_mode)
mksmore = 1;
}
if (mypager)
free(mypager);
if (mkspager)
free(mkspager);
}
return mksmore;
}
#endif
/*
Checks to see if the input string contains HELPCOMMAND possibly
followed by a unit name on which help is sought. If not, then
return 0. Otherwise invoke the pager on units file at the line
where the specified unit is defined. Then return 1. */
int
ishelpquery(char *str, struct unittype *have)
{
struct unitlist *unit;
struct func *function;
struct wantalias *alias;
struct prefixlist *prefix;
char commandbuf[1000]; /* Hopefully this is enough overkill as no bounds */
int unitline; /* checking is performed. */
char *file;
char **exitptr;
if (have && !strcmp(str, UNITMATCH)){
tryallunits(have,0);
return 1;
}
for(exitptr=exit_commands;*exitptr;exitptr++)
if (!strcmp(str, *exitptr))
exit(EXIT_SUCCESS);
if (startswith(str, SEARCHCOMMAND)){
str+=strlen(SEARCHCOMMAND);
if (!emptystr(str) && *str != ' ')
return 0;
removespaces(str);
if (emptystr(str)){
printf("\n\
Type 'search text' to see a list of all unit names \n\
containing 'text' as a substring\n\n");
return 1;
}
tryallunits(0,str);
return 1;
}
if (startswith(str, HELPCOMMAND)){
str+=strlen(HELPCOMMAND);
if (!emptystr(str) && *str != ' ')
return 0;
removespaces(str);
if (emptystr(str)){
printf("\n\
Units converts between different measuring systems and %s6 inches\n\
acts as a units-aware calculator. At the '%s' %scm\n\
prompt, type in the units you want to convert from or * 15.24\n\
an expression to evaluate. At the '%s' prompt, / 0.065\n\
enter the units to convert to or press return to see\n\
the reduced form or definition. %stempF(75)\n\
%stempC\n\
The first example shows that 6 inches is about 15 cm 23.889\n\
or (1/0.065) cm. The second example shows how to\n\
convert 75 degrees Fahrenheit to Celsius. The third %sbu^(1/3)\n\
example converts the cube root of a bushel to a list %sft;in\n\
of semicolon-separated units. 1 ft + 0.9 in\n\
\n\
To quit from units type 'quit' or 'exit'. %s2 btu + 450 ft lbf\n\
%s(kg^2/s)/(day lb/m^2)\n\
At the '%s' prompt type '%s' to get a * 1.0660684e+08\n\
list of conformable units. At either prompt you / 9.3802611e-09\n\
type 'help myunit' to browse the units database\n\
and read the comments relating to myunit or see %s6 tbsp sugar\n\
other units related to myunit. Typing 'search %sg\n\
text' will show units whose names contain 'text'. * 75\n\
/ 0.013333333\n",
QUERYHAVE,
QUERYHAVE, QUERYWANT,
QUERYWANT,
QUERYHAVE,QUERYWANT,QUERYHAVE,QUERYWANT,
QUERYHAVE,QUERYWANT,
QUERYWANT,
UNITMATCH,
QUERYHAVE,QUERYWANT);
return 1;
}
if ((function = fnlookup(str))){
file = function->file;
unitline = function->linenumber;
}
else if ((unit = ulookup(str))){
unitline = unit->linenumber;
file = unit->file;
}
else if ((prefix = plookup(str)) && strlen(str)==prefix->len){
unitline = prefix->linenumber;
file = prefix->file;
}
else if ((alias = aliaslookup(str))){
unitline = alias->linenumber;
file = alias->file;
}
else {
printf("Unknown unit '%s'\n",str);
return 1;
}
#if defined (_WIN32) && defined (HAVE_MKS_TOOLKIT)
if (ismksmore(pager))
/*
inner escaped quotes are necessary for filenames with spaces;
outer escaped quotes are necessary for cmd.exe to see the
command as a single string containing one or more quoted strings
(e.g., cmd /c ""command" "arg1" "arg2" ... ")
*/
sprintf(commandbuf,"\"\"%s\" +%dg \"%s\"\"", pager, unitline, file);
else
/* more.com seems to have positioning problems, and it can't back up */
sprintf(commandbuf,"\"\"%s\" +%d \"%s\"\"", pager,
unitline > 2 ? unitline - 3 : unitline, file);
#elif defined (_WIN32)
sprintf(commandbuf,"\"\"%s\" +%d \"%s\"\"", pager,
unitline > 2 ? unitline - 3 : unitline, file);
#else
sprintf(commandbuf,"%s +%d %s", pager, unitline, file);
#endif
if (system(commandbuf))
fprintf(stderr,"%s: cannot invoke pager '%s' to display help\n",
progname, pager);
return 1;
}
return 0;
}
#ifdef SUPPORT_UTF8
void
checklocale()
{
char *temp;
temp = setlocale(LC_CTYPE,"");
utf8mode = (strcmp(nl_langinfo(CODESET),"UTF-8")==0);
if (temp){
mylocale = dupstr(temp);
temp = strchr(mylocale,'.');
if (temp)
*temp = 0;
} else
mylocale = DEFAULTLOCALE;
}
#else
void
checklocale()
{
char *temp=0;
#ifndef NO_SETLOCALE
temp = setlocale(LC_CTYPE,"");
#endif
if (!temp)
temp = getenv("LC_CTYPE");
if (!temp)
temp = getenv("LANG");
if (!temp)
mylocale = DEFAULTLOCALE;
else {
mylocale = dupstr(temp);
temp = strchr(mylocale,'.');
if (temp)
*temp = 0;
}
}
#endif
/*
Replaces an alias in the specified string input. Returns 1 if the
alias that is found contains errors.
*/
int
replacealias(char **string, int *buflen)
{
int usefree = 1;
struct wantalias *aliasptr;
char *input;
if (!flags.readline && buflen)
usefree = 0;
if (*string && **string) { /* check that string is defined and nonempty */
input = *string;
removespaces(input);
if ((aliasptr=aliaslookup(input))){
if (checkunitlist(aliasptr->definition,NOERRMSG)){
puts("Unit list definition contains errors.");
return 1;
}
if (usefree){
free(*string);
*string = dupstr(aliasptr->definition);
} else { /* coverity[dead_error_line] */
while (strlen(aliasptr->definition)>*buflen)
growbuffer(string, buflen);
strcpy(*string, aliasptr->definition);
}
}
}
return 0;
}
/*
Remaps the locale name returned on Windows systems to the value
returned on Unix-like systems
*/
void
remaplocale(char *filename)
{
FILE *map;
char *value;
char name[80];
map = fopen(filename,"rt");
if (!map) {
fprintf(stderr,"%s: cannot open locale map '%s'. ",progname,filename);
perror((char *) NULL);
}
else {
while(!feof(map)){
if (!fgets(name,80,map))
break;
lastchar(name) = 0;
value=strchr(name,'#');
if (value) *value=0;
value=strchr(name,'\t');
if (!value) continue;
*value++=0;
removespaces(value);
removespaces(name);
if (!strcmp(name, mylocale))
mylocale = dupstr(value);
}
fclose(map);
}
}
void
close_logfile(void)
{
if (logfile){
fputc('\n',logfile);
fclose(logfile);
}
}
void
open_logfile(void)
{
time_t logtime;
char * timestr;
logfile = fopen(logfilename, "at");
if (!logfile){
fprintf(stderr, "%s: cannot write to log file '%s'. ",
progname, logfilename);
perror(0);
exit(EXIT_FAILURE);
}
time(&logtime);
timestr = ctime(&logtime);
fprintf(logfile, "### Log started %s \n", timestr);
atexit(close_logfile);
}
void
write_files_sig(int sig)
{
#ifdef READLINE
if (historyfile)
save_history();
#endif
close_logfile();
signal(sig, SIG_DFL);
raise(sig);
}
int
main(int argc, char **argv)
{
static struct unittype have, want;
char *havestr=0, *wantstr=0;
struct func *funcval;
struct wantalias *alias;
int havestrsize=0; /* Only used if READLINE is undefined */
int wantstrsize=0; /* Only used if READLINE is undefined */
int interactive;
int readerr;
char **unitfileptr;
int unitcount=0, prefixcount=0, funccount=0; /* for counting units */
char *queryhave, *querywant, *comment;
int queryhavewidth, querywantwidth;
#ifdef _WIN32
char *localemap;
#endif
/* Set program parameter defaults */
num_format.format = NULL;
num_format.precision = DEFAULTPRECISION;
num_format.type = DEFAULTTYPE;
flags.quiet = 0; /* Do not supress prompting */
flags.unitcheck = 0; /* Unit checking is off */
flags.verbose = 1; /* Medium verbosity */
flags.round = 0; /* Rounding off */
flags.strictconvert=0; /* Strict conversion disabled (reciprocals active) */
flags.unitlists = 1; /* Multi-unit conversion active */
flags.oneline = 0; /* One line output is disabled */
flags.showfactor = 0; /* Don't show a multiplier for a 1|x fraction */
/* in unit list output */
parserflags.minusminus = 1; /* '-' character gives subtraction */
parserflags.oldstar = 0; /* '*' has same precedence as '/' */
progname = getprogramname(argv[0]);
/*
unless UNITSFILE and LOCALEMAP have absolute pathnames, we may need
progdir to search for supporting files
*/
if (!(isfullpath(UNITSFILE) && isfullpath(LOCALEMAP)))
progdir = getprogdir(argv[0], &fullprogname);
else {
progdir = NULL;
fullprogname = NULL;
}
datadir = NULL; /* directory to search as last resort */
checklocale();
#ifdef READLINE
# if RL_READLINE_VERSION > 0x0402
rl_completion_entry_function = (rl_compentry_func_t *)completeunits;
# else
rl_completion_entry_function = (Function *)completeunits;
# endif
rl_basic_word_break_characters = " \t+-*/()|^;";
flags.readline = isatty(0);
if (flags.readline){
int file_exists;
historyfile = personalfile(NULL,HISTORY_FILE,1,&file_exists);
}
#else
flags.readline = 0;
#endif
unitsfiles[0] = 0;
#ifdef _WIN32
if (!strcmp(homeunitsfile,".units"))
homeunitsfile = "unitdef.units";
localemap = findlocalemap(0);
if (localemap)
remaplocale(localemap);
#endif
interactive = processargs(argc, argv, &havestr, &wantstr);
#ifdef READLINE
if (interactive && flags.readline && historyfile){
rl_initialize();
read_history(historyfile);
init_history_length = history_length;
init_history_base = history_base;
atexit(save_history);
}
#endif
signal(SIGINT, write_files_sig);
signal(SIGTERM, write_files_sig);
if (logfilename) {
if (!interactive)
fprintf(stderr,
"Log file '%s' ignored in non-interactive mode.\n",logfilename);
else open_logfile();
}
/* user has specified the complete format--use it */
if (num_format.format != NULL) {
if (parsenumformat())
exit(EXIT_FAILURE);
}
else
setnumformat();
if (flags.verbose==0)
deftext = "";
if (!unitsfiles[0]){
char *unitsfile;
unitsfile = findunitsfile(0);
if (!unitsfile)
exit(EXIT_FAILURE);
else {
int file_exists;
unitsfiles[0] = unitsfile;
unitsfiles[1] = personalfile(HOME_UNITS_ENV, homeunitsfile,
0, &file_exists);
unitsfiles[2] = 0;
}
}
for(unitfileptr=unitsfiles;*unitfileptr;unitfileptr++){
readerr = readunits(*unitfileptr, stderr, &unitcount, &prefixcount,
&funccount, 0);
if (readerr==E_MEMORY)
exit(EXIT_FAILURE);
if (readerr==E_FILE){
fprintf(stderr, "%s: cannot open units file '%s'. ",
progname, *unitfileptr);
perror(0);
exit(EXIT_FAILURE);
}
}
if (flags.quiet)
queryhave = querywant = ""; /* No prompts are being printed */
else {
if (!promptprefix){
queryhave = QUERYHAVE;
querywant = QUERYWANT;
} else {
queryhave = (char *)mymalloc(strlen(promptprefix)+strlen(QUERYHAVE)+1,
"(main)");
querywant = (char *)mymalloc(strlen(promptprefix)+strlen(QUERYWANT)+1,
"(main)");
strcpy(queryhave, promptprefix);
strcat(queryhave, QUERYHAVE);
memset(querywant, ' ', strlen(promptprefix));
//for(i=0;i<strlen(promptprefix);i++) querywant[i]=' ';
strcpy(querywant+strlen(promptprefix), QUERYWANT);
}
printf("%d units, %d prefixes, %d nonlinear units\n\n",
unitcount, prefixcount,funccount);
}
queryhavewidth = strwidth(queryhave);
querywantwidth = strwidth(querywant);
if (flags.unitcheck) {
checkunits(flags.unitcheck==2 || flags.verbose==2);
exit(EXIT_SUCCESS);
}
if (!interactive) {
replacectrlchars(havestr);
if (wantstr)
replacectrlchars(wantstr);
#ifdef SUPPORT_UTF8
if (strwidth(havestr)<0){
printf("Error: %s on input\n",invalid_utf8);
exit(EXIT_FAILURE);
}
if (wantstr && strwidth(wantstr)<0){
printf("Error: %s on input\n",invalid_utf8);
exit(EXIT_FAILURE);
}
#endif
replace_minus(havestr);
removespaces(havestr);
if (wantstr) {
replace_minus(wantstr);
removespaces(wantstr);
}
if ((funcval = fnlookup(havestr))){
showfuncdefinition(funcval, FUNCTION);
exit(EXIT_SUCCESS);
}
if ((funcval = invfnlookup(havestr))){
showfuncdefinition(funcval, INVERSE);
exit(EXIT_SUCCESS);
}
if ((alias = aliaslookup(havestr))){
showunitlistdef(alias);
exit(EXIT_SUCCESS);
}
if (processunit(&have, havestr, NOPOINT))
exit(EXIT_FAILURE);
if (!wantstr){
showdefinition(havestr,&have);
exit(EXIT_SUCCESS);
}
if (replacealias(&wantstr, 0)) /* the 0 says that we can free wantstr */
exit(EXIT_FAILURE);
if ((funcval = fnlookup(wantstr))){
if (showfunc(havestr, &have, funcval)) /* Clobbers have */
exit(EXIT_FAILURE);
else
exit(EXIT_SUCCESS);
}
if (processwant(&want, wantstr, NOPOINT))
exit(EXIT_FAILURE);
if (strchr(wantstr, UNITSEPCHAR)){
if (showunitlist(havestr, &have, wantstr))
exit(EXIT_FAILURE);
else
exit(EXIT_SUCCESS);
}
if (showanswer(havestr,&have,wantstr,&want))
exit(EXIT_FAILURE);
else
exit(EXIT_SUCCESS);
} else { /* interactive */
pager = getenv("PAGER");
if (!pager)
pager = DEFAULTPAGER;
for (;;) {
do {
fflush(stdout);
getuser(&havestr,&havestrsize,queryhave);
replace_minus(havestr);
comment = strip_comment(havestr);
removespaces(havestr);
if (logfile && comment && emptystr(havestr))
fprintf(logfile, "#%s\n", comment);
} while (emptystr(havestr) || ishelpquery(havestr,0) ||
(!fnlookup(havestr) && !invfnlookup(havestr)
&& !aliaslookup(havestr)
&& processunit(&have, havestr, queryhavewidth)));
if (logfile) {
if (comment)
fprintf(logfile, "%s%s\t#%s\n", LOGFROM, havestr,comment);
else
fprintf(logfile, "%s%s\n", LOGFROM, havestr);
}
if ((alias = aliaslookup(havestr))){
showunitlistdef(alias);
continue;
}
if ((funcval = fnlookup(havestr))){
showfuncdefinition(funcval, FUNCTION);
continue;
}
if ((funcval = invfnlookup(havestr))){
showfuncdefinition(funcval, INVERSE);
continue;
}
do {
int repeat;
do {
repeat = 0;
fflush(stdout);
getuser(&wantstr,&wantstrsize,querywant);
replace_minus(wantstr);
comment = strip_comment(wantstr);
removespaces(wantstr);
if (logfile && comment && emptystr(wantstr)){
fprintf(logfile, "#%s\n", comment);
repeat = 1;
}
if (ishelpquery(wantstr, &have)){
repeat = 1;
printf("%s%s\n",queryhave, havestr);
}
} while (repeat);
} while (replacealias(&wantstr, &wantstrsize)
|| (!fnlookup(wantstr)
&& processwant(&want, wantstr, querywantwidth)));
if (logfile) {
fprintf(logfile, "%s", LOGTO);
tightprint(logfile, wantstr);
if (comment)
fprintf(logfile, "\t#%s", comment);
putc('\n', logfile);
}
if (emptystr(wantstr))
showdefinition(havestr,&have);
else if (strchr(wantstr, UNITSEPCHAR))
showunitlist(havestr, &have, wantstr);
else if ((funcval = fnlookup(wantstr)))
showfunc(havestr, &have, funcval); /* Clobbers have */
else {
showanswer(havestr,&have,wantstr, &want);
freeunit(&want);
}
unitcopy(&lastunit, &have);
lastunitset=1;
freeunit(&have);
}
}
return (0);
}
/* NOTES:
mymalloc, growbuffer and tryallunits are the only places with print
statements that should (?) be removed to make a library. How can
error reporting in these functions (memory allocation errors) be
handled cleanly for a library implementation?
Way to report the reduced form of the two operands of a sum when
they are not conformable.
Way to report the required domain when getting an domain error.
*/
|