endian.h revision 1.3 1 1.1 briggs /*
2 1.1 briggs * Copyright (c) 1990 The Regents of the University of California.
3 1.1 briggs * All rights reserved.
4 1.1 briggs *
5 1.1 briggs * Redistribution and use in source and binary forms, with or without
6 1.1 briggs * modification, are permitted provided that the following conditions
7 1.1 briggs * are met:
8 1.1 briggs * 1. Redistributions of source code must retain the above copyright
9 1.1 briggs * notice, this list of conditions and the following disclaimer.
10 1.1 briggs * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 briggs * notice, this list of conditions and the following disclaimer in the
12 1.1 briggs * documentation and/or other materials provided with the distribution.
13 1.1 briggs * 3. All advertising materials mentioning features or use of this software
14 1.1 briggs * must display the following acknowledgement:
15 1.1 briggs * This product includes software developed by the University of
16 1.1 briggs * California, Berkeley and its contributors.
17 1.1 briggs * 4. Neither the name of the University nor the names of its contributors
18 1.1 briggs * may be used to endorse or promote products derived from this software
19 1.1 briggs * without specific prior written permission.
20 1.1 briggs *
21 1.1 briggs * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 briggs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 briggs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 briggs * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 briggs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 briggs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 briggs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 briggs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 briggs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 briggs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 briggs * SUCH DAMAGE.
32 1.1 briggs */
33 1.1 briggs
34 1.1 briggs /*
35 1.2 briggs * from: @(#)endian.h 7.7 (Berkeley) 4/3/91
36 1.3 briggs * $Id: endian.h,v 1.3 1993/12/02 15:02:50 briggs Exp $
37 1.1 briggs */
38 1.1 briggs
39 1.1 briggs /*
40 1.1 briggs ALICE
41 1.1 briggs BG 05/24/92,17:10:58
42 1.1 briggs I don't think we need to change this very much.
43 1.1 briggs */
44 1.3 briggs #ifndef _MACHINE_ENDIAN_H_
45 1.3 briggs #define _MACHINE_ENDIAN_H_
46 1.3 briggs
47 1.3 briggs #define _QUAD_HIGHWORD 0
48 1.3 briggs #define _QUAD_LOWWORD 1
49 1.1 briggs
50 1.1 briggs /*
51 1.1 briggs * Definitions for byte order, according to byte significance from low
52 1.1 briggs * address to high.
53 1.1 briggs */
54 1.1 briggs #define LITTLE_ENDIAN 1234 /* LSB first: i386, vax */
55 1.1 briggs #define BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */
56 1.1 briggs #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */
57 1.1 briggs
58 1.1 briggs #define BYTE_ORDER BIG_ENDIAN
59 1.1 briggs
60 1.1 briggs #include <sys/cdefs.h>
61 1.1 briggs
62 1.1 briggs #define __word_swap_long(x) \
63 1.1 briggs ({ register u_long X = (x); \
64 1.1 briggs asm ("swap %1" \
65 1.1 briggs : "=r" (X) \
66 1.1 briggs : "0" (X)); \
67 1.1 briggs X; })
68 1.1 briggs #if __GNUC__ >= 2
69 1.1 briggs #define __byte_swap_long(x) \
70 1.1 briggs ({ register u_long X = (x); \
71 1.1 briggs asm ("xchgb %h1, %b1\n\tswap %1\n\txchgb %h1, %b1" \
72 1.1 briggs : "=q" (X) \
73 1.1 briggs : "0" (X)); \
74 1.1 briggs X; })
75 1.1 briggs #define __byte_swap_word(x) \
76 1.1 briggs ({ register u_short X = (x); \
77 1.1 briggs asm ("xchgb %h1, %b1" \
78 1.1 briggs : "=q" (X) \
79 1.1 briggs : "0" (X)); \
80 1.1 briggs X; })
81 1.1 briggs #else /* __GNUC__ >= 2 */
82 1.1 briggs #define __byte_swap_long(x) \
83 1.1 briggs ({ register u_long X = (x); \
84 1.1 briggs asm ("rorw #8, %w1\n\tswap %1\n\trorw #8, %w1" \
85 1.1 briggs : "=r" (X) \
86 1.1 briggs : "0" (X)); \
87 1.1 briggs X; })
88 1.1 briggs #define __byte_swap_word(x) \
89 1.1 briggs ({ register u_short X = (x); \
90 1.1 briggs asm ("rorw #8, %w1" \
91 1.1 briggs : "=r" (X) \
92 1.1 briggs : "0" (X)); \
93 1.1 briggs X; })
94 1.1 briggs #endif /* __GNUC__ >= 2 */
95 1.1 briggs
96 1.1 briggs __BEGIN_DECLS
97 1.1 briggs unsigned long htonl __P((unsigned long));
98 1.1 briggs unsigned short htons __P((unsigned short));
99 1.1 briggs unsigned long ntohl __P((unsigned long));
100 1.1 briggs unsigned short ntohs __P((unsigned short));
101 1.1 briggs __END_DECLS
102 1.1 briggs
103 1.1 briggs /*
104 1.1 briggs * Macros for network/external number representation conversion.
105 1.1 briggs */
106 1.1 briggs #if BYTE_ORDER == BIG_ENDIAN && !defined(lint)
107 1.1 briggs #define ntohl(x) (x)
108 1.1 briggs #define ntohs(x) (x)
109 1.1 briggs #define htonl(x) (x)
110 1.1 briggs #define htons(x) (x)
111 1.1 briggs
112 1.1 briggs #define NTOHL(x) (x)
113 1.1 briggs #define NTOHS(x) (x)
114 1.1 briggs #define HTONL(x) (x)
115 1.1 briggs #define HTONS(x) (x)
116 1.1 briggs
117 1.1 briggs #else
118 1.1 briggs
119 1.1 briggs #define ntohl __byte_swap_long
120 1.1 briggs #define ntohs __byte_swap_word
121 1.1 briggs #define htonl __byte_swap_long
122 1.1 briggs #define htons __byte_swap_word
123 1.1 briggs
124 1.1 briggs #define NTOHL(x) (x) = ntohl((u_long)x)
125 1.1 briggs #define NTOHS(x) (x) = ntohs((u_short)x)
126 1.1 briggs #define HTONL(x) (x) = htonl((u_long)x)
127 1.1 briggs #define HTONS(x) (x) = htons((u_short)x)
128 1.1 briggs #endif
129 1.3 briggs
130 1.3 briggs #endif /* _MACHINE_ENDIAN_H_ */
131