source: mainline/uspace/lib/c/include/byteorder.h@ eec201d

Last change on this file since eec201d was 1433ecda, checked in by Jiri Svoboda <jiri@…>, 7 years ago

Fix cstyle: make ccheck-fix and commit only files where all the changes are good.

  • Property mode set to 100644
File size: 4.5 KB
RevLine 
[afffa1e]1/*
[776f2e6]2 * Copyright (c) 2005 Jakub Jermar
[afffa1e]3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
[fadd381]29/** @addtogroup libc
[b2951e2]30 * @{
31 */
32/** @file
33 */
34
[776f2e6]35#ifndef LIBC_BYTEORDER_H_
36#define LIBC_BYTEORDER_H_
[aa59fa0]37
[711e33fc]38#include <stdint.h>
[afffa1e]39
[ac47b7c2]40#if !(defined(__BE__) ^ defined(__LE__))
[1433ecda]41#error The architecture must be either big-endian or little-endian.
[776f2e6]42#endif
43
[ac47b7c2]44#ifdef __BE__
[711e33fc]45
[ac47b7c2]46#define uint16_t_le2host(n) (uint16_t_byteorder_swap(n))
47#define uint32_t_le2host(n) (uint32_t_byteorder_swap(n))
48#define uint64_t_le2host(n) (uint64_t_byteorder_swap(n))
[711e33fc]49
[ac47b7c2]50#define uint16_t_be2host(n) (n)
51#define uint32_t_be2host(n) (n)
52#define uint64_t_be2host(n) (n)
[711e33fc]53
[ac47b7c2]54#define host2uint16_t_le(n) (uint16_t_byteorder_swap(n))
55#define host2uint32_t_le(n) (uint32_t_byteorder_swap(n))
56#define host2uint64_t_le(n) (uint64_t_byteorder_swap(n))
[f772105e]57
[ac47b7c2]58#define host2uint16_t_be(n) (n)
59#define host2uint32_t_be(n) (n)
60#define host2uint64_t_be(n) (n)
[f772105e]61
[711e33fc]62#else
63
[ac47b7c2]64#define uint16_t_le2host(n) (n)
65#define uint32_t_le2host(n) (n)
66#define uint64_t_le2host(n) (n)
[711e33fc]67
[ac47b7c2]68#define uint16_t_be2host(n) (uint16_t_byteorder_swap(n))
69#define uint32_t_be2host(n) (uint32_t_byteorder_swap(n))
70#define uint64_t_be2host(n) (uint64_t_byteorder_swap(n))
[711e33fc]71
[ac47b7c2]72#define host2uint16_t_le(n) (n)
73#define host2uint32_t_le(n) (n)
74#define host2uint64_t_le(n) (n)
[f772105e]75
[ac47b7c2]76#define host2uint16_t_be(n) (uint16_t_byteorder_swap(n))
77#define host2uint32_t_be(n) (uint32_t_byteorder_swap(n))
78#define host2uint64_t_be(n) (uint64_t_byteorder_swap(n))
[f772105e]79
[711e33fc]80#endif
81
[47b7006]82#define htons(n) host2uint16_t_be((n))
83#define htonl(n) host2uint32_t_be((n))
84#define ntohs(n) uint16_t_be2host((n))
85#define ntohl(n) uint32_t_be2host((n))
[2687bdb]86
[5cbccd4]87#define uint8_t_be2host(n) (n)
88#define uint8_t_le2host(n) (n)
89#define host2uint8_t_be(n) (n)
90#define host2uint8_t_le(n) (n)
[39f1c86]91#define host2uint8_t_le(n) (n)
92
93#define int8_t_le2host(n) uint8_t_le2host(n)
94#define int16_t_le2host(n) uint16_t_le2host(n)
95#define int32_t_le2host(n) uint32_t_le2host(n)
96#define int64_t_le2host(n) uint64_t_le2host(n)
97
98#define int8_t_be2host(n) uint8_t_be2host(n)
99#define int16_t_be2host(n) uint16_t_be2host(n)
100#define int32_t_be2host(n) uint32_t_be2host(n)
101#define int64_t_be2host(n) uint64_t_be2host(n)
102
103#define host2int8_t_le(n) host2uint8_t_le(n)
104#define host2int16_t_le(n) host2uint16_t_le(n)
105#define host2int32_t_le(n) host2uint32_t_le(n)
106#define host2int64_t_le(n) host2uint64_t_le(n)
107
108#define host2int8_t_be(n) host2uint8_t_be(n)
109#define host2int16_t_be(n) host2uint16_t_be(n)
110#define host2int32_t_be(n) host2uint32_t_be(n)
111#define host2int64_t_be(n) host2uint64_t_be(n)
[5cbccd4]112
[711e33fc]113static inline uint64_t uint64_t_byteorder_swap(uint64_t n)
114{
115 return ((n & 0xff) << 56) |
116 ((n & 0xff00) << 40) |
117 ((n & 0xff0000) << 24) |
118 ((n & 0xff000000LL) << 8) |
119 ((n & 0xff00000000LL) >> 8) |
120 ((n & 0xff0000000000LL) >> 24) |
121 ((n & 0xff000000000000LL) >> 40) |
122 ((n & 0xff00000000000000LL) >> 56);
123}
124
125static inline uint32_t uint32_t_byteorder_swap(uint32_t n)
126{
127 return ((n & 0xff) << 24) |
128 ((n & 0xff00) << 8) |
129 ((n & 0xff0000) >> 8) |
130 ((n & 0xff000000) >> 24);
131}
132
133static inline uint16_t uint16_t_byteorder_swap(uint16_t n)
134{
135 return ((n & 0xff) << 8) |
136 ((n & 0xff00) >> 8);
137}
138
[afffa1e]139#endif
[85882fc]140
[fadd381]141/** @}
[b2951e2]142 */
Note: See TracBrowser for help on using the repository browser.