1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18#include "qemu/osdep.h"
19#include <slirp.h>
20
21#define MBUF_THRESH 30
22
23
24
25
26#define SLIRP_MSIZE\
27 (offsetof(struct mbuf, m_dat) + IF_MAXLINKHDR + TCPIPHDR_DELTA + IF_MTU)
28
29void
30m_init(Slirp *slirp)
31{
32 slirp->m_freelist.qh_link = slirp->m_freelist.qh_rlink = &slirp->m_freelist;
33 slirp->m_usedlist.qh_link = slirp->m_usedlist.qh_rlink = &slirp->m_usedlist;
34}
35
36void m_cleanup(Slirp *slirp)
37{
38 struct mbuf *m, *next;
39
40 m = (struct mbuf *) slirp->m_usedlist.qh_link;
41 while ((struct quehead *) m != &slirp->m_usedlist) {
42 next = m->m_next;
43 if (m->m_flags & M_EXT) {
44 free(m->m_ext);
45 }
46 free(m);
47 m = next;
48 }
49 m = (struct mbuf *) slirp->m_freelist.qh_link;
50 while ((struct quehead *) m != &slirp->m_freelist) {
51 next = m->m_next;
52 free(m);
53 m = next;
54 }
55}
56
57
58
59
60
61
62
63
64
65struct mbuf *
66m_get(Slirp *slirp)
67{
68 register struct mbuf *m;
69 int flags = 0;
70
71 DEBUG_CALL("m_get");
72
73 if (slirp->m_freelist.qh_link == &slirp->m_freelist) {
74 m = (struct mbuf *)malloc(SLIRP_MSIZE);
75 if (m == NULL) goto end_error;
76 slirp->mbuf_alloced++;
77 if (slirp->mbuf_alloced > MBUF_THRESH)
78 flags = M_DOFREE;
79 m->slirp = slirp;
80 } else {
81 m = (struct mbuf *) slirp->m_freelist.qh_link;
82 remque(m);
83 }
84
85
86 insque(m,&slirp->m_usedlist);
87 m->m_flags = (flags | M_USEDLIST);
88
89
90 m->m_size = SLIRP_MSIZE - offsetof(struct mbuf, m_dat);
91 m->m_data = m->m_dat;
92 m->m_len = 0;
93 m->m_nextpkt = NULL;
94 m->m_prevpkt = NULL;
95 m->resolution_requested = false;
96 m->expiration_date = (uint64_t)-1;
97end_error:
98 DEBUG_ARG("m = %p", m);
99 return m;
100}
101
102void
103m_free(struct mbuf *m)
104{
105
106 DEBUG_CALL("m_free");
107 DEBUG_ARG("m = %p", m);
108
109 if(m) {
110
111 if (m->m_flags & M_USEDLIST)
112 remque(m);
113
114
115 if (m->m_flags & M_EXT)
116 free(m->m_ext);
117
118
119
120
121 if (m->m_flags & M_DOFREE) {
122 m->slirp->mbuf_alloced--;
123 free(m);
124 } else if ((m->m_flags & M_FREELIST) == 0) {
125 insque(m,&m->slirp->m_freelist);
126 m->m_flags = M_FREELIST;
127 }
128 }
129}
130
131
132
133
134
135
136void
137m_cat(struct mbuf *m, struct mbuf *n)
138{
139
140
141
142 if (M_FREEROOM(m) < n->m_len)
143 m_inc(m,m->m_size+MINCSIZE);
144
145 memcpy(m->m_data+m->m_len, n->m_data, n->m_len);
146 m->m_len += n->m_len;
147
148 m_free(n);
149}
150
151
152
153void
154m_inc(struct mbuf *m, int size)
155{
156 int datasize;
157
158
159 if(m->m_size>size) return;
160
161 if (m->m_flags & M_EXT) {
162 datasize = m->m_data - m->m_ext;
163 m->m_ext = (char *)realloc(m->m_ext,size);
164 m->m_data = m->m_ext + datasize;
165 } else {
166 char *dat;
167 datasize = m->m_data - m->m_dat;
168 dat = (char *)malloc(size);
169 memcpy(dat, m->m_dat, m->m_size);
170
171 m->m_ext = dat;
172 m->m_data = m->m_ext + datasize;
173 m->m_flags |= M_EXT;
174 }
175
176 m->m_size = size;
177
178}
179
180
181
182void
183m_adj(struct mbuf *m, int len)
184{
185 if (m == NULL)
186 return;
187 if (len >= 0) {
188
189 m->m_data += len;
190 m->m_len -= len;
191 } else {
192
193 len = -len;
194 m->m_len -= len;
195 }
196}
197
198
199
200
201
202int
203m_copy(struct mbuf *n, struct mbuf *m, int off, int len)
204{
205 if (len > M_FREEROOM(n))
206 return -1;
207
208 memcpy((n->m_data + n->m_len), (m->m_data + off), len);
209 n->m_len += len;
210 return 0;
211}
212
213
214
215
216
217
218
219struct mbuf *
220dtom(Slirp *slirp, void *dat)
221{
222 struct mbuf *m;
223
224 DEBUG_CALL("dtom");
225 DEBUG_ARG("dat = %p", dat);
226
227
228 for (m = (struct mbuf *) slirp->m_usedlist.qh_link;
229 (struct quehead *) m != &slirp->m_usedlist;
230 m = m->m_next) {
231 if (m->m_flags & M_EXT) {
232 if( (char *)dat>=m->m_ext && (char *)dat<(m->m_ext + m->m_size) )
233 return m;
234 } else {
235 if( (char *)dat >= m->m_dat && (char *)dat<(m->m_dat + m->m_size) )
236 return m;
237 }
238 }
239
240 DEBUG_ERROR((dfd, "dtom failed"));
241
242 return (struct mbuf *)0;
243}
244