// SPDX-License-Identifier: GPL-2.0 /* * Test module for stress and analyze performance of vmalloc allocator. * (C) 2018 Uladzislau Rezki (Sony) <urezki@gmail.com> */#include <linux/init.h>#include <linux/kernel.h>#include <linux/module.h>#include <linux/vmalloc.h>#include <linux/random.h>#include <linux/kthread.h>#include <linux/moduleparam.h>#include <linux/completion.h>#include <linux/delay.h>#include <linux/mm.h>#include <linux/rcupdate.h>#include <linux/srcu.h>#include <linux/slab.h> #define __param(type, name, init, msg)		\	static type name = init;				\	module_param(name, type, 0444);			\	MODULE_PARM_DESC(name, msg)				\ __param(int, nr_threads, 0,	"Number of workers to perform tests(min: 1 max: USHRT_MAX)"); __param(bool, sequential_test_order, false,	"Use sequential stress tests order"); __param(int, test_repeat_count, 1,	"Set test repeat counter"); __param(int, test_loop_count, 1000000,	"Set test loop counter"); __param(int, nr_pages, 0,	"Set number of pages for fix_size_alloc_test(default: 1)"); __param(bool, use_huge, false,	"Use vmalloc_huge in fix_size_alloc_test"); __param(int, run_test_mask, 7,	"Set tests specified in the mask.\n\n"		"\t\tid: 1,    name: fix_size_alloc_test\n"		"\t\tid: 2,    name: full_fit_alloc_test\n"		"\t\tid: 4,    name: long_busy_list_alloc_test\n"		"\t\tid: 8,    name: random_size_alloc_test\n"		"\t\tid: 16,   name: fix_align_alloc_test\n"		"\t\tid: 32,   name: random_size_align_alloc_test\n"		"\t\tid: 64,   name: align_shift_alloc_test\n"		"\t\tid: 128,  name: pcpu_alloc_test\n"		"\t\tid: 256,  name: kvfree_rcu_1_arg_vmalloc_test\n"		"\t\tid: 512,  name: kvfree_rcu_2_arg_vmalloc_test\n"		"\t\tid: 1024, name: vm_map_ram_test\n"		"\t\tid: 2048, name: no_block_alloc_test\n"		"\t\tid: 4096, name: vrealloc_test\n"		/* Add a new test case description here. */); __param(int, nr_pcpu_objects, 35000,	"Number of pcpu objects to allocate for pcpu_alloc_test"); /* * This is for synchronization of setup phase. */DEFINE_STATIC_SRCU(prepare_for_test_srcu); /* * Completion tracking for worker threads. */static DECLARE_COMPLETION(test_all_done_comp);static atomic_t test_n_undone = ATOMIC_INIT(0); static inline voidtest_report_one_done(void){	if (atomic_dec_and_test(&test_n_undone))		complete(&test_all_done_comp);} static int random_size_align_alloc_test(void){	unsigned long size, align;	unsigned int rnd;	void *ptr;	int i; 	for (i = 0; i < test_loop_count; i++) {		rnd = get_random_u8(); 		/*		 * Maximum 1024 pages, if PAGE_SIZE is 4096.		 */		align = 1 << (rnd % 23); 		/*		 * Maximum 10 pages.		 */		size = ((rnd % 10) + 1) * PAGE_SIZE; 		ptr = __vmalloc_node(size, align, GFP_KERNEL | __GFP_ZERO, 0,				__builtin_return_address(0));		if (!ptr)			return -1; 		vfree(ptr);	} 	return 0;} /* * This test case is supposed to be failed. */static int align_shift_alloc_test(void){	unsigned long align;	void *ptr;	int i; 	for (i = 0; i < BITS_PER_LONG; i++) {		align = 1UL << i; 		ptr = __vmalloc_node(PAGE_SIZE, align, GFP_KERNEL|__GFP_ZERO, 0,				__builtin_return_address(0));		if (!ptr)			return -1; 		vfree(ptr);	} 	return 0;} static int fix_align_alloc_test(void){	void *ptr;	int i; 	for (i = 0; i < test_loop_count; i++) {		ptr = __vmalloc_node(5 * PAGE_SIZE, THREAD_ALIGN << 1,				GFP_KERNEL | __GFP_ZERO, 0,				__builtin_return_address(0));		if (!ptr)			return -1; 		vfree(ptr);	} 	return 0;} static int random_size_alloc_test(void){	unsigned int n;	void *p;	int i; 	for (i = 0; i < test_loop_count; i++) {		n = get_random_u32_inclusive(1, 100);		p = vmalloc(n * PAGE_SIZE); 		if (!p)			return -1; 		*((__u8 *)p) = 1;		vfree(p);	} 	return 0;} static int long_busy_list_alloc_test(void){	void *ptr_1, *ptr_2;	void **ptr;	int rv = -1;	int i; 	ptr = vmalloc(sizeof(void *) * 15000);	if (!ptr)		return rv; 	for (i = 0; i < 15000; i++)		ptr[i] = vmalloc(1 * PAGE_SIZE); 	for (i = 0; i < test_loop_count; i++) {		ptr_1 = vmalloc(100 * PAGE_SIZE);		if (!ptr_1)			goto leave; 		ptr_2 = vmalloc(1 * PAGE_SIZE);		if (!ptr_2) {			vfree(ptr_1);			goto leave;		} 		*((__u8 *)ptr_1) = 0;		*((__u8 *)ptr_2) = 1; 		vfree(ptr_1);		vfree(ptr_2);	} 	/*  Success */	rv = 0; leave:	for (i = 0; i < 15000; i++)		vfree(ptr[i]); 	vfree(ptr);	return rv;} static int full_fit_alloc_test(void){	void **ptr, **junk_ptr, *tmp;	int junk_length;	int rv = -1;	int i; 	junk_length = fls(num_online_cpus());	junk_length *= (32 * 1024 * 1024 / PAGE_SIZE); 	ptr = vmalloc(sizeof(void *) * junk_length);	if (!ptr)		return rv; 	junk_ptr = vmalloc(sizeof(void *) * junk_length);	if (!junk_ptr) {		vfree(ptr);		return rv;	} 	for (i = 0; i < junk_length; i++) {		ptr[i] = vmalloc(1 * PAGE_SIZE);		junk_ptr[i] = vmalloc(1 * PAGE_SIZE);	} 	for (i = 0; i < junk_length; i++)		vfree(junk_ptr[i]); 	for (i = 0; i < test_loop_count; i++) {		tmp = vmalloc(1 * PAGE_SIZE); 		if (!tmp)			goto error; 		*((__u8 *)tmp) = 1;		vfree(tmp);	} 	/* Success */	rv = 0; error:	for (i = 0; i < junk_length; i++)		vfree(ptr[i]); 	vfree(ptr);	vfree(junk_ptr); 	return rv;} static int fix_size_alloc_test(void){	void *ptr;	int i; 	for (i = 0; i < test_loop_count; i++) {		if (use_huge)			ptr = vmalloc_huge((nr_pages > 0 ? nr_pages:1) * PAGE_SIZE, GFP_KERNEL);		else			ptr = vmalloc((nr_pages > 0 ? nr_pages:1) * PAGE_SIZE); 		if (!ptr)			return -1; 		*((__u8 *)ptr) = 0; 		vfree(ptr);	} 	return 0;} static int no_block_alloc_test(void){	void *ptr;	int i; 	for (i = 0; i < test_loop_count; i++) {		bool use_atomic = !!(get_random_u8() % 2);		gfp_t gfp = use_atomic ? GFP_ATOMIC : GFP_NOWAIT;		unsigned long size = (nr_pages > 0 ? nr_pages : 1) * PAGE_SIZE; 		preempt_disable();		ptr = __vmalloc(size, gfp);		preempt_enable(); 		if (!ptr)			return -1; 		*((__u8 *)ptr) = 0;		vfree(ptr);	} 	return 0;} static intpcpu_alloc_test(void){	int rv = 0;#ifndef CONFIG_NEED_PER_CPU_KM	void __percpu **pcpu;	size_t size, align;	int i; 	pcpu = vmalloc(sizeof(void __percpu *) * nr_pcpu_objects);	if (!pcpu)		return -1; 	for (i = 0; i < nr_pcpu_objects; i++) {		size = get_random_u32_inclusive(1, PAGE_SIZE / 4); 		/*		 * Maximum PAGE_SIZE		 */		align = 1 << get_random_u32_inclusive(1, PAGE_SHIFT - 1); 		pcpu[i] = __alloc_percpu(size, align);		if (!pcpu[i])			rv = -1;	} 	for (i = 0; i < nr_pcpu_objects; i++)		free_percpu(pcpu[i]); 	vfree(pcpu);#endif	return rv;} struct test_kvfree_rcu {	struct rcu_head rcu;	unsigned char array[20];}; static intkvfree_rcu_1_arg_vmalloc_test(void){	struct test_kvfree_rcu *p;	int i; 	for (i = 0; i < test_loop_count; i++) {		p = vmalloc(1 * PAGE_SIZE);		if (!p)			return -1; 		p->array[0] = 'a';		kvfree_rcu_mightsleep(p);	} 	return 0;} static intkvfree_rcu_2_arg_vmalloc_test(void){	struct test_kvfree_rcu *p;	int i; 	for (i = 0; i < test_loop_count; i++) {		p = vmalloc(1 * PAGE_SIZE);		if (!p)			return -1; 		p->array[0] = 'a';		kvfree_rcu(p, rcu);	} 	return 0;} static intvm_map_ram_test(void){	unsigned long nr_allocated;	unsigned int map_nr_pages;	unsigned char *v_ptr;	struct page **pages;	int i; 	map_nr_pages = nr_pages > 0 ? nr_pages:1;	pages = kzalloc_objs(struct page *, map_nr_pages);	if (!pages)		return -1; 	nr_allocated = alloc_pages_bulk(GFP_KERNEL, map_nr_pages, pages);	if (nr_allocated != map_nr_pages)		goto cleanup; 	/* Run the test loop. */	for (i = 0; i < test_loop_count; i++) {		v_ptr = vm_map_ram(pages, map_nr_pages, NUMA_NO_NODE);		*v_ptr = 'a';		vm_unmap_ram(v_ptr, map_nr_pages);	} cleanup:	for (i = 0; i < nr_allocated; i++)		__free_page(pages[i]); 	kfree(pages); 	/* 0 indicates success. */	return nr_allocated != map_nr_pages;} static int vrealloc_test(void){	void *ptr, *tmp;	int i; 	for (i = 0; i < test_loop_count; i++) {		int err = -1; 		ptr = vrealloc(NULL, PAGE_SIZE, GFP_KERNEL);		if (!ptr)			return -1; 		*((__u8 *)ptr) = 'a'; 		/* Grow: beyond allocated pages, triggers full realloc. */		tmp = vrealloc(ptr, 4 * PAGE_SIZE, GFP_KERNEL);		if (!tmp)			goto error;		ptr = tmp; 		if (*((__u8 *)ptr) != 'a')			goto error; 		/* Shrink: crosses page boundary, frees tail pages. */		tmp = vrealloc(ptr, PAGE_SIZE, GFP_KERNEL);		if (!tmp)			goto error;		ptr = tmp; 		if (*((__u8 *)ptr) != 'a')			goto error; 		/* Shrink: within same page, no page freeing. */		tmp = vrealloc(ptr, PAGE_SIZE / 2, GFP_KERNEL);		if (!tmp)			goto error;		ptr = tmp; 		if (*((__u8 *)ptr) != 'a')			goto error; 		/* Grow: within allocated page, in-place, no realloc. */		tmp = vrealloc(ptr, PAGE_SIZE, GFP_KERNEL);		if (!tmp)			goto error;		ptr = tmp; 		if (*((__u8 *)ptr) != 'a')			goto error; 		err = 0;error:		vfree(ptr);		if (err)			return err;	} 	return 0;} struct test_case_desc {	const char *test_name;	int (*test_func)(void);	bool xfail;}; static struct test_case_desc test_case_array[] = {	{ "fix_size_alloc_test", fix_size_alloc_test, },	{ "full_fit_alloc_test", full_fit_alloc_test, },	{ "long_busy_list_alloc_test", long_busy_list_alloc_test, },	{ "random_size_alloc_test", random_size_alloc_test, },	{ "fix_align_alloc_test", fix_align_alloc_test, },	{ "random_size_align_alloc_test", random_size_align_alloc_test, },	{ "align_shift_alloc_test", align_shift_alloc_test, true },	{ "pcpu_alloc_test", pcpu_alloc_test, },	{ "kvfree_rcu_1_arg_vmalloc_test", kvfree_rcu_1_arg_vmalloc_test, },

Lines 1–500 of 706. Load more