18607a965SThomas Gleixner // SPDX-License-Identifier: GPL-2.0-or-later 2a254129eSJoonsoo Kim /* 3a254129eSJoonsoo Kim * Contiguous Memory Allocator 4a254129eSJoonsoo Kim * 5a254129eSJoonsoo Kim * Copyright (c) 2010-2011 by Samsung Electronics. 6a254129eSJoonsoo Kim * Copyright IBM Corporation, 2013 7a254129eSJoonsoo Kim * Copyright LG Electronics Inc., 2014 8a254129eSJoonsoo Kim * Written by: 9a254129eSJoonsoo Kim * Marek Szyprowski <m.szyprowski@samsung.com> 10a254129eSJoonsoo Kim * Michal Nazarewicz <mina86@mina86.com> 11a254129eSJoonsoo Kim * Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com> 12a254129eSJoonsoo Kim * Joonsoo Kim <iamjoonsoo.kim@lge.com> 13a254129eSJoonsoo Kim */ 14a254129eSJoonsoo Kim 15a254129eSJoonsoo Kim #define pr_fmt(fmt) "cma: " fmt 16a254129eSJoonsoo Kim 17a254129eSJoonsoo Kim #ifdef CONFIG_CMA_DEBUG 18a254129eSJoonsoo Kim #ifndef DEBUG 19a254129eSJoonsoo Kim # define DEBUG 20a254129eSJoonsoo Kim #endif 21a254129eSJoonsoo Kim #endif 2299e8ea6cSStefan Strogin #define CREATE_TRACE_POINTS 23a254129eSJoonsoo Kim 24a254129eSJoonsoo Kim #include <linux/memblock.h> 25a254129eSJoonsoo Kim #include <linux/err.h> 26a254129eSJoonsoo Kim #include <linux/mm.h> 27a254129eSJoonsoo Kim #include <linux/sizes.h> 28a254129eSJoonsoo Kim #include <linux/slab.h> 29a254129eSJoonsoo Kim #include <linux/log2.h> 30a254129eSJoonsoo Kim #include <linux/cma.h> 31f7426b98SMarek Szyprowski #include <linux/highmem.h> 32620951e2SThierry Reding #include <linux/io.h> 33514c6032SRandy Dunlap #include <linux/kmemleak.h> 3499e8ea6cSStefan Strogin #include <trace/events/cma.h> 35a254129eSJoonsoo Kim 369420f89dSMike Rapoport (IBM) #include "internal.h" 3728b24c1fSSasha Levin #include "cma.h" 38a254129eSJoonsoo Kim 3928b24c1fSSasha Levin struct cma cma_areas[MAX_CMA_AREAS]; 4028b24c1fSSasha Levin unsigned cma_area_count; 4160a60e32SDong Aisheng static DEFINE_MUTEX(cma_mutex); 42a254129eSJoonsoo Kim 43ac173824SSasha Levin phys_addr_t cma_get_base(const struct cma *cma) 44a254129eSJoonsoo Kim { 45a254129eSJoonsoo Kim return PFN_PHYS(cma->base_pfn); 46a254129eSJoonsoo Kim } 47a254129eSJoonsoo Kim 48ac173824SSasha Levin unsigned long cma_get_size(const struct cma *cma) 49a254129eSJoonsoo Kim { 50a254129eSJoonsoo Kim return cma->count << PAGE_SHIFT; 51a254129eSJoonsoo Kim } 52a254129eSJoonsoo Kim 53f318dd08SLaura Abbott const char *cma_get_name(const struct cma *cma) 54f318dd08SLaura Abbott { 5518e98e56SBarry Song return cma->name; 56f318dd08SLaura Abbott } 57f318dd08SLaura Abbott 58ac173824SSasha Levin static unsigned long cma_bitmap_aligned_mask(const struct cma *cma, 59e048cb32SDoug Berger unsigned int align_order) 60a254129eSJoonsoo Kim { 6168faed63SWeijie Yang if (align_order <= cma->order_per_bit) 6268faed63SWeijie Yang return 0; 6368faed63SWeijie Yang return (1UL << (align_order - cma->order_per_bit)) - 1; 64a254129eSJoonsoo Kim } 65a254129eSJoonsoo Kim 66850fc430SDanesh Petigara /* 67e048cb32SDoug Berger * Find the offset of the base PFN from the specified align_order. 68e048cb32SDoug Berger * The value returned is represented in order_per_bits. 69850fc430SDanesh Petigara */ 70ac173824SSasha Levin static unsigned long cma_bitmap_aligned_offset(const struct cma *cma, 71e048cb32SDoug Berger unsigned int align_order) 72b5be83e3SGregory Fong { 73e048cb32SDoug Berger return (cma->base_pfn & ((1UL << align_order) - 1)) 74e048cb32SDoug Berger >> cma->order_per_bit; 75b5be83e3SGregory Fong } 76b5be83e3SGregory Fong 77ac173824SSasha Levin static unsigned long cma_bitmap_pages_to_bits(const struct cma *cma, 78a254129eSJoonsoo Kim unsigned long pages) 79a254129eSJoonsoo Kim { 80a254129eSJoonsoo Kim return ALIGN(pages, 1UL << cma->order_per_bit) >> cma->order_per_bit; 81a254129eSJoonsoo Kim } 82a254129eSJoonsoo Kim 83ac173824SSasha Levin static void cma_clear_bitmap(struct cma *cma, unsigned long pfn, 8478fa5150SMinchan Kim unsigned long count) 85a254129eSJoonsoo Kim { 86a254129eSJoonsoo Kim unsigned long bitmap_no, bitmap_count; 870ef7dcacSMike Kravetz unsigned long flags; 88a254129eSJoonsoo Kim 89a254129eSJoonsoo Kim bitmap_no = (pfn - cma->base_pfn) >> cma->order_per_bit; 90a254129eSJoonsoo Kim bitmap_count = cma_bitmap_pages_to_bits(cma, count); 91a254129eSJoonsoo Kim 920ef7dcacSMike Kravetz spin_lock_irqsave(&cma->lock, flags); 93a254129eSJoonsoo Kim bitmap_clear(cma->bitmap, bitmap_no, bitmap_count); 940ef7dcacSMike Kravetz spin_unlock_irqrestore(&cma->lock, flags); 95a254129eSJoonsoo Kim } 96a254129eSJoonsoo Kim 973a5139f1SMike Kravetz static void __init cma_activate_area(struct cma *cma) 98a254129eSJoonsoo Kim { 99072355c1SDavid Hildenbrand unsigned long base_pfn = cma->base_pfn, pfn; 100a254129eSJoonsoo Kim struct zone *zone; 101a254129eSJoonsoo Kim 1022184f992SYunfeng Ye cma->bitmap = bitmap_zalloc(cma_bitmap_maxno(cma), GFP_KERNEL); 1033a5139f1SMike Kravetz if (!cma->bitmap) 1043a5139f1SMike Kravetz goto out_error; 105a254129eSJoonsoo Kim 106a254129eSJoonsoo Kim /* 107072355c1SDavid Hildenbrand * alloc_contig_range() requires the pfn range specified to be in the 108072355c1SDavid Hildenbrand * same zone. Simplify by forcing the entire CMA resv range to be in the 109072355c1SDavid Hildenbrand * same zone. 110a254129eSJoonsoo Kim */ 111072355c1SDavid Hildenbrand WARN_ON_ONCE(!pfn_valid(base_pfn)); 112072355c1SDavid Hildenbrand zone = page_zone(pfn_to_page(base_pfn)); 113072355c1SDavid Hildenbrand for (pfn = base_pfn + 1; pfn < base_pfn + cma->count; pfn++) { 114072355c1SDavid Hildenbrand WARN_ON_ONCE(!pfn_valid(pfn)); 115a254129eSJoonsoo Kim if (page_zone(pfn_to_page(pfn)) != zone) 116d883c6cfSJoonsoo Kim goto not_in_zone; 117a254129eSJoonsoo Kim } 118072355c1SDavid Hildenbrand 119072355c1SDavid Hildenbrand for (pfn = base_pfn; pfn < base_pfn + cma->count; 120072355c1SDavid Hildenbrand pfn += pageblock_nr_pages) 121072355c1SDavid Hildenbrand init_cma_reserved_pageblock(pfn_to_page(pfn)); 122a254129eSJoonsoo Kim 1230ef7dcacSMike Kravetz spin_lock_init(&cma->lock); 12426b02a1fSSasha Levin 12526b02a1fSSasha Levin #ifdef CONFIG_CMA_DEBUGFS 12626b02a1fSSasha Levin INIT_HLIST_HEAD(&cma->mem_head); 12726b02a1fSSasha Levin spin_lock_init(&cma->mem_head_lock); 12826b02a1fSSasha Levin #endif 12926b02a1fSSasha Levin 1303a5139f1SMike Kravetz return; 131a254129eSJoonsoo Kim 132d883c6cfSJoonsoo Kim not_in_zone: 1332184f992SYunfeng Ye bitmap_free(cma->bitmap); 1343a5139f1SMike Kravetz out_error: 135072355c1SDavid Hildenbrand /* Expose all pages to the buddy, they are useless for CMA. */ 13627d121d0SHari Bathini if (!cma->reserve_pages_on_error) { 137072355c1SDavid Hildenbrand for (pfn = base_pfn; pfn < base_pfn + cma->count; pfn++) 138072355c1SDavid Hildenbrand free_reserved_page(pfn_to_page(pfn)); 13927d121d0SHari Bathini } 140072355c1SDavid Hildenbrand totalcma_pages -= cma->count; 141f022d8cbSLaurent Pinchart cma->count = 0; 1423a5139f1SMike Kravetz pr_err("CMA area %s could not be activated\n", cma->name); 1433a5139f1SMike Kravetz return; 144a254129eSJoonsoo Kim } 145a254129eSJoonsoo Kim 146a254129eSJoonsoo Kim static int __init cma_init_reserved_areas(void) 147a254129eSJoonsoo Kim { 148a254129eSJoonsoo Kim int i; 149a254129eSJoonsoo Kim 1503a5139f1SMike Kravetz for (i = 0; i < cma_area_count; i++) 1513a5139f1SMike Kravetz cma_activate_area(&cma_areas[i]); 152a254129eSJoonsoo Kim 153a254129eSJoonsoo Kim return 0; 154a254129eSJoonsoo Kim } 155d883c6cfSJoonsoo Kim core_initcall(cma_init_reserved_areas); 156a254129eSJoonsoo Kim 15727d121d0SHari Bathini void __init cma_reserve_pages_on_error(struct cma *cma) 15827d121d0SHari Bathini { 15927d121d0SHari Bathini cma->reserve_pages_on_error = true; 16027d121d0SHari Bathini } 16127d121d0SHari Bathini 162a254129eSJoonsoo Kim /** 163de9e14eeSMarek Szyprowski * cma_init_reserved_mem() - create custom contiguous area from reserved memory 164de9e14eeSMarek Szyprowski * @base: Base address of the reserved area 165de9e14eeSMarek Szyprowski * @size: Size of the reserved area (in bytes), 166de9e14eeSMarek Szyprowski * @order_per_bit: Order of pages represented by one bit on bitmap. 167e8b098fcSMike Rapoport * @name: The name of the area. If this parameter is NULL, the name of 168e8b098fcSMike Rapoport * the area will be set to "cmaN", where N is a running counter of 169e8b098fcSMike Rapoport * used areas. 170de9e14eeSMarek Szyprowski * @res_cma: Pointer to store the created cma region. 171de9e14eeSMarek Szyprowski * 172de9e14eeSMarek Szyprowski * This function creates custom contiguous area from already reserved memory. 173de9e14eeSMarek Szyprowski */ 174de9e14eeSMarek Szyprowski int __init cma_init_reserved_mem(phys_addr_t base, phys_addr_t size, 175ac173824SSasha Levin unsigned int order_per_bit, 176f318dd08SLaura Abbott const char *name, 177ac173824SSasha Levin struct cma **res_cma) 178de9e14eeSMarek Szyprowski { 179de9e14eeSMarek Szyprowski struct cma *cma; 180de9e14eeSMarek Szyprowski 181de9e14eeSMarek Szyprowski /* Sanity checks */ 182de9e14eeSMarek Szyprowski if (cma_area_count == ARRAY_SIZE(cma_areas)) { 183de9e14eeSMarek Szyprowski pr_err("Not enough slots for CMA reserved regions!\n"); 184de9e14eeSMarek Szyprowski return -ENOSPC; 185de9e14eeSMarek Szyprowski } 186de9e14eeSMarek Szyprowski 187de9e14eeSMarek Szyprowski if (!size || !memblock_is_region_reserved(base, size)) 188de9e14eeSMarek Szyprowski return -EINVAL; 189de9e14eeSMarek Szyprowski 190de9e14eeSMarek Szyprowski /* alignment should be aligned with order_per_bit */ 191e16faf26SDavid Hildenbrand if (!IS_ALIGNED(CMA_MIN_ALIGNMENT_PAGES, 1 << order_per_bit)) 192de9e14eeSMarek Szyprowski return -EINVAL; 193de9e14eeSMarek Szyprowski 194e16faf26SDavid Hildenbrand /* ensure minimal alignment required by mm core */ 195e16faf26SDavid Hildenbrand if (!IS_ALIGNED(base | size, CMA_MIN_ALIGNMENT_BYTES)) 196de9e14eeSMarek Szyprowski return -EINVAL; 197de9e14eeSMarek Szyprowski 198de9e14eeSMarek Szyprowski /* 199de9e14eeSMarek Szyprowski * Each reserved area must be initialised later, when more kernel 200de9e14eeSMarek Szyprowski * subsystems (like slab allocator) are available. 201de9e14eeSMarek Szyprowski */ 202de9e14eeSMarek Szyprowski cma = &cma_areas[cma_area_count]; 20318e98e56SBarry Song 20418e98e56SBarry Song if (name) 20518e98e56SBarry Song snprintf(cma->name, CMA_MAX_NAME, name); 20618e98e56SBarry Song else 20718e98e56SBarry Song snprintf(cma->name, CMA_MAX_NAME, "cma%d\n", cma_area_count); 20818e98e56SBarry Song 209de9e14eeSMarek Szyprowski cma->base_pfn = PFN_DOWN(base); 210de9e14eeSMarek Szyprowski cma->count = size >> PAGE_SHIFT; 211de9e14eeSMarek Szyprowski cma->order_per_bit = order_per_bit; 212de9e14eeSMarek Szyprowski *res_cma = cma; 213de9e14eeSMarek Szyprowski cma_area_count++; 21494737a85SGeorge G. Davis totalcma_pages += (size / PAGE_SIZE); 215de9e14eeSMarek Szyprowski 216de9e14eeSMarek Szyprowski return 0; 217de9e14eeSMarek Szyprowski } 218de9e14eeSMarek Szyprowski 219de9e14eeSMarek Szyprowski /** 2208676af1fSAslan Bakirov * cma_declare_contiguous_nid() - reserve custom contiguous area 221a254129eSJoonsoo Kim * @base: Base address of the reserved area optional, use 0 for any 222c1f733aaSJoonsoo Kim * @size: Size of the reserved area (in bytes), 223a254129eSJoonsoo Kim * @limit: End address of the reserved memory (optional, 0 for any). 224a254129eSJoonsoo Kim * @alignment: Alignment for the CMA area, should be power of 2 or zero 225a254129eSJoonsoo Kim * @order_per_bit: Order of pages represented by one bit on bitmap. 226a254129eSJoonsoo Kim * @fixed: hint about where to place the reserved area 227e8b098fcSMike Rapoport * @name: The name of the area. See function cma_init_reserved_mem() 228c1f733aaSJoonsoo Kim * @res_cma: Pointer to store the created cma region. 2298676af1fSAslan Bakirov * @nid: nid of the free area to find, %NUMA_NO_NODE for any node 230a254129eSJoonsoo Kim * 231a254129eSJoonsoo Kim * This function reserves memory from early allocator. It should be 232a254129eSJoonsoo Kim * called by arch specific code once the early allocator (memblock or bootmem) 233a254129eSJoonsoo Kim * has been activated and all other subsystems have already allocated/reserved 234a254129eSJoonsoo Kim * memory. This function allows to create custom reserved areas. 235a254129eSJoonsoo Kim * 236a254129eSJoonsoo Kim * If @fixed is true, reserve contiguous area at exactly @base. If false, 237a254129eSJoonsoo Kim * reserve in range from @base to @limit. 238a254129eSJoonsoo Kim */ 2398676af1fSAslan Bakirov int __init cma_declare_contiguous_nid(phys_addr_t base, 240c1f733aaSJoonsoo Kim phys_addr_t size, phys_addr_t limit, 241a254129eSJoonsoo Kim phys_addr_t alignment, unsigned int order_per_bit, 2428676af1fSAslan Bakirov bool fixed, const char *name, struct cma **res_cma, 2438676af1fSAslan Bakirov int nid) 244a254129eSJoonsoo Kim { 245f7426b98SMarek Szyprowski phys_addr_t memblock_end = memblock_end_of_DRAM(); 2466b101e2aSJoonsoo Kim phys_addr_t highmem_start; 247a254129eSJoonsoo Kim int ret = 0; 248a254129eSJoonsoo Kim 2496b101e2aSJoonsoo Kim /* 2502dece445SLaura Abbott * We can't use __pa(high_memory) directly, since high_memory 2512dece445SLaura Abbott * isn't a valid direct map VA, and DEBUG_VIRTUAL will (validly) 2522dece445SLaura Abbott * complain. Find the boundary by adding one to the last valid 2532dece445SLaura Abbott * address. 2546b101e2aSJoonsoo Kim */ 2552dece445SLaura Abbott highmem_start = __pa(high_memory - 1) + 1; 25656fa4f60SLaurent Pinchart pr_debug("%s(size %pa, base %pa, limit %pa alignment %pa)\n", 25756fa4f60SLaurent Pinchart __func__, &size, &base, &limit, &alignment); 258a254129eSJoonsoo Kim 259a254129eSJoonsoo Kim if (cma_area_count == ARRAY_SIZE(cma_areas)) { 260a254129eSJoonsoo Kim pr_err("Not enough slots for CMA reserved regions!\n"); 261a254129eSJoonsoo Kim return -ENOSPC; 262a254129eSJoonsoo Kim } 263a254129eSJoonsoo Kim 264a254129eSJoonsoo Kim if (!size) 265a254129eSJoonsoo Kim return -EINVAL; 266a254129eSJoonsoo Kim 267a254129eSJoonsoo Kim if (alignment && !is_power_of_2(alignment)) 268a254129eSJoonsoo Kim return -EINVAL; 269a254129eSJoonsoo Kim 270e16faf26SDavid Hildenbrand /* Sanitise input arguments. */ 271e16faf26SDavid Hildenbrand alignment = max_t(phys_addr_t, alignment, CMA_MIN_ALIGNMENT_BYTES); 272c633324eSDoug Berger if (fixed && base & (alignment - 1)) { 273c633324eSDoug Berger ret = -EINVAL; 274c633324eSDoug Berger pr_err("Region at %pa must be aligned to %pa bytes\n", 275c633324eSDoug Berger &base, &alignment); 276c633324eSDoug Berger goto err; 277c633324eSDoug Berger } 278a254129eSJoonsoo Kim base = ALIGN(base, alignment); 279a254129eSJoonsoo Kim size = ALIGN(size, alignment); 280a254129eSJoonsoo Kim limit &= ~(alignment - 1); 281a254129eSJoonsoo Kim 282800a85d3SLaurent Pinchart if (!base) 283800a85d3SLaurent Pinchart fixed = false; 284800a85d3SLaurent Pinchart 285a254129eSJoonsoo Kim /* size should be aligned with order_per_bit */ 286a254129eSJoonsoo Kim if (!IS_ALIGNED(size >> PAGE_SHIFT, 1 << order_per_bit)) 287a254129eSJoonsoo Kim return -EINVAL; 288a254129eSJoonsoo Kim 289f7426b98SMarek Szyprowski /* 29016195dddSLaurent Pinchart * If allocating at a fixed base the request region must not cross the 29116195dddSLaurent Pinchart * low/high memory boundary. 292f7426b98SMarek Szyprowski */ 293f7426b98SMarek Szyprowski if (fixed && base < highmem_start && base + size > highmem_start) { 294f7426b98SMarek Szyprowski ret = -EINVAL; 29556fa4f60SLaurent Pinchart pr_err("Region at %pa defined on low/high memory boundary (%pa)\n", 29656fa4f60SLaurent Pinchart &base, &highmem_start); 297f7426b98SMarek Szyprowski goto err; 298f7426b98SMarek Szyprowski } 299f7426b98SMarek Szyprowski 30016195dddSLaurent Pinchart /* 30116195dddSLaurent Pinchart * If the limit is unspecified or above the memblock end, its effective 30216195dddSLaurent Pinchart * value will be the memblock end. Set it explicitly to simplify further 30316195dddSLaurent Pinchart * checks. 30416195dddSLaurent Pinchart */ 30516195dddSLaurent Pinchart if (limit == 0 || limit > memblock_end) 30616195dddSLaurent Pinchart limit = memblock_end; 30716195dddSLaurent Pinchart 308c633324eSDoug Berger if (base + size > limit) { 309c633324eSDoug Berger ret = -EINVAL; 310c633324eSDoug Berger pr_err("Size (%pa) of region at %pa exceeds limit (%pa)\n", 311c633324eSDoug Berger &size, &base, &limit); 312c633324eSDoug Berger goto err; 313c633324eSDoug Berger } 314c633324eSDoug Berger 315a254129eSJoonsoo Kim /* Reserve memory */ 316800a85d3SLaurent Pinchart if (fixed) { 317a254129eSJoonsoo Kim if (memblock_is_region_reserved(base, size) || 318a254129eSJoonsoo Kim memblock_reserve(base, size) < 0) { 319a254129eSJoonsoo Kim ret = -EBUSY; 320a254129eSJoonsoo Kim goto err; 321a254129eSJoonsoo Kim } 322a254129eSJoonsoo Kim } else { 32316195dddSLaurent Pinchart phys_addr_t addr = 0; 32416195dddSLaurent Pinchart 32516195dddSLaurent Pinchart /* 326df2ff39eSRoman Gushchin * If there is enough memory, try a bottom-up allocation first. 327df2ff39eSRoman Gushchin * It will place the new cma area close to the start of the node 328df2ff39eSRoman Gushchin * and guarantee that the compaction is moving pages out of the 329df2ff39eSRoman Gushchin * cma area and not into it. 330df2ff39eSRoman Gushchin * Avoid using first 4GB to not interfere with constrained zones 331df2ff39eSRoman Gushchin * like DMA/DMA32. 332df2ff39eSRoman Gushchin */ 333df2ff39eSRoman Gushchin #ifdef CONFIG_PHYS_ADDR_T_64BIT 334df2ff39eSRoman Gushchin if (!memblock_bottom_up() && memblock_end >= SZ_4G + size) { 335df2ff39eSRoman Gushchin memblock_set_bottom_up(true); 336df2ff39eSRoman Gushchin addr = memblock_alloc_range_nid(size, alignment, SZ_4G, 337df2ff39eSRoman Gushchin limit, nid, true); 338df2ff39eSRoman Gushchin memblock_set_bottom_up(false); 339df2ff39eSRoman Gushchin } 340df2ff39eSRoman Gushchin #endif 341df2ff39eSRoman Gushchin 342148aa87eSLevi Yun /* 343148aa87eSLevi Yun * All pages in the reserved area must come from the same zone. 344148aa87eSLevi Yun * If the requested region crosses the low/high memory boundary, 345148aa87eSLevi Yun * try allocating from high memory first and fall back to low 346148aa87eSLevi Yun * memory in case of failure. 347148aa87eSLevi Yun */ 348148aa87eSLevi Yun if (!addr && base < highmem_start && limit > highmem_start) { 349148aa87eSLevi Yun addr = memblock_alloc_range_nid(size, alignment, 350148aa87eSLevi Yun highmem_start, limit, nid, true); 351148aa87eSLevi Yun limit = highmem_start; 352148aa87eSLevi Yun } 353148aa87eSLevi Yun 35416195dddSLaurent Pinchart if (!addr) { 3558676af1fSAslan Bakirov addr = memblock_alloc_range_nid(size, alignment, base, 35640366bd7SBarry Song limit, nid, true); 357a254129eSJoonsoo Kim if (!addr) { 358a254129eSJoonsoo Kim ret = -ENOMEM; 359a254129eSJoonsoo Kim goto err; 360a254129eSJoonsoo Kim } 361a254129eSJoonsoo Kim } 362a254129eSJoonsoo Kim 363620951e2SThierry Reding /* 364620951e2SThierry Reding * kmemleak scans/reads tracked objects for pointers to other 365620951e2SThierry Reding * objects but this address isn't mapped and accessible 366620951e2SThierry Reding */ 3679099daedSCatalin Marinas kmemleak_ignore_phys(addr); 36816195dddSLaurent Pinchart base = addr; 36916195dddSLaurent Pinchart } 37016195dddSLaurent Pinchart 371f318dd08SLaura Abbott ret = cma_init_reserved_mem(base, size, order_per_bit, name, res_cma); 372de9e14eeSMarek Szyprowski if (ret) 3730d3bd18aSPeng Fan goto free_mem; 374a254129eSJoonsoo Kim 37556fa4f60SLaurent Pinchart pr_info("Reserved %ld MiB at %pa\n", (unsigned long)size / SZ_1M, 37656fa4f60SLaurent Pinchart &base); 377a254129eSJoonsoo Kim return 0; 378a254129eSJoonsoo Kim 3790d3bd18aSPeng Fan free_mem: 3803ecc6834SMike Rapoport memblock_phys_free(base, size); 381a254129eSJoonsoo Kim err: 3820de9d2ebSJoonsoo Kim pr_err("Failed to reserve %ld MiB\n", (unsigned long)size / SZ_1M); 383a254129eSJoonsoo Kim return ret; 384a254129eSJoonsoo Kim } 385a254129eSJoonsoo Kim 386dbe43d4dSJaewon Kim #ifdef CONFIG_CMA_DEBUG 387dbe43d4dSJaewon Kim static void cma_debug_show_areas(struct cma *cma) 388dbe43d4dSJaewon Kim { 3892b59e01aSYue Hu unsigned long next_zero_bit, next_set_bit, nr_zero; 390dbe43d4dSJaewon Kim unsigned long start = 0; 3912b59e01aSYue Hu unsigned long nr_part, nr_total = 0; 3922b59e01aSYue Hu unsigned long nbits = cma_bitmap_maxno(cma); 393dbe43d4dSJaewon Kim 3940ef7dcacSMike Kravetz spin_lock_irq(&cma->lock); 395dbe43d4dSJaewon Kim pr_info("number of available pages: "); 396dbe43d4dSJaewon Kim for (;;) { 3972b59e01aSYue Hu next_zero_bit = find_next_zero_bit(cma->bitmap, nbits, start); 3982b59e01aSYue Hu if (next_zero_bit >= nbits) 399dbe43d4dSJaewon Kim break; 4002b59e01aSYue Hu next_set_bit = find_next_bit(cma->bitmap, nbits, next_zero_bit); 401dbe43d4dSJaewon Kim nr_zero = next_set_bit - next_zero_bit; 4022b59e01aSYue Hu nr_part = nr_zero << cma->order_per_bit; 4032b59e01aSYue Hu pr_cont("%s%lu@%lu", nr_total ? "+" : "", nr_part, 4042b59e01aSYue Hu next_zero_bit); 4052b59e01aSYue Hu nr_total += nr_part; 406dbe43d4dSJaewon Kim start = next_zero_bit + nr_zero; 407dbe43d4dSJaewon Kim } 4082b59e01aSYue Hu pr_cont("=> %lu free of %lu total pages\n", nr_total, cma->count); 4090ef7dcacSMike Kravetz spin_unlock_irq(&cma->lock); 410dbe43d4dSJaewon Kim } 411dbe43d4dSJaewon Kim #else 412dbe43d4dSJaewon Kim static inline void cma_debug_show_areas(struct cma *cma) { } 413dbe43d4dSJaewon Kim #endif 414dbe43d4dSJaewon Kim 415a254129eSJoonsoo Kim /** 416a254129eSJoonsoo Kim * cma_alloc() - allocate pages from contiguous area 417a254129eSJoonsoo Kim * @cma: Contiguous memory region for which the allocation is performed. 418a254129eSJoonsoo Kim * @count: Requested number of pages. 419a254129eSJoonsoo Kim * @align: Requested alignment of pages (in PAGE_SIZE order). 42065182029SMarek Szyprowski * @no_warn: Avoid printing message about failed allocation 421a254129eSJoonsoo Kim * 422a254129eSJoonsoo Kim * This function allocates part of contiguous memory on specific 423a254129eSJoonsoo Kim * contiguous memory area. 424a254129eSJoonsoo Kim */ 42578fa5150SMinchan Kim struct page *cma_alloc(struct cma *cma, unsigned long count, 42678fa5150SMinchan Kim unsigned int align, bool no_warn) 427a254129eSJoonsoo Kim { 4283acaea68SAndrew Morton unsigned long mask, offset; 4293acaea68SAndrew Morton unsigned long pfn = -1; 4303acaea68SAndrew Morton unsigned long start = 0; 431a254129eSJoonsoo Kim unsigned long bitmap_maxno, bitmap_no, bitmap_count; 43278fa5150SMinchan Kim unsigned long i; 433a254129eSJoonsoo Kim struct page *page = NULL; 434dbe43d4dSJaewon Kim int ret = -ENOMEM; 435a254129eSJoonsoo Kim 436835832baSJianqun Xu if (!cma || !cma->count || !cma->bitmap) 437bbb26920SMinchan Kim goto out; 438a254129eSJoonsoo Kim 439*35fb4764SPintu Kumar pr_debug("%s(cma %p, name: %s, count %lu, align %d)\n", __func__, 440*35fb4764SPintu Kumar (void *)cma, cma->name, count, align); 441a254129eSJoonsoo Kim 442a254129eSJoonsoo Kim if (!count) 443bbb26920SMinchan Kim goto out; 444a254129eSJoonsoo Kim 4457bc1aec5SLiam Mark trace_cma_alloc_start(cma->name, count, align); 4467bc1aec5SLiam Mark 447a254129eSJoonsoo Kim mask = cma_bitmap_aligned_mask(cma, align); 448b5be83e3SGregory Fong offset = cma_bitmap_aligned_offset(cma, align); 449a254129eSJoonsoo Kim bitmap_maxno = cma_bitmap_maxno(cma); 450a254129eSJoonsoo Kim bitmap_count = cma_bitmap_pages_to_bits(cma, count); 451a254129eSJoonsoo Kim 4526b36ba59SShiraz Hashim if (bitmap_count > bitmap_maxno) 453bbb26920SMinchan Kim goto out; 4546b36ba59SShiraz Hashim 455a254129eSJoonsoo Kim for (;;) { 4560ef7dcacSMike Kravetz spin_lock_irq(&cma->lock); 457b5be83e3SGregory Fong bitmap_no = bitmap_find_next_zero_area_off(cma->bitmap, 458b5be83e3SGregory Fong bitmap_maxno, start, bitmap_count, mask, 459b5be83e3SGregory Fong offset); 460a254129eSJoonsoo Kim if (bitmap_no >= bitmap_maxno) { 4610ef7dcacSMike Kravetz spin_unlock_irq(&cma->lock); 462a254129eSJoonsoo Kim break; 463a254129eSJoonsoo Kim } 464a254129eSJoonsoo Kim bitmap_set(cma->bitmap, bitmap_no, bitmap_count); 465a254129eSJoonsoo Kim /* 466a254129eSJoonsoo Kim * It's safe to drop the lock here. We've marked this region for 467a254129eSJoonsoo Kim * our exclusive use. If the migration fails we will take the 468a254129eSJoonsoo Kim * lock again and unmark it. 469a254129eSJoonsoo Kim */ 4700ef7dcacSMike Kravetz spin_unlock_irq(&cma->lock); 471a254129eSJoonsoo Kim 472a254129eSJoonsoo Kim pfn = cma->base_pfn + (bitmap_no << cma->order_per_bit); 47360a60e32SDong Aisheng mutex_lock(&cma_mutex); 474ca96b625SLucas Stach ret = alloc_contig_range(pfn, pfn + count, MIGRATE_CMA, 47565182029SMarek Szyprowski GFP_KERNEL | (no_warn ? __GFP_NOWARN : 0)); 47660a60e32SDong Aisheng mutex_unlock(&cma_mutex); 477a254129eSJoonsoo Kim if (ret == 0) { 478a254129eSJoonsoo Kim page = pfn_to_page(pfn); 479a254129eSJoonsoo Kim break; 480a254129eSJoonsoo Kim } 481b7155e76SJoonsoo Kim 482a254129eSJoonsoo Kim cma_clear_bitmap(cma, pfn, count); 483b7155e76SJoonsoo Kim if (ret != -EBUSY) 484b7155e76SJoonsoo Kim break; 485b7155e76SJoonsoo Kim 486399fd496SKassey Li pr_debug("%s(): memory range at pfn 0x%lx %p is busy, retrying\n", 487399fd496SKassey Li __func__, pfn, pfn_to_page(pfn)); 4887bc1aec5SLiam Mark 4893aab8ae7SMinchan Kim trace_cma_alloc_busy_retry(cma->name, pfn, pfn_to_page(pfn), 4903aab8ae7SMinchan Kim count, align); 491a254129eSJoonsoo Kim /* try again with a bit different memory target */ 492a254129eSJoonsoo Kim start = bitmap_no + mask + 1; 493a254129eSJoonsoo Kim } 494a254129eSJoonsoo Kim 495cb6c33d4SWenchao Hao trace_cma_alloc_finish(cma->name, pfn, page, count, align, ret); 49699e8ea6cSStefan Strogin 4972813b9c0SAndrey Konovalov /* 4982813b9c0SAndrey Konovalov * CMA can allocate multiple page blocks, which results in different 4992813b9c0SAndrey Konovalov * blocks being marked with different tags. Reset the tags to ignore 5002813b9c0SAndrey Konovalov * those page blocks. 5012813b9c0SAndrey Konovalov */ 5022813b9c0SAndrey Konovalov if (page) { 5032813b9c0SAndrey Konovalov for (i = 0; i < count; i++) 5042813b9c0SAndrey Konovalov page_kasan_tag_reset(page + i); 5052813b9c0SAndrey Konovalov } 5062813b9c0SAndrey Konovalov 50765182029SMarek Szyprowski if (ret && !no_warn) { 50878fa5150SMinchan Kim pr_err_ratelimited("%s: %s: alloc failed, req-size: %lu pages, ret: %d\n", 509a052d4d1SPatrick Daly __func__, cma->name, count, ret); 510dbe43d4dSJaewon Kim cma_debug_show_areas(cma); 511dbe43d4dSJaewon Kim } 512dbe43d4dSJaewon Kim 513a254129eSJoonsoo Kim pr_debug("%s(): returned %p\n", __func__, page); 514bbb26920SMinchan Kim out: 51543ca106fSMinchan Kim if (page) { 516bbb26920SMinchan Kim count_vm_event(CMA_ALLOC_SUCCESS); 51743ca106fSMinchan Kim cma_sysfs_account_success_pages(cma, count); 51843ca106fSMinchan Kim } else { 519bbb26920SMinchan Kim count_vm_event(CMA_ALLOC_FAIL); 52043ca106fSMinchan Kim if (cma) 52143ca106fSMinchan Kim cma_sysfs_account_fail_pages(cma, count); 52243ca106fSMinchan Kim } 523bbb26920SMinchan Kim 524a254129eSJoonsoo Kim return page; 525a254129eSJoonsoo Kim } 526a254129eSJoonsoo Kim 5279871e2deSMike Kravetz bool cma_pages_valid(struct cma *cma, const struct page *pages, 5289871e2deSMike Kravetz unsigned long count) 5299871e2deSMike Kravetz { 5309871e2deSMike Kravetz unsigned long pfn; 5319871e2deSMike Kravetz 5329871e2deSMike Kravetz if (!cma || !pages) 5339871e2deSMike Kravetz return false; 5349871e2deSMike Kravetz 5359871e2deSMike Kravetz pfn = page_to_pfn(pages); 5369871e2deSMike Kravetz 5379871e2deSMike Kravetz if (pfn < cma->base_pfn || pfn >= cma->base_pfn + cma->count) { 5389871e2deSMike Kravetz pr_debug("%s(page %p, count %lu)\n", __func__, 5399871e2deSMike Kravetz (void *)pages, count); 5409871e2deSMike Kravetz return false; 5419871e2deSMike Kravetz } 5429871e2deSMike Kravetz 5439871e2deSMike Kravetz return true; 5449871e2deSMike Kravetz } 5459871e2deSMike Kravetz 546a254129eSJoonsoo Kim /** 547a254129eSJoonsoo Kim * cma_release() - release allocated pages 548a254129eSJoonsoo Kim * @cma: Contiguous memory region for which the allocation is performed. 549a254129eSJoonsoo Kim * @pages: Allocated pages. 550a254129eSJoonsoo Kim * @count: Number of allocated pages. 551a254129eSJoonsoo Kim * 552929f92f7SRyohei Suzuki * This function releases memory allocated by cma_alloc(). 553a254129eSJoonsoo Kim * It returns false when provided pages do not belong to contiguous area and 554a254129eSJoonsoo Kim * true otherwise. 555a254129eSJoonsoo Kim */ 55678fa5150SMinchan Kim bool cma_release(struct cma *cma, const struct page *pages, 55778fa5150SMinchan Kim unsigned long count) 558a254129eSJoonsoo Kim { 559a254129eSJoonsoo Kim unsigned long pfn; 560a254129eSJoonsoo Kim 5619871e2deSMike Kravetz if (!cma_pages_valid(cma, pages, count)) 562a254129eSJoonsoo Kim return false; 563a254129eSJoonsoo Kim 56478fa5150SMinchan Kim pr_debug("%s(page %p, count %lu)\n", __func__, (void *)pages, count); 565a254129eSJoonsoo Kim 566a254129eSJoonsoo Kim pfn = page_to_pfn(pages); 567a254129eSJoonsoo Kim 568a254129eSJoonsoo Kim VM_BUG_ON(pfn + count > cma->base_pfn + cma->count); 569a254129eSJoonsoo Kim 570a254129eSJoonsoo Kim free_contig_range(pfn, count); 571a254129eSJoonsoo Kim cma_clear_bitmap(cma, pfn, count); 5723aab8ae7SMinchan Kim trace_cma_release(cma->name, pfn, pages, count); 573a254129eSJoonsoo Kim 574a254129eSJoonsoo Kim return true; 575a254129eSJoonsoo Kim } 576e4231bcdSLaura Abbott 577e4231bcdSLaura Abbott int cma_for_each_area(int (*it)(struct cma *cma, void *data), void *data) 578e4231bcdSLaura Abbott { 579e4231bcdSLaura Abbott int i; 580e4231bcdSLaura Abbott 581e4231bcdSLaura Abbott for (i = 0; i < cma_area_count; i++) { 582e4231bcdSLaura Abbott int ret = it(&cma_areas[i], data); 583e4231bcdSLaura Abbott 584e4231bcdSLaura Abbott if (ret) 585e4231bcdSLaura Abbott return ret; 586e4231bcdSLaura Abbott } 587e4231bcdSLaura Abbott 588e4231bcdSLaura Abbott return 0; 589e4231bcdSLaura Abbott } 590