2005-04-16 22:20:36 +00:00
|
|
|
/*
|
2009-01-20 04:06:01 +00:00
|
|
|
* linux/arch/arm/plat-pxa/dma.c
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* PXA DMA registration and IRQ dispatching
|
|
|
|
*
|
|
|
|
* Author: Nicolas Pitre
|
|
|
|
* Created: Nov 15, 2001
|
|
|
|
* Copyright: MontaVista Software Inc.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/init.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
#include <linux/errno.h>
|
2009-08-08 21:07:22 +00:00
|
|
|
#include <linux/dma-mapping.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <asm/irq.h>
|
2009-08-08 21:07:22 +00:00
|
|
|
#include <asm/memory.h>
|
2008-08-05 15:14:15 +00:00
|
|
|
#include <mach/hardware.h>
|
2008-11-29 11:40:28 +00:00
|
|
|
#include <mach/dma.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2009-08-08 21:07:22 +00:00
|
|
|
#define DMA_DEBUG_NAME "pxa_dma"
|
|
|
|
#define DMA_MAX_REQUESTERS 64
|
|
|
|
|
2007-06-22 04:40:17 +00:00
|
|
|
struct dma_channel {
|
2005-04-16 22:20:36 +00:00
|
|
|
char *name;
|
2007-06-22 04:40:17 +00:00
|
|
|
pxa_dma_prio prio;
|
2006-10-06 17:53:39 +00:00
|
|
|
void (*irq_handler)(int, void *);
|
2005-04-16 22:20:36 +00:00
|
|
|
void *data;
|
2009-08-08 21:07:22 +00:00
|
|
|
spinlock_t lock;
|
2007-06-22 04:40:17 +00:00
|
|
|
};
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2007-06-22 04:40:17 +00:00
|
|
|
static struct dma_channel *dma_channels;
|
|
|
|
static int num_dma_channels;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2009-08-08 21:07:22 +00:00
|
|
|
/*
|
|
|
|
* Debug fs
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
#include <linux/debugfs.h>
|
|
|
|
#include <linux/uaccess.h>
|
|
|
|
#include <linux/seq_file.h>
|
|
|
|
|
|
|
|
static struct dentry *dbgfs_root, *dbgfs_state, **dbgfs_chan;
|
|
|
|
|
|
|
|
static int dbg_show_requester_chan(struct seq_file *s, void *p)
|
|
|
|
{
|
|
|
|
int pos = 0;
|
|
|
|
int chan = (int)s->private;
|
|
|
|
int i;
|
|
|
|
u32 drcmr;
|
|
|
|
|
|
|
|
pos += seq_printf(s, "DMA channel %d requesters list :\n", chan);
|
|
|
|
for (i = 0; i < DMA_MAX_REQUESTERS; i++) {
|
|
|
|
drcmr = DRCMR(i);
|
|
|
|
if ((drcmr & DRCMR_CHLNUM) == chan)
|
|
|
|
pos += seq_printf(s, "\tRequester %d (MAPVLD=%d)\n", i,
|
|
|
|
!!(drcmr & DRCMR_MAPVLD));
|
|
|
|
}
|
|
|
|
return pos;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int dbg_burst_from_dcmd(u32 dcmd)
|
|
|
|
{
|
|
|
|
int burst = (dcmd >> 16) & 0x3;
|
|
|
|
|
|
|
|
return burst ? 4 << burst : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int is_phys_valid(unsigned long addr)
|
|
|
|
{
|
|
|
|
return pfn_valid(__phys_to_pfn(addr));
|
|
|
|
}
|
|
|
|
|
|
|
|
#define DCSR_STR(flag) (dcsr & DCSR_##flag ? #flag" " : "")
|
|
|
|
#define DCMD_STR(flag) (dcmd & DCMD_##flag ? #flag" " : "")
|
|
|
|
|
|
|
|
static int dbg_show_descriptors(struct seq_file *s, void *p)
|
|
|
|
{
|
|
|
|
int pos = 0;
|
|
|
|
int chan = (int)s->private;
|
|
|
|
int i, max_show = 20, burst, width;
|
|
|
|
u32 dcmd;
|
|
|
|
unsigned long phys_desc;
|
|
|
|
struct pxa_dma_desc *desc;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&dma_channels[chan].lock, flags);
|
|
|
|
phys_desc = DDADR(chan);
|
|
|
|
|
|
|
|
pos += seq_printf(s, "DMA channel %d descriptors :\n", chan);
|
|
|
|
pos += seq_printf(s, "[%03d] First descriptor unknown\n", 0);
|
|
|
|
for (i = 1; i < max_show && is_phys_valid(phys_desc); i++) {
|
|
|
|
desc = phys_to_virt(phys_desc);
|
|
|
|
dcmd = desc->dcmd;
|
|
|
|
burst = dbg_burst_from_dcmd(dcmd);
|
|
|
|
width = (1 << ((dcmd >> 14) & 0x3)) >> 1;
|
|
|
|
|
|
|
|
pos += seq_printf(s, "[%03d] Desc at %08lx(virt %p)\n",
|
|
|
|
i, phys_desc, desc);
|
|
|
|
pos += seq_printf(s, "\tDDADR = %08x\n", desc->ddadr);
|
|
|
|
pos += seq_printf(s, "\tDSADR = %08x\n", desc->dsadr);
|
|
|
|
pos += seq_printf(s, "\tDTADR = %08x\n", desc->dtadr);
|
|
|
|
pos += seq_printf(s, "\tDCMD = %08x (%s%s%s%s%s%s%sburst=%d"
|
|
|
|
" width=%d len=%d)\n",
|
|
|
|
dcmd,
|
|
|
|
DCMD_STR(INCSRCADDR), DCMD_STR(INCTRGADDR),
|
|
|
|
DCMD_STR(FLOWSRC), DCMD_STR(FLOWTRG),
|
|
|
|
DCMD_STR(STARTIRQEN), DCMD_STR(ENDIRQEN),
|
|
|
|
DCMD_STR(ENDIAN), burst, width,
|
|
|
|
dcmd & DCMD_LENGTH);
|
|
|
|
phys_desc = desc->ddadr;
|
|
|
|
}
|
|
|
|
if (i == max_show)
|
|
|
|
pos += seq_printf(s, "[%03d] Desc at %08lx ... max display reached\n",
|
|
|
|
i, phys_desc);
|
|
|
|
else
|
|
|
|
pos += seq_printf(s, "[%03d] Desc at %08lx is %s\n",
|
|
|
|
i, phys_desc, phys_desc == DDADR_STOP ?
|
|
|
|
"DDADR_STOP" : "invalid");
|
|
|
|
|
|
|
|
spin_unlock_irqrestore(&dma_channels[chan].lock, flags);
|
|
|
|
return pos;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int dbg_show_chan_state(struct seq_file *s, void *p)
|
|
|
|
{
|
|
|
|
int pos = 0;
|
|
|
|
int chan = (int)s->private;
|
|
|
|
u32 dcsr, dcmd;
|
|
|
|
int burst, width;
|
|
|
|
static char *str_prio[] = { "high", "normal", "low" };
|
|
|
|
|
|
|
|
dcsr = DCSR(chan);
|
|
|
|
dcmd = DCMD(chan);
|
|
|
|
burst = dbg_burst_from_dcmd(dcmd);
|
|
|
|
width = (1 << ((dcmd >> 14) & 0x3)) >> 1;
|
|
|
|
|
|
|
|
pos += seq_printf(s, "DMA channel %d\n", chan);
|
|
|
|
pos += seq_printf(s, "\tPriority : %s\n",
|
|
|
|
str_prio[dma_channels[chan].prio]);
|
|
|
|
pos += seq_printf(s, "\tUnaligned transfer bit: %s\n",
|
|
|
|
DALGN & (1 << chan) ? "yes" : "no");
|
|
|
|
pos += seq_printf(s, "\tDCSR = %08x (%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s)\n",
|
|
|
|
dcsr, DCSR_STR(RUN), DCSR_STR(NODESC),
|
|
|
|
DCSR_STR(STOPIRQEN), DCSR_STR(EORIRQEN),
|
|
|
|
DCSR_STR(EORJMPEN), DCSR_STR(EORSTOPEN),
|
|
|
|
DCSR_STR(SETCMPST), DCSR_STR(CLRCMPST),
|
|
|
|
DCSR_STR(CMPST), DCSR_STR(EORINTR), DCSR_STR(REQPEND),
|
|
|
|
DCSR_STR(STOPSTATE), DCSR_STR(ENDINTR),
|
|
|
|
DCSR_STR(STARTINTR), DCSR_STR(BUSERR));
|
|
|
|
|
|
|
|
pos += seq_printf(s, "\tDCMD = %08x (%s%s%s%s%s%s%sburst=%d width=%d"
|
|
|
|
" len=%d)\n",
|
|
|
|
dcmd,
|
|
|
|
DCMD_STR(INCSRCADDR), DCMD_STR(INCTRGADDR),
|
|
|
|
DCMD_STR(FLOWSRC), DCMD_STR(FLOWTRG),
|
|
|
|
DCMD_STR(STARTIRQEN), DCMD_STR(ENDIRQEN),
|
|
|
|
DCMD_STR(ENDIAN), burst, width, dcmd & DCMD_LENGTH);
|
|
|
|
pos += seq_printf(s, "\tDSADR = %08x\n", DSADR(chan));
|
|
|
|
pos += seq_printf(s, "\tDTADR = %08x\n", DTADR(chan));
|
|
|
|
pos += seq_printf(s, "\tDDADR = %08x\n", DDADR(chan));
|
|
|
|
return pos;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int dbg_show_state(struct seq_file *s, void *p)
|
|
|
|
{
|
|
|
|
int pos = 0;
|
|
|
|
|
|
|
|
/* basic device status */
|
|
|
|
pos += seq_printf(s, "DMA engine status\n");
|
|
|
|
pos += seq_printf(s, "\tChannel number: %d\n", num_dma_channels);
|
|
|
|
|
|
|
|
return pos;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define DBGFS_FUNC_DECL(name) \
|
|
|
|
static int dbg_open_##name(struct inode *inode, struct file *file) \
|
|
|
|
{ \
|
|
|
|
return single_open(file, dbg_show_##name, inode->i_private); \
|
|
|
|
} \
|
|
|
|
static const struct file_operations dbg_fops_##name = { \
|
|
|
|
.owner = THIS_MODULE, \
|
|
|
|
.open = dbg_open_##name, \
|
|
|
|
.llseek = seq_lseek, \
|
|
|
|
.read = seq_read, \
|
|
|
|
.release = single_release, \
|
|
|
|
}
|
|
|
|
|
|
|
|
DBGFS_FUNC_DECL(state);
|
|
|
|
DBGFS_FUNC_DECL(chan_state);
|
|
|
|
DBGFS_FUNC_DECL(descriptors);
|
|
|
|
DBGFS_FUNC_DECL(requester_chan);
|
|
|
|
|
|
|
|
static struct dentry *pxa_dma_dbg_alloc_chan(int ch, struct dentry *chandir)
|
|
|
|
{
|
|
|
|
char chan_name[11];
|
|
|
|
struct dentry *chan, *chan_state = NULL, *chan_descr = NULL;
|
|
|
|
struct dentry *chan_reqs = NULL;
|
|
|
|
void *dt;
|
|
|
|
|
|
|
|
scnprintf(chan_name, sizeof(chan_name), "%d", ch);
|
|
|
|
chan = debugfs_create_dir(chan_name, chandir);
|
|
|
|
dt = (void *)ch;
|
|
|
|
|
|
|
|
if (chan)
|
|
|
|
chan_state = debugfs_create_file("state", 0400, chan, dt,
|
|
|
|
&dbg_fops_chan_state);
|
|
|
|
if (chan_state)
|
|
|
|
chan_descr = debugfs_create_file("descriptors", 0400, chan, dt,
|
|
|
|
&dbg_fops_descriptors);
|
|
|
|
if (chan_descr)
|
|
|
|
chan_reqs = debugfs_create_file("requesters", 0400, chan, dt,
|
|
|
|
&dbg_fops_requester_chan);
|
|
|
|
if (!chan_reqs)
|
|
|
|
goto err_state;
|
|
|
|
|
|
|
|
return chan;
|
|
|
|
|
|
|
|
err_state:
|
|
|
|
debugfs_remove_recursive(chan);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void pxa_dma_init_debugfs(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct dentry *chandir;
|
|
|
|
|
|
|
|
dbgfs_root = debugfs_create_dir(DMA_DEBUG_NAME, NULL);
|
|
|
|
if (IS_ERR(dbgfs_root) || !dbgfs_root)
|
|
|
|
goto err_root;
|
|
|
|
|
|
|
|
dbgfs_state = debugfs_create_file("state", 0400, dbgfs_root, NULL,
|
|
|
|
&dbg_fops_state);
|
|
|
|
if (!dbgfs_state)
|
|
|
|
goto err_state;
|
|
|
|
|
|
|
|
dbgfs_chan = kmalloc(sizeof(*dbgfs_state) * num_dma_channels,
|
|
|
|
GFP_KERNEL);
|
2010-04-27 21:09:11 +00:00
|
|
|
if (!dbgfs_chan)
|
2009-08-08 21:07:22 +00:00
|
|
|
goto err_alloc;
|
|
|
|
|
|
|
|
chandir = debugfs_create_dir("channels", dbgfs_root);
|
|
|
|
if (!chandir)
|
|
|
|
goto err_chandir;
|
|
|
|
|
|
|
|
for (i = 0; i < num_dma_channels; i++) {
|
|
|
|
dbgfs_chan[i] = pxa_dma_dbg_alloc_chan(i, chandir);
|
|
|
|
if (!dbgfs_chan[i])
|
|
|
|
goto err_chans;
|
|
|
|
}
|
|
|
|
|
|
|
|
return;
|
|
|
|
err_chans:
|
|
|
|
err_chandir:
|
|
|
|
kfree(dbgfs_chan);
|
|
|
|
err_alloc:
|
|
|
|
err_state:
|
|
|
|
debugfs_remove_recursive(dbgfs_root);
|
|
|
|
err_root:
|
|
|
|
pr_err("pxa_dma: debugfs is not available\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __exit pxa_dma_cleanup_debugfs(void)
|
|
|
|
{
|
|
|
|
debugfs_remove_recursive(dbgfs_root);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
static inline void pxa_dma_init_debugfs(void) {}
|
|
|
|
static inline void pxa_dma_cleanup_debugfs(void) {}
|
|
|
|
#endif
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
int pxa_request_dma (char *name, pxa_dma_prio prio,
|
2009-01-20 04:06:01 +00:00
|
|
|
void (*irq_handler)(int, void *),
|
|
|
|
void *data)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
int i, found = 0;
|
|
|
|
|
|
|
|
/* basic sanity checks */
|
|
|
|
if (!name || !irq_handler)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
|
2006-05-05 21:32:24 +00:00
|
|
|
do {
|
|
|
|
/* try grabbing a DMA channel with the requested priority */
|
2007-06-22 04:40:17 +00:00
|
|
|
for (i = 0; i < num_dma_channels; i++) {
|
|
|
|
if ((dma_channels[i].prio == prio) &&
|
|
|
|
!dma_channels[i].name) {
|
2005-04-16 22:20:36 +00:00
|
|
|
found = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-05-05 21:32:24 +00:00
|
|
|
/* if requested prio group is full, try a hier priority */
|
|
|
|
} while (!found && prio--);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
if (found) {
|
|
|
|
DCSR(i) = DCSR_STARTINTR|DCSR_ENDINTR|DCSR_BUSERR;
|
|
|
|
dma_channels[i].name = name;
|
|
|
|
dma_channels[i].irq_handler = irq_handler;
|
|
|
|
dma_channels[i].data = data;
|
|
|
|
} else {
|
|
|
|
printk (KERN_WARNING "No more available DMA channels for %s\n", name);
|
|
|
|
i = -ENODEV;
|
|
|
|
}
|
|
|
|
|
|
|
|
local_irq_restore(flags);
|
|
|
|
return i;
|
|
|
|
}
|
2009-08-08 21:07:20 +00:00
|
|
|
EXPORT_SYMBOL(pxa_request_dma);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
void pxa_free_dma (int dma_ch)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
if (!dma_channels[dma_ch].name) {
|
|
|
|
printk (KERN_CRIT
|
|
|
|
"%s: trying to free channel %d which is already freed\n",
|
2008-03-04 23:08:02 +00:00
|
|
|
__func__, dma_ch);
|
2005-04-16 22:20:36 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
DCSR(dma_ch) = DCSR_STARTINTR|DCSR_ENDINTR|DCSR_BUSERR;
|
|
|
|
dma_channels[dma_ch].name = NULL;
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
2009-08-08 21:07:20 +00:00
|
|
|
EXPORT_SYMBOL(pxa_free_dma);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2006-10-06 17:53:39 +00:00
|
|
|
static irqreturn_t dma_irq_handler(int irq, void *dev_id)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
int i, dint = DINT;
|
2009-08-08 21:07:21 +00:00
|
|
|
struct dma_channel *channel;
|
|
|
|
|
|
|
|
while (dint) {
|
|
|
|
i = __ffs(dint);
|
|
|
|
dint &= (dint - 1);
|
|
|
|
channel = &dma_channels[i];
|
|
|
|
if (channel->name && channel->irq_handler) {
|
|
|
|
channel->irq_handler(i, channel->data);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* IRQ for an unregistered DMA channel:
|
|
|
|
* let's clear the interrupts and disable it.
|
|
|
|
*/
|
|
|
|
printk (KERN_WARNING "spurious IRQ for DMA channel %d\n", i);
|
|
|
|
DCSR(i) = DCSR_STARTINTR|DCSR_ENDINTR|DCSR_BUSERR;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return IRQ_HANDLED;
|
|
|
|
}
|
|
|
|
|
2009-01-02 08:26:33 +00:00
|
|
|
int __init pxa_init_dma(int irq, int num_ch)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2007-06-22 04:40:17 +00:00
|
|
|
int i, ret;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2007-06-22 04:40:17 +00:00
|
|
|
dma_channels = kzalloc(sizeof(struct dma_channel) * num_ch, GFP_KERNEL);
|
|
|
|
if (dma_channels == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
/* dma channel priorities on pxa2xx processors:
|
|
|
|
* ch 0 - 3, 16 - 19 <--> (0) DMA_PRIO_HIGH
|
|
|
|
* ch 4 - 7, 20 - 23 <--> (1) DMA_PRIO_MEDIUM
|
|
|
|
* ch 8 - 15, 24 - 31 <--> (2) DMA_PRIO_LOW
|
|
|
|
*/
|
2009-01-21 03:29:19 +00:00
|
|
|
for (i = 0; i < num_ch; i++) {
|
|
|
|
DCSR(i) = 0;
|
2007-06-22 04:40:17 +00:00
|
|
|
dma_channels[i].prio = min((i & 0xf) >> 2, DMA_PRIO_LOW);
|
2009-08-08 21:07:22 +00:00
|
|
|
spin_lock_init(&dma_channels[i].lock);
|
2009-01-21 03:29:19 +00:00
|
|
|
}
|
|
|
|
|
2009-01-02 08:26:33 +00:00
|
|
|
ret = request_irq(irq, dma_irq_handler, IRQF_DISABLED, "DMA", NULL);
|
2009-01-21 03:29:19 +00:00
|
|
|
if (ret) {
|
|
|
|
printk (KERN_CRIT "Wow! Can't register IRQ for DMA\n");
|
|
|
|
kfree(dma_channels);
|
|
|
|
return ret;
|
|
|
|
}
|
2007-06-22 04:40:17 +00:00
|
|
|
num_dma_channels = num_ch;
|
2009-08-08 21:07:22 +00:00
|
|
|
|
|
|
|
pxa_dma_init_debugfs();
|
|
|
|
|
2007-06-22 04:40:17 +00:00
|
|
|
return 0;
|
|
|
|
}
|