[net-next-2.6.git] / drivers / staging / dt3155 / allocator.c

/*
 * allocator.c -- allocate after high_memory, if available
 *
 * NOTE: this is different from my previous allocator, the one that
 *       assembles pages, which revealed itself both slow and unreliable.
 *
 * Copyright (C) 1998   rubini@linux.it (Alessandro Rubini)
 *
 *   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 option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program; if not, write to the Free Software
 *   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *

-- Changes --

  Date	      Programmer  Description of changes made
  -------------------------------------------------------------------
  02-Aug-2002 NJC         allocator now steps in 1MB increments, rather
			  than doubling its size each time.
			  Also, allocator_init(u32 *) now returns
			  (in the first arg) the size of the free
			  space.  This is no longer consistent with
			  using the allocator as a module, and some changes
			  may be necessary for that purpose.  This was
			  designed to work with the DT3155 driver, in
			  stand alone mode only!!!
  26-Oct-2009 SS	  Port to 2.6.30 kernel.
 */


#ifndef __KERNEL__
#  define __KERNEL__
#endif
#ifndef MODULE
#  define MODULE
#endif

#include <linux/version.h>

#include <linux/sched.h>
#include <linux/kernel.h>
#include <linux/fs.h>
#include <linux/proc_fs.h>
#include <linux/errno.h>
#include <linux/types.h>
#include <linux/mm.h>	/* PAGE_ALIGN() */
#include <linux/io.h>
#include <linux/slab.h>

#include <asm/page.h>

/*#define ALL_DEBUG*/
#define ALL_MSG "allocator: "

#undef PDEBUG             /* undef it, just in case */
#ifdef ALL_DEBUG
#  define __static
#  define DUMP_LIST() dump_list()
#  ifdef __KERNEL__
     /* This one if debugging is on, and kernel space */
#    define PDEBUG(fmt, args...) printk(KERN_DEBUG ALL_MSG fmt, ## args)
#  else
     /* This one for user space */
#    define PDEBUG(fmt, args...) fprintf(stderr, fmt, ## args)
#  endif
#else
#  define PDEBUG(fmt, args...) /* not debugging: nothing */
#  define DUMP_LIST()
#  define __static static
#endif

#undef PDEBUGG
#define PDEBUGG(fmt, args...)
/*#define PDEBUGG(fmt, args...) printk( KERN_DEBUG ALL_MSG fmt, ## args)*/


int allocator_himem = 1; /* 0 = probe, pos. = megs, neg. = disable   */
int allocator_step = 1;  /* This is the step size in MB              */
int allocator_probe = 1; /* This is a flag -- 1=probe, 0=don't probe */

static unsigned long allocator_buffer;		/* physical address */
static unsigned long allocator_buffer_size;	/* kilobytes */

/*
 * The allocator keeps a list of DMA areas, so multiple devices
 * can coexist. The list is kept sorted by address
 */

struct allocator_struct {
	unsigned long address;
	unsigned long size;
	struct allocator_struct *next;
};

struct allocator_struct *allocator_list;


#ifdef ALL_DEBUG
static int dump_list(void)
{
	struct allocator_struct *ptr;

	PDEBUG("Current list:\n");
	for (ptr = allocator_list; ptr; ptr = ptr->next)
		PDEBUG("0x%08lx (size %likB)\n", ptr->address, ptr->size>>10);
	return 0;
}
#endif

/* ========================================================================
 * This function is the actual allocator.
 *
 * If space is available in high memory (as detected at load time), that
 * one is returned. The return value is a physical address (i.e., it can
 * be used straight ahead for DMA, but needs remapping for program use).
 */

