blob: 3c562f5a60bbb34f19e6b90f4d858b04d3d496e2 [file] [log] [blame]
Dan Williams9bc89cd2007-01-02 11:10:44 -07001/*
2 * xor offload engine api
3 *
4 * Copyright © 2006, Intel Corporation.
5 *
6 * Dan Williams <dan.j.williams@intel.com>
7 *
8 * with architecture considerations by:
9 * Neil Brown <neilb@suse.de>
10 * Jeff Garzik <jeff@garzik.org>
11 *
12 * This program is free software; you can redistribute it and/or modify it
13 * under the terms and conditions of the GNU General Public License,
14 * version 2, as published by the Free Software Foundation.
15 *
16 * This program is distributed in the hope it will be useful, but WITHOUT
17 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
18 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
19 * more details.
20 *
21 * You should have received a copy of the GNU General Public License along with
22 * this program; if not, write to the Free Software Foundation, Inc.,
23 * 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
24 *
25 */
26#include <linux/kernel.h>
27#include <linux/interrupt.h>
Paul Gortmaker4bb33cc2011-05-27 14:41:48 -040028#include <linux/module.h>
Dan Williams9bc89cd2007-01-02 11:10:44 -070029#include <linux/mm.h>
30#include <linux/dma-mapping.h>
31#include <linux/raid/xor.h>
32#include <linux/async_tx.h>
33
Dan Williams06164f32009-03-25 09:13:25 -070034/* do_async_xor - dma map the pages and perform the xor with an engine */
35static __async_inline struct dma_async_tx_descriptor *
Dan Williamsfb36ab12013-10-18 19:35:26 +020036do_async_xor(struct dma_chan *chan, struct dmaengine_unmap_data *unmap,
Dan Williamsa08abd82009-06-03 11:43:59 -070037 struct async_submit_ctl *submit)
Dan Williams9bc89cd2007-01-02 11:10:44 -070038{
Dan Williams1e55db22008-07-16 19:44:56 -070039 struct dma_device *dma = chan->device;
Dan Williams1e55db22008-07-16 19:44:56 -070040 struct dma_async_tx_descriptor *tx = NULL;
Dan Williamsa08abd82009-06-03 11:43:59 -070041 dma_async_tx_callback cb_fn_orig = submit->cb_fn;
42 void *cb_param_orig = submit->cb_param;
43 enum async_tx_flags flags_orig = submit->flags;
Bartlomiej Zolnierkiewicz0776ae72013-10-18 19:35:33 +020044 enum dma_ctrl_flags dma_flags = 0;
Dan Williamsfb36ab12013-10-18 19:35:26 +020045 int src_cnt = unmap->to_cnt;
46 int xor_src_cnt;
47 dma_addr_t dma_dest = unmap->addr[unmap->to_cnt];
48 dma_addr_t *src_list = unmap->addr;
Dan Williams00367312008-02-02 19:49:57 -070049
Dan Williams1e55db22008-07-16 19:44:56 -070050 while (src_cnt) {
Dan Williamsfb36ab12013-10-18 19:35:26 +020051 dma_addr_t tmp;
52
Dan Williamsa08abd82009-06-03 11:43:59 -070053 submit->flags = flags_orig;
Dan Williamsb2f46fd2009-07-14 12:20:36 -070054 xor_src_cnt = min(src_cnt, (int)dma->max_xor);
Dan Williamsfb36ab12013-10-18 19:35:26 +020055 /* if we are submitting additional xors, leave the chain open
56 * and clear the callback parameters
Dan Williams1e55db22008-07-16 19:44:56 -070057 */
58 if (src_cnt > xor_src_cnt) {
Dan Williamsa08abd82009-06-03 11:43:59 -070059 submit->flags &= ~ASYNC_TX_ACK;
Dan Williams0403e382009-09-08 17:42:50 -070060 submit->flags |= ASYNC_TX_FENCE;
Dan Williamsa08abd82009-06-03 11:43:59 -070061 submit->cb_fn = NULL;
62 submit->cb_param = NULL;
Dan Williams1e55db22008-07-16 19:44:56 -070063 } else {
Dan Williamsa08abd82009-06-03 11:43:59 -070064 submit->cb_fn = cb_fn_orig;
65 submit->cb_param = cb_param_orig;
Dan Williams1e55db22008-07-16 19:44:56 -070066 }
Dan Williamsa08abd82009-06-03 11:43:59 -070067 if (submit->cb_fn)
Dan Williams1e55db22008-07-16 19:44:56 -070068 dma_flags |= DMA_PREP_INTERRUPT;
Dan Williams0403e382009-09-08 17:42:50 -070069 if (submit->flags & ASYNC_TX_FENCE)
70 dma_flags |= DMA_PREP_FENCE;
Dan Williamsfb36ab12013-10-18 19:35:26 +020071
72 /* Drivers force forward progress in case they can not provide a
73 * descriptor
Dan Williams1e55db22008-07-16 19:44:56 -070074 */
Dan Williamsfb36ab12013-10-18 19:35:26 +020075 tmp = src_list[0];
76 if (src_list > unmap->addr)
77 src_list[0] = dma_dest;
78 tx = dma->device_prep_dma_xor(chan, dma_dest, src_list,
79 xor_src_cnt, unmap->len,
80 dma_flags);
81 src_list[0] = tmp;
82
Dan Williams1e55db22008-07-16 19:44:56 -070083
Dan Williams669ab0b2008-07-17 17:59:55 -070084 if (unlikely(!tx))
Dan Williamsa08abd82009-06-03 11:43:59 -070085 async_tx_quiesce(&submit->depend_tx);
Dan Williams00367312008-02-02 19:49:57 -070086
Lucas De Marchi25985ed2011-03-30 22:57:33 -030087 /* spin wait for the preceding transactions to complete */
Dan Williams669ab0b2008-07-17 17:59:55 -070088 while (unlikely(!tx)) {
89 dma_async_issue_pending(chan);
Dan Williams1e55db22008-07-16 19:44:56 -070090 tx = dma->device_prep_dma_xor(chan, dma_dest,
Dan Williamsfb36ab12013-10-18 19:35:26 +020091 src_list,
92 xor_src_cnt, unmap->len,
Dan Williams1e55db22008-07-16 19:44:56 -070093 dma_flags);
Dan Williams669ab0b2008-07-17 17:59:55 -070094 }
Dan Williams9bc89cd2007-01-02 11:10:44 -070095
Dan Williamsfb36ab12013-10-18 19:35:26 +020096 dma_set_unmap(tx, unmap);
Dan Williamsa08abd82009-06-03 11:43:59 -070097 async_tx_submit(chan, tx, submit);
98 submit->depend_tx = tx;
Dan Williams1e55db22008-07-16 19:44:56 -070099
100 if (src_cnt > xor_src_cnt) {
101 /* drop completed sources */
102 src_cnt -= xor_src_cnt;
Dan Williams1e55db22008-07-16 19:44:56 -0700103 /* use the intermediate result a source */
Dan Williams1e55db22008-07-16 19:44:56 -0700104 src_cnt++;
Dan Williamsfb36ab12013-10-18 19:35:26 +0200105 src_list += xor_src_cnt - 1;
Dan Williams1e55db22008-07-16 19:44:56 -0700106 } else
107 break;
108 }
Dan Williams00367312008-02-02 19:49:57 -0700109
110 return tx;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700111}
112
113static void
114do_sync_xor(struct page *dest, struct page **src_list, unsigned int offset,
Dan Williamsa08abd82009-06-03 11:43:59 -0700115 int src_cnt, size_t len, struct async_submit_ctl *submit)
Dan Williams9bc89cd2007-01-02 11:10:44 -0700116{
Dan Williams9bc89cd2007-01-02 11:10:44 -0700117 int i;
NeilBrownb2141e62009-10-16 16:40:34 +1100118 int xor_src_cnt = 0;
Dan Williams1e55db22008-07-16 19:44:56 -0700119 int src_off = 0;
120 void *dest_buf;
Dan Williams04ce9ab2009-06-03 14:22:28 -0700121 void **srcs;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700122
Dan Williams04ce9ab2009-06-03 14:22:28 -0700123 if (submit->scribble)
124 srcs = submit->scribble;
125 else
126 srcs = (void **) src_list;
127
128 /* convert to buffer pointers */
Dan Williams9bc89cd2007-01-02 11:10:44 -0700129 for (i = 0; i < src_cnt; i++)
NeilBrownb2141e62009-10-16 16:40:34 +1100130 if (src_list[i])
131 srcs[xor_src_cnt++] = page_address(src_list[i]) + offset;
132 src_cnt = xor_src_cnt;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700133 /* set destination address */
Dan Williams1e55db22008-07-16 19:44:56 -0700134 dest_buf = page_address(dest) + offset;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700135
Dan Williamsa08abd82009-06-03 11:43:59 -0700136 if (submit->flags & ASYNC_TX_XOR_ZERO_DST)
Dan Williams1e55db22008-07-16 19:44:56 -0700137 memset(dest_buf, 0, len);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700138
Dan Williams1e55db22008-07-16 19:44:56 -0700139 while (src_cnt > 0) {
140 /* process up to 'MAX_XOR_BLOCKS' sources */
141 xor_src_cnt = min(src_cnt, MAX_XOR_BLOCKS);
142 xor_blocks(xor_src_cnt, len, dest_buf, &srcs[src_off]);
143
144 /* drop completed sources */
145 src_cnt -= xor_src_cnt;
146 src_off += xor_src_cnt;
147 }
Dan Williams9bc89cd2007-01-02 11:10:44 -0700148
Dan Williamsa08abd82009-06-03 11:43:59 -0700149 async_tx_sync_epilog(submit);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700150}
151
152/**
153 * async_xor - attempt to xor a set of blocks with a dma engine.
Dan Williams9bc89cd2007-01-02 11:10:44 -0700154 * @dest: destination page
Dan Williamsa08abd82009-06-03 11:43:59 -0700155 * @src_list: array of source pages
156 * @offset: common src/dst offset to start transaction
Dan Williams9bc89cd2007-01-02 11:10:44 -0700157 * @src_cnt: number of source pages
158 * @len: length in bytes
Dan Williamsa08abd82009-06-03 11:43:59 -0700159 * @submit: submission / completion modifiers
160 *
161 * honored flags: ASYNC_TX_ACK, ASYNC_TX_XOR_ZERO_DST, ASYNC_TX_XOR_DROP_DST
162 *
163 * xor_blocks always uses the dest as a source so the
164 * ASYNC_TX_XOR_ZERO_DST flag must be set to not include dest data in
165 * the calculation. The assumption with dma eninges is that they only
166 * use the destination buffer as a source when it is explicity specified
167 * in the source list.
168 *
169 * src_list note: if the dest is also a source it must be at index zero.
170 * The contents of this array will be overwritten if a scribble region
171 * is not specified.
Dan Williams9bc89cd2007-01-02 11:10:44 -0700172 */
173struct dma_async_tx_descriptor *
174async_xor(struct page *dest, struct page **src_list, unsigned int offset,
Dan Williamsa08abd82009-06-03 11:43:59 -0700175 int src_cnt, size_t len, struct async_submit_ctl *submit)
Dan Williams9bc89cd2007-01-02 11:10:44 -0700176{
Dan Williamsa08abd82009-06-03 11:43:59 -0700177 struct dma_chan *chan = async_tx_find_channel(submit, DMA_XOR,
Dan Williams47437b22008-02-02 19:49:59 -0700178 &dest, 1, src_list,
179 src_cnt, len);
Dan Williamsfb36ab12013-10-18 19:35:26 +0200180 struct dma_device *device = chan ? chan->device : NULL;
181 struct dmaengine_unmap_data *unmap = NULL;
Dan Williams04ce9ab2009-06-03 14:22:28 -0700182
Dan Williams9bc89cd2007-01-02 11:10:44 -0700183 BUG_ON(src_cnt <= 1);
184
Dan Williamsfb36ab12013-10-18 19:35:26 +0200185 if (device)
186 unmap = dmaengine_get_unmap_data(device->dev, src_cnt+1, GFP_NOIO);
Dan Williams04ce9ab2009-06-03 14:22:28 -0700187
Dan Williamsfb36ab12013-10-18 19:35:26 +0200188 if (unmap && is_dma_xor_aligned(device, offset, 0, len)) {
189 struct dma_async_tx_descriptor *tx;
190 int i, j;
191
Dan Williams1e55db22008-07-16 19:44:56 -0700192 /* run the xor asynchronously */
193 pr_debug("%s (async): len: %zu\n", __func__, len);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700194
Dan Williamsfb36ab12013-10-18 19:35:26 +0200195 unmap->len = len;
196 for (i = 0, j = 0; i < src_cnt; i++) {
197 if (!src_list[i])
198 continue;
199 unmap->to_cnt++;
200 unmap->addr[j++] = dma_map_page(device->dev, src_list[i],
201 offset, len, DMA_TO_DEVICE);
202 }
203
204 /* map it bidirectional as it may be re-used as a source */
205 unmap->addr[j] = dma_map_page(device->dev, dest, offset, len,
206 DMA_BIDIRECTIONAL);
207 unmap->bidi_cnt = 1;
208
209 tx = do_async_xor(chan, unmap, submit);
210 dmaengine_unmap_put(unmap);
211 return tx;
Dan Williams1e55db22008-07-16 19:44:56 -0700212 } else {
Dan Williamsfb36ab12013-10-18 19:35:26 +0200213 dmaengine_unmap_put(unmap);
Dan Williams1e55db22008-07-16 19:44:56 -0700214 /* run the xor synchronously */
215 pr_debug("%s (sync): len: %zu\n", __func__, len);
Dan Williams04ce9ab2009-06-03 14:22:28 -0700216 WARN_ONCE(chan, "%s: no space for dma address conversion\n",
217 __func__);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700218
Dan Williams1e55db22008-07-16 19:44:56 -0700219 /* in the sync case the dest is an implied source
220 * (assumes the dest is the first source)
221 */
Dan Williamsa08abd82009-06-03 11:43:59 -0700222 if (submit->flags & ASYNC_TX_XOR_DROP_DST) {
Dan Williams1e55db22008-07-16 19:44:56 -0700223 src_cnt--;
224 src_list++;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700225 }
226
Dan Williams1e55db22008-07-16 19:44:56 -0700227 /* wait for any prerequisite operations */
Dan Williamsa08abd82009-06-03 11:43:59 -0700228 async_tx_quiesce(&submit->depend_tx);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700229
Dan Williamsa08abd82009-06-03 11:43:59 -0700230 do_sync_xor(dest, src_list, offset, src_cnt, len, submit);
Dan Williams1e55db22008-07-16 19:44:56 -0700231
232 return NULL;
233 }
Dan Williams9bc89cd2007-01-02 11:10:44 -0700234}
235EXPORT_SYMBOL_GPL(async_xor);
236
237static int page_is_zero(struct page *p, unsigned int offset, size_t len)
238{
Akinobu Mita2c88ae92012-10-28 00:49:33 +0900239 return !memchr_inv(page_address(p) + offset, 0, len);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700240}
241
Dan Williams7b3cc2b2009-11-19 17:10:37 -0700242static inline struct dma_chan *
243xor_val_chan(struct async_submit_ctl *submit, struct page *dest,
244 struct page **src_list, int src_cnt, size_t len)
245{
246 #ifdef CONFIG_ASYNC_TX_DISABLE_XOR_VAL_DMA
247 return NULL;
248 #endif
249 return async_tx_find_channel(submit, DMA_XOR_VAL, &dest, 1, src_list,
250 src_cnt, len);
251}
252
Dan Williams9bc89cd2007-01-02 11:10:44 -0700253/**
Dan Williams099f53c2009-04-08 14:28:37 -0700254 * async_xor_val - attempt a xor parity check with a dma engine.
Dan Williams9bc89cd2007-01-02 11:10:44 -0700255 * @dest: destination page used if the xor is performed synchronously
Dan Williamsa08abd82009-06-03 11:43:59 -0700256 * @src_list: array of source pages
Dan Williams9bc89cd2007-01-02 11:10:44 -0700257 * @offset: offset in pages to start transaction
258 * @src_cnt: number of source pages
259 * @len: length in bytes
260 * @result: 0 if sum == 0 else non-zero
Dan Williamsa08abd82009-06-03 11:43:59 -0700261 * @submit: submission / completion modifiers
262 *
263 * honored flags: ASYNC_TX_ACK
264 *
265 * src_list note: if the dest is also a source it must be at index zero.
266 * The contents of this array will be overwritten if a scribble region
267 * is not specified.
Dan Williams9bc89cd2007-01-02 11:10:44 -0700268 */
269struct dma_async_tx_descriptor *
Dan Williamsa08abd82009-06-03 11:43:59 -0700270async_xor_val(struct page *dest, struct page **src_list, unsigned int offset,
Dan Williamsad283ea2009-08-29 19:09:26 -0700271 int src_cnt, size_t len, enum sum_check_flags *result,
Dan Williamsa08abd82009-06-03 11:43:59 -0700272 struct async_submit_ctl *submit)
Dan Williams9bc89cd2007-01-02 11:10:44 -0700273{
Dan Williams7b3cc2b2009-11-19 17:10:37 -0700274 struct dma_chan *chan = xor_val_chan(submit, dest, src_list, src_cnt, len);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700275 struct dma_device *device = chan ? chan->device : NULL;
Dan Williams00367312008-02-02 19:49:57 -0700276 struct dma_async_tx_descriptor *tx = NULL;
Dan Williams173e86b2013-10-18 19:35:27 +0200277 struct dmaengine_unmap_data *unmap = NULL;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700278
279 BUG_ON(src_cnt <= 1);
280
Dan Williams173e86b2013-10-18 19:35:27 +0200281 if (device)
282 unmap = dmaengine_get_unmap_data(device->dev, src_cnt, GFP_NOIO);
Dan Williams04ce9ab2009-06-03 14:22:28 -0700283
Dan Williams173e86b2013-10-18 19:35:27 +0200284 if (unmap && src_cnt <= device->max_xor &&
Dan Williams83544ae2009-09-08 17:42:53 -0700285 is_dma_xor_aligned(device, offset, 0, len)) {
Bartlomiej Zolnierkiewicz0776ae72013-10-18 19:35:33 +0200286 unsigned long dma_prep_flags = 0;
Dan Williams00367312008-02-02 19:49:57 -0700287 int i;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700288
Dan Williams3280ab3e2008-03-13 17:45:28 -0700289 pr_debug("%s: (async) len: %zu\n", __func__, len);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700290
Dan Williams0403e382009-09-08 17:42:50 -0700291 if (submit->cb_fn)
292 dma_prep_flags |= DMA_PREP_INTERRUPT;
293 if (submit->flags & ASYNC_TX_FENCE)
294 dma_prep_flags |= DMA_PREP_FENCE;
Dan Williams00367312008-02-02 19:49:57 -0700295
Dan Williams173e86b2013-10-18 19:35:27 +0200296 for (i = 0; i < src_cnt; i++) {
297 unmap->addr[i] = dma_map_page(device->dev, src_list[i],
298 offset, len, DMA_TO_DEVICE);
299 unmap->to_cnt++;
300 }
301 unmap->len = len;
302
303 tx = device->device_prep_dma_xor_val(chan, unmap->addr, src_cnt,
Dan Williams099f53c2009-04-08 14:28:37 -0700304 len, result,
305 dma_prep_flags);
Dan Williams669ab0b2008-07-17 17:59:55 -0700306 if (unlikely(!tx)) {
Dan Williamsa08abd82009-06-03 11:43:59 -0700307 async_tx_quiesce(&submit->depend_tx);
Dan Williams00367312008-02-02 19:49:57 -0700308
Dan Williamse34a8ae2008-08-05 10:22:05 -0700309 while (!tx) {
Dan Williams669ab0b2008-07-17 17:59:55 -0700310 dma_async_issue_pending(chan);
Dan Williams099f53c2009-04-08 14:28:37 -0700311 tx = device->device_prep_dma_xor_val(chan,
Dan Williams173e86b2013-10-18 19:35:27 +0200312 unmap->addr, src_cnt, len, result,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700313 dma_prep_flags);
Dan Williamse34a8ae2008-08-05 10:22:05 -0700314 }
Dan Williams9bc89cd2007-01-02 11:10:44 -0700315 }
Dan Williams173e86b2013-10-18 19:35:27 +0200316 dma_set_unmap(tx, unmap);
Dan Williamsa08abd82009-06-03 11:43:59 -0700317 async_tx_submit(chan, tx, submit);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700318 } else {
Dan Williamsa08abd82009-06-03 11:43:59 -0700319 enum async_tx_flags flags_orig = submit->flags;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700320
Dan Williams3280ab3e2008-03-13 17:45:28 -0700321 pr_debug("%s: (sync) len: %zu\n", __func__, len);
Dan Williams04ce9ab2009-06-03 14:22:28 -0700322 WARN_ONCE(device && src_cnt <= device->max_xor,
323 "%s: no space for dma address conversion\n",
324 __func__);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700325
Dan Williamsa08abd82009-06-03 11:43:59 -0700326 submit->flags |= ASYNC_TX_XOR_DROP_DST;
327 submit->flags &= ~ASYNC_TX_ACK;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700328
Dan Williamsa08abd82009-06-03 11:43:59 -0700329 tx = async_xor(dest, src_list, offset, src_cnt, len, submit);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700330
Dan Williamsd2c52b72008-07-17 17:59:55 -0700331 async_tx_quiesce(&tx);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700332
Dan Williamsad283ea2009-08-29 19:09:26 -0700333 *result = !page_is_zero(dest, offset, len) << SUM_CHECK_P;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700334
Dan Williamsa08abd82009-06-03 11:43:59 -0700335 async_tx_sync_epilog(submit);
336 submit->flags = flags_orig;
Dan Williams9bc89cd2007-01-02 11:10:44 -0700337 }
Dan Williams173e86b2013-10-18 19:35:27 +0200338 dmaengine_unmap_put(unmap);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700339
340 return tx;
341}
Dan Williams099f53c2009-04-08 14:28:37 -0700342EXPORT_SYMBOL_GPL(async_xor_val);
Dan Williams9bc89cd2007-01-02 11:10:44 -0700343
Dan Williams9bc89cd2007-01-02 11:10:44 -0700344MODULE_AUTHOR("Intel Corporation");
345MODULE_DESCRIPTION("asynchronous xor/xor-zero-sum api");
346MODULE_LICENSE("GPL");