| 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/core/quic_framer.h" | 5 #include "net/quic/core/quic_framer.h" |
| 6 | 6 |
| 7 #include <cstdint> | 7 #include <cstdint> |
| 8 #include <memory> | 8 #include <memory> |
| 9 #include <vector> | 9 #include <vector> |
| 10 | 10 |
| 11 #include "base/compiler_specific.h" | 11 #include "base/compiler_specific.h" |
| 12 #include "base/logging.h" | 12 #include "base/logging.h" |
| 13 #include "base/memory/ptr_util.h" | 13 #include "base/memory/ptr_util.h" |
| 14 #include "base/stl_util.h" | 14 #include "base/stl_util.h" |
| 15 #include "net/quic/core/crypto/crypto_framer.h" | 15 #include "net/quic/core/crypto/crypto_framer.h" |
| 16 #include "net/quic/core/crypto/crypto_handshake_message.h" | 16 #include "net/quic/core/crypto/crypto_handshake_message.h" |
| 17 #include "net/quic/core/crypto/crypto_protocol.h" | 17 #include "net/quic/core/crypto/crypto_protocol.h" |
| 18 #include "net/quic/core/crypto/quic_decrypter.h" | 18 #include "net/quic/core/crypto/quic_decrypter.h" |
| 19 #include "net/quic/core/crypto/quic_encrypter.h" | 19 #include "net/quic/core/crypto/quic_encrypter.h" |
| 20 #include "net/quic/core/quic_bug_tracker.h" | 20 #include "net/quic/core/quic_bug_tracker.h" |
| 21 #include "net/quic/core/quic_data_reader.h" | 21 #include "net/quic/core/quic_data_reader.h" |
| 22 #include "net/quic/core/quic_data_writer.h" | 22 #include "net/quic/core/quic_data_writer.h" |
| 23 #include "net/quic/core/quic_flags.h" | 23 #include "net/quic/core/quic_flags.h" |
| 24 #include "net/quic/core/quic_socket_address_coder.h" | 24 #include "net/quic/core/quic_socket_address_coder.h" |
| 25 #include "net/quic/core/quic_utils.h" | 25 #include "net/quic/core/quic_utils.h" |
| 26 | 26 |
| 27 using base::ContainsKey; | 27 using base::ContainsKey; |
| 28 using base::StringPiece; | 28 using base::StringPiece; |
| 29 using std::map; | |
| 30 using std::max; | 29 using std::max; |
| 31 using std::min; | 30 using std::min; |
| 32 using std::numeric_limits; | |
| 33 using std::string; | 31 using std::string; |
| 34 using std::vector; | |
| 35 #define PREDICT_FALSE(x) (x) | 32 #define PREDICT_FALSE(x) (x) |
| 36 | 33 |
| 37 namespace net { | 34 namespace net { |
| 38 | 35 |
| 39 namespace { | 36 namespace { |
| 40 | 37 |
| 41 // Mask to select the lowest 48 bits of a packet number. | 38 // Mask to select the lowest 48 bits of a packet number. |
| 42 const QuicPacketNumber k6ByteSequenceNumberMask = UINT64_C(0x0000FFFFFFFFFFFF); | 39 const QuicPacketNumber k6ByteSequenceNumberMask = UINT64_C(0x0000FFFFFFFFFFFF); |
| 43 const QuicPacketNumber k4ByteSequenceNumberMask = UINT64_C(0x00000000FFFFFFFF); | 40 const QuicPacketNumber k4ByteSequenceNumberMask = UINT64_C(0x00000000FFFFFFFF); |
| 44 const QuicPacketNumber k2ByteSequenceNumberMask = UINT64_C(0x000000000000FFFF); | 41 const QuicPacketNumber k2ByteSequenceNumberMask = UINT64_C(0x000000000000FFFF); |
| (...skipping 945 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 990 const QuicAckFrame& frame) { | 987 const QuicAckFrame& frame) { |
| 991 AckFrameInfo ack_info; | 988 AckFrameInfo ack_info; |
| 992 if (frame.packets.Empty()) { | 989 if (frame.packets.Empty()) { |
| 993 return ack_info; | 990 return ack_info; |
| 994 } | 991 } |
| 995 DCHECK_GE(frame.largest_observed, frame.packets.Max()); | 992 DCHECK_GE(frame.largest_observed, frame.packets.Max()); |
| 996 QuicPacketNumber last_largest_missing = 0; | 993 QuicPacketNumber last_largest_missing = 0; |
| 997 for (const Interval<QuicPacketNumber>& interval : frame.packets) { | 994 for (const Interval<QuicPacketNumber>& interval : frame.packets) { |
| 998 for (QuicPacketNumber interval_start = interval.min(); | 995 for (QuicPacketNumber interval_start = interval.min(); |
| 999 interval_start < interval.max(); | 996 interval_start < interval.max(); |
| 1000 interval_start += (1ull + numeric_limits<uint8_t>::max())) { | 997 interval_start += (1ull + std::numeric_limits<uint8_t>::max())) { |
| 1001 uint8_t cur_range_length = | 998 uint8_t cur_range_length = |
| 1002 interval.max() - interval_start > numeric_limits<uint8_t>::max() | 999 interval.max() - interval_start > std::numeric_limits<uint8_t>::max() |
| 1003 ? numeric_limits<uint8_t>::max() | 1000 ? std::numeric_limits<uint8_t>::max() |
| 1004 : (interval.max() - interval_start) - 1; | 1001 : (interval.max() - interval_start) - 1; |
| 1005 ack_info.nack_ranges[interval_start] = cur_range_length; | 1002 ack_info.nack_ranges[interval_start] = cur_range_length; |
| 1006 } | 1003 } |
| 1007 ack_info.max_delta = | 1004 ack_info.max_delta = |
| 1008 max(ack_info.max_delta, last_largest_missing == 0 | 1005 max(ack_info.max_delta, last_largest_missing == 0 |
| 1009 ? QuicPacketNumber{0} | 1006 ? QuicPacketNumber{0} |
| 1010 : (interval.min() - last_largest_missing)); | 1007 : (interval.min() - last_largest_missing)); |
| 1011 last_largest_missing = interval.max() - 1; | 1008 last_largest_missing = interval.max() - 1; |
| 1012 } | 1009 } |
| 1013 // Include the range to the largest observed. | 1010 // Include the range to the largest observed. |
| (...skipping 13 matching lines...) Expand all Loading... |
| 1027 // encoding, so skip it. | 1024 // encoding, so skip it. |
| 1028 new_ack_info.first_block_length = frame.packets.LastIntervalLength(); | 1025 new_ack_info.first_block_length = frame.packets.LastIntervalLength(); |
| 1029 auto itr = frame.packets.rbegin(); | 1026 auto itr = frame.packets.rbegin(); |
| 1030 QuicPacketNumber previous_start = itr->min(); | 1027 QuicPacketNumber previous_start = itr->min(); |
| 1031 new_ack_info.max_block_length = itr->Length(); | 1028 new_ack_info.max_block_length = itr->Length(); |
| 1032 ++itr; | 1029 ++itr; |
| 1033 | 1030 |
| 1034 // Don't do any more work after getting information for 256 ACK blocks; any | 1031 // Don't do any more work after getting information for 256 ACK blocks; any |
| 1035 // more can't be encoded anyway. | 1032 // more can't be encoded anyway. |
| 1036 for (; itr != frame.packets.rend() && | 1033 for (; itr != frame.packets.rend() && |
| 1037 new_ack_info.num_ack_blocks < numeric_limits<uint8_t>::max(); | 1034 new_ack_info.num_ack_blocks < std::numeric_limits<uint8_t>::max(); |
| 1038 previous_start = itr->min(), ++itr) { | 1035 previous_start = itr->min(), ++itr) { |
| 1039 const auto& interval = *itr; | 1036 const auto& interval = *itr; |
| 1040 const QuicPacketNumber total_gap = previous_start - interval.max(); | 1037 const QuicPacketNumber total_gap = previous_start - interval.max(); |
| 1041 new_ack_info.num_ack_blocks += | 1038 new_ack_info.num_ack_blocks += |
| 1042 (total_gap + numeric_limits<uint8_t>::max() - 1) / | 1039 (total_gap + std::numeric_limits<uint8_t>::max() - 1) / |
| 1043 numeric_limits<uint8_t>::max(); | 1040 std::numeric_limits<uint8_t>::max(); |
| 1044 new_ack_info.max_block_length = | 1041 new_ack_info.max_block_length = |
| 1045 max(new_ack_info.max_block_length, interval.Length()); | 1042 max(new_ack_info.max_block_length, interval.Length()); |
| 1046 } | 1043 } |
| 1047 return new_ack_info; | 1044 return new_ack_info; |
| 1048 } | 1045 } |
| 1049 | 1046 |
| 1050 bool QuicFramer::ProcessUnauthenticatedHeader(QuicDataReader* encrypted_reader, | 1047 bool QuicFramer::ProcessUnauthenticatedHeader(QuicDataReader* encrypted_reader, |
| 1051 QuicPacketHeader* header) { | 1048 QuicPacketHeader* header) { |
| 1052 header->path_id = kDefaultPathId; | 1049 header->path_id = kDefaultPathId; |
| 1053 if (header->public_header.multipath_flag && | 1050 if (header->public_header.multipath_flag && |
| (...skipping 1024 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2078 QuicDataWriter* writer) { | 2075 QuicDataWriter* writer) { |
| 2079 if (!writer->WriteBytes(&frame.stream_id, GetStreamIdSize(frame.stream_id))) { | 2076 if (!writer->WriteBytes(&frame.stream_id, GetStreamIdSize(frame.stream_id))) { |
| 2080 QUIC_BUG << "Writing stream id size failed."; | 2077 QUIC_BUG << "Writing stream id size failed."; |
| 2081 return false; | 2078 return false; |
| 2082 } | 2079 } |
| 2083 if (!writer->WriteBytes(&frame.offset, GetStreamOffsetSize(frame.offset))) { | 2080 if (!writer->WriteBytes(&frame.offset, GetStreamOffsetSize(frame.offset))) { |
| 2084 QUIC_BUG << "Writing offset size failed."; | 2081 QUIC_BUG << "Writing offset size failed."; |
| 2085 return false; | 2082 return false; |
| 2086 } | 2083 } |
| 2087 if (!no_stream_frame_length) { | 2084 if (!no_stream_frame_length) { |
| 2088 if ((frame.data_length > numeric_limits<uint16_t>::max()) || | 2085 if ((frame.data_length > std::numeric_limits<uint16_t>::max()) || |
| 2089 !writer->WriteUInt16(static_cast<uint16_t>(frame.data_length))) { | 2086 !writer->WriteUInt16(static_cast<uint16_t>(frame.data_length))) { |
| 2090 QUIC_BUG << "Writing stream frame length failed"; | 2087 QUIC_BUG << "Writing stream frame length failed"; |
| 2091 return false; | 2088 return false; |
| 2092 } | 2089 } |
| 2093 } | 2090 } |
| 2094 | 2091 |
| 2095 if (!writer->WriteBytes(frame.data_buffer, frame.data_length)) { | 2092 if (!writer->WriteBytes(frame.data_buffer, frame.data_length)) { |
| 2096 QUIC_BUG << "Writing frame data failed."; | 2093 QUIC_BUG << "Writing frame data failed."; |
| 2097 return false; | 2094 return false; |
| 2098 } | 2095 } |
| (...skipping 190 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2289 } | 2286 } |
| 2290 if (!writer->WriteUFloat16(ack_delay_time_us)) { | 2287 if (!writer->WriteUFloat16(ack_delay_time_us)) { |
| 2291 return false; | 2288 return false; |
| 2292 } | 2289 } |
| 2293 | 2290 |
| 2294 size_t max_num_ack_blocks = available_timestamp_and_ack_block_bytes / | 2291 size_t max_num_ack_blocks = available_timestamp_and_ack_block_bytes / |
| 2295 (ack_block_length + PACKET_1BYTE_PACKET_NUMBER); | 2292 (ack_block_length + PACKET_1BYTE_PACKET_NUMBER); |
| 2296 | 2293 |
| 2297 // Number of ack blocks. | 2294 // Number of ack blocks. |
| 2298 size_t num_ack_blocks = min(new_ack_info.num_ack_blocks, max_num_ack_blocks); | 2295 size_t num_ack_blocks = min(new_ack_info.num_ack_blocks, max_num_ack_blocks); |
| 2299 if (num_ack_blocks > numeric_limits<uint8_t>::max()) { | 2296 if (num_ack_blocks > std::numeric_limits<uint8_t>::max()) { |
| 2300 num_ack_blocks = numeric_limits<uint8_t>::max(); | 2297 num_ack_blocks = std::numeric_limits<uint8_t>::max(); |
| 2301 } | 2298 } |
| 2302 | 2299 |
| 2303 if (num_ack_blocks > 0) { | 2300 if (num_ack_blocks > 0) { |
| 2304 if (!writer->WriteBytes(&num_ack_blocks, 1)) { | 2301 if (!writer->WriteBytes(&num_ack_blocks, 1)) { |
| 2305 return false; | 2302 return false; |
| 2306 } | 2303 } |
| 2307 } | 2304 } |
| 2308 | 2305 |
| 2309 // First ack block length. | 2306 // First ack block length. |
| 2310 if (!AppendPacketSequenceNumber(ack_block_length, | 2307 if (!AppendPacketSequenceNumber(ack_block_length, |
| (...skipping 15 matching lines...) Expand all Loading... |
| 2326 auto itr = frame.packets.rbegin(); | 2323 auto itr = frame.packets.rbegin(); |
| 2327 QuicPacketNumber previous_start = itr->min(); | 2324 QuicPacketNumber previous_start = itr->min(); |
| 2328 ++itr; | 2325 ++itr; |
| 2329 | 2326 |
| 2330 for (; | 2327 for (; |
| 2331 itr != frame.packets.rend() && num_ack_blocks_written < num_ack_blocks; | 2328 itr != frame.packets.rend() && num_ack_blocks_written < num_ack_blocks; |
| 2332 previous_start = itr->min(), ++itr) { | 2329 previous_start = itr->min(), ++itr) { |
| 2333 const auto& interval = *itr; | 2330 const auto& interval = *itr; |
| 2334 const QuicPacketNumber total_gap = previous_start - interval.max(); | 2331 const QuicPacketNumber total_gap = previous_start - interval.max(); |
| 2335 const size_t num_encoded_gaps = | 2332 const size_t num_encoded_gaps = |
| 2336 (total_gap + numeric_limits<uint8_t>::max() - 1) / | 2333 (total_gap + std::numeric_limits<uint8_t>::max() - 1) / |
| 2337 numeric_limits<uint8_t>::max(); | 2334 std::numeric_limits<uint8_t>::max(); |
| 2338 DCHECK_GT(num_encoded_gaps, 0u); | 2335 DCHECK_GT(num_encoded_gaps, 0u); |
| 2339 | 2336 |
| 2340 // Append empty ACK blocks because the gap is longer than a single gap. | 2337 // Append empty ACK blocks because the gap is longer than a single gap. |
| 2341 for (size_t i = 1; | 2338 for (size_t i = 1; |
| 2342 i < num_encoded_gaps && num_ack_blocks_written < num_ack_blocks; | 2339 i < num_encoded_gaps && num_ack_blocks_written < num_ack_blocks; |
| 2343 ++i) { | 2340 ++i) { |
| 2344 if (!AppendAckBlock(numeric_limits<uint8_t>::max(), ack_block_length, 0, | 2341 if (!AppendAckBlock(std::numeric_limits<uint8_t>::max(), |
| 2345 writer)) { | 2342 ack_block_length, 0, writer)) { |
| 2346 return false; | 2343 return false; |
| 2347 } | 2344 } |
| 2348 ++num_ack_blocks_written; | 2345 ++num_ack_blocks_written; |
| 2349 } | 2346 } |
| 2350 if (num_ack_blocks_written >= num_ack_blocks) { | 2347 if (num_ack_blocks_written >= num_ack_blocks) { |
| 2351 if (PREDICT_FALSE(num_ack_blocks_written != num_ack_blocks)) { | 2348 if (PREDICT_FALSE(num_ack_blocks_written != num_ack_blocks)) { |
| 2352 QUIC_BUG << "Wrote " << num_ack_blocks_written | 2349 QUIC_BUG << "Wrote " << num_ack_blocks_written |
| 2353 << ", expected to write " << num_ack_blocks; | 2350 << ", expected to write " << num_ack_blocks; |
| 2354 } | 2351 } |
| 2355 break; | 2352 break; |
| 2356 } | 2353 } |
| 2357 | 2354 |
| 2358 const uint8_t last_gap = | 2355 const uint8_t last_gap = |
| 2359 total_gap - (num_encoded_gaps - 1) * numeric_limits<uint8_t>::max(); | 2356 total_gap - |
| 2357 (num_encoded_gaps - 1) * std::numeric_limits<uint8_t>::max(); |
| 2360 // Append the final ACK block with a non-empty size. | 2358 // Append the final ACK block with a non-empty size. |
| 2361 if (!AppendAckBlock(last_gap, ack_block_length, interval.Length(), | 2359 if (!AppendAckBlock(last_gap, ack_block_length, interval.Length(), |
| 2362 writer)) { | 2360 writer)) { |
| 2363 return false; | 2361 return false; |
| 2364 } | 2362 } |
| 2365 ++num_ack_blocks_written; | 2363 ++num_ack_blocks_written; |
| 2366 } | 2364 } |
| 2367 DCHECK_EQ(num_ack_blocks, num_ack_blocks_written); | 2365 DCHECK_EQ(num_ack_blocks, num_ack_blocks_written); |
| 2368 } | 2366 } |
| 2369 | 2367 |
| (...skipping 10 matching lines...) Expand all Loading... |
| 2380 if (!writer->WriteBytes(&num_received_packets, 1)) { | 2378 if (!writer->WriteBytes(&num_received_packets, 1)) { |
| 2381 return false; | 2379 return false; |
| 2382 } | 2380 } |
| 2383 } | 2381 } |
| 2384 | 2382 |
| 2385 return true; | 2383 return true; |
| 2386 } | 2384 } |
| 2387 | 2385 |
| 2388 bool QuicFramer::AppendTimestampToAckFrame(const QuicAckFrame& frame, | 2386 bool QuicFramer::AppendTimestampToAckFrame(const QuicAckFrame& frame, |
| 2389 QuicDataWriter* writer) { | 2387 QuicDataWriter* writer) { |
| 2390 DCHECK_GE(numeric_limits<uint8_t>::max(), frame.received_packet_times.size()); | 2388 DCHECK_GE(std::numeric_limits<uint8_t>::max(), |
| 2389 frame.received_packet_times.size()); |
| 2391 // num_received_packets is only 1 byte. | 2390 // num_received_packets is only 1 byte. |
| 2392 if (frame.received_packet_times.size() > numeric_limits<uint8_t>::max()) { | 2391 if (frame.received_packet_times.size() > |
| 2392 std::numeric_limits<uint8_t>::max()) { |
| 2393 return false; | 2393 return false; |
| 2394 } | 2394 } |
| 2395 | 2395 |
| 2396 uint8_t num_received_packets = frame.received_packet_times.size(); | 2396 uint8_t num_received_packets = frame.received_packet_times.size(); |
| 2397 if (!writer->WriteBytes(&num_received_packets, 1)) { | 2397 if (!writer->WriteBytes(&num_received_packets, 1)) { |
| 2398 return false; | 2398 return false; |
| 2399 } | 2399 } |
| 2400 if (num_received_packets == 0) { | 2400 if (num_received_packets == 0) { |
| 2401 return true; | 2401 return true; |
| 2402 } | 2402 } |
| 2403 | 2403 |
| 2404 PacketTimeVector::const_iterator it = frame.received_packet_times.begin(); | 2404 PacketTimeVector::const_iterator it = frame.received_packet_times.begin(); |
| 2405 QuicPacketNumber packet_number = it->first; | 2405 QuicPacketNumber packet_number = it->first; |
| 2406 QuicPacketNumber delta_from_largest_observed = | 2406 QuicPacketNumber delta_from_largest_observed = |
| 2407 frame.largest_observed - packet_number; | 2407 frame.largest_observed - packet_number; |
| 2408 | 2408 |
| 2409 DCHECK_GE(numeric_limits<uint8_t>::max(), delta_from_largest_observed); | 2409 DCHECK_GE(std::numeric_limits<uint8_t>::max(), delta_from_largest_observed); |
| 2410 if (delta_from_largest_observed > numeric_limits<uint8_t>::max()) { | 2410 if (delta_from_largest_observed > std::numeric_limits<uint8_t>::max()) { |
| 2411 return false; | 2411 return false; |
| 2412 } | 2412 } |
| 2413 | 2413 |
| 2414 if (!writer->WriteUInt8(delta_from_largest_observed & | 2414 if (!writer->WriteUInt8(delta_from_largest_observed & |
| 2415 k1ByteSequenceNumberMask)) { | 2415 k1ByteSequenceNumberMask)) { |
| 2416 return false; | 2416 return false; |
| 2417 } | 2417 } |
| 2418 | 2418 |
| 2419 // Use the lowest 4 bytes of the time delta from the creation_time_. | 2419 // Use the lowest 4 bytes of the time delta from the creation_time_. |
| 2420 const uint64_t time_epoch_delta_us = UINT64_C(1) << 32; | 2420 const uint64_t time_epoch_delta_us = UINT64_C(1) << 32; |
| 2421 uint32_t time_delta_us = | 2421 uint32_t time_delta_us = |
| 2422 static_cast<uint32_t>((it->second - creation_time_).ToMicroseconds() & | 2422 static_cast<uint32_t>((it->second - creation_time_).ToMicroseconds() & |
| 2423 (time_epoch_delta_us - 1)); | 2423 (time_epoch_delta_us - 1)); |
| 2424 if (!writer->WriteBytes(&time_delta_us, sizeof(time_delta_us))) { | 2424 if (!writer->WriteBytes(&time_delta_us, sizeof(time_delta_us))) { |
| 2425 return false; | 2425 return false; |
| 2426 } | 2426 } |
| 2427 | 2427 |
| 2428 QuicTime prev_time = it->second; | 2428 QuicTime prev_time = it->second; |
| 2429 | 2429 |
| 2430 for (++it; it != frame.received_packet_times.end(); ++it) { | 2430 for (++it; it != frame.received_packet_times.end(); ++it) { |
| 2431 packet_number = it->first; | 2431 packet_number = it->first; |
| 2432 delta_from_largest_observed = frame.largest_observed - packet_number; | 2432 delta_from_largest_observed = frame.largest_observed - packet_number; |
| 2433 | 2433 |
| 2434 if (delta_from_largest_observed > numeric_limits<uint8_t>::max()) { | 2434 if (delta_from_largest_observed > std::numeric_limits<uint8_t>::max()) { |
| 2435 return false; | 2435 return false; |
| 2436 } | 2436 } |
| 2437 | 2437 |
| 2438 if (!writer->WriteUInt8(delta_from_largest_observed & | 2438 if (!writer->WriteUInt8(delta_from_largest_observed & |
| 2439 k1ByteSequenceNumberMask)) { | 2439 k1ByteSequenceNumberMask)) { |
| 2440 return false; | 2440 return false; |
| 2441 } | 2441 } |
| 2442 | 2442 |
| 2443 uint64_t frame_time_delta_us = (it->second - prev_time).ToMicroseconds(); | 2443 uint64_t frame_time_delta_us = (it->second - prev_time).ToMicroseconds(); |
| 2444 prev_time = it->second; | 2444 prev_time = it->second; |
| (...skipping 116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2561 | 2561 |
| 2562 bool QuicFramer::RaiseError(QuicErrorCode error) { | 2562 bool QuicFramer::RaiseError(QuicErrorCode error) { |
| 2563 DVLOG(1) << "Error: " << QuicUtils::ErrorToString(error) | 2563 DVLOG(1) << "Error: " << QuicUtils::ErrorToString(error) |
| 2564 << " detail: " << detailed_error_; | 2564 << " detail: " << detailed_error_; |
| 2565 set_error(error); | 2565 set_error(error); |
| 2566 visitor_->OnError(this); | 2566 visitor_->OnError(this); |
| 2567 return false; | 2567 return false; |
| 2568 } | 2568 } |
| 2569 | 2569 |
| 2570 } // namespace net | 2570 } // namespace net |
| OLD | NEW |