1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596
|
// script-sections.cc -- linker script SECTIONS for gold
// Copyright (C) 2008-2020 Free Software Foundation, Inc.
// Written by Ian Lance Taylor <iant@google.com>.
// This file is part of gold.
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
// MA 02110-1301, USA.
#include "gold.h"
#include <cstring>
#include <algorithm>
#include <list>
#include <map>
#include <string>
#include <vector>
#include <fnmatch.h>
#include "parameters.h"
#include "object.h"
#include "layout.h"
#include "output.h"
#include "script-c.h"
#include "script.h"
#include "script-sections.h"
// Support for the SECTIONS clause in linker scripts.
namespace gold
{
// A region of memory.
class Memory_region
{
public:
Memory_region(const char* name, size_t namelen, unsigned int attributes,
Expression* start, Expression* length)
: name_(name, namelen),
attributes_(attributes),
start_(start),
length_(length),
current_offset_(0),
vma_sections_(),
lma_sections_(),
last_section_(NULL)
{ }
// Return the name of this region.
const std::string&
name() const
{ return this->name_; }
// Return the start address of this region.
Expression*
start_address() const
{ return this->start_; }
// Return the length of this region.
Expression*
length() const
{ return this->length_; }
// Print the region (when debugging).
void
print(FILE*) const;
// Return true if <name,namelen> matches this region.
bool
name_match(const char* name, size_t namelen)
{
return (this->name_.length() == namelen
&& strncmp(this->name_.c_str(), name, namelen) == 0);
}
Expression*
get_current_address() const
{
return
script_exp_binary_add(this->start_,
script_exp_integer(this->current_offset_));
}
void
set_address(uint64_t addr, const Symbol_table* symtab, const Layout* layout)
{
uint64_t start = this->start_->eval(symtab, layout, false);
uint64_t len = this->length_->eval(symtab, layout, false);
if (addr < start || addr >= start + len)
gold_error(_("address 0x%llx is not within region %s"),
static_cast<unsigned long long>(addr),
this->name_.c_str());
else if (addr < start + this->current_offset_)
gold_error(_("address 0x%llx moves dot backwards in region %s"),
static_cast<unsigned long long>(addr),
this->name_.c_str());
this->current_offset_ = addr - start;
}
void
increment_offset(std::string section_name, uint64_t amount,
const Symbol_table* symtab, const Layout* layout)
{
this->current_offset_ += amount;
if (this->current_offset_
> this->length_->eval(symtab, layout, false))
gold_error(_("section %s overflows end of region %s"),
section_name.c_str(), this->name_.c_str());
}
// Returns true iff there is room left in this region
// for AMOUNT more bytes of data.
bool
has_room_for(const Symbol_table* symtab, const Layout* layout,
uint64_t amount) const
{
return (this->current_offset_ + amount
< this->length_->eval(symtab, layout, false));
}
// Return true if the provided section flags
// are compatible with this region's attributes.
bool
attributes_compatible(elfcpp::Elf_Xword flags, elfcpp::Elf_Xword type) const;
void
add_section(Output_section_definition* sec, bool vma)
{
if (vma)
this->vma_sections_.push_back(sec);
else
this->lma_sections_.push_back(sec);
}
typedef std::vector<Output_section_definition*> Section_list;
// Return the start of the list of sections
// whose VMAs are taken from this region.
Section_list::const_iterator
get_vma_section_list_start() const
{ return this->vma_sections_.begin(); }
// Return the start of the list of sections
// whose LMAs are taken from this region.
Section_list::const_iterator
get_lma_section_list_start() const
{ return this->lma_sections_.begin(); }
// Return the end of the list of sections
// whose VMAs are taken from this region.
Section_list::const_iterator
get_vma_section_list_end() const
{ return this->vma_sections_.end(); }
// Return the end of the list of sections
// whose LMAs are taken from this region.
Section_list::const_iterator
get_lma_section_list_end() const
{ return this->lma_sections_.end(); }
Output_section_definition*
get_last_section() const
{ return this->last_section_; }
void
set_last_section(Output_section_definition* sec)
{ this->last_section_ = sec; }
private:
std::string name_;
unsigned int attributes_;
Expression* start_;
Expression* length_;
// The offset to the next free byte in the region.
// Note - for compatibility with GNU LD we only maintain one offset
// regardless of whether the region is being used for VMA values,
// LMA values, or both.
uint64_t current_offset_;
// A list of sections whose VMAs are set inside this region.
Section_list vma_sections_;
// A list of sections whose LMAs are set inside this region.
Section_list lma_sections_;
// The latest section to make use of this region.
Output_section_definition* last_section_;
};
// Return true if the provided section flags
// are compatible with this region's attributes.
bool
Memory_region::attributes_compatible(elfcpp::Elf_Xword flags,
elfcpp::Elf_Xword type) const
{
unsigned int attrs = this->attributes_;
// No attributes means that this region is not compatible with anything.
if (attrs == 0)
return false;
bool match = true;
do
{
switch (attrs & - attrs)
{
case MEM_EXECUTABLE:
if ((flags & elfcpp::SHF_EXECINSTR) == 0)
match = false;
break;
case MEM_WRITEABLE:
if ((flags & elfcpp::SHF_WRITE) == 0)
match = false;
break;
case MEM_READABLE:
// All sections are presumed readable.
break;
case MEM_ALLOCATABLE:
if ((flags & elfcpp::SHF_ALLOC) == 0)
match = false;
break;
case MEM_INITIALIZED:
if ((type & elfcpp::SHT_NOBITS) != 0)
match = false;
break;
}
attrs &= ~ (attrs & - attrs);
}
while (attrs != 0);
return match;
}
// Print a memory region.
void
Memory_region::print(FILE* f) const
{
fprintf(f, " %s", this->name_.c_str());
unsigned int attrs = this->attributes_;
if (attrs != 0)
{
fprintf(f, " (");
do
{
switch (attrs & - attrs)
{
case MEM_EXECUTABLE: fputc('x', f); break;
case MEM_WRITEABLE: fputc('w', f); break;
case MEM_READABLE: fputc('r', f); break;
case MEM_ALLOCATABLE: fputc('a', f); break;
case MEM_INITIALIZED: fputc('i', f); break;
default:
gold_unreachable();
}
attrs &= ~ (attrs & - attrs);
}
while (attrs != 0);
fputc(')', f);
}
fprintf(f, " : origin = ");
this->start_->print(f);
fprintf(f, ", length = ");
this->length_->print(f);
fprintf(f, "\n");
}
// Manage orphan sections. This is intended to be largely compatible
// with the GNU linker. The Linux kernel implicitly relies on
// something similar to the GNU linker's orphan placement. We
// originally used a simpler scheme here, but it caused the kernel
// build to fail, and was also rather inefficient.
class Orphan_section_placement
{
private:
typedef Script_sections::Elements_iterator Elements_iterator;
public:
Orphan_section_placement();
// Handle an output section during initialization of this mapping.
void
output_section_init(const std::string& name, Output_section*,
Elements_iterator location);
// Initialize the last location.
void
last_init(Elements_iterator location);
// Set *PWHERE to the address of an iterator pointing to the
// location to use for an orphan section. Return true if the
// iterator has a value, false otherwise.
bool
find_place(Output_section*, Elements_iterator** pwhere);
// Update PLACE_LAST_ALLOC.
void
update_last_alloc(Elements_iterator where);
// Return the iterator being used for sections at the very end of
// the linker script.
Elements_iterator
last_place() const;
private:
// The places that we specifically recognize. This list is copied
// from the GNU linker.
enum Place_index
{
PLACE_TEXT,
PLACE_RODATA,
PLACE_DATA,
PLACE_TLS,
PLACE_TLS_BSS,
PLACE_BSS,
PLACE_LAST_ALLOC,
PLACE_REL,
PLACE_INTERP,
PLACE_NONALLOC,
PLACE_LAST,
PLACE_MAX
};
// The information we keep for a specific place.
struct Place
{
// The name of sections for this place.
const char* name;
// Whether we have a location for this place.
bool have_location;
// The iterator for this place.
Elements_iterator location;
};
// Initialize one place element.
void
initialize_place(Place_index, const char*);
// The places.
Place places_[PLACE_MAX];
// True if this is the first call to output_section_init.
bool first_init_;
};
// Initialize Orphan_section_placement.
Orphan_section_placement::Orphan_section_placement()
: first_init_(true)
{
this->initialize_place(PLACE_TEXT, ".text");
this->initialize_place(PLACE_RODATA, ".rodata");
this->initialize_place(PLACE_DATA, ".data");
this->initialize_place(PLACE_TLS, NULL);
this->initialize_place(PLACE_TLS_BSS, NULL);
this->initialize_place(PLACE_BSS, ".bss");
this->initialize_place(PLACE_LAST_ALLOC, NULL);
this->initialize_place(PLACE_REL, NULL);
this->initialize_place(PLACE_INTERP, ".interp");
this->initialize_place(PLACE_NONALLOC, NULL);
this->initialize_place(PLACE_LAST, NULL);
}
// Initialize one place element.
void
Orphan_section_placement::initialize_place(Place_index index, const char* name)
{
this->places_[index].name = name;
this->places_[index].have_location = false;
}
// While initializing the Orphan_section_placement information, this
// is called once for each output section named in the linker script.
// If we found an output section during the link, it will be passed in
// OS.
void
Orphan_section_placement::output_section_init(const std::string& name,
Output_section* os,
Elements_iterator location)
{
bool first_init = this->first_init_;
this->first_init_ = false;
// Remember the last allocated section. Any orphan bss sections
// will be placed after it.
if (os != NULL
&& (os->flags() & elfcpp::SHF_ALLOC) != 0)
{
this->places_[PLACE_LAST_ALLOC].location = location;
this->places_[PLACE_LAST_ALLOC].have_location = true;
}
for (int i = 0; i < PLACE_MAX; ++i)
{
if (this->places_[i].name != NULL && this->places_[i].name == name)
{
if (this->places_[i].have_location)
{
// We have already seen a section with this name.
return;
}
this->places_[i].location = location;
this->places_[i].have_location = true;
// If we just found the .bss section, restart the search for
// an unallocated section. This follows the GNU linker's
// behaviour.
if (i == PLACE_BSS)
this->places_[PLACE_NONALLOC].have_location = false;
return;
}
}
// Relocation sections.
if (!this->places_[PLACE_REL].have_location
&& os != NULL
&& (os->type() == elfcpp::SHT_REL || os->type() == elfcpp::SHT_RELA)
&& (os->flags() & elfcpp::SHF_ALLOC) != 0)
{
this->places_[PLACE_REL].location = location;
this->places_[PLACE_REL].have_location = true;
}
// We find the location for unallocated sections by finding the
// first debugging or comment section after the BSS section (if
// there is one).
if (!this->places_[PLACE_NONALLOC].have_location
&& (name == ".comment" || Layout::is_debug_info_section(name.c_str())))
{
// We add orphan sections after the location in PLACES_. We
// want to store unallocated sections before LOCATION. If this
// is the very first section, we can't use it.
if (!first_init)
{
--location;
this->places_[PLACE_NONALLOC].location = location;
this->places_[PLACE_NONALLOC].have_location = true;
}
}
}
// Initialize the last location.
void
Orphan_section_placement::last_init(Elements_iterator location)
{
this->places_[PLACE_LAST].location = location;
this->places_[PLACE_LAST].have_location = true;
}
// Set *PWHERE to the address of an iterator pointing to the location
// to use for an orphan section. Return true if the iterator has a
// value, false otherwise.
bool
Orphan_section_placement::find_place(Output_section* os,
Elements_iterator** pwhere)
{
// Figure out where OS should go. This is based on the GNU linker
// code. FIXME: The GNU linker handles small data sections
// specially, but we don't.
elfcpp::Elf_Word type = os->type();
elfcpp::Elf_Xword flags = os->flags();
Place_index index;
if ((flags & elfcpp::SHF_ALLOC) == 0
&& !Layout::is_debug_info_section(os->name()))
index = PLACE_NONALLOC;
else if ((flags & elfcpp::SHF_ALLOC) == 0)
index = PLACE_LAST;
else if (type == elfcpp::SHT_NOTE)
index = PLACE_INTERP;
else if ((flags & elfcpp::SHF_TLS) != 0)
{
if (type == elfcpp::SHT_NOBITS)
index = PLACE_TLS_BSS;
else
index = PLACE_TLS;
}
else if (type == elfcpp::SHT_NOBITS)
index = PLACE_BSS;
else if ((flags & elfcpp::SHF_WRITE) != 0)
index = PLACE_DATA;
else if (type == elfcpp::SHT_REL || type == elfcpp::SHT_RELA)
index = PLACE_REL;
else if ((flags & elfcpp::SHF_EXECINSTR) == 0)
index = PLACE_RODATA;
else
index = PLACE_TEXT;
// If we don't have a location yet, try to find one based on a
// plausible ordering of sections.
if (!this->places_[index].have_location)
{
Place_index follow;
switch (index)
{
default:
follow = PLACE_MAX;
break;
case PLACE_RODATA:
follow = PLACE_TEXT;
break;
case PLACE_DATA:
follow = PLACE_RODATA;
if (!this->places_[PLACE_RODATA].have_location)
follow = PLACE_TEXT;
break;
case PLACE_BSS:
follow = PLACE_LAST_ALLOC;
break;
case PLACE_REL:
follow = PLACE_TEXT;
break;
case PLACE_INTERP:
follow = PLACE_TEXT;
break;
case PLACE_TLS:
follow = PLACE_DATA;
break;
case PLACE_TLS_BSS:
follow = PLACE_TLS;
if (!this->places_[PLACE_TLS].have_location)
follow = PLACE_DATA;
break;
}
if (follow != PLACE_MAX && this->places_[follow].have_location)
{
// Set the location of INDEX to the location of FOLLOW. The
// location of INDEX will then be incremented by the caller,
// so anything in INDEX will continue to be after anything
// in FOLLOW.
this->places_[index].location = this->places_[follow].location;
this->places_[index].have_location = true;
}
}
*pwhere = &this->places_[index].location;
bool ret = this->places_[index].have_location;
// The caller will set the location.
this->places_[index].have_location = true;
return ret;
}
// Update PLACE_LAST_ALLOC.
void
Orphan_section_placement::update_last_alloc(Elements_iterator elem)
{
Elements_iterator prev = elem;
--prev;
if (this->places_[PLACE_LAST_ALLOC].have_location
&& this->places_[PLACE_LAST_ALLOC].location == prev)
{
this->places_[PLACE_LAST_ALLOC].have_location = true;
this->places_[PLACE_LAST_ALLOC].location = elem;
}
}
// Return the iterator being used for sections at the very end of the
// linker script.
Orphan_section_placement::Elements_iterator
Orphan_section_placement::last_place() const
{
gold_assert(this->places_[PLACE_LAST].have_location);
return this->places_[PLACE_LAST].location;
}
// An element in a SECTIONS clause.
class Sections_element
{
public:
Sections_element()
{ }
virtual ~Sections_element()
{ }
// Return whether an output section is relro.
virtual bool
is_relro() const
{ return false; }
// Record that an output section is relro.
virtual void
set_is_relro()
{ }
// Create any required output sections. The only real
// implementation is in Output_section_definition.
virtual void
create_sections(Layout*)
{ }
// Add any symbol being defined to the symbol table.
virtual void
add_symbols_to_table(Symbol_table*)
{ }
// Finalize symbols and check assertions.
virtual void
finalize_symbols(Symbol_table*, const Layout*, uint64_t*)
{ }
// Return the output section name to use for an input file name and
// section name. This only real implementation is in
// Output_section_definition.
virtual const char*
output_section_name(const char*, const char*, Output_section***,
Script_sections::Section_type*, bool*, bool)
{ return NULL; }
// Initialize OSP with an output section.
virtual void
orphan_section_init(Orphan_section_placement*,
Script_sections::Elements_iterator)
{ }
// Set section addresses. This includes applying assignments if the
// expression is an absolute value.
virtual void
set_section_addresses(Symbol_table*, Layout*, uint64_t*, uint64_t*,
uint64_t*)
{ }
// Check a constraint (ONLY_IF_RO, etc.) on an output section. If
// this section is constrained, and the input sections do not match,
// return the constraint, and set *POSD.
virtual Section_constraint
check_constraint(Output_section_definition**)
{ return CONSTRAINT_NONE; }
// See if this is the alternate output section for a constrained
// output section. If it is, transfer the Output_section and return
// true. Otherwise return false.
virtual bool
alternate_constraint(Output_section_definition*, Section_constraint)
{ return false; }
// Get the list of segments to use for an allocated section when
// using a PHDRS clause. If this is an allocated section, return
// the Output_section, and set *PHDRS_LIST (the first parameter) to
// the list of PHDRS to which it should be attached. If the PHDRS
// were not specified, don't change *PHDRS_LIST. When not returning
// NULL, set *ORPHAN (the second parameter) according to whether
// this is an orphan section--one that is not mentioned in the
// linker script.
virtual Output_section*
allocate_to_segment(String_list**, bool*)
{ return NULL; }
// Look for an output section by name and return the address, the
// load address, the alignment, and the size. This is used when an
// expression refers to an output section which was not actually
// created. This returns true if the section was found, false
// otherwise. The only real definition is for
// Output_section_definition.
virtual bool
get_output_section_info(const char*, uint64_t*, uint64_t*, uint64_t*,
uint64_t*) const
{ return false; }
// Return the associated Output_section if there is one.
virtual Output_section*
get_output_section() const
{ return NULL; }
// Set the section's memory regions.
virtual void
set_memory_region(Memory_region*, bool)
{ gold_error(_("Attempt to set a memory region for a non-output section")); }
// Print the element for debugging purposes.
virtual void
print(FILE* f) const = 0;
};
// An assignment in a SECTIONS clause outside of an output section.
class Sections_element_assignment : public Sections_element
{
public:
Sections_element_assignment(const char* name, size_t namelen,
Expression* val, bool provide, bool hidden)
: assignment_(name, namelen, false, val, provide, hidden)
{ }
// Add the symbol to the symbol table.
void
add_symbols_to_table(Symbol_table* symtab)
{ this->assignment_.add_to_table(symtab); }
// Finalize the symbol.
void
finalize_symbols(Symbol_table* symtab, const Layout* layout,
uint64_t* dot_value)
{
this->assignment_.finalize_with_dot(symtab, layout, *dot_value, NULL);
}
// Set the section address. There is no section here, but if the
// value is absolute, we set the symbol. This permits us to use
// absolute symbols when setting dot.
void
set_section_addresses(Symbol_table* symtab, Layout* layout,
uint64_t* dot_value, uint64_t*, uint64_t*)
{
this->assignment_.set_if_absolute(symtab, layout, true, *dot_value, NULL);
}
// Print for debugging.
void
print(FILE* f) const
{
fprintf(f, " ");
this->assignment_.print(f);
}
private:
Symbol_assignment assignment_;
};
// An assignment to the dot symbol in a SECTIONS clause outside of an
// output section.
class Sections_element_dot_assignment : public Sections_element
{
public:
Sections_element_dot_assignment(Expression* val)
: val_(val)
{ }
// Finalize the symbol.
void
finalize_symbols(Symbol_table* symtab, const Layout* layout,
uint64_t* dot_value)
{
// We ignore the section of the result because outside of an
// output section definition the dot symbol is always considered
// to be absolute.
*dot_value = this->val_->eval_with_dot(symtab, layout, true, *dot_value,
NULL, NULL, NULL, false);
}
// Update the dot symbol while setting section addresses.
void
set_section_addresses(Symbol_table* symtab, Layout* layout,
uint64_t* dot_value, uint64_t* dot_alignment,
uint64_t* load_address)
{
*dot_value = this->val_->eval_with_dot(symtab, layout, false, *dot_value,
NULL, NULL, dot_alignment, false);
*load_address = *dot_value;
}
// Print for debugging.
void
print(FILE* f) const
{
fprintf(f, " . = ");
this->val_->print(f);
fprintf(f, "\n");
}
private:
Expression* val_;
};
// An assertion in a SECTIONS clause outside of an output section.
class Sections_element_assertion : public Sections_element
{
public:
Sections_element_assertion(Expression* check, const char* message,
size_t messagelen)
: assertion_(check, message, messagelen)
{ }
// Check the assertion.
void
finalize_symbols(Symbol_table* symtab, const Layout* layout, uint64_t*)
{ this->assertion_.check(symtab, layout); }
// Print for debugging.
void
print(FILE* f) const
{
fprintf(f, " ");
this->assertion_.print(f);
}
private:
Script_assertion assertion_;
};
// An element in an output section in a SECTIONS clause.
class Output_section_element
{
public:
// A list of input sections.
typedef std::list<Output_section::Input_section> Input_section_list;
Output_section_element()
{ }
virtual ~Output_section_element()
{ }
// Return whether this element requires an output section to exist.
virtual bool
needs_output_section() const
{ return false; }
// Add any symbol being defined to the symbol table.
virtual void
add_symbols_to_table(Symbol_table*)
{ }
// Finalize symbols and check assertions.
virtual void
finalize_symbols(Symbol_table*, const Layout*, uint64_t*, Output_section**)
{ }
// Return whether this element matches FILE_NAME and SECTION_NAME.
// The only real implementation is in Output_section_element_input.
virtual bool
match_name(const char*, const char*, bool *) const
{ return false; }
// Set section addresses. This includes applying assignments if the
// expression is an absolute value.
virtual void
set_section_addresses(Symbol_table*, Layout*, Output_section*, uint64_t,
uint64_t*, uint64_t*, Output_section**, std::string*,
Input_section_list*)
{ }
// Print the element for debugging purposes.
virtual void
print(FILE* f) const = 0;
protected:
// Return a fill string that is LENGTH bytes long, filling it with
// FILL.
std::string
get_fill_string(const std::string* fill, section_size_type length) const;
};
std::string
Output_section_element::get_fill_string(const std::string* fill,
section_size_type length) const
{
std::string this_fill;
this_fill.reserve(length);
while (this_fill.length() + fill->length() <= length)
this_fill += *fill;
if (this_fill.length() < length)
this_fill.append(*fill, 0, length - this_fill.length());
return this_fill;
}
// A symbol assignment in an output section.
class Output_section_element_assignment : public Output_section_element
{
public:
Output_section_element_assignment(const char* name, size_t namelen,
Expression* val, bool provide,
bool hidden)
: assignment_(name, namelen, false, val, provide, hidden)
{ }
// Add the symbol to the symbol table.
void
add_symbols_to_table(Symbol_table* symtab)
{ this->assignment_.add_to_table(symtab); }
// Finalize the symbol.
void
finalize_symbols(Symbol_table* symtab, const Layout* layout,
uint64_t* dot_value, Output_section** dot_section)
{
this->assignment_.finalize_with_dot(symtab, layout, *dot_value,
*dot_section);
}
// Set the section address. There is no section here, but if the
// value is absolute, we set the symbol. This permits us to use
// absolute symbols when setting dot.
void
set_section_addresses(Symbol_table* symtab, Layout* layout, Output_section*,
uint64_t, uint64_t* dot_value, uint64_t*,
Output_section** dot_section, std::string*,
Input_section_list*)
{
this->assignment_.set_if_absolute(symtab, layout, true, *dot_value,
*dot_section);
}
// Print for debugging.
void
print(FILE* f) const
{
fprintf(f, " ");
this->assignment_.print(f);
}
private:
Symbol_assignment assignment_;
};
// An assignment to the dot symbol in an output section.
class Output_section_element_dot_assignment : public Output_section_element
{
public:
Output_section_element_dot_assignment(Expression* val)
: val_(val)
{ }
// An assignment to dot within an output section is enough to force
// the output section to exist.
bool
needs_output_section() const
{ return true; }
// Finalize the symbol.
void
finalize_symbols(Symbol_table* symtab, const Layout* layout,
uint64_t* dot_value, Output_section** dot_section)
{
*dot_value = this->val_->eval_with_dot(symtab, layout, true, *dot_value,
*dot_section, dot_section, NULL,
true);
}
// Update the dot symbol while setting section addresses.
void
set_section_addresses(Symbol_table* symtab, Layout* layout, Output_section*,
uint64_t, uint64_t* dot_value, uint64_t*,
Output_section** dot_section, std::string*,
Input_section_list*);
// Print for debugging.
void
print(FILE* f) const
{
fprintf(f, " . = ");
this->val_->print(f);
fprintf(f, "\n");
}
private:
Expression* val_;
};
// Update the dot symbol while setting section addresses.
void
Output_section_element_dot_assignment::set_section_addresses(
Symbol_table* symtab,
Layout* layout,
Output_section* output_section,
uint64_t,
uint64_t* dot_value,
uint64_t* dot_alignment,
Output_section** dot_section,
std::string* fill,
Input_section_list*)
{
uint64_t next_dot = this->val_->eval_with_dot(symtab, layout, false,
*dot_value, *dot_section,
dot_section, dot_alignment,
true);
if (next_dot < *dot_value)
gold_error(_("dot may not move backward"));
if (next_dot > *dot_value && output_section != NULL)
{
section_size_type length = convert_to_section_size_type(next_dot
- *dot_value);
Output_section_data* posd;
if (fill->empty())
posd = new Output_data_zero_fill(length, 0);
else
{
std::string this_fill = this->get_fill_string(fill, length);
posd = new Output_data_const(this_fill, 0);
}
output_section->add_output_section_data(posd);
layout->new_output_section_data_from_script(posd);
}
*dot_value = next_dot;
}
// An assertion in an output section.
class Output_section_element_assertion : public Output_section_element
{
public:
Output_section_element_assertion(Expression* check, const char* message,
size_t messagelen)
: assertion_(check, message, messagelen)
{ }
void
print(FILE* f) const
{
fprintf(f, " ");
this->assertion_.print(f);
}
private:
Script_assertion assertion_;
};
// We use a special instance of Output_section_data to handle BYTE,
// SHORT, etc. This permits forward references to symbols in the
// expressions.
class Output_data_expression : public Output_section_data
{
public:
Output_data_expression(int size, bool is_signed, Expression* val,
const Symbol_table* symtab, const Layout* layout,
uint64_t dot_value, Output_section* dot_section)
: Output_section_data(size, 0, true),
is_signed_(is_signed), val_(val), symtab_(symtab),
layout_(layout), dot_value_(dot_value), dot_section_(dot_section)
{ }
protected:
// Write the data to the output file.
void
do_write(Output_file*);
// Write the data to a buffer.
void
do_write_to_buffer(unsigned char*);
// Write to a map file.
void
do_print_to_mapfile(Mapfile* mapfile) const
{ mapfile->print_output_data(this, _("** expression")); }
private:
template<bool big_endian>
void
endian_write_to_buffer(uint64_t, unsigned char*);
bool is_signed_;
Expression* val_;
const Symbol_table* symtab_;
const Layout* layout_;
uint64_t dot_value_;
Output_section* dot_section_;
};
// Write the data element to the output file.
void
Output_data_expression::do_write(Output_file* of)
{
unsigned char* view = of->get_output_view(this->offset(), this->data_size());
this->write_to_buffer(view);
of->write_output_view(this->offset(), this->data_size(), view);
}
// Write the data element to a buffer.
void
Output_data_expression::do_write_to_buffer(unsigned char* buf)
{
uint64_t val = this->val_->eval_with_dot(this->symtab_, this->layout_,
true, this->dot_value_,
this->dot_section_, NULL, NULL,
false);
if (parameters->target().is_big_endian())
this->endian_write_to_buffer<true>(val, buf);
else
this->endian_write_to_buffer<false>(val, buf);
}
template<bool big_endian>
void
Output_data_expression::endian_write_to_buffer(uint64_t val,
unsigned char* buf)
{
switch (this->data_size())
{
case 1:
elfcpp::Swap_unaligned<8, big_endian>::writeval(buf, val);
break;
case 2:
elfcpp::Swap_unaligned<16, big_endian>::writeval(buf, val);
break;
case 4:
elfcpp::Swap_unaligned<32, big_endian>::writeval(buf, val);
break;
case 8:
if (parameters->target().get_size() == 32)
{
val &= 0xffffffff;
if (this->is_signed_ && (val & 0x80000000) != 0)
val |= 0xffffffff00000000LL;
}
elfcpp::Swap_unaligned<64, big_endian>::writeval(buf, val);
break;
default:
gold_unreachable();
}
}
// A data item in an output section.
class Output_section_element_data : public Output_section_element
{
public:
Output_section_element_data(int size, bool is_signed, Expression* val)
: size_(size), is_signed_(is_signed), val_(val)
{ }
// If there is a data item, then we must create an output section.
bool
needs_output_section() const
{ return true; }
// Finalize symbols--we just need to update dot.
void
finalize_symbols(Symbol_table*, const Layout*, uint64_t* dot_value,
Output_section**)
{ *dot_value += this->size_; }
// Store the value in the section.
void
set_section_addresses(Symbol_table*, Layout*, Output_section*, uint64_t,
uint64_t* dot_value, uint64_t*, Output_section**,
std::string*, Input_section_list*);
// Print for debugging.
void
print(FILE*) const;
private:
// The size in bytes.
int size_;
// Whether the value is signed.
bool is_signed_;
// The value.
Expression* val_;
};
// Store the value in the section.
void
Output_section_element_data::set_section_addresses(
Symbol_table* symtab,
Layout* layout,
Output_section* os,
uint64_t,
uint64_t* dot_value,
uint64_t*,
Output_section** dot_section,
std::string*,
Input_section_list*)
{
gold_assert(os != NULL);
Output_data_expression* expression =
new Output_data_expression(this->size_, this->is_signed_, this->val_,
symtab, layout, *dot_value, *dot_section);
os->add_output_section_data(expression);
layout->new_output_section_data_from_script(expression);
*dot_value += this->size_;
}
// Print for debugging.
void
Output_section_element_data::print(FILE* f) const
{
const char* s;
switch (this->size_)
{
case 1:
s = "BYTE";
break;
case 2:
s = "SHORT";
break;
case 4:
s = "LONG";
break;
case 8:
if (this->is_signed_)
s = "SQUAD";
else
s = "QUAD";
break;
default:
gold_unreachable();
}
fprintf(f, " %s(", s);
this->val_->print(f);
fprintf(f, ")\n");
}
// A fill value setting in an output section.
class Output_section_element_fill : public Output_section_element
{
public:
Output_section_element_fill(Expression* val)
: val_(val)
{ }
// Update the fill value while setting section addresses.
void
set_section_addresses(Symbol_table* symtab, Layout* layout, Output_section*,
uint64_t, uint64_t* dot_value, uint64_t*,
Output_section** dot_section,
std::string* fill, Input_section_list*)
{
Output_section* fill_section;
uint64_t fill_val = this->val_->eval_with_dot(symtab, layout, false,
*dot_value, *dot_section,
&fill_section, NULL, false);
if (fill_section != NULL)
gold_warning(_("fill value is not absolute"));
// FIXME: The GNU linker supports fill values of arbitrary length.
unsigned char fill_buff[4];
elfcpp::Swap_unaligned<32, true>::writeval(fill_buff, fill_val);
fill->assign(reinterpret_cast<char*>(fill_buff), 4);
}
// Print for debugging.
void
print(FILE* f) const
{
fprintf(f, " FILL(");
this->val_->print(f);
fprintf(f, ")\n");
}
private:
// The new fill value.
Expression* val_;
};
// An input section specification in an output section
class Output_section_element_input : public Output_section_element
{
public:
Output_section_element_input(const Input_section_spec* spec, bool keep);
// Finalize symbols--just update the value of the dot symbol.
void
finalize_symbols(Symbol_table*, const Layout*, uint64_t* dot_value,
Output_section** dot_section)
{
*dot_value = this->final_dot_value_;
*dot_section = this->final_dot_section_;
}
// See whether we match FILE_NAME and SECTION_NAME as an input section.
// If we do then also indicate whether the section should be KEPT.
bool
match_name(const char* file_name, const char* section_name, bool* keep) const;
// Set the section address.
void
set_section_addresses(Symbol_table* symtab, Layout* layout, Output_section*,
uint64_t subalign, uint64_t* dot_value, uint64_t*,
Output_section**, std::string* fill,
Input_section_list*);
// Print for debugging.
void
print(FILE* f) const;
private:
// An input section pattern.
struct Input_section_pattern
{
std::string pattern;
bool pattern_is_wildcard;
Sort_wildcard sort;
Input_section_pattern(const char* patterna, size_t patternlena,
Sort_wildcard sorta)
: pattern(patterna, patternlena),
pattern_is_wildcard(is_wildcard_string(this->pattern.c_str())),
sort(sorta)
{ }
};
typedef std::vector<Input_section_pattern> Input_section_patterns;
// Filename_exclusions is a pair of filename pattern and a bool
// indicating whether the filename is a wildcard.
typedef std::vector<std::pair<std::string, bool> > Filename_exclusions;
// Return whether STRING matches PATTERN, where IS_WILDCARD_PATTERN
// indicates whether this is a wildcard pattern.
static inline bool
match(const char* string, const char* pattern, bool is_wildcard_pattern)
{
return (is_wildcard_pattern
? fnmatch(pattern, string, 0) == 0
: strcmp(string, pattern) == 0);
}
// See if we match a file name.
bool
match_file_name(const char* file_name) const;
// The file name pattern. If this is the empty string, we match all
// files.
std::string filename_pattern_;
// Whether the file name pattern is a wildcard.
bool filename_is_wildcard_;
// How the file names should be sorted. This may only be
// SORT_WILDCARD_NONE or SORT_WILDCARD_BY_NAME.
Sort_wildcard filename_sort_;
// The list of file names to exclude.
Filename_exclusions filename_exclusions_;
// The list of input section patterns.
Input_section_patterns input_section_patterns_;
// Whether to keep this section when garbage collecting.
bool keep_;
// The value of dot after including all matching sections.
uint64_t final_dot_value_;
// The section where dot is defined after including all matching
// sections.
Output_section* final_dot_section_;
};
// Construct Output_section_element_input. The parser records strings
// as pointers into a copy of the script file, which will go away when
// parsing is complete. We make sure they are in std::string objects.
Output_section_element_input::Output_section_element_input(
const Input_section_spec* spec,
bool keep)
: filename_pattern_(),
filename_is_wildcard_(false),
filename_sort_(spec->file.sort),
filename_exclusions_(),
input_section_patterns_(),
keep_(keep),
final_dot_value_(0),
final_dot_section_(NULL)
{
// The filename pattern "*" is common, and matches all files. Turn
// it into the empty string.
if (spec->file.name.length != 1 || spec->file.name.value[0] != '*')
this->filename_pattern_.assign(spec->file.name.value,
spec->file.name.length);
this->filename_is_wildcard_ = is_wildcard_string(this->filename_pattern_.c_str());
if (spec->input_sections.exclude != NULL)
{
for (String_list::const_iterator p =
spec->input_sections.exclude->begin();
p != spec->input_sections.exclude->end();
++p)
{
bool is_wildcard = is_wildcard_string((*p).c_str());
this->filename_exclusions_.push_back(std::make_pair(*p,
is_wildcard));
}
}
if (spec->input_sections.sections != NULL)
{
Input_section_patterns& isp(this->input_section_patterns_);
for (String_sort_list::const_iterator p =
spec->input_sections.sections->begin();
p != spec->input_sections.sections->end();
++p)
isp.push_back(Input_section_pattern(p->name.value, p->name.length,
p->sort));
}
}
// See whether we match FILE_NAME.
bool
Output_section_element_input::match_file_name(const char* file_name) const
{
if (!this->filename_pattern_.empty())
{
// If we were called with no filename, we refuse to match a
// pattern which requires a file name.
if (file_name == NULL)
return false;
if (!match(file_name, this->filename_pattern_.c_str(),
this->filename_is_wildcard_))
return false;
}
if (file_name != NULL)
{
// Now we have to see whether FILE_NAME matches one of the
// exclusion patterns, if any.
for (Filename_exclusions::const_iterator p =
this->filename_exclusions_.begin();
p != this->filename_exclusions_.end();
++p)
{
if (match(file_name, p->first.c_str(), p->second))
return false;
}
}
return true;
}
// See whether we match FILE_NAME and SECTION_NAME. If we do then
// KEEP indicates whether the section should survive garbage collection.
bool
Output_section_element_input::match_name(const char* file_name,
const char* section_name,
bool *keep) const
{
if (!this->match_file_name(file_name))
return false;
*keep = this->keep_;
// If there are no section name patterns, then we match.
if (this->input_section_patterns_.empty())
return true;
// See whether we match the section name patterns.
for (Input_section_patterns::const_iterator p =
this->input_section_patterns_.begin();
p != this->input_section_patterns_.end();
++p)
{
if (match(section_name, p->pattern.c_str(), p->pattern_is_wildcard))
return true;
}
// We didn't match any section names, so we didn't match.
return false;
}
// Information we use to sort the input sections.
class Input_section_info
{
public:
Input_section_info(const Output_section::Input_section& input_section)
: input_section_(input_section), section_name_(),
size_(0), addralign_(1)
{ }
// Return the simple input section.
const Output_section::Input_section&
input_section() const
{ return this->input_section_; }
// Return the object.
Relobj*
relobj() const
{ return this->input_section_.relobj(); }
// Return the section index.
unsigned int
shndx()
{ return this->input_section_.shndx(); }
// Return the section name.
const std::string&
section_name() const
{ return this->section_name_; }
// Set the section name.
void
set_section_name(const std::string name)
{
if (is_compressed_debug_section(name.c_str()))
this->section_name_ = corresponding_uncompressed_section_name(name);
else
this->section_name_ = name;
}
// Return the section size.
uint64_t
size() const
{ return this->size_; }
// Set the section size.
void
set_size(uint64_t size)
{ this->size_ = size; }
// Return the address alignment.
uint64_t
addralign() const
{ return this->addralign_; }
// Set the address alignment.
void
set_addralign(uint64_t addralign)
{ this->addralign_ = addralign; }
private:
// Input section, can be a relaxed section.
Output_section::Input_section input_section_;
// Name of the section.
std::string section_name_;
// Section size.
uint64_t size_;
// Address alignment.
uint64_t addralign_;
};
// A class to sort the input sections.
class Input_section_sorter
{
public:
Input_section_sorter(Sort_wildcard filename_sort, Sort_wildcard section_sort)
: filename_sort_(filename_sort), section_sort_(section_sort)
{ }
bool
operator()(const Input_section_info&, const Input_section_info&) const;
private:
static unsigned long
get_init_priority(const char*);
Sort_wildcard filename_sort_;
Sort_wildcard section_sort_;
};
// Return a relative priority of the section with the specified NAME
// (a lower value meand a higher priority), or 0 if it should be compared
// with others as strings.
// The implementation of this function is copied from ld/ldlang.c.
unsigned long
Input_section_sorter::get_init_priority(const char* name)
{
char* end;
unsigned long init_priority;
// GCC uses the following section names for the init_priority
// attribute with numerical values 101 and 65535 inclusive. A
// lower value means a higher priority.
//
// 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
// decimal numerical value of the init_priority attribute.
// The order of execution in .init_array is forward and
// .fini_array is backward.
// 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
// decimal numerical value of the init_priority attribute.
// The order of execution in .ctors is backward and .dtors
// is forward.
if (strncmp(name, ".init_array.", 12) == 0
|| strncmp(name, ".fini_array.", 12) == 0)
{
init_priority = strtoul(name + 12, &end, 10);
return *end ? 0 : init_priority;
}
else if (strncmp(name, ".ctors.", 7) == 0
|| strncmp(name, ".dtors.", 7) == 0)
{
init_priority = strtoul(name + 7, &end, 10);
return *end ? 0 : 65535 - init_priority;
}
return 0;
}
bool
Input_section_sorter::operator()(const Input_section_info& isi1,
const Input_section_info& isi2) const
{
if (this->section_sort_ == SORT_WILDCARD_BY_INIT_PRIORITY)
{
unsigned long ip1 = get_init_priority(isi1.section_name().c_str());
unsigned long ip2 = get_init_priority(isi2.section_name().c_str());
if (ip1 != 0 && ip2 != 0 && ip1 != ip2)
return ip1 < ip2;
}
if (this->section_sort_ == SORT_WILDCARD_BY_NAME
|| this->section_sort_ == SORT_WILDCARD_BY_NAME_BY_ALIGNMENT
|| (this->section_sort_ == SORT_WILDCARD_BY_ALIGNMENT_BY_NAME
&& isi1.addralign() == isi2.addralign())
|| this->section_sort_ == SORT_WILDCARD_BY_INIT_PRIORITY)
{
if (isi1.section_name() != isi2.section_name())
return isi1.section_name() < isi2.section_name();
}
if (this->section_sort_ == SORT_WILDCARD_BY_ALIGNMENT
|| this->section_sort_ == SORT_WILDCARD_BY_NAME_BY_ALIGNMENT
|| this->section_sort_ == SORT_WILDCARD_BY_ALIGNMENT_BY_NAME)
{
if (isi1.addralign() != isi2.addralign())
return isi1.addralign() < isi2.addralign();
}
if (this->filename_sort_ == SORT_WILDCARD_BY_NAME)
{
if (isi1.relobj()->name() != isi2.relobj()->name())
return (isi1.relobj()->name() < isi2.relobj()->name());
}
// Otherwise we leave them in the same order.
return false;
}
// Set the section address. Look in INPUT_SECTIONS for sections which
// match this spec, sort them as specified, and add them to the output
// section.
void
Output_section_element_input::set_section_addresses(
Symbol_table*,
Layout* layout,
Output_section* output_section,
uint64_t subalign,
uint64_t* dot_value,
uint64_t*,
Output_section** dot_section,
std::string* fill,
Input_section_list* input_sections)
{
// We build a list of sections which match each
// Input_section_pattern.
// If none of the patterns specify a sort option, we throw all
// matching input sections into a single bin, in the order we
// find them. Otherwise, we put matching input sections into
// a separate bin for each pattern, and sort each one as
// specified. Thus, an input section spec like this:
// *(.foo .bar)
// will group all .foo and .bar sections in the order seen,
// whereas this:
// *(.foo) *(.bar)
// will group all .foo sections followed by all .bar sections.
// This matches Gnu ld behavior.
// Things get really weird, though, when you add a sort spec
// on some, but not all, of the patterns, like this:
// *(SORT_BY_NAME(.foo) .bar)
// We do not attempt to match Gnu ld behavior in this case.
typedef std::vector<std::vector<Input_section_info> > Matching_sections;
size_t input_pattern_count = this->input_section_patterns_.size();
size_t bin_count = 1;
bool any_patterns_with_sort = false;
for (size_t i = 0; i < input_pattern_count; ++i)
{
const Input_section_pattern& isp(this->input_section_patterns_[i]);
if (isp.sort != SORT_WILDCARD_NONE)
any_patterns_with_sort = true;
}
if (any_patterns_with_sort)
bin_count = input_pattern_count;
Matching_sections matching_sections(bin_count);
// Look through the list of sections for this output section. Add
// each one which matches to one of the elements of
// MATCHING_SECTIONS.
Input_section_list::iterator p = input_sections->begin();
while (p != input_sections->end())
{
Relobj* relobj = p->relobj();
unsigned int shndx = p->shndx();
Input_section_info isi(*p);
// Calling section_name and section_addralign is not very
// efficient.
// Lock the object so that we can get information about the
// section. This is OK since we know we are single-threaded
// here.
{
const Task* task = reinterpret_cast<const Task*>(-1);
Task_lock_obj<Object> tl(task, relobj);
isi.set_section_name(relobj->section_name(shndx));
if (p->is_relaxed_input_section())
{
// We use current data size because relaxed section sizes may not
// have finalized yet.
isi.set_size(p->relaxed_input_section()->current_data_size());
isi.set_addralign(p->relaxed_input_section()->addralign());
}
else
{
isi.set_size(relobj->section_size(shndx));
isi.set_addralign(relobj->section_addralign(shndx));
}
}
if (!this->match_file_name(relobj->name().c_str()))
++p;
else if (this->input_section_patterns_.empty())
{
matching_sections[0].push_back(isi);
p = input_sections->erase(p);
}
else
{
size_t i;
for (i = 0; i < input_pattern_count; ++i)
{
const Input_section_pattern&
isp(this->input_section_patterns_[i]);
if (match(isi.section_name().c_str(), isp.pattern.c_str(),
isp.pattern_is_wildcard))
break;
}
if (i >= input_pattern_count)
++p;
else
{
if (i >= bin_count)
i = 0;
matching_sections[i].push_back(isi);
p = input_sections->erase(p);
}
}
}
// Look through MATCHING_SECTIONS. Sort each one as specified,
// using a stable sort so that we get the default order when
// sections are otherwise equal. Add each input section to the
// output section.
uint64_t dot = *dot_value;
for (size_t i = 0; i < bin_count; ++i)
{
if (matching_sections[i].empty())
continue;
gold_assert(output_section != NULL);
const Input_section_pattern& isp(this->input_section_patterns_[i]);
if (isp.sort != SORT_WILDCARD_NONE
|| this->filename_sort_ != SORT_WILDCARD_NONE)
std::stable_sort(matching_sections[i].begin(),
matching_sections[i].end(),
Input_section_sorter(this->filename_sort_,
isp.sort));
for (std::vector<Input_section_info>::const_iterator p =
matching_sections[i].begin();
p != matching_sections[i].end();
++p)
{
// Override the original address alignment if SUBALIGN is specified.
// We need to make a copy of the input section to modify the
// alignment.
Output_section::Input_section sis(p->input_section());
uint64_t this_subalign = sis.addralign();
if (!sis.is_input_section())
sis.output_section_data()->finalize_data_size();
uint64_t data_size = sis.data_size();
if (subalign > 0)
{
this_subalign = subalign;
sis.set_addralign(subalign);
}
uint64_t address = align_address(dot, this_subalign);
if (address > dot && !fill->empty())
{
section_size_type length =
convert_to_section_size_type(address - dot);
std::string this_fill = this->get_fill_string(fill, length);
Output_section_data* posd = new Output_data_const(this_fill, 0);
output_section->add_output_section_data(posd);
layout->new_output_section_data_from_script(posd);
}
output_section->add_script_input_section(sis);
dot = address + data_size;
}
}
// An SHF_TLS/SHT_NOBITS section does not take up any
// address space.
if (output_section == NULL
|| (output_section->flags() & elfcpp::SHF_TLS) == 0
|| output_section->type() != elfcpp::SHT_NOBITS)
*dot_value = dot;
this->final_dot_value_ = *dot_value;
this->final_dot_section_ = *dot_section;
}
// Print for debugging.
void
Output_section_element_input::print(FILE* f) const
{
fprintf(f, " ");
if (this->keep_)
fprintf(f, "KEEP(");
if (!this->filename_pattern_.empty())
{
bool need_close_paren = false;
switch (this->filename_sort_)
{
case SORT_WILDCARD_NONE:
break;
case SORT_WILDCARD_BY_NAME:
fprintf(f, "SORT_BY_NAME(");
need_close_paren = true;
break;
default:
gold_unreachable();
}
fprintf(f, "%s", this->filename_pattern_.c_str());
if (need_close_paren)
fprintf(f, ")");
}
if (!this->input_section_patterns_.empty()
|| !this->filename_exclusions_.empty())
{
fprintf(f, "(");
bool need_space = false;
if (!this->filename_exclusions_.empty())
{
fprintf(f, "EXCLUDE_FILE(");
bool need_comma = false;
for (Filename_exclusions::const_iterator p =
this->filename_exclusions_.begin();
p != this->filename_exclusions_.end();
++p)
{
if (need_comma)
fprintf(f, ", ");
fprintf(f, "%s", p->first.c_str());
need_comma = true;
}
fprintf(f, ")");
need_space = true;
}
for (Input_section_patterns::const_iterator p =
this->input_section_patterns_.begin();
p != this->input_section_patterns_.end();
++p)
{
if (need_space)
fprintf(f, " ");
int close_parens = 0;
switch (p->sort)
{
case SORT_WILDCARD_NONE:
break;
case SORT_WILDCARD_BY_NAME:
fprintf(f, "SORT_BY_NAME(");
close_parens = 1;
break;
case SORT_WILDCARD_BY_ALIGNMENT:
fprintf(f, "SORT_BY_ALIGNMENT(");
close_parens = 1;
break;
case SORT_WILDCARD_BY_NAME_BY_ALIGNMENT:
fprintf(f, "SORT_BY_NAME(SORT_BY_ALIGNMENT(");
close_parens = 2;
break;
case SORT_WILDCARD_BY_ALIGNMENT_BY_NAME:
fprintf(f, "SORT_BY_ALIGNMENT(SORT_BY_NAME(");
close_parens = 2;
break;
case SORT_WILDCARD_BY_INIT_PRIORITY:
fprintf(f, "SORT_BY_INIT_PRIORITY(");
close_parens = 1;
break;
default:
gold_unreachable();
}
fprintf(f, "%s", p->pattern.c_str());
for (int i = 0; i < close_parens; ++i)
fprintf(f, ")");
need_space = true;
}
fprintf(f, ")");
}
if (this->keep_)
fprintf(f, ")");
fprintf(f, "\n");
}
// An output section.
class Output_section_definition : public Sections_element
{
public:
typedef Output_section_element::Input_section_list Input_section_list;
Output_section_definition(const char* name, size_t namelen,
const Parser_output_section_header* header);
// Finish the output section with the information in the trailer.
void
finish(const Parser_output_section_trailer* trailer);
// Add a symbol to be defined.
void
add_symbol_assignment(const char* name, size_t length, Expression* value,
bool provide, bool hidden);
// Add an assignment to the special dot symbol.
void
add_dot_assignment(Expression* value);
// Add an assertion.
void
add_assertion(Expression* check, const char* message, size_t messagelen);
// Add a data item to the current output section.
void
add_data(int size, bool is_signed, Expression* val);
// Add a setting for the fill value.
void
add_fill(Expression* val);
// Add an input section specification.
void
add_input_section(const Input_section_spec* spec, bool keep);
// Return whether the output section is relro.
bool
is_relro() const
{ return this->is_relro_; }
// Record that the output section is relro.
void
set_is_relro()
{ this->is_relro_ = true; }
// Create any required output sections.
void
create_sections(Layout*);
// Add any symbols being defined to the symbol table.
void
add_symbols_to_table(Symbol_table* symtab);
// Finalize symbols and check assertions.
void
finalize_symbols(Symbol_table*, const Layout*, uint64_t*);
// Return the output section name to use for an input file name and
// section name.
const char*
output_section_name(const char* file_name, const char* section_name,
Output_section***, Script_sections::Section_type*,
bool*, bool);
// Initialize OSP with an output section.
void
orphan_section_init(Orphan_section_placement* osp,
Script_sections::Elements_iterator p)
{ osp->output_section_init(this->name_, this->output_section_, p); }
// Set the section address.
void
set_section_addresses(Symbol_table* symtab, Layout* layout,
uint64_t* dot_value, uint64_t*,
uint64_t* load_address);
// Check a constraint (ONLY_IF_RO, etc.) on an output section. If
// this section is constrained, and the input sections do not match,
// return the constraint, and set *POSD.
Section_constraint
check_constraint(Output_section_definition** posd);
// See if this is the alternate output section for a constrained
// output section. If it is, transfer the Output_section and return
// true. Otherwise return false.
bool
alternate_constraint(Output_section_definition*, Section_constraint);
// Get the list of segments to use for an allocated section when
// using a PHDRS clause.
Output_section*
allocate_to_segment(String_list** phdrs_list, bool* orphan);
// Look for an output section by name and return the address, the
// load address, the alignment, and the size. This is used when an
// expression refers to an output section which was not actually
// created. This returns true if the section was found, false
// otherwise.
bool
get_output_section_info(const char*, uint64_t*, uint64_t*, uint64_t*,
uint64_t*) const;
// Return the associated Output_section if there is one.
Output_section*
get_output_section() const
{ return this->output_section_; }
// Print the contents to the FILE. This is for debugging.
void
print(FILE*) const;
// Return the output section type if specified or Script_sections::ST_NONE.
Script_sections::Section_type
section_type() const;
// Store the memory region to use.
void
set_memory_region(Memory_region*, bool set_vma);
void
set_section_vma(Expression* address)
{ this->address_ = address; }
void
set_section_lma(Expression* address)
{ this->load_address_ = address; }
const std::string&
get_section_name() const
{ return this->name_; }
private:
static const char*
script_section_type_name(Script_section_type);
typedef std::vector<Output_section_element*> Output_section_elements;
// The output section name.
std::string name_;
// The address. This may be NULL.
Expression* address_;
// The load address. This may be NULL.
Expression* load_address_;
// The alignment. This may be NULL.
Expression* align_;
// The input section alignment. This may be NULL.
Expression* subalign_;
// The constraint, if any.
Section_constraint constraint_;
// The fill value. This may be NULL.
Expression* fill_;
// The list of segments this section should go into. This may be
// NULL.
String_list* phdrs_;
// The list of elements defining the section.
Output_section_elements elements_;
// The Output_section created for this definition. This will be
// NULL if none was created.
Output_section* output_section_;
// The address after it has been evaluated.
uint64_t evaluated_address_;
// The load address after it has been evaluated.
uint64_t evaluated_load_address_;
// The alignment after it has been evaluated.
uint64_t evaluated_addralign_;
// The output section is relro.
bool is_relro_;
// The output section type if specified.
enum Script_section_type script_section_type_;
};
// Constructor.
Output_section_definition::Output_section_definition(
const char* name,
size_t namelen,
const Parser_output_section_header* header)
: name_(name, namelen),
address_(header->address),
load_address_(header->load_address),
align_(header->align),
subalign_(header->subalign),
constraint_(header->constraint),
fill_(NULL),
phdrs_(NULL),
elements_(),
output_section_(NULL),
evaluated_address_(0),
evaluated_load_address_(0),
evaluated_addralign_(0),
is_relro_(false),
script_section_type_(header->section_type)
{
}
// Finish an output section.
void
Output_section_definition::finish(const Parser_output_section_trailer* trailer)
{
this->fill_ = trailer->fill;
this->phdrs_ = trailer->phdrs;
}
// Add a symbol to be defined.
void
Output_section_definition::add_symbol_assignment(const char* name,
size_t length,
Expression* value,
bool provide,
bool hidden)
{
Output_section_element* p = new Output_section_element_assignment(name,
length,
value,
provide,
hidden);
this->elements_.push_back(p);
}
// Add an assignment to the special dot symbol.
void
Output_section_definition::add_dot_assignment(Expression* value)
{
Output_section_element* p = new Output_section_element_dot_assignment(value);
this->elements_.push_back(p);
}
// Add an assertion.
void
Output_section_definition::add_assertion(Expression* check,
const char* message,
size_t messagelen)
{
Output_section_element* p = new Output_section_element_assertion(check,
message,
messagelen);
this->elements_.push_back(p);
}
// Add a data item to the current output section.
void
Output_section_definition::add_data(int size, bool is_signed, Expression* val)
{
Output_section_element* p = new Output_section_element_data(size, is_signed,
val);
this->elements_.push_back(p);
}
// Add a setting for the fill value.
void
Output_section_definition::add_fill(Expression* val)
{
Output_section_element* p = new Output_section_element_fill(val);
this->elements_.push_back(p);
}
// Add an input section specification.
void
Output_section_definition::add_input_section(const Input_section_spec* spec,
bool keep)
{
Output_section_element* p = new Output_section_element_input(spec, keep);
this->elements_.push_back(p);
}
// Create any required output sections. We need an output section if
// there is a data statement here.
void
Output_section_definition::create_sections(Layout* layout)
{
if (this->output_section_ != NULL)
return;
for (Output_section_elements::const_iterator p = this->elements_.begin();
p != this->elements_.end();
++p)
{
if ((*p)->needs_output_section())
{
const char* name = this->name_.c_str();
this->output_section_ =
layout->make_output_section_for_script(name, this->section_type());
return;
}
}
}
// Add any symbols being defined to the symbol table.
void
Output_section_definition::add_symbols_to_table(Symbol_table* symtab)
{
for (Output_section_elements::iterator p = this->elements_.begin();
p != this->elements_.end();
++p)
(*p)->add_symbols_to_table(symtab);
}
// Finalize symbols and check assertions.
void
Output_section_definition::finalize_symbols(Symbol_table* symtab,
const Layout* layout,
uint64_t* dot_value)
{
if (this->output_section_ != NULL)
*dot_value = this->output_section_->address();
else
{
uint64_t address = *dot_value;
if (this->address_ != NULL)
{
address = this->address_->eval_with_dot(symtab, layout, true,
*dot_value, NULL,
NULL, NULL, false);
}
if (this->align_ != NULL)
{
uint64_t align = this->align_->eval_with_dot(symtab, layout, true,
*dot_value, NULL,
NULL, NULL, false);
address = align_address(address, align);
}
*dot_value = address;
}
Output_section* dot_section = this->output_section_;
for (Output_section_elements::iterator p = this->elements_.begin();
p != this->elements_.end();
++p)
(*p)->finalize_symbols(symtab, layout, dot_value, &dot_section);
}
// Return the output section name to use for an input section name.
const char*
Output_section_definition::output_section_name(
const char* file_name,
const char* section_name,
Output_section*** slot,
Script_sections::Section_type* psection_type,
bool* keep,
bool match_input_spec)
{
// If the section is a linker-created output section, just look for a match
// on the output section name.
if (!match_input_spec && this->name_ != "/DISCARD/")
{
if (this->name_ != section_name)
return NULL;
*slot = &this->output_section_;
*psection_type = this->section_type();
return this->name_.c_str();
}
// Ask each element whether it matches NAME.
for (Output_section_elements::const_iterator p = this->elements_.begin();
p != this->elements_.end();
++p)
{
if ((*p)->match_name(file_name, section_name, keep))
{
// We found a match for NAME, which means that it should go
// into this output section.
*slot = &this->output_section_;
*psection_type = this->section_type();
return this->name_.c_str();
}
}
// We don't know about this section name.
return NULL;
}
// Return true if memory from START to START + LENGTH is contained
// within a memory region.
bool
Script_sections::block_in_region(Symbol_table* symtab, Layout* layout,
uint64_t start, uint64_t length) const
{
if (this->memory_regions_ == NULL)
return false;
for (Memory_regions::const_iterator mr = this->memory_regions_->begin();
mr != this->memory_regions_->end();
++mr)
{
uint64_t s = (*mr)->start_address()->eval(symtab, layout, false);
uint64_t l = (*mr)->length()->eval(symtab, layout, false);
if (s <= start
&& (s + l) >= (start + length))
return true;
}
return false;
}
// Find a memory region that should be used by a given output SECTION.
// If provided set PREVIOUS_SECTION_RETURN to point to the last section
// that used the return memory region.
Memory_region*
Script_sections::find_memory_region(
Output_section_definition* section,
bool find_vma_region,
bool explicit_only,
Output_section_definition** previous_section_return)
{
if (previous_section_return != NULL)
* previous_section_return = NULL;
// Walk the memory regions specified in this script, if any.
if (this->memory_regions_ == NULL)
return NULL;
// The /DISCARD/ section never gets assigned to any region.
if (section->get_section_name() == "/DISCARD/")
return NULL;
Memory_region* first_match = NULL;
// First check to see if a region has been assigned to this section.
for (Memory_regions::const_iterator mr = this->memory_regions_->begin();
mr != this->memory_regions_->end();
++mr)
{
if (find_vma_region)
{
for (Memory_region::Section_list::const_iterator s =
(*mr)->get_vma_section_list_start();
s != (*mr)->get_vma_section_list_end();
++s)
if ((*s) == section)
{
(*mr)->set_last_section(section);
return *mr;
}
}
else
{
for (Memory_region::Section_list::const_iterator s =
(*mr)->get_lma_section_list_start();
s != (*mr)->get_lma_section_list_end();
++s)
if ((*s) == section)
{
(*mr)->set_last_section(section);
return *mr;
}
}
if (!explicit_only)
{
// Make a note of the first memory region whose attributes
// are compatible with the section. If we do not find an
// explicit region assignment, then we will return this region.
Output_section* out_sec = section->get_output_section();
if (first_match == NULL
&& out_sec != NULL
&& (*mr)->attributes_compatible(out_sec->flags(),
out_sec->type()))
first_match = *mr;
}
}
// With LMA computations, if an explicit region has not been specified then
// we will want to set the difference between the VMA and the LMA of the
// section were searching for to be the same as the difference between the
// VMA and LMA of the last section to be added to first matched region.
// Hence, if it was asked for, we return a pointer to the last section
// known to be used by the first matched region.
if (first_match != NULL
&& previous_section_return != NULL)
*previous_section_return = first_match->get_last_section();
return first_match;
}
// Set the section address. Note that the OUTPUT_SECTION_ field will
// be NULL if no input sections were mapped to this output section.
// We still have to adjust dot and process symbol assignments.
void
Output_section_definition::set_section_addresses(Symbol_table* symtab,
Layout* layout,
uint64_t* dot_value,
uint64_t* dot_alignment,
uint64_t* load_address)
{
Memory_region* vma_region = NULL;
Memory_region* lma_region = NULL;
Script_sections* script_sections =
layout->script_options()->script_sections();
uint64_t address;
uint64_t old_dot_value = *dot_value;
uint64_t old_load_address = *load_address;
// If input section sorting is requested via --section-ordering-file or
// linker plugins, then do it here. This is important because we want
// any sorting specified in the linker scripts, which will be done after
// this, to take precedence. The final order of input sections is then
// guaranteed to be according to the linker script specification.
if (this->output_section_ != NULL
&& this->output_section_->input_section_order_specified())
this->output_section_->sort_attached_input_sections();
// Decide the start address for the section. The algorithm is:
// 1) If an address has been specified in a linker script, use that.
// 2) Otherwise if a memory region has been specified for the section,
// use the next free address in the region.
// 3) Otherwise if memory regions have been specified find the first
// region whose attributes are compatible with this section and
// install it into that region.
// 4) Otherwise use the current location counter.
if (this->output_section_ != NULL
// Check for --section-start.
&& parameters->options().section_start(this->output_section_->name(),
&address))
;
else if (this->address_ == NULL)
{
vma_region = script_sections->find_memory_region(this, true, false, NULL);
if (vma_region != NULL)
address = vma_region->get_current_address()->eval(symtab, layout,
false);
else
address = *dot_value;
}
else
{
vma_region = script_sections->find_memory_region(this, true, true, NULL);
address = this->address_->eval_with_dot(symtab, layout, true,
*dot_value, NULL, NULL,
dot_alignment, false);
if (vma_region != NULL)
vma_region->set_address(address, symtab, layout);
}
uint64_t align;
if (this->align_ == NULL)
{
if (this->output_section_ == NULL)
align = 0;
else
align = this->output_section_->addralign();
}
else
{
Output_section* align_section;
align = this->align_->eval_with_dot(symtab, layout, true, *dot_value,
NULL, &align_section, NULL, false);
if (align_section != NULL)
gold_warning(_("alignment of section %s is not absolute"),
this->name_.c_str());
if (this->output_section_ != NULL)
this->output_section_->set_addralign(align);
}
uint64_t subalign;
if (this->subalign_ == NULL)
subalign = 0;
else
{
Output_section* subalign_section;
subalign = this->subalign_->eval_with_dot(symtab, layout, true,
*dot_value, NULL,
&subalign_section, NULL,
false);
if (subalign_section != NULL)
gold_warning(_("subalign of section %s is not absolute"),
this->name_.c_str());
// Reserve a value of 0 to mean there is no SUBALIGN property.
if (subalign == 0)
subalign = 1;
// The external alignment of the output section must be at least
// as large as that of the input sections. If there is no
// explicit ALIGN property, we set the output section alignment
// to match the input section alignment.
if (align < subalign || this->align_ == NULL)
{
align = subalign;
this->output_section_->set_addralign(align);
}
}
address = align_address(address, align);
uint64_t start_address = address;
*dot_value = address;
// Except for NOLOAD sections, the address of non-SHF_ALLOC sections is
// forced to zero, regardless of what the linker script wants.
if (this->output_section_ != NULL
&& ((this->output_section_->flags() & elfcpp::SHF_ALLOC) != 0
|| this->output_section_->is_noload()))
this->output_section_->set_address(address);
this->evaluated_address_ = address;
this->evaluated_addralign_ = align;
uint64_t laddr;
if (this->load_address_ == NULL)
{
Output_section_definition* previous_section;
// Determine if an LMA region has been set for this section.
lma_region = script_sections->find_memory_region(this, false, false,
&previous_section);
if (lma_region != NULL)
{
if (previous_section == NULL)
// The LMA address was explicitly set to the given region.
laddr = lma_region->get_current_address()->eval(symtab, layout,
false);
else
{
// We are not going to use the discovered lma_region, so
// make sure that we do not update it in the code below.
lma_region = NULL;
if (this->address_ != NULL || previous_section == this)
{
// Either an explicit VMA address has been set, or an
// explicit VMA region has been set, so set the LMA equal to
// the VMA.
laddr = address;
}
else
{
// The LMA address was not explicitly or implicitly set.
//
// We have been given the first memory region that is
// compatible with the current section and a pointer to the
// last section to use this region. Set the LMA of this
// section so that the difference between its' VMA and LMA
// is the same as the difference between the VMA and LMA of
// the last section in the given region.
laddr = address + (previous_section->evaluated_load_address_
- previous_section->evaluated_address_);
}
}
if (this->output_section_ != NULL)
this->output_section_->set_load_address(laddr);
}
else
{
// Do not set the load address of the output section, if one exists.
// This allows future sections to determine what the load address
// should be. If none is ever set, it will default to being the
// same as the vma address.
laddr = address;
}
}
else
{
laddr = this->load_address_->eval_with_dot(symtab, layout, true,
*dot_value,
this->output_section_,
NULL, NULL, false);
if (this->output_section_ != NULL)
this->output_section_->set_load_address(laddr);
}
this->evaluated_load_address_ = laddr;
std::string fill;
if (this->fill_ != NULL)
{
// FIXME: The GNU linker supports fill values of arbitrary
// length.
Output_section* fill_section;
uint64_t fill_val = this->fill_->eval_with_dot(symtab, layout, true,
*dot_value,
NULL, &fill_section,
NULL, false);
if (fill_section != NULL)
gold_warning(_("fill of section %s is not absolute"),
this->name_.c_str());
unsigned char fill_buff[4];
elfcpp::Swap_unaligned<32, true>::writeval(fill_buff, fill_val);
fill.assign(reinterpret_cast<char*>(fill_buff), 4);
}
Input_section_list input_sections;
if (this->output_section_ != NULL)
{
// Get the list of input sections attached to this output
// section. This will leave the output section with only
// Output_section_data entries.
address += this->output_section_->get_input_sections(address,
fill,
&input_sections);
*dot_value = address;
}
Output_section* dot_section = this->output_section_;
for (Output_section_elements::iterator p = this->elements_.begin();
p != this->elements_.end();
++p)
(*p)->set_section_addresses(symtab, layout, this->output_section_,
subalign, dot_value, dot_alignment,
&dot_section, &fill, &input_sections);
gold_assert(input_sections.empty());
if (vma_region != NULL)
{
// Update the VMA region being used by the section now that we know how
// big it is. Use the current address in the region, rather than
// start_address because that might have been aligned upwards and we
// need to allow for the padding.
Expression* addr = vma_region->get_current_address();
uint64_t size = *dot_value - addr->eval(symtab, layout, false);
vma_region->increment_offset(this->get_section_name(), size,
symtab, layout);
}
// If the LMA region is different from the VMA region, then increment the
// offset there as well. Note that we use the same "dot_value -
// start_address" formula that is used in the load_address assignment below.
if (lma_region != NULL && lma_region != vma_region)
lma_region->increment_offset(this->get_section_name(),
*dot_value - start_address,
symtab, layout);
// Compute the load address for the following section.
if (this->output_section_ == NULL)
*load_address = *dot_value;
else if (this->load_address_ == NULL)
{
if (lma_region == NULL)
*load_address = *dot_value;
else
*load_address =
lma_region->get_current_address()->eval(symtab, layout, false);
}
else
*load_address = (this->output_section_->load_address()
+ (*dot_value - start_address));
if (this->output_section_ != NULL)
{
if (this->is_relro_)
this->output_section_->set_is_relro();
else
this->output_section_->clear_is_relro();
// If this is a NOLOAD section, keep dot and load address unchanged.
if (this->output_section_->is_noload())
{
*dot_value = old_dot_value;
*load_address = old_load_address;
}
}
}
// Check a constraint (ONLY_IF_RO, etc.) on an output section. If
// this section is constrained, and the input sections do not match,
// return the constraint, and set *POSD.
Section_constraint
Output_section_definition::check_constraint(Output_section_definition** posd)
{
switch (this->constraint_)
{
case CONSTRAINT_NONE:
return CONSTRAINT_NONE;
case CONSTRAINT_ONLY_IF_RO:
if (this->output_section_ != NULL
&& (this->output_section_->flags() & elfcpp::SHF_WRITE) != 0)
{
*posd = this;
return CONSTRAINT_ONLY_IF_RO;
}
return CONSTRAINT_NONE;
case CONSTRAINT_ONLY_IF_RW:
if (this->output_section_ != NULL
&& (this->output_section_->flags() & elfcpp::SHF_WRITE) == 0)
{
*posd = this;
return CONSTRAINT_ONLY_IF_RW;
}
return CONSTRAINT_NONE;
case CONSTRAINT_SPECIAL:
if (this->output_section_ != NULL)
gold_error(_("SPECIAL constraints are not implemented"));
return CONSTRAINT_NONE;
default:
gold_unreachable();
}
}
// See if this is the alternate output section for a constrained
// output section. If it is, transfer the Output_section and return
// true. Otherwise return false.
bool
Output_section_definition::alternate_constraint(
Output_section_definition* posd,
Section_constraint constraint)
{
if (this->name_ != posd->name_)
return false;
switch (constraint)
{
case CONSTRAINT_ONLY_IF_RO:
if (this->constraint_ != CONSTRAINT_ONLY_IF_RW)
return false;
break;
case CONSTRAINT_ONLY_IF_RW:
if (this->constraint_ != CONSTRAINT_ONLY_IF_RO)
return false;
break;
default:
gold_unreachable();
}
// We have found the alternate constraint. We just need to move
// over the Output_section. When constraints are used properly,
// THIS should not have an output_section pointer, as all the input
// sections should have matched the other definition.
if (this->output_section_ != NULL)
gold_error(_("mismatched definition for constrained sections"));
this->output_section_ = posd->output_section_;
posd->output_section_ = NULL;
if (this->is_relro_)
this->output_section_->set_is_relro();
else
this->output_section_->clear_is_relro();
return true;
}
// Get the list of segments to use for an allocated section when using
// a PHDRS clause.
Output_section*
Output_section_definition::allocate_to_segment(String_list** phdrs_list,
bool* orphan)
{
// Update phdrs_list even if we don't have an output section. It
// might be used by the following sections.
if (this->phdrs_ != NULL)
*phdrs_list = this->phdrs_;
if (this->output_section_ == NULL)
return NULL;
if ((this->output_section_->flags() & elfcpp::SHF_ALLOC) == 0)
return NULL;
*orphan = false;
return this->output_section_;
}
// Look for an output section by name and return the address, the load
// address, the alignment, and the size. This is used when an
// expression refers to an output section which was not actually
// created. This returns true if the section was found, false
// otherwise.
bool
Output_section_definition::get_output_section_info(const char* name,
uint64_t* address,
uint64_t* load_address,
uint64_t* addralign,
uint64_t* size) const
{
if (this->name_ != name)
return false;
if (this->output_section_ != NULL)
{
*address = this->output_section_->address();
if (this->output_section_->has_load_address())
*load_address = this->output_section_->load_address();
else
*load_address = *address;
*addralign = this->output_section_->addralign();
*size = this->output_section_->current_data_size();
}
else
{
*address = this->evaluated_address_;
*load_address = this->evaluated_load_address_;
*addralign = this->evaluated_addralign_;
*size = 0;
}
return true;
}
// Print for debugging.
void
Output_section_definition::print(FILE* f) const
{
fprintf(f, " %s ", this->name_.c_str());
if (this->address_ != NULL)
{
this->address_->print(f);
fprintf(f, " ");
}
if (this->script_section_type_ != SCRIPT_SECTION_TYPE_NONE)
fprintf(f, "(%s) ",
this->script_section_type_name(this->script_section_type_));
fprintf(f, ": ");
if (this->load_address_ != NULL)
{
fprintf(f, "AT(");
this->load_address_->print(f);
fprintf(f, ") ");
}
if (this->align_ != NULL)
{
fprintf(f, "ALIGN(");
this->align_->print(f);
fprintf(f, ") ");
}
if (this->subalign_ != NULL)
{
fprintf(f, "SUBALIGN(");
this->subalign_->print(f);
fprintf(f, ") ");
}
fprintf(f, "{\n");
for (Output_section_elements::const_iterator p = this->elements_.begin();
p != this->elements_.end();
++p)
(*p)->print(f);
fprintf(f, " }");
if (this->fill_ != NULL)
{
fprintf(f, " = ");
this->fill_->print(f);
}
if (this->phdrs_ != NULL)
{
for (String_list::const_iterator p = this->phdrs_->begin();
p != this->phdrs_->end();
++p)
fprintf(f, " :%s", p->c_str());
}
fprintf(f, "\n");
}
Script_sections::Section_type
Output_section_definition::section_type() const
{
switch (this->script_section_type_)
{
case SCRIPT_SECTION_TYPE_NONE:
return Script_sections::ST_NONE;
case SCRIPT_SECTION_TYPE_NOLOAD:
return Script_sections::ST_NOLOAD;
case SCRIPT_SECTION_TYPE_COPY:
case SCRIPT_SECTION_TYPE_DSECT:
case SCRIPT_SECTION_TYPE_INFO:
case SCRIPT_SECTION_TYPE_OVERLAY:
// There are not really support so we treat them as ST_NONE. The
// parse should have issued errors for them already.
return Script_sections::ST_NONE;
default:
gold_unreachable();
}
}
// Return the name of a script section type.
const char*
Output_section_definition::script_section_type_name(
Script_section_type script_section_type)
{
switch (script_section_type)
{
case SCRIPT_SECTION_TYPE_NONE:
return "NONE";
case SCRIPT_SECTION_TYPE_NOLOAD:
return "NOLOAD";
case SCRIPT_SECTION_TYPE_DSECT:
return "DSECT";
case SCRIPT_SECTION_TYPE_COPY:
return "COPY";
case SCRIPT_SECTION_TYPE_INFO:
return "INFO";
case SCRIPT_SECTION_TYPE_OVERLAY:
return "OVERLAY";
default:
gold_unreachable();
}
}
void
Output_section_definition::set_memory_region(Memory_region* mr, bool set_vma)
{
gold_assert(mr != NULL);
// Add the current section to the specified region's list.
mr->add_section(this, set_vma);
}
// An output section created to hold orphaned input sections. These
// do not actually appear in linker scripts. However, for convenience
// when setting the output section addresses, we put a marker to these
// sections in the appropriate place in the list of SECTIONS elements.
class Orphan_output_section : public Sections_element
{
public:
Orphan_output_section(Output_section* os)
: os_(os)
{ }
// Return whether the orphan output section is relro. We can just
// check the output section because we always set the flag, if
// needed, just after we create the Orphan_output_section.
bool
is_relro() const
{ return this->os_->is_relro(); }
// Initialize OSP with an output section. This should have been
// done already.
void
orphan_section_init(Orphan_section_placement*,
Script_sections::Elements_iterator)
{ gold_unreachable(); }
// Set section addresses.
void
set_section_addresses(Symbol_table*, Layout*, uint64_t*, uint64_t*,
uint64_t*);
// Get the list of segments to use for an allocated section when
// using a PHDRS clause.
Output_section*
allocate_to_segment(String_list**, bool*);
// Return the associated Output_section.
Output_section*
get_output_section() const
{ return this->os_; }
// Print for debugging.
void
print(FILE* f) const
{
fprintf(f, " marker for orphaned output section %s\n",
this->os_->name());
}
private:
Output_section* os_;
};
// Set section addresses.
void
Orphan_output_section::set_section_addresses(Symbol_table*, Layout*,
uint64_t* dot_value,
uint64_t*,
uint64_t* load_address)
{
typedef std::list<Output_section::Input_section> Input_section_list;
bool have_load_address = *load_address != *dot_value;
uint64_t address = *dot_value;
address = align_address(address, this->os_->addralign());
// If input section sorting is requested via --section-ordering-file or
// linker plugins, then do it here. This is important because we want
// any sorting specified in the linker scripts, which will be done after
// this, to take precedence. The final order of input sections is then
// guaranteed to be according to the linker script specification.
if (this->os_ != NULL
&& this->os_->input_section_order_specified())
this->os_->sort_attached_input_sections();
// For a relocatable link, all orphan sections are put at
// address 0. In general we expect all sections to be at
// address 0 for a relocatable link, but we permit the linker
// script to override that for specific output sections.
if (parameters->options().relocatable())
{
address = 0;
*load_address = 0;
have_load_address = false;
}
if ((this->os_->flags() & elfcpp::SHF_ALLOC) != 0)
{
this->os_->set_address(address);
if (have_load_address)
this->os_->set_load_address(align_address(*load_address,
this->os_->addralign()));
}
Input_section_list input_sections;
address += this->os_->get_input_sections(address, "", &input_sections);
for (Input_section_list::iterator p = input_sections.begin();
p != input_sections.end();
++p)
{
uint64_t addralign = p->addralign();
if (!p->is_input_section())
p->output_section_data()->finalize_data_size();
uint64_t size = p->data_size();
address = align_address(address, addralign);
this->os_->add_script_input_section(*p);
address += size;
}
if (parameters->options().relocatable())
{
// For a relocatable link, reset DOT_VALUE to 0.
*dot_value = 0;
*load_address = 0;
}
else if (this->os_ == NULL
|| (this->os_->flags() & elfcpp::SHF_TLS) == 0
|| this->os_->type() != elfcpp::SHT_NOBITS)
{
// An SHF_TLS/SHT_NOBITS section does not take up any address space.
if (!have_load_address)
*load_address = address;
else
*load_address += address - *dot_value;
*dot_value = address;
}
}
// Get the list of segments to use for an allocated section when using
// a PHDRS clause. If this is an allocated section, return the
// Output_section. We don't change the list of segments.
Output_section*
Orphan_output_section::allocate_to_segment(String_list**, bool* orphan)
{
if ((this->os_->flags() & elfcpp::SHF_ALLOC) == 0)
return NULL;
*orphan = true;
return this->os_;
}
// Class Phdrs_element. A program header from a PHDRS clause.
class Phdrs_element
{
public:
Phdrs_element(const char* name, size_t namelen, unsigned int type,
bool includes_filehdr, bool includes_phdrs,
bool is_flags_valid, unsigned int flags,
Expression* load_address)
: name_(name, namelen), type_(type), includes_filehdr_(includes_filehdr),
includes_phdrs_(includes_phdrs), is_flags_valid_(is_flags_valid),
flags_(flags), load_address_(load_address), load_address_value_(0),
segment_(NULL)
{ }
// Return the name of this segment.
const std::string&
name() const
{ return this->name_; }
// Return the type of the segment.
unsigned int
type() const
{ return this->type_; }
// Whether to include the file header.
bool
includes_filehdr() const
{ return this->includes_filehdr_; }
// Whether to include the program headers.
bool
includes_phdrs() const
{ return this->includes_phdrs_; }
// Return whether there is a load address.
bool
has_load_address() const
{ return this->load_address_ != NULL; }
// Evaluate the load address expression if there is one.
void
eval_load_address(Symbol_table* symtab, Layout* layout)
{
if (this->load_address_ != NULL)
this->load_address_value_ = this->load_address_->eval(symtab, layout,
true);
}
// Return the load address.
uint64_t
load_address() const
{
gold_assert(this->load_address_ != NULL);
return this->load_address_value_;
}
// Create the segment.
Output_segment*
create_segment(Layout* layout)
{
this->segment_ = layout->make_output_segment(this->type_, this->flags_);
return this->segment_;
}
// Return the segment.
Output_segment*
segment()
{ return this->segment_; }
// Release the segment.
void
release_segment()
{ this->segment_ = NULL; }
// Set the segment flags if appropriate.
void
set_flags_if_valid()
{
if (this->is_flags_valid_)
this->segment_->set_flags(this->flags_);
}
// Print for debugging.
void
print(FILE*) const;
private:
// The name used in the script.
std::string name_;
// The type of the segment (PT_LOAD, etc.).
unsigned int type_;
// Whether this segment includes the file header.
bool includes_filehdr_;
// Whether this segment includes the section headers.
bool includes_phdrs_;
// Whether the flags were explicitly specified.
bool is_flags_valid_;
// The flags for this segment (PF_R, etc.) if specified.
unsigned int flags_;
// The expression for the load address for this segment. This may
// be NULL.
Expression* load_address_;
// The actual load address from evaluating the expression.
uint64_t load_address_value_;
// The segment itself.
Output_segment* segment_;
};
// Print for debugging.
void
Phdrs_element::print(FILE* f) const
{
fprintf(f, " %s 0x%x", this->name_.c_str(), this->type_);
if (this->includes_filehdr_)
fprintf(f, " FILEHDR");
if (this->includes_phdrs_)
fprintf(f, " PHDRS");
if (this->is_flags_valid_)
fprintf(f, " FLAGS(%u)", this->flags_);
if (this->load_address_ != NULL)
{
fprintf(f, " AT(");
this->load_address_->print(f);
fprintf(f, ")");
}
fprintf(f, ";\n");
}
// Add a memory region.
void
Script_sections::add_memory_region(const char* name, size_t namelen,
unsigned int attributes,
Expression* start, Expression* length)
{
if (this->memory_regions_ == NULL)
this->memory_regions_ = new Memory_regions();
else if (this->find_memory_region(name, namelen))
{
gold_error(_("region '%.*s' already defined"), static_cast<int>(namelen),
name);
// FIXME: Add a GOLD extension to allow multiple regions with the same
// name. This would amount to a single region covering disjoint blocks
// of memory, which is useful for embedded devices.
}
// FIXME: Check the length and start values. Currently we allow
// non-constant expressions for these values, whereas LD does not.
// FIXME: Add a GOLD extension to allow NEGATIVE LENGTHS. This would
// describe a region that packs from the end address going down, rather
// than the start address going up. This would be useful for embedded
// devices.
this->memory_regions_->push_back(new Memory_region(name, namelen, attributes,
start, length));
}
// Find a memory region.
Memory_region*
Script_sections::find_memory_region(const char* name, size_t namelen)
{
if (this->memory_regions_ == NULL)
return NULL;
for (Memory_regions::const_iterator m = this->memory_regions_->begin();
m != this->memory_regions_->end();
++m)
if ((*m)->name_match(name, namelen))
return *m;
return NULL;
}
// Find a memory region's origin.
Expression*
Script_sections::find_memory_region_origin(const char* name, size_t namelen)
{
Memory_region* mr = find_memory_region(name, namelen);
if (mr == NULL)
return NULL;
return mr->start_address();
}
// Find a memory region's length.
Expression*
Script_sections::find_memory_region_length(const char* name, size_t namelen)
{
Memory_region* mr = find_memory_region(name, namelen);
if (mr == NULL)
return NULL;
return mr->length();
}
// Set the memory region to use for the current section.
void
Script_sections::set_memory_region(Memory_region* mr, bool set_vma)
{
gold_assert(!this->sections_elements_->empty());
this->sections_elements_->back()->set_memory_region(mr, set_vma);
}
// Class Script_sections.
Script_sections::Script_sections()
: saw_sections_clause_(false),
in_sections_clause_(false),
sections_elements_(NULL),
output_section_(NULL),
memory_regions_(NULL),
phdrs_elements_(NULL),
orphan_section_placement_(NULL),
data_segment_align_start_(),
saw_data_segment_align_(false),
saw_relro_end_(false),
saw_segment_start_expression_(false),
segments_created_(false)
{
}
// Start a SECTIONS clause.
void
Script_sections::start_sections()
{
gold_assert(!this->in_sections_clause_ && this->output_section_ == NULL);
this->saw_sections_clause_ = true;
this->in_sections_clause_ = true;
if (this->sections_elements_ == NULL)
this->sections_elements_ = new Sections_elements;
}
// Finish a SECTIONS clause.
void
Script_sections::finish_sections()
{
gold_assert(this->in_sections_clause_ && this->output_section_ == NULL);
this->in_sections_clause_ = false;
}
// Add a symbol to be defined.
void
Script_sections::add_symbol_assignment(const char* name, size_t length,
Expression* val, bool provide,
bool hidden)
{
if (this->output_section_ != NULL)
this->output_section_->add_symbol_assignment(name, length, val,
provide, hidden);
else
{
Sections_element* p = new Sections_element_assignment(name, length,
val, provide,
hidden);
this->sections_elements_->push_back(p);
}
}
// Add an assignment to the special dot symbol.
void
Script_sections::add_dot_assignment(Expression* val)
{
if (this->output_section_ != NULL)
this->output_section_->add_dot_assignment(val);
else
{
// The GNU linker permits assignments to . to appears outside of
// a SECTIONS clause, and treats it as appearing inside, so
// sections_elements_ may be NULL here.
if (this->sections_elements_ == NULL)
{
this->sections_elements_ = new Sections_elements;
this->saw_sections_clause_ = true;
}
Sections_element* p = new Sections_element_dot_assignment(val);
this->sections_elements_->push_back(p);
}
}
// Add an assertion.
void
Script_sections::add_assertion(Expression* check, const char* message,
size_t messagelen)
{
if (this->output_section_ != NULL)
this->output_section_->add_assertion(check, message, messagelen);
else
{
Sections_element* p = new Sections_element_assertion(check, message,
messagelen);
this->sections_elements_->push_back(p);
}
}
// Start processing entries for an output section.
void
Script_sections::start_output_section(
const char* name,
size_t namelen,
const Parser_output_section_header* header)
{
Output_section_definition* posd = new Output_section_definition(name,
namelen,
header);
this->sections_elements_->push_back(posd);
gold_assert(this->output_section_ == NULL);
this->output_section_ = posd;
}
// Stop processing entries for an output section.
void
Script_sections::finish_output_section(
const Parser_output_section_trailer* trailer)
{
gold_assert(this->output_section_ != NULL);
this->output_section_->finish(trailer);
this->output_section_ = NULL;
}
// Add a data item to the current output section.
void
Script_sections::add_data(int size, bool is_signed, Expression* val)
{
gold_assert(this->output_section_ != NULL);
this->output_section_->add_data(size, is_signed, val);
}
// Add a fill value setting to the current output section.
void
Script_sections::add_fill(Expression* val)
{
gold_assert(this->output_section_ != NULL);
this->output_section_->add_fill(val);
}
// Add an input section specification to the current output section.
void
Script_sections::add_input_section(const Input_section_spec* spec, bool keep)
{
gold_assert(this->output_section_ != NULL);
this->output_section_->add_input_section(spec, keep);
}
// This is called when we see DATA_SEGMENT_ALIGN. It means that any
// subsequent output sections may be relro.
void
Script_sections::data_segment_align()
{
if (this->saw_data_segment_align_)
gold_error(_("DATA_SEGMENT_ALIGN may only appear once in a linker script"));
gold_assert(!this->sections_elements_->empty());
Sections_elements::iterator p = this->sections_elements_->end();
--p;
this->data_segment_align_start_ = p;
this->saw_data_segment_align_ = true;
}
// This is called when we see DATA_SEGMENT_RELRO_END. It means that
// any output sections seen since DATA_SEGMENT_ALIGN are relro.
void
Script_sections::data_segment_relro_end()
{
if (this->saw_relro_end_)
gold_error(_("DATA_SEGMENT_RELRO_END may only appear once "
"in a linker script"));
this->saw_relro_end_ = true;
if (!this->saw_data_segment_align_)
gold_error(_("DATA_SEGMENT_RELRO_END must follow DATA_SEGMENT_ALIGN"));
else
{
Sections_elements::iterator p = this->data_segment_align_start_;
for (++p; p != this->sections_elements_->end(); ++p)
(*p)->set_is_relro();
}
}
// Create any required sections.
void
Script_sections::create_sections(Layout* layout)
{
if (!this->saw_sections_clause_)
return;
for (Sections_elements::iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
(*p)->create_sections(layout);
}
// Add any symbols we are defining to the symbol table.
void
Script_sections::add_symbols_to_table(Symbol_table* symtab)
{
if (!this->saw_sections_clause_)
return;
for (Sections_elements::iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
(*p)->add_symbols_to_table(symtab);
}
// Finalize symbols and check assertions.
void
Script_sections::finalize_symbols(Symbol_table* symtab, const Layout* layout)
{
if (!this->saw_sections_clause_)
return;
uint64_t dot_value = 0;
for (Sections_elements::iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
(*p)->finalize_symbols(symtab, layout, &dot_value);
}
// Return the name of the output section to use for an input file name
// and section name.
const char*
Script_sections::output_section_name(
const char* file_name,
const char* section_name,
Output_section*** output_section_slot,
Script_sections::Section_type* psection_type,
bool* keep,
bool is_input_section)
{
for (Sections_elements::const_iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
{
const char* ret = (*p)->output_section_name(file_name, section_name,
output_section_slot,
psection_type, keep,
is_input_section);
if (ret != NULL)
{
// The special name /DISCARD/ means that the input section
// should be discarded.
if (strcmp(ret, "/DISCARD/") == 0)
{
*output_section_slot = NULL;
*psection_type = Script_sections::ST_NONE;
return NULL;
}
return ret;
}
}
// We have an orphan section.
*output_section_slot = NULL;
*psection_type = Script_sections::ST_NONE;
*keep = false;
General_options::Orphan_handling orphan_handling =
parameters->options().orphan_handling_enum();
if (orphan_handling == General_options::ORPHAN_DISCARD)
return NULL;
if (orphan_handling == General_options::ORPHAN_ERROR)
{
if (file_name == NULL)
gold_error(_("unplaced orphan section '%s'"), section_name);
else
gold_error(_("unplaced orphan section '%s' from '%s'"),
section_name, file_name);
return NULL;
}
if (orphan_handling == General_options::ORPHAN_WARN)
{
if (file_name == NULL)
gold_warning(_("orphan section '%s' is being placed in section '%s'"),
section_name, section_name);
else
gold_warning(_("orphan section '%s' from '%s' is being placed "
"in section '%s'"),
section_name, file_name, section_name);
}
// If we couldn't find a mapping for the name, the output section
// gets the name of the input section.
return section_name;
}
// Place a marker for an orphan output section into the SECTIONS
// clause.
void
Script_sections::place_orphan(Output_section* os)
{
Orphan_section_placement* osp = this->orphan_section_placement_;
if (osp == NULL)
{
// Initialize the Orphan_section_placement structure.
osp = new Orphan_section_placement();
for (Sections_elements::iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
(*p)->orphan_section_init(osp, p);
gold_assert(!this->sections_elements_->empty());
Sections_elements::iterator last = this->sections_elements_->end();
--last;
osp->last_init(last);
this->orphan_section_placement_ = osp;
}
Orphan_output_section* orphan = new Orphan_output_section(os);
// Look for where to put ORPHAN.
Sections_elements::iterator* where;
if (osp->find_place(os, &where))
{
if ((**where)->is_relro())
os->set_is_relro();
else
os->clear_is_relro();
// We want to insert ORPHAN after *WHERE, and then update *WHERE
// so that the next one goes after this one.
Sections_elements::iterator p = *where;
gold_assert(p != this->sections_elements_->end());
++p;
*where = this->sections_elements_->insert(p, orphan);
}
else
{
os->clear_is_relro();
// We don't have a place to put this orphan section. Put it,
// and all other sections like it, at the end, but before the
// sections which always come at the end.
Sections_elements::iterator last = osp->last_place();
*where = this->sections_elements_->insert(last, orphan);
}
if ((os->flags() & elfcpp::SHF_ALLOC) != 0)
osp->update_last_alloc(*where);
}
// Set the addresses of all the output sections. Walk through all the
// elements, tracking the dot symbol. Apply assignments which set
// absolute symbol values, in case they are used when setting dot.
// Fill in data statement values. As we find output sections, set the
// address, set the address of all associated input sections, and
// update dot. Return the segment which should hold the file header
// and segment headers, if any.
Output_segment*
Script_sections::set_section_addresses(Symbol_table* symtab, Layout* layout)
{
gold_assert(this->saw_sections_clause_);
// Implement ONLY_IF_RO/ONLY_IF_RW constraints. These are a pain
// for our representation.
for (Sections_elements::iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
{
Output_section_definition* posd;
Section_constraint failed_constraint = (*p)->check_constraint(&posd);
if (failed_constraint != CONSTRAINT_NONE)
{
Sections_elements::iterator q;
for (q = this->sections_elements_->begin();
q != this->sections_elements_->end();
++q)
{
if (q != p)
{
if ((*q)->alternate_constraint(posd, failed_constraint))
break;
}
}
if (q == this->sections_elements_->end())
gold_error(_("no matching section constraint"));
}
}
// Force the alignment of the first TLS section to be the maximum
// alignment of all TLS sections.
Output_section* first_tls = NULL;
uint64_t tls_align = 0;
for (Sections_elements::const_iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
{
Output_section* os = (*p)->get_output_section();
if (os != NULL && (os->flags() & elfcpp::SHF_TLS) != 0)
{
if (first_tls == NULL)
first_tls = os;
if (os->addralign() > tls_align)
tls_align = os->addralign();
}
}
if (first_tls != NULL)
first_tls->set_addralign(tls_align);
// For a relocatable link, we implicitly set dot to zero.
uint64_t dot_value = 0;
uint64_t dot_alignment = 0;
uint64_t load_address = 0;
// Check to see if we want to use any of -Ttext, -Tdata and -Tbss options
// to set section addresses. If the script has any SEGMENT_START
// expression, we do not set the section addresses.
bool use_tsection_options =
(!this->saw_segment_start_expression_
&& (parameters->options().user_set_Ttext()
|| parameters->options().user_set_Tdata()
|| parameters->options().user_set_Tbss()));
for (Sections_elements::iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
{
Output_section* os = (*p)->get_output_section();
// Handle -Ttext, -Tdata and -Tbss options. We do this by looking for
// the special sections by names and doing dot assignments.
if (use_tsection_options
&& os != NULL
&& (os->flags() & elfcpp::SHF_ALLOC) != 0)
{
uint64_t new_dot_value = dot_value;
if (parameters->options().user_set_Ttext()
&& strcmp(os->name(), ".text") == 0)
new_dot_value = parameters->options().Ttext();
else if (parameters->options().user_set_Tdata()
&& strcmp(os->name(), ".data") == 0)
new_dot_value = parameters->options().Tdata();
else if (parameters->options().user_set_Tbss()
&& strcmp(os->name(), ".bss") == 0)
new_dot_value = parameters->options().Tbss();
// Update dot and load address if necessary.
if (new_dot_value < dot_value)
gold_error(_("dot may not move backward"));
else if (new_dot_value != dot_value)
{
dot_value = new_dot_value;
load_address = new_dot_value;
}
}
(*p)->set_section_addresses(symtab, layout, &dot_value, &dot_alignment,
&load_address);
}
if (this->phdrs_elements_ != NULL)
{
for (Phdrs_elements::iterator p = this->phdrs_elements_->begin();
p != this->phdrs_elements_->end();
++p)
(*p)->eval_load_address(symtab, layout);
}
return this->create_segments(layout, dot_alignment);
}
// Sort the sections in order to put them into segments.
class Sort_output_sections
{
public:
Sort_output_sections(const Script_sections::Sections_elements* elements)
: elements_(elements)
{ }
bool
operator()(const Output_section* os1, const Output_section* os2) const;
private:
int
script_compare(const Output_section* os1, const Output_section* os2) const;
private:
const Script_sections::Sections_elements* elements_;
};
bool
Sort_output_sections::operator()(const Output_section* os1,
const Output_section* os2) const
{
// Sort first by the load address.
uint64_t lma1 = (os1->has_load_address()
? os1->load_address()
: os1->address());
uint64_t lma2 = (os2->has_load_address()
? os2->load_address()
: os2->address());
if (lma1 != lma2)
return lma1 < lma2;
// Then sort by the virtual address.
if (os1->address() != os2->address())
return os1->address() < os2->address();
// If the linker script says which of these sections is first, go
// with what it says.
int i = this->script_compare(os1, os2);
if (i != 0)
return i < 0;
// Sort PROGBITS before NOBITS.
bool nobits1 = os1->type() == elfcpp::SHT_NOBITS;
bool nobits2 = os2->type() == elfcpp::SHT_NOBITS;
if (nobits1 != nobits2)
return nobits2;
// Sort PROGBITS TLS sections to the end, NOBITS TLS sections to the
// beginning.
bool tls1 = (os1->flags() & elfcpp::SHF_TLS) != 0;
bool tls2 = (os2->flags() & elfcpp::SHF_TLS) != 0;
if (tls1 != tls2)
return nobits1 ? tls1 : tls2;
// Sort non-NOLOAD before NOLOAD.
if (os1->is_noload() && !os2->is_noload())
return true;
if (!os1->is_noload() && os2->is_noload())
return true;
// The sections seem practically identical. Sort by name to get a
// stable sort.
return os1->name() < os2->name();
}
// Return -1 if OS1 comes before OS2 in ELEMENTS_, 1 if comes after, 0
// if either OS1 or OS2 is not mentioned. This ensures that we keep
// empty sections in the order in which they appear in a linker
// script.
int
Sort_output_sections::script_compare(const Output_section* os1,
const Output_section* os2) const
{
if (this->elements_ == NULL)
return 0;
bool found_os1 = false;
bool found_os2 = false;
for (Script_sections::Sections_elements::const_iterator
p = this->elements_->begin();
p != this->elements_->end();
++p)
{
if (os2 == (*p)->get_output_section())
{
if (found_os1)
return -1;
found_os2 = true;
}
else if (os1 == (*p)->get_output_section())
{
if (found_os2)
return 1;
found_os1 = true;
}
}
return 0;
}
// Return whether OS is a BSS section. This is a SHT_NOBITS section.
// We treat a section with the SHF_TLS flag set as taking up space
// even if it is SHT_NOBITS (this is true of .tbss), as we allocate
// space for them in the file.
bool
Script_sections::is_bss_section(const Output_section* os)
{
return (os->type() == elfcpp::SHT_NOBITS
&& (os->flags() & elfcpp::SHF_TLS) == 0);
}
// Return the size taken by the file header and the program headers.
size_t
Script_sections::total_header_size(Layout* layout) const
{
size_t segment_count = layout->segment_count();
size_t file_header_size;
size_t segment_headers_size;
if (parameters->target().get_size() == 32)
{
file_header_size = elfcpp::Elf_sizes<32>::ehdr_size;
segment_headers_size = segment_count * elfcpp::Elf_sizes<32>::phdr_size;
}
else if (parameters->target().get_size() == 64)
{
file_header_size = elfcpp::Elf_sizes<64>::ehdr_size;
segment_headers_size = segment_count * elfcpp::Elf_sizes<64>::phdr_size;
}
else
gold_unreachable();
return file_header_size + segment_headers_size;
}
// Return the amount we have to subtract from the LMA to accommodate
// headers of the given size. The complication is that the file
// header have to be at the start of a page, as otherwise it will not
// be at the start of the file.
uint64_t
Script_sections::header_size_adjustment(uint64_t lma,
size_t sizeof_headers) const
{
const uint64_t abi_pagesize = parameters->target().abi_pagesize();
uint64_t hdr_lma = lma - sizeof_headers;
hdr_lma &= ~(abi_pagesize - 1);
return lma - hdr_lma;
}
// Create the PT_LOAD segments when using a SECTIONS clause. Returns
// the segment which should hold the file header and segment headers,
// if any.
Output_segment*
Script_sections::create_segments(Layout* layout, uint64_t dot_alignment)
{
gold_assert(this->saw_sections_clause_);
if (parameters->options().relocatable())
return NULL;
if (this->saw_phdrs_clause())
return create_segments_from_phdrs_clause(layout, dot_alignment);
Layout::Section_list sections;
layout->get_allocated_sections(§ions);
// Sort the sections by address.
std::stable_sort(sections.begin(), sections.end(),
Sort_output_sections(this->sections_elements_));
this->create_note_and_tls_segments(layout, §ions);
// Walk through the sections adding them to PT_LOAD segments.
const uint64_t abi_pagesize = parameters->target().abi_pagesize();
Output_segment* first_seg = NULL;
Output_segment* current_seg = NULL;
bool is_current_seg_readonly = true;
uint64_t last_vma = 0;
uint64_t last_lma = 0;
uint64_t last_size = 0;
bool in_bss = false;
for (Layout::Section_list::iterator p = sections.begin();
p != sections.end();
++p)
{
const uint64_t vma = (*p)->address();
const uint64_t lma = ((*p)->has_load_address()
? (*p)->load_address()
: vma);
const uint64_t size = (*p)->current_data_size();
bool need_new_segment;
if (current_seg == NULL)
need_new_segment = true;
else if (lma - vma != last_lma - last_vma)
{
// This section has a different LMA relationship than the
// last one; we need a new segment.
need_new_segment = true;
}
else if (align_address(last_lma + last_size, abi_pagesize)
< align_address(lma, abi_pagesize))
{
// Putting this section in the segment would require
// skipping a page.
need_new_segment = true;
}
else if (in_bss && !is_bss_section(*p))
{
// A non-BSS section can not follow a BSS section in the
// same segment.
need_new_segment = true;
}
else if (is_current_seg_readonly
&& ((*p)->flags() & elfcpp::SHF_WRITE) != 0
&& !parameters->options().omagic())
{
// Don't put a writable section in the same segment as a
// non-writable section.
need_new_segment = true;
}
else
{
// Otherwise, reuse the existing segment.
need_new_segment = false;
}
elfcpp::Elf_Word seg_flags =
Layout::section_flags_to_segment((*p)->flags());
if (need_new_segment)
{
current_seg = layout->make_output_segment(elfcpp::PT_LOAD,
seg_flags);
current_seg->set_addresses(vma, lma);
current_seg->set_minimum_p_align(dot_alignment);
if (first_seg == NULL)
first_seg = current_seg;
is_current_seg_readonly = true;
in_bss = false;
}
current_seg->add_output_section_to_load(layout, *p, seg_flags);
if (((*p)->flags() & elfcpp::SHF_WRITE) != 0)
is_current_seg_readonly = false;
if (is_bss_section(*p) && size > 0)
in_bss = true;
last_vma = vma;
last_lma = lma;
last_size = size;
}
// An ELF program should work even if the program headers are not in
// a PT_LOAD segment. However, it appears that the Linux kernel
// does not set the AT_PHDR auxiliary entry in that case. It sets
// the load address to p_vaddr - p_offset of the first PT_LOAD
// segment. It then sets AT_PHDR to the load address plus the
// offset to the program headers, e_phoff in the file header. This
// fails when the program headers appear in the file before the
// first PT_LOAD segment. Therefore, we always create a PT_LOAD
// segment to hold the file header and the program headers. This is
// effectively what the GNU linker does, and it is slightly more
// efficient in any case. We try to use the first PT_LOAD segment
// if we can, otherwise we make a new one.
if (first_seg == NULL)
return NULL;
// -n or -N mean that the program is not demand paged and there is
// no need to put the program headers in a PT_LOAD segment.
if (parameters->options().nmagic() || parameters->options().omagic())
return NULL;
size_t sizeof_headers = this->total_header_size(layout);
uint64_t vma = first_seg->vaddr();
uint64_t lma = first_seg->paddr();
uint64_t subtract = this->header_size_adjustment(lma, sizeof_headers);
if ((lma & (abi_pagesize - 1)) >= sizeof_headers)
{
first_seg->set_addresses(vma - subtract, lma - subtract);
return first_seg;
}
// If there is no room to squeeze in the headers, then punt. The
// resulting executable probably won't run on GNU/Linux, but we
// trust that the user knows what they are doing.
if (lma < subtract || vma < subtract)
return NULL;
// If memory regions have been specified and the address range
// we are about to use is not contained within any region then
// issue a warning message about the segment we are going to
// create. It will be outside of any region and so possibly
// using non-existent or protected memory. We test LMA rather
// than VMA since we assume that the headers will never be
// relocated.
if (this->memory_regions_ != NULL
&& !this->block_in_region (NULL, layout, lma - subtract, subtract))
gold_warning(_("creating a segment to contain the file and program"
" headers outside of any MEMORY region"));
Output_segment* load_seg = layout->make_output_segment(elfcpp::PT_LOAD,
elfcpp::PF_R);
load_seg->set_addresses(vma - subtract, lma - subtract);
return load_seg;
}
// Create a PT_NOTE segment for each SHT_NOTE section and a PT_TLS
// segment if there are any SHT_TLS sections.
void
Script_sections::create_note_and_tls_segments(
Layout* layout,
const Layout::Section_list* sections)
{
gold_assert(!this->saw_phdrs_clause());
bool saw_tls = false;
for (Layout::Section_list::const_iterator p = sections->begin();
p != sections->end();
++p)
{
if ((*p)->type() == elfcpp::SHT_NOTE)
{
elfcpp::Elf_Word seg_flags =
Layout::section_flags_to_segment((*p)->flags());
Output_segment* oseg = layout->make_output_segment(elfcpp::PT_NOTE,
seg_flags);
oseg->add_output_section_to_nonload(*p, seg_flags);
// Incorporate any subsequent SHT_NOTE sections, in the
// hopes that the script is sensible.
Layout::Section_list::const_iterator pnext = p + 1;
while (pnext != sections->end()
&& (*pnext)->type() == elfcpp::SHT_NOTE)
{
seg_flags = Layout::section_flags_to_segment((*pnext)->flags());
oseg->add_output_section_to_nonload(*pnext, seg_flags);
p = pnext;
++pnext;
}
}
if (((*p)->flags() & elfcpp::SHF_TLS) != 0)
{
if (saw_tls)
gold_error(_("TLS sections are not adjacent"));
elfcpp::Elf_Word seg_flags =
Layout::section_flags_to_segment((*p)->flags());
Output_segment* oseg = layout->make_output_segment(elfcpp::PT_TLS,
seg_flags);
oseg->add_output_section_to_nonload(*p, seg_flags);
Layout::Section_list::const_iterator pnext = p + 1;
while (pnext != sections->end()
&& ((*pnext)->flags() & elfcpp::SHF_TLS) != 0)
{
seg_flags = Layout::section_flags_to_segment((*pnext)->flags());
oseg->add_output_section_to_nonload(*pnext, seg_flags);
p = pnext;
++pnext;
}
saw_tls = true;
}
// If we see a section named .interp then put the .interp section
// in a PT_INTERP segment.
// This is for GNU ld compatibility.
if (strcmp((*p)->name(), ".interp") == 0)
{
elfcpp::Elf_Word seg_flags =
Layout::section_flags_to_segment((*p)->flags());
Output_segment* oseg = layout->make_output_segment(elfcpp::PT_INTERP,
seg_flags);
oseg->add_output_section_to_nonload(*p, seg_flags);
}
}
this->segments_created_ = true;
}
// Add a program header. The PHDRS clause is syntactically distinct
// from the SECTIONS clause, but we implement it with the SECTIONS
// support because PHDRS is useless if there is no SECTIONS clause.
void
Script_sections::add_phdr(const char* name, size_t namelen, unsigned int type,
bool includes_filehdr, bool includes_phdrs,
bool is_flags_valid, unsigned int flags,
Expression* load_address)
{
if (this->phdrs_elements_ == NULL)
this->phdrs_elements_ = new Phdrs_elements();
this->phdrs_elements_->push_back(new Phdrs_element(name, namelen, type,
includes_filehdr,
includes_phdrs,
is_flags_valid, flags,
load_address));
}
// Return the number of segments we expect to create based on the
// SECTIONS clause. This is used to implement SIZEOF_HEADERS.
size_t
Script_sections::expected_segment_count(const Layout* layout) const
{
// If we've already created the segments, we won't be adding any more.
if (this->segments_created_)
return 0;
if (this->saw_phdrs_clause())
return this->phdrs_elements_->size();
Layout::Section_list sections;
layout->get_allocated_sections(§ions);
// We assume that we will need two PT_LOAD segments.
size_t ret = 2;
bool saw_note = false;
bool saw_tls = false;
bool saw_interp = false;
for (Layout::Section_list::const_iterator p = sections.begin();
p != sections.end();
++p)
{
if ((*p)->type() == elfcpp::SHT_NOTE)
{
// Assume that all note sections will fit into a single
// PT_NOTE segment.
if (!saw_note)
{
++ret;
saw_note = true;
}
}
else if (((*p)->flags() & elfcpp::SHF_TLS) != 0)
{
// There can only be one PT_TLS segment.
if (!saw_tls)
{
++ret;
saw_tls = true;
}
}
else if (strcmp((*p)->name(), ".interp") == 0)
{
// There can only be one PT_INTERP segment.
if (!saw_interp)
{
++ret;
saw_interp = true;
}
}
}
return ret;
}
// Create the segments from a PHDRS clause. Return the segment which
// should hold the file header and program headers, if any.
Output_segment*
Script_sections::create_segments_from_phdrs_clause(Layout* layout,
uint64_t dot_alignment)
{
this->attach_sections_using_phdrs_clause(layout);
return this->set_phdrs_clause_addresses(layout, dot_alignment);
}
// Create the segments from the PHDRS clause, and put the output
// sections in them.
void
Script_sections::attach_sections_using_phdrs_clause(Layout* layout)
{
typedef std::map<std::string, Output_segment*> Name_to_segment;
Name_to_segment name_to_segment;
for (Phdrs_elements::const_iterator p = this->phdrs_elements_->begin();
p != this->phdrs_elements_->end();
++p)
name_to_segment[(*p)->name()] = (*p)->create_segment(layout);
this->segments_created_ = true;
// Walk through the output sections and attach them to segments.
// Output sections in the script which do not list segments are
// attached to the same set of segments as the immediately preceding
// output section.
String_list* phdr_names = NULL;
bool load_segments_only = false;
for (Sections_elements::const_iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
{
bool is_orphan;
String_list* old_phdr_names = phdr_names;
Output_section* os = (*p)->allocate_to_segment(&phdr_names, &is_orphan);
if (os == NULL)
continue;
elfcpp::Elf_Word seg_flags =
Layout::section_flags_to_segment(os->flags());
if (phdr_names == NULL)
{
// Don't worry about empty orphan sections.
if (is_orphan && os->current_data_size() > 0)
gold_error(_("allocated section %s not in any segment"),
os->name());
// To avoid later crashes drop this section into the first
// PT_LOAD segment.
for (Phdrs_elements::const_iterator ppe =
this->phdrs_elements_->begin();
ppe != this->phdrs_elements_->end();
++ppe)
{
Output_segment* oseg = (*ppe)->segment();
if (oseg->type() == elfcpp::PT_LOAD)
{
oseg->add_output_section_to_load(layout, os, seg_flags);
break;
}
}
continue;
}
// We see a list of segments names. Disable PT_LOAD segment only
// filtering.
if (old_phdr_names != phdr_names)
load_segments_only = false;
// If this is an orphan section--one that was not explicitly
// mentioned in the linker script--then it should not inherit
// any segment type other than PT_LOAD. Otherwise, e.g., the
// PT_INTERP segment will pick up following orphan sections,
// which does not make sense. If this is not an orphan section,
// we trust the linker script.
if (is_orphan)
{
// Enable PT_LOAD segments only filtering until we see another
// list of segment names.
load_segments_only = true;
}
bool in_load_segment = false;
for (String_list::const_iterator q = phdr_names->begin();
q != phdr_names->end();
++q)
{
Name_to_segment::const_iterator r = name_to_segment.find(*q);
if (r == name_to_segment.end())
gold_error(_("no segment %s"), q->c_str());
else
{
if (load_segments_only
&& r->second->type() != elfcpp::PT_LOAD)
continue;
if (r->second->type() != elfcpp::PT_LOAD)
r->second->add_output_section_to_nonload(os, seg_flags);
else
{
r->second->add_output_section_to_load(layout, os, seg_flags);
if (in_load_segment)
gold_error(_("section in two PT_LOAD segments"));
in_load_segment = true;
}
}
}
if (!in_load_segment)
gold_error(_("allocated section not in any PT_LOAD segment"));
}
}
// Set the addresses for segments created from a PHDRS clause. Return
// the segment which should hold the file header and program headers,
// if any.
Output_segment*
Script_sections::set_phdrs_clause_addresses(Layout* layout,
uint64_t dot_alignment)
{
Output_segment* load_seg = NULL;
for (Phdrs_elements::const_iterator p = this->phdrs_elements_->begin();
p != this->phdrs_elements_->end();
++p)
{
// Note that we have to set the flags after adding the output
// sections to the segment, as adding an output segment can
// change the flags.
(*p)->set_flags_if_valid();
Output_segment* oseg = (*p)->segment();
if (oseg->type() != elfcpp::PT_LOAD)
{
// The addresses of non-PT_LOAD segments are set from the
// PT_LOAD segments.
if ((*p)->has_load_address())
gold_error(_("may only specify load address for PT_LOAD segment"));
continue;
}
oseg->set_minimum_p_align(dot_alignment);
// The output sections should have addresses from the SECTIONS
// clause. The addresses don't have to be in order, so find the
// one with the lowest load address. Use that to set the
// address of the segment.
Output_section* osec = oseg->section_with_lowest_load_address();
if (osec == NULL)
{
oseg->set_addresses(0, 0);
continue;
}
uint64_t vma = osec->address();
uint64_t lma = osec->has_load_address() ? osec->load_address() : vma;
// Override the load address of the section with the load
// address specified for the segment.
if ((*p)->has_load_address())
{
if (osec->has_load_address())
gold_warning(_("PHDRS load address overrides "
"section %s load address"),
osec->name());
lma = (*p)->load_address();
}
bool headers = (*p)->includes_filehdr() && (*p)->includes_phdrs();
if (!headers && ((*p)->includes_filehdr() || (*p)->includes_phdrs()))
{
// We could support this if we wanted to.
gold_error(_("using only one of FILEHDR and PHDRS is "
"not currently supported"));
}
if (headers)
{
size_t sizeof_headers = this->total_header_size(layout);
uint64_t subtract = this->header_size_adjustment(lma,
sizeof_headers);
if (lma >= subtract && vma >= subtract)
{
lma -= subtract;
vma -= subtract;
}
else
{
gold_error(_("sections loaded on first page without room "
"for file and program headers "
"are not supported"));
}
if (load_seg != NULL)
gold_error(_("using FILEHDR and PHDRS on more than one "
"PT_LOAD segment is not currently supported"));
load_seg = oseg;
}
oseg->set_addresses(vma, lma);
}
return load_seg;
}
// Add the file header and segment headers to non-load segments
// specified in the PHDRS clause.
void
Script_sections::put_headers_in_phdrs(Output_data* file_header,
Output_data* segment_headers)
{
gold_assert(this->saw_phdrs_clause());
for (Phdrs_elements::iterator p = this->phdrs_elements_->begin();
p != this->phdrs_elements_->end();
++p)
{
if ((*p)->type() != elfcpp::PT_LOAD)
{
if ((*p)->includes_phdrs())
(*p)->segment()->add_initial_output_data(segment_headers);
if ((*p)->includes_filehdr())
(*p)->segment()->add_initial_output_data(file_header);
}
}
}
// Look for an output section by name and return the address, the load
// address, the alignment, and the size. This is used when an
// expression refers to an output section which was not actually
// created. This returns true if the section was found, false
// otherwise.
bool
Script_sections::get_output_section_info(const char* name, uint64_t* address,
uint64_t* load_address,
uint64_t* addralign,
uint64_t* size) const
{
if (!this->saw_sections_clause_)
return false;
for (Sections_elements::const_iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
if ((*p)->get_output_section_info(name, address, load_address, addralign,
size))
return true;
return false;
}
// Release all Output_segments. This remove all pointers to all
// Output_segments.
void
Script_sections::release_segments()
{
if (this->saw_phdrs_clause())
{
for (Phdrs_elements::const_iterator p = this->phdrs_elements_->begin();
p != this->phdrs_elements_->end();
++p)
(*p)->release_segment();
}
this->segments_created_ = false;
}
// Print the SECTIONS clause to F for debugging.
void
Script_sections::print(FILE* f) const
{
if (this->phdrs_elements_ != NULL)
{
fprintf(f, "PHDRS {\n");
for (Phdrs_elements::const_iterator p = this->phdrs_elements_->begin();
p != this->phdrs_elements_->end();
++p)
(*p)->print(f);
fprintf(f, "}\n");
}
if (this->memory_regions_ != NULL)
{
fprintf(f, "MEMORY {\n");
for (Memory_regions::const_iterator m = this->memory_regions_->begin();
m != this->memory_regions_->end();
++m)
(*m)->print(f);
fprintf(f, "}\n");
}
if (!this->saw_sections_clause_)
return;
fprintf(f, "SECTIONS {\n");
for (Sections_elements::const_iterator p = this->sections_elements_->begin();
p != this->sections_elements_->end();
++p)
(*p)->print(f);
fprintf(f, "}\n");
}
} // End namespace gold.
|