bl_common.c 10.2 KB
Newer Older
1
/*
2
 * Copyright (c) 2013-2015, 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 <bl_common.h>
35
#include <debug.h>
36
#include <errno.h>
37
38
#include <io_storage.h>
#include <platform.h>
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

unsigned long page_align(unsigned long value, unsigned dir)
{
	unsigned long page_size = 1 << FOUR_KB_SHIFT;

	/* Round up the limit to the next page boundary */
	if (value & (page_size - 1)) {
		value &= ~(page_size - 1);
		if (dir == UP)
			value += page_size;
	}

	return value;
}

static inline unsigned int is_page_aligned (unsigned long addr) {
	const unsigned long page_size = 1 << FOUR_KB_SHIFT;

	return (addr & (page_size - 1)) == 0;
}

void change_security_state(unsigned int target_security_state)
{
	unsigned long scr = read_scr();

64
	assert(sec_state_is_valid(target_security_state));
65
66
67
	if (target_security_state == SECURE)
		scr &= ~SCR_NS_BIT;
	else
68
		scr |= SCR_NS_BIT;
69
70
71
72

	write_scr(scr);
}

73
74
75
76
77
78
79
80
81
82
/******************************************************************************
 * 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.
 *****************************************************************************/
static int is_mem_free(uint64_t free_base, size_t free_size,
		       uint64_t addr, size_t size)
{
	return (addr >= free_base) && (addr + size <= free_base + free_size);
}
83

84
85
86
87
88
89
90
91
92
/******************************************************************************
 * 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'.
 *****************************************************************************/
static unsigned int choose_mem_pos(uint64_t mem_start, uint64_t mem_end,
				   uint64_t submem_start, uint64_t submem_end,
				   size_t *small_chunk_size)
93
{
94
	size_t top_chunk_size, bottom_chunk_size;
95

96
97
98
99
	assert(mem_start <= submem_start);
	assert(submem_start <= submem_end);
	assert(submem_end <= mem_end);
	assert(small_chunk_size != NULL);
100

101
102
103
104
105
106
	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;
107
	} else {
108
109
		*small_chunk_size = bottom_chunk_size;
		return BOTTOM;
110
	}
111
}
112

113
114
115
116
117
118
119
120
121
122
123
124
/******************************************************************************
 * 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.
 *****************************************************************************/
void reserve_mem(uint64_t *free_base, size_t *free_size,
		 uint64_t addr, size_t size)
{
	size_t discard_size;
	size_t reserved_size;
	unsigned int pos;
125

126
127
128
129
130
131
132
133
134
135
136
137
138
139
	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;

140
	VERBOSE("Reserved 0x%lx bytes (discarded 0x%lx bytes %s)\n",
141
142
	     reserved_size, discard_size,
	     pos == TOP ? "above" : "below");
143
144
145
146
}

static void dump_load_info(unsigned long image_load_addr,
			   unsigned long image_size,
147
			   const meminfo_t *mem_layout)
148
{
Dan Handley's avatar
Dan Handley committed
149
	INFO("Trying to load image at address 0x%lx, size = 0x%lx\n",
150
		image_load_addr, image_size);
Dan Handley's avatar
Dan Handley committed
151
152
	INFO("Current memory layout:\n");
	INFO("  total region = [0x%lx, 0x%lx]\n", mem_layout->total_base,
153
			mem_layout->total_base + mem_layout->total_size);
Dan Handley's avatar
Dan Handley committed
154
	INFO("  free region = [0x%lx, 0x%lx]\n", mem_layout->free_base,
155
156
157
			mem_layout->free_base + mem_layout->free_size);
}

Ryan Harkin's avatar
Ryan Harkin committed
158
/* Generic function to return the size of an image */
159
unsigned long image_size(unsigned int image_id)
Ryan Harkin's avatar
Ryan Harkin committed
160
{
161
162
163
	uintptr_t dev_handle;
	uintptr_t image_handle;
	uintptr_t image_spec;
Ryan Harkin's avatar
Ryan Harkin committed
164
165
166
167
	size_t image_size = 0;
	int io_result = IO_FAIL;

	/* Obtain a reference to the image by querying the platform layer */
168
	io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
Ryan Harkin's avatar
Ryan Harkin committed
169
	if (io_result != IO_SUCCESS) {
170
171
		WARN("Failed to obtain reference to image id=%u (%i)\n",
			image_id, io_result);
Ryan Harkin's avatar
Ryan Harkin committed
172
173
174
175
176
177
		return 0;
	}

	/* Attempt to access the image */
	io_result = io_open(dev_handle, image_spec, &image_handle);
	if (io_result != IO_SUCCESS) {
178
179
		WARN("Failed to access image id=%u (%i)\n",
			image_id, io_result);
Ryan Harkin's avatar
Ryan Harkin committed
180
181
182
183
184
185
		return 0;
	}

	/* Find the size of the image */
	io_result = io_size(image_handle, &image_size);
	if ((io_result != IO_SUCCESS) || (image_size == 0)) {
186
187
		WARN("Failed to determine the size of the image id=%u (%i)\n",
			image_id, io_result);
Ryan Harkin's avatar
Ryan Harkin committed
188
189
190
191
192
193
194
195
196
197
198
199
	}
	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;
}
200