unsigned long allocator_allocate_dma(unsigned long kilobytes, int prio)
{
	struct allocator_struct *ptr = allocator_list, *newptr;
	unsigned long bytes = kilobytes << 10;

	/* check if high memory is available */
	if (!allocator_buffer)
		return 0;

	/* Round it to a multiple of the pagesize */
	bytes = PAGE_ALIGN(bytes);
	PDEBUG("request for %li bytes\n", bytes);

	while (ptr && ptr->next) {
		if (ptr->next->address - (ptr->address + ptr->size) >= bytes)
			break; /* enough space */
		ptr = ptr->next;
	}
	if (!ptr->next) {
		DUMP_LIST();
		PDEBUG("alloc failed\n");
		return 0; /* end of list */
	}
	newptr = kmalloc(sizeof(struct allocator_struct), prio);
	if (!newptr)
		return 0;

	/* ok, now stick it after ptr */
	newptr->address = ptr->address + ptr->size;
	newptr->size = bytes;
	newptr->next = ptr->next;
	ptr->next = newptr;

	DUMP_LIST();
	PDEBUG("returning 0x%08lx\n", newptr->address);
	return newptr->address;
}

int allocator_free_dma(unsigned long address)
{
	struct allocator_struct *ptr = allocator_list, *prev;

	while (ptr && ptr->next) {
		if (ptr->next->address == address)
			break;
		ptr = ptr->next;
	}
	/* the one being freed is ptr->next */
	prev = ptr; ptr = ptr->next;

	if (!ptr) {
		printk(KERN_ERR ALL_MSG
			"free_dma(0x%08lx) but add. not allocated\n",
			ptr->address);
		return -EINVAL;
	}
	PDEBUGG("freeing: %08lx (%li) next %08lx\n", ptr->address, ptr->size,
		ptr->next->address);
	prev->next = ptr->next;
	kfree(ptr);

	/* dump_list(); */
	return 0;
}

/* ========================================================================
 * Init and cleanup
 *
 * On cleanup everything is released. If the list is not empty, that a
 * problem of our clients
 */
int allocator_init(u32 *allocator_max)
{
	/* check how much free memory is there */
	void *remapped;
	unsigned long max;
	unsigned long trial_size = allocator_himem<<20;
	unsigned long last_trial = 0;
	unsigned long step = allocator_step<<20;
	unsigned long i = 0;
	struct allocator_struct *head, *tail;
	char test_string[] = "0123456789abcde"; /* 16 bytes */

	PDEBUGG("himem = %i\n", allocator_himem);
	if (allocator_himem < 0) /* don't even try */
		return -EINVAL;

	if (!trial_size)
		trial_size = 1<<20; /* not specified: try one meg */

	while (1) {
		remapped = ioremap(__pa(high_memory), trial_size);
		if (!remapped) {
			PDEBUGG("%li megs failed!\n", trial_size>>20);
			break;
		}
		PDEBUGG("Trying %li megs (at %p, %p)\n", trial_size>>20,
			(void *)__pa(high_memory), remapped);
		for (i = last_trial; i < trial_size; i += 16) {
			strcpy((char *)(remapped)+i, test_string);
			if (strcmp((char *)(remapped)+i, test_string))
				break;
			}
		iounmap((void *)remapped);
		schedule();
		last_trial = trial_size;
		if (i == trial_size)
			trial_size += step; /* increment, if all went well */
		else {
			PDEBUGG("%li megs copy test failed!\n", trial_size>>20);
			break;
		}
		if (!allocator_probe)
			break;
	}
	PDEBUG("%li megs (%li k, %li b)\n", i>>20, i>>10, i);
	allocator_buffer_size = i>>10; /* kilobytes */
	allocator_buffer = __pa(high_memory);
	if (!allocator_buffer_size) {
		printk(KERN_WARNING ALL_MSG "no free high memory to use\n");
		return -ENOMEM;
	}

	/*
	* to simplify things, always have two cells in the list:
	* the first and the last. This avoids some conditionals and
	* extra code when allocating and deallocating: we only play
	* in the middle of the list
	*/
	head = kmalloc(sizeof(struct allocator_struct), GFP_KERNEL);
	if (!head)
		return -ENOMEM;
	tail = kmalloc(sizeof(struct allocator_struct), GFP_KERNEL);
	if (!tail) {
		kfree(head);
		return -ENOMEM;
	}

	max = allocator_buffer_size<<10;

	head->size = tail->size = 0;
	head->address = allocator_buffer;
	tail->address = allocator_buffer + max;
	head->next = tail;
	tail->next = NULL;
	allocator_list = head;

	/* Back to the user code, in KB */
	*allocator_max = allocator_buffer_size;

	return 0; /* ok, ready */
}

