OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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/tools/quic/test_tools/packet_dropping_test_writer.h" | 5 #include "net/tools/quic/test_tools/packet_dropping_test_writer.h" |
6 | 6 |
7 #include <limits> | 7 #include <limits> |
8 | 8 |
9 #include "base/rand_util.h" | 9 #include "base/rand_util.h" |
10 #include "net/quic/platform/api/quic_logging.h" | 10 #include "net/quic/platform/api/quic_logging.h" |
(...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
174 // Determine if we should re-order. | 174 // Determine if we should re-order. |
175 if (delayed_packets_.size() > 1 && fake_packet_reorder_percentage_ > 0 && | 175 if (delayed_packets_.size() > 1 && fake_packet_reorder_percentage_ > 0 && |
176 simple_random_.RandUint64() % 100 < | 176 simple_random_.RandUint64() % 100 < |
177 static_cast<uint64_t>(fake_packet_reorder_percentage_)) { | 177 static_cast<uint64_t>(fake_packet_reorder_percentage_)) { |
178 QUIC_DLOG(INFO) << "Reordering packets."; | 178 QUIC_DLOG(INFO) << "Reordering packets."; |
179 ++iter; | 179 ++iter; |
180 // Swap the send times when re-ordering packets. | 180 // Swap the send times when re-ordering packets. |
181 delayed_packets_.begin()->send_time = iter->send_time; | 181 delayed_packets_.begin()->send_time = iter->send_time; |
182 } | 182 } |
183 | 183 |
184 QUIC_DLOG(INFO) << "Releasing packet. " << (delayed_packets_.size() - 1) | 184 QUIC_DVLOG(1) << "Releasing packet. " << (delayed_packets_.size() - 1) |
185 << " remaining."; | 185 << " remaining."; |
186 // Grab the next one off the queue and send it. | 186 // Grab the next one off the queue and send it. |
187 QuicPacketWriterWrapper::WritePacket( | 187 QuicPacketWriterWrapper::WritePacket( |
188 iter->buffer.data(), iter->buffer.length(), iter->self_address, | 188 iter->buffer.data(), iter->buffer.length(), iter->self_address, |
189 iter->peer_address, iter->options.get()); | 189 iter->peer_address, iter->options.get()); |
190 DCHECK_GE(cur_buffer_size_, iter->buffer.length()); | 190 DCHECK_GE(cur_buffer_size_, iter->buffer.length()); |
191 cur_buffer_size_ -= iter->buffer.length(); | 191 cur_buffer_size_ -= iter->buffer.length(); |
192 delayed_packets_.erase(iter); | 192 delayed_packets_.erase(iter); |
193 | 193 |
194 // If there are others, find the time for the next to be sent. | 194 // If there are others, find the time for the next to be sent. |
195 if (delayed_packets_.empty()) { | 195 if (delayed_packets_.empty()) { |
(...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
238 // IPAddress has no move assignment operator. | 238 // IPAddress has no move assignment operator. |
239 // | 239 // |
240 // PacketDroppingTestWriter::DelayedWrite& | 240 // PacketDroppingTestWriter::DelayedWrite& |
241 // PacketDroppingTestWriter::DelayedWrite::operator=( | 241 // PacketDroppingTestWriter::DelayedWrite::operator=( |
242 // PacketDroppingTestWriter::DelayedWrite&& other) = default; | 242 // PacketDroppingTestWriter::DelayedWrite&& other) = default; |
243 | 243 |
244 PacketDroppingTestWriter::DelayedWrite::~DelayedWrite() {} | 244 PacketDroppingTestWriter::DelayedWrite::~DelayedWrite() {} |
245 | 245 |
246 } // namespace test | 246 } // namespace test |
247 } // namespace net | 247 } // namespace net |
OLD | NEW |