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; 4095f72d1eSYinghai Lu 41142b45a7SBenjamin Herrenschmidt /* inline so we don't get a warning when pr_debug is compiled out */ 42142b45a7SBenjamin Herrenschmidt static inline const char *memblock_type_name(struct memblock_type *type) 43142b45a7SBenjamin Herrenschmidt { 44142b45a7SBenjamin Herrenschmidt if (type == &memblock.memory) 45142b45a7SBenjamin Herrenschmidt return "memory"; 46142b45a7SBenjamin Herrenschmidt else if (type == &memblock.reserved) 47142b45a7SBenjamin Herrenschmidt return "reserved"; 48142b45a7SBenjamin Herrenschmidt else 49142b45a7SBenjamin Herrenschmidt return "unknown"; 50142b45a7SBenjamin Herrenschmidt } 51142b45a7SBenjamin Herrenschmidt 52eb18f1b5STejun Heo /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */ 53eb18f1b5STejun Heo static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size) 54eb18f1b5STejun Heo { 55eb18f1b5STejun Heo return *size = min(*size, (phys_addr_t)ULLONG_MAX - base); 56eb18f1b5STejun Heo } 57eb18f1b5STejun Heo 586ed311b2SBenjamin Herrenschmidt /* 596ed311b2SBenjamin Herrenschmidt * Address comparison utilities 606ed311b2SBenjamin Herrenschmidt */ 6110d06439SYinghai Lu static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, 622898cc4cSBenjamin Herrenschmidt phys_addr_t base2, phys_addr_t size2) 6395f72d1eSYinghai Lu { 6495f72d1eSYinghai Lu return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); 6595f72d1eSYinghai Lu } 6695f72d1eSYinghai Lu 672d7d3eb2SH Hartley Sweeten static long __init_memblock memblock_overlaps_region(struct memblock_type *type, 682d7d3eb2SH Hartley Sweeten phys_addr_t base, phys_addr_t size) 696ed311b2SBenjamin Herrenschmidt { 706ed311b2SBenjamin Herrenschmidt unsigned long i; 716ed311b2SBenjamin Herrenschmidt 726ed311b2SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 736ed311b2SBenjamin Herrenschmidt phys_addr_t rgnbase = type->regions[i].base; 746ed311b2SBenjamin Herrenschmidt phys_addr_t rgnsize = type->regions[i].size; 756ed311b2SBenjamin Herrenschmidt if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) 766ed311b2SBenjamin Herrenschmidt break; 776ed311b2SBenjamin Herrenschmidt } 786ed311b2SBenjamin Herrenschmidt 796ed311b2SBenjamin Herrenschmidt return (i < type->cnt) ? i : -1; 806ed311b2SBenjamin Herrenschmidt } 816ed311b2SBenjamin Herrenschmidt 82*7bd0b0f0STejun Heo /** 83*7bd0b0f0STejun Heo * memblock_find_in_range_node - find free area in given range and node 84*7bd0b0f0STejun Heo * @start: start of candidate range 85*7bd0b0f0STejun Heo * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 86*7bd0b0f0STejun Heo * @size: size of free area to find 87*7bd0b0f0STejun Heo * @align: alignment of free area to find 88*7bd0b0f0STejun Heo * @nid: nid of the free area to find, %MAX_NUMNODES for any node 89*7bd0b0f0STejun Heo * 90*7bd0b0f0STejun Heo * Find @size free area aligned to @align in the specified range and node. 91*7bd0b0f0STejun Heo * 92*7bd0b0f0STejun Heo * RETURNS: 93*7bd0b0f0STejun Heo * Found address on success, %0 on failure. 946ed311b2SBenjamin Herrenschmidt */ 95*7bd0b0f0STejun Heo phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t start, 96*7bd0b0f0STejun Heo phys_addr_t end, phys_addr_t size, 97*7bd0b0f0STejun Heo phys_addr_t align, int nid) 986ed311b2SBenjamin Herrenschmidt { 99*7bd0b0f0STejun Heo phys_addr_t this_start, this_end, cand; 100*7bd0b0f0STejun Heo u64 i; 1016ed311b2SBenjamin Herrenschmidt 102*7bd0b0f0STejun Heo /* align @size to avoid excessive fragmentation on reserved array */ 103*7bd0b0f0STejun Heo size = round_up(size, align); 104f1af98c7SYinghai Lu 105*7bd0b0f0STejun Heo /* pump up @end */ 106fef501d4SBenjamin Herrenschmidt if (end == MEMBLOCK_ALLOC_ACCESSIBLE) 107fef501d4SBenjamin Herrenschmidt end = memblock.current_limit; 1086ed311b2SBenjamin Herrenschmidt 109*7bd0b0f0STejun Heo /* adjust @start to avoid underflow and allocating the first page */ 110*7bd0b0f0STejun Heo start = max3(start, size, (phys_addr_t)PAGE_SIZE); 111*7bd0b0f0STejun Heo end = max(start, end); 1126ed311b2SBenjamin Herrenschmidt 113*7bd0b0f0STejun Heo for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) { 114*7bd0b0f0STejun Heo this_start = clamp(this_start, start, end); 115*7bd0b0f0STejun Heo this_end = clamp(this_end, start, end); 116*7bd0b0f0STejun Heo 117*7bd0b0f0STejun Heo cand = round_down(this_end - size, align); 118*7bd0b0f0STejun Heo if (cand >= this_start) 119*7bd0b0f0STejun Heo return cand; 1206ed311b2SBenjamin Herrenschmidt } 1211f5026a7STejun Heo return 0; 1226ed311b2SBenjamin Herrenschmidt } 1236ed311b2SBenjamin Herrenschmidt 124*7bd0b0f0STejun Heo /** 125*7bd0b0f0STejun Heo * memblock_find_in_range - find free area in given range 126*7bd0b0f0STejun Heo * @start: start of candidate range 127*7bd0b0f0STejun Heo * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 128*7bd0b0f0STejun Heo * @size: size of free area to find 129*7bd0b0f0STejun Heo * @align: alignment of free area to find 130*7bd0b0f0STejun Heo * 131*7bd0b0f0STejun Heo * Find @size free area aligned to @align in the specified range. 132*7bd0b0f0STejun Heo * 133*7bd0b0f0STejun Heo * RETURNS: 134*7bd0b0f0STejun Heo * Found address on success, %0 on failure. 135*7bd0b0f0STejun Heo */ 136*7bd0b0f0STejun Heo phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, 137*7bd0b0f0STejun Heo phys_addr_t end, phys_addr_t size, 138*7bd0b0f0STejun Heo phys_addr_t align) 139*7bd0b0f0STejun Heo { 140*7bd0b0f0STejun Heo return memblock_find_in_range_node(start, end, size, align, 141*7bd0b0f0STejun Heo MAX_NUMNODES); 142*7bd0b0f0STejun Heo } 143*7bd0b0f0STejun Heo 1445303b68fSYinghai Lu /* 1457950c407SYinghai Lu * Free memblock.reserved.regions 1467950c407SYinghai Lu */ 1477950c407SYinghai Lu int __init_memblock memblock_free_reserved_regions(void) 1487950c407SYinghai Lu { 1497950c407SYinghai Lu if (memblock.reserved.regions == memblock_reserved_init_regions) 1507950c407SYinghai Lu return 0; 1517950c407SYinghai Lu 1527950c407SYinghai Lu return memblock_free(__pa(memblock.reserved.regions), 1537950c407SYinghai Lu sizeof(struct memblock_region) * memblock.reserved.max); 1547950c407SYinghai Lu } 1557950c407SYinghai Lu 1567950c407SYinghai Lu /* 1577950c407SYinghai Lu * Reserve memblock.reserved.regions 1587950c407SYinghai Lu */ 1597950c407SYinghai Lu int __init_memblock memblock_reserve_reserved_regions(void) 1607950c407SYinghai Lu { 1617950c407SYinghai Lu if (memblock.reserved.regions == memblock_reserved_init_regions) 1627950c407SYinghai Lu return 0; 1637950c407SYinghai Lu 1647950c407SYinghai Lu return memblock_reserve(__pa(memblock.reserved.regions), 1657950c407SYinghai Lu sizeof(struct memblock_region) * memblock.reserved.max); 1667950c407SYinghai Lu } 1677950c407SYinghai Lu 16810d06439SYinghai Lu static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) 16995f72d1eSYinghai Lu { 1701440c4e2STejun Heo type->total_size -= type->regions[r].size; 1717c0caeb8STejun Heo memmove(&type->regions[r], &type->regions[r + 1], 1727c0caeb8STejun Heo (type->cnt - (r + 1)) * sizeof(type->regions[r])); 173e3239ff9SBenjamin Herrenschmidt type->cnt--; 17495f72d1eSYinghai Lu 1758f7a6605SBenjamin Herrenschmidt /* Special case for empty arrays */ 1768f7a6605SBenjamin Herrenschmidt if (type->cnt == 0) { 1771440c4e2STejun Heo WARN_ON(type->total_size != 0); 1788f7a6605SBenjamin Herrenschmidt type->cnt = 1; 1798f7a6605SBenjamin Herrenschmidt type->regions[0].base = 0; 1808f7a6605SBenjamin Herrenschmidt type->regions[0].size = 0; 1817c0caeb8STejun Heo memblock_set_region_node(&type->regions[0], MAX_NUMNODES); 1828f7a6605SBenjamin Herrenschmidt } 18395f72d1eSYinghai Lu } 18495f72d1eSYinghai Lu 18510d06439SYinghai Lu static int __init_memblock memblock_double_array(struct memblock_type *type) 186142b45a7SBenjamin Herrenschmidt { 187142b45a7SBenjamin Herrenschmidt struct memblock_region *new_array, *old_array; 188142b45a7SBenjamin Herrenschmidt phys_addr_t old_size, new_size, addr; 189142b45a7SBenjamin Herrenschmidt int use_slab = slab_is_available(); 190142b45a7SBenjamin Herrenschmidt 191142b45a7SBenjamin Herrenschmidt /* We don't allow resizing until we know about the reserved regions 192142b45a7SBenjamin Herrenschmidt * of memory that aren't suitable for allocation 193142b45a7SBenjamin Herrenschmidt */ 194142b45a7SBenjamin Herrenschmidt if (!memblock_can_resize) 195142b45a7SBenjamin Herrenschmidt return -1; 196142b45a7SBenjamin Herrenschmidt 197142b45a7SBenjamin Herrenschmidt /* Calculate new doubled size */ 198142b45a7SBenjamin Herrenschmidt old_size = type->max * sizeof(struct memblock_region); 199142b45a7SBenjamin Herrenschmidt new_size = old_size << 1; 200142b45a7SBenjamin Herrenschmidt 201142b45a7SBenjamin Herrenschmidt /* Try to find some space for it. 202142b45a7SBenjamin Herrenschmidt * 203142b45a7SBenjamin Herrenschmidt * WARNING: We assume that either slab_is_available() and we use it or 204142b45a7SBenjamin Herrenschmidt * we use MEMBLOCK for allocations. That means that this is unsafe to use 205142b45a7SBenjamin Herrenschmidt * when bootmem is currently active (unless bootmem itself is implemented 206142b45a7SBenjamin Herrenschmidt * on top of MEMBLOCK which isn't the case yet) 207142b45a7SBenjamin Herrenschmidt * 208142b45a7SBenjamin Herrenschmidt * This should however not be an issue for now, as we currently only 209142b45a7SBenjamin Herrenschmidt * call into MEMBLOCK while it's still active, or much later when slab is 210142b45a7SBenjamin Herrenschmidt * active for memory hotplug operations 211142b45a7SBenjamin Herrenschmidt */ 212142b45a7SBenjamin Herrenschmidt if (use_slab) { 213142b45a7SBenjamin Herrenschmidt new_array = kmalloc(new_size, GFP_KERNEL); 2141f5026a7STejun Heo addr = new_array ? __pa(new_array) : 0; 215142b45a7SBenjamin Herrenschmidt } else 216fc769a8eSTejun Heo addr = memblock_find_in_range(0, MEMBLOCK_ALLOC_ACCESSIBLE, new_size, sizeof(phys_addr_t)); 2171f5026a7STejun Heo if (!addr) { 218142b45a7SBenjamin Herrenschmidt pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", 219142b45a7SBenjamin Herrenschmidt memblock_type_name(type), type->max, type->max * 2); 220142b45a7SBenjamin Herrenschmidt return -1; 221142b45a7SBenjamin Herrenschmidt } 222142b45a7SBenjamin Herrenschmidt new_array = __va(addr); 223142b45a7SBenjamin Herrenschmidt 224ea9e4376SYinghai Lu memblock_dbg("memblock: %s array is doubled to %ld at [%#010llx-%#010llx]", 225ea9e4376SYinghai Lu memblock_type_name(type), type->max * 2, (u64)addr, (u64)addr + new_size - 1); 226ea9e4376SYinghai Lu 227142b45a7SBenjamin Herrenschmidt /* Found space, we now need to move the array over before 228142b45a7SBenjamin Herrenschmidt * we add the reserved region since it may be our reserved 229142b45a7SBenjamin Herrenschmidt * array itself that is full. 230142b45a7SBenjamin Herrenschmidt */ 231142b45a7SBenjamin Herrenschmidt memcpy(new_array, type->regions, old_size); 232142b45a7SBenjamin Herrenschmidt memset(new_array + type->max, 0, old_size); 233142b45a7SBenjamin Herrenschmidt old_array = type->regions; 234142b45a7SBenjamin Herrenschmidt type->regions = new_array; 235142b45a7SBenjamin Herrenschmidt type->max <<= 1; 236142b45a7SBenjamin Herrenschmidt 237142b45a7SBenjamin Herrenschmidt /* If we use SLAB that's it, we are done */ 238142b45a7SBenjamin Herrenschmidt if (use_slab) 239142b45a7SBenjamin Herrenschmidt return 0; 240142b45a7SBenjamin Herrenschmidt 241142b45a7SBenjamin Herrenschmidt /* Add the new reserved region now. Should not fail ! */ 2429c8c27e2STejun Heo BUG_ON(memblock_reserve(addr, new_size)); 243142b45a7SBenjamin Herrenschmidt 244142b45a7SBenjamin Herrenschmidt /* If the array wasn't our static init one, then free it. We only do 245142b45a7SBenjamin Herrenschmidt * that before SLAB is available as later on, we don't know whether 246142b45a7SBenjamin Herrenschmidt * to use kfree or free_bootmem_pages(). Shouldn't be a big deal 247142b45a7SBenjamin Herrenschmidt * anyways 248142b45a7SBenjamin Herrenschmidt */ 249142b45a7SBenjamin Herrenschmidt if (old_array != memblock_memory_init_regions && 250142b45a7SBenjamin Herrenschmidt old_array != memblock_reserved_init_regions) 251142b45a7SBenjamin Herrenschmidt memblock_free(__pa(old_array), old_size); 252142b45a7SBenjamin Herrenschmidt 253142b45a7SBenjamin Herrenschmidt return 0; 254142b45a7SBenjamin Herrenschmidt } 255142b45a7SBenjamin Herrenschmidt 256784656f9STejun Heo /** 257784656f9STejun Heo * memblock_merge_regions - merge neighboring compatible regions 258784656f9STejun Heo * @type: memblock type to scan 259784656f9STejun Heo * 260784656f9STejun Heo * Scan @type and merge neighboring compatible regions. 261784656f9STejun Heo */ 262784656f9STejun Heo static void __init_memblock memblock_merge_regions(struct memblock_type *type) 263784656f9STejun Heo { 264784656f9STejun Heo int i = 0; 265784656f9STejun Heo 266784656f9STejun Heo /* cnt never goes below 1 */ 267784656f9STejun Heo while (i < type->cnt - 1) { 268784656f9STejun Heo struct memblock_region *this = &type->regions[i]; 269784656f9STejun Heo struct memblock_region *next = &type->regions[i + 1]; 270784656f9STejun Heo 2717c0caeb8STejun Heo if (this->base + this->size != next->base || 2727c0caeb8STejun Heo memblock_get_region_node(this) != 2737c0caeb8STejun Heo memblock_get_region_node(next)) { 274784656f9STejun Heo BUG_ON(this->base + this->size > next->base); 275784656f9STejun Heo i++; 276784656f9STejun Heo continue; 277784656f9STejun Heo } 278784656f9STejun Heo 279784656f9STejun Heo this->size += next->size; 280784656f9STejun Heo memmove(next, next + 1, (type->cnt - (i + 1)) * sizeof(*next)); 281784656f9STejun Heo type->cnt--; 282784656f9STejun Heo } 283784656f9STejun Heo } 284784656f9STejun Heo 285784656f9STejun Heo /** 286784656f9STejun Heo * memblock_insert_region - insert new memblock region 287784656f9STejun Heo * @type: memblock type to insert into 288784656f9STejun Heo * @idx: index for the insertion point 289784656f9STejun Heo * @base: base address of the new region 290784656f9STejun Heo * @size: size of the new region 291784656f9STejun Heo * 292784656f9STejun Heo * Insert new memblock region [@base,@base+@size) into @type at @idx. 293784656f9STejun Heo * @type must already have extra room to accomodate the new region. 294784656f9STejun Heo */ 295784656f9STejun Heo static void __init_memblock memblock_insert_region(struct memblock_type *type, 296784656f9STejun Heo int idx, phys_addr_t base, 2977c0caeb8STejun Heo phys_addr_t size, int nid) 298784656f9STejun Heo { 299784656f9STejun Heo struct memblock_region *rgn = &type->regions[idx]; 300784656f9STejun Heo 301784656f9STejun Heo BUG_ON(type->cnt >= type->max); 302784656f9STejun Heo memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); 303784656f9STejun Heo rgn->base = base; 304784656f9STejun Heo rgn->size = size; 3057c0caeb8STejun Heo memblock_set_region_node(rgn, nid); 306784656f9STejun Heo type->cnt++; 3071440c4e2STejun Heo type->total_size += size; 308784656f9STejun Heo } 309784656f9STejun Heo 310784656f9STejun Heo /** 311784656f9STejun Heo * memblock_add_region - add new memblock region 312784656f9STejun Heo * @type: memblock type to add new region into 313784656f9STejun Heo * @base: base address of the new region 314784656f9STejun Heo * @size: size of the new region 3157fb0bc3fSTejun Heo * @nid: nid of the new region 316784656f9STejun Heo * 317784656f9STejun Heo * Add new memblock region [@base,@base+@size) into @type. The new region 318784656f9STejun Heo * is allowed to overlap with existing ones - overlaps don't affect already 319784656f9STejun Heo * existing regions. @type is guaranteed to be minimal (all neighbouring 320784656f9STejun Heo * compatible regions are merged) after the addition. 321784656f9STejun Heo * 322784656f9STejun Heo * RETURNS: 323784656f9STejun Heo * 0 on success, -errno on failure. 324784656f9STejun Heo */ 325581adcbeSTejun Heo static int __init_memblock memblock_add_region(struct memblock_type *type, 3267fb0bc3fSTejun Heo phys_addr_t base, phys_addr_t size, int nid) 32795f72d1eSYinghai Lu { 328784656f9STejun Heo bool insert = false; 329eb18f1b5STejun Heo phys_addr_t obase = base; 330eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 331784656f9STejun Heo int i, nr_new; 33295f72d1eSYinghai Lu 333784656f9STejun Heo /* special case for empty array */ 334784656f9STejun Heo if (type->regions[0].size == 0) { 3351440c4e2STejun Heo WARN_ON(type->cnt != 1 || type->total_size); 336784656f9STejun Heo type->regions[0].base = base; 337784656f9STejun Heo type->regions[0].size = size; 3387fb0bc3fSTejun Heo memblock_set_region_node(&type->regions[0], nid); 3391440c4e2STejun Heo type->total_size = size; 340784656f9STejun Heo return 0; 341784656f9STejun Heo } 342784656f9STejun Heo repeat: 343784656f9STejun Heo /* 344784656f9STejun Heo * The following is executed twice. Once with %false @insert and 345784656f9STejun Heo * then with %true. The first counts the number of regions needed 346784656f9STejun Heo * to accomodate the new area. The second actually inserts them. 347784656f9STejun Heo */ 348784656f9STejun Heo base = obase; 349784656f9STejun Heo nr_new = 0; 350784656f9STejun Heo 3518f7a6605SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 3528f7a6605SBenjamin Herrenschmidt struct memblock_region *rgn = &type->regions[i]; 353784656f9STejun Heo phys_addr_t rbase = rgn->base; 354784656f9STejun Heo phys_addr_t rend = rbase + rgn->size; 3558f7a6605SBenjamin Herrenschmidt 356784656f9STejun Heo if (rbase >= end) 3578f7a6605SBenjamin Herrenschmidt break; 358784656f9STejun Heo if (rend <= base) 359784656f9STejun Heo continue; 360784656f9STejun Heo /* 361784656f9STejun Heo * @rgn overlaps. If it separates the lower part of new 362784656f9STejun Heo * area, insert that portion. 3638f7a6605SBenjamin Herrenschmidt */ 364784656f9STejun Heo if (rbase > base) { 365784656f9STejun Heo nr_new++; 366784656f9STejun Heo if (insert) 367784656f9STejun Heo memblock_insert_region(type, i++, base, 3687fb0bc3fSTejun Heo rbase - base, nid); 369784656f9STejun Heo } 370784656f9STejun Heo /* area below @rend is dealt with, forget about it */ 371784656f9STejun Heo base = min(rend, end); 3728f7a6605SBenjamin Herrenschmidt } 3738f7a6605SBenjamin Herrenschmidt 374784656f9STejun Heo /* insert the remaining portion */ 375784656f9STejun Heo if (base < end) { 376784656f9STejun Heo nr_new++; 377784656f9STejun Heo if (insert) 3787fb0bc3fSTejun Heo memblock_insert_region(type, i, base, end - base, nid); 3798f7a6605SBenjamin Herrenschmidt } 3808f7a6605SBenjamin Herrenschmidt 381784656f9STejun Heo /* 382784656f9STejun Heo * If this was the first round, resize array and repeat for actual 383784656f9STejun Heo * insertions; otherwise, merge and return. 3848f7a6605SBenjamin Herrenschmidt */ 385784656f9STejun Heo if (!insert) { 386784656f9STejun Heo while (type->cnt + nr_new > type->max) 387784656f9STejun Heo if (memblock_double_array(type) < 0) 388784656f9STejun Heo return -ENOMEM; 389784656f9STejun Heo insert = true; 390784656f9STejun Heo goto repeat; 39195f72d1eSYinghai Lu } else { 392784656f9STejun Heo memblock_merge_regions(type); 39395f72d1eSYinghai Lu return 0; 39495f72d1eSYinghai Lu } 395784656f9STejun Heo } 39695f72d1eSYinghai Lu 3977fb0bc3fSTejun Heo int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size, 3987fb0bc3fSTejun Heo int nid) 3997fb0bc3fSTejun Heo { 4007fb0bc3fSTejun Heo return memblock_add_region(&memblock.memory, base, size, nid); 4017fb0bc3fSTejun Heo } 4027fb0bc3fSTejun Heo 403581adcbeSTejun Heo int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) 40495f72d1eSYinghai Lu { 4057fb0bc3fSTejun Heo return memblock_add_region(&memblock.memory, base, size, MAX_NUMNODES); 40695f72d1eSYinghai Lu } 40795f72d1eSYinghai Lu 4086a9ceb31STejun Heo /** 4096a9ceb31STejun Heo * memblock_isolate_range - isolate given range into disjoint memblocks 4106a9ceb31STejun Heo * @type: memblock type to isolate range for 4116a9ceb31STejun Heo * @base: base of range to isolate 4126a9ceb31STejun Heo * @size: size of range to isolate 4136a9ceb31STejun Heo * @start_rgn: out parameter for the start of isolated region 4146a9ceb31STejun Heo * @end_rgn: out parameter for the end of isolated region 4156a9ceb31STejun Heo * 4166a9ceb31STejun Heo * Walk @type and ensure that regions don't cross the boundaries defined by 4176a9ceb31STejun Heo * [@base,@base+@size). Crossing regions are split at the boundaries, 4186a9ceb31STejun Heo * which may create at most two more regions. The index of the first 4196a9ceb31STejun Heo * region inside the range is returned in *@start_rgn and end in *@end_rgn. 4206a9ceb31STejun Heo * 4216a9ceb31STejun Heo * RETURNS: 4226a9ceb31STejun Heo * 0 on success, -errno on failure. 4236a9ceb31STejun Heo */ 4246a9ceb31STejun Heo static int __init_memblock memblock_isolate_range(struct memblock_type *type, 4256a9ceb31STejun Heo phys_addr_t base, phys_addr_t size, 4266a9ceb31STejun Heo int *start_rgn, int *end_rgn) 4276a9ceb31STejun Heo { 428eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 4296a9ceb31STejun Heo int i; 4306a9ceb31STejun Heo 4316a9ceb31STejun Heo *start_rgn = *end_rgn = 0; 4326a9ceb31STejun Heo 4336a9ceb31STejun Heo /* we'll create at most two more regions */ 4346a9ceb31STejun Heo while (type->cnt + 2 > type->max) 4356a9ceb31STejun Heo if (memblock_double_array(type) < 0) 4366a9ceb31STejun Heo return -ENOMEM; 4376a9ceb31STejun Heo 4386a9ceb31STejun Heo for (i = 0; i < type->cnt; i++) { 4396a9ceb31STejun Heo struct memblock_region *rgn = &type->regions[i]; 4406a9ceb31STejun Heo phys_addr_t rbase = rgn->base; 4416a9ceb31STejun Heo phys_addr_t rend = rbase + rgn->size; 4426a9ceb31STejun Heo 4436a9ceb31STejun Heo if (rbase >= end) 4446a9ceb31STejun Heo break; 4456a9ceb31STejun Heo if (rend <= base) 4466a9ceb31STejun Heo continue; 4476a9ceb31STejun Heo 4486a9ceb31STejun Heo if (rbase < base) { 4496a9ceb31STejun Heo /* 4506a9ceb31STejun Heo * @rgn intersects from below. Split and continue 4516a9ceb31STejun Heo * to process the next region - the new top half. 4526a9ceb31STejun Heo */ 4536a9ceb31STejun Heo rgn->base = base; 4541440c4e2STejun Heo rgn->size -= base - rbase; 4551440c4e2STejun Heo type->total_size -= base - rbase; 4566a9ceb31STejun Heo memblock_insert_region(type, i, rbase, base - rbase, 45771936180STejun Heo memblock_get_region_node(rgn)); 4586a9ceb31STejun Heo } else if (rend > end) { 4596a9ceb31STejun Heo /* 4606a9ceb31STejun Heo * @rgn intersects from above. Split and redo the 4616a9ceb31STejun Heo * current region - the new bottom half. 4626a9ceb31STejun Heo */ 4636a9ceb31STejun Heo rgn->base = end; 4641440c4e2STejun Heo rgn->size -= end - rbase; 4651440c4e2STejun Heo type->total_size -= end - rbase; 4666a9ceb31STejun Heo memblock_insert_region(type, i--, rbase, end - rbase, 46771936180STejun Heo memblock_get_region_node(rgn)); 4686a9ceb31STejun Heo } else { 4696a9ceb31STejun Heo /* @rgn is fully contained, record it */ 4706a9ceb31STejun Heo if (!*end_rgn) 4716a9ceb31STejun Heo *start_rgn = i; 4726a9ceb31STejun Heo *end_rgn = i + 1; 4736a9ceb31STejun Heo } 4746a9ceb31STejun Heo } 4756a9ceb31STejun Heo 4766a9ceb31STejun Heo return 0; 4776a9ceb31STejun Heo } 4786a9ceb31STejun Heo 479581adcbeSTejun Heo static int __init_memblock __memblock_remove(struct memblock_type *type, 4808f7a6605SBenjamin Herrenschmidt phys_addr_t base, phys_addr_t size) 48195f72d1eSYinghai Lu { 48271936180STejun Heo int start_rgn, end_rgn; 48371936180STejun Heo int i, ret; 48495f72d1eSYinghai Lu 48571936180STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 48671936180STejun Heo if (ret) 48771936180STejun Heo return ret; 48895f72d1eSYinghai Lu 48971936180STejun Heo for (i = end_rgn - 1; i >= start_rgn; i--) 49071936180STejun Heo memblock_remove_region(type, i); 49195f72d1eSYinghai Lu return 0; 49295f72d1eSYinghai Lu } 49395f72d1eSYinghai Lu 494581adcbeSTejun Heo int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) 49595f72d1eSYinghai Lu { 49695f72d1eSYinghai Lu return __memblock_remove(&memblock.memory, base, size); 49795f72d1eSYinghai Lu } 49895f72d1eSYinghai Lu 499581adcbeSTejun Heo int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) 50095f72d1eSYinghai Lu { 50124aa0788STejun Heo memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n", 502a150439cSH. Peter Anvin (unsigned long long)base, 503a150439cSH. Peter Anvin (unsigned long long)base + size, 504a150439cSH. Peter Anvin (void *)_RET_IP_); 50524aa0788STejun Heo 50695f72d1eSYinghai Lu return __memblock_remove(&memblock.reserved, base, size); 50795f72d1eSYinghai Lu } 50895f72d1eSYinghai Lu 509581adcbeSTejun Heo int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) 51095f72d1eSYinghai Lu { 511e3239ff9SBenjamin Herrenschmidt struct memblock_type *_rgn = &memblock.reserved; 51295f72d1eSYinghai Lu 51324aa0788STejun Heo memblock_dbg("memblock_reserve: [%#016llx-%#016llx] %pF\n", 514a150439cSH. Peter Anvin (unsigned long long)base, 515a150439cSH. Peter Anvin (unsigned long long)base + size, 516a150439cSH. Peter Anvin (void *)_RET_IP_); 51795f72d1eSYinghai Lu BUG_ON(0 == size); 51895f72d1eSYinghai Lu 5197fb0bc3fSTejun Heo return memblock_add_region(_rgn, base, size, MAX_NUMNODES); 52095f72d1eSYinghai Lu } 52195f72d1eSYinghai Lu 52235fd0808STejun Heo /** 52335fd0808STejun Heo * __next_free_mem_range - next function for for_each_free_mem_range() 52435fd0808STejun Heo * @idx: pointer to u64 loop variable 52535fd0808STejun Heo * @nid: nid: node selector, %MAX_NUMNODES for all nodes 52635fd0808STejun Heo * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL 52735fd0808STejun Heo * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL 52835fd0808STejun Heo * @p_nid: ptr to int for nid of the range, can be %NULL 52935fd0808STejun Heo * 53035fd0808STejun Heo * Find the first free area from *@idx which matches @nid, fill the out 53135fd0808STejun Heo * parameters, and update *@idx for the next iteration. The lower 32bit of 53235fd0808STejun Heo * *@idx contains index into memory region and the upper 32bit indexes the 53335fd0808STejun Heo * areas before each reserved region. For example, if reserved regions 53435fd0808STejun Heo * look like the following, 53535fd0808STejun Heo * 53635fd0808STejun Heo * 0:[0-16), 1:[32-48), 2:[128-130) 53735fd0808STejun Heo * 53835fd0808STejun Heo * The upper 32bit indexes the following regions. 53935fd0808STejun Heo * 54035fd0808STejun Heo * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX) 54135fd0808STejun Heo * 54235fd0808STejun Heo * As both region arrays are sorted, the function advances the two indices 54335fd0808STejun Heo * in lockstep and returns each intersection. 54435fd0808STejun Heo */ 54535fd0808STejun Heo void __init_memblock __next_free_mem_range(u64 *idx, int nid, 54635fd0808STejun Heo phys_addr_t *out_start, 54735fd0808STejun Heo phys_addr_t *out_end, int *out_nid) 54835fd0808STejun Heo { 54935fd0808STejun Heo struct memblock_type *mem = &memblock.memory; 55035fd0808STejun Heo struct memblock_type *rsv = &memblock.reserved; 55135fd0808STejun Heo int mi = *idx & 0xffffffff; 55235fd0808STejun Heo int ri = *idx >> 32; 55335fd0808STejun Heo 55435fd0808STejun Heo for ( ; mi < mem->cnt; mi++) { 55535fd0808STejun Heo struct memblock_region *m = &mem->regions[mi]; 55635fd0808STejun Heo phys_addr_t m_start = m->base; 55735fd0808STejun Heo phys_addr_t m_end = m->base + m->size; 55835fd0808STejun Heo 55935fd0808STejun Heo /* only memory regions are associated with nodes, check it */ 56035fd0808STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 56135fd0808STejun Heo continue; 56235fd0808STejun Heo 56335fd0808STejun Heo /* scan areas before each reservation for intersection */ 56435fd0808STejun Heo for ( ; ri < rsv->cnt + 1; ri++) { 56535fd0808STejun Heo struct memblock_region *r = &rsv->regions[ri]; 56635fd0808STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 56735fd0808STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 56835fd0808STejun Heo 56935fd0808STejun Heo /* if ri advanced past mi, break out to advance mi */ 57035fd0808STejun Heo if (r_start >= m_end) 57135fd0808STejun Heo break; 57235fd0808STejun Heo /* if the two regions intersect, we're done */ 57335fd0808STejun Heo if (m_start < r_end) { 57435fd0808STejun Heo if (out_start) 57535fd0808STejun Heo *out_start = max(m_start, r_start); 57635fd0808STejun Heo if (out_end) 57735fd0808STejun Heo *out_end = min(m_end, r_end); 57835fd0808STejun Heo if (out_nid) 57935fd0808STejun Heo *out_nid = memblock_get_region_node(m); 58035fd0808STejun Heo /* 58135fd0808STejun Heo * The region which ends first is advanced 58235fd0808STejun Heo * for the next iteration. 58335fd0808STejun Heo */ 58435fd0808STejun Heo if (m_end <= r_end) 58535fd0808STejun Heo mi++; 58635fd0808STejun Heo else 58735fd0808STejun Heo ri++; 58835fd0808STejun Heo *idx = (u32)mi | (u64)ri << 32; 58935fd0808STejun Heo return; 59035fd0808STejun Heo } 59135fd0808STejun Heo } 59235fd0808STejun Heo } 59335fd0808STejun Heo 59435fd0808STejun Heo /* signal end of iteration */ 59535fd0808STejun Heo *idx = ULLONG_MAX; 59635fd0808STejun Heo } 59735fd0808STejun Heo 598*7bd0b0f0STejun Heo /** 599*7bd0b0f0STejun Heo * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse() 600*7bd0b0f0STejun Heo * @idx: pointer to u64 loop variable 601*7bd0b0f0STejun Heo * @nid: nid: node selector, %MAX_NUMNODES for all nodes 602*7bd0b0f0STejun Heo * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL 603*7bd0b0f0STejun Heo * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL 604*7bd0b0f0STejun Heo * @p_nid: ptr to int for nid of the range, can be %NULL 605*7bd0b0f0STejun Heo * 606*7bd0b0f0STejun Heo * Reverse of __next_free_mem_range(). 607*7bd0b0f0STejun Heo */ 608*7bd0b0f0STejun Heo void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid, 609*7bd0b0f0STejun Heo phys_addr_t *out_start, 610*7bd0b0f0STejun Heo phys_addr_t *out_end, int *out_nid) 611*7bd0b0f0STejun Heo { 612*7bd0b0f0STejun Heo struct memblock_type *mem = &memblock.memory; 613*7bd0b0f0STejun Heo struct memblock_type *rsv = &memblock.reserved; 614*7bd0b0f0STejun Heo int mi = *idx & 0xffffffff; 615*7bd0b0f0STejun Heo int ri = *idx >> 32; 616*7bd0b0f0STejun Heo 617*7bd0b0f0STejun Heo if (*idx == (u64)ULLONG_MAX) { 618*7bd0b0f0STejun Heo mi = mem->cnt - 1; 619*7bd0b0f0STejun Heo ri = rsv->cnt; 620*7bd0b0f0STejun Heo } 621*7bd0b0f0STejun Heo 622*7bd0b0f0STejun Heo for ( ; mi >= 0; mi--) { 623*7bd0b0f0STejun Heo struct memblock_region *m = &mem->regions[mi]; 624*7bd0b0f0STejun Heo phys_addr_t m_start = m->base; 625*7bd0b0f0STejun Heo phys_addr_t m_end = m->base + m->size; 626*7bd0b0f0STejun Heo 627*7bd0b0f0STejun Heo /* only memory regions are associated with nodes, check it */ 628*7bd0b0f0STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 629*7bd0b0f0STejun Heo continue; 630*7bd0b0f0STejun Heo 631*7bd0b0f0STejun Heo /* scan areas before each reservation for intersection */ 632*7bd0b0f0STejun Heo for ( ; ri >= 0; ri--) { 633*7bd0b0f0STejun Heo struct memblock_region *r = &rsv->regions[ri]; 634*7bd0b0f0STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 635*7bd0b0f0STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 636*7bd0b0f0STejun Heo 637*7bd0b0f0STejun Heo /* if ri advanced past mi, break out to advance mi */ 638*7bd0b0f0STejun Heo if (r_end <= m_start) 639*7bd0b0f0STejun Heo break; 640*7bd0b0f0STejun Heo /* if the two regions intersect, we're done */ 641*7bd0b0f0STejun Heo if (m_end > r_start) { 642*7bd0b0f0STejun Heo if (out_start) 643*7bd0b0f0STejun Heo *out_start = max(m_start, r_start); 644*7bd0b0f0STejun Heo if (out_end) 645*7bd0b0f0STejun Heo *out_end = min(m_end, r_end); 646*7bd0b0f0STejun Heo if (out_nid) 647*7bd0b0f0STejun Heo *out_nid = memblock_get_region_node(m); 648*7bd0b0f0STejun Heo 649*7bd0b0f0STejun Heo if (m_start >= r_start) 650*7bd0b0f0STejun Heo mi--; 651*7bd0b0f0STejun Heo else 652*7bd0b0f0STejun Heo ri--; 653*7bd0b0f0STejun Heo *idx = (u32)mi | (u64)ri << 32; 654*7bd0b0f0STejun Heo return; 655*7bd0b0f0STejun Heo } 656*7bd0b0f0STejun Heo } 657*7bd0b0f0STejun Heo } 658*7bd0b0f0STejun Heo 659*7bd0b0f0STejun Heo *idx = ULLONG_MAX; 660*7bd0b0f0STejun Heo } 661*7bd0b0f0STejun Heo 6627c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 6637c0caeb8STejun Heo /* 6647c0caeb8STejun Heo * Common iterator interface used to define for_each_mem_range(). 6657c0caeb8STejun Heo */ 6667c0caeb8STejun Heo void __init_memblock __next_mem_pfn_range(int *idx, int nid, 6677c0caeb8STejun Heo unsigned long *out_start_pfn, 6687c0caeb8STejun Heo unsigned long *out_end_pfn, int *out_nid) 6697c0caeb8STejun Heo { 6707c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 6717c0caeb8STejun Heo struct memblock_region *r; 6727c0caeb8STejun Heo 6737c0caeb8STejun Heo while (++*idx < type->cnt) { 6747c0caeb8STejun Heo r = &type->regions[*idx]; 6757c0caeb8STejun Heo 6767c0caeb8STejun Heo if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size)) 6777c0caeb8STejun Heo continue; 6787c0caeb8STejun Heo if (nid == MAX_NUMNODES || nid == r->nid) 6797c0caeb8STejun Heo break; 6807c0caeb8STejun Heo } 6817c0caeb8STejun Heo if (*idx >= type->cnt) { 6827c0caeb8STejun Heo *idx = -1; 6837c0caeb8STejun Heo return; 6847c0caeb8STejun Heo } 6857c0caeb8STejun Heo 6867c0caeb8STejun Heo if (out_start_pfn) 6877c0caeb8STejun Heo *out_start_pfn = PFN_UP(r->base); 6887c0caeb8STejun Heo if (out_end_pfn) 6897c0caeb8STejun Heo *out_end_pfn = PFN_DOWN(r->base + r->size); 6907c0caeb8STejun Heo if (out_nid) 6917c0caeb8STejun Heo *out_nid = r->nid; 6927c0caeb8STejun Heo } 6937c0caeb8STejun Heo 6947c0caeb8STejun Heo /** 6957c0caeb8STejun Heo * memblock_set_node - set node ID on memblock regions 6967c0caeb8STejun Heo * @base: base of area to set node ID for 6977c0caeb8STejun Heo * @size: size of area to set node ID for 6987c0caeb8STejun Heo * @nid: node ID to set 6997c0caeb8STejun Heo * 7007c0caeb8STejun Heo * Set the nid of memblock memory regions in [@base,@base+@size) to @nid. 7017c0caeb8STejun Heo * Regions which cross the area boundaries are split as necessary. 7027c0caeb8STejun Heo * 7037c0caeb8STejun Heo * RETURNS: 7047c0caeb8STejun Heo * 0 on success, -errno on failure. 7057c0caeb8STejun Heo */ 7067c0caeb8STejun Heo int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size, 7077c0caeb8STejun Heo int nid) 7087c0caeb8STejun Heo { 7097c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 7106a9ceb31STejun Heo int start_rgn, end_rgn; 7116a9ceb31STejun Heo int i, ret; 7127c0caeb8STejun Heo 7136a9ceb31STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 7146a9ceb31STejun Heo if (ret) 7156a9ceb31STejun Heo return ret; 7167c0caeb8STejun Heo 7176a9ceb31STejun Heo for (i = start_rgn; i < end_rgn; i++) 7186a9ceb31STejun Heo type->regions[i].nid = nid; 7197c0caeb8STejun Heo 7207c0caeb8STejun Heo memblock_merge_regions(type); 7217c0caeb8STejun Heo return 0; 7227c0caeb8STejun Heo } 7237c0caeb8STejun Heo #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ 7247c0caeb8STejun Heo 725*7bd0b0f0STejun Heo static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size, 726*7bd0b0f0STejun Heo phys_addr_t align, phys_addr_t max_addr, 727*7bd0b0f0STejun Heo int nid) 72895f72d1eSYinghai Lu { 7296ed311b2SBenjamin Herrenschmidt phys_addr_t found; 73095f72d1eSYinghai Lu 731*7bd0b0f0STejun Heo found = memblock_find_in_range_node(0, max_addr, size, align, nid); 7329c8c27e2STejun Heo if (found && !memblock_reserve(found, size)) 7336ed311b2SBenjamin Herrenschmidt return found; 7346ed311b2SBenjamin Herrenschmidt 7356ed311b2SBenjamin Herrenschmidt return 0; 73695f72d1eSYinghai Lu } 73795f72d1eSYinghai Lu 738*7bd0b0f0STejun Heo phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) 739*7bd0b0f0STejun Heo { 740*7bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid); 741*7bd0b0f0STejun Heo } 742*7bd0b0f0STejun Heo 743*7bd0b0f0STejun Heo phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 744*7bd0b0f0STejun Heo { 745*7bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES); 746*7bd0b0f0STejun Heo } 747*7bd0b0f0STejun Heo 7486ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 74995f72d1eSYinghai Lu { 7506ed311b2SBenjamin Herrenschmidt phys_addr_t alloc; 7516ed311b2SBenjamin Herrenschmidt 7526ed311b2SBenjamin Herrenschmidt alloc = __memblock_alloc_base(size, align, max_addr); 7536ed311b2SBenjamin Herrenschmidt 7546ed311b2SBenjamin Herrenschmidt if (alloc == 0) 7556ed311b2SBenjamin Herrenschmidt panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", 7566ed311b2SBenjamin Herrenschmidt (unsigned long long) size, (unsigned long long) max_addr); 7576ed311b2SBenjamin Herrenschmidt 7586ed311b2SBenjamin Herrenschmidt return alloc; 75995f72d1eSYinghai Lu } 76095f72d1eSYinghai Lu 7616ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) 76295f72d1eSYinghai Lu { 7636ed311b2SBenjamin Herrenschmidt return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 76495f72d1eSYinghai Lu } 76595f72d1eSYinghai Lu 7669d1e2492SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) 7679d1e2492SBenjamin Herrenschmidt { 7689d1e2492SBenjamin Herrenschmidt phys_addr_t res = memblock_alloc_nid(size, align, nid); 7699d1e2492SBenjamin Herrenschmidt 7709d1e2492SBenjamin Herrenschmidt if (res) 7719d1e2492SBenjamin Herrenschmidt return res; 77215fb0972STejun Heo return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 77395f72d1eSYinghai Lu } 77495f72d1eSYinghai Lu 7759d1e2492SBenjamin Herrenschmidt 7769d1e2492SBenjamin Herrenschmidt /* 7779d1e2492SBenjamin Herrenschmidt * Remaining API functions 7789d1e2492SBenjamin Herrenschmidt */ 7799d1e2492SBenjamin Herrenschmidt 7802898cc4cSBenjamin Herrenschmidt phys_addr_t __init memblock_phys_mem_size(void) 78195f72d1eSYinghai Lu { 7821440c4e2STejun Heo return memblock.memory.total_size; 78395f72d1eSYinghai Lu } 78495f72d1eSYinghai Lu 7850a93ebefSSam Ravnborg /* lowest address */ 7860a93ebefSSam Ravnborg phys_addr_t __init_memblock memblock_start_of_DRAM(void) 7870a93ebefSSam Ravnborg { 7880a93ebefSSam Ravnborg return memblock.memory.regions[0].base; 7890a93ebefSSam Ravnborg } 7900a93ebefSSam Ravnborg 79110d06439SYinghai Lu phys_addr_t __init_memblock memblock_end_of_DRAM(void) 79295f72d1eSYinghai Lu { 79395f72d1eSYinghai Lu int idx = memblock.memory.cnt - 1; 79495f72d1eSYinghai Lu 795e3239ff9SBenjamin Herrenschmidt return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); 79695f72d1eSYinghai Lu } 79795f72d1eSYinghai Lu 798c0ce8fefSTejun Heo void __init memblock_enforce_memory_limit(phys_addr_t limit) 79995f72d1eSYinghai Lu { 80095f72d1eSYinghai Lu unsigned long i; 801c0ce8fefSTejun Heo phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX; 80295f72d1eSYinghai Lu 803c0ce8fefSTejun Heo if (!limit) 80495f72d1eSYinghai Lu return; 80595f72d1eSYinghai Lu 806c0ce8fefSTejun Heo /* find out max address */ 80795f72d1eSYinghai Lu for (i = 0; i < memblock.memory.cnt; i++) { 808c0ce8fefSTejun Heo struct memblock_region *r = &memblock.memory.regions[i]; 80995f72d1eSYinghai Lu 810c0ce8fefSTejun Heo if (limit <= r->size) { 811c0ce8fefSTejun Heo max_addr = r->base + limit; 81295f72d1eSYinghai Lu break; 81395f72d1eSYinghai Lu } 814c0ce8fefSTejun Heo limit -= r->size; 81595f72d1eSYinghai Lu } 816c0ce8fefSTejun Heo 817c0ce8fefSTejun Heo /* truncate both memory and reserved regions */ 818c0ce8fefSTejun Heo __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX); 819c0ce8fefSTejun Heo __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX); 82095f72d1eSYinghai Lu } 82195f72d1eSYinghai Lu 822cd79481dSYinghai Lu static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) 82372d4b0b4SBenjamin Herrenschmidt { 82472d4b0b4SBenjamin Herrenschmidt unsigned int left = 0, right = type->cnt; 82572d4b0b4SBenjamin Herrenschmidt 82672d4b0b4SBenjamin Herrenschmidt do { 82772d4b0b4SBenjamin Herrenschmidt unsigned int mid = (right + left) / 2; 82872d4b0b4SBenjamin Herrenschmidt 82972d4b0b4SBenjamin Herrenschmidt if (addr < type->regions[mid].base) 83072d4b0b4SBenjamin Herrenschmidt right = mid; 83172d4b0b4SBenjamin Herrenschmidt else if (addr >= (type->regions[mid].base + 83272d4b0b4SBenjamin Herrenschmidt type->regions[mid].size)) 83372d4b0b4SBenjamin Herrenschmidt left = mid + 1; 83472d4b0b4SBenjamin Herrenschmidt else 83572d4b0b4SBenjamin Herrenschmidt return mid; 83672d4b0b4SBenjamin Herrenschmidt } while (left < right); 83772d4b0b4SBenjamin Herrenschmidt return -1; 83872d4b0b4SBenjamin Herrenschmidt } 83972d4b0b4SBenjamin Herrenschmidt 8402898cc4cSBenjamin Herrenschmidt int __init memblock_is_reserved(phys_addr_t addr) 84195f72d1eSYinghai Lu { 84272d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.reserved, addr) != -1; 84395f72d1eSYinghai Lu } 84472d4b0b4SBenjamin Herrenschmidt 8453661ca66SYinghai Lu int __init_memblock memblock_is_memory(phys_addr_t addr) 84672d4b0b4SBenjamin Herrenschmidt { 84772d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.memory, addr) != -1; 84872d4b0b4SBenjamin Herrenschmidt } 84972d4b0b4SBenjamin Herrenschmidt 8503661ca66SYinghai Lu int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) 85172d4b0b4SBenjamin Herrenschmidt { 852abb65272STomi Valkeinen int idx = memblock_search(&memblock.memory, base); 853eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 85472d4b0b4SBenjamin Herrenschmidt 85572d4b0b4SBenjamin Herrenschmidt if (idx == -1) 85695f72d1eSYinghai Lu return 0; 857abb65272STomi Valkeinen return memblock.memory.regions[idx].base <= base && 858abb65272STomi Valkeinen (memblock.memory.regions[idx].base + 859eb18f1b5STejun Heo memblock.memory.regions[idx].size) >= end; 86095f72d1eSYinghai Lu } 86195f72d1eSYinghai Lu 86210d06439SYinghai Lu int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) 86395f72d1eSYinghai Lu { 864eb18f1b5STejun Heo memblock_cap_size(base, &size); 865f1c2c19cSBenjamin Herrenschmidt return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; 86695f72d1eSYinghai Lu } 86795f72d1eSYinghai Lu 868e63075a3SBenjamin Herrenschmidt 8693661ca66SYinghai Lu void __init_memblock memblock_set_current_limit(phys_addr_t limit) 870e63075a3SBenjamin Herrenschmidt { 871e63075a3SBenjamin Herrenschmidt memblock.current_limit = limit; 872e63075a3SBenjamin Herrenschmidt } 873e63075a3SBenjamin Herrenschmidt 8747c0caeb8STejun Heo static void __init_memblock memblock_dump(struct memblock_type *type, char *name) 8756ed311b2SBenjamin Herrenschmidt { 8766ed311b2SBenjamin Herrenschmidt unsigned long long base, size; 8776ed311b2SBenjamin Herrenschmidt int i; 8786ed311b2SBenjamin Herrenschmidt 8797c0caeb8STejun Heo pr_info(" %s.cnt = 0x%lx\n", name, type->cnt); 8806ed311b2SBenjamin Herrenschmidt 8817c0caeb8STejun Heo for (i = 0; i < type->cnt; i++) { 8827c0caeb8STejun Heo struct memblock_region *rgn = &type->regions[i]; 8837c0caeb8STejun Heo char nid_buf[32] = ""; 8846ed311b2SBenjamin Herrenschmidt 8857c0caeb8STejun Heo base = rgn->base; 8867c0caeb8STejun Heo size = rgn->size; 8877c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 8887c0caeb8STejun Heo if (memblock_get_region_node(rgn) != MAX_NUMNODES) 8897c0caeb8STejun Heo snprintf(nid_buf, sizeof(nid_buf), " on node %d", 8907c0caeb8STejun Heo memblock_get_region_node(rgn)); 8917c0caeb8STejun Heo #endif 8927c0caeb8STejun Heo pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s\n", 8937c0caeb8STejun Heo name, i, base, base + size - 1, size, nid_buf); 8946ed311b2SBenjamin Herrenschmidt } 8956ed311b2SBenjamin Herrenschmidt } 8966ed311b2SBenjamin Herrenschmidt 8974ff7b82fSTejun Heo void __init_memblock __memblock_dump_all(void) 8986ed311b2SBenjamin Herrenschmidt { 8996ed311b2SBenjamin Herrenschmidt pr_info("MEMBLOCK configuration:\n"); 9001440c4e2STejun Heo pr_info(" memory size = %#llx reserved size = %#llx\n", 9011440c4e2STejun Heo (unsigned long long)memblock.memory.total_size, 9021440c4e2STejun Heo (unsigned long long)memblock.reserved.total_size); 9036ed311b2SBenjamin Herrenschmidt 9046ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.memory, "memory"); 9056ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.reserved, "reserved"); 9066ed311b2SBenjamin Herrenschmidt } 9076ed311b2SBenjamin Herrenschmidt 9081aadc056STejun Heo void __init memblock_allow_resize(void) 9096ed311b2SBenjamin Herrenschmidt { 910142b45a7SBenjamin Herrenschmidt memblock_can_resize = 1; 9116ed311b2SBenjamin Herrenschmidt } 9126ed311b2SBenjamin Herrenschmidt 9136ed311b2SBenjamin Herrenschmidt static int __init early_memblock(char *p) 9146ed311b2SBenjamin Herrenschmidt { 9156ed311b2SBenjamin Herrenschmidt if (p && strstr(p, "debug")) 9166ed311b2SBenjamin Herrenschmidt memblock_debug = 1; 9176ed311b2SBenjamin Herrenschmidt return 0; 9186ed311b2SBenjamin Herrenschmidt } 9196ed311b2SBenjamin Herrenschmidt early_param("memblock", early_memblock); 9206ed311b2SBenjamin Herrenschmidt 921c378ddd5STejun Heo #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK) 9226d03b885SBenjamin Herrenschmidt 9236d03b885SBenjamin Herrenschmidt static int memblock_debug_show(struct seq_file *m, void *private) 9246d03b885SBenjamin Herrenschmidt { 9256d03b885SBenjamin Herrenschmidt struct memblock_type *type = m->private; 9266d03b885SBenjamin Herrenschmidt struct memblock_region *reg; 9276d03b885SBenjamin Herrenschmidt int i; 9286d03b885SBenjamin Herrenschmidt 9296d03b885SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 9306d03b885SBenjamin Herrenschmidt reg = &type->regions[i]; 9316d03b885SBenjamin Herrenschmidt seq_printf(m, "%4d: ", i); 9326d03b885SBenjamin Herrenschmidt if (sizeof(phys_addr_t) == 4) 9336d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%08lx..0x%08lx\n", 9346d03b885SBenjamin Herrenschmidt (unsigned long)reg->base, 9356d03b885SBenjamin Herrenschmidt (unsigned long)(reg->base + reg->size - 1)); 9366d03b885SBenjamin Herrenschmidt else 9376d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%016llx..0x%016llx\n", 9386d03b885SBenjamin Herrenschmidt (unsigned long long)reg->base, 9396d03b885SBenjamin Herrenschmidt (unsigned long long)(reg->base + reg->size - 1)); 9406d03b885SBenjamin Herrenschmidt 9416d03b885SBenjamin Herrenschmidt } 9426d03b885SBenjamin Herrenschmidt return 0; 9436d03b885SBenjamin Herrenschmidt } 9446d03b885SBenjamin Herrenschmidt 9456d03b885SBenjamin Herrenschmidt static int memblock_debug_open(struct inode *inode, struct file *file) 9466d03b885SBenjamin Herrenschmidt { 9476d03b885SBenjamin Herrenschmidt return single_open(file, memblock_debug_show, inode->i_private); 9486d03b885SBenjamin Herrenschmidt } 9496d03b885SBenjamin Herrenschmidt 9506d03b885SBenjamin Herrenschmidt static const struct file_operations memblock_debug_fops = { 9516d03b885SBenjamin Herrenschmidt .open = memblock_debug_open, 9526d03b885SBenjamin Herrenschmidt .read = seq_read, 9536d03b885SBenjamin Herrenschmidt .llseek = seq_lseek, 9546d03b885SBenjamin Herrenschmidt .release = single_release, 9556d03b885SBenjamin Herrenschmidt }; 9566d03b885SBenjamin Herrenschmidt 9576d03b885SBenjamin Herrenschmidt static int __init memblock_init_debugfs(void) 9586d03b885SBenjamin Herrenschmidt { 9596d03b885SBenjamin Herrenschmidt struct dentry *root = debugfs_create_dir("memblock", NULL); 9606d03b885SBenjamin Herrenschmidt if (!root) 9616d03b885SBenjamin Herrenschmidt return -ENXIO; 9626d03b885SBenjamin Herrenschmidt debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); 9636d03b885SBenjamin Herrenschmidt debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); 9646d03b885SBenjamin Herrenschmidt 9656d03b885SBenjamin Herrenschmidt return 0; 9666d03b885SBenjamin Herrenschmidt } 9676d03b885SBenjamin Herrenschmidt __initcall(memblock_init_debugfs); 9686d03b885SBenjamin Herrenschmidt 9696d03b885SBenjamin Herrenschmidt #endif /* CONFIG_DEBUG_FS */ 970