2 * Copyright (c) 2000, 2001 Boris Popov
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the author nor the names of any co-contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * $FreeBSD: src/sys/kern/subr_mchain.c,v 1.2.2.2 2002/04/13 12:46:40 bp Exp $
33 #include <sys/param.h>
34 #include <sys/systm.h>
35 #include <sys/kernel.h>
36 #include <sys/endian.h>
37 #include <sys/errno.h>
38 #include <sys/malloc.h>
40 #include <sys/module.h>
43 #include <sys/mchain.h>
45 MODULE_VERSION(libmchain, 1);
47 #define MBERROR(format, ...) kprintf("%s(%d): "format, __func__ , \
48 __LINE__ , ## __VA_ARGS__)
50 #define MBPANIC(format, ...) kprintf("%s(%d): "format, __func__ , \
51 __LINE__ , ## __VA_ARGS__)
54 * Various helper functions
57 m_fixhdr(struct mbuf *m0)
66 m0->m_pkthdr.len = len;
71 mb_init(struct mbchain *mbp)
75 m = m_gethdr(M_WAITOK, MT_DATA);
76 m->m_pkthdr.rcvif = NULL;
83 mb_initm(struct mbchain *mbp, struct mbuf *m)
85 bzero(mbp, sizeof(*mbp));
86 mbp->mb_top = mbp->mb_cur = m;
87 mbp->mb_mleft = M_TRAILINGSPACE(m);
91 mb_done(struct mbchain *mbp)
100 mb_detach(struct mbchain *mbp)
110 mb_fixhdr(struct mbchain *mbp)
112 return mbp->mb_top->m_pkthdr.len = m_fixhdr(mbp->mb_top);
116 * Check if object of size 'size' fit to the current position and
117 * allocate new mbuf if not. Advance pointers and increase length of mbuf(s).
118 * Return pointer to the object placeholder or NULL if any error occured.
119 * Note: size should be <= MLEN
122 mb_reserve(struct mbchain *mbp, int size)
128 panic("mb_reserve: size = %d", size);
130 if (mbp->mb_mleft < size) {
131 mn = m_get(M_WAITOK, MT_DATA);
132 mbp->mb_cur = m->m_next = mn;
135 mbp->mb_mleft = M_TRAILINGSPACE(m);
137 mbp->mb_mleft -= size;
138 mbp->mb_count += size;
139 bpos = mtod(m, caddr_t) + m->m_len;
145 mb_put_uint8(struct mbchain *mbp, u_int8_t x)
147 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
151 mb_put_uint16be(struct mbchain *mbp, u_int16_t x)
154 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
158 mb_put_uint16le(struct mbchain *mbp, u_int16_t x)
161 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
165 mb_put_uint32be(struct mbchain *mbp, u_int32_t x)
168 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
172 mb_put_uint32le(struct mbchain *mbp, u_int32_t x)
175 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
179 mb_put_int64be(struct mbchain *mbp, int64_t x)
182 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
186 mb_put_int64le(struct mbchain *mbp, int64_t x)
189 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
193 mb_put_mem(struct mbchain *mbp, c_caddr_t source, int size, int type)
198 int error, mleft, count;
199 size_t cplen, srclen, dstlen;
202 mleft = mbp->mb_mleft;
206 if (m->m_next == NULL)
207 m->m_next = m_getc(size, M_WAITOK, MT_DATA);
209 mleft = M_TRAILINGSPACE(m);
212 cplen = mleft > size ? size : mleft;
213 srclen = dstlen = cplen;
214 dst = mtod(m, caddr_t) + m->m_len;
219 error = mbp->mb_copy(mbp, source, dst, &srclen, &dstlen);
224 for (src = source, count = cplen; count; count--)
228 bcopy(source, dst, cplen);
231 error = copyin(source, dst, cplen);
243 mbp->mb_count += dstlen;
246 mbp->mb_mleft = mleft;
251 mb_put_mbuf(struct mbchain *mbp, struct mbuf *m)
253 mbp->mb_cur->m_next = m;
255 mbp->mb_count += m->m_len;
256 if (m->m_next == NULL)
260 mbp->mb_mleft = M_TRAILINGSPACE(m);
266 * copies a uio scatter/gather list to an mbuf chain.
269 mb_put_uio(struct mbchain *mbp, struct uio *uiop, int size)
274 mtype = (uiop->uio_segflg == UIO_SYSSPACE) ? MB_MSYSTEM : MB_MUSER;
276 while (size > 0 && uiop->uio_resid) {
277 if (uiop->uio_iovcnt <= 0 || uiop->uio_iov == NULL)
279 left = uiop->uio_iov->iov_len;
287 error = mb_put_mem(mbp, uiop->uio_iov->iov_base, left, mtype);
290 uiop->uio_offset += left;
291 uiop->uio_resid -= left;
292 uiop->uio_iov->iov_base =
293 (char *)uiop->uio_iov->iov_base + left;
294 uiop->uio_iov->iov_len -= left;
301 * Routines for fetching data from an mbuf chain
304 md_init(struct mdchain *mdp)
308 m = m_gethdr(M_WAITOK, MT_DATA);
309 m->m_pkthdr.rcvif = NULL;
316 md_initm(struct mdchain *mdp, struct mbuf *m)
318 bzero(mdp, sizeof(*mdp));
319 mdp->md_top = mdp->md_cur = m;
320 mdp->md_pos = mtod(m, u_char*);
324 md_done(struct mdchain *mdp)
327 m_freem(mdp->md_top);
333 * Append a separate mbuf chain. It is caller responsibility to prevent
334 * multiple calls to fetch/record routines.
337 md_append_record(struct mdchain *mdp, struct mbuf *top)
341 if (mdp->md_top == NULL) {
349 top->m_nextpkt = NULL;
354 * Put next record in place of existing
357 md_next_record(struct mdchain *mdp)
361 if (mdp->md_top == NULL)
363 m = mdp->md_top->m_nextpkt;
372 md_get_uint8(struct mdchain *mdp, u_int8_t *x)
374 return md_get_mem(mdp, x, 1, MB_MINLINE);
378 md_get_uint16(struct mdchain *mdp, u_int16_t *x)
380 return md_get_mem(mdp, (caddr_t)x, 2, MB_MINLINE);
384 md_get_uint16le(struct mdchain *mdp, u_int16_t *x)
387 int error = md_get_uint16(mdp, &v);
395 md_get_uint16be(struct mdchain *mdp, u_int16_t *x) {
397 int error = md_get_uint16(mdp, &v);
405 md_get_uint32(struct mdchain *mdp, u_int32_t *x)
407 return md_get_mem(mdp, (caddr_t)x, 4, MB_MINLINE);
411 md_get_uint32be(struct mdchain *mdp, u_int32_t *x)
416 error = md_get_uint32(mdp, &v);
423 md_get_uint32le(struct mdchain *mdp, u_int32_t *x)
428 error = md_get_uint32(mdp, &v);
435 md_get_int64(struct mdchain *mdp, int64_t *x)
437 return md_get_mem(mdp, (caddr_t)x, 8, MB_MINLINE);
441 md_get_int64be(struct mdchain *mdp, int64_t *x)
446 error = md_get_int64(mdp, &v);
453 md_get_int64le(struct mdchain *mdp, int64_t *x)
458 error = md_get_int64(mdp, &v);
465 md_get_mem(struct mdchain *mdp, caddr_t target, int size, int type)
467 struct mbuf *m = mdp->md_cur;
474 MBERROR("incomplete copy\n");
478 count = mtod(m, u_char*) + m->m_len - s;
480 mdp->md_cur = m = m->m_next;
482 s = mdp->md_pos = mtod(m, caddr_t);
488 mdp->md_pos += count;
493 error = copyout(s, target, count);
498 bcopy(s, target, count);
511 md_get_mbuf(struct mdchain *mdp, int size, struct mbuf **ret)
513 struct mbuf *m = mdp->md_cur, *rm;
515 rm = m_copym(m, mdp->md_pos - mtod(m, u_char*), size, M_WAITOK);
518 md_get_mem(mdp, NULL, size, MB_MZERO);
524 md_get_uio(struct mdchain *mdp, struct uio *uiop, int size)
530 mtype = (uiop->uio_segflg == UIO_SYSSPACE) ? MB_MSYSTEM : MB_MUSER;
531 while (size > 0 && uiop->uio_resid) {
532 if (uiop->uio_iovcnt <= 0 || uiop->uio_iov == NULL)
534 left = uiop->uio_iov->iov_len;
540 uiocp = uiop->uio_iov->iov_base;
543 error = md_get_mem(mdp, uiocp, left, mtype);
546 uiop->uio_offset += left;
547 uiop->uio_resid -= left;
548 uiop->uio_iov->iov_base =
549 (char *)uiop->uio_iov->iov_base + left;
550 uiop->uio_iov->iov_len -= left;