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.1 (Berkeley) 6/10/93
| 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.1 (Berkeley) 6/10/93
|
40/* 41 * Macros used for conversion to/from xdr representation by nfs... 42 * These use the MACHINE DEPENDENT routines ntohl, htonl 43 * As defined by "XDR: External Data Representation Standard" RFC1014 44 * 45 * To simplify the implementation, we use ntohl/htonl even on big-endian 46 * machines, and count on them being `#define'd away. Some of these 47 * might be slightly more efficient as quad_t copies on a big-endian, 48 * but we cannot count on their alignment anyway. 49 */ 50 51#define fxdr_unsigned(t, v) ((t)ntohl((long)(v))) 52#define txdr_unsigned(v) (htonl((long)(v))) 53 54#define fxdr_nfstime(f, t) { \ 55 (t)->ts_sec = ntohl(((struct nfsv2_time *)(f))->nfs_sec); \ 56 (t)->ts_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfs_usec); \ 57} 58#define txdr_nfstime(f, t) { \ 59 ((struct nfsv2_time *)(t))->nfs_sec = htonl((f)->ts_sec); \ 60 ((struct nfsv2_time *)(t))->nfs_usec = htonl((f)->ts_nsec) / 1000; \ 61} 62 63#define fxdr_nqtime(f, t) { \ 64 (t)->ts_sec = ntohl(((struct nqnfs_time *)(f))->nq_sec); \ 65 (t)->ts_nsec = ntohl(((struct nqnfs_time *)(f))->nq_nsec); \ 66} 67#define txdr_nqtime(f, t) { \ 68 ((struct nqnfs_time *)(t))->nq_sec = htonl((f)->ts_sec); \ 69 ((struct nqnfs_time *)(t))->nq_nsec = htonl((f)->ts_nsec); \ 70} 71 72#define fxdr_hyper(f, t) { \ 73 ((long *)(t))[_QUAD_HIGHWORD] = ntohl(((long *)(f))[0]); \ 74 ((long *)(t))[_QUAD_LOWWORD] = ntohl(((long *)(f))[1]); \ 75} 76#define txdr_hyper(f, t) { \ 77 ((long *)(t))[0] = htonl(((long *)(f))[_QUAD_HIGHWORD]); \ 78 ((long *)(t))[1] = htonl(((long *)(f))[_QUAD_LOWWORD]); \ 79}
| 43/* 44 * Macros used for conversion to/from xdr representation by nfs... 45 * These use the MACHINE DEPENDENT routines ntohl, htonl 46 * As defined by "XDR: External Data Representation Standard" RFC1014 47 * 48 * To simplify the implementation, we use ntohl/htonl even on big-endian 49 * machines, and count on them being `#define'd away. Some of these 50 * might be slightly more efficient as quad_t copies on a big-endian, 51 * but we cannot count on their alignment anyway. 52 */ 53 54#define fxdr_unsigned(t, v) ((t)ntohl((long)(v))) 55#define txdr_unsigned(v) (htonl((long)(v))) 56 57#define fxdr_nfstime(f, t) { \ 58 (t)->ts_sec = ntohl(((struct nfsv2_time *)(f))->nfs_sec); \ 59 (t)->ts_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfs_usec); \ 60} 61#define txdr_nfstime(f, t) { \ 62 ((struct nfsv2_time *)(t))->nfs_sec = htonl((f)->ts_sec); \ 63 ((struct nfsv2_time *)(t))->nfs_usec = htonl((f)->ts_nsec) / 1000; \ 64} 65 66#define fxdr_nqtime(f, t) { \ 67 (t)->ts_sec = ntohl(((struct nqnfs_time *)(f))->nq_sec); \ 68 (t)->ts_nsec = ntohl(((struct nqnfs_time *)(f))->nq_nsec); \ 69} 70#define txdr_nqtime(f, t) { \ 71 ((struct nqnfs_time *)(t))->nq_sec = htonl((f)->ts_sec); \ 72 ((struct nqnfs_time *)(t))->nq_nsec = htonl((f)->ts_nsec); \ 73} 74 75#define fxdr_hyper(f, t) { \ 76 ((long *)(t))[_QUAD_HIGHWORD] = ntohl(((long *)(f))[0]); \ 77 ((long *)(t))[_QUAD_LOWWORD] = ntohl(((long *)(f))[1]); \ 78} 79#define txdr_hyper(f, t) { \ 80 ((long *)(t))[0] = htonl(((long *)(f))[_QUAD_HIGHWORD]); \ 81 ((long *)(t))[1] = htonl(((long *)(f))[_QUAD_LOWWORD]); \ 82}
|