cma.c 12 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
/*
 * Contiguous Memory Allocator
 *
 * Copyright (c) 2010-2011 by Samsung Electronics.
 * Copyright IBM Corporation, 2013
 * Copyright LG Electronics Inc., 2014
 * Written by:
 *	Marek Szyprowski <m.szyprowski@samsung.com>
 *	Michal Nazarewicz <mina86@mina86.com>
 *	Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
 *	Joonsoo Kim <iamjoonsoo.kim@lge.com>
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License or (at your optional) any later version of the license.
 */

#define pr_fmt(fmt) "cma: " fmt

#ifdef CONFIG_CMA_DEBUG
#ifndef DEBUG
#  define DEBUG
#endif
#endif
26
#define CREATE_TRACE_POINTS
27 28 29 30 31 32 33 34 35

#include <linux/memblock.h>
#include <linux/err.h>
#include <linux/mm.h>
#include <linux/mutex.h>
#include <linux/sizes.h>
#include <linux/slab.h>
#include <linux/log2.h>
#include <linux/cma.h>
36
#include <linux/highmem.h>
37
#include <linux/io.h>
38
#include <trace/events/cma.h>
39

Sasha Levin's avatar
Sasha Levin committed
40 41 42 43
#include "cma.h"

struct cma cma_areas[MAX_CMA_AREAS];
unsigned cma_area_count;
44 45
static DEFINE_MUTEX(cma_mutex);

46
phys_addr_t cma_get_base(const struct cma *cma)
47 48 49 50
{
	return PFN_PHYS(cma->base_pfn);
}

51
unsigned long cma_get_size(const struct cma *cma)
52 53 54 55
{
	return cma->count << PAGE_SHIFT;
}

56 57
static unsigned long cma_bitmap_aligned_mask(const struct cma *cma,
					     int align_order)
58
{
59 60 61
	if (align_order <= cma->order_per_bit)
		return 0;
	return (1UL << (align_order - cma->order_per_bit)) - 1;
62 63
}

64 65 66 67
/*
 * Find a PFN aligned to the specified order and return an offset represented in
 * order_per_bits.
 */
68 69
static unsigned long cma_bitmap_aligned_offset(const struct cma *cma,
					       int align_order)
70 71 72
{
	if (align_order <= cma->order_per_bit)
		return 0;
73 74 75

	return (ALIGN(cma->base_pfn, (1UL << align_order))
		- cma->base_pfn) >> cma->order_per_bit;
76 77
}

78 79
static unsigned long cma_bitmap_pages_to_bits(const struct cma *cma,
					      unsigned long pages)
80 81 82 83
{
	return ALIGN(pages, 1UL << cma->order_per_bit) >> cma->order_per_bit;
}

84 85
static void cma_clear_bitmap(struct cma *cma, unsigned long pfn,
			     unsigned int count)
86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130
{
	unsigned long bitmap_no, bitmap_count;

	bitmap_no = (pfn - cma->base_pfn) >> cma->order_per_bit;
	bitmap_count = cma_bitmap_pages_to_bits(cma, count);

	mutex_lock(&cma->lock);
	bitmap_clear(cma->bitmap, bitmap_no, bitmap_count);
	mutex_unlock(&cma->lock);
}

static int __init cma_activate_area(struct cma *cma)
{
	int bitmap_size = BITS_TO_LONGS(cma_bitmap_maxno(cma)) * sizeof(long);
	unsigned long base_pfn = cma->base_pfn, pfn = base_pfn;
	unsigned i = cma->count >> pageblock_order;
	struct zone *zone;

	cma->bitmap = kzalloc(bitmap_size, GFP_KERNEL);

	if (!cma->bitmap)
		return -ENOMEM;

	WARN_ON_ONCE(!pfn_valid(pfn));
	zone = page_zone(pfn_to_page(pfn));

	do {
		unsigned j;

		base_pfn = pfn;
		for (j = pageblock_nr_pages; j; --j, pfn++) {
			WARN_ON_ONCE(!pfn_valid(pfn));
			/*
			 * alloc_contig_range requires the pfn range
			 * specified to be in the same zone. Make this
			 * simple by forcing the entire CMA resv range
			 * to be in the same zone.
			 */
			if (page_zone(pfn_to_page(pfn)) != zone)
				goto err;
		}
		init_cma_reserved_pageblock(pfn_to_page(base_pfn));
	} while (--i);

	mutex_init(&cma->lock);
Sasha Levin's avatar
Sasha Levin committed
131 132 133 134 135 136

#ifdef CONFIG_CMA_DEBUGFS
	INIT_HLIST_HEAD(&cma->mem_head);
	spin_lock_init(&cma->mem_head_lock);
#endif

137 138 139 140
	return 0;

err:
	kfree(cma->bitmap);
141
	cma->count = 0;
142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159
	return -EINVAL;
}

