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