/*
|
/*
|
* Copyright (c) 1989, 1993
|
* Copyright (c) 1989, 1993
|
* The Regents of the University of California. All rights reserved.
|
* The Regents of the University of California. All rights reserved.
|
*
|
*
|
* This code is derived from software contributed to Berkeley by
|
* This code is derived from software contributed to Berkeley by
|
* Rick Macklem at The University of Guelph.
|
* Rick Macklem at The University of Guelph.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 3. All advertising materials mentioning features or use of this software
|
* 3. All advertising materials mentioning features or use of this software
|
* must display the following acknowledgement:
|
* must display the following acknowledgement:
|
* This product includes software developed by the University of
|
* This product includes software developed by the University of
|
* California, Berkeley and its contributors.
|
* California, Berkeley and its contributors.
|
* 4. Neither the name of the University nor the names of its contributors
|
* 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
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* 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
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*
|
*
|
* @(#)xdr_subs.h 8.1 (Berkeley) 6/10/93
|
* @(#)xdr_subs.h 8.1 (Berkeley) 6/10/93
|
* $Id: xdr_subs.h,v 1.2 2001-09-27 12:01:56 chris Exp $
|
* $Id: xdr_subs.h,v 1.2 2001-09-27 12:01:56 chris Exp $
|
*/
|
*/
|
|
|
#ifndef _NFS_XDR_SUBS_H_
|
#ifndef _NFS_XDR_SUBS_H_
|
#define _NFS_XDR_SUBS_H_
|
#define _NFS_XDR_SUBS_H_
|
|
|
/*
|
/*
|
* Macros used for conversion to/from xdr representation by nfs...
|
* Macros used for conversion to/from xdr representation by nfs...
|
* These use the MACHINE DEPENDENT routines ntohl, htonl
|
* These use the MACHINE DEPENDENT routines ntohl, htonl
|
* As defined by "XDR: External Data Representation Standard" RFC1014
|
* As defined by "XDR: External Data Representation Standard" RFC1014
|
*
|
*
|
* To simplify the implementation, we use ntohl/htonl even on big-endian
|
* To simplify the implementation, we use ntohl/htonl even on big-endian
|
* machines, and count on them being `#define'd away. Some of these
|
* machines, and count on them being `#define'd away. Some of these
|
* might be slightly more efficient as quad_t copies on a big-endian,
|
* might be slightly more efficient as quad_t copies on a big-endian,
|
* but we cannot count on their alignment anyway.
|
* but we cannot count on their alignment anyway.
|
*/
|
*/
|
|
|
#define fxdr_unsigned(t, v) ((t)ntohl((long)(v)))
|
#define fxdr_unsigned(t, v) ((t)ntohl((long)(v)))
|
#define txdr_unsigned(v) (htonl((long)(v)))
|
#define txdr_unsigned(v) (htonl((long)(v)))
|
|
|
#define fxdr_nfsv2time(f, t) { \
|
#define fxdr_nfsv2time(f, t) { \
|
(t)->tv_sec = ntohl(((struct nfsv2_time *)(f))->nfsv2_sec); \
|
(t)->tv_sec = ntohl(((struct nfsv2_time *)(f))->nfsv2_sec); \
|
if (((struct nfsv2_time *)(f))->nfsv2_usec != 0xffffffff) \
|
if (((struct nfsv2_time *)(f))->nfsv2_usec != 0xffffffff) \
|
(t)->tv_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfsv2_usec); \
|
(t)->tv_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfsv2_usec); \
|
else \
|
else \
|
(t)->tv_nsec = 0; \
|
(t)->tv_nsec = 0; \
|
}
|
}
|
#define txdr_nfsv2time(f, t) { \
|
#define txdr_nfsv2time(f, t) { \
|
((struct nfsv2_time *)(t))->nfsv2_sec = htonl((f)->tv_sec); \
|
((struct nfsv2_time *)(t))->nfsv2_sec = htonl((f)->tv_sec); \
|
if ((f)->tv_nsec != -1) \
|
if ((f)->tv_nsec != -1) \
|
((struct nfsv2_time *)(t))->nfsv2_usec = htonl((f)->tv_nsec / 1000); \
|
((struct nfsv2_time *)(t))->nfsv2_usec = htonl((f)->tv_nsec / 1000); \
|
else \
|
else \
|
((struct nfsv2_time *)(t))->nfsv2_usec = 0xffffffff; \
|
((struct nfsv2_time *)(t))->nfsv2_usec = 0xffffffff; \
|
}
|
}
|
|
|
#define fxdr_nfsv3time(f, t) { \
|
#define fxdr_nfsv3time(f, t) { \
|
(t)->tv_sec = ntohl(((struct nfsv3_time *)(f))->nfsv3_sec); \
|
(t)->tv_sec = ntohl(((struct nfsv3_time *)(f))->nfsv3_sec); \
|
(t)->tv_nsec = ntohl(((struct nfsv3_time *)(f))->nfsv3_nsec); \
|
(t)->tv_nsec = ntohl(((struct nfsv3_time *)(f))->nfsv3_nsec); \
|
}
|
}
|
#define txdr_nfsv3time(f, t) { \
|
#define txdr_nfsv3time(f, t) { \
|
((struct nfsv3_time *)(t))->nfsv3_sec = htonl((f)->tv_sec); \
|
((struct nfsv3_time *)(t))->nfsv3_sec = htonl((f)->tv_sec); \
|
((struct nfsv3_time *)(t))->nfsv3_nsec = htonl((f)->tv_nsec); \
|
((struct nfsv3_time *)(t))->nfsv3_nsec = htonl((f)->tv_nsec); \
|
}
|
}
|
|
|
#define fxdr_hyper(f, t) { \
|
#define fxdr_hyper(f, t) { \
|
((long *)(t))[_QUAD_HIGHWORD] = ntohl(((long *)(f))[0]); \
|
((long *)(t))[_QUAD_HIGHWORD] = ntohl(((long *)(f))[0]); \
|
((long *)(t))[_QUAD_LOWWORD] = ntohl(((long *)(f))[1]); \
|
((long *)(t))[_QUAD_LOWWORD] = ntohl(((long *)(f))[1]); \
|
}
|
}
|
#define txdr_hyper(f, t) { \
|
#define txdr_hyper(f, t) { \
|
((long *)(t))[0] = htonl(((long *)(f))[_QUAD_HIGHWORD]); \
|
((long *)(t))[0] = htonl(((long *)(f))[_QUAD_HIGHWORD]); \
|
((long *)(t))[1] = htonl(((long *)(f))[_QUAD_LOWWORD]); \
|
((long *)(t))[1] = htonl(((long *)(f))[_QUAD_LOWWORD]); \
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
