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 g_free(m->m_ext);
45 }
46 g_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 g_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 = g_malloc(SLIRP_MSIZE);
75 slirp->mbuf_alloced++;
76 if (slirp->mbuf_alloced > MBUF_THRESH)
77 flags = M_DOFREE;
78 m->slirp = slirp;
79 } else {
80 m = (struct mbuf *) slirp->m_freelist.qh_link;
81 remque(m);
82 }
83
84
85 insque(m,&slirp->m_usedlist);
86 m->m_flags = (flags | M_USEDLIST);
87
88
89 m->m_size = SLIRP_MSIZE - offsetof(struct mbuf, m_dat);
90 m->m_data = m->m_dat;
91 m->m_len = 0;
92 m->m_nextpkt = NULL;
93 m->m_prevpkt = NULL;
94 m->resolution_requested = false;
95 m->expiration_date = (uint64_t)-1;
96 DEBUG_ARG("m = %p", m);
97 return m;
98}
99
100void
101m_free(struct mbuf *m)
102{
103
104 DEBUG_CALL("m_free");
105 DEBUG_ARG("m = %p", m);
106
107 if(m) {
108
109 if (m->m_flags & M_USEDLIST)
110 remque(m);
111
112
113 if (m->m_flags & M_EXT) {
114 g_free(m->m_ext);
115 }
116
117
118
119 if (m->m_flags & M_DOFREE) {
120 m->slirp->mbuf_alloced--;
121 g_free(m);
122 } else if ((m->m_flags & M_FREELIST) == 0) {
123 insque(m,&m->slirp->m_freelist);
124 m->m_flags = M_FREELIST;
125 }
126 }
127}
128
129
130
131
132
133
134void
135m_cat(struct mbuf *m, struct mbuf *n)
136{
137
138
139
140 if (M_FREEROOM(m) < n->m_len)
141 m_inc(m, m->m_len + n->m_len);
142
143 memcpy(m->m_data+m->m_len, n->m_data, n->m_len);
144 m->m_len += n->m_len;
145
146 m_free(n);
147}
148
149
150
151void
152m_inc(struct mbuf *m, int size)
153{
154 int datasize;
155
156
157 if (M_ROOM(m) > size) {
158 return;
159 }
160
161 if (m->m_flags & M_EXT) {
162 datasize = m->m_data - m->m_ext;
163 m->m_ext = g_realloc(m->m_ext, size + datasize);
164 } else {
165 datasize = m->m_data - m->m_dat;
166 m->m_ext = g_malloc(size + datasize);
167 memcpy(m->m_ext, m->m_dat, m->m_size);
168 m->m_flags |= M_EXT;
169 }
170
171 m->m_data = m->m_ext + datasize;
172 m->m_size = size + datasize;
173}
174
175
176
177void
178m_adj(struct mbuf *m, int len)
179{
180 if (m == NULL)
181 return;
182 if (len >= 0) {
183
184 m->m_data += len;
185 m->m_len -= len;
186 } else {
187
188 len = -len;
189 m->m_len -= len;
190 }
191}
192
193
194
195
196
197int
198m_copy(struct mbuf *n, struct mbuf *m, int off, int len)
199{
200 if (len > M_FREEROOM(n))
201 return -1;
202
203 memcpy((n->m_data + n->m_len), (m->m_data + off), len);
204 n->m_len += len;
205 return 0;
206}
207
208
209
210
211
212
213
214struct mbuf *
215dtom(Slirp *slirp, void *dat)
216{
217 struct mbuf *m;
218
219 DEBUG_CALL("dtom");
220 DEBUG_ARG("dat = %p", dat);
221
222
223 for (m = (struct mbuf *) slirp->m_usedlist.qh_link;
224 (struct quehead *) m != &slirp->m_usedlist;
225 m = m->m_next) {
226 if (m->m_flags & M_EXT) {
227 if( (char *)dat>=m->m_ext && (char *)dat<(m->m_ext + m->m_size) )
228 return m;
229 } else {
230 if( (char *)dat >= m->m_dat && (char *)dat<(m->m_dat + m->m_size) )
231 return m;
232 }
233 }
234
235 DEBUG_ERROR((dfd, "dtom failed"));
236
237 return (struct mbuf *)0;
238}
239