201
/*******************************************************************************
202
203
204
205
206
207
208
 * Generic function to load an image at a specific address given a name and
 * extents of free memory. It updates the memory layout if the load is
 * successful, as well as the image information and the entry point information.
 * The caller might pass a NULL pointer for the entry point if it is not
 * interested in this information, e.g. because the image just needs to be
 * loaded in memory but won't ever be executed.
 * Returns 0 on success, a negative error code otherwise.
209
 ******************************************************************************/
210
int load_image(meminfo_t *mem_layout,
211
	       unsigned int image_id,
212
213
214
	       uint64_t image_base,
	       image_info_t *image_data,
	       entry_point_info_t *entry_point_info)
215
{
216
217
218
	uintptr_t dev_handle;
	uintptr_t image_handle;
	uintptr_t image_spec;
219
220
	size_t image_size;
	size_t bytes_read;
221
222
223
	int io_result = IO_FAIL;

	assert(mem_layout != NULL);
224
	assert(image_data != NULL);
225
	assert(image_data->h.version >= VERSION_1);
226
227

	/* Obtain a reference to the image by querying the platform layer */
228
	io_result = plat_get_image_source(image_id, &dev_handle, &image_spec);
229
	if (io_result != IO_SUCCESS) {
230
231
		WARN("Failed to obtain reference to image id=%u (%i)\n",
			image_id, io_result);
232
		return io_result;
233
	}
234

235
236
237
	/* Attempt to access the image */
	io_result = io_open(dev_handle, image_spec, &image_handle);
	if (io_result != IO_SUCCESS) {
238
239
		WARN("Failed to access image id=%u (%i)\n",
			image_id, io_result);
240
		return io_result;
241
242
	}

243
	INFO("Loading image id=%u at address 0x%lx\n", image_id, image_base);
244

245
246
247
	/* Find the size of the image */
	io_result = io_size(image_handle, &image_size);
	if ((io_result != IO_SUCCESS) || (image_size == 0)) {
248
249
		WARN("Failed to determine the size of the image id=%u (%i)\n",
			image_id, io_result);
250
		goto exit;
251
252
	}

253
254
255
256
257
	/* 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)) {
		WARN("Failed to reserve memory: 0x%lx - 0x%lx\n",
			image_base, image_base + image_size);
258
259
260
		dump_load_info(image_base, image_size, mem_layout);
		io_result = -ENOMEM;
		goto exit;
261
262
263
	}

	/* We have enough space so load the image now */
264
	/* TODO: Consider whether to try to recover/retry a partially successful read */
265
	io_result = io_read(image_handle, image_base, image_size, &bytes_read);
266
	if ((io_result != IO_SUCCESS) || (bytes_read < image_size)) {
267
		WARN("Failed to load image id=%u (%i)\n", image_id, io_result);
268
		goto exit;
269
270
	}

271
272
273
274
	/*
	 * Update the memory usage info.
	 * This is done after the actual loading so that it is not updated when
	 * the load is unsuccessful.
275
276
	 * If the caller does not provide an entry point, bypass the memory
	 * reservation.
277
	 */
278
279
280
281
282
283
284
	if (entry_point_info != NULL) {
		reserve_mem(&mem_layout->free_base, &mem_layout->free_size,
				image_base, image_size);
	} else {
		INFO("Skip reserving memory: 0x%lx - 0x%lx\n",
				image_base, image_base + image_size);
	}
285

286
287
288
	image_data->image_base = image_base;
	image_data->image_size = image_size;

289
290
	if (entry_point_info != NULL)
		entry_point_info->pc = image_base;
291

292
	/*
293
294
	 * File has been successfully loaded.
	 * Flush the image in TZRAM so that the next EL can see it.
295
	 */
296
	flush_dcache_range(image_base, image_size);
297

298
	INFO("Image id=%u loaded: 0x%lx - 0x%lx\n", image_id, image_base,
299
	     image_base + image_size);
300
301

exit:
302
	io_close(image_handle);
303
304
305
	/* Ignore improbable/unrecoverable error in 'close' */

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

309
	return io_result;
310
}