blob: d2c60eff8b370c51b7e8ebcffef8de8ee28f450f [file] [log] [blame]
Achin Gupta4f6ad662013-10-25 09:08:21 +01001/*
Dan Handleye83b0ca2014-01-14 18:17:09 +00002 * Copyright (c) 2013-2014, 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 Handley97043ac2014-04-09 13:14:54 +010031#include <arch.h>
Achin Gupta4f6ad662013-10-25 09:08:21 +010032#include <arch_helpers.h>
Dan Handley97043ac2014-04-09 13:14:54 +010033#include <assert.h>
Achin Gupta4f6ad662013-10-25 09:08:21 +010034#include <bl_common.h>
Dan Handley35e98e52014-04-09 13:13:04 +010035#include <debug.h>
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +010036#include <errno.h>
Dan Handley97043ac2014-04-09 13:14:54 +010037#include <io_storage.h>
38#include <platform.h>
Achin Gupta4f6ad662013-10-25 09:08:21 +010039
Achin Gupta4f6ad662013-10-25 09:08:21 +010040unsigned long page_align(unsigned long value, unsigned dir)
41{
42 unsigned long page_size = 1 << FOUR_KB_SHIFT;
43
44 /* Round up the limit to the next page boundary */
45 if (value & (page_size - 1)) {
46 value &= ~(page_size - 1);
47 if (dir == UP)
48 value += page_size;
49 }
50
51 return value;
52}
53
54static inline unsigned int is_page_aligned (unsigned long addr) {
55 const unsigned long page_size = 1 << FOUR_KB_SHIFT;
56
57 return (addr & (page_size - 1)) == 0;
58}
59
60void change_security_state(unsigned int target_security_state)
61{
62 unsigned long scr = read_scr();
63
Juan Castillod3280be2014-06-05 09:45:36 +010064 assert(sec_state_is_valid(target_security_state));
Achin Gupta4f6ad662013-10-25 09:08:21 +010065 if (target_security_state == SECURE)
66 scr &= ~SCR_NS_BIT;
Achin Gupta4f6ad662013-10-25 09:08:21 +010067 else
Juan Castillod3280be2014-06-05 09:45:36 +010068 scr |= SCR_NS_BIT;
Achin Gupta4f6ad662013-10-25 09:08:21 +010069
70 write_scr(scr);
71}
72
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +010073/******************************************************************************
74 * Determine whether the memory region delimited by 'addr' and 'size' is free,
75 * given the extents of free memory.
76 * Return 1 if it is free, 0 otherwise.
77 *****************************************************************************/
78static int is_mem_free(uint64_t free_base, size_t free_size,
79 uint64_t addr, size_t size)
Achin Gupta4f6ad662013-10-25 09:08:21 +010080{
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +010081 return (addr >= free_base) && (addr + size <= free_base + free_size);
82}
Achin Gupta4f6ad662013-10-25 09:08:21 +010083
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +010084/******************************************************************************
85 * Inside a given memory region, determine whether a sub-region of memory is
86 * closer from the top or the bottom of the encompassing region. Return the
87 * size of the smallest chunk of free memory surrounding the sub-region in
88 * 'small_chunk_size'.
89 *****************************************************************************/
90static unsigned int choose_mem_pos(uint64_t mem_start, uint64_t mem_end,
91 uint64_t submem_start, uint64_t submem_end,
92 size_t *small_chunk_size)
93{
94 size_t top_chunk_size, bottom_chunk_size;
Achin Gupta4f6ad662013-10-25 09:08:21 +010095
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +010096 assert(mem_start <= submem_start);
97 assert(submem_start <= submem_end);
98 assert(submem_end <= mem_end);
99 assert(small_chunk_size != NULL);
100
101 top_chunk_size = mem_end - submem_end;
102 bottom_chunk_size = submem_start - mem_start;
103
104 if (top_chunk_size < bottom_chunk_size) {
105 *small_chunk_size = top_chunk_size;
106 return TOP;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100107 } else {
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100108 *small_chunk_size = bottom_chunk_size;
109 return BOTTOM;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100110 }
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100111}
Achin Gupta4f6ad662013-10-25 09:08:21 +0100112
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100113/******************************************************************************
114 * Reserve the memory region delimited by 'addr' and 'size'. The extents of free
115 * memory are passed in 'free_base' and 'free_size' and they will be updated to
116 * reflect the memory usage.
117 * The caller must ensure the memory to reserve is free.
118 *****************************************************************************/
119void reserve_mem(uint64_t *free_base, size_t *free_size,
120 uint64_t addr, size_t size)
121{
122 size_t discard_size;
123 size_t reserved_size;
124 unsigned int pos;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100125
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100126 assert(free_base != NULL);
127 assert(free_size != NULL);
128 assert(is_mem_free(*free_base, *free_size, addr, size));
129
130 pos = choose_mem_pos(*free_base, *free_base + *free_size,
131 addr, addr + size,
132 &discard_size);
133
134 reserved_size = size + discard_size;
135 *free_size -= reserved_size;
136
137 if (pos == BOTTOM)
138 *free_base = addr + size;
139
140 INFO("Reserved %u bytes (discarded %u bytes %s)\n",
141 reserved_size, discard_size,
142 pos == TOP ? "above" : "below");
Achin Gupta4f6ad662013-10-25 09:08:21 +0100143}
144
145static void dump_load_info(unsigned long image_load_addr,
146 unsigned long image_size,
Dan Handleyfb037bf2014-04-10 15:37:22 +0100147 const meminfo_t *mem_layout)
Achin Gupta4f6ad662013-10-25 09:08:21 +0100148{
149#if DEBUG
Soby Mathewb79af932014-06-12 17:23:58 +0100150 tf_printf("Trying to load image at address 0x%lx, size = 0x%lx\r\n",
Achin Gupta4f6ad662013-10-25 09:08:21 +0100151 image_load_addr, image_size);
Soby Mathewb79af932014-06-12 17:23:58 +0100152 tf_printf("Current memory layout:\r\n");
153 tf_printf(" total region = [0x%lx, 0x%lx]\r\n", mem_layout->total_base,
Achin Gupta4f6ad662013-10-25 09:08:21 +0100154 mem_layout->total_base + mem_layout->total_size);
Soby Mathewb79af932014-06-12 17:23:58 +0100155 tf_printf(" free region = [0x%lx, 0x%lx]\r\n", mem_layout->free_base,
Achin Gupta4f6ad662013-10-25 09:08:21 +0100156 mem_layout->free_base + mem_layout->free_size);
157#endif
158}
159
Ryan Harkinee9ad782014-02-04 11:43:57 +0000160/* Generic function to return the size of an image */
161unsigned long image_size(const char *image_name)
162{
Dan Handley625de1d2014-04-23 13:47:06 +0100163 uintptr_t dev_handle;
164 uintptr_t image_handle;
165 uintptr_t image_spec;
Ryan Harkinee9ad782014-02-04 11:43:57 +0000166 size_t image_size = 0;
167 int io_result = IO_FAIL;
168
169 assert(image_name != NULL);
170
171 /* Obtain a reference to the image by querying the platform layer */
172 io_result = plat_get_image_source(image_name, &dev_handle, &image_spec);
173 if (io_result != IO_SUCCESS) {
174 WARN("Failed to obtain reference to image '%s' (%i)\n",
175 image_name, io_result);
176 return 0;
177 }
178
179 /* Attempt to access the image */
180 io_result = io_open(dev_handle, image_spec, &image_handle);
181 if (io_result != IO_SUCCESS) {
182 WARN("Failed to access image '%s' (%i)\n",
183 image_name, io_result);
184 return 0;
185 }
186
187 /* Find the size of the image */
188 io_result = io_size(image_handle, &image_size);
189 if ((io_result != IO_SUCCESS) || (image_size == 0)) {
190 WARN("Failed to determine the size of the image '%s' file (%i)\n",
191 image_name, io_result);
192 }
193 io_result = io_close(image_handle);
194 /* Ignore improbable/unrecoverable error in 'close' */
195
196 /* TODO: Consider maintaining open device connection from this
197 * bootloader stage
198 */
199 io_result = io_dev_close(dev_handle);
200 /* Ignore improbable/unrecoverable error in 'dev_close' */
201
202 return image_size;
203}
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100204
Achin Gupta4f6ad662013-10-25 09:08:21 +0100205/*******************************************************************************
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100206 * Generic function to load an image at a specific address given a name and
207 * extents of free memory. It updates the memory layout if the load is
208 * successful, as well as the image information and the entry point information.
209 * The caller might pass a NULL pointer for the entry point if it is not
210 * interested in this information, e.g. because the image just needs to be
211 * loaded in memory but won't ever be executed.
212 * Returns 0 on success, a negative error code otherwise.
Achin Gupta4f6ad662013-10-25 09:08:21 +0100213 ******************************************************************************/
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100214int load_image(meminfo_t *mem_layout,
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100215 const char *image_name,
216 uint64_t image_base,
217 image_info_t *image_data,
218 entry_point_info_t *entry_point_info)
Achin Gupta4f6ad662013-10-25 09:08:21 +0100219{
Dan Handley625de1d2014-04-23 13:47:06 +0100220 uintptr_t dev_handle;
221 uintptr_t image_handle;
222 uintptr_t image_spec;
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100223 size_t image_size;
224 size_t bytes_read;
James Morrissey9d72b4e2014-02-10 17:04:32 +0000225 int io_result = IO_FAIL;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100226
James Morrissey9d72b4e2014-02-10 17:04:32 +0000227 assert(mem_layout != NULL);
228 assert(image_name != NULL);
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100229 assert(image_data != NULL);
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100230 assert(image_data->h.version >= VERSION_1);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000231
232 /* Obtain a reference to the image by querying the platform layer */
233 io_result = plat_get_image_source(image_name, &dev_handle, &image_spec);
234 if (io_result != IO_SUCCESS) {
Jeenu Viswambharan08c28d52014-02-20 12:03:31 +0000235 WARN("Failed to obtain reference to image '%s' (%i)\n",
James Morrissey9d72b4e2014-02-10 17:04:32 +0000236 image_name, io_result);
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100237 return io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100238 }
239
James Morrissey9d72b4e2014-02-10 17:04:32 +0000240 /* Attempt to access the image */
241 io_result = io_open(dev_handle, image_spec, &image_handle);
242 if (io_result != IO_SUCCESS) {
Jeenu Viswambharan08c28d52014-02-20 12:03:31 +0000243 WARN("Failed to access image '%s' (%i)\n",
James Morrissey9d72b4e2014-02-10 17:04:32 +0000244 image_name, io_result);
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100245 return io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100246 }
247
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100248 INFO("Loading file '%s' at address 0x%lx\n", image_name, image_base);
249
James Morrissey9d72b4e2014-02-10 17:04:32 +0000250 /* Find the size of the image */
251 io_result = io_size(image_handle, &image_size);
252 if ((io_result != IO_SUCCESS) || (image_size == 0)) {
Jeenu Viswambharan08c28d52014-02-20 12:03:31 +0000253 WARN("Failed to determine the size of the image '%s' file (%i)\n",
James Morrissey9d72b4e2014-02-10 17:04:32 +0000254 image_name, io_result);
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100255 goto exit;
James Morrissey9d72b4e2014-02-10 17:04:32 +0000256 }
257
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100258 /* Check that the memory where the image will be loaded is free */
259 if (!is_mem_free(mem_layout->free_base, mem_layout->free_size,
260 image_base, image_size)) {
261 WARN("Failed to reserve memory: 0x%lx - 0x%lx\n",
262 image_base, image_base + image_size);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000263 dump_load_info(image_base, image_size, mem_layout);
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100264 io_result = -ENOMEM;
265 goto exit;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100266 }
267
268 /* We have enough space so load the image now */
James Morrissey9d72b4e2014-02-10 17:04:32 +0000269 /* TODO: Consider whether to try to recover/retry a partially successful read */
Dan Handley625de1d2014-04-23 13:47:06 +0100270 io_result = io_read(image_handle, image_base, image_size, &bytes_read);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000271 if ((io_result != IO_SUCCESS) || (bytes_read < image_size)) {
Jeenu Viswambharan08c28d52014-02-20 12:03:31 +0000272 WARN("Failed to load '%s' file (%i)\n", image_name, io_result);
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100273 goto exit;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100274 }
275
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100276 /*
277 * Update the memory usage info.
278 * This is done after the actual loading so that it is not updated when
279 * the load is unsuccessful.
280 */
281 reserve_mem(&mem_layout->free_base, &mem_layout->free_size,
282 image_base, image_size);
283
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100284 image_data->image_base = image_base;
285 image_data->image_size = image_size;
286
Sandrine Bailleux63db7ba2014-05-28 11:31:18 +0100287 if (entry_point_info != NULL)
288 entry_point_info->pc = image_base;
Vikram Kanigiri4112bfa2014-04-15 18:08:08 +0100289
Achin Gupta4f6ad662013-10-25 09:08:21 +0100290 /*
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100291 * File has been successfully loaded.
292 * Flush the image in TZRAM so that the next EL can 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
Sandrine Bailleux8f55dfb2014-06-24 14:02:34 +0100296 INFO("File '%s' loaded: 0x%lx - 0x%lx\n", image_name, image_base,
297 image_base + image_size);
James Morrissey9d72b4e2014-02-10 17:04:32 +0000298
299exit:
Vikram Kanigiri4112bfa2014-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 Kanigiri4112bfa2014-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 Kanigiri4112bfa2014-04-15 18:08:08 +0100307 return io_result;
Achin Gupta4f6ad662013-10-25 09:08:21 +0100308}