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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
|
// Copyright (c) 2013 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/spdy/spdy_write_queue.h"
#include <cstddef>
#include <utility>
#include <vector>
#include "base/containers/circular_deque.h"
#include "base/logging.h"
#include "base/trace_event/memory_usage_estimator.h"
#include "net/spdy/spdy_buffer.h"
#include "net/spdy/spdy_buffer_producer.h"
#include "net/spdy/spdy_stream.h"
namespace net {
bool IsSpdyFrameTypeWriteCapped(spdy::SpdyFrameType frame_type) {
return frame_type == spdy::SpdyFrameType::RST_STREAM ||
frame_type == spdy::SpdyFrameType::SETTINGS ||
frame_type == spdy::SpdyFrameType::WINDOW_UPDATE ||
frame_type == spdy::SpdyFrameType::PING ||
frame_type == spdy::SpdyFrameType::GOAWAY;
}
SpdyWriteQueue::PendingWrite::PendingWrite() = default;
SpdyWriteQueue::PendingWrite::PendingWrite(
spdy::SpdyFrameType frame_type,
std::unique_ptr<SpdyBufferProducer> frame_producer,
const base::WeakPtr<SpdyStream>& stream,
const MutableNetworkTrafficAnnotationTag& traffic_annotation)
: frame_type(frame_type),
frame_producer(std::move(frame_producer)),
stream(stream),
traffic_annotation(traffic_annotation),
has_stream(stream.get() != nullptr) {}
SpdyWriteQueue::PendingWrite::~PendingWrite() = default;
SpdyWriteQueue::PendingWrite::PendingWrite(PendingWrite&& other) = default;
SpdyWriteQueue::PendingWrite& SpdyWriteQueue::PendingWrite::operator=(
PendingWrite&& other) = default;
size_t SpdyWriteQueue::PendingWrite::EstimateMemoryUsage() const {
return base::trace_event::EstimateMemoryUsage(frame_producer);
}
SpdyWriteQueue::SpdyWriteQueue() : removing_writes_(false) {}
SpdyWriteQueue::~SpdyWriteQueue() {
DCHECK_GE(num_queued_capped_frames_, 0);
Clear();
}
bool SpdyWriteQueue::IsEmpty() const {
for (int i = MINIMUM_PRIORITY; i <= MAXIMUM_PRIORITY; i++) {
if (!queue_[i].empty())
return false;
}
return true;
}
void SpdyWriteQueue::Enqueue(
RequestPriority priority,
spdy::SpdyFrameType frame_type,
std::unique_ptr<SpdyBufferProducer> frame_producer,
const base::WeakPtr<SpdyStream>& stream,
const NetworkTrafficAnnotationTag& traffic_annotation) {
CHECK(!removing_writes_);
CHECK_GE(priority, MINIMUM_PRIORITY);
CHECK_LE(priority, MAXIMUM_PRIORITY);
if (stream.get())
DCHECK_EQ(stream->priority(), priority);
queue_[priority].push_back(
{frame_type, std::move(frame_producer), stream,
MutableNetworkTrafficAnnotationTag(traffic_annotation)});
if (IsSpdyFrameTypeWriteCapped(frame_type)) {
DCHECK_GE(num_queued_capped_frames_, 0);
num_queued_capped_frames_++;
}
}
bool SpdyWriteQueue::Dequeue(
spdy::SpdyFrameType* frame_type,
std::unique_ptr<SpdyBufferProducer>* frame_producer,
base::WeakPtr<SpdyStream>* stream,
MutableNetworkTrafficAnnotationTag* traffic_annotation) {
CHECK(!removing_writes_);
for (int i = MAXIMUM_PRIORITY; i >= MINIMUM_PRIORITY; --i) {
if (!queue_[i].empty()) {
PendingWrite pending_write = std::move(queue_[i].front());
queue_[i].pop_front();
*frame_type = pending_write.frame_type;
*frame_producer = std::move(pending_write.frame_producer);
*stream = pending_write.stream;
*traffic_annotation = pending_write.traffic_annotation;
if (pending_write.has_stream)
DCHECK(stream->get());
if (IsSpdyFrameTypeWriteCapped(*frame_type)) {
num_queued_capped_frames_--;
DCHECK_GE(num_queued_capped_frames_, 0);
}
return true;
}
}
return false;
}
void SpdyWriteQueue::RemovePendingWritesForStream(SpdyStream* stream) {
CHECK(!removing_writes_);
removing_writes_ = true;
RequestPriority priority = stream->priority();
CHECK_GE(priority, MINIMUM_PRIORITY);
CHECK_LE(priority, MAXIMUM_PRIORITY);
#if DCHECK_IS_ON()
// |stream| should not have pending writes in a queue not matching
// its priority.
for (int i = MINIMUM_PRIORITY; i <= MAXIMUM_PRIORITY; ++i) {
if (priority == i)
continue;
for (auto it = queue_[i].begin(); it != queue_[i].end(); ++it)
DCHECK_NE(it->stream.get(), stream);
}
#endif
// Defer deletion until queue iteration is complete, as
// SpdyBuffer::~SpdyBuffer() can result in callbacks into SpdyWriteQueue.
std::vector<std::unique_ptr<SpdyBufferProducer>> erased_buffer_producers;
base::circular_deque<PendingWrite>& queue = queue_[priority];
for (auto it = queue.begin(); it != queue.end();) {
if (it->stream.get() == stream) {
if (IsSpdyFrameTypeWriteCapped(it->frame_type)) {
num_queued_capped_frames_--;
DCHECK_GE(num_queued_capped_frames_, 0);
}
erased_buffer_producers.push_back(std::move(it->frame_producer));
it = queue.erase(it);
} else {
++it;
}
}
removing_writes_ = false;
// Iteration on |queue| is completed. Now |erased_buffer_producers| goes out
// of scope, SpdyBufferProducers are destroyed.
}
void SpdyWriteQueue::RemovePendingWritesForStreamsAfter(
spdy::SpdyStreamId last_good_stream_id) {
CHECK(!removing_writes_);
removing_writes_ = true;
// Defer deletion until queue iteration is complete, as
// SpdyBuffer::~SpdyBuffer() can result in callbacks into SpdyWriteQueue.
std::vector<std::unique_ptr<SpdyBufferProducer>> erased_buffer_producers;
for (int i = MINIMUM_PRIORITY; i <= MAXIMUM_PRIORITY; ++i) {
base::circular_deque<PendingWrite>& queue = queue_[i];
for (auto it = queue.begin(); it != queue.end();) {
if (it->stream.get() && (it->stream->stream_id() > last_good_stream_id ||
it->stream->stream_id() == 0)) {
if (IsSpdyFrameTypeWriteCapped(it->frame_type)) {
num_queued_capped_frames_--;
DCHECK_GE(num_queued_capped_frames_, 0);
}
erased_buffer_producers.push_back(std::move(it->frame_producer));
it = queue.erase(it);
} else {
++it;
}
}
}
removing_writes_ = false;
// Iteration on each |queue| is completed. Now |erased_buffer_producers| goes
// out of scope, SpdyBufferProducers are destroyed.
}
void SpdyWriteQueue::ChangePriorityOfWritesForStream(
SpdyStream* stream,
RequestPriority old_priority,
RequestPriority new_priority) {
CHECK(!removing_writes_);
DCHECK(stream);
#if DCHECK_IS_ON()
// |stream| should not have pending writes in a queue not matching
// |old_priority|.
for (int i = MINIMUM_PRIORITY; i <= MAXIMUM_PRIORITY; ++i) {
if (i == old_priority)
continue;
for (auto it = queue_[i].begin(); it != queue_[i].end(); ++it)
DCHECK_NE(it->stream.get(), stream);
}
#endif
base::circular_deque<PendingWrite>& old_queue = queue_[old_priority];
base::circular_deque<PendingWrite>& new_queue = queue_[new_priority];
for (auto it = old_queue.begin(); it != old_queue.end();) {
if (it->stream.get() == stream) {
new_queue.push_back(std::move(*it));
it = old_queue.erase(it);
} else {
++it;
}
}
}
void SpdyWriteQueue::Clear() {
CHECK(!removing_writes_);
removing_writes_ = true;
std::vector<std::unique_ptr<SpdyBufferProducer>> erased_buffer_producers;
for (int i = MINIMUM_PRIORITY; i <= MAXIMUM_PRIORITY; ++i) {
for (auto it = queue_[i].begin(); it != queue_[i].end(); ++it) {
erased_buffer_producers.push_back(std::move(it->frame_producer));
}
queue_[i].clear();
}
removing_writes_ = false;
num_queued_capped_frames_ = 0;
}
size_t SpdyWriteQueue::EstimateMemoryUsage() const {
return base::trace_event::EstimateMemoryUsage(queue_);
}
} // namespace net
|
