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
/* * Copyright (c) 2015-2025 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@ */ /* TCP-cache to store and retrieve TCP-related information */ #include <net/flowhash.h> #include <net/route.h> #include <net/necp.h> #include <netinet/in_pcb.h> #include <netinet/mptcp.h> #include <netinet/mptcp_var.h> #include <netinet/tcp_cache.h> #include <netinet/tcp_seq.h> #include <netinet/tcp_var.h> #include <kern/locks.h> #include <sys/queue.h> #include <dev/random/randomdev.h> #include <net/sockaddr_utils.h> #include <IOKit/IOBSD.h> struct tcp_heuristic { SLIST_ENTRY(tcp_heuristic) list; uint32_t th_last_access; struct tcp_heuristic_key th_key; #define th_val_start th_tfo_data_loss uint8_t th_tfo_data_loss; /* The number of times a SYN+data has been lost */ uint8_t th_tfo_req_loss; /* The number of times a SYN+cookie-req has been lost */ uint8_t th_tfo_data_rst; /* The number of times a SYN+data has received a RST */ uint8_t th_tfo_req_rst; /* The number of times a SYN+cookie-req has received a RST */ uint8_t th_mptcp_loss; /* The number of times a SYN+MP_CAPABLE has been lost */ uint8_t th_mptcp_success; /* The number of times MPTCP-negotiation has been successful */ uint8_t th_ecn_loss; /* The number of times a SYN+ecn was likely dropped */ uint8_t th_ecn_aggressive; /* The number of times we did an aggressive fallback */ uint8_t th_ecn_droprst; /* The number of times ECN connections received a RST after first data pkt */ uint8_t th_ecn_synrst; /* number of times RST was received in response to an ECN enabled SYN */ uint32_t th_tfo_enabled_time; /* The moment when we reenabled TFO after backing off */ uint32_t th_tfo_backoff_until; /* Time until when we should not try out TFO */ uint32_t th_tfo_backoff; /* Current backoff timer */ uint32_t th_mptcp_backoff; /* Time until when we should not try out MPTCP */ uint32_t th_ecn_backoff; /* Time until when we should not try out ECN */ uint8_t th_tfo_in_backoff:1, /* Are we avoiding TFO due to the backoff timer? */ th_mptcp_in_backoff:1, /* Are we avoiding MPTCP due to the backoff timer? */ th_mptcp_heuristic_disabled:1; /* Are heuristics disabled? */ // N.B.: we may sometimes erase ALL values from th_val_start to the end of the structure. }; struct tcp_heuristics_head { SLIST_HEAD(tcp_heur_bucket, tcp_heuristic) tcp_heuristics; /* Per-hashbucket lock to avoid lock-contention */ lck_mtx_t thh_mtx; }; struct tcp_cache { SLIST_ENTRY(tcp_cache) list; uint32_t tc_last_access; struct tcp_cache_key tc_key; uint8_t tc_tfo_cookie[TFO_COOKIE_LEN_MAX]; uint8_t tc_tfo_cookie_len; uint8_t tc_mptcp_version_confirmed:1; uint8_t tc_mptcp_version; /* version to use right now */ uint32_t tc_mptcp_next_version_try; /* Time, until we try preferred version again */ }; struct tcp_cache_head { SLIST_HEAD(tcp_cache_bucket, tcp_cache) tcp_caches; /* Per-hashbucket lock to avoid lock-contention */ lck_mtx_t tch_mtx; }; struct tcp_cache_key_src { struct ifnet *ifp; in_4_6_addr laddr; in_4_6_addr faddr; int af; }; static uint32_t tcp_cache_hash_seed; static size_t tcp_cache_size; static size_t tcp_heuristics_size; /* * The maximum depth of the hash-bucket. This way we limit the tcp_cache to * TCP_CACHE_BUCKET_SIZE * tcp_cache_size and have "natural" garbage collection */ #define TCP_CACHE_BUCKET_SIZE 5 static struct tcp_cache_head *__counted_by(tcp_cache_size) tcp_cache; static LCK_ATTR_DECLARE(tcp_cache_mtx_attr, 0, 0); static LCK_GRP_DECLARE(tcp_cache_mtx_grp, "tcpcache"); static struct tcp_heuristics_head *__counted_by(tcp_heuristics_size) tcp_heuristics; static LCK_ATTR_DECLARE(tcp_heuristic_mtx_attr, 0, 0); static LCK_GRP_DECLARE(tcp_heuristic_mtx_grp, "tcpheuristic"); static uint32_t tcp_backoff_maximum = 65536; SYSCTL_UINT(_net_inet_tcp, OID_AUTO, backoff_maximum, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_backoff_maximum, 0, "Maximum time for which we won't try TFO"); static uint32_t tcp_ecn_timeout = 5; SYSCTL_UINT(_net_inet_tcp, OID_AUTO, ecn_timeout, CTLFLAG_RW | CTLFLAG_LOCKED, &tcp_ecn_timeout, 5, "Initial minutes to wait before re-trying ECN"); static int disable_tcp_heuristics = 0; SYSCTL_INT(_net_inet_tcp, OID_AUTO, disable_tcp_heuristics, CTLFLAG_RW | CTLFLAG_LOCKED, &disable_tcp_heuristics, 0, "Set to 1, to disable all TCP heuristics (TFO, ECN, MPTCP)"); static uint32_t mptcp_version_timeout = 24 * 60; SYSCTL_UINT(_net_inet_tcp, OID_AUTO, mptcp_version_timeout, CTLFLAG_RW | CTLFLAG_LOCKED, &mptcp_version_timeout, 24 * 60, "Initial minutes to wait before re-trying MPTCP's preferred version"); static uint32_t tcp_min_to_hz(uint32_t minutes) { if (minutes > 65536) { return (uint32_t)65536 * 60 * TCP_RETRANSHZ; } return minutes * 60 * TCP_RETRANSHZ; } /* * This number is coupled with tcp_ecn_timeout, because we want to prevent * integer overflow. Need to find an unexpensive way to prevent integer overflow * while still allowing a dynamic sysctl. */ #define TCP_CACHE_OVERFLOW_PROTECT 9 /* Number of SYN-losses we accept */ #define TFO_MAX_COOKIE_LOSS 2 #define MPTCP_MAX_SYN_LOSS 2 #define MPTCP_SUCCESS_TRIGGER 10 #define MPTCP_VERSION_MAX_FAIL 2 #define ECN_MAX_SYN_LOSS 5 #define ECN_MAX_DROPRST 1 #define ECN_MAX_SYNRST 4 #define ECN_MAX_CE_AGGRESSIVE 1 /* Flags for setting/unsetting loss-heuristics, limited to 4 bytes */ #define TCPCACHE_F_TFO_REQ 0x01 #define TCPCACHE_F_TFO_DATA 0x02 #define TCPCACHE_F_ECN 0x04 #define TCPCACHE_F_MPTCP 0x08 #define TCPCACHE_F_ECN_DROPRST 0x10 #define TCPCACHE_F_ECN_AGGRESSIVE 0x20 #define TCPCACHE_F_TFO_REQ_RST 0x40 #define TCPCACHE_F_TFO_DATA_RST 0x80 #define TCPCACHE_F_ECN_SYNRST 0x100 #define TCPCACHE_F_ECN_SYN_LOSS 0x200 /* Always retry ECN after backing off to this level for some heuristics */ #define ECN_RETRY_LIMIT 9 #define TCP_CACHE_INC_IFNET_STAT(_ifp_, _af_, _stat_) { \ if ((_ifp_) != NULL) { \ if ((_af_) == AF_INET6) { \ (_ifp_)->if_ipv6_stat->_stat_++;\ } else { \ (_ifp_)->if_ipv4_stat->_stat_++;\ }\ }\ } /* * Round up to next higher power-of 2. See "Bit Twiddling Hacks". * * Might be worth moving this to a library so that others * (e.g., scale_to_powerof2()) can use this as well instead of a while-loop. */ static uint32_t tcp_cache_roundup2(uint32_t a) { a--; a |= a >> 1; a |= a >> 2; a |= a >> 4; a |= a >> 8; a |= a >> 16; a++; return a; } static void tcp_cache_hash_src(struct tcp_cache_key_src *tcks, struct tcp_heuristic_key *key) { struct ifnet *ifp = tcks->ifp; uint8_t len = sizeof(key->thk_net_signature); uint16_t flags; if (tcks->af == AF_INET6) { int ret; key->thk_family = AF_INET6; ret = ifnet_get_netsignature(ifp, AF_INET6, &len, &flags, key->thk_net_signature); /* * ifnet_get_netsignature only returns EINVAL if ifn is NULL * (we made sure that in the other cases it does not). So, * in this case we should take the connection's address. */ if (ret == ENOENT || ret == EINVAL) { memcpy(&key->thk_ip.addr6, &tcks->laddr.addr6, sizeof(struct in6_addr)); } } else { int ret; key->thk_family = AF_INET; ret = ifnet_get_netsignature(ifp, AF_INET, &len, &flags, key->thk_net_signature); /* * ifnet_get_netsignature only returns EINVAL if ifn is NULL * (we made sure that in the other cases it does not). So, * in this case we should take the connection's address. */ if (ret == ENOENT || ret == EINVAL) { memcpy(&key->thk_ip.addr, &tcks->laddr.addr, sizeof(struct in_addr)); } } } static uint16_t tcp_cache_hash(struct tcp_cache_key_src *tcks, struct tcp_cache_key *key) { uint32_t hash; bzero(key, sizeof(struct tcp_cache_key)); tcp_cache_hash_src(tcks, &key->tck_src); if (tcks->af == AF_INET6) { key->tck_family = AF_INET6; memcpy(&key->tck_dst.addr6, &tcks->faddr.addr6, sizeof(struct in6_addr)); } else { key->tck_family = AF_INET; memcpy(&key->tck_dst.addr, &tcks->faddr.addr, sizeof(struct in_addr)); } hash = net_flowhash(key, sizeof(struct tcp_cache_key), tcp_cache_hash_seed); return (uint16_t)(hash & (tcp_cache_size - 1)); } static void tcp_cache_unlock(struct tcp_cache_head *head) { lck_mtx_unlock(&head->tch_mtx); } /* * Make sure that everything that happens after tcp_getcache_with_lock() * is short enough to justify that you hold the per-bucket lock!!! * * Otherwise, better build another lookup-function that does not hold the * lock and you copy out the bits and bytes. * * That's why we provide the head as a "return"-pointer so that the caller * can give it back to use for tcp_cache_unlock(). */ static struct tcp_cache * tcp_getcache_with_lock(struct tcp_cache_key_src *tcks, int create, struct tcp_cache_head **headarg) { struct tcp_cache *__single tpcache = NULL; struct tcp_cache_head *__single head; struct tcp_cache_key key; uint16_t hash; int i = 0; hash = tcp_cache_hash(tcks, &key); head = &tcp_cache[hash]; lck_mtx_lock(&head->tch_mtx); /*** First step: Look for the tcp_cache in our bucket ***/ SLIST_FOREACH(tpcache, &head->tcp_caches, list) { if (memcmp(&tpcache->tc_key, &key, sizeof(key)) == 0) { break; } i++; } /*** Second step: If it's not there, create/recycle it ***/ if ((tpcache == NULL) && create) { if (i >= TCP_CACHE_BUCKET_SIZE) { struct tcp_cache *oldest_cache = NULL; uint32_t max_age = 0; /* Look for the oldest tcp_cache in the bucket */ SLIST_FOREACH(tpcache, &head->tcp_caches, list) { uint32_t age = tcp_now - tpcache->tc_last_access; if (age >= max_age) { max_age = age; oldest_cache = tpcache; } } VERIFY(oldest_cache != NULL); tpcache = oldest_cache; /* We recycle, thus let's indicate that there is no cookie */ tpcache->tc_tfo_cookie_len = 0; } else { /* Create a new cache and add it to the list */ tpcache = kalloc_type(struct tcp_cache, Z_NOPAGEWAIT | Z_ZERO); if (tpcache == NULL) { os_log_error(OS_LOG_DEFAULT, "%s could not allocate cache", __func__); goto out_null; } tpcache->tc_mptcp_version = (uint8_t)mptcp_preferred_version; tpcache->tc_mptcp_next_version_try = tcp_now; SLIST_INSERT_HEAD(&head->tcp_caches, tpcache, list); } memcpy(&tpcache->tc_key, &key, sizeof(key)); } if (tpcache == NULL) { goto out_null; } /* Update timestamp for garbage collection purposes */ tpcache->tc_last_access = tcp_now; *headarg = head; return tpcache; out_null: tcp_cache_unlock(head); return NULL; } static void tcp_cache_key_src_create(struct tcpcb *tp, struct tcp_cache_key_src *tcks) { struct inpcb *inp = tp->t_inpcb; memset(tcks, 0, sizeof(*tcks)); tcks->ifp = inp->inp_last_outifp; if (inp->inp_vflag & INP_IPV6) { memcpy(&tcks->laddr.addr6, &inp->in6p_laddr, sizeof(struct in6_addr)); memcpy(&tcks->faddr.addr6, &inp->in6p_faddr, sizeof(struct in6_addr)); tcks->af = AF_INET6; } else { memcpy(&tcks->laddr.addr, &inp->inp_laddr, sizeof(struct in_addr)); memcpy(&tcks->faddr.addr, &inp->inp_faddr, sizeof(struct in_addr)); tcks->af = AF_INET; } return; } static void mptcp_version_cache_key_src_init(struct sockaddr *dst, struct tcp_cache_key_src *tcks) { memset(tcks, 0, sizeof(*tcks)); if (dst->sa_family == AF_INET) { memcpy(&tcks->faddr.addr, &SIN(dst)->sin_addr, sizeof(struct in_addr)); tcks->af = AF_INET; } else { memcpy(&tcks->faddr.addr6, &SIN6(dst)->sin6_addr, sizeof(struct in6_addr)); tcks->af = AF_INET6; } return; } static void tcp_cache_set_cookie_common(struct tcp_cache_key_src *tcks, u_char *__counted_by(len) cookie, uint8_t len) { struct tcp_cache_head *__single head; struct tcp_cache *__single tpcache; /* Call lookup/create function */ tpcache = tcp_getcache_with_lock(tcks, 1, &head); if (tpcache == NULL) { return; } tpcache->tc_tfo_cookie_len = len > TFO_COOKIE_LEN_MAX ? TFO_COOKIE_LEN_MAX : len; memcpy(tpcache->tc_tfo_cookie, cookie, tpcache->tc_tfo_cookie_len); tcp_cache_unlock(head); } void tcp_cache_set_cookie(struct tcpcb *tp, u_char *__counted_by(len) cookie, uint8_t len) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); tcp_cache_set_cookie_common(&tcks, cookie, len); } static int tcp_cache_get_cookie_common(struct tcp_cache_key_src *tcks, u_char *__counted_by(maxlen) cookie, uint8_t maxlen, uint8_t *len) { #pragma unused(maxlen) struct tcp_cache_head *__single head; struct tcp_cache *__single tpcache; /* Call lookup/create function */ tpcache = tcp_getcache_with_lock(tcks, 1, &head); if (tpcache == NULL) { return 0; } if (tpcache->tc_tfo_cookie_len == 0) { tcp_cache_unlock(head); return 0; } /* * Not enough space - this should never happen as it has been checked * in tcp_tfo_check. So, fail here! */ VERIFY(tpcache->tc_tfo_cookie_len <= *len); memcpy(cookie, tpcache->tc_tfo_cookie, tpcache->tc_tfo_cookie_len); *len = tpcache->tc_tfo_cookie_len; tcp_cache_unlock(head); return 1; } /* * Get the cookie related to 'tp', and copy it into 'cookie', provided that len * is big enough (len designates the available memory. * Upon return, 'len' is set to the cookie's length. * * Returns 0 if we should request a cookie. * Returns 1 if the cookie has been found and written. */ int tcp_cache_get_cookie(struct tcpcb *tp, u_char *__counted_by(maxlen) cookie, uint8_t maxlen, uint8_t *len) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); return tcp_cache_get_cookie_common(&tcks, cookie, maxlen, len); } static unsigned int tcp_cache_get_cookie_len_common(struct tcp_cache_key_src *tcks) { struct tcp_cache_head *__single head; struct tcp_cache *__single tpcache; unsigned int cookie_len; /* Call lookup/create function */ tpcache = tcp_getcache_with_lock(tcks, 1, &head); if (tpcache == NULL) { return 0; } cookie_len = tpcache->tc_tfo_cookie_len; tcp_cache_unlock(head); return cookie_len; } unsigned int tcp_cache_get_cookie_len(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); return tcp_cache_get_cookie_len_common(&tcks); } /* * @return: * 0 MPTCP_VERSION_0 * 1 MPTCP_VERSION_1 */ uint8_t tcp_cache_get_mptcp_version(struct sockaddr *dst) { struct tcp_cache_key_src tcks; mptcp_version_cache_key_src_init(dst, &tcks); uint8_t version = (uint8_t) mptcp_preferred_version; struct tcp_cache_head *__single head; struct tcp_cache *__single tpcache; /* Call lookup/create function */ tpcache = tcp_getcache_with_lock(&tcks, 1, &head); if (tpcache == NULL) { return version; } version = tpcache->tc_mptcp_version; /* Let's see if we should try the preferred version again */ if (!tpcache->tc_mptcp_version_confirmed && version != mptcp_preferred_version && TSTMP_GEQ(tcp_now, tpcache->tc_mptcp_next_version_try)) { version = (uint8_t) mptcp_preferred_version; } tcp_cache_unlock(head); return version; } void tcp_cache_update_mptcp_version(struct tcpcb *tp, boolean_t succeeded) { uint8_t version = tptomptp(tp)->mpt_version; struct inpcb *inp = tp->t_inpcb; struct tcp_cache_key_src tcks; struct tcp_cache_head *__single head; struct tcp_cache *__single tpcache; if (inp->inp_vflag & INP_IPV6) { struct sockaddr_in6 dst = { .sin6_len = sizeof(struct sockaddr_in6), .sin6_family = AF_INET6, .sin6_addr = inp->in6p_faddr, }; mptcp_version_cache_key_src_init(SA(&dst), &tcks); } else { struct sockaddr_in dst = { .sin_len = sizeof(struct sockaddr_in), .sin_family = AF_INET, .sin_addr = inp->inp_faddr, }; mptcp_version_cache_key_src_init(SA(&dst), &tcks); } /* Call lookup/create function */ tpcache = tcp_getcache_with_lock(&tcks, 1, &head); if (tpcache == NULL) { return; } /* We are still in probing phase */ if (tpcache->tc_mptcp_version_confirmed) { goto exit; } if (succeeded) { if (version == (uint8_t)mptcp_preferred_version) { /* Preferred version succeeded - make it sticky */ tpcache->tc_mptcp_version_confirmed = true; tpcache->tc_mptcp_version = version; } else { /* If we are past the next version try, set it * so that we try preferred again in 24h */ if (TSTMP_GEQ(tcp_now, tpcache->tc_mptcp_next_version_try)) { tpcache->tc_mptcp_next_version_try = tcp_now + tcp_min_to_hz(mptcp_version_timeout); } } } else { if (version == (uint8_t)mptcp_preferred_version) { /* Preferred version failed - try the other version */ tpcache->tc_mptcp_version = version == MPTCP_VERSION_0 ? MPTCP_VERSION_1 : MPTCP_VERSION_0; } /* Preferred version failed - make sure we give the preferred another * shot in 24h. */ if (TSTMP_GEQ(tcp_now, tpcache->tc_mptcp_next_version_try)) { tpcache->tc_mptcp_next_version_try = tcp_now + tcp_min_to_hz(mptcp_version_timeout); } } exit: tcp_cache_unlock(head); } static uint16_t tcp_heuristics_hash(struct tcp_cache_key_src *tcks, struct tcp_heuristic_key *key) { uint32_t hash; bzero(key, sizeof(struct tcp_heuristic_key)); tcp_cache_hash_src(tcks, key); hash = net_flowhash(key, sizeof(struct tcp_heuristic_key), tcp_cache_hash_seed); return (uint16_t)(hash & (tcp_cache_size - 1)); } static void tcp_heuristic_unlock(struct tcp_heuristics_head *head) { lck_mtx_unlock(&head->thh_mtx); } /* * Make sure that everything that happens after tcp_getheuristic_with_lock() * is short enough to justify that you hold the per-bucket lock!!! * * Otherwise, better build another lookup-function that does not hold the * lock and you copy out the bits and bytes. * * That's why we provide the head as a "return"-pointer so that the caller * can give it back to use for tcp_heur_unlock(). * * * ToDo - way too much code-duplication. We should create an interface to handle * bucketized hashtables with recycling of the oldest element. */ static struct tcp_heuristic * tcp_getheuristic_with_lock(struct tcp_cache_key_src *tcks, int create, struct tcp_heuristics_head **headarg) { struct tcp_heuristic *__single tpheur = NULL; struct tcp_heuristics_head *__single head; struct tcp_heuristic_key key; uint16_t hash; int i = 0; hash = tcp_heuristics_hash(tcks, &key); head = &tcp_heuristics[hash]; lck_mtx_lock(&head->thh_mtx); /*** First step: Look for the tcp_heur in our bucket ***/ SLIST_FOREACH(tpheur, &head->tcp_heuristics, list) { if (memcmp(&tpheur->th_key, &key, sizeof(key)) == 0) { break; } i++; } /*** Second step: If it's not there, create/recycle it ***/ if ((tpheur == NULL) && create) { if (i >= TCP_CACHE_BUCKET_SIZE) { struct tcp_heuristic *__single oldest_heur = NULL; uint32_t max_age = 0; /* Look for the oldest tcp_heur in the bucket */ SLIST_FOREACH(tpheur, &head->tcp_heuristics, list) { uint32_t age = tcp_now - tpheur->th_last_access; if (age >= max_age) { max_age = age; oldest_heur = tpheur; } } VERIFY(oldest_heur != NULL); tpheur = oldest_heur; /* We recycle - set everything to 0 */ uint8_t *ptr = (uint8_t *)(struct tcp_heuristic *__indexable)tpheur; const size_t preamble = offsetof(struct tcp_heuristic, th_val_start); const size_t size = sizeof(struct tcp_heuristic) - preamble; bzero(ptr + preamble, size); } else { /* Create a new heuristic and add it to the list */ tpheur = kalloc_type(struct tcp_heuristic, Z_NOPAGEWAIT | Z_ZERO); if (tpheur == NULL) { os_log_error(OS_LOG_DEFAULT, "%s could not allocate heuristic", __func__); goto out_null; } SLIST_INSERT_HEAD(&head->tcp_heuristics, tpheur, list); } /* * Set to tcp_now, to make sure it won't be > than tcp_now in the * near future. */ tpheur->th_ecn_backoff = tcp_now; tpheur->th_tfo_backoff_until = tcp_now; tpheur->th_mptcp_backoff = tcp_now; tpheur->th_tfo_backoff = tcp_min_to_hz(tcp_ecn_timeout); memcpy(&tpheur->th_key, &key, sizeof(key)); } if (tpheur == NULL) { goto out_null; } /* Update timestamp for garbage collection purposes */ tpheur->th_last_access = tcp_now; *headarg = head; return tpheur; out_null: tcp_heuristic_unlock(head); return NULL; } static void tcp_heuristic_reset_counters(struct tcp_cache_key_src *tcks, uint8_t flags) { struct tcp_heuristics_head *__single head; struct tcp_heuristic *__single tpheur; /* * Always create heuristics here because MPTCP needs to write success * into it. Thus, we always end up creating them. */ tpheur = tcp_getheuristic_with_lock(tcks, 1, &head); if (tpheur == NULL) { return; } if (flags & TCPCACHE_F_TFO_DATA) { if (tpheur->th_tfo_data_loss >= TFO_MAX_COOKIE_LOSS) { os_log(OS_LOG_DEFAULT, "%s: Resetting TFO-data loss to 0 from %u on heur %lx\n", __func__, tpheur->th_tfo_data_loss, (unsigned long)VM_KERNEL_ADDRPERM(tpheur)); } tpheur->th_tfo_data_loss = 0; } if (flags & TCPCACHE_F_TFO_REQ) { if (tpheur->th_tfo_req_loss >= TFO_MAX_COOKIE_LOSS) { os_log(OS_LOG_DEFAULT, "%s: Resetting TFO-req loss to 0 from %u on heur %lx\n", __func__, tpheur->th_tfo_req_loss, (unsigned long)VM_KERNEL_ADDRPERM(tpheur)); } tpheur->th_tfo_req_loss = 0; } if (flags & TCPCACHE_F_TFO_DATA_RST) { if (tpheur->th_tfo_data_rst >= TFO_MAX_COOKIE_LOSS) { os_log(OS_LOG_DEFAULT, "%s: Resetting TFO-data RST to 0 from %u on heur %lx\n", __func__, tpheur->th_tfo_data_rst, (unsigned long)VM_KERNEL_ADDRPERM(tpheur)); } tpheur->th_tfo_data_rst = 0; } if (flags & TCPCACHE_F_TFO_REQ_RST) { if (tpheur->th_tfo_req_rst >= TFO_MAX_COOKIE_LOSS) { os_log(OS_LOG_DEFAULT, "%s: Resetting TFO-req RST to 0 from %u on heur %lx\n", __func__, tpheur->th_tfo_req_rst, (unsigned long)VM_KERNEL_ADDRPERM(tpheur)); } tpheur->th_tfo_req_rst = 0; } if (flags & TCPCACHE_F_ECN) { tpheur->th_ecn_loss = 0; tpheur->th_ecn_aggressive = 0; tpheur->th_ecn_synrst = 0; tpheur->th_ecn_droprst = 0; } if (flags & TCPCACHE_F_MPTCP) { tpheur->th_mptcp_loss = 0; if (tpheur->th_mptcp_success < MPTCP_SUCCESS_TRIGGER) { tpheur->th_mptcp_success++; if (tpheur->th_mptcp_success == MPTCP_SUCCESS_TRIGGER) { os_log(mptcp_log_handle, "%s disabling heuristics for 12 hours", __func__); tpheur->th_mptcp_heuristic_disabled = 1; /* Disable heuristics for 12 hours */ tpheur->th_mptcp_backoff = tcp_now + tcp_min_to_hz(tcp_ecn_timeout * 12); } } } tcp_heuristic_unlock(head); } void tcp_heuristic_tfo_success(struct tcpcb *tp) { struct tcp_cache_key_src tcks; uint8_t flag = 0; tcp_cache_key_src_create(tp, &tcks); if (tp->t_tfo_stats & TFO_S_SYN_DATA_SENT) { flag = (TCPCACHE_F_TFO_DATA | TCPCACHE_F_TFO_REQ | TCPCACHE_F_TFO_DATA_RST | TCPCACHE_F_TFO_REQ_RST); } if (tp->t_tfo_stats & TFO_S_COOKIE_REQ) { flag = (TCPCACHE_F_TFO_REQ | TCPCACHE_F_TFO_REQ_RST); } tcp_heuristic_reset_counters(&tcks, flag); } void tcp_heuristic_mptcp_success(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_reset_counters(&tcks, TCPCACHE_F_MPTCP); } void tcp_heuristic_ecn_success(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_reset_counters(&tcks, TCPCACHE_F_ECN); } static void __tcp_heuristic_tfo_middlebox_common(struct tcp_heuristic *tpheur) { if (tpheur->th_tfo_in_backoff) { return; } tpheur->th_tfo_in_backoff = 1; if (tpheur->th_tfo_enabled_time) { uint32_t old_backoff = tpheur->th_tfo_backoff; tpheur->th_tfo_backoff -= (tcp_now - tpheur->th_tfo_enabled_time); if (tpheur->th_tfo_backoff > old_backoff) { tpheur->th_tfo_backoff = tcp_min_to_hz(tcp_ecn_timeout); } } tpheur->th_tfo_backoff_until = tcp_now + tpheur->th_tfo_backoff; /* Then, increase the backoff time */ tpheur->th_tfo_backoff *= 2; if (tpheur->th_tfo_backoff > tcp_min_to_hz(tcp_backoff_maximum)) { tpheur->th_tfo_backoff = tcp_min_to_hz(tcp_ecn_timeout); } os_log(OS_LOG_DEFAULT, "%s disable TFO until %u now %u on %lx\n", __func__, tpheur->th_tfo_backoff_until, tcp_now, (unsigned long)VM_KERNEL_ADDRPERM(tpheur)); } static void tcp_heuristic_tfo_middlebox_common(struct tcp_cache_key_src *tcks) { struct tcp_heuristics_head *__single head; struct tcp_heuristic *__single tpheur; tpheur = tcp_getheuristic_with_lock(tcks, 1, &head); if (tpheur == NULL) { return; } __tcp_heuristic_tfo_middlebox_common(tpheur); tcp_heuristic_unlock(head); } static void tcp_heuristic_inc_counters(struct tcp_cache_key_src *tcks, uint32_t flags) { struct tcp_heuristics_head *__single head; struct tcp_heuristic *__single tpheur; tpheur = tcp_getheuristic_with_lock(tcks, 1, &head); if (tpheur == NULL) { return; } /* Limit to prevent integer-overflow during exponential backoff */ if ((flags & TCPCACHE_F_TFO_DATA) && tpheur->th_tfo_data_loss < TCP_CACHE_OVERFLOW_PROTECT) { tpheur->th_tfo_data_loss++; if (tpheur->th_tfo_data_loss >= TFO_MAX_COOKIE_LOSS) { __tcp_heuristic_tfo_middlebox_common(tpheur); } } if ((flags & TCPCACHE_F_TFO_REQ) && tpheur->th_tfo_req_loss < TCP_CACHE_OVERFLOW_PROTECT) { tpheur->th_tfo_req_loss++; if (tpheur->th_tfo_req_loss >= TFO_MAX_COOKIE_LOSS) { __tcp_heuristic_tfo_middlebox_common(tpheur); } } if ((flags & TCPCACHE_F_TFO_DATA_RST) && tpheur->th_tfo_data_rst < TCP_CACHE_OVERFLOW_PROTECT) { tpheur->th_tfo_data_rst++; if (tpheur->th_tfo_data_rst >= TFO_MAX_COOKIE_LOSS) { __tcp_heuristic_tfo_middlebox_common(tpheur); } } if ((flags & TCPCACHE_F_TFO_REQ_RST) && tpheur->th_tfo_req_rst < TCP_CACHE_OVERFLOW_PROTECT) { tpheur->th_tfo_req_rst++; if (tpheur->th_tfo_req_rst >= TFO_MAX_COOKIE_LOSS) { __tcp_heuristic_tfo_middlebox_common(tpheur); } } if ((flags & TCPCACHE_F_MPTCP) && tpheur->th_mptcp_loss < TCP_CACHE_OVERFLOW_PROTECT && tpheur->th_mptcp_heuristic_disabled == 0) { tpheur->th_mptcp_loss++; if (tpheur->th_mptcp_loss >= MPTCP_MAX_SYN_LOSS) { /* * Yes, we take tcp_ecn_timeout, to avoid adding yet * another sysctl that is just used for testing. */ tpheur->th_mptcp_backoff = tcp_now + (tcp_min_to_hz(tcp_ecn_timeout) << (tpheur->th_mptcp_loss - MPTCP_MAX_SYN_LOSS)); tpheur->th_mptcp_in_backoff = 1; os_log(OS_LOG_DEFAULT, "%s disable MPTCP until %u now %u on %lx\n", __func__, tpheur->th_mptcp_backoff, tcp_now, (unsigned long)VM_KERNEL_ADDRPERM(tpheur)); } } if ((flags & TCPCACHE_F_ECN_SYN_LOSS) && tpheur->th_ecn_loss < TCP_CACHE_OVERFLOW_PROTECT && TSTMP_LEQ(tpheur->th_ecn_backoff, tcp_now)) { tpheur->th_ecn_loss++; if (tpheur->th_ecn_loss >= ECN_MAX_SYN_LOSS) { tcpstat.tcps_ecn_fallback_synloss++; TCP_CACHE_INC_IFNET_STAT(tcks->ifp, tcks->af, ecn_fallback_synloss); tpheur->th_ecn_backoff = tcp_now + (tcp_min_to_hz(tcp_ecn_timeout) << (tpheur->th_ecn_loss - ECN_MAX_SYN_LOSS)); } } if ((flags & TCPCACHE_F_ECN_AGGRESSIVE) && tpheur->th_ecn_aggressive < TCP_CACHE_OVERFLOW_PROTECT && TSTMP_LEQ(tpheur->th_ecn_backoff, tcp_now)) { tpheur->th_ecn_aggressive++; if (tpheur->th_ecn_aggressive >= ECN_MAX_CE_AGGRESSIVE) { tcpstat.tcps_ecn_fallback_ce++; TCP_CACHE_INC_IFNET_STAT(tcks->ifp, tcks->af, ecn_fallback_ce); tpheur->th_ecn_backoff = tcp_now + (tcp_min_to_hz(tcp_ecn_timeout) << (tpheur->th_ecn_aggressive - ECN_MAX_CE_AGGRESSIVE)); } } if ((flags & TCPCACHE_F_ECN_DROPRST) && tpheur->th_ecn_droprst < TCP_CACHE_OVERFLOW_PROTECT && TSTMP_LEQ(tpheur->th_ecn_backoff, tcp_now)) { tpheur->th_ecn_droprst++; if (tpheur->th_ecn_droprst >= ECN_MAX_DROPRST) { tcpstat.tcps_ecn_fallback_droprst++; TCP_CACHE_INC_IFNET_STAT(tcks->ifp, tcks->af, ecn_fallback_droprst); tpheur->th_ecn_backoff = tcp_now + (tcp_min_to_hz(tcp_ecn_timeout) << (tpheur->th_ecn_droprst - ECN_MAX_DROPRST)); } } if ((flags & TCPCACHE_F_ECN_SYNRST) && tpheur->th_ecn_synrst < TCP_CACHE_OVERFLOW_PROTECT) { tpheur->th_ecn_synrst++; if (tpheur->th_ecn_synrst >= ECN_MAX_SYNRST) { tcpstat.tcps_ecn_fallback_synrst++; TCP_CACHE_INC_IFNET_STAT(tcks->ifp, tcks->af, ecn_fallback_synrst); tpheur->th_ecn_backoff = tcp_now + (tcp_min_to_hz(tcp_ecn_timeout) << (tpheur->th_ecn_synrst - ECN_MAX_SYNRST)); } } tcp_heuristic_unlock(head); } void tcp_heuristic_tfo_loss(struct tcpcb *tp) { struct tcp_cache_key_src tcks; uint32_t flag = 0; if (symptoms_is_wifi_lossy() && IFNET_IS_WIFI(tp->t_inpcb->inp_last_outifp)) { return; } tcp_cache_key_src_create(tp, &tcks); if (tp->t_tfo_stats & TFO_S_SYN_DATA_SENT) { flag = (TCPCACHE_F_TFO_DATA | TCPCACHE_F_TFO_REQ); } if (tp->t_tfo_stats & TFO_S_COOKIE_REQ) { flag = TCPCACHE_F_TFO_REQ; } tcp_heuristic_inc_counters(&tcks, flag); } void tcp_heuristic_tfo_rst(struct tcpcb *tp) { struct tcp_cache_key_src tcks; uint32_t flag = 0; tcp_cache_key_src_create(tp, &tcks); if (tp->t_tfo_stats & TFO_S_SYN_DATA_SENT) { flag = (TCPCACHE_F_TFO_DATA_RST | TCPCACHE_F_TFO_REQ_RST); } if (tp->t_tfo_stats & TFO_S_COOKIE_REQ) { flag = TCPCACHE_F_TFO_REQ_RST; } tcp_heuristic_inc_counters(&tcks, flag); } void tcp_heuristic_mptcp_loss(struct tcpcb *tp) { struct tcp_cache_key_src tcks; if (symptoms_is_wifi_lossy() && IFNET_IS_WIFI(tp->t_inpcb->inp_last_outifp)) { return; } tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_MPTCP); } void tcp_heuristic_ecn_loss(struct tcpcb *tp) { struct tcp_cache_key_src tcks; if (symptoms_is_wifi_lossy() && IFNET_IS_WIFI(tp->t_inpcb->inp_last_outifp)) { return; } tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_SYN_LOSS); } void tcp_heuristic_ecn_droprst(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_DROPRST); } void tcp_heuristic_ecn_synrst(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_SYNRST); } void tcp_heuristic_ecn_aggressive(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_AGGRESSIVE); } void tcp_heuristic_tfo_middlebox(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tp->t_tfo_flags |= TFO_F_HEURISTIC_DONE; tcp_cache_key_src_create(tp, &tcks); tcp_heuristic_tfo_middlebox_common(&tcks); } static boolean_t tcp_heuristic_do_tfo_common(struct tcp_cache_key_src *tcks) { struct tcp_heuristics_head *__single head; struct tcp_heuristic *__single tpheur; if (disable_tcp_heuristics) { return TRUE; } /* Get the tcp-heuristic. */ tpheur = tcp_getheuristic_with_lock(tcks, 0, &head); if (tpheur == NULL) { return TRUE; } if (tpheur->th_tfo_in_backoff == 0) { goto tfo_ok; } if (TSTMP_GT(tcp_now, tpheur->th_tfo_backoff_until)) { tpheur->th_tfo_in_backoff = 0; tpheur->th_tfo_enabled_time = tcp_now; goto tfo_ok; } tcp_heuristic_unlock(head); return FALSE; tfo_ok: tcp_heuristic_unlock(head); return TRUE; } boolean_t tcp_heuristic_do_tfo(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); if (tcp_heuristic_do_tfo_common(&tcks)) { return TRUE; } return FALSE; } /* * @return: * 0 Enable MPTCP (we are still discovering middleboxes) * -1 Enable MPTCP (heuristics have been temporarily disabled) * 1 Disable MPTCP */ int tcp_heuristic_do_mptcp(struct tcpcb *tp) { struct tcp_cache_key_src tcks; struct tcp_heuristics_head *__single head = NULL; struct tcp_heuristic *__single tpheur; int ret = 0; if (disable_tcp_heuristics || (tptomptp(tp)->mpt_mpte->mpte_flags & MPTE_FORCE_ENABLE)) { return 0; } tcp_cache_key_src_create(tp, &tcks); /* Get the tcp-heuristic. */ tpheur = tcp_getheuristic_with_lock(&tcks, 0, &head); if (tpheur == NULL) { return 0; } if (tpheur->th_mptcp_in_backoff == 0 || tpheur->th_mptcp_heuristic_disabled == 1) { goto mptcp_ok; } if (TSTMP_GT(tpheur->th_mptcp_backoff, tcp_now)) { goto fallback; } tpheur->th_mptcp_in_backoff = 0; mptcp_ok: if (tpheur->th_mptcp_heuristic_disabled) { ret = -1; if (TSTMP_GT(tcp_now, tpheur->th_mptcp_backoff)) { tpheur->th_mptcp_heuristic_disabled = 0; tpheur->th_mptcp_success = 0; } } tcp_heuristic_unlock(head); return ret; fallback: if (head) { tcp_heuristic_unlock(head); } if (tptomptp(tp)->mpt_mpte->mpte_flags & MPTE_FIRSTPARTY) { tcpstat.tcps_mptcp_fp_heuristic_fallback++; } else { tcpstat.tcps_mptcp_heuristic_fallback++; } return 1; } static boolean_t tcp_heuristic_do_ecn_common(struct tcp_cache_key_src *tcks) { struct tcp_heuristics_head *__single head; struct tcp_heuristic *__single tpheur; boolean_t ret = TRUE; if (disable_tcp_heuristics) { return TRUE; } /* Get the tcp-heuristic. */ tpheur = tcp_getheuristic_with_lock(tcks, 0, &head); if (tpheur == NULL) { return ret; } if (TSTMP_GT(tpheur->th_ecn_backoff, tcp_now)) { ret = FALSE; } else { /* Reset the following counters to start re-evaluating */ if (tpheur->th_ecn_droprst >= ECN_RETRY_LIMIT) { tpheur->th_ecn_droprst = 0; } if (tpheur->th_ecn_synrst >= ECN_RETRY_LIMIT) { tpheur->th_ecn_synrst = 0; } /* Make sure it follows along */ tpheur->th_ecn_backoff = tcp_now; } tcp_heuristic_unlock(head); return ret; } boolean_t tcp_heuristic_do_ecn(struct tcpcb *tp) { struct tcp_cache_key_src tcks; tcp_cache_key_src_create(tp, &tcks); return tcp_heuristic_do_ecn_common(&tcks); } boolean_t tcp_heuristic_do_ecn_with_address(struct ifnet *ifp, union sockaddr_in_4_6 *local_address) { struct tcp_cache_key_src tcks; memset(&tcks, 0, sizeof(tcks)); tcks.ifp = ifp; calculate_tcp_clock(); if (local_address->sa.sa_family == AF_INET6) { memcpy(&tcks.laddr.addr6, &local_address->sin6.sin6_addr, sizeof(struct in6_addr)); tcks.af = AF_INET6; } else if (local_address->sa.sa_family == AF_INET) { memcpy(&tcks.laddr.addr, &local_address->sin.sin_addr, sizeof(struct in_addr)); tcks.af = AF_INET; } return tcp_heuristic_do_ecn_common(&tcks); } void tcp_heuristics_ecn_update(struct necp_tcp_ecn_cache *necp_buffer, struct ifnet *ifp, union sockaddr_in_4_6 *local_address) { struct tcp_cache_key_src tcks; memset(&tcks, 0, sizeof(tcks)); tcks.ifp = ifp; calculate_tcp_clock(); if (local_address->sa.sa_family == AF_INET6) { memcpy(&tcks.laddr.addr6, &local_address->sin6.sin6_addr, sizeof(struct in6_addr)); tcks.af = AF_INET6; } else if (local_address->sa.sa_family == AF_INET) { memcpy(&tcks.laddr.addr, &local_address->sin.sin_addr, sizeof(struct in_addr)); tcks.af = AF_INET; } if (necp_buffer->necp_tcp_ecn_heuristics_success) { tcp_heuristic_reset_counters(&tcks, TCPCACHE_F_ECN); } else if (necp_buffer->necp_tcp_ecn_heuristics_loss) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_SYN_LOSS); } else if (necp_buffer->necp_tcp_ecn_heuristics_drop_rst) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_DROPRST); } else if (necp_buffer->necp_tcp_ecn_heuristics_syn_rst) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_SYNRST); } else if (necp_buffer->necp_tcp_ecn_heuristics_aggressive) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_ECN_AGGRESSIVE); } return; } boolean_t tcp_heuristic_do_tfo_with_address(struct ifnet *ifp, union sockaddr_in_4_6 *local_address, union sockaddr_in_4_6 *remote_address, uint8_t *__counted_by(maxlen) cookie, uint8_t maxlen, uint8_t *cookie_len) { struct tcp_cache_key_src tcks; memset(&tcks, 0, sizeof(tcks)); tcks.ifp = ifp; calculate_tcp_clock(); if (remote_address->sa.sa_family == AF_INET6) { memcpy(&tcks.laddr.addr6, &local_address->sin6.sin6_addr, sizeof(struct in6_addr)); memcpy(&tcks.faddr.addr6, &remote_address->sin6.sin6_addr, sizeof(struct in6_addr)); tcks.af = AF_INET6; } else if (remote_address->sa.sa_family == AF_INET) { memcpy(&tcks.laddr.addr, &local_address->sin.sin_addr, sizeof(struct in_addr)); memcpy(&tcks.faddr.addr, &remote_address->sin.sin_addr, sizeof(struct in_addr)); tcks.af = AF_INET; } if (tcp_heuristic_do_tfo_common(&tcks)) { if (!tcp_cache_get_cookie_common(&tcks, cookie, maxlen, cookie_len)) { *cookie_len = 0; } return TRUE; } return FALSE; } void tcp_heuristics_tfo_update(struct necp_tcp_tfo_cache *necp_buffer, struct ifnet *ifp, union sockaddr_in_4_6 *local_address, union sockaddr_in_4_6 *remote_address) { struct tcp_cache_key_src tcks; memset(&tcks, 0, sizeof(tcks)); tcks.ifp = ifp; calculate_tcp_clock(); if (remote_address->sa.sa_family == AF_INET6) { memcpy(&tcks.laddr.addr6, &local_address->sin6.sin6_addr, sizeof(struct in6_addr)); memcpy(&tcks.faddr.addr6, &remote_address->sin6.sin6_addr, sizeof(struct in6_addr)); tcks.af = AF_INET6; } else if (remote_address->sa.sa_family == AF_INET) { memcpy(&tcks.laddr.addr, &local_address->sin.sin_addr, sizeof(struct in_addr)); memcpy(&tcks.faddr.addr, &remote_address->sin.sin_addr, sizeof(struct in_addr)); tcks.af = AF_INET; } if (necp_buffer->necp_tcp_tfo_heuristics_success) { tcp_heuristic_reset_counters(&tcks, TCPCACHE_F_TFO_REQ | TCPCACHE_F_TFO_DATA | TCPCACHE_F_TFO_REQ_RST | TCPCACHE_F_TFO_DATA_RST); } if (necp_buffer->necp_tcp_tfo_heuristics_success_req) { tcp_heuristic_reset_counters(&tcks, TCPCACHE_F_TFO_REQ | TCPCACHE_F_TFO_REQ_RST); } if (necp_buffer->necp_tcp_tfo_heuristics_loss) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_TFO_REQ | TCPCACHE_F_TFO_DATA); } if (necp_buffer->necp_tcp_tfo_heuristics_loss_req) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_TFO_REQ); } if (necp_buffer->necp_tcp_tfo_heuristics_rst_data) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_TFO_REQ_RST | TCPCACHE_F_TFO_DATA_RST); } if (necp_buffer->necp_tcp_tfo_heuristics_rst_req) { tcp_heuristic_inc_counters(&tcks, TCPCACHE_F_TFO_REQ_RST); } if (necp_buffer->necp_tcp_tfo_heuristics_middlebox) { tcp_heuristic_tfo_middlebox_common(&tcks); } if (necp_buffer->necp_tcp_tfo_cookie_len != 0) { tcp_cache_set_cookie_common(&tcks, necp_buffer->necp_tcp_tfo_cookie, necp_buffer->necp_tcp_tfo_cookie_len); } return; } #if (DEVELOPMENT || DEBUG) /* * This test sysctl forces the hash table to be full which will force us to * erase portions of it. */ static int sysctl_fill_hashtable SYSCTL_HANDLER_ARGS { #pragma unused(arg1, arg2) int error = 0, val; val = 0; error = sysctl_handle_int(oidp, &val, 0, req); if (error || !req->newptr) { return error; } if (val == 1) { struct necp_tcp_tfo_cache necp_buffer = {}; union sockaddr_in_4_6 local_address = {}, remote_address = {}; necp_buffer.necp_tcp_tfo_heuristics_success = 1; necp_buffer.necp_tcp_tfo_heuristics_loss = 1; necp_buffer.necp_tcp_tfo_heuristics_middlebox = 1; for (unsigned i = 0; i < 1024; i++) { local_address.sin.sin_family = AF_INET; local_address.sin.sin_len = sizeof(struct sockaddr_in); local_address.sin.sin_port = random() % UINT16_MAX; local_address.sin.sin_addr.s_addr = random(); remote_address.sin.sin_family = AF_INET; remote_address.sin.sin_len = sizeof(struct sockaddr_in); remote_address.sin.sin_port = random() % UINT16_MAX; remote_address.sin.sin_addr.s_addr = random(); tcp_heuristics_tfo_update(&necp_buffer, lo_ifp, &local_address, &remote_address); } } return error; } static int fill_hash_table = 0; SYSCTL_PROC(_net_inet_tcp, OID_AUTO, test_cache, CTLTYPE_INT | CTLFLAG_RW | CTLFLAG_LOCKED, &fill_hash_table, 0, &sysctl_fill_hashtable, "I", "Tests the hash table erasing procedures"); #endif /* DEVELOPMENT || DEBUG */ static void sysctl_cleartfocache(void) { int i; for (i = 0; i < tcp_cache_size; i++) { struct tcp_cache_head *__single head = &tcp_cache[i]; struct tcp_cache *__single tpcache, *__single tmp; struct tcp_heuristics_head *__single hhead = &tcp_heuristics[i]; struct tcp_heuristic *__single tpheur, *__single htmp; lck_mtx_lock(&head->tch_mtx); SLIST_FOREACH_SAFE(tpcache, &head->tcp_caches, list, tmp) { SLIST_REMOVE(&head->tcp_caches, tpcache, tcp_cache, list); kfree_type(struct tcp_cache, tpcache); } lck_mtx_unlock(&head->tch_mtx); lck_mtx_lock(&hhead->thh_mtx); SLIST_FOREACH_SAFE(tpheur, &hhead->tcp_heuristics, list, htmp) { SLIST_REMOVE(&hhead->tcp_heuristics, tpheur, tcp_heuristic, list); kfree_type(struct tcp_heuristic, tpheur); } lck_mtx_unlock(&hhead->thh_mtx); } } /* This sysctl is useful for testing purposes only */ static int tcpcleartfo = 0; static int sysctl_cleartfo SYSCTL_HANDLER_ARGS { #pragma unused(arg1, arg2) int error = 0, val, oldval = tcpcleartfo; val = oldval; error = sysctl_handle_int(oidp, &val, 0, req); if (error || !req->newptr) { if (error) { os_log_error(OS_LOG_DEFAULT, "%s could not parse int: %d", __func__, error); } return error; } /* * The actual value does not matter. If the value is set, it triggers * the clearing of the TFO cache. If a future implementation does not * use the route entry to hold the TFO cache, replace the route sysctl. */ if (val != oldval) { sysctl_cleartfocache(); } tcpcleartfo = val; return error; } SYSCTL_PROC(_net_inet_tcp, OID_AUTO, clear_tfocache, CTLTYPE_INT | CTLFLAG_RW | CTLFLAG_LOCKED, &tcpcleartfo, 0, &sysctl_cleartfo, "I", "Toggle to clear the TFO destination based heuristic cache"); static int sysctl_tcp_heuristics_list SYSCTL_HANDLER_ARGS { #pragma unused(arg1, arg2) int error = 0; size_t total_entries = 0; size_t total_size; bool entitled = false; if (tcp_heuristics == NULL || tcp_heuristics_size == 0) { return ENOENT; } if (IOCurrentTaskHasEntitlement(TCP_HEURISTICS_LIST_ENTITLEMENT)) { entitled = true; } /* First pass: count total number of heuristic entries across all buckets */ for (size_t i = 0; i < tcp_heuristics_size; i++) { struct tcp_heuristics_head *head = &tcp_heuristics[i]; struct tcp_heuristic *tpheur; lck_mtx_lock(&head->thh_mtx); SLIST_FOREACH(tpheur, &head->tcp_heuristics, list) { total_entries++; } lck_mtx_unlock(&head->thh_mtx); } total_size = total_entries * sizeof(struct tcp_heuristics_data); if (req->oldptr == USER_ADDR_NULL) { /* Just return the size needed */ return SYSCTL_OUT(req, NULL, total_size); } if (req->oldlen < total_size) { return ENOMEM; } /* Second pass: copy out all heuristic entries */ for (size_t i = 0; i < tcp_heuristics_size; i++) { struct tcp_heuristics_head *head = &tcp_heuristics[i]; struct tcp_heuristic *tpheur; lck_mtx_lock(&head->thh_mtx); SLIST_FOREACH(tpheur, &head->tcp_heuristics, list) { struct tcp_heuristics_data heur_data; /* Copy data from tcp_heuristic to tcp_heuristics_data (excluding list field) */ heur_data.th_last_access = tpheur->th_last_access; if (entitled) { heur_data.th_key = tpheur->th_key; } else { heur_data.th_key.thk_family = tpheur->th_key.thk_family; } heur_data.th_tfo_data_loss = tpheur->th_tfo_data_loss; heur_data.th_tfo_req_loss = tpheur->th_tfo_req_loss; heur_data.th_tfo_data_rst = tpheur->th_tfo_data_rst; heur_data.th_tfo_req_rst = tpheur->th_tfo_req_rst; heur_data.th_mptcp_loss = tpheur->th_mptcp_loss; heur_data.th_mptcp_success = tpheur->th_mptcp_success; heur_data.th_ecn_droprst = tpheur->th_ecn_droprst; heur_data.th_ecn_synrst = tpheur->th_ecn_synrst; heur_data.th_tfo_enabled_time = tpheur->th_tfo_enabled_time; heur_data.th_tfo_backoff_until = tpheur->th_tfo_backoff_until; heur_data.th_tfo_backoff = tpheur->th_tfo_backoff; heur_data.th_mptcp_backoff = tpheur->th_mptcp_backoff; heur_data.th_ecn_backoff = tpheur->th_ecn_backoff; heur_data.th_tfo_in_backoff = tpheur->th_tfo_in_backoff; heur_data.th_mptcp_in_backoff = tpheur->th_mptcp_in_backoff; heur_data.th_mptcp_heuristic_disabled = tpheur->th_mptcp_heuristic_disabled; error = SYSCTL_OUT(req, &heur_data, sizeof(struct tcp_heuristics_data)); if (error) { lck_mtx_unlock(&head->thh_mtx); return error; } } lck_mtx_unlock(&head->thh_mtx); } return error; } SYSCTL_PROC(_net_inet_tcp, OID_AUTO, heuristics_list, CTLTYPE_OPAQUE | CTLFLAG_RD | CTLFLAG_LOCKED, NULL, 0, sysctl_tcp_heuristics_list, "S,tcp_heuristics_data", "TCP heuristics entries from all buckets"); static int sysctl_tcp_cache_list SYSCTL_HANDLER_ARGS { #pragma unused(arg1, arg2) int error = 0; size_t total_entries = 0; size_t total_size; bool entitled = false; if (tcp_cache == NULL || tcp_cache_size == 0) { return ENOENT; } if (IOCurrentTaskHasEntitlement(TCP_CACHE_LIST_ENTITLEMENT)) { entitled = true; } /* First pass: count total number of cache entries across all buckets */ for (size_t i = 0; i < tcp_cache_size; i++) { struct tcp_cache_head *head = &tcp_cache[i]; struct tcp_cache *tpcache; lck_mtx_lock(&head->tch_mtx); SLIST_FOREACH(tpcache, &head->tcp_caches, list) { total_entries++; } lck_mtx_unlock(&head->tch_mtx); } total_size = total_entries * sizeof(struct tcp_cache_data); if (req->oldptr == USER_ADDR_NULL) { /* Just return the size needed */ return SYSCTL_OUT(req, NULL, total_size); } if (req->oldlen < total_size) { return ENOMEM; } /* Second pass: copy out all cache entries */ for (size_t i = 0; i < tcp_cache_size; i++) { struct tcp_cache_head *head = &tcp_cache[i]; struct tcp_cache *tpcache; lck_mtx_lock(&head->tch_mtx); SLIST_FOREACH(tpcache, &head->tcp_caches, list) { struct tcp_cache_data cache_data; /* Copy data from tcp_cache to tcp_cache_data (excluding list field) */ cache_data.tc_last_access = tpcache->tc_last_access; if (entitled) { cache_data.tc_key = tpcache->tc_key; } else { cache_data.tc_key.tck_family = tpcache->tc_key.tck_family; } memcpy(cache_data.tc_tfo_cookie, tpcache->tc_tfo_cookie, TFO_COOKIE_LEN_MAX); cache_data.tc_tfo_cookie_len = tpcache->tc_tfo_cookie_len; cache_data.tc_mptcp_version_confirmed = tpcache->tc_mptcp_version_confirmed; cache_data.tc_mptcp_version = tpcache->tc_mptcp_version; cache_data.tc_mptcp_next_version_try = tpcache->tc_mptcp_next_version_try; error = SYSCTL_OUT(req, &cache_data, sizeof(struct tcp_cache_data)); if (error) { lck_mtx_unlock(&head->tch_mtx); return error; } } lck_mtx_unlock(&head->tch_mtx); } return error; } SYSCTL_PROC(_net_inet_tcp, OID_AUTO, cache_list, CTLTYPE_OPAQUE | CTLFLAG_RD | CTLFLAG_LOCKED, NULL, 0, sysctl_tcp_cache_list, "S,tcp_cache_data", "TCP cache entries from all buckets"); void tcp_cache_init(void) { uint64_t sane_size_meg = sane_size / 1024 / 1024; size_t cache_size; /* * On machines with <100MB of memory this will result in a (full) cache-size * of 32 entries, thus 32 * 5 * 64bytes = 10KB. (about 0.01 %) * On machines with > 4GB of memory, we have a cache-size of 1024 entries, * thus about 327KB. * * Side-note: we convert to uint32_t. If sane_size is more than * 16000 TB, we loose precision. But, who cares? :) */ cache_size = tcp_cache_roundup2((uint32_t)(sane_size_meg >> 2)); if (cache_size < 32) { cache_size = 32; } else if (cache_size > 1024) { cache_size = 1024; } tcp_cache = zalloc_permanent(sizeof(struct tcp_cache_head) * cache_size, ZALIGN(struct tcp_cache_head)); tcp_cache_size = cache_size; tcp_heuristics = zalloc_permanent(sizeof(struct tcp_heuristics_head) * cache_size, ZALIGN(struct tcp_heuristics_head)); tcp_heuristics_size = cache_size; for (int i = 0; i < tcp_cache_size; i++) { lck_mtx_init(&tcp_cache[i].tch_mtx, &tcp_cache_mtx_grp, &tcp_cache_mtx_attr); SLIST_INIT(&tcp_cache[i].tcp_caches); lck_mtx_init(&tcp_heuristics[i].thh_mtx, &tcp_heuristic_mtx_grp, &tcp_heuristic_mtx_attr); SLIST_INIT(&tcp_heuristics[i].tcp_heuristics); } tcp_cache_hash_seed = RandomULong(); }