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
|
/*
* Copyright (C) International Business Machines Corp., 2000-2005
*
* 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 2 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <config.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <memory.h>
#include <string.h>
#include <errno.h>
#include "jfs_types.h"
#include "jfs_filsys.h"
#include "jfs_superblock.h"
#include "jfs_dinode.h"
#include "jfs_dtree.h"
#include "jfs_xtree.h"
#include "jfs_logmgr.h"
#include "jfs_dmap.h"
#include "jfs_imap.h"
#include "jfs_endian.h"
#include "logredo.h"
#include "devices.h"
#include "debug.h"
#include "fsck_message.h" /* for fsck message logging facility */
/* + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
*
* R E M E M B E R M E M O R Y A L L O C F A I L U R E
*
*/
extern int32_t Insuff_memory_for_maps;
extern char *available_stg_addr;
extern int32_t available_stg_bytes;
extern char *bmap_stg_addr;
extern int32_t bmap_stg_bytes;
extern int end_of_transaction;
/* + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
*
* L O C A L M A C R O D E F I N I T I O N S
*
*/
#define UZBIT_8 ((uint8_t) (1 << 7))
#define UZBIT_16 ((uint16_t) (1 << 15 ))
#define UZBIT_32 ((uint32_t) (1 << 31 ))
#define DTPGWORD 32
#define L2DTPGWORD 5
#define DATAPGWORD 32
#define L2DATAPGWORD 5
/* convert disk block number to bmap file page number */
#define BLKTODMAPN(b)\
(((b) >> 13) + ((b) >> 23) + ((b) >> 33) + 3 + 1)
/* The following MACRO update bmap for extents that have
* XAD_NEW | XAD_EXTENDED flag in Xadlist. Then reset
* the XAD_NEW | XAD_EXTENDED bits in the flag
*/
#define MARKXADNEW(PXD, XADP, BMAPT, VOL)\
{\
PXDlength((&PXD), lengthXAD(XADP));\
PXDaddress((&PXD), addressXAD((XADP)));\
markBmap((struct dmap*)(BMAPT), (PXD), 1, (VOL));\
(XADP)->flag &= ~(XAD_NEW|XAD_EXTENDED);\
}
/*
*
* T R A N S A C T I O N H A S H T A B L E
*
* each entry represents a committed transaction in recovery-in-progress
*
* An entry stays in the commit table until the first (in time, last seen
* by logredo) record of a transaction is seen. (It is recognized because
* its backchain == 0)
*/
#define COMSIZE 512
int comfree; /* index of a free com structure */
int comhmask = 63; /* hash mask for comhash */
int comhash[64]; /* head of hash chains */
struct com {
int tid; /* 4: committed tid. */
int next; /* 4: next on free list or hash chain */
} com[COMSIZE]; /* (8) */
/*
*
* R E D O P A G E H A S H T A B L E
*
* each entry represents a disk page that have been updated
* by LOG_REDOPAGE records.
*
* When replay the LOG_REDOPAGE log rec, we should track which portion of the
* disk page has been updated by the LOG_REDOPAGE log records.
* When log is read in backwards direction, a LOG_REDOPAGE log record is
* only applied to disk page image that has not been updated by any earlier
* log records. So that only the last update to a portion is applied.
*
* There are many types of data for LOG_REDOPAGE log rec. Fields
* ino_base, ino_ea, ino_data, summary1 and summary2 use different
* way to do the track according to log.redopage.type:
*
* 1) Xtree page -- since the log record carries at most 2 segments,
* the first one is header, if any, the second one is the
* updated contigous xtree entries starting from offset.
* The number of entries specified in the length.
* If there is only one segment, it must be header.
*
* For xtree, the new entry either inserts or appends.
* If it appends, then the log rec contains only the
* new entry data. If it is inserted, all the entries
* after the insertion need to shift. Then the log rec
* contains all entries starting from the new insertion.
* So only low water mark (lwm) offset needs to be recorded
* in summary2. At logredo time, only the log rec having
* offset lower than lwm will apply to page and only apply
* the difference between offset and lwm.
* Header of the xtree page should be only applied once
* in logredo. So another field in summzry2 track header.
* 2) Dtree page -- A dtree page has 128 slots including header. the slot size
* is 32 byte. A 4 words(32 byte) array is used as a bit
* vector to track the 128 slots.
* 3) inode page -- There are 3 slot sizes and 5 sub-types for inode page.
* Each type is in a separate log record.
*
* a) type == INODE
* Section I (128 byte) of the dinode is logged. Offset is
* counted from the beginning of the inode page.
* A 8-bit vector tracks 8 inodes in inode page.
* the slot size for this type is 128 byte.
* Note: Each inode has 512 bytes, the INODE type only refers
* to the first 128 section. so the offset should
* be always a multiply of 4, i.e. 0, 4, 8, 12, etc..
* b) type == EA ( extended attribute )
* it is the top 16 bytes of section II of the dinode.
* offset should be always ???.
* A 8-bit vector tracks 8 inodes in inode page.
* the slot size is 16 bytes.
* c) type == DATA ( in-line data for symlink )
* A real xt data file starts from the 16 bytes above
* section III of the dinode.
* offset should be always ???.
* A 8-bit vector tracks 8 inodes in inode page.
* the slot size is 16 bytes.
* d) type == BTROOT + DTREE
* It starts from the 32 bytes above section III of the dinode.
* Offset is counted from the beginning of BTROOT.
* An array of 8 uint16_t, each is used as a bit vector to track
* one dtroot.
* the slot size for this type is 32 byte.
* e) type == BTROOT + XTREE
* It starts from the 32 bytes above section III of the dinode.
* Offset is counted from the beginning of BTROOT.
* an array of 8 structrues, each tracks one xtroot for lwm and
* header of xtroot.
* the slot size for this type is 16 byte.
*
* Note1: The slot size is stored in lrd.redopage.l2linesize field.
*
* Note2: The hash key for doblk is aggregate+pxd.
* The same pxd can be used for an INODE log record,
* a BTROOT+DTREE log rec, a BTROOT+XTREE log rec,
* a EA log rec, and a in-line DATA log rec. So for these
* five types, we cannot overlay them each other.
* But the same pxd can be used for either a BTROOT+DTREE log rec
* or a DTREE page log rec, not both. The same pxd can be used
* for either a BTROOT+XTREE log rec or a XTREE page log rec,
* not both.
* Note3: xtpage_lwm and i_xtroot[] have a different initialization value
* from rest of the types. They have to be inited to the
* highest value.
*/
#define BHASHSIZE 1024 /* must be a power of two */
struct doblk {
int32_t aggregate; /* file system aggregate/lv number */
pxd_t pxd; /* on-disk page pxd */
uint16_t type; /* doblk type (inode, xtree, dtree, data) */
#define LOG_NONE 0X1000 /* Invalid doblk type to guarantee noredo */
uint16_t reserved;
union {
struct {
uint8_t ino_base; /* each bit tracks one dinode
* for section I of the dinode
* (128 bytes.) Each inode has
* 4 128-byte slots, with one
* base slot. A total of 8
* bits that need to be marked
* for 8 dinodes in one inode
* page
*/
uint8_t ino_ea; /* extended attribute */
uint8_t ino_data; /* in-line data */
uint8_t xtrt_hd; /* xtroot header */
uint8_t xtrt_lwm[8]; /* xtroot lwm value. */
uint16_t ino_dtroot[8]; /* dtree root. each dinode has
* 9 dtree-root slots, including
* 1 slot header. Each slot is
* 32-byte. Each element of
* i_dtroot[] monitors one dtree
* root of the dinode. For each
* 16-bit, only 9-bit is used.
*/
uint8_t ino_link; /* in-line symlink */
uint8_t dtree; /* flag per ino whether dtree
* has been logged
*/
uint8_t reserved[2];
} inode;
uint32_t dtpage_word[4]; /* dtree page. a total of 128
* slots including header */
struct {
uint8_t xtpage_hd; /* xtree page header */
uint8_t xtpage_lwm; /* xtree page. the lowest offset
* among non-header segments */
} xtpg;
uint32_t data_word[8]; /* data page has 256 16-byte slots */
} summary;
struct doblk *next; /* next entry on hash chain */
};
#define db_ibase summary.inode.ino_base
#define db_iea summary.inode.ino_ea
#define db_idata summary.inode.ino_data
#define db_dtroot summary.inode.ino_dtroot
#define db_xtrt_hd summary.inode.xtrt_hd
#define db_xtrt_lwm summary.inode.xtrt_lwm
#define db_idtree summary.inode.dtree
#define db_ilink summary.inode.ino_link
#define db_dtpagewd summary.dtpage_word
#define db_xtpagelwm summary.xtpg.xtpage_lwm
#define db_xtpghd summary.xtpg.xtpage_hd
#define db_datawd summary.data_word
extern int32_t numdoblk; /* number of do blocks used */
int32_t blkhmask = (BHASHSIZE - 1); /* hash mask for blkhash */
struct doblk *blkhash[BHASHSIZE]; /* head of doblk hash chains */
int32_t Freedoblk; /* number of unused doblk struct */
struct doblk *Blkpage; /* beginning address of doblk hash table page */
/*
*
* N O R E D O F I L E H A S H T A B L E
*
* each entry represents a file system object which has been deleted
* (entry is added when the log record describing the delete is processed)
*/
#define NODOFILEHASHSIZE 512
struct nodofile {
int32_t aggregate; /* 4: file system aggregate/lv number */
uint32_t inode; /* 4: inode number */
struct nodofile *next; /* 4: next entry on nodo hash chain */
}; /* (16) */
extern int32_t numnodofile; /* number of nodo file blocks used */
int32_t nodofilehmask = (NODOFILEHASHSIZE - 1); /* hash mask for nodohash */
struct nodofile *nodofilehash[NODOFILEHASHSIZE]; /* head of nodo hash chains */
int32_t Freenodofile; /* number of unused nodofile struct */
struct nodofile *Nodofilep; /* the beginning address of nodo
hash table page */
struct ExtDtPg {
int32_t pg_vol; /* 4: volume containing the dtpage */
int64_t pg_off; /* 8: dtpage offset, in fsblocks */
struct ExtDtPg *next; /* 4: next entry on list */
}; /* (16) */
extern int32_t numExtDtPg; /* number of extended dtpage blocks used */
int32_t FreeExtDtPg = 0; /* number of unused extended dtpage blocks */
struct ExtDtPg *DtPgPage = NULL; /* storage available for new blocks */
struct ExtDtPg *DtPgList = NULL; /* list of extended dtpages */
/* + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
*
* S T U F F F O R T H E L O G
*
* externals defined in logredo.c
*/
/*
*
* O P E N F I L E S Y S T E M A G G R E G A T E / L V A R R A Y
*
* Defined in logredo.c
*/
extern struct vopen vopen[]; /* (88) */
/*
*
* B U F F E R H E A D E R T A B L E
*
*/
extern struct bufhdr {
int16_t next; /* 2: next on free/lru list */
int16_t prev; /* 2: previous on free/lru list */
int16_t hnext; /* 2: next on hash chain */
int16_t hprev; /* 2: previous on hash chain */
char modify; /* 1: buffer was modified */
char inuse; /* 1: buffer on hash chain */
int16_t reserve; /* 2 */
int32_t vol; /* 4: minor of agrregate/lv number */
pxd_t pxd; /* 8: on-disk page pxd */
} bufhdr[]; /* (24) */
/*
*
* L O G P A G E B U F F E R C A C H E
*
* log has its own 4 page buffer pool.
* --> afterdata defined in logredo.c <--
*/
extern uint8_t afterdata[LOGPSIZE]; /* buffer to read in redopage data */
extern struct logsuper logsup; /* log super block */
/*
*
* E X T E R N A L A N D F O R W A R D R E F E R E N C E S
*
*/
/*
* external references
*/
extern int bread(int32_t, pxd_t, void **, int32_t);
extern int fsError(int, int, int64_t);
extern int openVol(int32_t);
extern int alloc_storage(int32_t, void **, int32_t *);
extern int dMapGet(int, int);
extern int iagGet(int, int32_t);
/*
* forward references
*/
int deleteCommit(int32_t);
int doAfter(struct lrd *, int32_t);
int doCommit(struct lrd *);
int doExtDtPg(void);
int doNoRedoFile(struct lrd *, uint32_t);
int doNoRedoInoExt(struct lrd *);
int doNoRedoPage(struct lrd *);
int doUpdateMap(struct lrd *);
int dtpg_resetFreeList(int32_t, int *);
int dtrt_resetFreeList(int32_t, struct doblk *, struct lrd *, caddr_t);
int findCommit(int32_t);
int findPageRedo(int32_t, pxd_t, struct doblk **);
int logredoInit(void);
int markBmap(struct dmap *, pxd_t, int, int);
int markImap(struct fsimap_lst *, uint32_t, pxd_t, int, int);
int updatePage(struct lrd *, int32_t);
int saveExtDtPg(int32_t, int64_t);
/*
===================================================================
*/
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: deleteCommit(tid)
*
* FUNCTION: Search in the commit array for a commit record with
* transaction id (tid) matching the given tid. If a
* match is found, delete the array entry containing it.
*/
int deleteCommit(int32_t tid)
{ /* transaction id to be deleted */
int k, n, hash;
hash = tid & comhmask; /* hash class */
n = 0; /* previous entry on hash chain */
for (k = comhash[hash]; com[k].tid != tid; k = com[k].next)
n = k;
/* remove k from hash chain and put it on free list
* Special case when 1st on the hash list
*/
if (n == 0)
comhash[hash] = com[k].next;
else
com[n].next = com[k].next;
com[k].next = comfree;
comfree = k;
/* note that the end of the transaction has been seen so
* that the log records it contains will be written to the
* device.
*/
end_of_transaction = -1;
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: doAfter(ld)
*
* FUNCTION: processing for LOG_REDOPAGE record types.
*
* IN GENERAL
* ----------
* The redopage log rec has many sub-types defined in
* ld->log.redopage.type, but in general, the data belonging
* to the REDOPAGE log record is applied to the disk pages
* described by the address in ld->log.redopage.pxd.
*
* Also, depending on the redopage.type,
* - the block map (bmap) may be updated
* - the applicable inode map (imap) may be updated
* - a NoRedoFile filter may be established
* - a NoRedoPage filter may be established
*
* IN PARTICULAR
* -------------
* LOG_BTROOT | LOG_DTREE | LOG_NEW -- describes a dtree root
* which has been reset
*
* The log record data is applied to dtroot slots. The
* dtree root's freelist needs to be initialized. The
* LOG_NEW flag indicates that a dtree root which was a
* leaf is now an internal node.
* Specifically:
* - the dtroot was full and was copied into a new
* dtree (non-root) node.
* - after the log record data is applied to this
* dtree root, only 1 slot will be in use -- it
* will point to the new dtree node.
*
* One log record of this type describes a single dtree
* root.
*
* LOG_BTROOT | LOG_DTREE --describes an updated dtree root
*
* The log record data is applied to dtroot slots. This
* covers the case of dtree root initialization, since
* dtInitRoot() writes all slots (including free slots)
* for a dtree root node into the log record.
*
* One log record of this type describes a single dtree
* root.
*
* LOG_DTREE -- describes an updated dtree (non-root) node
*
* The log record data is applied to the storage defined
* by the pxd.
*
* One log record of this type describes a single dtree
* root.
*
* LOG_DTREE | LOG_NEW -- describes a new dtree (non-root) node
*
* The log record data is applied to the storage defined
* by the pxd. The node's freelist is initialized. The
* block map is updated for the storage allocated for the
* new node.
*
* One log record of this type describes a single dtree
* (non-root) node.
*
* LOG_DTREE | LOG_EXTEND -- describes a (non-root) dtree node
* which has been extended.
*
* The log record data is applied to the storage defined
* by the pxd. The node's freelist is initialized. The
* block map is updated for the storage allocated for the
* extended node.
*
* One log record of this type describes a single dtree
* (non-root) node.
*
* LOG_BTROOT | LOG_XTREE -- describes an updated xtree root
*
* The log record data is applied to the xtree root's
* slots. The block map is updated to show blocks defined
* by the pxd's in updated slots are now in use.
*
* One log record of this type describes a single xtree
* root.
*
* LOG_XTREE | LOG_NEW -- describes a new xtree (non-root) node
*
* The log record data is applied to the xtree node's
* slots. The block map is updated to show blocks defined
* by the pxd's in updated slots are now in use. The block
* map is also updated to show that the blocks occupied by
* the xtree node itself are now in use.
*
* One log record of this type describes a single xtree
* (non-root) node.
*
* LOG_XTREE -- describes an xtree (non-root) node which
* which has been changed.
*
* The log record data is applied to the xtree node's
* slots. The block map is updated to show blocks defined
* by the pxd's in updated slots are now in use.
* (Note that when a file is truncated, the slots describing
* the now deleted blocks are not updated. File truncation
* affects the slot containing the xtree header nextindex
* field.)
*
* One log record of this type describes a single xtree
* (non-root) node.
*
* LOG_INODE -- describes one (4096 byte) page of an inode
* extent (that is, a page actually containing
* inodes) which has been updated.
*
* The log record data is applied to the inode extent page,
* updating from 1 to all of the inodes contained in the
* page. (Note that this may include updates to inline
* EA data.)
*
* ** for this log record, log.redopage.inode contains the
* inode number of the inode map which owns the page.
* That is, not the inode number of any inode being
* changed by the contents of this log record.
* The inode number of each inode being changed by this
* log record can be found in the inode's after image
* in the log record data.
*
* For each inode affected by the log record:
* - If the portion of the inode affected by this
* log data has not been updated by an earlier
* log record in this session, the log data is
* copied over the appropriate portion of the
* inode.
* - If the nlink count == 0,
* o the inode map (imap) is updated to show the
* inode is free
* o a NoRedoFile filter is started for the inode
* - Otherwise (nlink != 0),
* o the inode map (imap) is updated to show the inode
* is allocated.
*
* If at least 1 inode affected by the current log record
* has nlink != 0, the block map is updated to show that
* the block(s) containing the inode extent (of which this
* page is a part) are allocated.
*
* (It is obvious that from this log record we don't have
* enough information to consider marking the blocks
* containing the inode extent free.)
*
* One log record of this type describes from 1 to all 8
* inodes contained in the page.
*
* LOG_DATA -- ** may be used in a future release **
*
* This is for in-line data (i.e. symlink.)
* (TBD)
*
*/
int doAfter(struct lrd *ld, /* pointer to log record descriptor */
int32_t logaddr)
{
int vol, rc = 0;
int32_t hash;
struct nodofile *nodoptr;
/*
* If it's not part of a committed transaction then it
* should be ignored, so just return.
*/
if (!findCommit(ld->logtid))
return (0);
/*
* if it's the last entry for the current committed transaction,
* remove the commit record from the commit list because we won't
* be needing it any more.
*/
if (ld->backchain == 0)
deleteCommit(ld->logtid);
/*
* if the filesystem was cleanly unmounted or if the last
* thing that happened was a logredo failure, skip this
* record. (Necessary for the case of logredo a log shared
* by multiple filesystems. We want to process log records
* for those filesystems which don't meet this criteria, but
* skip log records for those which do.)
*/
vol = ld->aggregate;
if (vopen[vol].status == FM_CLEAN || vopen[vol].status == FM_LOGREDO)
return (0);
/*
* If the redopage.type != LOG_INODE, then if there is a
* NoRedoFile filter in effect for the inode we can skip this
* log record.
*
* N.B. When redopage.type == LOG_INODE, log.redopage.inode is
* the owning imap's inode number. We'll check for NoRedoFile
* filter(s) on the inode(s) actually affected by the log
* record when we examine the log record data in updatePage().
*/
if (!(ld->log.redopage.type & LOG_INODE)) {
hash = (ld->aggregate + ld->log.redopage.inode) & nodofilehmask;
for (nodoptr = nodofilehash[hash]; nodoptr != NULL;
nodoptr = nodoptr->next) {
if (ld->aggregate == nodoptr->aggregate &&
ld->log.redopage.inode == nodoptr->inode)
return (0);
}
}
/*
* updatePage() takes care of applying the log data.
* This includes:
* - applying log data to the affected page
* - updates to the inode map for inodes allocated/free
* - updates to the block map for an allocated inode extent
* - establishing NoRedoFile or NoRedoExtent filters
* - updates to the block map for extents described in an
* xtree root or node xadlist
*/
if ((rc = updatePage(ld, logaddr)) != 0) {
fsck_send_msg(lrdo_DAFTUPDPGFAILED, logaddr, rc);
return (rc);
}
/*
* If this isn't a REDOPAGE log record, we're done
*/
if (ld->type != LOG_REDOPAGE)
return (0);
/*
* update the block map for a new or extended dtree page and
* for a new xtree page
*/
switch (ld->log.redopage.type) {
case (LOG_DTREE | LOG_NEW):
/*
* the pxd describes the (non-root) dtree page
*/
case (LOG_DTREE | LOG_EXTEND):
/*
* The pxd describes the entire (non-root) dtree page, not
* just the new extension, but it's always ok to mark allocated
* something which is already marked that way.
*
* (And we don't really know how many of the trailing blocks
* were newly added here anyway.)
*/
case (LOG_XTREE | LOG_NEW):
/*
* the pxd describes the (non-root) xtree page
*/
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, ld->log.redopage.pxd, 1, vol);
if (rc) {
fsck_send_msg(lrdo_DAFTMRKBMPFAILED, logaddr, rc);
}
break;
}
return (rc);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: doCommit(ld)
*
* FUNCTION: Insert the transaction ID (tid) from the given commit
* record into the commit array
*/
int doCommit(struct lrd *ld)
{ /* pointer to record descriptor */
int k, hash;
DBG_TRACE(("logredo:Docommit\n"))
if (comfree == 0)
return (JLOG_NOCOMFREE);
k = comfree;
comfree = com[k].next;
hash = ld->logtid & comhmask;
com[k].next = comhash[hash];
com[k].tid = ld->logtid;
comhash[hash] = k;
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: doExtDtPg()
*
* FUNCTION: Rebuild the freelist for each dtpage which has been
* extended in the current logredo session.
*
*/
int doExtDtPg()
{
struct ExtDtPg *edpp;
int dedp_rc = 0;
int *buf;
pxd_t a_pxd;
while ((DtPgList != NULL) && (dedp_rc == 0)) {
edpp = DtPgList;
PXDaddress(&a_pxd, edpp->pg_off);
PXDlength(&a_pxd, vopen[edpp->pg_vol].lbperpage);
dedp_rc = bread(edpp->pg_vol, a_pxd, (void **) &buf, PB_UPDATE);
if (dedp_rc) {
fsck_send_msg(lrdo_DEDPBREADFAILED, (long long)edpp->pg_off,
dedp_rc);
dedp_rc = DTPAGE_READERROR1;
} else {
dedp_rc = dtpg_resetFreeList(edpp->pg_vol, buf);
DtPgList = DtPgList->next;
}
} /* end while */
return (dedp_rc);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: doNoRedoFile()
*
* FUNCTION: Add a record for the specified inode to the
* NoRedoFile array.
*/
int doNoRedoFile(struct lrd *ld, /* pointer to record descriptor */
uint32_t inum)
{ /* the inode number for noredofile */
int rc = 0;
struct nodofile *ndptr;
int32_t hash;
int32_t allocated_from_bmap = 0;
/*
* If it's not part of a committed transaction then it
* should be ignored, so just return.
*/
if (!findCommit(ld->logtid))
return (0);
/*
* if it's the last entry for the current committed transaction,
* remove the commit record from the commit list because we won't
* be needing it any more.
*/
if (ld->backchain == 0)
deleteCommit(ld->logtid);
/*
* start NoRedoFile filter for the specified inode by
* adding a record to the NoRedoFile hash list.
*
*/
hash = (ld->aggregate + inum) & nodofilehmask;
if (Freenodofile == 0) {
#ifdef _JFS_DEBUG
printf("logredo:alloc (d)%d bytes for NoRedoFile filter\n", PSIZE);
#endif
rc = alloc_storage((uint32_t) PSIZE, (void **) &Nodofilep, &allocated_from_bmap);
if ((rc != 0) || (Nodofilep == NULL)) {
/*
* NoRedoFile filter allocation failed
*/
#ifdef _JFS_DEBUG
printf("logredo:alloc (d)%lld bytes for NoRedoFile filter failed\n", PSIZE);
#endif
fsck_send_msg(lrdo_ALLOC4NOREDOFLFAIL, PSIZE);
return (ENOMEM3);
} else if (Nodofilep != NULL) {
/* NoRedoFile filter allocation successful */
if (allocated_from_bmap) {
#ifdef _JFS_DEBUG
printf
("logredo:alloc (d)%lld bytes for NoRedoFile filter out of bmap allocation\n",
PSIZE);
#endif
fsck_send_msg(lrdo_USINGBMAPALLOC4NRFL);
}
}
/* end NoRedoFile filter allocation successful */
Freenodofile = PSIZE / sizeof (struct nodofile);
}
ndptr = Nodofilep++;
numnodofile++;
Freenodofile--;
ndptr->next = nodofilehash[hash];
nodofilehash[hash] = ndptr;
ndptr->aggregate = ld->aggregate;
ndptr->inode = inum;
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: doNoRedoPage()
*
* FUNCTION: Processing for LOG_NOREDOPAGE rec type.
*
* This routine starts a NoRedoPage filter for the
* specified xtree or dtree node (may be root).
*
* This routine updates the bmap when the freed node
* is NOT the root node.
* (ld->log.noredopage.pxd = old page extent)
*
* NOTE: This routine only updates the block map when the
* extent being freed describes a dtree page.
* Block map updates for a freed xtree page are handled
* when the UPDATEMAP log record is seen.
*
*/
int doNoRedoPage(struct lrd *ld)
{ /* pointer to log record descriptor */
int vol, rc = 0;
int32_t hash;
struct nodofile *nodoptr;
pxd_t pxd1;
struct doblk *db;
int32_t inonum;
uint8_t mask_8;
/*
* If it's not part of a committed transaction then it
* should be ignored, so just return.
*/
if (!findCommit(ld->logtid))
return (0);
/*
* if it's the last entry for the current committed transaction,
* remove the commit record from the commit list because we won't
* be needing it any more.
*/
if (ld->backchain == 0)
deleteCommit(ld->logtid);
/*
* if the filesystem was cleanly unmounted or if the last
* thing that happened was a logredo failure, skip this
* record. (Necessary for the case of logredo a log shared
* by multiple filesystems. We want to process log records
* for those filesystems which don't meet this criteria, but
* skip log records for those which do.)
*/
vol = ld->aggregate;
if (vopen[vol].status == FM_CLEAN || vopen[vol].status == FM_LOGREDO)
return (0);
/*
* We may already have a NoRedoPage filter in effect.
* If one is found on the NoRedoFile hash chain, goto update
* map.
*
* N.B. The log.noredopage.inode in the log record is the
* inode number of the applicable imap. We NEVER
* NoRedoFile for an imap inode.
*/
hash = (ld->aggregate + ld->log.noredopage.inode) & nodofilehmask;
for (nodoptr = nodofilehash[hash]; nodoptr != NULL;
nodoptr = nodoptr->next) {
if (ld->aggregate == nodoptr->aggregate &&
ld->log.noredopage.inode == nodoptr->inode)
goto updmap;
}
/*
* start NoRedoPage filter for LOG_NOREDOPAGE log rec.
*
*/
pxd1 = ld->log.noredopage.pxd;
/*
* DTREE ROOT
*
* Do not process any further log records for
* the root of the specified (directory) inode's dtree.
*/
if ((ld->log.noredopage.type & (LOG_BTROOT | LOG_DTREE))
== (LOG_BTROOT | LOG_DTREE)) {
/*
* get the noredopage record for this page
* (one is created if none exists)
*/
rc = findPageRedo(ld->aggregate, pxd1, &db);
if (rc != 0) {
fsck_send_msg(lrdo_DNRPFNDDTRTPGREDOFAIL, rc);
return (rc);
}
/*
* mark the appropriate slot in the noredopage for
* no further updates to this (directory) inode's
* dtree root.
*/
inonum = ld->log.redopage.inode & 0x07;
db->db_dtroot[inonum] = 0x01ff;
/*
* This inode is identified as a dtroot. So mark
* the appropriate slot in the noredopage for
* NO updates to this inode as an xtroot.
*/
mask_8 = UZBIT_8 >> inonum;
db->db_xtrt_lwm[inonum] = XTENTRYSTART;
db->db_xtrt_hd |= mask_8;
/*
* XTREE ROOT
*
* Do not process any further log records for
* the root of the specified inode's xtree.
*/
} else if ((ld->log.redopage.type & (LOG_BTROOT | LOG_XTREE))
== (LOG_BTROOT | LOG_XTREE)) {
/*
* get the noredopage record for this page
* (one is created if none exists)
*/
rc = findPageRedo(ld->aggregate, pxd1, &db);
if (rc != 0) {
fsck_send_msg(lrdo_DNRPFNDXTRTPGREDOFAIL, rc);
return (rc);
}
/*
* mark the appropriate slot in the noredopage for no
* further updates to this inode's xtree root.
*/
inonum = ld->log.redopage.inode & 0x07;
mask_8 = UZBIT_8 >> inonum;
db->db_xtrt_lwm[inonum] = XTENTRYSTART;
db->db_xtrt_hd |= mask_8;
/*
* This inode is identified as an xtree root. So
* mark the appropriate slot in the noredopage for
* NO updates to this inode's root as a dtree.
*/
db->db_dtroot[inonum] = 0x01ff;
/*
* DTREE, XTREE, or DATA NODE
*
* Do not process any further log records for
* the specified page.
*/
} else if (ld->log.redopage.type & (LOG_XTREE | LOG_DTREE | LOG_DATA)) {
/*
* get the noredopage record for this page
* (one is created if none exists)
*/
rc = findPageRedo(ld->aggregate, pxd1, &db);
if (rc != 0) {
fsck_send_msg(lrdo_DNRPFNDXTPGPGREDOFAIL, rc);
return (rc);
}
db->type = LOG_NONE;
/*
* UNRECOGNIZED TYPE
*
* We don't ever expect to get here!
*/
} else {
fsck_send_msg(lrdo_DNRPUNKNOWNTYPE);
}
/*
* If this is a (non-root) dtree page update the bmap.
*/
updmap:
if (ld->log.noredopage.type == LOG_DTREE) {
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, ld->log.noredopage.pxd, 0, vol);
if (rc != 0) {
return (rc);
}
}
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: doNoRedoInoExt()
*
* FUNCTION: Processing for LOG_NOREDOINOEXT rec type.
*
* This routine starts a NoRedoPage filter for each
* page in the inode extent being released.
*
* This routine may updates the bmap and the imap.
*
* NOTE: The noredoinoext.pxd describes a 4 (4096-byte) page
* inode extent.
*
*
* NOTE: This log record was written when an inode extent was
* released.
*
* At this point, there are 3 possibilities:
*
* o the extent could have been reallocated for an inode
* extent (possibly even for the same inode number range.
* If this is true, then there is already a NoRedoExtent
* filter in effect.
*
* o the extent could now be allocated for user data or for
* JFS metadata. If this is true, then further updates
* to the blocks in the extent would violate data
* integrity. Therefore, we establish a NoRedoExtent
* filter (i.e., a NoRedoPage filter for each of the
* 4 pages in the extent).
*
* o the extent could be unallocated. That is, none of the
* blocks in the extent pages are in use. If this is
* true, then further updates to the blocks in the extent
* are a waste of processing time. Therefore, we establish
* a NoRedoExtent filter (i.e., a NoRedoPage filter for
* each of the 4 pages in the extent).
*
*/
int doNoRedoInoExt(struct lrd *ld)
{ /* pointer to log record descriptor */
int pg_idx, vol, rc = 0;
pxd_t pxd1;
struct doblk *db;
int32_t iagnum, iagext_idx;
struct iag_data *imp;
/*
* If it's not part of a committed transaction then it
* should be ignored, so just return.
*/
if (!findCommit(ld->logtid))
return (0);
/*
* if it's the last entry for the current committed transaction,
* remove the commit record from the commit list because we won't
* be needing it any more.
*/
if (ld->backchain == 0)
deleteCommit(ld->logtid);
/*
* if the filesystem was cleanly unmounted or if the last
* thing that happened was a logredo failure, skip this
* record. (Necessary for the case of logredo a log shared
* by multiple filesystems. We want to process log records
* for those filesystems which don't meet this criteria, but
* skip log records for those which do.)
*/
vol = ld->aggregate;
if (vopen[vol].status == FM_CLEAN || vopen[vol].status == FM_LOGREDO)
return (0);
/*
* Establish the 4 NoRedoPage filters which together
* form the NoRedoExtent filter.
*/
pxd1 = ld->log.noredoinoext.pxd;
for (pg_idx = 0; pg_idx < 4; pg_idx++) {
/*
* find the noredo record for this page.
* (or create one if not found)
*/
rc = findPageRedo(ld->aggregate, pxd1, &db);
if (rc != 0) {
fsck_send_msg(lrdo_DNRIFNDNOREDORECFAIL, rc);
return (rc);
}
/*
* mark for no inode updates to the page, no matter what
* format it might appear to have
*/
db->type = LOG_NONE;
/*
* set up for the next page in the extent
*/
PXDaddress(&pxd1, (addressPXD(&pxd1) + vopen[vol].lbperpage)
);
} /* end for */
/*
* Now go update the block map if appropriate.
*
* Note:
* If any of these blocks has been allocated LATER
* (in time) than this extent release then we don't
* want to mark them unallocated, but if not then
* we must mark them unallocated. Since we process
* log records in LIFO order, we have already
* processed the log record(s) (if any) describing
* reallocation of the block(s).
*
* The markBmap routine only marks the block map
* for blocks whose status has not already been
* set by markBmap in the current logredo session.
*
*/
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, ld->log.noredoinoext.pxd, 0, vol);
if (rc != 0) {
return (rc);
}
/*
* Now, if no extent has been reallocated for
* the inodes in the range which the extent being
* released describes, then the IAG needs to be
* updated to show that this extent is not
* allocated.
*
* NOTE: It is not necessary to adjust the IAG
* Free Extent List, the IAG Free Inodes List,
* or the Free IAG List because they will be
* rebuilt from scratch before the filesystem
* is remounted (either near the end of logredo
* processing or by fsck after logredo returns
* control to it with rc != 0)
*
* NOTE: The wmap of the IAG tells whether logredo
* has already encountered a log record for
* one of these inodes. This would mean
* activity for the inode(s) LATER IN TIME
* than the current transaction. If no such
* record has been seen, then the IAG[extno]
* needs to be cleared.
*/
iagnum = ld->log.noredoinoext.iagnum;
imp = vopen[vol].fsimap_lst.imap_wsp[(iagnum + 1)].imap_data;
if (imp == NULL) { /* first touch to this IAG */
rc = iagGet(vol, iagnum);
if (rc != 0) {
return (rc);
}
imp = vopen[vol].fsimap_lst.imap_wsp[(iagnum + 1)].imap_data;
}
/* end first touch to this IAG */
iagext_idx = ld->log.noredoinoext.inoext_idx;
if (imp->wmap[iagext_idx] == 0) {
/* no later activity for
* the inodes in the range for this
* inode extent.
*/
/* all of them are now in a determined state */
imp->wmap[iagext_idx] = 0xFFFFFFFF;
/* and that state is 'not allocated' */
imp->pmap[iagext_idx] = 0x00000000;
PXDlength(&(imp->inoext[iagext_idx]), 0);
PXDaddress(&(imp->inoext[iagext_idx]), 0);
}
/* end no activity for the inodes in the range for ... */
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: doUpdateMap(ld)
*
* FUNCTION: processing for LOG_UPDATEMAP record types.
*
* IN GENERAL
* ----------
* The updatemap log record has many sub-types defined in
* ld->log.updatemap.type, but in general, the log record
* data describes file system block extent(s) for which
* the block map (bmap) needs to be marked.
*
* IN PARTICULAR
* -------------
* LOG_ALLOCPXD -- is written when an outline EA is allocated
*
* The log record data is a single PXD describing the
* filesystem blocks to be marked allocated in the block map.
*
* LOG_ALLOCPXDLIST -- is not used in release 1 of JFS
*
* LOG_ALLOCXAD -- is not used in release 1 of JFS
*
* LOG_ALLOCXADLIST -- is not used in release 1 of JFS
*
* LOG_FREEPXD -- is written when a file is truncated and
* a portion of the extent described by a
* PXD is released
* -- is written when an outline EA is freed
*
* The log record data is a single PXD describing the
* filesystem blocks to be marked free in the block map.
*
* LOG_FREEPXDLIST -- is written when a file is compressed
* -- is written when a file grows and the tail
* cannot be extended in-place. **see note
*
* The log record data is a list of PXD's describing the
* extents to be marked free in the block map.
*
* LOG_FREEXAD -- is not used in release 1 of JFS
*
* LOG_FREEXADLIST -- is written when a file is truncated
*
* The log record data is a list of XAD's describing the
* extents to be marked free in the block map.
*
* **note: (see reference in LOG_FREEPXDLIST above)
*
* Each extent of a file MUST be an even multiple of 4096 byte
* pages, except the last extent, which need only be an even
* multiple of filesystem blocks. This means that, if the last
* extent is not a whole page, then it must be extended to a
* whole page before another extent can be added. If the
* filesystem blocks immediately following the current last
* extent are not available, then it is necessary to select
* a larger storage area and copy the contents of the current
* last extent and the new data (the reason the file is being
* extended in the first place) into it.
*
* To illustrate:
* suppose the filesystem block size is 1024 and a particular
* files is 9216 bytes long, stored as
* 1 extent 8 fs blocks (8192 bytes = 2 * 4096) and
* 1 extent 1 fs block (1024 bytes)
* now suppose another 5120 bytes are appended to the file.
* The 2nd extent must be extended because it must either
* become an even multiple of 4096 or it must remain the last
* extent in the file.
* Both:
* 1 extent 8 fs blocks (8192 bytes)
* 1 extent 6 fs blocks (6144 bytes)
* and:
* 1 extent 8 fs blocks (8192 bytes)
* 1 extent 4 fs blocks (4096 bytes)
* 1 extent 2 fs blocks (2048 bytes)
* are possible and correct outcomes.
*
*
* NOTE: Since UPDATEMAP log records only affect the block map,
* the noredofile hash chain is not checked and the transaction
* should not be skipped.
*
* When a file system object is deleted, UPDATEMAP log records
* are created (as appropriate) to release storage from (and
* possibly for) metadata xtree pages. No NoRedoPage log records
* are written for these pages.
*
*/
int doUpdateMap(struct lrd *ld)
{ /* pointer to log record descriptor */
int i, vol, rc = 0;
xad_t *l_xad;
pxd_t *l_pxd;
pxd_t pxd1;
/*
* If it's not part of a committed transaction then it
* should be ignored, so just return.
*/
if (!findCommit(ld->logtid))
return (0);
/*
* if it's the last entry for the current committed transaction,
* remove the commit record from the commit list because we won't
* be needing it any more.
*/
if (ld->backchain == 0)
deleteCommit(ld->logtid);
/*
* if the filesystem was cleanly unmounted or if the last
* thing that happened was a logredo failure, skip this
* record. (Necessary for the case of logredo a log shared
* by multiple filesystems. We want to process log records
* for those filesystems which don't meet this criteria, but
* skip log records for those which do.)
*/
vol = ld->aggregate;
if (vopen[vol].status == FM_CLEAN || vopen[vol].status == FM_LOGREDO)
return (0);
if (ld->log.updatemap.type & LOG_FREEXADLIST) {
/*
* The data area contains an array of XAD's, with
* updatemap.nxd elements.
*/
l_xad = (xad_t *) afterdata;
for (i = 0; i < ld->log.updatemap.nxd; i++) {
PXDaddress(&pxd1, addressXAD(l_xad));
PXDlength(&pxd1, lengthXAD(l_xad));
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, pxd1, 0, vol);
if (rc != 0) {
return (rc);
}
l_xad += 1;
}
} else if (ld->log.updatemap.type & LOG_FREEPXDLIST) {
/*
* The data area contains an array of PXD's, with
* updatemap.nxd elements.
*/
l_pxd = (pxd_t *) afterdata;
for (i = 0; i < ld->log.updatemap.nxd; i++, l_pxd++)
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, *l_pxd, 0, vol);
if (rc != 0) {
return (rc);
}
} else if (ld->log.updatemap.type & LOG_FREEPXD) {
/*
* The updatemap.nxd should be 1 in this case.
*/
if (ld->log.updatemap.nxd > 1)
fsError(LOGRCERR, vol, ld->log.updatemap.nxd);
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, ld->log.updatemap.pxd, 0, vol);
if (rc != 0) {
return (rc);
}
} else if (ld->log.updatemap.type & LOG_ALLOCPXD) {
/*
* The updatemap.nxd should be 1 in this case.
*/
if (ld->log.updatemap.nxd > 1)
fsError(LOGRCERR, vol, ld->log.updatemap.nxd);
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, ld->log.updatemap.pxd, 1, vol);
if (rc != 0) {
return (rc);
}
} else
fsck_send_msg(lrdo_DUMPUNKNOWNTYPE);
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: dtpg_resetFreeList(ld)
*
* FUNCTION: Reset the freelist in the given Directory Btree (nonroot)
* node.
*
* NOTE: none
*
*/
int dtpg_resetFreeList(int32_t vol, int *buf)
{ /* buf contains on-disk page image */
int16_t pxd_len;
int16_t nslots; /* number of slots in log.redopage.pxd */
dtpage_t *dtpg;
int16_t stbl_nslots; /* number of slots occupied by
* the stbl for the page
*/
int8_t slot_map[DTPAGEMAXSLOT];
int8_t *slot_table;
int16_t sidx, slot_idx = 0;
struct dtslot *this_slot;
struct dtslot *last_slot = 0;
struct idtentry *intern_hdr_slot;
struct ldtentry *leaf_hdr_slot;
dtpg = (dtpage_t *) buf;
if (dtpg->header.nextindex == -1) {
/*
* the stbl is full, no slots
* can be available
*/
dtpg->header.freecnt = 0;
dtpg->header.freelist = -1;
return 0;
}
/* the stbl isn't full. slots may be free. */
/*
* The dtree page size is 512, 1024, 2048, or 4096 bytes.
* We need to know how many slots it contains and how many
* slots are occupied by its slot table (stbl).
*/
pxd_len = (lengthPXD(&dtpg->header.self)) << vopen[vol].l2bsize;
switch (pxd_len) {
case DT8THPGNODEBYTES: /* 512 bytes */
nslots = DT8THPGNODESLOTS;
stbl_nslots = DT8THPGNODETSLOTS;
break;
case DTQTRPGNODEBYTES: /* 1024 bytes */
nslots = DTQTRPGNODESLOTS;
stbl_nslots = DTQTRPGNODETSLOTS;
break;
case DTHALFPGNODEBYTES: /* 2048 bytes */
nslots = DTHALFPGNODESLOTS;
stbl_nslots = DTHALFPGNODETSLOTS;
break;
default: /* 4096 bytes */
nslots = DTFULLPGNODESLOTS;
stbl_nslots = DTFULLPGNODETSLOTS;
break;
} /* end switch */
/*
* clear the slot map
*/
for (sidx = 0; sidx < nslots; sidx++) {
slot_map[sidx] = 0;
}
/*
* account for the header and for the stbl slots
*/
slot_map[0] = -1; /* the header */
for (sidx = 0; sidx < stbl_nslots; sidx++) {
slot_map[dtpg->header.stblindex + sidx] = -1;
} /* end for */
slot_table = (int8_t *) & (dtpg->slot[dtpg->header.stblindex]);
/*
* figure out which slots are in use
*/
for (sidx = 0; sidx < dtpg->header.nextindex; sidx++) {
/*
* the dir entry header slot
*/
/*
* If the index is out of bounds or if we've
* already seen it in use then something is
* seriously wrong and we need a full fsck.
* Since the problem could have been caused
* by something in this logredo session,
* signal fsck to reformat the log.
*/
if ((slot_table[sidx] >= nslots) || (slot_map[slot_table[sidx]] != 0)) {
fsck_send_msg(lrdo_DPRFBADSTBLENTRY,
(long long) (addressPXD(&dtpg->header.self)));
return (DTPAGE_BADSTBLENTRY1);
}
/* endif */
slot_map[slot_table[sidx]] = -1;
/*
* any continuation slots for the dir entry
*/
if ((dtpg->header.flag & BT_LEAF) == BT_LEAF) {
leaf_hdr_slot = (struct ldtentry *)
&(dtpg->slot[slot_table[sidx]]);
slot_idx = leaf_hdr_slot->next;
} else { /* internal page */
intern_hdr_slot = (struct idtentry *)
&(dtpg->slot[slot_table[sidx]]);
slot_idx = intern_hdr_slot->next;
} /* end else internal page */
while (slot_idx != -1) {
/*
* if the index is out of bounds or
* if we've already seen it in use then
* something is seriously wrong and we
* need a full fsck.
* Since the problem could have been caused
* by something in this logredo session,
* signal fsck to reformat the log.
*/
if ((slot_idx >= nslots) || (slot_map[slot_idx] != 0)) {
fsck_send_msg(lrdo_DPRFBADSLOTNXTIDX,
(long long) (addressPXD(&dtpg->header.self)));
return (DTPAGE_BADSLOTNEXTIDX1);
}
/* endif */
slot_map[slot_idx] = -1;
this_slot = &(dtpg->slot[slot_idx]);
slot_idx = this_slot->next;
} /* end while slot_idx */
} /* end for sidx */
/*
* find the first available slot
*/
dtpg->header.freecnt = 0; /* assume none free */
dtpg->header.freelist = -1; /* assume none free */
for (sidx = 0; ((sidx < nslots) && (dtpg->header.freecnt == 0)); sidx++) {
if (slot_map[sidx] == 0) {
dtpg->header.freecnt = 1;
dtpg->header.freelist = sidx;
slot_idx = sidx;
last_slot = &(dtpg->slot[sidx]);
} /* end if */
} /* end for */
/*
* count and chain together all available slots
*/
if (dtpg->header.freecnt != 0) { /* found a free one */
for (sidx = (slot_idx + 1); sidx < nslots; sidx++) {
if (slot_map[sidx] == 0) {
last_slot->next = sidx;
dtpg->header.freecnt += 1;
last_slot = &(dtpg->slot[sidx]);
} /* end if */
} /* end for */
last_slot->next = -1; /* terminate the chain */
}
/* end found a free one */
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: dtrt_resetFreeList(ld)
*
* FUNCTION: Reset the freelist in the given Directory inode Btree root.
*
* NOTE: none
*/
int dtrt_resetFreeList(int32_t vol, struct doblk *db, struct lrd *ld, caddr_t buf_btroot)
{
dtroot_t *dtrt;
int8_t slot_map[DTROOTMAXSLOT];
int16_t sidx, slot_idx = 0;
struct dtslot *this_slot;
struct dtslot *last_slot = 0;
struct idtentry *intern_hdr_slot;
struct ldtentry *leaf_hdr_slot;
/*
* The doblk.i_dtroot (or doblk.dtpage_word) tracks which slots
* slots have been updated, but since some of those updates may
* be deletions, we can't use it to create the freelist.
*/
dtrt = (dtroot_t *) buf_btroot;
if (dtrt->header.nextindex == -1) {
/*
* the stbl is full, no slots
* can be available
*/
dtrt->header.freecnt = 0;
dtrt->header.freelist = -1;
return 0;
}
/* the stbl isn't full. slots may be free. */
/*
* clear the slot map
*/
for (sidx = 0; sidx < DTROOTMAXSLOT; sidx++) {
slot_map[sidx] = 0;
}
slot_map[0] = -1; /* the header occupies this space */
/*
* figure out which slots are in use
*/
for (sidx = 0; sidx < dtrt->header.nextindex; sidx++) {
/*
* the dir entry header slot
*/
/*
* If the index is out of bounds or if we've
* already seen it in use then something is
* seriously wrong and we need a full fsck.
* Since the problem could have been caused
* by something in this logredo session,
* signal fsck to reformat the log.
*/
if ((dtrt->header.stbl[sidx] >= DTROOTMAXSLOT) ||
(slot_map[dtrt->header.stbl[sidx]] != 0)) {
fsck_send_msg(lrdo_DRRFBADSTBLENTRY);
return (DTPAGE_BADSTBLENTRY2);
}
/* endif */
slot_map[dtrt->header.stbl[sidx]] = -1;
/*
* any continuation slots for the dir entry
*/
if ((dtrt->header.flag & BT_LEAF) == BT_LEAF) {
leaf_hdr_slot = (struct ldtentry *)
&(dtrt->slot[dtrt->header.stbl[sidx]]);
slot_idx = leaf_hdr_slot->next;
} else { /* internal page */
intern_hdr_slot = (struct idtentry *)
&(dtrt->slot[dtrt->header.stbl[sidx]]);
slot_idx = intern_hdr_slot->next;
} /* end else internal page */
while (slot_idx != -1) {
/*
* if the index is out of bounds or if we've
* already seen it in use then something is
* seriously wrong and we need a full fsck.
*
* Since the problem could have been caused by
* something in this logredo session, signal
* fsck to reformat the log.
*/
if ((slot_idx >= DTROOTMAXSLOT) || (slot_map[slot_idx] != 0)) {
fsck_send_msg(lrdo_DRRFBADSLOTNXTIDX);
return (DTPAGE_BADSLOTNEXTIDX2);
}
/* endif */
slot_map[slot_idx] = -1;
this_slot = &(dtrt->slot[slot_idx]);
slot_idx = this_slot->next;
} /* end while slot_idx */
} /* end for sidx */
/*
* find the first available slot
*/
dtrt->header.freecnt = 0; /* assume none free */
dtrt->header.freelist = -1; /* assume none free */
for (sidx = 0; ((sidx < DTROOTMAXSLOT)
&& (dtrt->header.freecnt == 0)); sidx++) {
if (slot_map[sidx] == 0) {
dtrt->header.freecnt = 1;
dtrt->header.freelist = sidx;
slot_idx = sidx;
last_slot = &(dtrt->slot[sidx]);
}
}
/*
* count and chain together all available slots
*/
if (dtrt->header.freecnt != 0) { /* found a free one */
for (sidx = (slot_idx + 1); sidx < DTROOTMAXSLOT; sidx++) {
if (slot_map[sidx] == 0) {
last_slot->next = sidx;
dtrt->header.freecnt += 1;
last_slot = &(dtrt->slot[sidx]);
} /* end if */
} /* end for */
last_slot->next = -1; /* terminate the chain */
}
/* end found a free one */
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: findCommit(tid)
*
* FUNCTION: Search in the commit array for a commit record with
* transaction id (tid) matching the given tid.
* Return the commit array index where found, or 0
* if not found.
*/
int findCommit(int32_t tid)
{ /* transaction id */
int32_t k, hash;
hash = tid & comhmask; /* hash class */
for (k = comhash[hash]; k != 0; k = com[k].next)
if (com[k].tid == tid)
return (k);
return (0); /* not found */
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: findPageRedo()
*
* FUNCTION: Search in the RedoPage hash table for a record
* containing the block address in the given pxd.
* If no match is found, such a record is created and
* inserted into the table.
*
* The address of the found (or created) doblk is
* returned.
*
*/
int findPageRedo(int32_t aggregate, /* file system aggregate/lv number */
pxd_t pxd, /* on-disk page pxd */
struct doblk **doptr)
{
int rc = 0;
int32_t hash;
struct doblk *dp;
int32_t allocated_from_bmap = 0;
/*
* Search for a record with matching aggregate, and block offset.
*/
hash = (aggregate + addressPXD(&pxd)) & blkhmask;
for (dp = blkhash[hash]; dp != NULL; dp = dp->next)
if (dp->aggregate == aggregate &&
addressPXD(&dp->pxd) == addressPXD(&pxd)) {
/*
* match found. return its address to caller
*/
*doptr = dp;
return (0);
}
/*
* No match was found.
*/
/*
* if there are no available doblk records,
* allocate some storage
*/
if (Freedoblk == 0) {
rc = alloc_storage((uint32_t) PSIZE, (void **) &Blkpage, &allocated_from_bmap);
if ((rc != 0) || (Blkpage == NULL)) {
fsck_send_msg(lrdo_ALLOC4DOBLKFAIL, PSIZE);
return (ENOMEM4);
}
if (allocated_from_bmap) {
fsck_send_msg(lrdo_USINGBMAPALLOC4DOBLK);
}
Freedoblk = PSIZE / sizeof (struct doblk);
}
dp = Blkpage;
/*
* Allocate a doblk record and initialize it
* with the given aggregate and block
* offset. Insert the record into the RedoPage
* hash table.
*/
numdoblk++;
Blkpage++;
Freedoblk--;
dp->next = blkhash[hash];
blkhash[hash] = dp;
dp->aggregate = aggregate;
dp->pxd = pxd;
dp->type = 0;
memset(&dp->summary, 0, sizeof (dp->summary));
/*
* return the address of the created doblk to caller
*/
*doptr = dp;
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: logredoInit()
*
* FUNCTION: allocate/initialize runtime data structures and
* initialize for file systems sharing the log.
*/
int logredoInit()
{
int rc = 0;
int k;
int allocated_from_bmap = 0;
/*
* init free list for com. index 0 is not used.
*/
comfree = 1;
for (k = 1; k < COMSIZE; k++)
com[k].next = k + 1;
/*
* init comhash chains
*/
for (k = 0; k < 64; k++)
comhash[k] = 0;
/*
* init block hash chains
*/
numdoblk = 0;
for (k = 0; k < BHASHSIZE; k++)
blkhash[k] = NULL;
/*
* allocate one page space for redo page hash table
*/
rc = alloc_storage((uint32_t) PSIZE, (void **) &Blkpage, &allocated_from_bmap);
if ((rc != 0) || (Blkpage == NULL)) {
/* RedoPage record allocation failed */
fsck_send_msg(lrdo_ALLOC4REDOPGFAIL, PSIZE);
return (ENOMEM5);
}
if (allocated_from_bmap) {
fsck_send_msg(lrdo_USINGBMAPALLOC4RDPG);
}
Freedoblk = PSIZE / sizeof (struct doblk);
/*
* init nodofile hash chains , and counts
*/
numnodofile = 0;
for (k = 0; k < NODOFILEHASHSIZE; k++)
nodofilehash[k] = NULL;
/*
* allocate one page space for nodo file hash table
*/
rc = alloc_storage((uint32_t) PSIZE, (void **) &Nodofilep, &allocated_from_bmap);
if ((rc != 0) || (Nodofilep == NULL)) {
/* RedoPage record allocation failed */
fsck_send_msg(lrdo_ALLOC4NODOFLFAIL, PSIZE);
return (ENOMEM6);
}
if (allocated_from_bmap) {
fsck_send_msg(lrdo_USINGBMAPALLOC4NDFL);
}
Freenodofile = PSIZE / sizeof (struct nodofile);
/* init buffer pool */
for (k = 0; k < NBUFPOOL; k++) {
bufhdr[k].next = k + 1;
bufhdr[k].prev = k - 1;
}
bufhdr[0].prev = NBUFPOOL - 1;
bufhdr[NBUFPOOL - 1].next = 0;
/*
* initialize file systems
* For outlinelog,
* open all file system lvs which were in the log active list;
* validate superblock and allocation map of file systems;
* For inlinelog, only one file system to be processed at one time,
* so open just this file system. logmajor and logminor is the file
* system's major and minor numbers.
*/
if (Log.location & INLINELOG) {
if (openVol(0) != 0)
return (CANTOPEN_INLINELOG);
} else {
int success = 0;
for (k = 0; k < MAX_ACTIVE; k++) {
if (!uuid_is_null(logsup.active[k])) {
uuid_copy(vopen[k].uuid, logsup.active[k]);
if (openVol(k))
vopen[k].status = FM_LOGREDO;
else
success = 1;
}
}
if (!success)
return CANTOPEN_OUTLINELOG;
}
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: markBmap()
*
* FUNCTION: This routine updates the Aggregate Block Map
* for each block described by the given pxd unless
* it has already been done. That is, on a block-by-block
* basis, if the Aggregate Block Map has not been updated
* for the block in the current session, then it is
* updated now.
*
* Specifically, if the Block Map persistent map (pmap)
* bit representing the block has not already been
* updated by this routine, that bit is updated as
* requested by the caller
*
* NOTES: This routine uses the Block Map page working map (wmap)
* to keep track of which IAG pmap bits have already been
* updated by this routine.
*/
int markBmap(struct dmap *dmappg, /* the beginning of bmap file */
pxd_t pxd, /* descriptor for the blocks of interest */
int val, /* 1 to allocate, 0 to free */
int vol)
{
int rc = 0;
int64_t blkno, dmap_pg;
struct dmap_bitmaps *dp;
uint32_t rem, nblocks, word, dbitno, nblks, rbits, nwords;
uint16_t wbitno, nbits, n, j;
int32_t dmap_number;
if (Insuff_memory_for_maps)
return 0;
nblocks = lengthPXD(&pxd); /* number of blocks described */
blkno = addressPXD(&pxd); /* the first block number */
if ((blkno + nblocks) > vopen[vol].fssize) {
fsck_send_msg(lrdo_MBMPBLKOUTRANGE, (long long) blkno, nblocks);
fsError(DBTYPE, vol, blkno);
return (BLOCK_OUTOFRANGE);
}
/*
* nblocks may be large enough to span several struct dmap pages.
* Update the block state one struct dmap page at a time.
*/
for (rem = nblocks; rem > 0; rem -= nblks, blkno += nblks) {
dmap_pg = BLKTODMAPN(blkno);
dp = vopen[vol].bmap_wsp[dmap_pg].dmap_bitmaps;
if (dp == NULL) { /* first touch to this dmap */
dmap_number = blkno >> L2BPERDMAP;
rc = dMapGet(vol, dmap_number);
if (rc != 0) {
return (rc);
}
dp = vopen[vol].bmap_wsp[dmap_pg].dmap_bitmaps;
}
/* the bit position, within the current dmap page,
* representing the current aggregate block.
*/
dbitno = blkno & (BPERDMAP - 1);
/* the word, within the current dmap page, which contains
* the bit for the block.
*/
word = dbitno >> L2DBWORD;
/* number of blocks which are in the extent and are
* described by the current dmap.
*/
nblks = MIN(rem, BPERDMAP - dbitno);
/*
* Mark the dmap bitmap.
*/
for (rbits = nblks; rbits > 0; rbits -= nbits, dbitno += nbits) {
wbitno = dbitno & (DBWORD - 1);
nbits = MIN(rbits, DBWORD - wbitno);
/*
* only part of the word is implicated
*/
if (nbits < DBWORD) {
for (n = 0; n < nbits; n++, wbitno++) {
/*
* If bit already updated in this
* logredo session, nothing to do.
*/
if (dp->wmap[word] & (UZBIT_32 >> wbitno))
continue;
/* update pmap according to val.
* set wmap to indicate state is
* determined.
*/
dp->wmap[word] |= (UZBIT_32 >> wbitno);
if (val) /* request to turn on */
dp->pmap[word] |= (UZBIT_32 >> wbitno);
else /* request to turn off */
dp->pmap[word] &= ~(UZBIT_32 >> wbitno);
}
word += 1;
} else { /* nbits == DBWORD. One or more words
* are to have all their bits updated.
*/
nwords = rbits >> L2DBWORD;
nbits = nwords << L2DBWORD;
for (n = 0; n < nwords; n++, word++)
for (j = 0; j < DBWORD; j++) {
/*
* If bit already updated in
* this logredo session,
* nothing to do.
*/
if (dp->wmap[word] & (UZBIT_32 >> j))
continue;
/* note (in the wmap) that the
* bits have been updated in
* this session.
*/
dp->wmap[word] |= (UZBIT_32 >> j);
if (val)
/* turn on request */
dp->pmap[word] |= (UZBIT_32 >> j);
else /* turn off request */
dp->pmap[word] &= ~(UZBIT_32 >> j);
} /* end for j */
}
}
}
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: markImap()
*
* FUNCTION: This routine updates the inode allocation map
* for the specified inode unless it has already
* been done.
*
* Specifically, if the IAG persistent map (pmap)
* bit representing the inode has not already been
* updated by this routine,
*
* - that bit is updated as requested by the caller
*
* - If the bit is being set to '1', the descriptor
* for the extent containing the inode is refreshed.
*
* NOTES: This routine uses the IAG working map (wmap) to keep
* track of which IAG pmap bits have already been updated
* by this routine.
*/
int markImap(struct fsimap_lst *fsimap, /* data for the inode table */
uint32_t inum, /* inode number */
pxd_t inopxd, /* inode extent descriptor this inode */
int val, /* 1 to allocate, 0 to free */
int vol)
{
int rc;
struct iag_data *imp;
int32_t iag_num, ino, extno, bitno;
iag_num = INOTOIAG(inum);
if (iag_num > fsimap->imap_page_count)
return -1;
imp = fsimap->imap_wsp[(iag_num + 1)].imap_data;
if (imp == NULL) { /* first touch to this IAG */
rc = iagGet(vol, iag_num);
if (rc != 0) {
return (rc);
}
imp = fsimap->imap_wsp[(iag_num + 1)].imap_data;
}
/* end first touch to this IAG */
ino = inum & (INOSPERIAG - 1);
extno = ino >> L2INOSPEREXT;
bitno = ino & (INOSPEREXT - 1);
/* process it only if the state is not determined */
if (!(imp->wmap[extno] & (UZBIT_32 >> bitno))) {
/* update pmap according to val,
* set wmap to indicate state is determined.
*/
imp->wmap[extno] |= (UZBIT_32 >> bitno);
if (val) {
imp->pmap[extno] |= (UZBIT_32 >> bitno);
imp->inoext[extno] = inopxd; /* ???? */
} else {
imp->pmap[extno] &= ~(UZBIT_32 >> bitno);
}
}
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: saveExtDtPg()
*
* FUNCTION: Add an entry to the list of extended dtpages
* for the dtpage whose length and offset are given.
*
*/
int saveExtDtPg(int32_t pageVol, int64_t pageOff)
{
int rc = 0;
struct ExtDtPg *edpp;
int32_t allocated_from_bmap = 0;
/*
* if there are no available records,
* allocate some storage
*/
if (FreeExtDtPg == 0) {
rc = alloc_storage((uint32_t) PSIZE, (void **) &DtPgPage, &allocated_from_bmap);
if ((rc != 0) || (DtPgPage == NULL)) {
/*
* ExtDtPg record allocation failed
*/
fsck_send_msg(lrdo_ALLOC4EXTDTPGFAIL, PSIZE);
return (ENOMEM7);
}
/* ExtDtPg record allocation successful */
if (allocated_from_bmap) {
fsck_send_msg(lrdo_USINGBMAPALLOC4EDPG);
}
FreeExtDtPg = PSIZE / sizeof (struct ExtDtPg);
}
/*
* allocate a block, assign the given values to it,
* and add it to the list
*/
edpp = DtPgPage;
numExtDtPg++;
DtPgPage++;
FreeExtDtPg--;
edpp->pg_vol = pageVol;
edpp->pg_off = pageOff;
edpp->next = DtPgList;
DtPgList = edpp;
return (0);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*
* NAME: updatePage(ld)
*
* FUNCTION: This routine performs the following functions:
*
* 1) APPLY LOGREC DATA (in buffer afterdata[])
*
* This is copied into the disk page specified by redopage.pxd.
*
* We apply only the portion(s) of the disk page not already
* updated by a log record in the current logredo session.
* logredo sees the disk page as a series of segments, and
* handles the segments affected by the current logrec data
* individually.
*
* It is possible that, if the data in a particular log record
* contains several segments, the segments may overlay each
* other. In order to insure that the last (in time) image
* logged is the image applied by logredo, the segments in
* the log record are read in right-to-left order. (That is,
* in last-in-first-out or LIFO order.)
*
* The doblk fields summary1 and summary2 track updates to
* page segments. These are marked as the log record data
* is applied. This ensures that data logged earlier (which
* is processed later by logredo) for a particular segment
* will be ignored.
*
* 2) INITIALIZE/RESET DTREE FREELIST
*
* 3) UPDATE THE AGGREGATE BLOCK MAP
*
* We update the block map for extents described by the
* xadlist in an xtree or xtree_root page.
*
* We reset the XAD_NEW|XAD_EXTENDED flags in the xad in
* case they happen to be on. (The block map has been updated
* regardless of their state.)
*
* 4) IF log.redopage.type == LOG_INODE
*
* then all work necessary is finished with this log record
* because all the information needed is contained in the
* log record data area.
*
* Specifically:
* - update the inode base image. This is needed even for an
* inode which is being released in order to set nlink = 0.
* - update the Inode Allocation Map (imap) if the inode
* is being allocated or released.
* - update the Aggregate Block Map (bmap) if a new inode
* extent is allocated.
*
* NOTE: o The field lrd.length describes the redopage data area only.
* That is, it does not include the length of the lrd itself.
*
*
* o Since the slot size differs, log.redopage.l2linesize
* contains log2 of the slot size for the current log record.
*
*
* o As transactions are processed by the JFS IFS, they are
* logged from left to right (physically) in the log file,
* but that because we process them in LIFO (last-in-first-out)
* order, logredo reads and processes them from right to left
* (physically) This applies to both the transactions in the
* log and to the records in each transaction.
* N.B. The exception to this is that the log is circular
* and may wrap during a particular session.
*
* A log record consists of 3 parts:
* type independent area (16 bytes)
* type dependent area (20 bytes)
* data area (variable length)
* and, although they are processed in the order listed, they
* occur physically (in the log file) in the opposite order.
* That is, if you were to examine the storage in a log page,
* reading from left to right, a general log record would
* appear
* <data area><type dependent area><type independent area>
*
*
* o The FORMAT OF THE REDOPAGE DATA AREA depends on the
* redopage type:
*
* REDOPAGE:DIRECTORY data format
* a series of 1 or more <dtSegment>
*
* each <dtSegment> is <segmentData><segmentDescriptor>
*
* <segmentDescriptor> is <segmentOffset><segmentLength>
* *** These are expressed in number of slots.
* Stored as <int16_t><int16_t>
* *** A directory slot is 32 bytes in length
* *** slot[0] begins at beginning of the
* directory tree page specified by pxd.
* <segmentData> is the byte image of <segmentLength>
* slots, starting with <segmentOffset> slot
* in the directory node (or root) specified.
*
* N.B. The <dtSegment>s may overlay slots.
* ======
* FOR EXAMPLE: Suppose we need to insert an entry
* into the first half of a particular directory page
* which does not have enough available slots to
* accomodate it.
* - We split the existing directory page, moving 1/2
* the entries into a new page
* - We free the slots which the moved entries occupied
* before the split.
* - We insert the new entry, using the (newly) free
* slot(s).
* Thus some slots have been freed and then allocated
* again, all in a single transaction.
*
* When a transaction is logged, the segments are written
* as they occur, from left to right in the log.
* (So in the example, the 'free slot(s) segment' would
* be written, then the 'allocate slot(s) segment' would
* be written.)
*
* Since logredo processes the log from right to left
* (i.e. even the records with a transaction are processed
* from right to left), it processes the 'allocate
* slot(s) segment', noting the slots which have been
* updated. Then logredo encounters the 'free slot(s)
* segment' and ignores updates to slots which have
* already been updated.
*
* REDOPAGE:XTREE data format
* a series of 1 or more <xtSegment>
*
* each <xtSegment> is <segmentData><segmentDescriptor>
*
* <segmentDescriptor> is <segmentOffset><segmentLength>
* *** These are expressed in number of slots.
* Stored as <int16_t><int16_t>
* *** An index tree slot is 16 bytes in length
* *** slot[0] begins at beginning of the
* index tree page specified by pxd.
* <segmentData> is the byte image of <segmentLength>
* slots, starting with <segmentOffset> slot
* in the directory node (or root) specified.
*
* N.B. The data area of this type of log record contains,
* at most, two segments. The header segment is
* always included and logged as one segment (even if
* the slot(s) described by the second segment are
* contiguous to the header segment). There may
* also be a second segment containing the after-image
* of non-header slot(s).
*
* REDOPAGE:INODE data format
* a series of 1 or more <iSegment>
*
* each <iSegment> is <segmentData><segmentDescriptor>
*
* <segmentDescriptor> is <segmentOffset><segmentLength>
* *** These are expressed in number of slots.
* Stored as <int16_t><int16_t>
* *** The length of an inode slot in this
* record type is 128 bytes
* *** slot[0] begins at beginning of the
* (4096 byte) inode extent page
* specified by pxd.
* <segmentData> is the byte image of <segmentLength>
* slots, starting with <segmentOffset> slot
* in the inode extent page specified.
*
* N.B. In this type of log record, redopage.inode is the
* inode number of the inode which owns the IAG which
* describes the extent which contains the inode
* actually being changed. (For example, an update
* to inode x in fileset 0 would show lrd.inode==16
* because aggregate inode 16 is the Inode Allocation
* Table inode for fileset 0.)
*
* Also, lrd.pxd defines the (4096 byte) page of
* storage which contains the inode being changed.
*
* Since each inode extent contains 4 pages, this may
* or may not also be the first page of an inode extent.
*
* Since each page contains 8 inodes, some more work is
* needed to determine the inode number of the inode
* actually being changed.
*
* N.B. In this type of log record data, there may be several
* segments. Each segment is either the base image of
* one inode or the byte image of one inlineEA.
*
* If a particular segment describes an inode base image,
* then <segmentOffset> / 4 has no remainder
* else if the segment describes an inlineEA
* then <segmentOffset> / 4 has remainder 3
*
* REDOPAGE:BTROOT|XTREE data format
* a series of 1 or more <iSegment>
*
* each <iSegment> is <segmentData><segmentDescriptor>
*
* <segmentDescriptor> is <segmentOffset><segmentLength>
* INDEX TREE slots.
* Stored as <int16_t><int16_t>
* *** The length of an index tree slot
* 16 bytes
* *** slot[0] begins at di_btroot (32 bytes
* before Section III of the dinode)
* <segmentData> is the byte image of <segmentLength>
* slots, starting with <segmentOffset> slot
* in the inode extent page specified.
*
* N.B. In this type of log record, redopage.inode is the
* inode number of the inode actually being changed.
*
* Also, lrd.pxd defines the (4096 byte) page of
* storage which contains the inode being changed.
*
* Since each inode extent contains 4 pages, this may
* or may not also be the first page of an inode extent.
*
* Since each page contains 8 inodes, some more work is
* needed to determine the starting offset (within the
* page specified by pxd) of the inode actually being
* changed.
*
* REDOPAGE:BTROOT|DTREE data format
* a series of 1 or more <iSegment>
*
* each <iSegment> is <segmentData><segmentDescriptor>
*
* <segmentDescriptor> is <segmentOffset><segmentLength>
* *** These are expressed in number of
* DIRECTORY TREE slots.
* Stored as <int16_t><int16_t>
* *** The length of a directory tree slot
* is 32 bytes
* *** slot[0] begins at di_btroot (32 bytes
* before Section III of the dinode)
* <segmentData> is the byte image of <segmentLength>
* slots, starting with <segmentOffset> slot
* in the inode extent page specified.
*
* N.B. In this type of log record, redopage.inode is the
* inode number of the inode actually being changed.
*
* Also, lrd.pxd defines the (4096 byte) page of
* storage which contains the inode being changed.
*
* Since each inode extent contains 4 pages, this may
* or may not also be the first page of an inode extent.
*
* Since each page contains 8 inodes, some more work is
* needed to determine the starting offset (within the
* page specified by pxd) of the inode actually being
* changed.
*
* REDOPAGE:DATA (i.e. inline data) data format
* a series of 1 or more <iSegment>
*
* each <iSegment> is <segmentData><segmentDescriptor>
*
* N.B. This type is used for inline data, currently only
* defined for symbolic links (symlinks) which
* are ** NOT IMPLEMENTED IN RELEASE I OF JFS/WARP **
*
*
* o Since
* - logredo only updates the first segment of an inode
* by applying a REDOPAGE:INODE log record
* - a REDOPAGE_INODE log record pxd describes a page
* in an inode extent (that is, 4096 bytes containing
* 8 inodes)
* - a REDOPAGE_INODE log record contains the inode number
* of the Inode Alloc Table, not the affected inode
* (indeed there may be more than 1 affected inode in
* the data for the record)
* - segmentData contains only the after-image of the
* inode(s) being changed
* logredo cannot determine which, if any, inode(s) in the
* page have just been allocated (nlink was 0, now is not)
* and/or have just been released (nlink was not 0, now is).
*
* Therefore, for the purposes of updating the Inode Allocation
* Map, logredo assumes that all inodes in the page which
* are allocated, are newly allocated, and all inodes in the
* page which are not allocated have just been released.
*
*/
int updatePage(struct lrd *ld, int32_t logaddr)
{
int rc;
int32_t vol;
int *buf;
struct doblk *db;
uint8_t mask_8 = 0, xtroot_lwm = 0;
uint16_t mask_9, dtroot_9 = 0;
uint32_t mask_32, dtpg_32, datapg_32;
int16_t l2linesize; /* log2 of the slot size */
int32_t i, j, k, seglen, linesize, segnum, inonum = 0;
int32_t iag_num, ino, extno;
int16_t off, ln, inoext_alloc, allocate, delta_len, s_index, ino_rem;
int16_t *segdata, wbitno, nbits, nslots, size_dinode;
caddr_t data, buf_ptr, buf_btroot = 0;
xad_t *xad_p;
pxd_t pxd1;
struct iag_data *imp;
struct dinode *dip = 0;
int32_t xlen, xlength;
int16_t nword;
int8_t upd_possible = 0;
struct dinode dip_local; /* Local copy of dinode data for alignment purposes */
if (ld->length <= 0)
return (0);
vol = ld->aggregate;
/*
* segdata points to the end of afterdata
*/
size_dinode = sizeof (struct dinode);
segdata = (int16_t *) ((caddr_t) afterdata + ld->length);
l2linesize = ld->log.redopage.l2linesize;
linesize = 1 << l2linesize;
j = 0;
seglen = 0;
segnum = 0;
/*
* find doblk for the specified pxd
*/
if ((rc = findPageRedo(ld->aggregate, ld->log.redopage.pxd, &db))
!= 0) {
fsck_send_msg(lrdo_UPPGFNDPGREDOFAIL, rc);
return (rc);
}
/*
* check to see if there is anything to do for this page
*/
if (ld->log.redopage.type == LOG_INODE) {
if (db->type && !(db->type & LOG_INODE)) {
db->type = LOG_NONE; /* mark page noredo */
return 0;
}
db->type |= LOG_INODE;
if (db->db_ibase == 0xFF && db->db_idata == 0xFF &&
db->db_iea == 0xFF && db->db_ilink == 0xFF)
/* for each inode in the page, base image, inline
* data and the EA have already been refreshed in
* this logredo session
*/
return (0);
} else if ((ld->log.redopage.type & (LOG_BTROOT | LOG_DTREE))
== (LOG_BTROOT | LOG_DTREE)) {
/*
*
* Dtree Root Node
*
*/
if (db->type && !(db->type & LOG_INODE)) {
db->type = LOG_NONE; /* mark page noredo */
return 0;
}
db->type |= LOG_INODE;
/*
* log.redopage.inode is the inode number of the inode
* whose tree will be refreshed.
* inonum is the position of that inode in the inode
* extent (4096 byte) page described by the pxd.
* (Each page has 8 inodes.)
*/
inonum = ld->log.redopage.inode & 0x07;
mask_8 = UZBIT_8 >> inonum;
/*
* Has this inode already been updated as a symbollic link?
*/
if (db->db_ilink & mask_8)
return 0;
/*
* This inode is identified as a dtroot. So, first
* mark the appropriate bit to insure
* NO updates to this inode's root as a normal xtree.
*/
db->db_idtree |= mask_8;
dtroot_9 = db->db_dtroot[inonum];
if (dtroot_9 == 0x01ff) /* all slots in the dtree root have
* already been refreshed in this
* logredo session
*/
return (0);
} else if ((ld->log.redopage.type & (LOG_BTROOT | LOG_XTREE))
== (LOG_BTROOT | LOG_XTREE)) {
/*
*
* Xtree Root Node
*
*/
if (db->type && !(db->type & LOG_INODE)) {
db->type = LOG_NONE; /* mark page noredo */
return 0;
}
db->type |= LOG_INODE;
/*
* log.redopage.inode is the inode number of the inode
* whose tree will be refreshed.
* inonum is the position of that inode in the inode
* extent (4096 byte) page described by the pxd.
* (Each page has 8 inodes.)
*/
inonum = ld->log.redopage.inode & 0x07;
mask_8 = UZBIT_8 >> inonum;
/*
* If this inode was previously marked as a symlink, we
* can't update it as an xtree
*/
if (db->db_ilink & mask_8)
return 0;
/*
* This inode is identified as an xtroot. So, first
* mark the appropriate slot in the noredopage for
* NO updates to this inode's root as a dtree.
*/
if (ld->log.redopage.type & LOG_DIR_XTREE) {
/* This must be a directory */
db->db_idtree |= mask_8;
/* directory x-tree shares space with db_idata */
if (db->db_idata & mask_8)
return 0;
else
db->db_idata |= mask_8;
} else {
db->db_dtroot[inonum] = 0x01ff;
/*
* If this inode was previously marked as a dtree, we
* can't update it as an xtree
*/
if (db->db_idtree & mask_8)
return 0;
}
xtroot_lwm = db->db_xtrt_lwm[inonum];
if ((xtroot_lwm == XTENTRYSTART) && db->db_xtrt_hd & mask_8)
/* The header slot and at least the 1st slot after
* the header have already been refreshed in this
* logredo session.
*/
return (0);
else if (xtroot_lwm == 0)
/* First time */
xtroot_lwm = db->db_xtrt_lwm[inonum] = 0xFF;
} else if ((ld->log.redopage.type & LOG_DTREE) == LOG_DTREE) {
/*
*
* Dtree Non-Root Node
*
*/
if (db->type && !(db->type & LOG_DTREE)) {
db->type = LOG_NONE; /* mark page noredo */
return 0;
}
db->type |= LOG_DTREE;
/*
* This extent may not be a full page (4096 bytes in length)
*
* Figure out its size, the number of slots it
* covers, the number words used to track those slots,
* and the number of bits in the last of those words.
*/
xlen = lengthPXD((&ld->log.redopage.pxd));
xlength = xlen << vopen[vol].l2bsize;
nslots = xlength >> L2DTSLOTSIZE;
nword = nslots >> L2DBWORD;
nbits = nslots & (DBWORD - 1);
upd_possible = 0;
for (i = 0; i < nword; i++) {
if (db->db_dtpagewd[i] != ONES) {
upd_possible = -1;
}
}
if (nbits) {
i = DBWORD - nbits;
mask_32 = ((uint32_t) (ONES >> i)) << i;
if (db->db_dtpagewd[nword] != mask_32) {
upd_possible = -1;
}
}
if (!upd_possible) {
/* all slots in the dtree node have
* already been refreshed in this logredo session.
*/
return (0);
}
} else if ((ld->log.redopage.type & LOG_XTREE) == LOG_XTREE) {
/*
* Xtree Non-Root Node
*/
if (db->type && !(db->type & LOG_XTREE)) {
db->type = LOG_NONE; /* mark page noredo */
return 0;
}
db->type |= LOG_XTREE;
if ((db->db_xtpagelwm == XTENTRYSTART) && db->db_xtpghd)
/* the header slot and at least the first slot after
* the header have been refreshed in this logredo
* session.
*/
return (0);
else if (db->db_xtpagelwm == 0)
db->db_xtpagelwm = 0xFF; /* First time */
} else if ((ld->log.redopage.type & LOG_DATA) == LOG_DATA) {
/*
* Data Page
*/
if (db->type && !(db->type & LOG_DATA)) {
db->type = LOG_NONE; /* mark page noredo */
return 0;
}
db->type |= LOG_DATA;
/*
* This extent may not be a full page (4096 bytes in length)
*
* Figure out its size, the number of slots it
* covers, the number words used to track those slots,
* and the number of bits in the last of those words.
*/
xlen = lengthPXD((&ld->log.redopage.pxd));
xlength = xlen << vopen[vol].l2bsize;
nslots = xlength >> L2DATASLOTSIZE;
nword = nslots >> L2DBWORD;
upd_possible = 0;
for (i = 0; i < nword; i++) {
if (db->db_dtpagewd[i] != ONES) {
upd_possible = -1;
}
}
if (!upd_possible) {
/* all slots in the dtree node have
* already been refreshed in this logredo session.
*/
return (0);
}
}
/*
*
* There is actually some work to do
*
*/
buf = NULL;
inoext_alloc = 0; /* init ino extent allocation state */
while (j < ld->length) { /* while data segments unprocessed */
ln = __le16_to_cpu(*--segdata); /* get length */
off = __le16_to_cpu(*--segdata); /* get offset */
segnum++;
seglen = ln << ld->log.redopage.l2linesize;
/* Sanity check */
if ((off < 0) || (ln <= 0) ||
((off + ln) << ld->log.redopage.l2linesize > PSIZE))
return UPDATEPAGE_BAD_RANGE;
/*
* segdata points to the beginning of the segment
*/
segdata = (int16_t *) ((caddr_t) segdata - seglen);
data = (caddr_t) segdata;
j += seglen + 4;
/*
*
* INODE
*
*/
if ((ld->log.redopage.type & LOG_INODE) == LOG_INODE) {
/* check to see if the current inode base image has
* been updated by an earlier log rec
* Note: we don't need to check if the current inode
* base image is on noredofile hash chain since the
* doblk does the same job for us. An inode is on the
* noredofile hash chain only if it is processed by
* an earlier log rec
*/
inonum = off >> 2; /* inode seq. no in the inode
* page zero origin
*/
mask_8 = UZBIT_8 >> inonum;
ino_rem = off & 3;
/* don't update dip if the segment is for inlineEA.
* When an update involves EA, the base inode image
* is always out too, so dip can always catch some
* base inode image data
*/
if (ino_rem == 0) { /* inode base segment */
memcpy(&dip_local, data, size_dinode);
dip = &dip_local;
if (ln == 1) {
/* ibase only */
if (db->db_ibase & mask_8)
/* already updated */
continue;
db->db_ibase |= mask_8;
} else {
/* ibase & idata */
if ((db->db_ibase & mask_8) &&
(db->db_idata & mask_8))
/* already updated */
continue;
if (db->db_ibase & mask_8) {
/* Only update idata */
db->db_idata |= mask_8;
ino_rem = 1;
off += 1;
data += linesize;
seglen -= linesize;
/*
* i_data overlaps btroot.
* Strip off 32 bytes
*/
seglen -= 32;
} else if (db->db_idata & mask_8) {
/* Only update ibase */
db->db_ibase |= mask_8;
seglen -= linesize;
} else {
/* update both */
db->db_ibase |= mask_8;
db->db_idata |= mask_8;
/*
* i_data overlaps btroot.
* Strip off 32 bytes
*/
seglen -= 32;
}
}
/*
* We mess around with seglen. Make sure
* it doesn't go negative.
*/
if (seglen < 0)
return UPDATEPAGE_BAD_RANGE;
} else if (ino_rem == 1) { /* inline data */
if (db->db_idata & mask_8)
continue;
db->db_idata |= mask_8;
} else if (ino_rem == 2) { /* inline symlink */
if (db->db_ilink & mask_8)
continue;
if (db->db_idtree & mask_8)
continue;
if (db->db_xtrt_lwm[inonum] ||
db->db_xtrt_hd & mask_8)
continue;
db->db_ilink |= mask_8;
} else if (ino_rem == 3) { /* inlineEA */
if (db->db_iea & mask_8)
/* already updated */
continue;
db->db_iea |= mask_8;
} else {
fsck_send_msg(lrdo_UPPGBADINODESEGOFFSET, off);
}
/*
* read the inode extent page into a buffer
*/
if (buf == NULL) {
rc = bread(vol, ld->log.redopage.pxd, (void **) &buf, PB_UPDATE);
if (rc) {
fsck_send_msg(lrdo_UPPGBREADFAIL1, rc);
return (INOEXT_READERROR1);
}
}
/*
* refresh the appropriate slot in the inode extent
* page in the buffer with the data in the current
* segment.
*/
buf_ptr = (caddr_t) buf + (off << l2linesize);
memcpy(buf_ptr, data, seglen);
if (!ino_rem) { /* inode base image */
/* inoext_alloc will be nonzero if at least
* one inode in the page is allocated. In
* this case, we will mark block map to show
* the whole inode extent (all 4 pages) as
* allocated */
allocate = (dip->di_nlink != 0);
inoext_alloc |= allocate;
/*
* There is only one fileset per aggregate, so
* the inode extent is always owned by inode
* FILESYSTEM_I
*/
if (ld->log.redopage.inode == FILESYSTEM_I) {
rc = markImap(&vopen[vol].fsimap_lst,
__le32_to_cpu(dip->di_number),
dip->di_ixpxd, allocate, vol);
if (rc) {
fsck_send_msg(lrdo_UPPGMIMPFAIL, rc);
return (rc);
}
}
/* if zero link count, start NoRedoFile filter
* Note: for the first release, we ensure that
* the nlink for the aggregate inode
* FILESYSTEM_I will be non-zero. If more
* filesets are processed in the later release,
* then nlink could be zero for the aggregate
* inodes.
*/
if (!allocate)
doNoRedoFile(ld, __le32_to_cpu(dip->di_number));
}
} else if ((ld->log.redopage.type & (LOG_BTROOT | LOG_XTREE))
== (LOG_BTROOT | LOG_XTREE)) {
/*
*
* Xtree Root Node
*
*/
if ((off != 0 && xtroot_lwm <= (uint8_t) off) ||
(off == 0 && db->db_xtrt_hd & mask_8))
continue;
/*
* read in the inode extent page
*/
if (buf == NULL) {
rc = bread(vol, ld->log.redopage.pxd, (void **) &buf, PB_UPDATE);
if (rc) {
fsck_send_msg(lrdo_UPPGBREADFAIL2, rc);
return (INOEXT_READERROR2);
}
}
if (ld->log.redopage.type & LOG_DIR_XTREE) {
buf_btroot =
(caddr_t) buf + size_dinode * inonum + (8 << l2linesize);
} else {
/*
* for BTROOT (either xtree or dtree), off
* starts from di_btroot, not from the
* beginning of inode, not from beginning of
* page. Slot number is zero origin. di_btroot
* starts from slot #14 for xtroot
*
* First let buf_ptr points to the beginning
* of off
*/
buf_btroot =
(caddr_t) buf + size_dinode * inonum + (14 << l2linesize);
/* if xtroot has taken the inode section IV,
* indicate in db_iea so that later inlineEA
* data won't apply to it
*/
if ((off + ln) > 10) {
mask_8 = UZBIT_8 >> inonum;
db->db_iea |= mask_8;
}
}
if (off == 0) {
/* header segment and the first time
*/
memcpy((caddr_t) buf_btroot, data, ln << l2linesize);
db->db_xtrt_hd |= mask_8;
} else {
if (xtroot_lwm == 0xFF) /* the first time */
delta_len = ln;
else
delta_len = xtroot_lwm - off;
xad_p = (xad_t *) data;
for (i = 0; i < delta_len; i++) {
MARKXADNEW(pxd1, xad_p, vopen[vol].bmap_ctl, vol);
xad_p += 1;
}
buf_ptr = buf_btroot + (off << l2linesize);
memcpy((caddr_t) buf_ptr, data, delta_len << l2linesize);
db->db_xtrt_lwm[inonum] = xtroot_lwm = off;
}
} else if ((ld->log.redopage.type & LOG_XTREE) == LOG_XTREE) {
/*
*
* Xtree Non-Root Node
*
*/
/*
* log rec for xtree has two segments.
* the first is the header. The second
* segment for xtpage slots update.
*
* The log rec data area contains a list of
* xad's. Each XAD may has a flag of XAD_NEW
* or XAD_EXTENDED. If it shows up, then
* logredo needs to reset the flag and mark
* on bmap, then update the on-disk xtree image.
*/
/* if the lwm less than offset or it is a header
* segment but header had been updated previously,
* ignore this segment.
* Note: every log rec has the header data. But xtpage
* header should be only updated once at logredo.
*/
if ((off != 0 && db->db_xtpagelwm <= (uint8_t) off)
|| (off == 0 && db->db_xtpghd))
continue;
/* read the on-disk page into buffer pool.
*/
if (buf == NULL) {
rc = bread(vol, ld->log.redopage.pxd, (void **) &buf, PB_UPDATE);
if (rc) {
fsck_send_msg(lrdo_UPPGBREADFAIL3, rc);
return (XTPAGE_READERROR1);
}
}
if (off == 0) {
/* it is header segment and the first time
*/
memcpy((caddr_t) buf, data, ln << l2linesize);
db->db_xtpghd = 1;
} else {
if (db->db_xtpagelwm == 0xff)
/* the first time */
delta_len = ln;
else
delta_len = db->db_xtpagelwm - off;
xad_p = (xad_t *) data;
for (i = 0; i < delta_len; i++) {
MARKXADNEW(pxd1, xad_p, vopen[vol].bmap_ctl, vol);
xad_p += 1;
}
buf_ptr = (caddr_t) buf + (off << l2linesize);
memcpy((caddr_t) buf_ptr, data, delta_len << l2linesize);
db->db_xtpagelwm = (uint8_t) off;
}
} else {
/*
*
* Data or Dtree Node -- Root and Non-Root
*
*/
/* read the on-disk page into buffer pool. */
if (buf == NULL) {
rc = bread(vol, ld->log.redopage.pxd, (void **) &buf, PB_UPDATE);
if (rc) {
fsck_send_msg(lrdo_UPPGBREADFAIL4, rc);
return (DTREE_READERROR1);
}
}
if ((ld->log.redopage.type & (LOG_BTROOT | LOG_DTREE))
== (LOG_BTROOT | LOG_DTREE)) {
/*
* If more than one slot in a segment, we apply
* slots one at a time.
* for BTROOT (either xtree or dtree), off
* starts from di_btroot, not from the
* beginning of inode, not from beginning of
* page. Slot number is zero origin.
* di_btroot starts from slot #8 for dtroot.
*
* First let buf_ptr points to the beginning
* of off
*/
buf_btroot = (caddr_t) buf + size_dinode * inonum + (7 << l2linesize);
buf_ptr = buf_btroot + (off << l2linesize);
for (i = 0; i < ln; i++) {
mask_9 = UZBIT_16 >> (7 + (off & 0x000f));
if (!(mask_9 & dtroot_9)) {
memcpy((caddr_t) buf_ptr, data, linesize);
dtroot_9 |= mask_9;
}
buf_ptr += linesize;
data += linesize;
/* off incremented for next slot if
* ln > 1. In the dtroot case, ln will
* never > 9
*/
off++;
}
db->db_dtroot[inonum] = dtroot_9;
} else if ((ld->log.redopage.type & LOG_DTREE) == LOG_DTREE) {
/* update bits of words in dtpage_word[].
* starting from "off" and cover a range of
* "ln". Each word tracks 32 slots. The first
* and last words may only have a subset of
* their bits updated.
*/
/* start word in dtpage_word[]. */
s_index = off >> L2DTPGWORD;
dtpg_32 = db->db_dtpagewd[s_index];
for (nslots = ln; nslots > 0; nslots -= nbits, off += nbits) {
/* determine the start bit number
* within the word and the number of
* bits to be updated within the word
*/
wbitno = off & (DTPGWORD - 1);
nbits = MIN(nslots, DTPGWORD - wbitno);
for (i = 0, k = wbitno; i < nbits; i++, k++) {
mask_32 = UZBIT_32 >> k;
if (!(mask_32 & dtpg_32)) {
buf_ptr =
(caddr_t) buf +
(off << l2linesize) + (i << l2linesize);
memcpy((caddr_t)
buf_ptr, data, linesize);
dtpg_32 |= mask_32;
}
data += linesize;
}
db->db_dtpagewd[s_index] = dtpg_32;
dtpg_32 = db->db_dtpagewd[++s_index];
}
db->db_dtpagewd[s_index] = dtpg_32;
} else if ((ld->log.redopage.type & LOG_DATA) == LOG_DATA) {
/* update bits of words in data_word[].
* starting from "off" and cover a range of
* "ln". Each word tracks 32 slots. The first
* and last words may only have a subset of
* their bits updated.
*/
/* start word in data_word[]. */
s_index = off >> L2DATAPGWORD;
datapg_32 = db->db_datawd[s_index];
for (nslots = ln; nslots > 0; nslots -= nbits, off += nbits) {
/* determine the start bit number
* within the word and the number of
* bits to be updated within the word
*/
wbitno = off & (DATAPGWORD - 1);
nbits = MIN(nslots, DATAPGWORD - wbitno);
for (i = 0, k = wbitno; i < nbits; i++, k++) {
mask_32 = UZBIT_32 >> k;
if (!(mask_32 & datapg_32)) {
buf_ptr =
(caddr_t) buf +
(off << l2linesize) + (i << l2linesize);
memcpy((caddr_t)
buf_ptr, data, linesize);
datapg_32 |= mask_32;
}
data += linesize;
}
db->db_datawd[s_index] = datapg_32;
datapg_32 = db->db_datawd[++s_index];
}
db->db_datawd[s_index] = datapg_32;
}
}
} /* end of while ( j < ld->length ) */
/* for LOG_INODE, we need to process bmap because we need
* to be absolutely certain that the inode extent is allocated.
*
* This log record may have several segments, each for a
* different inode (base image), however, these inodes MUST
* all reside in the same inode extent page to be included
* in the same log record. Therefore, they MUST belong to the
* same inode extent (4 pages, each 4096 bytes). Therefore,
* it doesn't matter which segment we use to determine the
* particulars about the extent.
*
*/
if (ld->log.redopage.type & LOG_INODE) {
/*
* If at least 1 inode in the current log record is
* marked as allocated, then we must be sure that
* the inode extent containing it (them) is allocated
* and properly hooked into the IAG.
*
* Since logredo processes log records LIFO and
* processes the base image of any inode only once,
* we are assured that the inode status is final
* (for this logredo session).
*/
if (inoext_alloc) {
/*
* If it IS a fileset-owned inode extent
* (and not an aggregate-owned inode extent)
*/
if (ld->log.redopage.inode == FILESYSTEM_I) {
/*
* figure out which IAG and which extent
*/
iag_num = INOTOIAG(__le32_to_cpu(dip->di_number));
imp = vopen[vol].fsimap_lst.imap_wsp[(iag_num + 1)
].imap_data;
if (imp == NULL) {
/* first touch to this IAG */
rc = iagGet(vol, iag_num);
if (rc != 0) {
return (rc);
}
imp = vopen[vol].fsimap_lst.imap_wsp[(iag_num + 1)
].imap_data;
}
/* end first touch to this IAG */
ino = __le32_to_cpu(dip->di_number) & (INOSPERIAG - 1);
extno = ino >> L2INOSPEREXT;
/*
* make sure the IAG points to it correctly
*/
imp->inoext[extno] = dip->di_ixpxd;
}
/* end fileset owned */
/*
* make sure the block map shows it allocated
*/
rc = markBmap((struct dmap *) vopen[vol].bmap_ctl, dip->di_ixpxd, 1, vol);
if (rc) {
fsck_send_msg(lrdo_UPPGMBMPFAIL, rc);
return (rc);
}
}
}
/*
* init freelist for a new dtroot
*/
if (ld->log.redopage.type == (LOG_DTREE | LOG_BTROOT | LOG_NEW)) {
rc = dtrt_resetFreeList(vol, db, ld, buf_btroot);
if (rc) {
fsck_send_msg(lrdo_UPPGDTRTRFLFAIL, rc);
return (rc);
}
}
/*
* init freelist for a new dtpage
*/
if (ld->log.redopage.type == (LOG_DTREE | LOG_NEW)) {
rc = dtpg_resetFreeList(vol, buf);
if (rc) {
fsck_send_msg(lrdo_UPPGDTPGRFLFAIL, rc);
return (rc);
}
}
/*
* make a note to rebuild freelist for an extended dtpage
*/
if (ld->log.redopage.type == (LOG_DTREE | LOG_EXTEND)) {
rc = saveExtDtPg(vol, addressPXD(&(ld->log.redopage.pxd)));
if (rc) {
fsck_send_msg(lrdo_UPPGSEDPFAIL, rc);
return (rc);
}
}
return (0);
}
|