2 * Procedures for maintaining information about logical memory blocks.
4 * Peter Bergner, IBM Corp. June 2001.
5 * Copyright (C) 2001 Peter Bergner.
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
13 #include <linux/kernel.h>
14 #include <linux/init.h>
15 #include <linux/bitops.h>
16 #include <linux/lmb.h>
21 #define DBG(fmt...) LMB_DBG(fmt)
26 #define LMB_ALLOC_ANYWHERE 0
30 void lmb_dump_all(void)
35 DBG("lmb_dump_all:\n");
36 DBG(" memory.cnt = 0x%lx\n", lmb.memory.cnt);
37 DBG(" memory.size = 0x%lx\n", lmb.memory.size);
38 for (i=0; i < lmb.memory.cnt ;i++) {
39 DBG(" memory.region[0x%x].base = 0x%lx\n",
40 i, lmb.memory.region[i].base);
41 DBG(" .size = 0x%lx\n",
42 lmb.memory.region[i].size);
45 DBG("\n reserved.cnt = 0x%lx\n", lmb.reserved.cnt);
46 DBG(" reserved.size = 0x%lx\n", lmb.reserved.size);
47 for (i=0; i < lmb.reserved.cnt ;i++) {
48 DBG(" reserved.region[0x%x].base = 0x%lx\n",
49 i, lmb.reserved.region[i].base);
50 DBG(" .size = 0x%lx\n",
51 lmb.reserved.region[i].size);
56 static unsigned long __init lmb_addrs_overlap(unsigned long base1,
57 unsigned long size1, unsigned long base2, unsigned long size2)
59 return ((base1 < (base2+size2)) && (base2 < (base1+size1)));
62 static long __init lmb_addrs_adjacent(unsigned long base1, unsigned long size1,
63 unsigned long base2, unsigned long size2)
65 if (base2 == base1 + size1)
67 else if (base1 == base2 + size2)
73 static long __init lmb_regions_adjacent(struct lmb_region *rgn,
74 unsigned long r1, unsigned long r2)
76 unsigned long base1 = rgn->region[r1].base;
77 unsigned long size1 = rgn->region[r1].size;
78 unsigned long base2 = rgn->region[r2].base;
79 unsigned long size2 = rgn->region[r2].size;
81 return lmb_addrs_adjacent(base1, size1, base2, size2);
84 static void __init lmb_remove_region(struct lmb_region *rgn, unsigned long r)
88 for (i = r; i < rgn->cnt - 1; i++) {
89 rgn->region[i].base = rgn->region[i + 1].base;
90 rgn->region[i].size = rgn->region[i + 1].size;
95 /* Assumption: base addr of region 1 < base addr of region 2 */
96 static void __init lmb_coalesce_regions(struct lmb_region *rgn,
97 unsigned long r1, unsigned long r2)
99 rgn->region[r1].size += rgn->region[r2].size;
100 lmb_remove_region(rgn, r2);
103 /* This routine called with relocation disabled. */
104 void __init lmb_init(void)
106 /* Create a dummy zero size LMB which will get coalesced away later.
107 * This simplifies the lmb_add() code below...
109 lmb.memory.region[0].base = 0;
110 lmb.memory.region[0].size = 0;
114 lmb.reserved.region[0].base = 0;
115 lmb.reserved.region[0].size = 0;
116 lmb.reserved.cnt = 1;
119 /* This routine may be called with relocation disabled. */
120 void __init lmb_analyze(void)
126 for (i = 0; i < lmb.memory.cnt; i++)
127 lmb.memory.size += lmb.memory.region[i].size;
130 /* This routine called with relocation disabled. */
131 static long __init lmb_add_region(struct lmb_region *rgn, unsigned long base,
134 unsigned long coalesced = 0;
137 /* First try and coalesce this LMB with another. */
138 for (i=0; i < rgn->cnt; i++) {
139 unsigned long rgnbase = rgn->region[i].base;
140 unsigned long rgnsize = rgn->region[i].size;
142 if ((rgnbase == base) && (rgnsize == size))
143 /* Already have this region, so we're done */
146 adjacent = lmb_addrs_adjacent(base,size,rgnbase,rgnsize);
147 if ( adjacent > 0 ) {
148 rgn->region[i].base -= size;
149 rgn->region[i].size += size;
153 else if ( adjacent < 0 ) {
154 rgn->region[i].size += size;
160 if ((i < rgn->cnt-1) && lmb_regions_adjacent(rgn, i, i+1) ) {
161 lmb_coalesce_regions(rgn, i, i+1);
167 if (rgn->cnt >= MAX_LMB_REGIONS)
170 /* Couldn't coalesce the LMB, so add it to the sorted table. */
171 for (i = rgn->cnt-1; i >= 0; i--) {
172 if (base < rgn->region[i].base) {
173 rgn->region[i+1].base = rgn->region[i].base;
174 rgn->region[i+1].size = rgn->region[i].size;
176 rgn->region[i+1].base = base;
177 rgn->region[i+1].size = size;
186 /* This routine may be called with relocation disabled. */
187 long __init lmb_add(unsigned long base, unsigned long size)
189 struct lmb_region *_rgn = &(lmb.memory);
191 /* On pSeries LPAR systems, the first LMB is our RMO region. */
195 return lmb_add_region(_rgn, base, size);
199 long __init lmb_reserve(unsigned long base, unsigned long size)
201 struct lmb_region *_rgn = &(lmb.reserved);
205 return lmb_add_region(_rgn, base, size);
208 long __init lmb_overlaps_region(struct lmb_region *rgn, unsigned long base,
213 for (i=0; i < rgn->cnt; i++) {
214 unsigned long rgnbase = rgn->region[i].base;
215 unsigned long rgnsize = rgn->region[i].size;
216 if ( lmb_addrs_overlap(base,size,rgnbase,rgnsize) ) {
221 return (i < rgn->cnt) ? i : -1;
224 unsigned long __init lmb_alloc(unsigned long size, unsigned long align)
226 return lmb_alloc_base(size, align, LMB_ALLOC_ANYWHERE);
229 unsigned long __init lmb_alloc_base(unsigned long size, unsigned long align,
230 unsigned long max_addr)
234 alloc = __lmb_alloc_base(size, align, max_addr);
237 panic("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
243 static unsigned long lmb_align_down(unsigned long addr, unsigned long size)
245 return addr & ~(size - 1);
248 static unsigned long lmb_align_up(unsigned long addr, unsigned long size)
250 return (addr + (size - 1)) & ~(size - 1);
253 unsigned long __init __lmb_alloc_base(unsigned long size, unsigned long align,
254 unsigned long max_addr)
257 unsigned long base = 0;
261 /* On some platforms, make sure we allocate lowmem */
262 if (max_addr == LMB_ALLOC_ANYWHERE)
263 max_addr = LMB_REAL_LIMIT;
265 for (i = lmb.memory.cnt-1; i >= 0; i--) {
266 unsigned long lmbbase = lmb.memory.region[i].base;
267 unsigned long lmbsize = lmb.memory.region[i].size;
269 if (max_addr == LMB_ALLOC_ANYWHERE)
270 base = lmb_align_down(lmbbase + lmbsize - size, align);
271 else if (lmbbase < max_addr) {
272 base = min(lmbbase + lmbsize, max_addr);
273 base = lmb_align_down(base - size, align);
277 while ((lmbbase <= base) &&
278 ((j = lmb_overlaps_region(&lmb.reserved, base, size)) >= 0) )
279 base = lmb_align_down(lmb.reserved.region[j].base - size,
282 if ((base != 0) && (lmbbase <= base))
289 if (lmb_add_region(&lmb.reserved, base, lmb_align_up(size, align)) < 0)
295 /* You must call lmb_analyze() before this. */
296 unsigned long __init lmb_phys_mem_size(void)
298 return lmb.memory.size;
301 unsigned long __init lmb_end_of_DRAM(void)
303 int idx = lmb.memory.cnt - 1;
305 return (lmb.memory.region[idx].base + lmb.memory.region[idx].size);
308 /* You must call lmb_analyze() after this. */
309 void __init lmb_enforce_memory_limit(unsigned long memory_limit)
311 unsigned long i, limit;
312 struct lmb_property *p;
317 /* Truncate the lmb regions to satisfy the memory limit. */
318 limit = memory_limit;
319 for (i = 0; i < lmb.memory.cnt; i++) {
320 if (limit > lmb.memory.region[i].size) {
321 limit -= lmb.memory.region[i].size;
325 lmb.memory.region[i].size = limit;
326 lmb.memory.cnt = i + 1;
330 if (lmb.memory.region[0].size < lmb.rmo_size)
331 lmb.rmo_size = lmb.memory.region[0].size;
333 /* And truncate any reserves above the limit also. */
334 for (i = 0; i < lmb.reserved.cnt; i++) {
335 p = &lmb.reserved.region[i];
337 if (p->base > memory_limit)
339 else if ((p->base + p->size) > memory_limit)
340 p->size = memory_limit - p->base;
343 lmb_remove_region(&lmb.reserved, i);
349 int __init lmb_is_reserved(unsigned long addr)
353 for (i = 0; i < lmb.reserved.cnt; i++) {
354 unsigned long upper = lmb.reserved.region[i].base +
355 lmb.reserved.region[i].size - 1;
356 if ((addr >= lmb.reserved.region[i].base) && (addr <= upper))