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 2379442ed1STang Chen #include <asm-generic/sections.h> 2479442ed1STang Chen 25fe091c20STejun Heo static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; 26fe091c20STejun Heo static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; 27fe091c20STejun Heo 28fe091c20STejun Heo struct memblock memblock __initdata_memblock = { 29fe091c20STejun Heo .memory.regions = memblock_memory_init_regions, 30fe091c20STejun Heo .memory.cnt = 1, /* empty dummy entry */ 31fe091c20STejun Heo .memory.max = INIT_MEMBLOCK_REGIONS, 32fe091c20STejun Heo 33fe091c20STejun Heo .reserved.regions = memblock_reserved_init_regions, 34fe091c20STejun Heo .reserved.cnt = 1, /* empty dummy entry */ 35fe091c20STejun Heo .reserved.max = INIT_MEMBLOCK_REGIONS, 36fe091c20STejun Heo 3779442ed1STang Chen .bottom_up = false, 38fe091c20STejun Heo .current_limit = MEMBLOCK_ALLOC_ANYWHERE, 39fe091c20STejun Heo }; 4095f72d1eSYinghai Lu 4110d06439SYinghai Lu int memblock_debug __initdata_memblock; 421aadc056STejun Heo static int memblock_can_resize __initdata_memblock; 43181eb394SGavin Shan static int memblock_memory_in_slab __initdata_memblock = 0; 44181eb394SGavin Shan static int memblock_reserved_in_slab __initdata_memblock = 0; 4595f72d1eSYinghai Lu 46142b45a7SBenjamin Herrenschmidt /* inline so we don't get a warning when pr_debug is compiled out */ 47c2233116SRaghavendra D Prabhu static __init_memblock const char * 48c2233116SRaghavendra D Prabhu memblock_type_name(struct memblock_type *type) 49142b45a7SBenjamin Herrenschmidt { 50142b45a7SBenjamin Herrenschmidt if (type == &memblock.memory) 51142b45a7SBenjamin Herrenschmidt return "memory"; 52142b45a7SBenjamin Herrenschmidt else if (type == &memblock.reserved) 53142b45a7SBenjamin Herrenschmidt return "reserved"; 54142b45a7SBenjamin Herrenschmidt else 55142b45a7SBenjamin Herrenschmidt return "unknown"; 56142b45a7SBenjamin Herrenschmidt } 57142b45a7SBenjamin Herrenschmidt 58eb18f1b5STejun Heo /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */ 59eb18f1b5STejun Heo static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size) 60eb18f1b5STejun Heo { 61eb18f1b5STejun Heo return *size = min(*size, (phys_addr_t)ULLONG_MAX - base); 62eb18f1b5STejun Heo } 63eb18f1b5STejun Heo 646ed311b2SBenjamin Herrenschmidt /* 656ed311b2SBenjamin Herrenschmidt * Address comparison utilities 666ed311b2SBenjamin Herrenschmidt */ 6710d06439SYinghai Lu static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, 682898cc4cSBenjamin Herrenschmidt phys_addr_t base2, phys_addr_t size2) 6995f72d1eSYinghai Lu { 7095f72d1eSYinghai Lu return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); 7195f72d1eSYinghai Lu } 7295f72d1eSYinghai Lu 732d7d3eb2SH Hartley Sweeten static long __init_memblock memblock_overlaps_region(struct memblock_type *type, 742d7d3eb2SH Hartley Sweeten phys_addr_t base, phys_addr_t size) 756ed311b2SBenjamin Herrenschmidt { 766ed311b2SBenjamin Herrenschmidt unsigned long i; 776ed311b2SBenjamin Herrenschmidt 786ed311b2SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 796ed311b2SBenjamin Herrenschmidt phys_addr_t rgnbase = type->regions[i].base; 806ed311b2SBenjamin Herrenschmidt phys_addr_t rgnsize = type->regions[i].size; 816ed311b2SBenjamin Herrenschmidt if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) 826ed311b2SBenjamin Herrenschmidt break; 836ed311b2SBenjamin Herrenschmidt } 846ed311b2SBenjamin Herrenschmidt 856ed311b2SBenjamin Herrenschmidt return (i < type->cnt) ? i : -1; 866ed311b2SBenjamin Herrenschmidt } 876ed311b2SBenjamin Herrenschmidt 8879442ed1STang Chen /* 8979442ed1STang Chen * __memblock_find_range_bottom_up - find free area utility in bottom-up 9079442ed1STang Chen * @start: start of candidate range 9179442ed1STang Chen * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 9279442ed1STang Chen * @size: size of free area to find 9379442ed1STang Chen * @align: alignment of free area to find 9479442ed1STang Chen * @nid: nid of the free area to find, %MAX_NUMNODES for any node 9579442ed1STang Chen * 9679442ed1STang Chen * Utility called from memblock_find_in_range_node(), find free area bottom-up. 9779442ed1STang Chen * 9879442ed1STang Chen * RETURNS: 9979442ed1STang Chen * Found address on success, 0 on failure. 10079442ed1STang Chen */ 10179442ed1STang Chen static phys_addr_t __init_memblock 10279442ed1STang Chen __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end, 10379442ed1STang Chen phys_addr_t size, phys_addr_t align, int nid) 10479442ed1STang Chen { 10579442ed1STang Chen phys_addr_t this_start, this_end, cand; 10679442ed1STang Chen u64 i; 10779442ed1STang Chen 10879442ed1STang Chen for_each_free_mem_range(i, nid, &this_start, &this_end, NULL) { 10979442ed1STang Chen this_start = clamp(this_start, start, end); 11079442ed1STang Chen this_end = clamp(this_end, start, end); 11179442ed1STang Chen 11279442ed1STang Chen cand = round_up(this_start, align); 11379442ed1STang Chen if (cand < this_end && this_end - cand >= size) 11479442ed1STang Chen return cand; 11579442ed1STang Chen } 11679442ed1STang Chen 11779442ed1STang Chen return 0; 11879442ed1STang Chen } 11979442ed1STang Chen 1207bd0b0f0STejun Heo /** 1211402899eSTang Chen * __memblock_find_range_top_down - find free area utility, in top-down 1221402899eSTang Chen * @start: start of candidate range 1231402899eSTang Chen * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 1241402899eSTang Chen * @size: size of free area to find 1251402899eSTang Chen * @align: alignment of free area to find 1261402899eSTang Chen * @nid: nid of the free area to find, %MAX_NUMNODES for any node 1271402899eSTang Chen * 1281402899eSTang Chen * Utility called from memblock_find_in_range_node(), find free area top-down. 1291402899eSTang Chen * 1301402899eSTang Chen * RETURNS: 13179442ed1STang Chen * Found address on success, 0 on failure. 1321402899eSTang Chen */ 1331402899eSTang Chen static phys_addr_t __init_memblock 1341402899eSTang Chen __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end, 1351402899eSTang Chen phys_addr_t size, phys_addr_t align, int nid) 1361402899eSTang Chen { 1371402899eSTang Chen phys_addr_t this_start, this_end, cand; 1381402899eSTang Chen u64 i; 1391402899eSTang Chen 1401402899eSTang Chen for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) { 1411402899eSTang Chen this_start = clamp(this_start, start, end); 1421402899eSTang Chen this_end = clamp(this_end, start, end); 1431402899eSTang Chen 1441402899eSTang Chen if (this_end < size) 1451402899eSTang Chen continue; 1461402899eSTang Chen 1471402899eSTang Chen cand = round_down(this_end - size, align); 1481402899eSTang Chen if (cand >= this_start) 1491402899eSTang Chen return cand; 1501402899eSTang Chen } 1511402899eSTang Chen 1521402899eSTang Chen return 0; 1531402899eSTang Chen } 1541402899eSTang Chen 1551402899eSTang Chen /** 1567bd0b0f0STejun Heo * memblock_find_in_range_node - find free area in given range and node 1577bd0b0f0STejun Heo * @start: start of candidate range 1587bd0b0f0STejun Heo * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 1597bd0b0f0STejun Heo * @size: size of free area to find 1607bd0b0f0STejun Heo * @align: alignment of free area to find 1617bd0b0f0STejun Heo * @nid: nid of the free area to find, %MAX_NUMNODES for any node 1627bd0b0f0STejun Heo * 1637bd0b0f0STejun Heo * Find @size free area aligned to @align in the specified range and node. 1647bd0b0f0STejun Heo * 16579442ed1STang Chen * When allocation direction is bottom-up, the @start should be greater 16679442ed1STang Chen * than the end of the kernel image. Otherwise, it will be trimmed. The 16779442ed1STang Chen * reason is that we want the bottom-up allocation just near the kernel 16879442ed1STang Chen * image so it is highly likely that the allocated memory and the kernel 16979442ed1STang Chen * will reside in the same node. 17079442ed1STang Chen * 17179442ed1STang Chen * If bottom-up allocation failed, will try to allocate memory top-down. 17279442ed1STang Chen * 1737bd0b0f0STejun Heo * RETURNS: 17479442ed1STang Chen * Found address on success, 0 on failure. 1756ed311b2SBenjamin Herrenschmidt */ 176f7210e6cSTang Chen phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t start, 177f7210e6cSTang Chen phys_addr_t end, phys_addr_t size, 178f7210e6cSTang Chen phys_addr_t align, int nid) 179f7210e6cSTang Chen { 18079442ed1STang Chen int ret; 18179442ed1STang Chen phys_addr_t kernel_end; 18279442ed1STang Chen 183f7210e6cSTang Chen /* pump up @end */ 184f7210e6cSTang Chen if (end == MEMBLOCK_ALLOC_ACCESSIBLE) 185f7210e6cSTang Chen end = memblock.current_limit; 186f7210e6cSTang Chen 187f7210e6cSTang Chen /* avoid allocating the first page */ 188f7210e6cSTang Chen start = max_t(phys_addr_t, start, PAGE_SIZE); 189f7210e6cSTang Chen end = max(start, end); 19079442ed1STang Chen kernel_end = __pa_symbol(_end); 19179442ed1STang Chen 19279442ed1STang Chen /* 19379442ed1STang Chen * try bottom-up allocation only when bottom-up mode 19479442ed1STang Chen * is set and @end is above the kernel image. 19579442ed1STang Chen */ 19679442ed1STang Chen if (memblock_bottom_up() && end > kernel_end) { 19779442ed1STang Chen phys_addr_t bottom_up_start; 19879442ed1STang Chen 19979442ed1STang Chen /* make sure we will allocate above the kernel */ 20079442ed1STang Chen bottom_up_start = max(start, kernel_end); 20179442ed1STang Chen 20279442ed1STang Chen /* ok, try bottom-up allocation first */ 20379442ed1STang Chen ret = __memblock_find_range_bottom_up(bottom_up_start, end, 20479442ed1STang Chen size, align, nid); 20579442ed1STang Chen if (ret) 20679442ed1STang Chen return ret; 20779442ed1STang Chen 20879442ed1STang Chen /* 20979442ed1STang Chen * we always limit bottom-up allocation above the kernel, 21079442ed1STang Chen * but top-down allocation doesn't have the limit, so 21179442ed1STang Chen * retrying top-down allocation may succeed when bottom-up 21279442ed1STang Chen * allocation failed. 21379442ed1STang Chen * 21479442ed1STang Chen * bottom-up allocation is expected to be fail very rarely, 21579442ed1STang Chen * so we use WARN_ONCE() here to see the stack trace if 21679442ed1STang Chen * fail happens. 21779442ed1STang Chen */ 21879442ed1STang Chen WARN_ONCE(1, "memblock: bottom-up allocation failed, " 21979442ed1STang Chen "memory hotunplug may be affected\n"); 22079442ed1STang Chen } 221f7210e6cSTang Chen 2221402899eSTang Chen return __memblock_find_range_top_down(start, end, size, align, nid); 223f7210e6cSTang Chen } 2246ed311b2SBenjamin Herrenschmidt 2257bd0b0f0STejun Heo /** 2267bd0b0f0STejun Heo * memblock_find_in_range - find free area in given range 2277bd0b0f0STejun Heo * @start: start of candidate range 2287bd0b0f0STejun Heo * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} 2297bd0b0f0STejun Heo * @size: size of free area to find 2307bd0b0f0STejun Heo * @align: alignment of free area to find 2317bd0b0f0STejun Heo * 2327bd0b0f0STejun Heo * Find @size free area aligned to @align in the specified range. 2337bd0b0f0STejun Heo * 2347bd0b0f0STejun Heo * RETURNS: 23579442ed1STang Chen * Found address on success, 0 on failure. 2367bd0b0f0STejun Heo */ 2377bd0b0f0STejun Heo phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, 2387bd0b0f0STejun Heo phys_addr_t end, phys_addr_t size, 2397bd0b0f0STejun Heo phys_addr_t align) 2407bd0b0f0STejun Heo { 2417bd0b0f0STejun Heo return memblock_find_in_range_node(start, end, size, align, 2427bd0b0f0STejun Heo MAX_NUMNODES); 2437bd0b0f0STejun Heo } 2447bd0b0f0STejun Heo 24510d06439SYinghai Lu static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) 24695f72d1eSYinghai Lu { 2471440c4e2STejun Heo type->total_size -= type->regions[r].size; 2487c0caeb8STejun Heo memmove(&type->regions[r], &type->regions[r + 1], 2497c0caeb8STejun Heo (type->cnt - (r + 1)) * sizeof(type->regions[r])); 250e3239ff9SBenjamin Herrenschmidt type->cnt--; 25195f72d1eSYinghai Lu 2528f7a6605SBenjamin Herrenschmidt /* Special case for empty arrays */ 2538f7a6605SBenjamin Herrenschmidt if (type->cnt == 0) { 2541440c4e2STejun Heo WARN_ON(type->total_size != 0); 2558f7a6605SBenjamin Herrenschmidt type->cnt = 1; 2568f7a6605SBenjamin Herrenschmidt type->regions[0].base = 0; 2578f7a6605SBenjamin Herrenschmidt type->regions[0].size = 0; 258*66a20757STang Chen type->regions[0].flags = 0; 2597c0caeb8STejun Heo memblock_set_region_node(&type->regions[0], MAX_NUMNODES); 2608f7a6605SBenjamin Herrenschmidt } 26195f72d1eSYinghai Lu } 26295f72d1eSYinghai Lu 26329f67386SYinghai Lu phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info( 26429f67386SYinghai Lu phys_addr_t *addr) 26529f67386SYinghai Lu { 26629f67386SYinghai Lu if (memblock.reserved.regions == memblock_reserved_init_regions) 26729f67386SYinghai Lu return 0; 26829f67386SYinghai Lu 26929f67386SYinghai Lu *addr = __pa(memblock.reserved.regions); 27029f67386SYinghai Lu 27129f67386SYinghai Lu return PAGE_ALIGN(sizeof(struct memblock_region) * 27229f67386SYinghai Lu memblock.reserved.max); 27329f67386SYinghai Lu } 27429f67386SYinghai Lu 27548c3b583SGreg Pearson /** 27648c3b583SGreg Pearson * memblock_double_array - double the size of the memblock regions array 27748c3b583SGreg Pearson * @type: memblock type of the regions array being doubled 27848c3b583SGreg Pearson * @new_area_start: starting address of memory range to avoid overlap with 27948c3b583SGreg Pearson * @new_area_size: size of memory range to avoid overlap with 28048c3b583SGreg Pearson * 28148c3b583SGreg Pearson * Double the size of the @type regions array. If memblock is being used to 28248c3b583SGreg Pearson * allocate memory for a new reserved regions array and there is a previously 28348c3b583SGreg Pearson * allocated memory range [@new_area_start,@new_area_start+@new_area_size] 28448c3b583SGreg Pearson * waiting to be reserved, ensure the memory used by the new array does 28548c3b583SGreg Pearson * not overlap. 28648c3b583SGreg Pearson * 28748c3b583SGreg Pearson * RETURNS: 28848c3b583SGreg Pearson * 0 on success, -1 on failure. 28948c3b583SGreg Pearson */ 29048c3b583SGreg Pearson static int __init_memblock memblock_double_array(struct memblock_type *type, 29148c3b583SGreg Pearson phys_addr_t new_area_start, 29248c3b583SGreg Pearson phys_addr_t new_area_size) 293142b45a7SBenjamin Herrenschmidt { 294142b45a7SBenjamin Herrenschmidt struct memblock_region *new_array, *old_array; 29529f67386SYinghai Lu phys_addr_t old_alloc_size, new_alloc_size; 296142b45a7SBenjamin Herrenschmidt phys_addr_t old_size, new_size, addr; 297142b45a7SBenjamin Herrenschmidt int use_slab = slab_is_available(); 298181eb394SGavin Shan int *in_slab; 299142b45a7SBenjamin Herrenschmidt 300142b45a7SBenjamin Herrenschmidt /* We don't allow resizing until we know about the reserved regions 301142b45a7SBenjamin Herrenschmidt * of memory that aren't suitable for allocation 302142b45a7SBenjamin Herrenschmidt */ 303142b45a7SBenjamin Herrenschmidt if (!memblock_can_resize) 304142b45a7SBenjamin Herrenschmidt return -1; 305142b45a7SBenjamin Herrenschmidt 306142b45a7SBenjamin Herrenschmidt /* Calculate new doubled size */ 307142b45a7SBenjamin Herrenschmidt old_size = type->max * sizeof(struct memblock_region); 308142b45a7SBenjamin Herrenschmidt new_size = old_size << 1; 30929f67386SYinghai Lu /* 31029f67386SYinghai Lu * We need to allocated new one align to PAGE_SIZE, 31129f67386SYinghai Lu * so we can free them completely later. 31229f67386SYinghai Lu */ 31329f67386SYinghai Lu old_alloc_size = PAGE_ALIGN(old_size); 31429f67386SYinghai Lu new_alloc_size = PAGE_ALIGN(new_size); 315142b45a7SBenjamin Herrenschmidt 316181eb394SGavin Shan /* Retrieve the slab flag */ 317181eb394SGavin Shan if (type == &memblock.memory) 318181eb394SGavin Shan in_slab = &memblock_memory_in_slab; 319181eb394SGavin Shan else 320181eb394SGavin Shan in_slab = &memblock_reserved_in_slab; 321181eb394SGavin Shan 322142b45a7SBenjamin Herrenschmidt /* Try to find some space for it. 323142b45a7SBenjamin Herrenschmidt * 324142b45a7SBenjamin Herrenschmidt * WARNING: We assume that either slab_is_available() and we use it or 325fd07383bSAndrew Morton * we use MEMBLOCK for allocations. That means that this is unsafe to 326fd07383bSAndrew Morton * use when bootmem is currently active (unless bootmem itself is 327fd07383bSAndrew Morton * implemented on top of MEMBLOCK which isn't the case yet) 328142b45a7SBenjamin Herrenschmidt * 329142b45a7SBenjamin Herrenschmidt * This should however not be an issue for now, as we currently only 330fd07383bSAndrew Morton * call into MEMBLOCK while it's still active, or much later when slab 331fd07383bSAndrew Morton * is active for memory hotplug operations 332142b45a7SBenjamin Herrenschmidt */ 333142b45a7SBenjamin Herrenschmidt if (use_slab) { 334142b45a7SBenjamin Herrenschmidt new_array = kmalloc(new_size, GFP_KERNEL); 3351f5026a7STejun Heo addr = new_array ? __pa(new_array) : 0; 3364e2f0775SGavin Shan } else { 33748c3b583SGreg Pearson /* only exclude range when trying to double reserved.regions */ 33848c3b583SGreg Pearson if (type != &memblock.reserved) 33948c3b583SGreg Pearson new_area_start = new_area_size = 0; 34048c3b583SGreg Pearson 34148c3b583SGreg Pearson addr = memblock_find_in_range(new_area_start + new_area_size, 34248c3b583SGreg Pearson memblock.current_limit, 34329f67386SYinghai Lu new_alloc_size, PAGE_SIZE); 34448c3b583SGreg Pearson if (!addr && new_area_size) 34548c3b583SGreg Pearson addr = memblock_find_in_range(0, 34648c3b583SGreg Pearson min(new_area_start, memblock.current_limit), 34729f67386SYinghai Lu new_alloc_size, PAGE_SIZE); 34848c3b583SGreg Pearson 34915674868SSachin Kamat new_array = addr ? __va(addr) : NULL; 3504e2f0775SGavin Shan } 3511f5026a7STejun Heo if (!addr) { 352142b45a7SBenjamin Herrenschmidt pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", 353142b45a7SBenjamin Herrenschmidt memblock_type_name(type), type->max, type->max * 2); 354142b45a7SBenjamin Herrenschmidt return -1; 355142b45a7SBenjamin Herrenschmidt } 356142b45a7SBenjamin Herrenschmidt 357fd07383bSAndrew Morton memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]", 358fd07383bSAndrew Morton memblock_type_name(type), type->max * 2, (u64)addr, 359fd07383bSAndrew Morton (u64)addr + new_size - 1); 360ea9e4376SYinghai Lu 361fd07383bSAndrew Morton /* 362fd07383bSAndrew Morton * Found space, we now need to move the array over before we add the 363fd07383bSAndrew Morton * reserved region since it may be our reserved array itself that is 364fd07383bSAndrew Morton * full. 365142b45a7SBenjamin Herrenschmidt */ 366142b45a7SBenjamin Herrenschmidt memcpy(new_array, type->regions, old_size); 367142b45a7SBenjamin Herrenschmidt memset(new_array + type->max, 0, old_size); 368142b45a7SBenjamin Herrenschmidt old_array = type->regions; 369142b45a7SBenjamin Herrenschmidt type->regions = new_array; 370142b45a7SBenjamin Herrenschmidt type->max <<= 1; 371142b45a7SBenjamin Herrenschmidt 372fd07383bSAndrew Morton /* Free old array. We needn't free it if the array is the static one */ 373181eb394SGavin Shan if (*in_slab) 374181eb394SGavin Shan kfree(old_array); 375181eb394SGavin Shan else if (old_array != memblock_memory_init_regions && 376142b45a7SBenjamin Herrenschmidt old_array != memblock_reserved_init_regions) 37729f67386SYinghai Lu memblock_free(__pa(old_array), old_alloc_size); 378142b45a7SBenjamin Herrenschmidt 379fd07383bSAndrew Morton /* 380fd07383bSAndrew Morton * Reserve the new array if that comes from the memblock. Otherwise, we 381fd07383bSAndrew Morton * needn't do it 382181eb394SGavin Shan */ 383181eb394SGavin Shan if (!use_slab) 38429f67386SYinghai Lu BUG_ON(memblock_reserve(addr, new_alloc_size)); 385181eb394SGavin Shan 386181eb394SGavin Shan /* Update slab flag */ 387181eb394SGavin Shan *in_slab = use_slab; 388181eb394SGavin Shan 389142b45a7SBenjamin Herrenschmidt return 0; 390142b45a7SBenjamin Herrenschmidt } 391142b45a7SBenjamin Herrenschmidt 392784656f9STejun Heo /** 393784656f9STejun Heo * memblock_merge_regions - merge neighboring compatible regions 394784656f9STejun Heo * @type: memblock type to scan 395784656f9STejun Heo * 396784656f9STejun Heo * Scan @type and merge neighboring compatible regions. 397784656f9STejun Heo */ 398784656f9STejun Heo static void __init_memblock memblock_merge_regions(struct memblock_type *type) 399784656f9STejun Heo { 400784656f9STejun Heo int i = 0; 401784656f9STejun Heo 402784656f9STejun Heo /* cnt never goes below 1 */ 403784656f9STejun Heo while (i < type->cnt - 1) { 404784656f9STejun Heo struct memblock_region *this = &type->regions[i]; 405784656f9STejun Heo struct memblock_region *next = &type->regions[i + 1]; 406784656f9STejun Heo 4077c0caeb8STejun Heo if (this->base + this->size != next->base || 4087c0caeb8STejun Heo memblock_get_region_node(this) != 409*66a20757STang Chen memblock_get_region_node(next) || 410*66a20757STang Chen this->flags != next->flags) { 411784656f9STejun Heo BUG_ON(this->base + this->size > next->base); 412784656f9STejun Heo i++; 413784656f9STejun Heo continue; 414784656f9STejun Heo } 415784656f9STejun Heo 416784656f9STejun Heo this->size += next->size; 417c0232ae8SLin Feng /* move forward from next + 1, index of which is i + 2 */ 418c0232ae8SLin Feng memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next)); 419784656f9STejun Heo type->cnt--; 420784656f9STejun Heo } 421784656f9STejun Heo } 422784656f9STejun Heo 423784656f9STejun Heo /** 424784656f9STejun Heo * memblock_insert_region - insert new memblock region 425784656f9STejun Heo * @type: memblock type to insert into 426784656f9STejun Heo * @idx: index for the insertion point 427784656f9STejun Heo * @base: base address of the new region 428784656f9STejun Heo * @size: size of the new region 429209ff86dSTang Chen * @nid: node id of the new region 430*66a20757STang Chen * @flags: flags of the new region 431784656f9STejun Heo * 432784656f9STejun Heo * Insert new memblock region [@base,@base+@size) into @type at @idx. 433784656f9STejun Heo * @type must already have extra room to accomodate the new region. 434784656f9STejun Heo */ 435784656f9STejun Heo static void __init_memblock memblock_insert_region(struct memblock_type *type, 436784656f9STejun Heo int idx, phys_addr_t base, 437*66a20757STang Chen phys_addr_t size, 438*66a20757STang Chen int nid, unsigned long flags) 439784656f9STejun Heo { 440784656f9STejun Heo struct memblock_region *rgn = &type->regions[idx]; 441784656f9STejun Heo 442784656f9STejun Heo BUG_ON(type->cnt >= type->max); 443784656f9STejun Heo memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); 444784656f9STejun Heo rgn->base = base; 445784656f9STejun Heo rgn->size = size; 446*66a20757STang Chen rgn->flags = flags; 4477c0caeb8STejun Heo memblock_set_region_node(rgn, nid); 448784656f9STejun Heo type->cnt++; 4491440c4e2STejun Heo type->total_size += size; 450784656f9STejun Heo } 451784656f9STejun Heo 452784656f9STejun Heo /** 453784656f9STejun Heo * memblock_add_region - add new memblock region 454784656f9STejun Heo * @type: memblock type to add new region into 455784656f9STejun Heo * @base: base address of the new region 456784656f9STejun Heo * @size: size of the new region 4577fb0bc3fSTejun Heo * @nid: nid of the new region 458*66a20757STang Chen * @flags: flags of the new region 459784656f9STejun Heo * 460784656f9STejun Heo * Add new memblock region [@base,@base+@size) into @type. The new region 461784656f9STejun Heo * is allowed to overlap with existing ones - overlaps don't affect already 462784656f9STejun Heo * existing regions. @type is guaranteed to be minimal (all neighbouring 463784656f9STejun Heo * compatible regions are merged) after the addition. 464784656f9STejun Heo * 465784656f9STejun Heo * RETURNS: 466784656f9STejun Heo * 0 on success, -errno on failure. 467784656f9STejun Heo */ 468581adcbeSTejun Heo static int __init_memblock memblock_add_region(struct memblock_type *type, 469*66a20757STang Chen phys_addr_t base, phys_addr_t size, 470*66a20757STang Chen int nid, unsigned long flags) 47195f72d1eSYinghai Lu { 472784656f9STejun Heo bool insert = false; 473eb18f1b5STejun Heo phys_addr_t obase = base; 474eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 475784656f9STejun Heo int i, nr_new; 47695f72d1eSYinghai Lu 477b3dc627cSTejun Heo if (!size) 478b3dc627cSTejun Heo return 0; 479b3dc627cSTejun Heo 480784656f9STejun Heo /* special case for empty array */ 481784656f9STejun Heo if (type->regions[0].size == 0) { 4821440c4e2STejun Heo WARN_ON(type->cnt != 1 || type->total_size); 483784656f9STejun Heo type->regions[0].base = base; 484784656f9STejun Heo type->regions[0].size = size; 485*66a20757STang Chen type->regions[0].flags = flags; 4867fb0bc3fSTejun Heo memblock_set_region_node(&type->regions[0], nid); 4871440c4e2STejun Heo type->total_size = size; 488784656f9STejun Heo return 0; 489784656f9STejun Heo } 490784656f9STejun Heo repeat: 491784656f9STejun Heo /* 492784656f9STejun Heo * The following is executed twice. Once with %false @insert and 493784656f9STejun Heo * then with %true. The first counts the number of regions needed 494784656f9STejun Heo * to accomodate the new area. The second actually inserts them. 495784656f9STejun Heo */ 496784656f9STejun Heo base = obase; 497784656f9STejun Heo nr_new = 0; 498784656f9STejun Heo 4998f7a6605SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 5008f7a6605SBenjamin Herrenschmidt struct memblock_region *rgn = &type->regions[i]; 501784656f9STejun Heo phys_addr_t rbase = rgn->base; 502784656f9STejun Heo phys_addr_t rend = rbase + rgn->size; 5038f7a6605SBenjamin Herrenschmidt 504784656f9STejun Heo if (rbase >= end) 5058f7a6605SBenjamin Herrenschmidt break; 506784656f9STejun Heo if (rend <= base) 507784656f9STejun Heo continue; 508784656f9STejun Heo /* 509784656f9STejun Heo * @rgn overlaps. If it separates the lower part of new 510784656f9STejun Heo * area, insert that portion. 5118f7a6605SBenjamin Herrenschmidt */ 512784656f9STejun Heo if (rbase > base) { 513784656f9STejun Heo nr_new++; 514784656f9STejun Heo if (insert) 515784656f9STejun Heo memblock_insert_region(type, i++, base, 516*66a20757STang Chen rbase - base, nid, 517*66a20757STang Chen flags); 518784656f9STejun Heo } 519784656f9STejun Heo /* area below @rend is dealt with, forget about it */ 520784656f9STejun Heo base = min(rend, end); 5218f7a6605SBenjamin Herrenschmidt } 5228f7a6605SBenjamin Herrenschmidt 523784656f9STejun Heo /* insert the remaining portion */ 524784656f9STejun Heo if (base < end) { 525784656f9STejun Heo nr_new++; 526784656f9STejun Heo if (insert) 527*66a20757STang Chen memblock_insert_region(type, i, base, end - base, 528*66a20757STang Chen nid, flags); 5298f7a6605SBenjamin Herrenschmidt } 5308f7a6605SBenjamin Herrenschmidt 531784656f9STejun Heo /* 532784656f9STejun Heo * If this was the first round, resize array and repeat for actual 533784656f9STejun Heo * insertions; otherwise, merge and return. 5348f7a6605SBenjamin Herrenschmidt */ 535784656f9STejun Heo if (!insert) { 536784656f9STejun Heo while (type->cnt + nr_new > type->max) 53748c3b583SGreg Pearson if (memblock_double_array(type, obase, size) < 0) 538784656f9STejun Heo return -ENOMEM; 539784656f9STejun Heo insert = true; 540784656f9STejun Heo goto repeat; 54195f72d1eSYinghai Lu } else { 542784656f9STejun Heo memblock_merge_regions(type); 54395f72d1eSYinghai Lu return 0; 54495f72d1eSYinghai Lu } 545784656f9STejun Heo } 54695f72d1eSYinghai Lu 5477fb0bc3fSTejun Heo int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size, 5487fb0bc3fSTejun Heo int nid) 5497fb0bc3fSTejun Heo { 550*66a20757STang Chen return memblock_add_region(&memblock.memory, base, size, nid, 0); 5517fb0bc3fSTejun Heo } 5527fb0bc3fSTejun Heo 553581adcbeSTejun Heo int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) 55495f72d1eSYinghai Lu { 555*66a20757STang Chen return memblock_add_region(&memblock.memory, base, size, 556*66a20757STang Chen MAX_NUMNODES, 0); 55795f72d1eSYinghai Lu } 55895f72d1eSYinghai Lu 5596a9ceb31STejun Heo /** 5606a9ceb31STejun Heo * memblock_isolate_range - isolate given range into disjoint memblocks 5616a9ceb31STejun Heo * @type: memblock type to isolate range for 5626a9ceb31STejun Heo * @base: base of range to isolate 5636a9ceb31STejun Heo * @size: size of range to isolate 5646a9ceb31STejun Heo * @start_rgn: out parameter for the start of isolated region 5656a9ceb31STejun Heo * @end_rgn: out parameter for the end of isolated region 5666a9ceb31STejun Heo * 5676a9ceb31STejun Heo * Walk @type and ensure that regions don't cross the boundaries defined by 5686a9ceb31STejun Heo * [@base,@base+@size). Crossing regions are split at the boundaries, 5696a9ceb31STejun Heo * which may create at most two more regions. The index of the first 5706a9ceb31STejun Heo * region inside the range is returned in *@start_rgn and end in *@end_rgn. 5716a9ceb31STejun Heo * 5726a9ceb31STejun Heo * RETURNS: 5736a9ceb31STejun Heo * 0 on success, -errno on failure. 5746a9ceb31STejun Heo */ 5756a9ceb31STejun Heo static int __init_memblock memblock_isolate_range(struct memblock_type *type, 5766a9ceb31STejun Heo phys_addr_t base, phys_addr_t size, 5776a9ceb31STejun Heo int *start_rgn, int *end_rgn) 5786a9ceb31STejun Heo { 579eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 5806a9ceb31STejun Heo int i; 5816a9ceb31STejun Heo 5826a9ceb31STejun Heo *start_rgn = *end_rgn = 0; 5836a9ceb31STejun Heo 584b3dc627cSTejun Heo if (!size) 585b3dc627cSTejun Heo return 0; 586b3dc627cSTejun Heo 5876a9ceb31STejun Heo /* we'll create at most two more regions */ 5886a9ceb31STejun Heo while (type->cnt + 2 > type->max) 58948c3b583SGreg Pearson if (memblock_double_array(type, base, size) < 0) 5906a9ceb31STejun Heo return -ENOMEM; 5916a9ceb31STejun Heo 5926a9ceb31STejun Heo for (i = 0; i < type->cnt; i++) { 5936a9ceb31STejun Heo struct memblock_region *rgn = &type->regions[i]; 5946a9ceb31STejun Heo phys_addr_t rbase = rgn->base; 5956a9ceb31STejun Heo phys_addr_t rend = rbase + rgn->size; 5966a9ceb31STejun Heo 5976a9ceb31STejun Heo if (rbase >= end) 5986a9ceb31STejun Heo break; 5996a9ceb31STejun Heo if (rend <= base) 6006a9ceb31STejun Heo continue; 6016a9ceb31STejun Heo 6026a9ceb31STejun Heo if (rbase < base) { 6036a9ceb31STejun Heo /* 6046a9ceb31STejun Heo * @rgn intersects from below. Split and continue 6056a9ceb31STejun Heo * to process the next region - the new top half. 6066a9ceb31STejun Heo */ 6076a9ceb31STejun Heo rgn->base = base; 6081440c4e2STejun Heo rgn->size -= base - rbase; 6091440c4e2STejun Heo type->total_size -= base - rbase; 6106a9ceb31STejun Heo memblock_insert_region(type, i, rbase, base - rbase, 611*66a20757STang Chen memblock_get_region_node(rgn), 612*66a20757STang Chen rgn->flags); 6136a9ceb31STejun Heo } else if (rend > end) { 6146a9ceb31STejun Heo /* 6156a9ceb31STejun Heo * @rgn intersects from above. Split and redo the 6166a9ceb31STejun Heo * current region - the new bottom half. 6176a9ceb31STejun Heo */ 6186a9ceb31STejun Heo rgn->base = end; 6191440c4e2STejun Heo rgn->size -= end - rbase; 6201440c4e2STejun Heo type->total_size -= end - rbase; 6216a9ceb31STejun Heo memblock_insert_region(type, i--, rbase, end - rbase, 622*66a20757STang Chen memblock_get_region_node(rgn), 623*66a20757STang Chen rgn->flags); 6246a9ceb31STejun Heo } else { 6256a9ceb31STejun Heo /* @rgn is fully contained, record it */ 6266a9ceb31STejun Heo if (!*end_rgn) 6276a9ceb31STejun Heo *start_rgn = i; 6286a9ceb31STejun Heo *end_rgn = i + 1; 6296a9ceb31STejun Heo } 6306a9ceb31STejun Heo } 6316a9ceb31STejun Heo 6326a9ceb31STejun Heo return 0; 6336a9ceb31STejun Heo } 6346a9ceb31STejun Heo 635581adcbeSTejun Heo static int __init_memblock __memblock_remove(struct memblock_type *type, 6368f7a6605SBenjamin Herrenschmidt phys_addr_t base, phys_addr_t size) 63795f72d1eSYinghai Lu { 63871936180STejun Heo int start_rgn, end_rgn; 63971936180STejun Heo int i, ret; 64095f72d1eSYinghai Lu 64171936180STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 64271936180STejun Heo if (ret) 64371936180STejun Heo return ret; 64495f72d1eSYinghai Lu 64571936180STejun Heo for (i = end_rgn - 1; i >= start_rgn; i--) 64671936180STejun Heo memblock_remove_region(type, i); 64795f72d1eSYinghai Lu return 0; 64895f72d1eSYinghai Lu } 64995f72d1eSYinghai Lu 650581adcbeSTejun Heo int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) 65195f72d1eSYinghai Lu { 65295f72d1eSYinghai Lu return __memblock_remove(&memblock.memory, base, size); 65395f72d1eSYinghai Lu } 65495f72d1eSYinghai Lu 655581adcbeSTejun Heo int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) 65695f72d1eSYinghai Lu { 65724aa0788STejun Heo memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n", 658a150439cSH. Peter Anvin (unsigned long long)base, 659931d13f5SGrygorii Strashko (unsigned long long)base + size - 1, 660a150439cSH. Peter Anvin (void *)_RET_IP_); 66124aa0788STejun Heo 66295f72d1eSYinghai Lu return __memblock_remove(&memblock.reserved, base, size); 66395f72d1eSYinghai Lu } 66495f72d1eSYinghai Lu 665*66a20757STang Chen static int __init_memblock memblock_reserve_region(phys_addr_t base, 666*66a20757STang Chen phys_addr_t size, 667*66a20757STang Chen int nid, 668*66a20757STang Chen unsigned long flags) 66995f72d1eSYinghai Lu { 670e3239ff9SBenjamin Herrenschmidt struct memblock_type *_rgn = &memblock.reserved; 67195f72d1eSYinghai Lu 672*66a20757STang Chen memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n", 673a150439cSH. Peter Anvin (unsigned long long)base, 674931d13f5SGrygorii Strashko (unsigned long long)base + size - 1, 675*66a20757STang Chen flags, (void *)_RET_IP_); 67695f72d1eSYinghai Lu 677*66a20757STang Chen return memblock_add_region(_rgn, base, size, nid, flags); 678*66a20757STang Chen } 679*66a20757STang Chen 680*66a20757STang Chen int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) 681*66a20757STang Chen { 682*66a20757STang Chen return memblock_reserve_region(base, size, MAX_NUMNODES, 0); 68395f72d1eSYinghai Lu } 68495f72d1eSYinghai Lu 68535fd0808STejun Heo /** 68635fd0808STejun Heo * __next_free_mem_range - next function for for_each_free_mem_range() 68735fd0808STejun Heo * @idx: pointer to u64 loop variable 688d8bbdd77STang Chen * @nid: node selector, %MAX_NUMNODES for all nodes 689dad7557eSWanpeng Li * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL 690dad7557eSWanpeng Li * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL 691dad7557eSWanpeng Li * @out_nid: ptr to int for nid of the range, can be %NULL 69235fd0808STejun Heo * 69335fd0808STejun Heo * Find the first free area from *@idx which matches @nid, fill the out 69435fd0808STejun Heo * parameters, and update *@idx for the next iteration. The lower 32bit of 69535fd0808STejun Heo * *@idx contains index into memory region and the upper 32bit indexes the 69635fd0808STejun Heo * areas before each reserved region. For example, if reserved regions 69735fd0808STejun Heo * look like the following, 69835fd0808STejun Heo * 69935fd0808STejun Heo * 0:[0-16), 1:[32-48), 2:[128-130) 70035fd0808STejun Heo * 70135fd0808STejun Heo * The upper 32bit indexes the following regions. 70235fd0808STejun Heo * 70335fd0808STejun Heo * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX) 70435fd0808STejun Heo * 70535fd0808STejun Heo * As both region arrays are sorted, the function advances the two indices 70635fd0808STejun Heo * in lockstep and returns each intersection. 70735fd0808STejun Heo */ 70835fd0808STejun Heo void __init_memblock __next_free_mem_range(u64 *idx, int nid, 70935fd0808STejun Heo phys_addr_t *out_start, 71035fd0808STejun Heo phys_addr_t *out_end, int *out_nid) 71135fd0808STejun Heo { 71235fd0808STejun Heo struct memblock_type *mem = &memblock.memory; 71335fd0808STejun Heo struct memblock_type *rsv = &memblock.reserved; 71435fd0808STejun Heo int mi = *idx & 0xffffffff; 71535fd0808STejun Heo int ri = *idx >> 32; 71635fd0808STejun Heo 71735fd0808STejun Heo for ( ; mi < mem->cnt; mi++) { 71835fd0808STejun Heo struct memblock_region *m = &mem->regions[mi]; 71935fd0808STejun Heo phys_addr_t m_start = m->base; 72035fd0808STejun Heo phys_addr_t m_end = m->base + m->size; 72135fd0808STejun Heo 72235fd0808STejun Heo /* only memory regions are associated with nodes, check it */ 72335fd0808STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 72435fd0808STejun Heo continue; 72535fd0808STejun Heo 72635fd0808STejun Heo /* scan areas before each reservation for intersection */ 72735fd0808STejun Heo for ( ; ri < rsv->cnt + 1; ri++) { 72835fd0808STejun Heo struct memblock_region *r = &rsv->regions[ri]; 72935fd0808STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 73035fd0808STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 73135fd0808STejun Heo 73235fd0808STejun Heo /* if ri advanced past mi, break out to advance mi */ 73335fd0808STejun Heo if (r_start >= m_end) 73435fd0808STejun Heo break; 73535fd0808STejun Heo /* if the two regions intersect, we're done */ 73635fd0808STejun Heo if (m_start < r_end) { 73735fd0808STejun Heo if (out_start) 73835fd0808STejun Heo *out_start = max(m_start, r_start); 73935fd0808STejun Heo if (out_end) 74035fd0808STejun Heo *out_end = min(m_end, r_end); 74135fd0808STejun Heo if (out_nid) 74235fd0808STejun Heo *out_nid = memblock_get_region_node(m); 74335fd0808STejun Heo /* 74435fd0808STejun Heo * The region which ends first is advanced 74535fd0808STejun Heo * for the next iteration. 74635fd0808STejun Heo */ 74735fd0808STejun Heo if (m_end <= r_end) 74835fd0808STejun Heo mi++; 74935fd0808STejun Heo else 75035fd0808STejun Heo ri++; 75135fd0808STejun Heo *idx = (u32)mi | (u64)ri << 32; 75235fd0808STejun Heo return; 75335fd0808STejun Heo } 75435fd0808STejun Heo } 75535fd0808STejun Heo } 75635fd0808STejun Heo 75735fd0808STejun Heo /* signal end of iteration */ 75835fd0808STejun Heo *idx = ULLONG_MAX; 75935fd0808STejun Heo } 76035fd0808STejun Heo 7617bd0b0f0STejun Heo /** 7627bd0b0f0STejun Heo * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse() 7637bd0b0f0STejun Heo * @idx: pointer to u64 loop variable 7647bd0b0f0STejun Heo * @nid: nid: node selector, %MAX_NUMNODES for all nodes 765dad7557eSWanpeng Li * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL 766dad7557eSWanpeng Li * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL 767dad7557eSWanpeng Li * @out_nid: ptr to int for nid of the range, can be %NULL 7687bd0b0f0STejun Heo * 7697bd0b0f0STejun Heo * Reverse of __next_free_mem_range(). 7707bd0b0f0STejun Heo */ 7717bd0b0f0STejun Heo void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid, 7727bd0b0f0STejun Heo phys_addr_t *out_start, 7737bd0b0f0STejun Heo phys_addr_t *out_end, int *out_nid) 7747bd0b0f0STejun Heo { 7757bd0b0f0STejun Heo struct memblock_type *mem = &memblock.memory; 7767bd0b0f0STejun Heo struct memblock_type *rsv = &memblock.reserved; 7777bd0b0f0STejun Heo int mi = *idx & 0xffffffff; 7787bd0b0f0STejun Heo int ri = *idx >> 32; 7797bd0b0f0STejun Heo 7807bd0b0f0STejun Heo if (*idx == (u64)ULLONG_MAX) { 7817bd0b0f0STejun Heo mi = mem->cnt - 1; 7827bd0b0f0STejun Heo ri = rsv->cnt; 7837bd0b0f0STejun Heo } 7847bd0b0f0STejun Heo 7857bd0b0f0STejun Heo for ( ; mi >= 0; mi--) { 7867bd0b0f0STejun Heo struct memblock_region *m = &mem->regions[mi]; 7877bd0b0f0STejun Heo phys_addr_t m_start = m->base; 7887bd0b0f0STejun Heo phys_addr_t m_end = m->base + m->size; 7897bd0b0f0STejun Heo 7907bd0b0f0STejun Heo /* only memory regions are associated with nodes, check it */ 7917bd0b0f0STejun Heo if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) 7927bd0b0f0STejun Heo continue; 7937bd0b0f0STejun Heo 7947bd0b0f0STejun Heo /* scan areas before each reservation for intersection */ 7957bd0b0f0STejun Heo for ( ; ri >= 0; ri--) { 7967bd0b0f0STejun Heo struct memblock_region *r = &rsv->regions[ri]; 7977bd0b0f0STejun Heo phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; 7987bd0b0f0STejun Heo phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; 7997bd0b0f0STejun Heo 8007bd0b0f0STejun Heo /* if ri advanced past mi, break out to advance mi */ 8017bd0b0f0STejun Heo if (r_end <= m_start) 8027bd0b0f0STejun Heo break; 8037bd0b0f0STejun Heo /* if the two regions intersect, we're done */ 8047bd0b0f0STejun Heo if (m_end > r_start) { 8057bd0b0f0STejun Heo if (out_start) 8067bd0b0f0STejun Heo *out_start = max(m_start, r_start); 8077bd0b0f0STejun Heo if (out_end) 8087bd0b0f0STejun Heo *out_end = min(m_end, r_end); 8097bd0b0f0STejun Heo if (out_nid) 8107bd0b0f0STejun Heo *out_nid = memblock_get_region_node(m); 8117bd0b0f0STejun Heo 8127bd0b0f0STejun Heo if (m_start >= r_start) 8137bd0b0f0STejun Heo mi--; 8147bd0b0f0STejun Heo else 8157bd0b0f0STejun Heo ri--; 8167bd0b0f0STejun Heo *idx = (u32)mi | (u64)ri << 32; 8177bd0b0f0STejun Heo return; 8187bd0b0f0STejun Heo } 8197bd0b0f0STejun Heo } 8207bd0b0f0STejun Heo } 8217bd0b0f0STejun Heo 8227bd0b0f0STejun Heo *idx = ULLONG_MAX; 8237bd0b0f0STejun Heo } 8247bd0b0f0STejun Heo 8257c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 8267c0caeb8STejun Heo /* 8277c0caeb8STejun Heo * Common iterator interface used to define for_each_mem_range(). 8287c0caeb8STejun Heo */ 8297c0caeb8STejun Heo void __init_memblock __next_mem_pfn_range(int *idx, int nid, 8307c0caeb8STejun Heo unsigned long *out_start_pfn, 8317c0caeb8STejun Heo unsigned long *out_end_pfn, int *out_nid) 8327c0caeb8STejun Heo { 8337c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 8347c0caeb8STejun Heo struct memblock_region *r; 8357c0caeb8STejun Heo 8367c0caeb8STejun Heo while (++*idx < type->cnt) { 8377c0caeb8STejun Heo r = &type->regions[*idx]; 8387c0caeb8STejun Heo 8397c0caeb8STejun Heo if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size)) 8407c0caeb8STejun Heo continue; 8417c0caeb8STejun Heo if (nid == MAX_NUMNODES || nid == r->nid) 8427c0caeb8STejun Heo break; 8437c0caeb8STejun Heo } 8447c0caeb8STejun Heo if (*idx >= type->cnt) { 8457c0caeb8STejun Heo *idx = -1; 8467c0caeb8STejun Heo return; 8477c0caeb8STejun Heo } 8487c0caeb8STejun Heo 8497c0caeb8STejun Heo if (out_start_pfn) 8507c0caeb8STejun Heo *out_start_pfn = PFN_UP(r->base); 8517c0caeb8STejun Heo if (out_end_pfn) 8527c0caeb8STejun Heo *out_end_pfn = PFN_DOWN(r->base + r->size); 8537c0caeb8STejun Heo if (out_nid) 8547c0caeb8STejun Heo *out_nid = r->nid; 8557c0caeb8STejun Heo } 8567c0caeb8STejun Heo 8577c0caeb8STejun Heo /** 8587c0caeb8STejun Heo * memblock_set_node - set node ID on memblock regions 8597c0caeb8STejun Heo * @base: base of area to set node ID for 8607c0caeb8STejun Heo * @size: size of area to set node ID for 8617c0caeb8STejun Heo * @nid: node ID to set 8627c0caeb8STejun Heo * 8637c0caeb8STejun Heo * Set the nid of memblock memory regions in [@base,@base+@size) to @nid. 8647c0caeb8STejun Heo * Regions which cross the area boundaries are split as necessary. 8657c0caeb8STejun Heo * 8667c0caeb8STejun Heo * RETURNS: 8677c0caeb8STejun Heo * 0 on success, -errno on failure. 8687c0caeb8STejun Heo */ 8697c0caeb8STejun Heo int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size, 8707c0caeb8STejun Heo int nid) 8717c0caeb8STejun Heo { 8727c0caeb8STejun Heo struct memblock_type *type = &memblock.memory; 8736a9ceb31STejun Heo int start_rgn, end_rgn; 8746a9ceb31STejun Heo int i, ret; 8757c0caeb8STejun Heo 8766a9ceb31STejun Heo ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); 8776a9ceb31STejun Heo if (ret) 8786a9ceb31STejun Heo return ret; 8797c0caeb8STejun Heo 8806a9ceb31STejun Heo for (i = start_rgn; i < end_rgn; i++) 881e9d24ad3SWanpeng Li memblock_set_region_node(&type->regions[i], nid); 8827c0caeb8STejun Heo 8837c0caeb8STejun Heo memblock_merge_regions(type); 8847c0caeb8STejun Heo return 0; 8857c0caeb8STejun Heo } 8867c0caeb8STejun Heo #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ 8877c0caeb8STejun Heo 8887bd0b0f0STejun Heo static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size, 8897bd0b0f0STejun Heo phys_addr_t align, phys_addr_t max_addr, 8907bd0b0f0STejun Heo int nid) 89195f72d1eSYinghai Lu { 8926ed311b2SBenjamin Herrenschmidt phys_addr_t found; 89395f72d1eSYinghai Lu 89494f3d3afSVineet Gupta if (WARN_ON(!align)) 89594f3d3afSVineet Gupta align = __alignof__(long long); 89694f3d3afSVineet Gupta 897847854f5STejun Heo /* align @size to avoid excessive fragmentation on reserved array */ 898847854f5STejun Heo size = round_up(size, align); 899847854f5STejun Heo 9007bd0b0f0STejun Heo found = memblock_find_in_range_node(0, max_addr, size, align, nid); 9019c8c27e2STejun Heo if (found && !memblock_reserve(found, size)) 9026ed311b2SBenjamin Herrenschmidt return found; 9036ed311b2SBenjamin Herrenschmidt 9046ed311b2SBenjamin Herrenschmidt return 0; 90595f72d1eSYinghai Lu } 90695f72d1eSYinghai Lu 9077bd0b0f0STejun Heo phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) 9087bd0b0f0STejun Heo { 9097bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid); 9107bd0b0f0STejun Heo } 9117bd0b0f0STejun Heo 9127bd0b0f0STejun Heo phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 9137bd0b0f0STejun Heo { 9147bd0b0f0STejun Heo return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES); 9157bd0b0f0STejun Heo } 9167bd0b0f0STejun Heo 9176ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) 91895f72d1eSYinghai Lu { 9196ed311b2SBenjamin Herrenschmidt phys_addr_t alloc; 9206ed311b2SBenjamin Herrenschmidt 9216ed311b2SBenjamin Herrenschmidt alloc = __memblock_alloc_base(size, align, max_addr); 9226ed311b2SBenjamin Herrenschmidt 9236ed311b2SBenjamin Herrenschmidt if (alloc == 0) 9246ed311b2SBenjamin Herrenschmidt panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", 9256ed311b2SBenjamin Herrenschmidt (unsigned long long) size, (unsigned long long) max_addr); 9266ed311b2SBenjamin Herrenschmidt 9276ed311b2SBenjamin Herrenschmidt return alloc; 92895f72d1eSYinghai Lu } 92995f72d1eSYinghai Lu 9306ed311b2SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) 93195f72d1eSYinghai Lu { 9326ed311b2SBenjamin Herrenschmidt return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 93395f72d1eSYinghai Lu } 93495f72d1eSYinghai Lu 9359d1e2492SBenjamin Herrenschmidt phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) 9369d1e2492SBenjamin Herrenschmidt { 9379d1e2492SBenjamin Herrenschmidt phys_addr_t res = memblock_alloc_nid(size, align, nid); 9389d1e2492SBenjamin Herrenschmidt 9399d1e2492SBenjamin Herrenschmidt if (res) 9409d1e2492SBenjamin Herrenschmidt return res; 94115fb0972STejun Heo return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); 94295f72d1eSYinghai Lu } 94395f72d1eSYinghai Lu 9449d1e2492SBenjamin Herrenschmidt 9459d1e2492SBenjamin Herrenschmidt /* 9469d1e2492SBenjamin Herrenschmidt * Remaining API functions 9479d1e2492SBenjamin Herrenschmidt */ 9489d1e2492SBenjamin Herrenschmidt 9492898cc4cSBenjamin Herrenschmidt phys_addr_t __init memblock_phys_mem_size(void) 95095f72d1eSYinghai Lu { 9511440c4e2STejun Heo return memblock.memory.total_size; 95295f72d1eSYinghai Lu } 95395f72d1eSYinghai Lu 954595ad9afSYinghai Lu phys_addr_t __init memblock_mem_size(unsigned long limit_pfn) 955595ad9afSYinghai Lu { 956595ad9afSYinghai Lu unsigned long pages = 0; 957595ad9afSYinghai Lu struct memblock_region *r; 958595ad9afSYinghai Lu unsigned long start_pfn, end_pfn; 959595ad9afSYinghai Lu 960595ad9afSYinghai Lu for_each_memblock(memory, r) { 961595ad9afSYinghai Lu start_pfn = memblock_region_memory_base_pfn(r); 962595ad9afSYinghai Lu end_pfn = memblock_region_memory_end_pfn(r); 963595ad9afSYinghai Lu start_pfn = min_t(unsigned long, start_pfn, limit_pfn); 964595ad9afSYinghai Lu end_pfn = min_t(unsigned long, end_pfn, limit_pfn); 965595ad9afSYinghai Lu pages += end_pfn - start_pfn; 966595ad9afSYinghai Lu } 967595ad9afSYinghai Lu 968595ad9afSYinghai Lu return (phys_addr_t)pages << PAGE_SHIFT; 969595ad9afSYinghai Lu } 970595ad9afSYinghai Lu 9710a93ebefSSam Ravnborg /* lowest address */ 9720a93ebefSSam Ravnborg phys_addr_t __init_memblock memblock_start_of_DRAM(void) 9730a93ebefSSam Ravnborg { 9740a93ebefSSam Ravnborg return memblock.memory.regions[0].base; 9750a93ebefSSam Ravnborg } 9760a93ebefSSam Ravnborg 97710d06439SYinghai Lu phys_addr_t __init_memblock memblock_end_of_DRAM(void) 97895f72d1eSYinghai Lu { 97995f72d1eSYinghai Lu int idx = memblock.memory.cnt - 1; 98095f72d1eSYinghai Lu 981e3239ff9SBenjamin Herrenschmidt return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); 98295f72d1eSYinghai Lu } 98395f72d1eSYinghai Lu 984c0ce8fefSTejun Heo void __init memblock_enforce_memory_limit(phys_addr_t limit) 98595f72d1eSYinghai Lu { 98695f72d1eSYinghai Lu unsigned long i; 987c0ce8fefSTejun Heo phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX; 98895f72d1eSYinghai Lu 989c0ce8fefSTejun Heo if (!limit) 99095f72d1eSYinghai Lu return; 99195f72d1eSYinghai Lu 992c0ce8fefSTejun Heo /* find out max address */ 99395f72d1eSYinghai Lu for (i = 0; i < memblock.memory.cnt; i++) { 994c0ce8fefSTejun Heo struct memblock_region *r = &memblock.memory.regions[i]; 99595f72d1eSYinghai Lu 996c0ce8fefSTejun Heo if (limit <= r->size) { 997c0ce8fefSTejun Heo max_addr = r->base + limit; 99895f72d1eSYinghai Lu break; 99995f72d1eSYinghai Lu } 1000c0ce8fefSTejun Heo limit -= r->size; 100195f72d1eSYinghai Lu } 1002c0ce8fefSTejun Heo 1003c0ce8fefSTejun Heo /* truncate both memory and reserved regions */ 1004c0ce8fefSTejun Heo __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX); 1005c0ce8fefSTejun Heo __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX); 100695f72d1eSYinghai Lu } 100795f72d1eSYinghai Lu 1008cd79481dSYinghai Lu static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) 100972d4b0b4SBenjamin Herrenschmidt { 101072d4b0b4SBenjamin Herrenschmidt unsigned int left = 0, right = type->cnt; 101172d4b0b4SBenjamin Herrenschmidt 101272d4b0b4SBenjamin Herrenschmidt do { 101372d4b0b4SBenjamin Herrenschmidt unsigned int mid = (right + left) / 2; 101472d4b0b4SBenjamin Herrenschmidt 101572d4b0b4SBenjamin Herrenschmidt if (addr < type->regions[mid].base) 101672d4b0b4SBenjamin Herrenschmidt right = mid; 101772d4b0b4SBenjamin Herrenschmidt else if (addr >= (type->regions[mid].base + 101872d4b0b4SBenjamin Herrenschmidt type->regions[mid].size)) 101972d4b0b4SBenjamin Herrenschmidt left = mid + 1; 102072d4b0b4SBenjamin Herrenschmidt else 102172d4b0b4SBenjamin Herrenschmidt return mid; 102272d4b0b4SBenjamin Herrenschmidt } while (left < right); 102372d4b0b4SBenjamin Herrenschmidt return -1; 102472d4b0b4SBenjamin Herrenschmidt } 102572d4b0b4SBenjamin Herrenschmidt 10262898cc4cSBenjamin Herrenschmidt int __init memblock_is_reserved(phys_addr_t addr) 102795f72d1eSYinghai Lu { 102872d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.reserved, addr) != -1; 102995f72d1eSYinghai Lu } 103072d4b0b4SBenjamin Herrenschmidt 10313661ca66SYinghai Lu int __init_memblock memblock_is_memory(phys_addr_t addr) 103272d4b0b4SBenjamin Herrenschmidt { 103372d4b0b4SBenjamin Herrenschmidt return memblock_search(&memblock.memory, addr) != -1; 103472d4b0b4SBenjamin Herrenschmidt } 103572d4b0b4SBenjamin Herrenschmidt 1036e76b63f8SYinghai Lu #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 1037e76b63f8SYinghai Lu int __init_memblock memblock_search_pfn_nid(unsigned long pfn, 1038e76b63f8SYinghai Lu unsigned long *start_pfn, unsigned long *end_pfn) 1039e76b63f8SYinghai Lu { 1040e76b63f8SYinghai Lu struct memblock_type *type = &memblock.memory; 1041e76b63f8SYinghai Lu int mid = memblock_search(type, (phys_addr_t)pfn << PAGE_SHIFT); 1042e76b63f8SYinghai Lu 1043e76b63f8SYinghai Lu if (mid == -1) 1044e76b63f8SYinghai Lu return -1; 1045e76b63f8SYinghai Lu 1046e76b63f8SYinghai Lu *start_pfn = type->regions[mid].base >> PAGE_SHIFT; 1047e76b63f8SYinghai Lu *end_pfn = (type->regions[mid].base + type->regions[mid].size) 1048e76b63f8SYinghai Lu >> PAGE_SHIFT; 1049e76b63f8SYinghai Lu 1050e76b63f8SYinghai Lu return type->regions[mid].nid; 1051e76b63f8SYinghai Lu } 1052e76b63f8SYinghai Lu #endif 1053e76b63f8SYinghai Lu 1054eab30949SStephen Boyd /** 1055eab30949SStephen Boyd * memblock_is_region_memory - check if a region is a subset of memory 1056eab30949SStephen Boyd * @base: base of region to check 1057eab30949SStephen Boyd * @size: size of region to check 1058eab30949SStephen Boyd * 1059eab30949SStephen Boyd * Check if the region [@base, @base+@size) is a subset of a memory block. 1060eab30949SStephen Boyd * 1061eab30949SStephen Boyd * RETURNS: 1062eab30949SStephen Boyd * 0 if false, non-zero if true 1063eab30949SStephen Boyd */ 10643661ca66SYinghai Lu int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) 106572d4b0b4SBenjamin Herrenschmidt { 1066abb65272STomi Valkeinen int idx = memblock_search(&memblock.memory, base); 1067eb18f1b5STejun Heo phys_addr_t end = base + memblock_cap_size(base, &size); 106872d4b0b4SBenjamin Herrenschmidt 106972d4b0b4SBenjamin Herrenschmidt if (idx == -1) 107095f72d1eSYinghai Lu return 0; 1071abb65272STomi Valkeinen return memblock.memory.regions[idx].base <= base && 1072abb65272STomi Valkeinen (memblock.memory.regions[idx].base + 1073eb18f1b5STejun Heo memblock.memory.regions[idx].size) >= end; 107495f72d1eSYinghai Lu } 107595f72d1eSYinghai Lu 1076eab30949SStephen Boyd /** 1077eab30949SStephen Boyd * memblock_is_region_reserved - check if a region intersects reserved memory 1078eab30949SStephen Boyd * @base: base of region to check 1079eab30949SStephen Boyd * @size: size of region to check 1080eab30949SStephen Boyd * 1081eab30949SStephen Boyd * Check if the region [@base, @base+@size) intersects a reserved memory block. 1082eab30949SStephen Boyd * 1083eab30949SStephen Boyd * RETURNS: 1084eab30949SStephen Boyd * 0 if false, non-zero if true 1085eab30949SStephen Boyd */ 108610d06439SYinghai Lu int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) 108795f72d1eSYinghai Lu { 1088eb18f1b5STejun Heo memblock_cap_size(base, &size); 1089f1c2c19cSBenjamin Herrenschmidt return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; 109095f72d1eSYinghai Lu } 109195f72d1eSYinghai Lu 10926ede1fd3SYinghai Lu void __init_memblock memblock_trim_memory(phys_addr_t align) 10936ede1fd3SYinghai Lu { 10946ede1fd3SYinghai Lu int i; 10956ede1fd3SYinghai Lu phys_addr_t start, end, orig_start, orig_end; 10966ede1fd3SYinghai Lu struct memblock_type *mem = &memblock.memory; 10976ede1fd3SYinghai Lu 10986ede1fd3SYinghai Lu for (i = 0; i < mem->cnt; i++) { 10996ede1fd3SYinghai Lu orig_start = mem->regions[i].base; 11006ede1fd3SYinghai Lu orig_end = mem->regions[i].base + mem->regions[i].size; 11016ede1fd3SYinghai Lu start = round_up(orig_start, align); 11026ede1fd3SYinghai Lu end = round_down(orig_end, align); 11036ede1fd3SYinghai Lu 11046ede1fd3SYinghai Lu if (start == orig_start && end == orig_end) 11056ede1fd3SYinghai Lu continue; 11066ede1fd3SYinghai Lu 11076ede1fd3SYinghai Lu if (start < end) { 11086ede1fd3SYinghai Lu mem->regions[i].base = start; 11096ede1fd3SYinghai Lu mem->regions[i].size = end - start; 11106ede1fd3SYinghai Lu } else { 11116ede1fd3SYinghai Lu memblock_remove_region(mem, i); 11126ede1fd3SYinghai Lu i--; 11136ede1fd3SYinghai Lu } 11146ede1fd3SYinghai Lu } 11156ede1fd3SYinghai Lu } 1116e63075a3SBenjamin Herrenschmidt 11173661ca66SYinghai Lu void __init_memblock memblock_set_current_limit(phys_addr_t limit) 1118e63075a3SBenjamin Herrenschmidt { 1119e63075a3SBenjamin Herrenschmidt memblock.current_limit = limit; 1120e63075a3SBenjamin Herrenschmidt } 1121e63075a3SBenjamin Herrenschmidt 11227c0caeb8STejun Heo static void __init_memblock memblock_dump(struct memblock_type *type, char *name) 11236ed311b2SBenjamin Herrenschmidt { 11246ed311b2SBenjamin Herrenschmidt unsigned long long base, size; 1125*66a20757STang Chen unsigned long flags; 11266ed311b2SBenjamin Herrenschmidt int i; 11276ed311b2SBenjamin Herrenschmidt 11287c0caeb8STejun Heo pr_info(" %s.cnt = 0x%lx\n", name, type->cnt); 11296ed311b2SBenjamin Herrenschmidt 11307c0caeb8STejun Heo for (i = 0; i < type->cnt; i++) { 11317c0caeb8STejun Heo struct memblock_region *rgn = &type->regions[i]; 11327c0caeb8STejun Heo char nid_buf[32] = ""; 11336ed311b2SBenjamin Herrenschmidt 11347c0caeb8STejun Heo base = rgn->base; 11357c0caeb8STejun Heo size = rgn->size; 1136*66a20757STang Chen flags = rgn->flags; 11377c0caeb8STejun Heo #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP 11387c0caeb8STejun Heo if (memblock_get_region_node(rgn) != MAX_NUMNODES) 11397c0caeb8STejun Heo snprintf(nid_buf, sizeof(nid_buf), " on node %d", 11407c0caeb8STejun Heo memblock_get_region_node(rgn)); 11417c0caeb8STejun Heo #endif 1142*66a20757STang Chen pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n", 1143*66a20757STang Chen name, i, base, base + size - 1, size, nid_buf, flags); 11446ed311b2SBenjamin Herrenschmidt } 11456ed311b2SBenjamin Herrenschmidt } 11466ed311b2SBenjamin Herrenschmidt 11474ff7b82fSTejun Heo void __init_memblock __memblock_dump_all(void) 11486ed311b2SBenjamin Herrenschmidt { 11496ed311b2SBenjamin Herrenschmidt pr_info("MEMBLOCK configuration:\n"); 11501440c4e2STejun Heo pr_info(" memory size = %#llx reserved size = %#llx\n", 11511440c4e2STejun Heo (unsigned long long)memblock.memory.total_size, 11521440c4e2STejun Heo (unsigned long long)memblock.reserved.total_size); 11536ed311b2SBenjamin Herrenschmidt 11546ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.memory, "memory"); 11556ed311b2SBenjamin Herrenschmidt memblock_dump(&memblock.reserved, "reserved"); 11566ed311b2SBenjamin Herrenschmidt } 11576ed311b2SBenjamin Herrenschmidt 11581aadc056STejun Heo void __init memblock_allow_resize(void) 11596ed311b2SBenjamin Herrenschmidt { 1160142b45a7SBenjamin Herrenschmidt memblock_can_resize = 1; 11616ed311b2SBenjamin Herrenschmidt } 11626ed311b2SBenjamin Herrenschmidt 11636ed311b2SBenjamin Herrenschmidt static int __init early_memblock(char *p) 11646ed311b2SBenjamin Herrenschmidt { 11656ed311b2SBenjamin Herrenschmidt if (p && strstr(p, "debug")) 11666ed311b2SBenjamin Herrenschmidt memblock_debug = 1; 11676ed311b2SBenjamin Herrenschmidt return 0; 11686ed311b2SBenjamin Herrenschmidt } 11696ed311b2SBenjamin Herrenschmidt early_param("memblock", early_memblock); 11706ed311b2SBenjamin Herrenschmidt 1171c378ddd5STejun Heo #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK) 11726d03b885SBenjamin Herrenschmidt 11736d03b885SBenjamin Herrenschmidt static int memblock_debug_show(struct seq_file *m, void *private) 11746d03b885SBenjamin Herrenschmidt { 11756d03b885SBenjamin Herrenschmidt struct memblock_type *type = m->private; 11766d03b885SBenjamin Herrenschmidt struct memblock_region *reg; 11776d03b885SBenjamin Herrenschmidt int i; 11786d03b885SBenjamin Herrenschmidt 11796d03b885SBenjamin Herrenschmidt for (i = 0; i < type->cnt; i++) { 11806d03b885SBenjamin Herrenschmidt reg = &type->regions[i]; 11816d03b885SBenjamin Herrenschmidt seq_printf(m, "%4d: ", i); 11826d03b885SBenjamin Herrenschmidt if (sizeof(phys_addr_t) == 4) 11836d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%08lx..0x%08lx\n", 11846d03b885SBenjamin Herrenschmidt (unsigned long)reg->base, 11856d03b885SBenjamin Herrenschmidt (unsigned long)(reg->base + reg->size - 1)); 11866d03b885SBenjamin Herrenschmidt else 11876d03b885SBenjamin Herrenschmidt seq_printf(m, "0x%016llx..0x%016llx\n", 11886d03b885SBenjamin Herrenschmidt (unsigned long long)reg->base, 11896d03b885SBenjamin Herrenschmidt (unsigned long long)(reg->base + reg->size - 1)); 11906d03b885SBenjamin Herrenschmidt 11916d03b885SBenjamin Herrenschmidt } 11926d03b885SBenjamin Herrenschmidt return 0; 11936d03b885SBenjamin Herrenschmidt } 11946d03b885SBenjamin Herrenschmidt 11956d03b885SBenjamin Herrenschmidt static int memblock_debug_open(struct inode *inode, struct file *file) 11966d03b885SBenjamin Herrenschmidt { 11976d03b885SBenjamin Herrenschmidt return single_open(file, memblock_debug_show, inode->i_private); 11986d03b885SBenjamin Herrenschmidt } 11996d03b885SBenjamin Herrenschmidt 12006d03b885SBenjamin Herrenschmidt static const struct file_operations memblock_debug_fops = { 12016d03b885SBenjamin Herrenschmidt .open = memblock_debug_open, 12026d03b885SBenjamin Herrenschmidt .read = seq_read, 12036d03b885SBenjamin Herrenschmidt .llseek = seq_lseek, 12046d03b885SBenjamin Herrenschmidt .release = single_release, 12056d03b885SBenjamin Herrenschmidt }; 12066d03b885SBenjamin Herrenschmidt 12076d03b885SBenjamin Herrenschmidt static int __init memblock_init_debugfs(void) 12086d03b885SBenjamin Herrenschmidt { 12096d03b885SBenjamin Herrenschmidt struct dentry *root = debugfs_create_dir("memblock", NULL); 12106d03b885SBenjamin Herrenschmidt if (!root) 12116d03b885SBenjamin Herrenschmidt return -ENXIO; 12126d03b885SBenjamin Herrenschmidt debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); 12136d03b885SBenjamin Herrenschmidt debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); 12146d03b885SBenjamin Herrenschmidt 12156d03b885SBenjamin Herrenschmidt return 0; 12166d03b885SBenjamin Herrenschmidt } 12176d03b885SBenjamin Herrenschmidt __initcall(memblock_init_debugfs); 12186d03b885SBenjamin Herrenschmidt 12196d03b885SBenjamin Herrenschmidt #endif /* CONFIG_DEBUG_FS */ 1220