| Index: net/quic/quic_protocol.h
|
| diff --git a/net/quic/quic_protocol.h b/net/quic/quic_protocol.h
|
| index 170a40ce9a651be59f9902bc54c6763611e1137d..54deee28edb55bc2299f8bd6e0dca681b3f72838 100644
|
| --- a/net/quic/quic_protocol.h
|
| +++ b/net/quic/quic_protocol.h
|
| @@ -631,12 +631,25 @@ typedef std::set<QuicPacketSequenceNumber> SequenceNumberSet;
|
| // TODO(pwestin): Add a way to enforce the max size of this map.
|
| typedef std::map<QuicPacketSequenceNumber, QuicTime> TimeMap;
|
|
|
| -struct NET_EXPORT_PRIVATE ReceivedPacketInfo {
|
| - ReceivedPacketInfo();
|
| - ~ReceivedPacketInfo();
|
| +struct NET_EXPORT_PRIVATE QuicStopWaitingFrame {
|
| + QuicStopWaitingFrame();
|
| + ~QuicStopWaitingFrame();
|
|
|
| NET_EXPORT_PRIVATE friend std::ostream& operator<<(
|
| - std::ostream& os, const ReceivedPacketInfo& s);
|
| + std::ostream& os, const QuicStopWaitingFrame& s);
|
| + // Entropy hash of all packets up to, but not including, the least unacked
|
| + // packet.
|
| + QuicPacketEntropyHash entropy_hash;
|
| + // The lowest packet we've sent which is unacked, and we expect an ack for.
|
| + QuicPacketSequenceNumber least_unacked;
|
| +};
|
| +
|
| +struct NET_EXPORT_PRIVATE QuicAckFrame {
|
| + QuicAckFrame();
|
| + ~QuicAckFrame();
|
| +
|
| + NET_EXPORT_PRIVATE friend std::ostream& operator<<(
|
| + std::ostream& os, const QuicAckFrame& s);
|
|
|
| // Entropy hash of all packets up to largest observed not including missing
|
| // packets.
|
| @@ -673,39 +686,15 @@ struct NET_EXPORT_PRIVATE ReceivedPacketInfo {
|
| // as missing.
|
| // Always returns false for sequence numbers less than least_unacked.
|
| bool NET_EXPORT_PRIVATE IsAwaitingPacket(
|
| - const ReceivedPacketInfo& received_info,
|
| + const QuicAckFrame& ack_frame,
|
| QuicPacketSequenceNumber sequence_number);
|
|
|
| // Inserts missing packets between [lower, higher).
|
| void NET_EXPORT_PRIVATE InsertMissingPacketsBetween(
|
| - ReceivedPacketInfo* received_info,
|
| + QuicAckFrame* ack_frame,
|
| QuicPacketSequenceNumber lower,
|
| QuicPacketSequenceNumber higher);
|
|
|
| -struct NET_EXPORT_PRIVATE QuicStopWaitingFrame {
|
| - QuicStopWaitingFrame();
|
| - ~QuicStopWaitingFrame();
|
| -
|
| - NET_EXPORT_PRIVATE friend std::ostream& operator<<(
|
| - std::ostream& os, const QuicStopWaitingFrame& s);
|
| -
|
| - // Entropy hash of all packets up to, but not including, the least unacked
|
| - // packet.
|
| - QuicPacketEntropyHash entropy_hash;
|
| - // The lowest packet we've sent which is unacked, and we expect an ack for.
|
| - QuicPacketSequenceNumber least_unacked;
|
| -};
|
| -
|
| -struct NET_EXPORT_PRIVATE QuicAckFrame {
|
| - QuicAckFrame();
|
| -
|
| - NET_EXPORT_PRIVATE friend std::ostream& operator<<(
|
| - std::ostream& os, const QuicAckFrame& s);
|
| -
|
| - // TODO(ianswett): Inline the fields of received_info.
|
| - ReceivedPacketInfo received_info;
|
| -};
|
| -
|
| // Defines for all types of congestion feedback that will be negotiated in QUIC,
|
| // kTCP MUST be supported by all QUIC implementations to guarantee 100%
|
| // compatibility.
|
|
|