OLD | NEW |
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "net/quic/test_tools/quic_test_utils.h" | 5 #include "net/quic/test_tools/quic_test_utils.h" |
6 | 6 |
7 #include "base/sha1.h" | 7 #include "base/sha1.h" |
8 #include "base/stl_util.h" | 8 #include "base/stl_util.h" |
9 #include "base/strings/string_number_conversions.h" | 9 #include "base/strings/string_number_conversions.h" |
10 #include "net/quic/crypto/crypto_framer.h" | 10 #include "net/quic/crypto/crypto_framer.h" |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
51 ack.largest_observed = largest_observed; | 51 ack.largest_observed = largest_observed; |
52 ack.entropy_hash = 0; | 52 ack.entropy_hash = 0; |
53 return ack; | 53 return ack; |
54 } | 54 } |
55 | 55 |
56 QuicAckFrame MakeAckFrameWithNackRanges(size_t num_nack_ranges, | 56 QuicAckFrame MakeAckFrameWithNackRanges(size_t num_nack_ranges, |
57 QuicPacketNumber least_unacked) { | 57 QuicPacketNumber least_unacked) { |
58 QuicAckFrame ack = MakeAckFrame(2 * num_nack_ranges + least_unacked); | 58 QuicAckFrame ack = MakeAckFrame(2 * num_nack_ranges + least_unacked); |
59 // Add enough missing packets to get num_nack_ranges nack ranges. | 59 // Add enough missing packets to get num_nack_ranges nack ranges. |
60 for (QuicPacketNumber i = 1; i < 2 * num_nack_ranges; i += 2) { | 60 for (QuicPacketNumber i = 1; i < 2 * num_nack_ranges; i += 2) { |
61 ack.missing_packets.insert(least_unacked + i); | 61 ack.missing_packets.Add(least_unacked + i); |
62 } | 62 } |
63 return ack; | 63 return ack; |
64 } | 64 } |
65 | 65 |
66 QuicPacket* BuildUnsizedDataPacket(QuicFramer* framer, | 66 QuicPacket* BuildUnsizedDataPacket(QuicFramer* framer, |
67 const QuicPacketHeader& header, | 67 const QuicPacketHeader& header, |
68 const QuicFrames& frames) { | 68 const QuicFrames& frames) { |
69 const size_t max_plaintext_size = framer->GetMaxPlaintextSize(kMaxPacketSize); | 69 const size_t max_plaintext_size = framer->GetMaxPlaintextSize(kMaxPacketSize); |
70 size_t packet_size = GetPacketHeaderSize(header); | 70 size_t packet_size = GetPacketHeaderSize(header); |
71 for (size_t i = 0; i < frames.size(); ++i) { | 71 for (size_t i = 0; i < frames.size(); ++i) { |
(...skipping 754 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
826 *server_session = new TestQuicSpdyServerSession( | 826 *server_session = new TestQuicSpdyServerSession( |
827 *server_connection, DefaultQuicConfig(), server_crypto_config); | 827 *server_connection, DefaultQuicConfig(), server_crypto_config); |
828 | 828 |
829 // We advance the clock initially because the default time is zero and the | 829 // We advance the clock initially because the default time is zero and the |
830 // strike register worries that we've just overflowed a uint32 time. | 830 // strike register worries that we've just overflowed a uint32 time. |
831 (*server_connection)->AdvanceTime(connection_start_time); | 831 (*server_connection)->AdvanceTime(connection_start_time); |
832 } | 832 } |
833 | 833 |
834 } // namespace test | 834 } // namespace test |
835 } // namespace net | 835 } // namespace net |
OLD | NEW |