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
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
33 #include <sys/param.h>
34 #include <sys/systm.h>
35 #include <sys/sysctl.h>
36 #include <sys/endian.h>
37 #include <sys/errno.h>
39 #include <sys/module.h>
42 #include <sys/mchain.h>
44 FEATURE(libmchain, "mchain library");
46 MODULE_VERSION(libmchain, 1);
48 #define MBERROR(format, ...) printf("%s(%d): "format, __func__ , \
49 __LINE__ , ## __VA_ARGS__)
51 #define MBPANIC(format, ...) printf("%s(%d): "format, __func__ , \
52 __LINE__ , ## __VA_ARGS__)
55 * Various helper functions
58 mb_init(struct mbchain *mbp)
62 m = m_gethdr(M_WAIT, MT_DATA);
69 mb_initm(struct mbchain *mbp, struct mbuf *m)
71 bzero(mbp, sizeof(*mbp));
72 mbp->mb_top = mbp->mb_cur = m;
73 mbp->mb_mleft = M_TRAILINGSPACE(m);
77 mb_done(struct mbchain *mbp)
86 mb_detach(struct mbchain *mbp)
96 mb_fixhdr(struct mbchain *mbp)
98 return mbp->mb_top->m_pkthdr.len = m_fixhdr(mbp->mb_top);
102 * Check if object of size 'size' fit to the current position and
103 * allocate new mbuf if not. Advance pointers and increase length of mbuf(s).
104 * Return pointer to the object placeholder or NULL if any error occured.
105 * Note: size should be <= MLEN
108 mb_reserve(struct mbchain *mbp, int size)
114 panic("mb_reserve: size = %d\n", size);
116 if (mbp->mb_mleft < size) {
117 mn = m_get(M_WAIT, MT_DATA);
118 mbp->mb_cur = m->m_next = mn;
121 mbp->mb_mleft = M_TRAILINGSPACE(m);
123 mbp->mb_mleft -= size;
124 mbp->mb_count += size;
125 bpos = mtod(m, caddr_t) + m->m_len;
131 mb_put_padbyte(struct mbchain *mbp)
136 dst = mtod(mbp->mb_cur, caddr_t) + mbp->mb_cur->m_len;
138 /* only add padding if address is odd */
139 if ((unsigned long)dst & 1)
140 return mb_put_mem(mbp, (caddr_t)&x, 1, MB_MSYSTEM);
146 mb_put_uint8(struct mbchain *mbp, uint8_t x)
148 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
152 mb_put_uint16be(struct mbchain *mbp, uint16_t x)
155 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
159 mb_put_uint16le(struct mbchain *mbp, uint16_t x)
162 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
166 mb_put_uint32be(struct mbchain *mbp, uint32_t x)
169 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
173 mb_put_uint32le(struct mbchain *mbp, uint32_t x)
176 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
180 mb_put_int64be(struct mbchain *mbp, int64_t x)
183 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
187 mb_put_int64le(struct mbchain *mbp, int64_t x)
190 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
194 mb_put_mem(struct mbchain *mbp, c_caddr_t source, int size, int type)
199 int cplen, error, mleft, count;
200 size_t srclen, dstlen;
203 mleft = mbp->mb_mleft;
207 if (m->m_next == NULL)
208 m = m_getm(m, size, M_WAIT, MT_DATA);
211 mleft = M_TRAILINGSPACE(m);
214 cplen = mleft > size ? size : mleft;
215 srclen = dstlen = cplen;
216 dst = mtod(m, caddr_t) + m->m_len;
221 error = mbp->mb_copy(mbp, source, dst, &srclen, &dstlen);
226 for (src = source, count = cplen; count; count--)
230 bcopy(source, dst, cplen);
233 error = copyin(source, dst, cplen);
245 mbp->mb_count += dstlen;
248 mbp->mb_mleft = mleft;
253 mb_put_mbuf(struct mbchain *mbp, struct mbuf *m)
255 mbp->mb_cur->m_next = m;
257 mbp->mb_count += m->m_len;
258 if (m->m_next == NULL)
262 mbp->mb_mleft = M_TRAILINGSPACE(m);
268 * copies a uio scatter/gather list to an mbuf chain.
271 mb_put_uio(struct mbchain *mbp, struct uio *uiop, int size)
276 mtype = (uiop->uio_segflg == UIO_SYSSPACE) ? MB_MSYSTEM : MB_MUSER;
278 while (size > 0 && uiop->uio_resid) {
279 if (uiop->uio_iovcnt <= 0 || uiop->uio_iov == NULL)
281 left = uiop->uio_iov->iov_len;
289 error = mb_put_mem(mbp, uiop->uio_iov->iov_base, left, mtype);
292 uiop->uio_offset += left;
293 uiop->uio_resid -= left;
294 uiop->uio_iov->iov_base =
295 (char *)uiop->uio_iov->iov_base + left;
296 uiop->uio_iov->iov_len -= left;
303 * Routines for fetching data from an mbuf chain
306 md_init(struct mdchain *mdp)
310 m = m_gethdr(M_WAIT, MT_DATA);
317 md_initm(struct mdchain *mdp, struct mbuf *m)
319 bzero(mdp, sizeof(*mdp));
320 mdp->md_top = mdp->md_cur = m;
321 mdp->md_pos = mtod(m, u_char*);
325 md_done(struct mdchain *mdp)
328 m_freem(mdp->md_top);
334 * Append a separate mbuf chain. It is caller responsibility to prevent
335 * multiple calls to fetch/record routines.
338 md_append_record(struct mdchain *mdp, struct mbuf *top)
342 if (mdp->md_top == NULL) {
350 top->m_nextpkt = NULL;
355 * Put next record in place of existing
358 md_next_record(struct mdchain *mdp)
362 if (mdp->md_top == NULL)
364 m = mdp->md_top->m_nextpkt;
373 md_get_uint8(struct mdchain *mdp, uint8_t *x)
375 return md_get_mem(mdp, x, 1, MB_MINLINE);
379 md_get_uint16(struct mdchain *mdp, uint16_t *x)
381 return md_get_mem(mdp, (caddr_t)x, 2, MB_MINLINE);
385 md_get_uint16le(struct mdchain *mdp, uint16_t *x)
388 int error = md_get_uint16(mdp, &v);
396 md_get_uint16be(struct mdchain *mdp, uint16_t *x)
399 int error = md_get_uint16(mdp, &v);
407 md_get_uint32(struct mdchain *mdp, uint32_t *x)
409 return md_get_mem(mdp, (caddr_t)x, 4, MB_MINLINE);
413 md_get_uint32be(struct mdchain *mdp, uint32_t *x)
418 error = md_get_uint32(mdp, &v);
425 md_get_uint32le(struct mdchain *mdp, uint32_t *x)
430 error = md_get_uint32(mdp, &v);
437 md_get_int64(struct mdchain *mdp, int64_t *x)
439 return md_get_mem(mdp, (caddr_t)x, 8, MB_MINLINE);
443 md_get_int64be(struct mdchain *mdp, int64_t *x)
448 error = md_get_int64(mdp, &v);
455 md_get_int64le(struct mdchain *mdp, int64_t *x)
460 error = md_get_int64(mdp, &v);
467 md_get_mem(struct mdchain *mdp, caddr_t target, int size, int type)
469 struct mbuf *m = mdp->md_cur;
476 MBERROR("incomplete copy\n");
480 count = mtod(m, u_char*) + m->m_len - s;
482 mdp->md_cur = m = m->m_next;
484 s = mdp->md_pos = mtod(m, caddr_t);
490 mdp->md_pos += count;
495 error = copyout(s, target, count);
500 bcopy(s, target, count);
513 md_get_mbuf(struct mdchain *mdp, int size, struct mbuf **ret)
515 struct mbuf *m = mdp->md_cur, *rm;
517 rm = m_copym(m, mdp->md_pos - mtod(m, u_char*), size, M_WAIT);
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;