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