[deliverable/linux.git] / mm / cma_debug.c

/*
 * CMA DebugFS Interface
 *
 * Copyright (c) 2015 Sasha Levin <sasha.levin@oracle.com>
 */


#include <linux/debugfs.h>
#include <linux/cma.h>
#include <linux/list.h>
#include <linux/kernel.h>
#include <linux/slab.h>
#include <linux/mm_types.h>

#include "cma.h"

struct cma_mem {
	struct hlist_node node;
	struct page *p;
	unsigned long n;
};

static struct dentry *cma_debugfs_root;

static int cma_debugfs_get(void *data, u64 *val)
{
	unsigned long *p = data;

	*val = *p;

	return 0;
}

DEFINE_SIMPLE_ATTRIBUTE(cma_debugfs_fops, cma_debugfs_get, NULL, "%llu\n");

static void cma_add_to_cma_mem_list(struct cma *cma, struct cma_mem *mem)
{
	spin_lock(&cma->mem_head_lock);
	hlist_add_head(&mem->node, &cma->mem_head);
	spin_unlock(&cma->mem_head_lock);
}

static struct cma_mem *cma_get_entry_from_list(struct cma *cma)
{
	struct cma_mem *mem = NULL;

	spin_lock(&cma->mem_head_lock);
	if (!hlist_empty(&cma->mem_head)) {
		mem = hlist_entry(cma->mem_head.first, struct cma_mem, node);
		hlist_del_init(&mem->node);
	}
	spin_unlock(&cma->mem_head_lock);

	return mem;
}

static int cma_free_mem(struct cma *cma, int count)
{
	struct cma_mem *mem = NULL;

	while (count) {
		mem = cma_get_entry_from_list(cma);
		if (mem == NULL)
			return 0;

		if (mem->n <= count) {
			cma_release(cma, mem->p, mem->n);
			count -= mem->n;
			kfree(mem);
		} else if (cma->order_per_bit == 0) {
			cma_release(cma, mem->p, count);
			mem->p += count;
			mem->n -= count;
			count = 0;
			cma_add_to_cma_mem_list(cma, mem);
		} else {
			pr_debug("cma: cannot release partial block when order_per_bit != 0\n");
			cma_add_to_cma_mem_list(cma, mem);
			break;
		}
	}

	return 0;

}

static int cma_free_write(void *data, u64 val)
{
	int pages = val;
	struct cma *cma = data;

	return cma_free_mem(cma, pages);
}

DEFINE_SIMPLE_ATTRIBUTE(cma_free_fops, NULL, cma_free_write, "%llu\n");

static int cma_alloc_mem(struct cma *cma, int count)
{
	struct cma_mem *mem;
	struct page *p;

	mem = kzalloc(sizeof(*mem), GFP_KERNEL);
	if (!mem)
		return -ENOMEM;

	p = cma_alloc(cma, count, 0);
	if (!p) {
		kfree(mem);
		return -ENOMEM;
	}

	mem->p = p;
	mem->n = count;

	cma_add_to_cma_mem_list(cma, mem);

	return 0;
}

static int cma_alloc_write(void *data, u64 val)
{
	int pages = val;
	struct cma *cma = data;

	return cma_alloc_mem(cma, pages);
}

DEFINE_SIMPLE_ATTRIBUTE(cma_alloc_fops, NULL, cma_alloc_write, "%llu\n");

static void cma_debugfs_add_one(struct cma *cma, int idx)
{
	struct dentry *tmp;
	char name[16];
	int u32s;

	sprintf(name, "cma-%d", idx);

	tmp = debugfs_create_dir(name, cma_debugfs_root);

	debugfs_create_file("alloc", S_IWUSR, cma_debugfs_root, cma,
				&cma_alloc_fops);

	debugfs_create_file("free", S_IWUSR, cma_debugfs_root, cma,
				&cma_free_fops);

	debugfs_create_file("base_pfn", S_IRUGO, tmp,
				&cma->base_pfn, &cma_debugfs_fops);
	debugfs_create_file("count", S_IRUGO, tmp,
				&cma->count, &cma_debugfs_fops);
	debugfs_create_file("order_per_bit", S_IRUGO, tmp,
				&cma->order_per_bit, &cma_debugfs_fops);

	u32s = DIV_ROUND_UP(cma_bitmap_maxno(cma), BITS_PER_BYTE * sizeof(u32));
	debugfs_create_u32_array("bitmap", S_IRUGO, tmp, (u32*)cma->bitmap, u32s);
}

static int __init cma_debugfs_init(void)
{
	int i;

	cma_debugfs_root = debugfs_create_dir("cma", NULL);
	if (!cma_debugfs_root)
		return -ENOMEM;

	for (i = 0; i < cma_area_count; i++)
		cma_debugfs_add_one(&cma_areas[i], i);

	return 0;
}
late_initcall(cma_debugfs_init);
Commit	Line	Data
28b24c1f SL	1	/*
	2	* CMA DebugFS Interface
	3	*
	4	* Copyright (c) 2015 Sasha Levin <sasha.levin@oracle.com>
	5	*/
	6
	7
	8	#include <linux/debugfs.h>
	9	#include <linux/cma.h>
26b02a1f SL	10	#include <linux/list.h>
	11	#include <linux/kernel.h>
	12	#include <linux/slab.h>
8325330b	13	#include <linux/mm_types.h>
28b24c1f SL	14
	15	#include "cma.h"
	16
26b02a1f SL	17	struct cma_mem {
	18	struct hlist_node node;
	19	struct page *p;
	20	unsigned long n;
	21	};
	22
