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
35#ifndef _NFS_XDR_SUBS_H_
36#define _NFS_XDR_SUBS_H_
37
38/*
39 * Macros used for conversion to/from xdr representation by nfs...
40 * These use the MACHINE DEPENDENT routines ntohl, htonl
41 * As defined by "XDR: External Data Representation Standard" RFC1014
42 *
43 * To simplify the implementation, we use ntohl/htonl even on big-endian
44 * machines, and count on them being `#define'd away.  Some of these
45 * might be slightly more efficient as quad_t copies on a big-endian,
46 * but we cannot count on their alignment anyway.
47 */
48
49#define	fxdr_unsigned(t, v)	((t)ntohl((int32_t)(v)))
50#define	txdr_unsigned(v)	(htonl((int32_t)(v)))
51
52#define	fxdr_nfsv2time(f, t) \
53do { \
54	(t)->tv_sec = ntohl(((struct nfsv2_time *)(f))->nfsv2_sec); \
55	if (((struct nfsv2_time *)(f))->nfsv2_usec != 0xffffffff) \
56		(t)->tv_nsec = 1000 * ntohl(((struct nfsv2_time *)(f))->nfsv2_usec); \
57	else \
58		(t)->tv_nsec = 0; \
59} while (0)
60#define	txdr_nfsv2time(f, t) \
61do { \
62	((struct nfsv2_time *)(t))->nfsv2_sec = htonl((f)->tv_sec); \
63	if ((f)->tv_nsec != -1) \
64		((struct nfsv2_time *)(t))->nfsv2_usec = htonl((f)->tv_nsec / 1000); \
65	else \
66		((struct nfsv2_time *)(t))->nfsv2_usec = 0xffffffff; \
67} while (0)
68
69#define	fxdr_nfsv3time(f, t) \
70do { \
71	(t)->tv_sec = ntohl(((struct nfsv3_time *)(f))->nfsv3_sec); \
72	(t)->tv_nsec = ntohl(((struct nfsv3_time *)(f))->nfsv3_nsec); \
73} while (0)
74#define	txdr_nfsv3time(f, t) \
75do { \
76	((struct nfsv3_time *)(t))->nfsv3_sec = htonl((f)->tv_sec); \
77	((struct nfsv3_time *)(t))->nfsv3_nsec = htonl((f)->tv_nsec); \
78} while (0)
79
80#define	fxdr_hyper(f) \
81	((((u_quad_t)ntohl(((u_int32_t *)(f))[0])) << 32) | \
82	 (u_quad_t)(ntohl(((u_int32_t *)(f))[1])))
83
84static inline void
85txdr_hyper(uint64_t f, uint32_t* t)
86{
87	t[0] = htonl((u_int32_t)(f >> 32));
88	t[1] = htonl((u_int32_t)(f & 0xffffffff));
89}
90
91#endif
92