source: mainline/boot/generic/include/byteorder.h@ 8df5f20

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 8df5f20 was 63a045c, checked in by Jiří Zárevúcky <zarevucky.jiri@…>, 7 years ago

Unify handling of compressed init data and use regular tar + gzip to achieve it

There are two issues this commit solves.

First is that architecture-specific code duplicates most of the init binary
handling in each architecture, each with miniscule and confusing variations.
After this commit, the init binary expansion is almost entirely handled by
unified generic code.

Second is that the way we used to generate the incorporated data is somewhat
convoluted. Previously we have a Python script which generates a zip archive
with individual deflate-compressed files and accompanying header and C files
which contain structures describing the archive contents.
The zip file is then extracted and the individual deflate-compressed files are
included in the binary via assembler code.
Since gas doesn't take particular care to be consistent between architectures,
the assembly portions are also not uniform and the build script needs to know
particulars of the architecture's assembly.

Instead of doing that, after this commit we first gzip each included file, then
we pack the gzipped files into a tar archive, and then we include the archive
into the binary using objcopy.
Linker script provides symbols for the start and end of the archive,
and the payload is in a self-describing format, so there is no need for any
generated code.

Note that we are doing the opposite of the conventional .tar.gz format.
It would be somewhat inconvenient to use .tar.gz since the uncompressed files
need to be aligned to page size, so we'd have to first decompress the entire
payload to determine the final position of the files (and hence the required
amount of memory).

  • Property mode set to 100644
File size: 4.5 KB
Line 
1/*
2 * Copyright (c) 2005 Jakub Jermar
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
29/** @addtogroup libc
30 * @{
31 */
32/** @file
33 */
34
35#ifndef LIBC_BYTEORDER_H_
36#define LIBC_BYTEORDER_H_
37
38#include <stdint.h>
39
40#if !(defined(__BE__) ^ defined(__LE__))
41#error The architecture must be either big-endian or little-endian.
42#endif
43
44#ifdef __BE__
45
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))
49
50#define uint16_t_be2host(n) (n)
51#define uint32_t_be2host(n) (n)
52#define uint64_t_be2host(n) (n)
53
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))
57
58#define host2uint16_t_be(n) (n)
59#define host2uint32_t_be(n) (n)
60#define host2uint64_t_be(n) (n)
61
62#else
63
64#define uint16_t_le2host(n) (n)
65#define uint32_t_le2host(n) (n)
66#define uint64_t_le2host(n) (n)
67
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))
71
72#define host2uint16_t_le(n) (n)
73#define host2uint32_t_le(n) (n)
74#define host2uint64_t_le(n) (n)
75
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))
79
80#endif
81
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))
86
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)
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)
112
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
139#endif
140
141/** @}
142 */
Note: See TracBrowser for help on using the repository browser.