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
use std::{collections::VecDeque, io::IoSlice};
use bytes::{BufMut, Bytes, BytesMut};
#[cfg(feature = "faststr")]
use faststr::FastStr;
use tokio::io::{AsyncWrite, AsyncWriteExt};
const DEFAULT_BUFFER_SIZE: usize = 8192; const DEFAULT_DEQUE_SIZE: usize = 16;
pub struct LinkedBytes {
ioslice: Vec<IoSlice<'static>>,
bytes: BytesMut,
list: VecDeque<Node>,
}
pub enum Node {
Bytes(Bytes),
BytesMut(BytesMut),
#[cfg(feature = "faststr")]
FastStr(FastStr),
}
impl AsRef<[u8]> for Node {
#[inline]
fn as_ref(&self) -> &[u8] {
match self {
Node::Bytes(b) => b.as_ref(),
Node::BytesMut(b) => b.as_ref(),
#[cfg(feature = "faststr")]
Node::FastStr(s) => s.as_ref(),
}
}
}
impl LinkedBytes {
#[inline]
pub fn new() -> Self {
Self::with_capacity(DEFAULT_BUFFER_SIZE)
}
#[inline]
pub fn with_capacity(cap: usize) -> Self {
let bytes = BytesMut::with_capacity(cap);
let list = VecDeque::with_capacity(DEFAULT_DEQUE_SIZE);
Self {
list,
bytes,
ioslice: Vec::with_capacity(DEFAULT_DEQUE_SIZE),
}
}
#[inline]
pub fn bytes(&self) -> &BytesMut {
&self.bytes
}
#[inline]
pub fn bytes_mut(&mut self) -> &mut BytesMut {
&mut self.bytes
}
#[inline]
pub fn reserve(&mut self, additional: usize) {
self.bytes.reserve(additional);
}
pub fn insert(&mut self, bytes: Bytes) {
let node = Node::Bytes(bytes);
let prev = self.bytes.split();
self.list.push_back(Node::BytesMut(prev));
self.list.push_back(node);
}
#[cfg(feature = "faststr")]
pub fn insert_faststr(&mut self, fast_str: FastStr) {
let node = Node::FastStr(fast_str);
let prev = self.bytes.split();
self.list.push_back(Node::BytesMut(prev));
self.list.push_back(node);
}
pub async fn write_all_vectored<W: AsyncWrite + Unpin>(
&mut self,
writer: &mut W,
) -> std::io::Result<()> {
assert!(
self.ioslice.is_empty(),
"ioslice must be empty, maybe forget to call `reset`"
);
self.ioslice.reserve(self.list.len() + 1);
for node in self.list.iter() {
let bytes = node.as_ref();
if bytes.is_empty() {
continue;
}
self.ioslice
.push(IoSlice::new(unsafe { &*(bytes as *const _) }));
}
self.ioslice
.push(IoSlice::new(unsafe { &*(self.bytes.as_ref() as *const _) }));
let (mut base_ptr, mut len) = (self.ioslice.as_mut_ptr() as usize, self.ioslice.len());
while len != 0 {
let ioslice = unsafe { std::slice::from_raw_parts(base_ptr as *mut IoSlice, len) };
let n = writer.write_vectored(ioslice).await?;
if n == 0 {
return Err(std::io::ErrorKind::WriteZero.into());
}
let mut remove = 0;
let mut accumulated_len = 0;
for buf in ioslice.iter() {
if accumulated_len + buf.len() > n {
break;
} else {
accumulated_len += buf.len();
remove += 1;
}
}
base_ptr = unsafe { (base_ptr as *mut IoSlice).add(remove) as usize };
len -= remove;
if len == 0 {
assert!(
n == accumulated_len,
"advancing io slices beyond their length"
);
} else {
let inner_slice = unsafe { &mut *(base_ptr as *mut IoSlice) };
let (inner_ptr, inner_len) = (inner_slice.as_ptr(), inner_slice.len());
let remaining = n - accumulated_len;
assert!(
remaining <= inner_len,
"advancing io slice beyond its length"
);
let new_ptr = unsafe { inner_ptr.add(remaining) };
let new_len = inner_len - remaining;
*inner_slice =
IoSlice::new(unsafe { std::slice::from_raw_parts(new_ptr, new_len) });
}
}
self.ioslice.clear();
Ok(())
}
pub fn reset(&mut self) {
self.ioslice.clear();
if self.list.is_empty() {
self.bytes.clear();
return;
}
let Node::BytesMut(mut head) = self.list.pop_front().unwrap() else {
panic!("head is not BytesMut");
};
while let Some(node) = self.list.pop_front() {
if let Node::BytesMut(next_buf) = node {
head.unsplit(next_buf);
}
}
unsafe {
self.bytes.set_len(self.bytes.capacity());
}
let remaining = self.bytes.split();
head.unsplit(remaining);
self.bytes = head;
self.bytes.clear();
}
}
impl Default for LinkedBytes {
#[inline]
fn default() -> Self {
Self::new()
}
}
unsafe impl BufMut for LinkedBytes {
#[inline]
fn remaining_mut(&self) -> usize {
self.bytes.remaining_mut()
}
#[inline]
unsafe fn advance_mut(&mut self, cnt: usize) {
self.bytes.advance_mut(cnt)
}
#[inline]
fn chunk_mut(&mut self) -> &mut bytes::buf::UninitSlice {
self.bytes.chunk_mut()
}
}