|
|
1.1 root 1: /*
2: * Copyright (c) 1987 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that the above copyright notice and this paragraph are
7: * duplicated in all such forms and that any documentation,
8: * advertising materials, and other materials related to such
9: * distribution and use acknowledge that the software was developed
10: * by the University of California, Berkeley. The name of the
11: * University may not be used to endorse or promote products derived
12: * from this software without specific prior written permission.
13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
16: *
17: * @(#)endian.h 7.3 (Berkeley) 6/29/88
18: */
19:
20: /*
21: * Definitions for byte order,
22: * according to byte significance from low address to high.
23: */
24: #define LITTLE_ENDIAN 1234 /* least-significant byte first (vax) */
25: #define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */
26: #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long (pdp) */
27:
28: #define BYTE_ORDER LITTLE_ENDIAN /* byte order on vax */
29:
30: /*
31: * Macros for network/external number representation conversion.
32: */
33: #if BYTE_ORDER == BIG_ENDIAN && !defined(lint)
34: #define ntohl(x) (x)
35: #define ntohs(x) (x)
36: #define htonl(x) (x)
37: #define htons(x) (x)
38: #else
39: unsigned short ntohs(), htons();
40: unsigned long ntohl(), htonl();
41: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.