Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917 5918 5919 5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981 5982 5983 5984 5985 5986 5987 5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054 6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165 6166 6167 6168 6169 6170 6171 6172 6173 6174 6175 6176 6177 6178 6179 6180 6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202 6203 6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 6245 6246 6247 6248 6249 6250 6251 6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 6262 6263 6264 6265 6266 6267 6268 6269 6270 6271 6272 6273 6274 6275 6276 6277 6278 6279 6280 6281 6282 6283 6284 6285 6286 6287 6288 6289 6290 6291 6292 6293 6294 6295 6296 6297 6298 6299 6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 6328 6329 6330 6331 6332 6333 6334 6335 6336 6337 6338 6339 6340 6341 6342 6343 6344 6345 6346 6347 6348 6349 6350 6351 6352 6353 6354 6355 6356 6357 6358 6359 6360 6361 6362 6363 6364 6365 6366 6367 6368 6369 6370 6371 6372 6373 6374 6375 6376 6377 6378 6379 6380 6381 6382 6383 6384 6385 6386 6387 6388 6389 6390 6391 6392 6393 6394 6395 6396 6397 6398 6399 6400 6401 6402 6403 6404 6405 6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437 6438 6439 6440 6441 6442 6443 6444 6445 6446 6447 6448 6449 6450 6451 6452 6453 6454 6455 6456 6457 6458 6459 6460 6461 6462 6463 6464 6465 6466 6467 6468 6469 6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492 6493 6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505 6506 6507 6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535 6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564 6565 6566 6567 6568 6569 6570 6571 6572 6573 6574 6575 6576 6577 6578 6579 6580 6581 6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616 6617 6618 6619 6620 6621 6622 6623 6624 6625 6626 6627 6628 6629 6630 6631 6632 6633 6634 6635 6636 6637 6638 6639 6640 6641 6642 6643 6644 6645 6646 6647 6648 6649 6650 6651 6652 6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674 6675 6676 6677 6678 6679 6680 6681 6682 6683 6684 6685 6686 6687 6688 6689 6690 6691 6692 6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714 6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728 6729 6730 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 6751 6752 6753 6754 6755 6756 6757 6758 6759 6760 6761 6762 6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776 6777 6778 6779 6780 6781 6782 6783 6784 6785 6786 6787 6788 6789 6790 6791 6792 6793 6794 6795 6796 6797 6798 6799 6800 6801 6802 6803 6804 6805 6806 6807 6808 6809 6810 6811 6812 6813 6814 6815 6816 6817 6818 6819 6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 6850 6851 6852 6853 6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 6867 6868 6869 6870 6871 6872 6873 6874 6875 6876 6877 6878 6879 6880 6881 6882 6883 6884 6885 6886 6887 6888 6889 6890 6891 6892 6893 6894 6895 6896 6897 6898 6899 6900 6901 6902 6903 6904 6905 6906 6907 6908 6909 6910 6911 6912 6913 6914 6915 6916 6917 6918 6919 6920 6921 6922 6923 | /* * Copyright (c) 2000-2020 Apple Inc. All rights reserved. * * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. The rights granted to you under the License * may not be used to create, or enable the creation or redistribution of, * unlawful or unlicensed copies of an Apple operating system, or to * circumvent, violate, or enable the circumvention or violation of, any * terms of an Apple operating system software license agreement. * * Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ */ /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */ /* * Copyright (c) 1982, 1986, 1989, 1991, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)kern_proc.c 8.4 (Berkeley) 1/4/94 */ /* * NOTICE: This file was modified by SPARTA, Inc. in 2005 to introduce * support for mandatory and extensible security protections. This notice * is included in support of clause 2.2 (b) of the Apple Public License, * Version 2.0. */ /* HISTORY * 04-Aug-97 Umesh Vaishampayan (umeshv@apple.com) * Added current_proc_EXTERNAL() function for the use of kernel * lodable modules. * * 05-Jun-95 Mac Gillon (mgillon) at NeXT * New version based on 3.3NS and 4.4 */ #include <sys/param.h> #include <sys/systm.h> #include <sys/kernel.h> #include <sys/proc_internal.h> #include <sys/acct.h> #include <sys/wait.h> #include <sys/file_internal.h> #include <sys/uio.h> #include <sys/malloc.h> #include <sys/lock.h> #include <sys/mbuf.h> #include <sys/ioctl.h> #include <sys/tty.h> #include <sys/signalvar.h> #include <sys/syslog.h> #include <sys/sysctl.h> #include <sys/sysproto.h> #include <sys/kauth.h> #include <sys/codesign.h> #include <sys/kernel_types.h> #include <sys/ubc.h> #include <kern/assert.h> #include <kern/clock.h> #include <kern/debug.h> #include <kern/kalloc.h> #include <kern/smr_hash.h> #include <kern/task.h> #include <kern/coalition.h> #include <kern/cs_blobs.h> #include <sys/coalition.h> #include <kern/assert.h> #include <kern/sched_prim.h> #include <vm/vm_protos.h> #include <vm/vm_map_xnu.h> /* vm_map_switch_protect() */ #include <vm/vm_pageout.h> #include <vm/vm_compressor_xnu.h> #include <mach/task.h> #include <mach/message.h> #include <sys/priv.h> #include <sys/proc_info.h> #include <sys/bsdtask_info.h> #include <sys/persona.h> #include <sys/sysent.h> #include <sys/reason.h> #include <sys/proc_require.h> #include <sys/kern_debug.h> #include <sys/kern_memorystatus_xnu.h> #include <sys/kdebug_triage.h> #include <IOKit/IOBSD.h> /* IOTaskHasEntitlement() */ #include <kern/kern_memorystatus_internal.h> #include <kern/ipc_kobject.h> /* ipc_kobject_set_kobjidx() */ #include <kern/ast.h> /* proc_filedesc_ast */ #include <libkern/amfi/amfi.h> #include <mach-o/loader.h> #include <os/base.h> /* OS_STRINGIFY */ #include <os/overflow.h> #if CONFIG_CSR #include <sys/csr.h> #endif #if CONFIG_MACF #include <security/mac_framework.h> #include <security/mac_mach_internal.h> #endif #include <security/audit/audit.h> #include <libkern/crypto/sha1.h> #include <IOKit/IOKitKeys.h> #include <mach/mach_traps.h> #include <mach/task_access.h> #include <kern/extmod_statistics.h> #include <security/mac.h> #include <sys/socketvar.h> #include <sys/kern_memorystatus_freeze.h> #include <net/necp.h> #include <bsm/audit_kevents.h> #ifdef XNU_KERNEL_PRIVATE #include <corpses/task_corpse.h> #endif /* XNU_KERNEL_PRIVATE */ #if SKYWALK #include <skywalk/core/skywalk_var.h> #endif /* SKYWALK */ /* * Structure associated with user cacheing. */ struct uidinfo { LIST_ENTRY(uidinfo) ui_hash; uid_t ui_uid; size_t ui_proccnt; }; #define UIHASH(uid) (&uihashtbl[(uid) & uihash]) static LIST_HEAD(uihashhead, uidinfo) * uihashtbl; static u_long uihash; /* size of hash table - 1 */ /* * Other process lists */ static struct smr_hash pid_hash; static struct smr_hash pgrp_hash; SECURITY_READ_ONLY_LATE(struct sesshashhead *) sesshashtbl; SECURITY_READ_ONLY_LATE(u_long) sesshash; struct proclist allproc = LIST_HEAD_INITIALIZER(allproc); struct proclist zombproc = LIST_HEAD_INITIALIZER(zombproc); extern struct tty cons; extern size_t proc_struct_size; extern size_t proc_and_task_size; extern int cs_debug; #if DEVELOPMENT || DEBUG static TUNABLE(bool, syscallfilter_disable, "-disable_syscallfilter", false); #endif // DEVELOPMENT || DEBUG #if DEBUG #define __PROC_INTERNAL_DEBUG 1 #endif #if CONFIG_COREDUMP || CONFIG_UCOREDUMP /* Name to give to core files */ #if defined(XNU_TARGET_OS_BRIDGE) __XNU_PRIVATE_EXTERN const char * defaultcorefiledir = "/private/var/internal"; __XNU_PRIVATE_EXTERN char corefilename[MAXPATHLEN + 1] = {"/private/var/internal/%N.core"}; __XNU_PRIVATE_EXTERN const char * defaultdrivercorefiledir = "/private/var/internal"; __XNU_PRIVATE_EXTERN char drivercorefilename[MAXPATHLEN + 1] = {"/private/var/internal/%N.core"}; #elif defined(XNU_TARGET_OS_OSX) __XNU_PRIVATE_EXTERN const char * defaultcorefiledir = "/cores"; __XNU_PRIVATE_EXTERN char corefilename[MAXPATHLEN + 1] = {"/cores/core.%P"}; __XNU_PRIVATE_EXTERN const char * defaultdrivercorefiledir = "/private/var/dextcores"; __XNU_PRIVATE_EXTERN char drivercorefilename[MAXPATHLEN + 1] = {"/private/var/dextcores/%N.core"}; #else __XNU_PRIVATE_EXTERN const char * defaultcorefiledir = "/private/var/cores"; __XNU_PRIVATE_EXTERN char corefilename[MAXPATHLEN + 1] = {"/private/var/cores/%N.core"}; __XNU_PRIVATE_EXTERN const char * defaultdrivercorefiledir = "/private/var/dextcores"; __XNU_PRIVATE_EXTERN char drivercorefilename[MAXPATHLEN + 1] = {"/private/var/dextcores/%N.core"}; #endif #endif #if PROC_REF_DEBUG #include <kern/backtrace.h> #endif static LCK_MTX_DECLARE_ATTR(proc_klist_mlock, &proc_mlock_grp, &proc_lck_attr); ZONE_DEFINE(pgrp_zone, "pgrp", sizeof(struct pgrp), ZC_ZFREE_CLEARMEM); ZONE_DEFINE(session_zone, "session", sizeof(struct session), ZC_ZFREE_CLEARMEM); ZONE_DEFINE_ID(ZONE_ID_PROC_RO, "proc_ro", struct proc_ro, ZC_READONLY | ZC_ZFREE_CLEARMEM); typedef uint64_t unaligned_u64 __attribute__((aligned(1))); static void orphanpg(struct pgrp * pg); void proc_name_kdp(proc_t t, char * buf, int size); boolean_t proc_binary_uuid_kdp(task_t task, uuid_t uuid); boolean_t current_thread_aborted(void); int proc_threadname_kdp(void * uth, char * buf, size_t size); void proc_starttime_kdp(void * p, unaligned_u64 *tv_sec, unaligned_u64 *tv_usec, unaligned_u64 *abstime); void proc_archinfo_kdp(void* p, cpu_type_t* cputype, cpu_subtype_t* cpusubtype); uint64_t proc_getcsflags_kdp(void * p); const char * proc_name_address(void * p); char * proc_longname_address(void *); static void pgrp_destroy(struct pgrp *pgrp); static void pgrp_replace(proc_t p, struct pgrp *pgrp); static int csops_internal(pid_t pid, int ops, user_addr_t uaddr, user_size_t usersize, user_addr_t uaddittoken); static boolean_t proc_parent_is_currentproc(proc_t p); #if CONFIG_PROC_RESOURCE_LIMITS extern void task_filedesc_ast(task_t task, int current_size, int soft_limit, int hard_limit); extern void task_kqworkloop_ast(task_t task, int current_size, int soft_limit, int hard_limit); #endif /* defined in bsd/kern/kern_prot.c */ extern int get_audit_token_pid(const audit_token_t *audit_token); struct fixjob_iterargs { struct pgrp * pg; struct session * mysession; int entering; }; int fixjob_callback(proc_t, void *); uint64_t get_current_unique_pid(void) { proc_t p = current_proc(); if (p) { return proc_uniqueid(p); } else { return 0; } } /* * Initialize global process hashing structures. */ static void procinit(void) { smr_hash_init(&pid_hash, maxproc / 4); smr_hash_init(&pgrp_hash, maxproc / 4); sesshashtbl = hashinit(maxproc / 4, M_PROC, &sesshash); uihashtbl = hashinit(maxproc / 16, M_PROC, &uihash); } STARTUP(EARLY_BOOT, STARTUP_RANK_FIRST, procinit); static struct uidinfo * uidinfo_find_locked(uid_t uid) { struct uidinfo *uip; struct uihashhead *uipp; uipp = UIHASH(uid); for (uip = uipp->lh_first; uip != 0; uip = uip->ui_hash.le_next) { if (uip->ui_uid == uid) { break; } } return uip; } /* sysctl for debug kernels only */ #if DEBUG || DEVELOPMENT static int _debug_test_read_proccnt_for_uid(int64_t in, int64_t *out) { uid_t uid = (uid_t)in; proc_list_lock(); struct uidinfo * uip = uidinfo_find_locked(uid); if (uip) { *out = uip->ui_proccnt; } else { *out = 0; } proc_list_unlock(); return 0; } /* For tests */ SYSCTL_TEST_REGISTER(proccnt_uid, _debug_test_read_proccnt_for_uid); #endif /* DEBUG || DEVELOPMENT */ /* See declaration in header file for details */ size_t chgproccnt(uid_t uid, int diff) { struct uidinfo *uip, *newuip = NULL; size_t ret = 0; proc_list_lock(); uip = uidinfo_find_locked(uid); if (!uip) { if (diff == 0) { goto out; } if (diff < 0) { panic("chgproccnt: lost user"); } if (diff > 0) { /* need to allocate */ proc_list_unlock(); newuip = kalloc_type(struct uidinfo, Z_WAITOK | Z_NOFAIL); proc_list_lock(); } } if (diff == 0) { ret = uip->ui_proccnt; uip = NULL; goto out; } uip = chgproccnt_locked(uid, diff, newuip, &ret); out: proc_list_unlock(); if (uip) { /* despite if diff > 0 or diff < 0 - returned val points to element to be freed */ kfree_type(struct uidinfo, uip); } return ret; } /* See declaration in header file for details */ struct uidinfo * chgproccnt_locked(uid_t uid, int diff, struct uidinfo *newuip, size_t *out) { struct uidinfo *uip; struct uihashhead *uipp; assert(newuip == NULL || diff > 0); // new uip can be passed only with positive diff if (diff == 0) { panic("chgproccnt_locked: diff == 0"); } proc_list_lock_held(); uipp = UIHASH(uid); uip = uidinfo_find_locked(uid); /* if element is missing - we expect new one to be provided */ if (!uip) { /* this should never be reachable, we must've taken care of this case in caller */ assert(newuip != NULL); // chgproccnt_locked: missing new uidinfo element LIST_INSERT_HEAD(uipp, newuip, ui_hash); uip = newuip; newuip->ui_uid = uid; newuip->ui_proccnt = 0; newuip = NULL; } if (os_add_overflow((long long)uip->ui_proccnt, (long long)diff, &uip->ui_proccnt)) { panic("chgproccnt_locked: overflow"); } if (uip->ui_proccnt > 0) { if (out) { *out = uip->ui_proccnt; } /* no need to deallocate the uip */ uip = NULL; } else { assert(diff < 0); /* ui_proccnt == 0 */ LIST_REMOVE(uip, ui_hash); if (out) { *out = 0; } /* implicitly leaving uip intact - it will be returned and deallocated */ } if (diff < 0) { return uip; } else { /* diff > 0 */ return newuip; } } /* * Is p an inferior of the current process? */ int inferior(proc_t p) { int retval = 0; proc_list_lock(); for (; p != current_proc(); p = p->p_pptr) { if (proc_getpid(p) == 0) { goto out; } } retval = 1; out: proc_list_unlock(); return retval; } /* * Is p an inferior of t ? */ int isinferior(proc_t p, proc_t t) { int retval = 0; int nchecked = 0; proc_t start = p; /* if p==t they are not inferior */ if (p == t) { return 0; } proc_list_lock(); for (; p != t; p = p->p_pptr) { nchecked++; /* Detect here if we're in a cycle */ if ((proc_getpid(p) == 0) || (p->p_pptr == start) || (nchecked >= nprocs)) { goto out; } } retval = 1; out: proc_list_unlock(); return retval; } int proc_isinferior(int pid1, int pid2) { proc_t p = PROC_NULL; proc_t t = PROC_NULL; int retval = 0; if (((p = proc_find(pid1)) != (proc_t)0) && ((t = proc_find(pid2)) != (proc_t)0)) { retval = isinferior(p, t); } if (p != PROC_NULL) { proc_rele(p); } if (t != PROC_NULL) { proc_rele(t); } return retval; } /* * Returns process identity of a given process. Calling this function is not * racy for a current process or if a reference to the process is held. */ struct proc_ident proc_ident_with_policy(proc_t p, proc_ident_validation_policy_t policy) { struct proc_ident ident = { .may_exit = (policy & IDENT_VALIDATION_PROC_MAY_EXIT) != 0, .may_exec = (policy & IDENT_VALIDATION_PROC_MAY_EXEC) != 0, .p_pid = proc_pid(p), .p_uniqueid = proc_uniqueid(p), .p_idversion = proc_pidversion(p), }; return ident; } /* * Function: proc_find_audit_token * * Description: Lookup a process with the provided audit_token_t * will validate that the embedded pidver matches. */ proc_t proc_find_audit_token(const audit_token_t token) { proc_t proc = PROC_NULL; pid_t pid = get_audit_token_pid(&token); if (pid <= 0) { return PROC_NULL; } if ((proc = proc_find(pid)) == PROC_NULL) { return PROC_NULL; } /* Check the target proc pidversion */ int pidversion = proc_pidversion(proc); if (pidversion != token.val[7]) { proc_rele(proc); return PROC_NULL; } return proc; } /* * Function: proc_find_ident_validated * * Description: Obtain a proc ref from the provided proc_ident. * * Returns: * - 0 on Success * - EINVAL: When the provided arguments are invalid (NULL) * - ESTALE: The process exists but is currently a zombie and * has not been reaped via wait(). Callers may choose to handle * this edge case as a non-error. * - ESRCH: When the lookup or validation fails otherwise. The process * described by the identifier no longer exists. * * Note: Caller must proc_rele() the out param when this function returns 0 */ errno_t proc_find_ident_validated(const proc_ident_t ident, proc_t *out) { if (ident == NULL || out == NULL) { return EINVAL; } proc_t proc = proc_find(ident->p_pid); if (proc == PROC_NULL) { // If the policy indicates the process may exit, we should also check // the zombie list, and return ENOENT to indicate that the process is // a zombie waiting to be reaped. if (proc_ident_has_policy(ident, IDENT_VALIDATION_PROC_MAY_EXIT) && pzfind_unique(ident->p_pid, ident->p_uniqueid)) { return ESTALE; } return ESRCH; } // If the policy indicates that the process shouldn't exec, fail the // lookup if the pidversion doesn't match if (!proc_ident_has_policy(ident, IDENT_VALIDATION_PROC_MAY_EXEC) && proc_pidversion(proc) != ident->p_idversion) { proc_rele(proc); return ESRCH; } // Check the uniqueid which is always verified if (proc_uniqueid(proc) != ident->p_uniqueid) { proc_rele(proc); return ESRCH; } *out = proc; return 0; } /* * Function: proc_find_ident * * Description: Obtain a proc ref from the provided proc_ident. * Discards the errno result from proc_find_ident_validated * for callers using the old interface. */ inline proc_t proc_find_ident(const proc_ident_t ident) { proc_t p = PROC_NULL; if (proc_find_ident_validated(ident, &p) != 0) { return PROC_NULL; } return p; } /* * Function: proc_ident_equal_token * * Description: Compare a proc_ident_t to an audit token. The * process described by the audit token must still exist (which * includes a pidver check during the lookup). But the comparison * with the proc_ident_t will respect IDENT_VALIDATION_PROC_MAY_EXEC * and only compare PID and unique ID when it is set. */ bool proc_ident_equal_token(proc_ident_t ident, audit_token_t token) { if (ident == NULL) { return false; } // If the PIDs don't match, early return if (ident->p_pid != get_audit_token_pid(&token)) { return false; } // Compare pidversion if IDENT_VALIDATION_PROC_MAY_EXEC is not set if (!proc_ident_has_policy(ident, IDENT_VALIDATION_PROC_MAY_EXEC) && ident->p_idversion != token.val[7]) { return false; } // Lookup the process described by the provided audit token proc_t proc = proc_find_audit_token(token); if (proc == PROC_NULL) { return false; } // Always validate that the uniqueid matches if (proc_uniqueid(proc) != ident->p_uniqueid) { proc_rele(proc); return false; } proc_rele(proc); return true; } /* * Function: proc_ident_equal_ref * * Description: Compare a proc_ident_t to a proc_t. Will * respect IDENT_VALIDATION_PROC_MAY_EXEC and only compare * PID and unique ID when set. */ bool proc_ident_equal_ref(proc_ident_t ident, proc_t proc) { if (ident == NULL || proc == PROC_NULL) { return false; } // Always compare PID and p_uniqueid if (proc_pid(proc) != ident->p_pid || proc_uniqueid(proc) != ident->p_uniqueid) { return false; } // Compare pidversion if IDENT_VALIDATION_PROC_MAY_EXEC is not set if (!proc_ident_has_policy(ident, IDENT_VALIDATION_PROC_MAY_EXEC) && proc_pidversion(proc) != ident->p_idversion) { return false; } return true; } /* * Function: proc_ident_equal * * Description: Compare two proc_ident_t identifiers. Will * respect IDENT_VALIDATION_PROC_MAY_EXEC and only compare * PID and unique ID when set. */ bool proc_ident_equal(proc_ident_t ident, proc_ident_t other) { if (ident == NULL || other == NULL) { return false; } // Always compare PID and p_uniqueid if (ident->p_pid != other->p_pid || ident->p_uniqueid != other->p_uniqueid) { return false; } // Compare pidversion if IDENT_VALIDATION_PROC_MAY_EXEC is not set if (!proc_ident_has_policy(ident, IDENT_VALIDATION_PROC_MAY_EXEC) && ident->p_idversion != other->p_idversion) { return false; } return true; } /* * Function: proc_ident_has_policy * * Description: Validate that a particular policy is set. * * Stored in the upper 4 bits of the 32 bit * p_pid field. */ inline bool proc_ident_has_policy(const proc_ident_t ident, enum proc_ident_validation_policy policy) { if (ident == NULL) { return false; } switch (policy) { case IDENT_VALIDATION_PROC_MAY_EXIT: return ident->may_exit; case IDENT_VALIDATION_PROC_MAY_EXEC: return ident->may_exec; case IDENT_VALIDATION_PROC_EXACT: return ident->may_exec == 0 && ident->may_exit == 0; } } void uthread_reset_proc_refcount(uthread_t uth) { uth->uu_proc_refcount = 0; #if PROC_REF_DEBUG if (kern_feature_override(KF_DISABLE_PROCREF_TRACKING_OVRD)) { return; } struct uthread_proc_ref_info *upri = uth->uu_proc_ref_info; uint32_t n = uth->uu_proc_ref_info->upri_pindex; uth->uu_proc_ref_info->upri_pindex = 0; if (n) { for (unsigned i = 0; i < n; i++) { btref_put(upri->upri_proc_stacks[i]); } bzero(upri->upri_proc_stacks, sizeof(btref_t) * n); bzero(upri->upri_proc_ps, sizeof(proc_t) * n); } #endif /* PROC_REF_DEBUG */ } #if PROC_REF_DEBUG void uthread_init_proc_refcount(uthread_t uth) { if (kern_feature_override(KF_DISABLE_PROCREF_TRACKING_OVRD)) { return; } uth->uu_proc_ref_info = kalloc_type(struct uthread_proc_ref_info, Z_ZERO | Z_WAITOK | Z_NOFAIL); } void uthread_destroy_proc_refcount(uthread_t uth) { if (kern_feature_override(KF_DISABLE_PROCREF_TRACKING_OVRD)) { return; } struct uthread_proc_ref_info *upri = uth->uu_proc_ref_info; uint32_t n = uth->uu_proc_ref_info->upri_pindex; for (unsigned i = 0; i < n; i++) { btref_put(upri->upri_proc_stacks[i]); } kfree_type(struct uthread_proc_ref_info, uth->uu_proc_ref_info); } void uthread_assert_zero_proc_refcount(uthread_t uth) { if (kern_feature_override(KF_DISABLE_PROCREF_TRACKING_OVRD)) { return; } if (__improbable(uth->uu_proc_refcount != 0)) { panic("Unexpected non zero uu_proc_refcount = %d (%p)", uth->uu_proc_refcount, uth); } } #endif /* PROC_REF_DEBUG */ bool proc_list_exited(proc_t p) { return os_ref_get_raw_mask(&p->p_refcount) & P_REF_DEAD; } #if CONFIG_DEBUG_SYSCALL_REJECTION uint64_t uthread_get_syscall_rejection_flags(void *uthread) { uthread_t uth = (uthread_t) uthread; return uth->syscall_rejection_flags; } uint64_t* uthread_get_syscall_rejection_mask(void *uthread) { uthread_t uth = (uthread_t) uthread; return uth->syscall_rejection_mask; } uint64_t* uthread_get_syscall_rejection_once_mask(void *uthread) { uthread_t uth = (uthread_t) uthread; return uth->syscall_rejection_once_mask; } bool uthread_syscall_rejection_is_enabled(void *uthread) { uthread_t uth = (uthread_t) uthread; return (debug_syscall_rejection_mode != 0) || (uth->syscall_rejection_flags & SYSCALL_REJECTION_FLAGS_FORCE_FATAL); } #endif /* CONFIG_DEBUG_SYSCALL_REJECTION */ #if PROC_REF_DEBUG __attribute__((noinline)) #endif /* PROC_REF_DEBUG */ static void record_procref(proc_t p __unused, int count) { uthread_t uth; uth = current_uthread(); uth->uu_proc_refcount += count; #if PROC_REF_DEBUG if (kern_feature_override(KF_DISABLE_PROCREF_TRACKING_OVRD)) { return; } struct uthread_proc_ref_info *upri = uth->uu_proc_ref_info; if (upri->upri_pindex < NUM_PROC_REFS_TO_TRACK) { upri->upri_proc_stacks[upri->upri_pindex] = btref_get(__builtin_frame_address(0), BTREF_GET_NOWAIT); upri->upri_proc_ps[upri->upri_pindex] = p; upri->upri_pindex++; } #endif /* PROC_REF_DEBUG */ } /*! * @function proc_ref_try_fast() * * @brief * Tries to take a proc ref, unless it is in flux (being made, or dead). * * @returns * - the new refcount value (including bits) on success, * - 0 on failure. */ static inline uint32_t proc_ref_try_fast(proc_t p) { uint32_t bits; proc_require(p, PROC_REQUIRE_ALLOW_ALL); bits = os_ref_retain_try_mask(&p->p_refcount, P_REF_BITS, P_REF_NEW | P_REF_DEAD, NULL); if (bits) { record_procref(p, 1); } return bits; } /*! * @function proc_ref_wait() * * @brief * Waits for the specified bits to clear, on the specified event. */ __attribute__((noinline)) static void proc_ref_wait(proc_t p, event_t event, proc_ref_bits_t mask, bool locked) { assert_wait(event, THREAD_UNINT | THREAD_WAIT_NOREPORT); if (os_ref_get_raw_mask(&p->p_refcount) & mask) { uthread_t uth = current_uthread(); if (locked) { proc_list_unlock(); } uth->uu_wchan = event; uth->uu_wmesg = "proc_refwait"; thread_block(THREAD_CONTINUE_NULL); uth->uu_wchan = NULL; uth->uu_wmesg = NULL; if (locked) { proc_list_lock(); } } else { clear_wait(current_thread(), THREAD_AWAKENED); } } /*! * @function proc_ref_wait_for_exec() * * @brief * Routine called by processes trying to acquire a ref while * an exec is in flight. * * @discussion * This function is called with a proc ref held on the proc, * which will be given up until the @c P_REF_*_EXEC flags clear. * * @param p the proc, the caller owns a proc ref * @param bits the result of @c proc_ref_try_fast() prior to calling this. * @param locked whether the caller holds the @c proc_list_lock(). */ __attribute__((noinline)) static proc_t proc_ref_wait_for_exec(proc_t p, uint32_t bits, int locked) { const proc_ref_bits_t mask = P_REF_WILL_EXEC | P_REF_IN_EXEC; /* * the proc is in the middle of exec, * trade our ref for a "wait ref", * and wait for the proc_refwake_did_exec() call. * * Note: it's very unlikely that we'd loop back into the wait, * it would only happen if the target proc would be * in exec again by the time we woke up. */ os_ref_retain_raw(&p->p_waitref, &p_refgrp); do { proc_rele(p); proc_ref_wait(p, &p->p_waitref, mask, locked); bits = proc_ref_try_fast(p); } while (__improbable(bits & mask)); proc_wait_release(p); return bits ? p : PROC_NULL; } static inline bool proc_ref_needs_wait_for_exec(uint32_t bits) { if (__probable((bits & (P_REF_WILL_EXEC | P_REF_IN_EXEC)) == 0)) { return false; } if (bits & P_REF_IN_EXEC) { return true; } /* * procs can't have outstanding refs while execing. * * In order to achieve, that, proc_refdrain_will_exec() * will drain outstanding references. It signals its intent * with the P_REF_WILL_EXEC flag, and moves to P_REF_IN_EXEC * when this is achieved. * * Most threads will block in proc_ref() when any of those * flags is set. However, threads that already have * an oustanding ref on this proc might want another * before dropping them. To avoid deadlocks, we need * to let threads with any oustanding reference take one * when only P_REF_WILL_EXEC is set (which causes exec * to be delayed). * * Note: the current thread will _always_ appear like it holds * one ref due to having taken one speculatively. */ assert(current_uthread()->uu_proc_refcount >= 1); return current_uthread()->uu_proc_refcount == 1; } int proc_rele(proc_t p) { uint32_t o_bits, n_bits; proc_require(p, PROC_REQUIRE_ALLOW_ALL); os_atomic_rmw_loop(&p->p_refcount, o_bits, n_bits, release, { n_bits = o_bits - (1u << P_REF_BITS); if ((n_bits >> P_REF_BITS) == 1) { n_bits &= ~P_REF_DRAINING; } }); record_procref(p, -1); /* * p might be freed after this point. */ if (__improbable((o_bits & P_REF_DRAINING) && !(n_bits & P_REF_DRAINING))) { /* * This wakeup can cause spurious ones, * but proc_refdrain() can deal with those. * * Because the proc_zone memory is sequestered, * this is safe to wakeup a possible "freed" address. */ wakeup(&p->p_refcount); } return 0; } bool proc_is_shadow(proc_t p) { return os_ref_get_raw_mask(&p->p_refcount) & P_REF_SHADOW; } proc_t proc_self(void) { proc_t p = current_proc(); /* * Do not go through the logic of "wait for exec", it is meaningless. * Only fail taking a ref for oneself if the proc is about to die. */ return proc_ref_try_fast(p) ? p : PROC_NULL; } static proc_t proc_ref_impl(proc_t p, bool wait, bool locked) { uint32_t bits; bits = proc_ref_try_fast(p); if (__improbable(!bits)) { return PROC_NULL; } if (__improbable(proc_ref_needs_wait_for_exec(bits))) { if (wait) { return proc_ref_wait_for_exec(p, bits, locked); } else { /* can't wait - just return null */ return PROC_NULL; } } return p; } proc_t proc_ref(proc_t p, int locked) { return proc_ref_impl(p, true, (bool)locked); } proc_t proc_ref_nowait(proc_t p) { return proc_ref_impl(p, false, false /* doesn't matter */); } static void proc_wait_free(smr_node_t node) { struct proc *p = __container_of(node, struct proc, p_smr_node); proc_release_proc_task_struct(p); } void proc_wait_release(proc_t p) { if (__probable(os_ref_release_raw(&p->p_waitref, &p_refgrp) == 0)) { smr_proc_task_call(&p->p_smr_node, proc_and_task_size, proc_wait_free); } } proc_t proc_find_zombref(int pid) { proc_t p; proc_list_lock(); p = proc_find_zombref_locked(pid); proc_list_unlock(); return p; } proc_t proc_find_zombref_locked(int pid) { proc_t p; LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); again: p = phash_find_locked(pid); /* should we bail? */ if ((p == PROC_NULL) || !proc_list_exited(p)) { return PROC_NULL; } /* If someone else is controlling the (unreaped) zombie - wait */ if ((p->p_listflag & P_LIST_WAITING) != 0) { (void)msleep(&p->p_stat, &proc_list_mlock, PWAIT, "waitcoll", 0); goto again; } p->p_listflag |= P_LIST_WAITING; return p; } void proc_drop_zombref(proc_t p) { proc_list_lock(); if ((p->p_listflag & P_LIST_WAITING) == P_LIST_WAITING) { p->p_listflag &= ~P_LIST_WAITING; wakeup(&p->p_stat); } proc_list_unlock(); } void proc_refdrain(proc_t p) { uint32_t bits = os_ref_get_raw_mask(&p->p_refcount); assert(proc_list_exited(p)); while ((bits >> P_REF_BITS) > 1) { if (os_atomic_cmpxchgv(&p->p_refcount, bits, bits | P_REF_DRAINING, &bits, relaxed)) { proc_ref_wait(p, &p->p_refcount, P_REF_DRAINING, false); } } } proc_t proc_refdrain_will_exec(proc_t p) { const proc_ref_bits_t will_exec_mask = P_REF_WILL_EXEC | P_REF_DRAINING; /* * All the calls to proc_ref will wait * for the flag to get cleared before returning a ref. * * (except for the case documented in proc_ref_needs_wait_for_exec()). */ if (p == initproc) { /* Do not wait in ref drain for launchd exec */ os_atomic_or(&p->p_refcount, P_REF_IN_EXEC, relaxed); } else { for (;;) { uint32_t o_ref, n_ref; os_atomic_rmw_loop(&p->p_refcount, o_ref, n_ref, relaxed, { if ((o_ref >> P_REF_BITS) == 1) { /* * We drained successfully, * move on to P_REF_IN_EXEC */ n_ref = o_ref & ~will_exec_mask; n_ref |= P_REF_IN_EXEC; } else { /* * Outstanding refs exit, * mark our desire to stall * proc_ref() callers with * P_REF_WILL_EXEC. */ n_ref = o_ref | will_exec_mask; } }); if (n_ref & P_REF_IN_EXEC) { break; } proc_ref_wait(p, &p->p_refcount, P_REF_DRAINING, false); } } /* Return a ref to the caller */ os_ref_retain_mask(&p->p_refcount, P_REF_BITS, NULL); record_procref(p, 1); return p; } void proc_refwake_did_exec(proc_t p) { os_atomic_andnot(&p->p_refcount, P_REF_IN_EXEC, release); wakeup(&p->p_waitref); } void proc_ref_hold_proc_task_struct(proc_t proc) { os_atomic_or(&proc->p_refcount, P_REF_PROC_HOLD, relaxed); } static void proc_free(proc_t proc, proc_ro_t proc_ro) { kauth_cred_t cred; assert(proc_ro != NULL); cred = smr_serialized_load(&proc_ro->p_ucred); kauth_cred_set(&cred, NOCRED); zfree_ro(ZONE_ID_PROC_RO, proc_ro); zfree(proc_task_zone, proc); } void proc_release_proc_task_struct(proc_t proc) { uint32_t old_ref = os_atomic_andnot_orig(&proc->p_refcount, P_REF_PROC_HOLD, relaxed); if ((old_ref & P_REF_TASK_HOLD) == 0) { proc_free(proc, proc->p_proc_ro); } } void task_ref_hold_proc_task_struct(task_t task) { proc_t proc_from_task = task_get_proc_raw(task); os_atomic_or(&proc_from_task->p_refcount, P_REF_TASK_HOLD, relaxed); } void task_release_proc_task_struct(task_t task, proc_ro_t proc_ro) { proc_t proc_from_task = task_get_proc_raw(task); uint32_t old_ref = os_atomic_andnot_orig(&proc_from_task->p_refcount, P_REF_TASK_HOLD, relaxed); if ((old_ref & P_REF_PROC_HOLD) == 0) { proc_free(proc_from_task, proc_ro); } } proc_t proc_parentholdref(proc_t p) { proc_t parent = PROC_NULL; proc_t pp; proc_list_lock(); loop: pp = p->p_pptr; if ((pp == PROC_NULL) || (pp->p_stat == SZOMB) || ((pp->p_listflag & (P_LIST_CHILDDRSTART | P_LIST_CHILDDRAINED)) == (P_LIST_CHILDDRSTART | P_LIST_CHILDDRAINED))) { parent = PROC_NULL; goto out; } if ((pp->p_listflag & (P_LIST_CHILDDRSTART | P_LIST_CHILDDRAINED)) == P_LIST_CHILDDRSTART) { pp->p_listflag |= P_LIST_CHILDDRWAIT; msleep(&pp->p_childrencnt, &proc_list_mlock, 0, "proc_parent", 0); goto loop; } if ((pp->p_listflag & (P_LIST_CHILDDRSTART | P_LIST_CHILDDRAINED)) == 0) { pp->p_parentref++; parent = pp; goto out; } out: proc_list_unlock(); return parent; } int proc_parentdropref(proc_t p, int listlocked) { if (listlocked == 0) { proc_list_lock(); } if (p->p_parentref > 0) { p->p_parentref--; if ((p->p_parentref == 0) && ((p->p_listflag & P_LIST_PARENTREFWAIT) == P_LIST_PARENTREFWAIT)) { p->p_listflag &= ~P_LIST_PARENTREFWAIT; wakeup(&p->p_parentref); } } else { panic("proc_parentdropref -ve ref"); } if (listlocked == 0) { proc_list_unlock(); } return 0; } void proc_childdrainstart(proc_t p) { #if __PROC_INTERNAL_DEBUG if ((p->p_listflag & P_LIST_CHILDDRSTART) == P_LIST_CHILDDRSTART) { panic("proc_childdrainstart: childdrain already started"); } #endif p->p_listflag |= P_LIST_CHILDDRSTART; /* wait for all that hold parentrefs to drop */ while (p->p_parentref > 0) { p->p_listflag |= P_LIST_PARENTREFWAIT; msleep(&p->p_parentref, &proc_list_mlock, 0, "proc_childdrainstart", 0); } } void proc_childdrainend(proc_t p) { #if __PROC_INTERNAL_DEBUG if (p->p_childrencnt > 0) { panic("exiting: children stil hanging around"); } #endif p->p_listflag |= P_LIST_CHILDDRAINED; if ((p->p_listflag & (P_LIST_CHILDLKWAIT | P_LIST_CHILDDRWAIT)) != 0) { p->p_listflag &= ~(P_LIST_CHILDLKWAIT | P_LIST_CHILDDRWAIT); wakeup(&p->p_childrencnt); } } void proc_checkdeadrefs(__unused proc_t p) { uint32_t bits; bits = os_ref_release_raw_mask(&p->p_refcount, P_REF_BITS, NULL); bits &= ~(P_REF_SHADOW | P_REF_PROC_HOLD | P_REF_TASK_HOLD); if (bits != P_REF_DEAD) { panic("proc being freed and unexpected refcount %p:%d:0x%x", p, bits >> P_REF_BITS, bits & P_REF_MASK); } #if __PROC_INTERNAL_DEBUG if (p->p_childrencnt != 0) { panic("proc being freed and pending children cnt %p:%d", p, p->p_childrencnt); } if (p->p_parentref != 0) { panic("proc being freed and pending parentrefs %p:%d", p, p->p_parentref); } #endif } __attribute__((always_inline, visibility("hidden"))) void proc_require(proc_t proc, proc_require_flags_t flags) { if ((flags & PROC_REQUIRE_ALLOW_NULL) && proc == PROC_NULL) { return; } zone_id_require(ZONE_ID_PROC_TASK, proc_and_task_size, proc); } pid_t proc_getpid(proc_t p) { if (p == kernproc) { return 0; } return p->p_pid; } int proc_pid(proc_t p) { if (p != NULL) { proc_require(p, PROC_REQUIRE_ALLOW_ALL); return proc_getpid(p); } return -1; } int proc_ppid(proc_t p) { if (p != NULL) { proc_require(p, PROC_REQUIRE_ALLOW_ALL); return p->p_ppid; } return -1; } int proc_original_ppid(proc_t p) { if (p != NULL) { proc_require(p, PROC_REQUIRE_ALLOW_ALL); return proc_get_ro(p)->p_orig_ppid; } return -1; } int proc_orig_ppidversion(proc_t p) { if (p != NULL) { proc_require(p, PROC_REQUIRE_ALLOW_ALL); return proc_get_ro(p)->p_orig_ppidversion; } return -1; } int proc_starttime(proc_t p, struct timeval *tv) { if (p != NULL && tv != NULL) { tv->tv_sec = p->p_start.tv_sec; tv->tv_usec = p->p_start.tv_usec; return 0; } return EINVAL; } int proc_selfpid(void) { return proc_getpid(current_proc()); } int proc_selfppid(void) { return current_proc()->p_ppid; } uint64_t proc_selfcsflags(void) { return proc_getcsflags(current_proc()); } int proc_csflags(proc_t p, uint64_t *flags) { if (p && flags) { proc_require(p, PROC_REQUIRE_ALLOW_ALL); *flags = proc_getcsflags(p); return 0; } return EINVAL; } boolean_t proc_is_simulated(const proc_t p) { #ifdef XNU_TARGET_OS_OSX if (p != NULL) { switch (proc_platform(p)) { case PLATFORM_IOSSIMULATOR: case PLATFORM_TVOSSIMULATOR: case PLATFORM_WATCHOSSIMULATOR: case PLATFORM_XROSSIMULATOR: return TRUE; default: return FALSE; } } #else /* !XNU_TARGET_OS_OSX */ (void)p; #endif return FALSE; } uint32_t proc_platform(const proc_t p) { if (p != NULL) { return proc_get_ro(p)->p_platform_data.p_platform; } return (uint32_t)-1; } uint32_t proc_min_sdk(proc_t p) { if (p != NULL) { return proc_get_ro(p)->p_platform_data.p_min_sdk; } return (uint32_t)-1; } uint32_t proc_sdk(proc_t p) { if (p != NULL) { return proc_get_ro(p)->p_platform_data.p_sdk; } return (uint32_t)-1; } bool proc_sdk_26_4_or_later(proc_t proc) { const uint32_t sdk_vers = proc_sdk(proc); switch (proc_platform(proc)) { case PLATFORM_IOS: case PLATFORM_IOSSIMULATOR: case PLATFORM_MACOS: case PLATFORM_TVOS: case PLATFORM_TVOSSIMULATOR: case PLATFORM_WATCHOS: case PLATFORM_WATCHOSSIMULATOR: case PLATFORM_XROS: case PLATFORM_XROSSIMULATOR: return sdk_vers >= 0x001a0400; // DYLD_*_VERSION_26_4 case PLATFORM_BRIDGEOS: return sdk_vers >= 0x000a0400; // DYLD_BRIDGEOS_VERSION_10_4 case PLATFORM_DRIVERKIT: return sdk_vers >= 0x00190400; // DYLD_DRIVERKIT_VERSION_25_4 default: return true; } } void proc_setplatformdata(proc_t p, uint32_t platform, uint32_t min_sdk, uint32_t sdk) { proc_ro_t ro; struct proc_platform_ro_data platform_data; ro = proc_get_ro(p); platform_data = ro->p_platform_data; platform_data.p_platform = platform; platform_data.p_min_sdk = min_sdk; platform_data.p_sdk = sdk; zalloc_ro_update_field(ZONE_ID_PROC_RO, ro, p_platform_data, &platform_data); } #if CONFIG_DTRACE int dtrace_proc_selfpid(void) { return proc_selfpid(); } int dtrace_proc_selfppid(void) { return proc_selfppid(); } uid_t dtrace_proc_selfruid(void) { return current_proc()->p_ruid; } #endif /* CONFIG_DTRACE */ /*! * @function proc_parent() * * @brief * Returns a ref on the parent of @c p. * * @discussion * Returns a reference on the parent, or @c PROC_NULL * if both @c p and its parent are zombies. * * If the parent is currently dying, then this function waits * for the situation to be resolved. * * This function never returns @c PROC_NULL if @c p isn't * a zombie (@c p_stat is @c SZOMB) yet. */ proc_t proc_parent(proc_t p) { proc_t parent; proc_t pp; proc_list_lock(); while (1) { pp = p->p_pptr; parent = proc_ref(pp, true); /* Check if we got a proc ref and it is still the parent */ if (parent != PROC_NULL) { if (parent == p->p_pptr) { /* * We have a ref on the parent and it is still * our parent, return the ref */ proc_list_unlock(); return parent; } /* * Our parent changed while we slept on proc_ref, * drop the ref on old parent and retry. */ proc_rele(parent); continue; } if (pp != p->p_pptr) { /* * We didn't get a ref, but parent changed from what * we last saw before we slept in proc_ref, try again * with new parent. */ continue; } if ((pp->p_listflag & P_LIST_CHILDDRAINED) == 0) { /* Parent did not change, but we also did not get a * ref on parent, sleep if the parent has not drained * its children and then retry. */ pp->p_listflag |= P_LIST_CHILDLKWAIT; msleep(&pp->p_childrencnt, &proc_list_mlock, 0, "proc_parent", 0); continue; } /* Parent has died and drained its children and we still * point to it, return NULL. */ proc_list_unlock(); return PROC_NULL; } } static boolean_t proc_parent_is_currentproc(proc_t p) { boolean_t ret = FALSE; proc_list_lock(); if (p->p_pptr == current_proc()) { ret = TRUE; } proc_list_unlock(); return ret; } void proc_name(int pid, char * buf, int size) { proc_t p; if (size <= 0) { return; } bzero(buf, size); if ((p = proc_find(pid)) != PROC_NULL) { strlcpy(buf, &p->p_comm[0], MIN((int)sizeof(p->p_comm), size)); proc_rele(p); } } void proc_name_kdp(proc_t p, char * buf, int size) { if (p == PROC_NULL) { return; } if ((size_t)size > sizeof(p->p_comm)) { strlcpy(buf, &p->p_name[0], MIN((int)sizeof(p->p_name), size)); } else { strlcpy(buf, &p->p_comm[0], MIN((int)sizeof(p->p_comm), size)); } } boolean_t proc_binary_uuid_kdp(task_t task, uuid_t uuid) { proc_t p = get_bsdtask_info(task); if (p == PROC_NULL) { return FALSE; } proc_getexecutableuuid(p, uuid, sizeof(uuid_t)); return TRUE; } int proc_threadname_kdp(void * uth, char * buf, size_t size) { if (size < MAXTHREADNAMESIZE) { /* this is really just a protective measure for the future in * case the thread name size in stackshot gets out of sync with * the BSD max thread name size. Note that bsd_getthreadname * doesn't take input buffer size into account. */ return -1; } if (uth != NULL) { bsd_getthreadname(uth, buf); } return 0; } /* note that this function is generally going to be called from stackshot, * and the arguments will be coming from a struct which is declared packed * thus the input arguments will in general be unaligned. We have to handle * that here. */ void proc_starttime_kdp(void *p, unaligned_u64 *tv_sec, unaligned_u64 *tv_usec, unaligned_u64 *abstime) { proc_t pp = (proc_t)p; if (pp != PROC_NULL) { if (tv_sec != NULL) { *tv_sec = pp->p_start.tv_sec; } if (tv_usec != NULL) { *tv_usec = pp->p_start.tv_usec; } if (abstime != NULL) { if (pp->p_stats != NULL) { *abstime = pp->p_stats->ps_start; } else { *abstime = 0; } } } } void proc_archinfo_kdp(void* p, cpu_type_t* cputype, cpu_subtype_t* cpusubtype) { proc_t pp = (proc_t)p; if (pp != PROC_NULL) { *cputype = pp->p_cputype; *cpusubtype = pp->p_cpusubtype; } } void proc_memstat_data_kdp(void *p, int32_t *current_memlimit, int32_t *prio_effective, int32_t *prio_requested, int32_t *prio_assertion); void proc_memstat_data_kdp(void *p, int32_t *current_memlimit, int32_t *prio_effective, int32_t *prio_requested, int32_t *prio_assertion) { proc_t pp = (proc_t)p; if (pp != PROC_NULL) { *current_memlimit = pp->p_memstat_memlimit; *prio_effective = pp->p_memstat_effectivepriority; *prio_assertion = pp->p_memstat_assertionpriority; *prio_requested = pp->p_memstat_requestedpriority; } } const char * proc_name_address(void *p) { return &((proc_t)p)->p_comm[0]; } char * proc_longname_address(void *p) { return &((proc_t)p)->p_name[0]; } const char * proc_best_name(proc_t p) { if (p->p_name[0] != '\0') { return &p->p_name[0]; } return &p->p_comm[0]; } void proc_best_name_for_pid(int pid, char * buf, int size) { proc_t p; if (size <= 0) { return; } bzero(buf, size); if ((p = proc_find(pid)) != PROC_NULL) { if (p->p_name[0] != '\0') { strlcpy(buf, &p->p_name[0], MIN((int)sizeof(p->p_name), size)); } else { strlcpy(buf, &p->p_comm[0], MIN((int)sizeof(p->p_comm), size)); } proc_rele(p); } } void proc_selfname(char * buf, int size) { proc_t p; if (size <= 0) { return; } bzero(buf, size); if ((p = current_proc()) != (proc_t)0) { strlcpy(buf, &p->p_name[0], MIN((int)sizeof(p->p_name), size)); } } void proc_signal(int pid, int signum) { proc_t p; if ((p = proc_find(pid)) != PROC_NULL) { psignal(p, signum); proc_rele(p); } } int proc_issignal(int pid, sigset_t mask) { proc_t p; int error = 0; if ((p = proc_find(pid)) != PROC_NULL) { error = proc_pendingsignals(p, mask); proc_rele(p); } return error; } int proc_noremotehang(proc_t p) { int retval = 0; if (p) { retval = p->p_flag & P_NOREMOTEHANG; } return retval? 1: 0; } int proc_exiting(proc_t p) { int retval = 0; if (p) { retval = p->p_lflag & P_LEXIT; } return retval? 1: 0; } int proc_in_teardown(proc_t p) { int retval = 0; if (p) { retval = p->p_lflag & P_LPEXIT; } return retval? 1: 0; } int proc_lvfork(proc_t p __unused) { return 0; } int proc_increment_ru_oublock(proc_t p, long *origvalp) { long origval; if (p && p->p_stats) { origval = OSIncrementAtomicLong(&p->p_stats->p_ru.ru_oublock); if (origvalp) { *origvalp = origval; } return 0; } return EINVAL; } int proc_isabortedsignal(proc_t p) { if ((p != kernproc) && current_thread_aborted() && (!(p->p_acflag & AXSIG) || (p->exit_thread != current_thread()) || (p->p_sigacts.ps_sig < 1) || (p->p_sigacts.ps_sig >= NSIG) || !hassigprop(p->p_sigacts.ps_sig, SA_CORE))) { return 1; } return 0; } int proc_forcequota(proc_t p) { int retval = 0; if (p) { retval = p->p_flag & P_FORCEQUOTA; } return retval? 1: 0; } int proc_suser(proc_t p) { int error; smr_proc_task_enter(); error = suser(proc_ucred_smr(p), &p->p_acflag); smr_proc_task_leave(); return error; } void proc_set_ptraced_during_soft_mode(proc_t p) { /* Hack: we would like to surface in crash reports when we've disabled, * but we don't know which thread will crash when we attach, so we store * it in a flag and add the ktriage record during proc_prepareexit. */ p->p_lflag |= P_LWASSOFT; } bool proc_was_ptraced_during_soft_mode(proc_t p) { return p->p_lflag & P_LWASSOFT; } void proc_disable_sec_soft_mode_locked(proc_t p) { #if HAS_MTE || HAS_MTE_EMULATION_SHIMS /* * Clear MTE soft-mode when process becomes traced (rdar://156025403) * Note that this will miss the case where a process takes a TCF * in soft mode prior to becoming debugged. */ task_t task = proc_task(p); if (task_has_sec(task) && task_has_sec_soft_mode(task)) { task_clear_sec_soft_mode(task); proc_set_ptraced_during_soft_mode(p); } #else (void)p; #endif /* HAS_MTE || HAS_MTE_EMULATION_SHIMS */ } task_t proc_task(proc_t proc) { task_t task_from_proc = proc_get_task_raw(proc); return (proc->p_lflag & P_LHASTASK) ? task_from_proc : NULL; } void proc_set_task(proc_t proc, task_t task) { task_t task_from_proc = proc_get_task_raw(proc); if (task == NULL) { proc->p_lflag &= ~P_LHASTASK; } else { if (task != task_from_proc) { panic("proc_set_task trying to set random task %p", task); } proc->p_lflag |= P_LHASTASK; } } task_t proc_get_task_raw(proc_t proc) { return (task_t)((uintptr_t)proc + proc_struct_size); } proc_t task_get_proc_raw(task_t task) { return (proc_t)((uintptr_t)task - proc_struct_size); } /* * Obtain the first thread in a process * * XXX This is a bad thing to do; it exists predominantly to support the * XXX use of proc_t's in places that should really be using * XXX thread_t's instead. This maintains historical behaviour, but really * XXX needs an audit of the context (proxy vs. not) to clean up. */ thread_t proc_thread(proc_t proc) { LCK_MTX_ASSERT(&proc->p_mlock, LCK_MTX_ASSERT_OWNED); uthread_t uth = TAILQ_FIRST(&proc->p_uthlist); if (uth != NULL) { return get_machthread(uth); } return NULL; } kauth_cred_t proc_ucred_unsafe(proc_t p) { kauth_cred_t cred = smr_serialized_load(&proc_get_ro(p)->p_ucred); return kauth_cred_require(cred); } kauth_cred_t proc_ucred_smr(proc_t p) { assert(smr_entered(&smr_proc_task)); return proc_ucred_unsafe(p); } kauth_cred_t proc_ucred_locked(proc_t p) { LCK_MTX_ASSERT(&p->p_ucred_mlock, LCK_ASSERT_OWNED); return proc_ucred_unsafe(p); } struct uthread * current_uthread(void) { return get_bsdthread_info(current_thread()); } int proc_is64bit(proc_t p) { return IS_64BIT_PROCESS(p); } int proc_is64bit_data(proc_t p) { assert(proc_task(p)); return (int)task_get_64bit_data(proc_task(p)); } int proc_isinitproc(proc_t p) { if (initproc == NULL) { return 0; } return p == initproc; } int proc_pidversion(proc_t p) { return proc_get_ro(p)->p_idversion; } void proc_setpidversion(proc_t p, int idversion) { zalloc_ro_update_field(ZONE_ID_PROC_RO, proc_get_ro(p), p_idversion, &idversion); } uint32_t proc_persona_id(proc_t p) { return (uint32_t)persona_id_from_proc(p); } uint32_t proc_getuid(proc_t p) { return p->p_uid; } uint32_t proc_getgid(proc_t p) { return p->p_gid; } uint64_t proc_uniqueid(proc_t p) { if (p == kernproc) { return 0; } return proc_get_ro(p)->p_uniqueid; } uint64_t proc_uniqueid_task(void *p_arg, void *t); /* * During exec, two tasks point at the proc. This function is used * to gives tasks a unique ID; we make the matching task have the * proc's uniqueid, and any other task gets the high-bit flipped. * (We need to try to avoid returning UINT64_MAX, which is the * which is the uniqueid of a task without a proc. (e.g. while exiting)) * * Only used by get_task_uniqueid(); do not add additional callers. */ uint64_t proc_uniqueid_task(void *p_arg, void *t __unused) { proc_t p = p_arg; uint64_t uniqueid = proc_uniqueid(p); return uniqueid ^ (__probable(!proc_is_shadow(p)) ? 0 : (1ull << 63)); } uint64_t proc_puniqueid(proc_t p) { return p->p_puniqueid; } void proc_coalitionids(__unused proc_t p, __unused uint64_t ids[COALITION_NUM_TYPES]) { #if CONFIG_COALITIONS task_coalition_ids(proc_task(p), ids); #else memset(ids, 0, sizeof(uint64_t[COALITION_NUM_TYPES])); #endif return; } uint64_t proc_was_throttled(proc_t p) { return p->was_throttled; } uint64_t proc_did_throttle(proc_t p) { return p->did_throttle; } int proc_getcdhash(proc_t p, unsigned char *cdhash) { if (p == kernproc) { return EINVAL; } return vn_getcdhash(p->p_textvp, p->p_textoff, cdhash, NULL); } uint64_t proc_getcsflags(proc_t p) { return proc_get_ro(p)->p_csflags; } /* This variant runs in stackshot context and must not take locks. */ uint64_t proc_getcsflags_kdp(void * p) { proc_t proc = (proc_t)p; if (p == PROC_NULL) { return 0; } return proc_getcsflags(proc); } void proc_csflags_update(proc_t p, uint64_t flags) { uint32_t csflags = (uint32_t)flags; if (p != kernproc) { zalloc_ro_update_field(ZONE_ID_PROC_RO, proc_get_ro(p), p_csflags, &csflags); } } void proc_csflags_set(proc_t p, uint64_t flags) { proc_csflags_update(p, proc_getcsflags(p) | (uint32_t)flags); } void proc_csflags_clear(proc_t p, uint64_t flags) { proc_csflags_update(p, proc_getcsflags(p) & ~(uint32_t)flags); } uint8_t * proc_syscall_filter_mask(proc_t p) { return proc_get_ro(p)->syscall_filter_mask; } void proc_syscall_filter_mask_set(proc_t p, uint8_t *mask) { zalloc_ro_update_field(ZONE_ID_PROC_RO, proc_get_ro(p), syscall_filter_mask, &mask); } int proc_exitstatus(proc_t p) { return p->p_xstat & 0xffff; } bool proc_is_zombie(proc_t p) { return proc_list_exited(p); } void proc_setexecutableuuid(proc_t p, const unsigned char *uuid) { memcpy(p->p_uuid, uuid, sizeof(p->p_uuid)); } const unsigned char * proc_executableuuid_addr(proc_t p) { return &p->p_uuid[0]; } void proc_getexecutableuuid(proc_t p, unsigned char *uuidbuf, unsigned long size) { if (size >= sizeof(uuid_t)) { memcpy(uuidbuf, proc_executableuuid_addr(p), sizeof(uuid_t)); } } void proc_getresponsibleuuid(proc_t p, unsigned char *__counted_by(size)uuidbuf, unsigned long size) { if (size >= sizeof(uuid_t)) { memcpy(uuidbuf, p->p_responsible_uuid, sizeof(uuid_t)); } } void proc_setresponsibleuuid(proc_t p, unsigned char *__counted_by(size)uuidbuf, unsigned long size) { if (p != NULL && uuidbuf != NULL && size >= sizeof(uuid_t)) { memcpy(p->p_responsible_uuid, uuidbuf, sizeof(uuid_t)); } return; } /* Return vnode for executable with an iocount. Must be released with vnode_put() */ vnode_t proc_getexecutablevnode(proc_t p) { vnode_t tvp = p->p_textvp; if (tvp != NULLVP) { if (vnode_getwithref(tvp) == 0) { return tvp; } } return NULLVP; } /* * Similar to proc_getexecutablevnode() but returns NULLVP if the vnode is * being reclaimed rather than blocks until reclaim is done. */ vnode_t proc_getexecutablevnode_noblock(proc_t p) { vnode_t tvp = p->p_textvp; if (tvp != NULLVP) { if (vnode_getwithref_noblock(tvp) == 0) { return tvp; } } return NULLVP; } int proc_gettty(proc_t p, vnode_t *vp) { struct session *procsp; struct pgrp *pg; int err = EINVAL; if (!p || !vp) { return EINVAL; } if ((pg = proc_pgrp(p, &procsp)) != PGRP_NULL) { session_lock(procsp); vnode_t ttyvp = procsp->s_ttyvp; int ttyvid = procsp->s_ttyvid; if (ttyvp) { vnode_hold(ttyvp); } session_unlock(procsp); if (ttyvp) { if (vnode_getwithvid(ttyvp, ttyvid) == 0) { *vp = ttyvp; err = 0; } vnode_drop(ttyvp); } else { err = ENOENT; } pgrp_rele(pg); } return err; } int proc_gettty_dev(proc_t p, dev_t *devp) { struct pgrp *pg; dev_t dev = NODEV; if ((pg = proc_pgrp(p, NULL)) != PGRP_NULL) { dev = os_atomic_load(&pg->pg_session->s_ttydev, relaxed); pgrp_rele(pg); } if (dev == NODEV) { return EINVAL; } *devp = dev; return 0; } int proc_selfexecutableargs(uint8_t *buf, size_t *buflen) { proc_t p = current_proc(); // buflen must always be provided if (buflen == NULL) { return EINVAL; } // If a buf is provided, there must be at least enough room to fit argc if (buf && *buflen < sizeof(p->p_argc)) { return EINVAL; } if (!p->user_stack) { return EINVAL; } if (buf == NULL) { *buflen = p->p_argslen + sizeof(p->p_argc); return 0; } // Copy in argc to the first 4 bytes memcpy(buf, &p->p_argc, sizeof(p->p_argc)); if (*buflen > sizeof(p->p_argc) && p->p_argslen > 0) { // See memory layout comment in kern_exec.c:exec_copyout_strings() // We want to copy starting from `p_argslen` bytes away from top of stack return copyin(p->user_stack - p->p_argslen, buf + sizeof(p->p_argc), MIN(p->p_argslen, *buflen - sizeof(p->p_argc))); } else { return 0; } } off_t proc_getexecutableoffset(proc_t p) { return p->p_textoff; } void bsd_set_dependency_capable(task_t task) { proc_t p = get_bsdtask_info(task); if (p) { OSBitOrAtomic(P_DEPENDENCY_CAPABLE, &p->p_flag); } } #ifndef __arm__ int IS_64BIT_PROCESS(proc_t p) { if (p && (p->p_flag & P_LP64)) { return 1; } else { return 0; } } #endif SMRH_TRAITS_DEFINE_SCALAR(pid_hash_traits, struct proc, p_pid, p_hash, .domain = &smr_proc_task); /* * Locate a process by number */ proc_t phash_find_locked(pid_t pid) { smrh_key_t key = SMRH_SCALAR_KEY(pid); LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); if (!pid) { return kernproc; } return smr_hash_serialized_find(&pid_hash, key, &pid_hash_traits); } void phash_replace_locked(struct proc *old_proc, struct proc *new_proc) { LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); smr_hash_serialized_replace(&pid_hash, &old_proc->p_hash, &new_proc->p_hash, &pid_hash_traits); } void phash_insert_locked(struct proc *p) { LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); smr_hash_serialized_insert(&pid_hash, &p->p_hash, &pid_hash_traits); } void phash_remove_locked(struct proc *p) { LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); smr_hash_serialized_remove(&pid_hash, &p->p_hash, &pid_hash_traits); } proc_t proc_find_noref_smr(int pid) { smrh_key_t key = SMRH_SCALAR_KEY(pid); if (__improbable(pid == 0)) { return kernproc; } return smr_hash_entered_find(&pid_hash, key, &pid_hash_traits); } proc_t proc_find(int pid) { smrh_key_t key = SMRH_SCALAR_KEY(pid); proc_t p; uint32_t bits; bool shadow_proc = false; LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_NOTOWNED); if (!pid) { return proc_ref(kernproc, false); } retry: p = PROC_NULL; bits = 0; shadow_proc = false; smr_proc_task_enter(); p = smr_hash_entered_find(&pid_hash, key, &pid_hash_traits); if (p) { bits = proc_ref_try_fast(p); shadow_proc = !!proc_is_shadow(p); } smr_proc_task_leave(); /* Retry if the proc is a shadow proc */ if (shadow_proc) { if (bits) { proc_rele(p); } goto retry; } if (__improbable(!bits)) { return PROC_NULL; } if (__improbable(proc_ref_needs_wait_for_exec(bits))) { p = proc_ref_wait_for_exec(p, bits, false); /* * Retry if exec was successful since the old proc * would have become a shadow proc and might be in * middle of exiting. */ if (p == PROC_NULL || proc_is_shadow(p)) { if (p != PROC_NULL) { proc_rele(p); } goto retry; } } return p; } proc_t proc_find_locked(int pid) { proc_t p = PROC_NULL; retry: p = phash_find_locked(pid); if (p != PROC_NULL) { uint32_t bits; assert(!proc_is_shadow(p)); bits = proc_ref_try_fast(p); if (__improbable(!bits)) { return PROC_NULL; } if (__improbable(proc_ref_needs_wait_for_exec(bits))) { p = proc_ref_wait_for_exec(p, bits, true); /* * Retry if exec was successful since the old proc * would have become a shadow proc and might be in * middle of exiting. */ if (p == PROC_NULL || proc_is_shadow(p)) { if (p != PROC_NULL) { proc_rele(p); } goto retry; } } } return p; } proc_t proc_findthread(thread_t thread) { proc_t p = PROC_NULL; proc_list_lock(); { p = (proc_t)(get_bsdthreadtask_info(thread)); } p = proc_ref(p, true); proc_list_unlock(); return p; } /* * Determine if the process described by the provided * PID is a zombie */ __private_extern__ bool pzfind(pid_t pid) { bool found = false; /* Enter critical section */ proc_list_lock(); /* Ensure the proc exists and is a zombie */ proc_t p = phash_find_locked(pid); if ((p == PROC_NULL) || !proc_list_exited(p)) { goto out; } found = true; out: /* Exit critical section */ proc_list_unlock(); return found; } /* * Determine if the process described by the provided * uniqueid is a zombie. The same as pzfind but with an * additional uniqueid check. */ __private_extern__ bool pzfind_unique(pid_t pid, uint64_t uniqueid) { bool found = false; /* Enter critical section */ proc_list_lock(); /* Ensure the proc exists and is a zombie */ proc_t p = phash_find_locked(pid); if ((p == PROC_NULL) || !proc_list_exited(p)) { goto out; } if (proc_uniqueid(p) != uniqueid) { goto out; } found = true; out: /* Exit critical section */ proc_list_unlock(); return found; } /* * Acquire a pgrp ref, if and only if the pgrp is non empty. */ static inline bool pg_ref_try(struct pgrp *pgrp) { return os_ref_retain_try_mask(&pgrp->pg_refcount, PGRP_REF_BITS, PGRP_REF_EMPTY, &p_refgrp); } static bool pgrp_hash_obj_try_get(void *pgrp) { return pg_ref_try(pgrp); } /* * Unconditionally acquire a pgrp ref, * regardless of whether the pgrp is empty or not. */ static inline struct pgrp * pg_ref(struct pgrp *pgrp) { os_ref_retain_mask(&pgrp->pg_refcount, PGRP_REF_BITS, &p_refgrp); return pgrp; } SMRH_TRAITS_DEFINE_SCALAR(pgrp_hash_traits, struct pgrp, pg_id, pg_hash, .domain = &smr_proc_task, .obj_try_get = pgrp_hash_obj_try_get); /* * Locate a process group by number */ bool pghash_exists_locked(pid_t pgid) { smrh_key_t key = SMRH_SCALAR_KEY(pgid); LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); return smr_hash_serialized_find(&pgrp_hash, key, &pgrp_hash_traits); } void pghash_insert_locked(struct pgrp *pgrp) { LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); smr_hash_serialized_insert(&pgrp_hash, &pgrp->pg_hash, &pgrp_hash_traits); } static void pghash_remove_locked(struct pgrp *pgrp) { LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); smr_hash_serialized_remove(&pgrp_hash, &pgrp->pg_hash, &pgrp_hash_traits); } struct pgrp * pgrp_find(pid_t pgid) { smrh_key_t key = SMRH_SCALAR_KEY(pgid); LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_NOTOWNED); return smr_hash_get(&pgrp_hash, key, &pgrp_hash_traits); } /* consumes one ref from pgrp */ static void pgrp_add_member(struct pgrp *pgrp, struct proc *parent, struct proc *p) { LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); pgrp_lock(pgrp); if (LIST_EMPTY(&pgrp->pg_members)) { os_atomic_andnot(&pgrp->pg_refcount, PGRP_REF_EMPTY, relaxed); } if (parent != PROC_NULL) { assert(pgrp == smr_serialized_load(&parent->p_pgrp)); } LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist); pgrp_unlock(pgrp); p->p_pgrpid = pgrp->pg_id; p->p_sessionid = pgrp->pg_session->s_sid; smr_serialized_store(&p->p_pgrp, pgrp); } /* returns one ref from pgrp */ static void pgrp_del_member(struct pgrp *pgrp, struct proc *p) { LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); pgrp_lock(pgrp); LIST_REMOVE(p, p_pglist); if (LIST_EMPTY(&pgrp->pg_members)) { os_atomic_or(&pgrp->pg_refcount, PGRP_REF_EMPTY, relaxed); } pgrp_unlock(pgrp); } void pgrp_rele(struct pgrp * pgrp) { if (pgrp == PGRP_NULL) { return; } if (os_ref_release_mask(&pgrp->pg_refcount, PGRP_REF_BITS, &p_refgrp) == 0) { pgrp_destroy(pgrp); } } struct session * session_alloc(proc_t leader) { struct session *sess; sess = zalloc_flags(session_zone, Z_WAITOK | Z_ZERO | Z_NOFAIL); lck_mtx_init(&sess->s_mlock, &proc_mlock_grp, &proc_lck_attr); sess->s_leader = leader; sess->s_sid = proc_getpid(leader); sess->s_ttypgrpid = NO_PID; os_atomic_init(&sess->s_ttydev, NODEV); os_ref_init_mask(&sess->s_refcount, SESSION_REF_BITS, &p_refgrp, S_DEFAULT); return sess; } struct tty * session_set_tty_locked(struct session *sessp, struct tty *tp) { struct tty *old; LCK_MTX_ASSERT(&sessp->s_mlock, LCK_MTX_ASSERT_OWNED); old = sessp->s_ttyp; ttyhold(tp); sessp->s_ttyp = tp; os_atomic_store(&sessp->s_ttydev, tp->t_dev, relaxed); return old; } struct tty * session_clear_tty_locked(struct session *sessp) { struct tty *tp = sessp->s_ttyp; LCK_MTX_ASSERT(&sessp->s_mlock, LCK_MTX_ASSERT_OWNED); sessp->s_ttyvp = NULLVP; sessp->s_ttyvid = 0; sessp->s_ttyp = TTY_NULL; sessp->s_ttypgrpid = NO_PID; os_atomic_store(&sessp->s_ttydev, NODEV, relaxed); return tp; } __attribute__((noinline)) static void session_destroy(struct session *sess) { proc_list_lock(); LIST_REMOVE(sess, s_hash); proc_list_unlock(); /* * Either the TTY was closed, * or proc_exit() destroyed it when the leader went away */ assert(sess->s_ttyp == TTY_NULL); lck_mtx_destroy(&sess->s_mlock, &proc_mlock_grp); zfree(session_zone, sess); } struct session * session_ref(struct session *sess) { os_ref_retain_mask(&sess->s_refcount, SESSION_REF_BITS, &p_refgrp); return sess; } void session_rele(struct session *sess) { if (os_ref_release_mask(&sess->s_refcount, SESSION_REF_BITS, &p_refgrp) == 0) { session_destroy(sess); } } /* * Make a new process ready to become a useful member of society by making it * visible in all the right places and initialize its own lists to empty. * * Parameters: parent The parent of the process to insert * child The child process to insert * in_exec The child process is in exec * * Returns: (void) * * Notes: Insert a child process into the parents children list, assign * the child the parent process pointer and PPID of the parent... */ void pinsertchild(proc_t parent, proc_t child, bool in_exec) { LIST_INIT(&child->p_children); proc_t sibling = parent; /* For exec case, new proc is not a child of old proc, but its replacement */ if (in_exec) { parent = proc_parent(parent); assert(parent != PROC_NULL); /* Copy the ptrace flags from sibling */ proc_lock(sibling); child->p_oppid = sibling->p_oppid; child->p_lflag |= (sibling->p_lflag & (P_LTRACED | P_LSIGEXC | P_LNOATTACH)); proc_unlock(sibling); } proc_list_lock(); child->p_pptr = parent; child->p_ppid = proc_getpid(parent); child->p_puniqueid = proc_uniqueid(parent); child->p_xhighbits = 0; #if CONFIG_MEMORYSTATUS memorystatus_add(child, TRUE); #endif /* If the parent is initproc and p_orig_ppid is not 1, then set reparent flag */ if (in_exec && parent == initproc && proc_original_ppid(child) != 1) { child->p_listflag |= P_LIST_DEADPARENT; } parent->p_childrencnt++; LIST_INSERT_HEAD(&parent->p_children, child, p_sibling); LIST_INSERT_HEAD(&allproc, child, p_list); /* mark the completion of proc creation */ os_atomic_andnot(&child->p_refcount, P_REF_NEW, relaxed); proc_list_unlock(); if (in_exec) { proc_rele(parent); } } /* * Reparent all children of old proc to new proc. * * Parameters: old process Old process. * new process New process. * * Returns: None. */ void p_reparentallchildren(proc_t old_proc, proc_t new_proc) { proc_t child; LIST_INIT(&new_proc->p_children); /* Wait for parent ref to drop */ proc_childdrainstart(old_proc); /* Reparent child from old proc to new proc */ while ((child = old_proc->p_children.lh_first) != NULL) { LIST_REMOVE(child, p_sibling); old_proc->p_childrencnt--; child->p_pptr = new_proc; LIST_INSERT_HEAD(&new_proc->p_children, child, p_sibling); new_proc->p_childrencnt++; } new_proc->si_pid = old_proc->si_pid; new_proc->si_status = old_proc->si_status; new_proc->si_code = old_proc->si_code; new_proc->si_uid = old_proc->si_uid; proc_childdrainend(old_proc); } /* * Move p to a new or existing process group (and session) * * Returns: 0 Success * ESRCH No such process */ int enterpgrp(proc_t p, pid_t pgid, int mksess) { struct pgrp *pgrp; struct pgrp *mypgrp; struct session *procsp; pgrp = pgrp_find(pgid); mypgrp = proc_pgrp(p, &procsp); #if DIAGNOSTIC if (pgrp != NULL && mksess) { /* firewalls */ panic("enterpgrp: setsid into non-empty pgrp"); } if (SESS_LEADER(p, mypgrp->pg_session)) { panic("enterpgrp: session leader attempted setpgrp"); } #endif if (pgrp == PGRP_NULL) { struct session *sess; pid_t savepid = proc_getpid(p); proc_t np = PROC_NULL; /* * new process group */ #if DIAGNOSTIC if (proc_getpid(p) != pgid) { panic("enterpgrp: new pgrp and pid != pgid"); } #endif if ((np = proc_find(savepid)) == NULL || np != p) { if (np != PROC_NULL) { proc_rele(np); } pgrp_rele(mypgrp); return ESRCH; } proc_rele(np); pgrp = pgrp_alloc(pgid, PGRP_REF_EMPTY); if (mksess) { /* * new session */ sess = session_alloc(p); bcopy(mypgrp->pg_session->s_login, sess->s_login, sizeof(sess->s_login)); os_atomic_andnot(&p->p_flag, P_CONTROLT, relaxed); } else { sess = session_ref(procsp); } proc_list_lock(); pgrp->pg_session = sess; p->p_sessionid = sess->s_sid; pghash_insert_locked(pgrp); if (mksess) { LIST_INSERT_HEAD(SESSHASH(sess->s_sid), sess, s_hash); } proc_list_unlock(); } else if (pgrp == mypgrp) { pgrp_rele(pgrp); pgrp_rele(mypgrp); return 0; } /* * Adjust eligibility of affected pgrps to participate in job control. * Increment eligibility counts before decrementing, otherwise we * could reach 0 spuriously during the first call. */ fixjobc(p, pgrp, 1); fixjobc(p, mypgrp, 0); pgrp_rele(mypgrp); pgrp_replace(p, pgrp); return 0; } /* * remove process from process group */ struct pgrp * pgrp_leave_locked(proc_t p) { struct pgrp *pg; LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); pg = smr_serialized_load(&p->p_pgrp); pgrp_del_member(pg, p); p->p_pgrpid = PGRPID_DEAD; smr_clear_store(&p->p_pgrp); return pg; } struct pgrp * pgrp_enter_locked(struct proc *parent, struct proc *child) { struct pgrp *pgrp; LCK_MTX_ASSERT(&proc_list_mlock, LCK_MTX_ASSERT_OWNED); pgrp = pg_ref(smr_serialized_load(&parent->p_pgrp)); pgrp_add_member(pgrp, parent, child); return pgrp; } /* * delete a process group */ static void pgrp_free(smr_node_t node) { struct pgrp *pgrp = __container_of(node, struct pgrp, pg_smr_node); zfree(pgrp_zone, pgrp); } __attribute__((noinline)) static void pgrp_destroy(struct pgrp *pgrp) { struct session *sess; assert(LIST_EMPTY(&pgrp->pg_members)); assert(os_ref_get_raw_mask(&pgrp->pg_refcount) & PGRP_REF_EMPTY); proc_list_lock(); pghash_remove_locked(pgrp); proc_list_unlock(); sess = pgrp->pg_session; pgrp->pg_session = SESSION_NULL; session_rele(sess); lck_mtx_destroy(&pgrp->pg_mlock, &proc_mlock_grp); if (os_ref_release_raw(&pgrp->pg_hashref, &p_refgrp) == 0) { smr_proc_task_call(&pgrp->pg_smr_node, sizeof(*pgrp), pgrp_free); } } /* * Adjust pgrp jobc counters when specified process changes process group. * We count the number of processes in each process group that "qualify" * the group for terminal job control (those with a parent in a different * process group of the same session). If that count reaches zero, the * process group becomes orphaned. Check both the specified process' * process group and that of its children. * entering == 0 => p is leaving specified group. * entering == 1 => p is entering specified group. */ int fixjob_callback(proc_t p, void * arg) { struct fixjob_iterargs *fp; struct pgrp * pg, *hispg; struct session * mysession, *hissess; int entering; fp = (struct fixjob_iterargs *)arg; pg = fp->pg; mysession = fp->mysession; entering = fp->entering; hispg = proc_pgrp(p, &hissess); if (hispg != pg && hissess == mysession) { pgrp_lock(hispg); if (entering) { hispg->pg_jobc++; pgrp_unlock(hispg); } else if (--hispg->pg_jobc == 0) { pgrp_unlock(hispg); orphanpg(hispg); } else { pgrp_unlock(hispg); } } pgrp_rele(hispg); return PROC_RETURNED; } void fixjobc(proc_t p, struct pgrp *pgrp, int entering) { struct pgrp *hispgrp = PGRP_NULL; struct session *hissess = SESSION_NULL; struct session *mysession = pgrp->pg_session; proc_t parent; struct fixjob_iterargs fjarg; boolean_t proc_parent_self; /* * Check if p's parent is current proc, if yes then no need to take * a ref; calling proc_parent with current proc as parent may * deadlock if current proc is exiting. */ proc_parent_self = proc_parent_is_currentproc(p); if (proc_parent_self) { parent = current_proc(); } else { parent = proc_parent(p); } if (parent != PROC_NULL) { hispgrp = proc_pgrp(parent, &hissess); if (!proc_parent_self) { proc_rele(parent); } } /* * Check p's parent to see whether p qualifies its own process * group; if so, adjust count for p's process group. */ if (hispgrp != pgrp && hissess == mysession) { pgrp_lock(pgrp); if (entering) { pgrp->pg_jobc++; pgrp_unlock(pgrp); } else if (--pgrp->pg_jobc == 0) { pgrp_unlock(pgrp); orphanpg(pgrp); } else { pgrp_unlock(pgrp); } } pgrp_rele(hispgrp); /* * Check this process' children to see whether they qualify * their process groups; if so, adjust counts for children's * process groups. */ fjarg.pg = pgrp; fjarg.mysession = mysession; fjarg.entering = entering; proc_childrenwalk(p, fixjob_callback, &fjarg); } /* * The pidlist_* routines support the functions in this file that * walk lists of processes applying filters and callouts to the * elements of the list. * * A prior implementation used a single linear array, which can be * tricky to allocate on large systems. This implementation creates * an SLIST of modestly sized arrays of PIDS_PER_ENTRY elements. * * The array should be sized large enough to keep the overhead of * walking the list low, but small enough that blocking allocations of * pidlist_entry_t structures always succeed. */ #define PIDS_PER_ENTRY 1021 typedef struct pidlist_entry { SLIST_ENTRY(pidlist_entry) pe_link; u_int pe_nused; pid_t pe_pid[PIDS_PER_ENTRY]; } pidlist_entry_t; typedef struct { SLIST_HEAD(, pidlist_entry) pl_head; struct pidlist_entry *pl_active; u_int pl_nalloc; } pidlist_t; static __inline__ pidlist_t * pidlist_init(pidlist_t *pl) { SLIST_INIT(&pl->pl_head); pl->pl_active = NULL; pl->pl_nalloc = 0; return pl; } static u_int pidlist_alloc(pidlist_t *pl, u_int needed) { while (pl->pl_nalloc < needed) { pidlist_entry_t *pe = kalloc_type(pidlist_entry_t, Z_WAITOK | Z_ZERO | Z_NOFAIL); SLIST_INSERT_HEAD(&pl->pl_head, pe, pe_link); pl->pl_nalloc += (sizeof(pe->pe_pid) / sizeof(pe->pe_pid[0])); } return pl->pl_nalloc; } static void pidlist_free(pidlist_t *pl) { pidlist_entry_t *pe; while (NULL != (pe = SLIST_FIRST(&pl->pl_head))) { SLIST_FIRST(&pl->pl_head) = SLIST_NEXT(pe, pe_link); kfree_type(pidlist_entry_t, pe); } pl->pl_nalloc = 0; } static __inline__ void pidlist_set_active(pidlist_t *pl) { pl->pl_active = SLIST_FIRST(&pl->pl_head); assert(pl->pl_active); } static void pidlist_add_pid(pidlist_t *pl, pid_t pid) { pidlist_entry_t *pe = pl->pl_active; if (pe->pe_nused >= sizeof(pe->pe_pid) / sizeof(pe->pe_pid[0])) { if (NULL == (pe = SLIST_NEXT(pe, pe_link))) { panic("pidlist allocation exhausted"); } pl->pl_active = pe; } pe->pe_pid[pe->pe_nused++] = pid; } static __inline__ u_int pidlist_nalloc(const pidlist_t *pl) { return pl->pl_nalloc; } /* * A process group has become orphaned; if there are any stopped processes in * the group, hang-up all process in that group. */ static void orphanpg(struct pgrp *pgrp) { pidlist_t pid_list, *pl = pidlist_init(&pid_list); u_int pid_count_available = 0; proc_t p; /* allocate outside of the pgrp_lock */ for (;;) { pgrp_lock(pgrp); boolean_t should_iterate = FALSE; pid_count_available = 0; PGMEMBERS_FOREACH(pgrp, p) { pid_count_available++; if (p->p_stat == SSTOP) { should_iterate = TRUE; } } if (pid_count_available == 0 || !should_iterate) { pgrp_unlock(pgrp); goto out; /* no orphaned processes OR nothing stopped */ } if (pidlist_nalloc(pl) >= pid_count_available) { break; } pgrp_unlock(pgrp); pidlist_alloc(pl, pid_count_available); } pidlist_set_active(pl); u_int pid_count = 0; PGMEMBERS_FOREACH(pgrp, p) { pidlist_add_pid(pl, proc_pid(p)); if (++pid_count >= pid_count_available) { break; } } pgrp_unlock(pgrp); const pidlist_entry_t *pe; SLIST_FOREACH(pe, &(pl->pl_head), pe_link) { for (u_int i = 0; i < pe->pe_nused; i++) { const pid_t pid = pe->pe_pid[i]; if (0 == pid) { continue; /* skip kernproc */ } p = proc_find(pid); if (!p) { continue; } proc_transwait(p, 0); pt_setrunnable(p); psignal(p, SIGHUP); psignal(p, SIGCONT); proc_rele(p); } } out: pidlist_free(pl); } boolean_t proc_is_translated(proc_t p) { return p && ((p->p_flag & P_TRANSLATED) != 0); } int proc_is_classic(proc_t p __unused) { return 0; } bool proc_is_exotic( proc_t p) { if (p == NULL) { return false; } return task_is_exotic(proc_task(p)); } bool proc_is_alien( proc_t p) { if (p == NULL) { return false; } return task_is_alien(proc_task(p)); } bool proc_is_driver(proc_t p) { if (p == NULL) { return false; } return task_is_driver(proc_task(p)); } bool proc_is_third_party_debuggable_driver(proc_t p) { #if XNU_TARGET_OS_IOS uint64_t csflags; if (proc_csflags(p, &csflags) != 0) { return false; } if (proc_is_driver(p) && !csproc_get_platform_binary(p) && IOTaskHasEntitlement(proc_task(p), kIODriverKitEntitlementKey) && (csflags & CS_GET_TASK_ALLOW) != 0) { return true; } return false; #else /* On other platforms, fall back to existing rules for debugging */ (void)p; return false; #endif /* XNU_TARGET_OS_IOS */ } /* XXX Why does this function exist? Need to kill it off... */ proc_t current_proc_EXTERNAL(void) { return current_proc(); } int proc_is_forcing_hfs_case_sensitivity(proc_t p) { return (p->p_vfs_iopolicy & P_VFS_IOPOLICY_FORCE_HFS_CASE_SENSITIVITY) ? 1 : 0; } bool proc_ignores_content_protection(proc_t p) { return os_atomic_load(&p->p_vfs_iopolicy, relaxed) & P_VFS_IOPOLICY_IGNORE_CONTENT_PROTECTION; } bool proc_ignores_node_permissions(proc_t p) { return os_atomic_load(&p->p_vfs_iopolicy, relaxed) & P_VFS_IOPOLICY_IGNORE_NODE_PERMISSIONS; } bool proc_skip_mtime_update(proc_t p) { struct uthread *ut = NULL; /* * We only check the thread's policy if the current proc matches the given * proc. */ if (current_proc() == p) { ut = get_bsdthread_info(current_thread()); } if (ut && (os_atomic_load(&ut->uu_flag, relaxed) & UT_SKIP_MTIME_UPDATE)) { return true; } /* * If the 'UT_SKIP_MTIME_UPDATE_IGNORE' policy is set for this thread then * we override the default behavior and ignore the process's mtime update * policy. */ if (ut && (os_atomic_load(&ut->uu_flag, relaxed) & UT_SKIP_MTIME_UPDATE_IGNORE)) { return false; } if (p && (os_atomic_load(&p->p_vfs_iopolicy, relaxed) & P_VFS_IOPOLICY_SKIP_MTIME_UPDATE)) { return true; } return false; } bool proc_support_long_paths(proc_t p) { struct uthread *ut = NULL; /* * We only check the thread's policy if the current proc matches the given * proc. */ if (current_proc() == p) { ut = get_bsdthread_info(current_thread()); } if (ut != NULL && (os_atomic_load(&ut->uu_flag, relaxed) & UT_SUPPORT_LONG_PATHS)) { return true; } if (p && (os_atomic_load(&p->p_vfs_iopolicy, relaxed) & P_VFS_IOPOLICY_SUPPORT_LONG_PATHS)) { return true; } return false; } bool proc_allow_low_space_writes(proc_t p) { return os_atomic_load(&p->p_vfs_iopolicy, relaxed) & P_VFS_IOPOLICY_ALLOW_LOW_SPACE_WRITES; } bool proc_disallow_rw_for_o_evtonly(proc_t p) { return os_atomic_load(&p->p_vfs_iopolicy, relaxed) & P_VFS_IOPOLICY_DISALLOW_RW_FOR_O_EVTONLY; } bool proc_use_alternative_symlink_ea(proc_t p) { return os_atomic_load(&p->p_vfs_iopolicy, relaxed) & P_VFS_IOPOLICY_ALTLINK; } bool proc_is_rsr(proc_t p) { return os_atomic_load(&p->p_ladvflag, relaxed) & P_RSR; } #if CONFIG_COREDUMP || CONFIG_UCOREDUMP /* * proc_core_name(format, name, uid, pid) * Expand the name described in format, using name, uid, and pid. * format is a printf-like string, with four format specifiers: * %N name of process ("name") * %P process id (pid) * %U user id (uid) * %T mach_continuous_time() timestamp * For example, "%N.core" is the default; they can be disabled completely * by using "/dev/null", or all core files can be stored in "/cores/%U/%N-%P". * This is controlled by the sysctl variable kern.corefile (see above). */ __private_extern__ int proc_core_name(const char *format, const char * name, uid_t uid, pid_t pid, char *cf_name, size_t cf_name_len) { const char *appendstr; char id_buf[sizeof(OS_STRINGIFY(INT32_MAX))]; /* Buffer for pid/uid -- max 4B */ _Static_assert(sizeof(id_buf) == 11, "size mismatch"); char timestamp_buf[sizeof(OS_STRINGIFY(UINT64_MAX))]; /* Buffer for timestamp, including null terminator */ clock_sec_t secs = 0; _Static_assert(sizeof(clock_sec_t) <= sizeof(uint64_t), "size mismatch"); clock_usec_t microsecs = 0; size_t i, l, n; if (cf_name == NULL) { goto toolong; } for (i = 0, n = 0; n < cf_name_len && format[i]; i++) { switch (format[i]) { case '%': /* Format character */ i++; switch (format[i]) { case '%': appendstr = "%"; break; case 'N': /* process name */ appendstr = name; break; case 'P': /* process id */ snprintf(id_buf, sizeof(id_buf), "%u", pid); appendstr = id_buf; break; case 'U': /* user id */ snprintf(id_buf, sizeof(id_buf), "%u", uid); appendstr = id_buf; break; case 'T': /* MCT timestamp */ snprintf(timestamp_buf, sizeof(timestamp_buf), "%llu", mach_continuous_time()); appendstr = timestamp_buf; break; case 't': /* Unix timestamp */ clock_gettimeofday(&secs, µsecs); snprintf(timestamp_buf, sizeof(timestamp_buf), "%lu", secs); appendstr = timestamp_buf; break; case '\0': /* format string ended in % symbol */ goto endofstring; default: appendstr = ""; log(LOG_ERR, "Unknown format character %c in `%s'\n", format[i], format); } l = strlen(appendstr); if ((n + l) >= cf_name_len) { goto toolong; } bcopy(appendstr, cf_name + n, l); n += l; break; default: cf_name[n++] = format[i]; } } if (format[i] != '\0') { goto toolong; } return 0; toolong: log(LOG_ERR, "pid %ld (%s), uid (%u): corename is too long\n", (long)pid, name, (uint32_t)uid); return 1; endofstring: log(LOG_ERR, "pid %ld (%s), uid (%u): unexpected end of string after %% token\n", (long)pid, name, (uint32_t)uid); return 1; } #endif /* CONFIG_COREDUMP || CONFIG_UCOREDUMP */ /* Code Signing related routines */ int csops(__unused proc_t p, struct csops_args *uap, __unused int32_t *retval) { return csops_internal(uap->pid, uap->ops, uap->useraddr, uap->usersize, USER_ADDR_NULL); } int csops_audittoken(__unused proc_t p, struct csops_audittoken_args *uap, __unused int32_t *retval) { if (uap->uaudittoken == USER_ADDR_NULL) { return EINVAL; } return csops_internal(uap->pid, uap->ops, uap->useraddr, uap->usersize, uap->uaudittoken); } static int csops_copy_token(const void *start, size_t length, user_size_t usize, user_addr_t uaddr) { char fakeheader[8] = { 0 }; int error; if (usize < sizeof(fakeheader)) { return ERANGE; } /* if no blob, fill in zero header */ if (NULL == start) { start = fakeheader; length = sizeof(fakeheader); } else if (usize < length) { /* ... if input too short, copy out length of entitlement */ uint32_t length32 = htonl((uint32_t)length); memcpy(&fakeheader[4], &length32, sizeof(length32)); error = copyout(fakeheader, uaddr, sizeof(fakeheader)); if (error == 0) { return ERANGE; /* input buffer to short, ERANGE signals that */ } return error; } return copyout(start, uaddr, length); } static int csops_internal(pid_t pid, int ops, user_addr_t uaddr, user_size_t usersize, user_addr_t uaudittoken) { size_t usize = (size_t)CAST_DOWN(size_t, usersize); proc_t pt; int forself; int error; vnode_t tvp; off_t toff; csops_cdhash_t cdhash_info = {0}; audit_token_t token; unsigned int upid = 0, uidversion = 0; bool mark_invalid_allowed = false; forself = error = 0; if (pid == 0) { pid = proc_selfpid(); } if (pid == proc_selfpid()) { forself = 1; mark_invalid_allowed = true; } switch (ops) { case CS_OPS_STATUS: case CS_OPS_CDHASH: case CS_OPS_CDHASH_WITH_INFO: case CS_OPS_PIDOFFSET: case CS_OPS_ENTITLEMENTS_BLOB: case CS_OPS_DER_ENTITLEMENTS_BLOB: case CS_OPS_IDENTITY: case CS_OPS_BLOB: case CS_OPS_TEAMID: case CS_OPS_CLEAR_LV: case CS_OPS_VALIDATION_CATEGORY: break; /* not restricted to root */ default: if (forself == 0 && kauth_cred_issuser(kauth_cred_get()) != TRUE) { return EPERM; } break; } pt = proc_find(pid); if (pt == PROC_NULL) { return ESRCH; } upid = proc_getpid(pt); uidversion = proc_pidversion(pt); if (uaudittoken != USER_ADDR_NULL) { error = copyin(uaudittoken, &token, sizeof(audit_token_t)); if (error != 0) { goto out; } /* verify the audit token pid/idversion matches with proc */ if ((token.val[5] != upid) || (token.val[7] != uidversion)) { error = ESRCH; goto out; } } #if CONFIG_MACF switch (ops) { case CS_OPS_MARKINVALID: case CS_OPS_MARKHARD: case CS_OPS_MARKKILL: case CS_OPS_MARKRESTRICT: case CS_OPS_SET_STATUS: case CS_OPS_CLEARINSTALLER: case CS_OPS_CLEARPLATFORM: case CS_OPS_CLEAR_LV: if ((error = mac_proc_check_set_cs_info(current_proc(), pt, ops))) { goto out; } break; default: if ((error = mac_proc_check_get_cs_info(current_proc(), pt, ops))) { goto out; } } #endif switch (ops) { case CS_OPS_STATUS: { uint32_t retflags; proc_lock(pt); retflags = (uint32_t)proc_getcsflags(pt); if (cs_process_enforcement(pt)) { retflags |= CS_ENFORCEMENT; } if (csproc_get_platform_binary(pt)) { retflags |= CS_PLATFORM_BINARY; } if (csproc_get_platform_path(pt)) { retflags |= CS_PLATFORM_PATH; } //Don't return CS_REQUIRE_LV if we turned it on with CS_FORCED_LV but still report CS_FORCED_LV if ((proc_getcsflags(pt) & CS_FORCED_LV) == CS_FORCED_LV) { retflags &= (~CS_REQUIRE_LV); } proc_unlock(pt); if (uaddr != USER_ADDR_NULL) { error = copyout(&retflags, uaddr, sizeof(uint32_t)); } break; } case CS_OPS_MARKINVALID: if (mark_invalid_allowed == false) { error = EPERM; goto out; } proc_lock(pt); if ((proc_getcsflags(pt) & CS_VALID) == CS_VALID) { /* is currently valid */ proc_csflags_clear(pt, CS_VALID); /* set invalid */ cs_process_invalidated(pt); if ((proc_getcsflags(pt) & CS_KILL) == CS_KILL) { proc_csflags_set(pt, CS_KILLED); proc_unlock(pt); if (cs_debug) { printf("CODE SIGNING: marked invalid by pid %d: " "p=%d[%s] honoring CS_KILL, final status 0x%x\n", proc_selfpid(), proc_getpid(pt), pt->p_comm, (unsigned int)proc_getcsflags(pt)); } psignal(pt, SIGKILL); } else { proc_unlock(pt); } } else { proc_unlock(pt); } break; case CS_OPS_MARKHARD: proc_lock(pt); proc_csflags_set(pt, CS_HARD); if ((proc_getcsflags(pt) & CS_VALID) == 0) { /* @@@ allow? reject? kill? @@@ */ proc_unlock(pt); error = EINVAL; goto out; } else { proc_unlock(pt); } break; case CS_OPS_MARKKILL: proc_lock(pt); proc_csflags_set(pt, CS_KILL); if ((proc_getcsflags(pt) & CS_VALID) == 0) { proc_unlock(pt); psignal(pt, SIGKILL); } else { proc_unlock(pt); } break; case CS_OPS_PIDOFFSET: toff = pt->p_textoff; proc_rele(pt); error = copyout(&toff, uaddr, sizeof(toff)); return error; case CS_OPS_CDHASH: /* pt already holds a reference on its p_textvp */ tvp = pt->p_textvp; toff = pt->p_textoff; if (tvp == NULLVP || usize != sizeof(cdhash_info.hash)) { proc_rele(pt); return EINVAL; } error = vn_getcdhash(tvp, toff, cdhash_info.hash, &cdhash_info.type); proc_rele(pt); if (error == 0) { error = copyout(cdhash_info.hash, uaddr, sizeof(cdhash_info.hash)); } return error; case CS_OPS_CDHASH_WITH_INFO: /* pt already holds a reference on its p_textvp */ tvp = pt->p_textvp; toff = pt->p_textoff; if (tvp == NULLVP || usize != sizeof(csops_cdhash_t)) { proc_rele(pt); return EINVAL; } error = vn_getcdhash(tvp, toff, cdhash_info.hash, &cdhash_info.type); proc_rele(pt); if (error == 0) { error = copyout(&cdhash_info, uaddr, sizeof(cdhash_info)); } return error; case CS_OPS_ENTITLEMENTS_BLOB: { void *start; size_t length; struct cs_blob* blob; proc_lock(pt); if ((proc_getcsflags(pt) & (CS_VALID | CS_DEBUGGED)) == 0) { proc_unlock(pt); error = EINVAL; goto out; } blob = csproc_get_blob(pt); proc_unlock(pt); if (!blob) { error = EBADEXEC; goto out; } void* osent = csblob_os_entitlements_get(blob); if (!osent) { goto out; } CS_GenericBlob* xmlblob = NULL; if (amfi->OSEntitlements_get_xml(osent, &xmlblob)) { start = (void*)xmlblob; length = (size_t)ntohl(xmlblob->length); } else { goto out; } error = csops_copy_token(start, length, usize, uaddr); kfree_data(start, length); goto out; } case CS_OPS_DER_ENTITLEMENTS_BLOB: { const void *start; size_t length; struct cs_blob* blob; proc_lock(pt); if ((proc_getcsflags(pt) & (CS_VALID | CS_DEBUGGED)) == 0) { proc_unlock(pt); error = EINVAL; goto out; } blob = csproc_get_blob(pt); proc_unlock(pt); if (!blob) { error = EBADEXEC; goto out; } error = csblob_get_der_entitlements(blob, (const CS_GenericBlob **)&start, &length); if (error || start == NULL) { if (amfi && csblob_os_entitlements_get(blob)) { void* osent = csblob_os_entitlements_get(blob); const CS_GenericBlob* transmuted = NULL; if (amfi->OSEntitlements_get_transmuted(osent, &transmuted)) { start = transmuted; length = (size_t)ntohl(transmuted->length); } else { goto out; } } else { goto out; } } error = csops_copy_token(start, length, usize, uaddr); goto out; } case CS_OPS_VALIDATION_CATEGORY: { unsigned int validation_category = CS_VALIDATION_CATEGORY_INVALID; error = csproc_get_validation_category(pt, &validation_category); if (error) { goto out; } error = copyout(&validation_category, uaddr, sizeof(validation_category)); break; } case CS_OPS_MARKRESTRICT: proc_lock(pt); proc_csflags_set(pt, CS_RESTRICT); proc_unlock(pt); break; case CS_OPS_SET_STATUS: { uint32_t flags; if (usize < sizeof(flags)) { error = ERANGE; break; } error = copyin(uaddr, &flags, sizeof(flags)); if (error) { break; } /* only allow setting a subset of all code sign flags */ flags &= CS_HARD | CS_EXEC_SET_HARD | CS_KILL | CS_EXEC_SET_KILL | CS_RESTRICT | CS_REQUIRE_LV | CS_ENFORCEMENT | CS_EXEC_SET_ENFORCEMENT; proc_lock(pt); if (proc_getcsflags(pt) & CS_VALID) { if ((flags & CS_ENFORCEMENT) && !(proc_getcsflags(pt) & CS_ENFORCEMENT)) { vm_map_cs_enforcement_set(get_task_map(proc_task(pt)), TRUE); } proc_csflags_set(pt, flags); } else { error = EINVAL; } proc_unlock(pt); break; } case CS_OPS_CLEAR_LV: { /* * This option is used to remove library validation from * a running process. This is used in plugin architectures * when a program needs to load untrusted libraries. This * allows the process to maintain library validation as * long as possible, then drop it only when required. * Once a process has loaded the untrusted library, * relying on library validation in the future will * not be effective. An alternative is to re-exec * your application without library validation, or * fork an untrusted child. */ #if !defined(XNU_TARGET_OS_OSX) // We only support dropping library validation on macOS error = ENOTSUP; #else /* * if we have the flag set, and the caller wants * to remove it, and they're entitled to, then * we remove it from the csflags * * NOTE: We are fine to poke into the task because * we get a ref to pt when we do the proc_find * at the beginning of this function. * * We also only allow altering ourselves. */ if (forself == 1 && IOTaskHasEntitlement(proc_task(pt), CLEAR_LV_ENTITLEMENT)) { proc_lock(pt); if (!(proc_getcsflags(pt) & CS_INSTALLER) && (pt->p_subsystem_root_path == NULL)) { proc_csflags_clear(pt, CS_REQUIRE_LV | CS_FORCED_LV); error = 0; } else { error = EPERM; } proc_unlock(pt); } else { error = EPERM; } #endif break; } case CS_OPS_BLOB: { void *start; size_t length; proc_lock(pt); if ((proc_getcsflags(pt) & (CS_VALID | CS_DEBUGGED)) == 0) { proc_unlock(pt); error = EINVAL; break; } proc_unlock(pt); // Don't need to lock here as not accessing CSFLAGS error = cs_blob_get(pt, &start, &length); if (error) { goto out; } error = csops_copy_token(start, length, usize, uaddr); goto out; } case CS_OPS_IDENTITY: case CS_OPS_TEAMID: { const char *identity; uint8_t fakeheader[8]; uint32_t idlen; size_t length; /* * Make identity have a blob header to make it * easier on userland to guess the identity * length. */ if (usize < sizeof(fakeheader)) { error = ERANGE; break; } memset(fakeheader, 0, sizeof(fakeheader)); proc_lock(pt); if ((proc_getcsflags(pt) & (CS_VALID | CS_DEBUGGED)) == 0) { proc_unlock(pt); error = EINVAL; break; } identity = ops == CS_OPS_TEAMID ? csproc_get_teamid(pt) : cs_identity_get(pt); proc_unlock(pt); if (identity == NULL) { error = ENOENT; goto out; } length = strlen(identity) + 1; /* include NUL */ idlen = htonl((uint32_t)(length + sizeof(fakeheader))); memcpy(&fakeheader[4], &idlen, sizeof(idlen)); error = copyout(fakeheader, uaddr, sizeof(fakeheader)); if (error) { goto out; } if (usize < sizeof(fakeheader) + length) { error = ERANGE; } else if (usize > sizeof(fakeheader)) { error = copyout(identity, uaddr + sizeof(fakeheader), length); } goto out; } case CS_OPS_CLEARINSTALLER: /* * Only allow clearing CS_INSTALLER if: * 1. The caller is clearing its own CS_INSTALLER flag, OR * 2. The caller itself has CS_INSTALLER privilege * * This prevents a non-CS_INSTALLER process from removing * CS_INSTALLER from another process, which could lead to * confused deputy vulnerabilities (rdar://128685712). */ if (!forself) { /* * Check if current process has CS_INSTALLER. */ proc_t curproc = current_proc(); if ((proc_getcsflags(curproc) & CS_INSTALLER) == 0) { error = EPERM; goto out; } } proc_lock(pt); proc_csflags_clear(pt, CS_INSTALLER | CS_DATAVAULT_CONTROLLER | CS_EXEC_INHERIT_SIP); proc_unlock(pt); break; case CS_OPS_CLEARPLATFORM: #if DEVELOPMENT || DEBUG if (cs_process_global_enforcement()) { error = ENOTSUP; break; } #if CONFIG_CSR if (csr_check(CSR_ALLOW_APPLE_INTERNAL) != 0) { error = ENOTSUP; break; } #endif /* CONFIG_CSR */ proc_lock(pt); proc_csflags_clear(pt, CS_PLATFORM_BINARY | CS_PLATFORM_PATH); csproc_clear_platform_binary(pt); proc_unlock(pt); break; #else /* DEVELOPMENT || DEBUG */ error = ENOTSUP; break; #endif /* !DEVELOPMENT || DEBUG */ default: error = EINVAL; break; } out: proc_rele(pt); return error; } void proc_iterate( unsigned int flags, proc_iterate_fn_t callout, void *arg, proc_iterate_fn_t filterfn, void *filterarg) { pidlist_t pid_list, *pl = pidlist_init(&pid_list); u_int pid_count_available = 0; assert(callout != NULL); /* allocate outside of the proc_list_lock */ for (;;) { proc_list_lock(); pid_count_available = nprocs + 1; /* kernel_task not counted in nprocs */ assert(pid_count_available > 0); if (pidlist_nalloc(pl) >= pid_count_available) { break; } proc_list_unlock(); pidlist_alloc(pl, pid_count_available); } pidlist_set_active(pl); /* filter pids into the pid_list */ u_int pid_count = 0; if (flags & PROC_ALLPROCLIST) { proc_t p; ALLPROC_FOREACH(p) { /* ignore processes that are being forked */ if (p->p_stat == SIDL || proc_is_shadow(p)) { continue; } if ((filterfn != NULL) && (filterfn(p, filterarg) == 0)) { continue; } pidlist_add_pid(pl, proc_pid(p)); if (++pid_count >= pid_count_available) { break; } } } if ((pid_count < pid_count_available) && (flags & PROC_ZOMBPROCLIST)) { proc_t p; ZOMBPROC_FOREACH(p) { if (proc_is_shadow(p)) { continue; } if ((filterfn != NULL) && (filterfn(p, filterarg) == 0)) { continue; } pidlist_add_pid(pl, proc_pid(p)); if (++pid_count >= pid_count_available) { break; } } } proc_list_unlock(); /* call callout on processes in the pid_list */ const pidlist_entry_t *pe; SLIST_FOREACH(pe, &(pl->pl_head), pe_link) { for (u_int i = 0; i < pe->pe_nused; i++) { const pid_t pid = pe->pe_pid[i]; proc_t p = proc_find(pid); if (p) { if ((flags & PROC_NOWAITTRANS) == 0) { proc_transwait(p, 0); } const int callout_ret = callout(p, arg); switch (callout_ret) { case PROC_RETURNED_DONE: proc_rele(p); OS_FALLTHROUGH; case PROC_CLAIMED_DONE: goto out; case PROC_RETURNED: proc_rele(p); OS_FALLTHROUGH; case PROC_CLAIMED: break; default: panic("%s: callout =%d for pid %d", __func__, callout_ret, pid); break; } } else if (flags & PROC_ZOMBPROCLIST) { p = proc_find_zombref(pid); if (!p) { continue; } const int callout_ret = callout(p, arg); switch (callout_ret) { case PROC_RETURNED_DONE: proc_drop_zombref(p); OS_FALLTHROUGH; case PROC_CLAIMED_DONE: goto out; case PROC_RETURNED: proc_drop_zombref(p); OS_FALLTHROUGH; case PROC_CLAIMED: break; default: panic("%s: callout =%d for zombie %d", __func__, callout_ret, pid); break; } } } } out: pidlist_free(pl); } void proc_rebootscan( proc_iterate_fn_t callout, void *arg, proc_iterate_fn_t filterfn, void *filterarg) { proc_t p; assert(callout != NULL); proc_shutdown_exitcount = 0; restart_foreach: proc_list_lock(); ALLPROC_FOREACH(p) { if ((filterfn != NULL) && filterfn(p, filterarg) == 0) { continue; } p = proc_ref(p, true); if (!p) { proc_list_unlock(); goto restart_foreach; } proc_list_unlock(); proc_transwait(p, 0); (void)callout(p, arg); proc_rele(p); goto restart_foreach; } proc_list_unlock(); } void proc_childrenwalk( proc_t parent, proc_iterate_fn_t callout, void *arg) { pidlist_t pid_list, *pl = pidlist_init(&pid_list); u_int pid_count_available = 0; assert(parent != NULL); assert(callout != NULL); for (;;) { proc_list_lock(); pid_count_available = parent->p_childrencnt; if (pid_count_available == 0) { proc_list_unlock(); goto out; } if (pidlist_nalloc(pl) >= pid_count_available) { break; } proc_list_unlock(); pidlist_alloc(pl, pid_count_available); } pidlist_set_active(pl); u_int pid_count = 0; proc_t p; PCHILDREN_FOREACH(parent, p) { if (p->p_stat == SIDL || proc_is_shadow(p)) { continue; } pidlist_add_pid(pl, proc_pid(p)); if (++pid_count >= pid_count_available) { break; } } proc_list_unlock(); const pidlist_entry_t *pe; SLIST_FOREACH(pe, &(pl->pl_head), pe_link) { for (u_int i = 0; i < pe->pe_nused; i++) { const pid_t pid = pe->pe_pid[i]; p = proc_find(pid); if (!p) { continue; } const int callout_ret = callout(p, arg); switch (callout_ret) { case PROC_RETURNED_DONE: proc_rele(p); OS_FALLTHROUGH; case PROC_CLAIMED_DONE: goto out; case PROC_RETURNED: proc_rele(p); OS_FALLTHROUGH; case PROC_CLAIMED: break; default: panic("%s: callout =%d for pid %d", __func__, callout_ret, pid); break; } } } out: pidlist_free(pl); } void pgrp_iterate( struct pgrp *pgrp, proc_iterate_fn_t callout, void * arg, bool (^filterfn)(proc_t)) { pidlist_t pid_list, *pl = pidlist_init(&pid_list); u_int pid_count_available = 0; proc_t p; assert(pgrp != NULL); assert(callout != NULL); for (;;) { pgrp_lock(pgrp); /* * each member has one ref + some transient holders, * this is a good enough approximation */ pid_count_available = os_ref_get_count_mask(&pgrp->pg_refcount, PGRP_REF_BITS); if (pidlist_nalloc(pl) >= pid_count_available) { break; } pgrp_unlock(pgrp); pidlist_alloc(pl, pid_count_available); } pidlist_set_active(pl); const pid_t pgid = pgrp->pg_id; u_int pid_count = 0; PGMEMBERS_FOREACH(pgrp, p) { if ((filterfn != NULL) && (filterfn(p) == 0)) { continue; } pidlist_add_pid(pl, proc_pid(p)); if (++pid_count >= pid_count_available) { break; } } pgrp_unlock(pgrp); const pidlist_entry_t *pe; SLIST_FOREACH(pe, &(pl->pl_head), pe_link) { for (u_int i = 0; i < pe->pe_nused; i++) { const pid_t pid = pe->pe_pid[i]; if (0 == pid) { continue; /* skip kernproc */ } p = proc_find(pid); if (!p) { continue; } if (p->p_pgrpid != pgid) { proc_rele(p); continue; } const int callout_ret = callout(p, arg); switch (callout_ret) { case PROC_RETURNED: proc_rele(p); OS_FALLTHROUGH; case PROC_CLAIMED: break; case PROC_RETURNED_DONE: proc_rele(p); OS_FALLTHROUGH; case PROC_CLAIMED_DONE: goto out; default: panic("%s: callout =%d for pid %d", __func__, callout_ret, pid); } } } out: pidlist_free(pl); } /* consumes the newpg ref */ static void pgrp_replace(struct proc *p, struct pgrp *newpg) { struct pgrp *oldpg; proc_list_lock(); oldpg = smr_serialized_load(&p->p_pgrp); pgrp_del_member(oldpg, p); pgrp_add_member(newpg, PROC_NULL, p); proc_list_unlock(); pgrp_rele(oldpg); } struct pgrp * pgrp_alloc(pid_t pgid, pggrp_ref_bits_t bits) { struct pgrp *pgrp = zalloc_flags(pgrp_zone, Z_WAITOK | Z_ZERO | Z_NOFAIL); os_ref_init_mask(&pgrp->pg_refcount, PGRP_REF_BITS, &p_refgrp, bits); os_ref_init_raw(&pgrp->pg_hashref, &p_refgrp); LIST_INIT(&pgrp->pg_members); lck_mtx_init(&pgrp->pg_mlock, &proc_mlock_grp, &proc_lck_attr); pgrp->pg_id = pgid; return pgrp; } void pgrp_lock(struct pgrp * pgrp) { lck_mtx_lock(&pgrp->pg_mlock); } void pgrp_unlock(struct pgrp * pgrp) { lck_mtx_unlock(&pgrp->pg_mlock); } struct session * session_find_locked(pid_t sessid) { struct session *sess; LIST_FOREACH(sess, SESSHASH(sessid), s_hash) { if (sess->s_sid == sessid) { break; } } return sess; } void session_replace_leader(struct proc *old_proc, struct proc *new_proc) { assert(old_proc == current_proc()); /* If old_proc is session leader, change the leader to new proc */ struct pgrp *pgrp = smr_serialized_load(&old_proc->p_pgrp); struct session *sessp = pgrp->pg_session; struct tty *ttyp = TTY_NULL; if (sessp == SESSION_NULL || !SESS_LEADER(old_proc, sessp)) { return; } session_lock(sessp); if (sessp->s_ttyp && sessp->s_ttyp->t_session == sessp) { ttyp = sessp->s_ttyp; ttyhold(ttyp); } /* Do the dance to take tty lock and session lock */ if (ttyp) { session_unlock(sessp); tty_lock(ttyp); session_lock(sessp); } sessp->s_leader = new_proc; session_unlock(sessp); if (ttyp) { tty_unlock(ttyp); ttyfree(ttyp); } } void session_lock(struct session * sess) { lck_mtx_lock(&sess->s_mlock); } void session_unlock(struct session * sess) { lck_mtx_unlock(&sess->s_mlock); } struct pgrp * proc_pgrp(proc_t p, struct session **sessp) { struct pgrp *pgrp = PGRP_NULL; bool success = false; if (__probable(p != PROC_NULL)) { smr_proc_task_enter(); pgrp = smr_entered_load(&p->p_pgrp); success = pgrp == PGRP_NULL || pg_ref_try(pgrp); smr_proc_task_leave(); if (__improbable(!success)) { /* * We caught the process in the middle of pgrp_replace(), * go the slow, never failing way. */ proc_list_lock(); pgrp = pg_ref(smr_serialized_load(&p->p_pgrp)); proc_list_unlock(); } } if (sessp) { *sessp = pgrp ? pgrp->pg_session : SESSION_NULL; } return pgrp; } struct pgrp * tty_pgrp_locked(struct tty *tp) { struct pgrp *pg = PGRP_NULL; /* either the tty_lock() or the proc_list_lock() must be held */ if (tp->t_pgrp) { pg = pg_ref(tp->t_pgrp); } return pg; } int proc_transstart(proc_t p, int locked, int non_blocking) { if (locked == 0) { proc_lock(p); } while ((p->p_lflag & P_LINTRANSIT) == P_LINTRANSIT) { if (((p->p_lflag & P_LTRANSCOMMIT) == P_LTRANSCOMMIT) || non_blocking) { if (locked == 0) { proc_unlock(p); } return EDEADLK; } p->p_lflag |= P_LTRANSWAIT; msleep(&p->p_lflag, &p->p_mlock, 0, "proc_signstart", NULL); } p->p_lflag |= P_LINTRANSIT; p->p_transholder = current_thread(); if (locked == 0) { proc_unlock(p); } return 0; } void proc_transcommit(proc_t p, int locked) { if (locked == 0) { proc_lock(p); } assert((p->p_lflag & P_LINTRANSIT) == P_LINTRANSIT); assert(p->p_transholder == current_thread()); p->p_lflag |= P_LTRANSCOMMIT; if ((p->p_lflag & P_LTRANSWAIT) == P_LTRANSWAIT) { p->p_lflag &= ~P_LTRANSWAIT; wakeup(&p->p_lflag); } if (locked == 0) { proc_unlock(p); } } void proc_transend(proc_t p, int locked) { if (locked == 0) { proc_lock(p); } p->p_lflag &= ~(P_LINTRANSIT | P_LTRANSCOMMIT); p->p_transholder = NULL; if ((p->p_lflag & P_LTRANSWAIT) == P_LTRANSWAIT) { p->p_lflag &= ~P_LTRANSWAIT; wakeup(&p->p_lflag); } if (locked == 0) { proc_unlock(p); } } int proc_transwait(proc_t p, int locked) { if (locked == 0) { proc_lock(p); } while ((p->p_lflag & P_LINTRANSIT) == P_LINTRANSIT) { if ((p->p_lflag & P_LTRANSCOMMIT) == P_LTRANSCOMMIT && current_proc() == p) { if (locked == 0) { proc_unlock(p); } return EDEADLK; } p->p_lflag |= P_LTRANSWAIT; msleep(&p->p_lflag, &p->p_mlock, 0, "proc_signstart", NULL); } if (locked == 0) { proc_unlock(p); } return 0; } void proc_klist_lock(void) { lck_mtx_lock(&proc_klist_mlock); } void proc_klist_unlock(void) { lck_mtx_unlock(&proc_klist_mlock); } void proc_knote(struct proc * p, long hint) { proc_klist_lock(); KNOTE(&p->p_klist, hint); proc_klist_unlock(); } void proc_transfer_knotes(struct proc *old_proc, struct proc *new_proc) { struct knote *kn = NULL; proc_klist_lock(); while ((kn = SLIST_FIRST(&old_proc->p_klist))) { KNOTE_DETACH(&old_proc->p_klist, kn); if (kn->kn_filtid == (uint8_t)~EVFILT_PROC) { kn->kn_proc = new_proc; KNOTE_ATTACH(&new_proc->p_klist, kn); } else { assert(kn->kn_filtid == (uint8_t)~EVFILT_SIGNAL); kn->kn_proc = NULL; } } proc_klist_unlock(); } void proc_knote_drain(struct proc *p) { struct knote *kn = NULL; /* * Clear the proc's klist to avoid references after the proc is reaped. */ proc_klist_lock(); while ((kn = SLIST_FIRST(&p->p_klist))) { kn->kn_proc = PROC_NULL; KNOTE_DETACH(&p->p_klist, kn); } proc_klist_unlock(); } void proc_setregister(proc_t p) { proc_lock(p); p->p_lflag |= P_LREGISTER; proc_unlock(p); } void proc_resetregister(proc_t p) { proc_lock(p); p->p_lflag &= ~P_LREGISTER; proc_unlock(p); } bool proc_get_pthread_jit_allowlist(proc_t p, bool *late_out) { bool ret = false; proc_lock(p); ret = (p->p_lflag & P_LPTHREADJITALLOWLIST); *late_out = (p->p_lflag & P_LPTHREADJITFREEZELATE); proc_unlock(p); return ret; } void proc_set_pthread_jit_allowlist(proc_t p, bool late) { proc_lock(p); p->p_lflag |= P_LPTHREADJITALLOWLIST; if (late) { p->p_lflag |= P_LPTHREADJITFREEZELATE; } proc_unlock(p); } pid_t proc_pgrpid(proc_t p) { return p->p_pgrpid; } pid_t proc_sessionid(proc_t p) { return p->p_sessionid; } pid_t proc_selfpgrpid() { return current_proc()->p_pgrpid; } /* return control and action states */ int proc_getpcontrol(int pid, int * pcontrolp) { proc_t p; p = proc_find(pid); if (p == PROC_NULL) { return ESRCH; } if (pcontrolp != NULL) { *pcontrolp = p->p_pcaction; } proc_rele(p); return 0; } static int proc_dopcontrol(proc_t p, memorystatus_kill_cause_t cause) { int pcontrol; os_reason_t kill_reason; proc_lock(p); pcontrol = PROC_CONTROL_STATE(p); if (PROC_ACTION_STATE(p) == 0) { switch (pcontrol) { case P_PCTHROTTLE: PROC_SETACTION_STATE(p); proc_unlock(p); memorystatus_log("memorystatus: throttling %s [%d] due to swap exhaustion\n", proc_best_name(p), proc_getpid(p)); break; case P_PCSUSP: PROC_SETACTION_STATE(p); proc_unlock(p); memorystatus_log("memorystatus: suspending %s [%d] due to swap exhaustion\n", proc_best_name(p), proc_getpid(p)); task_suspend(proc_task(p)); break; case P_PCKILL: PROC_SETACTION_STATE(p); proc_unlock(p); memorystatus_log("memorystatus: killing %s [%d] due to swap exhaustion\n", proc_best_name(p), proc_getpid(p)); kill_reason = os_reason_create(OS_REASON_JETSAM, cause); psignal_with_reason(p, SIGKILL, kill_reason); break; default: memorystatus_log("memorystatus: skipping %s [%d] without pcontrol\n", proc_best_name(p), proc_getpid(p)); proc_unlock(p); } } else { proc_unlock(p); } return PROC_RETURNED; } /* * Resume a throttled or suspended process. This is an internal interface that's only * used by the user level code that presents the GUI when we run out of swap space and * hence is restricted to processes with superuser privileges. */ int proc_resetpcontrol(int pid) { proc_t p; int pcontrol; int error; proc_t self = current_proc(); /* if the process has been validated to handle resource control or root is valid one */ if (((self->p_lflag & P_LVMRSRCOWNER) == 0) && (error = suser(kauth_cred_get(), 0))) { return error; } p = proc_find(pid); if (p == PROC_NULL) { return ESRCH; } proc_lock(p); pcontrol = PROC_CONTROL_STATE(p); if (PROC_ACTION_STATE(p) != 0) { switch (pcontrol) { case P_PCTHROTTLE: PROC_RESETACTION_STATE(p); proc_unlock(p); memorystatus_log("memorystatus: unthrottling %s [%d]\n", proc_best_name(p), proc_getpid(p)); break; case P_PCSUSP: PROC_RESETACTION_STATE(p); proc_unlock(p); memorystatus_log("memorystatus: resuming %s [%d]\n", proc_best_name(p), proc_getpid(p)); task_resume(proc_task(p)); break; case P_PCKILL: /* Huh? */ PROC_SETACTION_STATE(p); proc_unlock(p); memorystatus_log_error("memorystatus: attempt to unkill pid %s [%d] ignored\n", proc_best_name(p), proc_getpid(p)); break; default: proc_unlock(p); } } else { proc_unlock(p); } proc_rele(p); return 0; } struct no_paging_space { uint64_t pcs_max_size; uint64_t pcs_uniqueid; int pcs_pid; int pcs_proc_count; uint64_t pcs_total_size; uint64_t npcs_max_size; uint64_t npcs_uniqueid; int npcs_pid; int npcs_proc_count; uint64_t npcs_total_size; int apcs_proc_count; uint64_t apcs_total_size; }; static int proc_pcontrol_filter(proc_t p, void *arg) { struct no_paging_space *nps; uint64_t compressed; nps = (struct no_paging_space *)arg; compressed = get_task_compressed(proc_task(p)); if (PROC_CONTROL_STATE(p)) { if (PROC_ACTION_STATE(p) == 0) { if (compressed > nps->pcs_max_size) { nps->pcs_pid = proc_getpid(p); nps->pcs_uniqueid = proc_uniqueid(p); nps->pcs_max_size = compressed; } nps->pcs_total_size += compressed; nps->pcs_proc_count++; } else { nps->apcs_total_size += compressed; nps->apcs_proc_count++; } } else { if (compressed > nps->npcs_max_size) { nps->npcs_pid = proc_getpid(p); nps->npcs_uniqueid = proc_uniqueid(p); nps->npcs_max_size = compressed; } nps->npcs_total_size += compressed; nps->npcs_proc_count++; } return 0; } static int proc_pcontrol_null(__unused proc_t p, __unused void *arg) { return PROC_RETURNED; } /* * Deal with the low on compressor pool space condition... this function * gets called when we are approaching the limits of the compressor pool or * we are unable to create a new swap file. * Since this eventually creates a memory deadlock situtation, we need to take action to free up * memory resources (both compressed and uncompressed) in order to prevent the system from hanging completely. * There are 2 categories of processes to deal with. Those that have an action * associated with them by the task itself and those that do not. Actionable * tasks can have one of three categories specified: ones that * can be killed immediately, ones that should be suspended, and ones that should * be throttled. Processes that do not have an action associated with them are normally * ignored unless they are utilizing such a large percentage of the compressor pool (currently 50%) * that only by killing them can we hope to put the system back into a usable state. */ #define MB_SIZE (1024 * 1024ULL) extern int32_t max_kill_priority; bool no_paging_space_action(memorystatus_kill_cause_t cause) { proc_t p; struct no_paging_space nps; os_reason_t kill_reason; memorystatus_log("memorystatus: triggering no paging space action\n"); /* * Examine all processes and find the biggest (biggest is based on the number of pages this * task has in the compressor pool) that has been marked to have some action * taken when swap space runs out... we also find the biggest that hasn't been marked for * action. * * If the biggest non-actionable task is over the "dangerously big" threashold (currently 50% of * the total number of pages held by the compressor, we go ahead and kill it since no other task * can have any real effect on the situation. Otherwise, we go after the actionable process. */ bzero(&nps, sizeof(nps)); proc_iterate(PROC_ALLPROCLIST, proc_pcontrol_null, (void *)NULL, proc_pcontrol_filter, (void *)&nps); memorystatus_log_debug("memorystatus: npcs_proc_count = %d, npcs_total_size = %qd, npcs_max_size = %qd\n", nps.npcs_proc_count, nps.npcs_total_size, nps.npcs_max_size); memorystatus_log_debug("memorystatus: pcs_proc_count = %d, pcs_total_size = %qd, pcs_max_size = %qd\n", nps.pcs_proc_count, nps.pcs_total_size, nps.pcs_max_size); memorystatus_log_debug("memorystatus: apcs_proc_count = %d, apcs_total_size = %qd\n", nps.apcs_proc_count, nps.apcs_total_size); if (nps.npcs_max_size > (vm_compressor_pages_compressed() * PAGE_SIZE_64 * 50ull) / 100ull) { /* * for now we'll knock out any task that has more then 50% of the pages * held by the compressor */ if ((p = proc_find(nps.npcs_pid)) != PROC_NULL) { if (nps.npcs_uniqueid == proc_uniqueid(p)) { /* * verify this is still the same process * in case the proc exited and the pid got reused while * we were finishing the proc_iterate and getting to this point */ memorystatus_log("memorystatus: killing largest compressed process %s [%d] " "%llu MB\n", proc_best_name(p), proc_getpid(p), (nps.npcs_max_size / MB_SIZE)); kill_reason = os_reason_create(OS_REASON_JETSAM, cause); psignal_with_reason(p, SIGKILL, kill_reason); proc_rele(p); return false; } proc_rele(p); } } if (nps.pcs_max_size > 0) { memorystatus_log("memorystatus: attempting pcontrol on " "[%d]\n", nps.pcs_pid); if ((p = proc_find(nps.pcs_pid)) != PROC_NULL) { if (nps.pcs_uniqueid == proc_uniqueid(p)) { /* * verify this is still the same process * in case the proc exited and the pid got reused while * we were finishing the proc_iterate and getting to this point */ memorystatus_log("memorystatus: doing " "pcontrol on %s [%d]\n", proc_best_name(p), proc_getpid(p)); proc_dopcontrol(p, cause); proc_rele(p); return true; } else { memorystatus_log("memorystatus: cannot " "find process for [%d] -- may have exited\n", nps.pcs_pid); } proc_rele(p); } } memorystatus_log("memorystatus: unable to find any eligible processes to take action on\n"); return false; } int proc_trace_log(__unused proc_t p, struct proc_trace_log_args *uap, __unused int *retval) { int ret = 0; proc_t target_proc = PROC_NULL; pid_t target_pid = uap->pid; uint64_t target_uniqueid = uap->uniqueid; task_t target_task = NULL; if (priv_check_cred(kauth_cred_get(), PRIV_PROC_TRACE_INSPECT, 0)) { ret = EPERM; goto out; } target_proc = proc_find(target_pid); if (target_proc != PROC_NULL) { if (target_uniqueid != proc_uniqueid(target_proc)) { ret = ENOENT; goto out; } target_task = proc_task(target_proc); if (task_send_trace_memory(target_task, target_pid, target_uniqueid)) { ret = EINVAL; goto out; } } else { ret = ENOENT; } out: if (target_proc != PROC_NULL) { proc_rele(target_proc); } return ret; } #if VM_SCAN_FOR_SHADOW_CHAIN int proc_shadow_max(void); int proc_shadow_max(void) { int retval, max; proc_t p; task_t task; vm_map_t map; max = 0; proc_list_lock(); for (p = allproc.lh_first; (p != 0); p = p->p_list.le_next) { if (p->p_stat == SIDL) { continue; } task = proc_task(p); if (task == NULL) { continue; } map = get_task_map(task); if (map == NULL) { continue; } retval = vm_map_shadow_max(map); if (retval > max) { max = retval; } } proc_list_unlock(); return max; } #endif /* VM_SCAN_FOR_SHADOW_CHAIN */ void proc_set_responsible_pid(proc_t target_proc, pid_t responsible_pid); void proc_set_responsible_pid(proc_t target_proc, pid_t responsible_pid) { if (target_proc != NULL) { target_proc->p_responsible_pid = responsible_pid; // Also save the responsible UUID if (responsible_pid >= 0) { proc_t responsible_proc = proc_find(responsible_pid); if (responsible_proc != PROC_NULL) { proc_getexecutableuuid(responsible_proc, target_proc->p_responsible_uuid, sizeof(target_proc->p_responsible_uuid)); proc_rele(responsible_proc); } } } return; } int proc_chrooted(proc_t p) { int retval = 0; if (p) { proc_fdlock(p); retval = (p->p_fd.fd_rdir != NULL) ? 1 : 0; proc_fdunlock(p); } return retval; } boolean_t proc_send_synchronous_EXC_RESOURCE(proc_t p) { if (p == PROC_NULL) { return FALSE; } /* Send sync EXC_RESOURCE if the process is traced */ if (ISSET(p->p_lflag, P_LTRACED)) { return TRUE; } return FALSE; } #if CONFIG_MACF size_t proc_get_syscall_filter_mask_size(int which) { switch (which) { case SYSCALL_MASK_UNIX: return nsysent; case SYSCALL_MASK_MACH: return mach_trap_count; case SYSCALL_MASK_KOBJ: return mach_kobj_count; default: return 0; } } unsigned char * proc_get_syscall_filter_mask(proc_t p, int which) { switch (which) { case SYSCALL_MASK_UNIX: return proc_syscall_filter_mask(p); case SYSCALL_MASK_MACH: return mac_task_get_mach_filter_mask(proc_task(p)); case SYSCALL_MASK_KOBJ: return mac_task_get_kobj_filter_mask(proc_task(p)); default: return NULL; } } int proc_set_syscall_filter_mask(proc_t p, int which, unsigned char *maskptr, size_t masklen) { #if DEVELOPMENT || DEBUG if (syscallfilter_disable) { printf("proc_set_syscall_filter_mask: attempt to set policy for pid %d, but disabled by boot-arg\n", proc_pid(p)); return 0; } #endif // DEVELOPMENT || DEBUG switch (which) { case SYSCALL_MASK_UNIX: if (maskptr != NULL && masklen != nsysent) { return EINVAL; } proc_syscall_filter_mask_set(p, maskptr); break; case SYSCALL_MASK_MACH: if (maskptr != NULL && masklen != (size_t)mach_trap_count) { return EINVAL; } mac_task_set_mach_filter_mask(proc_task(p), maskptr); break; case SYSCALL_MASK_KOBJ: if (maskptr != NULL && masklen != (size_t)mach_kobj_count) { return EINVAL; } mac_task_set_kobj_filter_mask(proc_task(p), maskptr); break; default: return EINVAL; } return 0; } int proc_set_syscall_filter_callbacks(syscall_filter_cbs_t cbs) { if (cbs->version != SYSCALL_FILTER_CALLBACK_VERSION) { return EINVAL; } /* XXX register unix filter callback instead of using MACF hook. */ if (cbs->mach_filter_cbfunc || cbs->kobj_filter_cbfunc) { if (mac_task_register_filter_callbacks(cbs->mach_filter_cbfunc, cbs->kobj_filter_cbfunc) != 0) { return EPERM; } } return 0; } int proc_set_syscall_filter_index(int which, int num, int index) { switch (which) { case SYSCALL_MASK_KOBJ: if (ipc_kobject_set_kobjidx(num, index) != 0) { return ENOENT; } break; default: return EINVAL; } return 0; } SECURITY_READ_ONLY_LATE(sandbox_profile_cbfunc_t) mac_proc_get_sandbox_profile = NULL; int proc_set_sandbox_info_callbacks(sandbox_info_cbs_t cbs) { if (cbs->version != SANDBOX_INFO_CALLBACK_VERSION) { return EINVAL; } if (cbs->sandbox_profile_cbfunc) { if (mac_proc_get_sandbox_profile != NULL) { return EPERM; } mac_proc_get_sandbox_profile = cbs->sandbox_profile_cbfunc; } return 0; } #endif /* CONFIG_MACF */ int proc_set_filter_message_flag(proc_t p, boolean_t flag) { if (p == PROC_NULL) { return EINVAL; } task_set_filter_msg_flag(proc_task(p), flag); return 0; } int proc_get_filter_message_flag(proc_t p, boolean_t *flag) { if (p == PROC_NULL || flag == NULL) { return EINVAL; } *flag = task_get_filter_msg_flag(proc_task(p)); return 0; } #if CONFIG_PROC_RESOURCE_LIMITS int proc_set_filedesc_limits(proc_t p, int soft_limit, int hard_limit) { struct filedesc *fdp = &p->p_fd; int retval = 0; proc_fdlock(p); if (hard_limit > 0) { if (soft_limit >= hard_limit) { soft_limit = 0; } } fdp->fd_nfiles_soft_limit = soft_limit; fdp->fd_nfiles_hard_limit = hard_limit; /* Make sure that current fd_nfiles hasn't already exceeded these limits */ fd_check_limit_exceeded(fdp); proc_fdunlock(p); return retval; } int proc_set_kqworkloop_limits(proc_t p, int soft_limit, int hard_limit) { struct filedesc *fdp = &p->p_fd; lck_mtx_lock_spin_always(&fdp->fd_kqhashlock); fdp->kqwl_dyn_soft_limit = soft_limit; fdp->kqwl_dyn_hard_limit = hard_limit; /* Make sure existing limits aren't exceeded already */ kqworkloop_check_limit_exceeded(fdp); lck_mtx_unlock(&fdp->fd_kqhashlock); return 0; } static int proc_evaluate_fd_limits_ast(proc_t p, struct filedesc *fdp, int *soft_limit, int *hard_limit) { int fd_current_size, fd_soft_limit, fd_hard_limit; proc_fdlock(p); fd_current_size = fdp->fd_nfiles_open; fd_hard_limit = fdp->fd_nfiles_hard_limit; fd_soft_limit = fdp->fd_nfiles_soft_limit; /* * If a thread is going to take action on a specific limit exceeding, it also * clears it out to a SENTINEL so that future threads don't reevaluate the * limit as having exceeded again */ if (fd_hard_limit > 0 && fd_current_size >= fd_hard_limit) { /* Clear our soft limit when we are sending hard limit notification */ fd_soft_limit = 0; fdp->fd_nfiles_hard_limit = FD_LIMIT_SENTINEL; } else if (fd_soft_limit > 0 && fd_current_size >= fd_soft_limit) { /* Clear out hard limit when we are sending soft limit notification */ fd_hard_limit = 0; fdp->fd_nfiles_soft_limit = FD_LIMIT_SENTINEL; } else { /* Neither limits were exceeded */ fd_soft_limit = fd_hard_limit = 0; } proc_fdunlock(p); *soft_limit = fd_soft_limit; *hard_limit = fd_hard_limit; return fd_current_size; } static int proc_evaluate_kqwl_limits_ast(struct filedesc *fdp, int *soft_limit, int *hard_limit) { lck_mtx_lock_spin_always(&fdp->fd_kqhashlock); int kqwl_current_size = fdp->num_kqwls; int kqwl_soft_limit = fdp->kqwl_dyn_soft_limit; int kqwl_hard_limit = fdp->kqwl_dyn_hard_limit; /* * If a thread is going to take action on a specific limit exceeding, it also * clears it out to a SENTINEL so that future threads don't reevaluate the * limit as having exceeded again */ if (kqwl_hard_limit > 0 && kqwl_current_size >= kqwl_hard_limit) { /* Clear our soft limit when we are sending hard limit notification */ kqwl_soft_limit = 0; fdp->kqwl_dyn_hard_limit = KQWL_LIMIT_SENTINEL; } else if (kqwl_soft_limit > 0 && kqwl_current_size >= kqwl_soft_limit) { /* Clear out hard limit when we are sending soft limit notification */ kqwl_hard_limit = 0; fdp->kqwl_dyn_soft_limit = KQWL_LIMIT_SENTINEL; } else { /* Neither limits were exceeded */ kqwl_soft_limit = kqwl_hard_limit = 0; } lck_mtx_unlock(&fdp->fd_kqhashlock); *soft_limit = kqwl_soft_limit; *hard_limit = kqwl_hard_limit; return kqwl_current_size; } #endif /* CONFIG_PROC_RESOURCE_LIMITS */ void proc_filedesc_ast(__unused task_t task) { #if CONFIG_PROC_RESOURCE_LIMITS assert(task == current_task()); proc_t p = get_bsdtask_info(task); struct filedesc *fdp = &p->p_fd; /* * At this point, we can possibly race with other threads which set the AST * due to triggering the soft/hard limits for fd or kqworkloops. * * The first thread to reach this logic will always evaluate hard limit for fd * or kqworkloops even if it was the one which triggered the soft limit for * them. * * If a thread takes action on a specific limit, it will clear the limit value * in the fdp with a SENTINEL to indicate to other racing threads that they no * longer need to evaluate it. */ int soft_limit, hard_limit; int fd_current_size = proc_evaluate_fd_limits_ast(p, fdp, &soft_limit, &hard_limit); if (hard_limit || soft_limit) { return task_filedesc_ast(task, fd_current_size, soft_limit, hard_limit); } int kqwl_current_size = proc_evaluate_kqwl_limits_ast(fdp, &soft_limit, &hard_limit); if (hard_limit || soft_limit) { return task_kqworkloop_ast(task, kqwl_current_size, soft_limit, hard_limit); } #endif /* CONFIG_PROC_RESOURCE_LIMITS */ } proc_ro_t proc_ro_alloc(proc_t p, proc_ro_data_t p_data, task_t t, task_ro_data_t t_data) { proc_ro_t pr; struct proc_ro pr_local = {}; pr = (proc_ro_t)zalloc_ro(ZONE_ID_PROC_RO, Z_WAITOK | Z_NOFAIL | Z_ZERO); if (p != PROC_NULL) { pr_local.pr_proc = p; pr_local.proc_data = *p_data; } if (t != TASK_NULL) { pr_local.pr_task = t; pr_local.task_data = *t_data; } if ((p != PROC_NULL) || (t != TASK_NULL)) { zalloc_ro_update_elem(ZONE_ID_PROC_RO, pr, &pr_local); } return pr; } proc_ro_t proc_ro_ref_task(proc_ro_t pr, task_t t, task_ro_data_t t_data) { struct proc_ro pr_local; if (pr->pr_task != TASK_NULL) { panic("%s: proc_ro already has an owning task", __func__); } pr_local = *pr; pr_local.pr_task = t; pr_local.task_data = *t_data; zalloc_ro_update_elem(ZONE_ID_PROC_RO, pr, &pr_local); return pr; } void proc_ro_erase_task(proc_ro_t pr) { zalloc_ro_update_field_atomic(ZONE_ID_PROC_RO, pr, pr_task, ZRO_ATOMIC_XCHG_LONG, TASK_NULL); } __abortlike static void panic_proc_ro_proc_backref_mismatch(proc_t p, proc_ro_t ro) { panic("proc_ro->proc backref mismatch: p=%p, ro=%p, " "ro->pr_proc(ro)=%p", p, ro, ro->pr_proc); } proc_ro_t proc_get_ro(proc_t p) { proc_ro_t ro = p->p_proc_ro; zone_require_ro(ZONE_ID_PROC_RO, sizeof(struct proc_ro), ro); if (__improbable(ro->pr_proc != p)) { panic_proc_ro_proc_backref_mismatch(p, ro); } return ro; } task_t proc_ro_task(proc_ro_t pr) { return pr->pr_task; } /* * pid_for_task * * Find the BSD process ID for the Mach task associated with the given Mach port * name * * Parameters: args User argument descriptor (see below) * * Indirect parameters: args->t Mach port name * args->pid Process ID (returned value; see below) * * Returns: KERL_SUCCESS Success * KERN_FAILURE Not success * * Implicit returns: args->pid Process ID * */ kern_return_t pid_for_task( struct pid_for_task_args *args) { mach_port_name_t t = args->t; user_addr_t pid_addr = args->pid; proc_t p; task_t t1; int pid = -1; kern_return_t err = KERN_SUCCESS; AUDIT_MACH_SYSCALL_ENTER(AUE_PIDFORTASK); AUDIT_ARG(mach_port1, t); t1 = port_name_to_task_name(t); if (t1 == TASK_NULL) { err = KERN_FAILURE; goto pftout; } else { p = get_bsdtask_info(t1); if (p) { pid = proc_pid(p); err = KERN_SUCCESS; } else if (task_is_a_corpse(t1)) { pid = task_pid(t1); err = KERN_SUCCESS; } else { err = KERN_FAILURE; } } task_deallocate(t1); pftout: AUDIT_ARG(pid, pid); (void) copyout((char *) &pid, pid_addr, sizeof(int)); AUDIT_MACH_SYSCALL_EXIT(err); return err; } /* * * tfp_policy = KERN_TFP_POLICY_DENY; Deny Mode: None allowed except for self * tfp_policy = KERN_TFP_POLICY_DEFAULT; default mode: all posix checks and upcall via task port for authentication * */ static int tfp_policy = KERN_TFP_POLICY_DEFAULT; static int sysctl_settfp_policy(__unused struct sysctl_oid *oidp, void *arg1, __unused int arg2, struct sysctl_req *req) { int error = 0; int new_value; error = SYSCTL_OUT(req, arg1, sizeof(int)); if (error || req->newptr == USER_ADDR_NULL) { return error; } if (!kauth_cred_issuser(kauth_cred_get())) { return EPERM; } if ((error = SYSCTL_IN(req, &new_value, sizeof(int)))) { goto out; } if ((new_value == KERN_TFP_POLICY_DENY) || (new_value == KERN_TFP_POLICY_DEFAULT)) { tfp_policy = new_value; } else { error = EINVAL; } out: return error; } SYSCTL_NODE(_kern, KERN_TFP, tfp, CTLFLAG_RW | CTLFLAG_LOCKED, 0, "tfp"); SYSCTL_PROC(_kern_tfp, KERN_TFP_POLICY, policy, CTLTYPE_INT | CTLFLAG_RW | CTLFLAG_LOCKED, &tfp_policy, sizeof(uint32_t), &sysctl_settfp_policy, "I", "policy"); /* * Routine: task_for_pid_posix_check * Purpose: * Verify that the current process should be allowed to * get the target process's task port. This is only * permitted if: * - The current process is root * OR all of the following are true: * - The target process's real, effective, and saved uids * are the same as the current proc's euid, * - The target process's group set is a subset of the * calling process's group set, and * - The target process hasn't switched credentials. * * Returns: TRUE: permitted * FALSE: denied */ static int task_for_pid_posix_check(proc_t target) { kauth_cred_t targetcred, mycred; bool checkcredentials; uid_t myuid; int allowed; /* No task_for_pid on bad targets */ if (target->p_stat == SZOMB) { return FALSE; } mycred = kauth_cred_get(); myuid = kauth_cred_getuid(mycred); /* If we're running as root, the check passes */ if (kauth_cred_issuser(mycred)) { return TRUE; } /* We're allowed to get our own task port */ if (target == current_proc()) { return TRUE; } /* * Under DENY, only root can get another proc's task port, * so no more checks are needed. */ if (tfp_policy == KERN_TFP_POLICY_DENY) { return FALSE; } targetcred = kauth_cred_proc_ref(target); allowed = TRUE; checkcredentials = !proc_is_third_party_debuggable_driver(target); if (checkcredentials) { /* Do target's ruid, euid, and saved uid match my euid? */ if ((kauth_cred_getuid(targetcred) != myuid) || (kauth_cred_getruid(targetcred) != myuid) || (kauth_cred_getsvuid(targetcred) != myuid)) { allowed = FALSE; goto out; } /* Are target's groups a subset of my groups? */ if (kauth_cred_gid_subset(targetcred, mycred, &allowed) || allowed == 0) { allowed = FALSE; goto out; } } /* Has target switched credentials? */ if (target->p_flag & P_SUGID) { allowed = FALSE; goto out; } out: kauth_cred_unref(&targetcred); return allowed; } /* * __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__ * * Description: Waits for the user space daemon to respond to the request * we made. Function declared non inline to be visible in * stackshots and spindumps as well as debugging. */ static __attribute__((noinline)) int __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__( mach_port_t task_access_port, int32_t calling_pid, uint32_t calling_gid, int32_t target_pid, mach_task_flavor_t flavor) { return check_task_access_with_flavor(task_access_port, calling_pid, calling_gid, target_pid, flavor); } /* * Routine: task_for_pid * Purpose: * Get the task port for another "process", named by its * process ID on the same host as "target_task". * * Only permitted to privileged processes, or processes * with the same user ID. * * Note: if pid == 0, an error is return no matter who is calling. * * XXX This should be a BSD system call, not a Mach trap!!! */ kern_return_t task_for_pid( struct task_for_pid_args *args) { mach_port_name_t target_tport = args->target_tport; int pid = args->pid; user_addr_t task_addr = args->t; proc_t p = PROC_NULL; task_t t1 = TASK_NULL; task_t task = TASK_NULL; mach_port_name_t tret = MACH_PORT_NULL; ipc_port_t tfpport = MACH_PORT_NULL; void * sright = NULL; int error = 0; boolean_t is_current_proc = FALSE; struct proc_ident pident = {0}; AUDIT_MACH_SYSCALL_ENTER(AUE_TASKFORPID); AUDIT_ARG(pid, pid); AUDIT_ARG(mach_port1, target_tport); /* Always check if pid == 0 */ if (pid == 0) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); AUDIT_MACH_SYSCALL_EXIT(KERN_FAILURE); return KERN_FAILURE; } t1 = port_name_to_task(target_tport); if (t1 == TASK_NULL) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); AUDIT_MACH_SYSCALL_EXIT(KERN_FAILURE); return KERN_FAILURE; } p = proc_find(pid); if (p == PROC_NULL) { error = KERN_FAILURE; goto tfpout; } pident = proc_ident_with_policy(p, IDENT_VALIDATION_PROC_EXACT); is_current_proc = (p == current_proc()); #if CONFIG_AUDIT AUDIT_ARG(process, p); #endif if (!(task_for_pid_posix_check(p))) { error = KERN_FAILURE; goto tfpout; } if (proc_task(p) == TASK_NULL) { error = KERN_SUCCESS; goto tfpout; } /* * Grab a task reference and drop the proc reference as the proc ref * shouldn't be held accross upcalls. */ task = proc_task(p); task_reference(task); proc_rele(p); p = PROC_NULL; /* IPC is not active on the task until after `exec_resettextvp` has been called. * We don't want to call into MAC hooks until we know that this has occured, otherwise * AMFI and others will read uninitialized fields from the csproc */ if (!task_is_ipc_active(task)) { error = KERN_FAILURE; goto tfpout; } #if CONFIG_MACF error = mac_proc_check_get_task(kauth_cred_get(), &pident, TASK_FLAVOR_CONTROL); if (error) { error = KERN_FAILURE; goto tfpout; } #endif /* If we aren't root and target's task access port is set... */ if (!kauth_cred_issuser(kauth_cred_get()) && !is_current_proc && (task_get_task_access_port(task, &tfpport) == 0) && (tfpport != IPC_PORT_NULL)) { if (tfpport == IPC_PORT_DEAD) { error = KERN_PROTECTION_FAILURE; goto tfpout; } /* Call up to the task access server */ error = __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__(tfpport, proc_selfpid(), kauth_getgid(), pid, TASK_FLAVOR_CONTROL); if (error != MACH_MSG_SUCCESS) { if (error == MACH_RCV_INTERRUPTED) { error = KERN_ABORTED; } else { error = KERN_FAILURE; } goto tfpout; } } /* Grant task port access */ extmod_statistics_incr_task_for_pid(task); /* this reference will be consumed during conversion */ task_reference(task); sright = (void *)convert_task_to_port(task); /* extra task ref consumed */ /* * Check if the task has been corpsified. We must do so after conversion * since we don't hold locks and may have grabbed a corpse control port * above which will prevent no-senders notification delivery. */ if (task_is_a_corpse(task)) { ipc_port_release_send(sright); error = KERN_FAILURE; goto tfpout; } tret = ipc_port_copyout_send( sright, get_task_ipcspace(current_task())); error = KERN_SUCCESS; tfpout: task_deallocate(t1); AUDIT_ARG(mach_port2, tret); (void) copyout((char *) &tret, task_addr, sizeof(mach_port_name_t)); if (tfpport != IPC_PORT_NULL) { ipc_port_release_send(tfpport); } if (task != TASK_NULL) { task_deallocate(task); } if (p != PROC_NULL) { proc_rele(p); } AUDIT_MACH_SYSCALL_EXIT(error); return error; } /* * Routine: task_name_for_pid * Purpose: * Get the task name port for another "process", named by its * process ID on the same host as "target_task". * * Only permitted to privileged processes, or processes * with the same user ID. * * XXX This should be a BSD system call, not a Mach trap!!! */ kern_return_t task_name_for_pid( struct task_name_for_pid_args *args) { mach_port_name_t target_tport = args->target_tport; int pid = args->pid; user_addr_t task_addr = args->t; proc_t p = PROC_NULL; task_t t1 = TASK_NULL; mach_port_name_t tret = MACH_PORT_NULL; void * sright; int error = 0, refheld = 0; kauth_cred_t target_cred; AUDIT_MACH_SYSCALL_ENTER(AUE_TASKNAMEFORPID); AUDIT_ARG(pid, pid); AUDIT_ARG(mach_port1, target_tport); t1 = port_name_to_task(target_tport); if (t1 == TASK_NULL) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); AUDIT_MACH_SYSCALL_EXIT(KERN_FAILURE); return KERN_FAILURE; } p = proc_find(pid); if (p != PROC_NULL) { AUDIT_ARG(process, p); target_cred = kauth_cred_proc_ref(p); refheld = 1; if ((p->p_stat != SZOMB) && ((current_proc() == p) || kauth_cred_issuser(kauth_cred_get()) || ((kauth_cred_getuid(target_cred) == kauth_cred_getuid(kauth_cred_get())) && ((kauth_cred_getruid(target_cred) == kauth_getruid()))) || IOCurrentTaskHasEntitlement("com.apple.system-task-ports.name.safe") )) { if (proc_task(p) != TASK_NULL) { struct proc_ident pident = proc_ident_with_policy(p, IDENT_VALIDATION_PROC_EXACT); task_t task = proc_task(p); task_reference(task); proc_rele(p); p = PROC_NULL; #if CONFIG_MACF error = mac_proc_check_get_task(kauth_cred_get(), &pident, TASK_FLAVOR_NAME); if (error) { task_deallocate(task); goto noperm; } #endif sright = (void *)convert_task_name_to_port(task); task = NULL; tret = ipc_port_copyout_send(sright, get_task_ipcspace(current_task())); } else { tret = MACH_PORT_NULL; } AUDIT_ARG(mach_port2, tret); (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); task_deallocate(t1); error = KERN_SUCCESS; goto tnfpout; } } #if CONFIG_MACF noperm: #endif task_deallocate(t1); tret = MACH_PORT_NULL; (void) copyout((char *) &tret, task_addr, sizeof(mach_port_name_t)); error = KERN_FAILURE; tnfpout: if (refheld != 0) { kauth_cred_unref(&target_cred); } if (p != PROC_NULL) { proc_rele(p); } AUDIT_MACH_SYSCALL_EXIT(error); return error; } /* * Routine: task_inspect_for_pid * Purpose: * Get the task inspect port for another "process", named by its * process ID on the same host as "target_task". */ int task_inspect_for_pid(struct proc *p __unused, struct task_inspect_for_pid_args *args, int *ret) { mach_port_name_t target_tport = args->target_tport; int pid = args->pid; user_addr_t task_addr = args->t; proc_t proc = PROC_NULL; task_t t1 = TASK_NULL; task_inspect_t task_insp = TASK_INSPECT_NULL; mach_port_name_t tret = MACH_PORT_NULL; ipc_port_t tfpport = MACH_PORT_NULL; int error = 0; void *sright = NULL; boolean_t is_current_proc = FALSE; struct proc_ident pident = {0}; /* Disallow inspect port for kernel_task */ if (pid == 0) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); return EPERM; } t1 = port_name_to_task(target_tport); if (t1 == TASK_NULL) { (void) copyout((char *) &tret, task_addr, sizeof(mach_port_name_t)); return EINVAL; } proc = proc_find(pid); if (proc == PROC_NULL) { error = ESRCH; goto tifpout; } pident = proc_ident_with_policy(proc, IDENT_VALIDATION_PROC_EXACT); is_current_proc = (proc == current_proc()); if (!(task_for_pid_posix_check(proc))) { error = EPERM; goto tifpout; } task_insp = proc_task(proc); if (task_insp == TASK_INSPECT_NULL) { goto tifpout; } /* * Grab a task reference and drop the proc reference before making any upcalls. */ task_reference(task_insp); proc_rele(proc); proc = PROC_NULL; #if CONFIG_MACF error = mac_proc_check_get_task(kauth_cred_get(), &pident, TASK_FLAVOR_INSPECT); if (error) { error = EPERM; goto tifpout; } #endif /* If we aren't root and target's task access port is set... */ if (!kauth_cred_issuser(kauth_cred_get()) && !is_current_proc && (task_get_task_access_port(task_insp, &tfpport) == 0) && (tfpport != IPC_PORT_NULL)) { if (tfpport == IPC_PORT_DEAD) { error = EACCES; goto tifpout; } /* Call up to the task access server */ error = __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__(tfpport, proc_selfpid(), kauth_getgid(), pid, TASK_FLAVOR_INSPECT); if (error != MACH_MSG_SUCCESS) { if (error == MACH_RCV_INTERRUPTED) { error = EINTR; } else { error = EPERM; } goto tifpout; } } /* Check if the task has been corpsified */ if (task_is_a_corpse(task_insp)) { error = EACCES; goto tifpout; } /* could be IP_NULL, consumes a ref */ sright = (void*) convert_task_inspect_to_port(task_insp); task_insp = TASK_INSPECT_NULL; tret = ipc_port_copyout_send_allow_immovable(sright, get_task_ipcspace(current_task())); tifpout: task_deallocate(t1); (void) copyout((char *) &tret, task_addr, sizeof(mach_port_name_t)); if (proc != PROC_NULL) { proc_rele(proc); } if (tfpport != IPC_PORT_NULL) { ipc_port_release_send(tfpport); } if (task_insp != TASK_INSPECT_NULL) { task_deallocate(task_insp); } *ret = error; return error; } /* * Routine: task_read_for_pid * Purpose: * Get the task read port for another "process", named by its * process ID on the same host as "target_task". */ int task_read_for_pid(struct proc *p __unused, struct task_read_for_pid_args *args, int *ret) { mach_port_name_t target_tport = args->target_tport; int pid = args->pid; user_addr_t task_addr = args->t; proc_t proc = PROC_NULL; task_t t1 = TASK_NULL; task_read_t task_read = TASK_READ_NULL; mach_port_name_t tret = MACH_PORT_NULL; ipc_port_t tfpport = MACH_PORT_NULL; int error = 0; void *sright = NULL; boolean_t is_current_proc = FALSE; struct proc_ident pident = {0}; /* Disallow read port for kernel_task */ if (pid == 0) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); return EPERM; } t1 = port_name_to_task(target_tport); if (t1 == TASK_NULL) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); return EINVAL; } proc = proc_find(pid); if (proc == PROC_NULL) { error = ESRCH; goto trfpout; } pident = proc_ident_with_policy(proc, IDENT_VALIDATION_PROC_EXACT); is_current_proc = (proc == current_proc()); if (!(task_for_pid_posix_check(proc))) { error = EPERM; goto trfpout; } task_read = proc_task(proc); if (task_read == TASK_INSPECT_NULL) { goto trfpout; } /* * Grab a task reference and drop the proc reference before making any upcalls. */ task_reference(task_read); proc_rele(proc); proc = PROC_NULL; #if CONFIG_MACF error = mac_proc_check_get_task(kauth_cred_get(), &pident, TASK_FLAVOR_READ); if (error) { error = EPERM; goto trfpout; } #endif /* If we aren't root and target's task access port is set... */ if (!kauth_cred_issuser(kauth_cred_get()) && !is_current_proc && (task_get_task_access_port(task_read, &tfpport) == 0) && (tfpport != IPC_PORT_NULL)) { if (tfpport == IPC_PORT_DEAD) { error = EACCES; goto trfpout; } /* Call up to the task access server */ error = __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__(tfpport, proc_selfpid(), kauth_getgid(), pid, TASK_FLAVOR_READ); if (error != MACH_MSG_SUCCESS) { if (error == MACH_RCV_INTERRUPTED) { error = EINTR; } else { error = EPERM; } goto trfpout; } } /* Check if the task has been corpsified */ if (task_is_a_corpse(task_read)) { error = EACCES; goto trfpout; } /* could be IP_NULL, consumes a ref */ sright = (void*) convert_task_read_to_port(task_read); task_read = TASK_READ_NULL; tret = ipc_port_copyout_send_allow_immovable(sright, get_task_ipcspace(current_task())); trfpout: task_deallocate(t1); (void) copyout((char *) &tret, task_addr, sizeof(mach_port_name_t)); if (proc != PROC_NULL) { proc_rele(proc); } if (tfpport != IPC_PORT_NULL) { ipc_port_release_send(tfpport); } if (task_read != TASK_READ_NULL) { task_deallocate(task_read); } *ret = error; return error; } kern_return_t pid_suspend(struct proc *p __unused, struct pid_suspend_args *args, int *ret) { task_t target = NULL; proc_t targetproc = PROC_NULL; int pid = args->pid; int error = 0; mach_port_t tfpport = MACH_PORT_NULL; if (pid == 0) { error = EPERM; goto out; } targetproc = proc_find(pid); if (targetproc == PROC_NULL) { error = ESRCH; goto out; } if (!task_for_pid_posix_check(targetproc) && !IOCurrentTaskHasEntitlement(PROCESS_RESUME_SUSPEND_ENTITLEMENT)) { error = EPERM; goto out; } #if CONFIG_MACF error = mac_proc_check_suspend_resume(targetproc, MAC_PROC_CHECK_SUSPEND); if (error) { error = EPERM; goto out; } #endif target = proc_task(targetproc); #if XNU_TARGET_OS_OSX if (target != TASK_NULL) { /* If we aren't root and target's task access port is set... */ if (!kauth_cred_issuser(kauth_cred_get()) && targetproc != current_proc() && (task_get_task_access_port(target, &tfpport) == 0) && (tfpport != IPC_PORT_NULL)) { if (tfpport == IPC_PORT_DEAD) { error = EACCES; goto out; } /* Call up to the task access server */ error = __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__(tfpport, proc_selfpid(), kauth_getgid(), pid, TASK_FLAVOR_CONTROL); if (error != MACH_MSG_SUCCESS) { if (error == MACH_RCV_INTERRUPTED) { error = EINTR; } else { error = EPERM; } goto out; } } } #endif /* XNU_TARGET_OS_OSX */ task_reference(target); error = task_pidsuspend(target); if (error) { if (error == KERN_INVALID_ARGUMENT) { error = EINVAL; } else { error = EPERM; } } #if CONFIG_MEMORYSTATUS else { memorystatus_on_suspend(targetproc); } #endif task_deallocate(target); out: if (tfpport != IPC_PORT_NULL) { ipc_port_release_send(tfpport); } if (targetproc != PROC_NULL) { proc_rele(targetproc); } *ret = error; return error; } kern_return_t debug_control_port_for_pid(struct debug_control_port_for_pid_args *args) { mach_port_name_t target_tport = args->target_tport; int pid = args->pid; user_addr_t task_addr = args->t; proc_t p = PROC_NULL; task_t t1 = TASK_NULL; task_t task = TASK_NULL; mach_port_name_t tret = MACH_PORT_NULL; ipc_port_t tfpport = MACH_PORT_NULL; ipc_port_t sright = NULL; int error = 0; boolean_t is_current_proc = FALSE; struct proc_ident pident = {0}; AUDIT_MACH_SYSCALL_ENTER(AUE_DBGPORTFORPID); AUDIT_ARG(pid, pid); AUDIT_ARG(mach_port1, target_tport); /* Always check if pid == 0 */ if (pid == 0) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); AUDIT_MACH_SYSCALL_EXIT(KERN_FAILURE); return KERN_FAILURE; } t1 = port_name_to_task(target_tport); if (t1 == TASK_NULL) { (void) copyout((char *)&tret, task_addr, sizeof(mach_port_name_t)); AUDIT_MACH_SYSCALL_EXIT(KERN_FAILURE); return KERN_FAILURE; } p = proc_find(pid); if (p == PROC_NULL) { error = KERN_FAILURE; goto tfpout; } pident = proc_ident_with_policy(p, IDENT_VALIDATION_PROC_EXACT); is_current_proc = (p == current_proc()); #if CONFIG_AUDIT AUDIT_ARG(process, p); #endif if (!(task_for_pid_posix_check(p))) { error = KERN_FAILURE; goto tfpout; } if (proc_task(p) == TASK_NULL) { error = KERN_SUCCESS; goto tfpout; } /* * Grab a task reference and drop the proc reference before making any upcalls. */ task = proc_task(p); task_reference(task); proc_rele(p); p = PROC_NULL; if (!IOCurrentTaskHasEntitlement(DEBUG_PORT_ENTITLEMENT)) { #if CONFIG_MACF error = mac_proc_check_get_task(kauth_cred_get(), &pident, TASK_FLAVOR_CONTROL); if (error) { error = KERN_FAILURE; goto tfpout; } #endif /* If we aren't root and target's task access port is set... */ if (!kauth_cred_issuser(kauth_cred_get()) && !is_current_proc && (task_get_task_access_port(task, &tfpport) == 0) && (tfpport != IPC_PORT_NULL)) { if (tfpport == IPC_PORT_DEAD) { error = KERN_PROTECTION_FAILURE; goto tfpout; } /* Call up to the task access server */ error = __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__(tfpport, proc_selfpid(), kauth_getgid(), pid, TASK_FLAVOR_CONTROL); if (error != MACH_MSG_SUCCESS) { if (error == MACH_RCV_INTERRUPTED) { error = KERN_ABORTED; } else { error = KERN_FAILURE; } goto tfpout; } } } /* Check if the task has been corpsified */ if (task_is_a_corpse(task)) { error = KERN_FAILURE; goto tfpout; } error = task_get_debug_control_port(task, &sright); if (error != KERN_SUCCESS) { goto tfpout; } tret = ipc_port_copyout_send( sright, get_task_ipcspace(current_task())); error = KERN_SUCCESS; tfpout: task_deallocate(t1); AUDIT_ARG(mach_port2, tret); (void) copyout((char *) &tret, task_addr, sizeof(mach_port_name_t)); if (tfpport != IPC_PORT_NULL) { ipc_port_release_send(tfpport); } if (task != TASK_NULL) { task_deallocate(task); } if (p != PROC_NULL) { proc_rele(p); } AUDIT_MACH_SYSCALL_EXIT(error); return error; } kern_return_t pid_resume(struct proc *p __unused, struct pid_resume_args *args, int *ret) { task_t target = NULL; proc_t targetproc = PROC_NULL; int pid = args->pid; int error = 0; mach_port_t tfpport = MACH_PORT_NULL; if (pid == 0) { error = EPERM; goto out; } targetproc = proc_find(pid); if (targetproc == PROC_NULL) { error = ESRCH; goto out; } if (!task_for_pid_posix_check(targetproc) && !IOCurrentTaskHasEntitlement(PROCESS_RESUME_SUSPEND_ENTITLEMENT)) { error = EPERM; goto out; } #if CONFIG_MACF error = mac_proc_check_suspend_resume(targetproc, MAC_PROC_CHECK_RESUME); if (error) { error = EPERM; goto out; } #endif target = proc_task(targetproc); #if XNU_TARGET_OS_OSX if (target != TASK_NULL) { /* If we aren't root and target's task access port is set... */ if (!kauth_cred_issuser(kauth_cred_get()) && targetproc != current_proc() && (task_get_task_access_port(target, &tfpport) == 0) && (tfpport != IPC_PORT_NULL)) { if (tfpport == IPC_PORT_DEAD) { error = EACCES; goto out; } /* Call up to the task access server */ error = __KERNEL_WAITING_ON_TASKGATED_CHECK_ACCESS_UPCALL__(tfpport, proc_selfpid(), kauth_getgid(), pid, TASK_FLAVOR_CONTROL); if (error != MACH_MSG_SUCCESS) { if (error == MACH_RCV_INTERRUPTED) { error = EINTR; } else { error = EPERM; } goto out; } } } #endif /* XNU_TARGET_OS_OSX */ #if !XNU_TARGET_OS_OSX #if SOCKETS resume_proc_sockets(targetproc); #endif /* SOCKETS */ #endif /* !XNU_TARGET_OS_OSX */ task_reference(target); #if CONFIG_MEMORYSTATUS memorystatus_on_resume(targetproc); #endif error = task_pidresume(target); if (error) { if (error == KERN_INVALID_ARGUMENT) { error = EINVAL; } else { if (error == KERN_MEMORY_ERROR) { psignal(targetproc, SIGKILL); error = EIO; } else { error = EPERM; } } } task_deallocate(target); out: if (tfpport != IPC_PORT_NULL) { ipc_port_release_send(tfpport); } if (targetproc != PROC_NULL) { proc_rele(targetproc); } *ret = error; return error; } #if !XNU_TARGET_OS_OSX /* * Freeze the specified process (provided in args->pid), or find and freeze a PID. * When a process is specified, this call is blocking, otherwise we wake up the * freezer thread and do not block on a process being frozen. */ int pid_hibernate(struct proc *p __unused, struct pid_hibernate_args *args, int *ret) { int error = 0; proc_t targetproc = PROC_NULL; int pid = args->pid; /* * TODO: Create a different interface for compressor sweeps, * gated by an entitlement: rdar://116490432 */ if (pid == -2) { error = mach_to_bsd_errno(vm_pageout_anonymous_pages()); } #ifndef CONFIG_FREEZE if (pid != -2) { os_log(OS_LOG_DEFAULT, "%s: pid %d not supported when freezer is disabled.", __func__, pid); error = ENOTSUP; } #else /* * If a pid has been provided, we obtain the process handle and call task_for_pid_posix_check(). */ if (pid >= 0) { targetproc = proc_find(pid); if (targetproc == PROC_NULL) { error = ESRCH; goto out; } if (!task_for_pid_posix_check(targetproc)) { error = EPERM; goto out; } } #if CONFIG_MACF //Note that targetproc may be null error = mac_proc_check_suspend_resume(targetproc, MAC_PROC_CHECK_HIBERNATE); if (error) { error = EPERM; goto out; } #endif if (pid == -1) { memorystatus_on_inactivity(targetproc); } else if (pid >= 0) { error = memorystatus_freeze_process_sync(targetproc); } /* We already handled the pid == -2 case */ out: #endif /* CONFIG_FREEZE */ if (targetproc != PROC_NULL) { proc_rele(targetproc); } *ret = error; return error; } #endif /* !XNU_TARGET_OS_OSX */ #if SOCKETS #if SKYWALK /* * Since we make multiple passes across the fileproc array, record the * first MAX_CHANNELS channel handles found. MAX_CHANNELS should be * large enough to accomodate most, if not all cases. If we find more, * we'll go to the slow path during second pass. */ #define MAX_CHANNELS 8 /* should be more than enough */ #endif /* SKYWALK */ static int networking_defunct_callout(proc_t p, void *arg) { struct pid_shutdown_sockets_args *args = arg; int pid = args->pid; int level = args->level; struct fileproc *fp; #if SKYWALK int i; int channel_count = 0; struct kern_channel *channel_array[MAX_CHANNELS]; bzero(&channel_array, sizeof(channel_array)); sk_protect_t protect = sk_async_transmit_protect(); #endif /* SKYWALK */ proc_fdlock(p); fdt_foreach(fp, p) { struct fileglob *fg = fp->fp_glob; switch (FILEGLOB_DTYPE(fg)) { case DTYPE_SOCKET: { struct socket *so = (struct socket *)fg_get_data(fg); if (proc_getpid(p) == pid || so->last_pid == pid || ((so->so_flags & SOF_DELEGATED) && so->e_pid == pid)) { /* Call networking stack with socket and level */ (void)socket_defunct(p, so, level); } break; } #if NECP case DTYPE_NETPOLICY: /* first pass: defunct necp and get stats for ntstat */ if (proc_getpid(p) == pid) { necp_fd_defunct(p, (struct necp_fd_data *)fg_get_data(fg)); } break; #endif /* NECP */ #if SKYWALK case DTYPE_CHANNEL: /* first pass: get channels and total count */ if (proc_getpid(p) == pid) { if (channel_count < MAX_CHANNELS) { channel_array[channel_count] = (struct kern_channel *)fg_get_data(fg); } ++channel_count; } break; #endif /* SKYWALK */ default: break; } } #if SKYWALK /* * Second pass: defunct channels/flows (after NECP). Handle * the common case of up to MAX_CHANNELS count with fast path, * and traverse the fileproc array again only if we exceed it. */ if (channel_count != 0 && channel_count <= MAX_CHANNELS) { ASSERT(proc_getpid(p) == pid); for (i = 0; i < channel_count; i++) { ASSERT(channel_array[i] != NULL); kern_channel_defunct(p, channel_array[i]); } } else if (channel_count != 0) { ASSERT(proc_getpid(p) == pid); fdt_foreach(fp, p) { struct fileglob *fg = fp->fp_glob; if (FILEGLOB_DTYPE(fg) == DTYPE_CHANNEL) { kern_channel_defunct(p, (struct kern_channel *)fg_get_data(fg)); } } } sk_async_transmit_unprotect(protect); #endif /* SKYWALK */ proc_fdunlock(p); return PROC_RETURNED; } int pid_shutdown_sockets(struct proc *p __unused, struct pid_shutdown_sockets_args *args, int *ret) { int error = 0; proc_t targetproc = PROC_NULL; int pid = args->pid; int level = args->level; if (level != SHUTDOWN_SOCKET_LEVEL_DISCONNECT_SVC && level != SHUTDOWN_SOCKET_LEVEL_DISCONNECT_ALL) { error = EINVAL; goto out; } targetproc = proc_find(pid); if (targetproc == PROC_NULL) { error = ESRCH; goto out; } if (!task_for_pid_posix_check(targetproc) && !IOCurrentTaskHasEntitlement(PROCESS_RESUME_SUSPEND_ENTITLEMENT)) { error = EPERM; goto out; } #if CONFIG_MACF error = mac_proc_check_suspend_resume(targetproc, MAC_PROC_CHECK_SHUTDOWN_SOCKETS); if (error) { error = EPERM; goto out; } #endif proc_iterate(PROC_ALLPROCLIST | PROC_NOWAITTRANS, networking_defunct_callout, args, NULL, NULL); out: if (targetproc != PROC_NULL) { proc_rele(targetproc); } *ret = error; return error; } #endif /* SOCKETS */ #if DEVELOPMENT || DEBUG /* * PT: Sadly this needs to be in bsd/ as SYSCTL_ macros aren't easily usable from * osfmk/. Ideally this sysctl would live in corpse_info.c */ extern uint32_t total_corpses_allowed; SYSCTL_UINT(_kern, OID_AUTO, total_corpses_allowed, CTLFLAG_RW | CTLFLAG_LOCKED, &total_corpses_allowed, DEFAULT_TOTAL_CORPSES_ALLOWED, "Maximum in-flight corpse count"); #endif /* DEVELOPMENT || DEBUG */ |