void allocator_cleanup(void)
{
	struct allocator_struct *ptr, *next;

	for (ptr = allocator_list; ptr; ptr = next) {
		next = ptr->next;
		PDEBUG("freeing list: 0x%08lx\n", ptr->address);
		kfree(ptr);
	}

	allocator_buffer      = 0;
	allocator_buffer_size = 0;
	allocator_list = NULL;
}
Commit	Line	Data
aa337ef1 SS	1	/*
	2	* allocator.c -- allocate after high_memory, if available
	3	*
	4	* NOTE: this is different from my previous allocator, the one that
	5	* assembles pages, which revealed itself both slow and unreliable.
	6	*
	7	* Copyright (C) 1998 rubini@linux.it (Alessandro Rubini)
	8	*
	9	* This program is free software; you can redistribute it and/or modify
	10	* it under the terms of the GNU General Public License as published by
	11	* the Free Software Foundation; either version 2 of the License, or
	12	* (at your option) any later version.
	13	*
	14	* This program is distributed in the hope that it will be useful,
	15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	17	* GNU General Public License for more details.
	18	*
	19	* You should have received a copy of the GNU General Public License
	20	* along with this program; if not, write to the Free Software
	21	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
	22	*
	23
	24	-- Changes --
	25
	26	Date Programmer Description of changes made
	27	-------------------------------------------------------------------
	28	02-Aug-2002 NJC allocator now steps in 1MB increments, rather
1769fd86	29	than doubling its size each time.
dcff74ce	30	Also, allocator_init(u32 *) now returns
aa337ef1 SS	31	(in the first arg) the size of the free
	32	space. This is no longer consistent with
	33	using the allocator as a module, and some changes
	34	may be necessary for that purpose. This was
	35	designed to work with the DT3155 driver, in
	36	stand alone mode only!!!
	37	26-Oct-2009 SS Port to 2.6.30 kernel.
	38	*/
	39
	40
	41	#ifndef __KERNEL__
	42	# define __KERNEL__
	43	#endif
	44	#ifndef MODULE
	45	# define MODULE
	46	#endif
	47
	48	#include <linux/version.h>
	49
	50	#include <linux/sched.h>
	51	#include <linux/kernel.h>
	52	#include <linux/fs.h>
	53	#include <linux/proc_fs.h>
	54	#include <linux/errno.h>
	55	#include <linux/types.h>
	56	#include <linux/mm.h> /* PAGE_ALIGN() */
2141ec62	57	#include <linux/io.h>
5a0e3ad6	58	#include <linux/slab.h>
aa337ef1 SS	59
	60	#include <asm/page.h>
	61
aa337ef1 SS	62	/#define ALL_DEBUG/
	63	#define ALL_MSG "allocator: "
	64
	65	#undef PDEBUG /* undef it, just in case */
	66	#ifdef ALL_DEBUG
	67	# define __static
	68	# define DUMP_LIST() dump_list()
	69	# ifdef __KERNEL__
	70	/* This one if debugging is on, and kernel space */
1769fd86	71	# define PDEBUG(fmt, args...) printk(KERN_DEBUG ALL_MSG fmt, ## args)
aa337ef1 SS	72	# else
	73	/* This one for user space */
	74	# define PDEBUG(fmt, args...) fprintf(stderr, fmt, ## args)
	75	# endif
	76	#else
	77	# define PDEBUG(fmt, args...) /* not debugging: nothing */
	78	# define DUMP_LIST()
	79	# define __static static
	80	#endif
	81
	82	#undef PDEBUGG
	83	#define PDEBUGG(fmt, args...)
	84	/#define PDEBUGG(fmt, args...) printk( KERN_DEBUG ALL_MSG fmt, ## args)/
	85
	86
	87	int allocator_himem = 1; /* 0 = probe, pos. = megs, neg. = disable */
	88	int allocator_step = 1; /* This is the step size in MB */
	89	int allocator_probe = 1; /* This is a flag -- 1=probe, 0=don't probe */
	90
