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 #ifndef NET_QUIC_QUIC_FRAMER_H_ | 5 #ifndef NET_QUIC_QUIC_FRAMER_H_ |
6 #define NET_QUIC_QUIC_FRAMER_H_ | 6 #define NET_QUIC_QUIC_FRAMER_H_ |
7 | 7 |
8 #include <stddef.h> | 8 #include <stddef.h> |
9 #include <stdint.h> | 9 #include <stdint.h> |
10 | 10 |
(...skipping 548 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
559 | 559 |
560 std::string detailed_error_; | 560 std::string detailed_error_; |
561 QuicFramerVisitorInterface* visitor_; | 561 QuicFramerVisitorInterface* visitor_; |
562 QuicReceivedEntropyHashCalculatorInterface* entropy_calculator_; | 562 QuicReceivedEntropyHashCalculatorInterface* entropy_calculator_; |
563 QuicErrorCode error_; | 563 QuicErrorCode error_; |
564 // Set of closed paths. A path is considered as closed if a PATH_CLOSED frame | 564 // Set of closed paths. A path is considered as closed if a PATH_CLOSED frame |
565 // has been sent/received. | 565 // has been sent/received. |
566 // TODO(fayang): this set is never cleaned up. A possible improvement is to | 566 // TODO(fayang): this set is never cleaned up. A possible improvement is to |
567 // use intervals. | 567 // use intervals. |
568 std::unordered_set<QuicPathId> closed_paths_; | 568 std::unordered_set<QuicPathId> closed_paths_; |
569 // Map mapping path id to packet number of last successfully decrypted | |
570 // received packet. | |
571 // TODO(ianswett): Remove when | |
572 // gfe2_reloadable_flag_quic_packet_numbers_largest_received is deprecated. | |
573 std::unordered_map<QuicPathId, QuicPacketNumber> last_packet_numbers_; | |
574 // Updated by ProcessPacketHeader when it succeeds. | 569 // Updated by ProcessPacketHeader when it succeeds. |
575 QuicPacketNumber last_packet_number_; | 570 QuicPacketNumber last_packet_number_; |
576 // Map mapping path id to packet number of largest successfully decrypted | 571 // Map mapping path id to packet number of largest successfully decrypted |
577 // received packet. | 572 // received packet. |
578 std::unordered_map<QuicPathId, QuicPacketNumber> largest_packet_numbers_; | 573 std::unordered_map<QuicPathId, QuicPacketNumber> largest_packet_numbers_; |
579 // Updated by ProcessPacketHeader when it succeeds decrypting a larger packet. | 574 // Updated by ProcessPacketHeader when it succeeds decrypting a larger packet. |
580 QuicPacketNumber largest_packet_number_; | 575 QuicPacketNumber largest_packet_number_; |
581 // The path on which last successfully decrypted packet was received. | 576 // The path on which last successfully decrypted packet was received. |
582 QuicPathId last_path_id_; | 577 QuicPathId last_path_id_; |
583 // Updated by WritePacketHeader. | 578 // Updated by WritePacketHeader. |
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
618 QuicTime::Delta last_timestamp_; | 613 QuicTime::Delta last_timestamp_; |
619 // The diversification nonce from the last received packet. | 614 // The diversification nonce from the last received packet. |
620 DiversificationNonce last_nonce_; | 615 DiversificationNonce last_nonce_; |
621 | 616 |
622 DISALLOW_COPY_AND_ASSIGN(QuicFramer); | 617 DISALLOW_COPY_AND_ASSIGN(QuicFramer); |
623 }; | 618 }; |
624 | 619 |
625 } // namespace net | 620 } // namespace net |
626 | 621 |
627 #endif // NET_QUIC_QUIC_FRAMER_H_ | 622 #endif // NET_QUIC_QUIC_FRAMER_H_ |
OLD | NEW |