2013-10-25 08:08:21 +00:00
|
|
|
/*
|
2016-06-16 13:52:04 +00:00
|
|
|
* Copyright (c) 2013-2016, ARM Limited and Contributors. All rights reserved.
|
2013-10-25 08:08:21 +00:00
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* Redistributions of source code must retain the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* Neither the name of ARM nor the names of its contributors may be used
|
|
|
|
* to endorse or promote products derived from this software without specific
|
|
|
|
* prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2014-04-09 12:14:54 +00:00
|
|
|
#include <arch.h>
|
2013-10-25 08:08:21 +00:00
|
|
|
#include <arch_helpers.h>
|
2014-04-09 12:14:54 +00:00
|
|
|
#include <assert.h>
|
2015-05-19 10:54:12 +00:00
|
|
|
#include <auth_mod.h>
|
2013-10-25 08:08:21 +00:00
|
|
|
#include <bl_common.h>
|
2014-04-09 12:13:04 +00:00
|
|
|
#include <debug.h>
|
2014-06-24 13:02:34 +00:00
|
|
|
#include <errno.h>
|
2014-04-09 12:14:54 +00:00
|
|
|
#include <io_storage.h>
|
|
|
|
#include <platform.h>
|
2015-08-17 09:43:27 +00:00
|
|
|
#include <string.h>
|
2016-03-22 15:51:08 +00:00
|
|
|
#include <xlat_tables.h>
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2016-06-16 13:52:04 +00:00
|
|
|
uintptr_t page_align(uintptr_t value, unsigned dir)
|
2013-10-25 08:08:21 +00:00
|
|
|
{
|
|
|
|
/* Round up the limit to the next page boundary */
|
2016-06-16 13:52:04 +00:00
|
|
|
if (value & (PAGE_SIZE - 1)) {
|
|
|
|
value &= ~(PAGE_SIZE - 1);
|
2013-10-25 08:08:21 +00:00
|
|
|
if (dir == UP)
|
2016-06-16 13:52:04 +00:00
|
|
|
value += PAGE_SIZE;
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
2016-06-16 13:52:04 +00:00
|
|
|
static inline unsigned int is_page_aligned (uintptr_t addr) {
|
|
|
|
return (addr & (PAGE_SIZE - 1)) == 0;
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
/******************************************************************************
|
|
|
|
* Determine whether the memory region delimited by 'addr' and 'size' is free,
|
|
|
|
* given the extents of free memory.
|
|
|
|
* Return 1 if it is free, 0 otherwise.
|
|
|
|
*****************************************************************************/
|
2016-06-16 13:52:04 +00:00
|
|
|
static int is_mem_free(uintptr_t free_base, size_t free_size,
|
|
|
|
uintptr_t addr, size_t size)
|
2014-06-24 13:02:34 +00:00
|
|
|
{
|
|
|
|
return (addr >= free_base) && (addr + size <= free_base + free_size);
|
|
|
|
}
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
/******************************************************************************
|
|
|
|
* Inside a given memory region, determine whether a sub-region of memory is
|
|
|
|
* closer from the top or the bottom of the encompassing region. Return the
|
|
|
|
* size of the smallest chunk of free memory surrounding the sub-region in
|
|
|
|
* 'small_chunk_size'.
|
|
|
|
*****************************************************************************/
|
2016-06-16 13:52:04 +00:00
|
|
|
static unsigned int choose_mem_pos(uintptr_t mem_start, uintptr_t mem_end,
|
|
|
|
uintptr_t submem_start, uintptr_t submem_end,
|
|
|
|
size_t *small_chunk_size)
|
2013-10-25 08:08:21 +00:00
|
|
|
{
|
2014-06-24 13:02:34 +00:00
|
|
|
size_t top_chunk_size, bottom_chunk_size;
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
assert(mem_start <= submem_start);
|
|
|
|
assert(submem_start <= submem_end);
|
|
|
|
assert(submem_end <= mem_end);
|
|
|
|
assert(small_chunk_size != NULL);
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
top_chunk_size = mem_end - submem_end;
|
|
|
|
bottom_chunk_size = submem_start - mem_start;
|
|
|
|
|
|
|
|
if (top_chunk_size < bottom_chunk_size) {
|
|
|
|
*small_chunk_size = top_chunk_size;
|
|
|
|
return TOP;
|
2013-10-25 08:08:21 +00:00
|
|
|
} else {
|
2014-06-24 13:02:34 +00:00
|
|
|
*small_chunk_size = bottom_chunk_size;
|
|
|
|
return BOTTOM;
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
2014-06-24 13:02:34 +00:00
|
|
|
}
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
/******************************************************************************
|
|
|
|
* Reserve the memory region delimited by 'addr' and 'size'. The extents of free
|
|
|
|
* memory are passed in 'free_base' and 'free_size' and they will be updated to
|
|
|
|
* reflect the memory usage.
|
|
|
|
* The caller must ensure the memory to reserve is free.
|
|
|
|
*****************************************************************************/
|
2016-06-16 13:52:04 +00:00
|
|
|
void reserve_mem(uintptr_t *free_base, size_t *free_size,
|
|
|
|
uintptr_t addr, size_t size)
|
2014-06-24 13:02:34 +00:00
|
|
|
{
|
|
|
|
size_t discard_size;
|
|
|
|
size_t reserved_size;
|
|
|
|
unsigned int pos;
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
assert(free_base != NULL);
|
|
|
|
assert(free_size != NULL);
|
|
|
|
assert(is_mem_free(*free_base, *free_size, addr, size));
|
|
|
|
|
|
|
|
pos = choose_mem_pos(*free_base, *free_base + *free_size,
|
|
|
|
addr, addr + size,
|
|
|
|
&discard_size);
|
|
|
|
|
|
|
|
reserved_size = size + discard_size;
|
|
|
|
*free_size -= reserved_size;
|
|
|
|
|
|
|
|
if (pos == BOTTOM)
|
|
|
|
*free_base = addr + size;
|
|
|
|
|
2016-06-16 13:52:04 +00:00
|
|
|
VERBOSE("Reserved 0x%zx bytes (discarded 0x%zx bytes %s)\n",
|
2014-06-24 13:02:34 +00:00
|
|
|
reserved_size, discard_size,
|
|
|
|
pos == TOP ? "above" : "below");
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
|
|
|
|
2016-06-16 13:52:04 +00:00
|
|
|
static void dump_load_info(uintptr_t image_load_addr,
|
|
|
|
size_t image_size,
|
2014-04-10 14:37:22 +00:00
|
|
|
const meminfo_t *mem_layout)
|
2013-10-25 08:08:21 +00:00
|
|
|
{
|
2016-06-16 13:52:04 +00:00
|
|
|
INFO("Trying to load image at address %p, size = 0x%zx\n",
|
|
|
|
(void *)image_load_addr, image_size);
|
2014-07-29 16:14:00 +00:00
|
|
|
INFO("Current memory layout:\n");
|
2016-06-16 13:52:04 +00:00
|
|
|
INFO(" total region = [%p, %p]\n", (void *)mem_layout->total_base,
|
|
|
|
(void *)(mem_layout->total_base + mem_layout->total_size));
|
|
|
|
INFO(" free region = [%p, %p]\n", (void *)mem_layout->free_base,
|
|
|
|
(void *)(mem_layout->free_base + mem_layout->free_size));
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
|
|
|
|
2014-02-04 11:43:57 +00:00
|
|
|
/* Generic function to return the size of an image */
|
2016-06-16 13:52:04 +00:00
|
|
|
size_t image_size(unsigned int image_id)
|
2014-02-04 11:43:57 +00:00
|
|
|
{
|
2014-04-23 12:47:06 +00:00
|
|
|
uintptr_t dev_handle;
|
|
|
|
uintptr_t image_handle;
|
|
|
|
uintptr_t image_spec;
|
2014-02-04 11:43:57 +00:00
|
|
|
size_t image_size = 0;
|
2015-11-02 10:47:01 +00:00
|
|
|
int io_result;
|
2014-02-04 11:43:57 +00:00
|
|
|
|
|
|
|
/* Obtain a reference to the image by querying the platform layer */
|
2015-04-13 16:36:19 +00:00
|
|
|
io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
|
2015-11-02 10:47:01 +00:00
|
|
|
if (io_result != 0) {
|
2015-04-13 16:36:19 +00:00
|
|
|
WARN("Failed to obtain reference to image id=%u (%i)\n",
|
|
|
|
image_id, io_result);
|
2014-02-04 11:43:57 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Attempt to access the image */
|
|
|
|
io_result = io_open(dev_handle, image_spec, &image_handle);
|
2015-11-02 10:47:01 +00:00
|
|
|
if (io_result != 0) {
|
2015-04-13 16:36:19 +00:00
|
|
|
WARN("Failed to access image id=%u (%i)\n",
|
|
|
|
image_id, io_result);
|
2014-02-04 11:43:57 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Find the size of the image */
|
|
|
|
io_result = io_size(image_handle, &image_size);
|
2015-11-02 10:47:01 +00:00
|
|
|
if ((io_result != 0) || (image_size == 0)) {
|
2015-04-13 16:36:19 +00:00
|
|
|
WARN("Failed to determine the size of the image id=%u (%i)\n",
|
|
|
|
image_id, io_result);
|
2014-02-04 11:43:57 +00:00
|
|
|
}
|
|
|
|
io_result = io_close(image_handle);
|
|
|
|
/* Ignore improbable/unrecoverable error in 'close' */
|
|
|
|
|
|
|
|
/* TODO: Consider maintaining open device connection from this
|
|
|
|
* bootloader stage
|
|
|
|
*/
|
|
|
|
io_result = io_dev_close(dev_handle);
|
|
|
|
/* Ignore improbable/unrecoverable error in 'dev_close' */
|
|
|
|
|
|
|
|
return image_size;
|
|
|
|
}
|
2014-06-24 13:02:34 +00:00
|
|
|
|
2013-10-25 08:08:21 +00:00
|
|
|
/*******************************************************************************
|
2016-05-27 13:08:10 +00:00
|
|
|
* Generic function to load an image at a specific address given an image ID and
|
|
|
|
* extents of free memory.
|
|
|
|
*
|
|
|
|
* If the load is successful then the image information is updated.
|
|
|
|
*
|
|
|
|
* If the entry_point_info argument is not NULL then this function also updates:
|
|
|
|
* - the memory layout to mark the memory as reserved;
|
|
|
|
* - the entry point information.
|
|
|
|
*
|
|
|
|
* The caller might pass a NULL pointer for the entry point if they are not
|
|
|
|
* interested in this information. This is typically the case for non-executable
|
|
|
|
* images (e.g. certificates) and executable images that won't ever be executed
|
|
|
|
* on the application processor (e.g. additional microcontroller firmware).
|
|
|
|
*
|
2014-06-24 13:02:34 +00:00
|
|
|
* Returns 0 on success, a negative error code otherwise.
|
2013-10-25 08:08:21 +00:00
|
|
|
******************************************************************************/
|
2014-04-15 17:08:08 +00:00
|
|
|
int load_image(meminfo_t *mem_layout,
|
2015-04-13 16:36:19 +00:00
|
|
|
unsigned int image_id,
|
2015-05-19 10:54:12 +00:00
|
|
|
uintptr_t image_base,
|
2014-06-24 13:02:34 +00:00
|
|
|
image_info_t *image_data,
|
|
|
|
entry_point_info_t *entry_point_info)
|
2013-10-25 08:08:21 +00:00
|
|
|
{
|
2014-04-23 12:47:06 +00:00
|
|
|
uintptr_t dev_handle;
|
|
|
|
uintptr_t image_handle;
|
|
|
|
uintptr_t image_spec;
|
2014-06-24 13:02:34 +00:00
|
|
|
size_t image_size;
|
|
|
|
size_t bytes_read;
|
2015-10-01 17:37:40 +00:00
|
|
|
int io_result;
|
2014-02-10 17:04:32 +00:00
|
|
|
|
|
|
|
assert(mem_layout != NULL);
|
2014-06-24 13:02:34 +00:00
|
|
|
assert(image_data != NULL);
|
2014-04-15 17:08:08 +00:00
|
|
|
assert(image_data->h.version >= VERSION_1);
|
2014-02-10 17:04:32 +00:00
|
|
|
|
|
|
|
/* Obtain a reference to the image by querying the platform layer */
|
2015-04-13 16:36:19 +00:00
|
|
|
io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
|
2015-10-01 17:37:40 +00:00
|
|
|
if (io_result != 0) {
|
2015-04-13 16:36:19 +00:00
|
|
|
WARN("Failed to obtain reference to image id=%u (%i)\n",
|
|
|
|
image_id, io_result);
|
2014-04-15 17:08:08 +00:00
|
|
|
return io_result;
|
2014-02-10 17:04:32 +00:00
|
|
|
}
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2014-02-10 17:04:32 +00:00
|
|
|
/* Attempt to access the image */
|
|
|
|
io_result = io_open(dev_handle, image_spec, &image_handle);
|
2015-10-01 17:37:40 +00:00
|
|
|
if (io_result != 0) {
|
2015-04-13 16:36:19 +00:00
|
|
|
WARN("Failed to access image id=%u (%i)\n",
|
|
|
|
image_id, io_result);
|
2014-04-15 17:08:08 +00:00
|
|
|
return io_result;
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
|
|
|
|
2016-02-02 12:03:38 +00:00
|
|
|
INFO("Loading image id=%u at address %p\n", image_id,
|
|
|
|
(void *) image_base);
|
2014-06-24 13:02:34 +00:00
|
|
|
|
2014-02-10 17:04:32 +00:00
|
|
|
/* Find the size of the image */
|
|
|
|
io_result = io_size(image_handle, &image_size);
|
2015-10-01 17:37:40 +00:00
|
|
|
if ((io_result != 0) || (image_size == 0)) {
|
2015-04-13 16:36:19 +00:00
|
|
|
WARN("Failed to determine the size of the image id=%u (%i)\n",
|
|
|
|
image_id, io_result);
|
2014-04-15 17:08:08 +00:00
|
|
|
goto exit;
|
2014-02-10 17:04:32 +00:00
|
|
|
}
|
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
/* Check that the memory where the image will be loaded is free */
|
|
|
|
if (!is_mem_free(mem_layout->free_base, mem_layout->free_size,
|
|
|
|
image_base, image_size)) {
|
2016-02-02 12:03:38 +00:00
|
|
|
WARN("Failed to reserve memory: %p - %p\n", (void *) image_base,
|
|
|
|
(void *) (image_base + image_size));
|
2014-04-15 17:08:08 +00:00
|
|
|
dump_load_info(image_base, image_size, mem_layout);
|
|
|
|
io_result = -ENOMEM;
|
|
|
|
goto exit;
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* We have enough space so load the image now */
|
2014-02-10 17:04:32 +00:00
|
|
|
/* TODO: Consider whether to try to recover/retry a partially successful read */
|
2014-04-23 12:47:06 +00:00
|
|
|
io_result = io_read(image_handle, image_base, image_size, &bytes_read);
|
2015-10-01 17:37:40 +00:00
|
|
|
if ((io_result != 0) || (bytes_read < image_size)) {
|
2015-04-13 16:36:19 +00:00
|
|
|
WARN("Failed to load image id=%u (%i)\n", image_id, io_result);
|
2014-04-15 17:08:08 +00:00
|
|
|
goto exit;
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
|
|
|
|
2016-05-27 13:08:10 +00:00
|
|
|
image_data->image_base = image_base;
|
|
|
|
image_data->image_size = image_size;
|
|
|
|
|
2014-06-24 13:02:34 +00:00
|
|
|
/*
|
|
|
|
* Update the memory usage info.
|
|
|
|
* This is done after the actual loading so that it is not updated when
|
|
|
|
* the load is unsuccessful.
|
2015-01-19 16:51:21 +00:00
|
|
|
* If the caller does not provide an entry point, bypass the memory
|
|
|
|
* reservation.
|
2014-06-24 13:02:34 +00:00
|
|
|
*/
|
2015-01-19 16:51:21 +00:00
|
|
|
if (entry_point_info != NULL) {
|
|
|
|
reserve_mem(&mem_layout->free_base, &mem_layout->free_size,
|
|
|
|
image_base, image_size);
|
2016-05-27 13:08:10 +00:00
|
|
|
entry_point_info->pc = image_base;
|
2015-01-19 16:51:21 +00:00
|
|
|
} else {
|
2016-02-02 12:03:38 +00:00
|
|
|
INFO("Skip reserving memory: %p - %p\n", (void *) image_base,
|
|
|
|
(void *) (image_base + image_size));
|
2015-01-19 16:51:21 +00:00
|
|
|
}
|
2014-06-24 13:02:34 +00:00
|
|
|
|
2013-10-25 08:08:21 +00:00
|
|
|
/*
|
2014-06-24 13:02:34 +00:00
|
|
|
* File has been successfully loaded.
|
2016-05-27 13:08:10 +00:00
|
|
|
* Flush the image in Trusted SRAM so that the next exception level can
|
|
|
|
* see it.
|
2013-10-25 08:08:21 +00:00
|
|
|
*/
|
2014-02-10 17:04:32 +00:00
|
|
|
flush_dcache_range(image_base, image_size);
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2016-02-02 12:03:38 +00:00
|
|
|
INFO("Image id=%u loaded: %p - %p\n", image_id, (void *) image_base,
|
|
|
|
(void *) (image_base + image_size));
|
2014-02-10 17:04:32 +00:00
|
|
|
|
|
|
|
exit:
|
2014-04-15 17:08:08 +00:00
|
|
|
io_close(image_handle);
|
2014-02-10 17:04:32 +00:00
|
|
|
/* Ignore improbable/unrecoverable error in 'close' */
|
|
|
|
|
|
|
|
/* TODO: Consider maintaining open device connection from this bootloader stage */
|
2014-04-15 17:08:08 +00:00
|
|
|
io_dev_close(dev_handle);
|
2014-02-10 17:04:32 +00:00
|
|
|
/* Ignore improbable/unrecoverable error in 'dev_close' */
|
2013-10-25 08:08:21 +00:00
|
|
|
|
2014-04-15 17:08:08 +00:00
|
|
|
return io_result;
|
2013-10-25 08:08:21 +00:00
|
|
|
}
|
2015-05-19 10:54:12 +00:00
|
|
|
|
|
|
|
/*******************************************************************************
|
|
|
|
* Generic function to load and authenticate an image. The image is actually
|
|
|
|
* loaded by calling the 'load_image()' function. In addition, this function
|
|
|
|
* uses recursion to authenticate the parent images up to the root of trust.
|
|
|
|
******************************************************************************/
|
|
|
|
int load_auth_image(meminfo_t *mem_layout,
|
|
|
|
unsigned int image_id,
|
|
|
|
uintptr_t image_base,
|
|
|
|
image_info_t *image_data,
|
|
|
|
entry_point_info_t *entry_point_info)
|
|
|
|
{
|
|
|
|
int rc;
|
|
|
|
|
|
|
|
#if TRUSTED_BOARD_BOOT
|
|
|
|
unsigned int parent_id;
|
|
|
|
|
|
|
|
/* Use recursion to authenticate parent images */
|
|
|
|
rc = auth_mod_get_parent_id(image_id, &parent_id);
|
|
|
|
if (rc == 0) {
|
|
|
|
rc = load_auth_image(mem_layout, parent_id, image_base,
|
|
|
|
image_data, NULL);
|
2015-10-01 17:37:40 +00:00
|
|
|
if (rc != 0) {
|
2015-05-19 10:54:12 +00:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* TRUSTED_BOARD_BOOT */
|
|
|
|
|
|
|
|
/* Load the image */
|
|
|
|
rc = load_image(mem_layout, image_id, image_base, image_data,
|
|
|
|
entry_point_info);
|
2015-10-01 17:37:40 +00:00
|
|
|
if (rc != 0) {
|
|
|
|
return rc;
|
2015-05-19 10:54:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#if TRUSTED_BOARD_BOOT
|
|
|
|
/* Authenticate it */
|
|
|
|
rc = auth_mod_verify_img(image_id,
|
|
|
|
(void *)image_data->image_base,
|
|
|
|
image_data->image_size);
|
|
|
|
if (rc != 0) {
|
2015-08-17 09:43:27 +00:00
|
|
|
memset((void *)image_data->image_base, 0x00,
|
|
|
|
image_data->image_size);
|
|
|
|
flush_dcache_range(image_data->image_base,
|
|
|
|
image_data->image_size);
|
2015-10-01 17:37:40 +00:00
|
|
|
return -EAUTH;
|
2015-05-19 10:54:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* After working with data, invalidate the data cache */
|
|
|
|
inv_dcache_range(image_data->image_base,
|
|
|
|
(size_t)image_data->image_size);
|
|
|
|
#endif /* TRUSTED_BOARD_BOOT */
|
|
|
|
|
2015-10-01 17:37:40 +00:00
|
|
|
return 0;
|
2015-05-19 10:54:12 +00:00
|
|
|
}
|
2015-09-28 16:03:06 +00:00
|
|
|
|
|
|
|
/*******************************************************************************
|
|
|
|
* Print the content of an entry_point_info_t structure.
|
|
|
|
******************************************************************************/
|
|
|
|
void print_entry_point_info(const entry_point_info_t *ep_info)
|
|
|
|
{
|
2016-06-16 13:52:04 +00:00
|
|
|
INFO("Entry point address = %p\n", (void *)ep_info->pc);
|
|
|
|
INFO("SPSR = 0x%x\n", ep_info->spsr);
|
2015-09-28 16:03:06 +00:00
|
|
|
|
|
|
|
#define PRINT_IMAGE_ARG(n) \
|
|
|
|
VERBOSE("Argument #" #n " = 0x%llx\n", \
|
|
|
|
(unsigned long long) ep_info->args.arg##n)
|
|
|
|
|
|
|
|
PRINT_IMAGE_ARG(0);
|
|
|
|
PRINT_IMAGE_ARG(1);
|
|
|
|
PRINT_IMAGE_ARG(2);
|
|
|
|
PRINT_IMAGE_ARG(3);
|
|
|
|
PRINT_IMAGE_ARG(4);
|
|
|
|
PRINT_IMAGE_ARG(5);
|
|
|
|
PRINT_IMAGE_ARG(6);
|
|
|
|
PRINT_IMAGE_ARG(7);
|
|
|
|
#undef PRINT_IMAGE_ARG
|
|
|
|
}
|