43b1436bd9684cc94b12af9773b6b54def5af469
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / crypto / async_tx / async_pq.c
1 /*
2 * Copyright(c) 2007 Yuri Tikhonov <yur@emcraft.com>
3 * Copyright(c) 2009 Intel Corporation
4 *
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License as published by the Free
7 * Software Foundation; either version 2 of the License, or (at your option)
8 * any later version.
9 *
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
13 * more details.
14 *
15 * You should have received a copy of the GNU General Public License along with
16 * this program; if not, write to the Free Software Foundation, Inc., 59
17 * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 *
19 * The full GNU General Public License is included in this distribution in the
20 * file called COPYING.
21 */
22 #include <linux/kernel.h>
23 #include <linux/interrupt.h>
24 #include <linux/dma-mapping.h>
25 #include <linux/raid/pq.h>
26 #include <linux/async_tx.h>
27
28 /**
29 * scribble - space to hold throwaway P buffer for synchronous gen_syndrome
30 */
31 static struct page *scribble;
32
33 /* the struct page *blocks[] parameter passed to async_gen_syndrome()
34 * and async_syndrome_val() contains the 'P' destination address at
35 * blocks[disks-2] and the 'Q' destination address at blocks[disks-1]
36 *
37 * note: these are macros as they are used as lvalues
38 */
39 #define P(b, d) (b[d-2])
40 #define Q(b, d) (b[d-1])
41
42 /**
43 * do_async_gen_syndrome - asynchronously calculate P and/or Q
44 */
45 static __async_inline struct dma_async_tx_descriptor *
46 do_async_gen_syndrome(struct dma_chan *chan, struct page **blocks,
47 const unsigned char *scfs, unsigned int offset, int disks,
48 size_t len, dma_addr_t *dma_src,
49 struct async_submit_ctl *submit)
50 {
51 struct dma_async_tx_descriptor *tx = NULL;
52 struct dma_device *dma = chan->device;
53 enum dma_ctrl_flags dma_flags = 0;
54 enum async_tx_flags flags_orig = submit->flags;
55 dma_async_tx_callback cb_fn_orig = submit->cb_fn;
56 dma_async_tx_callback cb_param_orig = submit->cb_param;
57 int src_cnt = disks - 2;
58 unsigned char coefs[src_cnt];
59 unsigned short pq_src_cnt;
60 dma_addr_t dma_dest[2];
61 int src_off = 0;
62 int idx;
63 int i;
64
65 /* DMAs use destinations as sources, so use BIDIRECTIONAL mapping */
66 if (P(blocks, disks))
67 dma_dest[0] = dma_map_page(dma->dev, P(blocks, disks), offset,
68 len, DMA_BIDIRECTIONAL);
69 else
70 dma_flags |= DMA_PREP_PQ_DISABLE_P;
71 if (Q(blocks, disks))
72 dma_dest[1] = dma_map_page(dma->dev, Q(blocks, disks), offset,
73 len, DMA_BIDIRECTIONAL);
74 else
75 dma_flags |= DMA_PREP_PQ_DISABLE_Q;
76
77 /* convert source addresses being careful to collapse 'empty'
78 * sources and update the coefficients accordingly
79 */
80 for (i = 0, idx = 0; i < src_cnt; i++) {
81 if (blocks[i] == NULL)
82 continue;
83 dma_src[idx] = dma_map_page(dma->dev, blocks[i], offset, len,
84 DMA_TO_DEVICE);
85 coefs[idx] = scfs[i];
86 idx++;
87 }
88 src_cnt = idx;
89
90 while (src_cnt > 0) {
91 submit->flags = flags_orig;
92 pq_src_cnt = min(src_cnt, dma_maxpq(dma, dma_flags));
93 /* if we are submitting additional pqs, leave the chain open,
94 * clear the callback parameters, and leave the destination
95 * buffers mapped
96 */
97 if (src_cnt > pq_src_cnt) {
98 submit->flags &= ~ASYNC_TX_ACK;
99 submit->flags |= ASYNC_TX_FENCE;
100 dma_flags |= DMA_COMPL_SKIP_DEST_UNMAP;
101 submit->cb_fn = NULL;
102 submit->cb_param = NULL;
103 } else {
104 dma_flags &= ~DMA_COMPL_SKIP_DEST_UNMAP;
105 submit->cb_fn = cb_fn_orig;
106 submit->cb_param = cb_param_orig;
107 if (cb_fn_orig)
108 dma_flags |= DMA_PREP_INTERRUPT;
109 }
110 if (submit->flags & ASYNC_TX_FENCE)
111 dma_flags |= DMA_PREP_FENCE;
112
113 /* Since we have clobbered the src_list we are committed
114 * to doing this asynchronously. Drivers force forward
115 * progress in case they can not provide a descriptor
116 */
117 for (;;) {
118 tx = dma->device_prep_dma_pq(chan, dma_dest,
119 &dma_src[src_off],
120 pq_src_cnt,
121 &coefs[src_off], len,
122 dma_flags);
123 if (likely(tx))
124 break;
125 async_tx_quiesce(&submit->depend_tx);
126 dma_async_issue_pending(chan);
127 }
128
129 async_tx_submit(chan, tx, submit);
130 submit->depend_tx = tx;
131
132 /* drop completed sources */
133 src_cnt -= pq_src_cnt;
134 src_off += pq_src_cnt;
135
136 dma_flags |= DMA_PREP_CONTINUE;
137 }
138
139 return tx;
140 }
141
142 /**
143 * do_sync_gen_syndrome - synchronously calculate a raid6 syndrome
144 */
145 static void
146 do_sync_gen_syndrome(struct page **blocks, unsigned int offset, int disks,
147 size_t len, struct async_submit_ctl *submit)
148 {
149 void **srcs;
150 int i;
151
152 if (submit->scribble)
153 srcs = submit->scribble;
154 else
155 srcs = (void **) blocks;
156
157 for (i = 0; i < disks; i++) {
158 if (blocks[i] == NULL) {
159 BUG_ON(i > disks - 3); /* P or Q can't be zero */
160 srcs[i] = (void*)raid6_empty_zero_page;
161 } else
162 srcs[i] = page_address(blocks[i]) + offset;
163 }
164 raid6_call.gen_syndrome(disks, len, srcs);
165 async_tx_sync_epilog(submit);
166 }
167
168 /**
169 * async_gen_syndrome - asynchronously calculate a raid6 syndrome
170 * @blocks: source blocks from idx 0..disks-3, P @ disks-2 and Q @ disks-1
171 * @offset: common offset into each block (src and dest) to start transaction
172 * @disks: number of blocks (including missing P or Q, see below)
173 * @len: length of operation in bytes
174 * @submit: submission/completion modifiers
175 *
176 * General note: This routine assumes a field of GF(2^8) with a
177 * primitive polynomial of 0x11d and a generator of {02}.
178 *
179 * 'disks' note: callers can optionally omit either P or Q (but not
180 * both) from the calculation by setting blocks[disks-2] or
181 * blocks[disks-1] to NULL. When P or Q is omitted 'len' must be <=
182 * PAGE_SIZE as a temporary buffer of this size is used in the
183 * synchronous path. 'disks' always accounts for both destination
184 * buffers.
185 *
186 * 'blocks' note: if submit->scribble is NULL then the contents of
187 * 'blocks' may be overridden
188 */
189 struct dma_async_tx_descriptor *
190 async_gen_syndrome(struct page **blocks, unsigned int offset, int disks,
191 size_t len, struct async_submit_ctl *submit)
192 {
193 int src_cnt = disks - 2;
194 struct dma_chan *chan = async_tx_find_channel(submit, DMA_PQ,
195 &P(blocks, disks), 2,
196 blocks, src_cnt, len);
197 struct dma_device *device = chan ? chan->device : NULL;
198 dma_addr_t *dma_src = NULL;
199
200 BUG_ON(disks > 255 || !(P(blocks, disks) || Q(blocks, disks)));
201
202 if (submit->scribble)
203 dma_src = submit->scribble;
204 else if (sizeof(dma_addr_t) <= sizeof(struct page *))
205 dma_src = (dma_addr_t *) blocks;
206
207 if (dma_src && device &&
208 (src_cnt <= dma_maxpq(device, 0) ||
209 dma_maxpq(device, DMA_PREP_CONTINUE) > 0) &&
210 is_dma_pq_aligned(device, offset, 0, len)) {
211 /* run the p+q asynchronously */
212 pr_debug("%s: (async) disks: %d len: %zu\n",
213 __func__, disks, len);
214 return do_async_gen_syndrome(chan, blocks, raid6_gfexp, offset,
215 disks, len, dma_src, submit);
216 }
217
218 /* run the pq synchronously */
219 pr_debug("%s: (sync) disks: %d len: %zu\n", __func__, disks, len);
220
221 /* wait for any prerequisite operations */
222 async_tx_quiesce(&submit->depend_tx);
223
224 if (!P(blocks, disks)) {
225 P(blocks, disks) = scribble;
226 BUG_ON(len + offset > PAGE_SIZE);
227 }
228 if (!Q(blocks, disks)) {
229 Q(blocks, disks) = scribble;
230 BUG_ON(len + offset > PAGE_SIZE);
231 }
232 do_sync_gen_syndrome(blocks, offset, disks, len, submit);
233
234 return NULL;
235 }
236 EXPORT_SYMBOL_GPL(async_gen_syndrome);
237
238 /**
239 * async_syndrome_val - asynchronously validate a raid6 syndrome
240 * @blocks: source blocks from idx 0..disks-3, P @ disks-2 and Q @ disks-1
241 * @offset: common offset into each block (src and dest) to start transaction
242 * @disks: number of blocks (including missing P or Q, see below)
243 * @len: length of operation in bytes
244 * @pqres: on val failure SUM_CHECK_P_RESULT and/or SUM_CHECK_Q_RESULT are set
245 * @spare: temporary result buffer for the synchronous case
246 * @submit: submission / completion modifiers
247 *
248 * The same notes from async_gen_syndrome apply to the 'blocks',
249 * and 'disks' parameters of this routine. The synchronous path
250 * requires a temporary result buffer and submit->scribble to be
251 * specified.
252 */
253 struct dma_async_tx_descriptor *
254 async_syndrome_val(struct page **blocks, unsigned int offset, int disks,
255 size_t len, enum sum_check_flags *pqres, struct page *spare,
256 struct async_submit_ctl *submit)
257 {
258 struct dma_chan *chan = async_tx_find_channel(submit, DMA_PQ_VAL,
259 NULL, 0, blocks, disks,
260 len);
261 struct dma_device *device = chan ? chan->device : NULL;
262 struct dma_async_tx_descriptor *tx;
263 unsigned char coefs[disks-2];
264 enum dma_ctrl_flags dma_flags = submit->cb_fn ? DMA_PREP_INTERRUPT : 0;
265 dma_addr_t *dma_src = NULL;
266 int src_cnt = 0;
267
268 BUG_ON(disks < 4);
269
270 if (submit->scribble)
271 dma_src = submit->scribble;
272 else if (sizeof(dma_addr_t) <= sizeof(struct page *))
273 dma_src = (dma_addr_t *) blocks;
274
275 if (dma_src && device && disks <= dma_maxpq(device, 0) &&
276 is_dma_pq_aligned(device, offset, 0, len)) {
277 struct device *dev = device->dev;
278 dma_addr_t *pq = &dma_src[disks-2];
279 int i;
280
281 pr_debug("%s: (async) disks: %d len: %zu\n",
282 __func__, disks, len);
283 if (!P(blocks, disks))
284 dma_flags |= DMA_PREP_PQ_DISABLE_P;
285 else
286 pq[0] = dma_map_page(dev, P(blocks,disks),
287 offset, len,
288 DMA_TO_DEVICE);
289 if (!Q(blocks, disks))
290 dma_flags |= DMA_PREP_PQ_DISABLE_Q;
291 else
292 pq[1] = dma_map_page(dev, Q(blocks,disks),
293 offset, len,
294 DMA_TO_DEVICE);
295
296 if (submit->flags & ASYNC_TX_FENCE)
297 dma_flags |= DMA_PREP_FENCE;
298 for (i = 0; i < disks-2; i++)
299 if (likely(blocks[i])) {
300 dma_src[src_cnt] = dma_map_page(dev, blocks[i],
301 offset, len,
302 DMA_TO_DEVICE);
303 coefs[src_cnt] = raid6_gfexp[i];
304 src_cnt++;
305 }
306 pq[1] = dma_map_page(dev, Q(blocks,disks),
307 offset, len,
308 DMA_TO_DEVICE);
309
310 for (;;) {
311 tx = device->device_prep_dma_pq_val(chan, pq, dma_src,
312 src_cnt,
313 coefs,
314 len, pqres,
315 dma_flags);
316 if (likely(tx))
317 break;
318 async_tx_quiesce(&submit->depend_tx);
319 dma_async_issue_pending(chan);
320 }
321 async_tx_submit(chan, tx, submit);
322
323 return tx;
324 } else {
325 struct page *p_src = P(blocks, disks);
326 struct page *q_src = Q(blocks, disks);
327 enum async_tx_flags flags_orig = submit->flags;
328 dma_async_tx_callback cb_fn_orig = submit->cb_fn;
329 void *scribble = submit->scribble;
330 void *cb_param_orig = submit->cb_param;
331 void *p, *q, *s;
332
333 pr_debug("%s: (sync) disks: %d len: %zu\n",
334 __func__, disks, len);
335
336 /* caller must provide a temporary result buffer and
337 * allow the input parameters to be preserved
338 */
339 BUG_ON(!spare || !scribble);
340
341 /* wait for any prerequisite operations */
342 async_tx_quiesce(&submit->depend_tx);
343
344 /* recompute p and/or q into the temporary buffer and then
345 * check to see the result matches the current value
346 */
347 tx = NULL;
348 *pqres = 0;
349 if (p_src) {
350 init_async_submit(submit, ASYNC_TX_XOR_ZERO_DST, NULL,
351 NULL, NULL, scribble);
352 tx = async_xor(spare, blocks, offset, disks-2, len, submit);
353 async_tx_quiesce(&tx);
354 p = page_address(p_src) + offset;
355 s = page_address(spare) + offset;
356 *pqres |= !!memcmp(p, s, len) << SUM_CHECK_P;
357 }
358
359 if (q_src) {
360 P(blocks, disks) = NULL;
361 Q(blocks, disks) = spare;
362 init_async_submit(submit, 0, NULL, NULL, NULL, scribble);
363 tx = async_gen_syndrome(blocks, offset, disks, len, submit);
364 async_tx_quiesce(&tx);
365 q = page_address(q_src) + offset;
366 s = page_address(spare) + offset;
367 *pqres |= !!memcmp(q, s, len) << SUM_CHECK_Q;
368 }
369
370 /* restore P, Q and submit */
371 P(blocks, disks) = p_src;
372 Q(blocks, disks) = q_src;
373
374 submit->cb_fn = cb_fn_orig;
375 submit->cb_param = cb_param_orig;
376 submit->flags = flags_orig;
377 async_tx_sync_epilog(submit);
378
379 return NULL;
380 }
381 }
382 EXPORT_SYMBOL_GPL(async_syndrome_val);
383
384 static int __init async_pq_init(void)
385 {
386 scribble = alloc_page(GFP_KERNEL);
387
388 if (scribble)
389 return 0;
390
391 pr_err("%s: failed to allocate required spare page\n", __func__);
392
393 return -ENOMEM;
394 }
395
396 static void __exit async_pq_exit(void)
397 {
398 put_page(scribble);
399 }
400
401 module_init(async_pq_init);
402 module_exit(async_pq_exit);
403
404 MODULE_DESCRIPTION("asynchronous raid6 syndrome generation/validation");
405 MODULE_LICENSE("GPL");