bl_common.c 13.3 KB
Newer Older
1
/*
2
 * Copyright (c) 2013-2016, ARM Limited and Contributors. All rights reserved.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
 *
 * 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.
 */

31
#include <arch.h>
32
#include <arch_helpers.h>
33
#include <assert.h>
34
#include <auth_mod.h>
35
#include <bl_common.h>
36
#include <debug.h>
37
#include <errno.h>
38
39
#include <io_storage.h>
#include <platform.h>
40
#include <string.h>
41
#include <utils.h>
42
#include <xlat_tables.h>
43

44
uintptr_t page_align(uintptr_t value, unsigned dir)
45
46
{
	/* Round up the limit to the next page boundary */
47
48
	if (value & (PAGE_SIZE - 1)) {
		value &= ~(PAGE_SIZE - 1);
49
		if (dir == UP)
50
			value += PAGE_SIZE;
51
52
53
54
55
	}

	return value;
}

56
57
static inline unsigned int is_page_aligned (uintptr_t addr) {
	return (addr & (PAGE_SIZE - 1)) == 0;
58
59
}

60
61
62
/******************************************************************************
 * Determine whether the memory region delimited by 'addr' and 'size' is free,
 * given the extents of free memory.
63
64
 * Return 1 if it is free, 0 if it is not free or if the input values are
 * invalid.
65
 *****************************************************************************/
66
67
static int is_mem_free(uintptr_t free_base, size_t free_size,
		uintptr_t addr, size_t size)
68
{
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
	uintptr_t free_end, requested_end;

	/*
	 * Handle corner cases first.
	 *
	 * The order of the 2 tests is important, because if there's no space
	 * left (i.e. free_size == 0) but we don't ask for any memory
	 * (i.e. size == 0) then we should report that the memory is free.
	 */
	if (size == 0)
		return 1;	/* A zero-byte region is always free */
	if (free_size == 0)
		return 0;

	/*
	 * Check that the end addresses don't overflow.
	 * If they do, consider that this memory region is not free, as this
	 * is an invalid scenario.
	 */
	if (check_uptr_overflow(free_base, free_size - 1))
		return 0;
	free_end = free_base + (free_size - 1);

	if (check_uptr_overflow(addr, size - 1))
		return 0;
	requested_end = addr + (size - 1);

	/*
	 * Finally, check that the requested memory region lies within the free
	 * region.
	 */
	return (addr >= free_base) && (requested_end <= free_end);
101
}
102

103
104
105
106
107
108
/******************************************************************************
 * 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'.
 *****************************************************************************/
109
110
111
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)
112
{
113
	size_t top_chunk_size, bottom_chunk_size;
114

115
116
117
118
	assert(mem_start <= submem_start);
	assert(submem_start <= submem_end);
	assert(submem_end <= mem_end);
	assert(small_chunk_size != NULL);
119

120
121
122
123
124
125
	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;
126
	} else {
127
128
		*small_chunk_size = bottom_chunk_size;
		return BOTTOM;
129
	}
130
}
131

132
133
134
135
/******************************************************************************
 * 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.
136
137
 * The caller must ensure the memory to reserve is free and that the addresses
 * and sizes passed in arguments are sane.
138
 *****************************************************************************/
139
140
void reserve_mem(uintptr_t *free_base, size_t *free_size,
		 uintptr_t addr, size_t size)
141
142
143
144
{
	size_t discard_size;
	size_t reserved_size;
	unsigned int pos;
145

146
147
148
149
	assert(free_base != NULL);
	assert(free_size != NULL);
	assert(is_mem_free(*free_base, *free_size, addr, size));

150
151
152
153
154
155
156
	if (size == 0) {
		WARN("Nothing to allocate, requested size is zero\n");
		return;
	}

	pos = choose_mem_pos(*free_base, *free_base + (*free_size - 1),
			     addr, addr + (size - 1),
157
158
159
160
161
162
163
164
			     &discard_size);

	reserved_size = size + discard_size;
	*free_size -= reserved_size;

	if (pos == BOTTOM)
		*free_base = addr + size;

165
	VERBOSE("Reserved 0x%zx bytes (discarded 0x%zx bytes %s)\n",
166
167
	     reserved_size, discard_size,
	     pos == TOP ? "above" : "below");
168
169
}

170
171
static void dump_load_info(uintptr_t image_load_addr,
			   size_t image_size,
172
			   const meminfo_t *mem_layout)
173
{
174
175
	INFO("Trying to load image at address %p, size = 0x%zx\n",
		(void *)image_load_addr, image_size);
Dan Handley's avatar
Dan Handley committed
176
	INFO("Current memory layout:\n");
177
178
179
180
	INFO("  total region = [base = %p, size = 0x%zx]\n",
		(void *) mem_layout->total_base, mem_layout->total_size);
	INFO("  free region = [base = %p, size = 0x%zx]\n",
		(void *) mem_layout->free_base, mem_layout->free_size);
181
182
}

Ryan Harkin's avatar
Ryan Harkin committed
183
/* Generic function to return the size of an image */
184
size_t image_size(unsigned int image_id)
Ryan Harkin's avatar
Ryan Harkin committed
185
{
186
187
188
	uintptr_t dev_handle;
	uintptr_t image_handle;
	uintptr_t image_spec;
Ryan Harkin's avatar
Ryan Harkin committed
189
	size_t image_size = 0;
190
	int io_result;
Ryan Harkin's avatar
Ryan Harkin committed
191
192

	/* Obtain a reference to the image by querying the platform layer */
193
	io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
194
	if (io_result != 0) {
195
196
		WARN("Failed to obtain reference to image id=%u (%i)\n",
			image_id, io_result);
Ryan Harkin's avatar
Ryan Harkin committed
197
198
199
200
201
		return 0;
	}

	/* Attempt to access the image */
	io_result = io_open(dev_handle, image_spec, &image_handle);
202
	if (io_result != 0) {
203
204
		WARN("Failed to access image id=%u (%i)\n",
			image_id, io_result);
Ryan Harkin's avatar
Ryan Harkin committed
205
206
207
208
209
		return 0;
	}

	/* Find the size of the image */
	io_result = io_size(image_handle, &image_size);
210
	if ((io_result != 0) || (image_size == 0)) {
211
212
		WARN("Failed to determine the size of the image id=%u (%i)\n",
			image_id, io_result);
Ryan Harkin's avatar
Ryan Harkin committed
213
214
215
216
217
218
219
220
221
222
223
224
	}
	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;
}
225

