195f72d1eSYinghai Lu /* 295f72d1eSYinghai Lu * Procedures for maintaining information about logical memory blocks. 395f72d1eSYinghai Lu * 495f72d1eSYinghai Lu * Peter Bergner, IBM Corp. June 2001. 595f72d1eSYinghai Lu * Copyright (C) 2001 Peter Bergner. 695f72d1eSYinghai Lu * 795f72d1eSYinghai Lu * This program is free software; you can redistribute it and/or 895f72d1eSYinghai Lu * modify it under the terms of the GNU General Public License 995f72d1eSYinghai Lu * as published by the Free Software Foundation; either version 1095f72d1eSYinghai Lu * 2 of the License, or (at your option) any later version. 1195f72d1eSYinghai Lu */ 1295f72d1eSYinghai Lu 1395f72d1eSYinghai Lu #include <linux/kernel.h> 14142b45a7SBenjamin Herrenschmidt #include <linux/slab.h> 1595f72d1eSYinghai Lu #include <linux/init.h> 1695f72d1eSYinghai Lu #include <linux/bitops.h> 17449e8df3SBenjamin Herrenschmidt #include <linux/poison.h> 18c196f76fSBenjamin Herrenschmidt #include <linux/pfn.h> 196d03b885SBenjamin Herrenschmidt #include <linux/debugfs.h> 206d03b885SBenjamin Herrenschmidt #include <linux/seq_file.h> 2195f72d1eSYinghai Lu #include <linux/memblock.h> 2295f72d1eSYinghai Lu 23fe091c20STejun Heo static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; 24fe091c20STejun Heo static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; 25fe091c20STejun Heo 26fe091c20STejun Heo struct memblock memblock __initdata_memblock = { 27fe091c20STejun Heo .memory.regions = memblock_memory_init_regions, 28fe091c20STejun Heo .memory.cnt = 1, /* empty dummy entry */ 29fe091c20STejun Heo .memory.max = INIT_MEMBLOCK_REGIONS, 30fe091c20STejun Heo 31fe091c20STejun Heo .reserved.regions = memblock_reserved_init_regions, 32fe091c20STejun Heo .reserved.cnt = 1, /* empty dummy entry */ 33fe091c20STejun Heo .reserved.max = INIT_MEMBLOCK_REGIONS, 34fe091c20STejun Heo 35fe091c20STejun Heo .current_limit = MEMBLOCK_ALLOC_ANYWHERE, 36fe091c20STejun Heo }; 3795f72d1eSYinghai Lu 3810d06439SYinghai Lu int memblock_debug __initdata_memblock; 391aadc056STejun Heo static int memblock_can_resize __initdata_memblock; 40*181eb394SGavin Shan static int memblock_memory_in_slab __initdata_memblock = 0; 41*181eb394SGavin Shan static int memblock_reserved_in_slab __initdata_memblock = 0; 4295f72d1eSYinghai Lu 43142b45a7SBenjamin Herrenschmidt /* inline so we don't get a warning when pr_debug is compiled out */ 44142b45a7SBenjamin Herrenschmidt static inline const char *memblock_type_name(struct memblock_type *type) 45142b45a7SBenjamin Herrenschmidt { 46142b45a7SBenjamin Herrenschmidt if (type == &memblock.memory) 47142b45a7SBenjamin Herrenschmidt return "memory"; 48142b45a7SBenjamin Herrenschmidt else if (type == &memblock.reserved) 49142b45a7SBenjamin Herrenschmidt return "reserved"; 50142b45a7SBenjamin Herrenschmidt else 51142b45a7SBenjamin Herrenschmidt return "unknown"; 52142b45a7SBenjamin Herrenschmidt } 53142b45a7SBenjamin Herrenschmidt 54eb18f1b5STejun Heo /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */ 55eb18f1b5STejun Heo static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size) 56eb18f1b5STejun Heo { 57eb18f1b5STejun Heo return *size = min(*size, (phys_addr_t)ULLONG_MAX - base); 58eb18f1b5STejun Heo } 59eb18f1b5STejun Heo 606ed311b2SBenjamin Herrenschmidt /* 616ed311b2SBenjamin Herrenschmidt * Address comparison utilities 626ed311b2SBenjamin Herrenschmidt */ 6310d06439SYinghai Lu static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, 642898cc4cSBenjamin Herrenschmidt phys_addr_t base2, phys_addr_t size2) 6595f72d1eSYinghai Lu { 6695f72d1eSYinghai Lu return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); 6795f72d1eSYinghai Lu } 6895f72d1eSYinghai Lu 692d7d3eb2SH Hartley Sweeten static long __init_memblock memblock_overlaps_region(struct memblock_type *type, 702d7d3eb2SH Hartley Sweeten phys_addr_t base, phys_addr_t size) 716ed311b2SBenjamin Herrenschmidt { 726ed311b2SBenjamin Herrenschmidt unsigned long i; 736ed311b2SBenjamin Herrenschmidt 746ed311b2SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 756ed311b2SBenjamin Herrenschmidt phys_addr_t rgnbase = type->regions[i].base; 766ed311b2SBenjamin Herrenschmidt phys_addr_t rgnsize = type->regions[i].size; 776ed311b2SBenjamin Herrenschmidt if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) 786ed311b2SBenjamin Herrenschmidt break; 796ed311b2SBenjamin Herrenschmidt } 806ed311b2SBenjamin Herrenschmidt 816ed311b2SBenjamin Herrenschmidt return (i < type->cnt) ? i : -1; 826ed311b2SBenjamin Herrenschmidt } 836ed311b2SBenjamin Herrenschmidt 847bd0b0f0STejun Heo /** 857bd0b0f0STejun Heo * memblock_find_in_range_node - find free area in given range and node 867bd0b0f0STejun Heo * @start: start of candidate range 877bd0b0f0STejun Heo * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 887bd0b0f0STejun Heo * @size: size of free area to find 897bd0b0f0STejun Heo * @align: alignment of free area to find 907bd0b0f0STejun Heo * @nid: nid of the free area to find, %MAX_NUMNODES for any node 917bd0b0f0STejun Heo * 927bd0b0f0STejun Heo * Find @size free area aligned to @align in the specified range and node. 937bd0b0f0STejun Heo * 947bd0b0f0STejun Heo * RETURNS: 957bd0b0f0STejun Heo * Found address on success, %0 on failure. 966ed311b2SBenjamin Herrenschmidt */ 977bd0b0f0STejun Heo phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t start, 987bd0b0f0STejun Heo phys_addr_t end, phys_addr_t size, 997bd0b0f0STejun Heo phys_addr_t align, int nid) 1006ed311b2SBenjamin Herrenschmidt { 1017bd0b0f0STejun Heo phys_addr_t this_start, this_end, cand; 1027bd0b0f0STejun Heo u64 i; 1036ed311b2SBenjamin Herrenschmidt 1047bd0b0f0STejun Heo /* pump up @end */ 105fef501d4SBenjamin Herrenschmidt if (end == MEMBLOCK_ALLOC_ACCESSIBLE) 106fef501d4SBenjamin Herrenschmidt end = memblock.current_limit; 1076ed311b2SBenjamin Herrenschmidt 1085d53cb27STejun Heo /* avoid allocating the first page */ 1095d53cb27STejun Heo start = max_t(phys_addr_t, start, PAGE_SIZE); 1107bd0b0f0STejun Heo end = max(start, end); 1116ed311b2SBenjamin Herrenschmidt 1127bd0b0f0STejun Heo for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) { 1137bd0b0f0STejun Heo this_start = clamp(this_start, start, end); 1147bd0b0f0STejun Heo this_end = clamp(this_end, start, end); 1157bd0b0f0STejun Heo 1165d53cb27STejun Heo if (this_end < size) 1175d53cb27STejun Heo continue; 1185d53cb27STejun Heo 1197bd0b0f0STejun Heo cand = round_down(this_end - size, align); 1207bd0b0f0STejun Heo if (cand >= this_start) 1217bd0b0f0STejun Heo return cand; 1226ed311b2SBenjamin Herrenschmidt } 1231f5026a7STejun Heo return 0; 1246ed311b2SBenjamin Herrenschmidt } 1256ed311b2SBenjamin Herrenschmidt 1267bd0b0f0STejun Heo /** 1277bd0b0f0STejun Heo * memblock_find_in_range - find free area in given range 1287bd0b0f0STejun Heo * @start: start of candidate range 1297bd0b0f0STejun Heo * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 1307bd0b0f0STejun Heo * @size: size of free area to find 1317bd0b0f0STejun Heo * @align: alignment of free area to find 1327bd0b0f0STejun Heo * 1337bd0b0f0STejun Heo * Find @size free area aligned to @align in the specified range. 1347bd0b0f0STejun Heo * 1357bd0b0f0STejun Heo * RETURNS: 1367bd0b0f0STejun Heo * Found address on success, %0 on failure. 1377bd0b0f0STejun Heo */ 1387bd0b0f0STejun Heo phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, 1397bd0b0f0STejun Heo phys_addr_t end, phys_addr_t size, 1407bd0b0f0STejun Heo phys_addr_t align) 1417bd0b0f0STejun Heo { 1427bd0b0f0STejun Heo return memblock_find_in_range_node(start, end, size, align, 1437bd0b0f0STejun Heo MAX_NUMNODES); 1447bd0b0f0STejun Heo } 1457bd0b0f0STejun Heo 1465303b68fSYinghai Lu /* 1477950c407SYinghai Lu * Free memblock.reserved.regions 1487950c407SYinghai Lu */ 1497950c407SYinghai Lu int __init_memblock memblock_free_reserved_regions(void) 1507950c407SYinghai Lu { 1517950c407SYinghai Lu if (memblock.reserved.regions == memblock_reserved_init_regions) 1527950c407SYinghai Lu return 0; 1537950c407SYinghai Lu 1547950c407SYinghai Lu return memblock_free(__pa(memblock.reserved.regions), 1557950c407SYinghai Lu sizeof(struct memblock_region) * memblock.reserved.max); 1567950c407SYinghai Lu } 1577950c407SYinghai Lu 1587950c407SYinghai Lu /* 1597950c407SYinghai Lu * Reserve memblock.reserved.regions 1607950c407SYinghai Lu */ 1617950c407SYinghai Lu int __init_memblock memblock_reserve_reserved_regions(void) 1627950c407SYinghai Lu { 1637950c407SYinghai Lu if (memblock.reserved.regions == memblock_reserved_init_regions) 1647950c407SYinghai Lu return 0; 1657950c407SYinghai Lu 1667950c407SYinghai Lu return memblock_reserve(__pa(memblock.reserved.regions), 1677950c407SYinghai Lu sizeof(struct memblock_region) * memblock.reserved.max); 1687950c407SYinghai Lu } 1697950c407SYinghai Lu 17010d06439SYinghai Lu static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) 17195f72d1eSYinghai Lu { 1721440c4e2STejun Heo type->total_size -= type->regions[r].size; 1737c0caeb8STejun Heo memmove(&type->regions[r], &type->regions[r + 1], 1747c0caeb8STejun Heo (type->cnt - (r + 1)) * sizeof(type->regions[r])); 175e3239ff9SBenjamin Herrenschmidt type->cnt--; 17695f72d1eSYinghai Lu 1778f7a6605SBenjamin Herrenschmidt /* Special case for empty arrays */ 1788f7a6605SBenjamin Herrenschmidt if (type->cnt == 0) { 1791440c4e2STejun Heo WARN_ON(type->total_size != 0); 1808f7a6605SBenjamin Herrenschmidt type->cnt = 1; 1818f7a6605SBenjamin Herrenschmidt type->regions[0].base = 0; 1828f7a6605SBenjamin Herrenschmidt type->regions[0].size = 0; 1837c0caeb8STejun Heo memblock_set_region_node(&type->regions[0], MAX_NUMNODES); 1848f7a6605SBenjamin Herrenschmidt } 18595f72d1eSYinghai Lu } 18695f72d1eSYinghai Lu 18710d06439SYinghai Lu static int __init_memblock memblock_double_array(struct memblock_type *type) 188142b45a7SBenjamin Herrenschmidt { 189142b45a7SBenjamin Herrenschmidt struct memblock_region *new_array, *old_array; 190142b45a7SBenjamin Herrenschmidt phys_addr_t old_size, new_size, addr; 191142b45a7SBenjamin Herrenschmidt int use_slab = slab_is_available(); 192*181eb394SGavin Shan int *in_slab; 193142b45a7SBenjamin Herrenschmidt 194142b45a7SBenjamin Herrenschmidt /* We don't allow resizing until we know about the reserved regions 195142b45a7SBenjamin Herrenschmidt * of memory that aren't suitable for allocation 196142b45a7SBenjamin Herrenschmidt */ 197142b45a7SBenjamin Herrenschmidt if (!memblock_can_resize) 198142b45a7SBenjamin Herrenschmidt return -1; 199142b45a7SBenjamin Herrenschmidt 200142b45a7SBenjamin Herrenschmidt /* Calculate new doubled size */ 201142b45a7SBenjamin Herrenschmidt old_size = type->max * sizeof(struct memblock_region); 202142b45a7SBenjamin Herrenschmidt new_size = old_size << 1; 203142b45a7SBenjamin Herrenschmidt 204*181eb394SGavin Shan /* Retrieve the slab flag */ 205*181eb394SGavin Shan if (type == &memblock.memory) 206*181eb394SGavin Shan in_slab = &memblock_memory_in_slab; 207*181eb394SGavin Shan else 208*181eb394SGavin Shan in_slab = &memblock_reserved_in_slab; 209*181eb394SGavin Shan 210142b45a7SBenjamin Herrenschmidt /* Try to find some space for it. 211142b45a7SBenjamin Herrenschmidt * 212142b45a7SBenjamin Herrenschmidt * WARNING: We assume that either slab_is_available() and we use it or 213142b45a7SBenjamin Herrenschmidt * we use MEMBLOCK for allocations. That means that this is unsafe to use 214142b45a7SBenjamin Herrenschmidt * when bootmem is currently active (unless bootmem itself is implemented 215142b45a7SBenjamin Herrenschmidt * on top of MEMBLOCK which isn't the case yet) 216142b45a7SBenjamin Herrenschmidt * 217142b45a7SBenjamin Herrenschmidt * This should however not be an issue for now, as we currently only 218142b45a7SBenjamin Herrenschmidt * call into MEMBLOCK while it's still active, or much later when slab is 219142b45a7SBenjamin Herrenschmidt * active for memory hotplug operations 220142b45a7SBenjamin Herrenschmidt */ 221142b45a7SBenjamin Herrenschmidt if (use_slab) { 222142b45a7SBenjamin Herrenschmidt new_array = kmalloc(new_size, GFP_KERNEL); 2231f5026a7STejun Heo addr = new_array ? __pa(new_array) : 0; 2244e2f0775SGavin Shan } else { 225fc769a8eSTejun Heo addr = memblock_find_in_range(0, MEMBLOCK_ALLOC_ACCESSIBLE, new_size, sizeof(phys_addr_t)); 2264e2f0775SGavin Shan new_array = addr ? __va(addr) : 0; 2274e2f0775SGavin Shan } 2281f5026a7STejun Heo if (!addr) { 229142b45a7SBenjamin Herrenschmidt pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", 230142b45a7SBenjamin Herrenschmidt memblock_type_name(type), type->max, type->max * 2); 231142b45a7SBenjamin Herrenschmidt return -1; 232142b45a7SBenjamin Herrenschmidt } 233142b45a7SBenjamin Herrenschmidt 234ea9e4376SYinghai Lu memblock_dbg("memblock: %s array is doubled to %ld at [%#010llx-%#010llx]", 235ea9e4376SYinghai Lu memblock_type_name(type), type->max * 2, (u64)addr, (u64)addr + new_size - 1); 236ea9e4376SYinghai Lu 237142b45a7SBenjamin Herrenschmidt /* Found space, we now need to move the array over before 238142b45a7SBenjamin Herrenschmidt * we add the reserved region since it may be our reserved 239142b45a7SBenjamin Herrenschmidt * array itself that is full. 240142b45a7SBenjamin Herrenschmidt */ 241142b45a7SBenjamin Herrenschmidt memcpy(new_array, type->regions, old_size); 242142b45a7SBenjamin Herrenschmidt memset(new_array + type->max, 0, old_size); 243142b45a7SBenjamin Herrenschmidt old_array = type->regions; 244142b45a7SBenjamin Herrenschmidt type->regions = new_array; 245142b45a7SBenjamin Herrenschmidt type->max <<= 1; 246142b45a7SBenjamin Herrenschmidt 247*181eb394SGavin Shan /* Free old array. We needn't free it if the array is the 248*181eb394SGavin Shan * static one 249142b45a7SBenjamin Herrenschmidt */ 250*181eb394SGavin Shan if (*in_slab) 251*181eb394SGavin Shan kfree(old_array); 252*181eb394SGavin Shan else if (old_array != memblock_memory_init_regions && 253142b45a7SBenjamin Herrenschmidt old_array != memblock_reserved_init_regions) 254142b45a7SBenjamin Herrenschmidt memblock_free(__pa(old_array), old_size); 255142b45a7SBenjamin Herrenschmidt 256*181eb394SGavin Shan /* Reserve the new array if that comes from the memblock. 257*181eb394SGavin Shan * Otherwise, we needn't do it 258*181eb394SGavin Shan */ 259*181eb394SGavin Shan if (!use_slab) 260*181eb394SGavin Shan BUG_ON(memblock_reserve(addr, new_size)); 261*181eb394SGavin Shan 262*181eb394SGavin Shan /* Update slab flag */ 263*181eb394SGavin Shan *in_slab = use_slab; 264*181eb394SGavin Shan 265142b45a7SBenjamin Herrenschmidt return 0; 266142b45a7SBenjamin Herrenschmidt } 267142b45a7SBenjamin Herrenschmidt 268784656f9STejun Heo /** 269784656f9STejun Heo * memblock_merge_regions - merge neighboring compatible regions 270784656f9STejun Heo * @type: memblock type to scan 271784656f9STejun Heo * 272784656f9STejun Heo * Scan @type and merge neighboring compatible regions. 273784656f9STejun Heo */ 274784656f9STejun Heo static void __init_memblock memblock_merge_regions(struct memblock_type *type) 275784656f9STejun Heo { 276784656f9STejun Heo int i = 0; 277784656f9STejun Heo 278784656f9STejun Heo /* cnt never goes below 1 */ 279784656f9STejun Heo while (i < type->cnt - 1) { 280784656f9STejun Heo struct memblock_region *this = &type->regions[i]; 281784656f9STejun Heo struct memblock_region *next = &type->regions[i + 1]; 282784656f9STejun Heo 2837c0caeb8STejun Heo if (this->base + this->size != next->base || 2847c0caeb8STejun Heo memblock_get_region_node(this) != 2857c0caeb8STejun Heo memblock_get_region_node(next)) { 286784656f9STejun Heo BUG_ON(this->base + this->size > next->base); 287784656f9STejun Heo i++; 288784656f9STejun Heo continue; 289784656f9STejun Heo } 290784656f9STejun Heo 291784656f9STejun Heo this->size += next->size; 292784656f9STejun Heo memmove(next, next + 1, (type->cnt - (i + 1)) * sizeof(*next)); 293784656f9STejun Heo type->cnt--; 294784656f9STejun Heo } 295784656f9STejun Heo } 296784656f9STejun Heo 297784656f9STejun Heo /** 298784656f9STejun Heo * memblock_insert_region - insert new memblock region 299784656f9STejun Heo * @type: memblock type to insert into 300784656f9STejun Heo * @idx: index for the insertion point 301784656f9STejun Heo * @base: base address of the new region 302784656f9STejun Heo * @size: size of the new region 303784656f9STejun Heo * 304784656f9STejun Heo * Insert new memblock region [@base,@base+@size) into @type at @idx. 305784656f9STejun Heo * @type must already have extra room to accomodate the new region. 306784656f9STejun Heo */ 307784656f9STejun Heo static void __init_memblock memblock_insert_region(struct memblock_type *type, 308784656f9STejun Heo int idx, phys_addr_t base, 3097c0caeb8STejun Heo phys_addr_t size, int nid) 310784656f9STejun Heo { 311784656f9STejun Heo struct memblock_region *rgn = &type->regions[idx]; 312784656f9STejun Heo 313784656f9STejun Heo BUG_ON(type->cnt >= type->max); 314784656f9STejun Heo memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); 315784656f9STejun Heo rgn->base = base; 316784656f9STejun Heo rgn->size = size; 3177c0caeb8STejun Heo memblock_set_region_node(rgn, nid); 318784656f9STejun Heo type->cnt++; 3191440c4e2STejun Heo type->total_size += size; 320784656f9STejun Heo } 321784656f9STejun Heo 322784656f9STejun Heo /** 323784656f9STejun Heo * memblock_add_region - add new memblock region 324784656f9STejun Heo * @type: memblock type to add new region into 325784656f9STejun Heo * @base: base address of the new region 326784656f9STejun Heo * @size: size of the new region 3277fb0bc3fSTejun Heo * @nid: nid of the new region 328784656f9STejun Heo * 329784656f9STejun Heo * Add new memblock region [@base,@base+@size) into @type. The new region 330784656f9STejun Heo * is allowed to overlap with existing ones - overlaps don't affect already 331784656f9STejun Heo * existing regions. @type is guaranteed to be minimal (all neighbouring 332784656f9STejun Heo * compatible regions are merged) after the addition. 333784656f9STejun Heo * 334784656f9STejun Heo * RETURNS: 335784656f9STejun Heo * 0 on success, -errno on failure. 336784656f9STejun Heo */ 337581adcbeSTejun Heo static int __init_memblock memblock_add_region(struct memblock_type *type, 3387fb0bc3fSTejun Heo phys_addr_t base, phys_addr_t size, int nid) 33995f72d1eSYinghai Lu { 340784656f9STejun Heo bool insert = false; 341eb18f1b5STejun Heo phys_addr_t obase = base; 342eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 343784656f9STejun Heo int i, nr_new; 34495f72d1eSYinghai Lu 345b3dc627cSTejun Heo if (!size) 346b3dc627cSTejun Heo return 0; 347b3dc627cSTejun Heo 348784656f9STejun Heo /* special case for empty array */ 349784656f9STejun Heo if (type->regions[0].size == 0) { 3501440c4e2STejun Heo WARN_ON(type->cnt != 1 || type->total_size); 351784656f9STejun Heo type->regions[0].base = base; 352784656f9STejun Heo type->regions[0].size = size; 3537fb0bc3fSTejun Heo memblock_set_region_node(&type->regions[0], nid); 3541440c4e2STejun Heo type->total_size = size; 355784656f9STejun Heo return 0; 356784656f9STejun Heo } 357784656f9STejun Heo repeat: 358784656f9STejun Heo /* 359784656f9STejun Heo * The following is executed twice. Once with %false @insert and 360784656f9STejun Heo * then with %true. The first counts the number of regions needed 361784656f9STejun Heo * to accomodate the new area. The second actually inserts them. 362784656f9STejun Heo */ 363784656f9STejun Heo base = obase; 364784656f9STejun Heo nr_new = 0; 365784656f9STejun Heo 3668f7a6605SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 3678f7a6605SBenjamin Herrenschmidt struct memblock_region *rgn = &type->regions[i]; 368784656f9STejun Heo phys_addr_t rbase = rgn->base; 369784656f9STejun Heo phys_addr_t rend = rbase + rgn->size; 3708f7a6605SBenjamin Herrenschmidt 371784656f9STejun Heo if (rbase >= end) 3728f7a6605SBenjamin Herrenschmidt break; 373784656f9STejun Heo if (rend <= base) 374784656f9STejun Heo continue; 375784656f9STejun Heo /* 376784656f9STejun Heo * @rgn overlaps. If it separates the lower part of new 377784656f9STejun Heo * area, insert that portion. 3788f7a6605SBenjamin Herrenschmidt */ 379784656f9STejun Heo if (rbase > base) { 380784656f9STejun Heo nr_new++; 381784656f9STejun Heo if (insert) 382784656f9STejun Heo memblock_insert_region(type, i++, base, 3837fb0bc3fSTejun Heo rbase - base, nid); 384784656f9STejun Heo } 385784656f9STejun Heo /* area below @rend is dealt with, forget about it */ 386784656f9STejun Heo base = min(rend, end); 3878f7a6605SBenjamin Herrenschmidt } 3888f7a6605SBenjamin Herrenschmidt 389784656f9STejun Heo /* insert the remaining portion */ 390784656f9STejun Heo if (base < end) { 391784656f9STejun Heo nr_new++; 392784656f9STejun Heo if (insert) 3937fb0bc3fSTejun Heo memblock_insert_region(type, i, base, end - base, nid); 3948f7a6605SBenjamin Herrenschmidt } 3958f7a6605SBenjamin Herrenschmidt 396784656f9STejun Heo /* 397784656f9STejun Heo * If this was the first round, resize array and repeat for actual 398784656f9STejun Heo * insertions; otherwise, merge and return. 3998f7a6605SBenjamin Herrenschmidt */ 400784656f9STejun Heo if (!insert) { 401784656f9STejun Heo while (type->cnt + nr_new > type->max) 402784656f9STejun Heo if (memblock_double_array(type) < 0) 403784656f9STejun Heo return -ENOMEM; 404784656f9STejun Heo insert = true; 405784656f9STejun Heo goto repeat; 40695f72d1eSYinghai Lu } else { 407784656f9STejun Heo memblock_merge_regions(type); 40895f72d1eSYinghai Lu return 0; 40995f72d1eSYinghai Lu } 410784656f9STejun Heo } 41195f72d1eSYinghai Lu 4127fb0bc3fSTejun Heo int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size, 4137fb0bc3fSTejun Heo int nid) 4147fb0bc3fSTejun Heo { 4157fb0bc3fSTejun Heo return memblock_add_region(&memblock.memory, base, size, nid); 4167fb0bc3fSTejun Heo } 4177fb0bc3fSTejun Heo 418581adcbeSTejun Heo int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) 41995f72d1eSYinghai Lu { 4207fb0bc3fSTejun Heo return memblock_add_region(&memblock.memory, base, size, MAX_NUMNODES); 42195f72d1eSYinghai Lu } 42295f72d1eSYinghai Lu 4236a9ceb31STejun Heo /** 4246a9ceb31STejun Heo * memblock_isolate_range - isolate given range into disjoint memblocks 4256a9ceb31STejun Heo * @type: memblock type to isolate range for 4266a9ceb31STejun Heo * @base: base of range to isolate 4276a9ceb31STejun Heo * @size: size of range to isolate 4286a9ceb31STejun Heo * @start_rgn: out parameter for the start of isolated region 4296a9ceb31STejun Heo * @end_rgn: out parameter for the end of isolated region 4306a9ceb31STejun Heo * 4316a9ceb31STejun Heo * Walk @type and ensure that regions don't cross the boundaries defined by 4326a9ceb31STejun Heo * [@base,@base+@size). Crossing regions are split at the boundaries, 4336a9ceb31STejun Heo * which may create at most two more regions. The index of the first 4346a9ceb31STejun Heo * region inside the range is returned in *@start_rgn and end in *@end_rgn. 4356a9ceb31STejun Heo * 4366a9ceb31STejun Heo * RETURNS: 4376a9ceb31STejun Heo * 0 on success, -errno on failure. 4386a9ceb31STejun Heo */ 4396a9ceb31STejun Heo static int __init_memblock memblock_isolate_range(struct memblock_type *type, 4406a9ceb31STejun Heo phys_addr_t base, phys_addr_t size, 4416a9ceb31STejun Heo int *start_rgn, int *end_rgn) 4426a9ceb31STejun Heo { 443eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 4446a9ceb31STejun Heo int i; 4456a9ceb31STejun Heo 4466a9ceb31STejun Heo *start_rgn = *end_rgn = 0; 4476a9ceb31STejun Heo 448b3dc627cSTejun Heo if (!size) 449b3dc627cSTejun Heo return 0; 450b3dc627cSTejun Heo 4516a9ceb31STejun Heo /* we'll create at most two more regions */ 4526a9ceb31STejun Heo while (type->cnt + 2 > type->max) 4536a9ceb31STejun Heo if (memblock_double_array(type) < 0) 4546a9ceb31STejun Heo return -ENOMEM; 4556a9ceb31STejun Heo 4566a9ceb31STejun Heo for (i = 0; i < type->cnt; i++) { 4576a9ceb31STejun Heo struct memblock_region *rgn = &type->regions[i]; 4586a9ceb31STejun Heo phys_addr_t rbase = rgn->base; 4596a9ceb31STejun Heo phys_addr_t rend = rbase + rgn->size; 4606a9ceb31STejun Heo 4616a9ceb31STejun Heo if (rbase >= end) 4626a9ceb31STejun Heo break; 4636a9ceb31STejun Heo if (rend <= base) 4646a9ceb31STejun Heo continue; 4656a9ceb31STejun Heo 4666a9ceb31STejun Heo if (rbase < base) { 4676a9ceb31STejun Heo /* 4686a9ceb31STejun Heo * @rgn intersects from below. Split and continue 4696a9ceb31STejun Heo * to process the next region - the new top half. 4706a9ceb31STejun Heo */ 4716a9ceb31STejun Heo rgn->base = base; 4721440c4e2STejun Heo rgn->size -= base - rbase; 4731440c4e2STejun Heo type->total_size -= base - rbase; 4746a9ceb31STejun Heo memblock_insert_region(type, i, rbase, base - rbase, 47571936180STejun Heo memblock_get_region_node(rgn)); 4766a9ceb31STejun Heo } else if (rend > end) { 4776a9ceb31STejun Heo /* 4786a9ceb31STejun Heo * @rgn intersects from above. Split and redo the 4796a9ceb31STejun Heo * current region - the new bottom half. 4806a9ceb31STejun Heo */ 4816a9ceb31STejun Heo rgn->base = end; 4821440c4e2STejun Heo rgn->size -= end - rbase; 4831440c4e2STejun Heo type->total_size -= end - rbase; 4846a9ceb31STejun Heo memblock_insert_region(type, i--, rbase, end - rbase, 48571936180STejun Heo memblock_get_region_node(rgn)); 4866a9ceb31STejun Heo } else { 4876a9ceb31STejun Heo /* @rgn is fully contained, record it */ 4886a9ceb31STejun Heo if (!*end_rgn) 4896a9ceb31STejun Heo *start_rgn = i; 4906a9ceb31STejun Heo *end_rgn = i + 1; 4916a9ceb31STejun Heo } 4926a9ceb31STejun Heo } 4936a9ceb31STejun Heo 4946a9ceb31STejun Heo return 0; 4956a9ceb31STejun Heo } 4966a9ceb31STejun Heo 497581adcbeSTejun Heo static int __init_memblock __memblock_remove(struct memblock_type *type, 4988f7a6605SBenjamin Herrenschmidt phys_addr_t base, phys_addr_t size) 49995f72d1eSYinghai Lu { 50071936180STejun Heo int start_rgn, end_rgn; 50171936180STejun Heo int i, ret; 50295f72d1eSYinghai Lu 50371936180STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 50471936180STejun Heo if (ret) 50571936180STejun Heo return ret; 50695f72d1eSYinghai Lu 50771936180STejun Heo for (i = end_rgn - 1; i >= start_rgn; i--) 50871936180STejun Heo memblock_remove_region(type, i); 50995f72d1eSYinghai Lu return 0; 51095f72d1eSYinghai Lu } 51195f72d1eSYinghai Lu 512581adcbeSTejun Heo int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) 51395f72d1eSYinghai Lu { 51495f72d1eSYinghai Lu return __memblock_remove(&memblock.memory, base, size); 51595f72d1eSYinghai Lu } 51695f72d1eSYinghai Lu 517581adcbeSTejun Heo int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) 51895f72d1eSYinghai Lu { 51924aa0788STejun Heo memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n", 520a150439cSH. Peter Anvin (unsigned long long)base, 521a150439cSH. Peter Anvin (unsigned long long)base + size, 522a150439cSH. Peter Anvin (void *)_RET_IP_); 52324aa0788STejun Heo 52495f72d1eSYinghai Lu return __memblock_remove(&memblock.reserved, base, size); 52595f72d1eSYinghai Lu } 52695f72d1eSYinghai Lu 527581adcbeSTejun Heo int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) 52895f72d1eSYinghai Lu { 529e3239ff9SBenjamin Herrenschmidt struct memblock_type *_rgn = &memblock.reserved; 53095f72d1eSYinghai Lu 53124aa0788STejun Heo memblock_dbg("memblock_reserve: [%#016llx-%#016llx] %pF\n", 532a150439cSH. Peter Anvin (unsigned long long)base, 533a150439cSH. Peter Anvin (unsigned long long)base + size, 534a150439cSH. Peter Anvin (void *)_RET_IP_); 53595f72d1eSYinghai Lu 5367fb0bc3fSTejun Heo return memblock_add_region(_rgn, base, size, MAX_NUMNODES); 53795f72d1eSYinghai Lu } 53895f72d1eSYinghai Lu 53935fd0808STejun Heo /** 54035fd0808STejun Heo * __next_free_mem_range - next function for for_each_free_mem_range() 54135fd0808STejun Heo * @idx: pointer to u64 loop variable 54235fd0808STejun Heo * @nid: nid: node selector, %MAX_NUMNODES for all nodes 54335fd0808STejun Heo * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL 54435fd0808STejun Heo * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL 54535fd0808STejun Heo * @p_nid: ptr to int for nid of the range, can be %NULL 54635fd0808STejun Heo * 54735fd0808STejun Heo * Find the first free area from *@idx which matches @nid, fill the out 54835fd0808STejun Heo * parameters, and update *@idx for the next iteration. The lower 32bit of 54935fd0808STejun Heo * *@idx contains index into memory region and the upper 32bit indexes the 55035fd0808STejun Heo * areas before each reserved region. For example, if reserved regions 55135fd0808STejun Heo * look like the following, 55235fd0808STejun Heo * 55335fd0808STejun Heo * 0:[0-16), 1:[32-48), 2:[128-130) 55435fd0808STejun Heo * 55535fd0808STejun Heo * The upper 32bit indexes the following regions. 55635fd0808STejun Heo * 55735fd0808STejun Heo * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX) 55835fd0808STejun Heo * 55935fd0808STejun Heo * As both region arrays are sorted, the function advances the two indices 56035fd0808STejun Heo * in lockstep and returns each intersection. 56135fd0808STejun Heo */ 56235fd0808STejun Heo void __init_memblock __next_free_mem_range(u64 *idx, int nid, 56335fd0808STejun Heo phys_addr_t *out_start, 56435fd0808STejun Heo phys_addr_t *out_end, int *out_nid) 56535fd0808STejun Heo { 56635fd0808STejun Heo struct memblock_type *mem = &memblock.memory; 56735fd0808STejun Heo struct memblock_type *rsv = &memblock.reserved; 56835fd0808STejun Heo int mi = *idx & 0xffffffff; 56935fd0808STejun Heo int ri = *idx >> 32; 57035fd0808STejun Heo 57135fd0808STejun Heo for ( ; mi < mem->cnt; mi++) { 57235fd0808STejun Heo struct memblock_region *m = &mem->regions[mi]; 57335fd0808STejun Heo phys_addr_t m_start = m->base; 57435fd0808STejun Heo phys_addr_t m_end = m->base + m->size; 57535fd0808STejun Heo 57635fd0808STejun Heo /* only memory regions are associated with nodes, check it */ 57735fd0808STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 57835fd0808STejun Heo continue; 57935fd0808STejun Heo 58035fd0808STejun Heo /* scan areas before each reservation for intersection */ 58135fd0808STejun Heo for ( ; ri < rsv->cnt + 1; ri++) { 58235fd0808STejun Heo struct memblock_region *r = &rsv->regions[ri]; 58335fd0808STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 58435fd0808STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 58535fd0808STejun Heo 58635fd0808STejun Heo /* if ri advanced past mi, break out to advance mi */ 58735fd0808STejun Heo if (r_start >= m_end) 58835fd0808STejun Heo break; 58935fd0808STejun Heo /* if the two regions intersect, we're done */ 59035fd0808STejun Heo if (m_start < r_end) { 59135fd0808STejun Heo if (out_start) 59235fd0808STejun Heo *out_start = max(m_start, r_start); 59335fd0808STejun Heo if (out_end) 59435fd0808STejun Heo *out_end = min(m_end, r_end); 59535fd0808STejun Heo if (out_nid) 59635fd0808STejun Heo *out_nid = memblock_get_region_node(m); 59735fd0808STejun Heo /* 59835fd0808STejun Heo * The region which ends first is advanced 59935fd0808STejun Heo * for the next iteration. 60035fd0808STejun Heo */ 60135fd0808STejun Heo if (m_end <= r_end) 60235fd0808STejun Heo mi++; 60335fd0808STejun Heo else 60435fd0808STejun Heo ri++; 60535fd0808STejun Heo *idx = (u32)mi | (u64)ri << 32; 60635fd0808STejun Heo return; 60735fd0808STejun Heo } 60835fd0808STejun Heo } 60935fd0808STejun Heo } 61035fd0808STejun Heo 61135fd0808STejun Heo /* signal end of iteration */ 61235fd0808STejun Heo *idx = ULLONG_MAX; 61335fd0808STejun Heo } 61435fd0808STejun Heo 6157bd0b0f0STejun Heo /** 6167bd0b0f0STejun Heo * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse() 6177bd0b0f0STejun Heo * @idx: pointer to u64 loop variable 6187bd0b0f0STejun Heo * @nid: nid: node selector, %MAX_NUMNODES for all nodes 6197bd0b0f0STejun Heo * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL 6207bd0b0f0STejun Heo * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL 6217bd0b0f0STejun Heo * @p_nid: ptr to int for nid of the range, can be %NULL 6227bd0b0f0STejun Heo * 6237bd0b0f0STejun Heo * Reverse of __next_free_mem_range(). 6247bd0b0f0STejun Heo */ 6257bd0b0f0STejun Heo void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid, 6267bd0b0f0STejun Heo phys_addr_t *out_start, 6277bd0b0f0STejun Heo phys_addr_t *out_end, int *out_nid) 6287bd0b0f0STejun Heo { 6297bd0b0f0STejun Heo struct memblock_type *mem = &memblock.memory; 6307bd0b0f0STejun Heo struct memblock_type *rsv = &memblock.reserved; 6317bd0b0f0STejun Heo int mi = *idx & 0xffffffff; 6327bd0b0f0STejun Heo int ri = *idx >> 32; 6337bd0b0f0STejun Heo 6347bd0b0f0STejun Heo if (*idx == (u64)ULLONG_MAX) { 6357bd0b0f0STejun Heo mi = mem->cnt - 1; 6367bd0b0f0STejun Heo ri = rsv->cnt; 6377bd0b0f0STejun Heo } 6387bd0b0f0STejun Heo 6397bd0b0f0STejun Heo for ( ; mi >= 0; mi--) { 6407bd0b0f0STejun Heo struct memblock_region *m = &mem->regions[mi]; 6417bd0b0f0STejun Heo phys_addr_t m_start = m->base; 6427bd0b0f0STejun Heo phys_addr_t m_end = m->base + m->size; 6437bd0b0f0STejun Heo 6447bd0b0f0STejun Heo /* only memory regions are associated with nodes, check it */ 6457bd0b0f0STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 6467bd0b0f0STejun Heo continue; 6477bd0b0f0STejun Heo 6487bd0b0f0STejun Heo /* scan areas before each reservation for intersection */ 6497bd0b0f0STejun Heo for ( ; ri >= 0; ri--) { 6507bd0b0f0STejun Heo struct memblock_region *r = &rsv->regions[ri]; 6517bd0b0f0STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 6527bd0b0f0STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 6537bd0b0f0STejun Heo 6547bd0b0f0STejun Heo /* if ri advanced past mi, break out to advance mi */ 6557bd0b0f0STejun Heo if (r_end <= m_start) 6567bd0b0f0STejun Heo break; 6577bd0b0f0STejun Heo /* if the two regions intersect, we're done */ 6587bd0b0f0STejun Heo if (m_end > r_start) { 6597bd0b0f0STejun Heo if (out_start) 6607bd0b0f0STejun Heo *out_start = max(m_start, r_start); 6617bd0b0f0STejun Heo if (out_end) 6627bd0b0f0STejun Heo *out_end = min(m_end, r_end); 6637bd0b0f0STejun Heo if (out_nid) 6647bd0b0f0STejun Heo *out_nid = memblock_get_region_node(m); 6657bd0b0f0STejun Heo 6667bd0b0f0STejun Heo if (m_start >= r_start) 6677bd0b0f0STejun Heo mi--; 6687bd0b0f0STejun Heo else 6697bd0b0f0STejun Heo ri--; 6707bd0b0f0STejun Heo *idx = (u32)mi | (u64)ri << 32; 6717bd0b0f0STejun Heo return; 6727bd0b0f0STejun Heo } 6737bd0b0f0STejun Heo } 6747bd0b0f0STejun Heo } 6757bd0b0f0STejun Heo 6767bd0b0f0STejun Heo *idx = ULLONG_MAX; 6777bd0b0f0STejun Heo } 6787bd0b0f0STejun Heo 6797c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 6807c0caeb8STejun Heo /* 6817c0caeb8STejun Heo * Common iterator interface used to define for_each_mem_range(). 6827c0caeb8STejun Heo */ 6837c0caeb8STejun Heo void __init_memblock __next_mem_pfn_range(int *idx, int nid, 6847c0caeb8STejun Heo unsigned long *out_start_pfn, 6857c0caeb8STejun Heo unsigned long *out_end_pfn, int *out_nid) 6867c0caeb8STejun Heo { 6877c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 6887c0caeb8STejun Heo struct memblock_region *r; 6897c0caeb8STejun Heo 6907c0caeb8STejun Heo while (++*idx < type->cnt) { 6917c0caeb8STejun Heo r = &type->regions[*idx]; 6927c0caeb8STejun Heo 6937c0caeb8STejun Heo if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size)) 6947c0caeb8STejun Heo continue; 6957c0caeb8STejun Heo if (nid == MAX_NUMNODES || nid == r->nid) 6967c0caeb8STejun Heo break; 6977c0caeb8STejun Heo } 6987c0caeb8STejun Heo if (*idx >= type->cnt) { 6997c0caeb8STejun Heo *idx = -1; 7007c0caeb8STejun Heo return; 7017c0caeb8STejun Heo } 7027c0caeb8STejun Heo 7037c0caeb8STejun Heo if (out_start_pfn) 7047c0caeb8STejun Heo *out_start_pfn = PFN_UP(r->base); 7057c0caeb8STejun Heo if (out_end_pfn) 7067c0caeb8STejun Heo *out_end_pfn = PFN_DOWN(r->base + r->size); 7077c0caeb8STejun Heo if (out_nid) 7087c0caeb8STejun Heo *out_nid = r->nid; 7097c0caeb8STejun Heo } 7107c0caeb8STejun Heo 7117c0caeb8STejun Heo /** 7127c0caeb8STejun Heo * memblock_set_node - set node ID on memblock regions 7137c0caeb8STejun Heo * @base: base of area to set node ID for 7147c0caeb8STejun Heo * @size: size of area to set node ID for 7157c0caeb8STejun Heo * @nid: node ID to set 7167c0caeb8STejun Heo * 7177c0caeb8STejun Heo * Set the nid of memblock memory regions in [@base,@base+@size) to @nid. 7187c0caeb8STejun Heo * Regions which cross the area boundaries are split as necessary. 7197c0caeb8STejun Heo * 7207c0caeb8STejun Heo * RETURNS: 7217c0caeb8STejun Heo * 0 on success, -errno on failure. 7227c0caeb8STejun Heo */ 7237c0caeb8STejun Heo int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size, 7247c0caeb8STejun Heo int nid) 7257c0caeb8STejun Heo { 7267c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 7276a9ceb31STejun Heo int start_rgn, end_rgn; 7286a9ceb31STejun Heo int i, ret; 7297c0caeb8STejun Heo 7306a9ceb31STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 7316a9ceb31STejun Heo if (ret) 7326a9ceb31STejun Heo return ret; 7337c0caeb8STejun Heo 7346a9ceb31STejun Heo for (i = start_rgn; i < end_rgn; i++) 7356a9ceb31STejun Heo type->regions[i].nid = nid; 7367c0caeb8STejun Heo 7377c0caeb8STejun Heo memblock_merge_regions(type); 7387c0caeb8STejun Heo return 0; 7397c0caeb8STejun Heo } 7407c0caeb8STejun Heo #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ 7417c0caeb8STejun Heo 7427bd0b0f0STejun Heo static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size, 7437bd0b0f0STejun Heo phys_addr_t align, phys_addr_t max_addr, 7447bd0b0f0STejun Heo int nid) 74595f72d1eSYinghai Lu { 7466ed311b2SBenjamin Herrenschmidt phys_addr_t found; 74795f72d1eSYinghai Lu 748847854f5STejun Heo /* align @size to avoid excessive fragmentation on reserved array */ 749847854f5STejun Heo size = round_up(size, align); 750847854f5STejun Heo 7517bd0b0f0STejun Heo found = memblock_find_in_range_node(0, max_addr, size, align, nid); 7529c8c27e2STejun Heo if (found && !memblock_reserve(found, size)) 7536ed311b2SBenjamin Herrenschmidt return found; 7546ed311b2SBenjamin Herrenschmidt 7556ed311b2SBenjamin Herrenschmidt return 0; 75695f72d1eSYinghai Lu } 75795f72d1eSYinghai Lu 7587bd0b0f0STejun Heo phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) 7597bd0b0f0STejun Heo { 7607bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid); 7617bd0b0f0STejun Heo } 7627bd0b0f0STejun Heo 7637bd0b0f0STejun Heo phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 7647bd0b0f0STejun Heo { 7657bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES); 7667bd0b0f0STejun Heo } 7677bd0b0f0STejun Heo 7686ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 76995f72d1eSYinghai Lu { 7706ed311b2SBenjamin Herrenschmidt phys_addr_t alloc; 7716ed311b2SBenjamin Herrenschmidt 7726ed311b2SBenjamin Herrenschmidt alloc = __memblock_alloc_base(size, align, max_addr); 7736ed311b2SBenjamin Herrenschmidt 7746ed311b2SBenjamin Herrenschmidt if (alloc == 0) 7756ed311b2SBenjamin Herrenschmidt panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", 7766ed311b2SBenjamin Herrenschmidt (unsigned long long) size, (unsigned long long) max_addr); 7776ed311b2SBenjamin Herrenschmidt 7786ed311b2SBenjamin Herrenschmidt return alloc; 77995f72d1eSYinghai Lu } 78095f72d1eSYinghai Lu 7816ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) 78295f72d1eSYinghai Lu { 7836ed311b2SBenjamin Herrenschmidt return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 78495f72d1eSYinghai Lu } 78595f72d1eSYinghai Lu 7869d1e2492SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) 7879d1e2492SBenjamin Herrenschmidt { 7889d1e2492SBenjamin Herrenschmidt phys_addr_t res = memblock_alloc_nid(size, align, nid); 7899d1e2492SBenjamin Herrenschmidt 7909d1e2492SBenjamin Herrenschmidt if (res) 7919d1e2492SBenjamin Herrenschmidt return res; 79215fb0972STejun Heo return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 79395f72d1eSYinghai Lu } 79495f72d1eSYinghai Lu 7959d1e2492SBenjamin Herrenschmidt 7969d1e2492SBenjamin Herrenschmidt /* 7979d1e2492SBenjamin Herrenschmidt * Remaining API functions 7989d1e2492SBenjamin Herrenschmidt */ 7999d1e2492SBenjamin Herrenschmidt 8002898cc4cSBenjamin Herrenschmidt phys_addr_t __init memblock_phys_mem_size(void) 80195f72d1eSYinghai Lu { 8021440c4e2STejun Heo return memblock.memory.total_size; 80395f72d1eSYinghai Lu } 80495f72d1eSYinghai Lu 8050a93ebefSSam Ravnborg /* lowest address */ 8060a93ebefSSam Ravnborg phys_addr_t __init_memblock memblock_start_of_DRAM(void) 8070a93ebefSSam Ravnborg { 8080a93ebefSSam Ravnborg return memblock.memory.regions[0].base; 8090a93ebefSSam Ravnborg } 8100a93ebefSSam Ravnborg 81110d06439SYinghai Lu phys_addr_t __init_memblock memblock_end_of_DRAM(void) 81295f72d1eSYinghai Lu { 81395f72d1eSYinghai Lu int idx = memblock.memory.cnt - 1; 81495f72d1eSYinghai Lu 815e3239ff9SBenjamin Herrenschmidt return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); 81695f72d1eSYinghai Lu } 81795f72d1eSYinghai Lu 818c0ce8fefSTejun Heo void __init memblock_enforce_memory_limit(phys_addr_t limit) 81995f72d1eSYinghai Lu { 82095f72d1eSYinghai Lu unsigned long i; 821c0ce8fefSTejun Heo phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX; 82295f72d1eSYinghai Lu 823c0ce8fefSTejun Heo if (!limit) 82495f72d1eSYinghai Lu return; 82595f72d1eSYinghai Lu 826c0ce8fefSTejun Heo /* find out max address */ 82795f72d1eSYinghai Lu for (i = 0; i < memblock.memory.cnt; i++) { 828c0ce8fefSTejun Heo struct memblock_region *r = &memblock.memory.regions[i]; 82995f72d1eSYinghai Lu 830c0ce8fefSTejun Heo if (limit <= r->size) { 831c0ce8fefSTejun Heo max_addr = r->base + limit; 83295f72d1eSYinghai Lu break; 83395f72d1eSYinghai Lu } 834c0ce8fefSTejun Heo limit -= r->size; 83595f72d1eSYinghai Lu } 836c0ce8fefSTejun Heo 837c0ce8fefSTejun Heo /* truncate both memory and reserved regions */ 838c0ce8fefSTejun Heo __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX); 839c0ce8fefSTejun Heo __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX); 84095f72d1eSYinghai Lu } 84195f72d1eSYinghai Lu 842cd79481dSYinghai Lu static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) 84372d4b0b4SBenjamin Herrenschmidt { 84472d4b0b4SBenjamin Herrenschmidt unsigned int left = 0, right = type->cnt; 84572d4b0b4SBenjamin Herrenschmidt 84672d4b0b4SBenjamin Herrenschmidt do { 84772d4b0b4SBenjamin Herrenschmidt unsigned int mid = (right + left) / 2; 84872d4b0b4SBenjamin Herrenschmidt 84972d4b0b4SBenjamin Herrenschmidt if (addr < type->regions[mid].base) 85072d4b0b4SBenjamin Herrenschmidt right = mid; 85172d4b0b4SBenjamin Herrenschmidt else if (addr >= (type->regions[mid].base + 85272d4b0b4SBenjamin Herrenschmidt type->regions[mid].size)) 85372d4b0b4SBenjamin Herrenschmidt left = mid + 1; 85472d4b0b4SBenjamin Herrenschmidt else 85572d4b0b4SBenjamin Herrenschmidt return mid; 85672d4b0b4SBenjamin Herrenschmidt } while (left < right); 85772d4b0b4SBenjamin Herrenschmidt return -1; 85872d4b0b4SBenjamin Herrenschmidt } 85972d4b0b4SBenjamin Herrenschmidt 8602898cc4cSBenjamin Herrenschmidt int __init memblock_is_reserved(phys_addr_t addr) 86195f72d1eSYinghai Lu { 86272d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.reserved, addr) != -1; 86395f72d1eSYinghai Lu } 86472d4b0b4SBenjamin Herrenschmidt 8653661ca66SYinghai Lu int __init_memblock memblock_is_memory(phys_addr_t addr) 86672d4b0b4SBenjamin Herrenschmidt { 86772d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.memory, addr) != -1; 86872d4b0b4SBenjamin Herrenschmidt } 86972d4b0b4SBenjamin Herrenschmidt 8703661ca66SYinghai Lu int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) 87172d4b0b4SBenjamin Herrenschmidt { 872abb65272STomi Valkeinen int idx = memblock_search(&memblock.memory, base); 873eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 87472d4b0b4SBenjamin Herrenschmidt 87572d4b0b4SBenjamin Herrenschmidt if (idx == -1) 87695f72d1eSYinghai Lu return 0; 877abb65272STomi Valkeinen return memblock.memory.regions[idx].base <= base && 878abb65272STomi Valkeinen (memblock.memory.regions[idx].base + 879eb18f1b5STejun Heo memblock.memory.regions[idx].size) >= end; 88095f72d1eSYinghai Lu } 88195f72d1eSYinghai Lu 88210d06439SYinghai Lu int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) 88395f72d1eSYinghai Lu { 884eb18f1b5STejun Heo memblock_cap_size(base, &size); 885f1c2c19cSBenjamin Herrenschmidt return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; 88695f72d1eSYinghai Lu } 88795f72d1eSYinghai Lu 888e63075a3SBenjamin Herrenschmidt 8893661ca66SYinghai Lu void __init_memblock memblock_set_current_limit(phys_addr_t limit) 890e63075a3SBenjamin Herrenschmidt { 891e63075a3SBenjamin Herrenschmidt memblock.current_limit = limit; 892e63075a3SBenjamin Herrenschmidt } 893e63075a3SBenjamin Herrenschmidt 8947c0caeb8STejun Heo static void __init_memblock memblock_dump(struct memblock_type *type, char *name) 8956ed311b2SBenjamin Herrenschmidt { 8966ed311b2SBenjamin Herrenschmidt unsigned long long base, size; 8976ed311b2SBenjamin Herrenschmidt int i; 8986ed311b2SBenjamin Herrenschmidt 8997c0caeb8STejun Heo pr_info(" %s.cnt = 0x%lx\n", name, type->cnt); 9006ed311b2SBenjamin Herrenschmidt 9017c0caeb8STejun Heo for (i = 0; i < type->cnt; i++) { 9027c0caeb8STejun Heo struct memblock_region *rgn = &type->regions[i]; 9037c0caeb8STejun Heo char nid_buf[32] = ""; 9046ed311b2SBenjamin Herrenschmidt 9057c0caeb8STejun Heo base = rgn->base; 9067c0caeb8STejun Heo size = rgn->size; 9077c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 9087c0caeb8STejun Heo if (memblock_get_region_node(rgn) != MAX_NUMNODES) 9097c0caeb8STejun Heo snprintf(nid_buf, sizeof(nid_buf), " on node %d", 9107c0caeb8STejun Heo memblock_get_region_node(rgn)); 9117c0caeb8STejun Heo #endif 9127c0caeb8STejun Heo pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s\n", 9137c0caeb8STejun Heo name, i, base, base + size - 1, size, nid_buf); 9146ed311b2SBenjamin Herrenschmidt } 9156ed311b2SBenjamin Herrenschmidt } 9166ed311b2SBenjamin Herrenschmidt 9174ff7b82fSTejun Heo void __init_memblock __memblock_dump_all(void) 9186ed311b2SBenjamin Herrenschmidt { 9196ed311b2SBenjamin Herrenschmidt pr_info("MEMBLOCK configuration:\n"); 9201440c4e2STejun Heo pr_info(" memory size = %#llx reserved size = %#llx\n", 9211440c4e2STejun Heo (unsigned long long)memblock.memory.total_size, 9221440c4e2STejun Heo (unsigned long long)memblock.reserved.total_size); 9236ed311b2SBenjamin Herrenschmidt 9246ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.memory, "memory"); 9256ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.reserved, "reserved"); 9266ed311b2SBenjamin Herrenschmidt } 9276ed311b2SBenjamin Herrenschmidt 9281aadc056STejun Heo void __init memblock_allow_resize(void) 9296ed311b2SBenjamin Herrenschmidt { 930142b45a7SBenjamin Herrenschmidt memblock_can_resize = 1; 9316ed311b2SBenjamin Herrenschmidt } 9326ed311b2SBenjamin Herrenschmidt 9336ed311b2SBenjamin Herrenschmidt static int __init early_memblock(char *p) 9346ed311b2SBenjamin Herrenschmidt { 9356ed311b2SBenjamin Herrenschmidt if (p && strstr(p, "debug")) 9366ed311b2SBenjamin Herrenschmidt memblock_debug = 1; 9376ed311b2SBenjamin Herrenschmidt return 0; 9386ed311b2SBenjamin Herrenschmidt } 9396ed311b2SBenjamin Herrenschmidt early_param("memblock", early_memblock); 9406ed311b2SBenjamin Herrenschmidt 941c378ddd5STejun Heo #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK) 9426d03b885SBenjamin Herrenschmidt 9436d03b885SBenjamin Herrenschmidt static int memblock_debug_show(struct seq_file *m, void *private) 9446d03b885SBenjamin Herrenschmidt { 9456d03b885SBenjamin Herrenschmidt struct memblock_type *type = m->private; 9466d03b885SBenjamin Herrenschmidt struct memblock_region *reg; 9476d03b885SBenjamin Herrenschmidt int i; 9486d03b885SBenjamin Herrenschmidt 9496d03b885SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 9506d03b885SBenjamin Herrenschmidt reg = &type->regions[i]; 9516d03b885SBenjamin Herrenschmidt seq_printf(m, "%4d: ", i); 9526d03b885SBenjamin Herrenschmidt if (sizeof(phys_addr_t) == 4) 9536d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%08lx..0x%08lx\n", 9546d03b885SBenjamin Herrenschmidt (unsigned long)reg->base, 9556d03b885SBenjamin Herrenschmidt (unsigned long)(reg->base + reg->size - 1)); 9566d03b885SBenjamin Herrenschmidt else 9576d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%016llx..0x%016llx\n", 9586d03b885SBenjamin Herrenschmidt (unsigned long long)reg->base, 9596d03b885SBenjamin Herrenschmidt (unsigned long long)(reg->base + reg->size - 1)); 9606d03b885SBenjamin Herrenschmidt 9616d03b885SBenjamin Herrenschmidt } 9626d03b885SBenjamin Herrenschmidt return 0; 9636d03b885SBenjamin Herrenschmidt } 9646d03b885SBenjamin Herrenschmidt 9656d03b885SBenjamin Herrenschmidt static int memblock_debug_open(struct inode *inode, struct file *file) 9666d03b885SBenjamin Herrenschmidt { 9676d03b885SBenjamin Herrenschmidt return single_open(file, memblock_debug_show, inode->i_private); 9686d03b885SBenjamin Herrenschmidt } 9696d03b885SBenjamin Herrenschmidt 9706d03b885SBenjamin Herrenschmidt static const struct file_operations memblock_debug_fops = { 9716d03b885SBenjamin Herrenschmidt .open = memblock_debug_open, 9726d03b885SBenjamin Herrenschmidt .read = seq_read, 9736d03b885SBenjamin Herrenschmidt .llseek = seq_lseek, 9746d03b885SBenjamin Herrenschmidt .release = single_release, 9756d03b885SBenjamin Herrenschmidt }; 9766d03b885SBenjamin Herrenschmidt 9776d03b885SBenjamin Herrenschmidt static int __init memblock_init_debugfs(void) 9786d03b885SBenjamin Herrenschmidt { 9796d03b885SBenjamin Herrenschmidt struct dentry *root = debugfs_create_dir("memblock", NULL); 9806d03b885SBenjamin Herrenschmidt if (!root) 9816d03b885SBenjamin Herrenschmidt return -ENXIO; 9826d03b885SBenjamin Herrenschmidt debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); 9836d03b885SBenjamin Herrenschmidt debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); 9846d03b885SBenjamin Herrenschmidt 9856d03b885SBenjamin Herrenschmidt return 0; 9866d03b885SBenjamin Herrenschmidt } 9876d03b885SBenjamin Herrenschmidt __initcall(memblock_init_debugfs); 9886d03b885SBenjamin Herrenschmidt 9896d03b885SBenjamin Herrenschmidt #endif /* CONFIG_DEBUG_FS */ 990