blob: 7cafe635b63f92081d396aa1912b11ba563b8b9a [file] [log] [blame]
Achin Gupta4f6ad662013-10-25 09:08:21 +01001/*
Dan Handleyeb839ce2015-03-23 18:13:33 +00002 * Copyright (c) 2013-2015, ARM Limited and Contributors. All rights reserved.
Achin Gupta4f6ad662013-10-25 09:08:21 +01003 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
6 *
7 * Redistributions of source code must retain the above copyright notice, this
8 * list of conditions and the following disclaimer.
9 *
10 * Redistributions in binary form must reproduce the above copyright notice,
11 * this list of conditions and the following disclaimer in the documentation
12 * and/or other materials provided with the distribution.
13 *
14 * Neither the name of ARM nor the names of its contributors may be used
15 * to endorse or promote products derived from this software without specific
16 * prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
29 */
30
Dan Handley2bd4ef22014-04-09 13:14:54 +010031#include <arch.h>
Achin Gupta4f6ad662013-10-25 09:08:21 +010032#include <arch_helpers.h>
Dan Handley2bd4ef22014-04-09 13:14:54 +010033#include <assert.h>
Juan Castilloa08a5e72015-05-19 11:54:12 +010034#include <auth_mod.h>
Achin Gupta4f6ad662013-10-25 09:08:21 +010035#include <bl_common.h>
Dan Handley714a0d22014-04-09 13:13:04 +010036#include <debug.h>
Sandrine Bailleux467d0572014-06-24 14:02:34 +010037#include <errno.h>
Dan Handley2bd4ef22014-04-09 13:14:54 +010038#include <io_storage.h>
39#include <platform.h>
Juan Castillo97dbcf12015-08-17 10:43:27 +010040#include <string.h>
Soby Mathew44170c42016-03-22 15:51:08 +000041#include <xlat_tables.h>
Achin Gupta4f6ad662013-10-25 09:08:21 +010042
Achin Gupta4f6ad662013-10-25 09:08:21 +010043unsigned long page_align(unsigned long value, unsigned dir)
44{
45 unsigned long page_size = 1 << FOUR_KB_SHIFT;
46
47 /* Round up the limit to the next page boundary */
48 if (value & (page_size - 1)) {
49 value &= ~(page_size - 1);
50 if (dir == UP)
51 value += page_size;
52 }
53
54 return value;
55}
56
57static inline unsigned int is_page_aligned (unsigned long addr) {
58 const unsigned long page_size = 1 << FOUR_KB_SHIFT;
59
60 return (addr & (page_size - 1)) == 0;
61}
62
Sandrine Bailleux467d0572014-06-24 14:02:34 +010063/******************************************************************************
64 * Determine whether the memory region delimited by 'addr' and 'size' is free,
65 * given the extents of free memory.
66 * Return 1 if it is free, 0 otherwise.
67 *****************************************************************************/
68static int is_mem_free(uint64_t free_base, size_t free_size,
69 uint64_t addr, size_t size)
70{
71 return (addr >= free_base) && (addr + size <= free_base + free_size);
72}
Achin Gupta4f6ad662013-10-25 09:08:21 +010073
Sandrine Bailleux467d0572014-06-24 14:02:34 +010074/******************************************************************************
75 * Inside a given memory region, determine whether a sub-region of memory is
76 * closer from the top or the bottom of the encompassing region. Return the
77 * size of the smallest chunk of free memory surrounding the sub-region in
78 * 'small_chunk_size'.
79 *****************************************************************************/
80static unsigned int choose_mem_pos(uint64_t mem_start, uint64_t mem_end,
81 uint64_t submem_start, uint64_t submem_end,
82 size_t *small_chunk_size)
Achin Gupta4f6ad662013-10-25 09:08:21 +010083{
Sandrine Bailleux467d0572014-06-24 14:02:34 +010084 size_t top_chunk_size, bottom_chunk_size;
85
86 assert(mem_start <= submem_start);
87 assert(submem_start <= submem_end);
88 assert(submem_end <= mem_end);
89 assert(small_chunk_size != NULL);
Achin Gupta4f6ad662013-10-25 09:08:21 +010090
Sandrine Bailleux467d0572014-06-24 14:02:34 +010091 top_chunk_size = mem_end - submem_end;
92 bottom_chunk_size = submem_start - mem_start;
Achin Gupta4f6ad662013-10-25 09:08:21 +010093
Sandrine Bailleux467d0572014-06-24 14:02:34 +010094 if (top_chunk_size < bottom_chunk_size) {
95 *small_chunk_size = top_chunk_size;
96 return TOP;
Achin Gupta4f6ad662013-10-25 09:08:21 +010097 } else {
Sandrine Bailleux467d0572014-06-24 14:02:34 +010098 *small_chunk_size = bottom_chunk_size;
99 return BOTTOM;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100100 }
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100101}
102
103/******************************************************************************
104 * Reserve the memory region delimited by 'addr' and 'size'. The extents of free
105 * memory are passed in 'free_base' and 'free_size' and they will be updated to
106 * reflect the memory usage.
107 * The caller must ensure the memory to reserve is free.
108 *****************************************************************************/
109void reserve_mem(uint64_t *free_base, size_t *free_size,
110 uint64_t addr, size_t size)
111{
112 size_t discard_size;
113 size_t reserved_size;
114 unsigned int pos;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100115
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100116 assert(free_base != NULL);
117 assert(free_size != NULL);
118 assert(is_mem_free(*free_base, *free_size, addr, size));
Achin Gupta4f6ad662013-10-25 09:08:21 +0100119
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100120 pos = choose_mem_pos(*free_base, *free_base + *free_size,
121 addr, addr + size,
122 &discard_size);
123
124 reserved_size = size + discard_size;
125 *free_size -= reserved_size;
126
127 if (pos == BOTTOM)
128 *free_base = addr + size;
129
Dan Handleyeb839ce2015-03-23 18:13:33 +0000130 VERBOSE("Reserved 0x%lx bytes (discarded 0x%lx bytes %s)\n",
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100131 reserved_size, discard_size,
132 pos == TOP ? "above" : "below");
Achin Gupta4f6ad662013-10-25 09:08:21 +0100133}
134
135static void dump_load_info(unsigned long image_load_addr,
136 unsigned long image_size,
Dan Handleye2712bc2014-04-10 15:37:22 +0100137 const meminfo_t *mem_layout)
Achin Gupta4f6ad662013-10-25 09:08:21 +0100138{
Dan Handley91b624e2014-07-29 17:14:00 +0100139 INFO("Trying to load image at address 0x%lx, size = 0x%lx\n",
Achin Gupta4f6ad662013-10-25 09:08:21 +0100140 image_load_addr, image_size);
Dan Handley91b624e2014-07-29 17:14:00 +0100141 INFO("Current memory layout:\n");
142 INFO(" total region = [0x%lx, 0x%lx]\n", mem_layout->total_base,
Achin Gupta4f6ad662013-10-25 09:08:21 +0100143 mem_layout->total_base + mem_layout->total_size);
Dan Handley91b624e2014-07-29 17:14:00 +0100144 INFO(" free region = [0x%lx, 0x%lx]\n", mem_layout->free_base,
Achin Gupta4f6ad662013-10-25 09:08:21 +0100145 mem_layout->free_base + mem_layout->free_size);
Achin Gupta4f6ad662013-10-25 09:08:21 +0100146}
147
Ryan Harkin87274c42014-02-04 11:43:57 +0000148/* Generic function to return the size of an image */
Juan Castillo3a66aca2015-04-13 17:36:19 +0100149unsigned long image_size(unsigned int image_id)
Ryan Harkin87274c42014-02-04 11:43:57 +0000150{
Dan Handleya4cb68e2014-04-23 13:47:06 +0100151 uintptr_t dev_handle;
152 uintptr_t image_handle;
153 uintptr_t image_spec;
Ryan Harkin87274c42014-02-04 11:43:57 +0000154 size_t image_size = 0;
Juan Castillo6e762062015-11-02 10:47:01 +0000155 int io_result;
Ryan Harkin87274c42014-02-04 11:43:57 +0000156
Ryan Harkin87274c42014-02-04 11:43:57 +0000157 /* Obtain a reference to the image by querying the platform layer */
Juan Castillo3a66aca2015-04-13 17:36:19 +0100158 io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
Juan Castillo6e762062015-11-02 10:47:01 +0000159 if (io_result != 0) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100160 WARN("Failed to obtain reference to image id=%u (%i)\n",
161 image_id, io_result);
Ryan Harkin87274c42014-02-04 11:43:57 +0000162 return 0;
163 }
164
165 /* Attempt to access the image */
166 io_result = io_open(dev_handle, image_spec, &image_handle);
Juan Castillo6e762062015-11-02 10:47:01 +0000167 if (io_result != 0) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100168 WARN("Failed to access image id=%u (%i)\n",
169 image_id, io_result);
Ryan Harkin87274c42014-02-04 11:43:57 +0000170 return 0;
171 }
172
173 /* Find the size of the image */
174 io_result = io_size(image_handle, &image_size);
Juan Castillo6e762062015-11-02 10:47:01 +0000175 if ((io_result != 0) || (image_size == 0)) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100176 WARN("Failed to determine the size of the image id=%u (%i)\n",
177 image_id, io_result);
Ryan Harkin87274c42014-02-04 11:43:57 +0000178 }
179 io_result = io_close(image_handle);
180 /* Ignore improbable/unrecoverable error in 'close' */
181
182 /* TODO: Consider maintaining open device connection from this
183 * bootloader stage
184 */
185 io_result = io_dev_close(dev_handle);
186 /* Ignore improbable/unrecoverable error in 'dev_close' */
187
188 return image_size;
189}
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100190
Achin Gupta4f6ad662013-10-25 09:08:21 +0100191/*******************************************************************************
Sandrine Bailleux8eaf46e2016-05-27 14:08:10 +0100192 * Generic function to load an image at a specific address given an image ID and
193 * extents of free memory.
194 *
195 * If the load is successful then the image information is updated.
196 *
197 * If the entry_point_info argument is not NULL then this function also updates:
198 * - the memory layout to mark the memory as reserved;
199 * - the entry point information.
200 *
201 * The caller might pass a NULL pointer for the entry point if they are not
202 * interested in this information. This is typically the case for non-executable
203 * images (e.g. certificates) and executable images that won't ever be executed
204 * on the application processor (e.g. additional microcontroller firmware).
205 *
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100206 * Returns 0 on success, a negative error code otherwise.
Achin Gupta4f6ad662013-10-25 09:08:21 +0100207 ******************************************************************************/
Vikram Kanigirida567432014-04-15 18:08:08 +0100208int load_image(meminfo_t *mem_layout,
Juan Castillo3a66aca2015-04-13 17:36:19 +0100209 unsigned int image_id,
Juan Castilloa08a5e72015-05-19 11:54:12 +0100210 uintptr_t image_base,
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100211 image_info_t *image_data,
212 entry_point_info_t *entry_point_info)
Achin Gupta4f6ad662013-10-25 09:08:21 +0100213{
Dan Handleya4cb68e2014-04-23 13:47:06 +0100214 uintptr_t dev_handle;
215 uintptr_t image_handle;
216 uintptr_t image_spec;
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100217 size_t image_size;
218 size_t bytes_read;
Juan Castilloec813f52015-10-01 18:37:40 +0100219 int io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100220
James Morrissey9d72b4e2014-02-10 17:04:32 +0000221 assert(mem_layout != NULL);
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100222 assert(image_data != NULL);
Vikram Kanigirida567432014-04-15 18:08:08 +0100223 assert(image_data->h.version >= VERSION_1);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000224
225 /* Obtain a reference to the image by querying the platform layer */
Juan Castillo3a66aca2015-04-13 17:36:19 +0100226 io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
Juan Castilloec813f52015-10-01 18:37:40 +0100227 if (io_result != 0) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100228 WARN("Failed to obtain reference to image id=%u (%i)\n",
229 image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100230 return io_result;
James Morrissey9d72b4e2014-02-10 17:04:32 +0000231 }
232
233 /* Attempt to access the image */
234 io_result = io_open(dev_handle, image_spec, &image_handle);
Juan Castilloec813f52015-10-01 18:37:40 +0100235 if (io_result != 0) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100236 WARN("Failed to access image id=%u (%i)\n",
237 image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100238 return io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100239 }
240
Antonio Nino Diazb3a0a7b2016-02-02 12:03:38 +0000241 INFO("Loading image id=%u at address %p\n", image_id,
242 (void *) image_base);
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100243
James Morrissey9d72b4e2014-02-10 17:04:32 +0000244 /* Find the size of the image */
245 io_result = io_size(image_handle, &image_size);
Juan Castilloec813f52015-10-01 18:37:40 +0100246 if ((io_result != 0) || (image_size == 0)) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100247 WARN("Failed to determine the size of the image id=%u (%i)\n",
248 image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100249 goto exit;
James Morrissey9d72b4e2014-02-10 17:04:32 +0000250 }
251
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100252 /* Check that the memory where the image will be loaded is free */
253 if (!is_mem_free(mem_layout->free_base, mem_layout->free_size,
254 image_base, image_size)) {
Antonio Nino Diazb3a0a7b2016-02-02 12:03:38 +0000255 WARN("Failed to reserve memory: %p - %p\n", (void *) image_base,
256 (void *) (image_base + image_size));
Vikram Kanigirida567432014-04-15 18:08:08 +0100257 dump_load_info(image_base, image_size, mem_layout);
258 io_result = -ENOMEM;
259 goto exit;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100260 }
261
262 /* We have enough space so load the image now */
James Morrissey9d72b4e2014-02-10 17:04:32 +0000263 /* TODO: Consider whether to try to recover/retry a partially successful read */
Dan Handleya4cb68e2014-04-23 13:47:06 +0100264 io_result = io_read(image_handle, image_base, image_size, &bytes_read);
Juan Castilloec813f52015-10-01 18:37:40 +0100265 if ((io_result != 0) || (bytes_read < image_size)) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100266 WARN("Failed to load image id=%u (%i)\n", image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100267 goto exit;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100268 }
269
Sandrine Bailleux8eaf46e2016-05-27 14:08:10 +0100270 image_data->image_base = image_base;
271 image_data->image_size = image_size;
272
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100273 /*
274 * Update the memory usage info.
275 * This is done after the actual loading so that it is not updated when
276 * the load is unsuccessful.
Juan Castillo09a55a82015-01-19 16:51:21 +0000277 * If the caller does not provide an entry point, bypass the memory
278 * reservation.
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100279 */
Juan Castillo09a55a82015-01-19 16:51:21 +0000280 if (entry_point_info != NULL) {
281 reserve_mem(&mem_layout->free_base, &mem_layout->free_size,
282 image_base, image_size);
Sandrine Bailleux8eaf46e2016-05-27 14:08:10 +0100283 entry_point_info->pc = image_base;
Juan Castillo09a55a82015-01-19 16:51:21 +0000284 } else {
Antonio Nino Diazb3a0a7b2016-02-02 12:03:38 +0000285 INFO("Skip reserving memory: %p - %p\n", (void *) image_base,
286 (void *) (image_base + image_size));
Juan Castillo09a55a82015-01-19 16:51:21 +0000287 }
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100288
Achin Gupta4f6ad662013-10-25 09:08:21 +0100289 /*
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100290 * File has been successfully loaded.
Sandrine Bailleux8eaf46e2016-05-27 14:08:10 +0100291 * Flush the image in Trusted SRAM so that the next exception level can
292 * see it.
Achin Gupta4f6ad662013-10-25 09:08:21 +0100293 */
James Morrissey9d72b4e2014-02-10 17:04:32 +0000294 flush_dcache_range(image_base, image_size);
Achin Gupta4f6ad662013-10-25 09:08:21 +0100295
Antonio Nino Diazb3a0a7b2016-02-02 12:03:38 +0000296 INFO("Image id=%u loaded: %p - %p\n", image_id, (void *) image_base,
297 (void *) (image_base + image_size));
James Morrissey9d72b4e2014-02-10 17:04:32 +0000298
299exit:
Vikram Kanigirida567432014-04-15 18:08:08 +0100300 io_close(image_handle);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000301 /* Ignore improbable/unrecoverable error in 'close' */
302
303 /* TODO: Consider maintaining open device connection from this bootloader stage */
Vikram Kanigirida567432014-04-15 18:08:08 +0100304 io_dev_close(dev_handle);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000305 /* Ignore improbable/unrecoverable error in 'dev_close' */
Achin Gupta4f6ad662013-10-25 09:08:21 +0100306
Vikram Kanigirida567432014-04-15 18:08:08 +0100307 return io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100308}
Juan Castilloa08a5e72015-05-19 11:54:12 +0100309
310/*******************************************************************************
311 * Generic function to load and authenticate an image. The image is actually
312 * loaded by calling the 'load_image()' function. In addition, this function
313 * uses recursion to authenticate the parent images up to the root of trust.
314 ******************************************************************************/
315int load_auth_image(meminfo_t *mem_layout,
316 unsigned int image_id,
317 uintptr_t image_base,
318 image_info_t *image_data,
319 entry_point_info_t *entry_point_info)
320{
321 int rc;
322
323#if TRUSTED_BOARD_BOOT
324 unsigned int parent_id;
325
326 /* Use recursion to authenticate parent images */
327 rc = auth_mod_get_parent_id(image_id, &parent_id);
328 if (rc == 0) {
329 rc = load_auth_image(mem_layout, parent_id, image_base,
330 image_data, NULL);
Juan Castilloec813f52015-10-01 18:37:40 +0100331 if (rc != 0) {
Juan Castilloa08a5e72015-05-19 11:54:12 +0100332 return rc;
333 }
334 }
335#endif /* TRUSTED_BOARD_BOOT */
336
337 /* Load the image */
338 rc = load_image(mem_layout, image_id, image_base, image_data,
339 entry_point_info);
Juan Castilloec813f52015-10-01 18:37:40 +0100340 if (rc != 0) {
341 return rc;
Juan Castilloa08a5e72015-05-19 11:54:12 +0100342 }
343
344#if TRUSTED_BOARD_BOOT
345 /* Authenticate it */
346 rc = auth_mod_verify_img(image_id,
347 (void *)image_data->image_base,
348 image_data->image_size);
349 if (rc != 0) {
Juan Castillo97dbcf12015-08-17 10:43:27 +0100350 memset((void *)image_data->image_base, 0x00,
351 image_data->image_size);
352 flush_dcache_range(image_data->image_base,
353 image_data->image_size);
Juan Castilloec813f52015-10-01 18:37:40 +0100354 return -EAUTH;
Juan Castilloa08a5e72015-05-19 11:54:12 +0100355 }
356
357 /* After working with data, invalidate the data cache */
358 inv_dcache_range(image_data->image_base,
359 (size_t)image_data->image_size);
360#endif /* TRUSTED_BOARD_BOOT */
361
Juan Castilloec813f52015-10-01 18:37:40 +0100362 return 0;
Juan Castilloa08a5e72015-05-19 11:54:12 +0100363}
Sandrine Bailleuxb2e224c2015-09-28 17:03:06 +0100364
365/*******************************************************************************
366 * Print the content of an entry_point_info_t structure.
367 ******************************************************************************/
368void print_entry_point_info(const entry_point_info_t *ep_info)
369{
370 INFO("Entry point address = 0x%llx\n",
371 (unsigned long long) ep_info->pc);
372 INFO("SPSR = 0x%lx\n", (unsigned long) ep_info->spsr);
373
374#define PRINT_IMAGE_ARG(n) \
375 VERBOSE("Argument #" #n " = 0x%llx\n", \
376 (unsigned long long) ep_info->args.arg##n)
377
378 PRINT_IMAGE_ARG(0);
379 PRINT_IMAGE_ARG(1);
380 PRINT_IMAGE_ARG(2);
381 PRINT_IMAGE_ARG(3);
382 PRINT_IMAGE_ARG(4);
383 PRINT_IMAGE_ARG(5);
384 PRINT_IMAGE_ARG(6);
385 PRINT_IMAGE_ARG(7);
386#undef PRINT_IMAGE_ARG
387}