1769fd86 GKH	91	static unsigned long allocator_buffer; /* physical address */
1769fd86 GKH	92	static unsigned long allocator_buffer_size; /* kilobytes */
aa337ef1 SS	93
	94	/*
	95	* The allocator keeps a list of DMA areas, so multiple devices
	96	* can coexist. The list is kept sorted by address
	97	*/
	98
	99	struct allocator_struct {
1769fd86 GKH	100	unsigned long address;
	101	unsigned long size;
	102	struct allocator_struct *next;
aa337ef1 SS	103	};
aa337ef1 SS	104
1769fd86	105	struct allocator_struct *allocator_list;
aa337ef1 SS	106
	107
	108	#ifdef ALL_DEBUG
	109	static int dump_list(void)
	110	{
1769fd86	111	struct allocator_struct *ptr;
aa337ef1	112
1769fd86 GKH	113	PDEBUG("Current list:\n");
	114	for (ptr = allocator_list; ptr; ptr = ptr->next)
	115	PDEBUG("0x%08lx (size %likB)\n", ptr->address, ptr->size>>10);
	116	return 0;
aa337ef1 SS	117	}
	118	#endif
	119
	120	/* ========================================================================
	121	* This function is the actual allocator.
	122	*
	123	* If space is available in high memory (as detected at load time), that
	124	* one is returned. The return value is a physical address (i.e., it can
	125	* be used straight ahead for DMA, but needs remapping for program use).
	126	*/
	127
1769fd86	128	unsigned long allocator_allocate_dma(unsigned long kilobytes, int prio)
aa337ef1	129	{
1769fd86 GKH	130	struct allocator_struct ptr = allocator_list, newptr;
	131	unsigned long bytes = kilobytes << 10;
	132
	133	/* check if high memory is available */
	134	if (!allocator_buffer)
	135	return 0;
	136
	137	/* Round it to a multiple of the pagesize */
	138	bytes = PAGE_ALIGN(bytes);
	139	PDEBUG("request for %li bytes\n", bytes);
	140
	141	while (ptr && ptr->next) {
	142	if (ptr->next->address - (ptr->address + ptr->size) >= bytes)
	143	break; /* enough space */
	144	ptr = ptr->next;
	145	}
	146	if (!ptr->next) {
	147	DUMP_LIST();
	148	PDEBUG("alloc failed\n");
	149	return 0; /* end of list */
	150	}
	151	newptr = kmalloc(sizeof(struct allocator_struct), prio);
	152	if (!newptr)
	153	return 0;
	154
	155	/* ok, now stick it after ptr */
	156	newptr->address = ptr->address + ptr->size;
	157	newptr->size = bytes;
	158	newptr->next = ptr->next;
	159	ptr->next = newptr;
	160
	161	DUMP_LIST();
	162	PDEBUG("returning 0x%08lx\n", newptr->address);
	163	return newptr->address;
aa337ef1 SS	164	}
aa337ef1 SS	165
1769fd86	166	int allocator_free_dma(unsigned long address)
aa337ef1	167	{
1769fd86	168	struct allocator_struct ptr = allocator_list, prev;
aa337ef1	169
1769fd86 GKH	170	while (ptr && ptr->next) {
	171	if (ptr->next->address == address)
	172	break;
	173	ptr = ptr->next;
	174	}
	175	/* the one being freed is ptr->next */
	176	prev = ptr; ptr = ptr->next;
	177
	178	if (!ptr) {
	179	printk(KERN_ERR ALL_MSG
	180	"free_dma(0x%08lx) but add. not allocated\n",
	181	ptr->address);
	182	return -EINVAL;
aa337ef1	183	}
1769fd86 GKH	184	PDEBUGG("freeing: %08lx (%li) next %08lx\n", ptr->address, ptr->size,
	185	ptr->next->address);
	186	prev->next = ptr->next;
	187	kfree(ptr);
	188
	189	/* dump_list(); */
	190	return 0;
aa337ef1 SS	191	}
	192
	193	/* ========================================================================
	194	* Init and cleanup
	195	*
	196	* On cleanup everything is released. If the list is not empty, that a
	197	* problem of our clients
	198	*/