static int __init cma_init_reserved_areas(void)
{
	int i;

	for (i = 0; i < cma_area_count; i++) {
		int ret = cma_activate_area(&cma_areas[i]);

		if (ret)
			return ret;
	}

	return 0;
}
core_initcall(cma_init_reserved_areas);

160 161 162 163 164 165 166 167 168 169
/**
 * cma_init_reserved_mem() - create custom contiguous area from reserved memory
 * @base: Base address of the reserved area
 * @size: Size of the reserved area (in bytes),
 * @order_per_bit: Order of pages represented by one bit on bitmap.
 * @res_cma: Pointer to store the created cma region.
 *
 * This function creates custom contiguous area from already reserved memory.
 */
int __init cma_init_reserved_mem(phys_addr_t base, phys_addr_t size,
170 171
				 unsigned int order_per_bit,
				 struct cma **res_cma)
172 173 174 175 176 177 178 179 180 181 182 183 184
{
	struct cma *cma;
	phys_addr_t alignment;

	/* Sanity checks */
	if (cma_area_count == ARRAY_SIZE(cma_areas)) {
		pr_err("Not enough slots for CMA reserved regions!\n");
		return -ENOSPC;
	}

	if (!size || !memblock_is_region_reserved(base, size))
		return -EINVAL;

185
	/* ensure minimal alignment required by mm core */
186 187
	alignment = PAGE_SIZE <<
			max_t(unsigned long, MAX_ORDER - 1, pageblock_order);
188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205

	/* alignment should be aligned with order_per_bit */
	if (!IS_ALIGNED(alignment >> PAGE_SHIFT, 1 << order_per_bit))
		return -EINVAL;

	if (ALIGN(base, alignment) != base || ALIGN(size, alignment) != size)
		return -EINVAL;

	/*
	 * Each reserved area must be initialised later, when more kernel
	 * subsystems (like slab allocator) are available.
	 */
	cma = &cma_areas[cma_area_count];
	cma->base_pfn = PFN_DOWN(base);
	cma->count = size >> PAGE_SHIFT;
	cma->order_per_bit = order_per_bit;
	*res_cma = cma;
	cma_area_count++;
206
	totalcma_pages += (size / PAGE_SIZE);
207 208 209 210

	return 0;
}

211 212 213
/**
 * cma_declare_contiguous() - reserve custom contiguous area
 * @base: Base address of the reserved area optional, use 0 for any
214
 * @size: Size of the reserved area (in bytes),
215 216 217 218
 * @limit: End address of the reserved memory (optional, 0 for any).
 * @alignment: Alignment for the CMA area, should be power of 2 or zero
 * @order_per_bit: Order of pages represented by one bit on bitmap.
 * @fixed: hint about where to place the reserved area
219
 * @res_cma: Pointer to store the created cma region.
220 221 222 223 224 225 226 227 228
 *
 * This function reserves memory from early allocator. It should be
 * called by arch specific code once the early allocator (memblock or bootmem)
 * has been activated and all other subsystems have already allocated/reserved
 * memory. This function allows to create custom reserved areas.
 *
 * If @fixed is true, reserve contiguous area at exactly @base.  If false,
 * reserve in range from @base to @limit.
 */
229 230
int __init cma_declare_contiguous(phys_addr_t base,
			phys_addr_t size, phys_addr_t limit,
231
			phys_addr_t alignment, unsigned int order_per_bit,
232
			bool fixed, struct cma **res_cma)
