/* * Copyright (C) 2009 coresystems GmbH * written by Patrick Georgi * Copyright (C) 2012 Google, Inc. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; version 2 of the License. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc. */ #ifndef __CBFSTOOL_COMMON_H #define __CBFSTOOL_COMMON_H #include #include #include #include #include /* Endianess */ #include "swab.h" #ifndef __APPLE__ #define ntohl(x) (is_big_endian() ? (uint32_t)(x) : swab32(x)) #define htonl(x) (is_big_endian() ? (uint32_t)(x) : swab32(x)) #endif #define ntohll(x) (is_big_endian() ? (uint64_t)(x) : swab64(x)) #define htonll(x) (is_big_endian() ? (uint64_t)(x) : swab64(x)) int is_big_endian(void); /* Message output */ extern int verbose; #define ERROR(...) { fprintf(stderr, "E: " __VA_ARGS__); } #define WARN(...) { fprintf(stderr, "W: " __VA_ARGS__); } #define LOG(...) { fprintf(stderr, __VA_ARGS__); } #define INFO(...) { if (verbose > 0) fprintf(stderr, "INFO: " __VA_ARGS__); } #define DEBUG(...) { if (verbose > 1) fprintf(stderr, "DEBUG: " __VA_ARGS__); } /* Helpers */ #define ARRAY_SIZE(a) (int)(sizeof(a) / sizeof((a)[0])) #define ALIGN(val, by) (((val) + (by)-1)&~((by)-1)) #define MAX(x, y) ((x) > (y) ? (x) : (y)) #define MIN(x, y) ((x) < (y) ? (x) : (y)) #define IS_TOP_ALIGNED_ADDRESS(x) ((uint32_t)(x) > 0x80000000) #define unused __attribute__((unused)) static inline uint32_t align_up(uint32_t value, uint32_t align) { if (value % align) value += align - (value % align); return value; } /* Buffer and file I/O */ struct buffer { char *name; char *data; size_t offset; size_t size; }; static inline void *buffer_get(const struct buffer *b) { return b->data; } static inline size_t buffer_size(const struct buffer *b) { return b->size; } /* * Shrink a buffer toward the beginning of its previous space. * Afterward, buffer_delete() remains the means of cleaning it up. */ static inline void buffer_set_size(struct buffer *b, size_t size) { b->size = size; } /* Initialize a buffer with the given constraints. */ static inline void buffer_init(struct buffer *b, char *name, void *data, size_t size) { b->name = name; b->data = data; b->size = size; } /* Splice a buffer into another buffer. Note that it's up to the caller to * bounds check the offset and size. The resulting buffer is backed by the same * storage as the original, so although it is valid to buffer_delete() either * one of them, doing so releases both simultaneously. */ static inline void buffer_splice(struct buffer *dest, const struct buffer *src, size_t offset, size_t size) { dest->name = src->name; dest->data = src->data + offset; dest->offset = src->offset + offset; dest->size = size; } /* * Shallow copy a buffer. To clean up the resources, buffer_delete() * either one, but not both. */ static inline void buffer_clone(struct buffer *dest, const struct buffer *src) { buffer_splice(dest, src, 0, src->size); } /* * Shrink a buffer toward the end of its previous space. * Afterward, buffer_delete() remains the means of cleaning it up. */ static inline void buffer_seek(struct buffer *b, size_t size) { b->offset += size; b->size -= size; b->data += size; } /* Returns whether the buffer begins with the specified magic bytes. */ static inline bool buffer_check_magic(const struct buffer *b, const char *magic, size_t magic_len) { assert(magic); return b && b->size >= magic_len && memcmp(b->data, magic, magic_len) == 0; } /* Creates an empty memory buffer with given size. * Returns 0 on success, otherwise non-zero. */ int buffer_create(struct buffer *buffer, size_t size, const char *name); /* Loads a file into memory buffer. Returns 0 on success, otherwise non-zero. */ int buffer_from_file(struct buffer *buffer, const char *filename); /* Writes memory buffer content into file. * Returns 0 on success, otherwise non-zero. */ int buffer_write_file(struct buffer *buffer, const char *filename); /* Destroys a memory buffer. */ void buffer_delete(struct buffer *buffer); const char *arch_to_string(uint32_t a); uint32_t string_to_arch(const char *arch_string); typedef int (*comp_func_ptr) (char *, int, char *, int *); enum comp_algo { CBFS_COMPRESS_NONE = 0, CBFS_COMPRESS_LZMA = 1 }; comp_func_ptr compression_function(enum comp_algo algo); uint64_t intfiletype(const char *name); /* cbfs-mkpayload.c */ int parse_elf_to_payload(const struct buffer *input, struct buffer *output, enum comp_algo algo); int parse_fv_to_payload(const struct buffer *input, struct buffer *output, enum comp_algo algo); int parse_bzImage_to_payload(const struct buffer *input, struct buffer *output, const char *initrd, char *cmdline, enum comp_algo algo); int parse_flat_binary_to_payload(const struct buffer *input, struct buffer *output, uint32_t loadaddress, uint32_t entrypoint, enum comp_algo algo); /* cbfs-mkstage.c */ int parse_elf_to_stage(const struct buffer *input, struct buffer *output, enum comp_algo algo, uint32_t *location, const char *ignore_section); void print_supported_filetypes(void); /* lzma/lzma.c */ int do_lzma_compress(char *in, int in_len, char *out, int *out_len); int do_lzma_uncompress(char *dst, int dst_len, char *src, int src_len); /* xdr.c */ struct xdr { uint8_t (*get8)(struct buffer *input); uint16_t (*get16)(struct buffer *input); uint32_t (*get32)(struct buffer *input); uint64_t (*get64)(struct buffer *input); void (*put8)(struct buffer *input, uint8_t val); void (*put16)(struct buffer *input, uint16_t val); void (*put32)(struct buffer *input, uint32_t val); void (*put64)(struct buffer *input, uint64_t val); }; extern struct xdr xdr_le, xdr_be; size_t bgets(struct buffer *input, void *output, size_t len); size_t bputs(struct buffer *b, const void *data, size_t len); #endif