Lines Matching defs:lmb
19 #include <asm/lmb.h>
35 struct lmb lmb;
43 DBG(" memory.cnt = 0x%lx\n", lmb.memory.cnt);
44 DBG(" memory.size = 0x%lx\n", lmb.memory.size);
45 for (i=0; i < lmb.memory.cnt ;i++) {
47 i, lmb.memory.region[i].base);
49 lmb.memory.region[i].size);
52 DBG("\n reserved.cnt = 0x%lx\n", lmb.reserved.cnt);
53 DBG(" reserved.size = 0x%lx\n", lmb.reserved.size);
54 for (i=0; i < lmb.reserved.cnt ;i++) {
56 i, lmb.reserved.region[i].base);
58 lmb.reserved.region[i].size);
116 lmb.memory.region[0].base = 0;
117 lmb.memory.region[0].size = 0;
118 lmb.memory.cnt = 1;
121 lmb.reserved.region[0].base = 0;
122 lmb.reserved.region[0].size = 0;
123 lmb.reserved.cnt = 1;
131 lmb.memory.size = 0;
133 for (i = 0; i < lmb.memory.cnt; i++)
134 lmb.memory.size += lmb.memory.region[i].size;
196 struct lmb_region *_rgn = &(lmb.memory);
200 lmb.rmo_size = size;
208 struct lmb_region *_rgn = &(lmb.reserved);
263 for (i = lmb.memory.cnt-1; i >= 0; i--) {
264 unsigned long lmbbase = lmb.memory.region[i].base;
265 unsigned long lmbsize = lmb.memory.region[i].size;
276 ((j = lmb_overlaps_region(&lmb.reserved, base, size)) >= 0) )
277 base = _ALIGN_DOWN(lmb.reserved.region[j].base - size,
287 lmb_add_region(&lmb.reserved, base, size);
295 return lmb.memory.size;
300 int idx = lmb.memory.cnt - 1;
302 return (lmb.memory.region[idx].base + lmb.memory.region[idx].size);
314 /* Truncate the lmb regions to satisfy the memory limit. */
316 for (i = 0; i < lmb.memory.cnt; i++) {
317 if (limit > lmb.memory.region[i].size) {
318 limit -= lmb.memory.region[i].size;
322 lmb.memory.region[i].size = limit;
323 lmb.memory.cnt = i + 1;
327 if (lmb.memory.region[0].size < lmb.rmo_size)
328 lmb.rmo_size = lmb.memory.region[0].size;
331 for (i = 0; i < lmb.reserved.cnt; i++) {
332 p = &lmb.reserved.region[i];
340 lmb_remove_region(&lmb.reserved, i);