blob: 6268d6620254fe52a36344d46c8c73256a7016f3 [file] [log] [blame]
Thomas Gleixner8607a962019-05-22 09:51:44 +02001// SPDX-License-Identifier: GPL-2.0-or-later
Joonsoo Kima2541292014-08-06 16:05:25 -07002/*
3 * Contiguous Memory Allocator
4 *
5 * Copyright (c) 2010-2011 by Samsung Electronics.
6 * Copyright IBM Corporation, 2013
7 * Copyright LG Electronics Inc., 2014
8 * Written by:
9 * Marek Szyprowski <m.szyprowski@samsung.com>
10 * Michal Nazarewicz <mina86@mina86.com>
11 * Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
12 * Joonsoo Kim <iamjoonsoo.kim@lge.com>
Joonsoo Kima2541292014-08-06 16:05:25 -070013 */
14
15#define pr_fmt(fmt) "cma: " fmt
16
17#ifdef CONFIG_CMA_DEBUG
18#ifndef DEBUG
19# define DEBUG
20#endif
21#endif
Stefan Strogin99e8ea62015-04-15 16:14:50 -070022#define CREATE_TRACE_POINTS
Joonsoo Kima2541292014-08-06 16:05:25 -070023
24#include <linux/memblock.h>
25#include <linux/err.h>
26#include <linux/mm.h>
Joonsoo Kima2541292014-08-06 16:05:25 -070027#include <linux/sizes.h>
28#include <linux/slab.h>
29#include <linux/log2.h>
30#include <linux/cma.h>
Marek Szyprowskif7426b92014-10-09 15:26:47 -070031#include <linux/highmem.h>
Thierry Reding620951e2014-12-12 16:58:31 -080032#include <linux/io.h>
Randy Dunlap514c6032018-04-05 16:25:34 -070033#include <linux/kmemleak.h>
Stefan Strogin99e8ea62015-04-15 16:14:50 -070034#include <trace/events/cma.h>
Joonsoo Kima2541292014-08-06 16:05:25 -070035
Mike Rapoport (IBM)9420f892023-03-21 19:05:02 +020036#include "internal.h"
Sasha Levin28b24c12015-04-14 15:44:57 -070037#include "cma.h"
Joonsoo Kima2541292014-08-06 16:05:25 -070038
Sasha Levin28b24c12015-04-14 15:44:57 -070039struct cma cma_areas[MAX_CMA_AREAS];
40unsigned cma_area_count;
Dong Aisheng60a60e32022-05-13 15:11:26 -070041static DEFINE_MUTEX(cma_mutex);
Joonsoo Kima2541292014-08-06 16:05:25 -070042
Sasha Levinac173822015-04-14 15:47:04 -070043phys_addr_t cma_get_base(const struct cma *cma)
Joonsoo Kima2541292014-08-06 16:05:25 -070044{
45 return PFN_PHYS(cma->base_pfn);
46}
47
Sasha Levinac173822015-04-14 15:47:04 -070048unsigned long cma_get_size(const struct cma *cma)
Joonsoo Kima2541292014-08-06 16:05:25 -070049{
50 return cma->count << PAGE_SHIFT;
51}
52
Laura Abbottf318dd02017-04-18 11:27:03 -070053const char *cma_get_name(const struct cma *cma)
54{
Barry Song18e98e52020-08-11 18:31:57 -070055 return cma->name;
Laura Abbottf318dd02017-04-18 11:27:03 -070056}
57
Sasha Levinac173822015-04-14 15:47:04 -070058static unsigned long cma_bitmap_aligned_mask(const struct cma *cma,
Doug Bergere048cb322017-07-10 15:49:44 -070059 unsigned int align_order)
Joonsoo Kima2541292014-08-06 16:05:25 -070060{
Weijie Yang68faed62014-10-13 15:51:03 -070061 if (align_order <= cma->order_per_bit)
62 return 0;
63 return (1UL << (align_order - cma->order_per_bit)) - 1;
Joonsoo Kima2541292014-08-06 16:05:25 -070064}
65
Danesh Petigara850fc432015-03-12 16:25:57 -070066/*
Doug Bergere048cb322017-07-10 15:49:44 -070067 * Find the offset of the base PFN from the specified align_order.
68 * The value returned is represented in order_per_bits.
Danesh Petigara850fc432015-03-12 16:25:57 -070069 */
Sasha Levinac173822015-04-14 15:47:04 -070070static unsigned long cma_bitmap_aligned_offset(const struct cma *cma,
Doug Bergere048cb322017-07-10 15:49:44 -070071 unsigned int align_order)
Gregory Fongb5be83e2014-12-12 16:54:48 -080072{
Doug Bergere048cb322017-07-10 15:49:44 -070073 return (cma->base_pfn & ((1UL << align_order) - 1))
74 >> cma->order_per_bit;
Gregory Fongb5be83e2014-12-12 16:54:48 -080075}
76
Sasha Levinac173822015-04-14 15:47:04 -070077static unsigned long cma_bitmap_pages_to_bits(const struct cma *cma,
78 unsigned long pages)
Joonsoo Kima2541292014-08-06 16:05:25 -070079{
80 return ALIGN(pages, 1UL << cma->order_per_bit) >> cma->order_per_bit;
81}
82
Sasha Levinac173822015-04-14 15:47:04 -070083static void cma_clear_bitmap(struct cma *cma, unsigned long pfn,
Minchan Kim78fa5152021-05-04 18:37:34 -070084 unsigned long count)
Joonsoo Kima2541292014-08-06 16:05:25 -070085{
86 unsigned long bitmap_no, bitmap_count;
Mike Kravetz0ef7dca2021-05-04 18:34:44 -070087 unsigned long flags;
Joonsoo Kima2541292014-08-06 16:05:25 -070088
89 bitmap_no = (pfn - cma->base_pfn) >> cma->order_per_bit;
90 bitmap_count = cma_bitmap_pages_to_bits(cma, count);
91
Mike Kravetz0ef7dca2021-05-04 18:34:44 -070092 spin_lock_irqsave(&cma->lock, flags);
Joonsoo Kima2541292014-08-06 16:05:25 -070093 bitmap_clear(cma->bitmap, bitmap_no, bitmap_count);
Mike Kravetz0ef7dca2021-05-04 18:34:44 -070094 spin_unlock_irqrestore(&cma->lock, flags);
Joonsoo Kima2541292014-08-06 16:05:25 -070095}
96
Mike Kravetz3a5139f2020-08-11 18:32:03 -070097static void __init cma_activate_area(struct cma *cma)
Joonsoo Kima2541292014-08-06 16:05:25 -070098{
David Hildenbrand072355c2021-02-25 17:16:37 -080099 unsigned long base_pfn = cma->base_pfn, pfn;
Joonsoo Kima2541292014-08-06 16:05:25 -0700100 struct zone *zone;
101
Yunfeng Ye2184f992019-11-30 17:57:22 -0800102 cma->bitmap = bitmap_zalloc(cma_bitmap_maxno(cma), GFP_KERNEL);
Mike Kravetz3a5139f2020-08-11 18:32:03 -0700103 if (!cma->bitmap)
104 goto out_error;
Joonsoo Kima2541292014-08-06 16:05:25 -0700105
David Hildenbrand072355c2021-02-25 17:16:37 -0800106 /*
107 * alloc_contig_range() requires the pfn range specified to be in the
108 * same zone. Simplify by forcing the entire CMA resv range to be in the
109 * same zone.
110 */
111 WARN_ON_ONCE(!pfn_valid(base_pfn));
112 zone = page_zone(pfn_to_page(base_pfn));
113 for (pfn = base_pfn + 1; pfn < base_pfn + cma->count; pfn++) {
114 WARN_ON_ONCE(!pfn_valid(pfn));
115 if (page_zone(pfn_to_page(pfn)) != zone)
116 goto not_in_zone;
117 }
Joonsoo Kimd883c6c2018-05-23 10:18:21 +0900118
David Hildenbrand072355c2021-02-25 17:16:37 -0800119 for (pfn = base_pfn; pfn < base_pfn + cma->count;
120 pfn += pageblock_nr_pages)
121 init_cma_reserved_pageblock(pfn_to_page(pfn));
Joonsoo Kima2541292014-08-06 16:05:25 -0700122
Mike Kravetz0ef7dca2021-05-04 18:34:44 -0700123 spin_lock_init(&cma->lock);
Sasha Levin26b02a12015-04-14 15:44:59 -0700124
125#ifdef CONFIG_CMA_DEBUGFS
126 INIT_HLIST_HEAD(&cma->mem_head);
127 spin_lock_init(&cma->mem_head_lock);
128#endif
129
Mike Kravetz3a5139f2020-08-11 18:32:03 -0700130 return;
Joonsoo Kima2541292014-08-06 16:05:25 -0700131
Joonsoo Kimd883c6c2018-05-23 10:18:21 +0900132not_in_zone:
Yunfeng Ye2184f992019-11-30 17:57:22 -0800133 bitmap_free(cma->bitmap);
Mike Kravetz3a5139f2020-08-11 18:32:03 -0700134out_error:
David Hildenbrand072355c2021-02-25 17:16:37 -0800135 /* Expose all pages to the buddy, they are useless for CMA. */
Hari Bathini27d121d2022-03-22 14:46:14 -0700136 if (!cma->reserve_pages_on_error) {
137 for (pfn = base_pfn; pfn < base_pfn + cma->count; pfn++)
138 free_reserved_page(pfn_to_page(pfn));
139 }
David Hildenbrand072355c2021-02-25 17:16:37 -0800140 totalcma_pages -= cma->count;
Laurent Pinchartf022d8c2014-10-24 13:18:39 +0300141 cma->count = 0;
Mike Kravetz3a5139f2020-08-11 18:32:03 -0700142 pr_err("CMA area %s could not be activated\n", cma->name);
143 return;
Joonsoo Kima2541292014-08-06 16:05:25 -0700144}
145
146static int __init cma_init_reserved_areas(void)
147{
148 int i;
149
Mike Kravetz3a5139f2020-08-11 18:32:03 -0700150 for (i = 0; i < cma_area_count; i++)
151 cma_activate_area(&cma_areas[i]);
Joonsoo Kima2541292014-08-06 16:05:25 -0700152
153 return 0;
154}
Joonsoo Kimd883c6c2018-05-23 10:18:21 +0900155core_initcall(cma_init_reserved_areas);
Joonsoo Kima2541292014-08-06 16:05:25 -0700156
Hari Bathini27d121d2022-03-22 14:46:14 -0700157void __init cma_reserve_pages_on_error(struct cma *cma)
158{
159 cma->reserve_pages_on_error = true;
160}
161
Joonsoo Kima2541292014-08-06 16:05:25 -0700162/**
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700163 * cma_init_reserved_mem() - create custom contiguous area from reserved memory
164 * @base: Base address of the reserved area
165 * @size: Size of the reserved area (in bytes),
166 * @order_per_bit: Order of pages represented by one bit on bitmap.
Mike Rapoporte8b098f2018-04-05 16:24:57 -0700167 * @name: The name of the area. If this parameter is NULL, the name of
168 * the area will be set to "cmaN", where N is a running counter of
169 * used areas.
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700170 * @res_cma: Pointer to store the created cma region.
171 *
172 * This function creates custom contiguous area from already reserved memory.
173 */
174int __init cma_init_reserved_mem(phys_addr_t base, phys_addr_t size,
Sasha Levinac173822015-04-14 15:47:04 -0700175 unsigned int order_per_bit,
Laura Abbottf318dd02017-04-18 11:27:03 -0700176 const char *name,
Sasha Levinac173822015-04-14 15:47:04 -0700177 struct cma **res_cma)
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700178{
179 struct cma *cma;
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700180
181 /* Sanity checks */
182 if (cma_area_count == ARRAY_SIZE(cma_areas)) {
183 pr_err("Not enough slots for CMA reserved regions!\n");
184 return -ENOSPC;
185 }
186
187 if (!size || !memblock_is_region_reserved(base, size))
188 return -EINVAL;
189
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700190 /* alignment should be aligned with order_per_bit */
David Hildenbrande16faf22022-03-22 14:43:17 -0700191 if (!IS_ALIGNED(CMA_MIN_ALIGNMENT_PAGES, 1 << order_per_bit))
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700192 return -EINVAL;
193
David Hildenbrande16faf22022-03-22 14:43:17 -0700194 /* ensure minimal alignment required by mm core */
195 if (!IS_ALIGNED(base | size, CMA_MIN_ALIGNMENT_BYTES))
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700196 return -EINVAL;
197
198 /*
199 * Each reserved area must be initialised later, when more kernel
200 * subsystems (like slab allocator) are available.
201 */
202 cma = &cma_areas[cma_area_count];
Barry Song18e98e52020-08-11 18:31:57 -0700203
204 if (name)
205 snprintf(cma->name, CMA_MAX_NAME, name);
206 else
207 snprintf(cma->name, CMA_MAX_NAME, "cma%d\n", cma_area_count);
208
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700209 cma->base_pfn = PFN_DOWN(base);
210 cma->count = size >> PAGE_SHIFT;
211 cma->order_per_bit = order_per_bit;
212 *res_cma = cma;
213 cma_area_count++;
George G. Davis94737a82015-02-11 15:26:27 -0800214 totalcma_pages += (size / PAGE_SIZE);
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700215
216 return 0;
217}
218
219/**
Aslan Bakirov8676af12020-04-10 14:32:42 -0700220 * cma_declare_contiguous_nid() - reserve custom contiguous area
Joonsoo Kima2541292014-08-06 16:05:25 -0700221 * @base: Base address of the reserved area optional, use 0 for any
Joonsoo Kimc1f733aa2014-08-06 16:05:32 -0700222 * @size: Size of the reserved area (in bytes),
Joonsoo Kima2541292014-08-06 16:05:25 -0700223 * @limit: End address of the reserved memory (optional, 0 for any).
224 * @alignment: Alignment for the CMA area, should be power of 2 or zero
225 * @order_per_bit: Order of pages represented by one bit on bitmap.
Joonsoo Kima2541292014-08-06 16:05:25 -0700226 * @fixed: hint about where to place the reserved area
Mike Rapoporte8b098f2018-04-05 16:24:57 -0700227 * @name: The name of the area. See function cma_init_reserved_mem()
Joonsoo Kimc1f733aa2014-08-06 16:05:32 -0700228 * @res_cma: Pointer to store the created cma region.
Aslan Bakirov8676af12020-04-10 14:32:42 -0700229 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Joonsoo Kima2541292014-08-06 16:05:25 -0700230 *
231 * This function reserves memory from early allocator. It should be
232 * called by arch specific code once the early allocator (memblock or bootmem)
233 * has been activated and all other subsystems have already allocated/reserved
234 * memory. This function allows to create custom reserved areas.
235 *
236 * If @fixed is true, reserve contiguous area at exactly @base. If false,
237 * reserve in range from @base to @limit.
238 */
Aslan Bakirov8676af12020-04-10 14:32:42 -0700239int __init cma_declare_contiguous_nid(phys_addr_t base,
Joonsoo Kimc1f733aa2014-08-06 16:05:32 -0700240 phys_addr_t size, phys_addr_t limit,
Joonsoo Kima2541292014-08-06 16:05:25 -0700241 phys_addr_t alignment, unsigned int order_per_bit,
Aslan Bakirov8676af12020-04-10 14:32:42 -0700242 bool fixed, const char *name, struct cma **res_cma,
243 int nid)
Joonsoo Kima2541292014-08-06 16:05:25 -0700244{
Marek Szyprowskif7426b92014-10-09 15:26:47 -0700245 phys_addr_t memblock_end = memblock_end_of_DRAM();
Joonsoo Kim6b101e22014-12-10 15:41:12 -0800246 phys_addr_t highmem_start;
Joonsoo Kima2541292014-08-06 16:05:25 -0700247 int ret = 0;
248
Joonsoo Kim6b101e22014-12-10 15:41:12 -0800249 /*
Laura Abbott2dece442017-01-10 13:35:41 -0800250 * We can't use __pa(high_memory) directly, since high_memory
251 * isn't a valid direct map VA, and DEBUG_VIRTUAL will (validly)
252 * complain. Find the boundary by adding one to the last valid
253 * address.
Joonsoo Kim6b101e22014-12-10 15:41:12 -0800254 */
Laura Abbott2dece442017-01-10 13:35:41 -0800255 highmem_start = __pa(high_memory - 1) + 1;
Laurent Pinchart56fa4f62014-10-24 13:18:42 +0300256 pr_debug("%s(size %pa, base %pa, limit %pa alignment %pa)\n",
257 __func__, &size, &base, &limit, &alignment);
Joonsoo Kima2541292014-08-06 16:05:25 -0700258
259 if (cma_area_count == ARRAY_SIZE(cma_areas)) {
260 pr_err("Not enough slots for CMA reserved regions!\n");
261 return -ENOSPC;
262 }
263
264 if (!size)
265 return -EINVAL;
266
267 if (alignment && !is_power_of_2(alignment))
268 return -EINVAL;
269
David Hildenbrande16faf22022-03-22 14:43:17 -0700270 /* Sanitise input arguments. */
271 alignment = max_t(phys_addr_t, alignment, CMA_MIN_ALIGNMENT_BYTES);
Doug Bergerc6333242019-07-16 16:26:24 -0700272 if (fixed && base & (alignment - 1)) {
273 ret = -EINVAL;
274 pr_err("Region at %pa must be aligned to %pa bytes\n",
275 &base, &alignment);
276 goto err;
277 }
Joonsoo Kima2541292014-08-06 16:05:25 -0700278 base = ALIGN(base, alignment);
279 size = ALIGN(size, alignment);
280 limit &= ~(alignment - 1);
281
Laurent Pinchart800a85d2014-10-24 13:18:40 +0300282 if (!base)
283 fixed = false;
284
Joonsoo Kima2541292014-08-06 16:05:25 -0700285 /* size should be aligned with order_per_bit */
286 if (!IS_ALIGNED(size >> PAGE_SHIFT, 1 << order_per_bit))
287 return -EINVAL;
288
Marek Szyprowskif7426b92014-10-09 15:26:47 -0700289 /*
Laurent Pinchart16195dd2014-10-24 13:18:41 +0300290 * If allocating at a fixed base the request region must not cross the
291 * low/high memory boundary.
Marek Szyprowskif7426b92014-10-09 15:26:47 -0700292 */
Laurent Pinchart16195dd2014-10-24 13:18:41 +0300293 if (fixed && base < highmem_start && base + size > highmem_start) {
Marek Szyprowskif7426b92014-10-09 15:26:47 -0700294 ret = -EINVAL;
Laurent Pinchart56fa4f62014-10-24 13:18:42 +0300295 pr_err("Region at %pa defined on low/high memory boundary (%pa)\n",
296 &base, &highmem_start);
Marek Szyprowskif7426b92014-10-09 15:26:47 -0700297 goto err;
298 }
299
Laurent Pinchart16195dd2014-10-24 13:18:41 +0300300 /*
301 * If the limit is unspecified or above the memblock end, its effective
302 * value will be the memblock end. Set it explicitly to simplify further
303 * checks.
304 */
305 if (limit == 0 || limit > memblock_end)
306 limit = memblock_end;
307
Doug Bergerc6333242019-07-16 16:26:24 -0700308 if (base + size > limit) {
309 ret = -EINVAL;
310 pr_err("Size (%pa) of region at %pa exceeds limit (%pa)\n",
311 &size, &base, &limit);
312 goto err;
313 }
314
Joonsoo Kima2541292014-08-06 16:05:25 -0700315 /* Reserve memory */
Laurent Pinchart800a85d2014-10-24 13:18:40 +0300316 if (fixed) {
Joonsoo Kima2541292014-08-06 16:05:25 -0700317 if (memblock_is_region_reserved(base, size) ||
318 memblock_reserve(base, size) < 0) {
319 ret = -EBUSY;
320 goto err;
321 }
322 } else {
Laurent Pinchart16195dd2014-10-24 13:18:41 +0300323 phys_addr_t addr = 0;
324
325 /*
Roman Gushchindf2ff392021-02-25 17:16:33 -0800326 * If there is enough memory, try a bottom-up allocation first.
327 * It will place the new cma area close to the start of the node
328 * and guarantee that the compaction is moving pages out of the
329 * cma area and not into it.
330 * Avoid using first 4GB to not interfere with constrained zones
331 * like DMA/DMA32.
332 */
333#ifdef CONFIG_PHYS_ADDR_T_64BIT
334 if (!memblock_bottom_up() && memblock_end >= SZ_4G + size) {
335 memblock_set_bottom_up(true);
336 addr = memblock_alloc_range_nid(size, alignment, SZ_4G,
337 limit, nid, true);
338 memblock_set_bottom_up(false);
339 }
340#endif
341
Levi Yun148aa872023-01-18 17:05:23 +0900342 /*
343 * All pages in the reserved area must come from the same zone.
344 * If the requested region crosses the low/high memory boundary,
345 * try allocating from high memory first and fall back to low
346 * memory in case of failure.
347 */
348 if (!addr && base < highmem_start && limit > highmem_start) {
349 addr = memblock_alloc_range_nid(size, alignment,
350 highmem_start, limit, nid, true);
351 limit = highmem_start;
352 }
353
Laurent Pinchart16195dd2014-10-24 13:18:41 +0300354 if (!addr) {
Aslan Bakirov8676af12020-04-10 14:32:42 -0700355 addr = memblock_alloc_range_nid(size, alignment, base,
Barry Song40366bd2020-07-03 15:15:24 -0700356 limit, nid, true);
Laurent Pinchart16195dd2014-10-24 13:18:41 +0300357 if (!addr) {
358 ret = -ENOMEM;
359 goto err;
360 }
361 }
362
Thierry Reding620951e2014-12-12 16:58:31 -0800363 /*
364 * kmemleak scans/reads tracked objects for pointers to other
365 * objects but this address isn't mapped and accessible
366 */
Catalin Marinas9099dae2016-10-11 13:55:11 -0700367 kmemleak_ignore_phys(addr);
Laurent Pinchart16195dd2014-10-24 13:18:41 +0300368 base = addr;
Joonsoo Kima2541292014-08-06 16:05:25 -0700369 }
370
Laura Abbottf318dd02017-04-18 11:27:03 -0700371 ret = cma_init_reserved_mem(base, size, order_per_bit, name, res_cma);
Marek Szyprowskide9e14e2014-10-13 15:51:09 -0700372 if (ret)
Peng Fan0d3bd182019-03-05 15:49:50 -0800373 goto free_mem;
Joonsoo Kima2541292014-08-06 16:05:25 -0700374
Laurent Pinchart56fa4f62014-10-24 13:18:42 +0300375 pr_info("Reserved %ld MiB at %pa\n", (unsigned long)size / SZ_1M,
376 &base);
Joonsoo Kima2541292014-08-06 16:05:25 -0700377 return 0;
378
Peng Fan0d3bd182019-03-05 15:49:50 -0800379free_mem:
Mike Rapoport3ecc6832021-11-05 13:43:19 -0700380 memblock_phys_free(base, size);
Joonsoo Kima2541292014-08-06 16:05:25 -0700381err:
Joonsoo Kim0de9d2e2014-08-06 16:05:34 -0700382 pr_err("Failed to reserve %ld MiB\n", (unsigned long)size / SZ_1M);
Joonsoo Kima2541292014-08-06 16:05:25 -0700383 return ret;
384}
385
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800386#ifdef CONFIG_CMA_DEBUG
387static void cma_debug_show_areas(struct cma *cma)
388{
Yue Hu2b59e012019-05-13 17:17:41 -0700389 unsigned long next_zero_bit, next_set_bit, nr_zero;
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800390 unsigned long start = 0;
Yue Hu2b59e012019-05-13 17:17:41 -0700391 unsigned long nr_part, nr_total = 0;
392 unsigned long nbits = cma_bitmap_maxno(cma);
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800393
Mike Kravetz0ef7dca2021-05-04 18:34:44 -0700394 spin_lock_irq(&cma->lock);
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800395 pr_info("number of available pages: ");
396 for (;;) {
Yue Hu2b59e012019-05-13 17:17:41 -0700397 next_zero_bit = find_next_zero_bit(cma->bitmap, nbits, start);
398 if (next_zero_bit >= nbits)
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800399 break;
Yue Hu2b59e012019-05-13 17:17:41 -0700400 next_set_bit = find_next_bit(cma->bitmap, nbits, next_zero_bit);
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800401 nr_zero = next_set_bit - next_zero_bit;
Yue Hu2b59e012019-05-13 17:17:41 -0700402 nr_part = nr_zero << cma->order_per_bit;
403 pr_cont("%s%lu@%lu", nr_total ? "+" : "", nr_part,
404 next_zero_bit);
405 nr_total += nr_part;
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800406 start = next_zero_bit + nr_zero;
407 }
Yue Hu2b59e012019-05-13 17:17:41 -0700408 pr_cont("=> %lu free of %lu total pages\n", nr_total, cma->count);
Mike Kravetz0ef7dca2021-05-04 18:34:44 -0700409 spin_unlock_irq(&cma->lock);
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800410}
411#else
412static inline void cma_debug_show_areas(struct cma *cma) { }
413#endif
414
Joonsoo Kima2541292014-08-06 16:05:25 -0700415/**
416 * cma_alloc() - allocate pages from contiguous area
417 * @cma: Contiguous memory region for which the allocation is performed.
418 * @count: Requested number of pages.
419 * @align: Requested alignment of pages (in PAGE_SIZE order).
Marek Szyprowski65182022018-08-17 15:48:57 -0700420 * @no_warn: Avoid printing message about failed allocation
Joonsoo Kima2541292014-08-06 16:05:25 -0700421 *
422 * This function allocates part of contiguous memory on specific
423 * contiguous memory area.
424 */
Minchan Kim78fa5152021-05-04 18:37:34 -0700425struct page *cma_alloc(struct cma *cma, unsigned long count,
426 unsigned int align, bool no_warn)
Joonsoo Kima2541292014-08-06 16:05:25 -0700427{
Andrew Morton3acaea68042015-11-05 18:50:08 -0800428 unsigned long mask, offset;
429 unsigned long pfn = -1;
430 unsigned long start = 0;
Joonsoo Kima2541292014-08-06 16:05:25 -0700431 unsigned long bitmap_maxno, bitmap_no, bitmap_count;
Minchan Kim78fa5152021-05-04 18:37:34 -0700432 unsigned long i;
Joonsoo Kima2541292014-08-06 16:05:25 -0700433 struct page *page = NULL;
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800434 int ret = -ENOMEM;
Joonsoo Kima2541292014-08-06 16:05:25 -0700435
Jianqun Xu835832b2020-08-11 18:31:54 -0700436 if (!cma || !cma->count || !cma->bitmap)
Minchan Kimbbb26922021-05-04 18:37:19 -0700437 goto out;
Joonsoo Kima2541292014-08-06 16:05:25 -0700438
Minchan Kim78fa5152021-05-04 18:37:34 -0700439 pr_debug("%s(cma %p, count %lu, align %d)\n", __func__, (void *)cma,
Joonsoo Kima2541292014-08-06 16:05:25 -0700440 count, align);
441
442 if (!count)
Minchan Kimbbb26922021-05-04 18:37:19 -0700443 goto out;
Joonsoo Kima2541292014-08-06 16:05:25 -0700444
Liam Mark7bc1aec2021-05-04 18:37:25 -0700445 trace_cma_alloc_start(cma->name, count, align);
446
Joonsoo Kima2541292014-08-06 16:05:25 -0700447 mask = cma_bitmap_aligned_mask(cma, align);
Gregory Fongb5be83e2014-12-12 16:54:48 -0800448 offset = cma_bitmap_aligned_offset(cma, align);
Joonsoo Kima2541292014-08-06 16:05:25 -0700449 bitmap_maxno = cma_bitmap_maxno(cma);
450 bitmap_count = cma_bitmap_pages_to_bits(cma, count);
451
Shiraz Hashim6b36ba52016-11-10 10:46:16 -0800452 if (bitmap_count > bitmap_maxno)
Minchan Kimbbb26922021-05-04 18:37:19 -0700453 goto out;
Shiraz Hashim6b36ba52016-11-10 10:46:16 -0800454
Joonsoo Kima2541292014-08-06 16:05:25 -0700455 for (;;) {
Mike Kravetz0ef7dca2021-05-04 18:34:44 -0700456 spin_lock_irq(&cma->lock);
Gregory Fongb5be83e2014-12-12 16:54:48 -0800457 bitmap_no = bitmap_find_next_zero_area_off(cma->bitmap,
458 bitmap_maxno, start, bitmap_count, mask,
459 offset);
Joonsoo Kima2541292014-08-06 16:05:25 -0700460 if (bitmap_no >= bitmap_maxno) {
Mike Kravetz0ef7dca2021-05-04 18:34:44 -0700461 spin_unlock_irq(&cma->lock);
Joonsoo Kima2541292014-08-06 16:05:25 -0700462 break;
463 }
464 bitmap_set(cma->bitmap, bitmap_no, bitmap_count);
465 /*
466 * It's safe to drop the lock here. We've marked this region for
467 * our exclusive use. If the migration fails we will take the
468 * lock again and unmark it.
469 */
Mike Kravetz0ef7dca2021-05-04 18:34:44 -0700470 spin_unlock_irq(&cma->lock);
Joonsoo Kima2541292014-08-06 16:05:25 -0700471
472 pfn = cma->base_pfn + (bitmap_no << cma->order_per_bit);
Dong Aisheng60a60e32022-05-13 15:11:26 -0700473 mutex_lock(&cma_mutex);
Lucas Stachca96b622017-02-24 14:58:37 -0800474 ret = alloc_contig_range(pfn, pfn + count, MIGRATE_CMA,
Marek Szyprowski65182022018-08-17 15:48:57 -0700475 GFP_KERNEL | (no_warn ? __GFP_NOWARN : 0));
Dong Aisheng60a60e32022-05-13 15:11:26 -0700476 mutex_unlock(&cma_mutex);
Joonsoo Kima2541292014-08-06 16:05:25 -0700477 if (ret == 0) {
478 page = pfn_to_page(pfn);
479 break;
Joonsoo Kima2541292014-08-06 16:05:25 -0700480 }
Joonsoo Kimb7155e72014-08-06 16:05:30 -0700481
Joonsoo Kima2541292014-08-06 16:05:25 -0700482 cma_clear_bitmap(cma, pfn, count);
Joonsoo Kimb7155e72014-08-06 16:05:30 -0700483 if (ret != -EBUSY)
484 break;
485
Joonsoo Kima2541292014-08-06 16:05:25 -0700486 pr_debug("%s(): memory range at %p is busy, retrying\n",
487 __func__, pfn_to_page(pfn));
Liam Mark7bc1aec2021-05-04 18:37:25 -0700488
Minchan Kim3aab8ae2021-05-04 18:37:31 -0700489 trace_cma_alloc_busy_retry(cma->name, pfn, pfn_to_page(pfn),
490 count, align);
Joonsoo Kima2541292014-08-06 16:05:25 -0700491 /* try again with a bit different memory target */
492 start = bitmap_no + mask + 1;
493 }
494
Wenchao Haocb6c33d2022-12-08 22:21:30 +0800495 trace_cma_alloc_finish(cma->name, pfn, page, count, align, ret);
Stefan Strogin99e8ea62015-04-15 16:14:50 -0700496
Andrey Konovalov2813b9c2018-12-28 00:30:57 -0800497 /*
498 * CMA can allocate multiple page blocks, which results in different
499 * blocks being marked with different tags. Reset the tags to ignore
500 * those page blocks.
501 */
502 if (page) {
503 for (i = 0; i < count; i++)
504 page_kasan_tag_reset(page + i);
505 }
506
Marek Szyprowski65182022018-08-17 15:48:57 -0700507 if (ret && !no_warn) {
Minchan Kim78fa5152021-05-04 18:37:34 -0700508 pr_err_ratelimited("%s: %s: alloc failed, req-size: %lu pages, ret: %d\n",
Baolin Wang63f83b32021-05-04 18:37:22 -0700509 __func__, cma->name, count, ret);
Jaewon Kimdbe43d42017-02-24 14:58:50 -0800510 cma_debug_show_areas(cma);
511 }
512
Joonsoo Kima2541292014-08-06 16:05:25 -0700513 pr_debug("%s(): returned %p\n", __func__, page);
Minchan Kimbbb26922021-05-04 18:37:19 -0700514out:
Minchan Kim43ca1062021-05-04 18:37:28 -0700515 if (page) {
Minchan Kimbbb26922021-05-04 18:37:19 -0700516 count_vm_event(CMA_ALLOC_SUCCESS);
Minchan Kim43ca1062021-05-04 18:37:28 -0700517 cma_sysfs_account_success_pages(cma, count);
518 } else {
Minchan Kimbbb26922021-05-04 18:37:19 -0700519 count_vm_event(CMA_ALLOC_FAIL);
Minchan Kim43ca1062021-05-04 18:37:28 -0700520 if (cma)
521 cma_sysfs_account_fail_pages(cma, count);
522 }
Minchan Kimbbb26922021-05-04 18:37:19 -0700523
Joonsoo Kima2541292014-08-06 16:05:25 -0700524 return page;
525}
526
Mike Kravetz9871e2d2021-11-05 13:41:23 -0700527bool cma_pages_valid(struct cma *cma, const struct page *pages,
528 unsigned long count)
529{
530 unsigned long pfn;
531
532 if (!cma || !pages)
533 return false;
534
535 pfn = page_to_pfn(pages);
536
537 if (pfn < cma->base_pfn || pfn >= cma->base_pfn + cma->count) {
538 pr_debug("%s(page %p, count %lu)\n", __func__,
539 (void *)pages, count);
540 return false;
541 }
542
543 return true;
544}
545
Joonsoo Kima2541292014-08-06 16:05:25 -0700546/**
547 * cma_release() - release allocated pages
548 * @cma: Contiguous memory region for which the allocation is performed.
549 * @pages: Allocated pages.
550 * @count: Number of allocated pages.
551 *
Ryohei Suzuki929f92f2019-07-16 16:26:00 -0700552 * This function releases memory allocated by cma_alloc().
Joonsoo Kima2541292014-08-06 16:05:25 -0700553 * It returns false when provided pages do not belong to contiguous area and
554 * true otherwise.
555 */
Minchan Kim78fa5152021-05-04 18:37:34 -0700556bool cma_release(struct cma *cma, const struct page *pages,
557 unsigned long count)
Joonsoo Kima2541292014-08-06 16:05:25 -0700558{
559 unsigned long pfn;
560
Mike Kravetz9871e2d2021-11-05 13:41:23 -0700561 if (!cma_pages_valid(cma, pages, count))
Joonsoo Kima2541292014-08-06 16:05:25 -0700562 return false;
563
Minchan Kim78fa5152021-05-04 18:37:34 -0700564 pr_debug("%s(page %p, count %lu)\n", __func__, (void *)pages, count);
Joonsoo Kima2541292014-08-06 16:05:25 -0700565
566 pfn = page_to_pfn(pages);
567
Joonsoo Kima2541292014-08-06 16:05:25 -0700568 VM_BUG_ON(pfn + count > cma->base_pfn + cma->count);
569
570 free_contig_range(pfn, count);
571 cma_clear_bitmap(cma, pfn, count);
Minchan Kim3aab8ae2021-05-04 18:37:31 -0700572 trace_cma_release(cma->name, pfn, pages, count);
Joonsoo Kima2541292014-08-06 16:05:25 -0700573
574 return true;
575}
Laura Abbotte4231bc2017-04-18 11:27:04 -0700576
577int cma_for_each_area(int (*it)(struct cma *cma, void *data), void *data)
578{
579 int i;
580
581 for (i = 0; i < cma_area_count; i++) {
582 int ret = it(&cma_areas[i], data);
583
584 if (ret)
585 return ret;
586 }
587
588 return 0;
589}