lmb.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435
  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. #define LMB_ALLOC_ANYWHERE 0
  14. void lmb_dump_all_force(struct lmb *lmb)
  15. {
  16. unsigned long i;
  17. printf("lmb_dump_all:\n");
  18. printf(" memory.cnt = 0x%lx\n", lmb->memory.cnt);
  19. printf(" memory.size = 0x%llx\n",
  20. (unsigned long long)lmb->memory.size);
  21. for (i = 0; i < lmb->memory.cnt; i++) {
  22. printf(" memory.reg[0x%lx].base = 0x%llx\n", i,
  23. (unsigned long long)lmb->memory.region[i].base);
  24. printf(" .size = 0x%llx\n",
  25. (unsigned long long)lmb->memory.region[i].size);
  26. }
  27. printf("\n reserved.cnt = 0x%lx\n", lmb->reserved.cnt);
  28. printf(" reserved.size = 0x%llx\n",
  29. (unsigned long long)lmb->reserved.size);
  30. for (i = 0; i < lmb->reserved.cnt; i++) {
  31. printf(" reserved.reg[0x%lx].base = 0x%llx\n", i,
  32. (unsigned long long)lmb->reserved.region[i].base);
  33. printf(" .size = 0x%llx\n",
  34. (unsigned long long)lmb->reserved.region[i].size);
  35. }
  36. }
  37. void lmb_dump_all(struct lmb *lmb)
  38. {
  39. #ifdef DEBUG
  40. lmb_dump_all_force(lmb);
  41. #endif
  42. }
  43. static long lmb_addrs_overlap(phys_addr_t base1, phys_size_t size1,
  44. phys_addr_t base2, phys_size_t size2)
  45. {
  46. const phys_addr_t base1_end = base1 + size1 - 1;
  47. const phys_addr_t base2_end = base2 + size2 - 1;
  48. return ((base1 <= base2_end) && (base2 <= base1_end));
  49. }
  50. static long lmb_addrs_adjacent(phys_addr_t base1, phys_size_t size1,
  51. phys_addr_t base2, phys_size_t size2)
  52. {
  53. if (base2 == base1 + size1)
  54. return 1;
  55. else if (base1 == base2 + size2)
  56. return -1;
  57. return 0;
  58. }
  59. static long lmb_regions_adjacent(struct lmb_region *rgn, unsigned long r1,
  60. unsigned long r2)
  61. {
  62. phys_addr_t base1 = rgn->region[r1].base;
  63. phys_size_t size1 = rgn->region[r1].size;
  64. phys_addr_t base2 = rgn->region[r2].base;
  65. phys_size_t size2 = rgn->region[r2].size;
  66. return lmb_addrs_adjacent(base1, size1, base2, size2);
  67. }
  68. static void lmb_remove_region(struct lmb_region *rgn, unsigned long r)
  69. {
  70. unsigned long i;
  71. for (i = r; i < rgn->cnt - 1; i++) {
  72. rgn->region[i].base = rgn->region[i + 1].base;
  73. rgn->region[i].size = rgn->region[i + 1].size;
  74. }
  75. rgn->cnt--;
  76. }
  77. /* Assumption: base addr of region 1 < base addr of region 2 */
  78. static void lmb_coalesce_regions(struct lmb_region *rgn, unsigned long r1,
  79. unsigned long r2)
  80. {
  81. rgn->region[r1].size += rgn->region[r2].size;
  82. lmb_remove_region(rgn, r2);
  83. }
  84. void lmb_init(struct lmb *lmb)
  85. {
  86. lmb->memory.cnt = 0;
  87. lmb->memory.size = 0;
  88. lmb->reserved.cnt = 0;
  89. lmb->reserved.size = 0;
  90. }
  91. static void lmb_reserve_common(struct lmb *lmb, void *fdt_blob)
  92. {
  93. arch_lmb_reserve(lmb);
  94. board_lmb_reserve(lmb);
  95. if (IMAGE_ENABLE_OF_LIBFDT && fdt_blob)
  96. boot_fdt_add_mem_rsv_regions(lmb, fdt_blob);
  97. }
  98. /* Initialize the struct, add memory and call arch/board reserve functions */
  99. void lmb_init_and_reserve(struct lmb *lmb, struct bd_info *bd, void *fdt_blob)
  100. {
  101. #ifdef CONFIG_NR_DRAM_BANKS
  102. int i;
  103. #endif
  104. lmb_init(lmb);
  105. #ifdef CONFIG_NR_DRAM_BANKS
  106. for (i = 0; i < CONFIG_NR_DRAM_BANKS; i++) {
  107. if (bd->bi_dram[i].size) {
  108. lmb_add(lmb, bd->bi_dram[i].start,
  109. bd->bi_dram[i].size);
  110. }
  111. }
  112. #else
  113. if (bd->bi_memsize)
  114. lmb_add(lmb, bd->bi_memstart, bd->bi_memsize);
  115. #endif
  116. lmb_reserve_common(lmb, fdt_blob);
  117. }
  118. /* Initialize the struct, add memory and call arch/board reserve functions */
  119. void lmb_init_and_reserve_range(struct lmb *lmb, phys_addr_t base,
  120. phys_size_t size, void *fdt_blob)
  121. {
  122. lmb_init(lmb);
  123. lmb_add(lmb, base, size);
  124. lmb_reserve_common(lmb, fdt_blob);
  125. }
  126. /* This routine called with relocation disabled. */
  127. static long lmb_add_region(struct lmb_region *rgn, phys_addr_t base, phys_size_t size)
  128. {
  129. unsigned long coalesced = 0;
  130. long adjacent, i;
  131. if (rgn->cnt == 0) {
  132. rgn->region[0].base = base;
  133. rgn->region[0].size = size;
  134. rgn->cnt = 1;
  135. return 0;
  136. }
  137. /* First try and coalesce this LMB with another. */
  138. for (i = 0; i < rgn->cnt; i++) {
  139. phys_addr_t rgnbase = rgn->region[i].base;
  140. phys_size_t rgnsize = rgn->region[i].size;
  141. if ((rgnbase == base) && (rgnsize == size))
  142. /* Already have this region, so we're done */
  143. return 0;
  144. adjacent = lmb_addrs_adjacent(base, size, rgnbase, rgnsize);
  145. if (adjacent > 0) {
  146. rgn->region[i].base -= size;
  147. rgn->region[i].size += size;
  148. coalesced++;
  149. break;
  150. } else if (adjacent < 0) {
  151. rgn->region[i].size += size;
  152. coalesced++;
  153. break;
  154. } else if (lmb_addrs_overlap(base, size, rgnbase, rgnsize)) {
  155. /* regions overlap */
  156. return -1;
  157. }
  158. }
  159. if ((i < rgn->cnt - 1) && lmb_regions_adjacent(rgn, i, i + 1)) {
  160. lmb_coalesce_regions(rgn, i, i + 1);
  161. coalesced++;
  162. }
  163. if (coalesced)
  164. return coalesced;
  165. if (rgn->cnt >= MAX_LMB_REGIONS)
  166. return -1;
  167. /* Couldn't coalesce the LMB, so add it to the sorted table. */
  168. for (i = rgn->cnt-1; i >= 0; i--) {
  169. if (base < rgn->region[i].base) {
  170. rgn->region[i + 1].base = rgn->region[i].base;
  171. rgn->region[i + 1].size = rgn->region[i].size;
  172. } else {
  173. rgn->region[i + 1].base = base;
  174. rgn->region[i + 1].size = size;
  175. break;
  176. }
  177. }
  178. if (base < rgn->region[0].base) {
  179. rgn->region[0].base = base;
  180. rgn->region[0].size = size;
  181. }
  182. rgn->cnt++;
  183. return 0;
  184. }
  185. /* This routine may be called with relocation disabled. */
  186. long lmb_add(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  187. {
  188. struct lmb_region *_rgn = &(lmb->memory);
  189. return lmb_add_region(_rgn, base, size);
  190. }
  191. long lmb_free(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  192. {
  193. struct lmb_region *rgn = &(lmb->reserved);
  194. phys_addr_t rgnbegin, rgnend;
  195. phys_addr_t end = base + size - 1;
  196. int i;
  197. rgnbegin = rgnend = 0; /* supress gcc warnings */
  198. /* Find the region where (base, size) belongs to */
  199. for (i = 0; i < rgn->cnt; i++) {
  200. rgnbegin = rgn->region[i].base;
  201. rgnend = rgnbegin + rgn->region[i].size - 1;
  202. if ((rgnbegin <= base) && (end <= rgnend))
  203. break;
  204. }
  205. /* Didn't find the region */
  206. if (i == rgn->cnt)
  207. return -1;
  208. /* Check to see if we are removing entire region */
  209. if ((rgnbegin == base) && (rgnend == end)) {
  210. lmb_remove_region(rgn, i);
  211. return 0;
  212. }
  213. /* Check to see if region is matching at the front */
  214. if (rgnbegin == base) {
  215. rgn->region[i].base = end + 1;
  216. rgn->region[i].size -= size;
  217. return 0;
  218. }
  219. /* Check to see if the region is matching at the end */
  220. if (rgnend == end) {
  221. rgn->region[i].size -= size;
  222. return 0;
  223. }
  224. /*
  225. * We need to split the entry - adjust the current one to the
  226. * beginging of the hole and add the region after hole.
  227. */
  228. rgn->region[i].size = base - rgn->region[i].base;
  229. return lmb_add_region(rgn, end + 1, rgnend - end);
  230. }
  231. long lmb_reserve(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  232. {
  233. struct lmb_region *_rgn = &(lmb->reserved);
  234. return lmb_add_region(_rgn, base, size);
  235. }
  236. static long lmb_overlaps_region(struct lmb_region *rgn, phys_addr_t base,
  237. phys_size_t size)
  238. {
  239. unsigned long i;
  240. for (i = 0; i < rgn->cnt; i++) {
  241. phys_addr_t rgnbase = rgn->region[i].base;
  242. phys_size_t rgnsize = rgn->region[i].size;
  243. if (lmb_addrs_overlap(base, size, rgnbase, rgnsize))
  244. break;
  245. }
  246. return (i < rgn->cnt) ? i : -1;
  247. }
  248. phys_addr_t lmb_alloc(struct lmb *lmb, phys_size_t size, ulong align)
  249. {
  250. return lmb_alloc_base(lmb, size, align, LMB_ALLOC_ANYWHERE);
  251. }
  252. phys_addr_t lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
  253. {
  254. phys_addr_t alloc;
  255. alloc = __lmb_alloc_base(lmb, size, align, max_addr);
  256. if (alloc == 0)
  257. printf("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
  258. (ulong)size, (ulong)max_addr);
  259. return alloc;
  260. }
  261. static phys_addr_t lmb_align_down(phys_addr_t addr, phys_size_t size)
  262. {
  263. return addr & ~(size - 1);
  264. }
  265. phys_addr_t __lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
  266. {
  267. long i, rgn;
  268. phys_addr_t base = 0;
  269. phys_addr_t res_base;
  270. for (i = lmb->memory.cnt - 1; i >= 0; i--) {
  271. phys_addr_t lmbbase = lmb->memory.region[i].base;
  272. phys_size_t lmbsize = lmb->memory.region[i].size;
  273. if (lmbsize < size)
  274. continue;
  275. if (max_addr == LMB_ALLOC_ANYWHERE)
  276. base = lmb_align_down(lmbbase + lmbsize - size, align);
  277. else if (lmbbase < max_addr) {
  278. base = lmbbase + lmbsize;
  279. if (base < lmbbase)
  280. base = -1;
  281. base = min(base, max_addr);
  282. base = lmb_align_down(base - size, align);
  283. } else
  284. continue;
  285. while (base && lmbbase <= base) {
  286. rgn = lmb_overlaps_region(&lmb->reserved, base, size);
  287. if (rgn < 0) {
  288. /* This area isn't reserved, take it */
  289. if (lmb_add_region(&lmb->reserved, base,
  290. size) < 0)
  291. return 0;
  292. return base;
  293. }
  294. res_base = lmb->reserved.region[rgn].base;
  295. if (res_base < size)
  296. break;
  297. base = lmb_align_down(res_base - size, align);
  298. }
  299. }
  300. return 0;
  301. }
  302. /*
  303. * Try to allocate a specific address range: must be in defined memory but not
  304. * reserved
  305. */
  306. phys_addr_t lmb_alloc_addr(struct lmb *lmb, phys_addr_t base, phys_size_t size)
  307. {
  308. long rgn;
  309. /* Check if the requested address is in one of the memory regions */
  310. rgn = lmb_overlaps_region(&lmb->memory, base, size);
  311. if (rgn >= 0) {
  312. /*
  313. * Check if the requested end address is in the same memory
  314. * region we found.
  315. */
  316. if (lmb_addrs_overlap(lmb->memory.region[rgn].base,
  317. lmb->memory.region[rgn].size,
  318. base + size - 1, 1)) {
  319. /* ok, reserve the memory */
  320. if (lmb_reserve(lmb, base, size) >= 0)
  321. return base;
  322. }
  323. }
  324. return 0;
  325. }
  326. /* Return number of bytes from a given address that are free */
  327. phys_size_t lmb_get_free_size(struct lmb *lmb, phys_addr_t addr)
  328. {
  329. int i;
  330. long rgn;
  331. /* check if the requested address is in the memory regions */
  332. rgn = lmb_overlaps_region(&lmb->memory, addr, 1);
  333. if (rgn >= 0) {
  334. for (i = 0; i < lmb->reserved.cnt; i++) {
  335. if (addr < lmb->reserved.region[i].base) {
  336. /* first reserved range > requested address */
  337. return lmb->reserved.region[i].base - addr;
  338. }
  339. if (lmb->reserved.region[i].base +
  340. lmb->reserved.region[i].size > addr) {
  341. /* requested addr is in this reserved range */
  342. return 0;
  343. }
  344. }
  345. /* if we come here: no reserved ranges above requested addr */
  346. return lmb->memory.region[lmb->memory.cnt - 1].base +
  347. lmb->memory.region[lmb->memory.cnt - 1].size - addr;
  348. }
  349. return 0;
  350. }
  351. int lmb_is_reserved(struct lmb *lmb, phys_addr_t addr)
  352. {
  353. int i;
  354. for (i = 0; i < lmb->reserved.cnt; i++) {
  355. phys_addr_t upper = lmb->reserved.region[i].base +
  356. lmb->reserved.region[i].size - 1;
  357. if ((addr >= lmb->reserved.region[i].base) && (addr <= upper))
  358. return 1;
  359. }
  360. return 0;
  361. }
  362. __weak void board_lmb_reserve(struct lmb *lmb)
  363. {
  364. /* please define platform specific board_lmb_reserve() */
  365. }
  366. __weak void arch_lmb_reserve(struct lmb *lmb)
  367. {
  368. /* please define platform specific arch_lmb_reserve() */
  369. }