2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Rick Macklem at The University of Guelph.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #ifndef _NFS_NFSM_SUBS_H_
36 #define _NFS_NFSM_SUBS_H_
40 * These macros do strange and peculiar things to mbuf chains for
41 * the assistance of the nfs code. To attempt to use them for any
42 * other purpose will be dangerous. (they make weird assumptions)
47 * First define what the actual subs. return
49 #define M_HASCL(m) ((m)->m_flags & M_EXT)
50 #define NFSMINOFF(m) \
52 (m)->m_data = (m)->m_ext.ext_buf; \
53 else if ((m)->m_flags & M_PKTHDR) \
54 (m)->m_data = (m)->m_pktdat; \
56 (m)->m_data = (m)->m_dat
57 #define NFSMSIZ(m) ((M_HASCL(m))?MCLBYTES: \
58 (((m)->m_flags & M_PKTHDR)?MHLEN:MLEN))
59 #define NFSM_DATAP(m, s) (m)->m_data += (s)
62 * Now for the macros that do the simple stuff and call the functions
64 * They use fields in struct nfsrv_descript to handle the mbuf queues.
65 * Replace most of the macro with an inline function, to minimize
66 * the machine code. The inline functions in lower case can be called
67 * directly, bypassing the macro.
69 static __inline void *
70 nfsm_build(struct nfsrv_descript *nd, int siz)
75 if (siz > M_TRAILINGSPACE(nd->nd_mb)) {
76 NFSMCLGET(mb2, M_DONTWAIT);
78 panic("build > MLEN");
80 nd->nd_bpos = NFSMTOD(mb2, caddr_t);
81 nd->nd_mb->m_next = mb2;
84 retp = (void *)(nd->nd_bpos);
85 nd->nd_mb->m_len += siz;
90 #define NFSM_BUILD(a, c, s) ((a) = (c)nfsm_build(nd, (s)))
92 static __inline void *
93 nfsm_dissect(struct nfsrv_descript *nd, int siz)
98 tt1 = NFSMTOD(nd->nd_md, caddr_t) + nd->nd_md->m_len - nd->nd_dpos;
100 retp = (void *)nd->nd_dpos;
103 retp = nfsm_dissct(nd, siz);
108 #define NFSM_DISSECT(a, c, s) \
110 (a) = (c)nfsm_dissect(nd, (s)); \
118 #define NFSM_STRSIZ(s, m) \
120 tl = (u_int32_t *)nfsm_dissect(nd, NFSX_UNSIGNED); \
121 if (!tl || ((s) = fxdr_unsigned(int32_t, *tl)) > (m)) { \
127 #define NFSM_RNDUP(a) (((a)+3)&(~0x3))
129 #endif /* _NFS_NFSM_SUBS_H_ */