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
|
// Copyright 2023 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
//go:build go1.21
package quic
import (
"fmt"
"testing"
"time"
)
func TestLossAntiAmplificationLimit(t *testing.T) {
test := newLossTest(t, serverSide, lossTestOpts{})
test.datagramReceived(1200)
t.Logf("# consume anti-amplification capacity in a mix of packets")
test.send(initialSpace, 0, sentPacket{
size: 1200,
ackEliciting: true,
inFlight: true,
})
test.send(initialSpace, 1, sentPacket{
size: 1200,
ackEliciting: false,
inFlight: false,
})
test.send(initialSpace, 2, sentPacket{
size: 1200,
ackEliciting: false,
inFlight: true,
})
t.Logf("# send blocked by anti-amplification limit")
test.wantSendLimit(ccBlocked)
t.Logf("# receiving a datagram unblocks server")
test.datagramReceived(100)
test.wantSendLimit(ccOK)
t.Logf("# validating client address removes anti-amplification limit")
test.validateClientAddress()
test.wantSendLimit(ccOK)
}
func TestLossRTTSampleNotGenerated(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(initialSpace, 0, 1)
test.send(initialSpace, 2, sentPacket{
ackEliciting: false,
inFlight: false,
})
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(initialSpace, 1)
test.wantVar("latest_rtt", 10*time.Millisecond)
t.Logf("# smoothed_rtt = latest_rtt")
test.wantVar("smoothed_rtt", 10*time.Millisecond)
t.Logf("# rttvar = latest_rtt / 2")
test.wantVar("rttvar", 5*time.Millisecond)
// "...an ACK frame SHOULD NOT be used to update RTT estimates if
// it does not newly acknowledge the largest acknowledged packet."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.1-6
t.Logf("# acks for older packets do not generate an RTT sample")
test.advance(1 * time.Millisecond)
test.ack(initialSpace, 1*time.Millisecond, i64range[packetNumber]{0, 2})
test.wantAck(initialSpace, 0)
test.wantVar("smoothed_rtt", 10*time.Millisecond)
// "An RTT sample MUST NOT be generated on receiving an ACK frame
// that does not newly acknowledge at least one ack-eliciting packet."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.1-7
t.Logf("# acks for non-ack-eliciting packets do not generate an RTT sample")
test.advance(1 * time.Millisecond)
test.ack(initialSpace, 1*time.Millisecond, i64range[packetNumber]{0, 3})
test.wantAck(initialSpace, 2)
test.wantVar("smoothed_rtt", 10*time.Millisecond)
}
func TestLossMinRTT(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
// "min_rtt MUST be set to the latest_rtt on the first RTT sample."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.2-2
t.Logf("# min_rtt set on first sample")
test.send(initialSpace, 0)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.wantVar("min_rtt", 10*time.Millisecond)
// "min_rtt MUST be set to the lesser of min_rtt and latest_rtt [...]
// on all other samples."
t.Logf("# min_rtt does not increase")
test.send(initialSpace, 1)
test.advance(20 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 2})
test.wantAck(initialSpace, 1)
test.wantVar("min_rtt", 10*time.Millisecond)
t.Logf("# min_rtt decreases")
test.send(initialSpace, 2)
test.advance(5 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 3})
test.wantAck(initialSpace, 2)
test.wantVar("min_rtt", 5*time.Millisecond)
}
func TestLossMinRTTAfterCongestion(t *testing.T) {
// "Endpoints SHOULD set the min_rtt to the newest RTT sample
// after persistent congestion is established."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.2-5
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# establish initial RTT sample")
test.send(initialSpace, 0, testSentPacketSize(1200))
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.wantVar("min_rtt", 10*time.Millisecond)
t.Logf("# send two packets spanning persistent congestion duration")
test.send(initialSpace, 1, testSentPacketSize(1200))
t.Logf("# 2000ms >> persistent congestion duration")
test.advance(2000 * time.Millisecond)
test.wantPTOExpired()
test.send(initialSpace, 2, testSentPacketSize(1200))
t.Logf("# trigger loss of previous packets")
test.advance(10 * time.Millisecond)
test.send(initialSpace, 3, testSentPacketSize(1200))
test.advance(20 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{3, 4})
test.wantAck(initialSpace, 3)
test.wantLoss(initialSpace, 1, 2)
t.Logf("# persistent congestion detected")
test.send(initialSpace, 4, testSentPacketSize(1200))
test.advance(20 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{4, 5})
test.wantAck(initialSpace, 4)
t.Logf("# min_rtt set from first sample after persistent congestion")
test.wantVar("min_rtt", 20*time.Millisecond)
}
func TestLossInitialRTTSample(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
test.setMaxAckDelay(2 * time.Millisecond)
t.Logf("# initial smoothed_rtt and rtt values")
test.wantVar("smoothed_rtt", 333*time.Millisecond)
test.wantVar("rttvar", 333*time.Millisecond/2)
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.3-11
t.Logf("# first RTT sample")
test.send(initialSpace, 0)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.wantVar("latest_rtt", 10*time.Millisecond)
t.Logf("# smoothed_rtt = latest_rtt")
test.wantVar("smoothed_rtt", 10*time.Millisecond)
t.Logf("# rttvar = latest_rtt / 2")
test.wantVar("rttvar", 5*time.Millisecond)
}
func TestLossSmoothedRTTIgnoresMaxAckDelayBeforeHandshakeConfirmed(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
test.setMaxAckDelay(1 * time.Millisecond)
test.send(initialSpace, 0)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
smoothedRTT := 10 * time.Millisecond
rttvar := 5 * time.Millisecond
// "[...] an endpoint [...] SHOULD ignore the peer's max_ack_delay
// until the handshake is confirmed [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.3-7.2
t.Logf("# subsequent RTT sample")
test.send(handshakeSpace, 0)
test.advance(20 * time.Millisecond)
test.ack(handshakeSpace, 10*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(handshakeSpace, 0)
test.wantVar("latest_rtt", 20*time.Millisecond)
t.Logf("# ack_delay > max_ack_delay")
t.Logf("# handshake not confirmed, so ignore max_ack_delay")
t.Logf("# adjusted_rtt = latest_rtt - ackDelay")
adjustedRTT := 10 * time.Millisecond
t.Logf("# smoothed_rtt = 7/8 * smoothed_rtt + 1/8 * adjusted_rtt")
smoothedRTT = (7*smoothedRTT + adjustedRTT) / 8
test.wantVar("smoothed_rtt", smoothedRTT)
rttvarSample := abs(smoothedRTT - adjustedRTT)
t.Logf("# rttvar_sample = abs(smoothed_rtt - adjusted_rtt) = %v", rttvarSample)
t.Logf("# rttvar = 3/4 * rttvar + 1/4 * rttvar_sample")
rttvar = (3*rttvar + rttvarSample) / 4
test.wantVar("rttvar", rttvar)
}
func TestLossSmoothedRTTUsesMaxAckDelayAfterHandshakeConfirmed(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
test.setMaxAckDelay(25 * time.Millisecond)
test.send(initialSpace, 0)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
smoothedRTT := 10 * time.Millisecond
rttvar := 5 * time.Millisecond
test.confirmHandshake()
// "[...] an endpoint [...] MUST use the lesser of the acknowledgment
// delay and the peer's max_ack_delay after the handshake is confirmed [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.3-7.3
t.Logf("# subsequent RTT sample")
test.send(handshakeSpace, 0)
test.advance(50 * time.Millisecond)
test.ack(handshakeSpace, 40*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(handshakeSpace, 0)
test.wantVar("latest_rtt", 50*time.Millisecond)
t.Logf("# ack_delay > max_ack_delay")
t.Logf("# handshake confirmed, so adjusted_rtt clamps to max_ack_delay")
t.Logf("# adjusted_rtt = max_ack_delay")
adjustedRTT := 25 * time.Millisecond
rttvarSample := abs(smoothedRTT - adjustedRTT)
t.Logf("# rttvar_sample = abs(smoothed_rtt - adjusted_rtt) = %v", rttvarSample)
t.Logf("# rttvar = 3/4 * rttvar + 1/4 * rttvar_sample")
rttvar = (3*rttvar + rttvarSample) / 4
test.wantVar("rttvar", rttvar)
t.Logf("# smoothed_rtt = 7/8 * smoothed_rtt + 1/8 * adjusted_rtt")
smoothedRTT = (7*smoothedRTT + adjustedRTT) / 8
test.wantVar("smoothed_rtt", smoothedRTT)
}
func TestLossAckDelayReducesRTTBelowMinRTT(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(initialSpace, 0)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
smoothedRTT := 10 * time.Millisecond
rttvar := 5 * time.Millisecond
// "[...] an endpoint [...] MUST NOT subtract the acknowledgment delay
// from the RTT sample if the resulting value is smaller than the min_rtt."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-5.3-7.4
t.Logf("# subsequent RTT sample")
test.send(handshakeSpace, 0)
test.advance(12 * time.Millisecond)
test.ack(handshakeSpace, 4*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(handshakeSpace, 0)
test.wantVar("latest_rtt", 12*time.Millisecond)
t.Logf("# latest_rtt - ack_delay < min_rtt, so adjusted_rtt = latest_rtt")
adjustedRTT := 12 * time.Millisecond
rttvarSample := abs(smoothedRTT - adjustedRTT)
t.Logf("# rttvar_sample = abs(smoothed_rtt - adjusted_rtt) = %v", rttvarSample)
t.Logf("# rttvar = 3/4 * rttvar + 1/4 * rttvar_sample")
rttvar = (3*rttvar + rttvarSample) / 4
test.wantVar("rttvar", rttvar)
t.Logf("# smoothed_rtt = 7/8 * smoothed_rtt + 1/8 * adjusted_rtt")
smoothedRTT = (7*smoothedRTT + adjustedRTT) / 8
test.wantVar("smoothed_rtt", smoothedRTT)
}
func TestLossPacketThreshold(t *testing.T) {
// "[...] the packet was sent kPacketThreshold packets before an
// acknowledged packet [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.1.1
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# acking a packet triggers loss of packets sent kPacketThreshold earlier")
test.send(appDataSpace, 0, 1, 2, 3, 4, 5, 6)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{4, 5})
test.wantAck(appDataSpace, 4)
test.wantLoss(appDataSpace, 0, 1)
}
func TestLossOutOfOrderAcks(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# out of order acks, no loss")
test.send(appDataSpace, 0, 1, 2)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{2, 3})
test.wantAck(appDataSpace, 2)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(appDataSpace, 1)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(appDataSpace, 0)
}
func TestLossSendAndAck(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(appDataSpace, 0, 1, 2)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{0, 3})
test.wantAck(appDataSpace, 0, 1, 2)
// Redundant ACK doesn't trigger more ACK events.
// (If we did get an extra ACK, the test cleanup would notice and complain.)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{0, 3})
}
func TestLossAckEveryOtherPacket(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(appDataSpace, 0, 1, 2, 3, 4, 5, 6)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(appDataSpace, 0)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{2, 3})
test.wantAck(appDataSpace, 2)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{4, 5})
test.wantAck(appDataSpace, 4)
test.wantLoss(appDataSpace, 1)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{6, 7})
test.wantAck(appDataSpace, 6)
test.wantLoss(appDataSpace, 3)
}
func TestLossMultipleSpaces(t *testing.T) {
// "Loss detection is separate per packet number space [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6-3
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# send packets in different spaces")
test.send(initialSpace, 0, 1, 2)
test.send(handshakeSpace, 0, 1, 2)
test.send(appDataSpace, 0, 1, 2)
t.Logf("# ack one packet in each space")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(initialSpace, 1)
test.ack(handshakeSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(handshakeSpace, 1)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(appDataSpace, 1)
t.Logf("# send more packets")
test.send(initialSpace, 3, 4, 5)
test.send(handshakeSpace, 3, 4, 5)
test.send(appDataSpace, 3, 4, 5)
t.Logf("# ack the last packet, triggering loss")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{5, 6})
test.wantAck(initialSpace, 5)
test.wantLoss(initialSpace, 0, 2)
test.ack(handshakeSpace, 0*time.Millisecond, i64range[packetNumber]{5, 6})
test.wantAck(handshakeSpace, 5)
test.wantLoss(handshakeSpace, 0, 2)
test.ack(appDataSpace, 0*time.Millisecond, i64range[packetNumber]{5, 6})
test.wantAck(appDataSpace, 5)
test.wantLoss(appDataSpace, 0, 2)
}
func TestLossTimeThresholdFirstPacketLost(t *testing.T) {
// "[...] the packet [...] was sent long enough in the past."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.1-3.2
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# packet 0 lost after time threshold passes")
test.send(initialSpace, 0, 1)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(initialSpace, 1)
t.Logf("# latest_rtt == smoothed_rtt")
test.wantVar("smoothed_rtt", 10*time.Millisecond)
test.wantVar("latest_rtt", 10*time.Millisecond)
t.Logf("# timeout = 9/8 * max(smoothed_rtt, latest_rtt) - time_since_packet_sent")
test.wantTimeout(((10 * time.Millisecond * 9) / 8) - 10*time.Millisecond)
test.advanceToLossTimer()
test.wantLoss(initialSpace, 0)
}
func TestLossTimeThreshold(t *testing.T) {
// "The time threshold is:
// max(kTimeThreshold * max(smoothed_rtt, latest_rtt), kGranularity)"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.1.2-2
for _, tc := range []struct {
name string
initialRTT time.Duration
latestRTT time.Duration
wantTimeout time.Duration
}{{
name: "rtt increasing",
initialRTT: 10 * time.Millisecond,
latestRTT: 20 * time.Millisecond,
wantTimeout: 20 * time.Millisecond * 9 / 8,
}, {
name: "rtt decreasing",
initialRTT: 10 * time.Millisecond,
latestRTT: 5 * time.Millisecond,
wantTimeout: ((7*10*time.Millisecond + 5*time.Millisecond) / 8) * 9 / 8,
}, {
name: "rtt less than timer granularity",
initialRTT: 500 * time.Microsecond,
latestRTT: 500 * time.Microsecond,
wantTimeout: 1 * time.Millisecond,
}} {
t.Run(tc.name, func(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# first ack establishes smoothed_rtt")
test.send(initialSpace, 0)
test.advance(tc.initialRTT)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# ack of packet 2 starts loss timer for packet 1")
test.send(initialSpace, 1, 2)
test.advance(tc.latestRTT)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{2, 3})
test.wantAck(initialSpace, 2)
t.Logf("# smoothed_rtt = %v", test.c.rtt.smoothedRTT)
t.Logf("# latest_rtt = %v", test.c.rtt.latestRTT)
t.Logf("# timeout = max(9/8 * max(smoothed_rtt, latest_rtt), 1ms)")
t.Logf("# (measured since packet 1 sent)")
test.wantTimeout(tc.wantTimeout - tc.latestRTT)
t.Logf("# advancing to the loss time causes loss of packet 1")
test.advanceToLossTimer()
test.wantLoss(initialSpace, 1)
})
}
}
func TestLossPTONotAckEliciting(t *testing.T) {
// "When an ack-eliciting packet is transmitted,
// the sender schedules a timer for the PTO period [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-1
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# PTO timer for first packet")
test.send(initialSpace, 0)
test.wantVar("smoothed_rtt", 333*time.Millisecond) // initial value
test.wantVar("rttvar", 333*time.Millisecond/2) // initial value
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(999 * time.Millisecond)
t.Logf("# sending a non-ack-eliciting packet doesn't adjust PTO")
test.advance(333 * time.Millisecond)
test.send(initialSpace, 1, sentPacket{
ackEliciting: false,
})
test.wantVar("smoothed_rtt", 333*time.Millisecond) // unchanged
test.wantVar("rttvar", 333*time.Millisecond/2) // unchanged
test.wantTimeout(666 * time.Millisecond)
}
func TestLossPTOMaxAckDelay(t *testing.T) {
// "When the PTO is armed for Initial or Handshake packet number spaces,
// the max_ack_delay in the PTO period computation is set to 0 [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-4
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# PTO timer for first packet")
test.send(initialSpace, 0)
test.wantVar("smoothed_rtt", 333*time.Millisecond) // initial value
test.wantVar("rttvar", 333*time.Millisecond/2) // initial value
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(999 * time.Millisecond)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# PTO timer for handshake packet")
test.send(handshakeSpace, 0)
test.wantVar("smoothed_rtt", 10*time.Millisecond)
test.wantVar("rttvar", 5*time.Millisecond)
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(30 * time.Millisecond)
test.advance(10 * time.Millisecond)
test.ack(handshakeSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(handshakeSpace, 0)
test.confirmHandshake()
t.Logf("# PTO timer for appdata packet")
test.send(appDataSpace, 0)
test.wantVar("smoothed_rtt", 10*time.Millisecond)
test.wantVar("rttvar", 3750*time.Microsecond)
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms) + max_ack_delay (25ms)")
test.wantTimeout(50 * time.Millisecond)
}
func TestLossPTOUnderTimerGranularity(t *testing.T) {
// "The PTO period MUST be at least kGranularity [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-5
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(initialSpace, 0)
test.advance(10 * time.Microsecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.send(initialSpace, 1)
test.wantVar("smoothed_rtt", 10*time.Microsecond)
test.wantVar("rttvar", 5*time.Microsecond)
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(10*time.Microsecond + 1*time.Millisecond)
}
func TestLossPTOMultipleSpaces(t *testing.T) {
// "[...] the timer MUST be set to the earlier value of the Initial and Handshake
// packet number spaces."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-6
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# PTO timer for first packet")
test.send(initialSpace, 0)
test.wantVar("smoothed_rtt", 333*time.Millisecond) // initial value
test.wantVar("rttvar", 333*time.Millisecond/2) // initial value
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(999 * time.Millisecond)
t.Logf("# Initial and Handshake packets in flight, first takes precedence")
test.advance(333 * time.Millisecond)
test.send(handshakeSpace, 0)
test.wantTimeout(666 * time.Millisecond)
t.Logf("# Initial packet acked, Handshake PTO timer armed")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.wantTimeout(999 * time.Millisecond)
t.Logf("# send Initial, earlier Handshake PTO takes precedence")
test.advance(333 * time.Millisecond)
test.send(initialSpace, 1)
test.wantTimeout(666 * time.Millisecond)
}
func TestLossPTOHandshakeConfirmation(t *testing.T) {
// "An endpoint MUST NOT set its PTO timer for the Application Data
// packet number space until the handshake is confirmed."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-7
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(initialSpace, 0)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.send(handshakeSpace, 0)
test.ack(handshakeSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(handshakeSpace, 0)
test.send(appDataSpace, 0)
test.wantNoTimeout()
}
func TestLossPTOBackoffDoubles(t *testing.T) {
// "When a PTO timer expires, the PTO backoff MUST be increased,
// resulting in the PTO period being set to twice its current value."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-9
test := newLossTest(t, serverSide, lossTestOpts{})
test.datagramReceived(1200)
test.send(initialSpace, 0)
test.wantVar("smoothed_rtt", 333*time.Millisecond) // initial value
test.wantVar("rttvar", 333*time.Millisecond/2) // initial value
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(999 * time.Millisecond)
t.Logf("# wait for PTO timer expiration")
test.advanceToLossTimer()
test.wantPTOExpired()
test.wantNoTimeout()
t.Logf("# PTO timer doubles")
test.send(initialSpace, 1)
test.wantTimeout(2 * 999 * time.Millisecond)
test.advanceToLossTimer()
test.wantPTOExpired()
test.wantNoTimeout()
t.Logf("# PTO timer doubles again")
test.send(initialSpace, 2)
test.wantTimeout(4 * 999 * time.Millisecond)
test.advanceToLossTimer()
test.wantPTOExpired()
test.wantNoTimeout()
}
func TestLossPTOBackoffResetOnAck(t *testing.T) {
// "The PTO backoff factor is reset when an acknowledgment is received [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-9
test := newLossTest(t, serverSide, lossTestOpts{})
test.datagramReceived(1200)
t.Logf("# first ack establishes smoothed_rtt = 10ms")
test.send(initialSpace, 0)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# set rttvar for simplicity")
test.setRTTVar(0)
t.Logf("# send packet 1 and wait for PTO")
test.send(initialSpace, 1)
test.wantTimeout(11 * time.Millisecond)
test.advanceToLossTimer()
test.wantPTOExpired()
test.wantNoTimeout()
t.Logf("# send packet 2 & 3, PTO doubles")
test.send(initialSpace, 2, 3)
test.wantTimeout(22 * time.Millisecond)
test.advance(10 * time.Millisecond)
t.Logf("# check remaining PTO (22ms - 10ms elapsed)")
test.wantTimeout(12 * time.Millisecond)
t.Logf("# ACK to packet 2 resets PTO")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 3})
test.wantAck(initialSpace, 1)
test.wantAck(initialSpace, 2)
t.Logf("# check remaining PTO (11ms - 10ms elapsed)")
test.wantTimeout(1 * time.Millisecond)
}
func TestLossPTOBackoffNotResetOnClientInitialAck(t *testing.T) {
// "[...] a client does not reset the PTO backoff factor on
// receiving acknowledgments in Initial packets."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-9
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# first ack establishes smoothed_rtt = 10ms")
test.send(initialSpace, 0)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# set rttvar for simplicity")
test.setRTTVar(0)
t.Logf("# send packet 1 and wait for PTO")
test.send(initialSpace, 1)
test.wantTimeout(11 * time.Millisecond)
test.advanceToLossTimer()
test.wantPTOExpired()
test.wantNoTimeout()
t.Logf("# send more packets, PTO doubles")
test.send(initialSpace, 2, 3)
test.send(handshakeSpace, 0)
test.wantTimeout(22 * time.Millisecond)
test.advance(10 * time.Millisecond)
t.Logf("# check remaining PTO (22ms - 10ms elapsed)")
test.wantTimeout(12 * time.Millisecond)
// TODO: Is this right? 6.2.1-9 says we don't reset the PTO *backoff*, not the PTO.
// 6.2.1-8 says we reset the PTO timer when an ack-eliciting packet is sent *or
// acknowledged*, but the pseudocode in appendix A doesn't appear to do the latter.
t.Logf("# ACK to Initial packet does not reset PTO for client")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 3})
test.wantAck(initialSpace, 1)
test.wantAck(initialSpace, 2)
t.Logf("# check remaining PTO (22ms - 10ms elapsed)")
test.wantTimeout(12 * time.Millisecond)
t.Logf("# ACK to handshake packet does reset PTO")
test.ack(handshakeSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(handshakeSpace, 0)
t.Logf("# check remaining PTO (12ms - 10ms elapsed)")
test.wantTimeout(1 * time.Millisecond)
}
func TestLossPTONotSetWhenLossTimerSet(t *testing.T) {
// "The PTO timer MUST NOT be set if a timer is set
// for time threshold loss detection [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.1-12
test := newLossTest(t, serverSide, lossTestOpts{})
test.datagramReceived(1200)
t.Logf("# PTO timer set for first packets sent")
test.send(initialSpace, 0, 1)
test.wantVar("smoothed_rtt", 333*time.Millisecond) // initial value
test.wantVar("rttvar", 333*time.Millisecond/2) // initial value
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(999 * time.Millisecond)
t.Logf("# ack of packet 1 starts loss timer for 0, PTO overidden")
test.advance(333 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(initialSpace, 1)
t.Logf("# latest_rtt == smoothed_rtt")
test.wantVar("smoothed_rtt", 333*time.Millisecond)
test.wantVar("latest_rtt", 333*time.Millisecond)
t.Logf("# timeout = 9/8 * max(smoothed_rtt, latest_rtt) - time_since_packet_sent")
test.wantTimeout(((333 * time.Millisecond * 9) / 8) - 333*time.Millisecond)
}
func TestLossDiscardingKeysResetsTimers(t *testing.T) {
// "When Initial or Handshake keys are discarded,
// the PTO and loss detection timers MUST be reset"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.2-3
test := newLossTest(t, clientSide, lossTestOpts{})
t.Logf("# handshake packet sent 1ms after initial")
test.send(initialSpace, 0, 1)
test.advance(1 * time.Millisecond)
test.send(handshakeSpace, 0, 1)
test.advance(9 * time.Millisecond)
t.Logf("# ack of Initial packet 2 starts loss timer for packet 1")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(initialSpace, 1)
test.advance(1 * time.Millisecond)
t.Logf("# smoothed_rtt = %v", 10*time.Millisecond)
t.Logf("# latest_rtt = %v", 10*time.Millisecond)
t.Logf("# timeout = max(9/8 * max(smoothed_rtt, latest_rtt), 1ms)")
t.Logf("# (measured since Initial packet 1 sent)")
test.wantTimeout((10 * time.Millisecond * 9 / 8) - 11*time.Millisecond)
t.Logf("# ack of Handshake packet 2 starts loss timer for packet 1")
test.ack(handshakeSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(handshakeSpace, 1)
t.Logf("# dropping Initial keys sets timer to Handshake timeout")
test.discardKeys(initialSpace)
test.wantTimeout((10 * time.Millisecond * 9 / 8) - 10*time.Millisecond)
}
func TestLossNoPTOAtAntiAmplificationLimit(t *testing.T) {
// "If no additional data can be sent [because the server is at the
// anti-amplification limit], the server's PTO timer MUST NOT be armed [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.2.1-1
test := newLossTest(t, serverSide, lossTestOpts{
maxDatagramSize: 1 << 20, // large initial congestion window
})
test.datagramReceived(1200)
test.send(initialSpace, 0, sentPacket{
ackEliciting: true,
inFlight: true,
size: 1200,
})
test.wantTimeout(999 * time.Millisecond)
t.Logf("PTO timer should be disabled when at the anti-amplification limit")
test.send(initialSpace, 1, sentPacket{
ackEliciting: false,
inFlight: true,
size: 2 * 1200,
})
test.wantNoTimeout()
// "When the server receives a datagram from the client, the amplification
// limit is increased and the server resets the PTO timer."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.2.1-2
t.Logf("PTO timer should be reset when datagrams are received")
test.datagramReceived(1200)
test.wantTimeout(999 * time.Millisecond)
// "If the PTO timer is then set to a time in the past, it is executed immediately."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.2.1-2
test.send(initialSpace, 2, sentPacket{
ackEliciting: true,
inFlight: true,
size: 3 * 1200,
})
test.wantNoTimeout()
t.Logf("resetting expired PTO timer should exeute immediately")
test.advance(1000 * time.Millisecond)
test.datagramReceived(1200)
test.wantPTOExpired()
test.wantNoTimeout()
}
func TestLossClientSetsPTOWhenHandshakeUnacked(t *testing.T) {
// "[...] the client MUST set the PTO timer if the client has not
// received an acknowledgment for any of its Handshake packets and
// the handshake is not confirmed [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.2.2.1-3
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(initialSpace, 0)
test.wantVar("smoothed_rtt", 333*time.Millisecond) // initial value
test.wantVar("rttvar", 333*time.Millisecond/2) // initial value
t.Logf("# PTO = smoothed_rtt + max(4*rttvar, 1ms)")
test.wantTimeout(999 * time.Millisecond)
test.advance(333 * time.Millisecond)
test.wantTimeout(666 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# PTO timer set for a client before handshake ack even if no packets in flight")
test.wantTimeout(999 * time.Millisecond)
test.advance(333 * time.Millisecond)
test.wantTimeout(666 * time.Millisecond)
}
func TestLossKeysDiscarded(t *testing.T) {
// "The sender MUST discard all recovery state associated with
// [packets in number spaces with discarded keys] and MUST remove
// them from the count of bytes in flight."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-6.4-1
test := newLossTest(t, clientSide, lossTestOpts{})
test.send(initialSpace, 0, testSentPacketSize(1200))
test.send(handshakeSpace, 0, testSentPacketSize(600))
test.wantVar("bytes_in_flight", 1800)
test.discardKeys(initialSpace)
test.wantVar("bytes_in_flight", 600)
test.discardKeys(handshakeSpace)
test.wantVar("bytes_in_flight", 0)
}
func TestLossInitialCongestionWindow(t *testing.T) {
// "Endpoints SHOULD use an initial congestion window of [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.2-1
// "[...] 10 times the maximum datagram size [...]"
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# congestion_window = 10*max_datagram_size (1200)")
test.wantVar("congestion_window", 12000)
// "[...] while limiting the window to the larger of 14720 bytes [...]"
test = newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1500,
})
t.Logf("# congestion_window limited to 14720 bytes")
test.wantVar("congestion_window", 14720)
// "[...] or twice the maximum datagram size."
test = newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 10000,
})
t.Logf("# congestion_window limited to 2*max_datagram_size (10000)")
test.wantVar("congestion_window", 20000)
for _, tc := range []struct {
maxDatagramSize int
wantInitialBurst int
}{{
// "[...] 10 times the maximum datagram size [...]"
maxDatagramSize: 1200,
wantInitialBurst: 12000,
}, {
// "[...] while limiting the window to the larger of 14720 bytes [...]"
maxDatagramSize: 1500,
wantInitialBurst: 14720,
}, {
// "[...] or twice the maximum datagram size."
maxDatagramSize: 10000,
wantInitialBurst: 20000,
}} {
t.Run(fmt.Sprintf("max_datagram_size=%v", tc.maxDatagramSize), func(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: tc.maxDatagramSize,
})
var num packetNumber
window := tc.wantInitialBurst
for window >= tc.maxDatagramSize {
t.Logf("# %v bytes of initial congestion window remain", window)
test.send(initialSpace, num, sentPacket{
ackEliciting: true,
inFlight: true,
size: tc.maxDatagramSize,
})
window -= tc.maxDatagramSize
num++
}
t.Logf("# congestion window (%v) < max_datagram_size, congestion control blocks send", window)
test.wantSendLimit(ccLimited)
})
}
}
func TestLossBytesInFlight(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# sent packets are added to bytes_in_flight")
test.wantVar("bytes_in_flight", 0)
test.send(initialSpace, 0, testSentPacketSize(1200))
test.wantVar("bytes_in_flight", 1200)
test.send(initialSpace, 1, testSentPacketSize(800))
test.wantVar("bytes_in_flight", 2000)
t.Logf("# acked packets are removed from bytes_in_flight")
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{1, 2})
test.wantAck(initialSpace, 1)
test.wantVar("bytes_in_flight", 1200)
t.Logf("# lost packets are removed from bytes_in_flight")
test.advanceToLossTimer()
test.wantLoss(initialSpace, 0)
test.wantVar("bytes_in_flight", 0)
}
func TestLossCongestionWindowLimit(t *testing.T) {
// "An endpoint MUST NOT send a packet if it would cause bytes_in_flight
// [...] to be larger than the congestion window [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7-7
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# consume the initial congestion window")
test.send(initialSpace, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, testSentPacketSize(1200))
test.wantSendLimit(ccLimited)
t.Logf("# give the pacer bucket time to refill")
test.advance(333 * time.Millisecond) // initial RTT
t.Logf("# sending limited by congestion window, not the pacer")
test.wantVar("congestion_window", 12000)
test.wantVar("bytes_in_flight", 12000)
test.wantVar("pacer_bucket", 12000)
test.wantSendLimit(ccLimited)
t.Logf("# receiving an ack opens up the congestion window")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.wantSendLimit(ccOK)
}
func TestLossCongestionStates(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# consume the initial congestion window")
test.send(initialSpace, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, testSentPacketSize(1200))
test.wantSendLimit(ccLimited)
test.wantVar("congestion_window", 12000)
// "While a sender is in slow start, the congestion window
// increases by the number of bytes acknowledged [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.1-2
test.advance(333 * time.Millisecond)
t.Logf("# congestion window increases by number of bytes acked (1200)")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
test.wantVar("congestion_window", 13200) // 12000 + 1200
t.Logf("# congestion window increases by number of bytes acked (2400)")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 3})
test.wantAck(initialSpace, 1, 2)
test.wantVar("congestion_window", 15600) // 12000 + 3*1200
// TODO: ECN-CE count
// "The sender MUST exit slow start and enter a recovery period
// when a packet is lost [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.1-3
t.Logf("# loss of a packet triggers entry to a recovery period")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{6, 7})
test.wantAck(initialSpace, 6)
test.wantLoss(initialSpace, 3)
// "On entering a recovery period, a sender MUST set the slow start
// threshold to half the value of the congestion window when loss is detected."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.2-2
t.Logf("# slow_start_threshold = congestion_window / 2")
test.wantVar("slow_start_threshold", 7800) // 15600/2
// "[...] a single packet can be sent prior to reduction [of the congestion window]."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.2-3
test.send(initialSpace, 10, testSentPacketSize(1200))
// "The congestion window MUST be set to the reduced value of the slow start
// threshold before exiting the recovery period."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.2-2
t.Logf("# congestion window reduced to slow start threshold")
test.wantVar("congestion_window", 7800)
t.Logf("# acks for packets sent before recovery started do not affect congestion")
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 10})
test.wantAck(initialSpace, 4, 5, 7, 8, 9)
test.wantVar("slow_start_threshold", 7800)
test.wantVar("congestion_window", 7800)
// "A recovery period ends and the sender enters congestion avoidance when
// a packet sent during the recovery period is acknowledged."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.2-5
t.Logf("# recovery ends and congestion avoidance begins when packet 10 is acked")
test.advance(333 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 11})
test.wantAck(initialSpace, 10)
// "[...] limit the increase to the congestion window to at most one
// maximum datagram size for each congestion window that is acknowledged."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.3-2
t.Logf("# after processing acks for one congestion window's worth of data...")
test.send(initialSpace, 11, 12, 13, 14, 15, 16, testSentPacketSize(1200))
test.advance(333 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 17})
test.wantAck(initialSpace, 11, 12, 13, 14, 15, 16)
t.Logf("# ...congestion window increases by max_datagram_size")
test.wantVar("congestion_window", 9000) // 7800 + 1200
// "The sender exits congestion avoidance and enters a recovery period
// when a packet is lost [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.3.3-3
test.send(initialSpace, 17, 18, 19, 20, 21, testSentPacketSize(1200))
test.advance(333 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{18, 21})
test.wantAck(initialSpace, 18, 19, 20)
test.wantLoss(initialSpace, 17)
t.Logf("# slow_start_threshold = congestion_window / 2")
test.wantVar("slow_start_threshold", 4500)
}
func TestLossMinimumCongestionWindow(t *testing.T) {
// "The RECOMMENDED [minimum congestion window] is 2 * max_datagram_size."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.2-4
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
test.send(initialSpace, 0, 1, 2, 3, testSentPacketSize(1200))
test.wantVar("congestion_window", 12000)
t.Logf("# enter recovery")
test.advance(333 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{3, 4})
test.wantAck(initialSpace, 3)
test.wantLoss(initialSpace, 0)
test.wantVar("congestion_window", 6000)
t.Logf("# enter congestion avoidance and return to recovery")
test.send(initialSpace, 4, 5, 6, 7)
test.advance(333 * time.Millisecond)
test.wantLoss(initialSpace, 1, 2)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{7, 8})
test.wantAck(initialSpace, 7)
test.wantLoss(initialSpace, 4)
test.wantVar("congestion_window", 3000)
t.Logf("# enter congestion avoidance and return to recovery")
test.send(initialSpace, 8, 9, 10, 11)
test.advance(333 * time.Millisecond)
test.wantLoss(initialSpace, 5, 6)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{11, 12})
test.wantAck(initialSpace, 11)
test.wantLoss(initialSpace, 8)
t.Logf("# congestion window does not fall below 2*max_datagram_size")
test.wantVar("congestion_window", 2400)
t.Logf("# enter congestion avoidance and return to recovery")
test.send(initialSpace, 12, 13, 14, 15)
test.advance(333 * time.Millisecond)
test.wantLoss(initialSpace, 9, 10)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{15, 16})
test.wantAck(initialSpace, 15)
test.wantLoss(initialSpace, 12)
t.Logf("# congestion window does not fall below 2*max_datagram_size")
test.wantVar("congestion_window", 2400)
}
func TestLossPersistentCongestion(t *testing.T) {
// "When persistent congestion is declared, the sender's congestion
// window MUST be reduced to the minimum congestion window [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.6.2-6
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
test.send(initialSpace, 0, testSentPacketSize(1200))
test.c.cc.setUnderutilized(nil, true)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# set rttvar for simplicity")
test.setRTTVar(0)
test.wantVar("smoothed_rtt", 10*time.Millisecond)
t.Logf("# persistent congestion duration = 3*(smoothed_rtt + timerGranularity + max_ack_delay)")
t.Logf("# persistent congestion duration = 108ms")
t.Logf("# sending packets 1-5 over 108ms")
test.send(initialSpace, 1, testSentPacketSize(1200))
test.advance(11 * time.Millisecond) // total 11ms
test.wantPTOExpired()
test.send(initialSpace, 2, testSentPacketSize(1200))
test.advance(22 * time.Millisecond) // total 33ms
test.wantPTOExpired()
test.send(initialSpace, 3, testSentPacketSize(1200))
test.advance(44 * time.Millisecond) // total 77ms
test.wantPTOExpired()
test.send(initialSpace, 4, testSentPacketSize(1200))
test.advance(31 * time.Millisecond) // total 108ms
test.send(initialSpace, 5, testSentPacketSize(1200))
t.Logf("# 108ms between packets 1-5")
test.wantVar("congestion_window", 12000)
t.Logf("# triggering loss of packets 1-5")
test.send(initialSpace, 6, 7, 8, testSentPacketSize(1200))
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{8, 9})
test.wantAck(initialSpace, 8)
test.wantLoss(initialSpace, 1, 2, 3, 4, 5)
t.Logf("# lost packets spanning persistent congestion duration")
t.Logf("# congestion_window = 2 * max_datagram_size (minimum)")
test.wantVar("congestion_window", 2400)
}
func TestLossSimplePersistentCongestion(t *testing.T) {
// Simpler version of TestLossPersistentCongestion which acts as a
// base for subsequent tests.
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# establish initial RTT sample")
test.send(initialSpace, 0, testSentPacketSize(1200))
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# send two packets spanning persistent congestion duration")
test.send(initialSpace, 1, testSentPacketSize(1200))
t.Logf("# 2000ms >> persistent congestion duration")
test.advance(2000 * time.Millisecond)
test.wantPTOExpired()
test.send(initialSpace, 2, testSentPacketSize(1200))
t.Logf("# trigger loss of previous packets")
test.advance(10 * time.Millisecond)
test.send(initialSpace, 3, testSentPacketSize(1200))
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{3, 4})
test.wantAck(initialSpace, 3)
test.wantLoss(initialSpace, 1, 2)
t.Logf("# persistent congestion detected")
test.wantVar("congestion_window", 2400)
}
func TestLossPersistentCongestionAckElicitingPackets(t *testing.T) {
// "These two packets MUST be ack-eliciting [...]"
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.6.2-3
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# establish initial RTT sample")
test.send(initialSpace, 0, testSentPacketSize(1200))
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# send two packets spanning persistent congestion duration")
test.send(initialSpace, 1, testSentPacketSize(1200))
t.Logf("# 2000ms >> persistent congestion duration")
test.advance(2000 * time.Millisecond)
test.wantPTOExpired()
test.send(initialSpace, 2, sentPacket{
inFlight: true,
ackEliciting: false,
size: 1200,
})
test.send(initialSpace, 3, testSentPacketSize(1200)) // PTO probe
t.Logf("# trigger loss of previous packets")
test.advance(10 * time.Millisecond)
test.send(initialSpace, 4, testSentPacketSize(1200))
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{3, 5})
test.wantAck(initialSpace, 3)
test.wantAck(initialSpace, 4)
test.wantLoss(initialSpace, 1, 2)
t.Logf("# persistent congestion not detected: packet 2 is not ack-eliciting")
test.wantVar("congestion_window", (12000+1200+1200-1200)/2)
}
func TestLossNoPersistentCongestionWithoutRTTSample(t *testing.T) {
// "The persistent congestion period SHOULD NOT start until there
// is at least one RTT sample."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.6.2-4
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# packets sent before initial RTT sample")
test.send(initialSpace, 0, testSentPacketSize(1200))
test.advance(2000 * time.Millisecond)
test.wantPTOExpired()
test.send(initialSpace, 1, testSentPacketSize(1200))
test.advance(10 * time.Millisecond)
test.send(initialSpace, 2, testSentPacketSize(1200))
t.Logf("# first ack establishes RTT sample")
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{2, 3})
test.wantAck(initialSpace, 2)
test.wantLoss(initialSpace, 0, 1)
t.Logf("# loss of packets before initial RTT sample does not cause persistent congestion")
test.wantVar("congestion_window", 12000/2)
}
func TestLossPacerRefillRate(t *testing.T) {
// "A sender SHOULD pace sending of all in-flight packets based on
// input from the congestion controller."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.7-1
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# consume the initial congestion window")
test.send(initialSpace, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, testSentPacketSize(1200))
test.wantSendLimit(ccLimited)
test.wantVar("pacer_bucket", 0)
test.wantVar("congestion_window", 12000)
t.Logf("# first RTT sample establishes smoothed_rtt")
rtt := 100 * time.Millisecond
test.advance(rtt)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 10})
test.wantAck(initialSpace, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9)
test.wantVar("congestion_window", 24000) // 12000 + 10*1200
test.wantVar("smoothed_rtt", rtt)
t.Logf("# advance 1 RTT to let the pacer bucket refill completely")
test.advance(100 * time.Millisecond)
t.Logf("# pacer_bucket = initial_congestion_window")
test.wantVar("pacer_bucket", 12000)
t.Logf("# consume capacity from the pacer bucket")
test.send(initialSpace, 10, testSentPacketSize(1200))
test.wantVar("pacer_bucket", 10800) // 12000 - 1200
test.send(initialSpace, 11, testSentPacketSize(600))
test.wantVar("pacer_bucket", 10200) // 10800 - 600
test.send(initialSpace, 12, testSentPacketSize(600))
test.wantVar("pacer_bucket", 9600) // 10200 - 600
test.send(initialSpace, 13, 14, 15, 16, testSentPacketSize(1200))
test.wantVar("pacer_bucket", 4800) // 9600 - 4*1200
t.Logf("# advance 1/10 of an RTT, bucket refills")
test.advance(rtt / 10)
t.Logf("# pacer_bucket += 1.25 * (1/10) * congestion_window")
t.Logf("# += 3000")
test.wantVar("pacer_bucket", 7800)
}
func TestLossPacerNextSendTime(t *testing.T) {
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
t.Logf("# consume the initial congestion window")
test.send(initialSpace, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, testSentPacketSize(1200))
test.wantSendLimit(ccLimited)
test.wantVar("pacer_bucket", 0)
test.wantVar("congestion_window", 12000)
t.Logf("# first RTT sample establishes smoothed_rtt")
rtt := 100 * time.Millisecond
test.advance(rtt)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 10})
test.wantAck(initialSpace, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9)
test.wantVar("congestion_window", 24000) // 12000 + 10*1200
test.wantVar("smoothed_rtt", rtt)
t.Logf("# advance 1 RTT to let the pacer bucket refill completely")
test.advance(100 * time.Millisecond)
t.Logf("# pacer_bucket = initial_congestion_window")
test.wantVar("pacer_bucket", 12000)
t.Logf("# consume the refilled pacer bucket")
test.send(initialSpace, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, testSentPacketSize(1200))
test.wantSendLimit(ccPaced)
t.Logf("# refill rate = 1.25 * congestion_window / rtt")
test.wantSendDelay(rtt / 25) // rtt / (1.25 * 24000 / 1200)
t.Logf("# no capacity available yet")
test.advance(rtt / 50)
test.wantVar("pacer_bucket", -600)
test.wantSendLimit(ccPaced)
t.Logf("# capacity available")
test.advance(rtt / 50)
test.wantVar("pacer_bucket", 0)
test.wantSendLimit(ccOK)
}
func TestLossCongestionWindowUnderutilized(t *testing.T) {
// "When bytes in flight is smaller than the congestion window
// and sending is not pacing limited [...] the congestion window
// SHOULD NOT be increased in either slow start or congestion avoidance."
// https://www.rfc-editor.org/rfc/rfc9002.html#section-7.8-1
test := newLossTest(t, clientSide, lossTestOpts{
maxDatagramSize: 1200,
})
test.send(initialSpace, 0, testSentPacketSize(1200))
test.setUnderutilized(true)
t.Logf("# underutilized: %v", test.c.cc.underutilized)
test.wantVar("congestion_window", 12000)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 1})
test.wantAck(initialSpace, 0)
t.Logf("# congestion window does not increase, because window is underutilized")
test.wantVar("congestion_window", 12000)
t.Logf("# refill pacer bucket")
test.advance(10 * time.Millisecond)
test.wantVar("pacer_bucket", 12000)
test.send(initialSpace, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, testSentPacketSize(1200))
test.setUnderutilized(false)
test.advance(10 * time.Millisecond)
test.ack(initialSpace, 0*time.Millisecond, i64range[packetNumber]{0, 11})
test.wantAck(initialSpace, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
t.Logf("# congestion window increases")
test.wantVar("congestion_window", 24000)
}
type lossTest struct {
t *testing.T
c lossState
now time.Time
fates map[spaceNum]packetFate
failed bool
}
type lossTestOpts struct {
maxDatagramSize int
}
func newLossTest(t *testing.T, side connSide, opts lossTestOpts) *lossTest {
c := &lossTest{
t: t,
now: time.Date(2000, 1, 1, 0, 0, 0, 0, time.UTC),
fates: make(map[spaceNum]packetFate),
}
maxDatagramSize := 1200
if opts.maxDatagramSize != 0 {
maxDatagramSize = opts.maxDatagramSize
}
c.c.init(side, maxDatagramSize, c.now)
t.Cleanup(func() {
if !c.failed {
c.checkUnexpectedEvents()
}
})
return c
}
type spaceNum struct {
space numberSpace
num packetNumber
}
func (c *lossTest) checkUnexpectedEvents() {
c.t.Helper()
for sn, fate := range c.fates {
c.t.Errorf("ERROR: unexpected %v: %v %v", fate, sn.space, sn.num)
}
if c.c.ptoExpired {
c.t.Errorf("ERROR: PTO timer unexpectedly expired")
}
}
func (c *lossTest) setSmoothedRTT(d time.Duration) {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("set smoothed_rtt to %v", d)
c.c.rtt.smoothedRTT = d
}
func (c *lossTest) setRTTVar(d time.Duration) {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("set rttvar to %v", d)
c.c.rtt.rttvar = d
}
func (c *lossTest) setUnderutilized(v bool) {
c.t.Logf("set congestion window underutilized: %v", v)
c.c.cc.setUnderutilized(nil, v)
}
func (c *lossTest) advance(d time.Duration) {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("advance time %v", d)
c.now = c.now.Add(d)
c.c.advance(c.now, c.onAckOrLoss)
}
func (c *lossTest) advanceToLossTimer() {
c.t.Helper()
c.checkUnexpectedEvents()
d := c.c.timer.Sub(c.now)
c.t.Logf("advance time %v (up to loss timer)", d)
if d < 0 {
c.t.Fatalf("loss timer is in the past")
}
c.now = c.c.timer
c.c.advance(c.now, c.onAckOrLoss)
}
type testSentPacketSize int
func (c *lossTest) send(spaceID numberSpace, opts ...any) {
c.t.Helper()
c.checkUnexpectedEvents()
var nums []packetNumber
prototype := sentPacket{
ackEliciting: true,
inFlight: true,
}
for _, o := range opts {
switch o := o.(type) {
case sentPacket:
prototype = o
case testSentPacketSize:
prototype.size = int(o)
case int:
nums = append(nums, packetNumber(o))
case packetNumber:
nums = append(nums, o)
case i64range[packetNumber]:
for num := o.start; num < o.end; num++ {
nums = append(nums, num)
}
}
}
c.t.Logf("send %v %v", spaceID, nums)
limit, _ := c.c.sendLimit(c.now)
if prototype.inFlight && limit != ccOK {
c.t.Fatalf("congestion control blocks sending packet")
}
if !prototype.inFlight && limit == ccBlocked {
c.t.Fatalf("congestion control blocks sending packet")
}
for _, num := range nums {
sent := &sentPacket{}
*sent = prototype
sent.num = num
c.c.packetSent(c.now, nil, spaceID, sent)
}
}
func (c *lossTest) datagramReceived(size int) {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("receive %v-byte datagram", size)
c.c.datagramReceived(c.now, size)
}
func (c *lossTest) ack(spaceID numberSpace, ackDelay time.Duration, rs ...i64range[packetNumber]) {
c.t.Helper()
c.checkUnexpectedEvents()
c.c.receiveAckStart()
var acked rangeset[packetNumber]
for _, r := range rs {
c.t.Logf("ack %v delay=%v [%v,%v)", spaceID, ackDelay, r.start, r.end)
acked.add(r.start, r.end)
}
for i, r := range rs {
c.t.Logf("ack %v delay=%v [%v,%v)", spaceID, ackDelay, r.start, r.end)
c.c.receiveAckRange(c.now, spaceID, i, r.start, r.end, c.onAckOrLoss)
}
c.c.receiveAckEnd(c.now, nil, spaceID, ackDelay, c.onAckOrLoss)
}
func (c *lossTest) onAckOrLoss(space numberSpace, sent *sentPacket, fate packetFate) {
c.t.Logf("%v %v %v", fate, space, sent.num)
if _, ok := c.fates[spaceNum{space, sent.num}]; ok {
c.t.Errorf("ERROR: duplicate %v for %v %v", fate, space, sent.num)
}
c.fates[spaceNum{space, sent.num}] = fate
}
func (c *lossTest) confirmHandshake() {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("confirm handshake")
c.c.confirmHandshake()
}
func (c *lossTest) validateClientAddress() {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("validate client address")
c.c.validateClientAddress()
}
func (c *lossTest) discardKeys(spaceID numberSpace) {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("discard %s keys", spaceID)
c.c.discardKeys(c.now, nil, spaceID)
}
func (c *lossTest) setMaxAckDelay(d time.Duration) {
c.t.Helper()
c.checkUnexpectedEvents()
c.t.Logf("set max_ack_delay = %v", d)
c.c.setMaxAckDelay(d)
}
func (c *lossTest) wantAck(spaceID numberSpace, nums ...packetNumber) {
c.t.Helper()
for _, num := range nums {
if c.fates[spaceNum{spaceID, num}] != packetAcked {
c.t.Fatalf("expected ack for %v %v\n", spaceID, num)
}
delete(c.fates, spaceNum{spaceID, num})
}
}
func (c *lossTest) wantLoss(spaceID numberSpace, nums ...packetNumber) {
c.t.Helper()
for _, num := range nums {
if c.fates[spaceNum{spaceID, num}] != packetLost {
c.t.Fatalf("expected loss of %v %v\n", spaceID, num)
}
delete(c.fates, spaceNum{spaceID, num})
}
}
func (c *lossTest) wantPTOExpired() {
c.t.Helper()
if !c.c.ptoExpired {
c.t.Fatalf("expected PTO timer to expire")
} else {
c.t.Logf("PTO TIMER EXPIRED")
}
c.c.ptoExpired = false
}
func (l ccLimit) String() string {
switch l {
case ccOK:
return "ccOK"
case ccBlocked:
return "ccBlocked"
case ccLimited:
return "ccLimited"
case ccPaced:
return "ccPaced"
}
return "BUG"
}
func (c *lossTest) wantSendLimit(want ccLimit) {
c.t.Helper()
if got, _ := c.c.sendLimit(c.now); got != want {
c.t.Fatalf("congestion control send limit is %v, want %v", got, want)
}
}
func (c *lossTest) wantSendDelay(want time.Duration) {
c.t.Helper()
limit, next := c.c.sendLimit(c.now)
if limit != ccPaced {
c.t.Fatalf("congestion control limit is %v, want %v", limit, ccPaced)
}
got := next.Sub(c.now)
if got != want {
c.t.Fatalf("delay until next send is %v, want %v", got, want)
}
}
func (c *lossTest) wantVar(name string, want any) {
c.t.Helper()
var got any
switch name {
case "latest_rtt":
got = c.c.rtt.latestRTT
case "min_rtt":
got = c.c.rtt.minRTT
case "smoothed_rtt":
got = c.c.rtt.smoothedRTT
case "rttvar":
got = c.c.rtt.rttvar
case "congestion_window":
got = c.c.cc.congestionWindow
case "slow_start_threshold":
got = c.c.cc.slowStartThreshold
case "bytes_in_flight":
got = c.c.cc.bytesInFlight
case "pacer_bucket":
got = c.c.pacer.bucket
default:
c.t.Fatalf("unknown var %q", name)
}
if got != want {
c.t.Fatalf("%v = %v, want %v\n", name, got, want)
} else {
c.t.Logf("%v = %v", name, got)
}
}
func (c *lossTest) wantTimeout(want time.Duration) {
c.t.Helper()
if c.c.timer.IsZero() {
c.t.Fatalf("loss detection timer is not set, want %v", want)
}
got := c.c.timer.Sub(c.now)
if got != want {
c.t.Fatalf("loss detection timer expires in %v, want %v", got, want)
}
c.t.Logf("loss detection timer expires in %v", got)
}
func (c *lossTest) wantNoTimeout() {
c.t.Helper()
if !c.c.timer.IsZero() {
d := c.c.timer.Sub(c.now)
c.t.Fatalf("loss detection timer expires in %v, want not set", d)
}
c.t.Logf("loss detection timer is not set")
}
func (f packetFate) String() string {
switch f {
case packetAcked:
return "ACK"
case packetLost:
return "LOSS"
default:
panic("unknown packetFate")
}
}
|