npf_mbuf.c revision 1.19 1 1.19 maxv /* $NetBSD: npf_mbuf.c,v 1.19 2018/07/11 05:25:45 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.19 maxv __KERNEL_RCSID(0, "$NetBSD: npf_mbuf.c,v 1.19 2018/07/11 05:25:45 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.18 christos #if defined(_NPF_STANDALONE)
51 1.18 christos #define m_length(m) (nbuf)->nb_mops->getchainlen(m)
52 1.18 christos #define m_buflen(m) (nbuf)->nb_mops->getlen(m)
53 1.18 christos #define m_next_ptr(m) (nbuf)->nb_mops->getnext(m)
54 1.18 christos #define m_ensure_contig(m,t) (nbuf)->nb_mops->ensure_contig((m), (t))
55 1.18 christos #define m_makewritable(m,o,l,f) (nbuf)->nb_mops->ensure_writable((m), (o+l))
56 1.18 christos #define mtod(m,t) ((t)((nbuf)->nb_mops->getdata(m)))
57 1.18 christos #define m_flags_p(m,f) true
58 1.18 christos #else
59 1.18 christos #define m_next_ptr(m) (m)->m_next
60 1.18 christos #define m_buflen(m) (m)->m_len
61 1.18 christos #define m_flags_p(m,f) (((m)->m_flags & (f)) != 0)
62 1.18 christos #endif
63 1.18 christos
64 1.9 rmind #define NBUF_ENSURE_ALIGN (MAX(COHERENCY_UNIT, 64))
65 1.9 rmind #define NBUF_ENSURE_MASK (NBUF_ENSURE_ALIGN - 1)
66 1.9 rmind #define NBUF_ENSURE_ROUNDUP(x) (((x) + NBUF_ENSURE_ALIGN) & ~NBUF_ENSURE_MASK)
67 1.9 rmind
68 1.9 rmind void
69 1.18 christos nbuf_init(npf_t *npf, nbuf_t *nbuf, struct mbuf *m, const ifnet_t *ifp)
70 1.9 rmind {
71 1.18 christos u_int ifid = npf_ifmap_getid(npf, ifp);
72 1.12 rmind
73 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
74 1.18 christos nbuf->nb_mops = npf->mbufops;
75 1.9 rmind
76 1.9 rmind nbuf->nb_mbuf0 = m;
77 1.9 rmind nbuf->nb_ifp = ifp;
78 1.14 rmind nbuf->nb_ifid = ifid;
79 1.9 rmind nbuf_reset(nbuf);
80 1.9 rmind }
81 1.9 rmind
82 1.9 rmind void
83 1.9 rmind nbuf_reset(nbuf_t *nbuf)
84 1.9 rmind {
85 1.9 rmind struct mbuf *m = nbuf->nb_mbuf0;
86 1.9 rmind
87 1.9 rmind nbuf->nb_mbuf = m;
88 1.9 rmind nbuf->nb_nptr = mtod(m, void *);
89 1.9 rmind }
90 1.9 rmind
91 1.1 rmind void *
92 1.1 rmind nbuf_dataptr(nbuf_t *nbuf)
93 1.1 rmind {
94 1.9 rmind KASSERT(nbuf->nb_nptr);
95 1.9 rmind return nbuf->nb_nptr;
96 1.9 rmind }
97 1.9 rmind
98 1.9 rmind size_t
99 1.9 rmind nbuf_offset(const nbuf_t *nbuf)
100 1.9 rmind {
101 1.9 rmind const struct mbuf *m = nbuf->nb_mbuf;
102 1.9 rmind const u_int off = (uintptr_t)nbuf->nb_nptr - mtod(m, uintptr_t);
103 1.9 rmind const int poff = m_length(nbuf->nb_mbuf0) - m_length(m) + off;
104 1.9 rmind
105 1.9 rmind return poff;
106 1.9 rmind }
107 1.9 rmind
108 1.9 rmind struct mbuf *
109 1.9 rmind nbuf_head_mbuf(nbuf_t *nbuf)
110 1.9 rmind {
111 1.9 rmind return nbuf->nb_mbuf0;
112 1.9 rmind }
113 1.1 rmind
114 1.9 rmind bool
115 1.9 rmind nbuf_flag_p(const nbuf_t *nbuf, int flag)
116 1.9 rmind {
117 1.9 rmind return (nbuf->nb_flags & flag) != 0;
118 1.9 rmind }
119 1.9 rmind
120 1.9 rmind void
121 1.9 rmind nbuf_unset_flag(nbuf_t *nbuf, int flag)
122 1.9 rmind {
123 1.9 rmind nbuf->nb_flags &= ~flag;
124 1.1 rmind }
125 1.1 rmind
126 1.1 rmind /*
127 1.9 rmind * nbuf_advance: advance in nbuf or chain by specified amount of bytes and,
128 1.9 rmind * if requested, ensure that the area *after* advance is contiguous.
129 1.1 rmind *
130 1.9 rmind * => Returns new pointer to data in nbuf or NULL if offset is invalid.
131 1.9 rmind * => Current nbuf and the offset is stored in the nbuf metadata.
132 1.1 rmind */
133 1.1 rmind void *
134 1.9 rmind nbuf_advance(nbuf_t *nbuf, size_t len, size_t ensure)
135 1.1 rmind {
136 1.9 rmind struct mbuf *m = nbuf->nb_mbuf;
137 1.1 rmind u_int off, wmark;
138 1.1 rmind uint8_t *d;
139 1.1 rmind
140 1.1 rmind /* Offset with amount to advance. */
141 1.9 rmind off = (uintptr_t)nbuf->nb_nptr - mtod(m, uintptr_t) + len;
142 1.18 christos wmark = m_buflen(m);
143 1.1 rmind
144 1.1 rmind /* Find the mbuf according to offset. */
145 1.1 rmind while (__predict_false(wmark <= off)) {
146 1.18 christos m = m_next_ptr(m);
147 1.1 rmind if (__predict_false(m == NULL)) {
148 1.1 rmind /*
149 1.9 rmind * If end of the chain, then the offset is
150 1.1 rmind * higher than packet length.
151 1.1 rmind */
152 1.1 rmind return NULL;
153 1.1 rmind }
154 1.18 christos wmark += m_buflen(m);
155 1.1 rmind }
156 1.9 rmind KASSERT(off < m_length(nbuf->nb_mbuf0));
157 1.1 rmind
158 1.1 rmind /* Offset in mbuf data. */
159 1.1 rmind d = mtod(m, uint8_t *);
160 1.18 christos KASSERT(off >= (wmark - m_buflen(m)));
161 1.18 christos d += (off - (wmark - m_buflen(m)));
162 1.1 rmind
163 1.9 rmind nbuf->nb_mbuf = m;
164 1.9 rmind nbuf->nb_nptr = d;
165 1.9 rmind
166 1.9 rmind if (ensure) {
167 1.9 rmind /* Ensure contiguousness (may change nbuf chain). */
168 1.9 rmind d = nbuf_ensure_contig(nbuf, ensure);
169 1.9 rmind }
170 1.1 rmind return d;
171 1.1 rmind }
172 1.1 rmind
173 1.1 rmind /*
174 1.9 rmind * nbuf_ensure_contig: check whether the specified length from the current
175 1.9 rmind * point in the nbuf is contiguous. If not, rearrange the chain to be so.
176 1.1 rmind *
177 1.9 rmind * => Returns pointer to the data at the current offset in the buffer.
178 1.9 rmind * => Returns NULL on failure and nbuf becomes invalid.
179 1.1 rmind */
180 1.9 rmind void *
181 1.9 rmind nbuf_ensure_contig(nbuf_t *nbuf, size_t len)
182 1.1 rmind {
183 1.10 rmind const struct mbuf * const n = nbuf->nb_mbuf;
184 1.10 rmind const size_t off = (uintptr_t)nbuf->nb_nptr - mtod(n, uintptr_t);
185 1.9 rmind
186 1.18 christos KASSERT(off <= m_buflen(n));
187 1.9 rmind
188 1.18 christos if (__predict_false(m_buflen(n) < (off + len))) {
189 1.10 rmind struct mbuf *m = nbuf->nb_mbuf0;
190 1.10 rmind const size_t foff = nbuf_offset(nbuf);
191 1.10 rmind const size_t plen = m_length(m);
192 1.18 christos const size_t mlen = m_buflen(m);
193 1.10 rmind size_t target;
194 1.10 rmind bool success;
195 1.9 rmind
196 1.18 christos //npf_stats_inc(npf, NPF_STAT_NBUF_NONCONTIG);
197 1.9 rmind
198 1.9 rmind /* Attempt to round-up to NBUF_ENSURE_ALIGN bytes. */
199 1.10 rmind if ((target = NBUF_ENSURE_ROUNDUP(foff + len)) > plen) {
200 1.10 rmind target = foff + len;
201 1.9 rmind }
202 1.1 rmind
203 1.9 rmind /* Rearrange the chain to be contiguous. */
204 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
205 1.10 rmind success = m_ensure_contig(&m, target);
206 1.10 rmind KASSERT(m != NULL);
207 1.10 rmind
208 1.10 rmind /* If no change in the chain: return what we have. */
209 1.18 christos if (m == nbuf->nb_mbuf0 && m_buflen(m) == mlen) {
210 1.10 rmind return success ? nbuf->nb_nptr : NULL;
211 1.9 rmind }
212 1.1 rmind
213 1.9 rmind /*
214 1.10 rmind * The mbuf chain was re-arranged. Update the pointers
215 1.10 rmind * accordingly and indicate that the references to the data
216 1.10 rmind * might need a reset.
217 1.9 rmind */
218 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
219 1.10 rmind nbuf->nb_mbuf0 = m;
220 1.10 rmind nbuf->nb_mbuf = m;
221 1.10 rmind
222 1.18 christos KASSERT(foff < m_buflen(m) && foff < m_length(m));
223 1.10 rmind nbuf->nb_nptr = mtod(m, uint8_t *) + foff;
224 1.10 rmind nbuf->nb_flags |= NBUF_DATAREF_RESET;
225 1.10 rmind
226 1.10 rmind if (!success) {
227 1.18 christos //npf_stats_inc(npf, NPF_STAT_NBUF_CONTIG_FAIL);
228 1.10 rmind return NULL;
229 1.1 rmind }
230 1.1 rmind }
231 1.9 rmind return nbuf->nb_nptr;
232 1.1 rmind }
233 1.1 rmind
234 1.9 rmind void *
235 1.9 rmind nbuf_ensure_writable(nbuf_t *nbuf, size_t len)
236 1.1 rmind {
237 1.9 rmind struct mbuf *m = nbuf->nb_mbuf;
238 1.9 rmind const u_int off = (uintptr_t)nbuf->nb_nptr - mtod(m, uintptr_t);
239 1.9 rmind const int tlen = off + len;
240 1.9 rmind bool head_buf;
241 1.1 rmind
242 1.9 rmind KASSERT(off < m_length(nbuf->nb_mbuf0));
243 1.1 rmind
244 1.9 rmind if (!M_UNWRITABLE(m, tlen)) {
245 1.9 rmind return nbuf->nb_nptr;
246 1.9 rmind }
247 1.9 rmind head_buf = (nbuf->nb_mbuf0 == m);
248 1.9 rmind if (m_makewritable(&m, 0, tlen, M_NOWAIT)) {
249 1.9 rmind memset(nbuf, 0, sizeof(nbuf_t));
250 1.9 rmind return NULL;
251 1.9 rmind }
252 1.9 rmind if (head_buf) {
253 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
254 1.9 rmind KASSERT(off < m_length(m));
255 1.9 rmind nbuf->nb_mbuf0 = m;
256 1.9 rmind }
257 1.9 rmind nbuf->nb_mbuf = m;
258 1.9 rmind nbuf->nb_nptr = mtod(m, uint8_t *) + off;
259 1.1 rmind
260 1.9 rmind return nbuf->nb_nptr;
261 1.1 rmind }
262 1.1 rmind
263 1.9 rmind bool
264 1.9 rmind nbuf_cksum_barrier(nbuf_t *nbuf, int di)
265 1.3 rmind {
266 1.18 christos #ifdef _KERNEL
267 1.9 rmind struct mbuf *m;
268 1.3 rmind
269 1.9 rmind if (di != PFIL_OUT) {
270 1.9 rmind return false;
271 1.5 rmind }
272 1.9 rmind m = nbuf->nb_mbuf0;
273 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
274 1.8 rmind
275 1.8 rmind if (m->m_pkthdr.csum_flags & (M_CSUM_TCPv4 | M_CSUM_UDPv4)) {
276 1.19 maxv in_undefer_cksum_tcpudp(m);
277 1.8 rmind m->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv4 | M_CSUM_UDPv4);
278 1.9 rmind return true;
279 1.8 rmind }
280 1.16 mrg #ifdef INET6
281 1.15 mlelstv if (m->m_pkthdr.csum_flags & (M_CSUM_TCPv6 | M_CSUM_UDPv6)) {
282 1.15 mlelstv in6_delayed_cksum(m);
283 1.15 mlelstv m->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv6 | M_CSUM_UDPv6);
284 1.15 mlelstv return true;
285 1.15 mlelstv }
286 1.16 mrg #endif
287 1.18 christos #else
288 1.18 christos (void)nbuf; (void)di;
289 1.18 christos #endif
290 1.9 rmind return false;
291 1.8 rmind }
292 1.8 rmind
293 1.5 rmind /*
294 1.1 rmind * nbuf_add_tag: add a tag to specified network buffer.
295 1.1 rmind *
296 1.9 rmind * => Returns 0 on success or errno on failure.
297 1.1 rmind */
298 1.1 rmind int
299 1.17 rmind nbuf_add_tag(nbuf_t *nbuf, uint32_t val)
300 1.1 rmind {
301 1.18 christos #ifdef _KERNEL
302 1.9 rmind struct mbuf *m = nbuf->nb_mbuf0;
303 1.1 rmind struct m_tag *mt;
304 1.1 rmind uint32_t *dat;
305 1.1 rmind
306 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
307 1.9 rmind
308 1.1 rmind mt = m_tag_get(PACKET_TAG_NPF, sizeof(uint32_t), M_NOWAIT);
309 1.9 rmind if (mt == NULL) {
310 1.1 rmind return ENOMEM;
311 1.1 rmind }
312 1.1 rmind dat = (uint32_t *)(mt + 1);
313 1.1 rmind *dat = val;
314 1.1 rmind m_tag_prepend(m, mt);
315 1.1 rmind return 0;
316 1.18 christos #else
317 1.18 christos (void)nbuf; (void)val;
318 1.18 christos return ENOTSUP;
319 1.18 christos #endif
320 1.1 rmind }
321 1.1 rmind
322 1.1 rmind /*
323 1.1 rmind * nbuf_find_tag: find a tag in specified network buffer.
324 1.1 rmind *
325 1.9 rmind * => Returns 0 on success or errno on failure.
326 1.1 rmind */
327 1.1 rmind int
328 1.17 rmind nbuf_find_tag(nbuf_t *nbuf, uint32_t *val)
329 1.1 rmind {
330 1.18 christos #ifdef _KERNEL
331 1.9 rmind struct mbuf *m = nbuf->nb_mbuf0;
332 1.1 rmind struct m_tag *mt;
333 1.1 rmind
334 1.18 christos KASSERT(m_flags_p(m, M_PKTHDR));
335 1.9 rmind
336 1.1 rmind mt = m_tag_find(m, PACKET_TAG_NPF, NULL);
337 1.9 rmind if (mt == NULL) {
338 1.1 rmind return EINVAL;
339 1.1 rmind }
340 1.17 rmind *val = *(uint32_t *)(mt + 1);
341 1.1 rmind return 0;
342 1.18 christos #else
343 1.18 christos (void)nbuf; (void)val;
344 1.18 christos return ENOTSUP;
345 1.18 christos #endif
346 1.1 rmind }
347