Subversion Repositories HelenOS

Rev

Rev 4377 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 4377 Rev 4692
1 
/*
 1 
/*
2 
 * Copyright (c) 2005 Jakub Jermar
 2 
 * Copyright (c) 2005 Jakub Jermar
3 
 * All rights reserved.
 3 
 * All rights reserved.
4 
 *
 4 
 *
5 
 * Redistribution and use in source and binary forms, with or without
 5 
 * Redistribution and use in source and binary forms, with or without
6 
 * modification, are permitted provided that the following conditions
 6 
 * modification, are permitted provided that the following conditions
7 
 * are met:
 7 
 * are met:
8 
 *
 8 
 *
9 
 * - Redistributions of source code must retain the above copyright
 9 
 * - Redistributions of source code must retain the above copyright
10 
 *   notice, this list of conditions and the following disclaimer.
 10 
 *   notice, this list of conditions and the following disclaimer.
11 
 * - Redistributions in binary form must reproduce the above copyright
 11 
 * - Redistributions in binary form must reproduce the above copyright
12 
 *   notice, this list of conditions and the following disclaimer in the
 12 
 *   notice, this list of conditions and the following disclaimer in the
13 
 *   documentation and/or other materials provided with the distribution.
 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
 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.
 15 
 *   derived from this software without specific prior written permission.
16 
 *
 16 
 *
17 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 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
 18 
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 19 
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 20 
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 21 
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 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
 23 
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 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
 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.
 26 
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 
 */
 27 
 */
28 
 
 28 
 
29 
/** @addtogroup generic
 29 
/** @addtogroup generic
30 
 * @{
 30 
 * @{
31 
 */
 31 
 */
32 
/** @file
 32 
/** @file
33 
 */
 33 
 */
34 
 
 34 
 
35 
#ifndef KERN_BYTEORDER_H_
 35 
#ifndef KERN_BYTEORDER_H_
36 
#define KERN_BYTEORDER_H_
 36 
#define KERN_BYTEORDER_H_
37 
 
 37 
 
38 
#include <arch/byteorder.h>
 - 
 
39 
#include <arch/types.h>
 38 
#include <arch/types.h>
40 
 
 39 
 
41 
#if !(defined(ARCH_IS_BIG_ENDIAN) ^ defined(ARCH_IS_LITTLE_ENDIAN))
 40 
#if !(defined(__BE__) ^ defined(__LE__))
42 
#error The architecture must be either big-endian or little-endian.
 41 
    #error The architecture must be either big-endian or little-endian.
43 
#endif
 42 
#endif
44 
 
 43 
 
45 
#ifdef ARCH_IS_BIG_ENDIAN
 44 
#ifdef __BE__
46 
 
 45 
 
47 
#define uint16_t_le2host(n)     uint16_t_byteorder_swap(n)
 46 
#define uint16_t_le2host(n)  (uint16_t_byteorder_swap(n))
48 
#define uint32_t_le2host(n)     uint32_t_byteorder_swap(n)
 47 
#define uint32_t_le2host(n)  (uint32_t_byteorder_swap(n))
49 
#define uint64_t_le2host(n)     uint64_t_byteorder_swap(n)
 48 
#define uint64_t_le2host(n)  (uint64_t_byteorder_swap(n))
50 
 
 49 
 
51 
#define uint16_t_be2host(n)     (n)
 50 
#define uint16_t_be2host(n)  (n)
52 
#define uint32_t_be2host(n)     (n)
 51 
#define uint32_t_be2host(n)  (n)
53 
#define uint64_t_be2host(n)     (n)
 52 
#define uint64_t_be2host(n)  (n)
54 
 
 53 
 
55 
#define host2uint16_t_le(n)     uint16_t_byteorder_swap(n)
 54 
#define host2uint16_t_le(n)  (uint16_t_byteorder_swap(n))
56 
#define host2uint32_t_le(n)     uint32_t_byteorder_swap(n)
 55 
#define host2uint32_t_le(n)  (uint32_t_byteorder_swap(n))
57 
#define host2uint64_t_le(n)     uint64_t_byteorder_swap(n)
 56 
#define host2uint64_t_le(n)  (uint64_t_byteorder_swap(n))
58 
 
 57 
 
59 
#define host2uint16_t_be(n)     (n)
 58 
#define host2uint16_t_be(n)  (n)
60 
#define host2uint32_t_be(n)     (n)
 59 
#define host2uint32_t_be(n)  (n)
61 
#define host2uint64_t_be(n)     (n)
 60 
