| 1 | /* $NetBSD: xdr_subs.h,v 1.15 2005/12/11 12:25:17 christos Exp $ */ |
| 2 | |
| 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 | */ |
| 36 | |
| 37 | |
| 38 | #ifndef _NFS_XDR_SUBS_H_ |
| 39 | #define _NFS_XDR_SUBS_H_ |
| 40 | |
| 41 | /* |
| 42 | * Macros used for conversion to/from xdr representation by nfs... |
| 43 | * These use the MACHINE DEPENDENT routines ntohl, htonl |
| 44 | * As defined by "XDR: External Data Representation Standard" RFC1014 |
| 45 | * |
| 46 | * To simplify the implementation, we use ntohl/htonl even on big-endian |
| 47 | * machines, and count on them being `#define'd away. Some of these |
| 48 | * might be slightly more efficient as quad_t copies on a big-endian, |
| 49 | * but we cannot count on their alignment anyway. |
| 50 | */ |
| 51 | |
| 52 | #define fxdr_unsigned(t, v) ((t)ntohl((int32_t)(v))) |
| 53 | #define txdr_unsigned(v) (htonl((int32_t)(v))) |
| 54 | |
| 55 | /* |
| 56 | * Directory cookies shouldn't really be XDR-ed, these functions |
| 57 | * are just here to attempt to keep information within 32 bits. And |
| 58 | * make things look better. See nfs_cookieheuristic. |
| 59 | */ |
| 60 | #define fxdr_cookie3(v) (((off_t)((v)[0]) << 32) | ((off_t) (v)[1])) |
| 61 | #define fxdr_swapcookie3(v) (((off_t)((v)[1]) << 32) | ((off_t) (v)[0])) |
| 62 | |
| 63 | #define txdr_cookie3(f, v) { \ |
| 64 | (v)[1] = (u_int32_t)((f) & 0xffffffffLL); \ |
| 65 | (v)[0] = (u_int32_t)((f) >> 32); \ |
| 66 | } |
| 67 | #define txdr_swapcookie3(f, v) { \ |
| 68 | (v)[0] = (u_int32_t)((f) & 0xffffffffLL); \ |
| 69 | (v)[1] = (u_int32_t)((f) >> 32); \ |
| 70 | } |
| 71 | |
| 72 | #define fxdr_nfsv2time(f, t) { \ |
| 73 | (t)->tv_sec = ntohl(((struct nfsv2_time *)(f))->nfsv2_sec); \ |
| 74 | if (((struct nfsv2_time *)(f))->nfsv2_usec != 0xffffffff) \ |
| 75 | (t)->tv_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfsv2_usec); \ |
| 76 | else \ |
| 77 | (t)->tv_nsec = 0; \ |
| 78 | } |
| 79 | #define txdr_nfsv2time(f, t) { \ |
| 80 | ((struct nfsv2_time *)(t))->nfsv2_sec = htonl((f)->tv_sec); \ |
| 81 | if ((f)->tv_nsec != -1) \ |
| 82 | ((struct nfsv2_time *)(t))->nfsv2_usec = htonl((f)->tv_nsec / 1000); \ |
| 83 | else \ |
| 84 | ((struct nfsv2_time *)(t))->nfsv2_usec = 0xffffffff; \ |
| 85 | } |
| 86 | |
| 87 | #define fxdr_nfsv3time(f, t) { \ |
| 88 | (t)->tv_sec = ntohl(((struct nfsv3_time *)(f))->nfsv3_sec); \ |
| 89 | (t)->tv_nsec = ntohl(((struct nfsv3_time *)(f))->nfsv3_nsec); \ |
| 90 | } |
| 91 | #define txdr_nfsv3time(f, t) { \ |
| 92 | ((struct nfsv3_time *)(t))->nfsv3_sec = htonl((f)->tv_sec); \ |
| 93 | ((struct nfsv3_time *)(t))->nfsv3_nsec = htonl((f)->tv_nsec); \ |
| 94 | } |
| 95 | |
| 96 | #define fxdr_hyper(f) \ |
| 97 | ((((u_quad_t)ntohl(((u_int32_t *)(f))[0])) << 32) | \ |
| 98 | (u_quad_t)(ntohl(((u_int32_t *)(f))[1]))) |
| 99 | |
| 100 | |
| 101 | #define txdr_hyper(f, t) { \ |
| 102 | ((u_int32_t *)(t))[0] = htonl((u_int32_t)((f) >> 32)); \ |
| 103 | ((u_int32_t *)(t))[1] = htonl((u_int32_t)((f) & 0xffffffff)); \ |
| 104 | } |
| 105 | |
| 106 | #endif |
| 107 | |