1 // SPDX-License-Identifier: GPL-2.0+
3 * Procedures for maintaining information about logical memory blocks.
5 * Peter Bergner, IBM Corp. June 2001.
6 * Copyright (C) 2001 Peter Bergner.
15 #define LMB_ALLOC_ANYWHERE 0
17 void lmb_dump_all_force(struct lmb *lmb)
21 printf("lmb_dump_all:\n");
22 printf(" memory.cnt = 0x%lx\n", lmb->memory.cnt);
23 for (i = 0; i < lmb->memory.cnt; i++) {
24 printf(" memory.reg[0x%lx].base = 0x%llx\n", i,
25 (unsigned long long)lmb->memory.region[i].base);
26 printf(" .size = 0x%llx\n",
27 (unsigned long long)lmb->memory.region[i].size);
30 printf("\n reserved.cnt = 0x%lx\n", lmb->reserved.cnt);
31 for (i = 0; i < lmb->reserved.cnt; i++) {
32 printf(" reserved.reg[0x%lx].base = 0x%llx\n", i,
33 (unsigned long long)lmb->reserved.region[i].base);
34 printf(" .size = 0x%llx\n",
35 (unsigned long long)lmb->reserved.region[i].size);
39 void lmb_dump_all(struct lmb *lmb)
42 lmb_dump_all_force(lmb);
46 static long lmb_addrs_overlap(phys_addr_t base1, phys_size_t size1,
47 phys_addr_t base2, phys_size_t size2)
49 const phys_addr_t base1_end = base1 + size1 - 1;
50 const phys_addr_t base2_end = base2 + size2 - 1;
52 return ((base1 <= base2_end) && (base2 <= base1_end));
55 static long lmb_addrs_adjacent(phys_addr_t base1, phys_size_t size1,
56 phys_addr_t base2, phys_size_t size2)
58 if (base2 == base1 + size1)
60 else if (base1 == base2 + size2)
66 static long lmb_regions_adjacent(struct lmb_region *rgn, unsigned long r1,
69 phys_addr_t base1 = rgn->region[r1].base;
70 phys_size_t size1 = rgn->region[r1].size;
71 phys_addr_t base2 = rgn->region[r2].base;
72 phys_size_t size2 = rgn->region[r2].size;
74 return lmb_addrs_adjacent(base1, size1, base2, size2);
77 static void lmb_remove_region(struct lmb_region *rgn, unsigned long r)
81 for (i = r; i < rgn->cnt - 1; i++) {
82 rgn->region[i].base = rgn->region[i + 1].base;
83 rgn->region[i].size = rgn->region[i + 1].size;
88 /* Assumption: base addr of region 1 < base addr of region 2 */
89 static void lmb_coalesce_regions(struct lmb_region *rgn, unsigned long r1,
92 rgn->region[r1].size += rgn->region[r2].size;
93 lmb_remove_region(rgn, r2);
96 void lmb_init(struct lmb *lmb)
98 lmb->memory.max = MAX_LMB_REGIONS;
99 lmb->reserved.max = MAX_LMB_REGIONS;
102 lmb->reserved.cnt = 0;
105 static void lmb_reserve_common(struct lmb *lmb, void *fdt_blob)
107 arch_lmb_reserve(lmb);
108 board_lmb_reserve(lmb);
110 if (IMAGE_ENABLE_OF_LIBFDT && fdt_blob)
111 boot_fdt_add_mem_rsv_regions(lmb, fdt_blob);
114 /* Initialize the struct, add memory and call arch/board reserve functions */
115 void lmb_init_and_reserve(struct lmb *lmb, struct bd_info *bd, void *fdt_blob)
121 for (i = 0; i < CONFIG_NR_DRAM_BANKS; i++) {
122 if (bd->bi_dram[i].size) {
123 lmb_add(lmb, bd->bi_dram[i].start,
124 bd->bi_dram[i].size);
128 lmb_reserve_common(lmb, fdt_blob);
131 /* Initialize the struct, add memory and call arch/board reserve functions */
132 void lmb_init_and_reserve_range(struct lmb *lmb, phys_addr_t base,
133 phys_size_t size, void *fdt_blob)
136 lmb_add(lmb, base, size);
137 lmb_reserve_common(lmb, fdt_blob);
140 /* This routine called with relocation disabled. */
141 static long lmb_add_region(struct lmb_region *rgn, phys_addr_t base, phys_size_t size)
143 unsigned long coalesced = 0;
147 rgn->region[0].base = base;
148 rgn->region[0].size = size;
153 /* First try and coalesce this LMB with another. */
154 for (i = 0; i < rgn->cnt; i++) {
155 phys_addr_t rgnbase = rgn->region[i].base;
156 phys_size_t rgnsize = rgn->region[i].size;
158 if ((rgnbase == base) && (rgnsize == size))
159 /* Already have this region, so we're done */
162 adjacent = lmb_addrs_adjacent(base, size, rgnbase, rgnsize);
164 rgn->region[i].base -= size;
165 rgn->region[i].size += size;
168 } else if (adjacent < 0) {
169 rgn->region[i].size += size;
172 } else if (lmb_addrs_overlap(base, size, rgnbase, rgnsize)) {
173 /* regions overlap */
178 if ((i < rgn->cnt - 1) && lmb_regions_adjacent(rgn, i, i + 1)) {
179 lmb_coalesce_regions(rgn, i, i + 1);
185 if (rgn->cnt >= rgn->max)
188 /* Couldn't coalesce the LMB, so add it to the sorted table. */
189 for (i = rgn->cnt-1; i >= 0; i--) {
190 if (base < rgn->region[i].base) {
191 rgn->region[i + 1].base = rgn->region[i].base;
192 rgn->region[i + 1].size = rgn->region[i].size;
194 rgn->region[i + 1].base = base;
195 rgn->region[i + 1].size = size;
200 if (base < rgn->region[0].base) {
201 rgn->region[0].base = base;
202 rgn->region[0].size = size;
210 /* This routine may be called with relocation disabled. */
211 long lmb_add(struct lmb *lmb, phys_addr_t base, phys_size_t size)
213 struct lmb_region *_rgn = &(lmb->memory);
215 return lmb_add_region(_rgn, base, size);
218 long lmb_free(struct lmb *lmb, phys_addr_t base, phys_size_t size)
220 struct lmb_region *rgn = &(lmb->reserved);
221 phys_addr_t rgnbegin, rgnend;
222 phys_addr_t end = base + size - 1;
225 rgnbegin = rgnend = 0; /* supress gcc warnings */
227 /* Find the region where (base, size) belongs to */
228 for (i = 0; i < rgn->cnt; i++) {
229 rgnbegin = rgn->region[i].base;
230 rgnend = rgnbegin + rgn->region[i].size - 1;
232 if ((rgnbegin <= base) && (end <= rgnend))
236 /* Didn't find the region */
240 /* Check to see if we are removing entire region */
241 if ((rgnbegin == base) && (rgnend == end)) {
242 lmb_remove_region(rgn, i);
246 /* Check to see if region is matching at the front */
247 if (rgnbegin == base) {
248 rgn->region[i].base = end + 1;
249 rgn->region[i].size -= size;
253 /* Check to see if the region is matching at the end */
255 rgn->region[i].size -= size;
260 * We need to split the entry - adjust the current one to the
261 * beginging of the hole and add the region after hole.
263 rgn->region[i].size = base - rgn->region[i].base;
264 return lmb_add_region(rgn, end + 1, rgnend - end);
267 long lmb_reserve(struct lmb *lmb, phys_addr_t base, phys_size_t size)
269 struct lmb_region *_rgn = &(lmb->reserved);
271 return lmb_add_region(_rgn, base, size);
274 static long lmb_overlaps_region(struct lmb_region *rgn, phys_addr_t base,
279 for (i = 0; i < rgn->cnt; i++) {
280 phys_addr_t rgnbase = rgn->region[i].base;
281 phys_size_t rgnsize = rgn->region[i].size;
282 if (lmb_addrs_overlap(base, size, rgnbase, rgnsize))
286 return (i < rgn->cnt) ? i : -1;
289 phys_addr_t lmb_alloc(struct lmb *lmb, phys_size_t size, ulong align)
291 return lmb_alloc_base(lmb, size, align, LMB_ALLOC_ANYWHERE);
294 phys_addr_t lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
298 alloc = __lmb_alloc_base(lmb, size, align, max_addr);
301 printf("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
302 (ulong)size, (ulong)max_addr);
307 static phys_addr_t lmb_align_down(phys_addr_t addr, phys_size_t size)
309 return addr & ~(size - 1);
312 phys_addr_t __lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
315 phys_addr_t base = 0;
316 phys_addr_t res_base;
318 for (i = lmb->memory.cnt - 1; i >= 0; i--) {
319 phys_addr_t lmbbase = lmb->memory.region[i].base;
320 phys_size_t lmbsize = lmb->memory.region[i].size;
324 if (max_addr == LMB_ALLOC_ANYWHERE)
325 base = lmb_align_down(lmbbase + lmbsize - size, align);
326 else if (lmbbase < max_addr) {
327 base = lmbbase + lmbsize;
330 base = min(base, max_addr);
331 base = lmb_align_down(base - size, align);
335 while (base && lmbbase <= base) {
336 rgn = lmb_overlaps_region(&lmb->reserved, base, size);
338 /* This area isn't reserved, take it */
339 if (lmb_add_region(&lmb->reserved, base,
344 res_base = lmb->reserved.region[rgn].base;
347 base = lmb_align_down(res_base - size, align);
354 * Try to allocate a specific address range: must be in defined memory but not
357 phys_addr_t lmb_alloc_addr(struct lmb *lmb, phys_addr_t base, phys_size_t size)
361 /* Check if the requested address is in one of the memory regions */
362 rgn = lmb_overlaps_region(&lmb->memory, base, size);
365 * Check if the requested end address is in the same memory
368 if (lmb_addrs_overlap(lmb->memory.region[rgn].base,
369 lmb->memory.region[rgn].size,
370 base + size - 1, 1)) {
371 /* ok, reserve the memory */
372 if (lmb_reserve(lmb, base, size) >= 0)
379 /* Return number of bytes from a given address that are free */
380 phys_size_t lmb_get_free_size(struct lmb *lmb, phys_addr_t addr)
385 /* check if the requested address is in the memory regions */
386 rgn = lmb_overlaps_region(&lmb->memory, addr, 1);
388 for (i = 0; i < lmb->reserved.cnt; i++) {
389 if (addr < lmb->reserved.region[i].base) {
390 /* first reserved range > requested address */
391 return lmb->reserved.region[i].base - addr;
393 if (lmb->reserved.region[i].base +
394 lmb->reserved.region[i].size > addr) {
395 /* requested addr is in this reserved range */
399 /* if we come here: no reserved ranges above requested addr */
400 return lmb->memory.region[lmb->memory.cnt - 1].base +
401 lmb->memory.region[lmb->memory.cnt - 1].size - addr;
406 int lmb_is_reserved(struct lmb *lmb, phys_addr_t addr)
410 for (i = 0; i < lmb->reserved.cnt; i++) {
411 phys_addr_t upper = lmb->reserved.region[i].base +
412 lmb->reserved.region[i].size - 1;
413 if ((addr >= lmb->reserved.region[i].base) && (addr <= upper))
419 __weak void board_lmb_reserve(struct lmb *lmb)
421 /* please define platform specific board_lmb_reserve() */
424 __weak void arch_lmb_reserve(struct lmb *lmb)
426 /* please define platform specific arch_lmb_reserve() */