226
/*******************************************************************************
227
228
229
230
231
232
233
234
235
236
237
238
239
240
 * 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).
 *
241
 * Returns 0 on success, a negative error code otherwise.
242
 ******************************************************************************/
243
int load_image(meminfo_t *mem_layout,
244
	       unsigned int image_id,
245
	       uintptr_t image_base,
246
247
	       image_info_t *image_data,
	       entry_point_info_t *entry_point_info)
248
{
249
250
251
	uintptr_t dev_handle;
	uintptr_t image_handle;
	uintptr_t image_spec;
252
253
	size_t image_size;
	size_t bytes_read;
254
	int io_result;
255
256

	assert(mem_layout != NULL);
257
	assert(image_data != NULL);
258
	assert(image_data->h.version >= VERSION_1);
259
260

	/* Obtain a reference to the image by querying the platform layer */
261
	io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
262
	if (io_result != 0) {
263
264
		WARN("Failed to obtain reference to image id=%u (%i)\n",
			image_id, io_result);
265
		return io_result;
266
	}
267

268
269
	/* Attempt to access the image */
	io_result = io_open(dev_handle, image_spec, &image_handle);
270
	if (io_result != 0) {
271
272
		WARN("Failed to access image id=%u (%i)\n",
			image_id, io_result);
273
		return io_result;
274
275
	}

276
277
	INFO("Loading image id=%u at address %p\n", image_id,
		(void *) image_base);
278

279
280
	/* Find the size of the image */
	io_result = io_size(image_handle, &image_size);
281
	if ((io_result != 0) || (image_size == 0)) {
282
283
		WARN("Failed to determine the size of the image id=%u (%i)\n",
			image_id, io_result);
284
		goto exit;
285
286
	}

287
288
289
	/* 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)) {
290
291
		WARN("Failed to reserve region [base = %p, size = 0x%zx]\n",
		     (void *) image_base, image_size);
292
293
294
		dump_load_info(image_base, image_size, mem_layout);
		io_result = -ENOMEM;
		goto exit;
295
296
297
	}

	/* We have enough space so load the image now */
298
	/* TODO: Consider whether to try to recover/retry a partially successful read */
299
	io_result = io_read(image_handle, image_base, image_size, &bytes_read);
300
	if ((io_result != 0) || (bytes_read < image_size)) {
301
		WARN("Failed to load image id=%u (%i)\n", image_id, io_result);
302
		goto exit;
303
304
	}

305
306
307
	image_data->image_base = image_base;
	image_data->image_size = image_size;

308
309
310
311
	/*
	 * Update the memory usage info.
	 * This is done after the actual loading so that it is not updated when
	 * the load is unsuccessful.
312
313
	 * If the caller does not provide an entry point, bypass the memory
	 * reservation.
314
	 */
315
316
317
	if (entry_point_info != NULL) {
		reserve_mem(&mem_layout->free_base, &mem_layout->free_size,
				image_base, image_size);
318
		entry_point_info->pc = image_base;
319
	} else {
320
321
		INFO("Skip reserving region [base = %p, size = 0x%zx]\n",
		     (void *) image_base, image_size);
322
	}
323

324
	/*
325
	 * File has been successfully loaded.
326
327
	 * Flush the image in Trusted SRAM so that the next exception level can
	 * see it.
328
	 */
329
	flush_dcache_range(image_base, image_size);
330

331
332
	INFO("Image id=%u loaded at address %p, size = 0x%zx\n", image_id,
		(void *) image_base, image_size);
333
334

exit:
335
	io_close(image_handle);
336
337
338
	/* Ignore improbable/unrecoverable error in 'close' */

	/* TODO: Consider maintaining open device connection from this bootloader stage */
339
	io_dev_close(dev_handle);
340
	/* Ignore improbable/unrecoverable error in 'dev_close' */
341

342
	return io_result;
343
}
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365

/*******************************************************************************
 * 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);
366
		if (rc != 0) {
367
368
369
370
371
372
373
374
			return rc;
		}
	}
#endif /* TRUSTED_BOARD_BOOT */

	/* Load the image */
	rc = load_image(mem_layout, image_id, image_base, image_data,
			entry_point_info);
375
376
	if (rc != 0) {
		return rc;
377
378
379
380
381
382
383
384
	}

#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) {
385
386
387
388
		memset((void *)image_data->image_base, 0x00,
		       image_data->image_size);
		flush_dcache_range(image_data->image_base,
				   image_data->image_size);
389
		return -EAUTH;
390
391
392
393
394
395
396
	}

	/* 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 */

397
	return 0;
398
}
399
400
401
402
403
404

/*******************************************************************************
 * Print the content of an entry_point_info_t structure.
 ******************************************************************************/
void print_entry_point_info(const entry_point_info_t *ep_info)
{
405
406
	INFO("Entry point address = %p\n", (void *)ep_info->pc);
	INFO("SPSR = 0x%x\n", ep_info->spsr);
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421

#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
}