233
{
234
	phys_addr_t memblock_end = memblock_end_of_DRAM();
235
	phys_addr_t highmem_start;
236 237
	int ret = 0;

238
	/*
Laura Abbott's avatar
Laura Abbott committed
239 240 241 242
	 * We can't use __pa(high_memory) directly, since high_memory
	 * isn't a valid direct map VA, and DEBUG_VIRTUAL will (validly)
	 * complain. Find the boundary by adding one to the last valid
	 * address.
243
	 */
Laura Abbott's avatar
Laura Abbott committed
244
	highmem_start = __pa(high_memory - 1) + 1;
245 246
	pr_debug("%s(size %pa, base %pa, limit %pa alignment %pa)\n",
		__func__, &size, &base, &limit, &alignment);
247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264

	if (cma_area_count == ARRAY_SIZE(cma_areas)) {
		pr_err("Not enough slots for CMA reserved regions!\n");
		return -ENOSPC;
	}

	if (!size)
		return -EINVAL;

	if (alignment && !is_power_of_2(alignment))
		return -EINVAL;

	/*
	 * Sanitise input arguments.
	 * Pages both ends in CMA area could be merged into adjacent unmovable
	 * migratetype page by page allocator's buddy algorithm. In the case,
	 * you couldn't get a contiguous memory, which is not what we want.
	 */
265 266
	alignment = max(alignment,  (phys_addr_t)PAGE_SIZE <<
			  max_t(unsigned long, MAX_ORDER - 1, pageblock_order));
267 268 269 270
	base = ALIGN(base, alignment);
	size = ALIGN(size, alignment);
	limit &= ~(alignment - 1);

271 272 273
	if (!base)
		fixed = false;

274 275 276 277
	/* size should be aligned with order_per_bit */
	if (!IS_ALIGNED(size >> PAGE_SHIFT, 1 << order_per_bit))
		return -EINVAL;

278
	/*
279 280
	 * If allocating at a fixed base the request region must not cross the
	 * low/high memory boundary.
281
	 */
282
	if (fixed && base < highmem_start && base + size > highmem_start) {
283
		ret = -EINVAL;
284 285
		pr_err("Region at %pa defined on low/high memory boundary (%pa)\n",
			&base, &highmem_start);
286 287 288
		goto err;
	}

289 290 291 292 293 294 295 296
	/*
	 * If the limit is unspecified or above the memblock end, its effective
	 * value will be the memblock end. Set it explicitly to simplify further
	 * checks.
	 */
	if (limit == 0 || limit > memblock_end)
		limit = memblock_end;

297
	/* Reserve memory */
298
	if (fixed) {
299 300 301 302 303 304
		if (memblock_is_region_reserved(base, size) ||
		    memblock_reserve(base, size) < 0) {
			ret = -EBUSY;
			goto err;
		}
	} else {
305 306 307 308 309 310 311 312 313 314
		phys_addr_t addr = 0;

		/*
		 * All pages in the reserved area must come from the same zone.
		 * If the requested region crosses the low/high memory boundary,
		 * try allocating from high memory first and fall back to low
		 * memory in case of failure.
		 */
		if (base < highmem_start && limit > highmem_start) {
			addr = memblock_alloc_range(size, alignment,
315 316
						    highmem_start, limit,
						    MEMBLOCK_NONE);
317 318 319
			limit = highmem_start;
		}

320
		if (!addr) {
321
			addr = memblock_alloc_range(size, alignment, base,
322 323
						    limit,
						    MEMBLOCK_NONE);
324 325 326 327
			if (!addr) {
				ret = -ENOMEM;
				goto err;
			}
328
		}
329

330 331 332 333
		/*
		 * kmemleak scans/reads tracked objects for pointers to other
		 * objects but this address isn't mapped and accessible
		 */
334
		kmemleak_ignore_phys(addr);
335
		base = addr;
336 337
	}

338 339 340
	ret = cma_init_reserved_mem(base, size, order_per_bit, res_cma);
	if (ret)
		goto err;
341

342 343
	pr_info("Reserved %ld MiB at %pa\n", (unsigned long)size / SZ_1M,
		&base);
344 345 346
	return 0;

err:
Joonsoo Kim's avatar
Joonsoo Kim committed
347
	pr_err("Failed to reserve %ld MiB\n", (unsigned long)size / SZ_1M);
348 349 350 351 352 353 354 355 356 357 358 359
	return ret;
}

