| Index: net/quic/quic_framer_test.cc
|
| diff --git a/net/quic/quic_framer_test.cc b/net/quic/quic_framer_test.cc
|
| index 82fabaef768903c180a0694fd3cc81a979493fa6..2b8832c5b9eae905d4209536588c2d6a5194b658 100644
|
| --- a/net/quic/quic_framer_test.cc
|
| +++ b/net/quic/quic_framer_test.cc
|
| @@ -225,13 +225,11 @@ class QuicFramerTest : public ::testing::Test {
|
| EXPECT_EQ(error_code, framer_.error()) << "len: " << len;
|
| }
|
|
|
| - void ValidateTruncatedAck(const QuicAckFrame* ack, int keys) {
|
| - for (int i = 1; i < keys; ++i) {
|
| + void ValidateTruncatedAck(const QuicAckFrame* ack, size_t keys) {
|
| + for (size_t i = 1; i < keys; ++i) {
|
| EXPECT_TRUE(ContainsKey(ack->received_info.missing_packets, i)) << i;
|
| }
|
| - // With no gaps in the missing packets, we can't admit to having received
|
| - // anything.
|
| - EXPECT_EQ(0u, ack->received_info.largest_received);
|
| + EXPECT_EQ(keys, ack->received_info.largest_observed);
|
| }
|
|
|
| test::TestEncrypter* encrypter_;
|
| @@ -559,7 +557,7 @@ TEST_F(QuicFramerTest, AckFrame) {
|
| // least packet sequence number awaiting an ack
|
| 0xA0, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| - // largest received packet sequence number
|
| + // largest observed packet sequence number
|
| 0xBF, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| // num missing packets
|
| @@ -579,7 +577,7 @@ TEST_F(QuicFramerTest, AckFrame) {
|
| EXPECT_EQ(0u, visitor_.stream_frames_.size());
|
| ASSERT_EQ(1u, visitor_.ack_frames_.size());
|
| const QuicAckFrame& frame = *visitor_.ack_frames_[0];
|
| - EXPECT_EQ(GG_UINT64_C(0x0123456789ABF), frame.received_info.largest_received);
|
| + EXPECT_EQ(GG_UINT64_C(0x0123456789ABF), frame.received_info.largest_observed);
|
| ASSERT_EQ(1u, frame.received_info.missing_packets.size());
|
| SequenceSet::const_iterator missing_iter =
|
| frame.received_info.missing_packets.begin();
|
| @@ -596,7 +594,7 @@ TEST_F(QuicFramerTest, AckFrame) {
|
| } else if (i < 8) {
|
| expected_error = "Unable to read least unacked.";
|
| } else if (i < 14) {
|
| - expected_error = "Unable to read largest received.";
|
| + expected_error = "Unable to read largest observed.";
|
| } else if (i < 15) {
|
| expected_error = "Unable to read num missing packets.";
|
| } else if (i < 21) {
|
| @@ -946,7 +944,7 @@ TEST_F(QuicFramerTest, ConnectionCloseFrame) {
|
| // least packet sequence number awaiting an ack
|
| 0xA0, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| - // largest received packet sequence number
|
| + // largest observed packet sequence number
|
| 0xBF, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| // num missing packets
|
| @@ -978,7 +976,7 @@ TEST_F(QuicFramerTest, ConnectionCloseFrame) {
|
|
|
| ASSERT_EQ(1u, visitor_.ack_frames_.size());
|
| const QuicAckFrame& frame = *visitor_.ack_frames_[0];
|
| - EXPECT_EQ(GG_UINT64_C(0x0123456789ABF), frame.received_info.largest_received);
|
| + EXPECT_EQ(GG_UINT64_C(0x0123456789ABF), frame.received_info.largest_observed);
|
| ASSERT_EQ(1u, frame.received_info.missing_packets.size());
|
| SequenceSet::const_iterator missing_iter =
|
| frame.received_info.missing_packets.begin();
|
| @@ -1100,7 +1098,7 @@ TEST_F(QuicFramerTest, ConstructAckFramePacket) {
|
| header.fec_group = 0;
|
|
|
| QuicAckFrame ack_frame;
|
| - ack_frame.received_info.largest_received = GG_UINT64_C(0x0123456789ABF);
|
| + ack_frame.received_info.largest_observed = GG_UINT64_C(0x0123456789ABF);
|
| ack_frame.received_info.missing_packets.insert(GG_UINT64_C(0x0123456789ABE));
|
| ack_frame.sent_info.least_unacked = GG_UINT64_C(0x0123456789AA0);
|
|
|
| @@ -1126,7 +1124,7 @@ TEST_F(QuicFramerTest, ConstructAckFramePacket) {
|
| // least packet sequence number awaiting an ack
|
| 0xA0, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| - // largest received packet sequence number
|
| + // largest observed packet sequence number
|
| 0xBF, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| // num missing packets
|
| @@ -1389,7 +1387,7 @@ TEST_F(QuicFramerTest, ConstructCloseFramePacket) {
|
| close_frame.error_details = "because I can";
|
|
|
| QuicAckFrame* ack_frame = &close_frame.ack_frame;
|
| - ack_frame->received_info.largest_received = GG_UINT64_C(0x0123456789ABF);
|
| + ack_frame->received_info.largest_observed = GG_UINT64_C(0x0123456789ABF);
|
| ack_frame->received_info.missing_packets.insert(GG_UINT64_C(0x0123456789ABE));
|
| ack_frame->sent_info.least_unacked = GG_UINT64_C(0x0123456789AA0);
|
|
|
| @@ -1426,7 +1424,7 @@ TEST_F(QuicFramerTest, ConstructCloseFramePacket) {
|
| // least packet sequence number awaiting an ack
|
| 0xA0, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| - // largest received packet sequence number
|
| + // largest observed packet sequence number
|
| 0xBF, 0x9A, 0x78, 0x56,
|
| 0x34, 0x12,
|
| // num missing packets
|
| @@ -1523,45 +1521,17 @@ TEST_F(QuicFramerTest, DISABLED_CalculateLargestReceived) {
|
| missing.insert(1);
|
| missing.insert(5);
|
| missing.insert(7);
|
| - missing.insert(8);
|
| - missing.insert(9);
|
|
|
| // These two we just walk to the next gap, and return the largest seen.
|
| - EXPECT_EQ(4u, QuicFramer::CalculateLargestReceived(missing, missing.find(1)));
|
| - EXPECT_EQ(6u, QuicFramer::CalculateLargestReceived(missing, missing.find(5)));
|
| + EXPECT_EQ(4u, QuicFramer::CalculateLargestObserved(missing, missing.find(1)));
|
| + EXPECT_EQ(6u, QuicFramer::CalculateLargestObserved(missing, missing.find(5)));
|
|
|
| missing.insert(2);
|
| - // For 1, we can't go forward as 2 would be implicitly acked. We must go
|
| - // backwards.
|
| - EXPECT_EQ(0u, QuicFramer::CalculateLargestReceived(missing, missing.find(1)));
|
| - // For 2, we've seen 3 and 4, so can admit to a largest received.
|
| - EXPECT_EQ(4u, QuicFramer::CalculateLargestReceived(missing, missing.find(2)));
|
| -
|
| - // 7+ are fun because there is no subsequent gap: we have to walk before
|
| - // them to find 6.
|
| - EXPECT_EQ(6u, QuicFramer::CalculateLargestReceived(missing, missing.find(7)));
|
| - EXPECT_EQ(6u, QuicFramer::CalculateLargestReceived(missing, missing.find(8)));
|
| - EXPECT_EQ(6u, QuicFramer::CalculateLargestReceived(missing, missing.find(9)));
|
| -
|
| - // Fill in the gap of 6 to make sure we handle a gap of more than 1 by
|
| - // returning 4 rather than 3.
|
| - missing.insert(6);
|
| - EXPECT_EQ(4u, QuicFramer::CalculateLargestReceived(missing, missing.find(9)));
|
| -
|
| - // Fill in the rest of the gaps: we should walk to 1 and return 0.
|
| - missing.insert(4);
|
| - missing.insert(3);
|
| - missing.insert(2);
|
| - EXPECT_EQ(0u, QuicFramer::CalculateLargestReceived(missing, missing.find(7)));
|
| -
|
| - // If we add a gap after 7-9, we will return that only for 9.
|
| - missing.insert(11);
|
| - EXPECT_EQ(0u, QuicFramer::CalculateLargestReceived(missing,
|
| - missing.find(7)));
|
| - EXPECT_EQ(0u, QuicFramer::CalculateLargestReceived(missing,
|
| - missing.find(8)));
|
| - EXPECT_EQ(10u, QuicFramer::CalculateLargestReceived(missing,
|
| - missing.find(9)));
|
| + // For 1, we can't go forward as 2 would be implicitly acked so we return the
|
| + // largest missing packet.
|
| + EXPECT_EQ(1u, QuicFramer::CalculateLargestObserved(missing, missing.find(1)));
|
| + // For 2, we've seen 3 and 4, so can admit to a largest observed.
|
| + EXPECT_EQ(4u, QuicFramer::CalculateLargestObserved(missing, missing.find(2)));
|
| }
|
|
|
| TEST_F(QuicFramerTest, Truncation) {
|
| @@ -1575,8 +1545,8 @@ TEST_F(QuicFramerTest, Truncation) {
|
| QuicAckFrame* ack_frame = &close_frame.ack_frame;
|
| close_frame.error_code = static_cast<QuicErrorCode>(0x05060708);
|
| close_frame.error_details = "because I can";
|
| - ack_frame->received_info.largest_received = 201;
|
| - for (uint64 i = 1; i < ack_frame->received_info.largest_received; ++i) {
|
| + ack_frame->received_info.largest_observed = 201;
|
| + for (uint64 i = 1; i < ack_frame->received_info.largest_observed; ++i) {
|
| ack_frame->received_info.missing_packets.insert(i);
|
| }
|
|
|
| @@ -1622,8 +1592,8 @@ TEST_F(QuicFramerTest, Truncation) {
|
| EXPECT_EQ(0x05060708, visitor_.connection_close_frame_.error_code);
|
| EXPECT_EQ("because I can", visitor_.connection_close_frame_.error_details);
|
|
|
| - ValidateTruncatedAck(visitor_.ack_frames_[0], 190);
|
| - ValidateTruncatedAck(&visitor_.connection_close_frame_.ack_frame, 180);
|
| + ValidateTruncatedAck(visitor_.ack_frames_[0], 194);
|
| + ValidateTruncatedAck(&visitor_.connection_close_frame_.ack_frame, 191);
|
| }
|
|
|
| } // namespace test
|
|
|