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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
/* $Id: sbuf.c $ */
/** @file
* NAT - sbuf implemenation.
*/
/*
* Copyright (C) 2006-2023 Oracle and/or its affiliates.
*
* This file is part of VirtualBox base platform packages, as
* available from https://www.virtualbox.org.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, in version 3 of the
* License.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <https://www.gnu.org/licenses>.
*
* SPDX-License-Identifier: GPL-3.0-only
*/
/*
* This code is based on:
*
* Copyright (c) 1995 Danny Gasparovski.
*
* Please read the file COPYRIGHT for the
* terms and conditions of the copyright.
*/
#include <slirp.h>
/* Done as a macro in socket.h */
/* int
* sbspace(struct sockbuff *sb)
* {
* return SB_DATALEN - sb->sb_cc;
* }
*/
void
sbfree(struct sbuf *sb)
{
/*
* Catch double frees. Actually tcp_close() already filters out listening sockets
* passing NULL.
*/
Assert((sb->sb_data));
/*
* Don't call RTMemFree() for an already freed buffer, the EFence could complain
*/
if (sb->sb_data)
{
RTMemFree(sb->sb_data);
sb->sb_data = NULL;
}
}
void
sbdrop(struct sbuf *sb, int num)
{
/*
* We can only drop how much we have
* This should never succeed
*/
if (num > sb->sb_cc)
num = sb->sb_cc;
sb->sb_cc -= num;
sb->sb_rptr += num;
if (sb->sb_rptr >= sb->sb_data + sb->sb_datalen)
sb->sb_rptr -= sb->sb_datalen;
}
void
sbreserve(PNATState pData, struct sbuf *sb, int size)
{
NOREF(pData);
if (sb->sb_data)
{
/* Already alloced, realloc if necessary */
if (sb->sb_datalen != (u_int)size)
{
sb->sb_wptr =
sb->sb_rptr =
sb->sb_data = (char *)RTMemReallocZ(sb->sb_data, sb->sb_datalen, size);
sb->sb_cc = 0;
if (sb->sb_wptr)
sb->sb_datalen = size;
else
sb->sb_datalen = 0;
}
}
else
{
sb->sb_wptr = sb->sb_rptr = sb->sb_data = (char *)RTMemAllocZ(size);
sb->sb_cc = 0;
if (sb->sb_wptr)
sb->sb_datalen = size;
else
sb->sb_datalen = 0;
}
}
/*
* Try and write() to the socket, whatever doesn't get written
* append to the buffer... for a host with a fast net connection,
* this prevents an unnecessary copy of the data
* (the socket is non-blocking, so we won't hang)
*/
void
sbappend(PNATState pData, struct socket *so, struct mbuf *m)
{
int ret = 0;
int mlen = 0;
STAM_PROFILE_START(&pData->StatIOSBAppend_pf, a);
LogFlow(("sbappend: so = %p, m = %p, m->m_len = %d\n", so, m, m ? m->m_len : 0));
STAM_COUNTER_INC(&pData->StatIOSBAppend);
/* Shouldn't happen, but... e.g. foreign host closes connection */
mlen = m_length(m, NULL);
if (mlen <= 0)
{
STAM_COUNTER_INC(&pData->StatIOSBAppend_zm);
goto done;
}
/*
* If there is urgent data, call sosendoob
* if not all was sent, sowrite will take care of the rest
* (The rest of this function is just an optimisation)
*/
if (so->so_urgc)
{
sbappendsb(pData, &so->so_rcv, m);
m_freem(pData, m);
sosendoob(so);
return;
}
/*
* We only write if there's nothing in the buffer,
* otherwise it'll arrive out of order, and hence corrupt
*/
if (so->so_rcv.sb_cc == 0)
{
caddr_t buf = NULL;
if (m->m_next)
{
buf = RTMemAllocZ(mlen);
if (buf == NULL)
{
ret = 0;
goto no_sent;
}
m_copydata(m, 0, mlen, buf);
}
else
buf = mtod(m, char *);
ret = send(so->s, buf, mlen, 0);
if (m->m_next)
RTMemFree(buf);
}
no_sent:
if (ret <= 0)
{
STAM_COUNTER_INC(&pData->StatIOSBAppend_wf);
/*
* Nothing was written
* It's possible that the socket has closed, but
* we don't need to check because if it has closed,
* it will be detected in the normal way by soread()
*/
sbappendsb(pData, &so->so_rcv, m);
STAM_PROFILE_STOP(&pData->StatIOSBAppend_pf_wf, a);
goto done;
}
else if (ret != mlen)
{
STAM_COUNTER_INC(&pData->StatIOSBAppend_wp);
/*
* Something was written, but not everything..
* sbappendsb the rest
*/
m_adj(m, ret);
sbappendsb(pData, &so->so_rcv, m);
STAM_PROFILE_STOP(&pData->StatIOSBAppend_pf_wp, a);
goto done;
} /* else */
/* Whatever happened, we free the mbuf */
STAM_COUNTER_INC(&pData->StatIOSBAppend_wa);
STAM_PROFILE_STOP(&pData->StatIOSBAppend_pf_wa, a);
done:
m_freem(pData, m);
}
/*
* Copy the data from m into sb
* The caller is responsible to make sure there's enough room
*/
void
sbappendsb(PNATState pData, struct sbuf *sb, struct mbuf *m)
{
int len, n, nn;
#ifndef VBOX_WITH_STATISTICS
NOREF(pData);
#endif
len = m_length(m, NULL);
STAM_COUNTER_INC(&pData->StatIOSBAppendSB);
if (sb->sb_wptr < sb->sb_rptr)
{
STAM_COUNTER_INC(&pData->StatIOSBAppendSB_w_l_r);
n = sb->sb_rptr - sb->sb_wptr;
if (n > len)
n = len;
m_copydata(m, 0, n, sb->sb_wptr);
}
else
{
STAM_COUNTER_INC(&pData->StatIOSBAppendSB_w_ge_r);
/* Do the right edge first */
n = sb->sb_data + sb->sb_datalen - sb->sb_wptr;
if (n > len)
n = len;
m_copydata(m, 0, n, sb->sb_wptr);
len -= n;
if (len)
{
/* Now the left edge */
nn = sb->sb_rptr - sb->sb_data;
if (nn > len)
nn = len;
m_copydata(m, n, nn, sb->sb_data);
n += nn;
}
}
sb->sb_cc += n;
sb->sb_wptr += n;
if (sb->sb_wptr >= sb->sb_data + sb->sb_datalen)
{
STAM_COUNTER_INC(&pData->StatIOSBAppendSB_w_alter);
sb->sb_wptr -= sb->sb_datalen;
}
}
/*
* Copy data from sbuf to a normal, straight buffer
* Don't update the sbuf rptr, this will be
* done in sbdrop when the data is acked
*/
void
sbcopy(struct sbuf *sb, int off, int len, char *to)
{
char *from;
from = sb->sb_rptr + off;
if (from >= sb->sb_data + sb->sb_datalen)
from -= sb->sb_datalen;
if (from < sb->sb_wptr)
{
if (len > sb->sb_cc)
len = sb->sb_cc;
memcpy(to, from, len);
}
else
{
/* re-use off */
off = (sb->sb_data + sb->sb_datalen) - from;
if (off > len)
off = len;
memcpy(to, from, off);
len -= off;
if (len)
memcpy(to+off, sb->sb_data, len);
}
}
|