Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 1 | /* |
Dan Handley | e83b0ca | 2014-01-14 18:17:09 +0000 | [diff] [blame] | 2 | * Copyright (c) 2013-2014, ARM Limited and Contributors. All rights reserved. |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 3 | * |
| 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 Handley | 2bd4ef2 | 2014-04-09 13:14:54 +0100 | [diff] [blame] | 31 | #include <arch.h> |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 32 | #include <arch_helpers.h> |
Dan Handley | 2bd4ef2 | 2014-04-09 13:14:54 +0100 | [diff] [blame] | 33 | #include <assert.h> |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 34 | #include <bl_common.h> |
Dan Handley | 714a0d2 | 2014-04-09 13:13:04 +0100 | [diff] [blame] | 35 | #include <debug.h> |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 36 | #include <errno.h> |
Dan Handley | 2bd4ef2 | 2014-04-09 13:14:54 +0100 | [diff] [blame] | 37 | #include <io_storage.h> |
| 38 | #include <platform.h> |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 39 | |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 40 | unsigned 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 | |
| 54 | static 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 | |
| 60 | void change_security_state(unsigned int target_security_state) |
| 61 | { |
| 62 | unsigned long scr = read_scr(); |
| 63 | |
Juan Castillo | f558cac | 2014-06-05 09:45:36 +0100 | [diff] [blame] | 64 | assert(sec_state_is_valid(target_security_state)); |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 65 | if (target_security_state == SECURE) |
| 66 | scr &= ~SCR_NS_BIT; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 67 | else |
Juan Castillo | f558cac | 2014-06-05 09:45:36 +0100 | [diff] [blame] | 68 | scr |= SCR_NS_BIT; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 69 | |
| 70 | write_scr(scr); |
| 71 | } |
| 72 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 73 | /****************************************************************************** |
| 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 | *****************************************************************************/ |
| 78 | static int is_mem_free(uint64_t free_base, size_t free_size, |
| 79 | uint64_t addr, size_t size) |
| 80 | { |
| 81 | return (addr >= free_base) && (addr + size <= free_base + free_size); |
| 82 | } |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 83 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 84 | /****************************************************************************** |
| 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 | *****************************************************************************/ |
| 90 | static 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) |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 93 | { |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 94 | size_t top_chunk_size, bottom_chunk_size; |
| 95 | |
| 96 | assert(mem_start <= submem_start); |
| 97 | assert(submem_start <= submem_end); |
| 98 | assert(submem_end <= mem_end); |
| 99 | assert(small_chunk_size != NULL); |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 100 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 101 | top_chunk_size = mem_end - submem_end; |
| 102 | bottom_chunk_size = submem_start - mem_start; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 103 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 104 | if (top_chunk_size < bottom_chunk_size) { |
| 105 | *small_chunk_size = top_chunk_size; |
| 106 | return TOP; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 107 | } else { |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 108 | *small_chunk_size = bottom_chunk_size; |
| 109 | return BOTTOM; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 110 | } |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 111 | } |
| 112 | |
| 113 | /****************************************************************************** |
| 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 | *****************************************************************************/ |
| 119 | void 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 Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 125 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 126 | assert(free_base != NULL); |
| 127 | assert(free_size != NULL); |
| 128 | assert(is_mem_free(*free_base, *free_size, addr, size)); |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 129 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 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 | |
Dan Handley | 91b624e | 2014-07-29 17:14:00 +0100 | [diff] [blame] | 140 | VERBOSE("Reserved %u bytes (discarded %u bytes %s)\n", |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 141 | reserved_size, discard_size, |
| 142 | pos == TOP ? "above" : "below"); |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 143 | } |
| 144 | |
| 145 | static void dump_load_info(unsigned long image_load_addr, |
| 146 | unsigned long image_size, |
Dan Handley | e2712bc | 2014-04-10 15:37:22 +0100 | [diff] [blame] | 147 | const meminfo_t *mem_layout) |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 148 | { |
Dan Handley | 91b624e | 2014-07-29 17:14:00 +0100 | [diff] [blame] | 149 | INFO("Trying to load image at address 0x%lx, size = 0x%lx\n", |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 150 | image_load_addr, image_size); |
Dan Handley | 91b624e | 2014-07-29 17:14:00 +0100 | [diff] [blame] | 151 | INFO("Current memory layout:\n"); |
| 152 | INFO(" total region = [0x%lx, 0x%lx]\n", mem_layout->total_base, |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 153 | mem_layout->total_base + mem_layout->total_size); |
Dan Handley | 91b624e | 2014-07-29 17:14:00 +0100 | [diff] [blame] | 154 | INFO(" free region = [0x%lx, 0x%lx]\n", mem_layout->free_base, |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 155 | mem_layout->free_base + mem_layout->free_size); |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 156 | } |
| 157 | |
Ryan Harkin | 87274c4 | 2014-02-04 11:43:57 +0000 | [diff] [blame] | 158 | /* Generic function to return the size of an image */ |
| 159 | unsigned long image_size(const char *image_name) |
| 160 | { |
Dan Handley | a4cb68e | 2014-04-23 13:47:06 +0100 | [diff] [blame] | 161 | uintptr_t dev_handle; |
| 162 | uintptr_t image_handle; |
| 163 | uintptr_t image_spec; |
Ryan Harkin | 87274c4 | 2014-02-04 11:43:57 +0000 | [diff] [blame] | 164 | size_t image_size = 0; |
| 165 | int io_result = IO_FAIL; |
| 166 | |
| 167 | assert(image_name != NULL); |
| 168 | |
| 169 | /* Obtain a reference to the image by querying the platform layer */ |
| 170 | io_result = plat_get_image_source(image_name, &dev_handle, &image_spec); |
| 171 | if (io_result != IO_SUCCESS) { |
| 172 | WARN("Failed to obtain reference to image '%s' (%i)\n", |
| 173 | image_name, io_result); |
| 174 | return 0; |
| 175 | } |
| 176 | |
| 177 | /* Attempt to access the image */ |
| 178 | io_result = io_open(dev_handle, image_spec, &image_handle); |
| 179 | if (io_result != IO_SUCCESS) { |
| 180 | WARN("Failed to access image '%s' (%i)\n", |
| 181 | image_name, io_result); |
| 182 | return 0; |
| 183 | } |
| 184 | |
| 185 | /* Find the size of the image */ |
| 186 | io_result = io_size(image_handle, &image_size); |
| 187 | if ((io_result != IO_SUCCESS) || (image_size == 0)) { |
| 188 | WARN("Failed to determine the size of the image '%s' file (%i)\n", |
| 189 | image_name, io_result); |
| 190 | } |
| 191 | io_result = io_close(image_handle); |
| 192 | /* Ignore improbable/unrecoverable error in 'close' */ |
| 193 | |
| 194 | /* TODO: Consider maintaining open device connection from this |
| 195 | * bootloader stage |
| 196 | */ |
| 197 | io_result = io_dev_close(dev_handle); |
| 198 | /* Ignore improbable/unrecoverable error in 'dev_close' */ |
| 199 | |
| 200 | return image_size; |
| 201 | } |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 202 | |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 203 | /******************************************************************************* |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 204 | * Generic function to load an image at a specific address given a name and |
| 205 | * extents of free memory. It updates the memory layout if the load is |
| 206 | * successful, as well as the image information and the entry point information. |
| 207 | * The caller might pass a NULL pointer for the entry point if it is not |
| 208 | * interested in this information, e.g. because the image just needs to be |
| 209 | * loaded in memory but won't ever be executed. |
| 210 | * Returns 0 on success, a negative error code otherwise. |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 211 | ******************************************************************************/ |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 212 | int load_image(meminfo_t *mem_layout, |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 213 | const char *image_name, |
| 214 | uint64_t image_base, |
| 215 | image_info_t *image_data, |
| 216 | entry_point_info_t *entry_point_info) |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 217 | { |
Dan Handley | a4cb68e | 2014-04-23 13:47:06 +0100 | [diff] [blame] | 218 | uintptr_t dev_handle; |
| 219 | uintptr_t image_handle; |
| 220 | uintptr_t image_spec; |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 221 | size_t image_size; |
| 222 | size_t bytes_read; |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 223 | int io_result = IO_FAIL; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 224 | |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 225 | assert(mem_layout != NULL); |
| 226 | assert(image_name != NULL); |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 227 | assert(image_data != NULL); |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 228 | assert(image_data->h.version >= VERSION_1); |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 229 | |
| 230 | /* Obtain a reference to the image by querying the platform layer */ |
| 231 | io_result = plat_get_image_source(image_name, &dev_handle, &image_spec); |
| 232 | if (io_result != IO_SUCCESS) { |
Jeenu Viswambharan | 08c28d5 | 2014-02-20 12:03:31 +0000 | [diff] [blame] | 233 | WARN("Failed to obtain reference to image '%s' (%i)\n", |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 234 | image_name, io_result); |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 235 | return io_result; |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 236 | } |
| 237 | |
| 238 | /* Attempt to access the image */ |
| 239 | io_result = io_open(dev_handle, image_spec, &image_handle); |
| 240 | if (io_result != IO_SUCCESS) { |
Jeenu Viswambharan | 08c28d5 | 2014-02-20 12:03:31 +0000 | [diff] [blame] | 241 | WARN("Failed to access image '%s' (%i)\n", |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 242 | image_name, io_result); |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 243 | return io_result; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 244 | } |
| 245 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 246 | INFO("Loading file '%s' at address 0x%lx\n", image_name, image_base); |
| 247 | |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 248 | /* Find the size of the image */ |
| 249 | io_result = io_size(image_handle, &image_size); |
| 250 | if ((io_result != IO_SUCCESS) || (image_size == 0)) { |
Jeenu Viswambharan | 08c28d5 | 2014-02-20 12:03:31 +0000 | [diff] [blame] | 251 | WARN("Failed to determine the size of the image '%s' file (%i)\n", |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 252 | image_name, io_result); |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 253 | goto exit; |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 254 | } |
| 255 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 256 | /* Check that the memory where the image will be loaded is free */ |
| 257 | if (!is_mem_free(mem_layout->free_base, mem_layout->free_size, |
| 258 | image_base, image_size)) { |
| 259 | WARN("Failed to reserve memory: 0x%lx - 0x%lx\n", |
| 260 | image_base, image_base + image_size); |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 261 | dump_load_info(image_base, image_size, mem_layout); |
| 262 | io_result = -ENOMEM; |
| 263 | goto exit; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 264 | } |
| 265 | |
| 266 | /* We have enough space so load the image now */ |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 267 | /* TODO: Consider whether to try to recover/retry a partially successful read */ |
Dan Handley | a4cb68e | 2014-04-23 13:47:06 +0100 | [diff] [blame] | 268 | io_result = io_read(image_handle, image_base, image_size, &bytes_read); |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 269 | if ((io_result != IO_SUCCESS) || (bytes_read < image_size)) { |
Jeenu Viswambharan | 08c28d5 | 2014-02-20 12:03:31 +0000 | [diff] [blame] | 270 | WARN("Failed to load '%s' file (%i)\n", image_name, io_result); |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 271 | goto exit; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 272 | } |
| 273 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 274 | /* |
| 275 | * Update the memory usage info. |
| 276 | * This is done after the actual loading so that it is not updated when |
| 277 | * the load is unsuccessful. |
| 278 | */ |
| 279 | reserve_mem(&mem_layout->free_base, &mem_layout->free_size, |
| 280 | image_base, image_size); |
| 281 | |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 282 | image_data->image_base = image_base; |
| 283 | image_data->image_size = image_size; |
| 284 | |
Sandrine Bailleux | 3ab33f3 | 2014-05-28 11:31:18 +0100 | [diff] [blame] | 285 | if (entry_point_info != NULL) |
| 286 | entry_point_info->pc = image_base; |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 287 | |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 288 | /* |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 289 | * File has been successfully loaded. |
| 290 | * Flush the image in TZRAM so that the next EL can see it. |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 291 | */ |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 292 | flush_dcache_range(image_base, image_size); |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 293 | |
Sandrine Bailleux | 467d057 | 2014-06-24 14:02:34 +0100 | [diff] [blame] | 294 | INFO("File '%s' loaded: 0x%lx - 0x%lx\n", image_name, image_base, |
| 295 | image_base + image_size); |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 296 | |
| 297 | exit: |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 298 | io_close(image_handle); |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 299 | /* Ignore improbable/unrecoverable error in 'close' */ |
| 300 | |
| 301 | /* TODO: Consider maintaining open device connection from this bootloader stage */ |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 302 | io_dev_close(dev_handle); |
James Morrissey | 9d72b4e | 2014-02-10 17:04:32 +0000 | [diff] [blame] | 303 | /* Ignore improbable/unrecoverable error in 'dev_close' */ |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 304 | |
Vikram Kanigiri | da56743 | 2014-04-15 18:08:08 +0100 | [diff] [blame] | 305 | return io_result; |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 306 | } |