1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/quic/quic_protocol.h"
#include "base/stl_util.h"
using base::StringPiece;
using std::map;
using std::numeric_limits;
using std::ostream;
namespace net {
QuicStreamFrame::QuicStreamFrame() {}
QuicStreamFrame::QuicStreamFrame(QuicStreamId stream_id,
bool fin,
QuicStreamOffset offset,
StringPiece data)
: stream_id(stream_id),
fin(fin),
offset(offset),
data(data) {
}
// TODO(ianswett): Initializing largest_observed to 0 should not be necessary.
ReceivedPacketInfo::ReceivedPacketInfo() : largest_observed(0) {}
ReceivedPacketInfo::~ReceivedPacketInfo() {}
void ReceivedPacketInfo::RecordReceived(
QuicPacketSequenceNumber sequence_number) {
DCHECK(IsAwaitingPacket(sequence_number));
if (largest_observed < sequence_number) {
DCHECK_LT(sequence_number - largest_observed,
numeric_limits<uint16>::max());
// We've got a new high sequence number. Note any new intermediate missing
// packets, and update the last_ack data.
for (QuicPacketSequenceNumber i = largest_observed + 1;
i < sequence_number; ++i) {
DVLOG(1) << "missing " << i;
missing_packets.insert(i);
}
largest_observed = sequence_number;
} else {
// We've gotten one of the out of order packets - remove it from our
// "missing packets" list.
DVLOG(1) << "Removing " << sequence_number << " from missing list";
missing_packets.erase(sequence_number);
}
}
bool ReceivedPacketInfo::IsAwaitingPacket(
QuicPacketSequenceNumber sequence_number) const {
return sequence_number > largest_observed ||
ContainsKey(missing_packets, sequence_number);
}
void ReceivedPacketInfo::ClearMissingBefore(
QuicPacketSequenceNumber least_unacked) {
missing_packets.erase(missing_packets.begin(),
missing_packets.lower_bound(least_unacked));
}
SentPacketInfo::SentPacketInfo() {}
SentPacketInfo::~SentPacketInfo() {}
// Testing convenience method.
QuicAckFrame::QuicAckFrame(QuicPacketSequenceNumber largest_observed,
QuicPacketSequenceNumber least_unacked) {
for (QuicPacketSequenceNumber seq_num = 1;
seq_num <= largest_observed; ++seq_num) {
received_info.RecordReceived(seq_num);
}
received_info.largest_observed = largest_observed;
sent_info.least_unacked = least_unacked;
}
ostream& operator<<(ostream& os, const SentPacketInfo& sent_info) {
os << "least_unacked: " << sent_info.least_unacked;
return os;
}
ostream& operator<<(ostream& os, const ReceivedPacketInfo& received_info) {
os << "largest_observed: "
<< received_info.largest_observed
<< " missing_packets: [ ";
for (SequenceSet::const_iterator it = received_info.missing_packets.begin();
it != received_info.missing_packets.end(); ++it) {
os << *it << " ";
}
os << " ] ";
return os;
}
QuicCongestionFeedbackFrame::QuicCongestionFeedbackFrame() {
}
QuicCongestionFeedbackFrame::~QuicCongestionFeedbackFrame() {
}
ostream& operator<<(ostream& os,
const QuicCongestionFeedbackFrame& congestion_frame) {
os << "type: " << congestion_frame.type;
switch (congestion_frame.type) {
case kInterArrival: {
const CongestionFeedbackMessageInterArrival& inter_arrival =
congestion_frame.inter_arrival;
os << " accumulated_number_of_lost_packets: "
<< inter_arrival.accumulated_number_of_lost_packets;
os << " received packets: [ ";
for (TimeMap::const_iterator it =
inter_arrival.received_packet_times.begin();
it != inter_arrival.received_packet_times.end(); ++it) {
os << it->first << "@" << it->second.ToMilliseconds() << " ";
}
os << "]";
break;
}
case kFixRate: {
os << " bitrate_in_bytes_per_second: "
<< congestion_frame.fix_rate.bitrate.ToBytesPerSecond();
break;
}
case kTCP: {
const CongestionFeedbackMessageTCP& tcp = congestion_frame.tcp;
os << " accumulated_number_of_lost_packets: "
<< congestion_frame.tcp.accumulated_number_of_lost_packets;
os << " receive_window: " << tcp.receive_window;
break;
}
}
return os;
}
ostream& operator<<(ostream& os, const QuicAckFrame& ack_frame) {
os << "sent info { " << ack_frame.sent_info << " } "
<< "received info { " << ack_frame.received_info << " }\n";
return os;
}
CongestionFeedbackMessageFixRate::CongestionFeedbackMessageFixRate()
: bitrate(QuicBandwidth::Zero()) {
}
CongestionFeedbackMessageInterArrival::
CongestionFeedbackMessageInterArrival() {}
CongestionFeedbackMessageInterArrival::
~CongestionFeedbackMessageInterArrival() {}
QuicFecData::QuicFecData() {}
bool QuicFecData::operator==(const QuicFecData& other) const {
if (fec_group != other.fec_group) {
return false;
}
if (redundancy != other.redundancy) {
return false;
}
return true;
}
QuicData::~QuicData() {
if (owns_buffer_) {
delete [] const_cast<char*>(buffer_);
}
}
ostream& operator<<(ostream& os, const QuicEncryptedPacket& s) {
os << s.length() << "-byte data";
return os;
}
ostream& operator<<(ostream& os, const QuicConsumedData& s) {
os << "bytes_consumed: " << s.bytes_consumed
<< " fin_consumed: " << s.fin_consumed;
return os;
}
} // namespace net
|
