lmb.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * Procedures for maintaining information about logical memory blocks.
  4. *
  5. * Peter Bergner, IBM Corp. June 2001.
  6. * Copyright (C) 2001 Peter Bergner.
  7. */
  8. #include <common.h>
  9. #include <image.h>
  10. #include <lmb.h>
  11. #include <log.h>
  12. #include <malloc.h>
  13. #include <asm/global_data.h>
  14. #include <asm/sections.h>
  15. DECLARE_GLOBAL_DATA_PTR;
  16. #define LMB_ALLOC_ANYWHERE 0
  17. static void lmb_dump_region(struct lmb_region *rgn, char *name)
  18. {
  19. unsigned long long base, size, end;
  20. enum lmb_flags flags;
  21. int i;
  22. printf(" %s.cnt = 0x%lx\n", name, rgn->cnt);
  23. for (i = 0; i < rgn->cnt; i++) {
  24. base = rgn->region[i].base;
  25. size = rgn->region[i].size;
  26. end = base + size - 1;
  27. flags = rgn->region[i].flags;
  28. printf(" %s[%d]\t[0x%llx-0x%llx], 0x%08llx bytes flags: %x\n",
  29. name, i, base, end, size, flags);
  30. }
  31. }
  32. void lmb_dump_all_force(struct lmb *lmb)
  33. {
  34. printf("lmb_dump_all:\n");
  35. lmb_dump_region(&lmb->memory, "memory");
  36. lmb_dump_region(&lmb->reserved, "reserved");
  37. }
  38. void lmb_dump_all(struct lmb *lmb)
  39. {
  40. #ifdef DEBUG
  41. lmb_dump_all_force(lmb);
  42. #endif
  43. }
  44. static long lmb_addrs_overlap(phys_addr_t base1, phys_size_t size1,
  45. phys_addr_t base2, phys_size_t size2)
  46. {
  47. const phys_addr_t base1_end = base1 + size1 - 1;
  48. const phys_addr_t base2_end = base2 + size2 - 1;
  49. return ((base1 <= base2_end) && (base2 <= base1_end));
  50. }
  51. static long lmb_addrs_adjacent(phys_addr_t base1, phys_size_t size1,
  52. phys_addr_t base2, phys_size_t size2)
  53. {
  54. if (base2 == base1 + size1)
  55. return 1;
  56. else if (base1 == base2 + size2)
  57. return -1;
  58. return 0;
  59. }
  60. static long lmb_regions_adjacent(struct lmb_region *rgn, unsigned long r1,
  61. unsigned long r2)
  62. {
  63. phys_addr_t base1 = rgn->region[r1].base;
  64. phys_size_t size1 = rgn->region[r1].size;
  65. phys_addr_t base2 = rgn->region[r2].base;
  66. phys_size_t size2 = rgn->region[r2].size;
  67. return lmb_addrs_adjacent(base1, size1, base2, size2);
  68. }
  69. static void lmb_remove_region(struct lmb_region *rgn, unsigned long r)
  70. {
  71. unsigned long i;
  72. for (i = r; i < rgn->cnt - 1; i++) {
  73. rgn->region[i].base = rgn->region[i + 1].base;
  74. rgn->region[i].size = rgn->region[i + 1].size;
  75. rgn->region[i].flags = rgn->region[i + 1].flags;
  76. }
  77. rgn->cnt--;
  78. }
  79. /* Assumption: base addr of region 1 < base addr of region 2 */
  80. static void lmb_coalesce_regions(struct lmb_region *rgn, unsigned long r1,
  81. unsigned long r2)
  82. {
  83. rgn->region[r1].size += rgn->region[r2].size;
  84. lmb_remove_region(rgn, r2);
  85. }
  86. void lmb_init(struct lmb *lmb)
  87. {
  88. #if IS_ENABLED(CONFIG_LMB_USE_MAX_REGIONS)
  89. lmb->memory.max = CONFIG_LMB_MAX_REGIONS;
  90. lmb->reserved.max = CONFIG_LMB_MAX_REGIONS;
  91. #else
  92. lmb->memory.max = CONFIG_LMB_MEMORY_REGIONS;
  93. lmb->reserved.max = CONFIG_LMB_RESERVED_REGIONS;
  94. lmb->memory.region = lmb->memory_regions;
  95. lmb->reserved.region = lmb->reserved_regions;
  96. #endif
  97. lmb->memory.cnt = 0;
  98. lmb->reserved.cnt = 0;
  99. }
  100. void arch_lmb_reserve_generic(struct lmb *lmb, ulong sp, ulong end, ulong align)
  101. {
  102. ulong bank_end;
  103. int bank;
  104. /*
  105. * Reserve memory from aligned address below the bottom of U-Boot stack
  106. * until end of U-Boot area using LMB to prevent U-Boot from overwriting
  107. * that memory.
  108. */
  109. debug("## Current stack ends at 0x%08lx ", sp);
  110. /* adjust sp by 4K to be safe */
  111. sp -= align;
  112. for (bank = 0; bank < CONFIG_NR_DRAM_BANKS; bank++) {
  113. if (!gd->bd->bi_dram[bank].size ||
  114. sp < gd->bd->bi_dram[bank].start)
  115. continue;
  116. /* Watch out for RAM at end of address space! */
  117. bank_end = gd->bd->bi_dram[bank].start +
  118. gd->bd->bi_dram[bank].size - 1;
  119. if (sp > bank_end)
  120. continue;
  121. if (bank_end > end)
  122. bank_end = end - 1;
  123. lmb_reserve(lmb, sp, bank_end - sp + 1);
  124. if (gd->flags & GD_FLG_SKIP_RELOC)
  125. lmb_reserve(lmb, (phys_addr_t)(uintptr_t)_start, gd->mon_len);
  126. break;
  127. }
  128. }
  129. static void lmb_reserve_common(struct lmb *lmb, void *fdt_blob)
  130. {
  131. arch_lmb_reserve(lmb);
  132. board_lmb_reserve(lmb);
  133. if (CONFIG_IS_ENABLED(OF_LIBFDT) && fdt_blob)
  134. boot_fdt_add_mem_rsv_regions(lmb, fdt_blob);
  135. }
  136. /* Initialize the struct, add memory and call arch/board reserve functions */
  137. void lmb_init_and_reserve(struct lmb *lmb, struct bd_info *bd, void *fdt_blob)
  138. {
  139. int i;
  140. lmb_init(lmb);
  141. for (i = 0; i < CONFIG_NR_DRAM_BANKS; i++) {
  142. if (bd->bi_dram[i].size) {
  143. lmb_add(lmb, bd->bi_dram[i].start,
  144. bd->bi_dram[i].size);
  145. }
  146. }
  147. lmb_reserve_common(lmb, fdt_blob);
  148. }
  149. /* Initialize the struct, add memory and call arch/board reserve functions */
  150. void lmb_init_and_reserve_range(struct lmb *lmb, phys_addr_t base,
  151. phys_size_t size, void *fdt_blob)
  152. {
  153. lmb_init(lmb);
  154. lmb_add(lmb, base, size);
  155. lmb_reserve_common(lmb, fdt_blob);
  156. }
  157. /* This routine called with relocation disabled. */
  158. static long lmb_add_region_flags(struct lmb_region *rgn, phys_addr_t base,
  159. phys_size_t size, enum lmb_flags flags)
  160. {
  161. unsigned long coalesced = 0;
  162. long adjacent, i;
  163. if (rgn->cnt == 0) {
  164. rgn->region[0].base = base;
  165. rgn->region[0].size = size;
  166. rgn->region[0].flags = flags;
  167. rgn->cnt = 1;
  168. return 0;
  169. }
  170. /* First try and coalesce this LMB with another. */
  171. for (i = 0; i < rgn->cnt; i++) {
  172. phys_addr_t rgnbase = rgn->region[i].base;
  173. phys_size_t rgnsize = rgn->region[i].size;
  174. phys_size_t rgnflags = rgn->region[i].flags;
  175. if (rgnbase == base && rgnsize == size) {
  176. if (flags == rgnflags)
  177. /* Already have this region, so we're done */
  178. return 0;
  179. else
  180. return -1; /* regions with new flags */
  181. }
  182. adjacent = lmb_addrs_adjacent(base, size, rgnbase, rgnsize);
  183. if (adjacent > 0) {
  184. if (flags != rgnflags)
  185. break;
  186. rgn->region[i].base -= size;
  187. rgn->region[i].size += size;
  188. coalesced++;
  189. break;
  190. } else if (adjacent < 0) {
  191. if (flags != rgnflags)
  192. break;
  193. rgn->region[i].size += size;
  194. coalesced++;
  195. break;
  196. } else if (lmb_addrs_overlap(base, size, rgnbase, rgnsize)) {
  197. /* regions overlap */
  198. return -1;
  199. }
  200. }
  201. if ((i < rgn->cnt - 1) && lmb_regions_adjacent(rgn, i, i + 1)) {
  202. if (rgn->region[i].flags == rgn->region[i + 1].flags) {
  203. lmb_coalesce_regions(rgn, i, i + 1);
  204. coalesced++;
  205. }
  206. }
  207. if (coalesced)
  208. return coalesced;
  209. if (rgn->cnt >= rgn->max)
  210. return -1;
  211. /* Couldn't coalesce the LMB, so add it to the sorted table. */
  212. for (i = rgn->cnt-1; i >= 0; i--) {
  213. if (base < rgn->region[i].base) {
  214. rgn->region[i + 1].base = rgn->region[i].base;
  215. rgn->region[i + 1].size = rgn->region[i].size;
  216. rgn->region[i + 1].flags = rgn->region[i].flags;
  217. } else {
  218. rgn->region[i + 1].base = base;
  219. rgn->region[i + 1].size = size;
  220. rgn->region[i + 1].flags = flags;
  221. break;
  222. }
  223. }
  224. if (base < rgn->region[0].base) {
  225. rgn->region[0].base = base;
  226. rgn->region[0].size = size;
  227. rgn->region[0].flags = flags;
  228. }
  229. rgn->cnt++;
  230. return 0;
  231. }
  232. static long lmb_add_region(struct lmb_region *rgn, phys_addr_t base,
  233. phys_size_t size)
  234. {
  235. return lmb_add_region_flags(rgn, base, size, LMB_NONE);
  236. }
  237. /* This routine may be called with relocation disabled. */
  238. long lmb_add(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  239. {
  240. struct lmb_region *_rgn = &(lmb->memory);
  241. return lmb_add_region(_rgn, base, size);
  242. }
  243. long lmb_free(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  244. {
  245. struct lmb_region *rgn = &(lmb->reserved);
  246. phys_addr_t rgnbegin, rgnend;
  247. phys_addr_t end = base + size - 1;
  248. int i;
  249. rgnbegin = rgnend = 0; /* supress gcc warnings */
  250. /* Find the region where (base, size) belongs to */
  251. for (i = 0; i < rgn->cnt; i++) {
  252. rgnbegin = rgn->region[i].base;
  253. rgnend = rgnbegin + rgn->region[i].size - 1;
  254. if ((rgnbegin <= base) && (end <= rgnend))
  255. break;
  256. }
  257. /* Didn't find the region */
  258. if (i == rgn->cnt)
  259. return -1;
  260. /* Check to see if we are removing entire region */
  261. if ((rgnbegin == base) && (rgnend == end)) {
  262. lmb_remove_region(rgn, i);
  263. return 0;
  264. }
  265. /* Check to see if region is matching at the front */
  266. if (rgnbegin == base) {
  267. rgn->region[i].base = end + 1;
  268. rgn->region[i].size -= size;
  269. return 0;
  270. }
  271. /* Check to see if the region is matching at the end */
  272. if (rgnend == end) {
  273. rgn->region[i].size -= size;
  274. return 0;
  275. }
  276. /*
  277. * We need to split the entry - adjust the current one to the
  278. * beginging of the hole and add the region after hole.
  279. */
  280. rgn->region[i].size = base - rgn->region[i].base;
  281. return lmb_add_region_flags(rgn, end + 1, rgnend - end,
  282. rgn->region[i].flags);
  283. }
  284. long lmb_reserve_flags(struct lmb *lmb, phys_addr_t base, phys_size_t size,
  285. enum lmb_flags flags)
  286. {
  287. struct lmb_region *_rgn = &(lmb->reserved);
  288. return lmb_add_region_flags(_rgn, base, size, flags);
  289. }
  290. long lmb_reserve(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  291. {
  292. return lmb_reserve_flags(lmb, base, size, LMB_NONE);
  293. }
  294. static long lmb_overlaps_region(struct lmb_region *rgn, phys_addr_t base,
  295. phys_size_t size)
  296. {
  297. unsigned long i;
  298. for (i = 0; i < rgn->cnt; i++) {
  299. phys_addr_t rgnbase = rgn->region[i].base;
  300. phys_size_t rgnsize = rgn->region[i].size;
  301. if (lmb_addrs_overlap(base, size, rgnbase, rgnsize))
  302. break;
  303. }
  304. return (i < rgn->cnt) ? i : -1;
  305. }
  306. phys_addr_t lmb_alloc(struct lmb *lmb, phys_size_t size, ulong align)
  307. {
  308. return lmb_alloc_base(lmb, size, align, LMB_ALLOC_ANYWHERE);
  309. }
  310. phys_addr_t lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
  311. {
  312. phys_addr_t alloc;
  313. alloc = __lmb_alloc_base(lmb, size, align, max_addr);
  314. if (alloc == 0)
  315. printf("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
  316. (ulong)size, (ulong)max_addr);
  317. return alloc;
  318. }
  319. static phys_addr_t lmb_align_down(phys_addr_t addr, phys_size_t size)
  320. {
  321. return addr & ~(size - 1);
  322. }
  323. phys_addr_t __lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
  324. {
  325. long i, rgn;
  326. phys_addr_t base = 0;
  327. phys_addr_t res_base;
  328. for (i = lmb->memory.cnt - 1; i >= 0; i--) {
  329. phys_addr_t lmbbase = lmb->memory.region[i].base;
  330. phys_size_t lmbsize = lmb->memory.region[i].size;
  331. if (lmbsize < size)
  332. continue;
  333. if (max_addr == LMB_ALLOC_ANYWHERE)
  334. base = lmb_align_down(lmbbase + lmbsize - size, align);
  335. else if (lmbbase < max_addr) {
  336. base = lmbbase + lmbsize;
  337. if (base < lmbbase)
  338. base = -1;
  339. base = min(base, max_addr);
  340. base = lmb_align_down(base - size, align);
  341. } else
  342. continue;
  343. while (base && lmbbase <= base) {
  344. rgn = lmb_overlaps_region(&lmb->reserved, base, size);
  345. if (rgn < 0) {
  346. /* This area isn't reserved, take it */
  347. if (lmb_add_region(&lmb->reserved, base,
  348. size) < 0)
  349. return 0;
  350. return base;
  351. }
  352. res_base = lmb->reserved.region[rgn].base;
  353. if (res_base < size)
  354. break;
  355. base = lmb_align_down(res_base - size, align);
  356. }
  357. }
  358. return 0;
  359. }
  360. /*
  361. * Try to allocate a specific address range: must be in defined memory but not
  362. * reserved
  363. */
  364. phys_addr_t lmb_alloc_addr(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  365. {
  366. long rgn;
  367. /* Check if the requested address is in one of the memory regions */
  368. rgn = lmb_overlaps_region(&lmb->memory, base, size);
  369. if (rgn >= 0) {
  370. /*
  371. * Check if the requested end address is in the same memory
  372. * region we found.
  373. */
  374. if (lmb_addrs_overlap(lmb->memory.region[rgn].base,
  375. lmb->memory.region[rgn].size,
  376. base + size - 1, 1)) {
  377. /* ok, reserve the memory */
  378. if (lmb_reserve(lmb, base, size) >= 0)
  379. return base;
  380. }
  381. }
  382. return 0;
  383. }
  384. /* Return number of bytes from a given address that are free */
  385. phys_size_t lmb_get_free_size(struct lmb *lmb, phys_addr_t addr)
  386. {
  387. int i;
  388. long rgn;
  389. /* check if the requested address is in the memory regions */
  390. rgn = lmb_overlaps_region(&lmb->memory, addr, 1);
  391. if (rgn >= 0) {
  392. for (i = 0; i < lmb->reserved.cnt; i++) {
  393. if (addr < lmb->reserved.region[i].base) {
  394. /* first reserved range > requested address */
  395. return lmb->reserved.region[i].base - addr;
  396. }
  397. if (lmb->reserved.region[i].base +
  398. lmb->reserved.region[i].size > addr) {
  399. /* requested addr is in this reserved range */
  400. return 0;
  401. }
  402. }
  403. /* if we come here: no reserved ranges above requested addr */
  404. return lmb->memory.region[lmb->memory.cnt - 1].base +
  405. lmb->memory.region[lmb->memory.cnt - 1].size - addr;
  406. }
  407. return 0;
  408. }
  409. int lmb_is_reserved_flags(struct lmb *lmb, phys_addr_t addr, int flags)
  410. {
  411. int i;
  412. for (i = 0; i < lmb->reserved.cnt; i++) {
  413. phys_addr_t upper = lmb->reserved.region[i].base +
  414. lmb->reserved.region[i].size - 1;
  415. if ((addr >= lmb->reserved.region[i].base) && (addr <= upper))
  416. return (lmb->reserved.region[i].flags & flags) == flags;
  417. }
  418. return 0;
  419. }
  420. int lmb_is_reserved(struct lmb *lmb, phys_addr_t addr)
  421. {
  422. return lmb_is_reserved_flags(lmb, addr, LMB_NONE);
  423. }
  424. __weak void board_lmb_reserve(struct lmb *lmb)
  425. {
  426. /* please define platform specific board_lmb_reserve() */
  427. }
  428. __weak void arch_lmb_reserve(struct lmb *lmb)
  429. {
  430. /* please define platform specific arch_lmb_reserve() */
  431. }