1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/*-
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Rick Macklem at The University of Guelph.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)nfsm_subs.h 8.2 (Berkeley) 3/30/95
* $FreeBSD$
*/
#ifndef _NFS_NFS_COMMON_H_
#define _NFS_NFS_COMMON_H_
extern enum vtype nv3tov_type[];
extern nfstype nfsv3_type[];
#define vtonfsv2_mode(t, m) \
txdr_unsigned(((t) == VFIFO) ? MAKEIMODE(VCHR, (m)) : MAKEIMODE((t), (m)))
#define nfsv3tov_type(a) nv3tov_type[fxdr_unsigned(u_int32_t,(a))&0x7]
#define vtonfsv3_type(a) txdr_unsigned(nfsv3_type[((int32_t)(a))])
int nfs_adv(struct mbuf **, caddr_t *, int, int);
u_quad_t nfs_curusec(void);
void *nfsm_disct(struct mbuf **, caddr_t *, int, int, int);
int nfs_realign(struct mbuf **, int);
/* ****************************** */
/* Build request/reply phase macros */
void *nfsm_build_xx(int s, struct mbuf **mb, caddr_t *bpos);
#define nfsm_build(c, s) \
(c)nfsm_build_xx((s), &mb, &bpos)
/* ****************************** */
/* Interpretation phase macros */
void *nfsm_dissect_xx(int s, struct mbuf **md, caddr_t *dpos);
void *nfsm_dissect_xx_nonblock(int s, struct mbuf **md, caddr_t *dpos);
int nfsm_strsiz_xx(int *s, int m, struct mbuf **md, caddr_t *dpos);
int nfsm_adv_xx(int s, struct mbuf **md, caddr_t *dpos);
/* Error check helpers */
#define nfsm_dcheck(t1, mrep) \
do { \
if (t1 != 0) { \
error = t1; \
m_freem((mrep)); \
(mrep) = NULL; \
goto nfsmout; \
} \
} while (0)
#define nfsm_dcheckp(retp, mrep) \
do { \
if (retp == NULL) { \
error = EBADRPC; \
m_freem((mrep)); \
(mrep) = NULL; \
goto nfsmout; \
} \
} while (0)
#define nfsm_dissect(c, s) \
({ \
void *ret; \
ret = nfsm_dissect_xx((s), &md, &dpos); \
nfsm_dcheckp(ret, mrep); \
(c)ret; \
})
#define nfsm_dissect_nonblock(c, s) \
({ \
void *ret; \
ret = nfsm_dissect_xx_nonblock((s), &md, &dpos); \
nfsm_dcheckp(ret, mrep); \
(c)ret; \
})
#define nfsm_strsiz(s,m) \
do { \
int t1; \
t1 = nfsm_strsiz_xx(&(s), (m), &md, &dpos); \
nfsm_dcheck(t1, mrep); \
} while(0)
#define nfsm_mtouio(p,s) \
do {\
int32_t t1 = 0; \
if ((s) > 0) \
t1 = nfsm_mbuftouio(&md, (p), (s), &dpos); \
nfsm_dcheck(t1, mrep); \
} while (0)
#define nfsm_rndup(a) (((a)+3)&(~0x3))
#define nfsm_adv(s) \
do { \
int t1; \
t1 = nfsm_adv_xx((s), &md, &dpos); \
nfsm_dcheck(t1, mrep); \
} while (0)
#ifdef __NO_STRICT_ALIGNMENT
#define nfsm_aligned(p, t) 1
#else
#define nfsm_aligned(p, t) ((((u_long)(p)) & (sizeof(t) - 1)) == 0)
#endif
#endif
|
