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/endian.h>
36 #include <sys/errno.h>
38 #include <sys/module.h>
41 #include <sys/mchain.h>
43 MODULE_VERSION(libmchain, 1);
45 #define MBERROR(format, ...) printf("%s(%d): "format, __func__ , \
46 __LINE__ , ## __VA_ARGS__)
48 #define MBPANIC(format, ...) printf("%s(%d): "format, __func__ , \
49 __LINE__ , ## __VA_ARGS__)
52 * Various helper functions
55 mb_init(struct mbchain *mbp)
59 m = m_gethdr(M_WAIT, MT_DATA);
66 mb_initm(struct mbchain *mbp, struct mbuf *m)
68 bzero(mbp, sizeof(*mbp));
69 mbp->mb_top = mbp->mb_cur = m;
70 mbp->mb_mleft = M_TRAILINGSPACE(m);
74 mb_done(struct mbchain *mbp)
83 mb_detach(struct mbchain *mbp)
93 mb_fixhdr(struct mbchain *mbp)
95 return mbp->mb_top->m_pkthdr.len = m_fixhdr(mbp->mb_top);
99 * Check if object of size 'size' fit to the current position and
100 * allocate new mbuf if not. Advance pointers and increase length of mbuf(s).
101 * Return pointer to the object placeholder or NULL if any error occured.
102 * Note: size should be <= MLEN
105 mb_reserve(struct mbchain *mbp, int size)
111 panic("mb_reserve: size = %d\n", size);
113 if (mbp->mb_mleft < size) {
114 mn = m_get(M_WAIT, MT_DATA);
115 mbp->mb_cur = m->m_next = mn;
118 mbp->mb_mleft = M_TRAILINGSPACE(m);
120 mbp->mb_mleft -= size;
121 mbp->mb_count += size;
122 bpos = mtod(m, caddr_t) + m->m_len;
128 mb_put_padbyte(struct mbchain *mbp)
133 dst = mtod(mbp->mb_cur, caddr_t) + mbp->mb_cur->m_len;
135 /* only add padding if address is odd */
136 if ((unsigned long)dst & 1)
137 return mb_put_mem(mbp, (caddr_t)&x, 1, MB_MSYSTEM);
143 mb_put_uint8(struct mbchain *mbp, u_int8_t x)
145 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
149 mb_put_uint16be(struct mbchain *mbp, u_int16_t x)
152 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
156 mb_put_uint16le(struct mbchain *mbp, u_int16_t x)
159 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
163 mb_put_uint32be(struct mbchain *mbp, u_int32_t x)
166 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
170 mb_put_uint32le(struct mbchain *mbp, u_int32_t x)
173 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
177 mb_put_int64be(struct mbchain *mbp, int64_t x)
180 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
184 mb_put_int64le(struct mbchain *mbp, int64_t x)
187 return mb_put_mem(mbp, (caddr_t)&x, sizeof(x), MB_MSYSTEM);
191 mb_put_mem(struct mbchain *mbp, c_caddr_t source, int size, int type)
196 int cplen, error, mleft, count;
197 size_t srclen, dstlen;
200 mleft = mbp->mb_mleft;
204 if (m->m_next == NULL)
205 m = m_getm(m, size, M_WAIT, MT_DATA);
208 mleft = M_TRAILINGSPACE(m);
211 cplen = mleft > size ? size : mleft;
212 srclen = dstlen = cplen;
213 dst = mtod(m, caddr_t) + m->m_len;
218 error = mbp->mb_copy(mbp, source, dst, &srclen, &dstlen);
223 for (src = source, count = cplen; count; count--)
227 bcopy(source, dst, cplen);
230 error = copyin(source, dst, cplen);
242 mbp->mb_count += dstlen;
245 mbp->mb_mleft = mleft;
250 mb_put_mbuf(struct mbchain *mbp, struct mbuf *m)
252 mbp->mb_cur->m_next = m;
254 mbp->mb_count += m->m_len;
255 if (m->m_next == NULL)
259 mbp->mb_mleft = M_TRAILINGSPACE(m);
265 * copies a uio scatter/gather list to an mbuf chain.
268 mb_put_uio(struct mbchain *mbp, struct uio *uiop, int size)
273 mtype = (uiop->uio_segflg == UIO_SYSSPACE) ? MB_MSYSTEM : MB_MUSER;
275 while (size > 0 && uiop->uio_resid) {
276 if (uiop->uio_iovcnt <= 0 || uiop->uio_iov == NULL)
278 left = uiop->uio_iov->iov_len;
286 error = mb_put_mem(mbp, uiop->uio_iov->iov_base, left, mtype);
289 uiop->uio_offset += left;
290 uiop->uio_resid -= left;
291 uiop->uio_iov->iov_base =
292 (char *)uiop->uio_iov->iov_base + left;
293 uiop->uio_iov->iov_len -= left;
300 * Routines for fetching data from an mbuf chain
303 md_init(struct mdchain *mdp)
307 m = m_gethdr(M_WAIT, MT_DATA);
314 md_initm(struct mdchain *mdp, struct mbuf *m)
316 bzero(mdp, sizeof(*mdp));
317 mdp->md_top = mdp->md_cur = m;
318 mdp->md_pos = mtod(m, u_char*);
322 md_done(struct mdchain *mdp)
325 m_freem(mdp->md_top);
331 * Append a separate mbuf chain. It is caller responsibility to prevent
332 * multiple calls to fetch/record routines.
335 md_append_record(struct mdchain *mdp, struct mbuf *top)
339 if (mdp->md_top == NULL) {
347 top->m_nextpkt = NULL;
352 * Put next record in place of existing
355 md_next_record(struct mdchain *mdp)
359 if (mdp->md_top == NULL)
361 m = mdp->md_top->m_nextpkt;
370 md_get_uint8(struct mdchain *mdp, u_int8_t *x)
372 return md_get_mem(mdp, x, 1, MB_MINLINE);
376 md_get_uint16(struct mdchain *mdp, u_int16_t *x)
378 return md_get_mem(mdp, (caddr_t)x, 2, MB_MINLINE);
382 md_get_uint16le(struct mdchain *mdp, u_int16_t *x)
385 int error = md_get_uint16(mdp, &v);
393 md_get_uint16be(struct mdchain *mdp, u_int16_t *x) {
395 int error = md_get_uint16(mdp, &v);
403 md_get_uint32(struct mdchain *mdp, u_int32_t *x)
405 return md_get_mem(mdp, (caddr_t)x, 4, MB_MINLINE);
409 md_get_uint32be(struct mdchain *mdp, u_int32_t *x)
414 error = md_get_uint32(mdp, &v);
421 md_get_uint32le(struct mdchain *mdp, u_int32_t *x)
426 error = md_get_uint32(mdp, &v);
433 md_get_int64(struct mdchain *mdp, int64_t *x)
435 return md_get_mem(mdp, (caddr_t)x, 8, MB_MINLINE);
439 md_get_int64be(struct mdchain *mdp, int64_t *x)
444 error = md_get_int64(mdp, &v);
451 md_get_int64le(struct mdchain *mdp, int64_t *x)
456 error = md_get_int64(mdp, &v);
463 md_get_mem(struct mdchain *mdp, caddr_t target, int size, int type)
465 struct mbuf *m = mdp->md_cur;
472 MBERROR("incomplete copy\n");
476 count = mtod(m, u_char*) + m->m_len - s;
478 mdp->md_cur = m = m->m_next;
480 s = mdp->md_pos = mtod(m, caddr_t);
486 mdp->md_pos += count;
491 error = copyout(s, target, count);
496 bcopy(s, target, count);
509 md_get_mbuf(struct mdchain *mdp, int size, struct mbuf **ret)
511 struct mbuf *m = mdp->md_cur, *rm;
513 rm = m_copym(m, mdp->md_pos - mtod(m, u_char*), size, M_WAIT);
514 md_get_mem(mdp, NULL, size, MB_MZERO);
520 md_get_uio(struct mdchain *mdp, struct uio *uiop, int size)
526 mtype = (uiop->uio_segflg == UIO_SYSSPACE) ? MB_MSYSTEM : MB_MUSER;
527 while (size > 0 && uiop->uio_resid) {
528 if (uiop->uio_iovcnt <= 0 || uiop->uio_iov == NULL)
530 left = uiop->uio_iov->iov_len;
536 uiocp = uiop->uio_iov->iov_base;
539 error = md_get_mem(mdp, uiocp, left, mtype);
542 uiop->uio_offset += left;
543 uiop->uio_resid -= left;
544 uiop->uio_iov->iov_base =
545 (char *)uiop->uio_iov->iov_base + left;
546 uiop->uio_iov->iov_len -= left;