blob: 1d6e48f9cd02679da86e0e73839aebe55d5b2302 [file] [log] [blame]
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -07001/*
2 * DMA Engine test module
3 *
4 * Copyright (C) 2007 Atmel Corporation
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
9 */
10#include <linux/delay.h>
11#include <linux/dmaengine.h>
12#include <linux/init.h>
13#include <linux/kthread.h>
14#include <linux/module.h>
15#include <linux/moduleparam.h>
16#include <linux/random.h>
17#include <linux/wait.h>
18
19static unsigned int test_buf_size = 16384;
20module_param(test_buf_size, uint, S_IRUGO);
21MODULE_PARM_DESC(test_buf_size, "Size of the memcpy test buffer");
22
Kay Sievers06190d82008-11-11 13:12:33 -070023static char test_channel[20];
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -070024module_param_string(channel, test_channel, sizeof(test_channel), S_IRUGO);
25MODULE_PARM_DESC(channel, "Bus ID of the channel to test (default: any)");
26
Kay Sievers06190d82008-11-11 13:12:33 -070027static char test_device[20];
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -070028module_param_string(device, test_device, sizeof(test_device), S_IRUGO);
29MODULE_PARM_DESC(device, "Bus ID of the DMA Engine to test (default: any)");
30
31static unsigned int threads_per_chan = 1;
32module_param(threads_per_chan, uint, S_IRUGO);
33MODULE_PARM_DESC(threads_per_chan,
34 "Number of threads to start per channel (default: 1)");
35
36static unsigned int max_channels;
37module_param(max_channels, uint, S_IRUGO);
Dan Williams33df8ca2009-01-06 11:38:15 -070038MODULE_PARM_DESC(max_channels,
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -070039 "Maximum number of channels to use (default: all)");
40
41/*
42 * Initialization patterns. All bytes in the source buffer has bit 7
43 * set, all bytes in the destination buffer has bit 7 cleared.
44 *
45 * Bit 6 is set for all bytes which are to be copied by the DMA
46 * engine. Bit 5 is set for all bytes which are to be overwritten by
47 * the DMA engine.
48 *
49 * The remaining bits are the inverse of a counter which increments by
50 * one for each byte address.
51 */
52#define PATTERN_SRC 0x80
53#define PATTERN_DST 0x00
54#define PATTERN_COPY 0x40
55#define PATTERN_OVERWRITE 0x20
56#define PATTERN_COUNT_MASK 0x1f
57
58struct dmatest_thread {
59 struct list_head node;
60 struct task_struct *task;
61 struct dma_chan *chan;
62 u8 *srcbuf;
63 u8 *dstbuf;
64};
65
66struct dmatest_chan {
67 struct list_head node;
68 struct dma_chan *chan;
69 struct list_head threads;
70};
71
72/*
73 * These are protected by dma_list_mutex since they're only used by
Dan Williams33df8ca2009-01-06 11:38:15 -070074 * the DMA filter function callback
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -070075 */
76static LIST_HEAD(dmatest_channels);
77static unsigned int nr_channels;
78
79static bool dmatest_match_channel(struct dma_chan *chan)
80{
81 if (test_channel[0] == '\0')
82 return true;
Kay Sievers06190d82008-11-11 13:12:33 -070083 return strcmp(dev_name(&chan->dev), test_channel) == 0;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -070084}
85
86static bool dmatest_match_device(struct dma_device *device)
87{
88 if (test_device[0] == '\0')
89 return true;
Kay Sievers06190d82008-11-11 13:12:33 -070090 return strcmp(dev_name(device->dev), test_device) == 0;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -070091}
92
93static unsigned long dmatest_random(void)
94{
95 unsigned long buf;
96
97 get_random_bytes(&buf, sizeof(buf));
98 return buf;
99}
100
101static void dmatest_init_srcbuf(u8 *buf, unsigned int start, unsigned int len)
102{
103 unsigned int i;
104
105 for (i = 0; i < start; i++)
106 buf[i] = PATTERN_SRC | (~i & PATTERN_COUNT_MASK);
107 for ( ; i < start + len; i++)
108 buf[i] = PATTERN_SRC | PATTERN_COPY
109 | (~i & PATTERN_COUNT_MASK);;
110 for ( ; i < test_buf_size; i++)
111 buf[i] = PATTERN_SRC | (~i & PATTERN_COUNT_MASK);
112}
113
114static void dmatest_init_dstbuf(u8 *buf, unsigned int start, unsigned int len)
115{
116 unsigned int i;
117
118 for (i = 0; i < start; i++)
119 buf[i] = PATTERN_DST | (~i & PATTERN_COUNT_MASK);
120 for ( ; i < start + len; i++)
121 buf[i] = PATTERN_DST | PATTERN_OVERWRITE
122 | (~i & PATTERN_COUNT_MASK);
123 for ( ; i < test_buf_size; i++)
124 buf[i] = PATTERN_DST | (~i & PATTERN_COUNT_MASK);
125}
126
127static void dmatest_mismatch(u8 actual, u8 pattern, unsigned int index,
128 unsigned int counter, bool is_srcbuf)
129{
130 u8 diff = actual ^ pattern;
131 u8 expected = pattern | (~counter & PATTERN_COUNT_MASK);
132 const char *thread_name = current->comm;
133
134 if (is_srcbuf)
135 pr_warning("%s: srcbuf[0x%x] overwritten!"
136 " Expected %02x, got %02x\n",
137 thread_name, index, expected, actual);
138 else if ((pattern & PATTERN_COPY)
139 && (diff & (PATTERN_COPY | PATTERN_OVERWRITE)))
140 pr_warning("%s: dstbuf[0x%x] not copied!"
141 " Expected %02x, got %02x\n",
142 thread_name, index, expected, actual);
143 else if (diff & PATTERN_SRC)
144 pr_warning("%s: dstbuf[0x%x] was copied!"
145 " Expected %02x, got %02x\n",
146 thread_name, index, expected, actual);
147 else
148 pr_warning("%s: dstbuf[0x%x] mismatch!"
149 " Expected %02x, got %02x\n",
150 thread_name, index, expected, actual);
151}
152
153static unsigned int dmatest_verify(u8 *buf, unsigned int start,
154 unsigned int end, unsigned int counter, u8 pattern,
155 bool is_srcbuf)
156{
157 unsigned int i;
158 unsigned int error_count = 0;
159 u8 actual;
160
161 for (i = start; i < end; i++) {
162 actual = buf[i];
163 if (actual != (pattern | (~counter & PATTERN_COUNT_MASK))) {
164 if (error_count < 32)
165 dmatest_mismatch(actual, pattern, i, counter,
166 is_srcbuf);
167 error_count++;
168 }
169 counter++;
170 }
171
172 if (error_count > 32)
173 pr_warning("%s: %u errors suppressed\n",
174 current->comm, error_count - 32);
175
176 return error_count;
177}
178
179/*
180 * This function repeatedly tests DMA transfers of various lengths and
181 * offsets until it is told to exit by kthread_stop(). There may be
182 * multiple threads running this function in parallel for a single
183 * channel, and there may be multiple channels being tested in
184 * parallel.
185 *
186 * Before each test, the source and destination buffer is initialized
187 * with a known pattern. This pattern is different depending on
188 * whether it's in an area which is supposed to be copied or
189 * overwritten, and different in the source and destination buffers.
190 * So if the DMA engine doesn't copy exactly what we tell it to copy,
191 * we'll notice.
192 */
193static int dmatest_func(void *data)
194{
195 struct dmatest_thread *thread = data;
196 struct dma_chan *chan;
197 const char *thread_name;
198 unsigned int src_off, dst_off, len;
199 unsigned int error_count;
200 unsigned int failed_tests = 0;
201 unsigned int total_tests = 0;
202 dma_cookie_t cookie;
203 enum dma_status status;
204 int ret;
205
206 thread_name = current->comm;
207
208 ret = -ENOMEM;
209 thread->srcbuf = kmalloc(test_buf_size, GFP_KERNEL);
210 if (!thread->srcbuf)
211 goto err_srcbuf;
212 thread->dstbuf = kmalloc(test_buf_size, GFP_KERNEL);
213 if (!thread->dstbuf)
214 goto err_dstbuf;
215
216 smp_rmb();
217 chan = thread->chan;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700218
219 while (!kthread_should_stop()) {
220 total_tests++;
221
222 len = dmatest_random() % test_buf_size + 1;
223 src_off = dmatest_random() % (test_buf_size - len + 1);
224 dst_off = dmatest_random() % (test_buf_size - len + 1);
225
226 dmatest_init_srcbuf(thread->srcbuf, src_off, len);
227 dmatest_init_dstbuf(thread->dstbuf, dst_off, len);
228
229 cookie = dma_async_memcpy_buf_to_buf(chan,
230 thread->dstbuf + dst_off,
231 thread->srcbuf + src_off,
232 len);
233 if (dma_submit_error(cookie)) {
234 pr_warning("%s: #%u: submit error %d with src_off=0x%x "
235 "dst_off=0x%x len=0x%x\n",
236 thread_name, total_tests - 1, cookie,
237 src_off, dst_off, len);
238 msleep(100);
239 failed_tests++;
240 continue;
241 }
242 dma_async_memcpy_issue_pending(chan);
243
244 do {
245 msleep(1);
246 status = dma_async_memcpy_complete(
247 chan, cookie, NULL, NULL);
248 } while (status == DMA_IN_PROGRESS);
249
250 if (status == DMA_ERROR) {
251 pr_warning("%s: #%u: error during copy\n",
252 thread_name, total_tests - 1);
253 failed_tests++;
254 continue;
255 }
256
257 error_count = 0;
258
259 pr_debug("%s: verifying source buffer...\n", thread_name);
260 error_count += dmatest_verify(thread->srcbuf, 0, src_off,
261 0, PATTERN_SRC, true);
262 error_count += dmatest_verify(thread->srcbuf, src_off,
263 src_off + len, src_off,
264 PATTERN_SRC | PATTERN_COPY, true);
265 error_count += dmatest_verify(thread->srcbuf, src_off + len,
266 test_buf_size, src_off + len,
267 PATTERN_SRC, true);
268
269 pr_debug("%s: verifying dest buffer...\n",
270 thread->task->comm);
271 error_count += dmatest_verify(thread->dstbuf, 0, dst_off,
272 0, PATTERN_DST, false);
273 error_count += dmatest_verify(thread->dstbuf, dst_off,
274 dst_off + len, src_off,
275 PATTERN_SRC | PATTERN_COPY, false);
276 error_count += dmatest_verify(thread->dstbuf, dst_off + len,
277 test_buf_size, dst_off + len,
278 PATTERN_DST, false);
279
280 if (error_count) {
281 pr_warning("%s: #%u: %u errors with "
282 "src_off=0x%x dst_off=0x%x len=0x%x\n",
283 thread_name, total_tests - 1, error_count,
284 src_off, dst_off, len);
285 failed_tests++;
286 } else {
287 pr_debug("%s: #%u: No errors with "
288 "src_off=0x%x dst_off=0x%x len=0x%x\n",
289 thread_name, total_tests - 1,
290 src_off, dst_off, len);
291 }
292 }
293
294 ret = 0;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700295 kfree(thread->dstbuf);
296err_dstbuf:
297 kfree(thread->srcbuf);
298err_srcbuf:
299 pr_notice("%s: terminating after %u tests, %u failures (status %d)\n",
300 thread_name, total_tests, failed_tests, ret);
301 return ret;
302}
303
304static void dmatest_cleanup_channel(struct dmatest_chan *dtc)
305{
306 struct dmatest_thread *thread;
307 struct dmatest_thread *_thread;
308 int ret;
309
310 list_for_each_entry_safe(thread, _thread, &dtc->threads, node) {
311 ret = kthread_stop(thread->task);
312 pr_debug("dmatest: thread %s exited with status %d\n",
313 thread->task->comm, ret);
314 list_del(&thread->node);
315 kfree(thread);
316 }
317 kfree(dtc);
318}
319
Dan Williams33df8ca2009-01-06 11:38:15 -0700320static int dmatest_add_channel(struct dma_chan *chan)
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700321{
322 struct dmatest_chan *dtc;
323 struct dmatest_thread *thread;
324 unsigned int i;
325
Andrew Morton6fdb8bd2008-09-19 04:16:23 -0700326 dtc = kmalloc(sizeof(struct dmatest_chan), GFP_KERNEL);
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700327 if (!dtc) {
Kay Sievers06190d82008-11-11 13:12:33 -0700328 pr_warning("dmatest: No memory for %s\n", dev_name(&chan->dev));
Dan Williams33df8ca2009-01-06 11:38:15 -0700329 return -ENOMEM;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700330 }
331
332 dtc->chan = chan;
333 INIT_LIST_HEAD(&dtc->threads);
334
335 for (i = 0; i < threads_per_chan; i++) {
336 thread = kzalloc(sizeof(struct dmatest_thread), GFP_KERNEL);
337 if (!thread) {
338 pr_warning("dmatest: No memory for %s-test%u\n",
Kay Sievers06190d82008-11-11 13:12:33 -0700339 dev_name(&chan->dev), i);
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700340 break;
341 }
342 thread->chan = dtc->chan;
343 smp_wmb();
344 thread->task = kthread_run(dmatest_func, thread, "%s-test%u",
Kay Sievers06190d82008-11-11 13:12:33 -0700345 dev_name(&chan->dev), i);
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700346 if (IS_ERR(thread->task)) {
347 pr_warning("dmatest: Failed to run thread %s-test%u\n",
Kay Sievers06190d82008-11-11 13:12:33 -0700348 dev_name(&chan->dev), i);
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700349 kfree(thread);
350 break;
351 }
352
353 /* srcbuf and dstbuf are allocated by the thread itself */
354
355 list_add_tail(&thread->node, &dtc->threads);
356 }
357
Kay Sievers06190d82008-11-11 13:12:33 -0700358 pr_info("dmatest: Started %u threads using %s\n", i, dev_name(&chan->dev));
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700359
360 list_add_tail(&dtc->node, &dmatest_channels);
361 nr_channels++;
362
Dan Williams33df8ca2009-01-06 11:38:15 -0700363 return 0;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700364}
365
Dan Williams33df8ca2009-01-06 11:38:15 -0700366static enum dma_state_client filter(struct dma_chan *chan, void *param)
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700367{
Dan Williams33df8ca2009-01-06 11:38:15 -0700368 if (!dmatest_match_channel(chan) || !dmatest_match_device(chan->device))
369 return DMA_DUP;
370 else
371 return DMA_ACK;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700372}
373
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700374static int __init dmatest_init(void)
375{
Dan Williams33df8ca2009-01-06 11:38:15 -0700376 dma_cap_mask_t mask;
377 struct dma_chan *chan;
378 int err = 0;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700379
Dan Williams33df8ca2009-01-06 11:38:15 -0700380 dma_cap_zero(mask);
381 dma_cap_set(DMA_MEMCPY, mask);
382 for (;;) {
383 chan = dma_request_channel(mask, filter, NULL);
384 if (chan) {
385 err = dmatest_add_channel(chan);
386 if (err == 0)
387 continue;
388 else {
389 dma_release_channel(chan);
390 break; /* add_channel failed, punt */
391 }
392 } else
393 break; /* no more channels available */
394 if (max_channels && nr_channels >= max_channels)
395 break; /* we have all we need */
396 }
397
398 return err;
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700399}
Dan Williams33df8ca2009-01-06 11:38:15 -0700400/* when compiled-in wait for drivers to load first */
401late_initcall(dmatest_init);
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700402
403static void __exit dmatest_exit(void)
404{
Dan Williams33df8ca2009-01-06 11:38:15 -0700405 struct dmatest_chan *dtc, *_dtc;
406
407 list_for_each_entry_safe(dtc, _dtc, &dmatest_channels, node) {
408 list_del(&dtc->node);
409 dmatest_cleanup_channel(dtc);
410 pr_debug("dmatest: dropped channel %s\n",
411 dev_name(&dtc->chan->dev));
412 dma_release_channel(dtc->chan);
413 }
Haavard Skinnemoen4a776f02008-07-08 11:58:45 -0700414}
415module_exit(dmatest_exit);
416
417MODULE_AUTHOR("Haavard Skinnemoen <hskinnemoen@atmel.com>");
418MODULE_LICENSE("GPL v2");