xref: /dragonfly/sys/vfs/nfs/xdr_subs.h (revision 984263bc)
1 /*
2  * Copyright (c) 1989, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * This code is derived from software contributed to Berkeley by
6  * Rick Macklem at The University of Guelph.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
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  * 3. All advertising materials mentioning features or use of this software
17  *    must display the following acknowledgement:
18  *	This product includes software developed by the University of
19  *	California, Berkeley and its contributors.
20  * 4. Neither the name of the University nor the names of its contributors
21  *    may be used to endorse or promote products derived from this software
22  *    without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34  * SUCH DAMAGE.
35  *
36  *	@(#)xdr_subs.h	8.3 (Berkeley) 3/30/95
37  * $FreeBSD: src/sys/nfs/xdr_subs.h,v 1.13 1999/08/28 00:50:04 peter Exp $
38  */
39 
40 
41 #ifndef _NFS_XDR_SUBS_H_
42 #define _NFS_XDR_SUBS_H_
43 
44 /*
45  * Macros used for conversion to/from xdr representation by nfs...
46  * These use the MACHINE DEPENDENT routines ntohl, htonl
47  * As defined by "XDR: External Data Representation Standard" RFC1014
48  *
49  * To simplify the implementation, we use ntohl/htonl even on big-endian
50  * machines, and count on them being `#define'd away.  Some of these
51  * might be slightly more efficient as quad_t copies on a big-endian,
52  * but we cannot count on their alignment anyway.
53  */
54 
55 #define	fxdr_unsigned(t, v)	((t)ntohl((int32_t)(v)))
56 #define	txdr_unsigned(v)	(htonl((int32_t)(v)))
57 
58 #define	fxdr_nfsv2time(f, t) \
59 do { \
60 	(t)->tv_sec = ntohl(((struct nfsv2_time *)(f))->nfsv2_sec); \
61 	if (((struct nfsv2_time *)(f))->nfsv2_usec != 0xffffffff) \
62 		(t)->tv_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfsv2_usec); \
63 	else \
64 		(t)->tv_nsec = 0; \
65 } while (0)
66 #define	txdr_nfsv2time(f, t) \
67 do { \
68 	((struct nfsv2_time *)(t))->nfsv2_sec = htonl((f)->tv_sec); \
69 	if ((f)->tv_nsec != -1) \
70 		((struct nfsv2_time *)(t))->nfsv2_usec = htonl((f)->tv_nsec / 1000); \
71 	else \
72 		((struct nfsv2_time *)(t))->nfsv2_usec = 0xffffffff; \
73 } while (0)
74 
75 #define	fxdr_nfsv3time(f, t) \
76 do { \
77 	(t)->tv_sec = ntohl(((struct nfsv3_time *)(f))->nfsv3_sec); \
78 	(t)->tv_nsec = ntohl(((struct nfsv3_time *)(f))->nfsv3_nsec); \
79 } while (0)
80 #define	txdr_nfsv3time(f, t) \
81 do { \
82 	((struct nfsv3_time *)(t))->nfsv3_sec = htonl((f)->tv_sec); \
83 	((struct nfsv3_time *)(t))->nfsv3_nsec = htonl((f)->tv_nsec); \
84 } while (0)
85 
86 #define	fxdr_hyper(f) \
87 	((((u_quad_t)ntohl(((u_int32_t *)(f))[0])) << 32) | \
88 	 (u_quad_t)(ntohl(((u_int32_t *)(f))[1])))
89 #define	txdr_hyper(f, t) \
90 do { \
91 	((u_int32_t *)(t))[0] = htonl((u_int32_t)((f) >> 32)); \
92 	((u_int32_t *)(t))[1] = htonl((u_int32_t)((f) & 0xffffffff)); \
93 } while (0)
94 
95 #endif
96