/usr/include/freefem++/AFunction.hpp is in libfreefem++-dev 3.47+dfsg1-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /// \file
// -*- Mode : c++ -*-
//
// SUMMARY :
// USAGE :
// ORG :
// AUTHOR : Frederic Hecht
// E-MAIL : hecht@ann.jussieu.fr
//
/*
This file is part of Freefem++
Freefem++ is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
Freefem++ is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with Freefem++; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
//file afonction.h
#ifndef __AFONCTION__
#define __AFONCTION__
#include "showverb.hpp"
#include "InitFunct.hpp"
#include <typeinfo>
#include <cstddef>
#include <iostream>
#include <fstream>
#include <cstring>
#include "error.hpp"
#include <map>
#include <deque>
#include <list>
#include <vector>
#include <queue>
#include <complex>
#include <string>
#include <cstdlib>
#include <algorithm>
extern bool showCPU;
#include "RNM.hpp"
#ifdef TIME_WITH_SYS_TIME
# include <sys/time.h>
# include <time.h>
#else
# ifdef HAVE_SYS_TIME_H
# include <sys/time.h>
# else
# include <time.h>
# endif
#endif
// #include <time.h>
#include "CodeAlloc.hpp"
inline double CPUtime(){
#ifdef SYSTIMES
struct tms buf;
if (times(&buf)!=-1)
return ((double)buf.tms_utime+(double)buf.tms_stime)/(long) sysconf(_SC_CLK_TCK);
else
#endif
return ((double) clock())/CLOCKS_PER_SEC;
}
extern long verbosity; // level off printing
extern long searchMethod; //pichon
extern bool withrgraphique;
using namespace std;
#include "ffstack.hpp"
#include "AnyType.hpp"
#include "String.hpp"
class basicForEachType;
class E_F1_funcT_Type;
class E_F0; // une instruction exec time
class C_F0; // une instruction complie time
class ListOfInst;
class Polymorphic;
class OneOperator;
/// <<Expression>> is used as the type of the local list contained in ListOfInst
typedef E_F0 * Expression;
class AC_F0;
class basicAC_F0;
typedef complex<double> Complex;
/// <<Type_Expr>> [[file:AnyType.hpp::aType]] [[E_F0]]
typedef pair<aType, E_F0 *> Type_Expr ;// to store the type and the expression 29042005 FH
int FindType(const char * name) ;
void lgerror (const char* s) ;
void CompileError(string msg="",aType r=0);
void ExecError(string msg="");
struct UnId {
const char * id;
aType r;
Expression e;
deque<UnId> * array; // to store a array
aType re;
bool ref; // a ref or non
UnId() :id(0),r(0),e(0),array(0),re(0),ref(false) {}
UnId(const char * idd) :id(idd),r(0),e(0),array(0),re(0),ref(false) {}
UnId(const char * idd,const C_F0 & ee,aType rr,bool reff) ;
UnId(deque<UnId> * d) : id(0),r(0),e(0),array(d?new deque<UnId>(*d):0),re(0),ref(false) {}
UnId(const UnId & u) :
id(u.id),r(u.r),e(u.e),
array(u.array?new deque<UnId>(*u.array):0),
re(u.re),ref(u.ref) {}
// Modif 24032005
void operator= (const UnId & u) {
id=u.id;
r=u.r;
e=u.e;
re=u.re;
ref=u.ref;
if(array) delete array;
array=0;
if(u.array) array= new deque<UnId>(*u.array);
}
~UnId(){ if( array) delete array;} // Modif 24032005
};
/// <<ListOfId>>
typedef deque<UnId> ListOfId;
// xxx is a type so xxx can't be a parameter
#define ATYPE(xxx) map_type[typeid(xxx).name()]
/* #define NEW_TYPE(type) map_type[typeid(type).name()] = new ForEachType<type >(0,0)
//#define NEW_TYPE(type) map_type[typeid(type).name()] = new ForEachType<type >()
#define NEW_TYPE_I(type,i,d) map_type[typeid(type).name()] = new ForEachType<type>(i,d)
#define NEW_TYPE_Ptr(type) map_type[typeid(type*).name()] = new ForEachTypePtr<type >()
#define NEW_TYPE_PtrND(type) map_type[typeid(type*).name()] = new ForEachTypePtr<type >(0)
#define NEW_TYPE_PtrNIND(type) map_type[typeid(type*).name()] = new ForEachTypePtr<type >(0,0)
//#define NEW_TYPE_PtrI(type) map_type[typeid(type*).name()] = new ForEachTypePtr<type*>(Initialize<type>)
*/
/// Doxygen doc
extern Polymorphic * TheOperators, * TheRightOperators;
// -------------
extern C_F0 *pOne,*pZero,*pminusOne;
typedef AnyType (* Function1)(Stack, const AnyType &);
typedef AnyType (* Function2)(Stack, const AnyType &,const AnyType &);
typedef AnyType (* CFunction2)(Stack, E_F0 *, E_F0 *);
typedef AnyType (* CFunction4)(Stack, E_F0 *, E_F0 *, E_F0 *, E_F0 *);
Expression NewExpression(Function1,Expression);
Expression NewExpression(Function2,Expression,Expression);
inline Type_Expr make_Type_Expr(aType t, E_F0 * e) {return make_pair(t,e);}
inline Type_Expr make_Type_Expr( E_F0 * e,aType t) {return make_pair(t,e);}
struct Keyless : binary_function<const char *,const char *, bool>
{
typedef const char * Key;
bool operator()(const Key& x, const Key& y) const { return strcmp(x,y)<0;} };
// <<TableOfIdentifier>>
class TableOfIdentifier: public CodeAlloc {
public:
struct Value;
typedef const char * Key;
typedef map<Key,Value,Keyless> maptype;
typedef pair<const Key,Value> pKV;
typedef maptype::iterator iterator;
typedef maptype::const_iterator const_iterator;
struct Value :public Type_Expr {
pKV * next; // link all the variable in reverse order to call delete on each variable
bool del;
Value(const Type_Expr & vv,pKV * n,bool dd=true) : Type_Expr(vv),next(n),del(dd) {}
Value(aType t,E_F0 *f,pKV *n,bool dd=true): Type_Expr(t,f),next(n),del(dd) {}
};// to store the type and the expression
pKV * listofvar;
// struct Keyless : binary_function<Key,Key, bool>
// { bool operator()(const Key& x, const Key& y) const{ return strcmp(x,y)<0;} };
maptype m;
C_F0 Find(Key) const ;
C_F0 Find(Key,const basicAC_F0 &) const ;
const Type_Expr & New(Key k,const Type_Expr & v,bool del=true);
void Add(Key k,Key op,OneOperator *p0,OneOperator *p1=0,
OneOperator *p2=0,OneOperator *p3=0,OneOperator *p4=0,
OneOperator *p5=0,OneOperator *p6=0) ;
void clear();
template<class T>
C_F0 NewVar(Key k,aType t,size_t & top,const C_F0 &i) ;
template<class T>
C_F0 NewVar(Key k,aType t,size_t & top,const basicAC_F0 &args) ;
template<class T,class U>
C_F0 NewVar(Key k,aType t,size_t & top,const basicAC_F0 &args,const U & data) ;
// C_F0 NewVar(Key k,aType t,size_t & top,const basicAC_F0 &args,const C_F0& f) ;
template<class T>
C_F0 NewVar(Key k,aType t,size_t & top) ;
C_F0 NewID(aType t,Key k, C_F0 & c,size_t & top,bool del=true);
C_F0 NewID(aType t,Key k, C_F0 & c,const ListOfId & l,size_t & top,bool del=true);
template<class T>
C_F0 NewFESpace(Key k,aType t,size_t & top,const basicAC_F0 &args);
friend ostream & operator<<(ostream & f,const TableOfIdentifier & );
C_F0 destroy();
TableOfIdentifier() ; //: listofvar(0) {};
~TableOfIdentifier(); //
};
// <<basicForEachType>> for all the type of the language
class basicForEachType : public CodeAlloc {
const type_info * ktype; // the real type_info
// const type_info *ktypefunc;// the type of code
public:
static basicForEachType * tnull;
const size_t size;
typedef OneOperator * CastFunc;
typedef map<aType,CastFunc>::const_iterator const_cast_iterator;
typedef const char * Key;
// virtual void print(ostream &f,const void *p) const =0;
friend ostream & operator<<(ostream & f,const basicForEachType & e)
{ f << '<' << e.name() << '>' ;return f;}
void Show(ostream & f) const ;
const char * name() const { return this!=tnull ? ktype->name() :"NULL" ;}
virtual bool CastingFrom(const basicForEachType * t) const ;
// modif FH ----- A TESTER //
virtual bool SametypeRight(const basicForEachType * t) const {return (this == t) || (t == un_ptr_type) || (t == type_C_F0);}
// virtual Type_Expr init(const Type_Expr & te) const { return Type_Expr(0,0);}
virtual int TYPEOFID() const {return 0;}
// bool SametypeLeft(const basicForEachType * t) const {return t == this;}
// bool To(const basicForEachType * t) const { throwassert(t && this);return un_ptr_type == this ? t->un_ptr_type == this : t == this;}
virtual C_F0 CastTo(const C_F0 & e) const ;
virtual void SetArgs(const ListOfId *lid) const ;// { cout << "SetArgs::\n " ;throwassert(lid==0 || lid->size()==0);}
aType right() const {return un_ptr_type;};
Expression RightValueExpr(Expression f) const;
// Type_Expr NewVar(Key k,aType t,size_t & top,const C_F0 &i);
virtual C_F0 Initialization(const Type_Expr & e) const ;
virtual Expression Destroy(const C_F0 &) const ;
virtual bool ExistDestroy() const {return destroy;}
virtual Type_Expr SetParam(const C_F0 & c,const ListOfId * l,size_t & top) const;
virtual Expression OnReturn(Expression f) const;
// { return make_pair<aType,const E_F0 *>(this,c.left());}
protected:
basicForEachType(const type_info & k ,const size_t ,
const E_F1_funcT_Type * p=0,basicForEachType *rr=0,
Function1 iv=0,Function1 id=0, Function1 dreturn=0) ;
/* inline basicForEachType(const type_info & k ,const type_info & kf ,const size_t ,
const E_F1_funcT_Type * p=0,basicForEachType *rr=0,
Function1 iv=0,Function1 id=0) ;*/
public:
static const basicForEachType * type_C_F0; // for any type un formal operation .... FH add 09/2012
const basicForEachType * un_ptr_type; // type of right exp
private:
// map<aType,CastFunc> mapofcast;
OneOperator * casting; // list of operator for casting to this type
const E_F1_funcT_Type * un_ptr; // is ptr -> get value function
Function1 DoOnReturn; // to call some thing on return.
Function1 InitExp; // to init the ptr value
Function1 destroy;// the destroy function
TableOfIdentifier ti; // all polymorphisme of the Identifier
public:
// basicForEachType * FunctionType() const;// { return funct_type ? funct_type : (funct_type= new FuncForEachType(this));}
C_F0 Find(const char * k) const; // {return ti->Find(k);}
C_F0 Find(const char * k,const basicAC_F0 & args) const; // {return ti->Find(k);}
void New(Key k,Type_Expr v,bool del=true){ti.New(k,v,del);}
void Add(Key k,Key op,OneOperator *p0,OneOperator *p1=0,
OneOperator *p2=0,OneOperator *p3=0,OneOperator *p4=0,
OneOperator *p5=0,OneOperator *p6=0)
{ti.Add(k,op,p0,p1,p2,p3,p4,p5,p6);}
void AddCast(CastFunc f1,CastFunc f2=0,CastFunc f3=0,CastFunc f4=0,
CastFunc f5=0,CastFunc f6=0,CastFunc f7=0,CastFunc f8=0);
ostream & ShowTable(ostream & f) const { f << ti; return f;}
// basicForEachType * funct_type;
virtual ~basicForEachType();
// Add FH: for implicite loop FH. Jan 2016
// type for i, type for j, type valeur
basicForEachType *typei,*typej,*typev;
void SetTypeLoop(basicForEachType *v,basicForEachType *i=0,basicForEachType *j=0)
{ typev=v; typei=i;typej=j;}
};
template<typename T>
inline basicForEachType * atype() {
map<const string,basicForEachType *>::iterator ir=map_type.find(typeid(T).name());
// basicForEachType * r=map_type[];
if (ir == map_type.end()) { cerr << "Error: aType '" << typeid(T).name() << "', doesn't exist\n";
ShowType(cerr);
throw(ErrorExec("exit",1));}
return ir->second;}
// --------
//typedef basicForEachType TheType;
// const basicForEachType * ktype; // compilation time
// class for all exp
// a left exp is a pointer expression
// -------
// -- exec times le code is just E_F0*(fonction without args)
class C_LF2;
class C_LF1;
// 3 types of function/expression 0,1,2 args
/// <<E_F0>> is the base class for all expressions built by parsing an EDP script in the grammar of the FreeFem++
/// language (see lg.ypp). E_F0 pointers are typed as #Expression, stored as a list in [[ListOfInst]], and evaluated
/// when CListOfInst::eval() [[file:AFunction.hpp::CListOfInst::eval]] is called (see \ref index).
class E_F0 :public CodeAlloc
{
public:
static E_F0 *tnull;
struct kless : binary_function<Expression,Expression, bool>
{ bool operator()(const Expression& x, const Expression& y) const{
//cout << x << " " << y << x->compare(y) << " ::: ";
int r1 = x->compare(y);// , r2 = y->compare(x);
//assert(r1+r2==0);
return r1<0;} };
typedef map< E_F0 *,int,kless> MapOfE_F0;
virtual AnyType operator()(Stack) const =0;
virtual bool Empty() const {return this==tnull; }
// virtual E_F0 * destroy(Stack ) const {return 0;}
// virtual const E_F0 * Parameter(Stack ) const {return this;}
virtual size_t nbitem() const {return 1;}
virtual bool EvaluableWithOutStack() const {return false;} //
virtual bool MeshIndependent() const {return true;} //
virtual bool Zero() const {return false;} //
virtual E_F0 * right_E_F0() const { return 0;}
virtual bool ReadOnly() const { return true;} // the expression do not change the memory
virtual ~E_F0() {}
virtual int compare (const E_F0 *t) const { int r= (t==this) ? 0 : ( ( this<t) ?-1 : 1);
//cout << "cmp " << typeid(*this).name() << r << endl;
return r;} // to give a order in instuction
virtual int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) ; // build optimisation
virtual AnyType operator()(Stack stack,AnyType *) const { return operator()(stack);} // call optim code
virtual operator aType () const { assert(0);return 0;} // the type of the expression
virtual ostream & dump(ostream &f) const { f << ' ' << typeid(*this).name() << ' ' << this << ' ' ;return f; }
// for OPTIMIZATION
int find(const MapOfE_F0 & m) ;
int insert(Expression opt,deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) ;
// ajoute for optimisation to say if a expression in meshindep a exec time
// to solve 0*x // question
// juin 2007 FH
virtual AnyType eval(Stack stack, bool & meshindep ) const
{ meshindep=MeshIndependent();return operator()(stack);}
};
inline ostream & operator<<(ostream & f,const E_F0 &e) { if(!e.Empty()) e.dump(f); else f << " --0-- " ;return f;}
/// <<E_F0mps>> Specialization of [[E_F0]] where MeshIndependent() always returns false instead of true.
class E_F0mps : public E_F0 { public:
virtual bool MeshIndependent() const {return false;} //
};
class E_F0info : public E_F0 { public:
// not a real expression just to pass information
virtual bool EvaluableWithOutStack() const {return true;} //
virtual bool MeshIndependent() const {return true;} //
virtual AnyType operator()(Stack ) const {
return SetAny<const E_F0 *>(this);}
operator aType () const { return atype<Expression>();}
};
class E_F1 : public CodeAlloc{ public: virtual AnyType operator()(Stack,AnyType &) const =0;};
class E_F2 : public CodeAlloc{ public: virtual AnyType operator()(Stack,AnyType &,AnyType &) const =0;};
class E_FN : public CodeAlloc{ public: virtual AnyType operator()(Stack,size_t N,...) const =0;};
// class to play with polymorphisme
// ---------------------------------
class basicAC_F0;
class ArrayOfaType : public CodeAlloc{
// class for the type of parameter
aType tt[11];
protected:
int n;
aType * t; // array of type
bool ellipse;
void operator=(const ArrayOfaType &); // no set operator
public:
// ArrayOfaType() :n(0),t(0),ellipse(false) {}
explicit ArrayOfaType(bool ell=false)
:n(0),t(0),ellipse(ell) {}
explicit ArrayOfaType(const aType & a,bool ell=false)
:n(1),t(tt),ellipse(ell) {t[0]=a;}
explicit ArrayOfaType(const aType & a,const aType & b,bool ell=false)
:n(2),t(tt),ellipse(ell) {t[0]=a,t[1]=b;}
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,bool ell=false)
:n(3),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;}
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d,bool ell=false)
:n(4),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d;
/* cout << * a << *b << * c << * d << " ---------" << endl; */}
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d,const aType & e,bool ell=false)
:n(5),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d; t[4]=e; }
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d,const aType & e,const aType & f,bool ell=false)
:n(6),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d; t[4]=e; t[5]=f; }
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d,const aType & e,
const aType & f,const aType & g,
bool ell=false)
:n(7),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d; t[4]=e; t[5]=f; t[6]=g; } // (6 args) Added by Fabian Dortu
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d,const aType & e,
const aType & f,const aType & g,const aType & h,
bool ell=false)
:n(8),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d; t[4]=e; t[5]=f; t[6]=g; t[7]=h; } // (7 args) Added by Fabian Dortu
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d,const aType & e,
const aType & f,const aType & g,const aType & h, const aType & i,
bool ell=false)
:n(9),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d; t[4]=e; t[5]=f; t[6]=g; t[7]=h; t[8]=i; } // (8 args) Added by Fabian Dortu
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d, const aType & e,
const aType & f,const aType & g,const aType & h, const aType & i, const aType & j,
bool ell=false)
:n(10),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d; t[4]=e; t[5]=f; t[6]=g; t[7]=h; t[8]=i; t[9]=j; } // (10 args) Added by Fabian Dortu
explicit ArrayOfaType(const aType & a,const aType & b,const aType & c,const aType & d,const aType & e,const aType & f,const aType & g,const aType & h, const aType & i, const aType & j, const aType & k,bool ell=false)
:n(11),t(tt),ellipse(ell) {t[0]=a,t[1]=b;t[2]=c;t[3]=d; t[4]=e; t[5]=f; t[6]=g; t[7]=h; t[8]=i; t[9]=j; t[10]=k; } // (10 args) Added by Fabian Dortu
ArrayOfaType(const basicAC_F0 & ) ;
ArrayOfaType(const ArrayOfaType & ); //
ArrayOfaType(const ListOfId * l);
~ArrayOfaType() { if(t && t != tt) delete [] t;t=0;n=0;}
bool WithOutCast( const ArrayOfaType & a) const ;
bool WithCast( const ArrayOfaType & a,int nbcast=100000) const ; // return the number of cast
// exactly comparaison
bool operator==( const ArrayOfaType & a) const {
if (a.n != n || a.ellipse !=ellipse) return false;
for (int i=0;i<n;i++)
if (t[i] != a.t[i])
return false;
return true;}
friend ostream & operator<<(ostream & f,const ArrayOfaType & a);
};
/// <<OneOperator>> Base class for all language operators. Daughter classes have the same name with several extensions:
/// "[1-9]" represent the number of operator arguments, "_" designates operators that take a reference instead of a
/// copied argument, "s" designates operators that require a stack argument.
class OneOperator : public ArrayOfaType {
friend class MakeVectSpaceN;
friend class basicForEachType;
const basicForEachType * r; // return type
OneOperator *next; // to make a list of OneOperator
public:
int pref; // to try to solve ambiguity for binary operator
// 10 for bool, 20 for int , 30 for long , 40, for float, 50 double, 60 for complex, 70 string
// string+ 1 => string
// 1+string => string
OneOperator(aType rr) ;// : r(rr),ArrayOfaType(),next(0),pref(0) {throwassert(r);}
OneOperator(aType rr,aType a) ;//: r(rr),ArrayOfaType(a,false),next(0),pref(0) {throwassert(rr && a );}
OneOperator(aType rr,aType a,aType b);// : r(rr),ArrayOfaType(a,b,false),next(0),pref(0) {
// throwassert(rr && a && b);}
OneOperator(aType rr,aType a,aType b,aType c) ;
//: r(rr),ArrayOfaType(a,b,c,false),next(0),pref(0) {throwassert(rr && a && b && c);}
OneOperator(aType rr,aType a,aType b,aType c,aType d) ;
//: r(rr),ArrayOfaType(a,b,c,d,false),next(0),pref(0) {throwassert(rr && a && b && c);}
OneOperator(aType rr,aType a,aType b,aType c,aType d,aType e) ;
//: r(rr),ArrayOfaType(a,b,c,d,e,false),next(0),pref(0) {throwassert(rr && a && b && c && d);} // Added by Fabian Dortu (5 parameters)
OneOperator(aType rr,aType a,aType b,aType c,aType d,aType e,aType f) ;
//: r(rr),ArrayOfaType(a,b,c,d,e,f,false),next(0),pref(0) {throwassert(rr && a && b && c && d && e && f);} // Added by Fabian Dortu (6 parameters)
OneOperator(aType rr,aType a,aType b,aType c,aType d,aType e,aType f, aType g);
// : r(rr),ArrayOfaType(a,b,c,d,e,f,g,false),next(0),pref(0) {throwassert(rr && a && b && c && d && e && f && g);} // Added by Fabian Dortu (7 parameters)
OneOperator(aType rr,aType a,aType b,aType c,aType d,aType e,aType f, aType g, aType h);
// : r(rr),ArrayOfaType(a,b,c,d,e,f,g,h,false),next(0),pref(0) {throwassert(rr && a && b && c && d && e && f && g && h);} // Added by Fabian Dortu (8 parameters)
OneOperator(aType rr,aType a,aType b,aType c,aType d,aType e,aType f, aType g, aType h, aType i) ;
//: r(rr),ArrayOfaType(a,b,c,d,e,f,g,h,i,false),next(0),pref(0) {throwassert(rr && a && b && c && d && e && f && g && h && i);} // Added by Fabian Dortu (9 parameters)
OneOperator(aType rr,aType a,aType b,aType c,aType d,aType e,aType f, aType g, aType h, aType i, aType j);
// : r(rr),ArrayOfaType(a,b,c,d,e,f,g,h,i,j,false),next(0),pref(0) {throwassert(rr && a && b && c && d && e && f && g && h && i && j);} // Added by Fabian Dortu (10 parameters)
OneOperator(aType rr,const ArrayOfaType &ta) ;
//: r(rr),ArrayOfaType(ta),next(0),pref(0) {throwassert(rr);}
OneOperator(aType rr,bool ellipse) ;
//: r(rr),ArrayOfaType(ellipse),next(0),pref(0) {throwassert(rr );}
OneOperator(aType rr,const ListOfId *l) ;
//: r(rr),ArrayOfaType(l),next(0),pref(0) {throwassert(rr );}
typedef pair<const OneOperator *,int> pair_find;
void operator+=(OneOperator &a){throwassert(a.next==0);a.next=next;next=&a;}
// a way to make none recurve delete good
virtual ~OneOperator();
pair_find Find(const ArrayOfaType & at) const ;
pair_find FindWithOutCast(const ArrayOfaType & at) const ; // for
OneOperator * FindSameR(const ArrayOfaType & at) ;
void Show(const ArrayOfaType & at,ostream &f=cerr) const;
void Show(ostream &f=cerr) const;
operator aType () const { return r;}
// <<OneOperator_code_decl>>
virtual E_F0 * code(const basicAC_F0 &) const =0;
virtual C_F0 code2(const basicAC_F0 &a) const ; // {return code(code(a),r);}
const OneOperator * Simple() const { return next||n?0:this;}
friend ostream & operator<<(ostream & f,const OneOperator & a);
};
/// <<Polymorphic>>
class Polymorphic:
public E_F0mps // [[E_F0mps]]
{
// a list of type
// simple, array or function
private:
typedef const char * Key;
typedef OneOperator * Value;
// struct Keyless : binary_function<Key,Key, bool>
// { bool operator()(const Key& x, const Key& y) const{ return strcmp(x,y)<0;} };
typedef map<Key,Value,Keyless> maptype; //
typedef maptype::const_iterator const_iterator; //
typedef maptype::iterator iterator; //
// remark the map is mutable because
// a expression is const E_F0 *
// So There is a incompatibility between
// we save an expression in a variable
// we have to add thing to a polymorphisme expression
mutable maptype m; // all polymorphisme of the Identifier
Expression e; // default expression
public:
Polymorphic() : m(),e(0) {}
// by default Empty and do nothing
virtual AnyType operator()(Stack ) const { return Nothing;}
virtual bool Empty() const {return true;} // by default Empty
void clear() { m.clear();}
const OneOperator * Find(const char *op, const ArrayOfaType &at) const;
const OneOperator * FindWithOutCast(const char *op,const ArrayOfaType &at) const;
void Show(const char *op,const ArrayOfaType & at,ostream &f=cerr)const ;
void Add(const char * op,OneOperator * p0 ,OneOperator * p1=0,OneOperator * p2=0,
OneOperator * p3=0,OneOperator * p4=0,OneOperator * p5=0,
OneOperator * p6=0,OneOperator * p7=0,OneOperator * p8=0,
OneOperator * p9=0,OneOperator * pa=0,OneOperator * pb=0,
OneOperator * pc=0,OneOperator * pd=0,OneOperator * pe=0
) const
{Addp(op,p0,p1,p2,p3,p4,p5,p6,p7,p8,p9,pa,pb,pc,pd,pe,0);}
void Add(const char * op,OneOperator ** pp) const ;
private:
void Addp(const char * op,OneOperator * pp,...) const ;
friend ostream & operator<<(ostream & f,const Polymorphic & a);
};
/// the type for polymorphisme of id
/// <<C_F0>> compile time expressions
class basicAC_F0;
class C_F0 {
friend class CC_F0; // cf [[CC_F0]]
protected:
Expression f; // the expression code, cf [[Expression]]
aType r; // the expression type, cf [[file:../fflib/AnyType.hpp::aType]]
public:
// the constructeur
C_F0() :f(0),r(0) {}
C_F0(const C_F0 & c):f(c.f),r(c.r) {}
C_F0(const C_F0 & a,const C_F0 & b); // concatenation
/// cf [[Type_Expr]]
C_F0(const Type_Expr & a):f(a.second),r(a.first) {}
/// <<C_F0_constructor_pop_char_basicAC_F0_decl>>
/// [[file:AFunction2.cpp::C_F0_constructor_pop_char_basicAC_F0_impl]]
/// cf [[Polymorphic]]
C_F0(const Polymorphic *,const char *,const basicAC_F0 & );
C_F0(const Polymorphic *,const char *, AC_F0 & );
// function, array ..
C_F0(const C_F0 & e,const char *op,const basicAC_F0 & p) ;
C_F0(const C_F0 & e,const char *op, AC_F0 & p) ;
// <<C_F0_constructor_char_C_F0_decl>> [[C_F0_constructor_char_C_F0_impl]]
C_F0(const C_F0 & e,const char *op,const C_F0 & ee);
C_F0(const C_F0 & e,const char *op,const C_F0 & a,const C_F0 & b) ;
C_F0(const C_F0 & e,const char *nm) ;
// without parameter ex f(). cf [[Polymorphic]]
C_F0(const Polymorphic * pop,const char *op);
// unary operator
C_F0(const Polymorphic * pop,const char *op,const C_F0 & a);
// <<C_F0_constructor_binary_decl>> binary operator [[file:AFunction2.cpp::C_F0_constructor_binary]]
C_F0(const Polymorphic * pop,const char *op,const C_F0 & a,const C_F0 & b);
// ternary operator
C_F0(const Polymorphic * pop,const char *op,const C_F0 & a,const C_F0 & b,const C_F0 & c);
C_F0( Expression ff,aType rr ): f(ff),r(rr) {
// cout << "C_F0: " << * rr << endl;// dec 2007 FH
// if (!rr && ff) cerr << "Type Null" << endl;
}
// operator Expression() const {return f;}
AnyType eval(Stack s) const {return (*f)(s);}
Expression RightValue() const { return r->RightValueExpr(f);}
Expression LeftValue() const;
aType left() const {return r;}
aType right() const {return r->right();}
C_F0 RightExp() const { return C_F0(RightValue(),right());} // FH add 07/2005
operator E_F0 * () const {return f;}
bool Empty() const {return !f || f->Empty();}
bool NotNull() const {return f;}
int TYPEOFID() const { return r ? r->TYPEOFID(): 0;}
int nbitem() const { return f ? f->nbitem() : 0;}
bool EvaluableWithOutStack() const { return f && f->EvaluableWithOutStack();}
bool Zero() const { return !f || f->Zero();}
Expression Destroy() { return r->Destroy(*this);}
operator const Polymorphic * () const {return dynamic_cast<const Polymorphic *>(f);}
bool operator==(const C_F0 & a) const {return f==a.f && r == a.r;}
bool operator!=(const C_F0 & a) const {return f!=a.f || r != a.r;}
// Type_Expr SetParam(const ListOfId * l,size_t & top) const ;
bool MeshIndependent() const { return f ==0 ? f->MeshIndependent() : false;}
C_F0 OnReturn() { f=r->OnReturn(f); return *this; } // Add mai 2009 (for return statment.
private:
friend class Block;
friend class TableOfIdentifier;
C_F0( Expression ff ): f(ff),r(0) {}
};
// for bison [[CListOfInst]]
class CListOfInst;
// a => b
// f => t||f
// t => t
// (a =>b) <=> (!a || b )
// warning ------------------
class ForTypeVoid: public basicForEachType{public:
ForTypeVoid():basicForEachType(typeid(void),0,0,0,0,0) {}
};
template<class T>
class ForEachType: public basicForEachType{public:
ForEachType(Function1 iv=0,Function1 id=0,Function1 OOnReturn=0):basicForEachType(typeid(T),sizeof(T),0,0,iv,id,OOnReturn) {
if (sizeof(T) > sizeof(AnyTypeWithOutCheck) )
{
cout << " Sorry the " <<typeid(T).name() << " is too large ( " << sizeof(T)
<< " > " << sizeof(AnyTypeWithOutCheck) << " ) " << endl;
throwassert(sizeof(T) <= sizeof(AnyTypeWithOutCheck) );
}
}
};
template<class T>
class ForEachType<T*>: public basicForEachType{public:// coorection july 2009..... FH Hoooo.... (Il y a un bug DUR DUR FH ...)
ForEachType(Function1 iv=0,Function1 id=0,Function1 OOnReturn=0):basicForEachType(typeid(T),sizeof(T),0,0,iv,id,OOnReturn) {
//T i= 0.0;
}
};
template<class A,class B> AnyType UnRef(Stack,const AnyType &a) ;
template<class A> AnyType Initialize(Stack,const AnyType &a) ;
template<class A> AnyType Destroy(Stack,const AnyType &a) ;
// the type of variable is pointer because we need to write in
template<class T,class PT=T*>
class ForEachTypePtr: public basicForEachType { public:
ForEachTypePtr();
ForEachTypePtr(Function1 init,Function1 dl,Function1 onreturn=0);
ForEachTypePtr(Function1 dl);
};
template<class T>
class ForEachTypePtr<T*,T**>: public basicForEachType { public:
ForEachTypePtr(T* bb=0,Function1 onreturn=0);
ForEachTypePtr(Function1 init,Function1 dl,Function1 onreturn=0);
ForEachTypePtr(Function1 dl);
};
template<class T,int RTYPE>
class ForEachTypePtrfspace: public ForEachTypePtr<T> { public:
ForEachTypePtrfspace():ForEachTypePtr<T>() {}
int TYPEOFID() const {return RTYPE;}
};
class ForTypeAnyType: public basicForEachType{public:
ForTypeAnyType(): basicForEachType(typeid(AnyType),sizeof(AnyType)) {}
bool CastingFrom(const basicForEachType * ) const {return true;}
C_F0 CastTo(const C_F0 & e) const {return e;}
};
// for cast and get value associed to a pointer
template<class A,class B>
AnyType Cast(Stack,const AnyType &b) {
return SetAny<A>(static_cast<A>(GetAny<B>(b)));}
template<class A,class B,A F(const B &)>
AnyType FCast(Stack s,const AnyType &b) {
return SetAny<A>(Add2StackOfPtr2Free(s,F(GetAny<B>(b))));}
template<class A>
AnyType UnRef(Stack,const AnyType &a) {
return SetAny<A>(*PGetAny<A>(a));}
template<class A,class B>
AnyType UnRef(Stack,const AnyType &a) {
return SetAny<A>(*GetAny<B>(a));}
template<class A>
AnyType UnRefCopyPtr(Stack s,const AnyType &a) {
A ** ppa=PGetAny<A*>(a);
A * pc = new A(**ppa);
return SetAny<A*>(Add2StackOfPtr2Free(s,pc)) ;}
template<class A> AnyType Initialize(Stack,const AnyType &x){
A * a=PGetAny<A>(x);
A *b=new A;//
memcpy(a,b,sizeof(A));// bitcopy
::operator delete(b); // delete with no destruction
return SetAny<A*>(a);
}
template<class A> AnyType InitializePtr(Stack stack,const AnyType &x){
A * a=PGetAny<A>(x);
SHOWVERB( cout << " init ptr " << typeid(A*).name() << (char *) a - (char*) stack<< endl);
*a=0;
return x;
}
template<class A> AnyType InitializeDef(Stack stack,const AnyType &x){
A * a=PGetAny<A>(x);
SHOWVERB( cout << " init ptr " << typeid(A*).name() << (char *) a - (char*) stack<< endl);
*a=A();
return x;
}
template<class A> inline AnyType Delete(Stack,const AnyType &x){
A * a=PGetAny<A>(x);
SHOWVERB(cout << "DESTROY " <<typeid(A).name() << " " << a << endl);
(*a).~A();
return Nothing;
}
template<class A> inline AnyType Destroy(Stack,const AnyType &x){
A * a=PGetAny<A>(x);
SHOWVERB(cout << "DESTROY " <<typeid(A).name() << " " << a << endl);
a->destroy();
return Nothing;
}
template<class A> inline AnyType DestroyS(Stack,const AnyType &x){
A a=GetAny<A>(x);
SHOWVERB(cout << "DESTROY " <<typeid(A).name() << " " << a << endl);
a.destroy();
return Nothing;
}
template<class A> inline AnyType InitS(Stack,const AnyType &x){
A a=GetAny<A>(x);
SHOWVERB(cout << "InitS " <<typeid(A).name() << " " << a << endl);
a.init();
return Nothing;
}
template<class A> inline AnyType InitP(Stack,const AnyType &x){
A *a=PGetAny<A>(x);
SHOWVERB(cout << "InitP " <<typeid(A).name() << " " << a << endl);
a->init();
return Nothing;
}
template<class A> inline AnyType DestroyPtr(Stack,const AnyType &x) {
const A * a=PGetAny<A>(x);
SHOWVERB(cout << "DestroyPtr " << typeid(A).name() << *a << endl);
(*a)->destroy();
// delete *a;
return Nothing;
};
template<class A> inline AnyType DeletePtr(Stack,const AnyType &x) {
const A * a=PGetAny<A>(x);
SHOWVERB(cout << "DeletePtr " << typeid(A).name() << *a << endl);
// (*a)->destroy();
delete *a;
return Nothing;
};
template<> AnyType inline DestroyPtr<string *>(Stack,const AnyType &x) {
string ** a=PGetAny<string*>(x);
SHOWVERB( cout << "DestroyPtr " << typeid(string*).name() << *a << endl);
delete *a;
return Nothing;
};
template<class A> AnyType Initialize(Stack,const AnyType &x,const AnyType &y){
A * a=PGetAny<A>(x);
A *b=new A(GetAny<A>(x));//
memcpy(a,b,sizeof(A));// bitcopy
::operator delete(b); // delete with no destruction
return SetAny<A*>(a);
}
class E_F0_CFunc2 :public E_F0mps { public:
CFunction2 f2;
E_F0 *a,*b;
AnyType operator()(Stack s) const {return f2(s,a,b);}
E_F0_CFunc2( CFunction2 ff,E_F0 *aa,E_F0 *bb) : f2(ff),a(aa),b(bb){}
bool EvaluableWithOutStack() const
{return a->EvaluableWithOutStack() && b->EvaluableWithOutStack();} //
operator aType () const { return atype<void>();}
};
class E_F0_CFunc4 :public E_F0mps { public:
CFunction4 f4;
E_F0 *a,*b,*c,*d;
AnyType operator()(Stack s) const {return f4(s,a,b,c,d);}
E_F0_CFunc4( CFunction4 ff,E_F0 *aa,E_F0 *bb,E_F0 *cc,E_F0 *dd)
: f4(ff),a(aa),b(bb),c(cc),d(dd){}
operator aType () const { return atype<void>();}
};
template<class R,class A>
class E_F1_F :public E_F1 { public:
typedef R (*func)(A) ;
func f;
E_F1_F(func ff) : f(ff) {}
AnyType operator()(Stack s,AnyType & a) const
{return SetAny<R>(f(GetAny<A>(a)));}
};
template<class R,class A0,class A1>
class E_F2_F :public E_F2 { public:
typedef R (*func)(const A0 &,const A1&) ;
func f;
E_F2_F(func ff) : f(ff) {}
AnyType operator()(Stack s,AnyType & a0,AnyType & a1) const
{return SetAny<R>(f(GetAny<A0>(a0),GetAny<A1>(a1)));}
};
template<class R,class TA0,bool RO=true>
class E_F_F0 :public E_F0 { public:
template <class T> struct remove_reference {typedef T type;};
// template <class T> struct remove_reference<T&> {typedef T type;};
template <class T> struct remove_reference<const T&> {typedef T type;};
typedef typename remove_reference<TA0>::type A0;
typedef R (*func)( TA0 ) ;
func f;
Expression a;
E_F_F0(func ff,Expression aa) : f(ff),a(aa) {}
AnyType operator()(Stack s) const
{return SetAny<R>(f(GetAny<A0>( (*a)(s) )));}
bool EvaluableWithOutStack() const
{return a->EvaluableWithOutStack();} //
bool MeshIndependent() const {return a->MeshIndependent();} //
bool ReadOnly() const { return RO ;}
int compare (const E_F0 *t) const {
int rr;
// cout << "cmp " << typeid(*this).name() << " and " << typeid(t).name() << endl;
const E_F_F0* tt=dynamic_cast<const E_F_F0 *>(t);
if (tt && f == tt->f) rr = a->compare(tt->a);
else rr = E_F0::compare(t);
return rr;
} // to give a order in instuction
int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) ;
virtual ostream & dump(ostream &ff) const { ff << typeid(*this).name() <<" f= " << f << " a= "<< *a << ' ' ;return ff; }
};
// modif for xlc++ FH
template<class R,class TA0,bool RO=true>
class E_F_F0_Opt: public E_F_F0<R,TA0,RO> { public :
size_t ia;
E_F_F0_Opt(const E_F_F0<R,TA0,RO> &t,size_t iaa)
: E_F_F0<R,TA0,RO>(t) , ia(iaa) {assert(iaa<2000000 && iaa >0);}
AnyType operator()(Stack s) const
{
// A0 x = *static_cast<A0 *>(static_cast<void*>(static_cast<char *>(s)+ia));
// cout << " opt f (" << x << " ) = " << ": " << ia << endl;
return SetAny<R>( this->f( *static_cast<typename E_F_F0<R,TA0>::A0 *>(static_cast<void*>(static_cast<char *>(s)+ia)) ) );}
};
template<class R,class TA0,bool RO>
int E_F_F0<R,TA0,RO>::Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n)
{
int rr = find(m);
if (rr) return rr;
return insert(new E_F_F0_Opt<R,TA0,RO>(*this,a->Optimize(l,m,n)),l,m,n);
}
// fin modif xlc++
template<class A0>
class E_VF_F0 :public E_F0 { public:
typedef void (*func)( A0 ) ;
func f;
Expression a;
E_VF_F0(func ff,Expression aa) : f(ff),a(aa) {}
AnyType operator()(Stack s) const
{f(GetAny<A0>( (*a)(s) ));return Nothing;}
bool EvaluableWithOutStack() const
{return a->EvaluableWithOutStack();} //
bool MeshIndependent() const { return a->MeshIndependent(); }
};
inline int clexico(int i,int j) { return i==0 ? j : i;}
inline int clexico(int i,int j,int k) { int ll=clexico(i,j); return ll==0 ? k : ll;}
template<class R,class TA0,class TA1>
class E_F_F0F0 :public E_F0 { public:
template <class T> struct remove_reference {typedef T type;};
template <class T> struct remove_reference<T&> {typedef T type;};
typedef typename remove_reference<TA0>::type A0;
typedef typename remove_reference<TA1>::type A1;
typedef R (*func)( A0 , A1 ) ;
func f;
Expression a0,a1;
E_F_F0F0(func ff,Expression aa0,Expression aa1)
: f(ff),a0(aa0),a1(aa1) {}
AnyType operator()(Stack s) const
{return SetAny<R>( f( GetAny<A0>((*a0)(s)) , GetAny<A1>((*a1)(s)) ) );}
bool EvaluableWithOutStack() const
{return a0->EvaluableWithOutStack() && a1->EvaluableWithOutStack();} //
bool MeshIndependent() const
{return a0->MeshIndependent() && a1->MeshIndependent();} //
int compare (const E_F0 *t) const {
int rr;
// cout << "cmp " << typeid(*this).name() << " and " << typeid(t).name() << endl;
const E_F_F0F0* tt=dynamic_cast<const E_F_F0F0 *>(t);
if (tt && f == tt->f) rr= clexico(a0->compare(tt->a0),a1->compare(tt->a1));
else rr = E_F0::compare(t);
return rr;
} // to give a order in instuction
int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) ;
};
// modif for xlc++
template<class R,class TA0,class TA1>
class E_F_F0F0_Opt: public E_F_F0F0<R,TA0,TA1> { public :
size_t ia,ib;
E_F_F0F0_Opt(const E_F_F0F0<R,TA0,TA1> &t,size_t iaa,size_t ibb)
: E_F_F0F0<R,TA0,TA1>(t) ,
ia(iaa),ib(ibb) {}
AnyType operator()(Stack s) const
{
//A0 aa =*static_cast<A0 *>(static_cast<void*>(static_cast<char *>(s)+ia));
//A1 bb=*static_cast<A1 *>(static_cast<void*>(static_cast<char *>(s)+ib)) ;
//cout << ia << " " << ib << "f( " << aa << "," << bb << " ) = "<< f(aa,bb) << endl;
return SetAny<R>( this->f( *static_cast<typename E_F_F0F0<R,TA0,TA1>::A0 *>(static_cast<void*>(static_cast<char *>(s)+ia)) ,
*static_cast<typename E_F_F0F0<R,TA0,TA1>::A1 *>(static_cast<void*>(static_cast<char *>(s)+ib)) ) );}
};
template<class R,class TA0,class TA1>
int E_F_F0F0<R,TA0,TA1>::Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n)
{
int rr = find(m);
if (rr) return rr;
return insert(new E_F_F0F0_Opt<R,TA0,TA1>(*this,a0->Optimize(l,m,n),a1->Optimize(l,m,n)),l,m,n);
}
// add modif for xlc++
template<class R,class A0>
class E_F_F0_ :public E_F0 { public:
typedef R (*func)(const A0& ) ;
func f;
Expression a;
E_F_F0_(func ff,Expression aa) : f(ff),a(aa) {}
AnyType operator()(Stack s) const
{return SetAny<R>(f(GetAny<A0>( (*a)(s) )));}
bool EvaluableWithOutStack() const
{return a->EvaluableWithOutStack() ;} //
bool MeshIndependent() const
{return a->MeshIndependent();} //
};
// add FH 07/2008 for pmesh clean
template<class R,class A0>
class E_F_F0_Add2RC :public E_F0 { public:
typedef R (*func)(const A0& ) ;
func f;
Expression a;
E_F_F0_Add2RC(func ff,Expression aa) : f(ff),a(aa) {}
AnyType operator()(Stack s) const
{return SetAny<R>(Add2StackOfPtr2FreeRC(s,f(GetAny<A0>( (*a)(s) ))));}
bool EvaluableWithOutStack() const
{return a->EvaluableWithOutStack() ;} //
bool MeshIndependent() const
{return a->MeshIndependent();} //
};
// end add.
template<class R,class A0,class E=E_F0>
class E_F_F0s_ :public E { public:
typedef R (*func)(Stack stack,const A0& ) ;
func f;
Expression a;
E_F_F0s_(func ff,Expression aa) : f(ff),a(aa) {}
AnyType operator()(Stack s) const
{return SetAny<R>(f(s,GetAny<A0>( (*a)(s) )));}
// bool MeshIndependent() const {return true;} // def in E
operator aType () const { return atype<R>();}
};
template<class R,class A0,class A1,class E=E_F0>
class E_F_F0F0_ :public E { public:
typedef R (*func)(const A0 &,const A1 & ) ;
func f;
Expression a0,a1;
E_F_F0F0_(func ff,Expression aa0,Expression aa1)
: f(ff),a0(aa0),a1(aa1) {}
AnyType operator()(Stack s) const
{return SetAny<R>( f( GetAny<A0>((*a0)(s)) , GetAny<A1>((*a1)(s)) ) );}
bool MeshIndependent() const
{return a0->MeshIndependent() && a1->MeshIndependent();} //
};
// FH Add 07/2008
// class with add 1 to the refcounter for mesh .
template<class R,class A0,class A1,class E=E_F0>
class E_F_F0F0_Add2RC :public E { public:
typedef R (*func)(const A0 &,const A1 & ) ;
func f;
Expression a0,a1;
E_F_F0F0_Add2RC(func ff,Expression aa0,Expression aa1)
: f(ff),a0(aa0),a1(aa1) {}
AnyType operator()(Stack s) const
{return SetAny<R>(Add2StackOfPtr2FreeRC(s, f( GetAny<A0>((*a0)(s)) , GetAny<A1>((*a1)(s)) ) ));}
bool MeshIndependent() const
{return a0->MeshIndependent() && a1->MeshIndependent();} //
};
// FH end 07/2008
template<class R,class A0,class A1,class A2,class E=E_F0>
class E_F_F0F0F0_ :public E { public:
typedef R (*func)(const A0 &,const A1 & , const A2 &) ;
func f;
Expression a0,a1,a2;
E_F_F0F0F0_(func ff,Expression aa0,Expression aa1,Expression aa2)
: f(ff),a0(aa0),a1(aa1),a2(aa2) {}
AnyType operator()(Stack s) const
{return SetAny<R>( f( GetAny<A0>((*a0)(s)) , GetAny<A1>((*a1)(s)),GetAny<A2>((*a2)(s)) ) );}
virtual size_t nbitem() const {return a2->nbitem(); }
bool MeshIndependent() const
{return a0->MeshIndependent() && a1->MeshIndependent()&& a2->MeshIndependent();} //
};
template<class R,class A0,class A1,class A2,class E=E_F0>
class E_F_stackF0F0F0_ :public E_F0mps { public:
typedef R (*func)(Stack, const A0 &,const A1 & , const A2 &) ;
func f;
Expression a0,a1,a2;
E_F_stackF0F0F0_(func ff,Expression aa0,Expression aa1,Expression aa2)
: f(ff),a0(aa0),a1(aa1),a2(aa2) {}
AnyType operator()(Stack s) const
{return SetAny<R>( f(s, GetAny<A0>((*a0)(s)) , GetAny<A1>((*a1)(s)),GetAny<A2>((*a2)(s)) ) );}
virtual size_t nbitem() const {return a2->nbitem(); }
bool MeshIndependent() const { return true;}
};
template<class R,class A0,class A1>
class E_F_F0F0_NC :public E_F0 { public:
typedef R (*func)( A0 &,const A1 & ) ;
func f;
Expression a0,a1;
E_F_F0F0_NC(func ff,Expression aa0,Expression aa1)
: f(ff),a0(aa0),a1(aa1) {}
AnyType operator()(Stack s) const
{return SetAny<R>( f( GetAny<A0>((*a0)(s)) , GetAny<A1>((*a1)(s)) ) );}
bool MeshIndependent() const
{return a0->MeshIndependent() && a1->MeshIndependent() ; } //
};
class E_F_StackF0F0 :public E_F0mps { public:
typedef AnyType (*func)(Stack,Expression ,Expression ) ;
func f;
Expression a0,a1;
E_F_StackF0F0(func ff,Expression aa0,Expression aa1)
: f(ff),a0(aa0),a1(aa1) { }
AnyType operator()(Stack s) const
{return (*f)(s, a0 , a1) ;}
};
/*
class E_F_F0F0_<AnyType,AnyType,AnyType> :public E_F0 { public:
typedef AnyType (*func)(const AnyType &,const AnyType & ) ;
func f;
Expression a0,a1;
E_F_F0F0_(func ff,Expression aa0,Expression aa1)
: f(ff),a0(aa0),a1(aa1) {}
AnyType operator()(Stack s) const
{return f( (*a0)(s) , (*a1)(s) );}
bool MeshIndependent() const
{return a0->MeshIndependent() && a1->MeshIndependent() ; } //
};
*/
class E_F2_func :public E_F2 { public:
Function2 f;
AnyType operator()(Stack s,AnyType & a,AnyType & b) const {return f(s,a,b);}
E_F2_func( Function2 ff) : f(ff) {}
};
class E_F0_Func1 :public E_F0 { public:
Function1 f;
E_F0 *a;
AnyType operator()(Stack s) const {return f(s,(*a)(s));}
E_F0_Func1( Function1 f1,E_F0 *aa) : f(f1),a(aa){}
bool EvaluableWithOutStack() const {return a->EvaluableWithOutStack();} //
bool MeshIndependent() const {return a->MeshIndependent();} //
int compare (const E_F0 *t) const {
int rr;
const E_F0_Func1* tt=dynamic_cast<const E_F0_Func1 *>(t);
if (tt && f == tt->f) rr = a->compare(tt->a);
else rr = E_F0::compare(t);
if(tt && 0)
{
cout << "\n\t\t\t -------- " << (void *) f << " " << (void *) tt->f << " rr=" << a->compare(tt->a) << endl;
cout << "\t\t\tcmp E_F0_Func1 " << rr <<" << " << *this << " cmp " << *t << " " << tt << ">>\n";
}
return rr;
} // to give a order in instuction
// int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) const; // build optimisation
virtual ostream & dump(ostream &ff) const { ff << "E_F0_Func1 f= " << f << " a= "<< *a << ' ' ;return ff; }
};
class E_F0_Func2 :public E_F0 { public:
Function2 f;
E_F0 *a,*b;
AnyType operator()(Stack s) const {return f(s,(*a)(s),(*b)(s));}
E_F0_Func2( Function2 f1,E_F0 *aa,E_F0 *bb) : f(f1),a(aa),b(bb){}
bool EvaluableWithOutStack() const
{return a->EvaluableWithOutStack() &&b->EvaluableWithOutStack();} //
bool MeshIndependent() const {return a->MeshIndependent() && b->MeshIndependent();} //
};
// the variable offset / stack (local variable)
template<class R> class Value1:public E_F0
{
size_t offset;
public:
AnyType operator()(Stack s) const { return SetAny<R*>(static_cast<R *>(static_cast<void *>( static_cast<char *>(s)+offset)));}
Value1(size_t o):offset(o) {}
};
// the variable globale
template<class R> class GValue:public E_F0
{
mutable R v;
public:
AnyType operator()(Stack ) const { return SetAny<R*>(static_cast<R *>(static_cast<void *>(&v)));}
GValue(R o):v(o) {}
bool EvaluableWithOutStack() const {return true;} //
};
// a constante value
template<class R> int ccompare(const R & a,const R& b){ return a==b ? 0 :( a<b ? -1 : +1);}
template<class R> int ccompare(const complex<R> & a,const complex<R>& b){
int c=ccompare(a.real(),b.real());
return c==0 ? ccompare(a.imag(),b.imag()): c ;}
template<class R> class EConstant:public E_F0
{
const R v;
public:
AnyType operator()(Stack ) const { /*cout << " ()" << v << endl*/;return SetAny<R>(v);}
EConstant(const R & o):v(o) { /*cout << "New constant " << o << endl;*/}
bool EvaluableWithOutStack() const {return true;} //
operator aType () const { return atype<R>();}
bool Zero()const { return v == R();}
int compare (const E_F0 *t) const {
int rr;
const EConstant * tt=dynamic_cast<const EConstant *>(t);
if (tt) rr = ccompare(v,tt->v);
else rr = E_F0::compare(t);
return rr;
}
ostream & dump(ostream &f) const { f << " ((" <<typeid(R).name() << ") " << v << ") " ;return f;}
};
// the variable offset / stack (local variable)
class LocalVariable:public E_F0
{
public:
size_t offset;
aType t; // type of the variable just for check
public:
AnyType operator()(Stack s) const {
SHOWVERB( cout << "\n\tget var " << offset << " " << t->name() << endl);
// return PtrtoAny(static_cast<void *>(static_cast<char *>(s)+offset),t);}
return PtrtoAny(Stack_offset<void>(s,offset),t);}
LocalVariable(size_t o,aType tt):offset(o),t(tt) {throwassert(tt);
SHOWVERB(cout << "\n--------new var " << offset << " " << t->name() << endl);
}
};
class LocalVariableFES : public LocalVariable { public:
size_t data;
LocalVariableFES(size_t o,aType tt,const size_t & d)
: LocalVariable(o,tt),data(d) {}
size_t nbitem() const { return data;}
};
template <class U>
class LocalVariablePlus : public LocalVariable { public:
U data;
LocalVariablePlus(size_t o,aType tt,const U & d)
: LocalVariable(o,tt),data(d) {}
};
// global variable bof bof
template<class T> class PValue:public E_F0
{
T * p;
public:
AnyType operator()(Stack ) const { return p;}
PValue(T * pp):p(pp) {}
};
// global variable bof bof
// value througth a pointeur add F.H july 2014
template<class T> class dPValue:public E_F0
{
T * p;
public:
AnyType operator()(Stack ) const { return SetAny<T>(*p);}
dPValue(T * pp):p(pp) {}
};
template<class R> class PPValue:public E_F0
{
R ** p;
public:
AnyType operator()(Stack ) const { return SetAny<R*>(*p);}
PPValue(R ** pp):p(pp) {}
};
template<class R>
Type_Expr CPValue(R & v)
{
throwassert(map_type[typeid(R*).name()]);
return make_pair(map_type[typeid(R*).name()],new PValue<R>(&v));
}
template<class R>
Type_Expr dCPValue(R * v)
{
throwassert(map_type[typeid(R).name()]);
return make_pair(map_type[typeid(R).name()],new dPValue<R>(v));
}
template<class R>
Type_Expr CPPValue(R *& v)
{
throwassert(map_type[typeid(R*).name()]);
return make_pair(map_type[typeid(R*).name()],new PPValue<R>(&v));
}
template<class R >
Type_Expr CConstant(const R & v)
{
throwassert(map_type[typeid(R).name()]);
return make_pair(map_type[typeid(R).name()],new EConstant<R>(v));
}
/// <<CC_F0>> used in [[file:../lglib/lg.ypp::YYSTYPE]]
class CC_F0 {
Expression f;
aType r;
public:
void operator=(const C_F0& c) { f=c.f;r=c.r;;}
void operator=(const AC_F0& a) ; //{ f=new E_Array(a); f= atype<E_Array>();};
void operator=(long ) {f=0;r=0;}
void operator=(const CListOfInst& c);//{ C_FO cc=c;f=cc.f;r=cc.r}
operator C_F0 () const {return C_F0(f,r);}
bool Empty() const {return !f || f->Empty();}
aType left() const {return r;}
// operator const C_F0 &() const {return *this;}
};
/// <<ListOfInst>>
class ListOfInst :
public E_F0mps /*[[E_F0mps]]*/
{
int n;
Expression * list;
int * linenumber;
const int nx;
public:
ListOfInst():n(0),list(0),linenumber(0),nx(10){}
ListOfInst(int nn):n(0),list(0),linenumber(0),nx(nn?nn:10){}
void Add(const C_F0 & ins);
/// <<ListOfInst::operator()>> implemented at [[file:AFunction2.cpp::ListOfInst::operator()]]
AnyType operator()(Stack s) const;
operator aType () const { return n ? (aType) * (list[n-1]) : atype<void>();}
Expression &operator[](int i){return list[i];}
bool empty() const {return n==0;}
int size() const {return n;}
Expression * ptr() const {return list;}
int * nlines() const {return linenumber;}
~ListOfInst(){
cout << " ----- ~ListOfInst " << endl;
if(list) delete [] list;
list=0;
if(linenumber) delete[] linenumber;
linenumber=0;
}
};
/// <<CListOfInst>> used in [[file:../lglib/lg.ypp::YYSTYPE]]
class CListOfInst{
private:
/// class [[ListOfInst]]
ListOfInst * f;
const basicForEachType *r;
public:
void operator=(const CC_F0 &a){
f=new ListOfInst();
if( !a.Empty() ) {
f->Add(a);
r=a.left(); }}
CListOfInst & operator+=(const CC_F0 & a);//{ if( !a.Empty()){ f->Add(a);r=a.left();};return *this;}
operator C_F0 () const { return C_F0(f,r);}
/// <<CListOfInst::eval>> Called by yyparse() at [[file:../lglib/lg.ypp::start_symbol]] to evaluate the
/// complete expression tree when reaching the end of its "start" symbol. It calls ListOfInst::operator()() at
/// [[ListOfInst::operator()]] for its private [[ListOfInst]] pointer #f.
void eval(Stack s) {(*f)(s);}
int size() const {return f->size();}
Expression * ptr() const {return f->ptr();}
int * nlines() const { return f->nlines();}
};
AnyType FWhile(Stack ,E_F0 * test,E_F0 * ins);
AnyType FFor(Stack s ,E_F0 * i0,E_F0 * i1,E_F0 * i2,E_F0 * ins);
AnyType FIf(Stack s ,E_F0 * test,E_F0 * i1,E_F0 * i2,E_F0 * notuse);
AnyType TTry(Stack s ,E_F0 * i0,E_F0 * i1,E_F0 * i2,E_F0 * notuse);
/// <<Global>> Contains all FreeFem++ language keywords. Definition in [[file:global.cpp::Global]], uses
/// [[TableOfIdentifier]]
extern TableOfIdentifier Global;
void ShowType(ostream & );
template<class T>
inline C_F0 to(const C_F0 & a) { return map_type[typeid(T).name()]->CastTo(a);}
/*
inline C_F0 toBool(const C_F0 & a) {return ATYPE(bool)->CastTo(a);}
inline C_F0 toInt(const C_F0 & a) {return ATYPE(int)->CastTo(a);}
inline C_F0 toLong(const C_F0 & a) {return ATYPE(long)->CastTo(a);}
inline C_F0 toDouble(const C_F0 & a) {return ATYPE(double)->CastTo(a);}
inline C_F0 toComplex(const C_F0 & a) {return ATYPE(Complex)->CastTo(a);}
*/
inline C_F0 While(C_F0 test,C_F0 ins) {return C_F0(new E_F0_CFunc2(FWhile,to<bool>(test),ins),0);}
inline C_F0 For(C_F0 i0,C_F0 i1,C_F0 i2,C_F0 ins) {return C_F0(new E_F0_CFunc4(FFor,i0,to<bool>(i1),i2,ins),0);}
inline C_F0 Try(C_F0 i0,C_F0 i1,C_F0 i2) {return C_F0(new E_F0_CFunc4(TTry,i0,i1,i2,0),0);}
inline C_F0 FIf(C_F0 i0,C_F0 i1,C_F0 i2) {return C_F0(new E_F0_CFunc4(FIf,to<bool>(i0),i1,i2,0),0);}
inline C_F0 FIf(C_F0 i0,C_F0 i1) {return C_F0(new E_F0_CFunc4(FIf,to<bool>(i0),i1,0,0),0);}
//inline C_F0 C_F0::PtrValue() const{
// if (!(r && r->un_ptr)) { cerr << "PtrValue: Not a Left value " << *r << endl;CompileError();}
// return C_F0(new E_F0_Func1(r->un_ptr->f,f),r->un_ptr->r);}
/// <<basicAC_F0>>
class basicAC_F0 {
// version de base d'un tableau d'un parametres
// pour les operateurs unaire, binaire, ,
// pas d'allocation
friend class E_Array; // for mapping fonction
protected:
typedef const C_F0 const_C_F0;
int nb;
C_F0 *a;
public:
typedef map<const char *,C_F0,Keyless> maptype ;
typedef maptype::iterator iterator;
typedef maptype::const_iterator const_iterator;
maptype * named_parameter;
basicAC_F0 & operator=(int i) {throwassert(i==0);named_parameter=0,nb=0;return *this;} // pas de parametres
basicAC_F0 & operator=(C_F0 & c) {named_parameter=0;nb=1;a=&c;return *this;}
basicAC_F0 & operator=(pair<int,C_F0*> p) {named_parameter=0;nb=p.first;a=p.second;return *this;}
const C_F0 & operator [] (int i) const {throwassert(a && i<nb);return a[i];}
int size() const {return nb;}
C_F0 * ptr() const {return a;}
C_F0 find(const char * k) const {
assert(k);
if (named_parameter) { const_iterator i=named_parameter->find(k) ;
if (i == named_parameter->end() ) return C_F0();
else return i->second;}
else return C_F0();}
struct name_and_type{
const char * name;
const type_info * type;
} ;
void SetNameParam(int n=0,name_and_type *l=0 , Expression * e=0) const ;
};
/// <<AC_F0>> array of parameters for FF language operators. uses [[basicAC_F0]]
class AC_F0: public basicAC_F0 { // a Array of C_F0
// tableau d'un parametres max 1024 parametres
// avec allocation
const static int MaxSize;
// no constructor in this class (this class is in a union )
public:
AC_F0 & operator=(pair<const char *,const C_F0> p) {
named_parameter=0; a=new C_F0[MaxSize]; nb=0;Add(p.first,p.second);return *this;}
AC_F0 & operator+=(pair<const char *,const C_F0> p) {Add(p.first,p.second);return *this;}
AC_F0 & operator=(long k) {throwassert(k==0);named_parameter=0;a=new C_F0[MaxSize]; nb=0;return *this;}
AC_F0 & operator=(const C_F0& c) {named_parameter=0; a=new C_F0[MaxSize]; nb=0;a[nb++]=c;return *this;}
AC_F0 & operator+=(const C_F0& c) {
if ( ! (a&& nb<MaxSize))
CompileError("Sorry number of parameters > 1024");
a[nb++]=c;return *this;}
AC_F0 & Add(const char * nm,const C_F0 &c) {
if (!named_parameter) named_parameter=new maptype();
iterator i=named_parameter->find(nm);
if(i==named_parameter->end()) named_parameter->insert(make_pair(nm,c));
else {cerr << " the named in the list already exists "<< nm <<endl; CompileError();}
return *this;}
int size() const {return nb;}
const C_F0 & operator [] (int i) const {throwassert(a && i<nb);return a[i];}
void destroy() {
nb=0;
if(named_parameter)
delete named_parameter;
if (a)
delete [] a;
a=0;named_parameter=0;}
};
class basicAC_F0_wa : public basicAC_F0 { public:
basicAC_F0_wa(const C_F0 & e) {
named_parameter=0;
nb=1;
a= new C_F0[nb];
a[0]=e;
}
basicAC_F0_wa(const C_F0 & e,const C_F0 & ee) {
named_parameter=0;
nb=2;
a= new C_F0[nb];
a[0]=e;
a[1]=ee;
}
basicAC_F0_wa(C_F0 e,const basicAC_F0 & b) {
named_parameter=0;
if (b.named_parameter) named_parameter = new maptype(*b.named_parameter);
nb=1+b.size();
a= new C_F0[nb];
a[0]=e;
for (int i=1;i<nb;i++) a[i]=b[i-1];}
~basicAC_F0_wa(){delete [] a;
a=0;
delete named_parameter;
named_parameter=0;}
basicAC_F0_wa(const basicAC_F0 & b) {
named_parameter=0;
if (b.named_parameter) named_parameter = new maptype(*b.named_parameter);
nb=b.size();
a= new C_F0[nb];
for (int i=0;i<nb;i++) a[i]=b[i];}
private:
void operator=(const basicAC_F0 & b);
};
class E_Array :public E_F0 { public:
basicAC_F0_wa *v;// the value
E_Array(const basicAC_F0 & aa) : v(new basicAC_F0_wa(aa)) {throwassert(v);}
AnyType operator()(Stack) const {
cerr << " No evaluation of an E_array" << endl;
throwassert(0);
return Nothing;}
const C_F0 & operator [] (int i) const {throwassert(v );return (*v)[i];}
int size() const {return v->size();}
size_t nbitem() const {return v->size();}
void map(C_F0 (*mapping)(const C_F0 & )) const
{ for (int i=0;i<v->size();i++)
v->a[i]=(*mapping)(v->a[i]);}
virtual bool MeshIndependent() const {
for (int i=0;i<v->size();i++)
if (v->a[i].MeshIndependent()) return false;
return false;
} //
operator aType () const { return atype<void>();}
};
class PlotStream;
class E_Border ;
class E_BorderN :public E_F0mps { public:
const E_Border * b;
int cas;// 0 long , 1, KN_ , 2 : Array // FH april 14 ..
Expression n;
const E_BorderN * next;
static int Cas(C_F0 nn)
{
if( atype<long>()->CastingFrom(nn.left())) return 0;
else if(atype<KN_<long> >()->CastingFrom(nn.left())) return 1;
else if( atype< const E_Array * >()->CastingFrom(nn.left()) )
{
E_Array & a = *dynamic_cast< E_Array *>((Expression) nn);
ffassert(a);
a.map(::to<long>);
// a[i]=CastTo<long>(a[i]);
return 2;
}
else CompileError(" Number of element of a border ( longn , int array, [ ] array ");
return -1; // bug
}
E_BorderN(const E_Border * bb, C_F0 nn,const E_BorderN * nx=0) ;
E_BorderN(const E_BorderN & bb,const E_BorderN * nx)
: b(bb.b),n(bb.n),cas(bb.cas),next(nx)
{
int kk=1;
if(bb.next) {// modif FH. 13/02/2008
const E_BorderN ** pnext = &next;
E_BorderN *pp;
next = bb.next; // copy bb;
for(int step=0;step<2;++step)
{
while (*pnext)
{
kk++;
pp = new E_BorderN(**pnext); // copy
*pnext = pp;
pnext = & pp->next;
}
if(step==0)
*pnext= nx; // copy de nx
}
// cout << " BorderN : nb item : " << kk << " == " << size()<< endl;
}
}
AnyType operator()(Stack) const {
return SetAny<const E_BorderN *>(this);}
operator aType () const { return atype<const E_BorderN *>();}
int size() const { int k=0;for(const E_BorderN *pp=this;pp; pp=pp->next) k++; return k;}
E_BorderN * operator+( const E_BorderN & bb) const
{ throwassert(bb.next==0);
return new E_BorderN(bb,this);}
static C_F0 to(int cas, C_F0 nn)
{
if(cas==0) return ::to<long>(nn);
else if(cas ==1) return ::to<KN_<long> >(nn);
else if(cas == 2) return ::to<E_Array> (nn);
else ffassert(0); // Big bug .. FH ..
}
long Nbseg(Stack stack,int index) const {
if(cas==0) {assert(index==0); return GetAny<long>((*n)(stack));}
else if (cas==1 ) return (GetAny<KN_<long> >((*n)(stack)))(index);
else if (cas==2) {E_Array & a = *dynamic_cast< E_Array *>((Expression) n);assert(a); Expression nn= a[index]; return GetAny<long>((*nn)(stack));}
else return 0;
}
long NbBorder(Stack stack) const {
if(cas==0) return 1;
else if (cas==1 ) return GetAny<KN_<long> >((*n)(stack)).N();
else if (cas==2) return dynamic_cast<const E_Array *>(n)->size();
else return 0;
} //GetAny<long>((*n)(stack));}
double from(Stack stack) const ;//{ return GetAny<double>((*n)(stack));}
double to(Stack stack) const ;//{ return GetAny<double>((*b)(stack));}
long * index(Stack stack) const ;//{ return GetAny<double>((*b)(stack));}
double * var(Stack stack) const ;//{ return GetAny<double*>((*n)(stack));}
void code(Stack stack) const ;
long label()const ;
void Plot(Stack stack) const ;
void SavePlot(Stack stack,PlotStream & plot ) const;
void BoundingBox(Stack stack,double &xmin,double & xmax, double & ymin,double & ymax) const ;
};
class AddBorderOperator: public OneOperator{
typedef const E_BorderN * A;
public:
E_F0 * code(const basicAC_F0 & args) const
{
A a0=dynamic_cast<A>((Expression) args[0]);
A a1=dynamic_cast<A>((Expression) args[1]);
ffassert( a0 && a1);
//ffassert(a1->next==0); // change FH 13/02/2008
return new E_BorderN(*a1,a0);}
AddBorderOperator():
OneOperator(map_type[typeid(A).name()],map_type[typeid(A).name()],map_type[typeid(A).name()])
{pref = 0;}
};
class OneOperator_borderN : public OneOperator {public:
const E_Border * theborder;int cas;
E_F0 * code(const basicAC_F0 & a) const
{ return new E_BorderN(theborder,a[0]);}
OneOperator_borderN(const E_Border * b)
: OneOperator(atype<const E_BorderN *>(),atype<long>()),
theborder(b),cas(0){}
OneOperator_borderN(const E_Border * b,int )
: OneOperator(atype<const E_BorderN *>(),atype<KN_<long> >()),
theborder(b),cas(1){}
OneOperator_borderN(const E_Border * b,int,int )
: OneOperator(atype<const E_BorderN *>(),atype<E_Array >()),
theborder(b),cas(2){}
};
class E_Border :public Polymorphic { public:
static basicAC_F0::name_and_type name_param[] ;
static const int n_name_param =0;
static long Count;
Expression xvar,xfrom,xto,xcode,xindex;
basicAC_F0_wa * tab;
long label;
E_Border(const E_Array * a) :
xvar(0),xfrom(0),xto(0),xcode(0),xindex(0), tab(a? a->v:0) ,label(++Count)
{
assert(tab);
Add("(",new OneOperator_borderN(this));
Add("(",new OneOperator_borderN(this,1));
Add("(",new OneOperator_borderN(this,1,1));
/* A FAIRE pour multy border ****/
}
E_Border(const basicAC_F0 & aa) :
xvar(to<double*>(aa[0])),
xfrom(to<double>(aa[1])),
xto(to<double>(aa[2])),
xcode(aa[aa.size()-1].LeftValue()),
xindex( (aa.size() > 4) ? (Expression) to<long*>(aa[3]) : 0 ),
//xindex( to<long*>(aa[3]) ),
tab(0),
label(++Count)
{
Add("(",new OneOperator_borderN(this));
Add("(",new OneOperator_borderN(this,1));
Add("(",new OneOperator_borderN(this,1,1));
}
AnyType operator()(Stack) const {
return SetAny<const E_Border *>(this);}
double length(Stack ) const { ffassert(0);return 0.0; /* a faire */ }
};
inline E_BorderN::E_BorderN(const E_Border *bb, C_F0 nn,const E_BorderN * nx)
:b(bb),cas(Cas(nn)),n(to(cas,nn) ),next(nx) { /* cout << " -- E_BorderN : cas " << cas << endl; */ throwassert(b);}
inline double E_BorderN::from(Stack stack) const { return b->xfrom ? GetAny<double>((*b->xfrom)(stack)): double(0.0);}
inline double E_BorderN::to(Stack stack) const { return b->xto? GetAny<double>((*b->xto)(stack)): b->length(stack) ;}
inline double * E_BorderN::var(Stack stack) const { return b->xvar ? GetAny<double*>((*b->xvar)(stack)): (double*) 0 ;}
inline long * E_BorderN::index(Stack stack) const { return b->xindex ? GetAny<long*>((*b->xindex)(stack)): (long*) 0 ;}
inline void E_BorderN::code(Stack stack)const { (*b->xcode)(stack);}
inline long E_BorderN::label()const { return b->label;}
inline ArrayOfaType::ArrayOfaType(const basicAC_F0 & aa) : n(aa.size()),t(n ? (n<=4 ? tt : new aType[n]):0),ellipse(false) {
for (int i=0;i<n;i++) t[i]=aa[i].left();}
inline ArrayOfaType::ArrayOfaType(const ArrayOfaType & aa) : n(aa.n),t(n<=4?tt:new aType[n]),ellipse(aa.ellipse) {
for (int i=0;i<n;i++) t[i]=aa.t[i];}
inline C_F0 TableOfIdentifier::Find(const char * name) const {
const_iterator i=m.find(name);
if ( i == m.end()) { return C_F0();}
else return C_F0(i->second);}
inline C_F0 TableOfIdentifier::Find(const char * name,const basicAC_F0 & args) const {
const_iterator i=m.find(name);
if ( i == m.end()) {cerr<<"No operator " << name<<endl;
cerr <<*this << endl;CompileError("TableOfIdentifier::Find");return C_F0();}
else {return C_F0(C_F0(i->second),"(",args);}}
// Attention il y a moralement un bug
// les initialisation x = y ( passe par l'operateur binaire <- dans TheOperators
// les initialisation x(y) ( passe par l'operateur unaire <- du type de x
// -------
inline size_t align8(size_t &off)
{
size_t o= off %8 ;
off += o ? 8-o : 0;
return off;
}
template<class T>
inline Type_Expr NewVariable(aType t,size_t &off)
{
size_t o= align8(off);// align
// off += t->un_ptr_type->size;
// bug off += t->size;
off += t->un_ptr_type->size; // correction 16/09/2003 merci à Richard MICHEL
return Type_Expr(t,new T(o,t));
}
template<class T>
inline Type_Expr NewVariable(aType t,size_t &off,const basicAC_F0 &args)
{
size_t o= align8(off);// align
off += t->un_ptr_type->size;
return Type_Expr(t,new T(o,t,args));
}
template<class T,class U>
inline Type_Expr NewVariable(aType t,size_t &off,const U & data)
{
size_t o= align8(off);// align
off += t->un_ptr_type->size;
return Type_Expr(t,new T(o,t,data));
}
template<class T>
inline C_F0 TableOfIdentifier::NewVar(Key k,aType t,size_t & top,const C_F0 &i)
{
return C_F0(TheOperators,"<-",New(k,NewVariable<T>(t,top)),i);}
template<class T>
inline C_F0 TableOfIdentifier::NewVar(Key k,aType t,size_t & top,const basicAC_F0 &args)
{
// return C_F0(TheOperators,"<-",New(k,NewVariable(t,top)),t->Find("<-",args));}
return C_F0(TheOperators,"<-",basicAC_F0_wa(New(k,NewVariable<T>(t,top)),args));}
template<class T>
inline C_F0 TableOfIdentifier::NewFESpace(Key k,aType t,size_t & top,const basicAC_F0 &args)
{
return C_F0(TheOperators,"<-",basicAC_F0_wa(New(k,NewFESpace<T>(t,top,args)),args));}
template<class T,class U>
inline C_F0 TableOfIdentifier::NewVar(Key k,aType t,size_t & top,const basicAC_F0 &args,const U & data)
{
// return C_F0(TheOperators,"<-",New(k,t->NewVar(top)),t->Find("<-",args));}
return C_F0(TheOperators,"<-",basicAC_F0_wa(New(k,NewVariable<T,U>(t,top,data)),args));}
//inline C_F0 TableOfIdentifier::NewVar(Key k,aType t,size_t & top,const AC_F0 &args,const C_F0& )
// { throwassert(0); return C_F0(TheOperators,"<-",New(k,NewVariable(t,top)),t->Find("<-",args));}
template<class T>
inline C_F0 TableOfIdentifier::NewVar(Key k,aType t,size_t & top)
{ return t->Initialization(New(k,NewVariable<T>(t,top))); }
// save a expression
inline C_F0 TableOfIdentifier::NewID(aType r,Key k, C_F0 & c,size_t &top, bool del )
{ New(k,(make_pair<aType, E_F0 *>(c.left(),c.LeftValue())),del);return 0; }
// { return r->Initialization(New(k,r->SetParam(c,ListOfId(),top),del));}
inline C_F0 TableOfIdentifier::NewID(aType r,Key k, C_F0 & c,const ListOfId & l,size_t & top,bool del)
{ return r->Initialization(New(k,r->SetParam(c,&l,top),del));}
/// <<tables_of_identifier>> allocated at [[file:global.cpp::tables_of_identifier]]
typedef list<TableOfIdentifier *> ListOfTOfId;
extern list<TableOfIdentifier *> tables_of_identifier;
/// [[file:AFunction2.cpp::Find]]
C_F0 Find(const char * name);
inline C_F0 basicForEachType::Find(const char * k) const
{ C_F0 r( ti.Find(k));
//if (r.Empty()) {cerr << " no member " <<k << " in type " << name() << endl; CompileError(" ");}
return r; }
inline C_F0 basicForEachType::Find(const char * k,const basicAC_F0 & args) const {return ti.Find(k,args);}
inline C_F0 basicForEachType::Initialization(const Type_Expr & e) const
{
if(!InitExp)
{
cerr << "Internal Error: No Way to m Initialize this var type " << *this << endl;
CompileError();
}
return C_F0(new E_F0_Func1(InitExp,e.second),this);
}
//inline AnyType Args2(const AnyType &,const AnyType & b) {return b;}
class E_comma : public E_F0 {public:
Expression a,b;
E_comma(Expression aa,Expression bb) : a(aa),b(bb) {}
AnyType operator()(Stack s) const { (*a)(s); return (*b)(s);}
bool MeshIndependent() const {
return a->MeshIndependent() && b->MeshIndependent();}
} ;
inline C_F0::C_F0(const C_F0 & a,const C_F0 & b)
{ // the concatenation
if (a.Empty())
{r=b.r,f=b.f;}
else if (b.Empty())
{r=a.r,f=b.f;}
else
{r=b.r;
f= new E_comma(a.f,b.f);}
}
inline C_F0::C_F0(const C_F0 & e,const char *op, AC_F0 & p)
{ *this=C_F0(e,op,(const basicAC_F0 &) p);
p.destroy();
}
inline C_F0::C_F0(const Polymorphic * poly,const char *op, AC_F0 & p)
{ *this=C_F0(poly,op,(const basicAC_F0 &) p);
p.destroy();
}
inline C_F0::C_F0(const C_F0 & e,const char *op,const basicAC_F0 & p)
{
const Polymorphic * pop=e;
if (pop)
{
//cerr << "poly: " << *pop << endl;
*this=C_F0(pop,op,p);
}
else {
// cerr << *e.r << " : table " << endl;
// e.r->ShowTable(cerr);
C_F0 x=e.r->Find(op);
pop=x;
if(pop)
{
basicAC_F0_wa ep(e,p);
*this=C_F0(pop,"",ep);
}
else
{
cerr << " unknown operator " << op << " on type " << *e.r << endl;
CompileError();
}}
}
inline C_F0::C_F0(const C_F0 & e,const char *op,const C_F0 & a,const C_F0 & b)
{
C_F0 tab[2]={a,b};
basicAC_F0 p;
p=make_pair(2,tab);
*this= C_F0(e,op,p);
}
/// <<C_F0_constructor_char_C_F0_impl>>
inline C_F0::C_F0(const C_F0 & e,const char *op,const C_F0 & ee)
{
const Polymorphic * pop=e;
if (pop)
{
// calls [[C_F0_constructor_binary_decl]]
*this=C_F0(pop,op,e,ee);
}
else {
// cerr << *e.r << " : table " << endl;
// e.r->ShowTable(cerr);
C_F0 x=e.r->Find(op);
pop=x;
if(pop)
*this=C_F0(pop,"",e,ee);
else
{
cerr << " unknown operator " << op << " on type " << *e.r << " " << *ee.r<< endl;
CompileError();
}
}
}
inline C_F0::C_F0(const C_F0 & e,const char *nm)
{
// cerr << " C_F0(const C_F0 & e,const char *item) : " << " " << nm << endl;
C_F0 x=e.r->Find(nm);
const Polymorphic * pop=x;
// cerr << "Find " << *pop << endl;
if (pop)
*this=C_F0(pop,".",e); // unary oper .
else
{
cerr << " No operator ." << nm << " for type " << *e.r << endl;
lgerror("");
}
}
inline E_F0 * C_F0::LeftValue() const {
return f;
}
/*inline Type_Expr C_F0::SetParam(const ListOfId * l,size_t & top) const {
return r->SetParam(*this,l,top);
}*/
/// Declaration of TypeArray
aType TypeArray(aType,aType);
aType TypeArray(aType c,aType b,aType a);
/// Declaration of TypeTemplate
aType TypeTemplate(aType,aType);
void Init_map_type();
/// <<Block>>
class Block { //
static size_t Max(size_t a,size_t b){ return a < b ? b :a;}
typedef const char * Key;
Block * fatherblock;
size_t top,topmax;
TableOfIdentifier table;
ListOfTOfId::iterator itabl;
public:
// list of variable
size_t OffSet(size_t ssize) {
top=align8(top);
size_t r=top; top+=ssize ;topmax=Max(topmax,top);
return r;}
Block(Block * f=0);
/* :fatherblock(f),top(f?f->top:BeginOffset*sizeof(void*)),topmax(top)
{
itabl=tables_of_identifier.insert(tables_of_identifier.begin(),&table);
}*/
size_t size() const { return Max(topmax,top);}
void Add(Key k,Key op,OneOperator *p0)
{ table.Add(k,op,p0);}
template<class T>
C_F0 NewVar(Key k,aType t,const C_F0 &i)
{return table.NewVar<T>(k, t,top,i);}
template<class T>
C_F0 NewFESpace(Key k,aType t,const basicAC_F0 &args)
{return table.NewFESpace<T>(k, t,top,args);}
template<class T>
C_F0 NewVar(Key k,aType t, AC_F0 &args)
{C_F0 r= table.NewVar<T>(k, t,top,args);
args.destroy();
topmax=Max(topmax,top);
return r;}
template<class T>
C_F0 NewVar(Key k,aType t,const basicAC_F0 &args)
{C_F0 r= table.NewVar<T>(k, t,top,args);
topmax=Max(topmax,top);
return r;}
template<class T,class U>
C_F0 NewVar(Key k,aType t,const basicAC_F0 &args,const U & data)
{C_F0 r= table.NewVar<T,U>(k, t,top,args,data);
topmax=Max(topmax,top);
return r;}
// C_F0 NewVar(Key k,aType t,const AC_F0 &args,const C_F0 & f)
// {return table.NewVar(k, t,top,args,f);}
template<class T>
C_F0 NewVar(Key k,aType t)
{C_F0 r= table.NewVar<T>(k, t,top);
topmax=Max(topmax,top);
return r;
}
// C_F0 NewVar(aType t,Key k,C_F0 f)
// {return table.NewVar(t,k, f);}
C_F0 NewID(aType t,Key k,C_F0 f,bool del=true)
{C_F0 r= table.NewID(t,k, f,top,del);
topmax=Max(topmax,top);
return r;}
C_F0 NewID(aType t,Key k,C_F0 f,const ListOfId & l,bool del=true)
{C_F0 r= table.NewID(t,k,f,l,top,del);
topmax=Max(topmax,top);
return r;}
static Block * open(Block *& c);
CC_F0 close(Block *& c); /* {
tables_of_identifier.erase(itabl);
c=fatherblock;
if (fatherblock) {fatherblock->topmax=topmax;
fatherblock->top=top;}
CC_F0 r;
r = table.destroy();
delete this;
return r;}*/
C_F0 Find(const char * k) const {return table.Find(k);}
~Block(); //{}
};
/// <<OneOperator1>> To know the meaning of OneOperator name extensions, see [[OneOperator]]. The template arguments to
/// OneOperator classes are identical to the types of the arguments of the C++ function that is called from the
/// class. The matrices are of type KNM<double>* or KNM<double>** (for left-side expressions, but this is "more
/// tricky") which correspond to a real[int,int] in the edp script.
template<class R,class A=R,class CODE=E_F_F0<R,A> >
class OneOperator1 : public OneOperator {
aType r,t0; // return type
typedef typename CODE::func func; // R (*func)(A) ;
func f;
public:
E_F0 * code(const basicAC_F0 & args) const
{ return new CODE(f,t0->CastTo(args[0]));}
OneOperator1(func ff,int ppref=0):
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()]),
t0( map_type[typeid(A).name()] ), f(ff) {pref=ppref;}
OneOperator1(func ff,aType tt0,int ppref=0):
OneOperator(map_type[typeid(R).name()],tt0),
t0( map_type[typeid(A).name()] ), f(ff) {pref=ppref;}
};
template<class R,class A=R,class B=A,class CODE=E_F_F0F0<R,A,B> >
class OneOperator2 : public OneOperator {
aType r,t0,t1; // return type
typedef typename CODE::func func;
func f;
public:
E_F0 * code(const basicAC_F0 & args) const
{ return new CODE(f,t0->CastTo(args[0]),t1->CastTo(args[1]));}
OneOperator2(func ff):
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()],map_type[typeid(B).name()]),
t0( map_type[typeid(A).name()] ),t1(map_type[typeid(B).name()] ), f(ff) {}
OneOperator2(func ff,aType tt0,aType tt1):
OneOperator(map_type[typeid(R).name()],tt0,tt1),
t0( map_type[typeid(A).name()] ),t1(map_type[typeid(B).name()] ), f(ff) {}
};
/*template<typename C>
struct OneBinaryOperator_Traits {
typedef C::result_type R;
typedef C::first_argument_type A;
typedef C::second_argument_type B;
};*/
template<class A,class B> struct SameType { static const int OK=0;};
template<class A> struct SameType<A,A> { static const int OK=1;};
template<> struct SameType<bool,bool> { static const int OK=10;};
template<> struct SameType<long,long> { static const int OK=20;};
template<> struct SameType<double,double> { static const int OK=30;};
template<> struct SameType<Complex,Complex> { static const int OK=40;};
template<> struct SameType<string*,string*> { static const int OK=50;};
template <typename Arg1, typename Arg2,typename Arg3, class Result>
struct ternary_function
{
typedef Arg1 first_argument_type;
typedef Arg2 second_argument_type;
typedef Arg3 third_argument_type;
typedef Result result_type;
};
template <typename Arg1, typename Arg2,typename Arg3,typename Arg4 , class Result>
struct quad_function
{
typedef Arg1 first_argument_type;
typedef Arg2 second_argument_type;
typedef Arg3 third_argument_type;
typedef Arg4 fourth_argument_type;
typedef Result result_type;
};
template<typename T,class CODE >
class OneTernaryOperator : public OneOperator{
typedef typename T::result_type R;
typedef typename T::first_argument_type A;
typedef typename T::second_argument_type B;
typedef typename T::third_argument_type C;
class Op : public E_F0 {
typedef typename C::result_type Result;
Expression a,b,c;
public:
AnyType operator()(Stack s) const
{return SetAny<R>(static_cast<R>(C::f( GetAny<A>((*a)(s)) ,
GetAny<B>((*b)(s)) ,
GetAny<C>((*c)(s)))));}
Op(Expression aa,Expression bb,Expression cc) : a(aa),b(bb),c(cc) {}
bool MeshIndependent() const {
return a->MeshIndependent() && b->MeshIndependent() && c->MeshIndependent();}
};
public:
E_F0 * code(const basicAC_F0 & args) const
{ return new CODE(t[0]->CastTo(args[0]),t[1]->CastTo(args[1]),t[2]->CastTo(args[2]));}
OneTernaryOperator():
OneOperator(map_type[typeid(R).name()],
map_type[typeid(A).name()],
map_type[typeid(B).name()],
map_type[typeid(C).name()]) {}
};
template<typename T,class CODE >
class OneQuadOperator : public OneOperator{
typedef typename T::result_type R;
typedef typename T::first_argument_type A;
typedef typename T::second_argument_type B;
typedef typename T::third_argument_type C;
typedef typename T::fourth_argument_type D;
class Op : public E_F0 {
typedef typename C::result_type Result;
Expression a,b,c,d;
public:
AnyType operator()(Stack s) const
{return SetAny<R>(static_cast<R>(T::f( GetAny<A>((*a)(s)) ,
GetAny<B>((*b)(s)) ,
GetAny<C>((*c)(s)),
GetAny<D>((*d)(s))
)));}
Op(Expression aa,Expression bb,Expression cc,Expression dd) : a(aa),b(bb),c(cc),d(dd) {}
bool MeshIndependent() const {
return a->MeshIndependent() && b->MeshIndependent() && c->MeshIndependent() && d->MeshIndependent();}
};
public:
E_F0 * code(const basicAC_F0 & args) const
{ return new CODE(t[0]->CastTo(args[0]),t[1]->CastTo(args[1]),t[2]->CastTo(args[2]),t[3]->CastTo(args[3]));}
OneQuadOperator():
OneOperator(map_type[typeid(R).name()],
map_type[typeid(A).name()],
map_type[typeid(B).name()],
map_type[typeid(C).name()],
map_type[typeid(D).name()]
) {}
};
template<typename T >
class OneTernaryOperator3 : public OneOperator{
typedef typename T::result_type R;
typedef typename T::first_argument_type A;
typedef typename T::second_argument_type B;
typedef typename T::third_argument_type C;
class Op : public E_F0 {
// typedef typename C::result_type Result;
Expression a,b,c;
public:
AnyType operator()(Stack s) const
{return SetAny<R>(static_cast<R>(T::f( s, GetAny<A>((*a)(s)) ,
GetAny<B>((*b)(s)) ,
GetAny<C>((*c)(s)))));}
Op(Expression aa,Expression bb,Expression cc) : a(aa),b(bb),c(cc) {}
bool MeshIndependent() const { return a->MeshIndependent() && b->MeshIndependent() && c->MeshIndependent();}
};
public:
E_F0 * code(const basicAC_F0 & args) const
{ return new Op(t[0]->CastTo(args[0]),t[1]->CastTo(args[1]),t[2]->CastTo(args[2]));}
OneTernaryOperator3():
OneOperator(map_type[typeid(R).name()],
map_type[typeid(A).name()],
map_type[typeid(B).name()],
map_type[typeid(C).name()]) {}
};
struct OneBinaryOperatorMI {
static bool MeshIndependent(Expression a,Expression b) { return a->MeshIndependent() && b->MeshIndependent();}
static bool ReadOnly() { return true;}
};
struct OneBinaryOperatorMIWO {
static bool MeshIndependent(Expression a,Expression b) { return a->MeshIndependent() && b->MeshIndependent();}
static bool ReadOnly() { return false;}
};
// ---------- operator with stack ??? for auto delete
template<typename C,class MI=OneBinaryOperatorMI>
class OneBinaryOperator_st : public OneOperator{
typedef typename C::result_type R;
typedef typename C::first_argument_type A;
typedef typename C::second_argument_type B;
aType t0,t1; // type of template modif FH mars 2006
class Op : public E_F0 {
typedef typename C::result_type Result;
Expression a,b;
public:
AnyType operator()(Stack s) const
{return SetAny<R>(static_cast<R>(C::f(s, GetAny<A>((*a)(s)) , GetAny<B>((*b)(s)))));}
Op(Expression aa,Expression bb) : a(aa),b(bb) {}
bool MeshIndependent() const { return MI::MeshIndependent(a,b);}
bool ReadOnly() const { return MI::ReadOnly() ;}
int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n)
{
int rr = find(m);
if (rr) return rr;
int Opa = a->Optimize(l,m,n);
int Opb =b->Optimize(l,m,n);
return insert(new Opt(*this,Opa,Opb),l,m,n);
}
int compare (const E_F0 *t) const {
int rr;
const Op * tt=dynamic_cast<const Op *>(t);
if (tt ) rr = clexico(a->compare(tt->a),b->compare(tt->b));
else rr = E_F0::compare(t);
// cout << "cmp E_F0_Func1 " << rr << endl;
return rr;
} // to give a order in instuction
// int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) const; // build optimisation
virtual ostream & dump(ostream &f) const {
f << "Op<" << typeid(C).name()
<< "> \n\t\t\t( a= "<< *a<< ") \n\t\t\t(b= "<< *b << ") " ;
return f; }
};
// build optimisation
class Opt: public Op { public :
size_t ia,ib;
Opt(const Op &t,size_t iaa,size_t ibb)
: Op(t) ,
ia(iaa),ib(ibb) {}
AnyType operator()(Stack s) const
{
// cout << "Opt2 ::: " << ia << " "<< ib << " f = "
// << GetAny<double>(SetAny<R>(C::f( *static_cast<A *>(static_cast<void*>(static_cast<char *>(s)+ia)) ,
// *static_cast<B *>(static_cast<void*>(static_cast<char *>(s)+ib))))) << endl;
return SetAny<R>( C::f(s, *static_cast<A *>(static_cast<void*>(static_cast<char *>(s)+ia)) ,
*static_cast<B *>(static_cast<void*>(static_cast<char *>(s)+ib)) ) );}
};
// aType r; // return type
public:
E_F0 * code(const basicAC_F0 & args) const
{ //cout << "A op B \n" ;
return new Op(t0->CastTo(args[0]),t1->CastTo(args[1]));}
OneBinaryOperator_st():
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()],map_type[typeid(B).name()]),
t0(t[0]),
t1(t[1])
{pref = SameType<A,B>::OK ;}
OneBinaryOperator_st(aType tt0,aType tt1):
OneOperator(map_type[typeid(R).name()],
tt0 ? tt0 : map_type[typeid(A).name()] ,
tt1 ? tt1 : map_type[typeid(B).name()]),
t0(map_type[typeid(A).name()]),
t1(map_type[typeid(B).name()])
{pref = SameType<A,B>::OK ;}
};
struct evalE_F2 {
static AnyType eval(Stack s,const E_F0 * ab,const E_F0 * a,const E_F0 * b, bool & meshidenp)
{
return ab->E_F0::eval(s,meshidenp);
}
};
//
template<typename C,class MI=OneBinaryOperatorMI,class MIx=evalE_F2 >
class OneBinaryOperator : public OneOperator{
typedef typename C::result_type R;
typedef typename C::first_argument_type A;
typedef typename C::second_argument_type B;
aType t0,t1; // type of template modif FH mars 2006
class Op : public E_F0 {
typedef typename C::first_argument_type A;
typedef typename C::second_argument_type B;
typedef typename C::result_type Result;
Expression a,b;
public:
AnyType operator()(Stack s) const
{return SetAny<R>(static_cast<R>(C::f( GetAny<A>((*a)(s)) , GetAny<B>((*b)(s)))));}
// optim eval MI ... juin 2007 FH ...
AnyType eval(Stack s, bool & meshidenp) const
{return MIx::eval(s,this,a,b,meshidenp);}
// fi optime
Op(Expression aa,Expression bb) : a(aa),b(bb) {}
bool MeshIndependent() const { return MI::MeshIndependent(a,b);}
bool ReadOnly() const { return MI::ReadOnly() ;}
int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n)
{
int rr = find(m);
if (rr) return rr;
int Opa = a->Optimize(l,m,n);
int Opb =b->Optimize(l,m,n);
return insert(new Opt(*this,Opa,Opb),l,m,n);
}
int compare (const E_F0 *t) const {
int rr;
const Op * tt=dynamic_cast<const Op *>(t);
if (tt ) rr = clexico(a->compare(tt->a),b->compare(tt->b));
else rr = E_F0::compare(t);
// cout << "cmp E_F0_Func1 " << rr << endl;
return rr;
} // to give a order in instuction
// int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) const; // build optimisation
virtual ostream & dump(ostream &f) const {
f << "Op<" << typeid(C).name()
<< "> \n\t\t\t( a= "<< *a<< ") \n\t\t\t(b= "<< *b << ") " ;
return f; }
};
// build optimisation
class Opt: public Op { public :
size_t ia,ib;
Opt(const Op &t,size_t iaa,size_t ibb)
: Op(t) ,
ia(iaa),ib(ibb) {}
AnyType operator()(Stack s) const
{
// cout << "Opt2 ::: " << ia << " "<< ib << " f = "
// << GetAny<double>(SetAny<R>(C::f( *static_cast<A *>(static_cast<void*>(static_cast<char *>(s)+ia)) ,
// *static_cast<B *>(static_cast<void*>(static_cast<char *>(s)+ib))))) << endl;
return SetAny<R>( C::f( *static_cast<A *>(static_cast<void*>(static_cast<char *>(s)+ia)) ,
*static_cast<B *>(static_cast<void*>(static_cast<char *>(s)+ib)) ) );}
};
// aType r; // return type
public:
E_F0 * code(const basicAC_F0 & args) const
{ //cout << "A op B \n" ;
if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new Op(t0->CastTo(args[0]),t1->CastTo(args[1]));}
OneBinaryOperator():
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()],map_type[typeid(B).name()]),
t0(t[0]),
t1(t[1])
{pref = SameType<A,B>::OK ;}
OneBinaryOperator(aType tt0,aType tt1):
OneOperator(map_type[typeid(R).name()],
tt0 ? tt0 : map_type[typeid(A).name()] ,
tt1 ? tt1 : map_type[typeid(B).name()]),
t0(map_type[typeid(A).name()]),
t1(map_type[typeid(B).name()])
{pref = SameType<A,B>::OK ;}
};
//-------------
template<typename R>
class Operator_Aritm_If : public OneOperator{
typedef bool A;
typedef R B;
typedef R C;
class Op : public E_F0 {
typedef R Result;
Expression a,b,c;
public:
AnyType operator()(Stack s) const
{
bool ok = GetAny<bool>((*a)(s)) ;
R r ;
if( ok) r=GetAny<B>((*b)(s)) ;
else r =GetAny<C>((*c)(s)) ;
return SetAny<R>(r);// static_cast<R>( ? GetAny<B>((*b)(s)) : GetAny<C>((*c)(s)) ));
}
Op(Expression aa,Expression bb,Expression cc) : a(aa),b(bb),c(cc){}
bool MeshIndependent() const { return a->MeshIndependent() && b->MeshIndependent() &&b->MeshIndependent() ;}
int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n)
{
int rr = find(m);
if (rr) return rr;
int Opa = a->Optimize(l,m,n);
int Opb =b->Optimize(l,m,n);
int Opc =c->Optimize(l,m,n);
return insert(new Opt(*this,Opa,Opb,Opc),l,m,n);
}
int compare (const E_F0 *t) const {
int rr;
const Op * tt=dynamic_cast<const Op *>(t);
if (tt ) rr = clexico(a->compare(tt->a),b->compare(tt->b),c->compare(tt->c));
else rr = E_F0::compare(t);
// cout << "cmp E_F0_Func1 " << rr << endl;
return rr;
} // to give a order in instuction
// int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) const; // build optimisation
virtual ostream & dump(ostream &f) const {
f << "Op<" << typeid(C).name()
<< "> \n\t\t\t( a= "<< *a<< ") \n\t\t\t(b= "<< *b << ") " ;
return f; }
};
// build optimisation
class Opt: public Op { public :
size_t ia,ib,ic;
Opt(const Op &t,size_t iaa,size_t ibb,size_t icc)
: Op(t) ,
ia(iaa),ib(ibb),ic(icc) {}
AnyType operator()(Stack s) const
{
// cout << "Opt2 ::: " << ia << " "<< ib << " f = "
// << GetAny<double>(SetAny<R>(C::f( *static_cast<A *>(static_cast<void*>(static_cast<char *>(s)+ia)) ,
// *static_cast<B *>(static_cast<void*>(static_cast<char *>(s)+ib))))) << endl;
return SetAny<R>(
static_cast<R> (
*static_cast<bool *>(static_cast<void*>(static_cast<char *>(s)+ia)) ?
*static_cast<B *>(static_cast<void*>(static_cast<char *>(s)+ib)) :
*static_cast<C *>(static_cast<void*>(static_cast<char *>(s)+ic)) ) );}
};
// aType r; // return type
public:
E_F0 * code(const basicAC_F0 & args) const
{ //cout << "A op B \n" ;
if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new Op(t[0]->CastTo(args[0]),t[1]->CastTo(args[1]),t[2]->CastTo(args[2]));}
Operator_Aritm_If():
OneOperator(map_type[typeid(R).name()],map_type[typeid(bool).name()],map_type[typeid(B).name()],map_type[typeid(B).name()])
{pref = SameType<B,B>::OK ;}
};
/* essai d'unification des classes
template<class R,class A,R ff(A),class AA=A>
struct F_1 : unary_function<AA,R>,public E_F0 {
AnyType operator()(Stack s) const
{ return SetAny<R>( ff(GetAny<A>((*a)(s)))) ;}
};
template<class C>
class bUnary_Op : public C { public:
Expression a;
public:
bUnary_Op(Expression aa) : a(aa) {}
int compare (const E_F0 *t) const {
int rr;
const bUnary_Op * tt=dynamic_cast<const bUnary_Op *>(t);
if (tt) rr = a->compare(tt->a);
else rr = E_F0::compare(t);
// cout << "cmp E_F0_Func1 " << rr << endl;
return rr;
} // to give a order in instuction
bool EvaluableWithOutStack() const {return a->EvaluableWithOutStack();} //
bool MeshIndependent() const {return a->MeshIndependent();} //
// int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) const; // build optimisation
virtual ostream & dump(ostream &f) const {
f << "Op1<" << typeid(C).name()
<< "> \n\t\t\t( a= "<< *a<< ") " ;
return f; }
};
*/
template<class C>
class Unary_Op : public E_F0 { public:
typedef typename C::result_type R;
typedef typename C::argument_type A;
Expression a;
public:
AnyType operator()(Stack s) const
{ return SetAny<R>( C::f(GetAny<A>((*a)(s)))) ;}
Unary_Op(Expression aa) : a(aa) {}
int compare (const E_F0 *t) const {
int rr;
const Unary_Op * tt=dynamic_cast<const Unary_Op *>(t);
if (tt) rr = a->compare(tt->a);
else rr = E_F0::compare(t);
// cout << "cmp E_F0_Func1 " << rr << endl;
return rr;
} // to give a order in instuction
bool EvaluableWithOutStack() const {return a->EvaluableWithOutStack();} //
bool MeshIndependent() const {return a->MeshIndependent();} //
// int Optimize(deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n) const; // build optimisation
virtual ostream & dump(ostream &f) const {
f << "Op1<" << typeid(C).name()
<< "> \n\t\t\t( a= "<< *a<< ") " ;
return f; }
};
template<class C,class Op=Unary_Op<C> >
class OneUnaryOperator : public OneOperator{
typedef typename C::result_type R;
typedef typename C::argument_type A;
// aType r; // return type
aType tA;
public:
E_F0 * code(const basicAC_F0 & args) const
{ if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new Op(tA->CastTo(args[0]));}
OneUnaryOperator(aType tt0=map_type[typeid(A).name()]):
OneOperator(map_type[typeid(R).name()],tt0),
tA(map_type[typeid(A).name()])
{}
};
template<class R,class A=R,class CODE=E_F_F0s_<R,A> >
class OneOperator1s_ : public OneOperator {
aType r; // return type
typedef R (*func)(Stack stack, const A &) ;
func f;
public:
E_F0 * code(const basicAC_F0 & args) const
{ if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new CODE(f,t[0]->CastTo(args[0]));}
OneOperator1s_(func ff):
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()]),f(ff){}
};
template<class R,class A=R,class CODE=E_F_F0_<R,A> >
class OneOperator1_ : public OneOperator {
aType r,t0; // return type
typedef R (*func)(const A &) ;
func f;
public:
E_F0 * code(const basicAC_F0 & args) const
{
if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new CODE(f,t[0]->CastTo(args[0]));}
OneOperator1_(func ff,int ppref=0):
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()]),t0( map_type[typeid(A).name()] ),f(ff){pref=ppref;}
OneOperator1_(func ff,aType tt0,int ppref=0):
OneOperator(map_type[typeid(R).name()],tt0),
t0( map_type[typeid(A).name()]), f(ff) {pref=ppref;}
};
template<class R,class A,class B,class E> class E_F_F0F0_;
template<class R,class A=R,class B=A,class CODE=E_F_F0F0_<R,A,B,E_F0> >
class OneOperator2_ : public OneOperator {
aType r,t0,t1; // return type type de f, f(t1, t2)
typedef typename CODE::func func;
func f;
public:
E_F0 * code(const basicAC_F0 & args) const
{
if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new CODE(f,t0->CastTo(args[0]),t1->CastTo(args[1]));}
OneOperator2_(func ff):
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()],map_type[typeid(B).name()]),
t0( map_type[typeid(A).name()] ),t1(map_type[typeid(B).name()] ), f(ff) {}
OneOperator2_(int ppref,func ff):
OneOperator(map_type[typeid(R).name()],map_type[typeid(A).name()],map_type[typeid(B).name()]),
t0( map_type[typeid(A).name()] ),t1(map_type[typeid(B).name()] ), f(ff) {pref=ppref;}
OneOperator2_(func ff,aType tt0,aType tt1):
OneOperator(map_type[typeid(R).name()],tt0,tt1),
t0( map_type[typeid(A).name()] ),t1(map_type[typeid(B).name()] ), f(ff) {}
};
template<class R,class A=R,class B=A,class C=B,class CODE=E_F_F0F0F0_<R,A,B,C,E_F0> >
class OneOperator3_ : public OneOperator {
// aType r; // return type
aType tA,tB,tC; // type of template modif FH mars 2007
typedef typename CODE::func func;
func f;
public:
E_F0 * code(const basicAC_F0 & args) const
{
if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new CODE(f,tA->CastTo(args[0]),tB->CastTo(args[1]),tC->CastTo(args[2]));}
OneOperator3_(func ff,
aType tt0=map_type[typeid(A).name()],
aType tt1=map_type[typeid(B).name()],
aType tt2=map_type[typeid(C).name()])
: OneOperator(map_type[typeid(R).name()],tt0,tt1,tt2),
tA(map_type[typeid(A).name()]),
tB(map_type[typeid(B).name()]),
tC(map_type[typeid(C).name()]),
f(ff){}
OneOperator3_(int ppref,func ff,
aType tt0=map_type[typeid(A).name()],
aType tt1=map_type[typeid(B).name()],
aType tt2=map_type[typeid(C).name()])
: OneOperator(map_type[typeid(R).name()],tt0,tt1,tt2),
tA(map_type[typeid(A).name()]),
tB(map_type[typeid(B).name()]),
tC(map_type[typeid(C).name()]),
f(ff) {pref=ppref;}
};
// <<OneOperatorCode>> utilise [[E_F0]]. la class code doit contenir
/*
class CODE: public E_F0 {
typedef ... func .. ;
typedef .. R;
static ArrayOfaType typeargs(); // the list of type de l'operateur of the args
typedef ... R; // return type
}
*/
template<class CODE,int ppref=0>
class OneOperatorCode : public OneOperator {
public:
E_F0 * code(const basicAC_F0 & args) const { return CODE::f(args);}
OneOperatorCode(): OneOperator(atype<typename CODE::Result>(),CODE::typeargs()) {pref=ppref;}
OneOperatorCode(aType rr,const ArrayOfaType & l): OneOperator(rr,l) {pref=ppref;}
OneOperatorCode(aType rr,aType a): OneOperator(rr,a) {pref=ppref;}
OneOperatorCode(aType rr,aType a,aType b): OneOperator(rr,a,b) {pref=ppref;}
OneOperatorCode(aType rr,aType a,aType b,aType c): OneOperator(rr,a,b,c) {pref=ppref;}
};
template<class A,class B> struct binary_trait{ typedef A R ;};
template<> struct binary_trait<int,double> { typedef double R;};
template<> struct binary_trait<long,double> { typedef double R;};
template<> struct binary_trait<int,complex<double> > { typedef complex<double> R;};
template<> struct binary_trait<long,complex<double> > { typedef complex<double> R;};
template<> struct binary_trait<double,complex<double> > { typedef complex<double> R ;};
template<class A> struct binary_trait<A,string* > { typedef string* R ;};
// 1 variable pour les operation de cast
class E_F1_funcT_Type: public OneOperator{ public:
// const basicForEachType *r,*a;
Function1 f;
E_F0 * code(const basicAC_F0 & args) const {
if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new E_F0_Func1(f,args[0]);}
E_F1_funcT_Type(const basicForEachType *rr,const basicForEachType *aa,Function1 ff)
: OneOperator(rr,aa), f(ff) {}
//: r(rr),a(aa),f(ff) {}
// friend ostream & operator<<(ostream & f,const E_F1_funcT_Type & e) { f << *e.a << " -> " << *e.r ;return f;}
};
template<class R,class A>
class E_F1_funcT :public E_F1_funcT_Type{ public:
E_F1_funcT(Function1 ff) : E_F1_funcT_Type(map_type[typeid(R).name()],map_type[typeid(A).name()],ff){}
E_F1_funcT(aType rr,aType a,Function1 ff) : E_F1_funcT_Type(rr,a,ff){}
};
template<class T,class PT>
ForEachTypePtr<T,PT>::ForEachTypePtr():
basicForEachType(typeid(PT),sizeof(PT),
// new E_F1_funcT<T,T*>(UnRef<T>),atype<T>(),
new E_F1_funcT_Type(atype<T>(),this,UnRef<T,PT>),atype<T>(),
::Initialize<T>,::Delete<T>){}
template<class T,class PT>
ForEachTypePtr<T,PT>::ForEachTypePtr(Function1 init,Function1 dl,Function1 onreturn):
basicForEachType(typeid(PT),sizeof(PT),
// new E_F1_funcT<T,T*>(UnRef<T>),atype<T>(),
new E_F1_funcT_Type(atype<T>(),this,UnRef<T,PT>),atype<T>(),
init,
dl , onreturn ){}
template<class T,class PT>
ForEachTypePtr<T,PT>::ForEachTypePtr(Function1 dl):
basicForEachType(typeid(PT),sizeof(PT),
new E_F1_funcT_Type(atype<T>(),this,UnRef<T,PT>),atype<T>(),
::Initialize<T>,dl){}
template<class T>
ForEachTypePtr<T*,T**>::ForEachTypePtr(T* unused,Function1 OOnReturn):
basicForEachType(typeid(T**),sizeof(T**),
// new E_F1_funcT<T*,T**>(UnRef<T*>),atype<T*>(),
new E_F1_funcT_Type(atype<T*>(),this,UnRef<T*>),atype<T*>(),
::InitializePtr<T*>,::DestroyPtr<T*>,OOnReturn){}
template<class T>
ForEachTypePtr<T*,T**>::ForEachTypePtr(Function1 init,Function1 dl,Function1 onreturn):
basicForEachType(typeid(T**),sizeof(T**),
// new E_F1_funcT<T*,T**>(UnRef<T*>),atype<T*>(),
new E_F1_funcT_Type(atype<T*>(),this,UnRef<T*>),atype<T*>(),
init ,
dl ,
onreturn){}
template<class T>
ForEachTypePtr<T*,T**>::ForEachTypePtr(Function1 dl):
basicForEachType(typeid(T**),sizeof(T**),
// new E_F1_funcT<T*,T**>(UnRef<T*>),atype<T*>(),
new E_F1_funcT_Type(atype<T*>(),this,UnRef<T*>),atype<T*>(),
::InitializePtr<T*>,dl){}
/* class FuncForEachType : public basicForEachType {public:
FuncForEachType(const basicForEachType * t);
const basicForEachType * rtype;
};
*/
/*
inline basicForEachType::basicForEachType(const type_info & k, const type_info & kf,
const size_t s,
const E_F1_funcT_Type * p,
basicForEachType *rr,
Function1 iv,Function1 id)
: ktype(&k),ktypefunc(&kf),
size(s),
un_ptr(p),
un_ptr_type(rr?rr:this),
InitExp(iv),
destroy(id) ,
funct_type(new FuncForEachType(this)){}
*/
inline C_F0 & operator+=(C_F0 & a,C_F0 &b)
{
C_F0 r = C_F0(TheOperators,"+",a,b);
a=r;
return a;
}
template<typename T,typename PT>
void Dcl_TypeandPtr_ (Function1 i,Function1 d,Function1 pi,Function1 pd,Function1 OnReturn=0,Function1 pOnReturn=0)
{
map_type[typeid(T).name()] = new ForEachType<T>(i,d,OnReturn);
map_type[typeid(PT).name()] = new ForEachTypePtr<T,PT>(pi,pd,pOnReturn);
}
template<class T>
void Dcl_TypeandPtr (Function1 i,Function1 d,Function1 pi,Function1 pd,Function1 OnReturn=0,Function1 pOnReturn=0)
{
map_type[typeid(T).name()] = new ForEachType<T>(i,d,OnReturn);
map_type[typeid(T*).name()] = new ForEachTypePtr<T>(pi,pd,pOnReturn);
}
template<class T>
void Dcl_TypeandPtr (Function1 pi,Function1 pd)
{
map_type[typeid(T).name()] = new ForEachType<T>();
map_type[typeid(T*).name()] = new ForEachTypePtr<T>(pi,pd);
}
template<class T>
void Dcl_TypeandPtr (Function1 pd)
{
map_type[typeid(T).name()] = new ForEachType<T>();
map_type[typeid(T*).name()] = new ForEachTypePtr<T>(pd);
}
template<class T>
void Dcl_TypeandPtr ()
{
map_type[typeid(T).name()] = new ForEachType<T>();
map_type[typeid(T*).name()] = new ForEachTypePtr<T>();
}
template<class T>
aType Dcl_Type (Function1 iv=0,Function1 id=0,Function1 Onreturn=0)
{
if (sizeof(T) >sizeof(AnyData)) {
cerr << " the type " << typeid(T).name() << " is too large " << sizeof(AnyData) << endl;
throwassert(sizeof(T) <=sizeof(AnyData));}
return map_type[typeid(T).name()] = new ForEachType<T>(iv,id,Onreturn);
}
template<class T>
void Add(const char * k,const char * op,OneOperator *p0,OneOperator *p1=0,
OneOperator *p2=0,OneOperator *p3=0,OneOperator *p4=0,
OneOperator *p5=0,OneOperator *p6=0)
{atype<T>()->Add(k,op,p0,p1,p2,p3,p4,p5,p6);}
inline C_F0 operator *(const C_F0 &a,const C_F0 &b)
{
return a==*pOne ? b : ( b ==*pOne ? a : C_F0(TheOperators,"*",a,b)) ;}
inline C_F0 operator+(const C_F0 &a,const C_F0 &b){ return C_F0(TheOperators,"+",a,b);}
inline C_F0 operator-(const C_F0 &a,const C_F0 &b){ return C_F0(TheOperators,"-",a,b);}
/// <<C_F0_operator_plusequals>>
inline C_F0 &operator +=(C_F0 &a,const C_F0 &b)
{
C_F0 r=C_F0(TheOperators,"+",a,b);
a=r;
return a;}
//inline bool CC_F0::Empty() const {return !f || f->Empty();}
inline void CC_F0::operator=(const CListOfInst& c)
{ C_F0 cc=c;f=cc.f;r=cc.r;}
inline CListOfInst & CListOfInst::operator+=(const CC_F0 & a)
{ if( !a.Empty()){ f->Add(a);r=a.left();};return *this;}
inline Type_Expr basicForEachType::SetParam(const C_F0 & ,const ListOfId * ,size_t & ) const
{ cerr << " int basicForEachType " << name() << endl;
InternalError("basicForEachType::SetParam non defined"); }//return make_pair<aType,const E_F0 *>(c.left(),c.LeftValue());}
/*
// --- pour les cast ------
class OneOpCast: public OneOperator {
typedef const E_F1_funcT_Type * CastFunc;
CastFunc f;
public:
E_F0 * code(const basicAC_F0 & args) const { return new E_F0_Func1(f->f,args[0]);}
OneOpCast(CastFunc ff): OneOperator(ff->r,ff->a),f(ff){}
};
*/
//
inline bool basicForEachType::CastingFrom(aType t) const {
throwassert( t);
if ( t == this) return true;
else if( t == type_C_F0 ) return true; // FH do work .... 09 / 2012 (use of ellispe ...)
return casting->FindSameR(ArrayOfaType(t,false));
}
inline void CerrCast(const pair<const basicForEachType*,const E_F1_funcT_Type *> & i)
{
cerr << "\t" << *i.first << ":" << i.second << endl;
}
inline C_F0 basicForEachType::CastTo(const C_F0 & e) const
{
throwassert(this);
aType t = e.left();
if (this== t) return e;
C_F0 ce=e;
basicAC_F0 at;
at=ce;
OneOperator * opcast =casting->FindSameR(ArrayOfaType(t,false));
if ( opcast )
if ( *opcast == at ) // left value
return C_F0(opcast->code(at),this);
else { // rigth value
aType tr = e.right();
ce = C_F0(e.RightValue(),tr);
at = ce;
return C_F0(opcast->code(at),this); }
else
{ cerr << "Impossible to cast " << *e.left() << " in " << *this << endl;
if (casting) casting->Show(cerr) ;
CompileError();}
return C_F0();
}
inline Expression basicForEachType::RightValueExpr(Expression f) const
{
if (un_ptr) return new E_F0_Func1(un_ptr->f,f);
else return f;
}
inline void CompileError(string msg,aType r){
string m= r ? msg + " type: " + r->name() : msg ;
lgerror(m.c_str());
}
inline void ExecError(string msg){
// cerr << "Fatal ExecError: " << msg << endl;
throw(ErrorExec(msg.c_str(),1));
}
const Function1 NotReturnOfthisType = reinterpret_cast<Function1>(1);
inline Expression basicForEachType::OnReturn(Expression f) const {
if(!DoOnReturn) return f;
else if(DoOnReturn== NotReturnOfthisType )
CompileError("Problem when returning this type (sorry work in progress FH!) ", this);
else return new E_F0_Func1(DoOnReturn,f);
return 0;
}
inline void CC_F0::operator=(const AC_F0& a) { f=new E_Array(a); r= atype<E_Array>();};
inline UnId::UnId(const char * idd,const C_F0 & ee,aType rr=0,bool reff=false)
:id(idd),r(rr),e(ee),array(0),re(ee.left()) ,ref(reff){}
class E_exception : public exception { public:
enum CODE_exception { UNKNOWN,e_break,e_continue,e_return} ;
CODE_exception code;
AnyType r; // for return
public:
E_exception(CODE_exception c,AnyType rr=Nothing) : code(c),r(rr) {}
const int type() {return code;}
virtual const char * what() const throw() { return "E_exception (break,continue or return) "; }
~E_exception() throw() {}
};
class E_throw : public E_F0mps { public:
E_exception::CODE_exception kind;
Expression ret; // return value
E_throw(E_exception::CODE_exception c,Expression e=0) :kind(c),ret(e) {}
AnyType operator()(Stack s) const {
(ret ? throw(E_exception(kind,(*ret)(s)))
: throw(E_exception(kind)));
return Nothing; }
operator aType () const { return atype<void>();}
} ;
class E_block : public E_F0mps { public:
const int n;
Expression * code;
int * linenumber;
Expression clean;
E_block(CListOfInst l,C_F0 c)
: n(l.size()),code(l.ptr()),linenumber(l.nlines()),clean(c) {}
E_block( C_F0 l,C_F0 c)
: n(1),code(new Expression),clean(c) { code[0]=l;}
AnyType operator()(Stack s) const ;
operator aType () const { return atype<void>();}
};
class Routine;
class E_Routine : public E_F0mps { public:
Expression code;
Expression clean;
aType rt;
int nbparam;
Expression * param;
const char * name;
E_Routine(const Routine * routine,const basicAC_F0 & args);
AnyType operator()(Stack s) const;
~E_Routine() ;//{ delete [] param;} modif del for windows
private:
E_Routine(const E_Routine &);
void operator=(const E_Routine &);
operator aType () const{ return rt;}
};
/// <<Routine>> used in [[file:../lglib/lg.ypp::YYSTYPE]]
class Routine: public OneOperator{ public:
size_t offset;
aType tfunc,tret;
const char * name;
const ListOfId param;
Block * currentblock;
Expression ins;
Expression clean;
E_F0 * code(const basicAC_F0 & args) const ;
Routine(aType tf,aType tr,const char * iden, ListOfId *l,Block * & cb);
Block * Set(C_F0 instr) ;
};
class TypeLineFunction: public ForEachType<C_F0> {
public:
TypeLineFunction() : ForEachType<C_F0>(0,0) {}
void SetArgs(const ListOfId *lid) const {
if (lid) CompileError("No Argument in line function");
}
Type_Expr SetParam(const C_F0 & c,const ListOfId *l,size_t & top) const
{ return Type_Expr(c.left(),c.LeftValue()); }
C_F0 Initialization(const Type_Expr & ) const
{ return C_F0(); } // nothing to initialize
};
class E_F0_Optimize : public E_F0 {
deque<pair<Expression,int> > l;
// mutable deque<bool> var;
MapOfE_F0 m;
int NBbitem;
int ret;
public:
E_F0_Optimize(deque<pair<Expression,int> > &ll,MapOfE_F0 & mm,int rett) :
l(ll),m(mm),NBbitem(1),ret(rett) {}
int sizevar() const {return l.size();}
AnyType eval(Stack s,int notinit,bool * unvar) const {
int k= l.size(),kk=0;
if(notinit ==0)
{
//var.resize(k);
for (int i=0;i<k;i++)
{ size_t offset = l[i].second;
unvar[i]=true;
*Stack_offset<AnyType>(s,offset) = l[i].first->eval(s, unvar[i]);
if( unvar[i]) kk++;
}
if (verbosity/100 && verbosity % 10 == 2)
cout << "E_F0_Optimize nb MI exp: " << kk << " / " << k << endl;
}
else
for (int i=0;i<k;i++)
{ size_t offset = l[i].second;
if(!unvar[i])
*Stack_offset<AnyType>(s,offset) = (*l[i].first)(s);
//*static_cast<AnyType *>(static_cast<void *>((char*)s+offset))= (*l[i].first)(s); // FH NEWSTACK
// cout << " E_F0_Optimize " << offset << " " << *static_cast<double *>(static_cast<void *>((char*)s+offset)) << endl; ;
}
// return *static_cast<AnyType *>(static_cast<void *>((char*)s+ret));
return *Stack_offset<AnyType>(s,ret); // FH NEWSTACK
}
virtual AnyType operator()(Stack s) const {
int k= l.size();
for (int i=0;i<k;i++)
{ size_t offset = l[i].second;
*Stack_offset<AnyType>(s,offset) = (*l[i].first)(s);
//*static_cast<AnyType *>(static_cast<void *>((char*)s+offset))= (*l[i].first)(s); // FH NEWSTACK
// cout << " E_F0_Optimize " << offset << " " << *static_cast<double *>(static_cast<void *>((char*)s+offset)) << endl; ;
}
// return *static_cast<AnyType *>(static_cast<void *>((char*)s+ret));
return *Stack_offset<AnyType>(s,ret); // FH NEWSTACK
}
virtual bool Empty() const {return l.size(); }
// virtual E_F0 * destroy(Stack ) const {return 0;}
// virtual const E_F0 * Parameter(Stack ) const {return this;}
virtual size_t nbitem() const { return NBbitem;}
virtual bool EvaluableWithOutStack() const {return false;} //
virtual bool MeshIndependent() const {return false;} //
virtual E_F0 * right_E_F0() const { return 0;}
virtual ~E_F0_Optimize() {}
// virtual int compare (const E_F0 *t) const { return t-this;} // to give a order in instuction
virtual operator aType () const { return *(l.back().first);} // the type of the expression
};
inline int E_F0::find(const MapOfE_F0 & m) { // exp
// cout << " ffff :" ;
MapOfE_F0::const_iterator i= m.find(this);
if(i != m.end()) {
if( (verbosity / 100)% 10 == 1)
{
cout << "\n find : ";
cout << i->second << " mi=" ;
cout << MeshIndependent() << " " ;
cout << typeid(*this).name() ;
cout << " cmp = " << compare(i->first) ;
cout << " " << i->first->compare(this) << " ";
dump(cout);
}
assert( compare(i->first) == 0);
}
return i == m.end() ? 0 : i->second ;
}
inline int E_F0::insert(Expression opt,deque<pair<Expression,int> > &l,MapOfE_F0 & m, size_t & n)
{
int rr=align8(n);
pair<Expression,int> p(this,rr);
if( (verbosity / 100)% 10 == 1)
cout << " -- insert opt " << n << " " << *this << endl;
n += sizeof(AnyType);
l.push_back(make_pair<Expression,int>((Expression)opt,(int)rr));
m.insert(p);
return rr;
}
extern vector<pair<const E_Routine*,int> > * debugstack;
struct NothingType { // a type to do nothing
NothingType() {};
};
extern basicForEachType * typevarreal, * typevarcomplex; // type of real and complex variable
void initArrayOperators();
void initArrayDCL();
void ClearMem();
// <<OneOperator_code2>>
inline C_F0 OneOperator::code2(const basicAC_F0 &a) const {return C_F0(code(a),r);}
template<class R>
class OneOperator0 : public OneOperator {public:
class E_F0_F :public E_F0 { public:
typedef R (*func)( ) ;
func f;
E_F0_F(func ff) : f(ff) {}
AnyType operator()(Stack ) const {return SetAny<R>( f()) ;}
operator aType () const { return atype<R>();}
};
// aType r; // return type
typedef R (*func)() ;
func f;
public:
E_F0 * code(const basicAC_F0 & args) const
{
if ( args.named_parameter && !args.named_parameter->empty() )
CompileError( " They are used Named parameter ");
return new E_F0_F(f);}
OneOperator0(func ff): OneOperator(map_type[typeid(R).name()]),f(ff){}
};
template<class R >
Type_Expr CVariable(R (*ff)() )
{
throwassert(map_type[typeid(R).name()]);
return make_pair(map_type[typeid(R).name()],new typename OneOperator0<R>::E_F0_F(ff));
}
void InitLoop();
C_F0 ForAll(Block *,ListOfId * id,C_F0 m);
C_F0 ForAll(C_F0 loop,C_F0 inst,C_F0 end);
class PolymorphicLoop:public Polymorphic {
public:
typedef Expression Exp;
C_F0 t;
Exp v,i,j;
PolymorphicLoop(C_F0 tt,AC_F0 &args) : t(tt),v(0),i(0), j(0){
if(verbosity>1000)
cout << "PolymorphicLoop args " << args.size() << endl;
if(args.size()>1) v=args[1];
if(args.size()>2) i=args[2];
if(args.size()>3) j=args[3];
if(verbosity>1000)
cout <<" v " << v << " i=" << i << " j=" << j << endl;
}
AnyType ftab(Stack s) const { return (*(Expression) t)(s);}
AnyType fv(Stack s) const { return v ? (*v)(s): Nothing ;}
AnyType fi(Stack s) const { return i ? (*i)(s): Nothing ;}
AnyType fj(Stack s) const { return j ? (*j)(s): Nothing ;}
};
class ForAllLoopOpBase : public E_F0mps { public:
Expression et,ecode,efin;
const PolymorphicLoop *epl;
ForAllLoopOpBase( basicForEachType * ret,const basicAC_F0 & args)
: et(ret->CastTo(args[0])), ecode(args[2]),efin(0),epl(0)
{
if(args.size() > 3) efin=args[3];
epl = dynamic_cast<const PolymorphicLoop *>((Expression) args[1]);
assert(epl!=0);
}
AnyType tab(Stack s) const { return (*et)(s);}
AnyType v(Stack s) const { return epl->fv(s);}
AnyType i(Stack s) const { return epl->fi(s);}
AnyType j(Stack s) const { return epl->fj(s);}
void code(Stack s) const { (*ecode)(s) ;}
void end(Stack s) const { if(efin) (*efin)(s);}
};
template<class F>
class ForAllLoop : public OneOperator {public:
typedef typename F::Tab T;
class ForAllLoopOp : public ForAllLoopOpBase { public:
F f;
ForAllLoopOp(const basicAC_F0 & args):ForAllLoopOpBase(atype<T>(),args),f((const ForAllLoopOpBase*)this) {}
AnyType operator()(Stack s) const { return this->f.f(s);}
};
E_F0 * code(const basicAC_F0 & args) const
{
return new ForAllLoopOp(args);
}
ForAllLoop() :OneOperator(atype<NothingType>(),atype<T>(),atype<PolymorphicLoop*>()){
this->ellipse=true;
}
};
#endif
|