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; 40181eb394SGavin Shan static int memblock_memory_in_slab __initdata_memblock = 0; 41181eb394SGavin 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 14610d06439SYinghai Lu static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) 14795f72d1eSYinghai Lu { 1481440c4e2STejun Heo type->total_size -= type->regions[r].size; 1497c0caeb8STejun Heo memmove(&type->regions[r], &type->regions[r + 1], 1507c0caeb8STejun Heo (type->cnt - (r + 1)) * sizeof(type->regions[r])); 151e3239ff9SBenjamin Herrenschmidt type->cnt--; 15295f72d1eSYinghai Lu 1538f7a6605SBenjamin Herrenschmidt /* Special case for empty arrays */ 1548f7a6605SBenjamin Herrenschmidt if (type->cnt == 0) { 1551440c4e2STejun Heo WARN_ON(type->total_size != 0); 1568f7a6605SBenjamin Herrenschmidt type->cnt = 1; 1578f7a6605SBenjamin Herrenschmidt type->regions[0].base = 0; 1588f7a6605SBenjamin Herrenschmidt type->regions[0].size = 0; 1597c0caeb8STejun Heo memblock_set_region_node(&type->regions[0], MAX_NUMNODES); 1608f7a6605SBenjamin Herrenschmidt } 16195f72d1eSYinghai Lu } 16295f72d1eSYinghai Lu 16329f67386SYinghai Lu phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info( 16429f67386SYinghai Lu phys_addr_t *addr) 16529f67386SYinghai Lu { 16629f67386SYinghai Lu if (memblock.reserved.regions == memblock_reserved_init_regions) 16729f67386SYinghai Lu return 0; 16829f67386SYinghai Lu 16929f67386SYinghai Lu *addr = __pa(memblock.reserved.regions); 17029f67386SYinghai Lu 17129f67386SYinghai Lu return PAGE_ALIGN(sizeof(struct memblock_region) * 17229f67386SYinghai Lu memblock.reserved.max); 17329f67386SYinghai Lu } 17429f67386SYinghai Lu 17548c3b583SGreg Pearson /** 17648c3b583SGreg Pearson * memblock_double_array - double the size of the memblock regions array 17748c3b583SGreg Pearson * @type: memblock type of the regions array being doubled 17848c3b583SGreg Pearson * @new_area_start: starting address of memory range to avoid overlap with 17948c3b583SGreg Pearson * @new_area_size: size of memory range to avoid overlap with 18048c3b583SGreg Pearson * 18148c3b583SGreg Pearson * Double the size of the @type regions array. If memblock is being used to 18248c3b583SGreg Pearson * allocate memory for a new reserved regions array and there is a previously 18348c3b583SGreg Pearson * allocated memory range [@new_area_start,@new_area_start+@new_area_size] 18448c3b583SGreg Pearson * waiting to be reserved, ensure the memory used by the new array does 18548c3b583SGreg Pearson * not overlap. 18648c3b583SGreg Pearson * 18748c3b583SGreg Pearson * RETURNS: 18848c3b583SGreg Pearson * 0 on success, -1 on failure. 18948c3b583SGreg Pearson */ 19048c3b583SGreg Pearson static int __init_memblock memblock_double_array(struct memblock_type *type, 19148c3b583SGreg Pearson phys_addr_t new_area_start, 19248c3b583SGreg Pearson phys_addr_t new_area_size) 193142b45a7SBenjamin Herrenschmidt { 194142b45a7SBenjamin Herrenschmidt struct memblock_region *new_array, *old_array; 19529f67386SYinghai Lu phys_addr_t old_alloc_size, new_alloc_size; 196142b45a7SBenjamin Herrenschmidt phys_addr_t old_size, new_size, addr; 197142b45a7SBenjamin Herrenschmidt int use_slab = slab_is_available(); 198181eb394SGavin Shan int *in_slab; 199142b45a7SBenjamin Herrenschmidt 200142b45a7SBenjamin Herrenschmidt /* We don't allow resizing until we know about the reserved regions 201142b45a7SBenjamin Herrenschmidt * of memory that aren't suitable for allocation 202142b45a7SBenjamin Herrenschmidt */ 203142b45a7SBenjamin Herrenschmidt if (!memblock_can_resize) 204142b45a7SBenjamin Herrenschmidt return -1; 205142b45a7SBenjamin Herrenschmidt 206142b45a7SBenjamin Herrenschmidt /* Calculate new doubled size */ 207142b45a7SBenjamin Herrenschmidt old_size = type->max * sizeof(struct memblock_region); 208142b45a7SBenjamin Herrenschmidt new_size = old_size << 1; 20929f67386SYinghai Lu /* 21029f67386SYinghai Lu * We need to allocated new one align to PAGE_SIZE, 21129f67386SYinghai Lu * so we can free them completely later. 21229f67386SYinghai Lu */ 21329f67386SYinghai Lu old_alloc_size = PAGE_ALIGN(old_size); 21429f67386SYinghai Lu new_alloc_size = PAGE_ALIGN(new_size); 215142b45a7SBenjamin Herrenschmidt 216181eb394SGavin Shan /* Retrieve the slab flag */ 217181eb394SGavin Shan if (type == &memblock.memory) 218181eb394SGavin Shan in_slab = &memblock_memory_in_slab; 219181eb394SGavin Shan else 220181eb394SGavin Shan in_slab = &memblock_reserved_in_slab; 221181eb394SGavin Shan 222142b45a7SBenjamin Herrenschmidt /* Try to find some space for it. 223142b45a7SBenjamin Herrenschmidt * 224142b45a7SBenjamin Herrenschmidt * WARNING: We assume that either slab_is_available() and we use it or 225*fd07383bSAndrew Morton * we use MEMBLOCK for allocations. That means that this is unsafe to 226*fd07383bSAndrew Morton * use when bootmem is currently active (unless bootmem itself is 227*fd07383bSAndrew Morton * implemented on top of MEMBLOCK which isn't the case yet) 228142b45a7SBenjamin Herrenschmidt * 229142b45a7SBenjamin Herrenschmidt * This should however not be an issue for now, as we currently only 230*fd07383bSAndrew Morton * call into MEMBLOCK while it's still active, or much later when slab 231*fd07383bSAndrew Morton * is active for memory hotplug operations 232142b45a7SBenjamin Herrenschmidt */ 233142b45a7SBenjamin Herrenschmidt if (use_slab) { 234142b45a7SBenjamin Herrenschmidt new_array = kmalloc(new_size, GFP_KERNEL); 2351f5026a7STejun Heo addr = new_array ? __pa(new_array) : 0; 2364e2f0775SGavin Shan } else { 23748c3b583SGreg Pearson /* only exclude range when trying to double reserved.regions */ 23848c3b583SGreg Pearson if (type != &memblock.reserved) 23948c3b583SGreg Pearson new_area_start = new_area_size = 0; 24048c3b583SGreg Pearson 24148c3b583SGreg Pearson addr = memblock_find_in_range(new_area_start + new_area_size, 24248c3b583SGreg Pearson memblock.current_limit, 24329f67386SYinghai Lu new_alloc_size, PAGE_SIZE); 24448c3b583SGreg Pearson if (!addr && new_area_size) 24548c3b583SGreg Pearson addr = memblock_find_in_range(0, 24648c3b583SGreg Pearson min(new_area_start, memblock.current_limit), 24729f67386SYinghai Lu new_alloc_size, PAGE_SIZE); 24848c3b583SGreg Pearson 2494e2f0775SGavin Shan new_array = addr ? __va(addr) : 0; 2504e2f0775SGavin Shan } 2511f5026a7STejun Heo if (!addr) { 252142b45a7SBenjamin Herrenschmidt pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", 253142b45a7SBenjamin Herrenschmidt memblock_type_name(type), type->max, type->max * 2); 254142b45a7SBenjamin Herrenschmidt return -1; 255142b45a7SBenjamin Herrenschmidt } 256142b45a7SBenjamin Herrenschmidt 257*fd07383bSAndrew Morton memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]", 258*fd07383bSAndrew Morton memblock_type_name(type), type->max * 2, (u64)addr, 259*fd07383bSAndrew Morton (u64)addr + new_size - 1); 260ea9e4376SYinghai Lu 261*fd07383bSAndrew Morton /* 262*fd07383bSAndrew Morton * Found space, we now need to move the array over before we add the 263*fd07383bSAndrew Morton * reserved region since it may be our reserved array itself that is 264*fd07383bSAndrew Morton * full. 265142b45a7SBenjamin Herrenschmidt */ 266142b45a7SBenjamin Herrenschmidt memcpy(new_array, type->regions, old_size); 267142b45a7SBenjamin Herrenschmidt memset(new_array + type->max, 0, old_size); 268142b45a7SBenjamin Herrenschmidt old_array = type->regions; 269142b45a7SBenjamin Herrenschmidt type->regions = new_array; 270142b45a7SBenjamin Herrenschmidt type->max <<= 1; 271142b45a7SBenjamin Herrenschmidt 272*fd07383bSAndrew Morton /* Free old array. We needn't free it if the array is the static one */ 273181eb394SGavin Shan if (*in_slab) 274181eb394SGavin Shan kfree(old_array); 275181eb394SGavin Shan else if (old_array != memblock_memory_init_regions && 276142b45a7SBenjamin Herrenschmidt old_array != memblock_reserved_init_regions) 27729f67386SYinghai Lu memblock_free(__pa(old_array), old_alloc_size); 278142b45a7SBenjamin Herrenschmidt 279*fd07383bSAndrew Morton /* 280*fd07383bSAndrew Morton * Reserve the new array if that comes from the memblock. Otherwise, we 281*fd07383bSAndrew Morton * needn't do it 282181eb394SGavin Shan */ 283181eb394SGavin Shan if (!use_slab) 28429f67386SYinghai Lu BUG_ON(memblock_reserve(addr, new_alloc_size)); 285181eb394SGavin Shan 286181eb394SGavin Shan /* Update slab flag */ 287181eb394SGavin Shan *in_slab = use_slab; 288181eb394SGavin Shan 289142b45a7SBenjamin Herrenschmidt return 0; 290142b45a7SBenjamin Herrenschmidt } 291142b45a7SBenjamin Herrenschmidt 292784656f9STejun Heo /** 293784656f9STejun Heo * memblock_merge_regions - merge neighboring compatible regions 294784656f9STejun Heo * @type: memblock type to scan 295784656f9STejun Heo * 296784656f9STejun Heo * Scan @type and merge neighboring compatible regions. 297784656f9STejun Heo */ 298784656f9STejun Heo static void __init_memblock memblock_merge_regions(struct memblock_type *type) 299784656f9STejun Heo { 300784656f9STejun Heo int i = 0; 301784656f9STejun Heo 302784656f9STejun Heo /* cnt never goes below 1 */ 303784656f9STejun Heo while (i < type->cnt - 1) { 304784656f9STejun Heo struct memblock_region *this = &type->regions[i]; 305784656f9STejun Heo struct memblock_region *next = &type->regions[i + 1]; 306784656f9STejun Heo 3077c0caeb8STejun Heo if (this->base + this->size != next->base || 3087c0caeb8STejun Heo memblock_get_region_node(this) != 3097c0caeb8STejun Heo memblock_get_region_node(next)) { 310784656f9STejun Heo BUG_ON(this->base + this->size > next->base); 311784656f9STejun Heo i++; 312784656f9STejun Heo continue; 313784656f9STejun Heo } 314784656f9STejun Heo 315784656f9STejun Heo this->size += next->size; 316784656f9STejun Heo memmove(next, next + 1, (type->cnt - (i + 1)) * sizeof(*next)); 317784656f9STejun Heo type->cnt--; 318784656f9STejun Heo } 319784656f9STejun Heo } 320784656f9STejun Heo 321784656f9STejun Heo /** 322784656f9STejun Heo * memblock_insert_region - insert new memblock region 323784656f9STejun Heo * @type: memblock type to insert into 324784656f9STejun Heo * @idx: index for the insertion point 325784656f9STejun Heo * @base: base address of the new region 326784656f9STejun Heo * @size: size of the new region 327784656f9STejun Heo * 328784656f9STejun Heo * Insert new memblock region [@base,@base+@size) into @type at @idx. 329784656f9STejun Heo * @type must already have extra room to accomodate the new region. 330784656f9STejun Heo */ 331784656f9STejun Heo static void __init_memblock memblock_insert_region(struct memblock_type *type, 332784656f9STejun Heo int idx, phys_addr_t base, 3337c0caeb8STejun Heo phys_addr_t size, int nid) 334784656f9STejun Heo { 335784656f9STejun Heo struct memblock_region *rgn = &type->regions[idx]; 336784656f9STejun Heo 337784656f9STejun Heo BUG_ON(type->cnt >= type->max); 338784656f9STejun Heo memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); 339784656f9STejun Heo rgn->base = base; 340784656f9STejun Heo rgn->size = size; 3417c0caeb8STejun Heo memblock_set_region_node(rgn, nid); 342784656f9STejun Heo type->cnt++; 3431440c4e2STejun Heo type->total_size += size; 344784656f9STejun Heo } 345784656f9STejun Heo 346784656f9STejun Heo /** 347784656f9STejun Heo * memblock_add_region - add new memblock region 348784656f9STejun Heo * @type: memblock type to add new region into 349784656f9STejun Heo * @base: base address of the new region 350784656f9STejun Heo * @size: size of the new region 3517fb0bc3fSTejun Heo * @nid: nid of the new region 352784656f9STejun Heo * 353784656f9STejun Heo * Add new memblock region [@base,@base+@size) into @type. The new region 354784656f9STejun Heo * is allowed to overlap with existing ones - overlaps don't affect already 355784656f9STejun Heo * existing regions. @type is guaranteed to be minimal (all neighbouring 356784656f9STejun Heo * compatible regions are merged) after the addition. 357784656f9STejun Heo * 358784656f9STejun Heo * RETURNS: 359784656f9STejun Heo * 0 on success, -errno on failure. 360784656f9STejun Heo */ 361581adcbeSTejun Heo static int __init_memblock memblock_add_region(struct memblock_type *type, 3627fb0bc3fSTejun Heo phys_addr_t base, phys_addr_t size, int nid) 36395f72d1eSYinghai Lu { 364784656f9STejun Heo bool insert = false; 365eb18f1b5STejun Heo phys_addr_t obase = base; 366eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 367784656f9STejun Heo int i, nr_new; 36895f72d1eSYinghai Lu 369b3dc627cSTejun Heo if (!size) 370b3dc627cSTejun Heo return 0; 371b3dc627cSTejun Heo 372784656f9STejun Heo /* special case for empty array */ 373784656f9STejun Heo if (type->regions[0].size == 0) { 3741440c4e2STejun Heo WARN_ON(type->cnt != 1 || type->total_size); 375784656f9STejun Heo type->regions[0].base = base; 376784656f9STejun Heo type->regions[0].size = size; 3777fb0bc3fSTejun Heo memblock_set_region_node(&type->regions[0], nid); 3781440c4e2STejun Heo type->total_size = size; 379784656f9STejun Heo return 0; 380784656f9STejun Heo } 381784656f9STejun Heo repeat: 382784656f9STejun Heo /* 383784656f9STejun Heo * The following is executed twice. Once with %false @insert and 384784656f9STejun Heo * then with %true. The first counts the number of regions needed 385784656f9STejun Heo * to accomodate the new area. The second actually inserts them. 386784656f9STejun Heo */ 387784656f9STejun Heo base = obase; 388784656f9STejun Heo nr_new = 0; 389784656f9STejun Heo 3908f7a6605SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 3918f7a6605SBenjamin Herrenschmidt struct memblock_region *rgn = &type->regions[i]; 392784656f9STejun Heo phys_addr_t rbase = rgn->base; 393784656f9STejun Heo phys_addr_t rend = rbase + rgn->size; 3948f7a6605SBenjamin Herrenschmidt 395784656f9STejun Heo if (rbase >= end) 3968f7a6605SBenjamin Herrenschmidt break; 397784656f9STejun Heo if (rend <= base) 398784656f9STejun Heo continue; 399784656f9STejun Heo /* 400784656f9STejun Heo * @rgn overlaps. If it separates the lower part of new 401784656f9STejun Heo * area, insert that portion. 4028f7a6605SBenjamin Herrenschmidt */ 403784656f9STejun Heo if (rbase > base) { 404784656f9STejun Heo nr_new++; 405784656f9STejun Heo if (insert) 406784656f9STejun Heo memblock_insert_region(type, i++, base, 4077fb0bc3fSTejun Heo rbase - base, nid); 408784656f9STejun Heo } 409784656f9STejun Heo /* area below @rend is dealt with, forget about it */ 410784656f9STejun Heo base = min(rend, end); 4118f7a6605SBenjamin Herrenschmidt } 4128f7a6605SBenjamin Herrenschmidt 413784656f9STejun Heo /* insert the remaining portion */ 414784656f9STejun Heo if (base < end) { 415784656f9STejun Heo nr_new++; 416784656f9STejun Heo if (insert) 4177fb0bc3fSTejun Heo memblock_insert_region(type, i, base, end - base, nid); 4188f7a6605SBenjamin Herrenschmidt } 4198f7a6605SBenjamin Herrenschmidt 420784656f9STejun Heo /* 421784656f9STejun Heo * If this was the first round, resize array and repeat for actual 422784656f9STejun Heo * insertions; otherwise, merge and return. 4238f7a6605SBenjamin Herrenschmidt */ 424784656f9STejun Heo if (!insert) { 425784656f9STejun Heo while (type->cnt + nr_new > type->max) 42648c3b583SGreg Pearson if (memblock_double_array(type, obase, size) < 0) 427784656f9STejun Heo return -ENOMEM; 428784656f9STejun Heo insert = true; 429784656f9STejun Heo goto repeat; 43095f72d1eSYinghai Lu } else { 431784656f9STejun Heo memblock_merge_regions(type); 43295f72d1eSYinghai Lu return 0; 43395f72d1eSYinghai Lu } 434784656f9STejun Heo } 43595f72d1eSYinghai Lu 4367fb0bc3fSTejun Heo int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size, 4377fb0bc3fSTejun Heo int nid) 4387fb0bc3fSTejun Heo { 4397fb0bc3fSTejun Heo return memblock_add_region(&memblock.memory, base, size, nid); 4407fb0bc3fSTejun Heo } 4417fb0bc3fSTejun Heo 442581adcbeSTejun Heo int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) 44395f72d1eSYinghai Lu { 4447fb0bc3fSTejun Heo return memblock_add_region(&memblock.memory, base, size, MAX_NUMNODES); 44595f72d1eSYinghai Lu } 44695f72d1eSYinghai Lu 4476a9ceb31STejun Heo /** 4486a9ceb31STejun Heo * memblock_isolate_range - isolate given range into disjoint memblocks 4496a9ceb31STejun Heo * @type: memblock type to isolate range for 4506a9ceb31STejun Heo * @base: base of range to isolate 4516a9ceb31STejun Heo * @size: size of range to isolate 4526a9ceb31STejun Heo * @start_rgn: out parameter for the start of isolated region 4536a9ceb31STejun Heo * @end_rgn: out parameter for the end of isolated region 4546a9ceb31STejun Heo * 4556a9ceb31STejun Heo * Walk @type and ensure that regions don't cross the boundaries defined by 4566a9ceb31STejun Heo * [@base,@base+@size). Crossing regions are split at the boundaries, 4576a9ceb31STejun Heo * which may create at most two more regions. The index of the first 4586a9ceb31STejun Heo * region inside the range is returned in *@start_rgn and end in *@end_rgn. 4596a9ceb31STejun Heo * 4606a9ceb31STejun Heo * RETURNS: 4616a9ceb31STejun Heo * 0 on success, -errno on failure. 4626a9ceb31STejun Heo */ 4636a9ceb31STejun Heo static int __init_memblock memblock_isolate_range(struct memblock_type *type, 4646a9ceb31STejun Heo phys_addr_t base, phys_addr_t size, 4656a9ceb31STejun Heo int *start_rgn, int *end_rgn) 4666a9ceb31STejun Heo { 467eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 4686a9ceb31STejun Heo int i; 4696a9ceb31STejun Heo 4706a9ceb31STejun Heo *start_rgn = *end_rgn = 0; 4716a9ceb31STejun Heo 472b3dc627cSTejun Heo if (!size) 473b3dc627cSTejun Heo return 0; 474b3dc627cSTejun Heo 4756a9ceb31STejun Heo /* we'll create at most two more regions */ 4766a9ceb31STejun Heo while (type->cnt + 2 > type->max) 47748c3b583SGreg Pearson if (memblock_double_array(type, base, size) < 0) 4786a9ceb31STejun Heo return -ENOMEM; 4796a9ceb31STejun Heo 4806a9ceb31STejun Heo for (i = 0; i < type->cnt; i++) { 4816a9ceb31STejun Heo struct memblock_region *rgn = &type->regions[i]; 4826a9ceb31STejun Heo phys_addr_t rbase = rgn->base; 4836a9ceb31STejun Heo phys_addr_t rend = rbase + rgn->size; 4846a9ceb31STejun Heo 4856a9ceb31STejun Heo if (rbase >= end) 4866a9ceb31STejun Heo break; 4876a9ceb31STejun Heo if (rend <= base) 4886a9ceb31STejun Heo continue; 4896a9ceb31STejun Heo 4906a9ceb31STejun Heo if (rbase < base) { 4916a9ceb31STejun Heo /* 4926a9ceb31STejun Heo * @rgn intersects from below. Split and continue 4936a9ceb31STejun Heo * to process the next region - the new top half. 4946a9ceb31STejun Heo */ 4956a9ceb31STejun Heo rgn->base = base; 4961440c4e2STejun Heo rgn->size -= base - rbase; 4971440c4e2STejun Heo type->total_size -= base - rbase; 4986a9ceb31STejun Heo memblock_insert_region(type, i, rbase, base - rbase, 49971936180STejun Heo memblock_get_region_node(rgn)); 5006a9ceb31STejun Heo } else if (rend > end) { 5016a9ceb31STejun Heo /* 5026a9ceb31STejun Heo * @rgn intersects from above. Split and redo the 5036a9ceb31STejun Heo * current region - the new bottom half. 5046a9ceb31STejun Heo */ 5056a9ceb31STejun Heo rgn->base = end; 5061440c4e2STejun Heo rgn->size -= end - rbase; 5071440c4e2STejun Heo type->total_size -= end - rbase; 5086a9ceb31STejun Heo memblock_insert_region(type, i--, rbase, end - rbase, 50971936180STejun Heo memblock_get_region_node(rgn)); 5106a9ceb31STejun Heo } else { 5116a9ceb31STejun Heo /* @rgn is fully contained, record it */ 5126a9ceb31STejun Heo if (!*end_rgn) 5136a9ceb31STejun Heo *start_rgn = i; 5146a9ceb31STejun Heo *end_rgn = i + 1; 5156a9ceb31STejun Heo } 5166a9ceb31STejun Heo } 5176a9ceb31STejun Heo 5186a9ceb31STejun Heo return 0; 5196a9ceb31STejun Heo } 5206a9ceb31STejun Heo 521581adcbeSTejun Heo static int __init_memblock __memblock_remove(struct memblock_type *type, 5228f7a6605SBenjamin Herrenschmidt phys_addr_t base, phys_addr_t size) 52395f72d1eSYinghai Lu { 52471936180STejun Heo int start_rgn, end_rgn; 52571936180STejun Heo int i, ret; 52695f72d1eSYinghai Lu 52771936180STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 52871936180STejun Heo if (ret) 52971936180STejun Heo return ret; 53095f72d1eSYinghai Lu 53171936180STejun Heo for (i = end_rgn - 1; i >= start_rgn; i--) 53271936180STejun Heo memblock_remove_region(type, i); 53395f72d1eSYinghai Lu return 0; 53495f72d1eSYinghai Lu } 53595f72d1eSYinghai Lu 536581adcbeSTejun Heo int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) 53795f72d1eSYinghai Lu { 53895f72d1eSYinghai Lu return __memblock_remove(&memblock.memory, base, size); 53995f72d1eSYinghai Lu } 54095f72d1eSYinghai Lu 541581adcbeSTejun Heo int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) 54295f72d1eSYinghai Lu { 54324aa0788STejun Heo memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n", 544a150439cSH. Peter Anvin (unsigned long long)base, 545a150439cSH. Peter Anvin (unsigned long long)base + size, 546a150439cSH. Peter Anvin (void *)_RET_IP_); 54724aa0788STejun Heo 54895f72d1eSYinghai Lu return __memblock_remove(&memblock.reserved, base, size); 54995f72d1eSYinghai Lu } 55095f72d1eSYinghai Lu 551581adcbeSTejun Heo int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) 55295f72d1eSYinghai Lu { 553e3239ff9SBenjamin Herrenschmidt struct memblock_type *_rgn = &memblock.reserved; 55495f72d1eSYinghai Lu 55524aa0788STejun Heo memblock_dbg("memblock_reserve: [%#016llx-%#016llx] %pF\n", 556a150439cSH. Peter Anvin (unsigned long long)base, 557a150439cSH. Peter Anvin (unsigned long long)base + size, 558a150439cSH. Peter Anvin (void *)_RET_IP_); 55995f72d1eSYinghai Lu 5607fb0bc3fSTejun Heo return memblock_add_region(_rgn, base, size, MAX_NUMNODES); 56195f72d1eSYinghai Lu } 56295f72d1eSYinghai Lu 56335fd0808STejun Heo /** 56435fd0808STejun Heo * __next_free_mem_range - next function for for_each_free_mem_range() 56535fd0808STejun Heo * @idx: pointer to u64 loop variable 56635fd0808STejun Heo * @nid: nid: node selector, %MAX_NUMNODES for all nodes 567dad7557eSWanpeng Li * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL 568dad7557eSWanpeng Li * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL 569dad7557eSWanpeng Li * @out_nid: ptr to int for nid of the range, can be %NULL 57035fd0808STejun Heo * 57135fd0808STejun Heo * Find the first free area from *@idx which matches @nid, fill the out 57235fd0808STejun Heo * parameters, and update *@idx for the next iteration. The lower 32bit of 57335fd0808STejun Heo * *@idx contains index into memory region and the upper 32bit indexes the 57435fd0808STejun Heo * areas before each reserved region. For example, if reserved regions 57535fd0808STejun Heo * look like the following, 57635fd0808STejun Heo * 57735fd0808STejun Heo * 0:[0-16), 1:[32-48), 2:[128-130) 57835fd0808STejun Heo * 57935fd0808STejun Heo * The upper 32bit indexes the following regions. 58035fd0808STejun Heo * 58135fd0808STejun Heo * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX) 58235fd0808STejun Heo * 58335fd0808STejun Heo * As both region arrays are sorted, the function advances the two indices 58435fd0808STejun Heo * in lockstep and returns each intersection. 58535fd0808STejun Heo */ 58635fd0808STejun Heo void __init_memblock __next_free_mem_range(u64 *idx, int nid, 58735fd0808STejun Heo phys_addr_t *out_start, 58835fd0808STejun Heo phys_addr_t *out_end, int *out_nid) 58935fd0808STejun Heo { 59035fd0808STejun Heo struct memblock_type *mem = &memblock.memory; 59135fd0808STejun Heo struct memblock_type *rsv = &memblock.reserved; 59235fd0808STejun Heo int mi = *idx & 0xffffffff; 59335fd0808STejun Heo int ri = *idx >> 32; 59435fd0808STejun Heo 59535fd0808STejun Heo for ( ; mi < mem->cnt; mi++) { 59635fd0808STejun Heo struct memblock_region *m = &mem->regions[mi]; 59735fd0808STejun Heo phys_addr_t m_start = m->base; 59835fd0808STejun Heo phys_addr_t m_end = m->base + m->size; 59935fd0808STejun Heo 60035fd0808STejun Heo /* only memory regions are associated with nodes, check it */ 60135fd0808STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 60235fd0808STejun Heo continue; 60335fd0808STejun Heo 60435fd0808STejun Heo /* scan areas before each reservation for intersection */ 60535fd0808STejun Heo for ( ; ri < rsv->cnt + 1; ri++) { 60635fd0808STejun Heo struct memblock_region *r = &rsv->regions[ri]; 60735fd0808STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 60835fd0808STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 60935fd0808STejun Heo 61035fd0808STejun Heo /* if ri advanced past mi, break out to advance mi */ 61135fd0808STejun Heo if (r_start >= m_end) 61235fd0808STejun Heo break; 61335fd0808STejun Heo /* if the two regions intersect, we're done */ 61435fd0808STejun Heo if (m_start < r_end) { 61535fd0808STejun Heo if (out_start) 61635fd0808STejun Heo *out_start = max(m_start, r_start); 61735fd0808STejun Heo if (out_end) 61835fd0808STejun Heo *out_end = min(m_end, r_end); 61935fd0808STejun Heo if (out_nid) 62035fd0808STejun Heo *out_nid = memblock_get_region_node(m); 62135fd0808STejun Heo /* 62235fd0808STejun Heo * The region which ends first is advanced 62335fd0808STejun Heo * for the next iteration. 62435fd0808STejun Heo */ 62535fd0808STejun Heo if (m_end <= r_end) 62635fd0808STejun Heo mi++; 62735fd0808STejun Heo else 62835fd0808STejun Heo ri++; 62935fd0808STejun Heo *idx = (u32)mi | (u64)ri << 32; 63035fd0808STejun Heo return; 63135fd0808STejun Heo } 63235fd0808STejun Heo } 63335fd0808STejun Heo } 63435fd0808STejun Heo 63535fd0808STejun Heo /* signal end of iteration */ 63635fd0808STejun Heo *idx = ULLONG_MAX; 63735fd0808STejun Heo } 63835fd0808STejun Heo 6397bd0b0f0STejun Heo /** 6407bd0b0f0STejun Heo * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse() 6417bd0b0f0STejun Heo * @idx: pointer to u64 loop variable 6427bd0b0f0STejun Heo * @nid: nid: node selector, %MAX_NUMNODES for all nodes 643dad7557eSWanpeng Li * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL 644dad7557eSWanpeng Li * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL 645dad7557eSWanpeng Li * @out_nid: ptr to int for nid of the range, can be %NULL 6467bd0b0f0STejun Heo * 6477bd0b0f0STejun Heo * Reverse of __next_free_mem_range(). 6487bd0b0f0STejun Heo */ 6497bd0b0f0STejun Heo void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid, 6507bd0b0f0STejun Heo phys_addr_t *out_start, 6517bd0b0f0STejun Heo phys_addr_t *out_end, int *out_nid) 6527bd0b0f0STejun Heo { 6537bd0b0f0STejun Heo struct memblock_type *mem = &memblock.memory; 6547bd0b0f0STejun Heo struct memblock_type *rsv = &memblock.reserved; 6557bd0b0f0STejun Heo int mi = *idx & 0xffffffff; 6567bd0b0f0STejun Heo int ri = *idx >> 32; 6577bd0b0f0STejun Heo 6587bd0b0f0STejun Heo if (*idx == (u64)ULLONG_MAX) { 6597bd0b0f0STejun Heo mi = mem->cnt - 1; 6607bd0b0f0STejun Heo ri = rsv->cnt; 6617bd0b0f0STejun Heo } 6627bd0b0f0STejun Heo 6637bd0b0f0STejun Heo for ( ; mi >= 0; mi--) { 6647bd0b0f0STejun Heo struct memblock_region *m = &mem->regions[mi]; 6657bd0b0f0STejun Heo phys_addr_t m_start = m->base; 6667bd0b0f0STejun Heo phys_addr_t m_end = m->base + m->size; 6677bd0b0f0STejun Heo 6687bd0b0f0STejun Heo /* only memory regions are associated with nodes, check it */ 6697bd0b0f0STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 6707bd0b0f0STejun Heo continue; 6717bd0b0f0STejun Heo 6727bd0b0f0STejun Heo /* scan areas before each reservation for intersection */ 6737bd0b0f0STejun Heo for ( ; ri >= 0; ri--) { 6747bd0b0f0STejun Heo struct memblock_region *r = &rsv->regions[ri]; 6757bd0b0f0STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 6767bd0b0f0STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 6777bd0b0f0STejun Heo 6787bd0b0f0STejun Heo /* if ri advanced past mi, break out to advance mi */ 6797bd0b0f0STejun Heo if (r_end <= m_start) 6807bd0b0f0STejun Heo break; 6817bd0b0f0STejun Heo /* if the two regions intersect, we're done */ 6827bd0b0f0STejun Heo if (m_end > r_start) { 6837bd0b0f0STejun Heo if (out_start) 6847bd0b0f0STejun Heo *out_start = max(m_start, r_start); 6857bd0b0f0STejun Heo if (out_end) 6867bd0b0f0STejun Heo *out_end = min(m_end, r_end); 6877bd0b0f0STejun Heo if (out_nid) 6887bd0b0f0STejun Heo *out_nid = memblock_get_region_node(m); 6897bd0b0f0STejun Heo 6907bd0b0f0STejun Heo if (m_start >= r_start) 6917bd0b0f0STejun Heo mi--; 6927bd0b0f0STejun Heo else 6937bd0b0f0STejun Heo ri--; 6947bd0b0f0STejun Heo *idx = (u32)mi | (u64)ri << 32; 6957bd0b0f0STejun Heo return; 6967bd0b0f0STejun Heo } 6977bd0b0f0STejun Heo } 6987bd0b0f0STejun Heo } 6997bd0b0f0STejun Heo 7007bd0b0f0STejun Heo *idx = ULLONG_MAX; 7017bd0b0f0STejun Heo } 7027bd0b0f0STejun Heo 7037c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 7047c0caeb8STejun Heo /* 7057c0caeb8STejun Heo * Common iterator interface used to define for_each_mem_range(). 7067c0caeb8STejun Heo */ 7077c0caeb8STejun Heo void __init_memblock __next_mem_pfn_range(int *idx, int nid, 7087c0caeb8STejun Heo unsigned long *out_start_pfn, 7097c0caeb8STejun Heo unsigned long *out_end_pfn, int *out_nid) 7107c0caeb8STejun Heo { 7117c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 7127c0caeb8STejun Heo struct memblock_region *r; 7137c0caeb8STejun Heo 7147c0caeb8STejun Heo while (++*idx < type->cnt) { 7157c0caeb8STejun Heo r = &type->regions[*idx]; 7167c0caeb8STejun Heo 7177c0caeb8STejun Heo if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size)) 7187c0caeb8STejun Heo continue; 7197c0caeb8STejun Heo if (nid == MAX_NUMNODES || nid == r->nid) 7207c0caeb8STejun Heo break; 7217c0caeb8STejun Heo } 7227c0caeb8STejun Heo if (*idx >= type->cnt) { 7237c0caeb8STejun Heo *idx = -1; 7247c0caeb8STejun Heo return; 7257c0caeb8STejun Heo } 7267c0caeb8STejun Heo 7277c0caeb8STejun Heo if (out_start_pfn) 7287c0caeb8STejun Heo *out_start_pfn = PFN_UP(r->base); 7297c0caeb8STejun Heo if (out_end_pfn) 7307c0caeb8STejun Heo *out_end_pfn = PFN_DOWN(r->base + r->size); 7317c0caeb8STejun Heo if (out_nid) 7327c0caeb8STejun Heo *out_nid = r->nid; 7337c0caeb8STejun Heo } 7347c0caeb8STejun Heo 7357c0caeb8STejun Heo /** 7367c0caeb8STejun Heo * memblock_set_node - set node ID on memblock regions 7377c0caeb8STejun Heo * @base: base of area to set node ID for 7387c0caeb8STejun Heo * @size: size of area to set node ID for 7397c0caeb8STejun Heo * @nid: node ID to set 7407c0caeb8STejun Heo * 7417c0caeb8STejun Heo * Set the nid of memblock memory regions in [@base,@base+@size) to @nid. 7427c0caeb8STejun Heo * Regions which cross the area boundaries are split as necessary. 7437c0caeb8STejun Heo * 7447c0caeb8STejun Heo * RETURNS: 7457c0caeb8STejun Heo * 0 on success, -errno on failure. 7467c0caeb8STejun Heo */ 7477c0caeb8STejun Heo int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size, 7487c0caeb8STejun Heo int nid) 7497c0caeb8STejun Heo { 7507c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 7516a9ceb31STejun Heo int start_rgn, end_rgn; 7526a9ceb31STejun Heo int i, ret; 7537c0caeb8STejun Heo 7546a9ceb31STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 7556a9ceb31STejun Heo if (ret) 7566a9ceb31STejun Heo return ret; 7577c0caeb8STejun Heo 7586a9ceb31STejun Heo for (i = start_rgn; i < end_rgn; i++) 7596a9ceb31STejun Heo type->regions[i].nid = nid; 7607c0caeb8STejun Heo 7617c0caeb8STejun Heo memblock_merge_regions(type); 7627c0caeb8STejun Heo return 0; 7637c0caeb8STejun Heo } 7647c0caeb8STejun Heo #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ 7657c0caeb8STejun Heo 7667bd0b0f0STejun Heo static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size, 7677bd0b0f0STejun Heo phys_addr_t align, phys_addr_t max_addr, 7687bd0b0f0STejun Heo int nid) 76995f72d1eSYinghai Lu { 7706ed311b2SBenjamin Herrenschmidt phys_addr_t found; 77195f72d1eSYinghai Lu 772847854f5STejun Heo /* align @size to avoid excessive fragmentation on reserved array */ 773847854f5STejun Heo size = round_up(size, align); 774847854f5STejun Heo 7757bd0b0f0STejun Heo found = memblock_find_in_range_node(0, max_addr, size, align, nid); 7769c8c27e2STejun Heo if (found && !memblock_reserve(found, size)) 7776ed311b2SBenjamin Herrenschmidt return found; 7786ed311b2SBenjamin Herrenschmidt 7796ed311b2SBenjamin Herrenschmidt return 0; 78095f72d1eSYinghai Lu } 78195f72d1eSYinghai Lu 7827bd0b0f0STejun Heo phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) 7837bd0b0f0STejun Heo { 7847bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid); 7857bd0b0f0STejun Heo } 7867bd0b0f0STejun Heo 7877bd0b0f0STejun Heo phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 7887bd0b0f0STejun Heo { 7897bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES); 7907bd0b0f0STejun Heo } 7917bd0b0f0STejun Heo 7926ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 79395f72d1eSYinghai Lu { 7946ed311b2SBenjamin Herrenschmidt phys_addr_t alloc; 7956ed311b2SBenjamin Herrenschmidt 7966ed311b2SBenjamin Herrenschmidt alloc = __memblock_alloc_base(size, align, max_addr); 7976ed311b2SBenjamin Herrenschmidt 7986ed311b2SBenjamin Herrenschmidt if (alloc == 0) 7996ed311b2SBenjamin Herrenschmidt panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", 8006ed311b2SBenjamin Herrenschmidt (unsigned long long) size, (unsigned long long) max_addr); 8016ed311b2SBenjamin Herrenschmidt 8026ed311b2SBenjamin Herrenschmidt return alloc; 80395f72d1eSYinghai Lu } 80495f72d1eSYinghai Lu 8056ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) 80695f72d1eSYinghai Lu { 8076ed311b2SBenjamin Herrenschmidt return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 80895f72d1eSYinghai Lu } 80995f72d1eSYinghai Lu 8109d1e2492SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) 8119d1e2492SBenjamin Herrenschmidt { 8129d1e2492SBenjamin Herrenschmidt phys_addr_t res = memblock_alloc_nid(size, align, nid); 8139d1e2492SBenjamin Herrenschmidt 8149d1e2492SBenjamin Herrenschmidt if (res) 8159d1e2492SBenjamin Herrenschmidt return res; 81615fb0972STejun Heo return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 81795f72d1eSYinghai Lu } 81895f72d1eSYinghai Lu 8199d1e2492SBenjamin Herrenschmidt 8209d1e2492SBenjamin Herrenschmidt /* 8219d1e2492SBenjamin Herrenschmidt * Remaining API functions 8229d1e2492SBenjamin Herrenschmidt */ 8239d1e2492SBenjamin Herrenschmidt 8242898cc4cSBenjamin Herrenschmidt phys_addr_t __init memblock_phys_mem_size(void) 82595f72d1eSYinghai Lu { 8261440c4e2STejun Heo return memblock.memory.total_size; 82795f72d1eSYinghai Lu } 82895f72d1eSYinghai Lu 8290a93ebefSSam Ravnborg /* lowest address */ 8300a93ebefSSam Ravnborg phys_addr_t __init_memblock memblock_start_of_DRAM(void) 8310a93ebefSSam Ravnborg { 8320a93ebefSSam Ravnborg return memblock.memory.regions[0].base; 8330a93ebefSSam Ravnborg } 8340a93ebefSSam Ravnborg 83510d06439SYinghai Lu phys_addr_t __init_memblock memblock_end_of_DRAM(void) 83695f72d1eSYinghai Lu { 83795f72d1eSYinghai Lu int idx = memblock.memory.cnt - 1; 83895f72d1eSYinghai Lu 839e3239ff9SBenjamin Herrenschmidt return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); 84095f72d1eSYinghai Lu } 84195f72d1eSYinghai Lu 842c0ce8fefSTejun Heo void __init memblock_enforce_memory_limit(phys_addr_t limit) 84395f72d1eSYinghai Lu { 84495f72d1eSYinghai Lu unsigned long i; 845c0ce8fefSTejun Heo phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX; 84695f72d1eSYinghai Lu 847c0ce8fefSTejun Heo if (!limit) 84895f72d1eSYinghai Lu return; 84995f72d1eSYinghai Lu 850c0ce8fefSTejun Heo /* find out max address */ 85195f72d1eSYinghai Lu for (i = 0; i < memblock.memory.cnt; i++) { 852c0ce8fefSTejun Heo struct memblock_region *r = &memblock.memory.regions[i]; 85395f72d1eSYinghai Lu 854c0ce8fefSTejun Heo if (limit <= r->size) { 855c0ce8fefSTejun Heo max_addr = r->base + limit; 85695f72d1eSYinghai Lu break; 85795f72d1eSYinghai Lu } 858c0ce8fefSTejun Heo limit -= r->size; 85995f72d1eSYinghai Lu } 860c0ce8fefSTejun Heo 861c0ce8fefSTejun Heo /* truncate both memory and reserved regions */ 862c0ce8fefSTejun Heo __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX); 863c0ce8fefSTejun Heo __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX); 86495f72d1eSYinghai Lu } 86595f72d1eSYinghai Lu 866cd79481dSYinghai Lu static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) 86772d4b0b4SBenjamin Herrenschmidt { 86872d4b0b4SBenjamin Herrenschmidt unsigned int left = 0, right = type->cnt; 86972d4b0b4SBenjamin Herrenschmidt 87072d4b0b4SBenjamin Herrenschmidt do { 87172d4b0b4SBenjamin Herrenschmidt unsigned int mid = (right + left) / 2; 87272d4b0b4SBenjamin Herrenschmidt 87372d4b0b4SBenjamin Herrenschmidt if (addr < type->regions[mid].base) 87472d4b0b4SBenjamin Herrenschmidt right = mid; 87572d4b0b4SBenjamin Herrenschmidt else if (addr >= (type->regions[mid].base + 87672d4b0b4SBenjamin Herrenschmidt type->regions[mid].size)) 87772d4b0b4SBenjamin Herrenschmidt left = mid + 1; 87872d4b0b4SBenjamin Herrenschmidt else 87972d4b0b4SBenjamin Herrenschmidt return mid; 88072d4b0b4SBenjamin Herrenschmidt } while (left < right); 88172d4b0b4SBenjamin Herrenschmidt return -1; 88272d4b0b4SBenjamin Herrenschmidt } 88372d4b0b4SBenjamin Herrenschmidt 8842898cc4cSBenjamin Herrenschmidt int __init memblock_is_reserved(phys_addr_t addr) 88595f72d1eSYinghai Lu { 88672d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.reserved, addr) != -1; 88795f72d1eSYinghai Lu } 88872d4b0b4SBenjamin Herrenschmidt 8893661ca66SYinghai Lu int __init_memblock memblock_is_memory(phys_addr_t addr) 89072d4b0b4SBenjamin Herrenschmidt { 89172d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.memory, addr) != -1; 89272d4b0b4SBenjamin Herrenschmidt } 89372d4b0b4SBenjamin Herrenschmidt 894eab30949SStephen Boyd /** 895eab30949SStephen Boyd * memblock_is_region_memory - check if a region is a subset of memory 896eab30949SStephen Boyd * @base: base of region to check 897eab30949SStephen Boyd * @size: size of region to check 898eab30949SStephen Boyd * 899eab30949SStephen Boyd * Check if the region [@base, @base+@size) is a subset of a memory block. 900eab30949SStephen Boyd * 901eab30949SStephen Boyd * RETURNS: 902eab30949SStephen Boyd * 0 if false, non-zero if true 903eab30949SStephen Boyd */ 9043661ca66SYinghai Lu int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) 90572d4b0b4SBenjamin Herrenschmidt { 906abb65272STomi Valkeinen int idx = memblock_search(&memblock.memory, base); 907eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 90872d4b0b4SBenjamin Herrenschmidt 90972d4b0b4SBenjamin Herrenschmidt if (idx == -1) 91095f72d1eSYinghai Lu return 0; 911abb65272STomi Valkeinen return memblock.memory.regions[idx].base <= base && 912abb65272STomi Valkeinen (memblock.memory.regions[idx].base + 913eb18f1b5STejun Heo memblock.memory.regions[idx].size) >= end; 91495f72d1eSYinghai Lu } 91595f72d1eSYinghai Lu 916eab30949SStephen Boyd /** 917eab30949SStephen Boyd * memblock_is_region_reserved - check if a region intersects reserved memory 918eab30949SStephen Boyd * @base: base of region to check 919eab30949SStephen Boyd * @size: size of region to check 920eab30949SStephen Boyd * 921eab30949SStephen Boyd * Check if the region [@base, @base+@size) intersects a reserved memory block. 922eab30949SStephen Boyd * 923eab30949SStephen Boyd * RETURNS: 924eab30949SStephen Boyd * 0 if false, non-zero if true 925eab30949SStephen Boyd */ 92610d06439SYinghai Lu int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) 92795f72d1eSYinghai Lu { 928eb18f1b5STejun Heo memblock_cap_size(base, &size); 929f1c2c19cSBenjamin Herrenschmidt return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; 93095f72d1eSYinghai Lu } 93195f72d1eSYinghai Lu 932e63075a3SBenjamin Herrenschmidt 9333661ca66SYinghai Lu void __init_memblock memblock_set_current_limit(phys_addr_t limit) 934e63075a3SBenjamin Herrenschmidt { 935e63075a3SBenjamin Herrenschmidt memblock.current_limit = limit; 936e63075a3SBenjamin Herrenschmidt } 937e63075a3SBenjamin Herrenschmidt 9387c0caeb8STejun Heo static void __init_memblock memblock_dump(struct memblock_type *type, char *name) 9396ed311b2SBenjamin Herrenschmidt { 9406ed311b2SBenjamin Herrenschmidt unsigned long long base, size; 9416ed311b2SBenjamin Herrenschmidt int i; 9426ed311b2SBenjamin Herrenschmidt 9437c0caeb8STejun Heo pr_info(" %s.cnt = 0x%lx\n", name, type->cnt); 9446ed311b2SBenjamin Herrenschmidt 9457c0caeb8STejun Heo for (i = 0; i < type->cnt; i++) { 9467c0caeb8STejun Heo struct memblock_region *rgn = &type->regions[i]; 9477c0caeb8STejun Heo char nid_buf[32] = ""; 9486ed311b2SBenjamin Herrenschmidt 9497c0caeb8STejun Heo base = rgn->base; 9507c0caeb8STejun Heo size = rgn->size; 9517c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 9527c0caeb8STejun Heo if (memblock_get_region_node(rgn) != MAX_NUMNODES) 9537c0caeb8STejun Heo snprintf(nid_buf, sizeof(nid_buf), " on node %d", 9547c0caeb8STejun Heo memblock_get_region_node(rgn)); 9557c0caeb8STejun Heo #endif 9567c0caeb8STejun Heo pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s\n", 9577c0caeb8STejun Heo name, i, base, base + size - 1, size, nid_buf); 9586ed311b2SBenjamin Herrenschmidt } 9596ed311b2SBenjamin Herrenschmidt } 9606ed311b2SBenjamin Herrenschmidt 9614ff7b82fSTejun Heo void __init_memblock __memblock_dump_all(void) 9626ed311b2SBenjamin Herrenschmidt { 9636ed311b2SBenjamin Herrenschmidt pr_info("MEMBLOCK configuration:\n"); 9641440c4e2STejun Heo pr_info(" memory size = %#llx reserved size = %#llx\n", 9651440c4e2STejun Heo (unsigned long long)memblock.memory.total_size, 9661440c4e2STejun Heo (unsigned long long)memblock.reserved.total_size); 9676ed311b2SBenjamin Herrenschmidt 9686ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.memory, "memory"); 9696ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.reserved, "reserved"); 9706ed311b2SBenjamin Herrenschmidt } 9716ed311b2SBenjamin Herrenschmidt 9721aadc056STejun Heo void __init memblock_allow_resize(void) 9736ed311b2SBenjamin Herrenschmidt { 974142b45a7SBenjamin Herrenschmidt memblock_can_resize = 1; 9756ed311b2SBenjamin Herrenschmidt } 9766ed311b2SBenjamin Herrenschmidt 9776ed311b2SBenjamin Herrenschmidt static int __init early_memblock(char *p) 9786ed311b2SBenjamin Herrenschmidt { 9796ed311b2SBenjamin Herrenschmidt if (p && strstr(p, "debug")) 9806ed311b2SBenjamin Herrenschmidt memblock_debug = 1; 9816ed311b2SBenjamin Herrenschmidt return 0; 9826ed311b2SBenjamin Herrenschmidt } 9836ed311b2SBenjamin Herrenschmidt early_param("memblock", early_memblock); 9846ed311b2SBenjamin Herrenschmidt 985c378ddd5STejun Heo #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK) 9866d03b885SBenjamin Herrenschmidt 9876d03b885SBenjamin Herrenschmidt static int memblock_debug_show(struct seq_file *m, void *private) 9886d03b885SBenjamin Herrenschmidt { 9896d03b885SBenjamin Herrenschmidt struct memblock_type *type = m->private; 9906d03b885SBenjamin Herrenschmidt struct memblock_region *reg; 9916d03b885SBenjamin Herrenschmidt int i; 9926d03b885SBenjamin Herrenschmidt 9936d03b885SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 9946d03b885SBenjamin Herrenschmidt reg = &type->regions[i]; 9956d03b885SBenjamin Herrenschmidt seq_printf(m, "%4d: ", i); 9966d03b885SBenjamin Herrenschmidt if (sizeof(phys_addr_t) == 4) 9976d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%08lx..0x%08lx\n", 9986d03b885SBenjamin Herrenschmidt (unsigned long)reg->base, 9996d03b885SBenjamin Herrenschmidt (unsigned long)(reg->base + reg->size - 1)); 10006d03b885SBenjamin Herrenschmidt else 10016d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%016llx..0x%016llx\n", 10026d03b885SBenjamin Herrenschmidt (unsigned long long)reg->base, 10036d03b885SBenjamin Herrenschmidt (unsigned long long)(reg->base + reg->size - 1)); 10046d03b885SBenjamin Herrenschmidt 10056d03b885SBenjamin Herrenschmidt } 10066d03b885SBenjamin Herrenschmidt return 0; 10076d03b885SBenjamin Herrenschmidt } 10086d03b885SBenjamin Herrenschmidt 10096d03b885SBenjamin Herrenschmidt static int memblock_debug_open(struct inode *inode, struct file *file) 10106d03b885SBenjamin Herrenschmidt { 10116d03b885SBenjamin Herrenschmidt return single_open(file, memblock_debug_show, inode->i_private); 10126d03b885SBenjamin Herrenschmidt } 10136d03b885SBenjamin Herrenschmidt 10146d03b885SBenjamin Herrenschmidt static const struct file_operations memblock_debug_fops = { 10156d03b885SBenjamin Herrenschmidt .open = memblock_debug_open, 10166d03b885SBenjamin Herrenschmidt .read = seq_read, 10176d03b885SBenjamin Herrenschmidt .llseek = seq_lseek, 10186d03b885SBenjamin Herrenschmidt .release = single_release, 10196d03b885SBenjamin Herrenschmidt }; 10206d03b885SBenjamin Herrenschmidt 10216d03b885SBenjamin Herrenschmidt static int __init memblock_init_debugfs(void) 10226d03b885SBenjamin Herrenschmidt { 10236d03b885SBenjamin Herrenschmidt struct dentry *root = debugfs_create_dir("memblock", NULL); 10246d03b885SBenjamin Herrenschmidt if (!root) 10256d03b885SBenjamin Herrenschmidt return -ENXIO; 10266d03b885SBenjamin Herrenschmidt debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); 10276d03b885SBenjamin Herrenschmidt debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); 10286d03b885SBenjamin Herrenschmidt 10296d03b885SBenjamin Herrenschmidt return 0; 10306d03b885SBenjamin Herrenschmidt } 10316d03b885SBenjamin Herrenschmidt __initcall(memblock_init_debugfs); 10326d03b885SBenjamin Herrenschmidt 10336d03b885SBenjamin Herrenschmidt #endif /* CONFIG_DEBUG_FS */ 1034