/**
 * cma_alloc() - allocate pages from contiguous area
 * @cma:   Contiguous memory region for which the allocation is performed.
 * @count: Requested number of pages.
 * @align: Requested alignment of pages (in PAGE_SIZE order).
 *
 * This function allocates part of contiguous memory on specific
 * contiguous memory area.
 */
360
struct page *cma_alloc(struct cma *cma, size_t count, unsigned int align)
361
{
Andrew Morton's avatar
Andrew Morton committed
362 363 364
	unsigned long mask, offset;
	unsigned long pfn = -1;
	unsigned long start = 0;
365 366 367 368 369 370 371
	unsigned long bitmap_maxno, bitmap_no, bitmap_count;
	struct page *page = NULL;
	int ret;

	if (!cma || !cma->count)
		return NULL;

372
	pr_debug("%s(cma %p, count %zu, align %d)\n", __func__, (void *)cma,
373 374 375 376 377 378
		 count, align);

	if (!count)
		return NULL;

	mask = cma_bitmap_aligned_mask(cma, align);
379
	offset = cma_bitmap_aligned_offset(cma, align);
380 381 382
	bitmap_maxno = cma_bitmap_maxno(cma);
	bitmap_count = cma_bitmap_pages_to_bits(cma, count);

383 384 385
	if (bitmap_count > bitmap_maxno)
		return NULL;

386 387
	for (;;) {
		mutex_lock(&cma->lock);
388 389 390
		bitmap_no = bitmap_find_next_zero_area_off(cma->bitmap,
				bitmap_maxno, start, bitmap_count, mask,
				offset);
391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410
		if (bitmap_no >= bitmap_maxno) {
			mutex_unlock(&cma->lock);
			break;
		}
		bitmap_set(cma->bitmap, bitmap_no, bitmap_count);
		/*
		 * It's safe to drop the lock here. We've marked this region for
		 * our exclusive use. If the migration fails we will take the
		 * lock again and unmark it.
		 */
		mutex_unlock(&cma->lock);

		pfn = cma->base_pfn + (bitmap_no << cma->order_per_bit);
		mutex_lock(&cma_mutex);
		ret = alloc_contig_range(pfn, pfn + count, MIGRATE_CMA);
		mutex_unlock(&cma_mutex);
		if (ret == 0) {
			page = pfn_to_page(pfn);
			break;
		}
411

412
		cma_clear_bitmap(cma, pfn, count);
413 414 415
		if (ret != -EBUSY)
			break;

416 417 418 419 420 421
		pr_debug("%s(): memory range at %p is busy, retrying\n",
			 __func__, pfn_to_page(pfn));
		/* try again with a bit different memory target */
		start = bitmap_no + mask + 1;
	}

Andrew Morton's avatar
Andrew Morton committed
422
	trace_cma_alloc(pfn, page, count, align);
423

424 425 426 427 428 429 430 431 432 433 434 435 436 437
	pr_debug("%s(): returned %p\n", __func__, page);
	return page;
}

/**
 * cma_release() - release allocated pages
 * @cma:   Contiguous memory region for which the allocation is performed.
 * @pages: Allocated pages.
 * @count: Number of allocated pages.
 *
 * This function releases memory allocated by alloc_cma().
 * It returns false when provided pages do not belong to contiguous area and
 * true otherwise.
 */
438
bool cma_release(struct cma *cma, const struct page *pages, unsigned int count)
439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455
{
	unsigned long pfn;

	if (!cma || !pages)
		return false;

	pr_debug("%s(page %p)\n", __func__, (void *)pages);

	pfn = page_to_pfn(pages);

	if (pfn < cma->base_pfn || pfn >= cma->base_pfn + cma->count)
		return false;

	VM_BUG_ON(pfn + count > cma->base_pfn + cma->count);

	free_contig_range(pfn, count);
	cma_clear_bitmap(cma, pfn, count);
456
	trace_cma_release(pfn, pages, count);
457 458 459

	return true;
}