blob: b8558a69d4c4388de75880c52fc41e59dd0cdae7 [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>
Achin Gupta4f6ad662013-10-25 09:08:21 +010040
Achin Gupta4f6ad662013-10-25 09:08:21 +010041unsigned long page_align(unsigned long value, unsigned dir)
42{
43 unsigned long page_size = 1 << FOUR_KB_SHIFT;
44
45 /* Round up the limit to the next page boundary */
46 if (value & (page_size - 1)) {
47 value &= ~(page_size - 1);
48 if (dir == UP)
49 value += page_size;
50 }
51
52 return value;
53}
54
55static inline unsigned int is_page_aligned (unsigned long addr) {
56 const unsigned long page_size = 1 << FOUR_KB_SHIFT;
57
58 return (addr & (page_size - 1)) == 0;
59}
60
61void change_security_state(unsigned int target_security_state)
62{
63 unsigned long scr = read_scr();
64
Juan Castillof558cac2014-06-05 09:45:36 +010065 assert(sec_state_is_valid(target_security_state));
Achin Gupta4f6ad662013-10-25 09:08:21 +010066 if (target_security_state == SECURE)
67 scr &= ~SCR_NS_BIT;
Achin Gupta4f6ad662013-10-25 09:08:21 +010068 else
Juan Castillof558cac2014-06-05 09:45:36 +010069 scr |= SCR_NS_BIT;
Achin Gupta4f6ad662013-10-25 09:08:21 +010070
71 write_scr(scr);
72}
73
Sandrine Bailleux467d0572014-06-24 14:02:34 +010074/******************************************************************************
75 * Determine whether the memory region delimited by 'addr' and 'size' is free,
76 * given the extents of free memory.
77 * Return 1 if it is free, 0 otherwise.
78 *****************************************************************************/
79static int is_mem_free(uint64_t free_base, size_t free_size,
80 uint64_t addr, size_t size)
81{
82 return (addr >= free_base) && (addr + size <= free_base + free_size);
83}
Achin Gupta4f6ad662013-10-25 09:08:21 +010084
Sandrine Bailleux467d0572014-06-24 14:02:34 +010085/******************************************************************************
86 * Inside a given memory region, determine whether a sub-region of memory is
87 * closer from the top or the bottom of the encompassing region. Return the
88 * size of the smallest chunk of free memory surrounding the sub-region in
89 * 'small_chunk_size'.
90 *****************************************************************************/
91static unsigned int choose_mem_pos(uint64_t mem_start, uint64_t mem_end,
92 uint64_t submem_start, uint64_t submem_end,
93 size_t *small_chunk_size)
Achin Gupta4f6ad662013-10-25 09:08:21 +010094{
Sandrine Bailleux467d0572014-06-24 14:02:34 +010095 size_t top_chunk_size, bottom_chunk_size;
96
97 assert(mem_start <= submem_start);
98 assert(submem_start <= submem_end);
99 assert(submem_end <= mem_end);
100 assert(small_chunk_size != NULL);
Achin Gupta4f6ad662013-10-25 09:08:21 +0100101
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100102 top_chunk_size = mem_end - submem_end;
103 bottom_chunk_size = submem_start - mem_start;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100104
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100105 if (top_chunk_size < bottom_chunk_size) {
106 *small_chunk_size = top_chunk_size;
107 return TOP;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100108 } else {
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100109 *small_chunk_size = bottom_chunk_size;
110 return BOTTOM;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100111 }
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100112}
113
114/******************************************************************************
115 * Reserve the memory region delimited by 'addr' and 'size'. The extents of free
116 * memory are passed in 'free_base' and 'free_size' and they will be updated to
117 * reflect the memory usage.
118 * The caller must ensure the memory to reserve is free.
119 *****************************************************************************/
120void reserve_mem(uint64_t *free_base, size_t *free_size,
121 uint64_t addr, size_t size)
122{
123 size_t discard_size;
124 size_t reserved_size;
125 unsigned int pos;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100126
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100127 assert(free_base != NULL);
128 assert(free_size != NULL);
129 assert(is_mem_free(*free_base, *free_size, addr, size));
Achin Gupta4f6ad662013-10-25 09:08:21 +0100130
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100131 pos = choose_mem_pos(*free_base, *free_base + *free_size,
132 addr, addr + size,
133 &discard_size);
134
135 reserved_size = size + discard_size;
136 *free_size -= reserved_size;
137
138 if (pos == BOTTOM)
139 *free_base = addr + size;
140
Dan Handleyeb839ce2015-03-23 18:13:33 +0000141 VERBOSE("Reserved 0x%lx bytes (discarded 0x%lx bytes %s)\n",
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100142 reserved_size, discard_size,
143 pos == TOP ? "above" : "below");
Achin Gupta4f6ad662013-10-25 09:08:21 +0100144}
145
146static void dump_load_info(unsigned long image_load_addr,
147 unsigned long image_size,
Dan Handleye2712bc2014-04-10 15:37:22 +0100148 const meminfo_t *mem_layout)
Achin Gupta4f6ad662013-10-25 09:08:21 +0100149{
Dan Handley91b624e2014-07-29 17:14:00 +0100150 INFO("Trying to load image at address 0x%lx, size = 0x%lx\n",
Achin Gupta4f6ad662013-10-25 09:08:21 +0100151 image_load_addr, image_size);
Dan Handley91b624e2014-07-29 17:14:00 +0100152 INFO("Current memory layout:\n");
153 INFO(" total region = [0x%lx, 0x%lx]\n", mem_layout->total_base,
Achin Gupta4f6ad662013-10-25 09:08:21 +0100154 mem_layout->total_base + mem_layout->total_size);
Dan Handley91b624e2014-07-29 17:14:00 +0100155 INFO(" free region = [0x%lx, 0x%lx]\n", mem_layout->free_base,
Achin Gupta4f6ad662013-10-25 09:08:21 +0100156 mem_layout->free_base + mem_layout->free_size);
Achin Gupta4f6ad662013-10-25 09:08:21 +0100157}
158
Ryan Harkin87274c42014-02-04 11:43:57 +0000159/* Generic function to return the size of an image */
Juan Castillo3a66aca2015-04-13 17:36:19 +0100160unsigned long image_size(unsigned int image_id)
Ryan Harkin87274c42014-02-04 11:43:57 +0000161{
Dan Handleya4cb68e2014-04-23 13:47:06 +0100162 uintptr_t dev_handle;
163 uintptr_t image_handle;
164 uintptr_t image_spec;
Ryan Harkin87274c42014-02-04 11:43:57 +0000165 size_t image_size = 0;
166 int io_result = IO_FAIL;
167
Ryan Harkin87274c42014-02-04 11:43:57 +0000168 /* Obtain a reference to the image by querying the platform layer */
Juan Castillo3a66aca2015-04-13 17:36:19 +0100169 io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
Ryan Harkin87274c42014-02-04 11:43:57 +0000170 if (io_result != IO_SUCCESS) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100171 WARN("Failed to obtain reference to image id=%u (%i)\n",
172 image_id, io_result);
Ryan Harkin87274c42014-02-04 11:43:57 +0000173 return 0;
174 }
175
176 /* Attempt to access the image */
177 io_result = io_open(dev_handle, image_spec, &image_handle);
178 if (io_result != IO_SUCCESS) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100179 WARN("Failed to access image id=%u (%i)\n",
180 image_id, io_result);
Ryan Harkin87274c42014-02-04 11:43:57 +0000181 return 0;
182 }
183
184 /* Find the size of the image */
185 io_result = io_size(image_handle, &image_size);
186 if ((io_result != IO_SUCCESS) || (image_size == 0)) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100187 WARN("Failed to determine the size of the image id=%u (%i)\n",
188 image_id, io_result);
Ryan Harkin87274c42014-02-04 11:43:57 +0000189 }
190 io_result = io_close(image_handle);
191 /* Ignore improbable/unrecoverable error in 'close' */
192
193 /* TODO: Consider maintaining open device connection from this
194 * bootloader stage
195 */
196 io_result = io_dev_close(dev_handle);
197 /* Ignore improbable/unrecoverable error in 'dev_close' */
198
199 return image_size;
200}
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100201
Achin Gupta4f6ad662013-10-25 09:08:21 +0100202/*******************************************************************************
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100203 * Generic function to load an image at a specific address given a name and
204 * extents of free memory. It updates the memory layout if the load is
205 * successful, as well as the image information and the entry point information.
206 * The caller might pass a NULL pointer for the entry point if it is not
207 * interested in this information, e.g. because the image just needs to be
208 * loaded in memory but won't ever be executed.
209 * Returns 0 on success, a negative error code otherwise.
Achin Gupta4f6ad662013-10-25 09:08:21 +0100210 ******************************************************************************/
Vikram Kanigirida567432014-04-15 18:08:08 +0100211int load_image(meminfo_t *mem_layout,
Juan Castillo3a66aca2015-04-13 17:36:19 +0100212 unsigned int image_id,
Juan Castilloa08a5e72015-05-19 11:54:12 +0100213 uintptr_t image_base,
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100214 image_info_t *image_data,
215 entry_point_info_t *entry_point_info)
Achin Gupta4f6ad662013-10-25 09:08:21 +0100216{
Dan Handleya4cb68e2014-04-23 13:47:06 +0100217 uintptr_t dev_handle;
218 uintptr_t image_handle;
219 uintptr_t image_spec;
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100220 size_t image_size;
221 size_t bytes_read;
James Morrissey9d72b4e2014-02-10 17:04:32 +0000222 int io_result = IO_FAIL;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100223
James Morrissey9d72b4e2014-02-10 17:04:32 +0000224 assert(mem_layout != NULL);
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100225 assert(image_data != NULL);
Vikram Kanigirida567432014-04-15 18:08:08 +0100226 assert(image_data->h.version >= VERSION_1);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000227
228 /* Obtain a reference to the image by querying the platform layer */
Juan Castillo3a66aca2015-04-13 17:36:19 +0100229 io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000230 if (io_result != IO_SUCCESS) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100231 WARN("Failed to obtain reference to image id=%u (%i)\n",
232 image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100233 return io_result;
James Morrissey9d72b4e2014-02-10 17:04:32 +0000234 }
235
236 /* Attempt to access the image */
237 io_result = io_open(dev_handle, image_spec, &image_handle);
238 if (io_result != IO_SUCCESS) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100239 WARN("Failed to access image id=%u (%i)\n",
240 image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100241 return io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100242 }
243
Juan Castillo3a66aca2015-04-13 17:36:19 +0100244 INFO("Loading image id=%u at address 0x%lx\n", image_id, image_base);
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100245
James Morrissey9d72b4e2014-02-10 17:04:32 +0000246 /* Find the size of the image */
247 io_result = io_size(image_handle, &image_size);
248 if ((io_result != IO_SUCCESS) || (image_size == 0)) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100249 WARN("Failed to determine the size of the image id=%u (%i)\n",
250 image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100251 goto exit;
James Morrissey9d72b4e2014-02-10 17:04:32 +0000252 }
253
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100254 /* Check that the memory where the image will be loaded is free */
255 if (!is_mem_free(mem_layout->free_base, mem_layout->free_size,
256 image_base, image_size)) {
257 WARN("Failed to reserve memory: 0x%lx - 0x%lx\n",
258 image_base, image_base + image_size);
Vikram Kanigirida567432014-04-15 18:08:08 +0100259 dump_load_info(image_base, image_size, mem_layout);
260 io_result = -ENOMEM;
261 goto exit;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100262 }
263
264 /* We have enough space so load the image now */
James Morrissey9d72b4e2014-02-10 17:04:32 +0000265 /* TODO: Consider whether to try to recover/retry a partially successful read */
Dan Handleya4cb68e2014-04-23 13:47:06 +0100266 io_result = io_read(image_handle, image_base, image_size, &bytes_read);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000267 if ((io_result != IO_SUCCESS) || (bytes_read < image_size)) {
Juan Castillo3a66aca2015-04-13 17:36:19 +0100268 WARN("Failed to load image id=%u (%i)\n", image_id, io_result);
Vikram Kanigirida567432014-04-15 18:08:08 +0100269 goto exit;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100270 }
271
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100272 /*
273 * Update the memory usage info.
274 * This is done after the actual loading so that it is not updated when
275 * the load is unsuccessful.
Juan Castillo09a55a82015-01-19 16:51:21 +0000276 * If the caller does not provide an entry point, bypass the memory
277 * reservation.
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100278 */
Juan Castillo09a55a82015-01-19 16:51:21 +0000279 if (entry_point_info != NULL) {
280 reserve_mem(&mem_layout->free_base, &mem_layout->free_size,
281 image_base, image_size);
282 } else {
283 INFO("Skip reserving memory: 0x%lx - 0x%lx\n",
284 image_base, image_base + image_size);
285 }
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100286
Vikram Kanigirida567432014-04-15 18:08:08 +0100287 image_data->image_base = image_base;
288 image_data->image_size = image_size;
289
Sandrine Bailleux3ab33f32014-05-28 11:31:18 +0100290 if (entry_point_info != NULL)
291 entry_point_info->pc = image_base;
Vikram Kanigirida567432014-04-15 18:08:08 +0100292
Achin Gupta4f6ad662013-10-25 09:08:21 +0100293 /*
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100294 * File has been successfully loaded.
295 * Flush the image in TZRAM so that the next EL can see it.
Achin Gupta4f6ad662013-10-25 09:08:21 +0100296 */
James Morrissey9d72b4e2014-02-10 17:04:32 +0000297 flush_dcache_range(image_base, image_size);
Achin Gupta4f6ad662013-10-25 09:08:21 +0100298
Juan Castillo3a66aca2015-04-13 17:36:19 +0100299 INFO("Image id=%u loaded: 0x%lx - 0x%lx\n", image_id, image_base,
Sandrine Bailleux467d0572014-06-24 14:02:34 +0100300 image_base + image_size);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000301
302exit:
Vikram Kanigirida567432014-04-15 18:08:08 +0100303 io_close(image_handle);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000304 /* Ignore improbable/unrecoverable error in 'close' */
305
306 /* TODO: Consider maintaining open device connection from this bootloader stage */
Vikram Kanigirida567432014-04-15 18:08:08 +0100307 io_dev_close(dev_handle);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000308 /* Ignore improbable/unrecoverable error in 'dev_close' */
Achin Gupta4f6ad662013-10-25 09:08:21 +0100309
Vikram Kanigirida567432014-04-15 18:08:08 +0100310 return io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100311}
Juan Castilloa08a5e72015-05-19 11:54:12 +0100312
313/*******************************************************************************
314 * Generic function to load and authenticate an image. The image is actually
315 * loaded by calling the 'load_image()' function. In addition, this function
316 * uses recursion to authenticate the parent images up to the root of trust.
317 ******************************************************************************/
318int load_auth_image(meminfo_t *mem_layout,
319 unsigned int image_id,
320 uintptr_t image_base,
321 image_info_t *image_data,
322 entry_point_info_t *entry_point_info)
323{
324 int rc;
325
326#if TRUSTED_BOARD_BOOT
327 unsigned int parent_id;
328
329 /* Use recursion to authenticate parent images */
330 rc = auth_mod_get_parent_id(image_id, &parent_id);
331 if (rc == 0) {
332 rc = load_auth_image(mem_layout, parent_id, image_base,
333 image_data, NULL);
334 if (rc != IO_SUCCESS) {
335 return rc;
336 }
337 }
338#endif /* TRUSTED_BOARD_BOOT */
339
340 /* Load the image */
341 rc = load_image(mem_layout, image_id, image_base, image_data,
342 entry_point_info);
343 if (rc != IO_SUCCESS) {
344 return rc;
345 }
346
347#if TRUSTED_BOARD_BOOT
348 /* Authenticate it */
349 rc = auth_mod_verify_img(image_id,
350 (void *)image_data->image_base,
351 image_data->image_size);
352 if (rc != 0) {
353 return IO_FAIL;
354 }
355
356 /* After working with data, invalidate the data cache */
357 inv_dcache_range(image_data->image_base,
358 (size_t)image_data->image_size);
359#endif /* TRUSTED_BOARD_BOOT */
360
361 return IO_SUCCESS;
362}