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/quic_connection.h" | 5 #include "net/quic/quic_connection.h" |
6 | 6 |
7 #include <string.h> | 7 #include <string.h> |
8 #include <sys/types.h> | 8 #include <sys/types.h> |
9 #include <algorithm> | 9 #include <algorithm> |
10 #include <iterator> | 10 #include <iterator> |
11 #include <limits> | 11 #include <limits> |
12 #include <memory> | 12 #include <memory> |
13 #include <set> | 13 #include <set> |
14 #include <utility> | 14 #include <utility> |
15 | 15 |
16 #include "base/debug/stack_trace.h" | 16 #include "base/debug/stack_trace.h" |
17 #include "base/logging.h" | 17 #include "base/logging.h" |
18 #include "base/stl_util.h" | 18 #include "base/stl_util.h" |
19 #include "net/base/net_errors.h" | 19 #include "net/base/net_errors.h" |
20 #include "net/quic/crypto/quic_decrypter.h" | 20 #include "net/quic/crypto/quic_decrypter.h" |
21 #include "net/quic/crypto/quic_encrypter.h" | 21 #include "net/quic/crypto/quic_encrypter.h" |
22 #include "net/quic/iovector.h" | 22 #include "net/quic/iovector.h" |
23 #include "net/quic/quic_bandwidth.h" | 23 #include "net/quic/quic_bandwidth.h" |
24 #include "net/quic/quic_config.h" | 24 #include "net/quic/quic_config.h" |
| 25 #include "net/quic/quic_fec_group.h" |
25 #include "net/quic/quic_flags.h" | 26 #include "net/quic/quic_flags.h" |
26 #include "net/quic/quic_utils.h" | 27 #include "net/quic/quic_utils.h" |
27 | 28 |
28 using base::StringPiece; | 29 using base::StringPiece; |
29 using base::hash_map; | 30 using base::hash_map; |
30 using base::hash_set; | 31 using base::hash_set; |
31 using std::list; | 32 using std::list; |
32 using std::make_pair; | 33 using std::make_pair; |
33 using std::max; | 34 using std::max; |
34 using std::min; | 35 using std::min; |
(...skipping 1997 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2032 } | 2033 } |
2033 for (size_t i = 0; i < retransmittable_frames->frames().size(); ++i) { | 2034 for (size_t i = 0; i < retransmittable_frames->frames().size(); ++i) { |
2034 if (retransmittable_frames->frames()[i].type == CONNECTION_CLOSE_FRAME) { | 2035 if (retransmittable_frames->frames()[i].type == CONNECTION_CLOSE_FRAME) { |
2035 return true; | 2036 return true; |
2036 } | 2037 } |
2037 } | 2038 } |
2038 return false; | 2039 return false; |
2039 } | 2040 } |
2040 | 2041 |
2041 } // namespace net | 2042 } // namespace net |
OLD | NEW |