npf_mbuf.c revision 1.20 1 1.20 maxv /* $NetBSD: npf_mbuf.c,v 1.20 2018/08/10 06:46:09 maxv Exp $ */
2 1.1 rmind
3 1.1 rmind /*-
4 1.9 rmind * Copyright (c) 2009-2012 The NetBSD Foundation, Inc.
5 1.1 rmind * All rights reserved.
6 1.1 rmind *
7 1.1 rmind * This material is based upon work partially supported by The
8 1.1 rmind * NetBSD Foundation under a contract with Mindaugas Rasiukevicius.
9 1.1 rmind *
10 1.1 rmind * Redistribution and use in source and binary forms, with or without
11 1.1 rmind * modification, are permitted provided that the following conditions
12 1.1 rmind * are met:
13 1.1 rmind * 1. Redistributions of source code must retain the above copyright
14 1.1 rmind * notice, this list of conditions and the following disclaimer.
15 1.1 rmind * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 rmind * notice, this list of conditions and the following disclaimer in the
17 1.1 rmind * documentation and/or other materials provided with the distribution.
18 1.1 rmind *
19 1.1 rmind * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 rmind * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 rmind * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 rmind * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 rmind * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 rmind * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 rmind * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 rmind * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 rmind * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 rmind * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 rmind * POSSIBILITY OF SUCH DAMAGE.
30 1.1 rmind */
31 1.1 rmind
32 1.1 rmind /*
33 1.1 rmind * NPF network buffer management interface.
34 1.1 rmind *
35 1.1 rmind * Network buffer in NetBSD is mbuf. Internal mbuf structures are
36 1.1 rmind * abstracted within this source.
37 1.1 rmind */
38 1.1 rmind
39 1.18 christos #ifdef _KERNEL
40 1.1 rmind #include <sys/cdefs.h>
41 1.20 maxv __KERNEL_RCSID(0, "$NetBSD: npf_mbuf.c,v 1.20 2018/08/10 06:46:09 maxv Exp $");
42 1.1 rmind
43 1.1 rmind #include <sys/param.h>
44 1.1 rmind #include <sys/mbuf.h>
45 1.19 maxv #include <netinet/in_offload.h>
46 1.18 christos #endif
47 1.1 rmind
48 1.1 rmind #include "npf_impl.h"
49 1.1 rmind
50 1.20 maxv #ifdef _KERNEL
51 1.20 maxv #ifdef INET6
52 1.20 maxv #include <netinet6/in6.h>
53 1.20 maxv #include <netinet6/in6_offload.h>
54 1.20 maxv #endif
55 1.20 maxv #endif
56 1.20 maxv
57 1.18 christos #if defined(_NPF_STANDALONE)
58 1.18 christos #define m_length(m) (nbuf)->nb_mops->getchainlen(m)
59 1.18 christos #define m_buflen(m) (nbuf)->nb_mops->getlen(m)
60 1.18 christos #define m_next_ptr(m) (nbuf)->nb_mops->getnext(m)
61 1.18 christos #define m_ensure_contig(m,t) (nbuf)->nb_mops->ensure_contig((m), (t))
62 1.18 christos #define m_makewritable(m,o,l,f) (nbuf)->nb_mops->ensure_writable((m), (o+l))
63 1.18 christos #define mtod(m,t) ((t)((nbuf)->nb_mops->getdata(m)))
64 1.18 christos #define m_flags_p(m,f) true
65 1.18 christos #else
66 1.18 christos #define m_next_ptr(m) (m)->m_next
67 1.18 christos #define m_buflen(m) (m)->m_len
68 1.18 christos #define m_flags_p(m,f) (((m)->m_flags & (f)) != 0)
69 1.18 christos #endif
70 1.18 christos
71 1.9 rmind #define NBUF_ENSURE_ALIGN (MAX(COHERENCY_UNIT, 64))
72 1.9 rmind #define NBUF_ENSURE_MASK (NBUF_ENSURE_ALIGN - 1)
73 1.9 rmind #define NBUF_ENSURE_ROUNDUP(x) (((x) + NBUF_ENSURE_ALIGN) & ~NBUF_ENSURE_MASK)
74 1.9 rmind
75 1.9 rmind void
76 1.18 christos nbuf_init(npf_t *npf, nbuf_t *nbuf, struct mbuf *m, const ifnet_t *ifp)
77 1.9 rmind {
78 1.18 christos u_int ifid = npf_ifmap_getid(npf, ifp);
79 1.12 rmind
80 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
81 1.18 christos nbuf->nb_mops = npf->mbufops;
82 1.9 rmind
83 1.9 rmind nbuf->nb_mbuf0 = m;
84 1.9 rmind nbuf->nb_ifp = ifp;
85 1.14 rmind nbuf->nb_ifid = ifid;
86 1.9 rmind nbuf_reset(nbuf);
87 1.9 rmind }
88 1.9 rmind
89 1.9 rmind void
90 1.9 rmind nbuf_reset(nbuf_t *nbuf)
91 1.9 rmind {
92 1.9 rmind struct mbuf *m = nbuf->nb_mbuf0;
93 1.9 rmind
94 1.9 rmind nbuf->nb_mbuf = m;
95 1.9 rmind nbuf->nb_nptr = mtod(m, void *);
96 1.9 rmind }
97 1.9 rmind
98 1.1 rmind void *
99 1.1 rmind nbuf_dataptr(nbuf_t *nbuf)
100 1.1 rmind {
101 1.9 rmind KASSERT(nbuf->nb_nptr);
102 1.9 rmind return nbuf->nb_nptr;
103 1.9 rmind }
104 1.9 rmind
105 1.9 rmind size_t
106 1.9 rmind nbuf_offset(const nbuf_t *nbuf)
107 1.9 rmind {
108 1.9 rmind const struct mbuf *m = nbuf->nb_mbuf;
109 1.9 rmind const u_int off = (uintptr_t)nbuf->nb_nptr - mtod(m, uintptr_t);
110 1.9 rmind const int poff = m_length(nbuf->nb_mbuf0) - m_length(m) + off;
111 1.9 rmind
112 1.9 rmind return poff;
113 1.9 rmind }
114 1.9 rmind
115 1.9 rmind struct mbuf *
116 1.9 rmind nbuf_head_mbuf(nbuf_t *nbuf)
117 1.9 rmind {
118 1.9 rmind return nbuf->nb_mbuf0;
119 1.9 rmind }
120 1.1 rmind
121 1.9 rmind bool
122 1.9 rmind nbuf_flag_p(const nbuf_t *nbuf, int flag)
123 1.9 rmind {
124 1.9 rmind return (nbuf->nb_flags & flag) != 0;
125 1.9 rmind }
126 1.9 rmind
127 1.9 rmind void
128 1.9 rmind nbuf_unset_flag(nbuf_t *nbuf, int flag)
129 1.9 rmind {
130 1.9 rmind nbuf->nb_flags &= ~flag;
131 1.1 rmind }
132 1.1 rmind
133 1.1 rmind /*
134 1.9 rmind * nbuf_advance: advance in nbuf or chain by specified amount of bytes and,
135 1.9 rmind * if requested, ensure that the area *after* advance is contiguous.
136 1.1 rmind *
137 1.9 rmind * => Returns new pointer to data in nbuf or NULL if offset is invalid.
138 1.9 rmind * => Current nbuf and the offset is stored in the nbuf metadata.
139 1.1 rmind */
140 1.1 rmind void *
141 1.9 rmind nbuf_advance(nbuf_t *nbuf, size_t len, size_t ensure)
142 1.1 rmind {
143 1.9 rmind struct mbuf *m = nbuf->nb_mbuf;
144 1.1 rmind u_int off, wmark;
145 1.1 rmind uint8_t *d;
146 1.1 rmind
147 1.1 rmind /* Offset with amount to advance. */
148 1.9 rmind off = (uintptr_t)nbuf->nb_nptr - mtod(m, uintptr_t) + len;
149 1.18 christos wmark = m_buflen(m);
150 1.1 rmind
151 1.1 rmind /* Find the mbuf according to offset. */
152 1.1 rmind while (__predict_false(wmark <= off)) {
153 1.18 christos m = m_next_ptr(m);
154 1.1 rmind if (__predict_false(m == NULL)) {
155 1.1 rmind /*
156 1.9 rmind * If end of the chain, then the offset is
157 1.1 rmind * higher than packet length.
158 1.1 rmind */
159 1.1 rmind return NULL;
160 1.1 rmind }
161 1.18 christos wmark += m_buflen(m);
162 1.1 rmind }
163 1.9 rmind KASSERT(off < m_length(nbuf->nb_mbuf0));
164 1.1 rmind
165 1.1 rmind /* Offset in mbuf data. */
166 1.1 rmind d = mtod(m, uint8_t *);
167 1.18 christos KASSERT(off >= (wmark - m_buflen(m)));
168 1.18 christos d += (off - (wmark - m_buflen(m)));
169 1.1 rmind
170 1.9 rmind nbuf->nb_mbuf = m;
171 1.9 rmind nbuf->nb_nptr = d;
172 1.9 rmind
173 1.9 rmind if (ensure) {
174 1.9 rmind /* Ensure contiguousness (may change nbuf chain). */
175 1.9 rmind d = nbuf_ensure_contig(nbuf, ensure);
176 1.9 rmind }
177 1.1 rmind return d;
178 1.1 rmind }
179 1.1 rmind
180 1.1 rmind /*
181 1.9 rmind * nbuf_ensure_contig: check whether the specified length from the current
182 1.9 rmind * point in the nbuf is contiguous. If not, rearrange the chain to be so.
183 1.1 rmind *
184 1.9 rmind * => Returns pointer to the data at the current offset in the buffer.
185 1.9 rmind * => Returns NULL on failure and nbuf becomes invalid.
186 1.1 rmind */
187 1.9 rmind void *
188 1.9 rmind nbuf_ensure_contig(nbuf_t *nbuf, size_t len)
189 1.1 rmind {
190 1.10 rmind const struct mbuf * const n = nbuf->nb_mbuf;
191 1.10 rmind const size_t off = (uintptr_t)nbuf->nb_nptr - mtod(n, uintptr_t);
192 1.9 rmind
193 1.18 christos KASSERT(off <= m_buflen(n));
194 1.9 rmind
195 1.18 christos if (__predict_false(m_buflen(n) < (off + len))) {
196 1.10 rmind struct mbuf *m = nbuf->nb_mbuf0;
197 1.10 rmind const size_t foff = nbuf_offset(nbuf);
198 1.10 rmind const size_t plen = m_length(m);
199 1.18 christos const size_t mlen = m_buflen(m);
200 1.10 rmind size_t target;
201 1.10 rmind bool success;
202 1.9 rmind
203 1.18 christos //npf_stats_inc(npf, NPF_STAT_NBUF_NONCONTIG);
204 1.9 rmind
205 1.9 rmind /* Attempt to round-up to NBUF_ENSURE_ALIGN bytes. */
206 1.10 rmind if ((target = NBUF_ENSURE_ROUNDUP(foff + len)) > plen) {
207 1.10 rmind target = foff + len;
208 1.9 rmind }
209 1.1 rmind
210 1.9 rmind /* Rearrange the chain to be contiguous. */
211 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
212 1.10 rmind success = m_ensure_contig(&m, target);
213 1.10 rmind KASSERT(m != NULL);
214 1.10 rmind
215 1.10 rmind /* If no change in the chain: return what we have. */
216 1.18 christos if (m == nbuf->nb_mbuf0 && m_buflen(m) == mlen) {
217 1.10 rmind return success ? nbuf->nb_nptr : NULL;
218 1.9 rmind }
219 1.1 rmind
220 1.9 rmind /*
221 1.10 rmind * The mbuf chain was re-arranged. Update the pointers
222 1.10 rmind * accordingly and indicate that the references to the data
223 1.10 rmind * might need a reset.
224 1.9 rmind */
225 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
226 1.10 rmind nbuf->nb_mbuf0 = m;
227 1.10 rmind nbuf->nb_mbuf = m;
228 1.10 rmind
229 1.18 christos KASSERT(foff < m_buflen(m) && foff < m_length(m));
230 1.10 rmind nbuf->nb_nptr = mtod(m, uint8_t *) + foff;
231 1.10 rmind nbuf->nb_flags |= NBUF_DATAREF_RESET;
232 1.10 rmind
233 1.10 rmind if (!success) {
234 1.18 christos //npf_stats_inc(npf, NPF_STAT_NBUF_CONTIG_FAIL);
235 1.10 rmind return NULL;
236 1.1 rmind }
237 1.1 rmind }
238 1.9 rmind return nbuf->nb_nptr;
239 1.1 rmind }
240 1.1 rmind
241 1.9 rmind void *
242 1.9 rmind nbuf_ensure_writable(nbuf_t *nbuf, size_t len)
243 1.1 rmind {
244 1.9 rmind struct mbuf *m = nbuf->nb_mbuf;
245 1.9 rmind const u_int off = (uintptr_t)nbuf->nb_nptr - mtod(m, uintptr_t);
246 1.9 rmind const int tlen = off + len;
247 1.9 rmind bool head_buf;
248 1.1 rmind
249 1.9 rmind KASSERT(off < m_length(nbuf->nb_mbuf0));
250 1.1 rmind
251 1.9 rmind if (!M_UNWRITABLE(m, tlen)) {
252 1.9 rmind return nbuf->nb_nptr;
253 1.9 rmind }
254 1.9 rmind head_buf = (nbuf->nb_mbuf0 == m);
255 1.9 rmind if (m_makewritable(&m, 0, tlen, M_NOWAIT)) {
256 1.9 rmind memset(nbuf, 0, sizeof(nbuf_t));
257 1.9 rmind return NULL;
258 1.9 rmind }
259 1.9 rmind if (head_buf) {
260 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
261 1.9 rmind KASSERT(off < m_length(m));
262 1.9 rmind nbuf->nb_mbuf0 = m;
263 1.9 rmind }
264 1.9 rmind nbuf->nb_mbuf = m;
265 1.9 rmind nbuf->nb_nptr = mtod(m, uint8_t *) + off;
266 1.1 rmind
267 1.9 rmind return nbuf->nb_nptr;
268 1.1 rmind }
269 1.1 rmind
270 1.9 rmind bool
271 1.9 rmind nbuf_cksum_barrier(nbuf_t *nbuf, int di)
272 1.3 rmind {
273 1.18 christos #ifdef _KERNEL
274 1.9 rmind struct mbuf *m;
275 1.3 rmind
276 1.9 rmind if (di != PFIL_OUT) {
277 1.9 rmind return false;
278 1.5 rmind }
279 1.9 rmind m = nbuf->nb_mbuf0;
280 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
281 1.8 rmind
282 1.8 rmind if (m->m_pkthdr.csum_flags & (M_CSUM_TCPv4 | M_CSUM_UDPv4)) {
283 1.19 maxv in_undefer_cksum_tcpudp(m);
284 1.8 rmind m->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv4 | M_CSUM_UDPv4);
285 1.9 rmind return true;
286 1.8 rmind }
287 1.16 mrg #ifdef INET6
288 1.15 mlelstv if (m->m_pkthdr.csum_flags & (M_CSUM_TCPv6 | M_CSUM_UDPv6)) {
289 1.20 maxv in6_undefer_cksum_tcpudp(m);
290 1.15 mlelstv m->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv6 | M_CSUM_UDPv6);
291 1.15 mlelstv return true;
292 1.15 mlelstv }
293 1.16 mrg #endif
294 1.18 christos #else
295 1.18 christos (void)nbuf; (void)di;
296 1.18 christos #endif
297 1.9 rmind return false;
298 1.8 rmind }
299 1.8 rmind
300 1.5 rmind /*
301 1.1 rmind * nbuf_add_tag: add a tag to specified network buffer.
302 1.1 rmind *
303 1.9 rmind * => Returns 0 on success or errno on failure.
304 1.1 rmind */
305 1.1 rmind int
306 1.17 rmind nbuf_add_tag(nbuf_t *nbuf, uint32_t val)
307 1.1 rmind {
308 1.18 christos #ifdef _KERNEL
309 1.9 rmind struct mbuf *m = nbuf->nb_mbuf0;
310 1.1 rmind struct m_tag *mt;
311 1.1 rmind uint32_t *dat;
312 1.1 rmind
313 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
314 1.9 rmind
315 1.1 rmind mt = m_tag_get(PACKET_TAG_NPF, sizeof(uint32_t), M_NOWAIT);
316 1.9 rmind if (mt == NULL) {
317 1.1 rmind return ENOMEM;
318 1.1 rmind }
319 1.1 rmind dat = (uint32_t *)(mt + 1);
320 1.1 rmind *dat = val;
321 1.1 rmind m_tag_prepend(m, mt);
322 1.1 rmind return 0;
323 1.18 christos #else
324 1.18 christos (void)nbuf; (void)val;
325 1.18 christos return ENOTSUP;
326 1.18 christos #endif
327 1.1 rmind }
328 1.1 rmind
329 1.1 rmind /*
330 1.1 rmind * nbuf_find_tag: find a tag in specified network buffer.
331 1.1 rmind *
332 1.9 rmind * => Returns 0 on success or errno on failure.
333 1.1 rmind */
334 1.1 rmind int
335 1.17 rmind nbuf_find_tag(nbuf_t *nbuf, uint32_t *val)
336 1.1 rmind {
337 1.18 christos #ifdef _KERNEL
338 1.9 rmind struct mbuf *m = nbuf->nb_mbuf0;
339 1.1 rmind struct m_tag *mt;
340 1.1 rmind
341 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
342 1.9 rmind
343 1.1 rmind mt = m_tag_find(m, PACKET_TAG_NPF, NULL);
344 1.9 rmind if (mt == NULL) {
345 1.1 rmind return EINVAL;
346 1.1 rmind }
347 1.17 rmind *val = *(uint32_t *)(mt + 1);
348 1.1 rmind return 0;
349 1.18 christos #else
350 1.18 christos (void)nbuf; (void)val;
351 1.18 christos return ENOTSUP;
352 1.18 christos #endif
353 1.1 rmind }
354