Commit | Line | Data |
---|---|---|
4a776f0a HS |
1 | /* |
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 | ||
19 | static unsigned int test_buf_size = 16384; | |
20 | module_param(test_buf_size, uint, S_IRUGO); | |
21 | MODULE_PARM_DESC(test_buf_size, "Size of the memcpy test buffer"); | |
22 | ||
06190d84 | 23 | static char test_channel[20]; |
4a776f0a HS |
24 | module_param_string(channel, test_channel, sizeof(test_channel), S_IRUGO); |
25 | MODULE_PARM_DESC(channel, "Bus ID of the channel to test (default: any)"); | |
26 | ||
06190d84 | 27 | static char test_device[20]; |
4a776f0a HS |
28 | module_param_string(device, test_device, sizeof(test_device), S_IRUGO); |
29 | MODULE_PARM_DESC(device, "Bus ID of the DMA Engine to test (default: any)"); | |
30 | ||
31 | static unsigned int threads_per_chan = 1; | |
32 | module_param(threads_per_chan, uint, S_IRUGO); | |
33 | MODULE_PARM_DESC(threads_per_chan, | |
34 | "Number of threads to start per channel (default: 1)"); | |
35 | ||
36 | static unsigned int max_channels; | |
37 | module_param(max_channels, uint, S_IRUGO); | |
33df8ca0 | 38 | MODULE_PARM_DESC(max_channels, |
4a776f0a HS |
39 | "Maximum number of channels to use (default: all)"); |
40 | ||
0a2ff57d NF |
41 | static unsigned int iterations; |
42 | module_param(iterations, uint, S_IRUGO); | |
43 | MODULE_PARM_DESC(iterations, | |
44 | "Iterations before stopping test (default: infinite)"); | |
45 | ||
b54d5cb9 DW |
46 | static unsigned int xor_sources = 3; |
47 | module_param(xor_sources, uint, S_IRUGO); | |
48 | MODULE_PARM_DESC(xor_sources, | |
49 | "Number of xor source buffers (default: 3)"); | |
50 | ||
4a776f0a HS |
51 | /* |
52 | * Initialization patterns. All bytes in the source buffer has bit 7 | |
53 | * set, all bytes in the destination buffer has bit 7 cleared. | |
54 | * | |
55 | * Bit 6 is set for all bytes which are to be copied by the DMA | |
56 | * engine. Bit 5 is set for all bytes which are to be overwritten by | |
57 | * the DMA engine. | |
58 | * | |
59 | * The remaining bits are the inverse of a counter which increments by | |
60 | * one for each byte address. | |
61 | */ | |
62 | #define PATTERN_SRC 0x80 | |
63 | #define PATTERN_DST 0x00 | |
64 | #define PATTERN_COPY 0x40 | |
65 | #define PATTERN_OVERWRITE 0x20 | |
66 | #define PATTERN_COUNT_MASK 0x1f | |
67 | ||
68 | struct dmatest_thread { | |
69 | struct list_head node; | |
70 | struct task_struct *task; | |
71 | struct dma_chan *chan; | |
b54d5cb9 DW |
72 | u8 **srcs; |
73 | u8 **dsts; | |
74 | enum dma_transaction_type type; | |
4a776f0a HS |
75 | }; |
76 | ||
77 | struct dmatest_chan { | |
78 | struct list_head node; | |
79 | struct dma_chan *chan; | |
80 | struct list_head threads; | |
81 | }; | |
82 | ||
83 | /* | |
84 | * These are protected by dma_list_mutex since they're only used by | |
33df8ca0 | 85 | * the DMA filter function callback |
4a776f0a HS |
86 | */ |
87 | static LIST_HEAD(dmatest_channels); | |
88 | static unsigned int nr_channels; | |
89 | ||
90 | static bool dmatest_match_channel(struct dma_chan *chan) | |
91 | { | |
92 | if (test_channel[0] == '\0') | |
93 | return true; | |
41d5e59c | 94 | return strcmp(dma_chan_name(chan), test_channel) == 0; |
4a776f0a HS |
95 | } |
96 | ||
97 | static bool dmatest_match_device(struct dma_device *device) | |
98 | { | |
99 | if (test_device[0] == '\0') | |
100 | return true; | |
06190d84 | 101 | return strcmp(dev_name(device->dev), test_device) == 0; |
4a776f0a HS |
102 | } |
103 | ||
104 | static unsigned long dmatest_random(void) | |
105 | { | |
106 | unsigned long buf; | |
107 | ||
108 | get_random_bytes(&buf, sizeof(buf)); | |
109 | return buf; | |
110 | } | |
111 | ||
b54d5cb9 | 112 | static void dmatest_init_srcs(u8 **bufs, unsigned int start, unsigned int len) |
4a776f0a HS |
113 | { |
114 | unsigned int i; | |
b54d5cb9 DW |
115 | u8 *buf; |
116 | ||
117 | for (; (buf = *bufs); bufs++) { | |
118 | for (i = 0; i < start; i++) | |
119 | buf[i] = PATTERN_SRC | (~i & PATTERN_COUNT_MASK); | |
120 | for ( ; i < start + len; i++) | |
121 | buf[i] = PATTERN_SRC | PATTERN_COPY | |
c019894e | 122 | | (~i & PATTERN_COUNT_MASK); |
b54d5cb9 DW |
123 | for ( ; i < test_buf_size; i++) |
124 | buf[i] = PATTERN_SRC | (~i & PATTERN_COUNT_MASK); | |
125 | buf++; | |
126 | } | |
4a776f0a HS |
127 | } |
128 | ||
b54d5cb9 | 129 | static void dmatest_init_dsts(u8 **bufs, unsigned int start, unsigned int len) |
4a776f0a HS |
130 | { |
131 | unsigned int i; | |
b54d5cb9 DW |
132 | u8 *buf; |
133 | ||
134 | for (; (buf = *bufs); bufs++) { | |
135 | for (i = 0; i < start; i++) | |
136 | buf[i] = PATTERN_DST | (~i & PATTERN_COUNT_MASK); | |
137 | for ( ; i < start + len; i++) | |
138 | buf[i] = PATTERN_DST | PATTERN_OVERWRITE | |
139 | | (~i & PATTERN_COUNT_MASK); | |
140 | for ( ; i < test_buf_size; i++) | |
141 | buf[i] = PATTERN_DST | (~i & PATTERN_COUNT_MASK); | |
142 | } | |
4a776f0a HS |
143 | } |
144 | ||
145 | static void dmatest_mismatch(u8 actual, u8 pattern, unsigned int index, | |
146 | unsigned int counter, bool is_srcbuf) | |
147 | { | |
148 | u8 diff = actual ^ pattern; | |
149 | u8 expected = pattern | (~counter & PATTERN_COUNT_MASK); | |
150 | const char *thread_name = current->comm; | |
151 | ||
152 | if (is_srcbuf) | |
153 | pr_warning("%s: srcbuf[0x%x] overwritten!" | |
154 | " Expected %02x, got %02x\n", | |
155 | thread_name, index, expected, actual); | |
156 | else if ((pattern & PATTERN_COPY) | |
157 | && (diff & (PATTERN_COPY | PATTERN_OVERWRITE))) | |
158 | pr_warning("%s: dstbuf[0x%x] not copied!" | |
159 | " Expected %02x, got %02x\n", | |
160 | thread_name, index, expected, actual); | |
161 | else if (diff & PATTERN_SRC) | |
162 | pr_warning("%s: dstbuf[0x%x] was copied!" | |
163 | " Expected %02x, got %02x\n", | |
164 | thread_name, index, expected, actual); | |
165 | else | |
166 | pr_warning("%s: dstbuf[0x%x] mismatch!" | |
167 | " Expected %02x, got %02x\n", | |
168 | thread_name, index, expected, actual); | |
169 | } | |
170 | ||
b54d5cb9 | 171 | static unsigned int dmatest_verify(u8 **bufs, unsigned int start, |
4a776f0a HS |
172 | unsigned int end, unsigned int counter, u8 pattern, |
173 | bool is_srcbuf) | |
174 | { | |
175 | unsigned int i; | |
176 | unsigned int error_count = 0; | |
177 | u8 actual; | |
b54d5cb9 DW |
178 | u8 expected; |
179 | u8 *buf; | |
180 | unsigned int counter_orig = counter; | |
181 | ||
182 | for (; (buf = *bufs); bufs++) { | |
183 | counter = counter_orig; | |
184 | for (i = start; i < end; i++) { | |
185 | actual = buf[i]; | |
186 | expected = pattern | (~counter & PATTERN_COUNT_MASK); | |
187 | if (actual != expected) { | |
188 | if (error_count < 32) | |
189 | dmatest_mismatch(actual, pattern, i, | |
190 | counter, is_srcbuf); | |
191 | error_count++; | |
192 | } | |
193 | counter++; | |
4a776f0a | 194 | } |
4a776f0a HS |
195 | } |
196 | ||
197 | if (error_count > 32) | |
198 | pr_warning("%s: %u errors suppressed\n", | |
199 | current->comm, error_count - 32); | |
200 | ||
201 | return error_count; | |
202 | } | |
203 | ||
e44e0aa3 DW |
204 | static void dmatest_callback(void *completion) |
205 | { | |
206 | complete(completion); | |
207 | } | |
208 | ||
4a776f0a HS |
209 | /* |
210 | * This function repeatedly tests DMA transfers of various lengths and | |
b54d5cb9 DW |
211 | * offsets for a given operation type until it is told to exit by |
212 | * kthread_stop(). There may be multiple threads running this function | |
213 | * in parallel for a single channel, and there may be multiple channels | |
214 | * being tested in parallel. | |
4a776f0a HS |
215 | * |
216 | * Before each test, the source and destination buffer is initialized | |
217 | * with a known pattern. This pattern is different depending on | |
218 | * whether it's in an area which is supposed to be copied or | |
219 | * overwritten, and different in the source and destination buffers. | |
220 | * So if the DMA engine doesn't copy exactly what we tell it to copy, | |
221 | * we'll notice. | |
222 | */ | |
223 | static int dmatest_func(void *data) | |
224 | { | |
225 | struct dmatest_thread *thread = data; | |
226 | struct dma_chan *chan; | |
227 | const char *thread_name; | |
228 | unsigned int src_off, dst_off, len; | |
229 | unsigned int error_count; | |
230 | unsigned int failed_tests = 0; | |
231 | unsigned int total_tests = 0; | |
232 | dma_cookie_t cookie; | |
233 | enum dma_status status; | |
b54d5cb9 | 234 | enum dma_ctrl_flags flags; |
4a776f0a | 235 | int ret; |
b54d5cb9 DW |
236 | int src_cnt; |
237 | int dst_cnt; | |
238 | int i; | |
4a776f0a HS |
239 | |
240 | thread_name = current->comm; | |
241 | ||
242 | ret = -ENOMEM; | |
4a776f0a HS |
243 | |
244 | smp_rmb(); | |
245 | chan = thread->chan; | |
b54d5cb9 DW |
246 | if (thread->type == DMA_MEMCPY) |
247 | src_cnt = dst_cnt = 1; | |
248 | else if (thread->type == DMA_XOR) { | |
249 | src_cnt = xor_sources | 1; /* force odd to ensure dst = src */ | |
250 | dst_cnt = 1; | |
251 | } else | |
252 | goto err_srcs; | |
253 | ||
254 | thread->srcs = kcalloc(src_cnt+1, sizeof(u8 *), GFP_KERNEL); | |
255 | if (!thread->srcs) | |
256 | goto err_srcs; | |
257 | for (i = 0; i < src_cnt; i++) { | |
258 | thread->srcs[i] = kmalloc(test_buf_size, GFP_KERNEL); | |
259 | if (!thread->srcs[i]) | |
260 | goto err_srcbuf; | |
261 | } | |
262 | thread->srcs[i] = NULL; | |
263 | ||
264 | thread->dsts = kcalloc(dst_cnt+1, sizeof(u8 *), GFP_KERNEL); | |
265 | if (!thread->dsts) | |
266 | goto err_dsts; | |
267 | for (i = 0; i < dst_cnt; i++) { | |
268 | thread->dsts[i] = kmalloc(test_buf_size, GFP_KERNEL); | |
269 | if (!thread->dsts[i]) | |
270 | goto err_dstbuf; | |
271 | } | |
272 | thread->dsts[i] = NULL; | |
273 | ||
e44e0aa3 DW |
274 | set_user_nice(current, 10); |
275 | ||
276 | flags = DMA_CTRL_ACK | DMA_COMPL_SKIP_DEST_UNMAP | DMA_PREP_INTERRUPT; | |
4a776f0a | 277 | |
0a2ff57d NF |
278 | while (!kthread_should_stop() |
279 | && !(iterations && total_tests >= iterations)) { | |
d86be86e | 280 | struct dma_device *dev = chan->device; |
b54d5cb9 DW |
281 | struct dma_async_tx_descriptor *tx = NULL; |
282 | dma_addr_t dma_srcs[src_cnt]; | |
283 | dma_addr_t dma_dsts[dst_cnt]; | |
e44e0aa3 DW |
284 | struct completion cmp; |
285 | unsigned long tmo = msecs_to_jiffies(3000); | |
d86be86e | 286 | |
4a776f0a HS |
287 | total_tests++; |
288 | ||
289 | len = dmatest_random() % test_buf_size + 1; | |
290 | src_off = dmatest_random() % (test_buf_size - len + 1); | |
291 | dst_off = dmatest_random() % (test_buf_size - len + 1); | |
292 | ||
b54d5cb9 DW |
293 | dmatest_init_srcs(thread->srcs, src_off, len); |
294 | dmatest_init_dsts(thread->dsts, dst_off, len); | |
4a776f0a | 295 | |
b54d5cb9 DW |
296 | for (i = 0; i < src_cnt; i++) { |
297 | u8 *buf = thread->srcs[i] + src_off; | |
298 | ||
299 | dma_srcs[i] = dma_map_single(dev->dev, buf, len, | |
300 | DMA_TO_DEVICE); | |
301 | } | |
d86be86e | 302 | /* map with DMA_BIDIRECTIONAL to force writeback/invalidate */ |
b54d5cb9 DW |
303 | for (i = 0; i < dst_cnt; i++) { |
304 | dma_dsts[i] = dma_map_single(dev->dev, thread->dsts[i], | |
305 | test_buf_size, | |
306 | DMA_BIDIRECTIONAL); | |
307 | } | |
308 | ||
309 | if (thread->type == DMA_MEMCPY) | |
310 | tx = dev->device_prep_dma_memcpy(chan, | |
311 | dma_dsts[0] + dst_off, | |
312 | dma_srcs[0], len, | |
313 | flags); | |
314 | else if (thread->type == DMA_XOR) | |
315 | tx = dev->device_prep_dma_xor(chan, | |
316 | dma_dsts[0] + dst_off, | |
317 | dma_srcs, xor_sources, | |
318 | len, flags); | |
d86be86e | 319 | |
d86be86e | 320 | if (!tx) { |
b54d5cb9 DW |
321 | for (i = 0; i < src_cnt; i++) |
322 | dma_unmap_single(dev->dev, dma_srcs[i], len, | |
323 | DMA_TO_DEVICE); | |
324 | for (i = 0; i < dst_cnt; i++) | |
325 | dma_unmap_single(dev->dev, dma_dsts[i], | |
326 | test_buf_size, | |
327 | DMA_BIDIRECTIONAL); | |
d86be86e AN |
328 | pr_warning("%s: #%u: prep error with src_off=0x%x " |
329 | "dst_off=0x%x len=0x%x\n", | |
330 | thread_name, total_tests - 1, | |
331 | src_off, dst_off, len); | |
332 | msleep(100); | |
333 | failed_tests++; | |
334 | continue; | |
335 | } | |
e44e0aa3 DW |
336 | |
337 | init_completion(&cmp); | |
338 | tx->callback = dmatest_callback; | |
339 | tx->callback_param = &cmp; | |
d86be86e AN |
340 | cookie = tx->tx_submit(tx); |
341 | ||
4a776f0a HS |
342 | if (dma_submit_error(cookie)) { |
343 | pr_warning("%s: #%u: submit error %d with src_off=0x%x " | |
344 | "dst_off=0x%x len=0x%x\n", | |
345 | thread_name, total_tests - 1, cookie, | |
346 | src_off, dst_off, len); | |
347 | msleep(100); | |
348 | failed_tests++; | |
349 | continue; | |
350 | } | |
b54d5cb9 | 351 | dma_async_issue_pending(chan); |
4a776f0a | 352 | |
e44e0aa3 DW |
353 | tmo = wait_for_completion_timeout(&cmp, tmo); |
354 | status = dma_async_is_tx_complete(chan, cookie, NULL, NULL); | |
4a776f0a | 355 | |
e44e0aa3 DW |
356 | if (tmo == 0) { |
357 | pr_warning("%s: #%u: test timed out\n", | |
358 | thread_name, total_tests - 1); | |
359 | failed_tests++; | |
360 | continue; | |
361 | } else if (status != DMA_SUCCESS) { | |
362 | pr_warning("%s: #%u: got completion callback," | |
363 | " but status is \'%s\'\n", | |
364 | thread_name, total_tests - 1, | |
365 | status == DMA_ERROR ? "error" : "in progress"); | |
4a776f0a HS |
366 | failed_tests++; |
367 | continue; | |
368 | } | |
e44e0aa3 | 369 | |
d86be86e | 370 | /* Unmap by myself (see DMA_COMPL_SKIP_DEST_UNMAP above) */ |
b54d5cb9 DW |
371 | for (i = 0; i < dst_cnt; i++) |
372 | dma_unmap_single(dev->dev, dma_dsts[i], test_buf_size, | |
373 | DMA_BIDIRECTIONAL); | |
4a776f0a HS |
374 | |
375 | error_count = 0; | |
376 | ||
377 | pr_debug("%s: verifying source buffer...\n", thread_name); | |
b54d5cb9 | 378 | error_count += dmatest_verify(thread->srcs, 0, src_off, |
4a776f0a | 379 | 0, PATTERN_SRC, true); |
b54d5cb9 | 380 | error_count += dmatest_verify(thread->srcs, src_off, |
4a776f0a HS |
381 | src_off + len, src_off, |
382 | PATTERN_SRC | PATTERN_COPY, true); | |
b54d5cb9 | 383 | error_count += dmatest_verify(thread->srcs, src_off + len, |
4a776f0a HS |
384 | test_buf_size, src_off + len, |
385 | PATTERN_SRC, true); | |
386 | ||
387 | pr_debug("%s: verifying dest buffer...\n", | |
388 | thread->task->comm); | |
b54d5cb9 | 389 | error_count += dmatest_verify(thread->dsts, 0, dst_off, |
4a776f0a | 390 | 0, PATTERN_DST, false); |
b54d5cb9 | 391 | error_count += dmatest_verify(thread->dsts, dst_off, |
4a776f0a HS |
392 | dst_off + len, src_off, |
393 | PATTERN_SRC | PATTERN_COPY, false); | |
b54d5cb9 | 394 | error_count += dmatest_verify(thread->dsts, dst_off + len, |
4a776f0a HS |
395 | test_buf_size, dst_off + len, |
396 | PATTERN_DST, false); | |
397 | ||
398 | if (error_count) { | |
399 | pr_warning("%s: #%u: %u errors with " | |
400 | "src_off=0x%x dst_off=0x%x len=0x%x\n", | |
401 | thread_name, total_tests - 1, error_count, | |
402 | src_off, dst_off, len); | |
403 | failed_tests++; | |
404 | } else { | |
405 | pr_debug("%s: #%u: No errors with " | |
406 | "src_off=0x%x dst_off=0x%x len=0x%x\n", | |
407 | thread_name, total_tests - 1, | |
408 | src_off, dst_off, len); | |
409 | } | |
410 | } | |
411 | ||
412 | ret = 0; | |
b54d5cb9 DW |
413 | for (i = 0; thread->dsts[i]; i++) |
414 | kfree(thread->dsts[i]); | |
4a776f0a | 415 | err_dstbuf: |
b54d5cb9 DW |
416 | kfree(thread->dsts); |
417 | err_dsts: | |
418 | for (i = 0; thread->srcs[i]; i++) | |
419 | kfree(thread->srcs[i]); | |
4a776f0a | 420 | err_srcbuf: |
b54d5cb9 DW |
421 | kfree(thread->srcs); |
422 | err_srcs: | |
4a776f0a HS |
423 | pr_notice("%s: terminating after %u tests, %u failures (status %d)\n", |
424 | thread_name, total_tests, failed_tests, ret); | |
0a2ff57d NF |
425 | |
426 | if (iterations > 0) | |
427 | while (!kthread_should_stop()) { | |
428 | DECLARE_WAIT_QUEUE_HEAD(wait_dmatest_exit); | |
429 | interruptible_sleep_on(&wait_dmatest_exit); | |
430 | } | |
431 | ||
4a776f0a HS |
432 | return ret; |
433 | } | |
434 | ||
435 | static void dmatest_cleanup_channel(struct dmatest_chan *dtc) | |
436 | { | |
437 | struct dmatest_thread *thread; | |
438 | struct dmatest_thread *_thread; | |
439 | int ret; | |
440 | ||
441 | list_for_each_entry_safe(thread, _thread, &dtc->threads, node) { | |
442 | ret = kthread_stop(thread->task); | |
443 | pr_debug("dmatest: thread %s exited with status %d\n", | |
444 | thread->task->comm, ret); | |
445 | list_del(&thread->node); | |
446 | kfree(thread); | |
447 | } | |
448 | kfree(dtc); | |
449 | } | |
450 | ||
b54d5cb9 | 451 | static int dmatest_add_threads(struct dmatest_chan *dtc, enum dma_transaction_type type) |
4a776f0a | 452 | { |
b54d5cb9 DW |
453 | struct dmatest_thread *thread; |
454 | struct dma_chan *chan = dtc->chan; | |
455 | char *op; | |
456 | unsigned int i; | |
4a776f0a | 457 | |
b54d5cb9 DW |
458 | if (type == DMA_MEMCPY) |
459 | op = "copy"; | |
460 | else if (type == DMA_XOR) | |
461 | op = "xor"; | |
462 | else | |
463 | return -EINVAL; | |
4a776f0a HS |
464 | |
465 | for (i = 0; i < threads_per_chan; i++) { | |
466 | thread = kzalloc(sizeof(struct dmatest_thread), GFP_KERNEL); | |
467 | if (!thread) { | |
b54d5cb9 DW |
468 | pr_warning("dmatest: No memory for %s-%s%u\n", |
469 | dma_chan_name(chan), op, i); | |
470 | ||
4a776f0a HS |
471 | break; |
472 | } | |
473 | thread->chan = dtc->chan; | |
b54d5cb9 | 474 | thread->type = type; |
4a776f0a | 475 | smp_wmb(); |
b54d5cb9 DW |
476 | thread->task = kthread_run(dmatest_func, thread, "%s-%s%u", |
477 | dma_chan_name(chan), op, i); | |
4a776f0a | 478 | if (IS_ERR(thread->task)) { |
b54d5cb9 DW |
479 | pr_warning("dmatest: Failed to run thread %s-%s%u\n", |
480 | dma_chan_name(chan), op, i); | |
4a776f0a HS |
481 | kfree(thread); |
482 | break; | |
483 | } | |
484 | ||
485 | /* srcbuf and dstbuf are allocated by the thread itself */ | |
486 | ||
487 | list_add_tail(&thread->node, &dtc->threads); | |
488 | } | |
489 | ||
b54d5cb9 DW |
490 | return i; |
491 | } | |
492 | ||
493 | static int dmatest_add_channel(struct dma_chan *chan) | |
494 | { | |
495 | struct dmatest_chan *dtc; | |
496 | struct dma_device *dma_dev = chan->device; | |
497 | unsigned int thread_count = 0; | |
498 | unsigned int cnt; | |
499 | ||
500 | dtc = kmalloc(sizeof(struct dmatest_chan), GFP_KERNEL); | |
501 | if (!dtc) { | |
502 | pr_warning("dmatest: No memory for %s\n", dma_chan_name(chan)); | |
503 | return -ENOMEM; | |
504 | } | |
505 | ||
506 | dtc->chan = chan; | |
507 | INIT_LIST_HEAD(&dtc->threads); | |
508 | ||
509 | if (dma_has_cap(DMA_MEMCPY, dma_dev->cap_mask)) { | |
510 | cnt = dmatest_add_threads(dtc, DMA_MEMCPY); | |
f1aef8b6 | 511 | thread_count += cnt > 0 ? cnt : 0; |
b54d5cb9 DW |
512 | } |
513 | if (dma_has_cap(DMA_XOR, dma_dev->cap_mask)) { | |
514 | cnt = dmatest_add_threads(dtc, DMA_XOR); | |
f1aef8b6 | 515 | thread_count += cnt > 0 ? cnt : 0; |
b54d5cb9 DW |
516 | } |
517 | ||
518 | pr_info("dmatest: Started %u threads using %s\n", | |
519 | thread_count, dma_chan_name(chan)); | |
4a776f0a HS |
520 | |
521 | list_add_tail(&dtc->node, &dmatest_channels); | |
522 | nr_channels++; | |
523 | ||
33df8ca0 | 524 | return 0; |
4a776f0a HS |
525 | } |
526 | ||
7dd60251 | 527 | static bool filter(struct dma_chan *chan, void *param) |
4a776f0a | 528 | { |
33df8ca0 | 529 | if (!dmatest_match_channel(chan) || !dmatest_match_device(chan->device)) |
7dd60251 | 530 | return false; |
33df8ca0 | 531 | else |
7dd60251 | 532 | return true; |
4a776f0a HS |
533 | } |
534 | ||
4a776f0a HS |
535 | static int __init dmatest_init(void) |
536 | { | |
33df8ca0 DW |
537 | dma_cap_mask_t mask; |
538 | struct dma_chan *chan; | |
539 | int err = 0; | |
540 | ||
541 | dma_cap_zero(mask); | |
542 | dma_cap_set(DMA_MEMCPY, mask); | |
543 | for (;;) { | |
544 | chan = dma_request_channel(mask, filter, NULL); | |
545 | if (chan) { | |
546 | err = dmatest_add_channel(chan); | |
c56c81ab | 547 | if (err) { |
33df8ca0 DW |
548 | dma_release_channel(chan); |
549 | break; /* add_channel failed, punt */ | |
550 | } | |
551 | } else | |
552 | break; /* no more channels available */ | |
553 | if (max_channels && nr_channels >= max_channels) | |
554 | break; /* we have all we need */ | |
555 | } | |
4a776f0a | 556 | |
33df8ca0 | 557 | return err; |
4a776f0a | 558 | } |
33df8ca0 DW |
559 | /* when compiled-in wait for drivers to load first */ |
560 | late_initcall(dmatest_init); | |
4a776f0a HS |
561 | |
562 | static void __exit dmatest_exit(void) | |
563 | { | |
33df8ca0 | 564 | struct dmatest_chan *dtc, *_dtc; |
7cbd4877 | 565 | struct dma_chan *chan; |
33df8ca0 DW |
566 | |
567 | list_for_each_entry_safe(dtc, _dtc, &dmatest_channels, node) { | |
568 | list_del(&dtc->node); | |
7cbd4877 | 569 | chan = dtc->chan; |
33df8ca0 DW |
570 | dmatest_cleanup_channel(dtc); |
571 | pr_debug("dmatest: dropped channel %s\n", | |
7cbd4877 DW |
572 | dma_chan_name(chan)); |
573 | dma_release_channel(chan); | |
33df8ca0 | 574 | } |
4a776f0a HS |
575 | } |
576 | module_exit(dmatest_exit); | |
577 | ||
578 | MODULE_AUTHOR("Haavard Skinnemoen <hskinnemoen@atmel.com>"); | |
579 | MODULE_LICENSE("GPL v2"); |