xdr_subs.h revision 1.13 1 1.13 fair /* $NetBSD: xdr_subs.h,v 1.13 1999/03/06 05:34:40 fair Exp $ */
2 1.7 cgd
3 1.1 cgd /*
4 1.6 mycroft * Copyright (c) 1989, 1993
5 1.6 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Rick Macklem at The University of Guelph.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd *
38 1.11 fvdl * @(#)xdr_subs.h 8.3 (Berkeley) 3/30/95
39 1.1 cgd */
40 1.1 cgd
41 1.11 fvdl
42 1.11 fvdl #ifndef _NFS_XDR_SUBS_H_
43 1.11 fvdl #define _NFS_XDR_SUBS_H_
44 1.11 fvdl
45 1.1 cgd /*
46 1.1 cgd * Macros used for conversion to/from xdr representation by nfs...
47 1.1 cgd * These use the MACHINE DEPENDENT routines ntohl, htonl
48 1.1 cgd * As defined by "XDR: External Data Representation Standard" RFC1014
49 1.6 mycroft *
50 1.6 mycroft * To simplify the implementation, we use ntohl/htonl even on big-endian
51 1.6 mycroft * machines, and count on them being `#define'd away. Some of these
52 1.6 mycroft * might be slightly more efficient as quad_t copies on a big-endian,
53 1.6 mycroft * but we cannot count on their alignment anyway.
54 1.1 cgd */
55 1.1 cgd
56 1.9 cgd #define fxdr_unsigned(t, v) ((t)ntohl((int32_t)(v)))
57 1.9 cgd #define txdr_unsigned(v) (htonl((int32_t)(v)))
58 1.12 fvdl
59 1.12 fvdl /*
60 1.12 fvdl * Directory cookies shouldn't really be XDR-ed, these functions
61 1.12 fvdl * are just here to attempt to keep information within 32 bits. And
62 1.12 fvdl * make things look better. See nfs_cookieheuristic.
63 1.12 fvdl */
64 1.12 fvdl #define fxdr_cookie3(v) (((off_t)((v)[0]) << 32) | ((off_t) (v)[1]))
65 1.12 fvdl #define fxdr_swapcookie3(v) (((off_t)((v)[1]) << 32) | ((off_t) (v)[0]))
66 1.12 fvdl
67 1.12 fvdl #define txdr_cookie3(f, v) { \
68 1.12 fvdl (v)[1] = (u_int32_t)((f) & 0xffffffffLL); \
69 1.12 fvdl (v)[0] = (u_int32_t)((f) >> 32); \
70 1.12 fvdl }
71 1.12 fvdl #define txdr_swapcookie3(f, v) { \
72 1.12 fvdl (v)[0] = (u_int32_t)((f) & 0xffffffffLL); \
73 1.12 fvdl (v)[1] = (u_int32_t)((f) >> 32); \
74 1.12 fvdl }
75 1.1 cgd
76 1.11 fvdl #define fxdr_nfsv2time(f, t) { \
77 1.11 fvdl (t)->tv_sec = ntohl(((struct nfsv2_time *)(f))->nfsv2_sec); \
78 1.11 fvdl if (((struct nfsv2_time *)(f))->nfsv2_usec != 0xffffffff) \
79 1.11 fvdl (t)->tv_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfsv2_usec); \
80 1.8 mycroft else \
81 1.10 jtc (t)->tv_nsec = 0; \
82 1.6 mycroft }
83 1.11 fvdl #define txdr_nfsv2time(f, t) { \
84 1.11 fvdl ((struct nfsv2_time *)(t))->nfsv2_sec = htonl((f)->tv_sec); \
85 1.11 fvdl if ((f)->tv_nsec != -1) \
86 1.11 fvdl ((struct nfsv2_time *)(t))->nfsv2_usec = htonl((f)->tv_nsec / 1000); \
87 1.11 fvdl else \
88 1.11 fvdl ((struct nfsv2_time *)(t))->nfsv2_usec = 0xffffffff; \
89 1.6 mycroft }
90 1.6 mycroft
91 1.11 fvdl #define fxdr_nfsv3time(f, t) { \
92 1.11 fvdl (t)->tv_sec = ntohl(((struct nfsv3_time *)(f))->nfsv3_sec); \
93 1.11 fvdl (t)->tv_nsec = ntohl(((struct nfsv3_time *)(f))->nfsv3_nsec); \
94 1.11 fvdl }
95 1.11 fvdl #define txdr_nfsv3time(f, t) { \
96 1.11 fvdl ((struct nfsv3_time *)(t))->nfsv3_sec = htonl((f)->tv_sec); \
97 1.11 fvdl ((struct nfsv3_time *)(t))->nfsv3_nsec = htonl((f)->tv_nsec); \
98 1.6 mycroft }
99 1.6 mycroft
100 1.13 fair #define fxdr_hyper(f) \
101 1.13 fair ((((u_quad_t)ntohl(((u_int32_t *)(f))[0])) << 32) | \
102 1.13 fair (u_quad_t)(ntohl(((u_int32_t *)(f))[1])))
103 1.13 fair
104 1.13 fair
105 1.13 fair #define txdr_hyper(f, t) { \
106 1.13 fair ((u_int32_t *)(t))[0] = htonl((u_int32_t)((f) >> 32)); \
107 1.13 fair ((u_int32_t *)(t))[1] = htonl((u_int32_t)((f) & 0xffffffff)); \
108 1.6 mycroft }
109 1.11 fvdl
110 1.11 fvdl #endif
111