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 | /* * Copyright (c) 2000-2016 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) 1982, 1986, 1988, 1990, 1993, 1994, 1995 * 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. * * @(#)tcp_input.c 8.12 (Berkeley) 5/24/95 * $FreeBSD: src/sys/netinet/tcp_input.c,v 1.107.2.16 2001/08/22 00:59:12 silby Exp $ */ /* * 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. */ #include <sys/param.h> #include <sys/systm.h> #include <sys/kernel.h> #include <sys/sysctl.h> #include <sys/malloc.h> #include <sys/mbuf.h> #include <sys/proc.h> /* for proc0 declaration */ #include <sys/protosw.h> #include <sys/socket.h> #include <sys/socketvar.h> #include <sys/syslog.h> #include <sys/mcache.h> #include <sys/kasl.h> #include <kern/cpu_number.h> /* before tcp_seq.h, for tcp_random18() */ #include <machine/endian.h> #include <net/if.h> #include <net/if_types.h> #include <net/route.h> #include <net/ntstat.h> #include <net/dlil.h> #include <netinet/in.h> #include <netinet/in_systm.h> #include <netinet/ip.h> #include <netinet/ip_icmp.h> /* for ICMP_BANDLIM */ #include <netinet/in_var.h> #include <netinet/icmp_var.h> /* for ICMP_BANDLIM */ #include <netinet/in_pcb.h> #include <netinet/ip_var.h> #include <mach/sdt.h> #if INET6 #include <netinet/ip6.h> #include <netinet/icmp6.h> #include <netinet6/nd6.h> #include <netinet6/ip6_var.h> #include <netinet6/in6_pcb.h> #endif #include <netinet/tcp.h> #include <netinet/tcp_cache.h> #include <netinet/tcp_fsm.h> #include <netinet/tcp_seq.h> #include <netinet/tcp_timer.h> #include <netinet/tcp_var.h> #include <netinet/tcp_cc.h> #include <dev/random/randomdev.h> #include <kern/zalloc.h> #if INET6 #include <netinet6/tcp6_var.h> #endif #include <netinet/tcpip.h> #if TCPDEBUG #include <netinet/tcp_debug.h> u_char tcp_saveipgen[40]; /* the size must be of max ip header, now IPv6 */ struct tcphdr tcp_savetcp; #endif /* TCPDEBUG */ #if IPSEC #include <netinet6/ipsec.h> #if INET6 #include <netinet6/ipsec6.h> #endif #include <netkey/key.h> #endif /*IPSEC*/ #if CONFIG_MACF_NET || CONFIG_MACF_SOCKET #include <security/mac_framework.h> #endif /* CONFIG_MACF_NET || CONFIG_MACF_SOCKET */ #include <sys/kdebug.h> #include <netinet/lro_ext.h> #if MPTCP #include <netinet/mptcp_var.h> #include <netinet/mptcp.h> #include <netinet/mptcp_opt.h> #endif /* MPTCP */ #include <corecrypto/ccaes.h> #define DBG_LAYER_BEG NETDBG_CODE(DBG_NETTCP, 0) #define DBG_LAYER_END NETDBG_CODE(DBG_NETTCP, 2) #define DBG_FNC_TCP_INPUT NETDBG_CODE(DBG_NETTCP, (3 << 8)) #define DBG_FNC_TCP_NEWCONN NETDBG_CODE(DBG_NETTCP, (7 << 8)) #define TCP_RTT_HISTORY_EXPIRE_TIME (60 * TCP_RETRANSHZ) #define TCP_RECV_THROTTLE_WIN (5 * TCP_RETRANSHZ) #define TCP_STRETCHACK_ENABLE_PKTCNT 2000 tcp_cc tcp_ccgen; struct tcpstat tcpstat; static int log_in_vain = 0; SYSCTL_INT(_net_inet_tcp, OID_AUTO, log_in_vain, CTLFLAG_RW | CTLFLAG_LOCKED, &log_in_vain, 0, "Log all incoming TCP connections"); static int blackhole = 0; SYSCTL_INT(_net_inet_tcp, OID_AUTO, blackhole, CTLFLAG_RW | CTLFLAG_LOCKED, &blackhole, 0, "Do not send RST when dropping refused connections"); int tcp_delack_enabled = 3; SYSCTL_INT(_net_inet_tcp, OID_AUTO, delayed_ack, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_delack_enabled, 0, "Delay ACK to try and piggyback it onto a data packet"); int tcp_lq_overflow = 1; SYSCTL_INT(_net_inet_tcp, OID_AUTO, tcp_lq_overflow, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_lq_overflow, 0, "Listen Queue Overflow"); int tcp_recv_bg = 0; SYSCTL_INT(_net_inet_tcp, OID_AUTO, recvbg, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_recv_bg, 0, "Receive background"); #if TCP_DROP_SYNFIN static int drop_synfin = 1; SYSCTL_INT(_net_inet_tcp, OID_AUTO, drop_synfin, CTLFLAG_RW | CTLFLAG_LOCKED, &drop_synfin, 0, "Drop TCP packets with SYN+FIN set"); #endif SYSCTL_NODE(_net_inet_tcp, OID_AUTO, reass, CTLFLAG_RW|CTLFLAG_LOCKED, 0, "TCP Segment Reassembly Queue"); static int tcp_reass_overflows = 0; SYSCTL_INT(_net_inet_tcp_reass, OID_AUTO, overflows, CTLFLAG_RD | CTLFLAG_LOCKED, &tcp_reass_overflows, 0, "Global number of TCP Segment Reassembly Queue Overflows"); __private_extern__ int slowlink_wsize = 8192; SYSCTL_INT(_net_inet_tcp, OID_AUTO, slowlink_wsize, CTLFLAG_RW | CTLFLAG_LOCKED, &slowlink_wsize, 0, "Maximum advertised window size for slowlink"); int maxseg_unacked = 8; SYSCTL_INT(_net_inet_tcp, OID_AUTO, maxseg_unacked, CTLFLAG_RW | CTLFLAG_LOCKED, &maxseg_unacked, 0, "Maximum number of outstanding segments left unacked"); int tcp_do_rfc3465 = 1; SYSCTL_INT(_net_inet_tcp, OID_AUTO, rfc3465, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_do_rfc3465, 0, ""); int tcp_do_rfc3465_lim2 = 1; SYSCTL_INT(_net_inet_tcp, OID_AUTO, rfc3465_lim2, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_do_rfc3465_lim2, 0, "Appropriate bytes counting w/ L=2*SMSS"); int rtt_samples_per_slot = 20; int tcp_allowed_iaj = ALLOWED_IAJ; int tcp_acc_iaj_high_thresh = ACC_IAJ_HIGH_THRESH; u_int32_t tcp_autorcvbuf_inc_shift = 3; SYSCTL_INT(_net_inet_tcp, OID_AUTO, recv_allowed_iaj, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_allowed_iaj, 0, "Allowed inter-packet arrival jiter"); #if (DEVELOPMENT || DEBUG) SYSCTL_INT(_net_inet_tcp, OID_AUTO, acc_iaj_high_thresh, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_acc_iaj_high_thresh, 0, "Used in calculating maximum accumulated IAJ"); SYSCTL_INT(_net_inet_tcp, OID_AUTO, autorcvbufincshift, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_autorcvbuf_inc_shift, 0, "Shift for increment in receive socket buffer size"); #endif /* (DEVELOPMENT || DEBUG) */ u_int32_t tcp_do_autorcvbuf = 1; SYSCTL_INT(_net_inet_tcp, OID_AUTO, doautorcvbuf, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_do_autorcvbuf, 0, "Enable automatic socket buffer tuning"); u_int32_t tcp_autorcvbuf_max = 512 * 1024; SYSCTL_INT(_net_inet_tcp, OID_AUTO, autorcvbufmax, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_autorcvbuf_max, 0, "Maximum receive socket buffer size"); u_int32_t tcp_autorcvbuf_max_ca = 512 * 1024; #if (DEBUG || DEVELOPMENT) SYSCTL_INT(_net_inet_tcp, OID_AUTO, autorcvbufmaxca, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_autorcvbuf_max_ca, 0, "Maximum receive socket buffer size"); #endif /* (DEBUG || DEVELOPMENT) */ int sw_lro = 0; SYSCTL_INT(_net_inet_tcp, OID_AUTO, lro, CTLFLAG_RW | CTLFLAG_LOCKED, &sw_lro, 0, "Used to coalesce TCP packets"); int lrodebug = 0; SYSCTL_INT(_net_inet_tcp, OID_AUTO, lrodbg, CTLFLAG_RW | CTLFLAG_LOCKED, &lrodebug, 0, "Used to debug SW LRO"); int lro_start = 4; SYSCTL_INT(_net_inet_tcp, OID_AUTO, lro_startcnt, CTLFLAG_RW | CTLFLAG_LOCKED, &lro_start, 0, "Segments for starting LRO computed as power of 2"); extern int tcp_do_autosendbuf; int limited_txmt = 1; int early_rexmt = 1; int sack_ackadv = 1; int tcp_dsack_enable = 1; #if (DEVELOPMENT || DEBUG) SYSCTL_INT(_net_inet_tcp, OID_AUTO, limited_transmit, CTLFLAG_RW | CTLFLAG_LOCKED, &limited_txmt, 0, "Enable limited transmit"); SYSCTL_INT(_net_inet_tcp, OID_AUTO, early_rexmt, CTLFLAG_RW | CTLFLAG_LOCKED, &early_rexmt, 0, "Enable Early Retransmit"); SYSCTL_INT(_net_inet_tcp, OID_AUTO, sack_ackadv, CTLFLAG_RW | CTLFLAG_LOCKED, &sack_ackadv, 0, "Use SACK with cumulative ack advancement as a dupack"); SYSCTL_INT(_net_inet_tcp, OID_AUTO, dsack_enable, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_dsack_enable, 0, "use DSACK TCP option to report duplicate segments"); #endif /* (DEVELOPMENT || DEBUG) */ extern int tcp_TCPTV_MIN; extern int tcp_acc_iaj_high; extern int tcp_acc_iaj_react_limit; int tcprexmtthresh = 3; u_int32_t tcp_now; struct timeval tcp_uptime; /* uptime when tcp_now was last updated */ lck_spin_t *tcp_uptime_lock; /* Used to sychronize updates to tcp_now */ struct inpcbhead tcb; #define tcb6 tcb /* for KAME src sync over BSD*'s */ struct inpcbinfo tcbinfo; static void tcp_dooptions(struct tcpcb *, u_char *, int, struct tcphdr *, struct tcpopt *); static void tcp_finalize_options(struct tcpcb *, struct tcpopt *, unsigned int); static void tcp_pulloutofband(struct socket *, struct tcphdr *, struct mbuf *, int); static int tcp_reass(struct tcpcb *, struct tcphdr *, int *, struct mbuf *, struct ifnet *); static void tcp_xmit_timer(struct tcpcb *, int, u_int32_t, tcp_seq); static inline unsigned int tcp_maxmtu(struct rtentry *); static inline int tcp_stretch_ack_enable(struct tcpcb *tp, int thflags); static inline void tcp_adaptive_rwtimo_check(struct tcpcb *, int); #if TRAFFIC_MGT static inline void update_iaj_state(struct tcpcb *tp, uint32_t tlen, int reset_size); void compute_iaj(struct tcpcb *tp, int nlropkts, int lro_delay_factor); static void compute_iaj_meat(struct tcpcb *tp, uint32_t cur_iaj); #endif /* TRAFFIC_MGT */ #if INET6 static inline unsigned int tcp_maxmtu6(struct rtentry *); #endif static void tcp_sbrcv_grow(struct tcpcb *tp, struct sockbuf *sb, struct tcpopt *to, u_int32_t tlen, u_int32_t rcvbuf_max); void tcp_sbrcv_trim(struct tcpcb *tp, struct sockbuf *sb); static void tcp_sbsnd_trim(struct sockbuf *sbsnd); static inline void tcp_sbrcv_tstmp_check(struct tcpcb *tp); static inline void tcp_sbrcv_reserve(struct tcpcb *tp, struct sockbuf *sb, u_int32_t newsize, u_int32_t idealsize, u_int32_t rcvbuf_max); static void tcp_bad_rexmt_restore_state(struct tcpcb *tp, struct tcphdr *th); static void tcp_compute_rtt(struct tcpcb *tp, struct tcpopt *to, struct tcphdr *th); static void tcp_early_rexmt_check(struct tcpcb *tp, struct tcphdr *th); static void tcp_bad_rexmt_check(struct tcpcb *tp, struct tcphdr *th, struct tcpopt *to); /* * Constants used for resizing receive socket buffer * when timestamps are not supported */ #define TCPTV_RCVNOTS_QUANTUM 100 #define TCP_RCVNOTS_BYTELEVEL 204800 /* * Constants used for limiting early retransmits * to 10 per minute. */ #define TCP_EARLY_REXMT_WIN (60 * TCP_RETRANSHZ) /* 60 seconds */ #define TCP_EARLY_REXMT_LIMIT 10 extern void ipfwsyslog( int level, const char *format,...); extern int fw_verbose; #if IPFIREWALL extern void ipfw_stealth_stats_incr_tcp(void); #define log_in_vain_log( a ) { \ if ( (log_in_vain == 3 ) && (fw_verbose == 2)) { /* Apple logging, log to ipfw.log */ \ ipfwsyslog a ; \ } else if ( (log_in_vain == 4 ) && (fw_verbose == 2)) { \ ipfw_stealth_stats_incr_tcp(); \ } \ else log a ; \ } #else #define log_in_vain_log( a ) { log a; } #endif int tcp_rcvunackwin = TCPTV_UNACKWIN; int tcp_maxrcvidle = TCPTV_MAXRCVIDLE; int tcp_rcvsspktcnt = TCP_RCV_SS_PKTCOUNT; SYSCTL_INT(_net_inet_tcp, OID_AUTO, rcvsspktcnt, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_rcvsspktcnt, 0, "packets to be seen before receiver stretches acks"); #define DELAY_ACK(tp, th) \ (CC_ALGO(tp)->delay_ack != NULL && CC_ALGO(tp)->delay_ack(tp, th)) static int tcp_dropdropablreq(struct socket *head); static void tcp_newreno_partial_ack(struct tcpcb *tp, struct tcphdr *th); static void update_base_rtt(struct tcpcb *tp, uint32_t rtt); void tcp_set_background_cc(struct socket *so); void tcp_set_foreground_cc(struct socket *so); static void tcp_set_new_cc(struct socket *so, uint16_t cc_index); static void tcp_bwmeas_check(struct tcpcb *tp); #if TRAFFIC_MGT void reset_acc_iaj(struct tcpcb *tp) { tp->acc_iaj = 0; tp->iaj_rwintop = 0; CLEAR_IAJ_STATE(tp); } static inline void update_iaj_state(struct tcpcb *tp, uint32_t size, int rst_size) { if (rst_size > 0) tp->iaj_size = 0; if (tp->iaj_size == 0 || size >= tp->iaj_size) { tp->iaj_size = size; tp->iaj_rcv_ts = tcp_now; tp->iaj_small_pkt = 0; } } /* For every 32 bit unsigned integer(v), this function will find the * largest integer n such that (n*n <= v). This takes at most 16 iterations * irrespective of the value of v and does not involve multiplications. */ static inline int isqrt(unsigned int val) { unsigned int sqrt_cache[11] = {0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100}; unsigned int temp, g=0, b=0x8000, bshft=15; if ( val <= 100) { for (g = 0; g <= 10; ++g) { if (sqrt_cache[g] > val) { g--; break; } else if (sqrt_cache[g] == val) { break; } } } else { do { temp = (((g << 1) + b) << (bshft--)); if (val >= temp) { g += b; val -= temp; } b >>= 1; } while ( b > 0 && val > 0); } return(g); } /* * With LRO, roughly estimate the inter arrival time between * each sub coalesced packet as an average. Count the delay * cur_iaj to be the delay between the last packet received * and the first packet of the LRO stream. Due to round off errors * cur_iaj may be the same as lro_delay_factor. Averaging has * round off errors too. lro_delay_factor may be close to 0 * in steady state leading to lower values fed to compute_iaj_meat. */ void compute_iaj(struct tcpcb *tp, int nlropkts, int lro_delay_factor) { uint32_t cur_iaj = tcp_now - tp->iaj_rcv_ts; uint32_t timediff = 0; if (cur_iaj >= lro_delay_factor) { cur_iaj = cur_iaj - lro_delay_factor; } compute_iaj_meat(tp, cur_iaj); if (nlropkts <= 1) return; nlropkts--; timediff = lro_delay_factor/nlropkts; while (nlropkts > 0) { compute_iaj_meat(tp, timediff); nlropkts--; } } static void compute_iaj_meat(struct tcpcb *tp, uint32_t cur_iaj) { /* When accumulated IAJ reaches MAX_ACC_IAJ in milliseconds, * throttle the receive window to a minimum of MIN_IAJ_WIN packets */ #define MAX_ACC_IAJ (tcp_acc_iaj_high_thresh + tcp_acc_iaj_react_limit) #define IAJ_DIV_SHIFT 4 #define IAJ_ROUNDUP_CONST (1 << (IAJ_DIV_SHIFT - 1)) uint32_t allowed_iaj, acc_iaj = 0; uint32_t mean, temp; int32_t cur_iaj_dev; cur_iaj_dev = (cur_iaj - tp->avg_iaj); /* Allow a jitter of "allowed_iaj" milliseconds. Some connections * may have a constant jitter more than that. We detect this by * using standard deviation. */ allowed_iaj = tp->avg_iaj + tp->std_dev_iaj; if (allowed_iaj < tcp_allowed_iaj) allowed_iaj = tcp_allowed_iaj; /* Initially when the connection starts, the senders congestion * window is small. During this period we avoid throttling a * connection because we do not have a good starting point for * allowed_iaj. IAJ_IGNORE_PKTCNT is used to quietly gloss over * the first few packets. */ if (tp->iaj_pktcnt > IAJ_IGNORE_PKTCNT) { if ( cur_iaj <= allowed_iaj ) { if (tp->acc_iaj >= 2) acc_iaj = tp->acc_iaj - 2; else acc_iaj = 0; } else { acc_iaj = tp->acc_iaj + (cur_iaj - allowed_iaj); } if (acc_iaj > MAX_ACC_IAJ) acc_iaj = MAX_ACC_IAJ; tp->acc_iaj = acc_iaj; } /* Compute weighted average where the history has a weight of * 15 out of 16 and the current value has a weight of 1 out of 16. * This will make the short-term measurements have more weight. * * The addition of 8 will help to round-up the value * instead of round-down */ tp->avg_iaj = (((tp->avg_iaj << IAJ_DIV_SHIFT) - tp->avg_iaj) + cur_iaj + IAJ_ROUNDUP_CONST) >> IAJ_DIV_SHIFT; /* Compute Root-mean-square of deviation where mean is a weighted * average as described above. */ temp = tp->std_dev_iaj * tp->std_dev_iaj; mean = (((temp << IAJ_DIV_SHIFT) - temp) + (cur_iaj_dev * cur_iaj_dev) + IAJ_ROUNDUP_CONST) >> IAJ_DIV_SHIFT; tp->std_dev_iaj = isqrt(mean); DTRACE_TCP3(iaj, struct tcpcb *, tp, uint32_t, cur_iaj, uint32_t, allowed_iaj); return; } #endif /* TRAFFIC_MGT */ /* Check if enough amount of data has been acknowledged since * bw measurement was started */ static void tcp_bwmeas_check(struct tcpcb *tp) { int32_t bw_meas_bytes; uint32_t bw, bytes, elapsed_time; bw_meas_bytes = tp->snd_una - tp->t_bwmeas->bw_start; if ((tp->t_flagsext & TF_BWMEAS_INPROGRESS) != 0 && bw_meas_bytes >= (int32_t)(tp->t_bwmeas->bw_size)) { bytes = bw_meas_bytes; elapsed_time = tcp_now - tp->t_bwmeas->bw_ts; if (elapsed_time > 0) { bw = bytes / elapsed_time; if ( bw > 0) { if (tp->t_bwmeas->bw_sndbw > 0) { tp->t_bwmeas->bw_sndbw = (((tp->t_bwmeas->bw_sndbw << 3) - tp->t_bwmeas->bw_sndbw) + bw) >> 3; } else { tp->t_bwmeas->bw_sndbw = bw; } } } tp->t_flagsext &= ~(TF_BWMEAS_INPROGRESS); } } static int tcp_reass(struct tcpcb *tp, struct tcphdr *th, int *tlenp, struct mbuf *m, struct ifnet *ifp) { struct tseg_qent *q; struct tseg_qent *p = NULL; struct tseg_qent *nq; struct tseg_qent *te = NULL; struct inpcb *inp = tp->t_inpcb; struct socket *so = inp->inp_socket; int flags = 0; int dowakeup = 0; struct mbuf *oodata = NULL; int copy_oodata = 0; u_int16_t qlimit; boolean_t cell = IFNET_IS_CELLULAR(ifp); boolean_t wifi = (!cell && IFNET_IS_WIFI(ifp)); boolean_t wired = (!wifi && IFNET_IS_WIRED(ifp)); boolean_t dsack_set = FALSE; /* * Call with th==0 after become established to * force pre-ESTABLISHED data up to user socket. */ if (th == NULL) goto present; /* * If the reassembly queue already has entries or if we are going * to add a new one, then the connection has reached a loss state. * Reset the stretch-ack algorithm at this point. */ tcp_reset_stretch_ack(tp); #if TRAFFIC_MGT if (tp->acc_iaj > 0) reset_acc_iaj(tp); #endif /* TRAFFIC_MGT */ /* * Limit the number of segments in the reassembly queue to prevent * holding on to too many segments (and thus running out of mbufs). * Make sure to let the missing segment through which caused this * queue. Always keep one global queue entry spare to be able to * process the missing segment. */ qlimit = min(max(100, so->so_rcv.sb_hiwat >> 10), (TCP_AUTORCVBUF_MAX(ifp) >> 10)); if (th->th_seq != tp->rcv_nxt && (tp->t_reassqlen + 1) >= qlimit) { tcp_reass_overflows++; tcpstat.tcps_rcvmemdrop++; m_freem(m); *tlenp = 0; return (0); } /* Allocate a new queue entry. If we can't, just drop the pkt. XXX */ te = (struct tseg_qent *) zalloc(tcp_reass_zone); if (te == NULL) { tcpstat.tcps_rcvmemdrop++; m_freem(m); return (0); } tp->t_reassqlen++; /* * Find a segment which begins after this one does. */ LIST_FOREACH(q, &tp->t_segq, tqe_q) { if (SEQ_GT(q->tqe_th->th_seq, th->th_seq)) break; p = q; } /* * If there is a preceding segment, it may provide some of * our data already. If so, drop the data from the incoming * segment. If it provides all of our data, drop us. */ if (p != NULL) { int i; /* conversion to int (in i) handles seq wraparound */ i = p->tqe_th->th_seq + p->tqe_len - th->th_seq; if (i > 0) { if (TCP_DSACK_ENABLED(tp) && i > 1) { /* * Note duplicate data sequnce numbers * to report in DSACK option */ tp->t_dsack_lseq = th->th_seq; tp->t_dsack_rseq = th->th_seq + min(i, *tlenp); /* * Report only the first part of partial/ * non-contiguous duplicate sequence space */ dsack_set = TRUE; } if (i >= *tlenp) { tcpstat.tcps_rcvduppack++; tcpstat.tcps_rcvdupbyte += *tlenp; if (nstat_collect) { nstat_route_rx(inp->inp_route.ro_rt, 1, *tlenp, NSTAT_RX_FLAG_DUPLICATE); INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, 1); INP_ADD_STAT(inp, cell, wifi, wired, rxbytes, *tlenp); tp->t_stat.rxduplicatebytes += *tlenp; } m_freem(m); zfree(tcp_reass_zone, te); te = NULL; tp->t_reassqlen--; /* * Try to present any queued data * at the left window edge to the user. * This is needed after the 3-WHS * completes. */ goto present; } m_adj(m, i); *tlenp -= i; th->th_seq += i; } } tp->t_rcvoopack++; tcpstat.tcps_rcvoopack++; tcpstat.tcps_rcvoobyte += *tlenp; if (nstat_collect) { nstat_route_rx(inp->inp_route.ro_rt, 1, *tlenp, NSTAT_RX_FLAG_OUT_OF_ORDER); INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, 1); INP_ADD_STAT(inp, cell, wifi, wired, rxbytes, *tlenp); tp->t_stat.rxoutoforderbytes += *tlenp; } /* * While we overlap succeeding segments trim them or, * if they are completely covered, dequeue them. */ while (q) { int i = (th->th_seq + *tlenp) - q->tqe_th->th_seq; if (i <= 0) break; /* * Report only the first part of partial/non-contiguous * duplicate segment in dsack option. The variable * dsack_set will be true if a previous entry has some of * the duplicate sequence space. */ if (TCP_DSACK_ENABLED(tp) && i > 1 && !dsack_set) { if (tp->t_dsack_lseq == 0) { tp->t_dsack_lseq = q->tqe_th->th_seq; tp->t_dsack_rseq = tp->t_dsack_lseq + min(i, q->tqe_len); } else { /* * this segment overlaps data in multple * entries in the reassembly queue, move * the right sequence number further. */ tp->t_dsack_rseq = tp->t_dsack_rseq + min(i, q->tqe_len); } } if (i < q->tqe_len) { q->tqe_th->th_seq += i; q->tqe_len -= i; m_adj(q->tqe_m, i); break; } nq = LIST_NEXT(q, tqe_q); LIST_REMOVE(q, tqe_q); m_freem(q->tqe_m); zfree(tcp_reass_zone, q); tp->t_reassqlen--; q = nq; } /* Insert the new segment queue entry into place. */ te->tqe_m = m; te->tqe_th = th; te->tqe_len = *tlenp; if (p == NULL) { LIST_INSERT_HEAD(&tp->t_segq, te, tqe_q); } else { LIST_INSERT_AFTER(p, te, tqe_q); } /* * New out-of-order data exists, and is pointed to by * queue entry te. Set copy_oodata to 1 so out-of-order data * can be copied off to sockbuf after in-order data * is copied off. */ if (!(so->so_state & SS_CANTRCVMORE)) copy_oodata = 1; present: /* * Present data to user, advancing rcv_nxt through * completed sequence space. */ if (!TCPS_HAVEESTABLISHED(tp->t_state)) return (0); q = LIST_FIRST(&tp->t_segq); if (!q || q->tqe_th->th_seq != tp->rcv_nxt) { /* Stop using LRO once out of order packets arrive */ if (tp->t_flagsext & TF_LRO_OFFLOADED) { tcp_lro_remove_state(inp->inp_laddr, inp->inp_faddr, th->th_dport, th->th_sport); tp->t_flagsext &= ~TF_LRO_OFFLOADED; } /* * continue processing if out-of-order data * can be delivered */ if (q && (so->so_flags & SOF_ENABLE_MSGS)) goto msg_unordered_delivery; return (0); } /* * If there is already another thread doing reassembly for this * connection, it is better to let it finish the job -- * (radar 16316196) */ if (tp->t_flagsext & TF_REASS_INPROG) return (0); tp->t_flagsext |= TF_REASS_INPROG; /* lost packet was recovered, so ooo data can be returned */ tcpstat.tcps_recovered_pkts++; do { tp->rcv_nxt += q->tqe_len; flags = q->tqe_th->th_flags & TH_FIN; LIST_REMOVE(q, tqe_q); if (so->so_state & SS_CANTRCVMORE) { m_freem(q->tqe_m); } else { so_recv_data_stat(so, q->tqe_m, 0); /* XXXX */ if (so->so_flags & SOF_ENABLE_MSGS) { /* * Append the inorder data as a message to the * receive socket buffer. Also check to see if * the data we are about to deliver is the same * data that we wanted to pass up to the user * out of order. If so, reset copy_oodata -- * the received data filled a gap, and * is now in order! */ if (q == te) copy_oodata = 0; } if (sbappendstream_rcvdemux(so, q->tqe_m, q->tqe_th->th_seq - (tp->irs + 1), 0)) dowakeup = 1; if (tp->t_flagsext & TF_LRO_OFFLOADED) { tcp_update_lro_seq(tp->rcv_nxt, inp->inp_laddr, inp->inp_faddr, th->th_dport, th->th_sport); } } zfree(tcp_reass_zone, q); tp->t_reassqlen--; q = LIST_FIRST(&tp->t_segq); } while (q && q->tqe_th->th_seq == tp->rcv_nxt); tp->t_flagsext &= ~TF_REASS_INPROG; #if INET6 if ((inp->inp_vflag & INP_IPV6) != 0) { KERNEL_DEBUG(DBG_LAYER_BEG, ((inp->inp_fport << 16) | inp->inp_lport), (((inp->in6p_laddr.s6_addr16[0] & 0xffff) << 16) | (inp->in6p_faddr.s6_addr16[0] & 0xffff)), 0,0,0); } else #endif { KERNEL_DEBUG(DBG_LAYER_BEG, ((inp->inp_fport << 16) | inp->inp_lport), (((inp->inp_laddr.s_addr & 0xffff) << 16) | (inp->inp_faddr.s_addr & 0xffff)), 0,0,0); } msg_unordered_delivery: /* Deliver out-of-order data as a message */ if (te && (so->so_flags & SOF_ENABLE_MSGS) && copy_oodata && te->tqe_len) { /* * make a copy of the mbuf to be delivered up to * the user, and add it to the sockbuf */ oodata = m_copym(te->tqe_m, 0, M_COPYALL, M_DONTWAIT); if (oodata != NULL) { if (sbappendmsgstream_rcv(&so->so_rcv, oodata, te->tqe_th->th_seq - (tp->irs + 1), 1)) { dowakeup = 1; tcpstat.tcps_msg_unopkts++; } else { tcpstat.tcps_msg_unoappendfail++; } } } if (dowakeup) sorwakeup(so); /* done with socket lock held */ return (flags); } /* * Reduce congestion window -- used when ECN is seen or when a tail loss * probe recovers the last packet. */ static void tcp_reduce_congestion_window( struct tcpcb *tp) { /* * If the current tcp cc module has * defined a hook for tasks to run * before entering FR, call it */ if (CC_ALGO(tp)->pre_fr != NULL) CC_ALGO(tp)->pre_fr(tp); ENTER_FASTRECOVERY(tp); if (tp->t_flags & TF_SENTFIN) tp->snd_recover = tp->snd_max - 1; else tp->snd_recover = tp->snd_max; tp->t_timer[TCPT_REXMT] = 0; tp->t_timer[TCPT_PTO] = 0; tp->t_rtttime = 0; if (tp->t_flagsext & TF_CWND_NONVALIDATED) { tcp_cc_adjust_nonvalidated_cwnd(tp); } else { tp->snd_cwnd = tp->snd_ssthresh + tp->t_maxseg * tcprexmtthresh; } } /* * This function is called upon reception of data on a socket. It's purpose is * to handle the adaptive keepalive timers that monitor whether the connection * is making progress. First the adaptive read-timer, second the TFO probe-timer. * * The application wants to get an event if there is a stall during read. * Set the initial keepalive timeout to be equal to twice RTO. * * If the outgoing interface is in marginal conditions, we need to * enable read probes for that too. */ static inline void tcp_adaptive_rwtimo_check(struct tcpcb *tp, int tlen) { struct ifnet *outifp = tp->t_inpcb->inp_last_outifp; if ((tp->t_adaptive_rtimo > 0 || (outifp != NULL && (outifp->if_eflags & IFEF_PROBE_CONNECTIVITY))) && tlen > 0 && tp->t_state == TCPS_ESTABLISHED) { tp->t_timer[TCPT_KEEP] = OFFSET_FROM_START(tp, (TCP_REXMTVAL(tp) << 1)); tp->t_flagsext |= TF_DETECT_READSTALL; tp->t_rtimo_probes = 0; } } inline void tcp_keepalive_reset(struct tcpcb *tp) { tp->t_timer[TCPT_KEEP] = OFFSET_FROM_START(tp, TCP_CONN_KEEPIDLE(tp)); tp->t_flagsext &= ~(TF_DETECT_READSTALL); tp->t_rtimo_probes = 0; } /* * TCP input routine, follows pages 65-76 of the * protocol specification dated September, 1981 very closely. */ #if INET6 int tcp6_input(struct mbuf **mp, int *offp, int proto) { #pragma unused(proto) struct mbuf *m = *mp; uint32_t ia6_flags; struct ifnet *ifp = m->m_pkthdr.rcvif; IP6_EXTHDR_CHECK(m, *offp, sizeof(struct tcphdr), return IPPROTO_DONE); /* Expect 32-bit aligned data pointer on strict-align platforms */ MBUF_STRICT_DATA_ALIGNMENT_CHECK_32(m); /* * draft-itojun-ipv6-tcp-to-anycast * better place to put this in? */ if (ip6_getdstifaddr_info(m, NULL, &ia6_flags) == 0) { if (ia6_flags & IN6_IFF_ANYCAST) { struct ip6_hdr *ip6; ip6 = mtod(m, struct ip6_hdr *); icmp6_error(m, ICMP6_DST_UNREACH, ICMP6_DST_UNREACH_ADDR, (caddr_t)&ip6->ip6_dst - (caddr_t)ip6); IF_TCP_STATINC(ifp, icmp6unreach); return (IPPROTO_DONE); } } tcp_input(m, *offp); return (IPPROTO_DONE); } #endif /* Depending on the usage of mbuf space in the system, this function * will return true or false. This is used to determine if a socket * buffer can take more memory from the system for auto-tuning or not. */ u_int8_t tcp_cansbgrow(struct sockbuf *sb) { /* Calculate the host level space limit in terms of MSIZE buffers. * We can use a maximum of half of the available mbuf space for * socket buffers. */ u_int32_t mblim = ((nmbclusters >> 1) << (MCLSHIFT - MSIZESHIFT)); /* Calculate per sb limit in terms of bytes. We optimize this limit * for upto 16 socket buffers. */ u_int32_t sbspacelim = ((nmbclusters >> 4) << MCLSHIFT); if ((total_sbmb_cnt < mblim) && (sb->sb_hiwat < sbspacelim)) { return(1); } else { OSIncrementAtomic64(&sbmb_limreached); } return(0); } static void tcp_sbrcv_reserve(struct tcpcb *tp, struct sockbuf *sbrcv, u_int32_t newsize, u_int32_t idealsize, u_int32_t rcvbuf_max) { /* newsize should not exceed max */ newsize = min(newsize, rcvbuf_max); /* The receive window scale negotiated at the * beginning of the connection will also set a * limit on the socket buffer size */ newsize = min(newsize, TCP_MAXWIN << tp->rcv_scale); /* Set new socket buffer size */ if (newsize > sbrcv->sb_hiwat && (sbreserve(sbrcv, newsize) == 1)) { sbrcv->sb_idealsize = min(max(sbrcv->sb_idealsize, (idealsize != 0) ? idealsize : newsize), rcvbuf_max); /* Again check the limit set by the advertised * window scale */ sbrcv->sb_idealsize = min(sbrcv->sb_idealsize, TCP_MAXWIN << tp->rcv_scale); } } /* * This function is used to grow a receive socket buffer. It * will take into account system-level memory usage and the * bandwidth available on the link to make a decision. */ static void tcp_sbrcv_grow(struct tcpcb *tp, struct sockbuf *sbrcv, struct tcpopt *to, u_int32_t pktlen, u_int32_t rcvbuf_max) { struct socket *so = sbrcv->sb_so; /* * Do not grow the receive socket buffer if * - auto resizing is disabled, globally or on this socket * - the high water mark already reached the maximum * - the stream is in background and receive side is being * throttled * - if there are segments in reassembly queue indicating loss, * do not need to increase recv window during recovery as more * data is not going to be sent. A duplicate ack sent during * recovery should not change the receive window */ if (tcp_do_autorcvbuf == 0 || (sbrcv->sb_flags & SB_AUTOSIZE) == 0 || tcp_cansbgrow(sbrcv) == 0 || sbrcv->sb_hiwat >= rcvbuf_max || (tp->t_flagsext & TF_RECV_THROTTLE) || (so->so_flags1 & SOF1_EXTEND_BK_IDLE_WANTED) || !LIST_EMPTY(&tp->t_segq)) { /* Can not resize the socket buffer, just return */ goto out; } if (TSTMP_GT(tcp_now, tp->rfbuf_ts + TCPTV_RCVBUFIDLE)) { /* If there has been an idle period in the * connection, just restart the measurement */ goto out; } if (!TSTMP_SUPPORTED(tp)) { /* * Timestamp option is not supported on this connection. * If the connection reached a state to indicate that * the receive socket buffer needs to grow, increase * the high water mark. */ if (TSTMP_GEQ(tcp_now, tp->rfbuf_ts + TCPTV_RCVNOTS_QUANTUM)) { if (tp->rfbuf_cnt >= TCP_RCVNOTS_BYTELEVEL) { tcp_sbrcv_reserve(tp, sbrcv, tcp_autorcvbuf_max, 0, tcp_autorcvbuf_max); } goto out; } else { tp->rfbuf_cnt += pktlen; return; } } else if (to->to_tsecr != 0) { /* * If the timestamp shows that one RTT has * completed, we can stop counting the * bytes. Here we consider increasing * the socket buffer if the bandwidth measured in * last rtt, is more than half of sb_hiwat, this will * help to scale the buffer according to the bandwidth * on the link. */ if (TSTMP_GEQ(to->to_tsecr, tp->rfbuf_ts)) { if (tp->rfbuf_cnt > (sbrcv->sb_hiwat - (sbrcv->sb_hiwat >> 1))) { int32_t rcvbuf_inc, min_incr; /* * Increment the receive window by a * multiple of maximum sized segments. * This will prevent a connection from * sending smaller segments on wire if it * is limited by the receive window. * * Set the ideal size based on current * bandwidth measurements. We set the * ideal size on receive socket buffer to * be twice the bandwidth delay product. */ rcvbuf_inc = (tp->rfbuf_cnt << 1) - sbrcv->sb_hiwat; /* * Make the increment equal to 8 segments * at least */ min_incr = tp->t_maxseg << tcp_autorcvbuf_inc_shift; if (rcvbuf_inc < min_incr) rcvbuf_inc = min_incr; rcvbuf_inc = (rcvbuf_inc / tp->t_maxseg) * tp->t_maxseg; tcp_sbrcv_reserve(tp, sbrcv, sbrcv->sb_hiwat + rcvbuf_inc, (tp->rfbuf_cnt * 2), rcvbuf_max); } goto out; } else { tp->rfbuf_cnt += pktlen; return; } } out: /* Restart the measurement */ tp->rfbuf_ts = 0; tp->rfbuf_cnt = 0; return; } /* This function will trim the excess space added to the socket buffer * to help a slow-reading app. The ideal-size of a socket buffer depends * on the link bandwidth or it is set by an application and we aim to * reach that size. */ void tcp_sbrcv_trim(struct tcpcb *tp, struct sockbuf *sbrcv) { if (tcp_do_autorcvbuf == 1 && sbrcv->sb_idealsize > 0 && sbrcv->sb_hiwat > sbrcv->sb_idealsize) { int32_t trim; /* compute the difference between ideal and current sizes */ u_int32_t diff = sbrcv->sb_hiwat - sbrcv->sb_idealsize; /* Compute the maximum advertised window for * this connection. */ u_int32_t advwin = tp->rcv_adv - tp->rcv_nxt; /* How much can we trim the receive socket buffer? * 1. it can not be trimmed beyond the max rcv win advertised * 2. if possible, leave 1/16 of bandwidth*delay to * avoid closing the win completely */ u_int32_t leave = max(advwin, (sbrcv->sb_idealsize >> 4)); /* Sometimes leave can be zero, in that case leave at least * a few segments worth of space. */ if (leave == 0) leave = tp->t_maxseg << tcp_autorcvbuf_inc_shift; trim = sbrcv->sb_hiwat - (sbrcv->sb_cc + leave); trim = imin(trim, (int32_t)diff); if (trim > 0) sbreserve(sbrcv, (sbrcv->sb_hiwat - trim)); } } /* We may need to trim the send socket buffer size for two reasons: * 1. if the rtt seen on the connection is climbing up, we do not * want to fill the buffers any more. * 2. if the congestion win on the socket backed off, there is no need * to hold more mbufs for that connection than what the cwnd will allow. */ void tcp_sbsnd_trim(struct sockbuf *sbsnd) { if (tcp_do_autosendbuf == 1 && ((sbsnd->sb_flags & (SB_AUTOSIZE | SB_TRIM)) == (SB_AUTOSIZE | SB_TRIM)) && (sbsnd->sb_idealsize > 0) && (sbsnd->sb_hiwat > sbsnd->sb_idealsize)) { u_int32_t trim = 0; if (sbsnd->sb_cc <= sbsnd->sb_idealsize) { trim = sbsnd->sb_hiwat - sbsnd->sb_idealsize; } else { trim = sbsnd->sb_hiwat - sbsnd->sb_cc; } sbreserve(sbsnd, (sbsnd->sb_hiwat - trim)); } if (sbsnd->sb_hiwat <= sbsnd->sb_idealsize) sbsnd->sb_flags &= ~(SB_TRIM); } /* * If timestamp option was not negotiated on this connection * and this connection is on the receiving side of a stream * then we can not measure the delay on the link accurately. * Instead of enabling automatic receive socket buffer * resizing, just give more space to the receive socket buffer. */ static inline void tcp_sbrcv_tstmp_check(struct tcpcb *tp) { struct socket *so = tp->t_inpcb->inp_socket; u_int32_t newsize = 2 * tcp_recvspace; struct sockbuf *sbrcv = &so->so_rcv; if ((tp->t_flags & (TF_REQ_TSTMP | TF_RCVD_TSTMP)) != (TF_REQ_TSTMP | TF_RCVD_TSTMP) && (sbrcv->sb_flags & SB_AUTOSIZE) != 0) { tcp_sbrcv_reserve(tp, sbrcv, newsize, 0, newsize); } } /* A receiver will evaluate the flow of packets on a connection * to see if it can reduce ack traffic. The receiver will start * stretching acks if all of the following conditions are met: * 1. tcp_delack_enabled is set to 3 * 2. If the bytes received in the last 100ms is greater than a threshold * defined by maxseg_unacked * 3. If the connection has not been idle for tcp_maxrcvidle period. * 4. If the connection has seen enough packets to let the slow-start * finish after connection establishment or after some packet loss. * * The receiver will stop stretching acks if there is congestion/reordering * as indicated by packets on reassembly queue or an ECN. If the delayed-ack * timer fires while stretching acks, it means that the packet flow has gone * below the threshold defined by maxseg_unacked and the receiver will stop * stretching acks. The receiver gets no indication when slow-start is completed * or when the connection reaches an idle state. That is why we use * tcp_rcvsspktcnt to cover slow-start and tcp_maxrcvidle to identify idle * state. */ static inline int tcp_stretch_ack_enable(struct tcpcb *tp, int thflags) { if (tp->rcv_by_unackwin >= (maxseg_unacked * tp->t_maxseg) && TSTMP_GEQ(tp->rcv_unackwin, tcp_now)) tp->t_flags |= TF_STREAMING_ON; else tp->t_flags &= ~TF_STREAMING_ON; /* If there has been an idle time, reset streaming detection */ if (TSTMP_GT(tcp_now, tp->rcv_unackwin + tcp_maxrcvidle)) tp->t_flags &= ~TF_STREAMING_ON; /* * If there are flags other than TH_ACK set, reset streaming * detection */ if (thflags & ~TH_ACK) tp->t_flags &= ~TF_STREAMING_ON; if (tp->t_flagsext & TF_DISABLE_STRETCHACK) { if (tp->rcv_nostrack_pkts >= TCP_STRETCHACK_ENABLE_PKTCNT) { tp->t_flagsext &= ~TF_DISABLE_STRETCHACK; tp->rcv_nostrack_pkts = 0; tp->rcv_nostrack_ts = 0; } else { tp->rcv_nostrack_pkts++; } } if (!(tp->t_flagsext & (TF_NOSTRETCHACK|TF_DISABLE_STRETCHACK)) && (tp->t_flags & TF_STREAMING_ON) && (!(tp->t_flagsext & TF_RCVUNACK_WAITSS) || (tp->rcv_waitforss >= tcp_rcvsspktcnt))) { return(1); } return(0); } /* * Reset the state related to stretch-ack algorithm. This will make * the receiver generate an ack every other packet. The receiver * will start re-evaluating the rate at which packets come to decide * if it can benefit by lowering the ack traffic. */ void tcp_reset_stretch_ack(struct tcpcb *tp) { tp->t_flags &= ~(TF_STRETCHACK|TF_STREAMING_ON); tp->rcv_by_unackwin = 0; tp->rcv_unackwin = tcp_now + tcp_rcvunackwin; /* * When there is packet loss or packet re-ordering or CWR due to * ECN, the sender's congestion window is reduced. In these states, * generate an ack for every other packet for some time to allow * the sender's congestion window to grow. */ tp->t_flagsext |= TF_RCVUNACK_WAITSS; tp->rcv_waitforss = 0; } /* * The last packet was a retransmission, check if this ack * indicates that the retransmission was spurious. * * If the connection supports timestamps, we could use it to * detect if the last retransmit was not needed. Otherwise, * we check if the ACK arrived within RTT/2 window, then it * was a mistake to do the retransmit in the first place. * * This function will return 1 if it is a spurious retransmit, * 0 otherwise. */ int tcp_detect_bad_rexmt(struct tcpcb *tp, struct tcphdr *th, struct tcpopt *to, u_int32_t rxtime) { int32_t tdiff, bad_rexmt_win; bad_rexmt_win = (tp->t_srtt >> (TCP_RTT_SHIFT + 1)); /* If the ack has ECN CE bit, then cwnd has to be adjusted */ if (TCP_ECN_ENABLED(tp) && (th->th_flags & TH_ECE)) return (0); if (TSTMP_SUPPORTED(tp)) { if (rxtime > 0 && (to->to_flags & TOF_TS) && to->to_tsecr != 0 && TSTMP_LT(to->to_tsecr, rxtime)) return (1); } else { if ((tp->t_rxtshift == 1 || (tp->t_flagsext & TF_SENT_TLPROBE)) && rxtime > 0) { tdiff = (int32_t)(tcp_now - rxtime); if (tdiff < bad_rexmt_win) return(1); } } return(0); } /* * Restore congestion window state if a spurious timeout * was detected. */ static void tcp_bad_rexmt_restore_state(struct tcpcb *tp, struct tcphdr *th) { if (TSTMP_SUPPORTED(tp)) { u_int32_t fsize, acked; fsize = tp->snd_max - th->th_ack; acked = BYTES_ACKED(th, tp); /* * Implement bad retransmit recovery as * described in RFC 4015. */ tp->snd_ssthresh = tp->snd_ssthresh_prev; /* Initialize cwnd to the initial window */ if (CC_ALGO(tp)->cwnd_init != NULL) CC_ALGO(tp)->cwnd_init(tp); tp->snd_cwnd = fsize + min(acked, tp->snd_cwnd); } else { tp->snd_cwnd = tp->snd_cwnd_prev; tp->snd_ssthresh = tp->snd_ssthresh_prev; if (tp->t_flags & TF_WASFRECOVERY) ENTER_FASTRECOVERY(tp); /* Do not use the loss flight size in this case */ tp->t_lossflightsize = 0; } tp->snd_cwnd = max(tp->snd_cwnd, TCP_CC_CWND_INIT_BYTES); tp->snd_recover = tp->snd_recover_prev; tp->snd_nxt = tp->snd_max; /* Fix send socket buffer to reflect the change in cwnd */ tcp_bad_rexmt_fix_sndbuf(tp); /* * This RTT might reflect the extra delay induced * by the network. Skip using this sample for RTO * calculation and mark the connection so we can * recompute RTT when the next eligible sample is * found. */ tp->t_flagsext |= TF_RECOMPUTE_RTT; tp->t_badrexmt_time = tcp_now; tp->t_rtttime = 0; } /* * If the previous packet was sent in retransmission timer, and it was * not needed, then restore the congestion window to the state before that * transmission. * * If the last packet was sent in tail loss probe timeout, check if that * recovered the last packet. If so, that will indicate a real loss and * the congestion window needs to be lowered. */ static void tcp_bad_rexmt_check(struct tcpcb *tp, struct tcphdr *th, struct tcpopt *to) { if (tp->t_rxtshift > 0 && tcp_detect_bad_rexmt(tp, th, to, tp->t_rxtstart)) { ++tcpstat.tcps_sndrexmitbad; tcp_bad_rexmt_restore_state(tp, th); tcp_ccdbg_trace(tp, th, TCP_CC_BAD_REXMT_RECOVERY); } else if ((tp->t_flagsext & TF_SENT_TLPROBE) && tp->t_tlphighrxt > 0 && SEQ_GEQ(th->th_ack, tp->t_tlphighrxt) && !tcp_detect_bad_rexmt(tp, th, to, tp->t_tlpstart)) { /* * check DSACK information also to make sure that * the TLP was indeed needed */ if (tcp_rxtseg_dsack_for_tlp(tp)) { /* * received a DSACK to indicate that TLP was * not needed */ tcp_rxtseg_clean(tp); goto out; } /* * The tail loss probe recovered the last packet and * we need to adjust the congestion window to take * this loss into account. */ ++tcpstat.tcps_tlp_recoverlastpkt; if (!IN_FASTRECOVERY(tp)) { tcp_reduce_congestion_window(tp); EXIT_FASTRECOVERY(tp); } tcp_ccdbg_trace(tp, th, TCP_CC_TLP_RECOVER_LASTPACKET); } else if (tcp_rxtseg_detect_bad_rexmt(tp, th->th_ack)) { /* * All of the retransmitted segments were duplicated, this * can be an indication of bad fast retransmit. */ tcpstat.tcps_dsack_badrexmt++; tcp_bad_rexmt_restore_state(tp, th); tcp_ccdbg_trace(tp, th, TCP_CC_DSACK_BAD_REXMT); tcp_rxtseg_clean(tp); } out: tp->t_flagsext &= ~(TF_SENT_TLPROBE); tp->t_tlphighrxt = 0; tp->t_tlpstart = 0; /* * check if the latest ack was for a segment sent during PMTU * blackhole detection. If the timestamp on the ack is before * PMTU blackhole detection, then revert the size of the max * segment to previous size. */ if (tp->t_rxtshift > 0 && (tp->t_flags & TF_BLACKHOLE) && tp->t_pmtud_start_ts > 0 && TSTMP_SUPPORTED(tp)) { if ((to->to_flags & TOF_TS) && to->to_tsecr != 0 && TSTMP_LT(to->to_tsecr, tp->t_pmtud_start_ts)) { tcp_pmtud_revert_segment_size(tp); } } if (tp->t_pmtud_start_ts > 0) tp->t_pmtud_start_ts = 0; } /* * Check if early retransmit can be attempted according to RFC 5827. * * If packet reordering is detected on a connection, fast recovery will * be delayed until it is clear that the packet was lost and not reordered. * But reordering detection is done only when SACK is enabled. * * On connections that do not support SACK, there is a limit on the number * of early retransmits that can be done per minute. This limit is needed * to make sure that too many packets are not retransmitted when there is * packet reordering. */ static void tcp_early_rexmt_check (struct tcpcb *tp, struct tcphdr *th) { u_int32_t obytes, snd_off; int32_t snd_len; struct socket *so = tp->t_inpcb->inp_socket; if (early_rexmt && (SACK_ENABLED(tp) || tp->t_early_rexmt_count < TCP_EARLY_REXMT_LIMIT) && SEQ_GT(tp->snd_max, tp->snd_una) && (tp->t_dupacks == 1 || (SACK_ENABLED(tp) && !TAILQ_EMPTY(&tp->snd_holes)))) { /* * If there are only a few outstanding * segments on the connection, we might need * to lower the retransmit threshold. This * will allow us to do Early Retransmit as * described in RFC 5827. */ if (SACK_ENABLED(tp) && !TAILQ_EMPTY(&tp->snd_holes)) { obytes = (tp->snd_max - tp->snd_fack) + tp->sackhint.sack_bytes_rexmit; } else { obytes = (tp->snd_max - tp->snd_una); } /* * In order to lower retransmit threshold the * following two conditions must be met. * 1. the amount of outstanding data is less * than 4*SMSS bytes * 2. there is no unsent data ready for * transmission or the advertised window * will limit sending new segments. */ snd_off = tp->snd_max - tp->snd_una; snd_len = min(so->so_snd.sb_cc, tp->snd_wnd) - snd_off; if (obytes < (tp->t_maxseg << 2) && snd_len <= 0) { u_int32_t osegs; osegs = obytes / tp->t_maxseg; if ((osegs * tp->t_maxseg) < obytes) osegs++; /* * Since the connection might have already * received some dupacks, we add them to * to the outstanding segments count to get * the correct retransmit threshold. * * By checking for early retransmit after * receiving some duplicate acks when SACK * is supported, the connection will * enter fast recovery even if multiple * segments are lost in the same window. */ osegs += tp->t_dupacks; if (osegs < 4) { tp->t_rexmtthresh = ((osegs - 1) > 1) ? (osegs - 1) : 1; tp->t_rexmtthresh = min(tp->t_rexmtthresh, tcprexmtthresh); tp->t_rexmtthresh = max(tp->t_rexmtthresh, tp->t_dupacks); if (tp->t_early_rexmt_count == 0) tp->t_early_rexmt_win = tcp_now; if (tp->t_flagsext & TF_SENT_TLPROBE) { tcpstat.tcps_tlp_recovery++; tcp_ccdbg_trace(tp, th, TCP_CC_TLP_RECOVERY); } else { tcpstat.tcps_early_rexmt++; tp->t_early_rexmt_count++; tcp_ccdbg_trace(tp, th, TCP_CC_EARLY_RETRANSMIT); } } } } /* * If we ever sent a TLP probe, the acknowledgement will trigger * early retransmit because the value of snd_fack will be close * to snd_max. This will take care of adjustments to the * congestion window. So we can reset TF_SENT_PROBE flag. */ tp->t_flagsext &= ~(TF_SENT_TLPROBE); tp->t_tlphighrxt = 0; tp->t_tlpstart = 0; } static boolean_t tcp_tfo_syn(struct tcpcb *tp, struct tcpopt *to) { u_char out[CCAES_BLOCK_SIZE]; unsigned char len; if (!(to->to_flags & (TOF_TFO | TOF_TFOREQ)) || !(tcp_fastopen & TCP_FASTOPEN_SERVER)) return (FALSE); if ((to->to_flags & TOF_TFOREQ)) { tp->t_tfo_flags |= TFO_F_OFFER_COOKIE; tp->t_tfo_stats |= TFO_S_COOKIEREQ_RECV; tcpstat.tcps_tfo_cookie_req_rcv++; return (FALSE); } /* Ok, then it must be an offered cookie. We need to check that ... */ tcp_tfo_gen_cookie(tp->t_inpcb, out, sizeof(out)); len = *to->to_tfo - TCPOLEN_FASTOPEN_REQ; to->to_tfo++; if (memcmp(out, to->to_tfo, len)) { /* Cookies are different! Let's return and offer a new cookie */ tp->t_tfo_flags |= TFO_F_OFFER_COOKIE; tp->t_tfo_stats |= TFO_S_COOKIE_INVALID; tcpstat.tcps_tfo_cookie_invalid++; return (FALSE); } if (OSIncrementAtomic(&tcp_tfo_halfcnt) >= tcp_tfo_backlog) { /* Need to decrement again as we just increased it... */ OSDecrementAtomic(&tcp_tfo_halfcnt); return (FALSE); } tp->t_tfo_flags |= TFO_F_COOKIE_VALID; tp->t_tfo_stats |= TFO_S_SYNDATA_RCV; tcpstat.tcps_tfo_syn_data_rcv++; return (TRUE); } static void tcp_tfo_synack(struct tcpcb *tp, struct tcpopt *to) { if (to->to_flags & TOF_TFO) { unsigned char len = *to->to_tfo - TCPOLEN_FASTOPEN_REQ; /* * If this happens, things have gone terribly wrong. len should * have been checked in tcp_dooptions. */ VERIFY(len <= TFO_COOKIE_LEN_MAX); to->to_tfo++; tcp_cache_set_cookie(tp, to->to_tfo, len); tcp_heuristic_tfo_success(tp); tp->t_tfo_stats |= TFO_S_COOKIE_RCV; tcpstat.tcps_tfo_cookie_rcv++; if (tp->t_tfo_flags & TFO_F_COOKIE_SENT) { tcpstat.tcps_tfo_cookie_wrong++; tp->t_tfo_stats |= TFO_S_COOKIE_WRONG; } } else { /* * Thus, no cookie in the response, but we either asked for one * or sent SYN+DATA. Now, we need to check whether we had to * rexmit the SYN. If that's the case, it's better to start * backing of TFO-cookie requests. */ if (tp->t_tfo_flags & TFO_F_SYN_LOSS) { tp->t_tfo_stats |= TFO_S_SYN_LOSS; tcpstat.tcps_tfo_syn_loss++; tcp_heuristic_tfo_loss(tp); } else { if (tp->t_tfo_flags & TFO_F_COOKIE_REQ) { tp->t_tfo_stats |= TFO_S_NO_COOKIE_RCV; tcpstat.tcps_tfo_no_cookie_rcv++; } tcp_heuristic_tfo_success(tp); } } } static void tcp_tfo_rcv_probe(struct tcpcb *tp, int tlen) { if (tlen == 0) { tp->t_tfo_probe_state = TFO_PROBE_PROBING; /* * We send the probe out rather quickly (after one RTO). It does not * really hurt that much, it's only one additional segment on the wire. */ tp->t_timer[TCPT_KEEP] = OFFSET_FROM_START(tp, (TCP_REXMTVAL(tp))); } else { /* If SYN/ACK+data, don't probe. We got the data! */ tcp_heuristic_tfo_rcv_good(tp); } } static void tcp_tfo_rcv_data(struct tcpcb *tp) { /* Transition from PROBING to NONE as data has been received */ if (tp->t_tfo_probe_state >= TFO_PROBE_PROBING) { tp->t_tfo_probe_state = TFO_PROBE_NONE; /* Data has been received - we are good to go! */ tcp_heuristic_tfo_rcv_good(tp); } } static void tcp_tfo_rcv_ack(struct tcpcb *tp, struct tcphdr *th) { if (tp->t_tfo_probe_state == TFO_PROBE_PROBING && tp->t_tfo_probes > 0) { if (th->th_seq == tp->rcv_nxt) { /* No hole, so stop probing */ tp->t_tfo_probe_state = TFO_PROBE_NONE; } else if (SEQ_GT(th->th_seq, tp->rcv_nxt)) { /* There is a hole! Wait a bit for data... */ tp->t_tfo_probe_state = TFO_PROBE_WAIT_DATA; tp->t_timer[TCPT_KEEP] = OFFSET_FROM_START(tp, TCP_REXMTVAL(tp)); } } } /* * Update snd_wnd information. */ static inline bool tcp_update_window(struct tcpcb *tp, int thflags, struct tcphdr * th, u_int32_t tiwin, int tlen) { /* Don't look at the window if there is no ACK flag */ if ((thflags & TH_ACK) && (SEQ_LT(tp->snd_wl1, th->th_seq) || (tp->snd_wl1 == th->th_seq && (SEQ_LT(tp->snd_wl2, th->th_ack) || (tp->snd_wl2 == th->th_ack && tiwin > tp->snd_wnd))))) { /* keep track of pure window updates */ if (tlen == 0 && tp->snd_wl2 == th->th_ack && tiwin > tp->snd_wnd) tcpstat.tcps_rcvwinupd++; tp->snd_wnd = tiwin; tp->snd_wl1 = th->th_seq; tp->snd_wl2 = th->th_ack; if (tp->snd_wnd > tp->max_sndwnd) tp->max_sndwnd = tp->snd_wnd; return (true); } return (false); } void tcp_input(struct mbuf *m, int off0) { struct tcphdr *th; struct ip *ip = NULL; struct inpcb *inp; u_char *optp = NULL; int optlen = 0; int tlen, off; int drop_hdrlen; struct tcpcb *tp = 0; int thflags; struct socket *so = 0; int todrop, acked, ourfinisacked, needoutput = 0; struct in_addr laddr; #if INET6 struct in6_addr laddr6; #endif int dropsocket = 0; int iss = 0, nosock = 0; u_int32_t tiwin, sack_bytes_acked = 0; struct tcpopt to; /* options in this segment */ #if TCPDEBUG short ostate = 0; #endif #if IPFIREWALL struct sockaddr_in *next_hop = NULL; struct m_tag *fwd_tag; #endif /* IPFIREWALL */ u_char ip_ecn = IPTOS_ECN_NOTECT; unsigned int ifscope; uint8_t isconnected, isdisconnected; struct ifnet *ifp = m->m_pkthdr.rcvif; int pktf_sw_lro_pkt = (m->m_pkthdr.pkt_flags & PKTF_SW_LRO_PKT) ? 1 : 0; int nlropkts = (pktf_sw_lro_pkt == 1) ? m->m_pkthdr.lro_npkts : 1; int turnoff_lro = 0, win; #if MPTCP struct mptcb *mp_tp = NULL; #endif /* MPTCP */ boolean_t cell = IFNET_IS_CELLULAR(ifp); boolean_t wifi = (!cell && IFNET_IS_WIFI(ifp)); boolean_t wired = (!wifi && IFNET_IS_WIRED(ifp)); boolean_t recvd_dsack = FALSE; struct tcp_respond_args tra; #define TCP_INC_VAR(stat, npkts) do { \ stat += npkts; \ } while (0) TCP_INC_VAR(tcpstat.tcps_rcvtotal, nlropkts); #if IPFIREWALL /* Grab info from PACKET_TAG_IPFORWARD tag prepended to the chain. */ if (!SLIST_EMPTY(&m->m_pkthdr.tags)) { fwd_tag = m_tag_locate(m, KERNEL_MODULE_TAG_ID, KERNEL_TAG_TYPE_IPFORWARD, NULL); } else { fwd_tag = NULL; } if (fwd_tag != NULL) { struct ip_fwd_tag *ipfwd_tag = (struct ip_fwd_tag *)(fwd_tag+1); next_hop = ipfwd_tag->next_hop; m_tag_delete(m, fwd_tag); } #endif /* IPFIREWALL */ #if INET6 struct ip6_hdr *ip6 = NULL; int isipv6; #endif /* INET6 */ int rstreason; /* For badport_bandlim accounting purposes */ struct proc *proc0=current_proc(); KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_START,0,0,0,0,0); #if INET6 isipv6 = (mtod(m, struct ip *)->ip_v == 6) ? 1 : 0; #endif bzero((char *)&to, sizeof(to)); #if INET6 if (isipv6) { /* * Expect 32-bit aligned data pointer on * strict-align platforms */ MBUF_STRICT_DATA_ALIGNMENT_CHECK_32(m); /* IP6_EXTHDR_CHECK() is already done at tcp6_input() */ ip6 = mtod(m, struct ip6_hdr *); tlen = sizeof(*ip6) + ntohs(ip6->ip6_plen) - off0; th = (struct tcphdr *)(void *)((caddr_t)ip6 + off0); if (tcp_input_checksum(AF_INET6, m, th, off0, tlen)) goto dropnosock; KERNEL_DEBUG(DBG_LAYER_BEG, ((th->th_dport << 16) | th->th_sport), (((ip6->ip6_src.s6_addr16[0]) << 16) | (ip6->ip6_dst.s6_addr16[0])), th->th_seq, th->th_ack, th->th_win); /* * Be proactive about unspecified IPv6 address in source. * As we use all-zero to indicate unbounded/unconnected pcb, * unspecified IPv6 address can be used to confuse us. * * Note that packets with unspecified IPv6 destination is * already dropped in ip6_input. */ if (IN6_IS_ADDR_UNSPECIFIED(&ip6->ip6_src)) { /* XXX stat */ IF_TCP_STATINC(ifp, unspecv6); goto dropnosock; } DTRACE_TCP5(receive, struct mbuf *, m, struct inpcb *, NULL, struct ip6_hdr *, ip6, struct tcpcb *, NULL, struct tcphdr *, th); ip_ecn = (ntohl(ip6->ip6_flow) >> 20) & IPTOS_ECN_MASK; } else #endif /* INET6 */ { /* * Get IP and TCP header together in first mbuf. * Note: IP leaves IP header in first mbuf. */ if (off0 > sizeof (struct ip)) { ip_stripoptions(m, (struct mbuf *)0); off0 = sizeof(struct ip); } if (m->m_len < sizeof (struct tcpiphdr)) { if ((m = m_pullup(m, sizeof (struct tcpiphdr))) == 0) { tcpstat.tcps_rcvshort++; return; } } /* Expect 32-bit aligned data pointer on strict-align platforms */ MBUF_STRICT_DATA_ALIGNMENT_CHECK_32(m); ip = mtod(m, struct ip *); th = (struct tcphdr *)(void *)((caddr_t)ip + off0); tlen = ip->ip_len; if (tcp_input_checksum(AF_INET, m, th, off0, tlen)) goto dropnosock; #if INET6 /* Re-initialization for later version check */ ip->ip_v = IPVERSION; #endif ip_ecn = (ip->ip_tos & IPTOS_ECN_MASK); DTRACE_TCP5(receive, struct mbuf *, m, struct inpcb *, NULL, struct ip *, ip, struct tcpcb *, NULL, struct tcphdr *, th); KERNEL_DEBUG(DBG_LAYER_BEG, ((th->th_dport << 16) | th->th_sport), (((ip->ip_src.s_addr & 0xffff) << 16) | (ip->ip_dst.s_addr & 0xffff)), th->th_seq, th->th_ack, th->th_win); } /* * Check that TCP offset makes sense, * pull out TCP options and adjust length. */ off = th->th_off << 2; if (off < sizeof (struct tcphdr) || off > tlen) { tcpstat.tcps_rcvbadoff++; IF_TCP_STATINC(ifp, badformat); goto dropnosock; } tlen -= off; /* tlen is used instead of ti->ti_len */ if (off > sizeof (struct tcphdr)) { #if INET6 if (isipv6) { IP6_EXTHDR_CHECK(m, off0, off, return); ip6 = mtod(m, struct ip6_hdr *); th = (struct tcphdr *)(void *)((caddr_t)ip6 + off0); } else #endif /* INET6 */ { if (m->m_len < sizeof(struct ip) + off) { if ((m = m_pullup(m, sizeof (struct ip) + off)) == 0) { tcpstat.tcps_rcvshort++; return; } ip = mtod(m, struct ip *); th = (struct tcphdr *)(void *)((caddr_t)ip + off0); } } optlen = off - sizeof (struct tcphdr); optp = (u_char *)(th + 1); /* * Do quick retrieval of timestamp options ("options * prediction?"). If timestamp is the only option and it's * formatted as recommended in RFC 1323 appendix A, we * quickly get the values now and not bother calling * tcp_dooptions(), etc. */ if ((optlen == TCPOLEN_TSTAMP_APPA || (optlen > TCPOLEN_TSTAMP_APPA && optp[TCPOLEN_TSTAMP_APPA] == TCPOPT_EOL)) && *(u_int32_t *)(void *)optp == htonl(TCPOPT_TSTAMP_HDR) && (th->th_flags & TH_SYN) == 0) { to.to_flags |= TOF_TS; to.to_tsval = ntohl(*(u_int32_t *)(void *)(optp + 4)); to.to_tsecr = ntohl(*(u_int32_t *)(void *)(optp + 8)); optp = NULL; /* we've parsed the options */ } } thflags = th->th_flags; #if TCP_DROP_SYNFIN /* * If the drop_synfin option is enabled, drop all packets with * both the SYN and FIN bits set. This prevents e.g. nmap from * identifying the TCP/IP stack. * * This is a violation of the TCP specification. */ if (drop_synfin && (thflags & (TH_SYN|TH_FIN)) == (TH_SYN|TH_FIN)) { IF_TCP_STATINC(ifp, synfin); goto dropnosock; } #endif /* * Delay dropping TCP, IP headers, IPv6 ext headers, and TCP options, * until after ip6_savecontrol() is called and before other functions * which don't want those proto headers. * Because ip6_savecontrol() is going to parse the mbuf to * search for data to be passed up to user-land, it wants mbuf * parameters to be unchanged. */ drop_hdrlen = off0 + off; /* Since this is an entry point for input processing of tcp packets, we * can update the tcp clock here. */ calculate_tcp_clock(); /* * Record the interface where this segment arrived on; this does not * affect normal data output (for non-detached TCP) as it provides a * hint about which route and interface to use for sending in the * absence of a PCB, when scoped routing (and thus source interface * selection) are enabled. */ if ((m->m_pkthdr.pkt_flags & PKTF_LOOP) || m->m_pkthdr.rcvif == NULL) ifscope = IFSCOPE_NONE; else ifscope = m->m_pkthdr.rcvif->if_index; /* * Convert TCP protocol specific fields to host format. */ #if BYTE_ORDER != BIG_ENDIAN NTOHL(th->th_seq); NTOHL(th->th_ack); NTOHS(th->th_win); NTOHS(th->th_urp); #endif /* * Locate pcb for segment. */ findpcb: isconnected = FALSE; isdisconnected = FALSE; #if IPFIREWALL_FORWARD if (next_hop != NULL #if INET6 && isipv6 == 0 /* IPv6 support is not yet */ #endif /* INET6 */ ) { /* * Diverted. Pretend to be the destination. * already got one like this? */ inp = in_pcblookup_hash(&tcbinfo, ip->ip_src, th->th_sport, ip->ip_dst, th->th_dport, 0, m->m_pkthdr.rcvif); if (!inp) { /* * No, then it's new. Try find the ambushing socket */ if (!next_hop->sin_port) { inp = in_pcblookup_hash(&tcbinfo, ip->ip_src, th->th_sport, next_hop->sin_addr, th->th_dport, 1, m->m_pkthdr.rcvif); } else { inp = in_pcblookup_hash(&tcbinfo, ip->ip_src, th->th_sport, next_hop->sin_addr, ntohs(next_hop->sin_port), 1, m->m_pkthdr.rcvif); } } } else #endif /* IPFIREWALL_FORWARD */ { #if INET6 if (isipv6) inp = in6_pcblookup_hash(&tcbinfo, &ip6->ip6_src, th->th_sport, &ip6->ip6_dst, th->th_dport, 1, m->m_pkthdr.rcvif); else #endif /* INET6 */ inp = in_pcblookup_hash(&tcbinfo, ip->ip_src, th->th_sport, ip->ip_dst, th->th_dport, 1, m->m_pkthdr.rcvif); } /* * Use the interface scope information from the PCB for outbound * segments. If the PCB isn't present and if scoped routing is * enabled, tcp_respond will use the scope of the interface where * the segment arrived on. */ if (inp != NULL && (inp->inp_flags & INP_BOUND_IF)) ifscope = inp->inp_boundifp->if_index; /* * If the state is CLOSED (i.e., TCB does not exist) then * all data in the incoming segment is discarded. * If the TCB exists but is in CLOSED state, it is embryonic, * but should either do a listen or a connect soon. */ if (inp == NULL) { if (log_in_vain) { #if INET6 char dbuf[MAX_IPv6_STR_LEN], sbuf[MAX_IPv6_STR_LEN]; #else /* INET6 */ char dbuf[MAX_IPv4_STR_LEN], sbuf[MAX_IPv4_STR_LEN]; #endif /* INET6 */ #if INET6 if (isipv6) { inet_ntop(AF_INET6, &ip6->ip6_dst, dbuf, sizeof(dbuf)); inet_ntop(AF_INET6, &ip6->ip6_src, sbuf, sizeof(sbuf)); } else #endif { inet_ntop(AF_INET, &ip->ip_dst, dbuf, sizeof(dbuf)); inet_ntop(AF_INET, &ip->ip_src, sbuf, sizeof(sbuf)); } switch (log_in_vain) { case 1: if(thflags & TH_SYN) log(LOG_INFO, "Connection attempt to TCP %s:%d from %s:%d\n", dbuf, ntohs(th->th_dport), sbuf, ntohs(th->th_sport)); break; case 2: log(LOG_INFO, "Connection attempt to TCP %s:%d from %s:%d flags:0x%x\n", dbuf, ntohs(th->th_dport), sbuf, ntohs(th->th_sport), thflags); break; case 3: case 4: if ((thflags & TH_SYN) && !(thflags & TH_ACK) && !(m->m_flags & (M_BCAST | M_MCAST)) && #if INET6 ((isipv6 && !IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst, &ip6->ip6_src)) || (!isipv6 && ip->ip_dst.s_addr != ip->ip_src.s_addr)) #else ip->ip_dst.s_addr != ip->ip_src.s_addr #endif ) log_in_vain_log((LOG_INFO, "Stealth Mode connection attempt to TCP %s:%d from %s:%d\n", dbuf, ntohs(th->th_dport), sbuf, ntohs(th->th_sport))); break; default: break; } } if (blackhole) { if (m->m_pkthdr.rcvif && m->m_pkthdr.rcvif->if_type != IFT_LOOP) switch (blackhole) { case 1: if (thflags & TH_SYN) goto dropnosock; break; case 2: goto dropnosock; default: goto dropnosock; } } rstreason = BANDLIM_RST_CLOSEDPORT; IF_TCP_STATINC(ifp, noconnnolist); goto dropwithresetnosock; } so = inp->inp_socket; if (so == NULL) { /* This case shouldn't happen as the socket shouldn't be null * if inp_state isn't set to INPCB_STATE_DEAD * But just in case, we pretend we didn't find the socket if we hit this case * as this isn't cause for a panic (the socket might be leaked however)... */ inp = NULL; #if TEMPDEBUG printf("tcp_input: no more socket for inp=%x. This shouldn't happen\n", inp); #endif goto dropnosock; } tcp_lock(so, 1, 0); if (in_pcb_checkstate(inp, WNT_RELEASE, 1) == WNT_STOPUSING) { tcp_unlock(so, 1, (void *)2); inp = NULL; // pretend we didn't find it goto dropnosock; } #if NECP #if INET6 if (isipv6) { if (!necp_socket_is_allowed_to_send_recv_v6(inp, th->th_dport, th->th_sport, &ip6->ip6_dst, &ip6->ip6_src, ifp, NULL, NULL)) { IF_TCP_STATINC(ifp, badformatipsec); goto drop; } } else #endif { if (!necp_socket_is_allowed_to_send_recv_v4(inp, th->th_dport, th->th_sport, &ip->ip_dst, &ip->ip_src, ifp, NULL, NULL)) { IF_TCP_STATINC(ifp, badformatipsec); goto drop; } } #endif /* NECP */ tp = intotcpcb(inp); if (tp == 0) { rstreason = BANDLIM_RST_CLOSEDPORT; IF_TCP_STATINC(ifp, noconnlist); goto dropwithreset; } if (tp->t_state == TCPS_CLOSED) goto drop; /* Unscale the window into a 32-bit value. */ if ((thflags & TH_SYN) == 0) tiwin = th->th_win << tp->snd_scale; else tiwin = th->th_win; #if CONFIG_MACF_NET if (mac_inpcb_check_deliver(inp, m, AF_INET, SOCK_STREAM)) goto drop; #endif /* Avoid processing packets while closing a listen socket */ if (tp->t_state == TCPS_LISTEN && (so->so_options & SO_ACCEPTCONN) == 0) goto drop; if (so->so_options & (SO_DEBUG|SO_ACCEPTCONN)) { #if TCPDEBUG if (so->so_options & SO_DEBUG) { ostate = tp->t_state; #if INET6 if (isipv6) bcopy((char *)ip6, (char *)tcp_saveipgen, sizeof(*ip6)); else #endif /* INET6 */ bcopy((char *)ip, (char *)tcp_saveipgen, sizeof(*ip)); tcp_savetcp = *th; } #endif if (so->so_options & SO_ACCEPTCONN) { struct tcpcb *tp0 = tp; struct socket *so2; struct socket *oso; struct sockaddr_storage from; #if INET6 struct inpcb *oinp = sotoinpcb(so); #endif /* INET6 */ struct ifnet *head_ifscope; unsigned int head_nocell, head_recvanyif, head_noexpensive, head_awdl_unrestricted, head_intcoproc_allowed; /* Get listener's bound-to-interface, if any */ head_ifscope = (inp->inp_flags & INP_BOUND_IF) ? inp->inp_boundifp : NULL; /* Get listener's no-cellular information, if any */ head_nocell = INP_NO_CELLULAR(inp); /* Get listener's recv-any-interface, if any */ head_recvanyif = (inp->inp_flags & INP_RECV_ANYIF); /* Get listener's no-expensive information, if any */ head_noexpensive = INP_NO_EXPENSIVE(inp); head_awdl_unrestricted = INP_AWDL_UNRESTRICTED(inp); head_intcoproc_allowed = INP_INTCOPROC_ALLOWED(inp); /* * If the state is LISTEN then ignore segment if it contains an RST. * If the segment contains an ACK then it is bad and send a RST. * If it does not contain a SYN then it is not interesting; drop it. * If it is from this socket, drop it, it must be forged. */ if ((thflags & (TH_RST|TH_ACK|TH_SYN)) != TH_SYN) { IF_TCP_STATINC(ifp, listbadsyn); if (thflags & TH_RST) { goto drop; } if (thflags & TH_ACK) { tp = NULL; tcpstat.tcps_badsyn++; rstreason = BANDLIM_RST_OPENPORT; goto dropwithreset; } /* We come here if there is no SYN set */ tcpstat.tcps_badsyn++; goto drop; } KERNEL_DEBUG(DBG_FNC_TCP_NEWCONN | DBG_FUNC_START,0,0,0,0,0); if (th->th_dport == th->th_sport) { #if INET6 if (isipv6) { if (IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst, &ip6->ip6_src)) goto drop; } else #endif /* INET6 */ if (ip->ip_dst.s_addr == ip->ip_src.s_addr) goto drop; } /* * RFC1122 4.2.3.10, p. 104: discard bcast/mcast SYN * in_broadcast() should never return true on a received * packet with M_BCAST not set. * * Packets with a multicast source address should also * be discarded. */ if (m->m_flags & (M_BCAST|M_MCAST)) goto drop; #if INET6 if (isipv6) { if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_dst) || IN6_IS_ADDR_MULTICAST(&ip6->ip6_src)) goto drop; } else #endif if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr)) || IN_MULTICAST(ntohl(ip->ip_src.s_addr)) || ip->ip_src.s_addr == htonl(INADDR_BROADCAST) || in_broadcast(ip->ip_dst, m->m_pkthdr.rcvif)) goto drop; #if INET6 /* * If deprecated address is forbidden, * we do not accept SYN to deprecated interface * address to prevent any new inbound connection from * getting established. * When we do not accept SYN, we send a TCP RST, * with deprecated source address (instead of dropping * it). We compromise it as it is much better for peer * to send a RST, and RST will be the final packet * for the exchange. * * If we do not forbid deprecated addresses, we accept * the SYN packet. RFC 4862 forbids dropping SYN in * this case. */ if (isipv6 && !ip6_use_deprecated) { uint32_t ia6_flags; if (ip6_getdstifaddr_info(m, NULL, &ia6_flags) == 0) { if (ia6_flags & IN6_IFF_DEPRECATED) { tp = NULL; rstreason = BANDLIM_RST_OPENPORT; IF_TCP_STATINC(ifp, deprecate6); goto dropwithreset; } } } #endif if (so->so_filt) { #if INET6 if (isipv6) { struct sockaddr_in6 *sin6 = (struct sockaddr_in6*)&from; sin6->sin6_len = sizeof(*sin6); sin6->sin6_family = AF_INET6; sin6->sin6_port = th->th_sport; sin6->sin6_flowinfo = 0; sin6->sin6_addr = ip6->ip6_src; sin6->sin6_scope_id = 0; } else #endif { struct sockaddr_in *sin = (struct sockaddr_in*)&from; sin->sin_len = sizeof(*sin); sin->sin_family = AF_INET; sin->sin_port = th->th_sport; sin->sin_addr = ip->ip_src; } so2 = sonewconn(so, 0, (struct sockaddr*)&from); } else { so2 = sonewconn(so, 0, NULL); } if (so2 == 0) { tcpstat.tcps_listendrop++; if (tcp_dropdropablreq(so)) { if (so->so_filt) so2 = sonewconn(so, 0, (struct sockaddr*)&from); else so2 = sonewconn(so, 0, NULL); } if (!so2) goto drop; } /* Point "inp" and "tp" in tandem to new socket */ inp = (struct inpcb *)so2->so_pcb; tp = intotcpcb(inp); oso = so; tcp_unlock(so, 0, 0); /* Unlock but keep a reference on listener for now */ so = so2; tcp_lock(so, 1, 0); /* * Mark socket as temporary until we're * committed to keeping it. The code at * ``drop'' and ``dropwithreset'' check the * flag dropsocket to see if the temporary * socket created here should be discarded. * We mark the socket as discardable until * we're committed to it below in TCPS_LISTEN. * There are some error conditions in which we * have to drop the temporary socket. */ dropsocket++; /* * Inherit INP_BOUND_IF from listener; testing if * head_ifscope is non-NULL is sufficient, since it * can only be set to a non-zero value earlier if * the listener has such a flag set. */ if (head_ifscope != NULL) { inp->inp_flags |= INP_BOUND_IF; inp->inp_boundifp = head_ifscope; } else { inp->inp_flags &= ~INP_BOUND_IF; } /* * Inherit restrictions from listener. */ if (head_nocell) inp_set_nocellular(inp); if (head_noexpensive) inp_set_noexpensive(inp); if (head_awdl_unrestricted) inp_set_awdl_unrestricted(inp); if (head_intcoproc_allowed) inp_set_intcoproc_allowed(inp); /* * Inherit {IN,IN6}_RECV_ANYIF from listener. */ if (head_recvanyif) inp->inp_flags |= INP_RECV_ANYIF; else inp->inp_flags &= ~INP_RECV_ANYIF; #if INET6 if (isipv6) inp->in6p_laddr = ip6->ip6_dst; else { inp->inp_vflag &= ~INP_IPV6; inp->inp_vflag |= INP_IPV4; #endif /* INET6 */ inp->inp_laddr = ip->ip_dst; #if INET6 } #endif /* INET6 */ inp->inp_lport = th->th_dport; if (in_pcbinshash(inp, 0) != 0) { /* * Undo the assignments above if we failed to * put the PCB on the hash lists. */ #if INET6 if (isipv6) inp->in6p_laddr = in6addr_any; else #endif /* INET6 */ inp->inp_laddr.s_addr = INADDR_ANY; inp->inp_lport = 0; tcp_lock(oso, 0, 0); /* release ref on parent */ tcp_unlock(oso, 1, 0); goto drop; } #if INET6 if (isipv6) { /* * Inherit socket options from the listening * socket. * Note that in6p_inputopts are not (even * should not be) copied, since it stores * previously received options and is used to * detect if each new option is different than * the previous one and hence should be passed * to a user. * If we copied in6p_inputopts, a user would * not be able to receive options just after * calling the accept system call. */ inp->inp_flags |= oinp->inp_flags & INP_CONTROLOPTS; if (oinp->in6p_outputopts) inp->in6p_outputopts = ip6_copypktopts(oinp->in6p_outputopts, M_NOWAIT); } else #endif /* INET6 */ { inp->inp_options = ip_srcroute(); inp->inp_ip_tos = oinp->inp_ip_tos; } tcp_lock(oso, 0, 0); #if IPSEC /* copy old policy into new socket's */ if (sotoinpcb(oso)->inp_sp) { int error = 0; /* Is it a security hole here to silently fail to copy the policy? */ if (inp->inp_sp != NULL) error = ipsec_init_policy(so, &inp->inp_sp); if (error != 0 || ipsec_copy_policy(sotoinpcb(oso)->inp_sp, inp->inp_sp)) printf("tcp_input: could not copy policy\n"); } #endif /* inherit states from the listener */ DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_LISTEN); tp->t_state = TCPS_LISTEN; tp->t_flags |= tp0->t_flags & (TF_NOPUSH|TF_NOOPT|TF_NODELAY); tp->t_flagsext |= (tp0->t_flagsext & (TF_RXTFINDROP|TF_NOTIMEWAIT|TF_FASTOPEN)); tp->t_keepinit = tp0->t_keepinit; tp->t_keepcnt = tp0->t_keepcnt; tp->t_keepintvl = tp0->t_keepintvl; tp->t_adaptive_wtimo = tp0->t_adaptive_wtimo; tp->t_adaptive_rtimo = tp0->t_adaptive_rtimo; tp->t_inpcb->inp_ip_ttl = tp0->t_inpcb->inp_ip_ttl; if ((so->so_flags & SOF_NOTSENT_LOWAT) != 0) tp->t_notsent_lowat = tp0->t_notsent_lowat; tp->t_inpcb->inp_flags2 |= tp0->t_inpcb->inp_flags2 & INP2_KEEPALIVE_OFFLOAD; /* now drop the reference on the listener */ tcp_unlock(oso, 1, 0); tcp_set_max_rwinscale(tp, so, TCP_AUTORCVBUF_MAX(ifp)); KERNEL_DEBUG(DBG_FNC_TCP_NEWCONN | DBG_FUNC_END,0,0,0,0,0); } } lck_mtx_assert(&((struct inpcb *)so->so_pcb)->inpcb_mtx, LCK_MTX_ASSERT_OWNED); if (tp->t_state == TCPS_ESTABLISHED && tlen > 0) { /* * Evaluate the rate of arrival of packets to see if the * receiver can reduce the ack traffic. The algorithm to * stretch acks will be enabled if the connection meets * certain criteria defined in tcp_stretch_ack_enable function. */ if ((tp->t_flagsext & TF_RCVUNACK_WAITSS) != 0) { TCP_INC_VAR(tp->rcv_waitforss, nlropkts); } if (tcp_stretch_ack_enable(tp, thflags)) { tp->t_flags |= TF_STRETCHACK; tp->t_flagsext &= ~(TF_RCVUNACK_WAITSS); tp->rcv_waitforss = 0; } else { tp->t_flags &= ~(TF_STRETCHACK); } if (TSTMP_GT(tp->rcv_unackwin, tcp_now)) { tp->rcv_by_unackwin += (tlen + off); } else { tp->rcv_unackwin = tcp_now + tcp_rcvunackwin; tp->rcv_by_unackwin = tlen + off; } } /* * Keep track of how many bytes were received in the LRO packet */ if ((pktf_sw_lro_pkt) && (nlropkts > 2)) { tp->t_lropktlen += tlen; } /* * Explicit Congestion Notification - Flag that we need to send ECT if * + The IP Congestion experienced flag was set. * + Socket is in established state * + We negotiated ECN in the TCP setup * + This isn't a pure ack (tlen > 0) * + The data is in the valid window * * TE_SENDECE will be cleared when we receive a packet with TH_CWR set. */ if (ip_ecn == IPTOS_ECN_CE && tp->t_state == TCPS_ESTABLISHED && TCP_ECN_ENABLED(tp) && tlen > 0 && SEQ_GEQ(th->th_seq, tp->last_ack_sent) && SEQ_LT(th->th_seq, tp->last_ack_sent + tp->rcv_wnd)) { tp->t_ecn_recv_ce++; tcpstat.tcps_ecn_recv_ce++; INP_INC_IFNET_STAT(inp, ecn_recv_ce); /* Mark this connection as it received CE from network */ tp->ecn_flags |= TE_RECV_ECN_CE; tp->ecn_flags |= TE_SENDECE; } /* * Clear TE_SENDECE if TH_CWR is set. This is harmless, so we don't * bother doing extensive checks for state and whatnot. */ if (thflags & TH_CWR) { tp->ecn_flags &= ~TE_SENDECE; tp->t_ecn_recv_cwr++; } /* * If we received an explicit notification of congestion in * ip tos ecn bits or by the CWR bit in TCP header flags, reset * the ack-strteching state. We need to handle ECN notification if * an ECN setup SYN was sent even once. */ if (tp->t_state == TCPS_ESTABLISHED && (tp->ecn_flags & TE_SETUPSENT) && (ip_ecn == IPTOS_ECN_CE || (thflags & TH_CWR))) { tcp_reset_stretch_ack(tp); CLEAR_IAJ_STATE(tp); } if (ip_ecn == IPTOS_ECN_CE && tp->t_state == TCPS_ESTABLISHED && !TCP_ECN_ENABLED(tp) && !(tp->ecn_flags & TE_CEHEURI_SET)) { tcpstat.tcps_ecn_fallback_ce++; tcp_heuristic_ecn_aggressive(tp); tp->ecn_flags |= TE_CEHEURI_SET; } if (tp->t_state == TCPS_ESTABLISHED && TCP_ECN_ENABLED(tp) && ip_ecn == IPTOS_ECN_CE && !(tp->ecn_flags & TE_CEHEURI_SET)) { if (inp->inp_stat->rxpackets < ECN_MIN_CE_PROBES) { tp->t_ecn_recv_ce_pkt++; } else if (tp->t_ecn_recv_ce_pkt > ECN_MAX_CE_RATIO) { tcpstat.tcps_ecn_fallback_ce++; tcp_heuristic_ecn_aggressive(tp); tp->ecn_flags |= TE_CEHEURI_SET; INP_INC_IFNET_STAT(inp,ecn_fallback_ce); } else { /* We tracked the first ECN_MIN_CE_PROBES segments, we * now know that the path is good. */ tp->ecn_flags |= TE_CEHEURI_SET; } } /* * Try to determine if we are receiving a packet after a long time. * Use our own approximation of idletime to roughly measure remote * end's idle time. Since slowstart is used after an idle period * we want to avoid doing LRO if the remote end is not up to date * on initial window support and starts with 1 or 2 packets as its IW. */ if (sw_lro && (tp->t_flagsext & TF_LRO_OFFLOADED) && ((tcp_now - tp->t_rcvtime) >= (TCP_IDLETIMEOUT(tp)))) { turnoff_lro = 1; } /* Update rcvtime as a new segment was received on the connection */ tp->t_rcvtime = tcp_now; /* * Segment received on connection. * Reset idle time and keep-alive timer. */ if (TCPS_HAVEESTABLISHED(tp->t_state)) tcp_keepalive_reset(tp); /* * Process options if not in LISTEN state, * else do it below (after getting remote address). */ if (tp->t_state != TCPS_LISTEN && optp) { tcp_dooptions(tp, optp, optlen, th, &to); #if MPTCP if (mptcp_input_preproc(tp, m, drop_hdrlen) != 0) { tp->t_flags |= TF_ACKNOW; (void) tcp_output(tp); tcp_check_timer_state(tp); tcp_unlock(so, 1, 0); KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_END,0,0,0,0,0); return; } #endif /* MPTCP */ } if (tp->t_state == TCPS_SYN_SENT && (thflags & TH_SYN)) { if (!(thflags & TH_ACK) || (SEQ_GT(th->th_ack, tp->iss) && SEQ_LEQ(th->th_ack, tp->snd_max))) tcp_finalize_options(tp, &to, ifscope); } #if TRAFFIC_MGT /* * Compute inter-packet arrival jitter. According to RFC 3550, * inter-packet arrival jitter is defined as the difference in * packet spacing at the receiver compared to the sender for a * pair of packets. When two packets of maximum segment size come * one after the other with consecutive sequence numbers, we * consider them as packets sent together at the sender and use * them as a pair to compute inter-packet arrival jitter. This * metric indicates the delay induced by the network components due * to queuing in edge/access routers. */ if (tp->t_state == TCPS_ESTABLISHED && (thflags & (TH_SYN|TH_FIN|TH_RST|TH_URG|TH_ACK|TH_ECE|TH_PUSH)) == TH_ACK && ((tp->t_flags & (TF_NEEDSYN|TF_NEEDFIN)) == 0) && ((to.to_flags & TOF_TS) == 0 || TSTMP_GEQ(to.to_tsval, tp->ts_recent)) && th->th_seq == tp->rcv_nxt && LIST_EMPTY(&tp->t_segq)) { int seg_size = tlen; if (tp->iaj_pktcnt <= IAJ_IGNORE_PKTCNT) { TCP_INC_VAR(tp->iaj_pktcnt, nlropkts); } if (m->m_pkthdr.pkt_flags & PKTF_SW_LRO_PKT) { seg_size = m->m_pkthdr.lro_pktlen; } if ( tp->iaj_size == 0 || seg_size > tp->iaj_size || (seg_size == tp->iaj_size && tp->iaj_rcv_ts == 0)) { /* * State related to inter-arrival jitter is * uninitialized or we are trying to find a good * first packet to start computing the metric */ update_iaj_state(tp, seg_size, 0); } else { if (seg_size == tp->iaj_size) { /* * Compute inter-arrival jitter taking * this packet as the second packet */ if (pktf_sw_lro_pkt) compute_iaj(tp, nlropkts, m->m_pkthdr.lro_elapsed); else compute_iaj(tp, 1, 0); } if (seg_size < tp->iaj_size) { /* * There is a smaller packet in the stream. * Some times the maximum size supported * on a path can change if there is a new * link with smaller MTU. The receiver will * not know about this change. If there * are too many packets smaller than * iaj_size, we try to learn the iaj_size * again. */ TCP_INC_VAR(tp->iaj_small_pkt, nlropkts); if (tp->iaj_small_pkt > RESET_IAJ_SIZE_THRESH) { update_iaj_state(tp, seg_size, 1); } else { CLEAR_IAJ_STATE(tp); } } else { update_iaj_state(tp, seg_size, 0); } } } else { CLEAR_IAJ_STATE(tp); } #endif /* TRAFFIC_MGT */ /* * Header prediction: check for the two common cases * of a uni-directional data xfer. If the packet has * no control flags, is in-sequence, the window didn't * change and we're not retransmitting, it's a * candidate. If the length is zero and the ack moved * forward, we're the sender side of the xfer. Just * free the data acked & wake any higher level process * that was blocked waiting for space. If the length * is non-zero and the ack didn't move, we're the * receiver side. If we're getting packets in-order * (the reassembly queue is empty), add the data to * the socket buffer and note that we need a delayed ack. * Make sure that the hidden state-flags are also off. * Since we check for TCPS_ESTABLISHED above, it can only * be TH_NEEDSYN. */ if (tp->t_state == TCPS_ESTABLISHED && (thflags & (TH_SYN|TH_FIN|TH_RST|TH_URG|TH_ACK|TH_ECE|TH_CWR)) == TH_ACK && ((tp->t_flags & (TF_NEEDSYN|TF_NEEDFIN)) == 0) && ((to.to_flags & TOF_TS) == 0 || TSTMP_GEQ(to.to_tsval, tp->ts_recent)) && th->th_seq == tp->rcv_nxt && tiwin && tiwin == tp->snd_wnd && tp->snd_nxt == tp->snd_max) { /* * If last ACK falls within this segment's sequence numbers, * record the timestamp. * NOTE that the test is modified according to the latest * proposal of the tcplw@cray.com list (Braden 1993/04/26). */ if ((to.to_flags & TOF_TS) != 0 && SEQ_LEQ(th->th_seq, tp->last_ack_sent)) { tp->ts_recent_age = tcp_now; tp->ts_recent = to.to_tsval; } if (tlen == 0) { if (SEQ_GT(th->th_ack, tp->snd_una) && SEQ_LEQ(th->th_ack, tp->snd_max) && tp->snd_cwnd >= tp->snd_ssthresh && (!IN_FASTRECOVERY(tp) && ((!(SACK_ENABLED(tp)) && tp->t_dupacks < tp->t_rexmtthresh) || (SACK_ENABLED(tp) && to.to_nsacks == 0 && TAILQ_EMPTY(&tp->snd_holes))))) { /* * this is a pure ack for outstanding data. */ ++tcpstat.tcps_predack; tcp_bad_rexmt_check(tp, th, &to); /* Recalculate the RTT */ tcp_compute_rtt(tp, &to, th); VERIFY(SEQ_GEQ(th->th_ack, tp->snd_una)); acked = BYTES_ACKED(th, tp); tcpstat.tcps_rcvackpack++; tcpstat.tcps_rcvackbyte += acked; /* * Handle an ack that is in sequence during * congestion avoidance phase. The * calculations in this function * assume that snd_una is not updated yet. */ if (CC_ALGO(tp)->congestion_avd != NULL) CC_ALGO(tp)->congestion_avd(tp, th); tcp_ccdbg_trace(tp, th, TCP_CC_INSEQ_ACK_RCVD); sbdrop(&so->so_snd, acked); if (so->so_flags & SOF_ENABLE_MSGS) { VERIFY(acked <= so->so_msg_state->msg_serial_bytes); so->so_msg_state->msg_serial_bytes -= acked; } tcp_sbsnd_trim(&so->so_snd); if (SEQ_GT(tp->snd_una, tp->snd_recover) && SEQ_LEQ(th->th_ack, tp->snd_recover)) tp->snd_recover = th->th_ack - 1; tp->snd_una = th->th_ack; TCP_RESET_REXMT_STATE(tp); /* * pull snd_wl2 up to prevent seq wrap relative * to th_ack. */ tp->snd_wl2 = th->th_ack; if (tp->t_dupacks > 0) { tp->t_dupacks = 0; tp->t_rexmtthresh = tcprexmtthresh; } m_freem(m); /* * If all outstanding data are acked, stop * retransmit timer, otherwise restart timer * using current (possibly backed-off) value. * If process is waiting for space, * wakeup/selwakeup/signal. If data * are ready to send, let tcp_output * decide between more output or persist. */ if (tp->snd_una == tp->snd_max) { tp->t_timer[TCPT_REXMT] = 0; tp->t_timer[TCPT_PTO] = 0; } else if (tp->t_timer[TCPT_PERSIST] == 0) { tp->t_timer[TCPT_REXMT] = OFFSET_FROM_START(tp, tp->t_rxtcur); } if (!SLIST_EMPTY(&tp->t_rxt_segments) && !TCP_DSACK_SEQ_IN_WINDOW(tp, tp->t_dsack_lastuna, tp->snd_una)) tcp_rxtseg_clean(tp); if ((tp->t_flagsext & TF_MEASURESNDBW) != 0 && tp->t_bwmeas != NULL) tcp_bwmeas_check(tp); sowwakeup(so); /* has to be done with socket lock held */ if (!SLIST_EMPTY(&tp->t_notify_ack)) tcp_notify_acknowledgement(tp, so); if ((so->so_snd.sb_cc) || (tp->t_flags & TF_ACKNOW)) { (void) tcp_output(tp); } tcp_tfo_rcv_ack(tp, th); tcp_check_timer_state(tp); tcp_unlock(so, 1, 0); KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_END,0,0,0,0,0); return; } } else if (th->th_ack == tp->snd_una && LIST_EMPTY(&tp->t_segq) && tlen <= tcp_sbspace(tp)) { /* * this is a pure, in-sequence data packet * with nothing on the reassembly queue and * we have enough buffer space to take it. */ /* * If this is a connection in steady state, start * coalescing packets belonging to this flow. */ if (turnoff_lro) { tcp_lro_remove_state(tp->t_inpcb->inp_laddr, tp->t_inpcb->inp_faddr, tp->t_inpcb->inp_lport, tp->t_inpcb->inp_fport); tp->t_flagsext &= ~TF_LRO_OFFLOADED; tp->t_idleat = tp->rcv_nxt; } else if (sw_lro && !pktf_sw_lro_pkt && !isipv6 && (so->so_flags & SOF_USELRO) && !IFNET_IS_CELLULAR(m->m_pkthdr.rcvif) && (m->m_pkthdr.rcvif->if_type != IFT_LOOP) && ((th->th_seq - tp->irs) > (tp->t_maxseg << lro_start)) && ((tp->t_idleat == 0) || ((th->th_seq - tp->t_idleat) > (tp->t_maxseg << lro_start)))) { tp->t_flagsext |= TF_LRO_OFFLOADED; tcp_start_coalescing(ip, th, tlen); tp->t_idleat = 0; } /* Clean receiver SACK report if present */ if (SACK_ENABLED(tp) && tp->rcv_numsacks) tcp_clean_sackreport(tp); ++tcpstat.tcps_preddat; tp->rcv_nxt += tlen; /* * Pull snd_wl1 up to prevent seq wrap relative to * th_seq. */ tp->snd_wl1 = th->th_seq; /* * Pull rcv_up up to prevent seq wrap relative to * rcv_nxt. */ tp->rcv_up = tp->rcv_nxt; TCP_INC_VAR(tcpstat.tcps_rcvpack, nlropkts); tcpstat.tcps_rcvbyte += tlen; if (nstat_collect) { if (m->m_pkthdr.pkt_flags & PKTF_SW_LRO_PKT) { INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, m->m_pkthdr.lro_npkts); } else { INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, 1); } INP_ADD_STAT(inp, cell, wifi, wired,rxbytes, tlen); } /* * Calculate the RTT on the receiver only if the * connection is in streaming mode and the last * packet was not an end-of-write */ if (tp->t_flags & TF_STREAMING_ON) tcp_compute_rtt(tp, &to, th); tcp_sbrcv_grow(tp, &so->so_rcv, &to, tlen, TCP_AUTORCVBUF_MAX(ifp)); /* * Add data to socket buffer. */ so_recv_data_stat(so, m, 0); m_adj(m, drop_hdrlen); /* delayed header drop */ /* * If message delivery (SOF_ENABLE_MSGS) is enabled on * this socket, deliver the packet received as an * in-order message with sequence number attached to it. */ if (sbappendstream_rcvdemux(so, m, th->th_seq - (tp->irs + 1), 0)) { sorwakeup(so); } #if INET6 if (isipv6) { KERNEL_DEBUG(DBG_LAYER_END, ((th->th_dport << 16) | th->th_sport), (((ip6->ip6_src.s6_addr16[0]) << 16) | (ip6->ip6_dst.s6_addr16[0])), th->th_seq, th->th_ack, th->th_win); } else #endif { KERNEL_DEBUG(DBG_LAYER_END, ((th->th_dport << 16) | th->th_sport), (((ip->ip_src.s_addr & 0xffff) << 16) | (ip->ip_dst.s_addr & 0xffff)), th->th_seq, th->th_ack, th->th_win); } TCP_INC_VAR(tp->t_unacksegs, nlropkts); if (DELAY_ACK(tp, th)) { if ((tp->t_flags & TF_DELACK) == 0) { tp->t_flags |= TF_DELACK; tp->t_timer[TCPT_DELACK] = OFFSET_FROM_START(tp, tcp_delack); } } else { tp->t_flags |= TF_ACKNOW; tcp_output(tp); } tcp_adaptive_rwtimo_check(tp, tlen); if (tlen > 0) tcp_tfo_rcv_data(tp); tcp_check_timer_state(tp); tcp_unlock(so, 1, 0); KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_END,0,0,0,0,0); return; } } /* * Calculate amount of space in receive window, * and then do TCP input processing. * Receive window is amount of space in rcv queue, * but not less than advertised window. */ lck_mtx_assert(&((struct inpcb *)so->so_pcb)->inpcb_mtx, LCK_MTX_ASSERT_OWNED); win = tcp_sbspace(tp); if (win < 0) win = 0; else { /* clip rcv window to 4K for modems */ if (tp->t_flags & TF_SLOWLINK && slowlink_wsize > 0) win = min(win, slowlink_wsize); } tp->rcv_wnd = imax(win, (int)(tp->rcv_adv - tp->rcv_nxt)); #if MPTCP /* * Ensure that the subflow receive window isn't greater * than the connection level receive window. */ if ((tp->t_mpflags & TMPF_MPTCP_TRUE) && (mp_tp = tptomptp(tp))) { MPT_LOCK(mp_tp); if (tp->rcv_wnd > mp_tp->mpt_rcvwnd) { tp->rcv_wnd = imax(mp_tp->mpt_rcvwnd, (int)(tp->rcv_adv - tp->rcv_nxt)); tcpstat.tcps_mp_reducedwin++; } MPT_UNLOCK(mp_tp); } #endif /* MPTCP */ switch (tp->t_state) { /* * Initialize tp->rcv_nxt, and tp->irs, select an initial * tp->iss, and send a segment: * <SEQ=ISS><ACK=RCV_NXT><CTL=SYN,ACK> * Also initialize tp->snd_nxt to tp->iss+1 and tp->snd_una to tp->iss. * Fill in remote peer address fields if not previously specified. * Enter SYN_RECEIVED state, and process any other fields of this * segment in this state. */ case TCPS_LISTEN: { struct sockaddr_in *sin; #if INET6 struct sockaddr_in6 *sin6; #endif lck_mtx_assert(&((struct inpcb *)so->so_pcb)->inpcb_mtx, LCK_MTX_ASSERT_OWNED); #if INET6 if (isipv6) { MALLOC(sin6, struct sockaddr_in6 *, sizeof *sin6, M_SONAME, M_NOWAIT); if (sin6 == NULL) goto drop; bzero(sin6, sizeof(*sin6)); sin6->sin6_family = AF_INET6; sin6->sin6_len = sizeof(*sin6); sin6->sin6_addr = ip6->ip6_src; sin6->sin6_port = th->th_sport; laddr6 = inp->in6p_laddr; if (IN6_IS_ADDR_UNSPECIFIED(&inp->in6p_laddr)) inp->in6p_laddr = ip6->ip6_dst; if (in6_pcbconnect(inp, (struct sockaddr *)sin6, proc0)) { inp->in6p_laddr = laddr6; FREE(sin6, M_SONAME); goto drop; } FREE(sin6, M_SONAME); } else #endif { lck_mtx_assert( &((struct inpcb *)so->so_pcb)->inpcb_mtx, LCK_MTX_ASSERT_OWNED); MALLOC(sin, struct sockaddr_in *, sizeof *sin, M_SONAME, M_NOWAIT); if (sin == NULL) goto drop; sin->sin_family = AF_INET; sin->sin_len = sizeof(*sin); sin->sin_addr = ip->ip_src; sin->sin_port = th->th_sport; bzero((caddr_t)sin->sin_zero, sizeof(sin->sin_zero)); laddr = inp->inp_laddr; if (inp->inp_laddr.s_addr == INADDR_ANY) inp->inp_laddr = ip->ip_dst; if (in_pcbconnect(inp, (struct sockaddr *)sin, proc0, IFSCOPE_NONE, NULL)) { inp->inp_laddr = laddr; FREE(sin, M_SONAME); goto drop; } FREE(sin, M_SONAME); } tcp_dooptions(tp, optp, optlen, th, &to); tcp_finalize_options(tp, &to, ifscope); if (tfo_enabled(tp) && tcp_tfo_syn(tp, &to)) isconnected = TRUE; if (iss) tp->iss = iss; else { tp->iss = tcp_new_isn(tp); } tp->irs = th->th_seq; tcp_sendseqinit(tp); tcp_rcvseqinit(tp); tp->snd_recover = tp->snd_una; /* * Initialization of the tcpcb for transaction; * set SND.WND = SEG.WND, * initialize CCsend and CCrecv. */ tp->snd_wnd = tiwin; /* initial send-window */ tp->t_flags |= TF_ACKNOW; tp->t_unacksegs = 0; DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_SYN_RECEIVED); tp->t_state = TCPS_SYN_RECEIVED; tp->t_timer[TCPT_KEEP] = OFFSET_FROM_START(tp, TCP_CONN_KEEPINIT(tp)); dropsocket = 0; /* committed to socket */ if (inp->inp_flowhash == 0) inp->inp_flowhash = inp_calc_flowhash(inp); #if INET6 /* update flowinfo - RFC 6437 */ if (inp->inp_flow == 0 && inp->in6p_flags & IN6P_AUTOFLOWLABEL) { inp->inp_flow &= ~IPV6_FLOWLABEL_MASK; inp->inp_flow |= (htonl(inp->inp_flowhash) & IPV6_FLOWLABEL_MASK); } #endif /* INET6 */ /* reset the incomp processing flag */ so->so_flags &= ~(SOF_INCOMP_INPROGRESS); tcpstat.tcps_accepts++; if ((thflags & (TH_ECE | TH_CWR)) == (TH_ECE | TH_CWR)) { /* ECN-setup SYN */ tp->ecn_flags |= (TE_SETUPRECEIVED | TE_SENDIPECT); } goto trimthenstep6; } /* * If the state is SYN_RECEIVED and the seg contains an ACK, * but not for our SYN/ACK, send a RST. */ case TCPS_SYN_RECEIVED: if ((thflags & TH_ACK) && (SEQ_LEQ(th->th_ack, tp->snd_una) || SEQ_GT(th->th_ack, tp->snd_max))) { rstreason = BANDLIM_RST_OPENPORT; IF_TCP_STATINC(ifp, ooopacket); goto dropwithreset; } /* * In SYN_RECEIVED state, if we recv some SYNS with * window scale and others without, window scaling should * be disabled. Otherwise the window advertised will be * lower if we assume scaling and the other end does not. */ if ((thflags & TH_SYN) && (tp->irs == th->th_seq) && !(to.to_flags & TOF_SCALE)) tp->t_flags &= ~TF_RCVD_SCALE; break; /* * If the state is SYN_SENT: * if seg contains an ACK, but not for our SYN, drop the input. * if seg contains a RST, then drop the connection. * if seg does not contain SYN, then drop it. * Otherwise this is an acceptable SYN segment * initialize tp->rcv_nxt and tp->irs * if seg contains ack then advance tp->snd_una * if SYN has been acked change to ESTABLISHED else SYN_RCVD state * arrange for segment to be acked (eventually) * continue processing rest of data/controls, beginning with URG */ case TCPS_SYN_SENT: if ((thflags & TH_ACK) && (SEQ_LEQ(th->th_ack, tp->iss) || SEQ_GT(th->th_ack, tp->snd_max))) { rstreason = BANDLIM_UNLIMITED; IF_TCP_STATINC(ifp, ooopacket); goto dropwithreset; } if (thflags & TH_RST) { if ((thflags & TH_ACK) != 0) { #if MPTCP if ((so->so_flags & SOF_MPTCP_FASTJOIN) && SEQ_GT(th->th_ack, tp->iss+1)) { so->so_flags &= ~SOF_MPTCP_FASTJOIN; /* ignore the RST and retransmit SYN */ goto drop; } #endif /* MPTCP */ soevent(so, (SO_FILT_HINT_LOCKED | SO_FILT_HINT_CONNRESET)); tp = tcp_drop(tp, ECONNREFUSED); postevent(so, 0, EV_RESET); } goto drop; } if ((thflags & TH_SYN) == 0) goto drop; tp->snd_wnd = th->th_win; /* initial send window */ tp->irs = th->th_seq; tcp_rcvseqinit(tp); if (thflags & TH_ACK) { tcpstat.tcps_connects++; if ((thflags & (TH_ECE | TH_CWR)) == (TH_ECE)) { /* ECN-setup SYN-ACK */ tp->ecn_flags |= TE_SETUPRECEIVED; if (TCP_ECN_ENABLED(tp)) { tcp_heuristic_ecn_success(tp); tcpstat.tcps_ecn_client_success++; } } else { if (tp->ecn_flags & TE_SETUPSENT && tp->t_rxtshift == 0) { tcp_heuristic_ecn_success(tp); tcpstat.tcps_ecn_not_supported++; } if (tp->ecn_flags & TE_SETUPSENT && tp->t_rxtshift > 0) tcp_heuristic_ecn_loss(tp); /* non-ECN-setup SYN-ACK */ tp->ecn_flags &= ~TE_SENDIPECT; } #if CONFIG_MACF_NET && CONFIG_MACF_SOCKET /* XXXMAC: recursive lock: SOCK_LOCK(so); */ mac_socketpeer_label_associate_mbuf(m, so); /* XXXMAC: SOCK_UNLOCK(so); */ #endif /* Do window scaling on this connection? */ if (TCP_WINDOW_SCALE_ENABLED(tp)) { tp->snd_scale = tp->requested_s_scale; tp->rcv_scale = tp->request_r_scale; } tp->rcv_adv += min(tp->rcv_wnd, TCP_MAXWIN << tp->rcv_scale); tp->snd_una++; /* SYN is acked */ if (SEQ_LT(tp->snd_nxt, tp->snd_una)) tp->snd_nxt = tp->snd_una; /* * We have sent more in the SYN than what is being * acked. (e.g., TFO) * We should restart the sending from what the receiver * has acknowledged immediately. */ if (SEQ_GT(tp->snd_nxt, th->th_ack)) tp->snd_max = tp->snd_nxt = th->th_ack; /* * If there's data, delay ACK; if there's also a FIN * ACKNOW will be turned on later. */ TCP_INC_VAR(tp->t_unacksegs, nlropkts); if (DELAY_ACK(tp, th) && tlen != 0 ) { if ((tp->t_flags & TF_DELACK) == 0) { tp->t_flags |= TF_DELACK; tp->t_timer[TCPT_DELACK] = OFFSET_FROM_START(tp, tcp_delack); } } else { tp->t_flags |= TF_ACKNOW; } /* * Received <SYN,ACK> in SYN_SENT[*] state. * Transitions: * SYN_SENT --> ESTABLISHED * SYN_SENT* --> FIN_WAIT_1 */ tp->t_starttime = tcp_now; tcp_sbrcv_tstmp_check(tp); if (tp->t_flags & TF_NEEDFIN) { DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_FIN_WAIT_1); tp->t_state = TCPS_FIN_WAIT_1; tp->t_flags &= ~TF_NEEDFIN; thflags &= ~TH_SYN; } else { DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_ESTABLISHED); tp->t_state = TCPS_ESTABLISHED; tp->t_timer[TCPT_KEEP] = OFFSET_FROM_START(tp, TCP_CONN_KEEPIDLE(tp)); if (nstat_collect) nstat_route_connect_success( inp->inp_route.ro_rt); /* * The SYN is acknowledged but una is not * updated yet. So pass the value of * ack to compute sndbytes correctly */ inp_count_sndbytes(inp, th->th_ack); } #if MPTCP /* * Do not send the connect notification for additional * subflows until ACK for 3-way handshake arrives. */ if ((!(tp->t_mpflags & TMPF_MPTCP_TRUE)) && (tp->t_mpflags & TMPF_SENT_JOIN)) { isconnected = FALSE; /* Start data xmit if fastjoin */ if (mptcp_fastjoin && (so->so_flags & SOF_MPTCP_FASTJOIN)) { soevent(so, (SO_FILT_HINT_LOCKED | SO_FILT_HINT_MPFASTJ)); } } else #endif /* MPTCP */ isconnected = TRUE; if (tp->t_tfo_flags & (TFO_F_COOKIE_REQ | TFO_F_COOKIE_SENT)) { tcp_tfo_synack(tp, &to); if ((tp->t_tfo_stats & TFO_S_SYN_DATA_SENT) && SEQ_LT(tp->snd_una, th->th_ack)) { tp->t_tfo_stats |= TFO_S_SYN_DATA_ACKED; tcpstat.tcps_tfo_syn_data_acked++; #if MPTCP if (so->so_flags & SOF_MP_SUBFLOW) so->so_flags1 |= SOF1_TFO_REWIND; #endif if (!(tp->t_tfo_flags & TFO_F_NO_RCVPROBING)) tcp_tfo_rcv_probe(tp, tlen); } } } else { /* * Received initial SYN in SYN-SENT[*] state => simul- * taneous open. If segment contains CC option and there is * a cached CC, apply TAO test; if it succeeds, connection is * half-synchronized. Otherwise, do 3-way handshake: * SYN-SENT -> SYN-RECEIVED * SYN-SENT* -> SYN-RECEIVED* */ tp->t_flags |= TF_ACKNOW; tp->t_timer[TCPT_REXMT] = 0; DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_SYN_RECEIVED); tp->t_state = TCPS_SYN_RECEIVED; /* * During simultaneous open, TFO should not be used. * So, we disable it here, to prevent that data gets * sent on the SYN/ACK. */ tcp_disable_tfo(tp); } trimthenstep6: /* * Advance th->th_seq to correspond to first data byte. * If data, trim to stay within window, * dropping FIN if necessary. */ th->th_seq++; if (tlen > tp->rcv_wnd) { todrop = tlen - tp->rcv_wnd; m_adj(m, -todrop); tlen = tp->rcv_wnd; thflags &= ~TH_FIN; tcpstat.tcps_rcvpackafterwin++; tcpstat.tcps_rcvbyteafterwin += todrop; } tp->snd_wl1 = th->th_seq - 1; tp->rcv_up = th->th_seq; /* * Client side of transaction: already sent SYN and data. * If the remote host used T/TCP to validate the SYN, * our data will be ACK'd; if so, enter normal data segment * processing in the middle of step 5, ack processing. * Otherwise, goto step 6. */ if (thflags & TH_ACK) goto process_ACK; goto step6; /* * If the state is LAST_ACK or CLOSING or TIME_WAIT: * do normal processing. * * NB: Leftover from RFC1644 T/TCP. Cases to be reused later. */ case TCPS_LAST_ACK: case TCPS_CLOSING: case TCPS_TIME_WAIT: break; /* continue normal processing */ /* Received a SYN while connection is already established. * This is a "half open connection and other anomalies" described * in RFC793 page 34, send an ACK so the remote reset the connection * or recovers by adjusting its sequence numberering */ case TCPS_ESTABLISHED: if (thflags & TH_SYN) goto dropafterack; break; } /* * States other than LISTEN or SYN_SENT. * First check the RST flag and sequence number since reset segments * are exempt from the timestamp and connection count tests. This * fixes a bug introduced by the Stevens, vol. 2, p. 960 bugfix * below which allowed reset segments in half the sequence space * to fall though and be processed (which gives forged reset * segments with a random sequence number a 50 percent chance of * killing a connection). * Then check timestamp, if present. * Then check the connection count, if present. * Then check that at least some bytes of segment are within * receive window. If segment begins before rcv_nxt, * drop leading data (and SYN); if nothing left, just ack. * * * If the RST bit is set, check the sequence number to see * if this is a valid reset segment. * RFC 793 page 37: * In all states except SYN-SENT, all reset (RST) segments * are validated by checking their SEQ-fields. A reset is * valid if its sequence number is in the window. * Note: this does not take into account delayed ACKs, so * we should test against last_ack_sent instead of rcv_nxt. * The sequence number in the reset segment is normally an * echo of our outgoing acknowlegement numbers, but some hosts * send a reset with the sequence number at the rightmost edge * of our receive window, and we have to handle this case. * Note 2: Paul Watson's paper "Slipping in the Window" has shown * that brute force RST attacks are possible. To combat this, * we use a much stricter check while in the ESTABLISHED state, * only accepting RSTs where the sequence number is equal to * last_ack_sent. In all other states (the states in which a * RST is more likely), the more permissive check is used. * If we have multiple segments in flight, the intial reset * segment sequence numbers will be to the left of last_ack_sent, * but they will eventually catch up. * In any case, it never made sense to trim reset segments to * fit the receive window since RFC 1122 says: * 4.2.2.12 RST Segment: RFC-793 Section 3.4 * * A TCP SHOULD allow a received RST segment to include data. * * DISCUSSION * It has been suggested that a RST segment could contain * ASCII text that encoded and explained the cause of the * RST. No standard has yet been established for such * data. * * If the reset segment passes the sequence number test examine * the state: * SYN_RECEIVED STATE: * If passive open, return to LISTEN state. * If active open, inform user that connection was refused. * ESTABLISHED, FIN_WAIT_1, FIN_WAIT_2, CLOSE_WAIT STATES: * Inform user that connection was reset, and close tcb. * CLOSING, LAST_ACK STATES: * Close the tcb. * TIME_WAIT STATE: * Drop the segment - see Stevens, vol. 2, p. 964 and * RFC 1337. * * Radar 4803931: Allows for the case where we ACKed the FIN but * there is already a RST in flight from the peer. * In that case, accept the RST for non-established * state if it's one off from last_ack_sent. */ if (thflags & TH_RST) { if ((SEQ_GEQ(th->th_seq, tp->last_ack_sent) && SEQ_LT(th->th_seq, tp->last_ack_sent + tp->rcv_wnd)) || (tp->rcv_wnd == 0 && ((tp->last_ack_sent == th->th_seq) || ((tp->last_ack_sent -1) == th->th_seq)))) { switch (tp->t_state) { case TCPS_SYN_RECEIVED: IF_TCP_STATINC(ifp, rstinsynrcv); so->so_error = ECONNREFUSED; goto close; case TCPS_ESTABLISHED: if (tp->last_ack_sent != th->th_seq) { tcpstat.tcps_badrst++; goto drop; } if (TCP_ECN_ENABLED(tp) && tp->snd_una == tp->iss + 1 && SEQ_GT(tp->snd_max, tp->snd_una)) { /* * If the first data packet on an * ECN connection, receives a RST * increment the heuristic */ tcp_heuristic_ecn_droprst(tp); } case TCPS_FIN_WAIT_1: case TCPS_CLOSE_WAIT: /* Drop through ... */ case TCPS_FIN_WAIT_2: so->so_error = ECONNRESET; close: postevent(so, 0, EV_RESET); soevent(so, (SO_FILT_HINT_LOCKED | SO_FILT_HINT_CONNRESET)); tcpstat.tcps_drops++; tp = tcp_close(tp); break; case TCPS_CLOSING: case TCPS_LAST_ACK: tp = tcp_close(tp); break; case TCPS_TIME_WAIT: break; } } goto drop; } /* * RFC 1323 PAWS: If we have a timestamp reply on this segment * and it's less than ts_recent, drop it. */ if ((to.to_flags & TOF_TS) != 0 && tp->ts_recent && TSTMP_LT(to.to_tsval, tp->ts_recent)) { /* Check to see if ts_recent is over 24 days old. */ if ((int)(tcp_now - tp->ts_recent_age) > TCP_PAWS_IDLE) { /* * Invalidate ts_recent. If this segment updates * ts_recent, the age will be reset later and ts_recent * will get a valid value. If it does not, setting * ts_recent to zero will at least satisfy the * requirement that zero be placed in the timestamp * echo reply when ts_recent isn't valid. The * age isn't reset until we get a valid ts_recent * because we don't want out-of-order segments to be * dropped when ts_recent is old. */ tp->ts_recent = 0; } else { tcpstat.tcps_rcvduppack++; tcpstat.tcps_rcvdupbyte += tlen; tp->t_pawsdrop++; tcpstat.tcps_pawsdrop++; /* * PAWS-drop when ECN is being used? That indicates * that ECT-marked packets take a different path, with * different congestion-characteristics. * * Only fallback when we did send less than 2GB as PAWS * really has no reason to kick in earlier. */ if (TCP_ECN_ENABLED(tp) && inp->inp_stat->rxbytes < 2147483648) { INP_INC_IFNET_STAT(inp, ecn_fallback_reorder); tcpstat.tcps_ecn_fallback_reorder++; tcp_heuristic_ecn_aggressive(tp); } if (nstat_collect) { nstat_route_rx(tp->t_inpcb->inp_route.ro_rt, 1, tlen, NSTAT_RX_FLAG_DUPLICATE); INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, 1); INP_ADD_STAT(inp, cell, wifi, wired, rxbytes, tlen); tp->t_stat.rxduplicatebytes += tlen; } if (tlen > 0) goto dropafterack; goto drop; } } /* * In the SYN-RECEIVED state, validate that the packet belongs to * this connection before trimming the data to fit the receive * window. Check the sequence number versus IRS since we know * the sequence numbers haven't wrapped. This is a partial fix * for the "LAND" DoS attack. */ if (tp->t_state == TCPS_SYN_RECEIVED && SEQ_LT(th->th_seq, tp->irs)) { rstreason = BANDLIM_RST_OPENPORT; IF_TCP_STATINC(ifp, dospacket); goto dropwithreset; } todrop = tp->rcv_nxt - th->th_seq; if (todrop > 0) { if (thflags & TH_SYN) { thflags &= ~TH_SYN; th->th_seq++; if (th->th_urp > 1) th->th_urp--; else thflags &= ~TH_URG; todrop--; } /* * Following if statement from Stevens, vol. 2, p. 960. */ if (todrop > tlen || (todrop == tlen && (thflags & TH_FIN) == 0)) { /* * Any valid FIN must be to the left of the window. * At this point the FIN must be a duplicate or out * of sequence; drop it. */ thflags &= ~TH_FIN; /* * Send an ACK to resynchronize and drop any data. * But keep on processing for RST or ACK. */ tp->t_flags |= TF_ACKNOW; if (todrop == 1) { /* This could be a keepalive */ soevent(so, SO_FILT_HINT_LOCKED | SO_FILT_HINT_KEEPALIVE); } todrop = tlen; tcpstat.tcps_rcvduppack++; tcpstat.tcps_rcvdupbyte += todrop; } else { tcpstat.tcps_rcvpartduppack++; tcpstat.tcps_rcvpartdupbyte += todrop; } if (TCP_DSACK_ENABLED(tp) && todrop > 1) { /* * Note the duplicate data sequence space so that * it can be reported in DSACK option. */ tp->t_dsack_lseq = th->th_seq; tp->t_dsack_rseq = th->th_seq + todrop; tp->t_flags |= TF_ACKNOW; } if (nstat_collect) { nstat_route_rx(tp->t_inpcb->inp_route.ro_rt, 1, todrop, NSTAT_RX_FLAG_DUPLICATE); INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, 1); INP_ADD_STAT(inp, cell, wifi, wired, rxbytes, todrop); tp->t_stat.rxduplicatebytes += todrop; } drop_hdrlen += todrop; /* drop from the top afterwards */ th->th_seq += todrop; tlen -= todrop; if (th->th_urp > todrop) th->th_urp -= todrop; else { thflags &= ~TH_URG; th->th_urp = 0; } } /* * If new data are received on a connection after the user * processes are gone, then RST the other end. * Send also a RST when we received a data segment after we've * sent our FIN when the socket is defunct. * Note that an MPTCP subflow socket would have SS_NOFDREF set * by default so check to make sure that we test for SOF_MP_SUBFLOW * socket flag (which would be cleared when the socket is closed.) */ if (!(so->so_flags & SOF_MP_SUBFLOW) && tlen && (((so->so_state & SS_NOFDREF) && tp->t_state > TCPS_CLOSE_WAIT) || ((so->so_flags & SOF_DEFUNCT) && tp->t_state > TCPS_FIN_WAIT_1))) { tp = tcp_close(tp); tcpstat.tcps_rcvafterclose++; rstreason = BANDLIM_UNLIMITED; IF_TCP_STATINC(ifp, cleanup); goto dropwithreset; } /* * If segment ends after window, drop trailing data * (and PUSH and FIN); if nothing left, just ACK. */ todrop = (th->th_seq+tlen) - (tp->rcv_nxt+tp->rcv_wnd); if (todrop > 0) { tcpstat.tcps_rcvpackafterwin++; if (todrop >= tlen) { tcpstat.tcps_rcvbyteafterwin += tlen; /* * If a new connection request is received * while in TIME_WAIT, drop the old connection * and start over if the sequence numbers * are above the previous ones. */ if (thflags & TH_SYN && tp->t_state == TCPS_TIME_WAIT && SEQ_GT(th->th_seq, tp->rcv_nxt)) { iss = tcp_new_isn(tp); tp = tcp_close(tp); tcp_unlock(so, 1, 0); goto findpcb; } /* * If window is closed can only take segments at * window edge, and have to drop data and PUSH from * incoming segments. Continue processing, but * remember to ack. Otherwise, drop segment * and ack. */ if (tp->rcv_wnd == 0 && th->th_seq == tp->rcv_nxt) { tp->t_flags |= TF_ACKNOW; tcpstat.tcps_rcvwinprobe++; } else goto dropafterack; } else tcpstat.tcps_rcvbyteafterwin += todrop; m_adj(m, -todrop); tlen -= todrop; thflags &= ~(TH_PUSH|TH_FIN); } /* * If last ACK falls within this segment's sequence numbers, * record its timestamp. * NOTE: * 1) That the test incorporates suggestions from the latest * proposal of the tcplw@cray.com list (Braden 1993/04/26). * 2) That updating only on newer timestamps interferes with * our earlier PAWS tests, so this check should be solely * predicated on the sequence space of this segment. * 3) That we modify the segment boundary check to be * Last.ACK.Sent <= SEG.SEQ + SEG.Len * instead of RFC1323's * Last.ACK.Sent < SEG.SEQ + SEG.Len, * This modified check allows us to overcome RFC1323's * limitations as described in Stevens TCP/IP Illustrated * Vol. 2 p.869. In such cases, we can still calculate the * RTT correctly when RCV.NXT == Last.ACK.Sent. */ if ((to.to_flags & TOF_TS) != 0 && SEQ_LEQ(th->th_seq, tp->last_ack_sent) && SEQ_LEQ(tp->last_ack_sent, th->th_seq + tlen + ((thflags & (TH_SYN|TH_FIN)) != 0))) { tp->ts_recent_age = tcp_now; tp->ts_recent = to.to_tsval; } /* * If a SYN is in the window, then this is an * error and we send an RST and drop the connection. */ if (thflags & TH_SYN) { tp = tcp_drop(tp, ECONNRESET); rstreason = BANDLIM_UNLIMITED; postevent(so, 0, EV_RESET); IF_TCP_STATINC(ifp, synwindow); goto dropwithreset; } /* * If the ACK bit is off: if in SYN-RECEIVED state or SENDSYN * flag is on (half-synchronized state), then queue data for * later processing; else drop segment and return. */ if ((thflags & TH_ACK) == 0) { if (tp->t_state == TCPS_SYN_RECEIVED || (tp->t_flags & TF_NEEDSYN)) { if ((tfo_enabled(tp))) { /* * So, we received a valid segment while in * SYN-RECEIVED (TF_NEEDSYN is actually never * set, so this is dead code). * As this cannot be an RST (see that if a bit * higher), and it does not have the ACK-flag * set, we want to retransmit the SYN/ACK. * Thus, we have to reset snd_nxt to snd_una to * trigger the going back to sending of the * SYN/ACK. This is more consistent with the * behavior of tcp_output(), which expects * to send the segment that is pointed to by * snd_nxt. */ tp->snd_nxt = tp->snd_una; /* * We need to make absolutely sure that we are * going to reply upon a duplicate SYN-segment. */ if (th->th_flags & TH_SYN) needoutput = 1; } goto step6; } else if (tp->t_flags & TF_ACKNOW) goto dropafterack; else goto drop; } /* * Ack processing. */ switch (tp->t_state) { /* * In SYN_RECEIVED state, the ack ACKs our SYN, so enter * ESTABLISHED state and continue processing. * The ACK was checked above. */ case TCPS_SYN_RECEIVED: tcpstat.tcps_connects++; /* Do window scaling? */ if (TCP_WINDOW_SCALE_ENABLED(tp)) { tp->snd_scale = tp->requested_s_scale; tp->rcv_scale = tp->request_r_scale; tp->snd_wnd = th->th_win << tp->snd_scale; tiwin = tp->snd_wnd; } /* * Make transitions: * SYN-RECEIVED -> ESTABLISHED * SYN-RECEIVED* -> FIN-WAIT-1 */ tp->t_starttime = tcp_now; tcp_sbrcv_tstmp_check(tp); if (tp->t_flags & TF_NEEDFIN) { DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_FIN_WAIT_1); tp->t_state = TCPS_FIN_WAIT_1; tp->t_flags &= ~TF_NEEDFIN; } else { DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_ESTABLISHED); tp->t_state = TCPS_ESTABLISHED; tp->t_timer[TCPT_KEEP] = OFFSET_FROM_START(tp, TCP_CONN_KEEPIDLE(tp)); if (nstat_collect) nstat_route_connect_success( tp->t_inpcb->inp_route.ro_rt); /* * The SYN is acknowledged but una is not updated * yet. So pass the value of ack to compute * sndbytes correctly */ inp_count_sndbytes(inp, th->th_ack); } /* * If segment contains data or ACK, will call tcp_reass() * later; if not, do so now to pass queued data to user. */ if (tlen == 0 && (thflags & TH_FIN) == 0) (void) tcp_reass(tp, (struct tcphdr *)0, &tlen, NULL, ifp); tp->snd_wl1 = th->th_seq - 1; #if MPTCP /* * Do not send the connect notification for additional subflows * until ACK for 3-way handshake arrives. */ if ((!(tp->t_mpflags & TMPF_MPTCP_TRUE)) && (tp->t_mpflags & TMPF_SENT_JOIN)) { isconnected = FALSE; } else #endif /* MPTCP */ isconnected = TRUE; if ((tp->t_tfo_flags & TFO_F_COOKIE_VALID)) { /* Done this when receiving the SYN */ isconnected = FALSE; OSDecrementAtomic(&tcp_tfo_halfcnt); /* Panic if something has gone terribly wrong. */ VERIFY(tcp_tfo_halfcnt >= 0); tp->t_tfo_flags &= ~TFO_F_COOKIE_VALID; } /* * In case there is data in the send-queue (e.g., TFO is being * used, or connectx+data has been done), then if we would * "FALLTHROUGH", we would handle this ACK as if data has been * acknowledged. But, we have to prevent this. And this * can be prevented by increasing snd_una by 1, so that the * SYN is not considered as data (snd_una++ is actually also * done in SYN_SENT-state as part of the regular TCP stack). * * In case there is data on this ack as well, the data will be * handled by the label "dodata" right after step6. */ if (so->so_snd.sb_cc) { tp->snd_una++; /* SYN is acked */ if (SEQ_LT(tp->snd_nxt, tp->snd_una)) tp->snd_nxt = tp->snd_una; /* * No duplicate-ACK handling is needed. So, we * directly advance to processing the ACK (aka, * updating the RTT estimation,...) * * But, we first need to handle eventual SACKs, * because TFO will start sending data with the * SYN/ACK, so it might be that the client * includes a SACK with its ACK. */ if (SACK_ENABLED(tp) && (to.to_nsacks > 0 || !TAILQ_EMPTY(&tp->snd_holes))) tcp_sack_doack(tp, &to, th, &sack_bytes_acked); goto process_ACK; } /* FALLTHROUGH */ /* * In ESTABLISHED state: drop duplicate ACKs; ACK out of range * ACKs. If the ack is in the range * tp->snd_una < th->th_ack <= tp->snd_max * then advance tp->snd_una to th->th_ack and drop * data from the retransmission queue. If this ACK reflects * more up to date window information we update our window information. */ case TCPS_ESTABLISHED: case TCPS_FIN_WAIT_1: case TCPS_FIN_WAIT_2: case TCPS_CLOSE_WAIT: case TCPS_CLOSING: case TCPS_LAST_ACK: case TCPS_TIME_WAIT: if (SEQ_GT(th->th_ack, tp->snd_max)) { tcpstat.tcps_rcvacktoomuch++; goto dropafterack; } if (SACK_ENABLED(tp) && to.to_nsacks > 0) { recvd_dsack = tcp_sack_process_dsack(tp, &to, th); /* * If DSACK is received and this packet has no * other SACK information, it can be dropped. * We do not want to treat it as a duplicate ack. */ if (recvd_dsack && SEQ_LEQ(th->th_ack, tp->snd_una) && to.to_nsacks == 0) { tcp_bad_rexmt_check(tp, th, &to); goto drop; } } if (SACK_ENABLED(tp) && (to.to_nsacks > 0 || !TAILQ_EMPTY(&tp->snd_holes))) tcp_sack_doack(tp, &to, th, &sack_bytes_acked); #if MPTCP if ((tp->t_mpuna) && (SEQ_GEQ(th->th_ack, tp->t_mpuna))) { if (tp->t_mpflags & TMPF_PREESTABLISHED) { /* MP TCP establishment succeeded */ tp->t_mpuna = 0; if (tp->t_mpflags & TMPF_JOINED_FLOW) { if (tp->t_mpflags & TMPF_SENT_JOIN) { tp->t_mpflags &= ~TMPF_PREESTABLISHED; tp->t_mpflags |= TMPF_MPTCP_TRUE; so->so_flags |= SOF_MPTCP_TRUE; mptcplog((LOG_DEBUG, "MPTCP " "Sockets: %s \n",__func__), MPTCP_SOCKET_DBG, MPTCP_LOGLVL_LOG); tp->t_timer[TCPT_JACK_RXMT] = 0; tp->t_mprxtshift = 0; isconnected = TRUE; } else { isconnected = FALSE; } } else { isconnected = TRUE; tp->t_mpflags &= ~TMPF_SENT_KEYS; } } } #endif /* MPTCP */ tcp_tfo_rcv_ack(tp, th); /* * If we have outstanding data (other than * a window probe), this is a completely * duplicate ack and the ack is the biggest we've seen. * * Need to accommodate a change in window on duplicate acks * to allow operating systems that update window during * recovery with SACK */ if (SEQ_LEQ(th->th_ack, tp->snd_una)) { if (tlen == 0 && (tiwin == tp->snd_wnd || (to.to_nsacks > 0 && sack_bytes_acked > 0))) { /* * If both ends send FIN at the same time, * then the ack will be a duplicate ack * but we have to process the FIN. Check * for this condition and process the FIN * instead of the dupack */ if ((thflags & TH_FIN) && !TCPS_HAVERCVDFIN(tp->t_state)) break; process_dupack: #if MPTCP /* * MPTCP options that are ignored must * not be treated as duplicate ACKs. */ if (to.to_flags & TOF_MPTCP) { goto drop; } if ((isconnected) && (tp->t_mpflags & TMPF_JOINED_FLOW)) { mptcplog((LOG_DEBUG, "MPTCP " "Sockets: bypass ack recovery\n"), MPTCP_SOCKET_DBG, MPTCP_LOGLVL_VERBOSE); break; } #endif /* MPTCP */ /* * If a duplicate acknowledgement was seen * after ECN, it indicates packet loss in * addition to ECN. Reset INRECOVERY flag * so that we can process partial acks * correctly */ if (tp->ecn_flags & TE_INRECOVERY) tp->ecn_flags &= ~TE_INRECOVERY; tcpstat.tcps_rcvdupack++; ++tp->t_dupacks; /* * Check if we need to reset the limit on * early retransmit */ if (tp->t_early_rexmt_count > 0 && TSTMP_GEQ(tcp_now, (tp->t_early_rexmt_win + TCP_EARLY_REXMT_WIN))) tp->t_early_rexmt_count = 0; /* * Is early retransmit needed? We check for * this when the connection is waiting for * duplicate acks to enter fast recovery. */ if (!IN_FASTRECOVERY(tp)) tcp_early_rexmt_check(tp, th); /* * If we've seen exactly rexmt threshold * of duplicate acks, assume a packet * has been dropped and retransmit it. * Kludge snd_nxt & the congestion * window so we send only this one * packet. * * We know we're losing at the current * window size so do congestion avoidance * (set ssthresh to half the current window * and pull our congestion window back to * the new ssthresh). * * Dup acks mean that packets have left the * network (they're now cached at the receiver) * so bump cwnd by the amount in the receiver * to keep a constant cwnd packets in the * network. */ if (tp->t_timer[TCPT_REXMT] == 0 || (th->th_ack != tp->snd_una && sack_bytes_acked == 0)) { tp->t_dupacks = 0; tp->t_rexmtthresh = tcprexmtthresh; } else if (tp->t_dupacks > tp->t_rexmtthresh || IN_FASTRECOVERY(tp)) { /* * If this connection was seeing packet * reordering, then recovery might be * delayed to disambiguate between * reordering and loss */ if (SACK_ENABLED(tp) && !IN_FASTRECOVERY(tp) && (tp->t_flagsext & (TF_PKTS_REORDERED|TF_DELAY_RECOVERY)) == (TF_PKTS_REORDERED|TF_DELAY_RECOVERY)) { /* * Since the SACK information is already * updated, this ACK will be dropped */ break; } if (SACK_ENABLED(tp) && IN_FASTRECOVERY(tp)) { int awnd; /* * Compute the amount of data in flight first. * We can inject new data into the pipe iff * we have less than 1/2 the original window's * worth of data in flight. */ awnd = (tp->snd_nxt - tp->snd_fack) + tp->sackhint.sack_bytes_rexmit; if (awnd < tp->snd_ssthresh) { tp->snd_cwnd += tp->t_maxseg; if (tp->snd_cwnd > tp->snd_ssthresh) tp->snd_cwnd = tp->snd_ssthresh; } } else { tp->snd_cwnd += tp->t_maxseg; } /* Process any window updates */ if (tiwin > tp->snd_wnd) tcp_update_window(tp, thflags, th, tiwin, tlen); tcp_ccdbg_trace(tp, th, TCP_CC_IN_FASTRECOVERY); (void) tcp_output(tp); goto drop; } else if (tp->t_dupacks == tp->t_rexmtthresh) { tcp_seq onxt = tp->snd_nxt; /* * If we're doing sack, check to * see if we're already in sack * recovery. If we're not doing sack, * check to see if we're in newreno * recovery. */ if (SACK_ENABLED(tp)) { if (IN_FASTRECOVERY(tp)) { tp->t_dupacks = 0; break; } else if (tp->t_flagsext & TF_DELAY_RECOVERY) { break; } } else { if (SEQ_LEQ(th->th_ack, tp->snd_recover)) { tp->t_dupacks = 0; break; } } if (tp->t_flags & TF_SENTFIN) tp->snd_recover = tp->snd_max - 1; else tp->snd_recover = tp->snd_max; tp->t_timer[TCPT_PTO] = 0; tp->t_rtttime = 0; /* * If the connection has seen pkt * reordering, delay recovery until * it is clear that the packet * was lost. */ if (SACK_ENABLED(tp) && (tp->t_flagsext & (TF_PKTS_REORDERED|TF_DELAY_RECOVERY)) == TF_PKTS_REORDERED && !IN_FASTRECOVERY(tp) && tp->t_reorderwin > 0 && (tp->t_state == TCPS_ESTABLISHED || tp->t_state == TCPS_FIN_WAIT_1)) { tp->t_timer[TCPT_DELAYFR] = OFFSET_FROM_START(tp, tp->t_reorderwin); tp->t_flagsext |= TF_DELAY_RECOVERY; tcpstat.tcps_delay_recovery++; tcp_ccdbg_trace(tp, th, TCP_CC_DELAY_FASTRECOVERY); break; } tcp_rexmt_save_state(tp); /* * If the current tcp cc module has * defined a hook for tasks to run * before entering FR, call it */ if (CC_ALGO(tp)->pre_fr != NULL) CC_ALGO(tp)->pre_fr(tp); ENTER_FASTRECOVERY(tp); tp->t_timer[TCPT_REXMT] = 0; if (TCP_ECN_ENABLED(tp)) tp->ecn_flags |= TE_SENDCWR; if (SACK_ENABLED(tp)) { tcpstat.tcps_sack_recovery_episode++; tp->t_sack_recovery_episode++; tp->sack_newdata = tp->snd_nxt; tp->snd_cwnd = tp->t_maxseg; tp->t_flagsext &= ~TF_CWND_NONVALIDATED; /* Process any window updates */ if (tiwin > tp->snd_wnd) tcp_update_window( tp, thflags, th, tiwin, tlen); tcp_ccdbg_trace(tp, th, TCP_CC_ENTER_FASTRECOVERY); (void) tcp_output(tp); goto drop; } tp->snd_nxt = th->th_ack; tp->snd_cwnd = tp->t_maxseg; /* Process any window updates */ if (tiwin > tp->snd_wnd) tcp_update_window(tp, thflags, th, tiwin, tlen); (void) tcp_output(tp); if (tp->t_flagsext & TF_CWND_NONVALIDATED) { tcp_cc_adjust_nonvalidated_cwnd(tp); } else { tp->snd_cwnd = tp->snd_ssthresh + tp->t_maxseg * tp->t_dupacks; } if (SEQ_GT(onxt, tp->snd_nxt)) tp->snd_nxt = onxt; tcp_ccdbg_trace(tp, th, TCP_CC_ENTER_FASTRECOVERY); goto drop; } else if (limited_txmt && ALLOW_LIMITED_TRANSMIT(tp) && (!(SACK_ENABLED(tp)) || sack_bytes_acked > 0) && (so->so_snd.sb_cc - (tp->snd_max - tp->snd_una)) > 0) { u_int32_t incr = (tp->t_maxseg * tp->t_dupacks); /* Use Limited Transmit algorithm on the first two * duplicate acks when there is new data to transmit */ tp->snd_cwnd += incr; tcpstat.tcps_limited_txt++; (void) tcp_output(tp); tcp_ccdbg_trace(tp, th, TCP_CC_LIMITED_TRANSMIT); /* Reset snd_cwnd back to normal */ tp->snd_cwnd -= incr; } } break; } /* * If the congestion window was inflated to account * for the other side's cached packets, retract it. */ if (IN_FASTRECOVERY(tp)) { if (SEQ_LT(th->th_ack, tp->snd_recover)) { /* * If we received an ECE and entered * recovery, the subsequent ACKs should * not be treated as partial acks. */ if (tp->ecn_flags & TE_INRECOVERY) goto process_ACK; if (SACK_ENABLED(tp)) tcp_sack_partialack(tp, th); else tcp_newreno_partial_ack(tp, th); tcp_ccdbg_trace(tp, th, TCP_CC_PARTIAL_ACK); } else { EXIT_FASTRECOVERY(tp); if (CC_ALGO(tp)->post_fr != NULL) CC_ALGO(tp)->post_fr(tp, th); tp->t_pipeack = 0; tcp_clear_pipeack_state(tp); tcp_ccdbg_trace(tp, th, TCP_CC_EXIT_FASTRECOVERY); } } else if ((tp->t_flagsext & (TF_PKTS_REORDERED|TF_DELAY_RECOVERY)) == (TF_PKTS_REORDERED|TF_DELAY_RECOVERY)) { /* * If the ack acknowledges upto snd_recover or if * it acknowledges all the snd holes, exit * recovery and cancel the timer. Otherwise, * this is a partial ack. Wait for recovery timer * to enter recovery. The snd_holes have already * been updated. */ if (SEQ_GEQ(th->th_ack, tp->snd_recover) || TAILQ_EMPTY(&tp->snd_holes)) { tp->t_timer[TCPT_DELAYFR] = 0; tp->t_flagsext &= ~TF_DELAY_RECOVERY; EXIT_FASTRECOVERY(tp); tcp_ccdbg_trace(tp, th, TCP_CC_EXIT_FASTRECOVERY); } } else { /* * We were not in fast recovery. Reset the * duplicate ack counter. */ tp->t_dupacks = 0; tp->t_rexmtthresh = tcprexmtthresh; } /* * If we reach this point, ACK is not a duplicate, * i.e., it ACKs something we sent. */ if (tp->t_flags & TF_NEEDSYN) { /* * T/TCP: Connection was half-synchronized, and our * SYN has been ACK'd (so connection is now fully * synchronized). Go to non-starred state, * increment snd_una for ACK of SYN, and check if * we can do window scaling. */ tp->t_flags &= ~TF_NEEDSYN; tp->snd_una++; /* Do window scaling? */ if (TCP_WINDOW_SCALE_ENABLED(tp)) { tp->snd_scale = tp->requested_s_scale; tp->rcv_scale = tp->request_r_scale; } } process_ACK: VERIFY(SEQ_GEQ(th->th_ack, tp->snd_una)); acked = BYTES_ACKED(th, tp); tcpstat.tcps_rcvackpack++; tcpstat.tcps_rcvackbyte += acked; /* * If the last packet was a retransmit, make sure * it was not spurious. * * This will also take care of congestion window * adjustment if a last packet was recovered due to a * tail loss probe. */ tcp_bad_rexmt_check(tp, th, &to); /* Recalculate the RTT */ tcp_compute_rtt(tp, &to, th); /* * If all outstanding data is acked, stop retransmit * timer and remember to restart (more output or persist). * If there is more data to be acked, restart retransmit * timer, using current (possibly backed-off) value. */ TCP_RESET_REXMT_STATE(tp); TCPT_RANGESET(tp->t_rxtcur, TCP_REXMTVAL(tp), tp->t_rttmin, TCPTV_REXMTMAX, TCP_ADD_REXMTSLOP(tp)); if (th->th_ack == tp->snd_max) { tp->t_timer[TCPT_REXMT] = 0; tp->t_timer[TCPT_PTO] = 0; needoutput = 1; } else if (tp->t_timer[TCPT_PERSIST] == 0) tp->t_timer[TCPT_REXMT] = OFFSET_FROM_START(tp, tp->t_rxtcur); /* * If no data (only SYN) was ACK'd, skip rest of ACK * processing. */ if (acked == 0) goto step6; /* * When outgoing data has been acked (except the SYN+data), we * mark this connection as "sending good" for TFO. */ if ((tp->t_tfo_stats & TFO_S_SYN_DATA_SENT) && !(tp->t_tfo_flags & TFO_F_NO_SNDPROBING) && !(th->th_flags & TH_SYN)) tcp_heuristic_tfo_snd_good(tp); /* * If TH_ECE is received, make sure that ECN is enabled * on that connection and we have sent ECT on data packets. */ if ((thflags & TH_ECE) != 0 && TCP_ECN_ENABLED(tp) && (tp->ecn_flags & TE_SENDIPECT)) { /* * Reduce the congestion window if we haven't * done so. */ if (!IN_FASTRECOVERY(tp)) { tcp_reduce_congestion_window(tp); tp->ecn_flags |= (TE_INRECOVERY|TE_SENDCWR); /* * Also note that the connection received * ECE atleast once */ tp->ecn_flags |= TE_RECV_ECN_ECE; INP_INC_IFNET_STAT(inp, ecn_recv_ece); tcpstat.tcps_ecn_recv_ece++; tcp_ccdbg_trace(tp, th, TCP_CC_ECN_RCVD); } } /* * When new data is acked, open the congestion window. * The specifics of how this is achieved are up to the * congestion control algorithm in use for this connection. * * The calculations in this function assume that snd_una is * not updated yet. */ if (!IN_FASTRECOVERY(tp)) { if (CC_ALGO(tp)->ack_rcvd != NULL) CC_ALGO(tp)->ack_rcvd(tp, th); tcp_ccdbg_trace(tp, th, TCP_CC_ACK_RCVD); } if (acked > so->so_snd.sb_cc) { tp->snd_wnd -= so->so_snd.sb_cc; sbdrop(&so->so_snd, (int)so->so_snd.sb_cc); if (so->so_flags & SOF_ENABLE_MSGS) { so->so_msg_state->msg_serial_bytes -= (int)so->so_snd.sb_cc; } ourfinisacked = 1; } else { sbdrop(&so->so_snd, acked); if (so->so_flags & SOF_ENABLE_MSGS) { so->so_msg_state->msg_serial_bytes -= acked; } tcp_sbsnd_trim(&so->so_snd); tp->snd_wnd -= acked; ourfinisacked = 0; } /* detect una wraparound */ if ( !IN_FASTRECOVERY(tp) && SEQ_GT(tp->snd_una, tp->snd_recover) && SEQ_LEQ(th->th_ack, tp->snd_recover)) tp->snd_recover = th->th_ack - 1; if (IN_FASTRECOVERY(tp) && SEQ_GEQ(th->th_ack, tp->snd_recover)) EXIT_FASTRECOVERY(tp); tp->snd_una = th->th_ack; if (SACK_ENABLED(tp)) { if (SEQ_GT(tp->snd_una, tp->snd_recover)) tp->snd_recover = tp->snd_una; } if (SEQ_LT(tp->snd_nxt, tp->snd_una)) tp->snd_nxt = tp->snd_una; if (!SLIST_EMPTY(&tp->t_rxt_segments) && !TCP_DSACK_SEQ_IN_WINDOW(tp, tp->t_dsack_lastuna, tp->snd_una)) tcp_rxtseg_clean(tp); if ((tp->t_flagsext & TF_MEASURESNDBW) != 0 && tp->t_bwmeas != NULL) tcp_bwmeas_check(tp); /* * sowwakeup must happen after snd_una, et al. are * updated so that the sequence numbers are in sync with * so_snd */ sowwakeup(so); if (!SLIST_EMPTY(&tp->t_notify_ack)) tcp_notify_acknowledgement(tp, so); switch (tp->t_state) { /* * In FIN_WAIT_1 STATE in addition to the processing * for the ESTABLISHED state if our FIN is now acknowledged * then enter FIN_WAIT_2. */ case TCPS_FIN_WAIT_1: if (ourfinisacked) { /* * If we can't receive any more * data, then closing user can proceed. * Starting the TCPT_2MSL timer is contrary to the * specification, but if we don't get a FIN * we'll hang forever. */ if (so->so_state & SS_CANTRCVMORE) { tp->t_timer[TCPT_2MSL] = OFFSET_FROM_START(tp, TCP_CONN_MAXIDLE(tp)); isconnected = FALSE; isdisconnected = TRUE; } DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_FIN_WAIT_2); tp->t_state = TCPS_FIN_WAIT_2; /* fall through and make sure we also recognize * data ACKed with the FIN */ } break; /* * In CLOSING STATE in addition to the processing for * the ESTABLISHED state if the ACK acknowledges our FIN * then enter the TIME-WAIT state, otherwise ignore * the segment. */ case TCPS_CLOSING: if (ourfinisacked) { DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_TIME_WAIT); tp->t_state = TCPS_TIME_WAIT; tcp_canceltimers(tp); if (tp->t_flagsext & TF_NOTIMEWAIT) { tp->t_flags |= TF_CLOSING; } else { add_to_time_wait(tp, 2 * tcp_msl); } isconnected = FALSE; isdisconnected = TRUE; } break; /* * In LAST_ACK, we may still be waiting for data to drain * and/or to be acked, as well as for the ack of our FIN. * If our FIN is now acknowledged, delete the TCB, * enter the closed state and return. */ case TCPS_LAST_ACK: if (ourfinisacked) { tp = tcp_close(tp); goto drop; } break; /* * In TIME_WAIT state the only thing that should arrive * is a retransmission of the remote FIN. Acknowledge * it and restart the finack timer. */ case TCPS_TIME_WAIT: add_to_time_wait(tp, 2 * tcp_msl); goto dropafterack; } /* * If there is a SACK option on the ACK and we * haven't seen any duplicate acks before, count * it as a duplicate ack even if the cumulative * ack is advanced. If the receiver delayed an * ack and detected loss afterwards, then the ack * will advance cumulative ack and will also have * a SACK option. So counting it as one duplicate * ack is ok. */ if (sack_ackadv == 1 && tp->t_state == TCPS_ESTABLISHED && SACK_ENABLED(tp) && sack_bytes_acked > 0 && to.to_nsacks > 0 && tp->t_dupacks == 0 && SEQ_LEQ(th->th_ack, tp->snd_una) && tlen == 0 && !(tp->t_flagsext & TF_PKTS_REORDERED)) { tcpstat.tcps_sack_ackadv++; goto process_dupack; } } step6: /* * Update window information. */ if (tcp_update_window(tp, thflags, th, tiwin, tlen)) needoutput = 1; /* * Process segments with URG. */ if ((thflags & TH_URG) && th->th_urp && TCPS_HAVERCVDFIN(tp->t_state) == 0) { /* * This is a kludge, but if we receive and accept * random urgent pointers, we'll crash in * soreceive. It's hard to imagine someone * actually wanting to send this much urgent data. */ if (th->th_urp + so->so_rcv.sb_cc > sb_max) { th->th_urp = 0; /* XXX */ thflags &= ~TH_URG; /* XXX */ goto dodata; /* XXX */ } /* * If this segment advances the known urgent pointer, * then mark the data stream. This should not happen * in CLOSE_WAIT, CLOSING, LAST_ACK or TIME_WAIT STATES since * a FIN has been received from the remote side. * In these states we ignore the URG. * * According to RFC961 (Assigned Protocols), * the urgent pointer points to the last octet * of urgent data. We continue, however, * to consider it to indicate the first octet * of data past the urgent section as the original * spec states (in one of two places). */ if (SEQ_GT(th->th_seq+th->th_urp, tp->rcv_up)) { tp->rcv_up = th->th_seq + th->th_urp; so->so_oobmark = so->so_rcv.sb_cc + (tp->rcv_up - tp->rcv_nxt) - 1; if (so->so_oobmark == 0) { so->so_state |= SS_RCVATMARK; postevent(so, 0, EV_OOB); } sohasoutofband(so); tp->t_oobflags &= ~(TCPOOB_HAVEDATA | TCPOOB_HADDATA); } /* * Remove out of band data so doesn't get presented to user. * This can happen independent of advancing the URG pointer, * but if two URG's are pending at once, some out-of-band * data may creep in... ick. */ if (th->th_urp <= (u_int32_t)tlen #if SO_OOBINLINE && (so->so_options & SO_OOBINLINE) == 0 #endif ) tcp_pulloutofband(so, th, m, drop_hdrlen); /* hdr drop is delayed */ } else { /* * If no out of band data is expected, * pull receive urgent pointer along * with the receive window. */ if (SEQ_GT(tp->rcv_nxt, tp->rcv_up)) tp->rcv_up = tp->rcv_nxt; } dodata: /* Set socket's connect or disconnect state correcly before doing data. * The following might unlock the socket if there is an upcall or a socket * filter. */ if (isconnected) { soisconnected(so); } else if (isdisconnected) { soisdisconnected(so); } /* Let's check the state of pcb just to make sure that it did not get closed * when we unlocked above */ if (inp->inp_state == INPCB_STATE_DEAD) { /* Just drop the packet that we are processing and return */ goto drop; } /* * Process the segment text, merging it into the TCP sequencing queue, * and arranging for acknowledgment of receipt if necessary. * This process logically involves adjusting tp->rcv_wnd as data * is presented to the user (this happens in tcp_usrreq.c, * case PRU_RCVD). If a FIN has already been received on this * connection then we just ignore the text. * * If we are in SYN-received state and got a valid TFO cookie, we want * to process the data. */ if ((tlen || (thflags & TH_FIN)) && TCPS_HAVERCVDFIN(tp->t_state) == 0 && (TCPS_HAVEESTABLISHED(tp->t_state) || (tp->t_state == TCPS_SYN_RECEIVED && (tp->t_tfo_flags & TFO_F_COOKIE_VALID)))) { tcp_seq save_start = th->th_seq; tcp_seq save_end = th->th_seq + tlen; m_adj(m, drop_hdrlen); /* delayed header drop */ /* * Insert segment which includes th into TCP reassembly queue * with control block tp. Set thflags to whether reassembly now * includes a segment with FIN. This handles the common case * inline (segment is the next to be received on an established * connection, and the queue is empty), avoiding linkage into * and removal from the queue and repetition of various * conversions. * Set DELACK for segments received in order, but ack * immediately when segments are out of order (so * fast retransmit can work). */ if (th->th_seq == tp->rcv_nxt && LIST_EMPTY(&tp->t_segq)) { TCP_INC_VAR(tp->t_unacksegs, nlropkts); /* * Calculate the RTT on the receiver only if the * connection is in streaming mode and the last * packet was not an end-of-write */ if (tp->t_flags & TF_STREAMING_ON) tcp_compute_rtt(tp, &to, th); if (DELAY_ACK(tp, th) && ((tp->t_flags & TF_ACKNOW) == 0) ) { if ((tp->t_flags & TF_DELACK) == 0) { tp->t_flags |= TF_DELACK; tp->t_timer[TCPT_DELACK] = OFFSET_FROM_START(tp, tcp_delack); } } else { tp->t_flags |= TF_ACKNOW; } tp->rcv_nxt += tlen; thflags = th->th_flags & TH_FIN; TCP_INC_VAR(tcpstat.tcps_rcvpack, nlropkts); tcpstat.tcps_rcvbyte += tlen; if (nstat_collect) { if (m->m_pkthdr.pkt_flags & PKTF_SW_LRO_PKT) { INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, m->m_pkthdr.lro_npkts); } else { INP_ADD_STAT(inp, cell, wifi, wired, rxpackets, 1); } INP_ADD_STAT(inp, cell, wifi, wired, rxbytes, tlen); } tcp_sbrcv_grow(tp, &so->so_rcv, &to, tlen, TCP_AUTORCVBUF_MAX(ifp)); so_recv_data_stat(so, m, drop_hdrlen); if (sbappendstream_rcvdemux(so, m, th->th_seq - (tp->irs + 1), 0)) { sorwakeup(so); } } else { thflags = tcp_reass(tp, th, &tlen, m, ifp); tp->t_flags |= TF_ACKNOW; } if ((tlen > 0 || (th->th_flags & TH_FIN)) && SACK_ENABLED(tp)) { if (th->th_flags & TH_FIN) save_end++; tcp_update_sack_list(tp, save_start, save_end); } tcp_adaptive_rwtimo_check(tp, tlen); if (tlen > 0) tcp_tfo_rcv_data(tp); if (tp->t_flags & TF_DELACK) { #if INET6 if (isipv6) { KERNEL_DEBUG(DBG_LAYER_END, ((th->th_dport << 16) | th->th_sport), (((ip6->ip6_src.s6_addr16[0]) << 16) | (ip6->ip6_dst.s6_addr16[0])), th->th_seq, th->th_ack, th->th_win); } else #endif { KERNEL_DEBUG(DBG_LAYER_END, ((th->th_dport << 16) | th->th_sport), (((ip->ip_src.s_addr & 0xffff) << 16) | (ip->ip_dst.s_addr & 0xffff)), th->th_seq, th->th_ack, th->th_win); } } } else { m_freem(m); thflags &= ~TH_FIN; } /* * If FIN is received ACK the FIN and let the user know * that the connection is closing. */ if (thflags & TH_FIN) { if (TCPS_HAVERCVDFIN(tp->t_state) == 0) { socantrcvmore(so); postevent(so, 0, EV_FIN); /* * If connection is half-synchronized * (ie NEEDSYN flag on) then delay ACK, * so it may be piggybacked when SYN is sent. * Otherwise, since we received a FIN then no * more input can be expected, send ACK now. */ TCP_INC_VAR(tp->t_unacksegs, nlropkts); if (DELAY_ACK(tp, th) && (tp->t_flags & TF_NEEDSYN)) { if ((tp->t_flags & TF_DELACK) == 0) { tp->t_flags |= TF_DELACK; tp->t_timer[TCPT_DELACK] = OFFSET_FROM_START(tp, tcp_delack); } } else { tp->t_flags |= TF_ACKNOW; } tp->rcv_nxt++; } switch (tp->t_state) { /* * In SYN_RECEIVED and ESTABLISHED STATES * enter the CLOSE_WAIT state. */ case TCPS_SYN_RECEIVED: tp->t_starttime = tcp_now; case TCPS_ESTABLISHED: DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_CLOSE_WAIT); tp->t_state = TCPS_CLOSE_WAIT; break; /* * If still in FIN_WAIT_1 STATE FIN has not been acked so * enter the CLOSING state. */ case TCPS_FIN_WAIT_1: DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_CLOSING); tp->t_state = TCPS_CLOSING; break; /* * In FIN_WAIT_2 state enter the TIME_WAIT state, * starting the time-wait timer, turning off the other * standard timers. */ case TCPS_FIN_WAIT_2: DTRACE_TCP4(state__change, void, NULL, struct inpcb *, inp, struct tcpcb *, tp, int32_t, TCPS_TIME_WAIT); tp->t_state = TCPS_TIME_WAIT; tcp_canceltimers(tp); tp->t_flags |= TF_ACKNOW; if (tp->t_flagsext & TF_NOTIMEWAIT) { tp->t_flags |= TF_CLOSING; } else { add_to_time_wait(tp, 2 * tcp_msl); } soisdisconnected(so); break; /* * In TIME_WAIT state restart the 2 MSL time_wait timer. */ case TCPS_TIME_WAIT: add_to_time_wait(tp, 2 * tcp_msl); break; } } #if TCPDEBUG if (so->so_options & SO_DEBUG) tcp_trace(TA_INPUT, ostate, tp, (void *)tcp_saveipgen, &tcp_savetcp, 0); #endif /* * Return any desired output. */ if (needoutput || (tp->t_flags & TF_ACKNOW)) { (void) tcp_output(tp); } tcp_check_timer_state(tp); tcp_unlock(so, 1, 0); KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_END,0,0,0,0,0); return; dropafterack: /* * Generate an ACK dropping incoming segment if it occupies * sequence space, where the ACK reflects our state. * * We can now skip the test for the RST flag since all * paths to this code happen after packets containing * RST have been dropped. * * In the SYN-RECEIVED state, don't send an ACK unless the * segment we received passes the SYN-RECEIVED ACK test. * If it fails send a RST. This breaks the loop in the * "LAND" DoS attack, and also prevents an ACK storm * between two listening ports that have been sent forged * SYN segments, each with the source address of the other. */ if (tp->t_state == TCPS_SYN_RECEIVED && (thflags & TH_ACK) && (SEQ_GT(tp->snd_una, th->th_ack) || SEQ_GT(th->th_ack, tp->snd_max)) ) { rstreason = BANDLIM_RST_OPENPORT; IF_TCP_STATINC(ifp, dospacket); goto dropwithreset; } #if TCPDEBUG if (so->so_options & SO_DEBUG) tcp_trace(TA_DROP, ostate, tp, (void *)tcp_saveipgen, &tcp_savetcp, 0); #endif m_freem(m); tp->t_flags |= TF_ACKNOW; (void) tcp_output(tp); /* Don't need to check timer state as we should have done it during tcp_output */ tcp_unlock(so, 1, 0); KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_END,0,0,0,0,0); return; dropwithresetnosock: nosock = 1; dropwithreset: /* * Generate a RST, dropping incoming segment. * Make ACK acceptable to originator of segment. * Don't bother to respond if destination was broadcast/multicast. */ if ((thflags & TH_RST) || m->m_flags & (M_BCAST|M_MCAST)) goto drop; #if INET6 if (isipv6) { if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_dst) || IN6_IS_ADDR_MULTICAST(&ip6->ip6_src)) goto drop; } else #endif /* INET6 */ if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr)) || IN_MULTICAST(ntohl(ip->ip_src.s_addr)) || ip->ip_src.s_addr == htonl(INADDR_BROADCAST) || in_broadcast(ip->ip_dst, m->m_pkthdr.rcvif)) goto drop; /* IPv6 anycast check is done at tcp6_input() */ /* * Perform bandwidth limiting. */ #if ICMP_BANDLIM if (badport_bandlim(rstreason) < 0) goto drop; #endif #if TCPDEBUG if (tp == 0 || (tp->t_inpcb->inp_socket->so_options & SO_DEBUG)) tcp_trace(TA_DROP, ostate, tp, (void *)tcp_saveipgen, &tcp_savetcp, 0); #endif bzero(&tra, sizeof(tra)); tra.ifscope = ifscope; tra.awdl_unrestricted = 1; tra.intcoproc_allowed = 1; if (thflags & TH_ACK) /* mtod() below is safe as long as hdr dropping is delayed */ tcp_respond(tp, mtod(m, void *), th, m, (tcp_seq)0, th->th_ack, TH_RST, &tra); else { if (thflags & TH_SYN) tlen++; /* mtod() below is safe as long as hdr dropping is delayed */ tcp_respond(tp, mtod(m, void *), th, m, th->th_seq+tlen, (tcp_seq)0, TH_RST|TH_ACK, &tra); } /* destroy temporarily created socket */ if (dropsocket) { (void) soabort(so); tcp_unlock(so, 1, 0); } else if ((inp != NULL) && (nosock == 0)) { tcp_unlock(so, 1, 0); } KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_END,0,0,0,0,0); return; dropnosock: nosock = 1; drop: /* * Drop space held by incoming segment and return. */ #if TCPDEBUG if (tp == 0 || (tp->t_inpcb->inp_socket->so_options & SO_DEBUG)) tcp_trace(TA_DROP, ostate, tp, (void *)tcp_saveipgen, &tcp_savetcp, 0); #endif m_freem(m); /* destroy temporarily created socket */ if (dropsocket) { (void) soabort(so); tcp_unlock(so, 1, 0); } else if (nosock == 0) { tcp_unlock(so, 1, 0); } KERNEL_DEBUG(DBG_FNC_TCP_INPUT | DBG_FUNC_END,0,0,0,0,0); return; } /* * Parse TCP options and place in tcpopt. */ static void tcp_dooptions(struct tcpcb *tp, u_char *cp, int cnt, struct tcphdr *th, struct tcpopt *to) { u_short mss = 0; int opt, optlen; for (; cnt > 0; cnt -= optlen, cp += optlen) { opt = cp[0]; if (opt == TCPOPT_EOL) break; if (opt == TCPOPT_NOP) optlen = 1; else { if (cnt < 2) break; optlen = cp[1]; if (optlen < 2 || optlen > cnt) break; } switch (opt) { default: continue; case TCPOPT_MAXSEG: if (optlen != TCPOLEN_MAXSEG) continue; if (!(th->th_flags & TH_SYN)) continue; bcopy((char *) cp + 2, (char *) &mss, sizeof(mss)); NTOHS(mss); to->to_mss = mss; to->to_flags |= TOF_MSS; break; case TCPOPT_WINDOW: if (optlen != TCPOLEN_WINDOW) continue; if (!(th->th_flags & TH_SYN)) continue; to->to_flags |= TOF_SCALE; to->to_requested_s_scale = min(cp[2], TCP_MAX_WINSHIFT); break; case TCPOPT_TIMESTAMP: if (optlen != TCPOLEN_TIMESTAMP) continue; to->to_flags |= TOF_TS; bcopy((char *)cp + 2, (char *)&to->to_tsval, sizeof(to->to_tsval)); NTOHL(to->to_tsval); bcopy((char *)cp + 6, (char *)&to->to_tsecr, sizeof(to->to_tsecr)); NTOHL(to->to_tsecr); /* Re-enable sending Timestamps if we received them */ if (!(tp->t_flags & TF_REQ_TSTMP) && tcp_do_rfc1323 == 1) tp->t_flags |= TF_REQ_TSTMP; break; case TCPOPT_SACK_PERMITTED: if (!tcp_do_sack || optlen != TCPOLEN_SACK_PERMITTED) continue; if (th->th_flags & TH_SYN) to->to_flags |= TOF_SACK; break; case TCPOPT_SACK: if (optlen <= 2 || (optlen - 2) % TCPOLEN_SACK != 0) continue; to->to_nsacks = (optlen - 2) / TCPOLEN_SACK; to->to_sacks = cp + 2; tcpstat.tcps_sack_rcv_blocks++; break; case TCPOPT_FASTOPEN: if (optlen == TCPOLEN_FASTOPEN_REQ) { if (tp->t_state != TCPS_LISTEN) continue; to->to_flags |= TOF_TFOREQ; } else { if (optlen < TCPOLEN_FASTOPEN_REQ || (optlen - TCPOLEN_FASTOPEN_REQ) > TFO_COOKIE_LEN_MAX || (optlen - TCPOLEN_FASTOPEN_REQ) < TFO_COOKIE_LEN_MIN) continue; if (tp->t_state != TCPS_LISTEN && tp->t_state != TCPS_SYN_SENT) continue; to->to_flags |= TOF_TFO; to->to_tfo = cp + 1; } break; #if MPTCP case TCPOPT_MULTIPATH: tcp_do_mptcp_options(tp, cp, th, to, optlen); break; #endif /* MPTCP */ } } } static void tcp_finalize_options(struct tcpcb *tp, struct tcpopt *to, unsigned int ifscope) { if (to->to_flags & TOF_TS) { tp->t_flags |= TF_RCVD_TSTMP; tp->ts_recent = to->to_tsval; tp->ts_recent_age = tcp_now; } if (to->to_flags & TOF_MSS) tcp_mss(tp, to->to_mss, ifscope); if (SACK_ENABLED(tp)) { if (!(to->to_flags & TOF_SACK)) tp->t_flagsext &= ~(TF_SACK_ENABLE); else tp->t_flags |= TF_SACK_PERMIT; } if (to->to_flags & TOF_SCALE) { tp->t_flags |= TF_RCVD_SCALE; tp->requested_s_scale = to->to_requested_s_scale; /* Re-enable window scaling, if the option is received */ if (tp->request_r_scale > 0) tp->t_flags |= TF_REQ_SCALE; } } /* * Pull out of band byte out of a segment so * it doesn't appear in the user's data queue. * It is still reflected in the segment length for * sequencing purposes. * * @param off delayed to be droped hdrlen */ static void tcp_pulloutofband(struct socket *so, struct tcphdr *th, struct mbuf *m, int off) { int cnt = off + th->th_urp - 1; while (cnt >= 0) { if (m->m_len > cnt) { char *cp = mtod(m, caddr_t) + cnt; struct tcpcb *tp = sototcpcb(so); tp->t_iobc = *cp; tp->t_oobflags |= TCPOOB_HAVEDATA; bcopy(cp+1, cp, (unsigned)(m->m_len - cnt - 1)); m->m_len--; if (m->m_flags & M_PKTHDR) m->m_pkthdr.len--; return; } cnt -= m->m_len; m = m->m_next; if (m == 0) break; } panic("tcp_pulloutofband"); } uint32_t get_base_rtt(struct tcpcb *tp) { struct rtentry *rt = tp->t_inpcb->inp_route.ro_rt; return ((rt == NULL) ? 0 : rt->rtt_min); } /* Each value of RTT base represents the minimum RTT seen in a minute. * We keep upto N_RTT_BASE minutes worth of history. */ void update_base_rtt(struct tcpcb *tp, uint32_t rtt) { u_int32_t base_rtt, i; struct rtentry *rt; if ((rt = tp->t_inpcb->inp_route.ro_rt) == NULL) return; if (rt->rtt_expire_ts == 0) { RT_LOCK_SPIN(rt); if (rt->rtt_expire_ts != 0) { RT_UNLOCK(rt); goto update; } rt->rtt_expire_ts = tcp_now; rt->rtt_index = 0; rt->rtt_hist[0] = rtt; rt->rtt_min = rtt; RT_UNLOCK(rt); return; } update: #if TRAFFIC_MGT /* * If the recv side is being throttled, check if the * current RTT is closer to the base RTT seen in * first (recent) two slots. If so, unthrottle the stream. */ if ((tp->t_flagsext & TF_RECV_THROTTLE) && (int)(tcp_now - tp->t_recv_throttle_ts) >= TCP_RECV_THROTTLE_WIN) { base_rtt = rt->rtt_min; if (tp->t_rttcur <= (base_rtt + target_qdelay)) { tp->t_flagsext &= ~TF_RECV_THROTTLE; tp->t_recv_throttle_ts = 0; } } #endif /* TRAFFIC_MGT */ if ((int)(tcp_now - rt->rtt_expire_ts) >= TCP_RTT_HISTORY_EXPIRE_TIME) { RT_LOCK_SPIN(rt); /* check the condition again to avoid race */ if ((int)(tcp_now - rt->rtt_expire_ts) >= TCP_RTT_HISTORY_EXPIRE_TIME) { rt->rtt_index++; if (rt->rtt_index >= NRTT_HIST) rt->rtt_index = 0; rt->rtt_hist[rt->rtt_index] = rtt; rt->rtt_expire_ts = tcp_now; } else { rt->rtt_hist[rt->rtt_index] = min(rt->rtt_hist[rt->rtt_index], rtt); } /* forget the old value and update minimum */ rt->rtt_min = 0; for (i = 0; i < NRTT_HIST; ++i) { if (rt->rtt_hist[i] != 0 && (rt->rtt_min == 0 || rt->rtt_hist[i] < rt->rtt_min)) rt->rtt_min = rt->rtt_hist[i]; } RT_UNLOCK(rt); } else { rt->rtt_hist[rt->rtt_index] = min(rt->rtt_hist[rt->rtt_index], rtt); if (rt->rtt_min == 0) rt->rtt_min = rtt; else rt->rtt_min = min(rt->rtt_min, rtt); } } /* * If we have a timestamp reply, update smoothed RTT. If no timestamp is * present but transmit timer is running and timed sequence number was * acked, update smoothed RTT. * * If timestamps are supported, a receiver can update RTT even if * there is no outstanding data. * * Some boxes send broken timestamp replies during the SYN+ACK phase, * ignore timestamps of 0or we could calculate a huge RTT and blow up * the retransmit timer. */ static void tcp_compute_rtt(struct tcpcb *tp, struct tcpopt *to, struct tcphdr *th) { int rtt = 0; VERIFY(to != NULL && th != NULL); if (tp->t_rtttime != 0 && SEQ_GT(th->th_ack, tp->t_rtseq)) { u_int32_t pipe_ack_val; rtt = tcp_now - tp->t_rtttime; /* * Compute pipe ack -- the amount of data acknowledged * in the last RTT */ if (SEQ_GT(th->th_ack, tp->t_pipeack_lastuna)) { pipe_ack_val = th->th_ack - tp->t_pipeack_lastuna; /* Update the sample */ tp->t_pipeack_sample[tp->t_pipeack_ind++] = pipe_ack_val; tp->t_pipeack_ind %= TCP_PIPEACK_SAMPLE_COUNT; /* Compute the max of the pipeack samples */ pipe_ack_val = tcp_get_max_pipeack(tp); tp->t_pipeack = (pipe_ack_val > TCP_CC_CWND_INIT_BYTES) ? pipe_ack_val : 0; } /* start another measurement */ tp->t_rtttime = 0; } if (((to->to_flags & TOF_TS) != 0) && (to->to_tsecr != 0) && TSTMP_GEQ(tcp_now, to->to_tsecr)) { tcp_xmit_timer(tp, (tcp_now - to->to_tsecr), to->to_tsecr, th->th_ack); } else if (rtt > 0) { tcp_xmit_timer(tp, rtt, 0, th->th_ack); } } /* * Collect new round-trip time estimate * and update averages and current timeout. */ static void tcp_xmit_timer(struct tcpcb *tp, int rtt, u_int32_t tsecr, tcp_seq th_ack) { int delta; if (tp->t_flagsext & TF_RECOMPUTE_RTT) { if (SEQ_GT(th_ack, tp->snd_una) && SEQ_LEQ(th_ack, tp->snd_max) && (tsecr == 0 || TSTMP_GEQ(tsecr, tp->t_badrexmt_time))) { /* * We received a new ACk after a * spurious timeout. Adapt retransmission * timer as described in rfc 4015. */ tp->t_flagsext &= ~(TF_RECOMPUTE_RTT); tp->t_badrexmt_time = 0; tp->t_srtt = max(tp->t_srtt_prev, rtt); tp->t_srtt = tp->t_srtt << TCP_RTT_SHIFT; tp->t_rttvar = max(tp->t_rttvar_prev, (rtt >> 1)); tp->t_rttvar = tp->t_rttvar << TCP_RTTVAR_SHIFT; if (tp->t_rttbest > (tp->t_srtt + tp->t_rttvar)) tp->t_rttbest = tp->t_srtt + tp->t_rttvar; goto compute_rto; } else { return; } } tcpstat.tcps_rttupdated++; tp->t_rttupdated++; if (rtt > 0) { tp->t_rttcur = rtt; update_base_rtt(tp, rtt); } if (tp->t_srtt != 0) { /* * srtt is stored as fixed point with 5 bits after the * binary point (i.e., scaled by 32). The following magic * is equivalent to the smoothing algorithm in rfc793 with * an alpha of .875 (srtt = rtt/8 + srtt*7/8 in fixed * point). * * Freebsd adjusts rtt to origin 0 by subtracting 1 * from the provided rtt value. This was required because * of the way t_rtttime was initiailised to 1 before. * Since we changed t_rtttime to be based on * tcp_now, this extra adjustment is not needed. */ delta = (rtt << TCP_DELTA_SHIFT) - (tp->t_srtt >> (TCP_RTT_SHIFT - TCP_DELTA_SHIFT)); if ((tp->t_srtt += delta) <= 0) tp->t_srtt = 1; /* * We accumulate a smoothed rtt variance (actually, a * smoothed mean difference), then set the retransmit * timer to smoothed rtt + 4 times the smoothed variance. * rttvar is stored as fixed point with 4 bits after the * binary point (scaled by 16). The following is * equivalent to rfc793 smoothing with an alpha of .75 * (rttvar = rttvar*3/4 + |delta| / 4). This replaces * rfc793's wired-in beta. */ if (delta < 0) delta = -delta; delta -= tp->t_rttvar >> (TCP_RTTVAR_SHIFT - TCP_DELTA_SHIFT); if ((tp->t_rttvar += delta) <= 0) tp->t_rttvar = 1; if (tp->t_rttbest == 0 || tp->t_rttbest > (tp->t_srtt + tp->t_rttvar)) tp->t_rttbest = tp->t_srtt + tp->t_rttvar; } else { /* * No rtt measurement yet - use the unsmoothed rtt. * Set the variance to half the rtt (so our first * retransmit happens at 3*rtt). */ tp->t_srtt = rtt << TCP_RTT_SHIFT; tp->t_rttvar = rtt << (TCP_RTTVAR_SHIFT - 1); } compute_rto: nstat_route_rtt(tp->t_inpcb->inp_route.ro_rt, tp->t_srtt, tp->t_rttvar); /* * the retransmit should happen at rtt + 4 * rttvar. * Because of the way we do the smoothing, srtt and rttvar * will each average +1/2 tick of bias. When we compute * the retransmit timer, we want 1/2 tick of rounding and * 1 extra tick because of +-1/2 tick uncertainty in the * firing of the timer. The bias will give us exactly the * 1.5 tick we need. But, because the bias is * statistical, we have to test that we don't drop below * the minimum feasible timer (which is 2 ticks). */ TCPT_RANGESET(tp->t_rxtcur, TCP_REXMTVAL(tp), max(tp->t_rttmin, rtt + 2), TCPTV_REXMTMAX, TCP_ADD_REXMTSLOP(tp)); /* * We received an ack for a packet that wasn't retransmitted; * it is probably safe to discard any error indications we've * received recently. This isn't quite right, but close enough * for now (a route might have failed after we sent a segment, * and the return path might not be symmetrical). */ tp->t_softerror = 0; } static inline unsigned int tcp_maxmtu(struct rtentry *rt) { unsigned int maxmtu; RT_LOCK_ASSERT_HELD(rt); if (rt->rt_rmx.rmx_mtu == 0) maxmtu = rt->rt_ifp->if_mtu; else maxmtu = MIN(rt->rt_rmx.rmx_mtu, rt->rt_ifp->if_mtu); return (maxmtu); } #if INET6 static inline unsigned int tcp_maxmtu6(struct rtentry *rt) { unsigned int maxmtu; struct nd_ifinfo *ndi = NULL; RT_LOCK_ASSERT_HELD(rt); if ((ndi = ND_IFINFO(rt->rt_ifp)) != NULL && !ndi->initialized) ndi = NULL; if (ndi != NULL) lck_mtx_lock(&ndi->lock); if (rt->rt_rmx.rmx_mtu == 0) maxmtu = IN6_LINKMTU(rt->rt_ifp); else maxmtu = MIN(rt->rt_rmx.rmx_mtu, IN6_LINKMTU(rt->rt_ifp)); if (ndi != NULL) lck_mtx_unlock(&ndi->lock); return (maxmtu); } #endif /* * Determine a reasonable value for maxseg size. * If the route is known, check route for mtu. * If none, use an mss that can be handled on the outgoing * interface without forcing IP to fragment; if bigger than * an mbuf cluster (MCLBYTES), round down to nearest multiple of MCLBYTES * to utilize large mbufs. If no route is found, route has no mtu, * or the destination isn't local, use a default, hopefully conservative * size (usually 512 or the default IP max size, but no more than the mtu * of the interface), as we can't discover anything about intervening * gateways or networks. We also initialize the congestion/slow start * window. While looking at the routing entry, we also initialize * other path-dependent parameters from pre-set or cached values * in the routing entry. * * Also take into account the space needed for options that we * send regularly. Make maxseg shorter by that amount to assure * that we can send maxseg amount of data even when the options * are present. Store the upper limit of the length of options plus * data in maxopd. * * NOTE that this routine is only called when we process an incoming * segment, for outgoing segments only tcp_mssopt is called. * */ void tcp_mss(struct tcpcb *tp, int offer, unsigned int input_ifscope) { struct rtentry *rt; struct ifnet *ifp; int rtt, mss; u_int32_t bufsize; struct inpcb *inp; struct socket *so; struct rmxp_tao *taop; int origoffer = offer; u_int32_t sb_max_corrected; int isnetlocal = 0; #if INET6 int isipv6; int min_protoh; #endif inp = tp->t_inpcb; #if INET6 isipv6 = ((inp->inp_vflag & INP_IPV6) != 0) ? 1 : 0; min_protoh = isipv6 ? sizeof (struct ip6_hdr) + sizeof (struct tcphdr) : sizeof (struct tcpiphdr); #else #define min_protoh (sizeof (struct tcpiphdr)) #endif #if INET6 if (isipv6) { rt = tcp_rtlookup6(inp, input_ifscope); } else #endif /* INET6 */ { rt = tcp_rtlookup(inp, input_ifscope); } isnetlocal = (tp->t_flags & TF_LOCAL); if (rt == NULL) { tp->t_maxopd = tp->t_maxseg = #if INET6 isipv6 ? tcp_v6mssdflt : #endif /* INET6 */ tcp_mssdflt; return; } ifp = rt->rt_ifp; /* * Slower link window correction: * If a value is specificied for slowlink_wsize use it for * PPP links believed to be on a serial modem (speed <128Kbps). * Excludes 9600bps as it is the default value adversized * by pseudo-devices over ppp. */ if (ifp->if_type == IFT_PPP && slowlink_wsize > 0 && ifp->if_baudrate > 9600 && ifp->if_baudrate <= 128000) { tp->t_flags |= TF_SLOWLINK; } so = inp->inp_socket; taop = rmx_taop(rt->rt_rmx); /* * Offer == -1 means that we didn't receive SYN yet, * use cached value in that case; */ if (offer == -1) offer = taop->tao_mssopt; /* * Offer == 0 means that there was no MSS on the SYN segment, * in this case we use tcp_mssdflt. */ if (offer == 0) offer = #if INET6 isipv6 ? tcp_v6mssdflt : #endif /* INET6 */ tcp_mssdflt; else { /* * Prevent DoS attack with too small MSS. Round up * to at least minmss. */ offer = max(offer, tcp_minmss); /* * Sanity check: make sure that maxopd will be large * enough to allow some data on segments even is the * all the option space is used (40bytes). Otherwise * funny things may happen in tcp_output. */ offer = max(offer, 64); } taop->tao_mssopt = offer; /* * While we're here, check if there's an initial rtt * or rttvar. Convert from the route-table units * to scaled multiples of the slow timeout timer. */ if (tp->t_srtt == 0 && (rtt = rt->rt_rmx.rmx_rtt) != 0) { tcp_getrt_rtt(tp, rt); } else { tp->t_rttmin = isnetlocal ? tcp_TCPTV_MIN : TCPTV_REXMTMIN; } #if INET6 mss = (isipv6 ? tcp_maxmtu6(rt) : tcp_maxmtu(rt)); #else mss = tcp_maxmtu(rt); #endif #if NECP // At this point, the mss is just the MTU. Adjust if necessary. mss = necp_socket_get_effective_mtu(inp, mss); #endif /* NECP */ mss -= min_protoh; if (rt->rt_rmx.rmx_mtu == 0) { #if INET6 if (isipv6) { if (!isnetlocal) mss = min(mss, tcp_v6mssdflt); } else #endif /* INET6 */ if (!isnetlocal) mss = min(mss, tcp_mssdflt); } mss = min(mss, offer); /* * maxopd stores the maximum length of data AND options * in a segment; maxseg is the amount of data in a normal * segment. We need to store this value (maxopd) apart * from maxseg, because now every segment carries options * and thus we normally have somewhat less data in segments. */ tp->t_maxopd = mss; /* * origoffer==-1 indicates, that no segments were received yet. * In this case we just guess. */ if ((tp->t_flags & (TF_REQ_TSTMP|TF_NOOPT)) == TF_REQ_TSTMP && (origoffer == -1 || (tp->t_flags & TF_RCVD_TSTMP) == TF_RCVD_TSTMP)) mss -= TCPOLEN_TSTAMP_APPA; #if MPTCP mss -= mptcp_adj_mss(tp, FALSE); #endif /* MPTCP */ tp->t_maxseg = mss; /* * Calculate corrected value for sb_max; ensure to upgrade the * numerator for large sb_max values else it will overflow. */ sb_max_corrected = (sb_max * (u_int64_t)MCLBYTES) / (MSIZE + MCLBYTES); /* * If there's a pipesize (ie loopback), change the socket * buffer to that size only if it's bigger than the current * sockbuf size. Make the socket buffers an integral * number of mss units; if the mss is larger than * the socket buffer, decrease the mss. */ #if RTV_SPIPE bufsize = rt->rt_rmx.rmx_sendpipe; if (bufsize < so->so_snd.sb_hiwat) #endif bufsize = so->so_snd.sb_hiwat; if (bufsize < mss) mss = bufsize; else { bufsize = (((bufsize + (u_int64_t)mss - 1) / (u_int64_t)mss) * (u_int64_t)mss); if (bufsize > sb_max_corrected) bufsize = sb_max_corrected; (void)sbreserve(&so->so_snd, bufsize); } tp->t_maxseg = mss; /* * Update MSS using recommendation from link status report. This is * temporary */ tcp_update_mss_locked(so, ifp); #if RTV_RPIPE bufsize = rt->rt_rmx.rmx_recvpipe; if (bufsize < so->so_rcv.sb_hiwat) #endif bufsize = so->so_rcv.sb_hiwat; if (bufsize > mss) { bufsize = (((bufsize + (u_int64_t)mss - 1) / (u_int64_t)mss) * (u_int64_t)mss); if (bufsize > sb_max_corrected) bufsize = sb_max_corrected; (void)sbreserve(&so->so_rcv, bufsize); } set_tcp_stream_priority(so); if (rt->rt_rmx.rmx_ssthresh) { /* * There's some sort of gateway or interface * buffer limit on the path. Use this to set * slow-start threshold, but set the threshold to * no less than 2*mss. */ tp->snd_ssthresh = max(2 * mss, rt->rt_rmx.rmx_ssthresh); tcpstat.tcps_usedssthresh++; } else { tp->snd_ssthresh = TCP_MAXWIN << TCP_MAX_WINSHIFT; } /* * Set the slow-start flight size depending on whether this * is a local network or not. */ if (CC_ALGO(tp)->cwnd_init != NULL) CC_ALGO(tp)->cwnd_init(tp); tcp_ccdbg_trace(tp, NULL, TCP_CC_CWND_INIT); /* Route locked during lookup above */ RT_UNLOCK(rt); } /* * Determine the MSS option to send on an outgoing SYN. */ int tcp_mssopt(struct tcpcb *tp) { struct rtentry *rt; int mss; #if INET6 int isipv6; int min_protoh; #endif #if INET6 isipv6 = ((tp->t_inpcb->inp_vflag & INP_IPV6) != 0) ? 1 : 0; min_protoh = isipv6 ? sizeof (struct ip6_hdr) + sizeof (struct tcphdr) : sizeof (struct tcpiphdr); #else #define min_protoh (sizeof (struct tcpiphdr)) #endif #if INET6 if (isipv6) rt = tcp_rtlookup6(tp->t_inpcb, IFSCOPE_NONE); else #endif /* INET6 */ rt = tcp_rtlookup(tp->t_inpcb, IFSCOPE_NONE); if (rt == NULL) { return ( #if INET6 isipv6 ? tcp_v6mssdflt : #endif /* INET6 */ tcp_mssdflt); } /* * Slower link window correction: * If a value is specificied for slowlink_wsize use it for PPP links * believed to be on a serial modem (speed <128Kbps). Excludes 9600bps as * it is the default value adversized by pseudo-devices over ppp. */ if (rt->rt_ifp->if_type == IFT_PPP && slowlink_wsize > 0 && rt->rt_ifp->if_baudrate > 9600 && rt->rt_ifp->if_baudrate <= 128000) { tp->t_flags |= TF_SLOWLINK; } #if INET6 mss = (isipv6 ? tcp_maxmtu6(rt) : tcp_maxmtu(rt)); #else mss = tcp_maxmtu(rt); #endif /* Route locked during lookup above */ RT_UNLOCK(rt); #if NECP // At this point, the mss is just the MTU. Adjust if necessary. mss = necp_socket_get_effective_mtu(tp->t_inpcb, mss); #endif /* NECP */ return (mss - min_protoh); } /* * On a partial ack arrives, force the retransmission of the * next unacknowledged segment. Do not clear tp->t_dupacks. * By setting snd_nxt to th_ack, this forces retransmission timer to * be started again. */ static void tcp_newreno_partial_ack(struct tcpcb *tp, struct tcphdr *th) { tcp_seq onxt = tp->snd_nxt; u_int32_t ocwnd = tp->snd_cwnd; tp->t_timer[TCPT_REXMT] = 0; tp->t_timer[TCPT_PTO] = 0; tp->t_rtttime = 0; tp->snd_nxt = th->th_ack; /* * Set snd_cwnd to one segment beyond acknowledged offset * (tp->snd_una has not yet been updated when this function * is called) */ tp->snd_cwnd = tp->t_maxseg + BYTES_ACKED(th, tp); tp->t_flags |= TF_ACKNOW; (void) tcp_output(tp); tp->snd_cwnd = ocwnd; if (SEQ_GT(onxt, tp->snd_nxt)) tp->snd_nxt = onxt; /* * Partial window deflation. Relies on fact that tp->snd_una * not updated yet. */ if (tp->snd_cwnd > BYTES_ACKED(th, tp)) tp->snd_cwnd -= BYTES_ACKED(th, tp); else tp->snd_cwnd = 0; tp->snd_cwnd += tp->t_maxseg; } /* * Drop a random TCP connection that hasn't been serviced yet and * is eligible for discard. There is a one in qlen chance that * we will return a null, saying that there are no dropable * requests. In this case, the protocol specific code should drop * the new request. This insures fairness. * * The listening TCP socket "head" must be locked */ static int tcp_dropdropablreq(struct socket *head) { struct socket *so, *sonext; unsigned int i, j, qlen; static u_int32_t rnd = 0; static u_int64_t old_runtime; static unsigned int cur_cnt, old_cnt; u_int64_t now_sec; struct inpcb *inp = NULL; struct tcpcb *tp; if ((head->so_options & SO_ACCEPTCONN) == 0) return (0); if (TAILQ_EMPTY(&head->so_incomp)) return (0); /* * Check if there is any socket in the incomp queue * that is closed because of a reset from the peer and is * waiting to be garbage collected. If so, pick that as * the victim */ TAILQ_FOREACH_SAFE(so, &head->so_incomp, so_list, sonext) { inp = sotoinpcb(so); tp = intotcpcb(inp); if (tp != NULL && tp->t_state == TCPS_CLOSED && so->so_head != NULL && (so->so_state & (SS_INCOMP|SS_CANTSENDMORE|SS_CANTRCVMORE)) == (SS_INCOMP|SS_CANTSENDMORE|SS_CANTRCVMORE)) { /* * The listen socket is already locked but we * can lock this socket here without lock ordering * issues because it is in the incomp queue and * is not visible to others. */ if (lck_mtx_try_lock(&inp->inpcb_mtx)) { so->so_usecount++; goto found_victim; } else { continue; } } } so = TAILQ_FIRST(&head->so_incomp); now_sec = net_uptime(); if ((i = (now_sec - old_runtime)) != 0) { old_runtime = now_sec; old_cnt = cur_cnt / i; cur_cnt = 0; } qlen = head->so_incqlen; if (rnd == 0) rnd = RandomULong(); if (++cur_cnt > qlen || old_cnt > qlen) { rnd = (314159 * rnd + 66329) & 0xffff; j = ((qlen + 1) * rnd) >> 16; while (j-- && so) so = TAILQ_NEXT(so, so_list); } /* Find a connection that is not already closing (or being served) */ while (so) { inp = (struct inpcb *)so->so_pcb; sonext = TAILQ_NEXT(so, so_list); if (in_pcb_checkstate(inp, WNT_ACQUIRE, 0) != WNT_STOPUSING) { /* * Avoid the issue of a socket being accepted * by one input thread and being dropped by * another input thread. If we can't get a hold * on this mutex, then grab the next socket in * line. */ if (lck_mtx_try_lock(&inp->inpcb_mtx)) { so->so_usecount++; if ((so->so_usecount == 2) && (so->so_state & SS_INCOMP) && !(so->so_flags & SOF_INCOMP_INPROGRESS)) { break; } else { /* * don't use if being accepted or * used in any other way */ in_pcb_checkstate(inp, WNT_RELEASE, 1); tcp_unlock(so, 1, 0); } } else { /* * do not try to lock the inp in * in_pcb_checkstate because the lock * is already held in some other thread. * Only drop the inp_wntcnt reference. */ in_pcb_checkstate(inp, WNT_RELEASE, 1); } } so = sonext; } if (so == NULL) { return (0); } /* Makes sure socket is still in the right state to be discarded */ if (in_pcb_checkstate(inp, WNT_RELEASE, 1) == WNT_STOPUSING) { tcp_unlock(so, 1, 0); return (0); } found_victim: if (so->so_usecount != 2 || !(so->so_state & SS_INCOMP)) { /* do not discard: that socket is being accepted */ tcp_unlock(so, 1, 0); return (0); } TAILQ_REMOVE(&head->so_incomp, so, so_list); tcp_unlock(head, 0, 0); lck_mtx_assert(&inp->inpcb_mtx, LCK_MTX_ASSERT_OWNED); tp = sototcpcb(so); so->so_flags |= SOF_OVERFLOW; so->so_head = NULL; tcp_close(tp); if (inp->inp_wantcnt > 0 && inp->inp_wantcnt != WNT_STOPUSING) { /* * Some one has a wantcnt on this pcb. Since WNT_ACQUIRE * doesn't require a lock, it could have happened while * we are holding the lock. This pcb will have to * be garbage collected later. * Release the reference held for so_incomp queue */ so->so_usecount--; tcp_unlock(so, 1, 0); } else { /* * Unlock this socket and leave the reference on. * We need to acquire the pcbinfo lock in order to * fully dispose it off */ tcp_unlock(so, 0, 0); lck_rw_lock_exclusive(tcbinfo.ipi_lock); tcp_lock(so, 0, 0); /* Release the reference held for so_incomp queue */ so->so_usecount--; if (so->so_usecount != 1 || (inp->inp_wantcnt > 0 && inp->inp_wantcnt != WNT_STOPUSING)) { /* * There is an extra wantcount or usecount * that must have been added when the socket * was unlocked. This socket will have to be * garbage collected later */ tcp_unlock(so, 1, 0); } else { /* Drop the reference held for this function */ so->so_usecount--; in_pcbdispose(inp); } lck_rw_done(tcbinfo.ipi_lock); } tcpstat.tcps_drops++; tcp_lock(head, 0, 0); head->so_incqlen--; head->so_qlen--; return(1); } /* Set background congestion control on a socket */ void tcp_set_background_cc(struct socket *so) { tcp_set_new_cc(so, TCP_CC_ALGO_BACKGROUND_INDEX); } /* Set foreground congestion control on a socket */ void tcp_set_foreground_cc(struct socket *so) { if (tcp_use_newreno) tcp_set_new_cc(so, TCP_CC_ALGO_NEWRENO_INDEX); else tcp_set_new_cc(so, TCP_CC_ALGO_CUBIC_INDEX); } static void tcp_set_new_cc(struct socket *so, uint16_t cc_index) { struct inpcb *inp = sotoinpcb(so); struct tcpcb *tp = intotcpcb(inp); u_char old_cc_index = 0; if (tp->tcp_cc_index != cc_index) { old_cc_index = tp->tcp_cc_index; if (CC_ALGO(tp)->cleanup != NULL) CC_ALGO(tp)->cleanup(tp); tp->tcp_cc_index = cc_index; tcp_cc_allocate_state(tp); if (CC_ALGO(tp)->switch_to != NULL) CC_ALGO(tp)->switch_to(tp, old_cc_index); tcp_ccdbg_trace(tp, NULL, TCP_CC_CHANGE_ALGO); } } void tcp_set_recv_bg(struct socket *so) { if (!IS_TCP_RECV_BG(so)) so->so_flags1 |= SOF1_TRAFFIC_MGT_TCP_RECVBG; /* Unset Large Receive Offload on background sockets */ so_set_lro(so, SO_TC_BK); } void tcp_clear_recv_bg(struct socket *so) { if (IS_TCP_RECV_BG(so)) so->so_flags1 &= ~(SOF1_TRAFFIC_MGT_TCP_RECVBG); /* * Set/unset use of Large Receive Offload depending on * the traffic class */ so_set_lro(so, so->so_traffic_class); } void inp_fc_unthrottle_tcp(struct inpcb *inp) { struct tcpcb *tp = inp->inp_ppcb; /* * Back off the slow-start threshold and enter * congestion avoidance phase */ if (CC_ALGO(tp)->pre_fr != NULL) CC_ALGO(tp)->pre_fr(tp); tp->snd_cwnd = tp->snd_ssthresh; tp->t_flagsext &= ~TF_CWND_NONVALIDATED; /* * Restart counting for ABC as we changed the * congestion window just now. */ tp->t_bytes_acked = 0; /* Reset retransmit shift as we know that the reason * for delay in sending a packet is due to flow * control on the outgoing interface. There is no need * to backoff retransmit timer. */ TCP_RESET_REXMT_STATE(tp); /* * Start the output stream again. Since we are * not retransmitting data, do not reset the * retransmit timer or rtt calculation. */ tcp_output(tp); } static int tcp_getstat SYSCTL_HANDLER_ARGS { #pragma unused(oidp, arg1, arg2) int error; proc_t caller = PROC_NULL; proc_t caller_parent = PROC_NULL; char command_name[MAXCOMLEN + 1] = ""; char parent_name[MAXCOMLEN + 1] = ""; if ((caller = proc_self()) != PROC_NULL) { /* get process name */ strlcpy(command_name, caller->p_comm, sizeof(command_name)); /* get parent process name if possible */ if ((caller_parent = proc_find(caller->p_ppid)) != PROC_NULL) { strlcpy(parent_name, caller_parent->p_comm, sizeof(parent_name)); proc_rele(caller_parent); } if ((escape_str(command_name, strlen(command_name), sizeof(command_name)) == 0) && (escape_str(parent_name, strlen(parent_name), sizeof(parent_name)) == 0)) { kern_asl_msg(LOG_DEBUG, "messagetracer", 5, "com.apple.message.domain", "com.apple.kernel.tcpstat", /* 1 */ "com.apple.message.signature", "tcpstat", /* 2 */ "com.apple.message.signature2", command_name, /* 3 */ "com.apple.message.signature3", parent_name, /* 4 */ "com.apple.message.summarize", "YES", /* 5 */ NULL); } } if (caller != PROC_NULL) proc_rele(caller); if (req->oldptr == 0) { req->oldlen= (size_t)sizeof(struct tcpstat); } error = SYSCTL_OUT(req, &tcpstat, MIN(sizeof (tcpstat), req->oldlen)); return (error); } /* * Checksum extended TCP header and data. */ int tcp_input_checksum(int af, struct mbuf *m, struct tcphdr *th, int off, int tlen) { struct ifnet *ifp = m->m_pkthdr.rcvif; switch (af) { case AF_INET: { struct ip *ip = mtod(m, struct ip *); struct ipovly *ipov = (struct ipovly *)ip; if (m->m_pkthdr.pkt_flags & PKTF_SW_LRO_DID_CSUM) return (0); if ((hwcksum_rx || (ifp->if_flags & IFF_LOOPBACK) || (m->m_pkthdr.pkt_flags & PKTF_LOOP)) && (m->m_pkthdr.csum_flags & CSUM_DATA_VALID)) { if (m->m_pkthdr.csum_flags & CSUM_PSEUDO_HDR) { th->th_sum = m->m_pkthdr.csum_rx_val; } else { uint16_t sum = m->m_pkthdr.csum_rx_val; uint16_t start = m->m_pkthdr.csum_rx_start; /* * Perform 1's complement adjustment of octets * that got included/excluded in the hardware- * calculated checksum value. Ignore cases * where the value includes or excludes the IP * header span, as the sum for those octets * would already be 0xffff and thus no-op. */ if ((m->m_pkthdr.csum_flags & CSUM_PARTIAL) && start != 0 && (off - start) != off) { #if BYTE_ORDER != BIG_ENDIAN if (start < off) { HTONS(ip->ip_len); HTONS(ip->ip_off); } #endif /* callee folds in sum */ sum = m_adj_sum16(m, start, off, sum); #if BYTE_ORDER != BIG_ENDIAN if (start < off) { NTOHS(ip->ip_off); NTOHS(ip->ip_len); } #endif } /* callee folds in sum */ th->th_sum = in_pseudo(ip->ip_src.s_addr, ip->ip_dst.s_addr, sum + htonl(tlen + IPPROTO_TCP)); } th->th_sum ^= 0xffff; } else { uint16_t ip_sum; int len; char b[9]; bcopy(ipov->ih_x1, b, sizeof (ipov->ih_x1)); bzero(ipov->ih_x1, sizeof (ipov->ih_x1)); ip_sum = ipov->ih_len; ipov->ih_len = (u_short)tlen; #if BYTE_ORDER != BIG_ENDIAN HTONS(ipov->ih_len); #endif len = sizeof (struct ip) + tlen; th->th_sum = in_cksum(m, len); bcopy(b, ipov->ih_x1, sizeof (ipov->ih_x1)); ipov->ih_len = ip_sum; tcp_in_cksum_stats(len); } break; } #if INET6 case AF_INET6: { struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *); if (m->m_pkthdr.pkt_flags & PKTF_SW_LRO_DID_CSUM) return (0); if ((hwcksum_rx || (ifp->if_flags & IFF_LOOPBACK) || (m->m_pkthdr.pkt_flags & PKTF_LOOP)) && (m->m_pkthdr.csum_flags & CSUM_DATA_VALID)) { if (m->m_pkthdr.csum_flags & CSUM_PSEUDO_HDR) { th->th_sum = m->m_pkthdr.csum_rx_val; } else { uint16_t sum = m->m_pkthdr.csum_rx_val; uint16_t start = m->m_pkthdr.csum_rx_start; /* * Perform 1's complement adjustment of octets * that got included/excluded in the hardware- * calculated checksum value. */ if ((m->m_pkthdr.csum_flags & CSUM_PARTIAL) && start != off) { uint16_t s, d; if (IN6_IS_SCOPE_EMBED(&ip6->ip6_src)) { s = ip6->ip6_src.s6_addr16[1]; ip6->ip6_src.s6_addr16[1] = 0 ; } if (IN6_IS_SCOPE_EMBED(&ip6->ip6_dst)) { d = ip6->ip6_dst.s6_addr16[1]; ip6->ip6_dst.s6_addr16[1] = 0; } /* callee folds in sum */ sum = m_adj_sum16(m, start, off, sum); if (IN6_IS_SCOPE_EMBED(&ip6->ip6_src)) ip6->ip6_src.s6_addr16[1] = s; if (IN6_IS_SCOPE_EMBED(&ip6->ip6_dst)) ip6->ip6_dst.s6_addr16[1] = d; } th->th_sum = in6_pseudo( &ip6->ip6_src, &ip6->ip6_dst, sum + htonl(tlen + IPPROTO_TCP)); } th->th_sum ^= 0xffff; } else { tcp_in6_cksum_stats(tlen); th->th_sum = in6_cksum(m, IPPROTO_TCP, off, tlen); } break; } #endif /* INET6 */ default: VERIFY(0); /* NOTREACHED */ } if (th->th_sum != 0) { tcpstat.tcps_rcvbadsum++; IF_TCP_STATINC(ifp, badformat); return (-1); } return (0); } SYSCTL_PROC(_net_inet_tcp, TCPCTL_STATS, stats, CTLTYPE_STRUCT | CTLFLAG_RD | CTLFLAG_LOCKED, 0, 0, tcp_getstat, "S,tcpstat", "TCP statistics (struct tcpstat, netinet/tcp_var.h)"); static int sysctl_rexmtthresh SYSCTL_HANDLER_ARGS { #pragma unused(arg1, arg2) int error, val = tcprexmtthresh; error = sysctl_handle_int(oidp, &val, 0, req); if (error || !req->newptr) return (error); /* * Constrain the number of duplicate ACKs * to consider for TCP fast retransmit * to either 2 or 3 */ if (val < 2 || val > 3) return (EINVAL); tcprexmtthresh = val; return (0); } SYSCTL_PROC(_net_inet_tcp, OID_AUTO, rexmt_thresh, CTLTYPE_INT | CTLFLAG_RW | CTLFLAG_LOCKED, &tcprexmtthresh, 0, &sysctl_rexmtthresh, "I", "Duplicate ACK Threshold for Fast Retransmit"); |