efi_memory.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475
  1. /*
  2. * EFI application memory management
  3. *
  4. * Copyright (c) 2016 Alexander Graf
  5. *
  6. * SPDX-License-Identifier: GPL-2.0+
  7. */
  8. #include <common.h>
  9. #include <efi_loader.h>
  10. #include <malloc.h>
  11. #include <asm/global_data.h>
  12. #include <libfdt_env.h>
  13. #include <linux/list_sort.h>
  14. #include <inttypes.h>
  15. #include <watchdog.h>
  16. DECLARE_GLOBAL_DATA_PTR;
  17. struct efi_mem_list {
  18. struct list_head link;
  19. struct efi_mem_desc desc;
  20. };
  21. #define EFI_CARVE_NO_OVERLAP -1
  22. #define EFI_CARVE_LOOP_AGAIN -2
  23. #define EFI_CARVE_OVERLAPS_NONRAM -3
  24. /* This list contains all memory map items */
  25. LIST_HEAD(efi_mem);
  26. #ifdef CONFIG_EFI_LOADER_BOUNCE_BUFFER
  27. void *efi_bounce_buffer;
  28. #endif
  29. /*
  30. * U-Boot services each EFI AllocatePool request as a separate
  31. * (multiple) page allocation. We have to track the number of pages
  32. * to be able to free the correct amount later.
  33. * EFI requires 8 byte alignment for pool allocations, so we can
  34. * prepend each allocation with an 64 bit header tracking the
  35. * allocation size, and hand out the remainder to the caller.
  36. */
  37. struct efi_pool_allocation {
  38. u64 num_pages;
  39. char data[];
  40. };
  41. /*
  42. * Sorts the memory list from highest address to lowest address
  43. *
  44. * When allocating memory we should always start from the highest
  45. * address chunk, so sort the memory list such that the first list
  46. * iterator gets the highest address and goes lower from there.
  47. */
  48. static int efi_mem_cmp(void *priv, struct list_head *a, struct list_head *b)
  49. {
  50. struct efi_mem_list *mema = list_entry(a, struct efi_mem_list, link);
  51. struct efi_mem_list *memb = list_entry(b, struct efi_mem_list, link);
  52. if (mema->desc.physical_start == memb->desc.physical_start)
  53. return 0;
  54. else if (mema->desc.physical_start < memb->desc.physical_start)
  55. return 1;
  56. else
  57. return -1;
  58. }
  59. static void efi_mem_sort(void)
  60. {
  61. list_sort(NULL, &efi_mem, efi_mem_cmp);
  62. }
  63. /*
  64. * Unmaps all memory occupied by the carve_desc region from the
  65. * list entry pointed to by map.
  66. *
  67. * Returns EFI_CARVE_NO_OVERLAP if the regions don't overlap.
  68. * Returns EFI_CARVE_OVERLAPS_NONRAM if the carve and map overlap,
  69. * and the map contains anything but free ram.
  70. * (only when overlap_only_ram is true)
  71. * Returns EFI_CARVE_LOOP_AGAIN if the mapping list should be traversed
  72. * again, as it has been altered
  73. * Returns the number of overlapping pages. The pages are removed from
  74. * the mapping list.
  75. *
  76. * In case of EFI_CARVE_OVERLAPS_NONRAM it is the callers responsibility
  77. * to readd the already carved out pages to the mapping.
  78. */
  79. static int efi_mem_carve_out(struct efi_mem_list *map,
  80. struct efi_mem_desc *carve_desc,
  81. bool overlap_only_ram)
  82. {
  83. struct efi_mem_list *newmap;
  84. struct efi_mem_desc *map_desc = &map->desc;
  85. uint64_t map_start = map_desc->physical_start;
  86. uint64_t map_end = map_start + (map_desc->num_pages << EFI_PAGE_SHIFT);
  87. uint64_t carve_start = carve_desc->physical_start;
  88. uint64_t carve_end = carve_start +
  89. (carve_desc->num_pages << EFI_PAGE_SHIFT);
  90. /* check whether we're overlapping */
  91. if ((carve_end <= map_start) || (carve_start >= map_end))
  92. return EFI_CARVE_NO_OVERLAP;
  93. /* We're overlapping with non-RAM, warn the caller if desired */
  94. if (overlap_only_ram && (map_desc->type != EFI_CONVENTIONAL_MEMORY))
  95. return EFI_CARVE_OVERLAPS_NONRAM;
  96. /* Sanitize carve_start and carve_end to lie within our bounds */
  97. carve_start = max(carve_start, map_start);
  98. carve_end = min(carve_end, map_end);
  99. /* Carving at the beginning of our map? Just move it! */
  100. if (carve_start == map_start) {
  101. if (map_end == carve_end) {
  102. /* Full overlap, just remove map */
  103. list_del(&map->link);
  104. }
  105. map_desc->physical_start = carve_end;
  106. map_desc->num_pages = (map_end - carve_end) >> EFI_PAGE_SHIFT;
  107. return (carve_end - carve_start) >> EFI_PAGE_SHIFT;
  108. }
  109. /*
  110. * Overlapping maps, just split the list map at carve_start,
  111. * it will get moved or removed in the next iteration.
  112. *
  113. * [ map_desc |__carve_start__| newmap ]
  114. */
  115. /* Create a new map from [ carve_start ... map_end ] */
  116. newmap = calloc(1, sizeof(*newmap));
  117. newmap->desc = map->desc;
  118. newmap->desc.physical_start = carve_start;
  119. newmap->desc.num_pages = (map_end - carve_start) >> EFI_PAGE_SHIFT;
  120. /* Insert before current entry (descending address order) */
  121. list_add_tail(&newmap->link, &map->link);
  122. /* Shrink the map to [ map_start ... carve_start ] */
  123. map_desc->num_pages = (carve_start - map_start) >> EFI_PAGE_SHIFT;
  124. return EFI_CARVE_LOOP_AGAIN;
  125. }
  126. uint64_t efi_add_memory_map(uint64_t start, uint64_t pages, int memory_type,
  127. bool overlap_only_ram)
  128. {
  129. struct list_head *lhandle;
  130. struct efi_mem_list *newlist;
  131. bool carve_again;
  132. uint64_t carved_pages = 0;
  133. debug("%s: 0x%" PRIx64 " 0x%" PRIx64 " %d %s\n", __func__,
  134. start, pages, memory_type, overlap_only_ram ? "yes" : "no");
  135. if (!pages)
  136. return start;
  137. newlist = calloc(1, sizeof(*newlist));
  138. newlist->desc.type = memory_type;
  139. newlist->desc.physical_start = start;
  140. newlist->desc.virtual_start = start;
  141. newlist->desc.num_pages = pages;
  142. switch (memory_type) {
  143. case EFI_RUNTIME_SERVICES_CODE:
  144. case EFI_RUNTIME_SERVICES_DATA:
  145. newlist->desc.attribute = (1 << EFI_MEMORY_WB_SHIFT) |
  146. (1ULL << EFI_MEMORY_RUNTIME_SHIFT);
  147. break;
  148. case EFI_MMAP_IO:
  149. newlist->desc.attribute = 1ULL << EFI_MEMORY_RUNTIME_SHIFT;
  150. break;
  151. default:
  152. newlist->desc.attribute = 1 << EFI_MEMORY_WB_SHIFT;
  153. break;
  154. }
  155. /* Add our new map */
  156. do {
  157. carve_again = false;
  158. list_for_each(lhandle, &efi_mem) {
  159. struct efi_mem_list *lmem;
  160. int r;
  161. lmem = list_entry(lhandle, struct efi_mem_list, link);
  162. r = efi_mem_carve_out(lmem, &newlist->desc,
  163. overlap_only_ram);
  164. switch (r) {
  165. case EFI_CARVE_OVERLAPS_NONRAM:
  166. /*
  167. * The user requested to only have RAM overlaps,
  168. * but we hit a non-RAM region. Error out.
  169. */
  170. return 0;
  171. case EFI_CARVE_NO_OVERLAP:
  172. /* Just ignore this list entry */
  173. break;
  174. case EFI_CARVE_LOOP_AGAIN:
  175. /*
  176. * We split an entry, but need to loop through
  177. * the list again to actually carve it.
  178. */
  179. carve_again = true;
  180. break;
  181. default:
  182. /* We carved a number of pages */
  183. carved_pages += r;
  184. carve_again = true;
  185. break;
  186. }
  187. if (carve_again) {
  188. /* The list changed, we need to start over */
  189. break;
  190. }
  191. }
  192. } while (carve_again);
  193. if (overlap_only_ram && (carved_pages != pages)) {
  194. /*
  195. * The payload wanted to have RAM overlaps, but we overlapped
  196. * with an unallocated region. Error out.
  197. */
  198. return 0;
  199. }
  200. /* Add our new map */
  201. list_add_tail(&newlist->link, &efi_mem);
  202. /* And make sure memory is listed in descending order */
  203. efi_mem_sort();
  204. return start;
  205. }
  206. static uint64_t efi_find_free_memory(uint64_t len, uint64_t max_addr)
  207. {
  208. struct list_head *lhandle;
  209. list_for_each(lhandle, &efi_mem) {
  210. struct efi_mem_list *lmem = list_entry(lhandle,
  211. struct efi_mem_list, link);
  212. struct efi_mem_desc *desc = &lmem->desc;
  213. uint64_t desc_len = desc->num_pages << EFI_PAGE_SHIFT;
  214. uint64_t desc_end = desc->physical_start + desc_len;
  215. uint64_t curmax = min(max_addr, desc_end);
  216. uint64_t ret = curmax - len;
  217. /* We only take memory from free RAM */
  218. if (desc->type != EFI_CONVENTIONAL_MEMORY)
  219. continue;
  220. /* Out of bounds for max_addr */
  221. if ((ret + len) > max_addr)
  222. continue;
  223. /* Out of bounds for upper map limit */
  224. if ((ret + len) > desc_end)
  225. continue;
  226. /* Out of bounds for lower map limit */
  227. if (ret < desc->physical_start)
  228. continue;
  229. /* Return the highest address in this map within bounds */
  230. return ret;
  231. }
  232. return 0;
  233. }
  234. efi_status_t efi_allocate_pages(int type, int memory_type,
  235. unsigned long pages, uint64_t *memory)
  236. {
  237. u64 len = pages << EFI_PAGE_SHIFT;
  238. efi_status_t r = EFI_SUCCESS;
  239. uint64_t addr;
  240. switch (type) {
  241. case 0:
  242. /* Any page */
  243. addr = efi_find_free_memory(len, gd->start_addr_sp);
  244. if (!addr) {
  245. r = EFI_NOT_FOUND;
  246. break;
  247. }
  248. break;
  249. case 1:
  250. /* Max address */
  251. addr = efi_find_free_memory(len, *memory);
  252. if (!addr) {
  253. r = EFI_NOT_FOUND;
  254. break;
  255. }
  256. break;
  257. case 2:
  258. /* Exact address, reserve it. The addr is already in *memory. */
  259. addr = *memory;
  260. break;
  261. default:
  262. /* UEFI doesn't specify other allocation types */
  263. r = EFI_INVALID_PARAMETER;
  264. break;
  265. }
  266. if (r == EFI_SUCCESS) {
  267. uint64_t ret;
  268. /* Reserve that map in our memory maps */
  269. ret = efi_add_memory_map(addr, pages, memory_type, true);
  270. if (ret == addr) {
  271. *memory = addr;
  272. } else {
  273. /* Map would overlap, bail out */
  274. r = EFI_OUT_OF_RESOURCES;
  275. }
  276. }
  277. return r;
  278. }
  279. void *efi_alloc(uint64_t len, int memory_type)
  280. {
  281. uint64_t ret = 0;
  282. uint64_t pages = (len + EFI_PAGE_MASK) >> EFI_PAGE_SHIFT;
  283. efi_status_t r;
  284. r = efi_allocate_pages(0, memory_type, pages, &ret);
  285. if (r == EFI_SUCCESS)
  286. return (void*)(uintptr_t)ret;
  287. return NULL;
  288. }
  289. efi_status_t efi_free_pages(uint64_t memory, unsigned long pages)
  290. {
  291. uint64_t r = 0;
  292. r = efi_add_memory_map(memory, pages, EFI_CONVENTIONAL_MEMORY, false);
  293. /* Merging of adjacent free regions is missing */
  294. if (r == memory)
  295. return EFI_SUCCESS;
  296. return EFI_NOT_FOUND;
  297. }
  298. efi_status_t efi_allocate_pool(int pool_type, unsigned long size,
  299. void **buffer)
  300. {
  301. efi_status_t r;
  302. efi_physical_addr_t t;
  303. u64 num_pages = (size + sizeof(u64) + EFI_PAGE_MASK) >> EFI_PAGE_SHIFT;
  304. if (size == 0) {
  305. *buffer = NULL;
  306. return EFI_SUCCESS;
  307. }
  308. r = efi_allocate_pages(0, pool_type, num_pages, &t);
  309. if (r == EFI_SUCCESS) {
  310. struct efi_pool_allocation *alloc = (void *)(uintptr_t)t;
  311. alloc->num_pages = num_pages;
  312. *buffer = alloc->data;
  313. }
  314. return r;
  315. }
  316. efi_status_t efi_free_pool(void *buffer)
  317. {
  318. efi_status_t r;
  319. struct efi_pool_allocation *alloc;
  320. alloc = container_of(buffer, struct efi_pool_allocation, data);
  321. /* Sanity check, was the supplied address returned by allocate_pool */
  322. assert(((uintptr_t)alloc & EFI_PAGE_MASK) == 0);
  323. r = efi_free_pages((uintptr_t)alloc, alloc->num_pages);
  324. return r;
  325. }
  326. efi_status_t efi_get_memory_map(unsigned long *memory_map_size,
  327. struct efi_mem_desc *memory_map,
  328. unsigned long *map_key,
  329. unsigned long *descriptor_size,
  330. uint32_t *descriptor_version)
  331. {
  332. ulong map_size = 0;
  333. int map_entries = 0;
  334. struct list_head *lhandle;
  335. unsigned long provided_map_size = *memory_map_size;
  336. list_for_each(lhandle, &efi_mem)
  337. map_entries++;
  338. map_size = map_entries * sizeof(struct efi_mem_desc);
  339. *memory_map_size = map_size;
  340. if (descriptor_size)
  341. *descriptor_size = sizeof(struct efi_mem_desc);
  342. if (descriptor_version)
  343. *descriptor_version = EFI_MEMORY_DESCRIPTOR_VERSION;
  344. if (provided_map_size < map_size)
  345. return EFI_BUFFER_TOO_SMALL;
  346. /* Copy list into array */
  347. if (memory_map) {
  348. /* Return the list in ascending order */
  349. memory_map = &memory_map[map_entries - 1];
  350. list_for_each(lhandle, &efi_mem) {
  351. struct efi_mem_list *lmem;
  352. lmem = list_entry(lhandle, struct efi_mem_list, link);
  353. *memory_map = lmem->desc;
  354. memory_map--;
  355. }
  356. }
  357. return EFI_SUCCESS;
  358. }
  359. int efi_memory_init(void)
  360. {
  361. unsigned long runtime_start, runtime_end, runtime_pages;
  362. unsigned long uboot_start, uboot_pages;
  363. unsigned long uboot_stack_size = 16 * 1024 * 1024;
  364. int i;
  365. /* Add RAM */
  366. for (i = 0; i < CONFIG_NR_DRAM_BANKS; i++) {
  367. u64 ram_start = gd->bd->bi_dram[i].start;
  368. u64 ram_size = gd->bd->bi_dram[i].size;
  369. u64 start = (ram_start + EFI_PAGE_MASK) & ~EFI_PAGE_MASK;
  370. u64 pages = (ram_size + EFI_PAGE_MASK) >> EFI_PAGE_SHIFT;
  371. efi_add_memory_map(start, pages, EFI_CONVENTIONAL_MEMORY,
  372. false);
  373. }
  374. /* Add U-Boot */
  375. uboot_start = (gd->start_addr_sp - uboot_stack_size) & ~EFI_PAGE_MASK;
  376. uboot_pages = (gd->ram_top - uboot_start) >> EFI_PAGE_SHIFT;
  377. efi_add_memory_map(uboot_start, uboot_pages, EFI_LOADER_DATA, false);
  378. /* Add Runtime Services */
  379. runtime_start = (ulong)&__efi_runtime_start & ~EFI_PAGE_MASK;
  380. runtime_end = (ulong)&__efi_runtime_stop;
  381. runtime_end = (runtime_end + EFI_PAGE_MASK) & ~EFI_PAGE_MASK;
  382. runtime_pages = (runtime_end - runtime_start) >> EFI_PAGE_SHIFT;
  383. efi_add_memory_map(runtime_start, runtime_pages,
  384. EFI_RUNTIME_SERVICES_CODE, false);
  385. #ifdef CONFIG_EFI_LOADER_BOUNCE_BUFFER
  386. /* Request a 32bit 64MB bounce buffer region */
  387. uint64_t efi_bounce_buffer_addr = 0xffffffff;
  388. if (efi_allocate_pages(1, EFI_LOADER_DATA,
  389. (64 * 1024 * 1024) >> EFI_PAGE_SHIFT,
  390. &efi_bounce_buffer_addr) != EFI_SUCCESS)
  391. return -1;
  392. efi_bounce_buffer = (void*)(uintptr_t)efi_bounce_buffer_addr;
  393. #endif
  394. return 0;
  395. }