generated from Warchant/cmake-hunter-seed
-
Notifications
You must be signed in to change notification settings - Fork 124
Expand file tree
/
Copy pathwrite_queue.cpp
More file actions
154 lines (118 loc) · 3.66 KB
/
write_queue.cpp
File metadata and controls
154 lines (118 loc) · 3.66 KB
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
/**
* Copyright Quadrivium LLC
* All Rights Reserved
* SPDX-License-Identifier: Apache-2.0
*/
#include <cassert>
#include <libp2p/basic/write_queue.hpp>
namespace libp2p::basic {
bool WriteQueue::canEnqueue(size_t size) const {
return (size + total_unsent_size_ <= size_limit_);
}
size_t WriteQueue::unsentBytes() const {
return total_unsent_size_;
}
void WriteQueue::enqueue(DataRef data, Writer::WriteCallbackFunc cb) {
auto data_sz = static_cast<size_t>(data.size());
if (data_sz == 0) {
// Call callback immediately for empty data
if (cb) {
cb(outcome::success());
}
return;
}
if (!canEnqueue(data_sz)) {
// Call callback with error for overflow
if (cb) {
cb(outcome::failure(std::make_error_code(std::errc::no_buffer_space)));
}
return;
}
total_unsent_size_ += data_sz;
queue_.push_back({data, 0, 0, data_sz, std::move(cb)});
}
size_t WriteQueue::dequeue(size_t window_size, DataRef &out) {
if (total_unsent_size_ == 0 || window_size == 0
|| active_index_ >= queue_.size()) {
out = DataRef{};
return window_size;
}
assert(!queue_.empty());
auto &item = queue_[active_index_];
assert(item.unacknowledged + item.acknowledged + item.unsent
== static_cast<size_t>(item.data.size()));
assert(item.unsent > 0);
out = item.data.subspan(item.acknowledged + item.unacknowledged);
auto sz = static_cast<size_t>(out.size());
assert(sz == item.unsent);
if (sz > window_size) {
sz = window_size;
out = out.subspan(0, window_size);
}
item.unsent -= sz;
item.unacknowledged += sz;
if (item.unsent == 0) {
++active_index_;
}
assert(item.unacknowledged + item.acknowledged + item.unsent
== static_cast<size_t>(item.data.size()));
assert(total_unsent_size_ >= sz);
total_unsent_size_ -= sz;
return window_size - sz;
}
WriteQueue::AckResult WriteQueue::ackDataSent(size_t size) {
AckResult result;
if (queue_.empty() || size == 0) {
// inconsistency, must not be called if nothing to ack
result.data_consistent = false;
return result;
}
auto &item = queue_.front();
auto total_size = item.acknowledged + item.unacknowledged + item.unsent;
assert(total_size == static_cast<size_t>(item.data.size()));
if (size > item.unacknowledged) {
// inconsistency, more data is acked than callback was put for
result.data_consistent = false;
return result;
}
item.unacknowledged -= size;
item.acknowledged += size;
auto completed = (item.acknowledged == total_size);
if (!completed) {
assert(total_size > item.acknowledged);
// data partially acknowledged, early to call the callback
result.data_consistent = true;
return result;
}
// acknowledging a portion of data was written
result.cb.swap(item.cb);
result.size_to_ack = total_size;
result.data_consistent = true;
queue_.pop_front();
if (queue_.empty()) {
assert(total_unsent_size_ == 0);
active_index_ = 0;
} else if (active_index_ > 0) {
--active_index_;
}
return result;
}
std::vector<Writer::WriteCallbackFunc> WriteQueue::getAllCallbacks() {
std::vector<Writer::WriteCallbackFunc> v;
v.reserve(queue_.size());
for (auto &item : queue_) {
if (!item.cb) {
continue;
}
v.emplace_back();
item.cb.swap(v.back());
}
return v;
}
void WriteQueue::clear() {
active_index_ = 0;
total_unsent_size_ = 0;
std::deque<Data> tmp_queue;
queue_.swap(tmp_queue);
}
} // namespace libp2p::basic