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
|
/*************************************************************
* This file is part of the Surface Evolver source code. *
* Programmer: Ken Brakke, brakke@susqu.edu *
*************************************************************/
/*************************************************************
*
* file: utility.c
*
* Purpose: Various utility routines.
*/
#include "include.h"
/**************************************************************
*
* Function: getenv_EVOLVERPATH()
*
* Purpose: get the environment variable EVOLVERPATH for once and
* append the builtin path ENVEVOLVERPATHBUILTIN if it is
* defined and if EVOLVERPATH does not terminate with the
* magic triplet ENVPATHCHAR+ENVPATHCHAR+ENVPATHCHA. Checks
* and alterations might be implemented in future.
*/
/* const */ char * getenv_EVOLVERPATH(void)
{ static int uninitialized = 1;
static char *env_EVOLVERPATH = NULL;
if (uninitialized)
{ const char *environment_EVOLVERPATH = getenv("EVOLVERPATH");
if (environment_EVOLVERPATH != NULL)
{ const size_t lengthof_EVOLVERPATH = strlen(environment_EVOLVERPATH);
size_t sizeof_EVOLVERPATH =
lengthof_EVOLVERPATH
#ifdef ENVEVOLVERPATHBUILTIN
+ sizeof( ENVPATHCHAR ENVEVOLVERPATHBUILTIN )
#else
+ 1
#endif
;
#ifdef ENVEVOLVERPATHBUILTIN
int builtinpath_flag = 1;
#endif
env_EVOLVERPATH = (char *) malloc(sizeof_EVOLVERPATH);
strcpy(env_EVOLVERPATH,environment_EVOLVERPATH);
if (3 <= lengthof_EVOLVERPATH)
{ char *magictriplet = env_EVOLVERPATH + lengthof_EVOLVERPATH - 3;
if (!(strcmp(magictriplet, ENVPATHCHAR ENVPATHCHAR ENVPATHCHAR )))
{ *magictriplet = '\0';
#ifdef ENVEVOLVERPATHBUILTIN
builtinpath_flag = 0;
#endif
}
}
if (env_EVOLVERPATH != '\0')
{ const char ENVPATHCHAR_str[] = ENVPATHCHAR;
const char char_ENVPATHCHAR = ENVPATHCHAR_str[0];
char *dum = env_EVOLVERPATH + strlen(env_EVOLVERPATH) - 1;
while ((*dum == char_ENVPATHCHAR) && (env_EVOLVERPATH <= dum)) { *dum = '\0'; --dum; }
}
#ifdef ENVEVOLVERPATHBUILTIN
if (builtinpath_flag)
{ if (*env_EVOLVERPATH == '\0') strcpy(env_EVOLVERPATH, ENVEVOLVERPATHBUILTIN );
else strcat(env_EVOLVERPATH, ENVPATHCHAR ENVEVOLVERPATHBUILTIN );
}
else
#endif
{ if (*env_EVOLVERPATH == '\0')
{ free(env_EVOLVERPATH); env_EVOLVERPATH = NULL; }
}
}
#ifdef ENVEVOLVERPATHBUILTIN
else
{
env_EVOLVERPATH = ENVEVOLVERPATHBUILTIN ;
}
#endif
uninitialized = 0;
}
return env_EVOLVERPATH;
}
/**************************************************************
*
* Function: catcher()
*
* Purpose: User interrupt catcher. Sets breakflag so
* anybody in a long loop can test to see if
* user wants to break out.
*/
#ifdef WIN32
#define write(a,b,c) erroutstring(b)
#endif
void catcher(int sig)
{
#ifdef SIGALRM
if ( sig == SIGALRM )
signal(SIGALRM,catcher);
#endif
if ( sig == SIGINT )
{ signal(SIGINT,catcher);
#ifdef SGI_MULTI
if ( mpflag == M_ACTIVE )
{ if ( m_breakflag[GET_THREAD_ID] )
longjmp(m_jumpbuf[GET_THREAD_ID],1);
else m_breakflag[GET_THREAD_ID] = BREAKFULL;
if ( GET_THREAD_ID == 0 )
write(2,"\nWill break after iteration.\n",29);
breakflag = BREAKFULL;
iterate_flag = 0;
}
else
if ( GET_THREAD_ID > 0 ) {}
else
#endif
if ( iterate_flag == 1 )
{ write(2,"\nWill break after iteration.\n",29);
breakflag = BREAKFULL;
iterate_flag = 0;
}
else if ( iterate_flag == 2 ) /* graphing or something */
{ write(2,"\nWill abort operation.\n",24);
breakflag = BREAKFULL;
iterate_flag = 0;
}
else if ( hessian_iterate_flag == 1 )
{ write(2,"\nWill break after iteration.\n",29);
breakflag = BREAKFULL;
}
else
{ write(2,"\nAborting operation.\n",22);
if ( TRY_GRAPH_MUTEX(IMMEDIATE_TIMEOUT) )
ABORT_GRAPH_MUTEX
else
erroutstring("In GRAPH_MUTEX. May be deadlocked with graphics thread.\n");
#ifdef WIN32
/* separate thread for signal handler, so can't longjmp out of error */
erroutstring("Can't nicely abort command in WIN32. Hang in there, or\n");
erroutstring("use Task Manager to kill Evolver if you think it's hung.\n");
#elif defined(MAC_OS_X)
if ( iterate_flag > 2 )
erroutstring("Haven't figured out how to handle this yet.\n");
#else
kb_error(1357,"",RECOVERABLE_QUIET);
#endif
}
while ( commandfd && (commandfd != stdin) )
pop_commandfd();
quiet_flag = 0;
}
#ifdef SIGTERM
if ( sig == SIGTERM ) /* for outside kill and dump */
{ sprintf(errmsg,"Caught SIGTERM. proc %d ",getpid());
erroutstring(errmsg);
do_dump(NULL); /* dump to default */
my_exit(1);
}
#endif
#ifdef SIGHUP
if ( sig == SIGHUP ) /* for outside kill and dump */
{
do_dump(NULL); /* dump to default */
my_exit(1);
}
#endif
#ifdef SIGPIPE
else if ( sig == SIGPIPE )
{ signal(SIGPIPE,catcher);
write(2,"Broken pipe signal.\n",20);
broken_pipe_flag = 1;
}
#endif
} // end catcher()
/***********************************************************************
************************************************************************
Memory allocation routines
************************************************************************/
/* Memory block list heads */
struct memhead *perm_block_head;
struct memhead *temp_block_head;
struct memhead *graph_block_head;
struct memhead *eternal_block_head;
/***********************************************************************
*
* function: kb_checksum()
*
* purpose: to calculate a simple checksum on a block of memory.
*/
int kb_checksum(mem,size)
char *mem;
int size;
{
int sum = 0;
int *a,*b;
b = (int *)mem;
a = b + size/sizeof(int);
do { sum += *a; } while ( --a != b);
return sum;
} // end kb_checksum()
/********************************************************************
*********************************************************************
Memory allocation routines. These put my own
headers on memory blocks, and keep linked lists
for easy garbage collection. To start with, there
are surface-permanent and command-temporary lists,
but there could be more, for example of info that
needs to be distributed on a network implementation,
instead of the present dymem.
********************************************************************/
/********************************************************************
*
* function: mem_sanity_check()
*
* purpose: Checks all lists.
*/
void mem_sanity_check()
{ struct memhead *head;
int blocktype;
THREADBLOCK(blocktype);
#if defined(_WIN32) && defined(_HEAPOK)
#ifndef _HEAPINFO
#define _HEAPINFO _heapinfo
#endif
if ( _heapchk() != _HEAPOK )
kb_error(2580,"Internal error: Corrupt heap! Memory is trashed.\n",RECOVERABLE);
#endif
for ( head = eternal_block_head; head ; head = head->next )
{ if ( head->type != ETERNAL_BLOCK )
kb_error(2581,"Bad eternal memory block chain!\n",RECOVERABLE);
}
for ( head = perm_block_head ; head ; head = head->next )
{ if ( head->type != PERM_BLOCK )
kb_error(2460,"Bad permanent memory block chain!\n",RECOVERABLE);
}
if ( blocktype == TEMP_BLOCK )
for ( head = temp_block_head ; head ; head = head->next )
{ if ( head->type != TEMP_BLOCK )
kb_error(3208,"Bad temporary memory block chain!\n",RECOVERABLE);
}
if ( blocktype == GRAPH_BLOCK )
for ( head = graph_block_head ; head ; head = head->next )
{ if ( head->type != GRAPH_BLOCK )
kb_error(2461,"Bad graphics memory block chain!\n",RECOVERABLE);
}
} // end mem_sanity_check()
/********************************************************************
*
* function: mem_list_summary()
*
* purpose: Prints summary stats of memory lists.
*/
void mem_list_summary()
{ struct memhead *head;
size_t total=0,subtotal;
size_t count=0,subcount;
for ( head = eternal_block_head, subcount=subtotal=0 ; head ; head = head->next )
{ if ( head->type != ETERNAL_BLOCK )
kb_error(2462,"Bad eternal memory block chain!\n",RECOVERABLE);
else { subtotal += head->size; subcount++; }
}
if ( verbose_flag )
{ sprintf(errmsg,"Session: %7lu blocks, %10lu KB, or %lu MB \n",
(unsigned long)subcount,(unsigned long)subtotal>>10,
(unsigned long)subtotal>>20);
outstring(errmsg);
}
total += subtotal; count += subcount;
for ( head = perm_block_head, subcount=subtotal=0 ; head ; head = head->next )
{ if ( head->type != PERM_BLOCK )
kb_error(2463,"Bad permanent memory block chain!\n",RECOVERABLE);
else { subtotal += head->size; subcount++; }
}
if ( verbose_flag )
{ sprintf(errmsg,"Permanent: %5lu blocks, %10lu KB, or %lu MB \n",
(unsigned long)subcount,(unsigned long)(subtotal>>10),
(unsigned long)(subtotal>>20));
outstring(errmsg);
}
total += subtotal; count += subcount;
for ( head = temp_block_head, subcount=subtotal=0 ; head ; head = head->next )
{ if ( head->type != TEMP_BLOCK )
kb_error(2464,"Bad temporary memory block chain!\n",RECOVERABLE);
else { subtotal += head->size; subcount++; }
}
for ( head = graph_block_head ; head ; head = head->next )
{ if ( head->type != GRAPH_BLOCK )
kb_error(3210,"Bad graphics memory block chain!\n",RECOVERABLE);
else { subtotal += head->size; subcount++; }
}
if ( verbose_flag )
{ sprintf(errmsg,"Temporary: %5lu blocks, %10lu KB, or %lu MB\n",
(unsigned long)subcount,(unsigned long)(subtotal>>10),
(unsigned long)(subtotal>>20));
outstring(errmsg);
}
total += subtotal; count += subcount;
if ( verbose_flag )
sprintf(errmsg,"Total data memory: %lu blocks, %lu KB, or %lu MB.\n",
(unsigned long)count,(unsigned long)(total>>10),(unsigned long)(total>>20));
else
sprintf(errmsg,"Total data memory: %lu KB, or %lu MB.\n",
(unsigned long)(total>>10), (unsigned long)(total>>20));
outstring(errmsg);
// See if we can get video memory
#ifdef LINUX
if ( verbose_flag )
{ FILE *fd;
int i,vmem=0,mempages=0;
char procname[100];
sprintf(procname,"/proc/%d/stat",getpid());
fd = fopen(procname,"r");
if ( fd == NULL ) perror(procname);
for ( i = 0 ; i < 22 ; i++ ) fscanf(fd,"%s",msg);
fscanf(fd,"%d",&vmem);
sprintf(errmsg,"Virtual memory: %d\n",vmem);
outstring(errmsg);
fscanf(fd,"%d",&mempages);
sprintf(errmsg,"Resident memory: %d\n",mempages*getpagesize());
outstring(errmsg);
}
#endif
} // end mem_list_summary()
/********************************************************************
*
* function: mem_list_dump()
*
* purpose: Prints details of memory lists.
*/
void mem_list_dump()
{ struct memhead *head;
size_t subcount;
#ifdef MEMSTRINGS
outstring("\nEternal memory blocks:\n");
for ( head = eternal_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5d. %12.0f bytes at %p; %18s line %4d\n",
subcount,(double)head->size,head,head->file,head->line);
outstring(msg);
}
outstring("\nPermanent memory blocks:\n");
for ( head = perm_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5d. %12.0f bytes at %p; %18s line %4d\n",
subcount,(double)head->size,head,head->file,head->line);
outstring(msg);
}
outstring("\nTemporary memory blocks:\n");
for ( head = temp_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5d. %12.0f bytes at %p; %18s line %4d\n",
subcount,(double)head->size,head,head->file,head->line);
outstring(msg);
}
outstring("\nGraph memory blocks:\n");
for ( head = graph_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5d. %12.0f bytes at %p; %18s line %4d\n",
subcount,(double)head->size,head,head->file,head->line);
outstring(msg);
}
#else
outstring("\nEternal memory blocks:\n");
for ( head = eternal_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5ld. %12.0f bytes at %p\n",
(long)subcount,(double)head->size,head);
outstring(msg);
}
outstring("\nPermanent memory blocks:\n");
for ( head = perm_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5ld. %12.0f bytes at %p\n",
(long)subcount,(double)head->size,head);
outstring(msg);
}
outstring("\nTemporary memory blocks:\n");
for ( head = temp_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5ld. %12.0f bytes at %p\n",
(long)subcount,(double)head->size,head);
outstring(msg);
}
outstring("\nGraph memory blocks:\n");
for ( head = graph_block_head, subcount=0 ; head ; head = head->next )
{ subcount++;
sprintf(msg,"%5ld. %12.0f bytes at %p\n",
(long)subcount,(double)head->size,head);
outstring(msg);
}
#endif
} // end mem_list_dump()
/********************************************************************
Generic list calloc,realloc,free routines.
*********************************************************************/
/********************************************************************
*
* function: list_calloc()
*
* purpose: allocate memory block on desired list.
*/
#ifdef MEMSTRINGS
char *list_calloc(
size_t num, /* number of chunks */
size_t size, /* size of chunks */
int type, /* memory list type */
char *file,
size_t line
)
#else
char *list_calloc(
size_t num, /* number of chunks */
size_t size, /* size of chunks */
int type/* memory list type */
)
#endif
{ struct memhead **listhead=NULL;
struct memhead *ptr;
switch(type)
{ case PERM_BLOCK: listhead = &perm_block_head; break;
case TEMP_BLOCK: listhead = &temp_block_head; break;
case GRAPH_BLOCK: listhead = &graph_block_head; break;
case ETERNAL_BLOCK: listhead = &eternal_block_head; break;
default: kb_error(2452,"Internal error: illegal memory block type.\n",
RECOVERABLE);
}
ptr = (struct memhead *)calloc(sizeof(struct memhead)+num*size,1);
if ( ptr == NULL )
{
mem_sanity_check();
sprintf(errmsg,"Internal error: Cannot allocate memory size %lu*%lu = %lu.\n",
(unsigned long)num,(unsigned long)size,
(unsigned long)num*(unsigned long)size);
#ifdef MEMSTRINGS
sprintf(msg+strlen(msg),"Requested from %s line %d\n",file,line);
#endif
kb_error(2550,errmsg, RECOVERABLE);
}
/* fill in header */
ENTER_MEM_MUTEX
ptr->next = *listhead;
if ( *listhead )
(*listhead)->prev = ptr;
*listhead = ptr;
LEAVE_MEM_MUTEX
ptr->size = num*size;
ptr->type = type;
#ifdef MEMSTRINGS
strncpy(ptr->file,file,sizeof(ptr->file)-1);
ptr->line = (int)line;
#endif
if ( memdebug )
mem_sanity_check();
return (char*)(ptr+1);
} // end list_calloc()
/************************************************************************
*
* function: list_realloc()
*
* purpose: reallocate memory block on a list.
*
*/
#ifdef MEMSTRINGS
char *list_realloc(
char *ptr, /* old block */
size_t size, /* new size */
int type, /* of list */
char *file,
size_t line
)
#else
char *list_realloc(
char *ptr, /* old block */
size_t size, /* new size */
int type /* of list */
)
#endif
{ struct memhead **listhead=NULL;
struct memhead *newhead;
struct memhead *oldhead;
char *newptr;
size_t oldsize;
switch(type)
{ case PERM_BLOCK: listhead = &perm_block_head; break;
case TEMP_BLOCK: listhead = &temp_block_head; break;
case GRAPH_BLOCK: listhead = &graph_block_head; break;
case ETERNAL_BLOCK: listhead = &eternal_block_head; break;
default: kb_error(2453,"Internal error: illegal memory block type.\n",
RECOVERABLE);
}
#ifdef MEMSTRINGS
if ( ptr == NULL ) return list_calloc(size,1,type,file,line);
#else
if ( ptr == NULL ) return list_calloc(size,1,type);
#endif
oldhead = (struct memhead *)ptr - 1;
if ( oldhead->type != type )
{ sprintf(errmsg,"Internal error: Trying to realloc memory block to different list.\n");
#ifdef MEMSTRINGS
sprintf(errmsg+strlen(errmsg),"File %s, line %d; original alloc %s:%d\n",
file,line,oldhead->file,oldhead->line);
#endif
kb_error(2448,errmsg,RECOVERABLE);
}
oldsize = oldhead->size;
ENTER_MEM_MUTEX /* since manipulating shared variables */
/* delete from my list */
if ( oldhead->next ) oldhead->next->prev = oldhead->prev;
if ( oldhead->prev ) oldhead->prev->next = oldhead->next;
else *listhead = oldhead->next;
newhead =
(struct memhead *)realloc((char*)oldhead,sizeof(struct memhead)+size);
if ( newhead == NULL )
{ sprintf(errmsg,
"Internal error: Cannot reallocate memory from old size %lu to new %lu.\n",
(unsigned long)oldsize,(unsigned long)size);
#ifdef MEMSTRINGS
sprintf(msg+strlen(msg),"Requested from %s line %d\n",file,line);
#endif
kb_error(1360,errmsg,RECOVERABLE);
}
/* fill in header */
newhead->next = *listhead;
newhead->prev = NULL;
if ( *listhead )
(*listhead)->prev = newhead;
*listhead = newhead;
LEAVE_MEM_MUTEX
newhead->size = size;
newhead->type = type;
#ifdef MEMSTRINGS
strncpy(newhead->file,file,sizeof(newhead->file)-1);
newhead->line = (int)line;
#endif
newptr = (char*)(newhead+1);
if (oldsize < size ) memset(newptr+oldsize,0,size-oldsize);
if ( memdebug )
mem_sanity_check();
return newptr;
} /* end of list_realloc() */
/**************************************************************************
*
* function: list_free()
*
* purpose: free one block on a memory list.
*/
void list_free(
char *ptr,
int type /* of memory list */
)
{ struct memhead *head;
struct memhead **listhead=NULL;
if ( !ptr )
{ if ( memdebug ) erroutstring("\n");
return;
}
if ( memdebug )
mem_sanity_check();
switch(type)
{ case PERM_BLOCK: listhead = &perm_block_head; break;
case TEMP_BLOCK: listhead = &temp_block_head; break;
case GRAPH_BLOCK: listhead = &graph_block_head; break;
case ETERNAL_BLOCK: listhead = &eternal_block_head; break;
default: kb_error(2454,"Internal error: illegal memory block type.\n",
RECOVERABLE);
}
head = (struct memhead *)ptr - 1;
if ( memdebug )
{ char memmsg[1000];
#ifdef MEMSTRINGS
sprintf(memmsg," allocated from %s:%d\n",head->file,head->line);
#else
sprintf(memmsg,"\n");
#endif
erroutstring(memmsg);
}
if ( head->type != type )
{ char *headtypename,*typename;
switch ( head->type )
{ case ETERNAL_BLOCK: headtypename = "ETERNAL_BLOCK"; break;
case TEMP_BLOCK: headtypename = "TEMP_BLOCK"; break;
case PERM_BLOCK: headtypename = "PERM_BLOCK"; break;
case GRAPH_BLOCK: headtypename = "GRAPH_BLOCK"; break;
default: headtypename = "corrupt";
}
switch ( type )
{ case ETERNAL_BLOCK: typename = "ETERNAL_BLOCK"; break;
case TEMP_BLOCK: typename = "TEMP_BLOCK"; break;
case PERM_BLOCK: typename = "PERM_BLOCK"; break;
case GRAPH_BLOCK: typename = "GRAPH_BLOCK"; break;
default: headtypename = "corrupt";
}
#ifdef MEMSTRINGS
sprintf(errmsg,"Internal error: Trying to free memory block of type %s from %s list.\nAllocated from %s:%d\n",
headtypename,typename,head->file,head->line);
#else
sprintf(errmsg,"Internal error: Trying to free memory block of type %s from %s list.\n",
headtypename,typename);
#endif
kb_error(2465,errmsg,RECOVERABLE);
}
/* delete from my list */
ENTER_MEM_MUTEX
if ( head->next ) head->next->prev = head->prev;
if ( head->prev ) head->prev->next = head->next;
else *listhead = head->next;
LEAVE_MEM_MUTEX
free((char*)head);
if ( memdebug )
mem_sanity_check();
} // end list_free()
/**************************************************************************
*
* function: list_free_all()
*
* purpose: free all blocks on a list.
*/
void list_free_all(int type) /* of list */
{ struct memhead **listhead=NULL;
struct memhead *head,*nexthead;
switch(type)
{ case PERM_BLOCK: listhead = &perm_block_head; break;
case TEMP_BLOCK: listhead = &temp_block_head; break;
case GRAPH_BLOCK: listhead = &graph_block_head; break;
case ETERNAL_BLOCK: listhead = &eternal_block_head; break;
default: kb_error(2455,"Internal error: illegal memory block type.\n",
RECOVERABLE);
}
ENTER_MEM_MUTEX
for ( head = *listhead; head ; head = nexthead )
{ if ( head->type != type )
kb_error(3905,"Internal error: corrupt memory list.\n",RECOVERABLE);
if ( memdebug )
{ char memmsg[1000];
#ifdef MEMSTRINGS
sprintf(memmsg,"Freeing %p, %d bytes, allocated at %s:%d\n",head+1,
head->size,head->file,head->line);
#else
sprintf(memmsg,"Freeing %p, %ld bytes\n",head+1,(long)head->size);
#endif
erroutstring(memmsg);
}
nexthead = head->next;
free((char*)head);
}
*listhead = NULL;
LEAVE_MEM_MUTEX
} /* end list_free_all */
/********************************************************************
Permanent memory allocation. These blocks
will be automatically freed at the start of
a new surface, eliminating a lot of clean-up
drudgery.
********************************************************************/
/*********************************************************************
*
* function: kb_calloc
*
* purpose: memory allocation with error detection
* Also memory debugging.
* Called by macro mycalloc(num,size).
*/
#ifdef MEMSTRINGS
char *kb_calloc(
size_t num,
size_t size,
char *file,
size_t line
)
#else
char *kb_calloc(
size_t num,
size_t size
)
#endif
{ char *ptr;
if ( memdebug )
{
#ifdef MEMSTRINGS
sprintf(errmsg,"mycalloc %30.30s %5d: %10d ",file,line,num*size);
erroutstring(errmsg);
#else
sprintf(errmsg,"mycalloc %lu*%lu = %lu bytes ",(unsigned long)num,
(unsigned long)size,(unsigned long)num*size);
erroutstring(errmsg);
#endif
}
#ifdef MEMSTRINGS
ptr = list_calloc(num,size,PERM_BLOCK,file,line);
#else
ptr = list_calloc(num,size,PERM_BLOCK);
#endif
if ( memdebug )
{ sprintf(errmsg,"at %p\n",ptr); erroutstring(errmsg);
mem_sanity_check();
}
return ptr;
} /* end kb_calloc */
/*********************************************************************
*
* function: KB_realloc
*
* purpose: memory re-allocation with error detection
* Called through macro kb_realloc for optional memory debug.
*/
#ifdef MEMSTRINGS
char *KB_realloc(
char *ptr,
size_t size,
char *file,
size_t line
)
#else
char *KB_realloc(
char *ptr,
size_t size
)
#endif
{ char *newptr;
if ( memdebug )
{
#ifdef MEMSTRINGS
sprintf(errmsg,"%30.30s %4d: realloc old %p size %d to size %d \n",
file,line,ptr, (ptr ? ((struct memhead *)ptr)[-1].size:0) ,size);
#else
sprintf(errmsg,"realloc old %p size %ld to size %ld \n",ptr,
(long) (ptr ? ((struct memhead *)ptr)[-1].size:0 ) ,(long)size);
#endif
erroutstring(errmsg);
}
#ifdef MEMSTRINGS
if ( ptr == NULL ) newptr = kb_calloc(size,1,file,line);
else newptr = list_realloc(ptr,size,PERM_BLOCK,file,line);
#else
if ( ptr == NULL ) newptr = mycalloc(size,1);
else newptr = list_realloc(ptr,size,PERM_BLOCK);
#endif
if ( memdebug )
{ sprintf(errmsg,"at %p\n",newptr); erroutstring(errmsg);
mem_sanity_check();
}
return newptr;
} /* end KB_realloc() */
/********************************************************************
*
* function: myfree()
*
* purpose: Freeing memory. Common call for permanent memory freeing.
*
*/
void myfree(char *ptr)
{
if ( memdebug )
{
sprintf(errmsg,"free %p ",ptr);
erroutstring(errmsg);
}
list_free(ptr,PERM_BLOCK);
} // end myfree()
/********************************************************************
Temporary memory allocation. These blocks
will be automatically freed at the end of
each command, although subroutines should
practice good memory hygeine and free all
their own memory. Mostly intended in case
of error recovery.
********************************************************************/
/********************************************************************
*
* function: kb_temp_calloc()
*
* purpose: memory allocation that can be undone by longjmp at error.
*
*/
#ifdef MEMSTRINGS
char *kb_temp_calloc(
size_t num,
size_t size,
char *file,
size_t line
)
#else
char *kb_temp_calloc(
size_t num,
size_t size
)
#endif
{ char *ptr;
int blocktype = TEMP_BLOCK;
if ( memdebug )
{
#ifdef MEMSTRINGS
sprintf(errmsg,"%30.30s %4d: ",file,line);
erroutstring(errmsg);
#endif
sprintf(errmsg,"temp_calloc %9ld bytes ",(long)num*size);
erroutstring(errmsg);
}
THREADBLOCK(blocktype); // set GRAPH_BLOCK or TEMP_BLOCK
#ifdef MEMSTRINGS
ptr = list_calloc(num,size,blocktype,file,line);
#else
ptr = list_calloc(num,size,blocktype);
#endif
if ( memdebug )
{ sprintf(errmsg,"at %p \n",ptr); erroutstring(errmsg);
mem_sanity_check();
}
return ptr;
} // end kb_temp_calloc()
/********************************************************************
*
* function: temp_realloc()
*
* purpose: Changing size of temporary memory allocation.
*/
#ifdef MEMSTRINGS
char * kb_temp_realloc(
char *ptr,
size_t size,
char *file,
size_t line
)
#else
char * kb_temp_realloc(
char *ptr,
size_t size
)
#endif
{
char *newptr;
int blocktype = TEMP_BLOCK;
if ( memdebug )
{
#ifdef MEMSTRINGS
sprintf(errmsg,"%30.30s %4d: temp_realloc\n old size %9d at %p to size %9d",
file,line, (ptr ? ((struct memhead *)ptr)[-1].size:0),ptr ,size);
#else
sprintf(errmsg,"temp_realloc old %p size %9ld to size %9ld",ptr,
(long)(ptr ? ((struct memhead *)ptr)[-1].size:0 ) ,(long)size);
#endif
erroutstring(errmsg);
}
THREADBLOCK(blocktype);
#ifdef MEMSTRINGS
newptr = list_realloc(ptr,size,blocktype,file,line);
#else
newptr = list_realloc(ptr,size,blocktype);
#endif
if ( memdebug )
{ sprintf(errmsg," at %p \n",newptr); erroutstring(errmsg);
mem_sanity_check();
}
return newptr;
} // end kb_temp_realloc()
/********************************************************************
*
* function: temp_free()
*
* purpose: Usual freeing of temporary memory allocation.
*
*/
void temp_free(char *ptr)
{
int blocktype = TEMP_BLOCK;
if ( memdebug )
{
sprintf(errmsg,"temp_free %p ",ptr);
erroutstring(errmsg);
}
THREADBLOCK(blocktype);
list_free(ptr,blocktype);
} /* end temp_free */
/********************************************************************
*
* function: temp_free_all()
*
* purpose: Freeing of all temporary memory in case of error.
*
*/
void temp_free_all()
{
int blocktype = 0;
#ifdef _DEBUGXX
int oldmemdebug = memdebug;
memdebug=1;
#endif
if ( memdebug )
erroutstring("Entering temp_free_all\n");
THREADBLOCK(blocktype);
list_free_all(blocktype);
#ifdef MPI_EVOLVER
if ( this_task == 0 && blocktype != GRAPH_BLOCK )
mpi_temp_free_all();
#endif
#ifdef _DEBUGXX
memdebug = oldmemdebug;
#endif
/* pointers to be annulled in main thread */
if ( blocktype == TEMP_BLOCK )
{
saved.coord = NULL;
vhead = NULL;
pressures = NULL;
conrhs = NULL;
vgradbase = NULL;
rightside = NULL;
vpressures = NULL;
e_curve = NULL;
v_curve = NULL;
}
} // end temp_free_all()
/********************************************************************
Memory allocation routines for the block of memory holding
dynamic structures of surface description. Enables
exporting surface info to multiple processors.
Returns are offsets from start of dynamic region.
*********************************************************************/
#define ALIGNSIZE 8
struct dy_head { int size; /* bytes in block, including structures */
int state; /* see defines; also used as magic number */
DY_OFFSET prev; /* linear block list */
DY_OFFSET next;
DY_OFFSET prevfree; /* disordered free block list */
DY_OFFSET nextfree;
};
#define DY_FREE 0xCCAA
#define DY_USED 0xDDBB
#define DY_STARTSIZE 0x1000
int dy_minfrag = 2*sizeof(struct dy_head);
int dy_overhead = sizeof(struct dy_head);
DY_OFFSET dy_firstblock;
DY_OFFSET dy_lastblock;
DY_OFFSET dy_calloc(
int num,
int size
)
{ struct dy_head *ptr,*newptr,*lastptr;
DY_OFFSET off;
int needed;
int surplus;
int asize;
int i;
if ( dymemsize == 0 ) /* initial allocation */
{ if ( sizeof(struct dy_head) % ALIGNSIZE )
{ sprintf(errmsg,
"Internal error: sizeof(struct dy_head) %ld not multiple of ALIGNSIZE %d\n",
(long)sizeof(struct dy_head),ALIGNSIZE);
kb_error(1364,errmsg,UNRECOVERABLE);
}
dymem = mycalloc(DY_STARTSIZE,1);
dymemsize = DY_STARTSIZE;
strcpy(dymem,"DY_MEM"); /* so looks pretty in debugger */
dy_firstblock = sizeof(struct dy_head);
ptr = (struct dy_head *)dymem+1; /* so offset 0 not used */
ptr->size = DY_STARTSIZE-sizeof(struct dy_head);
ptr->state = DY_FREE;
ptr->next = 0;
ptr->prev = 0;
dy_lastblock = sizeof(struct dy_head);
dy_freestart = sizeof(struct dy_head);
ptr->prevfree = 0; /* first in list */
ptr->nextfree = 0; /* last in list */
}
/* size of needed block */
asize = ((num*size + ALIGNSIZE - 1)/ALIGNSIZE)*ALIGNSIZE;
if ( asize <= dy_minfrag ) asize = dy_minfrag;
needed = sizeof(struct dy_head) + asize;
if ( memdebug )
{ sprintf(errmsg,"dy_alloc %d*%d = %d bytes.\n",num,size,asize);
erroutstring(errmsg);
}
retry_alloc:
/* look for first fit in free block list */
if ( dy_freestart )
for ( off = dy_freestart ; off > 0 ; off = ptr->nextfree )
{
ptr = (struct dy_head *)(dymem + off);
/* check size */
if ( needed > ptr->size )
{ if ( ptr->nextfree == 0 ) break;
else continue;
}
surplus = ptr->size - needed;
if ( surplus > dy_minfrag )
{ /* divide block */
newptr = (struct dy_head *)(dymem + off + needed);
newptr->size = ptr->size - needed;
newptr->state = DY_FREE;
newptr->next = ptr->next;
newptr->prev = off;
if ( newptr->next )
((struct dy_head *)(dymem + newptr->next))->prev =
off + needed;
else
dy_lastblock = off + needed;
newptr->nextfree = ptr->nextfree;
newptr->prevfree = ptr->prevfree;
ptr->size = needed;
ptr->next = off + needed;
if (ptr->prevfree )
((struct dy_head *)(dymem + ptr->prevfree))->nextfree = off + needed;
else dy_freestart = off + needed;
if ( ptr->nextfree )
((struct dy_head *)(dymem + ptr->nextfree))->prevfree = off + needed;
}
else
{ /* remove from freelist */
if ( ptr->prevfree )
((struct dy_head *)(dymem + ptr->prevfree))->nextfree
= ptr->nextfree;
else dy_freestart = ptr->nextfree;
if ( ptr->nextfree )
((struct dy_head *)(dymem + ptr->nextfree))->prevfree
= ptr->prevfree;
ptr->nextfree = 0;
ptr->prevfree = 0;
}
ptr->state = DY_USED;
#ifdef _DEBUG
dy_check();
#endif
/* some handy debugging equivalences */
Globals = (struct global **)(dymem + dy_globals);
for ( i = 0 ; i < NUMELEMENTS ; i++ )
Extras[i] = EXTRAS(i);
return off + sizeof(struct dy_head);
}
/* if here, then no block big enough */
if ( memdebug ) erroutstring ("expanding dymem.\n");
ENTER_GRAPH_MUTEX
dymem = kb_realloc(dymem,2*dymemsize);
LEAVE_GRAPH_MUTEX
lastptr = (struct dy_head *)(dymem + dy_lastblock);
if ( lastptr->state == DY_FREE )
{ /* combine with last block */
lastptr->size += dymemsize;
}
else
{ /* put in free block list at head */
ptr = (struct dy_head *)(dymem + dymemsize);
ptr->size = dymemsize;
ptr->state = DY_FREE;
ptr->prev = dy_lastblock;
ptr->next = 0;
lastptr = (struct dy_head *)(dymem + dy_lastblock);
dy_lastblock = dymemsize;
lastptr->next = dymemsize;
ptr->prevfree = 0;
ptr->nextfree = dy_freestart;
if ( dy_freestart )
((struct dy_head *)(dymem+dy_freestart))->prevfree = dymemsize;
dy_freestart = dymemsize;
}
dymemsize = 2*dymemsize;
goto retry_alloc;
} // end dy_calloc()
DY_OFFSET dy_realloc(
DY_OFFSET old,
int newnum,
int newsize
)
{ DY_OFFSET newspot;
struct dy_head *ptr;
int i;
if ( memdebug )
{ erroutstring("dy_realloc "); }
ENTER_GRAPH_MUTEX
newspot = dy_calloc(newnum,newsize);
if ( old )
{ ptr = (struct dy_head *)(dymem + old) - 1;
if ( ptr->size < newnum*newsize )
memcpy(dymem+newspot,dymem+old,ptr->size);
else memcpy(dymem+newspot,dymem+old,newnum*newsize);
dy_free(old);
}
LEAVE_GRAPH_MUTEX
/* some handy debugging equivalences */
Globals = (struct global **)(dymem + dy_globals);
for ( i = 0 ; i < NUMELEMENTS ; i++ )
Extras[i] = EXTRAS(i);
#ifdef _DEBUG
dy_check();
#endif
return newspot;
} // end dy_realloc()
void dy_free(DY_OFFSET spot)
{ DY_OFFSET off = spot - sizeof(struct dy_head);
struct dy_head *ptr = (struct dy_head *)(dymem + off);
struct dy_head *prevhead,*nexthead;
if ( ptr->state != DY_USED )
kb_error(1366,"Internal error: Trying to dy_free unallocated block.\n",
RECOVERABLE);
memset(dymem+spot,0,ptr->size - dy_overhead);
ptr->nextfree = dy_freestart;
ptr->prevfree = 0;
if ( dy_freestart )
((struct dy_head *)(dymem + dy_freestart))->prevfree = off;
dy_freestart = off;
ptr->state = DY_FREE;
/* see if can combine with nbrs */
/* check preceding block */
if ( ptr->prev )
{ prevhead = (struct dy_head *)(dymem + ptr->prev);
if ( prevhead->state == DY_FREE )
{ /* combine */
prevhead->size += ptr->size;
prevhead->next = ptr->next;
if ( ptr->next )
{ nexthead = (struct dy_head *)(dymem + ptr->next);
nexthead->prev = ptr->prev;
}
if ( off == dy_lastblock )
dy_lastblock = ptr->prev;
/* remove from freelist */
if ( ptr->nextfree )
((struct dy_head*)(dymem+ptr->nextfree))->prevfree = ptr->prevfree;
if ( ptr->prevfree )
((struct dy_head*)(dymem+ptr->prevfree))->nextfree = ptr->nextfree;
else dy_freestart = ptr->nextfree;
memset((char*)ptr,0,sizeof(struct dy_head));
ptr = prevhead; /* ready for next stage of combining */
}
}
/* check following block */
if ( ptr->next )
{ nexthead = (struct dy_head *)(dymem + ptr->next);
if ( nexthead->state == DY_FREE )
{ /* combine */
if ( ptr->next == dy_lastblock )
dy_lastblock = nexthead->prev;
prevhead = ptr; ptr = nexthead;
prevhead->size += ptr->size;
prevhead->next = ptr->next;
if ( ptr->next )
{ nexthead = (struct dy_head *)(dymem + ptr->next);
nexthead->prev = ptr->prev;
}
/* remove from freelist */
if ( ptr->nextfree )
((struct dy_head*)(dymem+ptr->nextfree))->prevfree = ptr->prevfree;
if ( ptr->prevfree )
((struct dy_head*)(dymem+ptr->prevfree))->nextfree = ptr->nextfree;
else dy_freestart = ptr->nextfree;
memset((char*)ptr,0,sizeof(struct dy_head));
}
}
#ifdef _DEBUG
dy_check();
#endif
} // end dy_free()
void dy_check()
{
struct dy_head *head,*nexthead;
int freeblocks = 0;
int usedblocks = 0;
int freebytes = 0;
int usedbytes = 0;
DY_OFFSET off;
for ( off = dy_firstblock ; off != 0 ; off = head->next )
{ head = (struct dy_head *)(dymem + off);
switch ( head->state )
{ case DY_FREE: freeblocks++; freebytes += head->size; break;
case DY_USED: usedblocks++; usedbytes += head->size; break;
default: kb_error(2468,"Internal error: Corrupt dy_mem; bad state.\n",
RECOVERABLE);
return;
}
if ( head->next )
{ nexthead = (struct dy_head *)(dymem + head->next);
if ( off != nexthead->prev )
kb_error(2469,"Internal error: Corrupt dy_mem; bad prev.\n",RECOVERABLE);
}
}
if ( memdebug )
{ sprintf(errmsg,"Dymem arena: %d\n",dymemsize);
erroutstring(errmsg);
sprintf(errmsg,"Dymem free blocks: %d free bytes: %d\n",freeblocks,freebytes);
erroutstring(errmsg);
sprintf(errmsg,"Dymem used blocks: %d used bytes: %d\n",usedblocks,usedbytes);
erroutstring(errmsg);
}
/* check freelist integrity */
for ( off = dy_freestart ; (off != 0) && freeblocks ; off = head->nextfree )
{ head = (struct dy_head *)(dymem + off);
if ( head->state != DY_FREE )
kb_error(2555,"Internal error: Corrupt dy_mem nextfree.\n",RECOVERABLE);
if ( head->nextfree )
{ nexthead = (struct dy_head *)(dymem + head->nextfree);
if ( off != nexthead->prevfree )
kb_error(2470,"Internal error: Corrupt dy_mem prevfree.\n",RECOVERABLE);
}
freeblocks--;
}
if ( freeblocks || (off != 0) )
kb_error(2471,"Internal error: Corrupt dy_mem free list.\n",RECOVERABLE);
} /* end dy_check() */
/********* end of dynamic memory stuff **************************/
/**************************************************************
*
* Function: calc_edge()
*
* Purpose: Calculate the length of an edge from its endpoint
* coordinates. Puts result into edge structure.
*
*/
void calc_edge(edge_id e_id)
{
REAL len=0.0;
REAL s[MAXCOORD];
REAL midx[MAXCOORD];
int i,j,k;
vertex_id tv = get_edge_tailv(e_id);
REAL *xt=get_coord(tv);
REAL euclidean;
if ( everything_quantities_flag )
{ instance_attribute(e_id,length_method_number);
/* legitimate methods set edge length */
return;
}
get_edge_side(e_id,s);
euclidean = SDIM_dot(s,s);
if ( klein_metric_flag )
{ for ( i = 0 ; i < SDIM ; i++ ) midx[i] = xt[i] + s[i];/*unwrap head*/
len = klein_length(xt,midx);
}
else if ( web.metric_flag )
{
/* energy due to linear tension, metric evaluated at midpoint */
for ( k = 0, len = 0.0 ; k < gauss1D_num ; k++ )
{ REAL sum;
for ( i = 0 ; i < SDIM ; i++ )
midx[i] = gauss1Dpt[k]*s[i] + xt[i];
if ( web.conformal_flag )
{ REAL gg = eval(&web.metric[0][0],midx,NULLID,NULL);
len += gauss1Dwt[k]*sqrt(gg*euclidean);
}
else
{ for ( sum = 0.0, i = 0 ; i < SDIM ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
sum += s[i]*s[j]*eval(&web.metric[i][j],midx,NULLID,NULL);
len += gauss1Dwt[k]*sqrt(sum);
}
}
}
else
{
switch (web.modeltype)
{ case LINEAR: len = sqrt(euclidean); break;
case QUADRATIC:
{ MAT2D(x,3,MAXCOORD);
REAL tang[MAXCOORD];
int m;
len = 0;
get_edge_verts(e_id,x,NULL);
for ( m = 0 ; m < gauss1D_num ; m++ )
{ for ( j = 0 ; j < SDIM ; j ++ )
{ tang[j] = 0.0;
for ( k = 0 ; k < edge_ctrl ; k++ )
tang[j] += gauss1polyd[k][m]*x[k][j];
}
len += gauss1Dwt[m]*sqrt(SDIM_dot(tang,tang));
}
} break;
case LAGRANGE:
{ /* tangent vectors at gauss points */
int m;
MAT2D(x,20,MAXCOORD);
REAL tang[MAXCOORD];
int ctrl = web.skel[EDGE].ctrlpts;
struct gauss_lag *gl = &gauss_lagrange[1][web.gauss1D_order];
len = 0.0;
get_edge_verts(e_id,x,NULL);
for ( m = 0 ; m < gl->gnumpts ; m++ )
{ vec_mat_mul(gl->gpolypart[m][0],x,tang,ctrl,SDIM);
len += gl->gausswt[m]*sqrt(SDIM_dot(tang,tang));
}
}
break;
} /* end switch */
}
set_edge_length(e_id,len);
} // end calc_edge()
/************************************************************
*
* get_edge_side()
*
* Purpose: calculate the vector of an edge
*
* Input: edge_id e_id - specifies edge
* REAL *x; - 3 components of vector
*
* Output: x[] has side components
*/
void get_edge_side(
edge_id e_id,
REAL *x
)
{
REAL *y,*z;
int i;
REAL w[MAXCOORD];
y = get_coord(get_edge_tailv(e_id));
z = get_coord(get_edge_headv(e_id));
if ( web.symmetry_flag )
{
(*sym_wrap)(z,w,get_edge_wrap(e_id));
z = w;
}
for ( i = 0 ; i < SDIM ; i++ )
x[i] = z[i] - y[i];
} // end get_edge_side()
/************************************************************
*
* get_edge_tail_tangent()
*
* Purpose: Calculate the tangent vector of an edge at the tail.
* Magnitude of tangent equal to length, pretty much.
*
* Input: edge_id e_id - specifies edge
* REAL *x; - 3 components of vector
*
* Output: x[] has side components
*/
void get_edge_tail_tangent(
edge_id e_id,
REAL *x
)
{
int i,n;
REAL w[MAXCOORD],ww[MAXCOORD];
if ( web.lagrange_order == 1 )
{
REAL *y,*z;
y = get_coord(get_edge_tailv(e_id));
z = get_coord(get_edge_headv(e_id));
if ( web.symmetry_flag )
{
(*sym_wrap)(z,w,get_edge_wrap(e_id));
z = w;
}
for ( i = 0 ; i < SDIM ; i++ )
x[i] = z[i] - y[i];
return;
}
if ( web.modeltype == QUADRATIC )
{ vertex_id v[3];
REAL *xx[3];
v[0] = get_edge_tailv(e_id);
v[1] = get_edge_midv(e_id);
v[2] = get_edge_headv(e_id);
xx[0] = get_coord(v[0]);
xx[1] = get_coord(v[1]);
xx[2] = get_coord(v[2]);
if ( web.symmetry_flag )
{ WRAPTYPE wrap = get_edge_wrap(e_id);
(*sym_wrap)(xx[2],w,wrap);
xx[2] = w;
if ( inverted(e_id) )
{ (*sym_wrap)(xx[1],ww,wrap);
xx[1] = ww;
}
}
if ( circular_arc_flag )
{ REAL dx1 = xx[1][0] - xx[0][0];
REAL dx2 = xx[2][0] - xx[1][0];
REAL dy1 = xx[1][1] - xx[0][1];
REAL dy2 = xx[2][1] - xx[1][1];
REAL denom1 = sqrt(dx1*dx1+dy1*dy1);
REAL denom2 = sqrt(dx2*dx2+dy2*dy2);
REAL chord,sinth,costh,angle,length;
if (denom1*denom2 == 0.0) {x[0] = x[1] = 0.0; return ;}
chord = sqrt((dx1+dx2)*(dx1+dx2)+(dy1+dy2)*(dy1+dy2));
sinth = (dx1*dy2 - dy1*dx2)/denom1/denom2;
costh = (dx1*dx2 + dy1*dy2)/denom1/denom2;
angle = atan2(sinth,costh);
if ( sinth == 0.0 )
{ for ( i = 0 ; i < SDIM ; i++ )
x[i] = xx[2][i] - xx[0][i];
return;
}
length = chord*angle/sinth;
x[0] = length*(costh*(dx1+dx2) + sinth*(dy1+dy2))/chord;
x[1] = length*(costh*(dy1+dy2) - sinth*(dx1+dx2))/chord;
return;
}
else
{ /* regular quadratic */
for ( i = 0 ; i < SDIM ; i++ )
x[i] = -3*xx[0][i] + 4*xx[1][i] - xx[2][i];
}
return;
}
if ( web.modeltype == LAGRANGE )
{ struct gauss_lag *gl = &gauss_lagrange[1][web.gauss1D_order];
int ctrl = web.skel[EDGE].ctrlpts;
int spot = inverted(e_id) ? ctrl-1 : 0;
vertex_id *v;
REAL *xx[MAXLAGRANGE+1];
v = get_edge_vertices(e_id);
for ( i = 0 ; i < ctrl ; i++ )
xx[i] = get_coord(v[i]);
if ( web.symmetry_flag )
{ WRAPTYPE wrap = get_edge_wrap(e_id);
(*sym_wrap)(xx[ctrl-1],w,wrap);
xx[ctrl-1] = w;
}
for ( i = 0 ; i < SDIM ; i++ )
{ x[i] = 0;
for ( n = 0 ; n < ctrl ; n++ )
x[i] += gl->lpolypart[spot][0][n]*xx[n][i];
x[i] *= ctrl; /* scaling to length of edge */
if ( inverted(e_id) )
x[i] = -x[i];
}
}
} // end get_edge_tail_tangent()
/*************************************************************
*
* function: get_edge_adjust()
*
* purpose: adjust a side vector for torus wrap.
* used only in torvol.c.
*/
void get_edge_adjust(
edge_id e_id,
REAL *w
)
{
REAL x[MAXCOORD];
int i ;
for ( i = 0 ; i < SDIM ; i++ ) x[i] = 0.0;
(*sym_wrap)(x,w,get_edge_wrap(e_id));
} // end get_edge_adjust()
/***************************************************************
*
* Function: get_vertex_evalence
*
* Purpose: return number of edges around vertex
*
*/
int get_vertex_evalence(vertex_id v_id)
{
int n = 0;
edge_id e_id;
edge_id next_e;
ATTR attr = get_vattr(v_id);
if ( attr & (Q_MIDPOINT|Q_MIDEDGE) ) return 1;
e_id = get_vertex_edge(v_id);
if ( !valid_element(e_id) ) return 0;
next_e = e_id;
do
{ n++;
next_e = get_next_tail_edge(next_e);
if ( n > 2*web.skel[EDGE].count )
{ sprintf(errmsg,
"Internal error: vertex_evalence() in infinite loop on vertex %s.\n",
ELNAME(v_id));
kb_error(2482,errmsg,RECOVERABLE);
}
}
while ( !equal_id(next_e,e_id) );
return n;
} // end get_vertex_evalence()
/***************************************************************
*
* Function: get_edge_valence
*
* Purpose: return number of facets around edge
*/
int get_edge_valence(edge_id e_id)
{
int n = 0,m=0;
facetedge_id fe = get_edge_fe(e_id);
facetedge_id next_fe = fe;
if ( !valid_id(fe) ) return 0;
do
{ if ( valid_id(get_fe_facet(fe)) ) n++;
next_fe = get_next_facet(next_fe);
m++; /* infinite loop preventer */
if ( m > web.skel[FACETEDGE].count )
{ sprintf(errmsg,
"Internal error: edge_valence() in infinite loop on edge %s.\n",
ELNAME(e_id));
kb_error(2480,errmsg,RECOVERABLE);
}
}
while ( next_fe != fe );
return n;
} // end get_edge_valence()
/***************************************************************
*
* Function: get_facet_valence
*
* Purpose: return number of edges around facet
*
*/
int get_facet_valence(facet_id f_id)
{
int n = 0;
facetedge_id fe = get_facet_fe(f_id);
facetedge_id next_fe = fe;
if ( !valid_id(fe) ) return 0;
do
{ n++;
next_fe = get_next_edge(next_fe);
if ( n > 2*web.skel[EDGE].count )
{ sprintf(errmsg,
"Internal error: facet_valence() in infinite loop on facet %s.\n",
ELNAME(f_id));
kb_error(2481,errmsg,RECOVERABLE);
}
}
while ( valid_id(next_fe) && (next_fe != fe) );
return n;
} // end get_facet_valence()
/***************************************************************
*
* Function: get_body_valence
*
* Purpose: return number of facets around a body
*/
int get_body_valence(body_id b_id)
{
int n = 0;
facet_id f_id = get_body_facet(b_id);
facet_id next_f = f_id;
if ( !valid_id(f_id) ) return 0;
if ( web.representation == STRING ) return get_facet_valence(f_id);
/*
if ( bfacet_timestamp < top_timestamp )
{ make_bfacet_lists();
bfacet_timestamp = top_timestamp;
}
*/
do
{ n++;
next_f = get_next_body_facet(next_f);
}
while ( (next_f != f_id) && (n < 3*web.skel[FACET].count) );
return n;
} // end get_body_valence()
/*********************************************************************
*
* function: set_facet_vertices()
*
* purpose: Fill in vertex lists of facets.
*/
void set_facet_vertices()
{
/* have to make expandable v list for quadratic mode */
}
/****************************************************************
*
* function: begin_normal_motion()
*
* purpose: calculates vertex normals as volume gradients, normalized to
* unit length.
*/
void begin_normal_motion()
{
vertex_id v_id;
facetedge_id fe;
MAT2D(normals,MAXCOORD,MAXCOORD);
int i;
pt_type *vn;
int normcount;
if ( vertex_normals != NULL ) myfree((char*)vertex_normals);
vertex_normals = (pt_type *)mycalloc(
web.skel[VERTEX].max_ord+1,sizeof(pt_type));
FOR_ALL_VERTICES(v_id)
{ REAL mag;
fe = get_vertex_fe(v_id);
if ( !valid_id(fe) ) continue;
normcount = new_calc_vertex_normal(v_id,normals);
project_vertex_normals(v_id,normals,normcount);
vn = vertex_normals + loc_ordinal(v_id);
mag = sqrt(dot(normals[0],normals[0],SDIM));
if ( mag != 0.0 )
for ( i = 0 ; i < SDIM ; i++ )
(*vn)[i] = normals[0][i]/mag;
}
normal_motion_flag = 1;
} // end begin_normal_motion()
/*****************************************************************
*
* function: end_normal_motion()
*
* purpose: free memory used in normal motion mode
*/
void end_normal_motion()
{
if ( vertex_normals != NULL ) myfree((char*)vertex_normals);
vertex_normals = NULL;
normal_motion_flag = 0;
} // end end_normal_motion()
/***********************************************************
*
* Function: vertex_total_vol_grad()
*
* Purpose: Calculate the gradient of combined body volume at a vertex.
* Meant for triple lines and such in surface diffusion.
*
* Input: vertex id
* norm - pointer to place for normal vector
*
*
* Output: Average normal, normalized to unit length.
*
* Return value: Length of original normal, i.e. volume gradient.
*/
REAL vertex_total_vol_grad(
vertex_id v_id,
REAL *norm)
{
int i,j;
REAL y[MAXCOORD],z[MAXCOORD];
REAL fnorm[MAXCOORD];
facetedge_id fe_id,first_fe;
REAL size;
/* check for string */
if ( web.representation == STRING )
{ edge_id e_id,start_e;
norm[0] = norm[1] = 0.0;
start_e = e_id = get_vertex_edge(v_id);
do
{ facetedge_id fe,fe2;
facet_id f_id;
get_edge_side(e_id,y);
fe = get_edge_fe(e_id);
if ( valid_id(fe) )
{ fe2 = get_next_facet(fe);
if ( equal_id(fe,fe2) )
{ /* valence 1, so count it according to facet orientation */
f_id = get_fe_facet(fe);
if ( inverted(f_id) )
{ norm[0] -= y[1];
norm[1] += y[0];
}
else
{ norm[0] += y[1];
norm[1] -= y[0];
}
}
}
e_id = get_next_tail_edge(e_id);
} while ( !equal_id(e_id,start_e) );
goto normalize;
}
/* Get here only for soapfilm model. */
first_fe = fe_id = get_vertex_first_facet(v_id);
for ( i = 0 ; i < SDIM ; i++ ) norm[i] = 0.0;
do
{ facet_id f_id = get_fe_facet(fe_id);
body_id b_id = get_facet_body(f_id);
body_id bb_id = get_facet_body(invert(f_id));
if ( valid_id(b_id) != valid_id(bb_id) )
{ /* one-sided, so count it */
get_fe_side(fe_id,z);
get_fe_side(get_prev_edge(fe_id),y);
cross_prod(y,z,fnorm);
if ( valid_id(b_id) )
for ( i = 0 ; i < SDIM ; i++ ) norm[i] += fnorm[i];
else
for ( i = 0 ; i < SDIM ; i++ ) norm[i] -= fnorm[i];
}
fe_id = get_next_vertex_facet(v_id,fe_id);
} while ( !equal_id(fe_id,first_fe) );
normalize:
if ( get_vattr(v_id) & CONSTRAINT )
{
conmap_t * conmap = get_v_constraint_map(v_id);
int oncount = 0,hitcount;
struct constraint *con[MAXCONHIT];
int conlist[MAXCONHIT];
REAL perp[MAXCOORD];
for ( j = 1 ; j <= (int)conmap[0] ; j++ )
{
if ( (conmap[j] & CON_HIT_BIT) && (oncount < web.sdim) )
{ conlist[oncount] = conmap[j];
con[oncount++] = get_constraint(conmap[j]);
}
}
hitcount = constr_proj(TANGPROJ,oncount,con,get_coord(v_id),
norm,perp,conlist,DETECT,v_id);
if ( hitcount != oncount )
{ clear_v_constraint_status(v_id);
for ( j = 0 ; j < hitcount ; j++ )
set_v_constraint_status(v_id,conlist[j]);
}
for ( j = 0 ; j < SDIM ; j++ )
norm[j] -= perp[j];
}
size = sqrt(SDIM_dot(norm,norm));
if ( size <= 0.0 ) return 0.0;
for ( i = 0 ; i < SDIM ; i++ ) norm[i] /= size;
return size/web.simplex_factorial;
} // end vertex_total_vol_grad()
/***********************************************************
*
* Function: calc_vertex_normal
*
* Purpose: Calculate average normal of facets around a vertex.
* Only does the facets
* in the same face as given facet; will not cross
* multiple edges.
*
* Input: vertex id
* facet-edge id - with tail at vertex, for defining face
* norm - pointer to place for normal vector
*
*
* Output: Average normal, normalized to unit length.
*
* Return value: Length of original normal, i.e. volume gradient.
*/
REAL calc_vertex_normal(
vertex_id v_id,
facetedge_id fe,
REAL *norm
)
{
int i,j;
REAL y[MAXCOORD],z[MAXCOORD];
REAL fnorm[MAXCOORD];
facetedge_id sidea;
struct boundary *bdry; /* to check staying on same boundary */
REAL size;
/* check for string */
if ( web.representation == STRING )
{ edge_id e_id,ee_id;
e_id = get_vertex_edge(v_id);
ee_id = get_next_tail_edge(e_id);
get_edge_side(e_id,z);
get_edge_side(ee_id,y);
if ( equal_id(e_id,ee_id) ) { norm[0] = y[1]; norm[1] = -y[0]; }
else { norm[0] = y[1] - z[1]; norm[1] = z[0] - y[0]; }
if (inverted(e_id)) { norm[0] = -norm[0]; norm[1] = -norm[1];}
goto normalize;
}
if ( !valid_id(fe) )
{ fe = get_vertex_fe(v_id);
if ( !valid_id(fe) )
{ for ( i = 0 ; i < SDIM ; i++ ) norm[i] = 0.0;
return 0.0;
}
}
for ( i = 0 ; i < SDIM ; i++ ) norm[i] = 0.0;
bdry = get_facet_boundary(get_fe_facet(fe)); /* original boundary */
/* go around one way to edge of face */
sidea = fe;
do
{
get_fe_side(sidea,z);
get_fe_side(get_prev_edge(sidea),y);
cross_prod(y,z,fnorm);
for ( i = 0 ; i < SDIM ; i++ ) norm[i] += fnorm[i];
/* go to next facet */
sidea = get_prev_edge(sidea);
if ( equal_id(sidea,get_next_facet(sidea)) ) break; /* edge */
sidea = fe_inverse(get_next_facet(sidea));
if ( bdry != get_facet_boundary(get_fe_facet(sidea)) ) break;
if ( equal_id(sidea,fe) ) goto onormalize; /* went all the way around */
}
while ( equal_id(get_next_facet(sidea),get_prev_facet(sidea)) );
/* go around the other way */
sidea = fe;
while ( equal_id(get_next_facet(sidea),get_prev_facet(sidea)) )
{
if ( equal_id(sidea,get_next_facet(sidea)) ) break; /* edge */
sidea = fe_inverse(get_next_facet(sidea));
sidea = get_next_edge(sidea);
if ( bdry != get_facet_boundary(get_fe_facet(sidea)) ) break;
get_fe_side(sidea,z);
get_fe_side(get_prev_edge(sidea),y);
cross_prod(y,z,fnorm);
for ( i = 0 ; i < SDIM ; i++ ) norm[i] += fnorm[i];
}
/* orient */
onormalize:
if ( inverted(get_fe_facet(fe)) )
for ( i = 0 ; i < SDIM ; i++ ) norm[i] = -norm[i];
normalize:
if ( get_vattr(v_id) & CONSTRAINT )
{
conmap_t * conmap = get_v_constraint_map(v_id);
int oncount = 0,hitcount;
struct constraint *con[MAXCONHIT];
int conlist[MAXCONHIT];
REAL perp[MAXCOORD];
for ( j = 1 ; j <= (int)conmap[0] ; j++ )
{
if ( (conmap[j] & CON_HIT_BIT) && (oncount < web.sdim) )
{ conlist[oncount] = conmap[j];
con[oncount++] = get_constraint(conmap[j]);
}
}
hitcount = constr_proj(TANGPROJ,oncount,con,get_coord(v_id),
norm,perp,conlist,DETECT,v_id);
if ( hitcount != oncount )
{ clear_v_constraint_status(v_id);
for ( j = 0 ; j < hitcount ; j++ )
set_v_constraint_status(v_id,conlist[j]);
}
for ( j = 0 ; j < SDIM ; j++ )
norm[j] -= perp[j];
}
size = sqrt(SDIM_dot(norm,norm));
if ( size <= 0.0 ) return 0.0;
for ( i = 0 ; i < SDIM ; i++ ) norm[i] /= size;
return size/web.simplex_factorial;
} // end calc_vertex_normal()
/***********************************************************
*
* Function: calc_vertex_smooth_normal
*
* Purpose: Calculate average normal of facets around a vertex
* for grapics normal interpolation. Only does the facets
* in the same face as given facet; will not cross
* multiple edges, or boundary or constraint edges
* when different from facet. Only uses first 3 dimensions.
* Does not project normal to constraints.
*
* Input: vertex id
* facet-edge id - with tail at vertex, for defining face
* norm - pointer to place for normal vector
*
*
* Output: Average normal, normalized to unit length.
*
* Return value: none.
*/
void calc_vertex_smooth_normal(
vertex_id v_id,
facetedge_id fe,
REAL *norm
)
{
int i;
REAL y[MAXCOORD],z[MAXCOORD];
REAL fnorm[MAXCOORD];
facetedge_id sidea;
facet_id f_id = get_fe_facet(fe);
struct boundary *bdry; /* to check staying on same boundary */
REAL size;
/* check for string */
if ( web.representation != SOAPFILM )
{ kb_error(2208,"Internal error: Using calc_vertex_smooth_normal() on non-soapfilm surface.\n",
RECOVERABLE);
}
if ( !valid_id(fe) )
kb_error(2209,"Internal error: Invalid fe in calc_vertex_smooth_normal().\n",RECOVERABLE);
bdry = get_facet_boundary(f_id); /* original boundary */
get_facet_normal(f_id,norm); /* starter normal */
/* go around one way to edge of face */
sidea = fe;
for(;;)
{ edge_id e_id;
/* go to next facet */
sidea = get_prev_edge(sidea);
if ( equal_id(sidea,get_next_facet(sidea)) ) break; /* valence 1 */
if ( !equal_id(get_next_facet(sidea),get_prev_facet(sidea)) ) break;
e_id = get_fe_edge(sidea);
if ( !equal_constr(f_id,e_id) ) break;
if ( bdry != get_edge_boundary(e_id) ) break;
sidea = fe_inverse(get_next_facet(sidea));
if ( bdry != get_facet_boundary(get_fe_facet(sidea)) ) break;
if ( equal_id(sidea,fe) ) goto snormalize; /* went all the way around */
get_fe_side(sidea,z);
get_fe_side(get_prev_edge(sidea),y);
cross_prod(y,z,fnorm);
for ( i = 0 ; i < SDIM ; i++ ) norm[i] += fnorm[i]/2;
}
/* go around the other way */
sidea = fe;
while ( equal_id(get_next_facet(sidea),get_prev_facet(sidea)) )
{ edge_id e_id;
if ( equal_id(sidea,get_next_facet(sidea)) ) break; /* edge */
e_id = get_fe_edge(sidea);
if ( !equal_constr(f_id,e_id) ) break;
if ( bdry != get_edge_boundary(e_id) ) break;
sidea = fe_inverse(get_next_facet(sidea));
sidea = get_next_edge(sidea);
if ( bdry != get_facet_boundary(get_fe_facet(sidea)) ) break;
get_fe_side(sidea,z);
get_fe_side(get_prev_edge(sidea),y);
cross_prod(y,z,fnorm);
for ( i = 0 ; i < SDIM ; i++ ) norm[i] += fnorm[i]/2;
}
snormalize:
size = sqrt(SDIM_dot(norm,norm));
if ( size <= 0.0 ) return;
for ( i = 0 ; i < SDIM ; i++ ) norm[i] /= size;
} // end calc_vertex_smooth_normal()
/***************************************************************************
*
* function: lagrange_edge_normal()
*
* purpose: compute geometric normal space at a lagrange point of an edge.
*/
int lagrange_edge_normal(
vertex_id v_id,
edge_id e_id,
REAL **norm
)
{
MAT2D(vx,MAXVCOUNT,MAXCOORD);
struct gauss_lag *gl = &gauss_lagrange[1][web.gauss1D_order];
vertex_id *v = get_edge_vertices(e_id);
int k,m,i;
int ctrl = web.skel[EDGE].ctrlpts;
REAL tang[MAXCOORD],*t=tang;
get_edge_verts(e_id,vx,NULL);
for ( k = 0 ; k < ctrl ; k++ ) if ( v[k] == v_id ) break;
#ifdef VOLUMEGRAD
/* volume gradient */
norm[0] = norm[1] = 0.0;
for ( m = 0 ; m < gl->gnumpts ; m++ )
{ REAL y,dx;
for ( y = 0.0, dx = 0.0, j = 0 ; j < ctrl ; j++ )
{ y += gl->gpoly[m][j]*vx[j][1];
dx += gl->gpolypart[m][0][j]*vx[j][0];
}
norm[0] -= gl->gausswt[m]*y*gl->gpolypart[m][0][k];
norm[1] -= gl->gausswt[m]*dx*gl->gpoly[m][k];
}
#else
/* geometric normal */
for ( i = 0 ; i < SDIM ; i++ ) tang[i] = 0.0;
for ( m = 0 ; m < ctrl ; m++ )
{ REAL prime;
prime = gl->lpolypart[k][0][m];
for ( i = 0 ; i < SDIM ; i++ )
tang[i] += prime*vx[m][i];
}
return kernel_basis_rows(&t,norm,1,SDIM);
#endif
} // end lagrange_edge_normal()
/***************************************************************************
*
* function: lagrange_facet_normal()
*
* purpose: compute geometric normal at a lagrange point of a facet.
*/
int lagrange_facet_normal(
vertex_id v_id,
facet_id f_id,
REAL **norm
)
{
vertex_id *v = get_facet_vertices(f_id);
struct gauss_lag *gl = &gauss_lagrange[web.dimension][web.gauss2D_order];
MAT2D(sides,MAXCOORD,MAXCOORD);
MAT2D(vx,MAXVCOUNT,MAXCOORD);
int ctrl = web.skel[FACET].ctrlpts;
int i,j,k,kk;
get_facet_verts(f_id,vx,NULL);
for ( k = 0 ; k < ctrl ; k++ ) if ( v[k] == v_id ) break;
if ( k >= ctrl )
{ sprintf(errmsg,
"Internal error: Can't find vertex %s in facet %s.\n",ELNAME(v_id),
ELNAME1(f_id));
kb_error(2210,errmsg,RECOVERABLE);
}
for ( j = 0 ; j < SDIM ; j++ ) sides[0][j] = 0.0;
for ( i = 1 ; i <= web.dimension ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
for ( kk = 0, sides[i][j] = 0.0 ; kk < ctrl ; kk++ )
sides[i][j] += gl->lpolypart[k][i-1][kk]*vx[kk][j];
if ( inverted(f_id) )
for ( j = 0 ; j < SDIM ; j++ ) sides[1][j] = -sides[1][j];
return kernel_basis_rows(sides+1,norm,web.dimension,SDIM);
} // end lagrange_facet_normal()
/***************************************************************************
*
* function: quadratic_edge_normal()
*
* purpose: compute geometric normal space at a point of a quadratic edge.
*/
REAL quad_tang_coeffs[3][3] = { { -1.5,2.0,-0.5},
{-0.5,0.0,0.5},{ 0.5,-2.0,1.5}};
int quadratic_edge_normal(
vertex_id v_id,
edge_id e_id,
REAL **norm
)
{
MAT2D(vx,MAXVCOUNT,MAXCOORD);
vertex_id *v = get_edge_vertices(e_id);
int k,m,i;
int ctrl = web.skel[EDGE].ctrlpts; /* should be 3 */
REAL tang[MAXCOORD],*t=tang;
get_edge_verts(e_id,vx,NULL); /* has midv in vx[1] */
for ( k = 0 ; k < ctrl ; k++ ) if ( v[k] == v_id ) break;
if ( k != 0 ) k = 3 - k; /* switch vertices 1 and 2 compared to lagrange */
/* geometric normal */
for ( i = 0 ; i < SDIM ; i++ ) tang[i] = 0.0;
for ( m = 0 ; m < ctrl ; m++ )
{ REAL prime;
prime = quad_tang_coeffs[k][m];
for ( i = 0 ; i < SDIM ; i++ )
tang[i] += prime*vx[m][i];
}
return kernel_basis_rows(&t,norm,1,SDIM);
} // end quadratic_edge_normal()
/***************************************************************************
*
* function: quadratic_facet_normal()
*
* purpose: compute geometric normal at a lagrange point of a facet.
*/
int qlconvert[6] = { 0, 1, 2, 4, 5, 3}; /* index conversion */
int lqconvert[6] = { 0, 1, 2, 5, 3, 4}; /* index conversion */
int quadratic_facet_normal(
vertex_id v_id,
facet_id f_id,
REAL **norm
)
{
vertex_id v[6];
struct gauss_lag *gl = &gauss_lagrange[web.dimension][web.gauss2D_order];
MAT2D(sides,MAXCOORD,MAXCOORD);
MAT2D(vx,MAXVCOUNT,MAXCOORD);
int ctrl = web.skel[FACET].ctrlpts;
int i,j,k,kk;
facetedge_id fe_id;
fe_id = get_facet_fe(f_id);
for ( i = 0 ; i < FACET_EDGES ; i++ )
{ v[qlconvert[2*i]] = get_fe_tailv(fe_id);
v[qlconvert[2*i+1]] = get_fe_midv(fe_id);
fe_id = get_next_edge(fe_id);
}
get_facet_verts(f_id,vx,NULL);
for ( k = 0 ; k < ctrl ; k++ ) if ( v[k] == v_id ) break;
if ( k >= ctrl )
{ sprintf(errmsg,"Internal error: Can't find vertex %s in facet %s.\n",
ELNAME(v_id), ELNAME1(f_id));
kb_error(2211,errmsg,RECOVERABLE);
}
for ( j = 0 ; j < SDIM ; j++ ) sides[0][j] = 0.0;
for ( i = 1 ; i <= web.dimension ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
for ( kk = 0, sides[i][j] = 0.0 ; kk < ctrl ; kk++ )
sides[i][j] += gl->lpolypart[k][i-1][kk]*vx[lqconvert[kk]][j];
return kernel_basis_rows(sides+1,norm,web.dimension,SDIM);
} // end quadratic_facet_normal()
/***********************************************************
*
* Function: new_calc_vertex_normal
*
* Purpose: Calculate subspace normal to surface for purposes
* of Hessian normal or normal motion. Normal space
* is essentially that spanned by the volume normals
* of all adjacent bodies. Idea is to rule out
* purely tangential motions.
*
* Input: vertex id
* norm - pointer to place for normal basis
*
*
* Output: Basis for normal space if not full dimension
* Return value: Dimension of normal
*/
int new_calc_vertex_normal(
vertex_id v_id,
REAL **norm /* returned basis */
)
{
int i,j,kk;
REAL y[MAXCOORD],z[MAXCOORD];
MAT2D(fnorm,MAXCOORD,MAXCOORD);
facetedge_id sidea,sideb,ffe;
// struct boundary *bdry; /* to check staying on same boundary */
REAL size;
int retval = 0;
facetedge_id fe,start_fe;
facet_id f_id;
int valence,bares=0,singles=0,doubles=0,triples=0,bareflag=0;
ATTR vattr;
if (web.representation == SIMPLEX ) return simplex_vertex_normal(v_id,norm);
vattr = get_vattr(v_id);
if ( hessian_special_normal_flag )
{
REAL *x = get_coord(v_id);
for ( i = 0 ; i < SDIM ; i++ )
norm[0][i] = eval(hessian_special_normal_expr+i,x,v_id,NULL);
size = sqrt(SDIM_dot(norm[0],norm[0]));
if ( size == 0.0 )
{ sprintf(errmsg, "hessian_special_normal_vector is zero at vertex %s.\n",
ELNAME(v_id));
kb_error(2212,errmsg,RECOVERABLE);
}
for ( i = 0 ; i < SDIM ; i++ ) norm[0][i] = norm[0][i]/size;
return 1; /* one-dimensional normal only */
}
if ( hessian_normal_one_flag )
{ MAT2D(mat,MAXCOORD,MAXCOORD);
facet_id f_id;
edge_id e_id, starte;
for ( i = 0 ; i < SDIM ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
mat[i][j] = 0.0;
if ( web.representation == SOAPFILM )
{ facetedge_id fe_id,startfe;
fe_id = startfe = get_vertex_first_facet(v_id);
do
{ f_id = get_fe_facet(fe_id);
get_facet_normal(f_id,fnorm[0]);
size = SDIM_dot(fnorm[0],fnorm[0]);
for ( i = 0 ; i < SDIM ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
mat[i][j] += fnorm[0][i]*fnorm[0][j]/size;
fe_id = get_next_vertex_facet(v_id,fe_id);
} while ( !equal_element(fe_id,startfe) );
}
else if ( web.representation == STRING )
{
e_id = starte = get_vertex_edge(v_id);
do
{ get_edge_side(e_id,fnorm[0]);
mat[0][0] += fnorm[0][1]*fnorm[0][1];
mat[0][1] -= fnorm[0][1]*fnorm[0][0];
mat[1][0] -= fnorm[0][0]*fnorm[0][1];
mat[1][1] += fnorm[0][0]*fnorm[0][0];
e_id = get_next_tail_edge(e_id);
} while ( !equal_element(e_id,starte) );
}
/* find eigenvector */
for ( kk = 0 ; kk < 10 ; kk++ )
{ matvec_mul(mat,fnorm[0],y,SDIM,SDIM);
matvec_mul(mat,y,fnorm[0],SDIM,SDIM);
}
size = sqrt(SDIM_dot(fnorm[0],fnorm[0]));
for ( i = 0 ; i < SDIM ; i++ ) norm[0][i] = fnorm[0][i]/size;
return 1;
} /* end hessian_normal_one_flag */
if ( vattr & Q_MIDFACET )
{ /* Lagrange model */
facet_id f_id = get_vertex_facet(v_id);
retval = lagrange_facet_normal(v_id,f_id,norm);
goto ncn_exit;
}
/* Want to check for bare edges in SOAPFILM model */
/* so can handle same way as string edges */
if ( web.representation == SOAPFILM )
{ edge_id e_id,start_e;
e_id = get_vertex_edge(v_id);
if ( !valid_id(e_id) ) goto full_dim; /* bare point */
start_e = e_id;
do
{ valence = get_edge_valence(e_id);
if ( valence == 0 ) bares++;
if ( valence == 1 ) singles++;
if ( valence == 2 ) doubles++;
if ( valence >= 3 ) triples++;
if ( vattr & (Q_MIDPOINT|Q_MIDEDGE) ) break;
e_id = get_next_tail_edge(e_id);
} while ( !equal_id(e_id,start_e) );
if ( triples >= SDIM ) goto full_dim;
// if ( singles >= SDIM ) goto full_dim;
// if ( bares >= SDIM ) goto full_dim;
// if ( bares && (singles+doubles+triples) ) goto full_dim;
if ( triples >= 1 )
{ if ( vattr & (Q_MIDPOINT|Q_MIDEDGE) ) bareflag = 1; /* effectively */
else goto tripletest;
}
if ( (singles==0) && (doubles==0) )
bareflag = 1;
}
if ( (vattr & Q_MIDEDGE) && (bareflag || (web.representation == STRING)) )
{
edge_id e_id = get_vertex_edge(v_id);
retval = lagrange_edge_normal(v_id,e_id,norm);
goto ncn_exit;
}
if ( (vattr & Q_MIDPOINT) && (bareflag || (web.representation == STRING)) )
{
edge_id e_id = get_vertex_edge(v_id);
retval = quadratic_edge_normal(v_id,e_id,norm);
goto ncn_exit;
}
/* check for string */
if ( web.representation == STRING )
{ /* Must be endpoint of string edge */
edge_id e_id,ee_id,eee_id;
e_id = get_vertex_edge(v_id);
if ( !valid_id(e_id) ) goto full_dim;
ee_id = get_next_tail_edge(e_id);
eee_id = get_next_tail_edge(ee_id);
if ( !equal_id(e_id,eee_id) )
goto full_dim; /* triple vertex at least */
if ( (web.modeltype == LAGRANGE) && (web.lagrange_order >= 2) )
retval = lagrange_edge_normal(v_id,e_id,norm);
else if ( web.modeltype == QUADRATIC )
{ MAT2D(vx,3,MAXCOORD);
REAL *t = y;
get_edge_verts(e_id,vx,NULL);
for ( i = 0 ; i < SDIM ; i++ )
y[i] = -1.5*vx[0][i] + 2*vx[1][i] - 0.5*vx[2][i];
retval = kernel_basis_rows(&t,norm,1,SDIM);
}
else
{ REAL *t = y;
get_edge_side(e_id,y);
if ( !equal_id(e_id,ee_id ) )
{ get_edge_side(ee_id,z);
for ( i = 0 ; i < SDIM ; i++ ) y[i] -= z[i];
}
retval = kernel_basis_rows(&t,norm,1,SDIM);
}
if ( inverted(e_id) )
for ( i = 0 ; i < SDIM ; i++ ) norm[0][i] = -norm[0][i];
goto ncn_exit;
}
/* now have 2D facets */
fe = get_vertex_fe(v_id);
if ( !valid_id(fe) )
goto full_dim;
// bdry = get_facet_boundary(get_fe_facet(fe)); /* original boundary */
sidea = fe;
if ( vattr & Q_MIDPOINT )
{ /* quadratic model */
/* already tested for bare or triple edges, so one or two facets */
/* If two, combine normals */
MAT2D(norm2,MAXCOORD,MAXCOORD);
facet_id f_id = get_fe_facet(sidea);
if ( inverted(f_id) )
sidea = inverse_id(sidea);
if ( !equal_id(get_next_facet(sidea),get_prev_facet(sidea)) )
goto tripletest;
retval = quadratic_facet_normal(v_id,get_fe_facet(sidea),norm);
sideb = get_next_facet(sidea);
if ( equal_id(sidea,sideb) ) goto ncn_exit;
sideb = inverse_id(sideb);
retval = quadratic_facet_normal(v_id,get_fe_facet(sideb),norm2);
for ( i = 0 ; i < retval ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
norm[i][j] += norm2[i][j];
goto ncn_exit;
}
if ( vattr & Q_MIDEDGE )
{ /* Lagrange model */
MAT2D(norm2,MAXCOORD,MAXCOORD);
facet_id f_id = get_fe_facet(sidea);
if ( inverted(f_id) )
sidea = inverse_id(sidea);
if ( !equal_id(get_next_facet(sidea),get_prev_facet(sidea)) )
goto tripletest;
retval = lagrange_facet_normal(v_id,get_fe_facet(sidea),norm);
sideb = get_next_facet(sidea);
if ( equal_id(sidea,sideb) ) goto ncn_exit;
sideb = inverse_id(sideb);
retval = lagrange_facet_normal(v_id,get_fe_facet(sideb),norm2);
for ( i = 0 ; i < retval ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
norm[i][j] += norm2[i][j];
goto ncn_exit;
}
/* usual case of facet in N dim */
/* if get here, know no triple lines */
retval = 1; // dimension of normal
for ( j = 0 ; j < SDIM ; j++ )
for ( i = 0 ; i < SDIM ; i++ ) norm[j][i] = 0.0;
fe = start_fe = get_vertex_first_facet(v_id);
do
{ f_id = get_fe_facet(fe);
if ( vattr & AXIAL_POINT )
{ get_fe_side(sidea,z);
get_fe_side(get_next_edge(sidea),y);
cross_prod(y,z,fnorm[0]);
retval = 1;
}
else
{
switch ( web.modeltype )
{ case LINEAR:
get_facet_normal(f_id,fnorm[0]);
break;
case QUADRATIC:
retval = quadratic_facet_normal(v_id,f_id,fnorm);
break;
case LAGRANGE:
retval = lagrange_facet_normal(v_id,f_id,fnorm);
break;
}
}
if ( !equal_element(start_fe,fe) && SDIM_dot(norm[0],fnorm[0]) < 0 )
{ // orientation reversed relative to normal so far
for ( i = 0 ; i < SDIM ; i++ )
norm[0][i] -= fnorm[0][i];
}
else
{ for ( i = 0 ; i < SDIM ; i++ )
norm[0][i] += fnorm[0][i];
}
/* go to next facet */
fe = get_next_vertex_facet(v_id,fe);
} while ( !equal_element(fe,start_fe) );
goto ncn_exit;
tripletest:
/* if get here, know there are one or two triple edges into vertex */
{ /* triple line */
REAL *t = fnorm[0];
int triple_count = 0;
facetedge_id start_e;
edge_id e_id;
for ( i = 0 ; i < SDIM ; i++ ) fnorm[0][i] = 0.;
start_e = e_id = get_vertex_edge(v_id);
do
{ int valence = get_edge_valence(e_id);
if ( valence >= 3 )
{ if ( web.modeltype==QUADRATIC )
{ retval = quadratic_edge_normal(v_id,e_id,norm);
goto ncn_exit; /* lazy; just use first triple */
}
if ( web.modeltype==LAGRANGE )
{ retval = lagrange_edge_normal(v_id,e_id,norm);
goto ncn_exit; /* lazy; just use first triple */
}
/* accumulate tangents */
ffe = get_edge_fe(e_id);
if ( !equal_id(get_next_facet(ffe),get_prev_facet(ffe)) )
{ /* triple again */
triple_count++;
get_fe_side(ffe,z);
switch ( triple_count )
{ case 1:
for ( i = 0 ; i < SDIM ; i++ ) fnorm[0][i] += z[i]; break;
case 2:
for ( i = 0 ; i < SDIM ; i++ ) fnorm[0][i] -= z[i]; break;
default: goto full_dim; /* more than 2 */
}
}
}
e_id = get_next_tail_edge(e_id);
} while ( !equal_element(start_e,e_id) );
retval = kernel_basis_rows(&t,norm,1,SDIM);
}
goto ncn_exit;
ncn_exit:
return retval;
full_dim:
for ( i = 0 ; i < SDIM ; i++ )
{ for ( j = 0 ; j < SDIM ; j++ )
norm[i][j] = 0.0;
norm[i][i] = 1.0;
}
return SDIM;
} // end new_calc_vertex_normal()
/*************************************************************************
*
* Function: project_vertex_normals()
*
* Purpose: Take incoming normal basis, project to constraints,
* and orthonormalize. Meant to be called after
* new_calc_vertex_normal().
*
* Return: Number of independent basis vectors.
* Basis vectors altered in place.
*/
int project_vertex_normals(
vertex_id v_id,
REAL **normals,
int normcount
)
{ conmap_t *conmap;
int oncount;
MAT2D(grads,MAXCOORD,MAXCOORD);
MAT2D(pp,MAXCOORD,MAXCOORD);
MAT2D(qq,MAXCOORD,MAXCOORD);
REAL dummy;
int i,j,n;
conmap = get_v_constraint_map(v_id);
oncount = 0;
if ( conmap[0] )
{ /* calculate projection matrix to fewer degrees of freedom */
for ( j = 1; j <= (int)conmap[0] ; j++ )
{ struct constraint *constr;
if ( !(conmap[j] & CON_HIT_BIT) ) continue;
constr = get_constraint(conmap[j]);
eval_all(constr->formula,get_coord(v_id),SDIM,
&dummy, grads[oncount],v_id);
oncount++;
}
if ( oncount > 0 )
{
/* project basis to constraints */
oncount = gram_schmidt(grads,oncount,SDIM);
mat_mul_tr(grads,normals,qq,oncount,SDIM,normcount);
tr_mat_mul(grads,qq,pp,oncount,SDIM,normcount);
for ( j = 0 ; j < normcount ; j++ )
for ( i = 0 ; i < SDIM ; i++ )
normals[j][i] -= pp[i][j];
}
/* orthonormalize */
for ( i = 0 ; i < normcount ; i++ )
{ /* subtract previous components */
REAL sum;
for ( j = 0 ; j < i ; j++ )
{ sum = dot(normals[i],normals[j],SDIM);
for ( n = 0 ; n < SDIM ; n++ )
normals[i][n] -= sum*normals[j][n];
}
/* normalize */
sum = dot(normals[i],normals[i],SDIM);
sum = sqrt(sum);
if ( sum > hessian_epsilon )
for ( n = 0 ; n < SDIM ; n++ ) normals[i][n] /= sum;
else /* have to skip this direction */
{ for ( n = 0 ; n < SDIM ; n++ )
normals[i][n] = normals[normcount-1][n];
normcount--;
i--;
}
}
}
return normcount;
} // end project_vertex_normals()
/***************************************************************
*
* Function: get_facet_normal()
*
* Purpose: find facet normal (length = area).
* 3D only
*/
void get_facet_normal(
facet_id f_id,
REAL *normal
)
{ facetedge_id fe;
REAL side1[MAXCOORD],side2[MAXCOORD];
int i;
if ( web.representation == SIMPLEX )
kb_error(1368,"Internal error: Trying to take normal in simplex model.\n",
RECOVERABLE);
if ( web.modeltype == LINEAR ) /* better for strange symmetries */
{ MAT2D(x,FACET_VERTS,MAXCOORD);
get_facet_verts(f_id,x,NULL); /* in tail order */
for ( i = 0 ; i < SDIM ; i++ )
{ side1[i] = x[1][i] - x[0][i];
side2[i] = x[2][i] - x[1][i];
}
}
else
{ fe = get_facet_fe(f_id);
get_edge_side(get_fe_edge(fe),side1);
fe = get_next_edge(fe);
get_edge_side(get_fe_edge(fe),side2);
}
cross_prod(side1,side2,normal);
for ( i = 0 ; i < SDIM ; i++ )
normal[i] /= 2; /* triangle factor */
} // end get_facet_normal()
#ifdef NEWFACETNORMAL
attempt to do normal at arbitrary point in facet. Incomplete
/***************************************************************
*
* Function: new_get_facet_normal()
*
* Purpose: find facet normal (length = area).
* Any dimension, linear, quadratic, or Lagrange model.
* Needs barycentric coords for quadratic or Lagrange.
*
*/
void new_get_facet_normal(
facet_id f_id,
REAL *normal,
REAL *b /* barycentric coords */
)
{ facetedge_id fe;
MAT2D(x,MAXCOORD+1,MAXCOORD);
int i;
int m;
MAT2D(sides,MAXCOORD,MAXCOORD);
normal[i] /= 2; /* triangle factor */
if ( web.modeltype == LINEAR )
{
get_facet_verts(f_id,x,NULL); /* in tail order */
/* fan of sides from v0 */
for ( i = 0 ; i < web.dimension ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
sides[i][j] = x[i+1][j] - x[0][j];
kernel_basis_rows(sides,&normal,web.dimension,SDIM);
}
else if ( web.modeltype == QUADRATIC )
{
get_facet_verts(f_id,x,NULL); /* in tail order */
/* tangents at point */
mat_mult(gpolypartial[m],x,sides,web.dimension,FACET_CTRL,SDIM);
kernel_basis_rows(sides,&normal,web.dimension,SDIM);
}
else if ( web.modeltype == LAGRANGE )
{
int ctrl = web.skel[FACET].ctrlpts;
int dim = web.dimension;
struct gauss_lag *gl = &gauss_lagrange[dim][web.gauss2D_order];
get_facet_verts(f_id,x,NULL);
/* tangent vectors at gauss points */
mat_mult(gl->gpolypart[m],x,sides,dim,ctrl,SDIM);
kernel_basis_rows(sides,&normal,web.dimension,SDIM);
}
} // end new_get_facet_normal()
#endif
/***************************************************************
*
* Function: get_edge_verts()
*
* Purpose: to get all vertices of an edge, nicely
* displaced relative to first vertex of edge in case of symmetry gp
* NOTE: Quadratic model: midv in verts[1]
*
*/
void get_edge_verts(
edge_id e_id,
REAL **verts, /* third spot NULL if don't want midpts in quadratic */
WRAPTYPE *wraps /* wraps of vertices; NULL if not wanted */
)
{
int j,k;
WRAPTYPE wrap = 0;
REAL *x;
if ( web.representation == SIMPLEX )
kb_error(1369,"Internal error: Can't do get_edge_verts for simplex model.\n",RECOVERABLE);
if ( web.modeltype == LAGRANGE )
{ vertex_id *v = get_edge_vertices(e_id);
int n = web.skel[EDGE].ctrlpts;
if ( web.symmetry_flag )
{
wrap = get_edge_wrap(e_id);
}
for ( j = 0 ; j < n ; j++ )
{ x = get_coord(v[j]);
if ( wrap && (j > 0) && (inverted(e_id) || (j==n-1)))
(*sym_wrap)(x,verts[j],wrap);
else
for ( k = 0 ; k < SDIM ; k++ )
verts[j][k] = x[k];
}
return;
}
if ( web.symmetry_flag )
{
x = get_coord(get_edge_tailv(e_id));
for ( j = 0 ; j < SDIM ; j++ ) verts[0][j] = x[j];
wrap = get_edge_wrap(e_id);
if ( (web.modeltype == QUADRATIC) && verts[2] )
{ if ( wraps ){wraps[0] = 0; wraps[2] = wrap; }
x = get_coord(get_edge_headv(e_id));
(*sym_wrap)(x,verts[2],wrap);
x = get_coord(get_edge_midv(e_id));
if ( inverted(e_id) )
{ if ( wraps ) wraps[1] = wrap;
(*sym_wrap)(x,verts[1],wrap);
}
else
{ for ( j = 0 ; j < SDIM ; j++ ) verts[1][j] = x[j];
if ( wraps ) wraps[1] = 0;
}
}
else
{ if ( wraps ){wraps[0] = 0; wraps[1] = wrap; }
x = get_coord(get_edge_headv(e_id));
(*sym_wrap)(x,verts[1],wrap);
}
}
else
{ x = get_coord(get_edge_tailv(e_id));
for ( j = 0 ; j < SDIM ; j++ ) verts[0][j] = x[j];
x = get_coord(get_edge_headv(e_id));
if ( (web.modeltype == QUADRATIC) && verts[2] )
{ for ( j = 0 ; j < SDIM ; j++ ) verts[2][j] = x[j];
x = get_coord(get_edge_midv(e_id));
for ( j = 0 ; j < SDIM ; j++ ) verts[1][j] = x[j];
}
else
for ( j = 0 ; j < SDIM ; j++ ) verts[1][j] = x[j];
}
} // end get_edge_verts()
/***************************************************************
*
* Function: get_facet_verts()
*
* Purpose: to get all three vertices of a facet, nicely
* displaced relative to first vertex of facet in case of symmetry gp
*
*/
void get_facet_verts(
facet_id f_id,
REAL **verts, /* fourth spot NULL if don't want midpts in quadratic */
WRAPTYPE *wraps /* wraps of vertices; NULL if not wanted */
)
{
facetedge_id fe;
int i,j;
WRAPTYPE wrap,fewrap;
REAL *x;
if ( web.modeltype == LAGRANGE )
{ vertex_id *v = get_facet_vertices(f_id);
int ctrlpts = web.skel[FACET].ctrlpts;
int n = web.lagrange_order;
f_id = positive_id(f_id); /* since vertices in particular order */
for ( i = 0 ; i < ctrlpts ; i++ )
{
x = get_coord(v[i]);
for ( j = 0 ; j < SDIM ; j++ )
verts[i][j] = x[j];
}
if ( web.symmetry_flag )
{
if ( wraps )
for ( j = 0 ; j < ctrlpts ; j++ ) wraps[j] = 0;
/* gotta go through the 3 edges */
/* first edge */
fe = get_facet_fe(f_id);
wrap = get_fe_wrap(fe);
if ( wrap && inverted(get_fe_edge(fe)) )
for ( j = 1 ; j < n ; j++ )
{ (*sym_wrap)(get_coord(v[j]),verts[j],wrap);
if ( wraps ) wraps[j] = wrap;
}
if ( wrap )
{ (*sym_wrap)(get_coord(v[n]),verts[n],wrap);
if ( wraps ) wraps[n] = wrap ;
}
/* second edge */
fe = get_next_edge(fe);
if ( wrap && !inverted(get_fe_edge(fe)) )
for ( j = 1 ; j < n ; j++ )
{ int m = n*(j+1) - j*(j-1)/2;
(*sym_wrap)(get_coord(v[m]),verts[m],wrap);
if ( wraps ) wraps[m] = wrap;
}
fewrap = get_fe_wrap(fe);
wrap = (*sym_compose)(wrap,fewrap);
if ( wrap && inverted(get_fe_edge(fe)) )
for ( j = 1 ; j < n ; j++ )
{ int m = n*(j+1) - j*(j-1)/2;
(*sym_wrap)(get_coord(v[m]),verts[m],wrap);
if ( wraps ) wraps[m] = wrap;
}
if ( wrap )
{ int m = n*(n+3)/2;
(*sym_wrap)(get_coord(v[m]),verts[m],wrap);
if ( wraps ) wraps[m] = wrap;
}
/* third edge */
fe = get_next_edge(fe);
if ( wrap && !inverted(get_fe_edge(fe)) )
for ( j = 1 ; j < n ; j++ )
{ int m = n*j + j*(3-j)/2;
(*sym_wrap)(get_coord(v[m]),verts[m],wrap);
if ( wraps ) wraps[m] = wrap;
}
fewrap = get_fe_wrap(fe);
wrap = (*sym_compose)(wrap,fewrap);
if ( wrap && inverted(get_fe_edge(fe)) )
for ( j = 1 ; j < n ; j++ )
{ int m = n*j + j*(3-j)/2;
(*sym_wrap)(get_coord(v[m]),verts[m],wrap);
if ( wraps ) wraps[m] = wrap;
}
}
return;
}
if ( (web.modeltype == QUADRATIC) && verts[3] )
{ get_facet_verts_q(f_id,verts,wraps); return; }
if ( web.representation == SIMPLEX )
{ vertex_id *v = get_facet_vertices(f_id);
for ( i = 0 ; i <= web.dimension ; i++ )
{ x = get_coord(v[i]);
for ( j = 0 ; j < SDIM ; j++ )
verts[i][j] = x[j];
}
return;
}
fe = get_facet_fe(f_id);
if ( web.symmetry_flag )
{ wrap = 0;
for ( i = 0 ; i < FACET_VERTS ; i++ )
{
x = get_coord(get_fe_tailv(fe));
if ( wraps ) wraps[i] = wrap;
(*sym_wrap)(x,verts[i],wrap);
fewrap = get_fe_wrap(fe);
wrap = (*sym_compose)(wrap,fewrap);
fe = get_next_edge(fe);
}
}
else for ( i = 0 ; i < FACET_VERTS ; i++ )
{ vertex_id v_id = get_fe_tailv(fe);
x = get_coord(v_id);
for ( j = 0 ; j < SDIM ; j++ )
verts[i][j] = x[j];
fe = get_next_edge(fe);
}
} // end get_facet_verts(0
/***************************************************************
*
* Function: get_facet_verts_special()
*
* Purpose: to get all three vertices of a facet, nicely
* displaced to fundamental cell in case of symmetry group.
* Extra work to get them to come out close to origin.
*/
void get_facet_verts_special(
facet_id f_id,
REAL **verts, /* fourth spot NULL if don't want midpts in quadratic */
WRAPTYPE *wraps /* wraps of vertices; NULL if not wanted */
)
{
facetedge_id fe;
int i,j,ii;
WRAPTYPE wrap,fewrap;
REAL *x;
if ( web.modeltype == LAGRANGE )
{ vertex_id *v = get_facet_vertices(f_id);
int k = web.skel[FACET].ctrlpts;
for ( i = 0 ; i < k ; i++ )
{ x = get_coord(v[i]);
for ( j = 0 ; j < SDIM ; j++ )
verts[i][j] = x[j];
}
return;
}
if ( (web.modeltype == QUADRATIC) && verts[3] )
{ get_facet_verts_q(f_id,verts,wraps); return; }
if ( web.representation == SIMPLEX )
{ vertex_id *v = get_facet_vertices(f_id);
for ( i = 0 ; i <= web.dimension ; i++ )
{ x = get_coord(v[i]);
for ( j = 0 ; j < SDIM ; j++ )
verts[i][j] = x[j];
}
return;
}
fe = get_facet_fe(f_id);
if ( web.symmetry_flag )
{
/* start with point closest to origin */
if ( !(sym_flags & HAS_FIXED_PTS) )
{ REAL dd,mindd;
int mini=0;
facetedge_id minfe=fe;
mindd = 1e40;
for ( i = 0 ; i < FACET_VERTS ; i++, fe = get_next_edge(fe) )
{ x = get_coord(get_fe_tailv(fe));
dd = SDIM_dot(x,x);
if ( dd < 0.9*mindd ) { mindd = dd; mini = i; minfe = fe;}
}
i = mini;
fe = minfe;
}
else { i = 0; }
wrap = 0;
for ( ii = 0 ; ii < FACET_VERTS ; ii++ )
{ int jj = (i+ii)%FACET_VERTS;
x = get_coord(get_fe_tailv(fe));
if ( wraps ) wraps[jj] = wrap;
(*sym_wrap)(x,verts[jj],wrap);
fewrap = get_fe_wrap(fe);
wrap = (*sym_compose)(wrap,fewrap);
fe = get_next_edge(fe);
}
}
else for ( i = 0 ; i < FACET_VERTS ; i++ )
{ x = get_coord(get_fe_tailv(fe));
for ( j = 0 ; j < SDIM ; j++ )
verts[i][j] = x[j];
fe = get_next_edge(fe);
}
} // end get_facet_verts_special()
/***************************************************************
*
* Function: get_facet_verts_q()
*
* Purpose: to get all vertices of a facet, nicely
* displaced to fundamental cell in case of symmetry group.
* Quadratic model. Midpoints interleaved with corners.
*
*/
void get_facet_verts_q(
facet_id f_id,
REAL **verts,
WRAPTYPE *wraps /* NULL if not wanted */
)
{
facetedge_id fe;
int i,j,ii;
WRAPTYPE wrap,fewrap;
REAL *x;
if ( web.representation == SIMPLEX )
{ kb_error(1370,"No quadratic model with simplices.\n",RECOVERABLE);
}
fe = get_facet_fe(f_id);
if ( web.symmetry_flag )
{
i = 0;
wrap = 0;
for ( ii = 0 ; ii < FACET_VERTS ; ii++ )
{ int jj = (i+ii)%FACET_VERTS;
x = get_coord(get_fe_tailv(fe));
if ( wraps ) wraps[2*jj] = wrap;
(*sym_wrap)(x,verts[2*jj],wrap);
x = get_coord(get_fe_midv(fe));
if ( !inverted(get_fe_edge(fe)) )
{ if ( wraps ) wraps[2*jj+1] = wrap;
(*sym_wrap)(x,verts[2*jj+1],wrap);
}
fewrap = get_fe_wrap(fe);
wrap = (*sym_compose)(wrap,fewrap);
if ( inverted(get_fe_edge(fe)) )
{ if ( wraps ) wraps[2*jj+1] = wrap;
(*sym_wrap)(x,verts[2*jj+1],wrap);
}
fe = get_next_edge(fe);
}
}
else for ( i = 0 ; i < FACET_VERTS ; i++ )
{ x = get_coord(get_fe_tailv(fe));
for ( j = 0 ; j < SDIM ; j++ )
verts[2*i][j] = x[j];
x = get_coord(get_fe_midv(fe));
for ( j = 0 ; j < SDIM ; j++ )
verts[2*i+1][j] = x[j];
fe = get_next_edge(fe);
}
} // end get_facet_verts_q()
/*****************************************************************
*
* Function: path_open()
*
* Purpose: Open file for reading on EVOLVERPATH
*/
FILE *path_open(
char *name,
int mode /* NOTDATAFILENAME or SETDATAFILENAME */
)
{
char path[PATHSIZE];
size_t len;
FILE *fd = NULL;
char *env;
#ifdef MPI_EVOLVER
/* use filename as format string to generate various file names */
char taskpath[PATHSIZE];
sprintf(taskpath,name,this_task);
name = taskpath;
#endif
env = getenv_EVOLVERPATH();
#if defined(WIN32) && !defined(__BORLANDC__)
/* Using wildcards! */
/* try given name */
strncpy(path,name,sizeof(path));
for(;;)
{ /* try paths in EVOLVERPATH */
intptr_t ret;
struct _finddata_t finddata;
ret = _findfirst(path,&finddata);
if ( ret != -1 )
{ /* finddata.name only has filename, not path stuff */
char *slash = strrchr(path,'/');
char *slashb = strrchr(path,'\\');
if ( slashb > slash )
slash = slashb;
if ( !slash && path[1] == ':' )
slash = path+1;
if ( slash ) slash++;
else slash = path;
strncpy(slash,finddata.name,sizeof(path)-(slash-path));
fd = fopen(path,"r");
_findclose(ret);
break;
}
if ( env == NULL ) break;
len = strcspn(env,ENVPATHCHAR);
if ( len == 0 ) break;
strncpy(path,env,len);
path[len] = PATHCHAR;
strncpy(path+len+1,name,sizeof(path)-len-2);
if ( env[len] == 0 ) env = NULL; /* end of EVOLVERPATH */
else env += len+1;
}
/* try .fe extension */
if ( fd == NULL)
{
env = getenv_EVOLVERPATH();
strncpy(path,name,sizeof(path));
strcat(path,".fe");
for ( ;; )
{
intptr_t ret;
struct _finddata_t finddata;
ret = _findfirst(path,&finddata);
if ( ret != -1 )
{ char *slash = strrchr(path,'/');
char *slashb = strrchr(path,'\\');
if ( slashb > slash )
slash = slashb;
if ( !slash && path[1] == ':' )
slash = path+1;
if ( slash ) slash++;
else slash = path;
strncpy(slash,finddata.name,sizeof(path)-(slash-path));
fd = fopen(path,"r");
_findclose(ret);
/* scrape the ".fe" off the end of the path since user didn't give it */
path[strlen(path)-3] = 0;
break;
}
/* try paths in EVOLVERPATH */
if ( env == NULL ) break;
len = strcspn(env,ENVPATHCHAR);
if ( len == 0 ) break;
strncpy(path,env,len);
path[len] = PATHCHAR;
strncpy(path+len+1,name,sizeof(path)-len-2);
strcat(path,".fe");
if ( env[len] == 0 ) env = NULL; /* end of EVOLVERPATH */
else env += len+1;
}
}
#elif defined(_GLOB_H)
/* Using wildcards! */
/* try given name */
strncpy(path,name,sizeof(path));
for(;;)
{ /* try paths in EVOLVERPATH */
int ret;
glob_t globdata;
memset(&globdata,0,sizeof(globdata));
ret = glob(path,0,NULL,&globdata);
if ( ret == 0 ) /* success */
{
strncpy(path,globdata.gl_pathv[0],sizeof(path));
fd = fopen(path,"r");
globfree(&globdata);
break;
}
if ( env == NULL ) break;
len = strcspn(env,ENVPATHCHAR);
if ( len == 0 ) break;
strncpy(path,env,len);
path[len] = PATHCHAR;
strncpy(path+len+1,name,sizeof(path)-len-2);
if ( env[len] == 0 ) env = NULL; /* end of EVOLVERPATH */
else env += len+1;
}
/* try .fe extension */
if ( fd == NULL)
{
env = getenv_EVOLVERPATH();
strncpy(path,name,sizeof(path));
strcat(path,".fe");
for ( ;; )
{ glob_t globdata;
int ret;
ret = glob(path,0,NULL,&globdata);
if ( ret == 0 ) /* success */
{
strncpy(path,globdata.gl_pathv[0],sizeof(path));
fd = fopen(path,"r");
globfree(&globdata);
/* scrape the ".fe" off the end of the path since user didn't give it */
path[strlen(path)-3] = 0;
break;
}
/* try paths in EVOLVERPATH */
if ( env == NULL ) break;
len = strcspn(env,ENVPATHCHAR);
if ( len == 0 ) break;
strncpy(path,env,len);
path[len] = PATHCHAR;
strncpy(path+len+1,name,sizeof(path)-len-2);
strcat(path,".fe");
if ( env[len] == 0 ) env = NULL; /* end of EVOLVERPATH */
else env += len+1;
}
}
#else
/* try given name */
strncpy(path,name,sizeof(path));
while ( (fd = fopen(path,"r")) == NULL)
{ /* try paths in EVOLVERPATH */
if ( env == NULL ) break;
len = strcspn(env,ENVPATHCHAR);
if ( len == 0 ) break;
strncpy(path,env,len);
path[len] = PATHCHAR;
strncpy(path+len+1,name,sizeof(path)-len-2);
if ( env[len] == 0 ) env = NULL; /* end of EVOLVERPATH */
else env += len+1;
}
/* try .fe extension */
if ( fd == NULL)
{
env = getenv_EVOLVERPATH();
strncpy(path,name,sizeof(path));
strcat(path,".fe");
while ( (fd = fopen(path,"r")) == NULL)
{ /* try paths in EVOLVERPATH */
if ( env == NULL ) break;
len = strcspn(env,ENVPATHCHAR);
if ( len == 0 ) break;
strncpy(path,env,len);
path[len] = PATHCHAR;
strncpy(path+len+1,name,sizeof(path)-len-2);
strcat(path,".fe");
if ( env[len] == 0 ) env = NULL; /* end of EVOLVERPATH */
else env += len+1;
}
}
#endif
if ( fd && (mode==SETDATAFILENAME) )
{ /* has to be set so repeat open works */
/* copy from end, getting same number of directories */
char *found; /* from findfile() */
char *user; /* user input search string */
found = path + strlen(path) - 1;
user = name + strlen(name) - 1;
while ( user >= name )
{ while ( (*user != PATHCHAR) && (*user != '\\') && (user >= name) )
user--;
while ( (*found != PATHCHAR) && (*found != '\\') && (found >= path) )
found--;
if ( user >= name ) user--; else break;
if ( found >= path ) found--; else break;
}
strncpy(datafilename,found+1,PATHSIZE);
}
if ( fd )
setvbuf(fd,NULL,_IOFBF,BUFSIZ*100);
return fd;
} // end path_open()
/**************************************************************************
*
* function: calc_view_transform_gens()
*
* purpose: evaluate expressions in view_transform_gens
*
* return: 1 if anything changed; 0 else.
*/
int calc_view_transform_gens()
{ int n,i,j,nmax;
REAL value;
int change = 0;
nmax = web.torus_flag ? transform_gen_count - SDIM : transform_gen_count;
for ( n = 0 ; n < nmax ; n++ )
for ( i = 0 ; i <= SDIM ; i++ )
for ( j = 0 ; j <= SDIM ; j++ )
{ value = eval(&view_transform_gens_expr[n][i][j],NULL,NULLID,NULL);
if ( value != view_transform_gens[n][i][j] )
{ view_transform_gens[n][i][j] = value;
change = 1;
}
}
set_view_transform_generators_global();
return change;
} // end calc_view_transform_gens()
/*******************************************************************
*
* function: calc_periods()
*
* purpose: calculate torus periods from expressions
*/
void calc_periods(int mode /* NO_ADJUST_VOLUMES or ADJUST_VOLUMES */)
{ int i,j;
REAL value;
REAL old_torusv = web.torusv;
MAT2D(invper,MAXCOORD,MAXCOORD); /* so don't have temporary bad values
in web.inverse_periods since graphgen() may be using it */
int k;
if ( torus_period_expr[0][0].start )
{ for ( i = 0 ; i < SDIM ; i++ )
{ for ( j = 0 ; j < SDIM ; j++ )
{ value = eval(&torus_period_expr[i][j],NULL,NULLID,NULL);
invper[j][i] = web.torus_period[i][j] = value;
}
}
web.torusv = det_adjoint(invper,SDIM);
if ( web.torusv == 0.0 )
kb_error(1377,"Degenerate torus unit cell.\n",RECOVERABLE);
for ( i = 0 ; i < SDIM ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
{ web.inverse_periods[i][j] = invper[i][j]/web.torusv;
web.inverse_periods_tr[j][i] = invper[i][j]/web.torusv;
}
}
if ( web.torus_display_period )
{ REAL det;
for ( i = 0 ; i < SDIM ; i++ )
{ for ( j = 0 ; j < SDIM ; j++ )
{ value = eval(&torus_display_period_expr[i][j],NULL,NULLID,NULL);
invper[j][i] = web.torus_display_period[i][j] = value;
}
}
det = det_adjoint(invper,SDIM);
if ( det == 0.0 )
kb_error(3377,"Degenerate display periods.\n",RECOVERABLE);
for ( i = 0 ; i < SDIM ; i++ )
for ( j = 0 ; j < SDIM ; j++ )
{ web.inverse_display_periods[i][j] = invper[i][j]/det;
}
}
/* if change in periods, adjust volumes and volconsts */
if ( (mode == ADJUST_VOLUMES) && (old_torusv != 0.0) && !web.pressure_flag)
{ body_id b_id;
value = web.torusv/old_torusv;
FOR_ALL_BODIES(b_id)
{ set_body_volume(b_id,value*(get_body_volume(b_id)),SETSTAMP);
save_body_volume(b_id);
if ( get_battr(b_id) & FIXEDVOL )
set_body_fixvol(b_id,value*(get_body_fixvol(b_id)));
set_body_volconst(b_id,value*(get_body_volconst(b_id)));
if ( everything_quantities_flag )
{ struct gen_quant *q = GEN_QUANT(get_body_volquant(b_id));
q->value *= value;
q->target *= value;
q->volconst *= value;
}
}
}
/* adjust view transform generators for automatic torus symmetries */
if ( web.torus_flag )
{
if ( view_transform_gens == NULL )
{ view_transform_gens = dmatrix3(SDIM,SDIM+1,SDIM+1);
transform_gen_count = SDIM;
}
if ( transform_gen_swap == NULL )
transform_gen_swap = (int*)mycalloc(SDIM,sizeof(int));
for ( j=transform_gen_count-SDIM, k=0 ; j<transform_gen_count ; k++,j++ )
{ matcopy(view_transform_gens[j],identmat,SDIM+1, SDIM+1);
for ( i = 0 ; i < SDIM ; i++ )
view_transform_gens[j][i][SDIM] = web.torus_period[k][i];
}
if (transform_expr && *transform_expr)
/* re-evaluate expressions */
if ( calc_view_transform_gens() ) /* see if changed */
transform_gen_expr(transform_expr);
}
} // end calc_periods()
/***************************************************
*
* Handy for graphics function pointers for
* functions that have nothing to do.
*/
void null_function() {}
/************************************************************
*
* For uninitialized function pointers.
*
*/
void bad_function()
{ kb_error(1371,"Internal error: Using uninitialized function pointer.\n",
WARNING);
}
/*****************************************************************
*
* Function: distance()
*
* Purpose: Finds distance between two vertices.
*/
REAL distance(
vertex_id v1,
vertex_id v2
)
{
REAL *c1,*c2;
REAL sum;
int i;
c1 = get_coord(v1);
c2 = get_coord(v2);
sum = 0.0;
for ( i = 0 ; i < SDIM ; i++ )
sum += (c1[i] - c2[i])*(c1[i] - c2[i]);
return sqrt(sum);
} // end distance()
/***************************************************************************
*
* function: grule()
*
* purpose: Calculate abscissas and weights for gaussian quadrature
* on [0,1].
*
* Adapted from a FORTRAN routine GRULE in a book on numerical integration
*/
void grule(
int n, /* number of points */
REAL *x, /* for abscissas x[0] ... x[n-1] */
REAL *w /* for weights w[0] ... w[n-1] */
)
{
REAL pkm1,pk,t,t1,pkp1,den,d1,dpn,d2pn,d3pn,d4pn,u,v,h,p,dp,fx,x0;
int m,e1,i,k;
if ( n < -1 )
{ /* rectangle rule */
for ( k = 0 ; k < abs(n) ; k++ )
{ x[k] = k/(REAL)(abs(n)-1);
w[k] = 1/(REAL)abs(n);
}
}
m = (n+1)/2;
e1 = n*(n+1);
for ( i = 1 ; i <= m ; i++ )
{
/* original calculation on [-1,1] */
t = (4*i - 1)*M_PI/(4*n+2);
x0 = (1 - (1 - 1.0/n)/(8*n*n))*cos(t);
pkm1 = 1.0;
pk = x0;
for ( k = 2 ; k <= n ; k++ )
{
t1 = x0*pk;
pkp1 = t1 - pkm1 - (t1 - pkm1)/k + t1;
pkm1 = pk;
pk = pkp1;
}
den = 1 - x0*x0;
d1 = n*(pkm1 - x0*pk);
dpn = d1/den;
d2pn = (2*x0*dpn - e1*pk)/den;
d3pn = (4*x0*d2pn + (2 - e1)*dpn)/den;
d4pn = (6*x0*d3pn + (6 - e1)*d2pn)/den;
u = pk/dpn;
v = d2pn/dpn;
h = -u*(1 + 0.5*u*(v + u*(v*v - d3pn/3/dpn)));
p = pk + h*(dpn + 0.5*h*(d2pn + h/3*(d3pn + 0.25*h*d4pn)));
dp = dpn + h*(d2pn + .5*h*(d3pn + h*d4pn/3));
h = h - p/dp;
x[i-1] = x0 + h;
fx = d1 - h*e1*((((0.2*h*d4pn + d3pn)*0.25*h + d2pn)*h/3 + dpn)*0.5*h + pk);
w[n-i] = w[i-1] = (1 - x[i-1]*x[i-1])/fx/fx;
/* normalization to [0,1] */
x[i-1] = (1 + x[i-1])/2;
x[n-i] = 1 - x[i-1];
}
if ( 2*m > n ) x[m-1] = 0.5;
} // end grule()
/****************************************************************
*
* function: binom_coeff()
*
* purpose: calculate binomial coefficient (small numbers only)
*
*/
int binom_coeff(int n, int k)
{ int i, c;
if ( n < k ) return 0;
if ( (n-k) < k ) k = n - k;
for ( i = 0, c = 1 ; i < k ; i++ )
{ c *= n - i; c /= i+1; }
return c;
} // end binom_coeff()
/**********************************************************************
*
* function: set_e_phase_density()
*
* purpose: calculate edge density from phases of neighboring facets.
*/
void set_e_phase_density(edge_id e_id)
{ facetedge_id fe = get_edge_fe(e_id);
int i = get_f_phase(get_fe_facet(fe));
int j = get_f_phase(get_fe_facet(get_next_facet(fe)));
set_edge_density(e_id,phase_data[i][j]);
} // end set_e_phase_density()
/**********************************************************************
*
* function: set_f_phase_density()
*
* purpose: calculate facet density from phases of neighboring bodies.
*/
void set_f_phase_density(facet_id f_id)
{
int i = get_b_phase(get_facet_body(f_id));
int j = get_b_phase(get_facet_body(inverse_id(f_id)));
set_attr(f_id,DENSITY);
set_facet_density(f_id,phase_data[i][j]);
} // end set_f_phase_density()
/**********************************************************************
*
* function: make_vedge_lists()
*
* purpose: construct from scratch edge lists aound vertices.
* These are singly linked circular lists with links residing
* in edge structures.
*/
void make_vedge_lists()
{ vertex_id v_id;
edge_id e_id;
if ( web.representation == SIMPLEX ) return;
/* clear out all old data */
MFOR_ALL_EDGES(e_id)
{ set_next_tail_edge(e_id,NULLID);
set_next_tail_edge(inverse_id(e_id),NULLID);
}
MFOR_ALL_VERTICES(v_id)
{ if ( !(get_vattr(v_id) & (Q_MIDEDGE|Q_MIDFACET|Q_MIDPOINT)) )
set_vertex_edge(v_id,NULLID);
}
/* now splice in all edges */
MFOR_ALL_EDGES(e_id)
{ insert_vertex_edge(get_edge_tailv(e_id),e_id);
insert_vertex_edge(get_edge_headv(e_id),inverse_id(e_id));
}
vedge_timestamp = top_timestamp;
} // end make_vedge_lists()
/**********************************************************************
*
* function: make_vfacet_lists()
*
* purpose: construct from scratch facet lists aound vertices.
* These are singly linked circular lists with links residing
* in facet structures.
*
* Should only be used currently with SIMPLEX model, since others
* use edge links around vertex.
*/
void make_vfacet_lists()
{ vertex_id v_id;
facet_id f_id, ff_id,fff_id;
int i;
int facet_verts;
/* set all facet vertices */
facet_verts = web.skel[FACET].ctrlpts;
expand_attribute(FACET,F_NEXT_VFACET_ATTR,&facet_verts);
if ( web.representation == SOAPFILM ) /* set up facet vertex lists */
{ if ( web.modeltype != LAGRANGE )
{ FOR_ALL_FACETS(f_id)
{ facetedge_id fe = get_facet_fe(f_id);
vertex_id *fv = get_facet_vertices(f_id);
for ( i = 0 ; i < FACET_VERTS ; i++ )
{
v_id = get_fe_tailv(fe);
fv[i] = v_id;
fe = get_next_edge(fe);
if ( web.modeltype == QUADRATIC )
fv[i+FACET_VERTS] = get_edge_midv(get_fe_edge(fe));
}
}
}
}
else if ( web.representation == STRING )
{ edge_id e_id;
FOR_ALL_EDGES(e_id)
{ facetedge_id fe = get_edge_fe(e_id);
if ( !valid_id(fe) )
continue;
f_id = get_fe_facet(fe);
if ( !valid_id(f_id) )
continue;
set_vertex_facet(get_edge_tailv(e_id),f_id);
set_vertex_facet(get_edge_headv(e_id),f_id);
}
}
else if ( web.representation == SIMPLEX )
{ FOR_ALL_FACETS(f_id) /* simplex vertex to facet links */
{ vertex_id *fv = get_facet_vertices(f_id);
for ( i = 0 ; i < facet_verts ; i++ )
{
set_vertex_facet(fv[i],f_id);
}
}
}
/* start by making one-element loops on facets */
FOR_ALL_VERTICES(v_id)
{
f_id = get_vertex_facet(v_id);
if ( valid_id(f_id) )
{ set_next_vertex_facet(v_id,f_id,f_id);
set_vertex_facet(v_id,f_id);
}
}
if ( web.representation == STRING )
{
/* not using explicit linked list;
since get_next_vertex_facet() uses
edge list around vertex and facet
list around edge.
*/
}
else
FOR_ALL_FACETS(f_id)
{
vertex_id *fv = get_facet_vertices(f_id);
for ( i = 0 ; i < facet_verts ; i++ )
{ v_id = fv[i];
ff_id = get_vertex_facet(v_id);
if ( !equal_id(f_id,ff_id) )
{ /* splice in after first one */
fff_id = get_next_vertex_facet(v_id,ff_id);
if ( !equal_element(f_id,fff_id) )
{ set_next_vertex_facet(v_id,ff_id,f_id);
set_next_vertex_facet(v_id,f_id,fff_id);
}
}
}
}
vfacet_timestamp = top_timestamp;
} // end make_vfacet_lists()
/**********************************************************************
*
* function: make_bfacet_lists()
*
* purpose: construct from scratch facet lists aound bodies.
* These are doubly linked circular lists with links residing
* in facet structures.
*/
void make_bfacet_lists()
{ body_id b_id;
facet_id f_id, ff_id,fff_id,fi_id;
int four = 4;
if ( bfacet_timestamp >= top_timestamp ) return;
if ( web.skel[BODY].count == 0 ) return;
expand_attribute(FACET,F_NEXT_BFACET_ATTR,&four);
/* start by making one-element loops on facets pointed to
by body facet_edge link */
FOR_ALL_BODIES(b_id)
{ /* make sure legal pointer */
f_id = get_body_facet(b_id);
if ( !valid_id(f_id) ||
#ifdef MPI_EVOLVER
!mpi_remote_present(f_id) ||
#endif
!equal_id(b_id,get_facet_body(f_id)) )
{ set_body_facet(b_id,NULLID);
FOR_ALL_FACETS(f_id)
{ if ( equal_id(b_id,get_facet_body(f_id)) )
{set_body_facet(b_id,f_id); break; }
if ( equal_id(b_id,get_facet_body(inverse_id(f_id))) )
{set_body_facet(b_id,inverse_id(f_id)); break; }
}
}
f_id = get_body_facet(b_id);
if ( valid_id(f_id) )
{
set_next_body_facet(f_id,f_id);
set_prev_body_facet(f_id,f_id);
}
}
/* now splice in all other facets */
FOR_ALL_FACETS(f_id)
{ b_id = get_facet_body(f_id);
if ( valid_id(b_id) )
{ ff_id = get_body_facet(b_id);
if ( !equal_id(f_id,ff_id) )
{ /* splice in after first one */
fff_id = get_next_body_facet(ff_id);
set_next_body_facet(ff_id,f_id);
set_prev_body_facet(f_id,ff_id);
set_next_body_facet(f_id,fff_id);
set_prev_body_facet(fff_id,f_id);
}
}
fi_id = inverse_id(f_id);
b_id = get_facet_body(fi_id);
if ( valid_id(b_id) )
{ ff_id = get_body_facet(b_id);
if ( !equal_id(fi_id,ff_id) )
{ /* splice in after first one */
fff_id = get_next_body_facet(ff_id);
set_next_body_facet(ff_id,fi_id);
set_prev_body_facet(fi_id,ff_id);
set_next_body_facet(fi_id,fff_id);
set_prev_body_facet(fff_id,fi_id);
}
}
}
bfacet_timestamp = top_timestamp;
} // end make_bfacet_lists()
/*******************************************************************
*
* function: insert_vertex_edge(v_id,e_id)
*
* purpose: fix up edge links around vertex when edge added
*
*/
void insert_vertex_edge(
vertex_id v_id,
edge_id e_id
)
{ edge_id ee_id,eee_id;
int n;
#ifdef MPI_EVOLVER
if ( !elptr(v_id) || !elptr(e_id) )
return;
#endif
if ( !equal_id(v_id,get_edge_tailv(e_id)) )
{ kb_error(1372,"Internal error: Trying to insert edge to wrong vertex.\n",
WARNING);
return;
}
ee_id = get_vertex_edge(v_id);
if ( !valid_id(ee_id) )
{ set_next_tail_edge(e_id,e_id);
set_vertex_edge(v_id,e_id);
return;
}
/* go around to be sure not already there */
eee_id = ee_id; n = 0;
do
{ eee_id = get_next_tail_edge(eee_id);
if ( equal_id(eee_id,e_id) ) return;
if ( ++n > 2*web.skel[EDGE].count+5 ) /* sanity check */
{ sprintf(errmsg,"Internal error: Vertex %s edge loop not closed.\n",
ELNAME(v_id));
kb_error(1373,errmsg,WARNING);
return;
}
} while ( !equal_id(eee_id,ee_id) );
/* insert into existing list */
ee_id = get_next_tail_edge(eee_id);
set_next_tail_edge(eee_id,e_id);
set_next_tail_edge(e_id,ee_id);
} /* end insert_vertex_edge */
/*******************************************************************
*
* function: remove_vertex_edge(v_id,e_id)
*
* purpose: fix up edge links around vertex when edge removed
*
*/
void remove_vertex_edge(
vertex_id v_id,
edge_id e_id /* tail is v_id */
)
{ edge_id ee_id,eee_id,eeee_id;
vertex_id vv_id = get_edge_tailv(e_id);
int n = 0;
#ifdef MPI_EVOLVER
if ( !mpi_remote_present(v_id) )
return;
#endif
if ( !equal_id(v_id,vv_id) )
{ sprintf(errmsg,
"Internal error: Trying to detach edge %s from vertex %s instead of %s.\n",
ELNAME(e_id),ELNAME1(v_id),ELNAME2(vv_id));
kb_error(1374,errmsg, WARNING);
return;
}
/* make sure edge actually in vertex edge loop */
ee_id = get_vertex_edge(v_id);
if ( !valid_id(ee_id)) return;
eee_id = ee_id;
do
{
#ifdef MPI_EVOLVER
if ( !mpi_remote_present(eee_id) )
return; /* fail, but don't crash */
#endif
if ( equal_id(eee_id,e_id) ) break;
eee_id = get_next_tail_edge(eee_id);
if ( ++n > 2*web.skel[EDGE].count ) /* sanity check */
{
sprintf(errmsg,"Internal error: Vertex %s edge loop not closed.\n",ELNAME(v_id));
kb_error(1375,errmsg,WARNING);
break;
}
} while ( !equal_id(eee_id,ee_id) );
if ( !equal_id(eee_id,e_id) ) return;
ee_id = get_next_tail_edge(e_id);
if ( equal_id(e_id,ee_id) )
{ set_vertex_edge(v_id,NULLID);
return;
}
#ifdef MPI_EVOLVER
if ( !mpi_remote_present(ee_id) )
return;
#endif
eee_id = ee_id;
eeee_id = get_next_tail_edge(ee_id);
#ifdef MPI_EVOLVER
if ( !mpi_remote_present(eeee_id) )
return;
#endif
n = 0;
while ( !equal_id(e_id,eeee_id) )
{ eee_id = eeee_id;
eeee_id = get_next_tail_edge(eee_id);
#ifdef MPI_EVOLVER
if ( !mpi_remote_present(eeee_id) )
return;
#endif
if ( ++n > 2*web.skel[EDGE].count ) /* sanity check */
{ sprintf(errmsg, "Internal error: Vertex %s edge loop not closed.\n",
ELNAME(v_id));
kb_error(1376,errmsg, WARNING);
break;
}
}
set_next_tail_edge(eee_id,ee_id);
set_next_tail_edge(e_id,e_id);
set_vertex_edge(v_id,ee_id);
/* clean up in case of constraint content quantities */
if ( everything_quantities_flag && (web.representation == STRING) )
{ int k,n;
conmap_t *map = get_v_constraint_map(v_id);
#define MAXTODO 10
conmap_t to_do[MAXTODO];
/* make list since unset and set can change order in map */
for ( k = 1, n = 0; k <= (int)*map ; k++ )
{ int connum = map[k]&CONMASK;
struct constraint *con = get_constraint(connum);
if ( (con->attr & CON_CONTENT) && (n < MAXTODO) )
to_do[n++] = connum;
}
for ( k = 0 ; k < n ; k++ )
{ unset_v_constraint_map(v_id,to_do[k]);
set_v_constraint_map(v_id,to_do[k]);
}
}
} /* end remove_vertex_edge() */
/*******************************************************************
*
* function: get_vertex_first_facet()
*
* purpose: find some facet adjoining vertex, first facet in
* implicit list found by following vertex edge list
* around and then facets around edge.
*
* Returns facetedge_id if possible, otherwise facet_id
*/
element_id get_vertex_first_facet(vertex_id v_id)
{
/* special cases */
if ( web.representation == SIMPLEX )
{ if ( vfacet_timestamp < top_timestamp )
make_vfacet_lists();
return get_vertex_facet(v_id);
}
if ( get_vattr(v_id) & Q_MIDFACET )
return get_vertex_facet(v_id);
return get_next_vertex_facet(v_id,NULLID);
} /* end get_vertex_first_facet() */
/************************************************************************
*
* Function: get_next_vertex_facet()
*
* Purpose: get next facet in implicit chain around vertex.
*
* Returns facetedge_id if possible, otherwise facet_id
*/
element_id get_next_vertex_facet(
vertex_id v_id,
element_id prev_id /* either facet_id or facetedge_id;
if null, gets first one */
)
{
edge_id start_e,ee_id;
facetedge_id fe_id,start_fe, first_fe = NULLID;
facet_id next_f;
int found; /* whether old f_id found yet */
if ( web.representation == SIMPLEX )
{
return get_simplex_next_vertex_facet(v_id,prev_id);
}
if ( id_type(prev_id) == FACET )
return NULLID; /* interior Lagrange point */
/* now trace loop of edges and facetedges */
start_e = get_vertex_edge(v_id);
if ( !valid_id(start_e) ) return NULLID;
ee_id = start_e;
found = !valid_id(prev_id);
do
{ fe_id = start_fe = get_edge_fe(ee_id);
if ( valid_id(fe_id) )
do
{
facetedge_id ret_fe = fe_id; /* return value */
next_f = get_fe_facet(fe_id);
if ( web.representation == STRING )
{ if ( !valid_id(next_f) )
return NULLID;
if ( !valid_id(get_prev_edge(fe_id)) && inverted(next_f) )
{ /* in case facet doesn't have positive facet */
next_f = positive_id(next_f);
ret_fe = inverse_id(fe_id);
}
}
if ( !inverted(next_f) )
{ if ( !valid_id(first_fe) )
first_fe = ret_fe;
if ( found )
return ret_fe;
if ( equal_element(fe_id,prev_id) )
found = 1;
}
fe_id = get_next_facet(fe_id);
} while ( !equal_id(start_fe,fe_id) );
ee_id = get_next_tail_edge(ee_id);
} while ( !equal_id(ee_id,start_e) );
if ( found )
return first_fe; /* looped all the way around */
return NULLID;
} // end get_next_vertex_facet()
/***********************************************************************
vertex facet list stuff for simplex model
*/
/*******************************************************************
*
* function: insert_vertex_facet(v_id,f_id)
*
* purpose: fix up facet links around vertex when facet added
*
*/
void insert_vertex_facet(
vertex_id v_id,
facet_id f_id
)
{ facet_id ff_id,fff_id;
int n;
ff_id = get_vertex_facet(v_id);
if ( !valid_id(ff_id) )
{ set_next_vertex_facet(v_id,f_id,f_id);
set_vertex_facet(v_id,f_id);
set_vertex_facet(v_id,f_id);
return;
}
/* go around to be sure not already there */
fff_id = ff_id; n = 0;
do
{ fff_id = get_next_vertex_facet(v_id,fff_id);
if ( equal_element(fff_id,f_id) ) return;
if ( ++n > 2*web.skel[FACET].count+5 ) /* sanity check */
{ kb_error(2441,"Internal error: Vertex facet loop not closed.\n",WARNING);
return;
}
} while ( !equal_id(fff_id,ff_id) );
/* insert into existing list */
ff_id = get_next_vertex_facet(v_id,fff_id);
set_next_vertex_facet(v_id,fff_id,f_id);
set_next_vertex_facet(v_id,f_id,ff_id);
} // end insert_vertex_facet()
/*******************************************************************
*
* function: remove_vertex_facet(v_id,f_id)
*
* purpose: fix up facet links around vertex when facet removed
*/
void remove_vertex_facet(
vertex_id v_id,
facet_id f_id
)
{ facet_id ff_id,fff_id,ffff_id;
int n = 0;
/* find it */
ff_id = get_vertex_facet(v_id);
if ( !valid_id(ff_id)) return;
fff_id = ff_id;
do
{ if ( equal_element(fff_id,f_id) ) break;
fff_id = get_next_vertex_facet(v_id,fff_id);
if ( ++n > 2*web.skel[FACET].count ) /* sanity check */
{ kb_error(2442,"Internal error: Vertex facet loop not closed.\n",WARNING);
break;
}
} while ( !equal_element(fff_id,ff_id) );
if ( !equal_id(fff_id,f_id) ) return;
ff_id = get_next_vertex_facet(v_id,f_id);
if ( equal_element(f_id,ff_id) )
{ set_vertex_facet(v_id,NULLID);
return;
}
fff_id = ff_id;
ffff_id = get_next_vertex_facet(v_id,ff_id);
n = 0;
while ( !equal_element(f_id,ffff_id) )
{ fff_id = ffff_id;
ffff_id = get_next_vertex_facet(v_id,fff_id);
if ( ++n > 2*web.skel[FACET].count ) /* sanity check */
{ kb_error(2443,"Internal error: Vertex facet loop not closed.\n",WARNING);
break;
}
}
set_next_vertex_facet(v_id,fff_id,ff_id);
set_next_vertex_facet(v_id,f_id,f_id);
set_vertex_facet(v_id,ff_id);
if ( web.representation==SIMPLEX )
set_vertex_facet(v_id,ff_id);
} // end remove_vertex_facet()
/*******************************************************************
*
* function: get_simplex_next_vertex_facet()
*
* purpose: get next facet around a vertex, simplex model
*/
facet_id get_simplex_next_vertex_facet(
vertex_id v_id,
facet_id f_id
)
{ int i;
vertex_id *v = get_facet_vertices(f_id);
facet_id *f = F_ELID(f_id,F_NEXT_VFACET_ATTR);
int vmax = web.skel[FACET].ctrlpts;
for ( i = 0 ; i < vmax ; i++ )
if (equal_id(v_id,v[i])) return f[i] ;
sprintf(errmsg,"Internal error: get_next_vertex_facet failure v %s f %s\n",
ELNAME(v_id), ELNAME1(f_id));
kb_error(1306,errmsg,RECOVERABLE);
return NULLID;
} // end get_simplex_next_vertex_facet()
/*******************************************************************
*
* function: set_simplex_next_vertex_facet()
*
* purpose: set next facet around a vertex, simplex model
*/
void set_next_vertex_facet(v_id,f_id,ff_id)
vertex_id v_id; facet_id f_id,ff_id;
{
vertex_id *v = get_facet_vertices(f_id);
facet_id *f = F_ELID(f_id,F_NEXT_VFACET_ATTR);
int vmax = web.skel[FACET].ctrlpts;
int i;
for ( i = 0 ; i < vmax ; i++ )
{ if (equal_id(v_id,v[i]))
{ f[i] = ff_id ;
break;
}
}
} // end set_next_vertex_facet()
/* end vertex facet list stuff for simplex model
***********************************************************************/
/************************************************************************
*
* function: count_fixed_vol()
*
* purpose: return number of fixed volumes and quantities
*
*/
int count_fixed_vol()
{ int retval = 0;
body_id bi_id; /* identifier for body i */
int n;
struct gen_quant *gq;
if ( !everything_quantities_flag && !web.pressure_flag )
{ FOR_ALL_BODIES(bi_id)
if ( get_battr(bi_id) & (FIXEDVOL) ) retval++;
}
for ( n = 0 ; n < gen_quant_count ; n++ )
{ gq = GEN_QUANT(n);
if ( gq->flags & Q_DELETED ) continue;
if ( gq->flags & (Q_FIXED|Q_CONSERVED) )
retval++;
}
return retval;
} // end count_fixed_vol()
/*****************************************************************
*
* Random number generator using the Mersenne Twister.
*
* A C-program for MT19937B: Integer Version
* genrand() generate one pseudorandom integer which is
* uniformly distributed among the 32bit unsigned integers
* sgenrand(seed) set initial values to the working area of 624 words.
* sgenrand(seed) must be called once before calling genrand()
* (seed is any integer except 0).
* Modified to produce batch of drands by K. Brakke
* Reference:
Makoto Matsumoto and Takuji Nishimura,
Mersenne Twister: A 623-Dimensionally Equidistributed Uniform
Pseudo-Random Number Generator, ACM Transactions on Modeling and
Computer Simulation, Vol. 8, No. 1, January 1998, pp. 3-30.
In ACM on-line Library,
http://www.acm.org/pubs/citations/journals/tomacs/1998-8-1/p3-matsumoto/
*/
/*
LICENCE CONDITIONS:
Matsumoto and Nishimura consent to GNU General
Public Licence for this code.
*/
/* Period parameters */
#define N 624
#define NR 312
#define M 397
#define MATRIX_A 0x9908b0df /* constant vector a */
#define UPPER_MASK 0x80000000 /* most significant w-r bits */
#define LOWER_MASK 0x7fffffff /* least significant r bits */
/* for tempering */
#define TEMPERING_MASK_B 0x9d2c5680
#define TEMPERING_MASK_C 0xefc60000
#define TEMPERING_SHIFT_U(y) (y >> 11)
#define TEMPERING_SHIFT_S(y) (y << 7)
#define TEMPERING_SHIFT_T(y) (y << 15)
#define TEMPERING_SHIFT_L(y) (y >> 18)
static unsigned long ptgfsr[N]; /* set initial seeds: N = 624 words */
static REAL drands[NR]; /* batch of random doubles */
static int initflag;
static REAL rfactor = 0.0;
static int k = N;
static int kr = NR;
void sgenrand(unsigned long);
/**********************************************************************
* function: sgenrand()
* purpose: seed random number generator state vector
*/
void sgenrand(unsigned long seed /* seed should not be 0 */)
{
int k;
/* setting initial seeds to ptgfsr[N] using */
/* the generator Line 25 of Table 1 in */
/* [KNUTH 1981, The Art of Computer Programming */
/* Vol. 2 (2nd Ed.), pp102] */
ptgfsr[0]= seed & 0xffffffff;
for (k=1; k<N; k++)
ptgfsr[k] = (69069 * ptgfsr[k-1]) & 0xffffffff;
} // end sgenrand()
/**********************************************************************
* function: kb_initr()
* purpose: initialize random number generator
*/
void kb_initr(int ind)
{ sgenrand((unsigned long)ind);
rfactor = 1.0/( (REAL)0xffffffff + 1.0) ;
initflag = 1;
k = N; kr = NR;
}
static unsigned long mag01[2]={0x0, MATRIX_A};
/***********************************************************************
* function: kb_drand()
* purpose: main random number function, returns value between 0 and 1.
*/
REAL kb_drand()
{
unsigned long y;
/* mag01[x] = x * MATRIX_A for x=0,1 */
if(kr == NR){ /* generate N words at one time, and NR drands */
int kk;
if ( initflag == 0 ) kb_initr(1);
for (kk=0;kk<N-M;kk++) {
y = (ptgfsr[kk]&UPPER_MASK)|(ptgfsr[kk+1]&LOWER_MASK);
ptgfsr[kk] = ptgfsr[kk+M] ^ (y >> 1) ^ mag01[y & 0x1];
}
for (;kk<N-1;kk++) {
y = (ptgfsr[kk]&UPPER_MASK)|(ptgfsr[kk+1]&LOWER_MASK);
ptgfsr[kk] = ptgfsr[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1];
}
y = (ptgfsr[N-1]&UPPER_MASK)|(ptgfsr[0]&LOWER_MASK);
ptgfsr[N-1] = ptgfsr[M-1] ^ (y >> 1) ^ mag01[y & 0x1];
for ( k = 0 ; k < N ; k++ )
{ y = ptgfsr[k];
y ^= TEMPERING_SHIFT_U(y);
y ^= TEMPERING_SHIFT_S(y) & TEMPERING_MASK_B;
y ^= TEMPERING_SHIFT_T(y) & TEMPERING_MASK_C;
y &= 0xffffffff; /* you may delete this line if word size = 32 */
y ^= TEMPERING_SHIFT_L(y);
ptgfsr[k] = y;
}
for ( kr = 0 ; kr < NR ; kr++ )
drands[kr] = (ptgfsr[2*kr]*rfactor + ptgfsr[2*kr+1])*rfactor;
k = 0;
kr = 0;
}
return drands[kr++];
} // end kb_drand()
#ifdef MSC
/* for METIS and other third parties */
double drand48()
{ return (double)kb_drand(); }
void srand48(int seed)
{ kb_initr(seed); }
#endif
/***********************************************************************
*
* function: wrap_vertex()
*
* purpose: Adjust vertex position by given wrap.
* Volconst adjustments taken care of in volume calculation.
*/
void wrap_vertex(
vertex_id v_id,
int wrap)
{ int i;
REAL newx[MAXCOORD];
REAL *x = get_coord(v_id);
edge_id e_id,start_e;
if ( (web.modeltype != LINEAR) && (web.modeltype != QUADRATIC) )
kb_error(6016,
"Can only do vertex wrap in LINEAR and QUADRATIC models so far.\n",
RECOVERABLE);
if ( !web.symmetry_flag ) return;
if ( get_vattr(v_id) & (Q_MIDPOINT|Q_MIDEDGE|Q_MIDFACET) ) return;
ENTER_GRAPH_MUTEX;
sym_wrap(x,newx,wrap);
for ( i = 0 ; i < SDIM ; i++ ) x[i] = newx[i];
start_e = e_id = get_vertex_edge(v_id);
do
{ set_edge_wrap(e_id,sym_compose(wrap,get_edge_wrap(e_id)));
if ( (web.modeltype == QUADRATIC) && !inverted(e_id) )
{ x = get_coord(get_edge_midv(e_id));
sym_wrap(x,newx,wrap);
for ( i = 0 ; i < SDIM ; i++ ) x[i] = newx[i];
}
e_id = get_next_tail_edge(e_id);
} while ( !equal_id(start_e,e_id) );
LEAVE_GRAPH_MUTEX;
} // end void wrap_vertex()
|