#define host2uint64_t_be(n)  (n)
62 
 
 61 
 
63 
#else
 62 
#else
64 
 
 63 
 
65 
#define uint16_t_le2host(n)     (n)
 64 
#define uint16_t_le2host(n)  (n)
66 
#define uint32_t_le2host(n)     (n)
 65 
#define uint32_t_le2host(n)  (n)
67 
#define uint64_t_le2host(n)     (n)
 66 
#define uint64_t_le2host(n)  (n)
68 
 
 67 
 
69 
#define uint16_t_be2host(n)     uint16_t_byteorder_swap(n)
 68 
#define uint16_t_be2host(n)  (uint16_t_byteorder_swap(n))
70 
#define uint32_t_be2host(n)     uint32_t_byteorder_swap(n)
 69 
#define uint32_t_be2host(n)  (uint32_t_byteorder_swap(n))
71 
#define uint64_t_be2host(n)     uint64_t_byteorder_swap(n)
 70 
#define uint64_t_be2host(n)  (uint64_t_byteorder_swap(n))
72 
 
 71 
 
73 
#define host2uint16_t_le(n)     (n)
 72 
#define host2uint16_t_le(n)  (n)
74 
#define host2uint32_t_le(n)     (n)
 73 
#define host2uint32_t_le(n)  (n)
75 
#define host2uint64_t_le(n)     (n)
 74 
#define host2uint64_t_le(n)  (n)
76 
 
 75 
 
77 
#define host2uint16_t_be(n)     uint16_t_byteorder_swap(n)
 76 
#define host2uint16_t_be(n)  (uint16_t_byteorder_swap(n))
78 
#define host2uint32_t_be(n)     uint32_t_byteorder_swap(n)
 77 
#define host2uint32_t_be(n)  (uint32_t_byteorder_swap(n))
79 
#define host2uint64_t_be(n)     uint64_t_byteorder_swap(n)
 78 
#define host2uint64_t_be(n)  (uint64_t_byteorder_swap(n))
80 
 
 79 
 
81 
#endif
 80 
#endif
82 
 
 81 
 
83 
static inline uint64_t uint64_t_byteorder_swap(uint64_t n)
 82 
static inline uint64_t uint64_t_byteorder_swap(uint64_t n)
84 
{
 83 
{
85 
    return ((n & 0xff) << 56) |
 84 
    return ((n & 0xff) << 56) |
86 
        ((n & 0xff00) << 40) |
 85 
        ((n & 0xff00) << 40) |
87 
        ((n & 0xff0000) << 24) |
 86 
        ((n & 0xff0000) << 24) |
88 
        ((n & 0xff000000LL) << 8) |
 87 
        ((n & 0xff000000LL) << 8) |
89 
        ((n & 0xff00000000LL) >> 8) |
 88 
        ((n & 0xff00000000LL) >> 8) |
90 
        ((n & 0xff0000000000LL) >> 24) |
 89 
        ((n & 0xff0000000000LL) >> 24) |
91 
        ((n & 0xff000000000000LL) >> 40) |
 90 
        ((n & 0xff000000000000LL) >> 40) |
92 
        ((n & 0xff00000000000000LL) >> 56);
 91 
        ((n & 0xff00000000000000LL) >> 56);
93 
}
 92 
}
94 
 
 93 
 
95 
static inline uint32_t uint32_t_byteorder_swap(uint32_t n)
 94 
static inline uint32_t uint32_t_byteorder_swap(uint32_t n)
96 
{
 95 
{
97 
    return ((n & 0xff) << 24) |
 96 
    return ((n & 0xff) << 24) |
98 
        ((n & 0xff00) << 8) |
 97 
        ((n & 0xff00) << 8) |
99 
        ((n & 0xff0000) >> 8) |
 98 
        ((n & 0xff0000) >> 8) |
100 
        ((n & 0xff000000) >> 24);
 99 
        ((n & 0xff000000) >> 24);
101 
}
 100 
}
102 
 
 101 
 
103 
static inline uint16_t uint16_t_byteorder_swap(uint16_t n)
 102 
static inline uint16_t uint16_t_byteorder_swap(uint16_t n)
104 
{
 103 
{
105 
    return ((n & 0xff) << 8) |
 104 
    return ((n & 0xff) << 8) |
106 
        ((n & 0xff00) >> 8);
 105 
        ((n & 0xff00) >> 8);
107 
}
 106 
}
108 
 
 107 
 
109 
#endif
 108 
#endif
110 
 
 109 
 
111 
/** @}
 110 
/** @}
112 
 */
 111 
 */
113 
 
 112