/usr/lib/gcc-cross/hppa-linux-gnu/8/plugin/include/poly-int.h is in gcc-8-plugin-dev-hppa-linux-gnu 8-20180414-1ubuntu2cross1.
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 | /* Polynomial integer classes.
Copyright (C) 2014-2018 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
/* This file provides a representation of sizes and offsets whose exact
values depend on certain runtime properties. The motivating example
is the Arm SVE ISA, in which the number of vector elements is only
known at runtime. See doc/poly-int.texi for more details.
Tests for poly-int.h are located in testsuite/gcc.dg/plugin,
since they are too expensive (in terms of binary size) to be
included as selftests. */
#ifndef HAVE_POLY_INT_H
#define HAVE_POLY_INT_H
template<unsigned int N, typename T> class poly_int_pod;
template<unsigned int N, typename T> class poly_int;
/* poly_coeff_traiits<T> describes the properties of a poly_int
coefficient type T:
- poly_coeff_traits<T1>::rank is less than poly_coeff_traits<T2>::rank
if T1 can promote to T2. For C-like types the rank is:
(2 * number of bytes) + (unsigned ? 1 : 0)
wide_ints don't have a normal rank and so use a value of INT_MAX.
Any fixed-width integer should be promoted to wide_int if possible
and lead to an error otherwise.
- poly_coeff_traits<T>::int_type is the type to which an integer
literal should be cast before comparing it with T.
- poly_coeff_traits<T>::precision is the number of bits that T can hold.
- poly_coeff_traits<T>::signedness is:
0 if T is unsigned
1 if T is signed
-1 if T has no inherent sign (as for wide_int).
- poly_coeff_traits<T>::max_value, if defined, is the maximum value of T.
- poly_coeff_traits<T>::result is a type that can hold results of
operations on T. This is different from T itself in cases where T
is the result of an accessor like wi::to_offset. */
template<typename T, wi::precision_type = wi::int_traits<T>::precision_type>
struct poly_coeff_traits;
template<typename T>
struct poly_coeff_traits<T, wi::FLEXIBLE_PRECISION>
{
typedef T result;
typedef T int_type;
static const int signedness = (T (0) >= T (-1));
static const int precision = sizeof (T) * CHAR_BIT;
static const T max_value = (signedness
? ((T (1) << (precision - 2))
+ ((T (1) << (precision - 2)) - 1))
: T (-1));
static const int rank = sizeof (T) * 2 + !signedness;
};
template<typename T>
struct poly_coeff_traits<T, wi::VAR_PRECISION>
{
typedef T result;
typedef int int_type;
static const int signedness = -1;
static const int precision = WIDE_INT_MAX_PRECISION;
static const int rank = INT_MAX;
};
template<typename T>
struct poly_coeff_traits<T, wi::CONST_PRECISION>
{
typedef WI_UNARY_RESULT (T) result;
typedef int int_type;
/* These types are always signed. */
static const int signedness = 1;
static const int precision = wi::int_traits<T>::precision;
static const int rank = precision * 2 / CHAR_BIT;
};
/* Information about a pair of coefficient types. */
template<typename T1, typename T2>
struct poly_coeff_pair_traits
{
/* True if T1 can represent all the values of T2.
Either:
- T1 should be a type with the same signedness as T2 and no less
precision. This allows things like int16_t -> int16_t and
uint32_t -> uint64_t.
- T1 should be signed, T2 should be unsigned, and T1 should be
wider than T2. This allows things like uint16_t -> int32_t.
This rules out cases in which T1 has less precision than T2 or where
the conversion would reinterpret the top bit. E.g. int16_t -> uint32_t
can be dangerous and should have an explicit cast if deliberate. */
static const bool lossless_p = (poly_coeff_traits<T1>::signedness
== poly_coeff_traits<T2>::signedness
? (poly_coeff_traits<T1>::precision
>= poly_coeff_traits<T2>::precision)
: (poly_coeff_traits<T1>::signedness == 1
&& poly_coeff_traits<T2>::signedness == 0
&& (poly_coeff_traits<T1>::precision
> poly_coeff_traits<T2>::precision)));
/* 0 if T1 op T2 should promote to HOST_WIDE_INT,
1 if T1 op T2 should promote to unsigned HOST_WIDE_INT,
2 if T1 op T2 should use wide-int rules. */
#define RANK(X) poly_coeff_traits<X>::rank
static const int result_kind
= ((RANK (T1) <= RANK (HOST_WIDE_INT)
&& RANK (T2) <= RANK (HOST_WIDE_INT))
? 0
: (RANK (T1) <= RANK (unsigned HOST_WIDE_INT)
&& RANK (T2) <= RANK (unsigned HOST_WIDE_INT))
? 1 : 2);
#undef RANK
};
/* SFINAE class that makes T3 available as "type" if T2 can represent all the
values in T1. */
template<typename T1, typename T2, typename T3,
bool lossless_p = poly_coeff_pair_traits<T1, T2>::lossless_p>
struct if_lossless;
template<typename T1, typename T2, typename T3>
struct if_lossless<T1, T2, T3, true>
{
typedef T3 type;
};
/* poly_int_traits<T> describes an integer type T that might be polynomial
or non-polynomial:
- poly_int_traits<T>::is_poly is true if T is a poly_int-based type
and false otherwise.
- poly_int_traits<T>::num_coeffs gives the number of coefficients in T
if T is a poly_int and 1 otherwise.
- poly_int_traits<T>::coeff_type gives the coefficent type of T if T
is a poly_int and T itself otherwise
- poly_int_traits<T>::int_type is a shorthand for
typename poly_coeff_traits<coeff_type>::int_type. */
template<typename T>
struct poly_int_traits
{
static const bool is_poly = false;
static const unsigned int num_coeffs = 1;
typedef T coeff_type;
typedef typename poly_coeff_traits<T>::int_type int_type;
};
template<unsigned int N, typename C>
struct poly_int_traits<poly_int_pod<N, C> >
{
static const bool is_poly = true;
static const unsigned int num_coeffs = N;
typedef C coeff_type;
typedef typename poly_coeff_traits<C>::int_type int_type;
};
template<unsigned int N, typename C>
struct poly_int_traits<poly_int<N, C> > : poly_int_traits<poly_int_pod<N, C> >
{
};
/* SFINAE class that makes T2 available as "type" if T1 is a non-polynomial
type. */
template<typename T1, typename T2 = T1,
bool is_poly = poly_int_traits<T1>::is_poly>
struct if_nonpoly {};
template<typename T1, typename T2>
struct if_nonpoly<T1, T2, false>
{
typedef T2 type;
};
/* SFINAE class that makes T3 available as "type" if both T1 and T2 are
non-polynomial types. */
template<typename T1, typename T2, typename T3,
bool is_poly1 = poly_int_traits<T1>::is_poly,
bool is_poly2 = poly_int_traits<T2>::is_poly>
struct if_nonpoly2 {};
template<typename T1, typename T2, typename T3>
struct if_nonpoly2<T1, T2, T3, false, false>
{
typedef T3 type;
};
/* SFINAE class that makes T2 available as "type" if T1 is a polynomial
type. */
template<typename T1, typename T2 = T1,
bool is_poly = poly_int_traits<T1>::is_poly>
struct if_poly {};
template<typename T1, typename T2>
struct if_poly<T1, T2, true>
{
typedef T2 type;
};
/* poly_result<T1, T2> describes the result of an operation on two
types T1 and T2, where at least one of the types is polynomial:
- poly_result<T1, T2>::type gives the result type for the operation.
The intention is to provide normal C-like rules for integer ranks,
except that everything smaller than HOST_WIDE_INT promotes to
HOST_WIDE_INT.
- poly_result<T1, T2>::cast is the type to which an operand of type
T1 should be cast before doing the operation, to ensure that
the operation is done at the right precision. Casting to
poly_result<T1, T2>::type would also work, but casting to this
type is more efficient. */
template<typename T1, typename T2 = T1,
int result_kind = poly_coeff_pair_traits<T1, T2>::result_kind>
struct poly_result;
/* Promote pair to HOST_WIDE_INT. */
template<typename T1, typename T2>
struct poly_result<T1, T2, 0>
{
typedef HOST_WIDE_INT type;
/* T1 and T2 are primitive types, so cast values to T before operating
on them. */
typedef type cast;
};
/* Promote pair to unsigned HOST_WIDE_INT. */
template<typename T1, typename T2>
struct poly_result<T1, T2, 1>
{
typedef unsigned HOST_WIDE_INT type;
/* T1 and T2 are primitive types, so cast values to T before operating
on them. */
typedef type cast;
};
/* Use normal wide-int rules. */
template<typename T1, typename T2>
struct poly_result<T1, T2, 2>
{
typedef WI_BINARY_RESULT (T1, T2) type;
/* Don't cast values before operating on them; leave the wi:: routines
to handle promotion as necessary. */
typedef const T1 &cast;
};
/* The coefficient type for the result of a binary operation on two
poly_ints, the first of which has coefficients of type C1 and the
second of which has coefficients of type C2. */
#define POLY_POLY_COEFF(C1, C2) typename poly_result<C1, C2>::type
/* Enforce that T2 is non-polynomial and provide the cofficient type of
the result of a binary operation in which the first operand is a
poly_int with coefficients of type C1 and the second operand is
a constant of type T2. */
#define POLY_CONST_COEFF(C1, T2) \
POLY_POLY_COEFF (C1, typename if_nonpoly<T2>::type)
/* Likewise in reverse. */
#define CONST_POLY_COEFF(T1, C2) \
POLY_POLY_COEFF (typename if_nonpoly<T1>::type, C2)
/* The result type for a binary operation on poly_int<N, C1> and
poly_int<N, C2>. */
#define POLY_POLY_RESULT(N, C1, C2) poly_int<N, POLY_POLY_COEFF (C1, C2)>
/* Enforce that T2 is non-polynomial and provide the result type
for a binary operation on poly_int<N, C1> and T2. */
#define POLY_CONST_RESULT(N, C1, T2) poly_int<N, POLY_CONST_COEFF (C1, T2)>
/* Enforce that T1 is non-polynomial and provide the result type
for a binary operation on T1 and poly_int<N, C2>. */
#define CONST_POLY_RESULT(N, T1, C2) poly_int<N, CONST_POLY_COEFF (T1, C2)>
/* Enforce that T1 and T2 are non-polynomial and provide the result type
for a binary operation on T1 and T2. */
#define CONST_CONST_RESULT(N, T1, T2) \
POLY_POLY_COEFF (typename if_nonpoly<T1>::type, \
typename if_nonpoly<T2>::type)
/* The type to which a coefficient of type C1 should be cast before
using it in a binary operation with a coefficient of type C2. */
#define POLY_CAST(C1, C2) typename poly_result<C1, C2>::cast
/* Provide the coefficient type for the result of T1 op T2, where T1
and T2 can be polynomial or non-polynomial. */
#define POLY_BINARY_COEFF(T1, T2) \
typename poly_result<typename poly_int_traits<T1>::coeff_type, \
typename poly_int_traits<T2>::coeff_type>::type
/* The type to which an integer constant should be cast before
comparing it with T. */
#define POLY_INT_TYPE(T) typename poly_int_traits<T>::int_type
/* RES is a poly_int result that has coefficients of type C and that
is being built up a coefficient at a time. Set coefficient number I
to VALUE in the most efficient way possible.
For primitive C it is better to assign directly, since it avoids
any further calls and so is more efficient when the compiler is
built at -O0. But for wide-int based C it is better to construct
the value in-place. This means that calls out to a wide-int.cc
routine can take the address of RES rather than the address of
a temporary.
The dummy comparison against a null C * is just a way of checking
that C gives the right type. */
#define POLY_SET_COEFF(C, RES, I, VALUE) \
((void) (&(RES).coeffs[0] == (C *) 0), \
wi::int_traits<C>::precision_type == wi::FLEXIBLE_PRECISION \
? (void) ((RES).coeffs[I] = VALUE) \
: (void) ((RES).coeffs[I].~C (), new (&(RES).coeffs[I]) C (VALUE)))
/* A base POD class for polynomial integers. The polynomial has N
coefficients of type C. */
template<unsigned int N, typename C>
class poly_int_pod
{
public:
template<typename Ca>
poly_int_pod &operator = (const poly_int_pod<N, Ca> &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int_pod>::type &operator = (const Ca &);
template<typename Ca>
poly_int_pod &operator += (const poly_int_pod<N, Ca> &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int_pod>::type &operator += (const Ca &);
template<typename Ca>
poly_int_pod &operator -= (const poly_int_pod<N, Ca> &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int_pod>::type &operator -= (const Ca &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int_pod>::type &operator *= (const Ca &);
poly_int_pod &operator <<= (unsigned int);
bool is_constant () const;
template<typename T>
typename if_lossless<T, C, bool>::type is_constant (T *) const;
C to_constant () const;
template<typename Ca>
static poly_int<N, C> from (const poly_int_pod<N, Ca> &, unsigned int,
signop);
template<typename Ca>
static poly_int<N, C> from (const poly_int_pod<N, Ca> &, signop);
bool to_shwi (poly_int_pod<N, HOST_WIDE_INT> *) const;
bool to_uhwi (poly_int_pod<N, unsigned HOST_WIDE_INT> *) const;
poly_int<N, HOST_WIDE_INT> force_shwi () const;
poly_int<N, unsigned HOST_WIDE_INT> force_uhwi () const;
#if POLY_INT_CONVERSION
operator C () const;
#endif
C coeffs[N];
};
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int_pod<N, C>&
poly_int_pod<N, C>::operator = (const poly_int_pod<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, *this, i, a.coeffs[i]);
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int_pod<N, C> >::type &
poly_int_pod<N, C>::operator = (const Ca &a)
{
POLY_SET_COEFF (C, *this, 0, a);
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, *this, i, wi::ints_for<C>::zero (this->coeffs[0]));
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int_pod<N, C>&
poly_int_pod<N, C>::operator += (const poly_int_pod<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] += a.coeffs[i];
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int_pod<N, C> >::type &
poly_int_pod<N, C>::operator += (const Ca &a)
{
this->coeffs[0] += a;
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int_pod<N, C>&
poly_int_pod<N, C>::operator -= (const poly_int_pod<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] -= a.coeffs[i];
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int_pod<N, C> >::type &
poly_int_pod<N, C>::operator -= (const Ca &a)
{
this->coeffs[0] -= a;
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int_pod<N, C> >::type &
poly_int_pod<N, C>::operator *= (const Ca &a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] *= a;
return *this;
}
template<unsigned int N, typename C>
inline poly_int_pod<N, C>&
poly_int_pod<N, C>::operator <<= (unsigned int a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] <<= a;
return *this;
}
/* Return true if the polynomial value is a compile-time constant. */
template<unsigned int N, typename C>
inline bool
poly_int_pod<N, C>::is_constant () const
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (this->coeffs[i] != 0)
return false;
return true;
}
/* Return true if the polynomial value is a compile-time constant,
storing its value in CONST_VALUE if so. */
template<unsigned int N, typename C>
template<typename T>
inline typename if_lossless<T, C, bool>::type
poly_int_pod<N, C>::is_constant (T *const_value) const
{
if (is_constant ())
{
*const_value = this->coeffs[0];
return true;
}
return false;
}
/* Return the value of a polynomial that is already known to be a
compile-time constant.
NOTE: When using this function, please add a comment above the call
explaining why we know the value is constant in that context. */
template<unsigned int N, typename C>
inline C
poly_int_pod<N, C>::to_constant () const
{
gcc_checking_assert (is_constant ());
return this->coeffs[0];
}
/* Convert X to a wide_int-based polynomial in which each coefficient
has BITSIZE bits. If X's coefficients are smaller than BITSIZE,
extend them according to SGN. */
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int<N, C>
poly_int_pod<N, C>::from (const poly_int_pod<N, Ca> &a,
unsigned int bitsize, signop sgn)
{
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, C::from (a.coeffs[i], bitsize, sgn));
return r;
}
/* Convert X to a fixed_wide_int-based polynomial, extending according
to SGN. */
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int<N, C>
poly_int_pod<N, C>::from (const poly_int_pod<N, Ca> &a, signop sgn)
{
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, C::from (a.coeffs[i], sgn));
return r;
}
/* Return true if the coefficients of this generic_wide_int-based
polynomial can be represented as signed HOST_WIDE_INTs without loss
of precision. Store the HOST_WIDE_INT representation in *R if so. */
template<unsigned int N, typename C>
inline bool
poly_int_pod<N, C>::to_shwi (poly_int_pod<N, HOST_WIDE_INT> *r) const
{
for (unsigned int i = 0; i < N; i++)
if (!wi::fits_shwi_p (this->coeffs[i]))
return false;
for (unsigned int i = 0; i < N; i++)
r->coeffs[i] = this->coeffs[i].to_shwi ();
return true;
}
/* Return true if the coefficients of this generic_wide_int-based
polynomial can be represented as unsigned HOST_WIDE_INTs without
loss of precision. Store the unsigned HOST_WIDE_INT representation
in *R if so. */
template<unsigned int N, typename C>
inline bool
poly_int_pod<N, C>::to_uhwi (poly_int_pod<N, unsigned HOST_WIDE_INT> *r) const
{
for (unsigned int i = 0; i < N; i++)
if (!wi::fits_uhwi_p (this->coeffs[i]))
return false;
for (unsigned int i = 0; i < N; i++)
r->coeffs[i] = this->coeffs[i].to_uhwi ();
return true;
}
/* Force a generic_wide_int-based constant to HOST_WIDE_INT precision,
truncating if necessary. */
template<unsigned int N, typename C>
inline poly_int<N, HOST_WIDE_INT>
poly_int_pod<N, C>::force_shwi () const
{
poly_int_pod<N, HOST_WIDE_INT> r;
for (unsigned int i = 0; i < N; i++)
r.coeffs[i] = this->coeffs[i].to_shwi ();
return r;
}
/* Force a generic_wide_int-based constant to unsigned HOST_WIDE_INT precision,
truncating if necessary. */
template<unsigned int N, typename C>
inline poly_int<N, unsigned HOST_WIDE_INT>
poly_int_pod<N, C>::force_uhwi () const
{
poly_int_pod<N, unsigned HOST_WIDE_INT> r;
for (unsigned int i = 0; i < N; i++)
r.coeffs[i] = this->coeffs[i].to_uhwi ();
return r;
}
#if POLY_INT_CONVERSION
/* Provide a conversion operator to constants. */
template<unsigned int N, typename C>
inline
poly_int_pod<N, C>::operator C () const
{
gcc_checking_assert (this->is_constant ());
return this->coeffs[0];
}
#endif
/* The main class for polynomial integers. The class provides
constructors that are necessarily missing from the POD base. */
template<unsigned int N, typename C>
class poly_int : public poly_int_pod<N, C>
{
public:
poly_int () {}
template<typename Ca>
poly_int (const poly_int<N, Ca> &);
template<typename Ca>
poly_int (const poly_int_pod<N, Ca> &);
template<typename C0>
poly_int (const C0 &);
template<typename C0, typename C1>
poly_int (const C0 &, const C1 &);
template<typename Ca>
poly_int &operator = (const poly_int_pod<N, Ca> &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int>::type &operator = (const Ca &);
template<typename Ca>
poly_int &operator += (const poly_int_pod<N, Ca> &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int>::type &operator += (const Ca &);
template<typename Ca>
poly_int &operator -= (const poly_int_pod<N, Ca> &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int>::type &operator -= (const Ca &);
template<typename Ca>
typename if_nonpoly<Ca, poly_int>::type &operator *= (const Ca &);
poly_int &operator <<= (unsigned int);
};
template<unsigned int N, typename C>
template<typename Ca>
inline
poly_int<N, C>::poly_int (const poly_int<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, *this, i, a.coeffs[i]);
}
template<unsigned int N, typename C>
template<typename Ca>
inline
poly_int<N, C>::poly_int (const poly_int_pod<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, *this, i, a.coeffs[i]);
}
template<unsigned int N, typename C>
template<typename C0>
inline
poly_int<N, C>::poly_int (const C0 &c0)
{
POLY_SET_COEFF (C, *this, 0, c0);
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, *this, i, wi::ints_for<C>::zero (this->coeffs[0]));
}
template<unsigned int N, typename C>
template<typename C0, typename C1>
inline
poly_int<N, C>::poly_int (const C0 &c0, const C1 &c1)
{
STATIC_ASSERT (N >= 2);
POLY_SET_COEFF (C, *this, 0, c0);
POLY_SET_COEFF (C, *this, 1, c1);
for (unsigned int i = 2; i < N; i++)
POLY_SET_COEFF (C, *this, i, wi::ints_for<C>::zero (this->coeffs[0]));
}
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int<N, C>&
poly_int<N, C>::operator = (const poly_int_pod<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] = a.coeffs[i];
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int<N, C> >::type &
poly_int<N, C>::operator = (const Ca &a)
{
this->coeffs[0] = a;
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
this->coeffs[i] = wi::ints_for<C>::zero (this->coeffs[0]);
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int<N, C>&
poly_int<N, C>::operator += (const poly_int_pod<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] += a.coeffs[i];
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int<N, C> >::type &
poly_int<N, C>::operator += (const Ca &a)
{
this->coeffs[0] += a;
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline poly_int<N, C>&
poly_int<N, C>::operator -= (const poly_int_pod<N, Ca> &a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] -= a.coeffs[i];
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int<N, C> >::type &
poly_int<N, C>::operator -= (const Ca &a)
{
this->coeffs[0] -= a;
return *this;
}
template<unsigned int N, typename C>
template<typename Ca>
inline typename if_nonpoly<Ca, poly_int<N, C> >::type &
poly_int<N, C>::operator *= (const Ca &a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] *= a;
return *this;
}
template<unsigned int N, typename C>
inline poly_int<N, C>&
poly_int<N, C>::operator <<= (unsigned int a)
{
for (unsigned int i = 0; i < N; i++)
this->coeffs[i] <<= a;
return *this;
}
/* Return true if every coefficient of A is in the inclusive range [B, C]. */
template<typename Ca, typename Cb, typename Cc>
inline typename if_nonpoly<Ca, bool>::type
coeffs_in_range_p (const Ca &a, const Cb &b, const Cc &c)
{
return a >= b && a <= c;
}
template<unsigned int N, typename Ca, typename Cb, typename Cc>
inline typename if_nonpoly<Ca, bool>::type
coeffs_in_range_p (const poly_int_pod<N, Ca> &a, const Cb &b, const Cc &c)
{
for (unsigned int i = 0; i < N; i++)
if (a.coeffs[i] < b || a.coeffs[i] > c)
return false;
return true;
}
namespace wi {
/* Poly version of wi::shwi, with the same interface. */
template<unsigned int N>
inline poly_int<N, hwi_with_prec>
shwi (const poly_int_pod<N, HOST_WIDE_INT> &a, unsigned int precision)
{
poly_int<N, hwi_with_prec> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (hwi_with_prec, r, i, wi::shwi (a.coeffs[i], precision));
return r;
}
/* Poly version of wi::uhwi, with the same interface. */
template<unsigned int N>
inline poly_int<N, hwi_with_prec>
uhwi (const poly_int_pod<N, unsigned HOST_WIDE_INT> &a, unsigned int precision)
{
poly_int<N, hwi_with_prec> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (hwi_with_prec, r, i, wi::uhwi (a.coeffs[i], precision));
return r;
}
/* Poly version of wi::sext, with the same interface. */
template<unsigned int N, typename Ca>
inline POLY_POLY_RESULT (N, Ca, Ca)
sext (const poly_int_pod<N, Ca> &a, unsigned int precision)
{
typedef POLY_POLY_COEFF (Ca, Ca) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::sext (a.coeffs[i], precision));
return r;
}
/* Poly version of wi::zext, with the same interface. */
template<unsigned int N, typename Ca>
inline POLY_POLY_RESULT (N, Ca, Ca)
zext (const poly_int_pod<N, Ca> &a, unsigned int precision)
{
typedef POLY_POLY_COEFF (Ca, Ca) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::zext (a.coeffs[i], precision));
return r;
}
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Cb)
operator + (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_POLY_COEFF (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, NCa (a.coeffs[i]) + b.coeffs[i]);
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
operator + (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CONST_COEFF (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, NCa (a.coeffs[0]) + b);
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, NCa (a.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
operator + (const Ca &a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_CAST (Cb, Ca) NCb;
typedef CONST_POLY_COEFF (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, a + NCb (b.coeffs[0]));
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, NCb (b.coeffs[i]));
return r;
}
namespace wi {
/* Poly versions of wi::add, with the same interface. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
add (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::add (a.coeffs[i], b.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
add (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::add (a.coeffs[0], b));
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::add (a.coeffs[i],
wi::ints_for<Cb>::zero (b)));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
add (const Ca &a, const poly_int_pod<N, Cb> &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::add (a, b.coeffs[0]));
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::add (wi::ints_for<Ca>::zero (a),
b.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
add (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b,
signop sgn, bool *overflow)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::add (a.coeffs[0], b.coeffs[0], sgn, overflow));
for (unsigned int i = 1; i < N; i++)
{
bool suboverflow;
POLY_SET_COEFF (C, r, i, wi::add (a.coeffs[i], b.coeffs[i], sgn,
&suboverflow));
*overflow |= suboverflow;
}
return r;
}
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Cb)
operator - (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_POLY_COEFF (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, NCa (a.coeffs[i]) - b.coeffs[i]);
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
operator - (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CONST_COEFF (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, NCa (a.coeffs[0]) - b);
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, NCa (a.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
operator - (const Ca &a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_CAST (Cb, Ca) NCb;
typedef CONST_POLY_COEFF (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, a - NCb (b.coeffs[0]));
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, -NCb (b.coeffs[i]));
return r;
}
namespace wi {
/* Poly versions of wi::sub, with the same interface. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
sub (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::sub (a.coeffs[i], b.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
sub (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::sub (a.coeffs[0], b));
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::sub (a.coeffs[i],
wi::ints_for<Cb>::zero (b)));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
sub (const Ca &a, const poly_int_pod<N, Cb> &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::sub (a, b.coeffs[0]));
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::sub (wi::ints_for<Ca>::zero (a),
b.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
sub (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b,
signop sgn, bool *overflow)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::sub (a.coeffs[0], b.coeffs[0], sgn, overflow));
for (unsigned int i = 1; i < N; i++)
{
bool suboverflow;
POLY_SET_COEFF (C, r, i, wi::sub (a.coeffs[i], b.coeffs[i], sgn,
&suboverflow));
*overflow |= suboverflow;
}
return r;
}
}
template<unsigned int N, typename Ca>
inline POLY_POLY_RESULT (N, Ca, Ca)
operator - (const poly_int_pod<N, Ca> &a)
{
typedef POLY_CAST (Ca, Ca) NCa;
typedef POLY_POLY_COEFF (Ca, Ca) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, -NCa (a.coeffs[i]));
return r;
}
namespace wi {
/* Poly version of wi::neg, with the same interface. */
template<unsigned int N, typename Ca>
inline poly_int<N, WI_UNARY_RESULT (Ca)>
neg (const poly_int_pod<N, Ca> &a)
{
typedef WI_UNARY_RESULT (Ca) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::neg (a.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca>
inline poly_int<N, WI_UNARY_RESULT (Ca)>
neg (const poly_int_pod<N, Ca> &a, bool *overflow)
{
typedef WI_UNARY_RESULT (Ca) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::neg (a.coeffs[0], overflow));
for (unsigned int i = 1; i < N; i++)
{
bool suboverflow;
POLY_SET_COEFF (C, r, i, wi::neg (a.coeffs[i], &suboverflow));
*overflow |= suboverflow;
}
return r;
}
}
template<unsigned int N, typename Ca>
inline POLY_POLY_RESULT (N, Ca, Ca)
operator ~ (const poly_int_pod<N, Ca> &a)
{
if (N >= 2)
return -1 - a;
return ~a.coeffs[0];
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
operator * (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CONST_COEFF (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, NCa (a.coeffs[i]) * b);
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
operator * (const Ca &a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef CONST_POLY_COEFF (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, NCa (a) * b.coeffs[i]);
return r;
}
namespace wi {
/* Poly versions of wi::mul, with the same interface. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
mul (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::mul (a.coeffs[i], b));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
mul (const Ca &a, const poly_int_pod<N, Cb> &b)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::mul (a, b.coeffs[i]));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Cb)>
mul (const poly_int_pod<N, Ca> &a, const Cb &b,
signop sgn, bool *overflow)
{
typedef WI_BINARY_RESULT (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, wi::mul (a.coeffs[0], b, sgn, overflow));
for (unsigned int i = 1; i < N; i++)
{
bool suboverflow;
POLY_SET_COEFF (C, r, i, wi::mul (a.coeffs[i], b, sgn, &suboverflow));
*overflow |= suboverflow;
}
return r;
}
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Ca)
operator << (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef POLY_CAST (Ca, Ca) NCa;
typedef POLY_POLY_COEFF (Ca, Ca) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, NCa (a.coeffs[i]) << b);
return r;
}
namespace wi {
/* Poly version of wi::lshift, with the same interface. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, WI_BINARY_RESULT (Ca, Ca)>
lshift (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef WI_BINARY_RESULT (Ca, Ca) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, wi::lshift (a.coeffs[i], b));
return r;
}
}
/* Return true if a0 + a1 * x might equal b0 + b1 * x for some nonnegative
integer x. */
template<typename Ca, typename Cb>
inline bool
maybe_eq_2 (const Ca &a0, const Ca &a1, const Cb &b0, const Cb &b1)
{
if (a1 != b1)
/* a0 + a1 * x == b0 + b1 * x
==> (a1 - b1) * x == b0 - a0
==> x == (b0 - a0) / (a1 - b1)
We need to test whether that's a valid value of x.
(b0 - a0) and (a1 - b1) must not have opposite signs
and the result must be integral. */
return (a1 < b1
? b0 <= a0 && (a0 - b0) % (b1 - a1) == 0
: b0 >= a0 && (b0 - a0) % (a1 - b1) == 0);
return a0 == b0;
}
/* Return true if a0 + a1 * x might equal b for some nonnegative
integer x. */
template<typename Ca, typename Cb>
inline bool
maybe_eq_2 (const Ca &a0, const Ca &a1, const Cb &b)
{
if (a1 != 0)
/* a0 + a1 * x == b
==> x == (b - a0) / a1
We need to test whether that's a valid value of x.
(b - a0) and a1 must not have opposite signs and the
result must be integral. */
return (a1 < 0
? b <= a0 && (a0 - b) % a1 == 0
: b >= a0 && (b - a0) % a1 == 0);
return a0 == b;
}
/* Return true if A might equal B for some indeterminate values. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
maybe_eq (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
STATIC_ASSERT (N <= 2);
if (N == 2)
return maybe_eq_2 (a.coeffs[0], a.coeffs[1], b.coeffs[0], b.coeffs[1]);
return a.coeffs[0] == b.coeffs[0];
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Cb, bool>::type
maybe_eq (const poly_int_pod<N, Ca> &a, const Cb &b)
{
STATIC_ASSERT (N <= 2);
if (N == 2)
return maybe_eq_2 (a.coeffs[0], a.coeffs[1], b);
return a.coeffs[0] == b;
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Ca, bool>::type
maybe_eq (const Ca &a, const poly_int_pod<N, Cb> &b)
{
STATIC_ASSERT (N <= 2);
if (N == 2)
return maybe_eq_2 (b.coeffs[0], b.coeffs[1], a);
return a == b.coeffs[0];
}
template<typename Ca, typename Cb>
inline typename if_nonpoly2<Ca, Cb, bool>::type
maybe_eq (const Ca &a, const Cb &b)
{
return a == b;
}
/* Return true if A might not equal B for some indeterminate values. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
maybe_ne (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (a.coeffs[i] != b.coeffs[i])
return true;
return a.coeffs[0] != b.coeffs[0];
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Cb, bool>::type
maybe_ne (const poly_int_pod<N, Ca> &a, const Cb &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (a.coeffs[i] != 0)
return true;
return a.coeffs[0] != b;
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Ca, bool>::type
maybe_ne (const Ca &a, const poly_int_pod<N, Cb> &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (b.coeffs[i] != 0)
return true;
return a != b.coeffs[0];
}
template<typename Ca, typename Cb>
inline typename if_nonpoly2<Ca, Cb, bool>::type
maybe_ne (const Ca &a, const Cb &b)
{
return a != b;
}
/* Return true if A is known to be equal to B. */
#define known_eq(A, B) (!maybe_ne (A, B))
/* Return true if A is known to be unequal to B. */
#define known_ne(A, B) (!maybe_eq (A, B))
/* Return true if A might be less than or equal to B for some
indeterminate values. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
maybe_le (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (a.coeffs[i] < b.coeffs[i])
return true;
return a.coeffs[0] <= b.coeffs[0];
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Cb, bool>::type
maybe_le (const poly_int_pod<N, Ca> &a, const Cb &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (a.coeffs[i] < 0)
return true;
return a.coeffs[0] <= b;
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Ca, bool>::type
maybe_le (const Ca &a, const poly_int_pod<N, Cb> &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (b.coeffs[i] > 0)
return true;
return a <= b.coeffs[0];
}
template<typename Ca, typename Cb>
inline typename if_nonpoly2<Ca, Cb, bool>::type
maybe_le (const Ca &a, const Cb &b)
{
return a <= b;
}
/* Return true if A might be less than B for some indeterminate values. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
maybe_lt (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (a.coeffs[i] < b.coeffs[i])
return true;
return a.coeffs[0] < b.coeffs[0];
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Cb, bool>::type
maybe_lt (const poly_int_pod<N, Ca> &a, const Cb &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (a.coeffs[i] < 0)
return true;
return a.coeffs[0] < b;
}
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Ca, bool>::type
maybe_lt (const Ca &a, const poly_int_pod<N, Cb> &b)
{
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if (b.coeffs[i] > 0)
return true;
return a < b.coeffs[0];
}
template<typename Ca, typename Cb>
inline typename if_nonpoly2<Ca, Cb, bool>::type
maybe_lt (const Ca &a, const Cb &b)
{
return a < b;
}
/* Return true if A may be greater than or equal to B. */
#define maybe_ge(A, B) maybe_le (B, A)
/* Return true if A may be greater than B. */
#define maybe_gt(A, B) maybe_lt (B, A)
/* Return true if A is known to be less than or equal to B. */
#define known_le(A, B) (!maybe_gt (A, B))
/* Return true if A is known to be less than B. */
#define known_lt(A, B) (!maybe_ge (A, B))
/* Return true if A is known to be greater than B. */
#define known_gt(A, B) (!maybe_le (A, B))
/* Return true if A is known to be greater than or equal to B. */
#define known_ge(A, B) (!maybe_lt (A, B))
/* Return true if A and B are ordered by the partial ordering known_le. */
template<typename T1, typename T2>
inline bool
ordered_p (const T1 &a, const T2 &b)
{
return ((poly_int_traits<T1>::num_coeffs == 1
&& poly_int_traits<T2>::num_coeffs == 1)
|| known_le (a, b)
|| known_le (b, a));
}
/* Assert that A and B are known to be ordered and return the minimum
of the two.
NOTE: When using this function, please add a comment above the call
explaining why we know the values are ordered in that context. */
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Cb)
ordered_min (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
if (known_le (a, b))
return a;
else
{
if (N > 1)
gcc_checking_assert (known_le (b, a));
return b;
}
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
ordered_min (const Ca &a, const poly_int_pod<N, Cb> &b)
{
if (known_le (a, b))
return a;
else
{
if (N > 1)
gcc_checking_assert (known_le (b, a));
return b;
}
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
ordered_min (const poly_int_pod<N, Ca> &a, const Cb &b)
{
if (known_le (a, b))
return a;
else
{
if (N > 1)
gcc_checking_assert (known_le (b, a));
return b;
}
}
/* Assert that A and B are known to be ordered and return the maximum
of the two.
NOTE: When using this function, please add a comment above the call
explaining why we know the values are ordered in that context. */
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Cb)
ordered_max (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
if (known_le (a, b))
return b;
else
{
if (N > 1)
gcc_checking_assert (known_le (b, a));
return a;
}
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
ordered_max (const Ca &a, const poly_int_pod<N, Cb> &b)
{
if (known_le (a, b))
return b;
else
{
if (N > 1)
gcc_checking_assert (known_le (b, a));
return a;
}
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
ordered_max (const poly_int_pod<N, Ca> &a, const Cb &b)
{
if (known_le (a, b))
return b;
else
{
if (N > 1)
gcc_checking_assert (known_le (b, a));
return a;
}
}
/* Return a constant lower bound on the value of A, which is known
to be nonnegative. */
template<unsigned int N, typename Ca>
inline Ca
constant_lower_bound (const poly_int_pod<N, Ca> &a)
{
gcc_checking_assert (known_ge (a, POLY_INT_TYPE (Ca) (0)));
return a.coeffs[0];
}
/* Return a value that is known to be no greater than A and B. This
will be the greatest lower bound for some indeterminate values but
not necessarily for all. */
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
lower_bound (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_INT_TYPE (Cb) ICb;
typedef POLY_CONST_COEFF (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, MIN (NCa (a.coeffs[0]), NCb (b)));
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, MIN (NCa (a.coeffs[i]), ICb (0)));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
lower_bound (const Ca &a, const poly_int_pod<N, Cb> &b)
{
return lower_bound (b, a);
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Cb)
lower_bound (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_POLY_COEFF (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, MIN (NCa (a.coeffs[i]), NCb (b.coeffs[i])));
return r;
}
template<typename Ca, typename Cb>
inline CONST_CONST_RESULT (N, Ca, Cb)
lower_bound (const Ca &a, const Cb &b)
{
return a < b ? a : b;
}
/* Return a value that is known to be no less than A and B. This will
be the least upper bound for some indeterminate values but not
necessarily for all. */
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
upper_bound (const poly_int_pod<N, Ca> &a, const Cb &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_INT_TYPE (Cb) ICb;
typedef POLY_CONST_COEFF (Ca, Cb) C;
poly_int<N, C> r;
POLY_SET_COEFF (C, r, 0, MAX (NCa (a.coeffs[0]), NCb (b)));
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (C, r, i, MAX (NCa (a.coeffs[i]), ICb (0)));
return r;
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
upper_bound (const Ca &a, const poly_int_pod<N, Cb> &b)
{
return upper_bound (b, a);
}
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Cb)
upper_bound (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_POLY_COEFF (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (C, r, i, MAX (NCa (a.coeffs[i]), NCb (b.coeffs[i])));
return r;
}
/* Return the greatest common divisor of all nonzero coefficients, or zero
if all coefficients are zero. */
template<unsigned int N, typename Ca>
inline POLY_BINARY_COEFF (Ca, Ca)
coeff_gcd (const poly_int_pod<N, Ca> &a)
{
/* Find the first nonzero coefficient, stopping at 0 whatever happens. */
unsigned int i;
for (i = N - 1; i > 0; --i)
if (a.coeffs[i] != 0)
break;
typedef POLY_BINARY_COEFF (Ca, Ca) C;
C r = a.coeffs[i];
for (unsigned int j = 0; j < i; ++j)
if (a.coeffs[j] != 0)
r = gcd (r, C (a.coeffs[j]));
return r;
}
/* Return a value that is a multiple of both A and B. This will be the
least common multiple for some indeterminate values but necessarily
for all. */
template<unsigned int N, typename Ca, typename Cb>
POLY_CONST_RESULT (N, Ca, Cb)
common_multiple (const poly_int_pod<N, Ca> &a, Cb b)
{
POLY_BINARY_COEFF (Ca, Ca) xgcd = coeff_gcd (a);
return a * (least_common_multiple (xgcd, b) / xgcd);
}
template<unsigned int N, typename Ca, typename Cb>
inline CONST_POLY_RESULT (N, Ca, Cb)
common_multiple (const Ca &a, const poly_int_pod<N, Cb> &b)
{
return common_multiple (b, a);
}
/* Return a value that is a multiple of both A and B, asserting that
such a value exists. The result will be the least common multiple
for some indeterminate values but necessarily for all.
NOTE: When using this function, please add a comment above the call
explaining why we know the values have a common multiple (which might
for example be because we know A / B is rational). */
template<unsigned int N, typename Ca, typename Cb>
POLY_POLY_RESULT (N, Ca, Cb)
force_common_multiple (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b)
{
if (b.is_constant ())
return common_multiple (a, b.coeffs[0]);
if (a.is_constant ())
return common_multiple (a.coeffs[0], b);
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_BINARY_COEFF (Ca, Cb) C;
typedef POLY_INT_TYPE (Ca) ICa;
for (unsigned int i = 1; i < N; ++i)
if (a.coeffs[i] != ICa (0))
{
C lcm = least_common_multiple (NCa (a.coeffs[i]), NCb (b.coeffs[i]));
C amul = lcm / a.coeffs[i];
C bmul = lcm / b.coeffs[i];
for (unsigned int j = 0; j < N; ++j)
gcc_checking_assert (a.coeffs[j] * amul == b.coeffs[j] * bmul);
return a * amul;
}
gcc_unreachable ();
}
/* Compare A and B for sorting purposes, returning -1 if A should come
before B, 0 if A and B are identical, and 1 if A should come after B.
This is a lexicographical compare of the coefficients in reverse order.
A consequence of this is that all constant sizes come before all
non-constant ones, regardless of magnitude (since a size is never
negative). This is what most callers want. For example, when laying
data out on the stack, it's better to keep all the constant-sized
data together so that it can be accessed as a constant offset from a
single base. */
template<unsigned int N, typename Ca, typename Cb>
inline int
compare_sizes_for_sort (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b)
{
for (unsigned int i = N; i-- > 0; )
if (a.coeffs[i] != b.coeffs[i])
return a.coeffs[i] < b.coeffs[i] ? -1 : 1;
return 0;
}
/* Return true if we can calculate VALUE & (ALIGN - 1) at compile time. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
can_align_p (const poly_int_pod<N, Ca> &value, Cb align)
{
for (unsigned int i = 1; i < N; i++)
if ((value.coeffs[i] & (align - 1)) != 0)
return false;
return true;
}
/* Return true if we can align VALUE up to the smallest multiple of
ALIGN that is >= VALUE. Store the aligned value in *ALIGNED if so. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
can_align_up (const poly_int_pod<N, Ca> &value, Cb align,
poly_int_pod<N, Ca> *aligned)
{
if (!can_align_p (value, align))
return false;
*aligned = value + (-value.coeffs[0] & (align - 1));
return true;
}
/* Return true if we can align VALUE down to the largest multiple of
ALIGN that is <= VALUE. Store the aligned value in *ALIGNED if so. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
can_align_down (const poly_int_pod<N, Ca> &value, Cb align,
poly_int_pod<N, Ca> *aligned)
{
if (!can_align_p (value, align))
return false;
*aligned = value - (value.coeffs[0] & (align - 1));
return true;
}
/* Return true if we can align A and B up to the smallest multiples of
ALIGN that are >= A and B respectively, and if doing so gives the
same value. */
template<unsigned int N, typename Ca, typename Cb, typename Cc>
inline bool
known_equal_after_align_up (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b,
Cc align)
{
poly_int<N, Ca> aligned_a;
poly_int<N, Cb> aligned_b;
return (can_align_up (a, align, &aligned_a)
&& can_align_up (b, align, &aligned_b)
&& known_eq (aligned_a, aligned_b));
}
/* Return true if we can align A and B down to the largest multiples of
ALIGN that are <= A and B respectively, and if doing so gives the
same value. */
template<unsigned int N, typename Ca, typename Cb, typename Cc>
inline bool
known_equal_after_align_down (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b,
Cc align)
{
poly_int<N, Ca> aligned_a;
poly_int<N, Cb> aligned_b;
return (can_align_down (a, align, &aligned_a)
&& can_align_down (b, align, &aligned_b)
&& known_eq (aligned_a, aligned_b));
}
/* Assert that we can align VALUE to ALIGN at compile time and return
the smallest multiple of ALIGN that is >= VALUE.
NOTE: When using this function, please add a comment above the call
explaining why we know the non-constant coefficients must already
be a multiple of ALIGN. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, Ca>
force_align_up (const poly_int_pod<N, Ca> &value, Cb align)
{
gcc_checking_assert (can_align_p (value, align));
return value + (-value.coeffs[0] & (align - 1));
}
/* Assert that we can align VALUE to ALIGN at compile time and return
the largest multiple of ALIGN that is <= VALUE.
NOTE: When using this function, please add a comment above the call
explaining why we know the non-constant coefficients must already
be a multiple of ALIGN. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, Ca>
force_align_down (const poly_int_pod<N, Ca> &value, Cb align)
{
gcc_checking_assert (can_align_p (value, align));
return value - (value.coeffs[0] & (align - 1));
}
/* Return a value <= VALUE that is a multiple of ALIGN. It will be the
greatest such value for some indeterminate values but not necessarily
for all. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, Ca>
aligned_lower_bound (const poly_int_pod<N, Ca> &value, Cb align)
{
poly_int<N, Ca> r;
for (unsigned int i = 0; i < N; i++)
/* This form copes correctly with more type combinations than
value.coeffs[i] & -align would. */
POLY_SET_COEFF (Ca, r, i, (value.coeffs[i]
- (value.coeffs[i] & (align - 1))));
return r;
}
/* Return a value >= VALUE that is a multiple of ALIGN. It will be the
least such value for some indeterminate values but not necessarily
for all. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, Ca>
aligned_upper_bound (const poly_int_pod<N, Ca> &value, Cb align)
{
poly_int<N, Ca> r;
for (unsigned int i = 0; i < N; i++)
POLY_SET_COEFF (Ca, r, i, (value.coeffs[i]
+ (-value.coeffs[i] & (align - 1))));
return r;
}
/* Assert that we can align VALUE to ALIGN at compile time. Align VALUE
down to the largest multiple of ALIGN that is <= VALUE, then divide by
ALIGN.
NOTE: When using this function, please add a comment above the call
explaining why we know the non-constant coefficients must already
be a multiple of ALIGN. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, Ca>
force_align_down_and_div (const poly_int_pod<N, Ca> &value, Cb align)
{
gcc_checking_assert (can_align_p (value, align));
poly_int<N, Ca> r;
POLY_SET_COEFF (Ca, r, 0, ((value.coeffs[0]
- (value.coeffs[0] & (align - 1)))
/ align));
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (Ca, r, i, value.coeffs[i] / align);
return r;
}
/* Assert that we can align VALUE to ALIGN at compile time. Align VALUE
up to the smallest multiple of ALIGN that is >= VALUE, then divide by
ALIGN.
NOTE: When using this function, please add a comment above the call
explaining why we know the non-constant coefficients must already
be a multiple of ALIGN. */
template<unsigned int N, typename Ca, typename Cb>
inline poly_int<N, Ca>
force_align_up_and_div (const poly_int_pod<N, Ca> &value, Cb align)
{
gcc_checking_assert (can_align_p (value, align));
poly_int<N, Ca> r;
POLY_SET_COEFF (Ca, r, 0, ((value.coeffs[0]
+ (-value.coeffs[0] & (align - 1)))
/ align));
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
POLY_SET_COEFF (Ca, r, i, value.coeffs[i] / align);
return r;
}
/* Return true if we know at compile time the difference between VALUE
and the equal or preceding multiple of ALIGN. Store the value in
*MISALIGN if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cm>
inline bool
known_misalignment (const poly_int_pod<N, Ca> &value, Cb align, Cm *misalign)
{
gcc_checking_assert (align != 0);
if (!can_align_p (value, align))
return false;
*misalign = value.coeffs[0] & (align - 1);
return true;
}
/* Return X & (Y - 1), asserting that this value is known. Please add
an a comment above callers to this function to explain why the condition
is known to hold. */
template<unsigned int N, typename Ca, typename Cb>
inline POLY_BINARY_COEFF (Ca, Ca)
force_get_misalignment (const poly_int_pod<N, Ca> &a, Cb align)
{
gcc_checking_assert (can_align_p (a, align));
return a.coeffs[0] & (align - 1);
}
/* Return the maximum alignment that A is known to have. Return 0
if A is known to be zero. */
template<unsigned int N, typename Ca>
inline POLY_BINARY_COEFF (Ca, Ca)
known_alignment (const poly_int_pod<N, Ca> &a)
{
typedef POLY_BINARY_COEFF (Ca, Ca) C;
C r = a.coeffs[0];
for (unsigned int i = 1; i < N; ++i)
r |= a.coeffs[i];
return r & -r;
}
/* Return true if we can compute A | B at compile time, storing the
result in RES if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cr>
inline typename if_nonpoly<Cb, bool>::type
can_ior_p (const poly_int_pod<N, Ca> &a, Cb b, Cr *result)
{
/* Coefficients 1 and above must be a multiple of something greater
than B. */
typedef POLY_INT_TYPE (Ca) int_type;
if (N >= 2)
for (unsigned int i = 1; i < N; i++)
if ((-(a.coeffs[i] & -a.coeffs[i]) & b) != int_type (0))
return false;
*result = a;
result->coeffs[0] |= b;
return true;
}
/* Return true if A is a constant multiple of B, storing the
multiple in *MULTIPLE if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cm>
inline typename if_nonpoly<Cb, bool>::type
constant_multiple_p (const poly_int_pod<N, Ca> &a, Cb b, Cm *multiple)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
/* Do the modulus before the constant check, to catch divide by
zero errors. */
if (NCa (a.coeffs[0]) % NCb (b) != 0 || !a.is_constant ())
return false;
*multiple = NCa (a.coeffs[0]) / NCb (b);
return true;
}
template<unsigned int N, typename Ca, typename Cb, typename Cm>
inline typename if_nonpoly<Ca, bool>::type
constant_multiple_p (Ca a, const poly_int_pod<N, Cb> &b, Cm *multiple)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_INT_TYPE (Ca) int_type;
/* Do the modulus before the constant check, to catch divide by
zero errors. */
if (NCa (a) % NCb (b.coeffs[0]) != 0
|| (a != int_type (0) && !b.is_constant ()))
return false;
*multiple = NCa (a) / NCb (b.coeffs[0]);
return true;
}
template<unsigned int N, typename Ca, typename Cb, typename Cm>
inline bool
constant_multiple_p (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b, Cm *multiple)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_INT_TYPE (Ca) ICa;
typedef POLY_INT_TYPE (Cb) ICb;
typedef POLY_BINARY_COEFF (Ca, Cb) C;
if (NCa (a.coeffs[0]) % NCb (b.coeffs[0]) != 0)
return false;
C r = NCa (a.coeffs[0]) / NCb (b.coeffs[0]);
for (unsigned int i = 1; i < N; ++i)
if (b.coeffs[i] == ICb (0)
? a.coeffs[i] != ICa (0)
: (NCa (a.coeffs[i]) % NCb (b.coeffs[i]) != 0
|| NCa (a.coeffs[i]) / NCb (b.coeffs[i]) != r))
return false;
*multiple = r;
return true;
}
/* Return true if A is a multiple of B. */
template<typename Ca, typename Cb>
inline typename if_nonpoly2<Ca, Cb, bool>::type
multiple_p (Ca a, Cb b)
{
return a % b == 0;
}
/* Return true if A is a (polynomial) multiple of B. */
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Cb, bool>::type
multiple_p (const poly_int_pod<N, Ca> &a, Cb b)
{
for (unsigned int i = 0; i < N; ++i)
if (a.coeffs[i] % b != 0)
return false;
return true;
}
/* Return true if A is a (constant) multiple of B. */
template<unsigned int N, typename Ca, typename Cb>
inline typename if_nonpoly<Ca, bool>::type
multiple_p (Ca a, const poly_int_pod<N, Cb> &b)
{
typedef POLY_INT_TYPE (Ca) int_type;
/* Do the modulus before the constant check, to catch divide by
potential zeros. */
return a % b.coeffs[0] == 0 && (a == int_type (0) || b.is_constant ());
}
/* Return true if A is a (polynomial) multiple of B. This handles cases
where either B is constant or the multiple is constant. */
template<unsigned int N, typename Ca, typename Cb>
inline bool
multiple_p (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
if (b.is_constant ())
return multiple_p (a, b.coeffs[0]);
POLY_BINARY_COEFF (Ca, Ca) tmp;
return constant_multiple_p (a, b, &tmp);
}
/* Return true if A is a (constant) multiple of B, storing the
multiple in *MULTIPLE if so. */
template<typename Ca, typename Cb, typename Cm>
inline typename if_nonpoly2<Ca, Cb, bool>::type
multiple_p (Ca a, Cb b, Cm *multiple)
{
if (a % b != 0)
return false;
*multiple = a / b;
return true;
}
/* Return true if A is a (polynomial) multiple of B, storing the
multiple in *MULTIPLE if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cm>
inline typename if_nonpoly<Cb, bool>::type
multiple_p (const poly_int_pod<N, Ca> &a, Cb b, poly_int_pod<N, Cm> *multiple)
{
if (!multiple_p (a, b))
return false;
for (unsigned int i = 0; i < N; ++i)
multiple->coeffs[i] = a.coeffs[i] / b;
return true;
}
/* Return true if B is a constant and A is a (constant) multiple of B,
storing the multiple in *MULTIPLE if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cm>
inline typename if_nonpoly<Ca, bool>::type
multiple_p (Ca a, const poly_int_pod<N, Cb> &b, Cm *multiple)
{
typedef POLY_CAST (Ca, Cb) NCa;
/* Do the modulus before the constant check, to catch divide by
potential zeros. */
if (a % b.coeffs[0] != 0 || (NCa (a) != 0 && !b.is_constant ()))
return false;
*multiple = a / b.coeffs[0];
return true;
}
/* Return true if A is a (polynomial) multiple of B, storing the
multiple in *MULTIPLE if so. This handles cases where either
B is constant or the multiple is constant. */
template<unsigned int N, typename Ca, typename Cb, typename Cm>
inline bool
multiple_p (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b,
poly_int_pod<N, Cm> *multiple)
{
if (b.is_constant ())
return multiple_p (a, b.coeffs[0], multiple);
return constant_multiple_p (a, b, multiple);
}
/* Return A / B, given that A is known to be a multiple of B. */
template<unsigned int N, typename Ca, typename Cb>
inline POLY_CONST_RESULT (N, Ca, Cb)
exact_div (const poly_int_pod<N, Ca> &a, Cb b)
{
typedef POLY_CONST_COEFF (Ca, Cb) C;
poly_int<N, C> r;
for (unsigned int i = 0; i < N; i++)
{
gcc_checking_assert (a.coeffs[i] % b == 0);
POLY_SET_COEFF (C, r, i, a.coeffs[i] / b);
}
return r;
}
/* Return A / B, given that A is known to be a multiple of B. */
template<unsigned int N, typename Ca, typename Cb>
inline POLY_POLY_RESULT (N, Ca, Cb)
exact_div (const poly_int_pod<N, Ca> &a, const poly_int_pod<N, Cb> &b)
{
if (b.is_constant ())
return exact_div (a, b.coeffs[0]);
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_BINARY_COEFF (Ca, Cb) C;
typedef POLY_INT_TYPE (Cb) int_type;
gcc_checking_assert (a.coeffs[0] % b.coeffs[0] == 0);
C r = NCa (a.coeffs[0]) / NCb (b.coeffs[0]);
for (unsigned int i = 1; i < N; ++i)
gcc_checking_assert (b.coeffs[i] == int_type (0)
? a.coeffs[i] == int_type (0)
: (a.coeffs[i] % b.coeffs[i] == 0
&& NCa (a.coeffs[i]) / NCb (b.coeffs[i]) == r));
return r;
}
/* Return true if there is some constant Q and polynomial r such that:
(1) a = b * Q + r
(2) |b * Q| <= |a|
(3) |r| < |b|
Store the value Q in *QUOTIENT if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cq>
inline typename if_nonpoly2<Cb, Cq, bool>::type
can_div_trunc_p (const poly_int_pod<N, Ca> &a, Cb b, Cq *quotient)
{
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
/* Do the division before the constant check, to catch divide by
zero errors. */
Cq q = NCa (a.coeffs[0]) / NCb (b);
if (!a.is_constant ())
return false;
*quotient = q;
return true;
}
template<unsigned int N, typename Ca, typename Cb, typename Cq>
inline typename if_nonpoly<Cq, bool>::type
can_div_trunc_p (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b,
Cq *quotient)
{
/* We can calculate Q from the case in which the indeterminates
are zero. */
typedef POLY_CAST (Ca, Cb) NCa;
typedef POLY_CAST (Cb, Ca) NCb;
typedef POLY_INT_TYPE (Ca) ICa;
typedef POLY_INT_TYPE (Cb) ICb;
typedef POLY_BINARY_COEFF (Ca, Cb) C;
C q = NCa (a.coeffs[0]) / NCb (b.coeffs[0]);
/* Check the other coefficients and record whether the division is exact.
The only difficult case is when it isn't. If we require a and b to
ordered wrt zero, there can be no two coefficients of the same value
that have opposite signs. This means that:
|a| = |a0| + |a1 * x1| + |a2 * x2| + ...
|b| = |b0| + |b1 * x1| + |b2 * x2| + ...
The Q we've just calculated guarantees:
|b0 * Q| <= |a0|
|a0 - b0 * Q| < |b0|
and so:
(2) |b * Q| <= |a|
is satisfied if:
|bi * xi * Q| <= |ai * xi|
for each i in [1, N]. This is trivially true when xi is zero.
When it isn't we need:
(2') |bi * Q| <= |ai|
r is calculated as:
r = r0 + r1 * x1 + r2 * x2 + ...
where ri = ai - bi * Q
Restricting to ordered a and b also guarantees that no two ris
have opposite signs, so we have:
|r| = |r0| + |r1 * x1| + |r2 * x2| + ...
We know from the calculation of Q that |r0| < |b0|, so:
(3) |r| < |b|
is satisfied if:
(3') |ai - bi * Q| <= |bi|
for each i in [1, N]. */
bool rem_p = NCa (a.coeffs[0]) % NCb (b.coeffs[0]) != 0;
for (unsigned int i = 1; i < N; ++i)
{
if (b.coeffs[i] == ICb (0))
{
/* For bi == 0 we simply need: (3') |ai| == 0. */
if (a.coeffs[i] != ICa (0))
return false;
}
else
{
if (q == 0)
{
/* For Q == 0 we simply need: (3') |ai| <= |bi|. */
if (a.coeffs[i] != ICa (0))
{
/* Use negative absolute to avoid overflow, i.e.
-|ai| >= -|bi|. */
C neg_abs_a = (a.coeffs[i] < 0 ? a.coeffs[i] : -a.coeffs[i]);
C neg_abs_b = (b.coeffs[i] < 0 ? b.coeffs[i] : -b.coeffs[i]);
if (neg_abs_a < neg_abs_b)
return false;
rem_p = true;
}
}
else
{
/* Otherwise just check for the case in which ai / bi == Q. */
if (NCa (a.coeffs[i]) / NCb (b.coeffs[i]) != q)
return false;
if (NCa (a.coeffs[i]) % NCb (b.coeffs[i]) != 0)
rem_p = true;
}
}
}
/* If the division isn't exact, require both values to be ordered wrt 0,
so that we can guarantee conditions (2) and (3) for all indeterminate
values. */
if (rem_p && (!ordered_p (a, ICa (0)) || !ordered_p (b, ICb (0))))
return false;
*quotient = q;
return true;
}
/* Likewise, but also store r in *REMAINDER. */
template<unsigned int N, typename Ca, typename Cb, typename Cq, typename Cr>
inline typename if_nonpoly<Cq, bool>::type
can_div_trunc_p (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b,
Cq *quotient, Cr *remainder)
{
if (!can_div_trunc_p (a, b, quotient))
return false;
*remainder = a - *quotient * b;
return true;
}
/* Return true if there is some polynomial q and constant R such that:
(1) a = B * q + R
(2) |B * q| <= |a|
(3) |R| < |B|
Store the value q in *QUOTIENT if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cq>
inline typename if_nonpoly<Cb, bool>::type
can_div_trunc_p (const poly_int_pod<N, Ca> &a, Cb b,
poly_int_pod<N, Cq> *quotient)
{
/* The remainder must be constant. */
for (unsigned int i = 1; i < N; ++i)
if (a.coeffs[i] % b != 0)
return false;
for (unsigned int i = 0; i < N; ++i)
quotient->coeffs[i] = a.coeffs[i] / b;
return true;
}
/* Likewise, but also store R in *REMAINDER. */
template<unsigned int N, typename Ca, typename Cb, typename Cq, typename Cr>
inline typename if_nonpoly<Cb, bool>::type
can_div_trunc_p (const poly_int_pod<N, Ca> &a, Cb b,
poly_int_pod<N, Cq> *quotient, Cr *remainder)
{
if (!can_div_trunc_p (a, b, quotient))
return false;
*remainder = a.coeffs[0] % b;
return true;
}
/* Return true if there is some constant Q and polynomial r such that:
(1) a = b * Q + r
(2) |a| <= |b * Q|
(3) |r| < |b|
Store the value Q in *QUOTIENT if so. */
template<unsigned int N, typename Ca, typename Cb, typename Cq>
inline typename if_nonpoly<Cq, bool>::type
can_div_away_from_zero_p (const poly_int_pod<N, Ca> &a,
const poly_int_pod<N, Cb> &b,
Cq *quotient)
{
if (!can_div_trunc_p (a, b, quotient))
return false;
if (maybe_ne (*quotient * b, a))
*quotient += (*quotient < 0 ? -1 : 1);
return true;
}
/* Use print_dec to print VALUE to FILE, where SGN is the sign
of the values. */
template<unsigned int N, typename C>
void
print_dec (const poly_int_pod<N, C> &value, FILE *file, signop sgn)
{
if (value.is_constant ())
print_dec (value.coeffs[0], file, sgn);
else
{
fprintf (file, "[");
for (unsigned int i = 0; i < N; ++i)
{
print_dec (value.coeffs[i], file, sgn);
fputc (i == N - 1 ? ']' : ',', file);
}
}
}
/* Likewise without the signop argument, for coefficients that have an
inherent signedness. */
template<unsigned int N, typename C>
void
print_dec (const poly_int_pod<N, C> &value, FILE *file)
{
STATIC_ASSERT (poly_coeff_traits<C>::signedness >= 0);
print_dec (value, file,
poly_coeff_traits<C>::signedness ? SIGNED : UNSIGNED);
}
/* Helper for calculating the distance between two points P1 and P2,
in cases where known_le (P1, P2). T1 and T2 are the types of the
two positions, in either order. The coefficients of P2 - P1 have
type unsigned HOST_WIDE_INT if the coefficients of both T1 and T2
have C++ primitive type, otherwise P2 - P1 has its usual
wide-int-based type.
The actual subtraction should look something like this:
typedef poly_span_traits<T1, T2> span_traits;
span_traits::cast (P2) - span_traits::cast (P1)
Applying the cast before the subtraction avoids undefined overflow
for signed T1 and T2.
The implementation of the cast tries to avoid unnecessary arithmetic
or copying. */
template<typename T1, typename T2,
typename Res = POLY_BINARY_COEFF (POLY_BINARY_COEFF (T1, T2),
unsigned HOST_WIDE_INT)>
struct poly_span_traits
{
template<typename T>
static const T &cast (const T &x) { return x; }
};
template<typename T1, typename T2>
struct poly_span_traits<T1, T2, unsigned HOST_WIDE_INT>
{
template<typename T>
static typename if_nonpoly<T, unsigned HOST_WIDE_INT>::type
cast (const T &x) { return x; }
template<unsigned int N, typename T>
static poly_int<N, unsigned HOST_WIDE_INT>
cast (const poly_int_pod<N, T> &x) { return x; }
};
/* Return true if SIZE represents a known size, assuming that all-ones
indicates an unknown size. */
template<typename T>
inline bool
known_size_p (const T &a)
{
return maybe_ne (a, POLY_INT_TYPE (T) (-1));
}
/* Return true if range [POS, POS + SIZE) might include VAL.
SIZE can be the special value -1, in which case the range is
open-ended. */
template<typename T1, typename T2, typename T3>
inline bool
maybe_in_range_p (const T1 &val, const T2 &pos, const T3 &size)
{
typedef poly_span_traits<T1, T2> start_span;
typedef poly_span_traits<T3, T3> size_span;
if (known_lt (val, pos))
return false;
if (!known_size_p (size))
return true;
if ((poly_int_traits<T1>::num_coeffs > 1
|| poly_int_traits<T2>::num_coeffs > 1)
&& maybe_lt (val, pos))
/* In this case we don't know whether VAL >= POS is true at compile
time, so we can't prove that VAL >= POS + SIZE. */
return true;
return maybe_lt (start_span::cast (val) - start_span::cast (pos),
size_span::cast (size));
}
/* Return true if range [POS, POS + SIZE) is known to include VAL.
SIZE can be the special value -1, in which case the range is
open-ended. */
template<typename T1, typename T2, typename T3>
inline bool
known_in_range_p (const T1 &val, const T2 &pos, const T3 &size)
{
typedef poly_span_traits<T1, T2> start_span;
typedef poly_span_traits<T3, T3> size_span;
return (known_size_p (size)
&& known_ge (val, pos)
&& known_lt (start_span::cast (val) - start_span::cast (pos),
size_span::cast (size)));
}
/* Return true if the two ranges [POS1, POS1 + SIZE1) and [POS2, POS2 + SIZE2)
might overlap. SIZE1 and/or SIZE2 can be the special value -1, in which
case the range is open-ended. */
template<typename T1, typename T2, typename T3, typename T4>
inline bool
ranges_maybe_overlap_p (const T1 &pos1, const T2 &size1,
const T3 &pos2, const T4 &size2)
{
if (maybe_in_range_p (pos2, pos1, size1))
return maybe_ne (size2, POLY_INT_TYPE (T4) (0));
if (maybe_in_range_p (pos1, pos2, size2))
return maybe_ne (size1, POLY_INT_TYPE (T2) (0));
return false;
}
/* Return true if the two ranges [POS1, POS1 + SIZE1) and [POS2, POS2 + SIZE2)
are known to overlap. SIZE1 and/or SIZE2 can be the special value -1,
in which case the range is open-ended. */
template<typename T1, typename T2, typename T3, typename T4>
inline bool
ranges_known_overlap_p (const T1 &pos1, const T2 &size1,
const T3 &pos2, const T4 &size2)
{
typedef poly_span_traits<T1, T3> start_span;
typedef poly_span_traits<T2, T2> size1_span;
typedef poly_span_traits<T4, T4> size2_span;
/* known_gt (POS1 + SIZE1, POS2) [infinite precision]
--> known_gt (SIZE1, POS2 - POS1) [infinite precision]
--> known_gt (SIZE1, POS2 - lower_bound (POS1, POS2)) [infinite precision]
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ always nonnegative
--> known_gt (SIZE1, span1::cast (POS2 - lower_bound (POS1, POS2))).
Using the saturating subtraction enforces that SIZE1 must be
nonzero, since known_gt (0, x) is false for all nonnegative x.
If POS2.coeff[I] < POS1.coeff[I] for some I > 0, increasing
indeterminate number I makes the unsaturated condition easier to
satisfy, so using a saturated coefficient of zero tests the case in
which the indeterminate is zero (the minimum value). */
return (known_size_p (size1)
&& known_size_p (size2)
&& known_lt (start_span::cast (pos2)
- start_span::cast (lower_bound (pos1, pos2)),
size1_span::cast (size1))
&& known_lt (start_span::cast (pos1)
- start_span::cast (lower_bound (pos1, pos2)),
size2_span::cast (size2)));
}
/* Return true if range [POS1, POS1 + SIZE1) is known to be a subrange of
[POS2, POS2 + SIZE2). SIZE1 and/or SIZE2 can be the special value -1,
in which case the range is open-ended. */
template<typename T1, typename T2, typename T3, typename T4>
inline bool
known_subrange_p (const T1 &pos1, const T2 &size1,
const T3 &pos2, const T4 &size2)
{
typedef typename poly_int_traits<T2>::coeff_type C2;
typedef poly_span_traits<T1, T3> start_span;
typedef poly_span_traits<T2, T4> size_span;
return (known_gt (size1, POLY_INT_TYPE (T2) (0))
&& (poly_coeff_traits<C2>::signedness > 0
|| known_size_p (size1))
&& known_size_p (size2)
&& known_ge (pos1, pos2)
&& known_le (size1, size2)
&& known_le (start_span::cast (pos1) - start_span::cast (pos2),
size_span::cast (size2) - size_span::cast (size1)));
}
/* Return true if the endpoint of the range [POS, POS + SIZE) can be
stored in a T, or if SIZE is the special value -1, which makes the
range open-ended. */
template<typename T>
inline typename if_nonpoly<T, bool>::type
endpoint_representable_p (const T &pos, const T &size)
{
return (!known_size_p (size)
|| pos <= poly_coeff_traits<T>::max_value - size);
}
template<unsigned int N, typename C>
inline bool
endpoint_representable_p (const poly_int_pod<N, C> &pos,
const poly_int_pod<N, C> &size)
{
if (known_size_p (size))
for (unsigned int i = 0; i < N; ++i)
if (pos.coeffs[i] > poly_coeff_traits<C>::max_value - size.coeffs[i])
return false;
return true;
}
template<unsigned int N, typename C>
void
gt_ggc_mx (poly_int_pod<N, C> *)
{
}
template<unsigned int N, typename C>
void
gt_pch_nx (poly_int_pod<N, C> *)
{
}
template<unsigned int N, typename C>
void
gt_pch_nx (poly_int_pod<N, C> *, void (*) (void *, void *), void *)
{
}
#undef POLY_SET_COEFF
#undef POLY_INT_TYPE
#undef POLY_BINARY_COEFF
#undef CONST_CONST_RESULT
#undef POLY_CONST_RESULT
#undef CONST_POLY_RESULT
#undef POLY_POLY_RESULT
#undef POLY_CONST_COEFF
#undef CONST_POLY_COEFF
#undef POLY_POLY_COEFF
#endif
|