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
|
// Copyright 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.
#ifndef NET_SPDY_WRITE_BLOCKED_LIST_H_
#define NET_SPDY_WRITE_BLOCKED_LIST_H_
#include <algorithm>
#include <deque>
#include "base/logging.h"
#include "net/spdy/spdy_protocol.h"
namespace {
class WriteBlockedListPeer;
}
namespace net {
const int kHighestPriority = 0;
const int kLowestPriority = 7;
template <typename IdType>
class WriteBlockedList {
public:
// 0(1) size lookup. 0(1) insert at front or back.
typedef std::deque<IdType> BlockedList;
typedef typename BlockedList::iterator iterator;
static SpdyPriority ClampPriority(SpdyPriority priority) {
if (priority < kHighestPriority) {
LOG(DFATAL) << "Invalid priority: " << static_cast<int>(priority);
return kHighestPriority;
}
if (priority > kLowestPriority) {
LOG(DFATAL) << "Invalid priority: " << static_cast<int>(priority);
return kLowestPriority;
}
return priority;
}
// Returns the priority of the highest priority list with sessions on it.
SpdyPriority GetHighestPriorityWriteBlockedList() const {
for (SpdyPriority i = 0; i <= kLowestPriority; ++i) {
if (write_blocked_lists_[i].size() > 0)
return i;
}
LOG(DFATAL) << "No blocked streams";
return kHighestPriority;
}
IdType PopFront(SpdyPriority priority) {
priority = ClampPriority(priority);
DCHECK(!write_blocked_lists_[priority].empty());
IdType stream_id = write_blocked_lists_[priority].front();
write_blocked_lists_[priority].pop_front();
return stream_id;
}
bool HasWriteBlockedStreamsGreaterThanPriority(SpdyPriority priority) const {
priority = ClampPriority(priority);
for (SpdyPriority i = kHighestPriority; i < priority; ++i) {
if (!write_blocked_lists_[i].empty()) {
return true;
}
}
return false;
}
bool HasWriteBlockedStreams() const {
for (SpdyPriority i = kHighestPriority; i <= kLowestPriority; ++i) {
if (!write_blocked_lists_[i].empty()) {
return true;
}
}
return false;
}
void PushBack(IdType stream_id, SpdyPriority priority) {
write_blocked_lists_[ClampPriority(priority)].push_back(stream_id);
}
bool RemoveStreamFromWriteBlockedList(IdType stream_id,
SpdyPriority priority) {
// We shouldn't really add a stream_id to a list multiple times,
// but under some conditions it does happen. Doing a check in PushBack
// would be too costly, so instead we check here to eliminate duplicates.
bool found = false;
iterator it = std::find(write_blocked_lists_[priority].begin(),
write_blocked_lists_[priority].end(),
stream_id);
while (it != write_blocked_lists_[priority].end()) {
found = true;
iterator next_it = write_blocked_lists_[priority].erase(it);
it = std::find(next_it, write_blocked_lists_[priority].end(), stream_id);
}
return found;
}
void UpdateStreamPriorityInWriteBlockedList(IdType stream_id,
SpdyPriority old_priority,
SpdyPriority new_priority) {
if (old_priority == new_priority) {
return;
}
bool found = RemoveStreamFromWriteBlockedList(stream_id, old_priority);
if (found) {
PushBack(stream_id, new_priority);
}
}
size_t NumBlockedStreams() const {
size_t num_blocked_streams = 0;
for (SpdyPriority i = kHighestPriority; i <= kLowestPriority; ++i) {
num_blocked_streams += write_blocked_lists_[i].size();
}
return num_blocked_streams;
}
private:
friend WriteBlockedListPeer;
BlockedList write_blocked_lists_[kLowestPriority + 1];
};
} // namespace net
#endif // NET_SPDY_WRITE_BLOCKED_LIST_H_
|
