|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
23: /*
24: * Copyright (c) 1989, 1993
25: * The Regents of the University of California. All rights reserved.
26: *
27: * The NEXTSTEP Software License Agreement specifies the terms
28: * and conditions for redistribution.
29: *
30: * This code is derived from software contributed to Berkeley by
31: * Rick Macklem at The University of Guelph.
32: *
33: * Redistribution and use in source and binary forms, with or without
34: * modification, are permitted provided that the following conditions
35: * are met:
36: * 1. Redistributions of source code must retain the above copyright
37: * notice, this list of conditions and the following disclaimer.
38: * 2. Redistributions in binary form must reproduce the above copyright
39: * notice, this list of conditions and the following disclaimer in the
40: * documentation and/or other materials provided with the distribution.
41: * 3. All advertising materials mentioning features or use of this software
42: * must display the following acknowledgement:
43: * This product includes software developed by the University of
44: * California, Berkeley and its contributors.
45: * 4. Neither the name of the University nor the names of its contributors
46: * may be used to endorse or promote products derived from this software
47: * without specific prior written permission.
48: *
49: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59: * SUCH DAMAGE.
60: *
61: * @(#)xdr_subs.h 8.3 (Berkeley) 3/30/95
62: * FreeBSD-Id: xdr_subs.h,v 1.9 1997/02/22 09:42:53 peter Exp $
63: */
64:
65:
66: #ifndef _NFS_XDR_SUBS_H_
67: #define _NFS_XDR_SUBS_H_
68:
69: /*
70: * Macros used for conversion to/from xdr representation by nfs...
71: * These use the MACHINE DEPENDENT routines ntohl, htonl
72: * As defined by "XDR: External Data Representation Standard" RFC1014
73: *
74: * To simplify the implementation, we use ntohl/htonl even on big-endian
75: * machines, and count on them being `#define'd away. Some of these
76: * might be slightly more efficient as quad_t copies on a big-endian,
77: * but we cannot count on their alignment anyway.
78: */
79:
80: #define fxdr_unsigned(t, v) ((t)ntohl((long)(v)))
81: #define txdr_unsigned(v) (htonl((long)(v)))
82:
83: #define fxdr_nfsv2time(f, t) { \
84: (t)->tv_sec = ntohl(((struct nfsv2_time *)(f))->nfsv2_sec); \
85: if (((struct nfsv2_time *)(f))->nfsv2_usec != 0xffffffff) \
86: (t)->tv_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfsv2_usec); \
87: else \
88: (t)->tv_nsec = 0; \
89: }
90: #define txdr_nfsv2time(f, t) { \
91: ((struct nfsv2_time *)(t))->nfsv2_sec = htonl((f)->tv_sec); \
92: if ((f)->tv_nsec != -1) \
93: ((struct nfsv2_time *)(t))->nfsv2_usec = htonl((f)->tv_nsec / 1000); \
94: else \
95: ((struct nfsv2_time *)(t))->nfsv2_usec = 0xffffffff; \
96: }
97:
98: #define fxdr_nfsv3time(f, t) { \
99: (t)->tv_sec = ntohl(((struct nfsv3_time *)(f))->nfsv3_sec); \
100: (t)->tv_nsec = ntohl(((struct nfsv3_time *)(f))->nfsv3_nsec); \
101: }
102: #define txdr_nfsv3time(f, t) { \
103: ((struct nfsv3_time *)(t))->nfsv3_sec = htonl((f)->tv_sec); \
104: ((struct nfsv3_time *)(t))->nfsv3_nsec = htonl((f)->tv_nsec); \
105: }
106:
107: #define fxdr_hyper(f, t) { \
108: ((long *)(t))[_QUAD_HIGHWORD] = ntohl(((long *)(f))[0]); \
109: ((long *)(t))[_QUAD_LOWWORD] = ntohl(((long *)(f))[1]); \
110: }
111: #define txdr_hyper(f, t) { \
112: ((long *)(t))[0] = htonl(((long *)(f))[_QUAD_HIGHWORD]); \
113: ((long *)(t))[1] = htonl(((long *)(f))[_QUAD_LOWWORD]); \
114: }
115:
116: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.