3a8954e8	199	int allocator_init(u32 *allocator_max)
aa337ef1	200	{
1769fd86 GKH	201	/* check how much free memory is there */
	202	void *remapped;
	203	unsigned long max;
	204	unsigned long trial_size = allocator_himem<<20;
	205	unsigned long last_trial = 0;
	206	unsigned long step = allocator_step<<20;
	207	unsigned long i = 0;
	208	struct allocator_struct head, tail;
	209	char test_string[] = "0123456789abcde"; /* 16 bytes */
	210
	211	PDEBUGG("himem = %i\n", allocator_himem);
	212	if (allocator_himem < 0) /* don't even try */
	213	return -EINVAL;
	214
	215	if (!trial_size)
	216	trial_size = 1<<20; /* not specified: try one meg */
	217
	218	while (1) {
	219	remapped = ioremap(__pa(high_memory), trial_size);
	220	if (!remapped) {
	221	PDEBUGG("%li megs failed!\n", trial_size>>20);
	222	break;
	223	}
	224	PDEBUGG("Trying %li megs (at %p, %p)\n", trial_size>>20,
	225	(void *)__pa(high_memory), remapped);
	226	for (i = last_trial; i < trial_size; i += 16) {
	227	strcpy((char *)(remapped)+i, test_string);
	228	if (strcmp((char *)(remapped)+i, test_string))
	229	break;
	230	}
	231	iounmap((void *)remapped);
	232	schedule();
	233	last_trial = trial_size;
	234	if (i == trial_size)
	235	trial_size += step; /* increment, if all went well */
	236	else {
	237	PDEBUGG("%li megs copy test failed!\n", trial_size>>20);
	238	break;
	239	}
	240	if (!allocator_probe)
	241	break;
	242	}
	243	PDEBUG("%li megs (%li k, %li b)\n", i>>20, i>>10, i);
	244	allocator_buffer_size = i>>10; /* kilobytes */
	245	allocator_buffer = __pa(high_memory);
	246	if (!allocator_buffer_size) {
	247	printk(KERN_WARNING ALL_MSG "no free high memory to use\n");
	248	return -ENOMEM;
	249	}
	250
	251	/*
	252	* to simplify things, always have two cells in the list:
	253	* the first and the last. This avoids some conditionals and
	254	* extra code when allocating and deallocating: we only play
	255	* in the middle of the list
	256	*/
	257	head = kmalloc(sizeof(struct allocator_struct), GFP_KERNEL);
	258	if (!head)
	259	return -ENOMEM;
	260	tail = kmalloc(sizeof(struct allocator_struct), GFP_KERNEL);
	261	if (!tail) {
	262	kfree(head);
	263	return -ENOMEM;
	264	}
265
266	max = allocator_buffer_size<<10;
267
268	head->size = tail->size = 0;
269	head->address = allocator_buffer;
270	tail->address = allocator_buffer + max;
271	head->next = tail;
272	tail->next = NULL;
273	allocator_list = head;
274
275	/* Back to the user code, in KB */
276	*allocator_max = allocator_buffer_size;
277
278	return 0; /* ok, ready */
aa337ef1 SS	279	}
	280
	281	void allocator_cleanup(void)
	282	{
1769fd86	283	struct allocator_struct ptr, next;
aa337ef1	284
1769fd86 GKH	285	for (ptr = allocator_list; ptr; ptr = next) {
	286	next = ptr->next;
	287	PDEBUG("freeing list: 0x%08lx\n", ptr->address);
	288	kfree(ptr);
	289	}
aa337ef1	290
1769fd86 GKH	291	allocator_buffer = 0;
	292	allocator_buffer_size = 0;
	293	allocator_list = NULL;
aa337ef1 SS	294	}
	295
	296