28b24c1f SL	23	static struct dentry *cma_debugfs_root;
	24
	25	static int cma_debugfs_get(void data, u64 val)
	26	{
	27	unsigned long *p = data;
	28
	29	val = p;
	30
	31	return 0;
	32	}
	33
	34	DEFINE_SIMPLE_ATTRIBUTE(cma_debugfs_fops, cma_debugfs_get, NULL, "%llu\n");
	35
26b02a1f SL	36	static void cma_add_to_cma_mem_list(struct cma cma, struct cma_mem mem)
	37	{
	38	spin_lock(&cma->mem_head_lock);
	39	hlist_add_head(&mem->node, &cma->mem_head);
	40	spin_unlock(&cma->mem_head_lock);
	41	}
	42
8325330b SL	43	static struct cma_mem cma_get_entry_from_list(struct cma cma)
	44	{
	45	struct cma_mem *mem = NULL;
	46
	47	spin_lock(&cma->mem_head_lock);
	48	if (!hlist_empty(&cma->mem_head)) {
	49	mem = hlist_entry(cma->mem_head.first, struct cma_mem, node);
	50	hlist_del_init(&mem->node);
	51	}
	52	spin_unlock(&cma->mem_head_lock);
	53
	54	return mem;
	55	}
	56
	57	static int cma_free_mem(struct cma *cma, int count)
	58	{
	59	struct cma_mem *mem = NULL;
	60
	61	while (count) {
	62	mem = cma_get_entry_from_list(cma);
	63	if (mem == NULL)
	64	return 0;
	65
	66	if (mem->n <= count) {
	67	cma_release(cma, mem->p, mem->n);
	68	count -= mem->n;
	69	kfree(mem);
	70	} else if (cma->order_per_bit == 0) {
	71	cma_release(cma, mem->p, count);
	72	mem->p += count;
	73	mem->n -= count;
	74	count = 0;
	75	cma_add_to_cma_mem_list(cma, mem);
	76	} else {
	77	pr_debug("cma: cannot release partial block when order_per_bit != 0\n");
	78	cma_add_to_cma_mem_list(cma, mem);
	79	break;
	80	}
	81	}
	82
	83	return 0;
	84
	85	}
	86
	87	static int cma_free_write(void *data, u64 val)
	88	{
	89	int pages = val;
	90	struct cma *cma = data;
	91
	92	return cma_free_mem(cma, pages);
	93	}
	94
	95	DEFINE_SIMPLE_ATTRIBUTE(cma_free_fops, NULL, cma_free_write, "%llu\n");
	96
26b02a1f SL	97	static int cma_alloc_mem(struct cma *cma, int count)
	98	{
	99	struct cma_mem *mem;
	100	struct page *p;
	101
	102	mem = kzalloc(sizeof(*mem), GFP_KERNEL);
	103	if (!mem)
	104	return -ENOMEM;
	105
875abdb6	106	p = cma_alloc(cma, count, 0);
26b02a1f SL	107	if (!p) {
	108	kfree(mem);
	109	return -ENOMEM;
	110	}
	111
	112	mem->p = p;
	113	mem->n = count;
	114
	115	cma_add_to_cma_mem_list(cma, mem);
	116
	117	return 0;
	118	}
	119
	120	static int cma_alloc_write(void *data, u64 val)
	121	{
	122	int pages = val;
	123	struct cma *cma = data;
	124
	125	return cma_alloc_mem(cma, pages);
	126	}
	127
	128	DEFINE_SIMPLE_ATTRIBUTE(cma_alloc_fops, NULL, cma_alloc_write, "%llu\n");
	129
28b24c1f SL	130	static void cma_debugfs_add_one(struct cma *cma, int idx)
	131	{
	132	struct dentry *tmp;
	133	char name[16];
	134	int u32s;
	135
	136	sprintf(name, "cma-%d", idx);
	137
	138	tmp = debugfs_create_dir(name, cma_debugfs_root);
	139
26b02a1f SL	140	debugfs_create_file("alloc", S_IWUSR, cma_debugfs_root, cma,
	141	&cma_alloc_fops);
	142
8325330b SL	143	debugfs_create_file("free", S_IWUSR, cma_debugfs_root, cma,
	144	&cma_free_fops);
	145
28b24c1f SL	146	debugfs_create_file("base_pfn", S_IRUGO, tmp,
	147	&cma->base_pfn, &cma_debugfs_fops);
	148	debugfs_create_file("count", S_IRUGO, tmp,
	149	&cma->count, &cma_debugfs_fops);
	150	debugfs_create_file("order_per_bit", S_IRUGO, tmp,
26b02a1f	151	&cma->order_per_bit, &cma_debugfs_fops);
28b24c1f SL	152
	153	u32s = DIV_ROUND_UP(cma_bitmap_maxno(cma), BITS_PER_BYTE * sizeof(u32));
	154	debugfs_create_u32_array("bitmap", S_IRUGO, tmp, (u32*)cma->bitmap, u32s);
	155	}
	156
	157	static int __init cma_debugfs_init(void)
	158	{
	159	int i;
	160
	161	cma_debugfs_root = debugfs_create_dir("cma", NULL);
	162	if (!cma_debugfs_root)
	163	return -ENOMEM;
	164
	165	for (i = 0; i < cma_area_count; i++)
	166	cma_debugfs_add_one(&cma_areas[i], i);
	167
	168	return 0;
	169	}
	170	late_initcall(cma_debugfs_init);