2008-07-08 18:58:45 +00:00
|
|
|
/*
|
|
|
|
* DMA Engine test module
|
|
|
|
*
|
|
|
|
* Copyright (C) 2007 Atmel Corporation
|
2013-03-04 09:09:30 +00:00
|
|
|
* Copyright (C) 2013 Intel Corporation
|
2008-07-08 18:58:45 +00:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
2013-11-07 00:29:58 +00:00
|
|
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
|
|
|
|
2008-07-08 18:58:45 +00:00
|
|
|
#include <linux/delay.h>
|
2011-06-16 11:01:34 +00:00
|
|
|
#include <linux/dma-mapping.h>
|
2008-07-08 18:58:45 +00:00
|
|
|
#include <linux/dmaengine.h>
|
2011-08-18 14:50:51 +00:00
|
|
|
#include <linux/freezer.h>
|
2008-07-08 18:58:45 +00:00
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/kthread.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/moduleparam.h>
|
|
|
|
#include <linux/random.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>
|
2008-07-08 18:58:45 +00:00
|
|
|
#include <linux/wait.h>
|
|
|
|
|
|
|
|
static unsigned int test_buf_size = 16384;
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param(test_buf_size, uint, S_IRUGO | S_IWUSR);
|
2008-07-08 18:58:45 +00:00
|
|
|
MODULE_PARM_DESC(test_buf_size, "Size of the memcpy test buffer");
|
|
|
|
|
2008-11-11 20:12:33 +00:00
|
|
|
static char test_channel[20];
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param_string(channel, test_channel, sizeof(test_channel),
|
|
|
|
S_IRUGO | S_IWUSR);
|
2008-07-08 18:58:45 +00:00
|
|
|
MODULE_PARM_DESC(channel, "Bus ID of the channel to test (default: any)");
|
|
|
|
|
2013-12-30 13:58:04 +00:00
|
|
|
static char test_device[32];
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param_string(device, test_device, sizeof(test_device),
|
|
|
|
S_IRUGO | S_IWUSR);
|
2008-07-08 18:58:45 +00:00
|
|
|
MODULE_PARM_DESC(device, "Bus ID of the DMA Engine to test (default: any)");
|
|
|
|
|
|
|
|
static unsigned int threads_per_chan = 1;
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param(threads_per_chan, uint, S_IRUGO | S_IWUSR);
|
2008-07-08 18:58:45 +00:00
|
|
|
MODULE_PARM_DESC(threads_per_chan,
|
|
|
|
"Number of threads to start per channel (default: 1)");
|
|
|
|
|
|
|
|
static unsigned int max_channels;
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param(max_channels, uint, S_IRUGO | S_IWUSR);
|
2009-01-06 18:38:15 +00:00
|
|
|
MODULE_PARM_DESC(max_channels,
|
2008-07-08 18:58:45 +00:00
|
|
|
"Maximum number of channels to use (default: all)");
|
|
|
|
|
2009-07-03 17:26:51 +00:00
|
|
|
static unsigned int iterations;
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param(iterations, uint, S_IRUGO | S_IWUSR);
|
2009-07-03 17:26:51 +00:00
|
|
|
MODULE_PARM_DESC(iterations,
|
|
|
|
"Iterations before stopping test (default: infinite)");
|
|
|
|
|
2009-03-25 16:13:25 +00:00
|
|
|
static unsigned int xor_sources = 3;
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param(xor_sources, uint, S_IRUGO | S_IWUSR);
|
2009-03-25 16:13:25 +00:00
|
|
|
MODULE_PARM_DESC(xor_sources,
|
|
|
|
"Number of xor source buffers (default: 3)");
|
|
|
|
|
2009-08-30 02:09:27 +00:00
|
|
|
static unsigned int pq_sources = 3;
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param(pq_sources, uint, S_IRUGO | S_IWUSR);
|
2009-08-30 02:09:27 +00:00
|
|
|
MODULE_PARM_DESC(pq_sources,
|
|
|
|
"Number of p+q source buffers (default: 3)");
|
|
|
|
|
2011-03-22 11:57:25 +00:00
|
|
|
static int timeout = 3000;
|
2013-07-23 15:36:46 +00:00
|
|
|
module_param(timeout, uint, S_IRUGO | S_IWUSR);
|
2011-04-24 03:38:19 +00:00
|
|
|
MODULE_PARM_DESC(timeout, "Transfer Timeout in msec (default: 3000), "
|
|
|
|
"Pass -1 for infinite timeout");
|
2011-03-22 11:57:25 +00:00
|
|
|
|
2013-11-07 00:30:05 +00:00
|
|
|
static bool noverify;
|
|
|
|
module_param(noverify, bool, S_IRUGO | S_IWUSR);
|
|
|
|
MODULE_PARM_DESC(noverify, "Disable random data setup and verification");
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-11-08 20:26:26 +00:00
|
|
|
static bool verbose;
|
|
|
|
module_param(verbose, bool, S_IRUGO | S_IWUSR);
|
|
|
|
MODULE_PARM_DESC(verbose, "Enable \"success\" result messages (default: off)");
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-03-04 09:09:27 +00:00
|
|
|
/**
|
2013-03-04 09:09:29 +00:00
|
|
|
* struct dmatest_params - test parameters.
|
2013-03-04 09:09:27 +00:00
|
|
|
* @buf_size: size of the memcpy test buffer
|
|
|
|
* @channel: bus ID of the channel to test
|
|
|
|
* @device: bus ID of the DMA Engine to test
|
|
|
|
* @threads_per_chan: number of threads to start per channel
|
|
|
|
* @max_channels: maximum number of channels to use
|
|
|
|
* @iterations: iterations before stopping test
|
|
|
|
* @xor_sources: number of xor source buffers
|
|
|
|
* @pq_sources: number of p+q source buffers
|
|
|
|
* @timeout: transfer timeout in msec, -1 for infinite timeout
|
|
|
|
*/
|
2013-03-04 09:09:29 +00:00
|
|
|
struct dmatest_params {
|
2013-03-04 09:09:27 +00:00
|
|
|
unsigned int buf_size;
|
|
|
|
char channel[20];
|
2013-12-30 13:58:04 +00:00
|
|
|
char device[32];
|
2013-03-04 09:09:27 +00:00
|
|
|
unsigned int threads_per_chan;
|
|
|
|
unsigned int max_channels;
|
|
|
|
unsigned int iterations;
|
|
|
|
unsigned int xor_sources;
|
|
|
|
unsigned int pq_sources;
|
|
|
|
int timeout;
|
2013-11-07 00:30:05 +00:00
|
|
|
bool noverify;
|
2013-03-04 09:09:29 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* struct dmatest_info - test information.
|
|
|
|
* @params: test parameters
|
2013-03-04 09:09:30 +00:00
|
|
|
* @lock: access protection to the fields of this structure
|
2013-03-04 09:09:29 +00:00
|
|
|
*/
|
2013-11-07 00:30:01 +00:00
|
|
|
static struct dmatest_info {
|
2013-03-04 09:09:29 +00:00
|
|
|
/* Test parameters */
|
|
|
|
struct dmatest_params params;
|
2013-03-04 09:09:28 +00:00
|
|
|
|
|
|
|
/* Internal state */
|
|
|
|
struct list_head channels;
|
|
|
|
unsigned int nr_channels;
|
2013-03-04 09:09:30 +00:00
|
|
|
struct mutex lock;
|
2013-11-07 00:30:01 +00:00
|
|
|
bool did_init;
|
|
|
|
} test_info = {
|
|
|
|
.channels = LIST_HEAD_INIT(test_info.channels),
|
|
|
|
.lock = __MUTEX_INITIALIZER(test_info.lock),
|
|
|
|
};
|
2013-03-04 09:09:30 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
static int dmatest_run_set(const char *val, const struct kernel_param *kp);
|
|
|
|
static int dmatest_run_get(char *val, const struct kernel_param *kp);
|
2015-05-27 01:39:38 +00:00
|
|
|
static const struct kernel_param_ops run_ops = {
|
2013-11-07 00:30:01 +00:00
|
|
|
.set = dmatest_run_set,
|
|
|
|
.get = dmatest_run_get,
|
2013-03-04 09:09:27 +00:00
|
|
|
};
|
2013-11-07 00:30:01 +00:00
|
|
|
static bool dmatest_run;
|
|
|
|
module_param_cb(run, &run_ops, &dmatest_run, S_IRUGO | S_IWUSR);
|
|
|
|
MODULE_PARM_DESC(run, "Run the test (default: false)");
|
2013-03-04 09:09:27 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
/* Maximum amount of mismatched bytes in buffer to print */
|
|
|
|
#define MAX_ERROR_COUNT 32
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialization patterns. All bytes in the source buffer has bit 7
|
|
|
|
* set, all bytes in the destination buffer has bit 7 cleared.
|
|
|
|
*
|
|
|
|
* Bit 6 is set for all bytes which are to be copied by the DMA
|
|
|
|
* engine. Bit 5 is set for all bytes which are to be overwritten by
|
|
|
|
* the DMA engine.
|
|
|
|
*
|
|
|
|
* The remaining bits are the inverse of a counter which increments by
|
|
|
|
* one for each byte address.
|
|
|
|
*/
|
|
|
|
#define PATTERN_SRC 0x80
|
|
|
|
#define PATTERN_DST 0x00
|
|
|
|
#define PATTERN_COPY 0x40
|
|
|
|
#define PATTERN_OVERWRITE 0x20
|
|
|
|
#define PATTERN_COUNT_MASK 0x1f
|
2013-03-04 09:09:30 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
struct dmatest_thread {
|
|
|
|
struct list_head node;
|
|
|
|
struct dmatest_info *info;
|
|
|
|
struct task_struct *task;
|
|
|
|
struct dma_chan *chan;
|
|
|
|
u8 **srcs;
|
|
|
|
u8 **dsts;
|
|
|
|
enum dma_transaction_type type;
|
|
|
|
bool done;
|
|
|
|
};
|
2013-03-04 09:09:33 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
struct dmatest_chan {
|
|
|
|
struct list_head node;
|
|
|
|
struct dma_chan *chan;
|
|
|
|
struct list_head threads;
|
2013-03-04 09:09:27 +00:00
|
|
|
};
|
|
|
|
|
2013-11-07 00:30:09 +00:00
|
|
|
static DECLARE_WAIT_QUEUE_HEAD(thread_wait);
|
|
|
|
static bool wait;
|
|
|
|
|
|
|
|
static bool is_threaded_test_run(struct dmatest_info *info)
|
|
|
|
{
|
|
|
|
struct dmatest_chan *dtc;
|
|
|
|
|
|
|
|
list_for_each_entry(dtc, &info->channels, node) {
|
|
|
|
struct dmatest_thread *thread;
|
|
|
|
|
|
|
|
list_for_each_entry(thread, &dtc->threads, node) {
|
|
|
|
if (!thread->done)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int dmatest_wait_get(char *val, const struct kernel_param *kp)
|
|
|
|
{
|
|
|
|
struct dmatest_info *info = &test_info;
|
|
|
|
struct dmatest_params *params = &info->params;
|
|
|
|
|
|
|
|
if (params->iterations)
|
|
|
|
wait_event(thread_wait, !is_threaded_test_run(info));
|
|
|
|
wait = true;
|
|
|
|
return param_get_bool(val, kp);
|
|
|
|
}
|
|
|
|
|
2015-05-27 01:39:38 +00:00
|
|
|
static const struct kernel_param_ops wait_ops = {
|
2013-11-07 00:30:09 +00:00
|
|
|
.get = dmatest_wait_get,
|
|
|
|
.set = param_set_bool,
|
|
|
|
};
|
|
|
|
module_param_cb(wait, &wait_ops, &wait, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(wait, "Wait for tests to complete (default: false)");
|
2013-03-04 09:09:27 +00:00
|
|
|
|
2013-03-04 09:09:29 +00:00
|
|
|
static bool dmatest_match_channel(struct dmatest_params *params,
|
2013-03-04 09:09:27 +00:00
|
|
|
struct dma_chan *chan)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
2013-03-04 09:09:29 +00:00
|
|
|
if (params->channel[0] == '\0')
|
2008-07-08 18:58:45 +00:00
|
|
|
return true;
|
2013-03-04 09:09:29 +00:00
|
|
|
return strcmp(dma_chan_name(chan), params->channel) == 0;
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
2013-03-04 09:09:29 +00:00
|
|
|
static bool dmatest_match_device(struct dmatest_params *params,
|
2013-03-04 09:09:27 +00:00
|
|
|
struct dma_device *device)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
2013-03-04 09:09:29 +00:00
|
|
|
if (params->device[0] == '\0')
|
2008-07-08 18:58:45 +00:00
|
|
|
return true;
|
2013-03-04 09:09:29 +00:00
|
|
|
return strcmp(dev_name(device->dev), params->device) == 0;
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned long dmatest_random(void)
|
|
|
|
{
|
|
|
|
unsigned long buf;
|
|
|
|
|
2013-11-07 00:30:03 +00:00
|
|
|
prandom_bytes(&buf, sizeof(buf));
|
2008-07-08 18:58:45 +00:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2013-03-04 09:09:27 +00:00
|
|
|
static void dmatest_init_srcs(u8 **bufs, unsigned int start, unsigned int len,
|
|
|
|
unsigned int buf_size)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
|
|
|
unsigned int i;
|
2009-03-25 16:13:25 +00:00
|
|
|
u8 *buf;
|
|
|
|
|
|
|
|
for (; (buf = *bufs); bufs++) {
|
|
|
|
for (i = 0; i < start; i++)
|
|
|
|
buf[i] = PATTERN_SRC | (~i & PATTERN_COUNT_MASK);
|
|
|
|
for ( ; i < start + len; i++)
|
|
|
|
buf[i] = PATTERN_SRC | PATTERN_COPY
|
2009-06-28 16:26:21 +00:00
|
|
|
| (~i & PATTERN_COUNT_MASK);
|
2013-03-04 09:09:27 +00:00
|
|
|
for ( ; i < buf_size; i++)
|
2009-03-25 16:13:25 +00:00
|
|
|
buf[i] = PATTERN_SRC | (~i & PATTERN_COUNT_MASK);
|
|
|
|
buf++;
|
|
|
|
}
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
2013-03-04 09:09:27 +00:00
|
|
|
static void dmatest_init_dsts(u8 **bufs, unsigned int start, unsigned int len,
|
|
|
|
unsigned int buf_size)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
|
|
|
unsigned int i;
|
2009-03-25 16:13:25 +00:00
|
|
|
u8 *buf;
|
|
|
|
|
|
|
|
for (; (buf = *bufs); bufs++) {
|
|
|
|
for (i = 0; i < start; i++)
|
|
|
|
buf[i] = PATTERN_DST | (~i & PATTERN_COUNT_MASK);
|
|
|
|
for ( ; i < start + len; i++)
|
|
|
|
buf[i] = PATTERN_DST | PATTERN_OVERWRITE
|
|
|
|
| (~i & PATTERN_COUNT_MASK);
|
2013-03-04 09:09:27 +00:00
|
|
|
for ( ; i < buf_size; i++)
|
2009-03-25 16:13:25 +00:00
|
|
|
buf[i] = PATTERN_DST | (~i & PATTERN_COUNT_MASK);
|
|
|
|
}
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:29:57 +00:00
|
|
|
static void dmatest_mismatch(u8 actual, u8 pattern, unsigned int index,
|
|
|
|
unsigned int counter, bool is_srcbuf)
|
|
|
|
{
|
|
|
|
u8 diff = actual ^ pattern;
|
|
|
|
u8 expected = pattern | (~counter & PATTERN_COUNT_MASK);
|
|
|
|
const char *thread_name = current->comm;
|
|
|
|
|
|
|
|
if (is_srcbuf)
|
|
|
|
pr_warn("%s: srcbuf[0x%x] overwritten! Expected %02x, got %02x\n",
|
|
|
|
thread_name, index, expected, actual);
|
|
|
|
else if ((pattern & PATTERN_COPY)
|
|
|
|
&& (diff & (PATTERN_COPY | PATTERN_OVERWRITE)))
|
|
|
|
pr_warn("%s: dstbuf[0x%x] not copied! Expected %02x, got %02x\n",
|
|
|
|
thread_name, index, expected, actual);
|
|
|
|
else if (diff & PATTERN_SRC)
|
|
|
|
pr_warn("%s: dstbuf[0x%x] was copied! Expected %02x, got %02x\n",
|
|
|
|
thread_name, index, expected, actual);
|
|
|
|
else
|
|
|
|
pr_warn("%s: dstbuf[0x%x] mismatch! Expected %02x, got %02x\n",
|
|
|
|
thread_name, index, expected, actual);
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int dmatest_verify(u8 **bufs, unsigned int start,
|
|
|
|
unsigned int end, unsigned int counter, u8 pattern,
|
|
|
|
bool is_srcbuf)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
unsigned int error_count = 0;
|
|
|
|
u8 actual;
|
2009-03-25 16:13:25 +00:00
|
|
|
u8 expected;
|
|
|
|
u8 *buf;
|
|
|
|
unsigned int counter_orig = counter;
|
|
|
|
|
|
|
|
for (; (buf = *bufs); bufs++) {
|
|
|
|
counter = counter_orig;
|
|
|
|
for (i = start; i < end; i++) {
|
|
|
|
actual = buf[i];
|
|
|
|
expected = pattern | (~counter & PATTERN_COUNT_MASK);
|
|
|
|
if (actual != expected) {
|
2013-11-07 00:29:57 +00:00
|
|
|
if (error_count < MAX_ERROR_COUNT)
|
|
|
|
dmatest_mismatch(actual, pattern, i,
|
|
|
|
counter, is_srcbuf);
|
2009-03-25 16:13:25 +00:00
|
|
|
error_count++;
|
|
|
|
}
|
|
|
|
counter++;
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-04 09:09:32 +00:00
|
|
|
if (error_count > MAX_ERROR_COUNT)
|
2013-11-07 00:29:57 +00:00
|
|
|
pr_warn("%s: %u errors suppressed\n",
|
2013-03-04 09:09:32 +00:00
|
|
|
current->comm, error_count - MAX_ERROR_COUNT);
|
2008-07-08 18:58:45 +00:00
|
|
|
|
|
|
|
return error_count;
|
|
|
|
}
|
|
|
|
|
2011-11-23 17:28:16 +00:00
|
|
|
/* poor man's completion - we want to use wait_event_freezable() on it */
|
|
|
|
struct dmatest_done {
|
|
|
|
bool done;
|
|
|
|
wait_queue_head_t *wait;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void dmatest_callback(void *arg)
|
2009-03-25 16:13:25 +00:00
|
|
|
{
|
2011-11-23 17:28:16 +00:00
|
|
|
struct dmatest_done *done = arg;
|
|
|
|
|
|
|
|
done->done = true;
|
|
|
|
wake_up_all(done->wait);
|
2009-03-25 16:13:25 +00:00
|
|
|
}
|
|
|
|
|
2012-10-27 15:49:32 +00:00
|
|
|
static unsigned int min_odd(unsigned int x, unsigned int y)
|
|
|
|
{
|
|
|
|
unsigned int val = min(x, y);
|
|
|
|
|
|
|
|
return val % 2 ? val : val - 1;
|
|
|
|
}
|
|
|
|
|
2013-11-07 00:29:58 +00:00
|
|
|
static void result(const char *err, unsigned int n, unsigned int src_off,
|
|
|
|
unsigned int dst_off, unsigned int len, unsigned long data)
|
2013-03-04 09:09:34 +00:00
|
|
|
{
|
2014-03-04 09:38:55 +00:00
|
|
|
pr_info("%s: result #%u: '%s' with src_off=0x%x dst_off=0x%x len=0x%x (%lu)\n",
|
2013-11-07 00:29:58 +00:00
|
|
|
current->comm, n, err, src_off, dst_off, len, data);
|
2013-03-04 09:09:34 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:29:58 +00:00
|
|
|
static void dbg_result(const char *err, unsigned int n, unsigned int src_off,
|
|
|
|
unsigned int dst_off, unsigned int len,
|
|
|
|
unsigned long data)
|
2013-03-04 09:09:33 +00:00
|
|
|
{
|
2014-03-04 09:38:55 +00:00
|
|
|
pr_debug("%s: result #%u: '%s' with src_off=0x%x dst_off=0x%x len=0x%x (%lu)\n",
|
2014-10-22 13:16:42 +00:00
|
|
|
current->comm, n, err, src_off, dst_off, len, data);
|
2013-03-04 09:09:33 +00:00
|
|
|
}
|
|
|
|
|
2014-10-22 13:16:42 +00:00
|
|
|
#define verbose_result(err, n, src_off, dst_off, len, data) ({ \
|
|
|
|
if (verbose) \
|
|
|
|
result(err, n, src_off, dst_off, len, data); \
|
|
|
|
else \
|
|
|
|
dbg_result(err, n, src_off, dst_off, len, data);\
|
2013-11-08 20:26:26 +00:00
|
|
|
})
|
2013-03-04 09:09:33 +00:00
|
|
|
|
2013-11-07 00:30:07 +00:00
|
|
|
static unsigned long long dmatest_persec(s64 runtime, unsigned int val)
|
2013-03-04 09:09:34 +00:00
|
|
|
{
|
2013-11-07 00:30:07 +00:00
|
|
|
unsigned long long per_sec = 1000000;
|
2013-03-04 09:09:34 +00:00
|
|
|
|
2013-11-07 00:30:07 +00:00
|
|
|
if (runtime <= 0)
|
|
|
|
return 0;
|
2013-03-04 09:09:33 +00:00
|
|
|
|
2013-11-07 00:30:07 +00:00
|
|
|
/* drop precision until runtime is 32-bits */
|
|
|
|
while (runtime > UINT_MAX) {
|
|
|
|
runtime >>= 1;
|
|
|
|
per_sec <<= 1;
|
2013-03-04 09:09:33 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:07 +00:00
|
|
|
per_sec *= val;
|
|
|
|
do_div(per_sec, runtime);
|
|
|
|
return per_sec;
|
2013-03-04 09:09:33 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:07 +00:00
|
|
|
static unsigned long long dmatest_KBs(s64 runtime, unsigned long long len)
|
2013-03-04 09:09:33 +00:00
|
|
|
{
|
2013-11-07 00:30:07 +00:00
|
|
|
return dmatest_persec(runtime, len >> 10);
|
2013-03-04 09:09:33 +00:00
|
|
|
}
|
|
|
|
|
2008-07-08 18:58:45 +00:00
|
|
|
/*
|
|
|
|
* This function repeatedly tests DMA transfers of various lengths and
|
2009-03-25 16:13:25 +00:00
|
|
|
* offsets for a given operation type until it is told to exit by
|
|
|
|
* kthread_stop(). There may be multiple threads running this function
|
|
|
|
* in parallel for a single channel, and there may be multiple channels
|
|
|
|
* being tested in parallel.
|
2008-07-08 18:58:45 +00:00
|
|
|
*
|
|
|
|
* Before each test, the source and destination buffer is initialized
|
|
|
|
* with a known pattern. This pattern is different depending on
|
|
|
|
* whether it's in an area which is supposed to be copied or
|
|
|
|
* overwritten, and different in the source and destination buffers.
|
|
|
|
* So if the DMA engine doesn't copy exactly what we tell it to copy,
|
|
|
|
* we'll notice.
|
|
|
|
*/
|
|
|
|
static int dmatest_func(void *data)
|
|
|
|
{
|
2011-11-23 17:28:16 +00:00
|
|
|
DECLARE_WAIT_QUEUE_HEAD_ONSTACK(done_wait);
|
2008-07-08 18:58:45 +00:00
|
|
|
struct dmatest_thread *thread = data;
|
2011-11-23 17:28:16 +00:00
|
|
|
struct dmatest_done done = { .wait = &done_wait };
|
2013-03-04 09:09:27 +00:00
|
|
|
struct dmatest_info *info;
|
2013-03-04 09:09:29 +00:00
|
|
|
struct dmatest_params *params;
|
2008-07-08 18:58:45 +00:00
|
|
|
struct dma_chan *chan;
|
2012-10-27 15:49:32 +00:00
|
|
|
struct dma_device *dev;
|
2008-07-08 18:58:45 +00:00
|
|
|
unsigned int error_count;
|
|
|
|
unsigned int failed_tests = 0;
|
|
|
|
unsigned int total_tests = 0;
|
|
|
|
dma_cookie_t cookie;
|
|
|
|
enum dma_status status;
|
2009-03-25 16:13:25 +00:00
|
|
|
enum dma_ctrl_flags flags;
|
2013-03-04 09:09:26 +00:00
|
|
|
u8 *pq_coefs = NULL;
|
2008-07-08 18:58:45 +00:00
|
|
|
int ret;
|
2009-03-25 16:13:25 +00:00
|
|
|
int src_cnt;
|
|
|
|
int dst_cnt;
|
|
|
|
int i;
|
2013-11-07 00:30:07 +00:00
|
|
|
ktime_t ktime;
|
|
|
|
s64 runtime = 0;
|
|
|
|
unsigned long long total_len = 0;
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2011-11-23 17:28:16 +00:00
|
|
|
set_freezable();
|
2008-07-08 18:58:45 +00:00
|
|
|
|
|
|
|
ret = -ENOMEM;
|
|
|
|
|
|
|
|
smp_rmb();
|
2013-03-04 09:09:27 +00:00
|
|
|
info = thread->info;
|
2013-03-04 09:09:29 +00:00
|
|
|
params = &info->params;
|
2008-07-08 18:58:45 +00:00
|
|
|
chan = thread->chan;
|
2012-10-27 15:49:32 +00:00
|
|
|
dev = chan->device;
|
2009-03-25 16:13:25 +00:00
|
|
|
if (thread->type == DMA_MEMCPY)
|
|
|
|
src_cnt = dst_cnt = 1;
|
|
|
|
else if (thread->type == DMA_XOR) {
|
2012-10-27 15:49:32 +00:00
|
|
|
/* force odd to ensure dst = src */
|
2013-03-04 09:09:29 +00:00
|
|
|
src_cnt = min_odd(params->xor_sources | 1, dev->max_xor);
|
2009-03-25 16:13:25 +00:00
|
|
|
dst_cnt = 1;
|
2009-08-30 02:09:27 +00:00
|
|
|
} else if (thread->type == DMA_PQ) {
|
2012-10-27 15:49:32 +00:00
|
|
|
/* force odd to ensure dst = src */
|
2013-03-04 09:09:29 +00:00
|
|
|
src_cnt = min_odd(params->pq_sources | 1, dma_maxpq(dev, 0));
|
2009-08-30 02:09:27 +00:00
|
|
|
dst_cnt = 2;
|
2013-03-04 09:09:26 +00:00
|
|
|
|
2013-03-04 09:09:29 +00:00
|
|
|
pq_coefs = kmalloc(params->pq_sources+1, GFP_KERNEL);
|
2013-03-04 09:09:26 +00:00
|
|
|
if (!pq_coefs)
|
|
|
|
goto err_thread_type;
|
|
|
|
|
2010-02-15 21:35:23 +00:00
|
|
|
for (i = 0; i < src_cnt; i++)
|
2009-08-30 02:09:27 +00:00
|
|
|
pq_coefs[i] = 1;
|
2009-03-25 16:13:25 +00:00
|
|
|
} else
|
2013-03-04 09:09:26 +00:00
|
|
|
goto err_thread_type;
|
2009-03-25 16:13:25 +00:00
|
|
|
|
|
|
|
thread->srcs = kcalloc(src_cnt+1, sizeof(u8 *), GFP_KERNEL);
|
|
|
|
if (!thread->srcs)
|
|
|
|
goto err_srcs;
|
|
|
|
for (i = 0; i < src_cnt; i++) {
|
2013-03-04 09:09:29 +00:00
|
|
|
thread->srcs[i] = kmalloc(params->buf_size, GFP_KERNEL);
|
2009-03-25 16:13:25 +00:00
|
|
|
if (!thread->srcs[i])
|
|
|
|
goto err_srcbuf;
|
|
|
|
}
|
|
|
|
thread->srcs[i] = NULL;
|
|
|
|
|
|
|
|
thread->dsts = kcalloc(dst_cnt+1, sizeof(u8 *), GFP_KERNEL);
|
|
|
|
if (!thread->dsts)
|
|
|
|
goto err_dsts;
|
|
|
|
for (i = 0; i < dst_cnt; i++) {
|
2013-03-04 09:09:29 +00:00
|
|
|
thread->dsts[i] = kmalloc(params->buf_size, GFP_KERNEL);
|
2009-03-25 16:13:25 +00:00
|
|
|
if (!thread->dsts[i])
|
|
|
|
goto err_dstbuf;
|
|
|
|
}
|
|
|
|
thread->dsts[i] = NULL;
|
|
|
|
|
2009-03-25 16:13:25 +00:00
|
|
|
set_user_nice(current, 10);
|
|
|
|
|
2011-03-03 07:54:53 +00:00
|
|
|
/*
|
2013-10-18 17:35:21 +00:00
|
|
|
* src and dst buffers are freed by ourselves below
|
2011-03-03 07:54:53 +00:00
|
|
|
*/
|
2013-10-18 17:35:33 +00:00
|
|
|
flags = DMA_CTRL_ACK | DMA_PREP_INTERRUPT;
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-11-07 00:30:07 +00:00
|
|
|
ktime = ktime_get();
|
2009-07-03 17:26:51 +00:00
|
|
|
while (!kthread_should_stop()
|
2013-03-04 09:09:29 +00:00
|
|
|
&& !(params->iterations && total_tests >= params->iterations)) {
|
2009-03-25 16:13:25 +00:00
|
|
|
struct dma_async_tx_descriptor *tx = NULL;
|
2013-11-07 00:30:10 +00:00
|
|
|
struct dmaengine_unmap_data *um;
|
|
|
|
dma_addr_t srcs[src_cnt];
|
|
|
|
dma_addr_t *dsts;
|
2014-10-22 13:16:43 +00:00
|
|
|
unsigned int src_off, dst_off, len;
|
2009-09-09 00:42:53 +00:00
|
|
|
u8 align = 0;
|
2009-01-13 16:22:20 +00:00
|
|
|
|
2008-07-08 18:58:45 +00:00
|
|
|
total_tests++;
|
|
|
|
|
2009-09-09 00:42:53 +00:00
|
|
|
/* honor alignment restrictions */
|
|
|
|
if (thread->type == DMA_MEMCPY)
|
|
|
|
align = dev->copy_align;
|
|
|
|
else if (thread->type == DMA_XOR)
|
|
|
|
align = dev->xor_align;
|
|
|
|
else if (thread->type == DMA_PQ)
|
|
|
|
align = dev->pq_align;
|
|
|
|
|
2013-03-04 09:09:29 +00:00
|
|
|
if (1 << align > params->buf_size) {
|
2009-12-04 18:44:48 +00:00
|
|
|
pr_err("%u-byte buffer too small for %d-byte alignment\n",
|
2013-03-04 09:09:29 +00:00
|
|
|
params->buf_size, 1 << align);
|
2009-12-04 18:44:48 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2014-10-22 13:16:43 +00:00
|
|
|
if (params->noverify)
|
2013-11-07 00:30:05 +00:00
|
|
|
len = params->buf_size;
|
2014-10-22 13:16:43 +00:00
|
|
|
else
|
|
|
|
len = dmatest_random() % params->buf_size + 1;
|
|
|
|
|
|
|
|
len = (len >> align) << align;
|
|
|
|
if (!len)
|
|
|
|
len = 1 << align;
|
|
|
|
|
|
|
|
total_len += len;
|
|
|
|
|
|
|
|
if (params->noverify) {
|
2013-11-07 00:30:05 +00:00
|
|
|
src_off = 0;
|
|
|
|
dst_off = 0;
|
|
|
|
} else {
|
|
|
|
src_off = dmatest_random() % (params->buf_size - len + 1);
|
|
|
|
dst_off = dmatest_random() % (params->buf_size - len + 1);
|
|
|
|
|
|
|
|
src_off = (src_off >> align) << align;
|
|
|
|
dst_off = (dst_off >> align) << align;
|
|
|
|
|
|
|
|
dmatest_init_srcs(thread->srcs, src_off, len,
|
|
|
|
params->buf_size);
|
|
|
|
dmatest_init_dsts(thread->dsts, dst_off, len,
|
|
|
|
params->buf_size);
|
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:10 +00:00
|
|
|
um = dmaengine_get_unmap_data(dev->dev, src_cnt+dst_cnt,
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!um) {
|
|
|
|
failed_tests++;
|
|
|
|
result("unmap data NULL", total_tests,
|
|
|
|
src_off, dst_off, len, ret);
|
|
|
|
continue;
|
|
|
|
}
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-11-07 00:30:10 +00:00
|
|
|
um->len = params->buf_size;
|
2009-03-25 16:13:25 +00:00
|
|
|
for (i = 0; i < src_cnt; i++) {
|
2013-12-09 19:16:01 +00:00
|
|
|
void *buf = thread->srcs[i];
|
2013-11-07 00:30:10 +00:00
|
|
|
struct page *pg = virt_to_page(buf);
|
2013-12-09 19:16:01 +00:00
|
|
|
unsigned pg_off = (unsigned long) buf & ~PAGE_MASK;
|
2013-11-07 00:30:10 +00:00
|
|
|
|
|
|
|
um->addr[i] = dma_map_page(dev->dev, pg, pg_off,
|
|
|
|
um->len, DMA_TO_DEVICE);
|
|
|
|
srcs[i] = um->addr[i] + src_off;
|
|
|
|
ret = dma_mapping_error(dev->dev, um->addr[i]);
|
2012-12-17 23:59:53 +00:00
|
|
|
if (ret) {
|
2013-11-07 00:30:10 +00:00
|
|
|
dmaengine_unmap_put(um);
|
2013-11-07 00:29:58 +00:00
|
|
|
result("src mapping error", total_tests,
|
|
|
|
src_off, dst_off, len, ret);
|
2012-12-17 23:59:53 +00:00
|
|
|
failed_tests++;
|
|
|
|
continue;
|
|
|
|
}
|
2013-11-07 00:30:10 +00:00
|
|
|
um->to_cnt++;
|
2009-03-25 16:13:25 +00:00
|
|
|
}
|
2009-01-13 16:22:20 +00:00
|
|
|
/* map with DMA_BIDIRECTIONAL to force writeback/invalidate */
|
2013-11-07 00:30:10 +00:00
|
|
|
dsts = &um->addr[src_cnt];
|
2009-03-25 16:13:25 +00:00
|
|
|
for (i = 0; i < dst_cnt; i++) {
|
2013-12-09 19:16:01 +00:00
|
|
|
void *buf = thread->dsts[i];
|
2013-11-07 00:30:10 +00:00
|
|
|
struct page *pg = virt_to_page(buf);
|
2013-12-09 19:16:01 +00:00
|
|
|
unsigned pg_off = (unsigned long) buf & ~PAGE_MASK;
|
2013-11-07 00:30:10 +00:00
|
|
|
|
|
|
|
dsts[i] = dma_map_page(dev->dev, pg, pg_off, um->len,
|
|
|
|
DMA_BIDIRECTIONAL);
|
|
|
|
ret = dma_mapping_error(dev->dev, dsts[i]);
|
2012-12-17 23:59:53 +00:00
|
|
|
if (ret) {
|
2013-11-07 00:30:10 +00:00
|
|
|
dmaengine_unmap_put(um);
|
2013-11-07 00:29:58 +00:00
|
|
|
result("dst mapping error", total_tests,
|
|
|
|
src_off, dst_off, len, ret);
|
2012-12-17 23:59:53 +00:00
|
|
|
failed_tests++;
|
|
|
|
continue;
|
|
|
|
}
|
2013-11-07 00:30:10 +00:00
|
|
|
um->bidi_cnt++;
|
2009-03-25 16:13:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (thread->type == DMA_MEMCPY)
|
|
|
|
tx = dev->device_prep_dma_memcpy(chan,
|
2013-11-07 00:30:10 +00:00
|
|
|
dsts[0] + dst_off,
|
|
|
|
srcs[0], len, flags);
|
2009-03-25 16:13:25 +00:00
|
|
|
else if (thread->type == DMA_XOR)
|
|
|
|
tx = dev->device_prep_dma_xor(chan,
|
2013-11-07 00:30:10 +00:00
|
|
|
dsts[0] + dst_off,
|
|
|
|
srcs, src_cnt,
|
2009-03-25 16:13:25 +00:00
|
|
|
len, flags);
|
2009-08-30 02:09:27 +00:00
|
|
|
else if (thread->type == DMA_PQ) {
|
|
|
|
dma_addr_t dma_pq[dst_cnt];
|
|
|
|
|
|
|
|
for (i = 0; i < dst_cnt; i++)
|
2013-11-07 00:30:10 +00:00
|
|
|
dma_pq[i] = dsts[i] + dst_off;
|
|
|
|
tx = dev->device_prep_dma_pq(chan, dma_pq, srcs,
|
2010-02-15 21:35:23 +00:00
|
|
|
src_cnt, pq_coefs,
|
2009-08-30 02:09:27 +00:00
|
|
|
len, flags);
|
|
|
|
}
|
2009-01-13 16:22:20 +00:00
|
|
|
|
|
|
|
if (!tx) {
|
2013-11-07 00:30:10 +00:00
|
|
|
dmaengine_unmap_put(um);
|
2013-11-07 00:29:58 +00:00
|
|
|
result("prep error", total_tests, src_off,
|
|
|
|
dst_off, len, ret);
|
2009-01-13 16:22:20 +00:00
|
|
|
msleep(100);
|
|
|
|
failed_tests++;
|
|
|
|
continue;
|
|
|
|
}
|
2009-03-25 16:13:25 +00:00
|
|
|
|
2011-11-23 17:28:16 +00:00
|
|
|
done.done = false;
|
2009-03-25 16:13:25 +00:00
|
|
|
tx->callback = dmatest_callback;
|
2011-11-23 17:28:16 +00:00
|
|
|
tx->callback_param = &done;
|
2009-01-13 16:22:20 +00:00
|
|
|
cookie = tx->tx_submit(tx);
|
|
|
|
|
2008-07-08 18:58:45 +00:00
|
|
|
if (dma_submit_error(cookie)) {
|
2013-11-07 00:30:10 +00:00
|
|
|
dmaengine_unmap_put(um);
|
2013-11-07 00:29:58 +00:00
|
|
|
result("submit error", total_tests, src_off,
|
|
|
|
dst_off, len, ret);
|
2008-07-08 18:58:45 +00:00
|
|
|
msleep(100);
|
|
|
|
failed_tests++;
|
|
|
|
continue;
|
|
|
|
}
|
2009-03-25 16:13:25 +00:00
|
|
|
dma_async_issue_pending(chan);
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-05-23 11:29:53 +00:00
|
|
|
wait_event_freezable_timeout(done_wait, done.done,
|
2013-03-04 09:09:29 +00:00
|
|
|
msecs_to_jiffies(params->timeout));
|
2011-08-18 14:50:51 +00:00
|
|
|
|
2009-03-25 16:13:25 +00:00
|
|
|
status = dma_async_is_tx_complete(chan, cookie, NULL, NULL);
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2011-11-23 17:28:16 +00:00
|
|
|
if (!done.done) {
|
|
|
|
/*
|
|
|
|
* We're leaving the timed out dma operation with
|
|
|
|
* dangling pointer to done_wait. To make this
|
|
|
|
* correct, we'll need to allocate wait_done for
|
|
|
|
* each test iteration and perform "who's gonna
|
|
|
|
* free it this time?" dancing. For now, just
|
|
|
|
* leave it dangling.
|
|
|
|
*/
|
2013-11-07 00:30:10 +00:00
|
|
|
dmaengine_unmap_put(um);
|
2013-11-07 00:29:58 +00:00
|
|
|
result("test timed out", total_tests, src_off, dst_off,
|
|
|
|
len, 0);
|
2009-03-25 16:13:25 +00:00
|
|
|
failed_tests++;
|
|
|
|
continue;
|
2013-10-16 08:07:27 +00:00
|
|
|
} else if (status != DMA_COMPLETE) {
|
2013-11-07 00:30:10 +00:00
|
|
|
dmaengine_unmap_put(um);
|
2013-11-07 00:29:58 +00:00
|
|
|
result(status == DMA_ERROR ?
|
|
|
|
"completion error status" :
|
|
|
|
"completion busy status", total_tests, src_off,
|
|
|
|
dst_off, len, ret);
|
2008-07-08 18:58:45 +00:00
|
|
|
failed_tests++;
|
|
|
|
continue;
|
|
|
|
}
|
2009-03-25 16:13:25 +00:00
|
|
|
|
2013-11-07 00:30:10 +00:00
|
|
|
dmaengine_unmap_put(um);
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-11-07 00:30:05 +00:00
|
|
|
if (params->noverify) {
|
2013-11-08 20:26:26 +00:00
|
|
|
verbose_result("test passed", total_tests, src_off,
|
|
|
|
dst_off, len, 0);
|
2013-11-07 00:30:05 +00:00
|
|
|
continue;
|
|
|
|
}
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-11-07 00:29:58 +00:00
|
|
|
pr_debug("%s: verifying source buffer...\n", current->comm);
|
2013-11-07 00:30:05 +00:00
|
|
|
error_count = dmatest_verify(thread->srcs, 0, src_off,
|
2008-07-08 18:58:45 +00:00
|
|
|
0, PATTERN_SRC, true);
|
2013-11-07 00:29:57 +00:00
|
|
|
error_count += dmatest_verify(thread->srcs, src_off,
|
|
|
|
src_off + len, src_off,
|
|
|
|
PATTERN_SRC | PATTERN_COPY, true);
|
|
|
|
error_count += dmatest_verify(thread->srcs, src_off + len,
|
|
|
|
params->buf_size, src_off + len,
|
|
|
|
PATTERN_SRC, true);
|
|
|
|
|
2013-11-07 00:29:58 +00:00
|
|
|
pr_debug("%s: verifying dest buffer...\n", current->comm);
|
2013-11-07 00:29:57 +00:00
|
|
|
error_count += dmatest_verify(thread->dsts, 0, dst_off,
|
2008-07-08 18:58:45 +00:00
|
|
|
0, PATTERN_DST, false);
|
2013-11-07 00:29:57 +00:00
|
|
|
error_count += dmatest_verify(thread->dsts, dst_off,
|
|
|
|
dst_off + len, src_off,
|
|
|
|
PATTERN_SRC | PATTERN_COPY, false);
|
|
|
|
error_count += dmatest_verify(thread->dsts, dst_off + len,
|
|
|
|
params->buf_size, dst_off + len,
|
|
|
|
PATTERN_DST, false);
|
2008-07-08 18:58:45 +00:00
|
|
|
|
|
|
|
if (error_count) {
|
2013-11-07 00:29:58 +00:00
|
|
|
result("data error", total_tests, src_off, dst_off,
|
|
|
|
len, error_count);
|
2008-07-08 18:58:45 +00:00
|
|
|
failed_tests++;
|
|
|
|
} else {
|
2013-11-08 20:26:26 +00:00
|
|
|
verbose_result("test passed", total_tests, src_off,
|
|
|
|
dst_off, len, 0);
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
}
|
2013-11-07 00:30:07 +00:00
|
|
|
runtime = ktime_us_delta(ktime_get(), ktime);
|
2008-07-08 18:58:45 +00:00
|
|
|
|
|
|
|
ret = 0;
|
2014-08-22 12:19:44 +00:00
|
|
|
err_dstbuf:
|
2009-03-25 16:13:25 +00:00
|
|
|
for (i = 0; thread->dsts[i]; i++)
|
|
|
|
kfree(thread->dsts[i]);
|
|
|
|
kfree(thread->dsts);
|
|
|
|
err_dsts:
|
2014-08-22 12:19:44 +00:00
|
|
|
err_srcbuf:
|
2009-03-25 16:13:25 +00:00
|
|
|
for (i = 0; thread->srcs[i]; i++)
|
|
|
|
kfree(thread->srcs[i]);
|
|
|
|
kfree(thread->srcs);
|
|
|
|
err_srcs:
|
2013-03-04 09:09:26 +00:00
|
|
|
kfree(pq_coefs);
|
|
|
|
err_thread_type:
|
2013-11-07 00:30:07 +00:00
|
|
|
pr_info("%s: summary %u tests, %u failures %llu iops %llu KB/s (%d)\n",
|
|
|
|
current->comm, total_tests, failed_tests,
|
|
|
|
dmatest_persec(runtime, total_tests),
|
|
|
|
dmatest_KBs(runtime, total_len), ret);
|
2009-07-03 17:26:51 +00:00
|
|
|
|
2011-07-29 10:51:57 +00:00
|
|
|
/* terminate all transfers on specified channels */
|
2012-11-09 15:26:29 +00:00
|
|
|
if (ret)
|
|
|
|
dmaengine_terminate_all(chan);
|
|
|
|
|
2013-03-04 09:09:31 +00:00
|
|
|
thread->done = true;
|
2013-11-07 00:30:09 +00:00
|
|
|
wake_up(&thread_wait);
|
2009-07-03 17:26:51 +00:00
|
|
|
|
2008-07-08 18:58:45 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void dmatest_cleanup_channel(struct dmatest_chan *dtc)
|
|
|
|
{
|
|
|
|
struct dmatest_thread *thread;
|
|
|
|
struct dmatest_thread *_thread;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(thread, _thread, &dtc->threads, node) {
|
|
|
|
ret = kthread_stop(thread->task);
|
2013-11-07 00:30:00 +00:00
|
|
|
pr_debug("thread %s exited with status %d\n",
|
|
|
|
thread->task->comm, ret);
|
2008-07-08 18:58:45 +00:00
|
|
|
list_del(&thread->node);
|
2013-11-07 00:30:09 +00:00
|
|
|
put_task_struct(thread->task);
|
2008-07-08 18:58:45 +00:00
|
|
|
kfree(thread);
|
|
|
|
}
|
2011-07-29 10:51:57 +00:00
|
|
|
|
|
|
|
/* terminate all transfers on specified channels */
|
2012-11-11 23:03:20 +00:00
|
|
|
dmaengine_terminate_all(dtc->chan);
|
2011-07-29 10:51:57 +00:00
|
|
|
|
2008-07-08 18:58:45 +00:00
|
|
|
kfree(dtc);
|
|
|
|
}
|
|
|
|
|
2013-03-04 09:09:27 +00:00
|
|
|
static int dmatest_add_threads(struct dmatest_info *info,
|
|
|
|
struct dmatest_chan *dtc, enum dma_transaction_type type)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
2013-03-04 09:09:29 +00:00
|
|
|
struct dmatest_params *params = &info->params;
|
2009-03-25 16:13:25 +00:00
|
|
|
struct dmatest_thread *thread;
|
|
|
|
struct dma_chan *chan = dtc->chan;
|
|
|
|
char *op;
|
|
|
|
unsigned int i;
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2009-03-25 16:13:25 +00:00
|
|
|
if (type == DMA_MEMCPY)
|
|
|
|
op = "copy";
|
|
|
|
else if (type == DMA_XOR)
|
|
|
|
op = "xor";
|
2009-08-30 02:09:27 +00:00
|
|
|
else if (type == DMA_PQ)
|
|
|
|
op = "pq";
|
2009-03-25 16:13:25 +00:00
|
|
|
else
|
|
|
|
return -EINVAL;
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-03-04 09:09:29 +00:00
|
|
|
for (i = 0; i < params->threads_per_chan; i++) {
|
2008-07-08 18:58:45 +00:00
|
|
|
thread = kzalloc(sizeof(struct dmatest_thread), GFP_KERNEL);
|
|
|
|
if (!thread) {
|
2013-11-07 00:30:00 +00:00
|
|
|
pr_warn("No memory for %s-%s%u\n",
|
|
|
|
dma_chan_name(chan), op, i);
|
2008-07-08 18:58:45 +00:00
|
|
|
break;
|
|
|
|
}
|
2013-03-04 09:09:27 +00:00
|
|
|
thread->info = info;
|
2008-07-08 18:58:45 +00:00
|
|
|
thread->chan = dtc->chan;
|
2009-03-25 16:13:25 +00:00
|
|
|
thread->type = type;
|
2008-07-08 18:58:45 +00:00
|
|
|
smp_wmb();
|
2013-11-07 00:30:09 +00:00
|
|
|
thread->task = kthread_create(dmatest_func, thread, "%s-%s%u",
|
2009-03-25 16:13:25 +00:00
|
|
|
dma_chan_name(chan), op, i);
|
2008-07-08 18:58:45 +00:00
|
|
|
if (IS_ERR(thread->task)) {
|
2013-11-07 00:30:09 +00:00
|
|
|
pr_warn("Failed to create thread %s-%s%u\n",
|
2013-11-07 00:30:00 +00:00
|
|
|
dma_chan_name(chan), op, i);
|
2008-07-08 18:58:45 +00:00
|
|
|
kfree(thread);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* srcbuf and dstbuf are allocated by the thread itself */
|
2013-11-07 00:30:09 +00:00
|
|
|
get_task_struct(thread->task);
|
2008-07-08 18:58:45 +00:00
|
|
|
list_add_tail(&thread->node, &dtc->threads);
|
2013-11-07 00:30:09 +00:00
|
|
|
wake_up_process(thread->task);
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
2009-03-25 16:13:25 +00:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2013-03-04 09:09:27 +00:00
|
|
|
static int dmatest_add_channel(struct dmatest_info *info,
|
|
|
|
struct dma_chan *chan)
|
2009-03-25 16:13:25 +00:00
|
|
|
{
|
|
|
|
struct dmatest_chan *dtc;
|
|
|
|
struct dma_device *dma_dev = chan->device;
|
|
|
|
unsigned int thread_count = 0;
|
2010-07-17 15:19:48 +00:00
|
|
|
int cnt;
|
2009-03-25 16:13:25 +00:00
|
|
|
|
|
|
|
dtc = kmalloc(sizeof(struct dmatest_chan), GFP_KERNEL);
|
|
|
|
if (!dtc) {
|
2013-11-07 00:30:00 +00:00
|
|
|
pr_warn("No memory for %s\n", dma_chan_name(chan));
|
2009-03-25 16:13:25 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
dtc->chan = chan;
|
|
|
|
INIT_LIST_HEAD(&dtc->threads);
|
|
|
|
|
|
|
|
if (dma_has_cap(DMA_MEMCPY, dma_dev->cap_mask)) {
|
2013-03-04 09:09:27 +00:00
|
|
|
cnt = dmatest_add_threads(info, dtc, DMA_MEMCPY);
|
2009-07-06 16:19:44 +00:00
|
|
|
thread_count += cnt > 0 ? cnt : 0;
|
2009-03-25 16:13:25 +00:00
|
|
|
}
|
|
|
|
if (dma_has_cap(DMA_XOR, dma_dev->cap_mask)) {
|
2013-03-04 09:09:27 +00:00
|
|
|
cnt = dmatest_add_threads(info, dtc, DMA_XOR);
|
2009-07-06 16:19:44 +00:00
|
|
|
thread_count += cnt > 0 ? cnt : 0;
|
2009-03-25 16:13:25 +00:00
|
|
|
}
|
2009-08-30 02:09:27 +00:00
|
|
|
if (dma_has_cap(DMA_PQ, dma_dev->cap_mask)) {
|
2013-03-04 09:09:27 +00:00
|
|
|
cnt = dmatest_add_threads(info, dtc, DMA_PQ);
|
2011-08-25 23:13:55 +00:00
|
|
|
thread_count += cnt > 0 ? cnt : 0;
|
2009-08-30 02:09:27 +00:00
|
|
|
}
|
2009-03-25 16:13:25 +00:00
|
|
|
|
2013-11-07 00:30:00 +00:00
|
|
|
pr_info("Started %u threads using %s\n",
|
2009-03-25 16:13:25 +00:00
|
|
|
thread_count, dma_chan_name(chan));
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2013-03-04 09:09:28 +00:00
|
|
|
list_add_tail(&dtc->node, &info->channels);
|
|
|
|
info->nr_channels++;
|
2008-07-08 18:58:45 +00:00
|
|
|
|
2009-01-06 18:38:15 +00:00
|
|
|
return 0;
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
2009-01-06 18:38:19 +00:00
|
|
|
static bool filter(struct dma_chan *chan, void *param)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
2013-03-04 09:09:29 +00:00
|
|
|
struct dmatest_params *params = param;
|
2013-03-04 09:09:27 +00:00
|
|
|
|
2013-03-04 09:09:29 +00:00
|
|
|
if (!dmatest_match_channel(params, chan) ||
|
|
|
|
!dmatest_match_device(params, chan->device))
|
2009-01-06 18:38:19 +00:00
|
|
|
return false;
|
2009-01-06 18:38:15 +00:00
|
|
|
else
|
2009-01-06 18:38:19 +00:00
|
|
|
return true;
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:02 +00:00
|
|
|
static void request_channels(struct dmatest_info *info,
|
|
|
|
enum dma_transaction_type type)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
2009-01-06 18:38:15 +00:00
|
|
|
dma_cap_mask_t mask;
|
|
|
|
|
|
|
|
dma_cap_zero(mask);
|
2013-11-07 00:30:02 +00:00
|
|
|
dma_cap_set(type, mask);
|
2009-01-06 18:38:15 +00:00
|
|
|
for (;;) {
|
2013-11-07 00:30:02 +00:00
|
|
|
struct dmatest_params *params = &info->params;
|
|
|
|
struct dma_chan *chan;
|
|
|
|
|
2013-03-04 09:09:29 +00:00
|
|
|
chan = dma_request_channel(mask, filter, params);
|
2009-01-06 18:38:15 +00:00
|
|
|
if (chan) {
|
2013-11-07 00:30:02 +00:00
|
|
|
if (dmatest_add_channel(info, chan)) {
|
2009-01-06 18:38:15 +00:00
|
|
|
dma_release_channel(chan);
|
|
|
|
break; /* add_channel failed, punt */
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
break; /* no more channels available */
|
2013-03-04 09:09:29 +00:00
|
|
|
if (params->max_channels &&
|
|
|
|
info->nr_channels >= params->max_channels)
|
2009-01-06 18:38:15 +00:00
|
|
|
break; /* we have all we need */
|
|
|
|
}
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:02 +00:00
|
|
|
static void run_threaded_test(struct dmatest_info *info)
|
2013-03-04 09:09:30 +00:00
|
|
|
{
|
2013-11-07 00:30:02 +00:00
|
|
|
struct dmatest_params *params = &info->params;
|
2013-03-04 09:09:30 +00:00
|
|
|
|
2013-11-07 00:30:02 +00:00
|
|
|
/* Copy test parameters */
|
|
|
|
params->buf_size = test_buf_size;
|
|
|
|
strlcpy(params->channel, strim(test_channel), sizeof(params->channel));
|
|
|
|
strlcpy(params->device, strim(test_device), sizeof(params->device));
|
|
|
|
params->threads_per_chan = threads_per_chan;
|
|
|
|
params->max_channels = max_channels;
|
|
|
|
params->iterations = iterations;
|
|
|
|
params->xor_sources = xor_sources;
|
|
|
|
params->pq_sources = pq_sources;
|
|
|
|
params->timeout = timeout;
|
2013-11-07 00:30:05 +00:00
|
|
|
params->noverify = noverify;
|
2013-11-07 00:30:02 +00:00
|
|
|
|
|
|
|
request_channels(info, DMA_MEMCPY);
|
|
|
|
request_channels(info, DMA_XOR);
|
|
|
|
request_channels(info, DMA_PQ);
|
2013-03-04 09:09:30 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
static void stop_threaded_test(struct dmatest_info *info)
|
2008-07-08 18:58:45 +00:00
|
|
|
{
|
2009-01-06 18:38:15 +00:00
|
|
|
struct dmatest_chan *dtc, *_dtc;
|
2009-03-04 23:06:03 +00:00
|
|
|
struct dma_chan *chan;
|
2009-01-06 18:38:15 +00:00
|
|
|
|
2013-03-04 09:09:28 +00:00
|
|
|
list_for_each_entry_safe(dtc, _dtc, &info->channels, node) {
|
2009-01-06 18:38:15 +00:00
|
|
|
list_del(&dtc->node);
|
2009-03-04 23:06:03 +00:00
|
|
|
chan = dtc->chan;
|
2009-01-06 18:38:15 +00:00
|
|
|
dmatest_cleanup_channel(dtc);
|
2013-11-07 00:30:00 +00:00
|
|
|
pr_debug("dropped channel %s\n", dma_chan_name(chan));
|
2009-03-04 23:06:03 +00:00
|
|
|
dma_release_channel(chan);
|
2009-01-06 18:38:15 +00:00
|
|
|
}
|
2013-03-04 09:09:28 +00:00
|
|
|
|
|
|
|
info->nr_channels = 0;
|
2008-07-08 18:58:45 +00:00
|
|
|
}
|
2013-03-04 09:09:27 +00:00
|
|
|
|
2013-11-07 00:30:02 +00:00
|
|
|
static void restart_threaded_test(struct dmatest_info *info, bool run)
|
2013-03-04 09:09:30 +00:00
|
|
|
{
|
2013-11-07 00:30:01 +00:00
|
|
|
/* we might be called early to set run=, defer running until all
|
|
|
|
* parameters have been evaluated
|
|
|
|
*/
|
|
|
|
if (!info->did_init)
|
2013-11-07 00:30:02 +00:00
|
|
|
return;
|
2013-03-04 09:09:30 +00:00
|
|
|
|
|
|
|
/* Stop any running test first */
|
2013-11-07 00:30:01 +00:00
|
|
|
stop_threaded_test(info);
|
2013-03-04 09:09:30 +00:00
|
|
|
|
|
|
|
/* Run test with new parameters */
|
2013-11-07 00:30:02 +00:00
|
|
|
run_threaded_test(info);
|
2013-03-04 09:09:30 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
static int dmatest_run_get(char *val, const struct kernel_param *kp)
|
2013-03-04 09:09:30 +00:00
|
|
|
{
|
2013-11-07 00:30:01 +00:00
|
|
|
struct dmatest_info *info = &test_info;
|
2013-03-04 09:09:30 +00:00
|
|
|
|
|
|
|
mutex_lock(&info->lock);
|
2013-11-07 00:30:01 +00:00
|
|
|
if (is_threaded_test_run(info)) {
|
|
|
|
dmatest_run = true;
|
2013-03-04 09:09:31 +00:00
|
|
|
} else {
|
2013-11-07 00:30:01 +00:00
|
|
|
stop_threaded_test(info);
|
|
|
|
dmatest_run = false;
|
2013-03-04 09:09:31 +00:00
|
|
|
}
|
2013-03-04 09:09:30 +00:00
|
|
|
mutex_unlock(&info->lock);
|
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
return param_get_bool(val, kp);
|
2013-03-04 09:09:30 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
static int dmatest_run_set(const char *val, const struct kernel_param *kp)
|
2013-03-04 09:09:33 +00:00
|
|
|
{
|
2013-11-07 00:30:01 +00:00
|
|
|
struct dmatest_info *info = &test_info;
|
|
|
|
int ret;
|
2013-03-04 09:09:33 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
mutex_lock(&info->lock);
|
|
|
|
ret = param_set_bool(val, kp);
|
|
|
|
if (ret) {
|
2013-03-04 09:09:30 +00:00
|
|
|
mutex_unlock(&info->lock);
|
2013-11-07 00:30:01 +00:00
|
|
|
return ret;
|
2013-03-04 09:09:33 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
if (is_threaded_test_run(info))
|
|
|
|
ret = -EBUSY;
|
|
|
|
else if (dmatest_run)
|
2013-11-07 00:30:02 +00:00
|
|
|
restart_threaded_test(info, dmatest_run);
|
2013-03-04 09:09:30 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
mutex_unlock(&info->lock);
|
2013-03-04 09:09:30 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
return ret;
|
2013-03-04 09:09:30 +00:00
|
|
|
}
|
|
|
|
|
2013-03-04 09:09:27 +00:00
|
|
|
static int __init dmatest_init(void)
|
|
|
|
{
|
|
|
|
struct dmatest_info *info = &test_info;
|
2013-11-07 00:30:09 +00:00
|
|
|
struct dmatest_params *params = &info->params;
|
2013-03-04 09:09:27 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
if (dmatest_run) {
|
|
|
|
mutex_lock(&info->lock);
|
2013-11-07 00:30:02 +00:00
|
|
|
run_threaded_test(info);
|
2013-11-07 00:30:01 +00:00
|
|
|
mutex_unlock(&info->lock);
|
|
|
|
}
|
2013-03-04 09:09:28 +00:00
|
|
|
|
2013-11-07 00:30:09 +00:00
|
|
|
if (params->iterations && wait)
|
|
|
|
wait_event(thread_wait, !is_threaded_test_run(info));
|
2013-03-04 09:09:33 +00:00
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
/* module parameters are stable, inittime tests are started,
|
|
|
|
* let userspace take over 'run' control
|
|
|
|
*/
|
|
|
|
info->did_init = true;
|
2013-03-04 09:09:30 +00:00
|
|
|
|
|
|
|
return 0;
|
2013-03-04 09:09:27 +00:00
|
|
|
}
|
|
|
|
/* when compiled-in wait for drivers to load first */
|
|
|
|
late_initcall(dmatest_init);
|
|
|
|
|
|
|
|
static void __exit dmatest_exit(void)
|
|
|
|
{
|
|
|
|
struct dmatest_info *info = &test_info;
|
|
|
|
|
2013-11-07 00:30:01 +00:00
|
|
|
mutex_lock(&info->lock);
|
2013-03-04 09:09:27 +00:00
|
|
|
stop_threaded_test(info);
|
2013-11-07 00:30:01 +00:00
|
|
|
mutex_unlock(&info->lock);
|
2013-03-04 09:09:27 +00:00
|
|
|
}
|
2008-07-08 18:58:45 +00:00
|
|
|
module_exit(dmatest_exit);
|
|
|
|
|
2011-05-18 14:49:24 +00:00
|
|
|
MODULE_AUTHOR("Haavard Skinnemoen (Atmel)");
|
2008-07-08 18:58:45 +00:00
|
|
|
MODULE_LICENSE("GPL v2");
|