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.
12 #define LMB_ALLOC_ANYWHERE 0
14 void lmb_dump_all(struct lmb *lmb)
19 debug("lmb_dump_all:\n");
20 debug(" memory.cnt = 0x%lx\n", lmb->memory.cnt);
21 debug(" memory.size = 0x%llx\n",
22 (unsigned long long)lmb->memory.size);
23 for (i=0; i < lmb->memory.cnt ;i++) {
24 debug(" memory.reg[0x%lx].base = 0x%llx\n", i,
25 (long long unsigned)lmb->memory.region[i].base);
26 debug(" .size = 0x%llx\n",
27 (long long unsigned)lmb->memory.region[i].size);
30 debug("\n reserved.cnt = 0x%lx\n",
32 debug(" reserved.size = 0x%llx\n",
33 (long long unsigned)lmb->reserved.size);
34 for (i=0; i < lmb->reserved.cnt ;i++) {
35 debug(" reserved.reg[0x%lx].base = 0x%llx\n", i,
36 (long long unsigned)lmb->reserved.region[i].base);
37 debug(" .size = 0x%llx\n",
38 (long long unsigned)lmb->reserved.region[i].size);
43 static long lmb_addrs_overlap(phys_addr_t base1,
44 phys_size_t size1, phys_addr_t base2, phys_size_t size2)
46 const phys_addr_t base1_end = base1 + size1 - 1;
47 const phys_addr_t base2_end = base2 + size2 - 1;
49 return ((base1 <= base2_end) && (base2 <= base1_end));
52 static long lmb_addrs_adjacent(phys_addr_t base1, phys_size_t size1,
53 phys_addr_t base2, phys_size_t size2)
55 if (base2 == base1 + size1)
57 else if (base1 == base2 + size2)
63 static long lmb_regions_adjacent(struct lmb_region *rgn,
64 unsigned long r1, unsigned long r2)
66 phys_addr_t base1 = rgn->region[r1].base;
67 phys_size_t size1 = rgn->region[r1].size;
68 phys_addr_t base2 = rgn->region[r2].base;
69 phys_size_t size2 = rgn->region[r2].size;
71 return lmb_addrs_adjacent(base1, size1, base2, size2);
74 static void lmb_remove_region(struct lmb_region *rgn, unsigned long r)
78 for (i = r; i < rgn->cnt - 1; i++) {
79 rgn->region[i].base = rgn->region[i + 1].base;
80 rgn->region[i].size = rgn->region[i + 1].size;
85 /* Assumption: base addr of region 1 < base addr of region 2 */
86 static void lmb_coalesce_regions(struct lmb_region *rgn,
87 unsigned long r1, unsigned long r2)
89 rgn->region[r1].size += rgn->region[r2].size;
90 lmb_remove_region(rgn, r2);
93 void lmb_init(struct lmb *lmb)
97 lmb->reserved.cnt = 0;
98 lmb->reserved.size = 0;
101 /* This routine called with relocation disabled. */
102 static long lmb_add_region(struct lmb_region *rgn, phys_addr_t base, phys_size_t size)
104 unsigned long coalesced = 0;
108 rgn->region[0].base = base;
109 rgn->region[0].size = size;
114 /* First try and coalesce this LMB with another. */
115 for (i=0; i < rgn->cnt; i++) {
116 phys_addr_t rgnbase = rgn->region[i].base;
117 phys_size_t rgnsize = rgn->region[i].size;
119 if ((rgnbase == base) && (rgnsize == size))
120 /* Already have this region, so we're done */
123 adjacent = lmb_addrs_adjacent(base,size,rgnbase,rgnsize);
124 if ( adjacent > 0 ) {
125 rgn->region[i].base -= size;
126 rgn->region[i].size += size;
130 else if ( adjacent < 0 ) {
131 rgn->region[i].size += size;
134 } else if (lmb_addrs_overlap(base, size, rgnbase, rgnsize)) {
135 /* regions overlap */
140 if ((i < rgn->cnt-1) && lmb_regions_adjacent(rgn, i, i+1) ) {
141 lmb_coalesce_regions(rgn, i, i+1);
147 if (rgn->cnt >= MAX_LMB_REGIONS)
150 /* Couldn't coalesce the LMB, so add it to the sorted table. */
151 for (i = rgn->cnt-1; i >= 0; i--) {
152 if (base < rgn->region[i].base) {
153 rgn->region[i+1].base = rgn->region[i].base;
154 rgn->region[i+1].size = rgn->region[i].size;
156 rgn->region[i+1].base = base;
157 rgn->region[i+1].size = size;
162 if (base < rgn->region[0].base) {
163 rgn->region[0].base = base;
164 rgn->region[0].size = size;
172 /* This routine may be called with relocation disabled. */
173 long lmb_add(struct lmb *lmb, phys_addr_t base, phys_size_t size)
175 struct lmb_region *_rgn = &(lmb->memory);
177 return lmb_add_region(_rgn, base, size);
180 long lmb_free(struct lmb *lmb, phys_addr_t base, phys_size_t size)
182 struct lmb_region *rgn = &(lmb->reserved);
183 phys_addr_t rgnbegin, rgnend;
184 phys_addr_t end = base + size - 1;
187 rgnbegin = rgnend = 0; /* supress gcc warnings */
189 /* Find the region where (base, size) belongs to */
190 for (i=0; i < rgn->cnt; i++) {
191 rgnbegin = rgn->region[i].base;
192 rgnend = rgnbegin + rgn->region[i].size - 1;
194 if ((rgnbegin <= base) && (end <= rgnend))
198 /* Didn't find the region */
202 /* Check to see if we are removing entire region */
203 if ((rgnbegin == base) && (rgnend == end)) {
204 lmb_remove_region(rgn, i);
208 /* Check to see if region is matching at the front */
209 if (rgnbegin == base) {
210 rgn->region[i].base = end + 1;
211 rgn->region[i].size -= size;
215 /* Check to see if the region is matching at the end */
217 rgn->region[i].size -= size;
222 * We need to split the entry - adjust the current one to the
223 * beginging of the hole and add the region after hole.
225 rgn->region[i].size = base - rgn->region[i].base;
226 return lmb_add_region(rgn, end + 1, rgnend - end);
229 long lmb_reserve(struct lmb *lmb, phys_addr_t base, phys_size_t size)
231 struct lmb_region *_rgn = &(lmb->reserved);
233 return lmb_add_region(_rgn, base, size);
236 static long lmb_overlaps_region(struct lmb_region *rgn, phys_addr_t base,
241 for (i=0; i < rgn->cnt; i++) {
242 phys_addr_t rgnbase = rgn->region[i].base;
243 phys_size_t rgnsize = rgn->region[i].size;
244 if ( lmb_addrs_overlap(base,size,rgnbase,rgnsize) ) {
249 return (i < rgn->cnt) ? i : -1;
252 phys_addr_t lmb_alloc(struct lmb *lmb, phys_size_t size, ulong align)
254 return lmb_alloc_base(lmb, size, align, LMB_ALLOC_ANYWHERE);
257 phys_addr_t lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
261 alloc = __lmb_alloc_base(lmb, size, align, max_addr);
264 printf("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
265 (ulong)size, (ulong)max_addr);
270 static phys_addr_t lmb_align_down(phys_addr_t addr, phys_size_t size)
272 return addr & ~(size - 1);
275 phys_addr_t __lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
278 phys_addr_t base = 0;
279 phys_addr_t res_base;
281 for (i = lmb->memory.cnt-1; i >= 0; i--) {
282 phys_addr_t lmbbase = lmb->memory.region[i].base;
283 phys_size_t lmbsize = lmb->memory.region[i].size;
287 if (max_addr == LMB_ALLOC_ANYWHERE)
288 base = lmb_align_down(lmbbase + lmbsize - size, align);
289 else if (lmbbase < max_addr) {
290 base = lmbbase + lmbsize;
293 base = min(base, max_addr);
294 base = lmb_align_down(base - size, align);
298 while (base && lmbbase <= base) {
299 j = lmb_overlaps_region(&lmb->reserved, base, size);
301 /* This area isn't reserved, take it */
302 if (lmb_add_region(&lmb->reserved, base,
307 res_base = lmb->reserved.region[j].base;
310 base = lmb_align_down(res_base - size, align);
316 int lmb_is_reserved(struct lmb *lmb, phys_addr_t addr)
320 for (i = 0; i < lmb->reserved.cnt; i++) {
321 phys_addr_t upper = lmb->reserved.region[i].base +
322 lmb->reserved.region[i].size - 1;
323 if ((addr >= lmb->reserved.region[i].base) && (addr <= upper))
329 __weak void board_lmb_reserve(struct lmb *lmb)
331 /* please define platform specific board_lmb_reserve() */
334 __weak void arch_lmb_reserve(struct lmb *lmb)
336 /* please define platform specific arch_lmb_reserve() */