blob: e889e527049d55ee7e85c2cef09539441d92d5a0 [file] [log] [blame]
Patrick Georgib7b56dd82009-09-14 13:29:27 +00001/*
2 * Copyright (C) 2009 coresystems GmbH
3 * written by Patrick Georgi <patrick.georgi@coresystems.de>
David Hendricks90ca3b62012-11-16 14:48:22 -08004 * Copyright (C) 2012 Google, Inc.
Patrick Georgib7b56dd82009-09-14 13:29:27 +00005 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; version 2 of the License.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
Patrick Georgib890a122015-03-26 15:17:45 +010017 * Foundation, Inc.
Patrick Georgib7b56dd82009-09-14 13:29:27 +000018 */
19
Stefan Reinauer63217582012-10-29 16:52:36 -070020#ifndef __CBFSTOOL_COMMON_H
21#define __CBFSTOOL_COMMON_H
22
Sol Bouchere3260a02015-03-25 13:40:08 -070023#include <stdbool.h>
Sol Boucher69b88bf2015-02-26 11:47:19 -080024#include <stddef.h>
Patrick Georgib7b56dd82009-09-14 13:29:27 +000025#include <stdint.h>
Sol Bouchere3260a02015-03-25 13:40:08 -070026#include <string.h>
Hung-Te Lin3cfacbf2013-01-30 00:43:46 +080027#include <assert.h>
Hung-Te Lin332795c2013-01-28 15:53:34 +080028
Aaron Durbind38e3de2015-10-01 14:25:19 -050029#include <console/console.h>
30
Hung-Te Lin332795c2013-01-28 15:53:34 +080031/* Endianess */
Stefan Reinauera1e48242011-10-21 14:24:57 -070032#include "swab.h"
Patrick Georgib7b56dd82009-09-14 13:29:27 +000033
Stefan Reinauer2dd161f2015-03-04 00:55:03 +010034/* Helpers */
35#define ARRAY_SIZE(a) (int)(sizeof(a) / sizeof((a)[0]))
36#define ALIGN(val, by) (((val) + (by)-1)&~((by)-1))
Sol Boucher67a0a862015-03-18 12:36:27 -070037#define MAX(x, y) ((x) > (y) ? (x) : (y))
38#define MIN(x, y) ((x) < (y) ? (x) : (y))
Stefan Reinauer2dd161f2015-03-04 00:55:03 +010039
Sol Boucher67d59982015-05-07 02:39:22 -070040#define IS_TOP_ALIGNED_ADDRESS(x) ((uint32_t)(x) > 0x80000000)
41
Stefan Reinauer2dd161f2015-03-04 00:55:03 +010042#define unused __attribute__((unused))
43
Julius Wernerefcee762014-11-10 13:14:24 -080044static inline uint32_t align_up(uint32_t value, uint32_t align)
45{
46 if (value % align)
47 value += align - (value % align);
48 return value;
49}
50
Hung-Te Lin3cfacbf2013-01-30 00:43:46 +080051/* Buffer and file I/O */
52struct buffer {
53 char *name;
54 char *data;
Sol Boucher64c6cd72015-04-26 02:32:43 -070055 size_t offset;
Hung-Te Lin3cfacbf2013-01-30 00:43:46 +080056 size_t size;
57};
58
Aaron Durbin6e8c2792014-03-04 22:01:12 -060059static inline void *buffer_get(const struct buffer *b)
60{
61 return b->data;
62}
63
64static inline size_t buffer_size(const struct buffer *b)
65{
66 return b->size;
67}
68
Sol Boucher64c6cd72015-04-26 02:32:43 -070069/*
70 * Shrink a buffer toward the beginning of its previous space.
71 * Afterward, buffer_delete() remains the means of cleaning it up. */
Aaron Durbin6e8c2792014-03-04 22:01:12 -060072static inline void buffer_set_size(struct buffer *b, size_t size)
73{
74 b->size = size;
75}
76
Aaron Durbin4f3bb802014-03-26 22:57:55 -050077/* Initialize a buffer with the given constraints. */
78static inline void buffer_init(struct buffer *b, char *name, void *data,
79 size_t size)
80{
81 b->name = name;
82 b->data = data;
83 b->size = size;
Aaron Durbincd9ba8a2015-10-23 17:36:57 -050084 b->offset = 0;
Aaron Durbin4f3bb802014-03-26 22:57:55 -050085}
86
Sol Boucher1a3349f2015-05-05 18:25:18 -070087/* Splice a buffer into another buffer. Note that it's up to the caller to
Sol Boucher64c6cd72015-04-26 02:32:43 -070088 * bounds check the offset and size. The resulting buffer is backed by the same
89 * storage as the original, so although it is valid to buffer_delete() either
90 * one of them, doing so releases both simultaneously. */
Aaron Durbin6e8c2792014-03-04 22:01:12 -060091static inline void buffer_splice(struct buffer *dest, const struct buffer *src,
92 size_t offset, size_t size)
93{
Sol Boucher64c6cd72015-04-26 02:32:43 -070094 dest->name = src->name;
95 dest->data = src->data + offset;
96 dest->offset = src->offset + offset;
97 dest->size = size;
Aaron Durbin6e8c2792014-03-04 22:01:12 -060098}
99
Sol Boucher64c6cd72015-04-26 02:32:43 -0700100/*
101 * Shallow copy a buffer. To clean up the resources, buffer_delete()
102 * either one, but not both. */
Aaron Durbin6e8c2792014-03-04 22:01:12 -0600103static inline void buffer_clone(struct buffer *dest, const struct buffer *src)
104{
Sol Boucher1a3349f2015-05-05 18:25:18 -0700105 buffer_splice(dest, src, 0, src->size);
Aaron Durbin6e8c2792014-03-04 22:01:12 -0600106}
107
Sol Boucher64c6cd72015-04-26 02:32:43 -0700108/*
109 * Shrink a buffer toward the end of its previous space.
110 * Afterward, buffer_delete() remains the means of cleaning it up. */
Aaron Durbin6e8c2792014-03-04 22:01:12 -0600111static inline void buffer_seek(struct buffer *b, size_t size)
112{
Sol Boucher64c6cd72015-04-26 02:32:43 -0700113 b->offset += size;
Aaron Durbin6e8c2792014-03-04 22:01:12 -0600114 b->size -= size;
115 b->data += size;
116}
117
Sol Bouchere3260a02015-03-25 13:40:08 -0700118/* Returns whether the buffer begins with the specified magic bytes. */
119static inline bool buffer_check_magic(const struct buffer *b, const char *magic,
120 size_t magic_len)
121{
122 assert(magic);
123 return b && b->size >= magic_len &&
124 memcmp(b->data, magic, magic_len) == 0;
125}
126
Hung-Te Lin3cfacbf2013-01-30 00:43:46 +0800127/* Creates an empty memory buffer with given size.
128 * Returns 0 on success, otherwise non-zero. */
129int buffer_create(struct buffer *buffer, size_t size, const char *name);
130
131/* Loads a file into memory buffer. Returns 0 on success, otherwise non-zero. */
132int buffer_from_file(struct buffer *buffer, const char *filename);
133
134/* Writes memory buffer content into file.
135 * Returns 0 on success, otherwise non-zero. */
136int buffer_write_file(struct buffer *buffer, const char *filename);
137
138/* Destroys a memory buffer. */
139void buffer_delete(struct buffer *buffer);
140
Stefan Reinauer8f50e532013-11-13 14:34:57 -0800141const char *arch_to_string(uint32_t a);
David Hendricks90ca3b62012-11-16 14:48:22 -0800142uint32_t string_to_arch(const char *arch_string);
Patrick Georgib7b56dd82009-09-14 13:29:27 +0000143
Patrick Georgi61c82292015-08-26 12:53:41 +0200144/* Compress in_len bytes from in, storing the result at out, returning the
145 * resulting length in out_len.
146 * Returns 0 on error,
147 * != 0 otherwise, depending on the compressing function.
148 */
149typedef int (*comp_func_ptr) (char *in, int in_len, char *out, int *out_len);
150
151/* Decompress in_len bytes from in, storing the result at out, up to out_len
152 * bytes.
153 * Returns 0 on error,
154 * != 0 otherwise, depending on the decompressing function.
155 */
156typedef int (*decomp_func_ptr) (char *in, int in_len, char *out, int out_len);
157
Sol Boucher6310ccc2015-05-07 21:12:28 -0700158enum comp_algo { CBFS_COMPRESS_NONE = 0, CBFS_COMPRESS_LZMA = 1 };
Patrick Georgib7b56dd82009-09-14 13:29:27 +0000159
Sol Boucher6310ccc2015-05-07 21:12:28 -0700160comp_func_ptr compression_function(enum comp_algo algo);
Patrick Georgi61c82292015-08-26 12:53:41 +0200161decomp_func_ptr decompression_function(enum comp_algo algo);
Patrick Georgib7b56dd82009-09-14 13:29:27 +0000162
163uint64_t intfiletype(const char *name);
164
Hung-Te Lin05dccae2013-01-28 15:04:30 +0800165/* cbfs-mkpayload.c */
Sol Boucher0e539312015-03-05 15:38:03 -0800166int parse_elf_to_payload(const struct buffer *input, struct buffer *output,
Sol Boucher6310ccc2015-05-07 21:12:28 -0700167 enum comp_algo algo);
168int parse_fv_to_payload(const struct buffer *input, struct buffer *output,
169 enum comp_algo algo);
Patrick Georgide36d332013-08-27 20:22:21 +0200170int parse_bzImage_to_payload(const struct buffer *input,
171 struct buffer *output, const char *initrd,
Sol Boucher6310ccc2015-05-07 21:12:28 -0700172 char *cmdline, enum comp_algo algo);
Hung-Te Linc13e4bf2013-01-29 15:22:11 +0800173int parse_flat_binary_to_payload(const struct buffer *input,
174 struct buffer *output,
175 uint32_t loadaddress,
176 uint32_t entrypoint,
Sol Boucher6310ccc2015-05-07 21:12:28 -0700177 enum comp_algo algo);
Hung-Te Lin05dccae2013-01-28 15:04:30 +0800178/* cbfs-mkstage.c */
Hung-Te Linc13e4bf2013-01-29 15:22:11 +0800179int parse_elf_to_stage(const struct buffer *input, struct buffer *output,
Sol Boucher6310ccc2015-05-07 21:12:28 -0700180 enum comp_algo algo, uint32_t *location,
Furquan Shaikh405304a2014-10-30 11:44:20 -0700181 const char *ignore_section);
Aaron Durbin4be16742015-09-15 17:00:23 -0500182/* location is TOP aligned. */
183int parse_elf_to_xip_stage(const struct buffer *input, struct buffer *output,
184 uint32_t *location, const char *ignore_section);
Patrick Georgib7b56dd82009-09-14 13:29:27 +0000185
Stefan Reinauer07040582010-04-24 21:24:06 +0000186void print_supported_filetypes(void);
187
Ronald G. Minnichaa2f7392013-12-03 11:13:35 -0800188/* lzma/lzma.c */
Gabe Blackdbd006b2014-02-20 23:38:49 -0800189int do_lzma_compress(char *in, int in_len, char *out, int *out_len);
190int do_lzma_uncompress(char *dst, int dst_len, char *src, int src_len);
Stefan Reinauer2dd161f2015-03-04 00:55:03 +0100191
Ronald G. Minnichaa2f7392013-12-03 11:13:35 -0800192/* xdr.c */
193struct xdr {
Aaron Durbin01650042014-03-05 16:38:26 -0600194 uint8_t (*get8)(struct buffer *input);
Ronald G. Minnichaa2f7392013-12-03 11:13:35 -0800195 uint16_t (*get16)(struct buffer *input);
196 uint32_t (*get32)(struct buffer *input);
197 uint64_t (*get64)(struct buffer *input);
Aaron Durbin01650042014-03-05 16:38:26 -0600198 void (*put8)(struct buffer *input, uint8_t val);
Ronald G. Minnichaa2f7392013-12-03 11:13:35 -0800199 void (*put16)(struct buffer *input, uint16_t val);
200 void (*put32)(struct buffer *input, uint32_t val);
201 void (*put64)(struct buffer *input, uint64_t val);
202};
203
Ronald G. Minnichaa2f7392013-12-03 11:13:35 -0800204extern struct xdr xdr_le, xdr_be;
Aaron Durbin1240d292014-03-10 14:13:27 -0500205size_t bgets(struct buffer *input, void *output, size_t len);
206size_t bputs(struct buffer *b, const void *data, size_t len);
Stefan Reinauer63217582012-10-29 16:52:36 -0700207
Patrick Georgica97fa72015-10-01 15:52:56 +0200208/* Returns a 0-terminated string containing a hex representation of
209 * len bytes starting at data.
210 * The string is malloc'd and it's the caller's responsibility to free
211 * the memory.
212 * On error, bintohex returns NULL.
213 */
214char *bintohex(uint8_t *data, size_t len);
Stefan Reinauer63217582012-10-29 16:52:36 -0700215#endif