async_xor.c 9.4 KB
Newer Older
D
Dan Williams 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
/*
 * xor offload engine api
 *
 * Copyright © 2006, Intel Corporation.
 *
 *      Dan Williams <dan.j.williams@intel.com>
 *
 *      with architecture considerations by:
 *      Neil Brown <neilb@suse.de>
 *      Jeff Garzik <jeff@garzik.org>
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms and conditions of the GNU General Public License,
 * version 2, as published by the Free Software Foundation.
 *
 * This program is distributed in the hope it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
 * more details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
 *
 */
#include <linux/kernel.h>
#include <linux/interrupt.h>
#include <linux/mm.h>
#include <linux/dma-mapping.h>
#include <linux/raid/xor.h>
#include <linux/async_tx.h>

33 34
/* do_async_xor - dma map the pages and perform the xor with an engine */
static __async_inline struct dma_async_tx_descriptor *
35
do_async_xor(struct dma_chan *chan, struct page *dest, struct page **src_list,
36
	     unsigned int offset, int src_cnt, size_t len, dma_addr_t *dma_src,
37
	     struct async_submit_ctl *submit)
D
Dan Williams 已提交
38
{
39 40 41
	struct dma_device *dma = chan->device;
	struct dma_async_tx_descriptor *tx = NULL;
	int src_off = 0;
D
Dan Williams 已提交
42
	int i;
43 44 45
	dma_async_tx_callback cb_fn_orig = submit->cb_fn;
	void *cb_param_orig = submit->cb_param;
	enum async_tx_flags flags_orig = submit->flags;
46 47 48
	enum dma_ctrl_flags dma_flags;
	int xor_src_cnt;
	dma_addr_t dma_dest;
D
Dan Williams 已提交
49

50 51 52 53 54 55 56 57
	/* map the dest bidrectional in case it is re-used as a source */
	dma_dest = dma_map_page(dma->dev, dest, offset, len, DMA_BIDIRECTIONAL);
	for (i = 0; i < src_cnt; i++) {
		/* only map the dest once */
		if (unlikely(src_list[i] == dest)) {
			dma_src[i] = dma_dest;
			continue;
		}
58
		dma_src[i] = dma_map_page(dma->dev, src_list[i], offset,
59
					  len, DMA_TO_DEVICE);
60
	}
61

62
	while (src_cnt) {
63
		submit->flags = flags_orig;
64
		dma_flags = 0;
65
		xor_src_cnt = min(src_cnt, (int)dma->max_xor);
66 67 68 69 70
		/* if we are submitting additional xors, leave the chain open,
		 * clear the callback parameters, and leave the destination
		 * buffer mapped
		 */
		if (src_cnt > xor_src_cnt) {
71
			submit->flags &= ~ASYNC_TX_ACK;
D
Dan Williams 已提交
72
			submit->flags |= ASYNC_TX_FENCE;
73
			dma_flags = DMA_COMPL_SKIP_DEST_UNMAP;
74 75
			submit->cb_fn = NULL;
			submit->cb_param = NULL;
76
		} else {
77 78
			submit->cb_fn = cb_fn_orig;
			submit->cb_param = cb_param_orig;
79
		}
80
		if (submit->cb_fn)
81
			dma_flags |= DMA_PREP_INTERRUPT;
D
Dan Williams 已提交
82 83
		if (submit->flags & ASYNC_TX_FENCE)
			dma_flags |= DMA_PREP_FENCE;
84 85 86 87 88 89 90
		/* Since we have clobbered the src_list we are committed
		 * to doing this asynchronously.  Drivers force forward progress
		 * in case they can not provide a descriptor
		 */
		tx = dma->device_prep_dma_xor(chan, dma_dest, &dma_src[src_off],
					      xor_src_cnt, len, dma_flags);

91
		if (unlikely(!tx))
92
			async_tx_quiesce(&submit->depend_tx);
93

94
		/* spin wait for the preceeding transactions to complete */
95 96
		while (unlikely(!tx)) {
			dma_async_issue_pending(chan);
97 98 99 100
			tx = dma->device_prep_dma_xor(chan, dma_dest,
						      &dma_src[src_off],
						      xor_src_cnt, len,
						      dma_flags);
101
		}
D
Dan Williams 已提交
102

103 104
		async_tx_submit(chan, tx, submit);
		submit->depend_tx = tx;
105 106 107 108 109 110 111 112 113 114 115 116

		if (src_cnt > xor_src_cnt) {
			/* drop completed sources */
			src_cnt -= xor_src_cnt;
			src_off += xor_src_cnt;

			/* use the intermediate result a source */
			dma_src[--src_off] = dma_dest;
			src_cnt++;
		} else
			break;
	}
117 118

	return tx;
D
Dan Williams 已提交
119 120 121 122
}

static void
do_sync_xor(struct page *dest, struct page **src_list, unsigned int offset,
123
	    int src_cnt, size_t len, struct async_submit_ctl *submit)
D
Dan Williams 已提交
124 125
{
	int i;
126 127 128
	int xor_src_cnt;
	int src_off = 0;
	void *dest_buf;
129
	void **srcs;
D
Dan Williams 已提交
130

131 132 133 134 135 136
	if (submit->scribble)
		srcs = submit->scribble;
	else
		srcs = (void **) src_list;

	/* convert to buffer pointers */
D
Dan Williams 已提交
137
	for (i = 0; i < src_cnt; i++)
138
		srcs[i] = page_address(src_list[i]) + offset;
D
Dan Williams 已提交
139 140

	/* set destination address */
141
	dest_buf = page_address(dest) + offset;
D
Dan Williams 已提交
142

143
	if (submit->flags & ASYNC_TX_XOR_ZERO_DST)
144
		memset(dest_buf, 0, len);
D
Dan Williams 已提交
145

146 147 148 149 150 151 152 153 154
	while (src_cnt > 0) {
		/* process up to 'MAX_XOR_BLOCKS' sources */
		xor_src_cnt = min(src_cnt, MAX_XOR_BLOCKS);
		xor_blocks(xor_src_cnt, len, dest_buf, &srcs[src_off]);

		/* drop completed sources */
		src_cnt -= xor_src_cnt;
		src_off += xor_src_cnt;
	}
D
Dan Williams 已提交
155

156
	async_tx_sync_epilog(submit);
D
Dan Williams 已提交
157 158 159 160 161
}

/**
 * async_xor - attempt to xor a set of blocks with a dma engine.
 * @dest: destination page
162 163
 * @src_list: array of source pages
 * @offset: common src/dst offset to start transaction
D
Dan Williams 已提交
164 165
 * @src_cnt: number of source pages
 * @len: length in bytes
166 167 168 169 170 171 172 173 174 175 176 177 178
 * @submit: submission / completion modifiers
 *
 * honored flags: ASYNC_TX_ACK, ASYNC_TX_XOR_ZERO_DST, ASYNC_TX_XOR_DROP_DST
 *
 * xor_blocks always uses the dest as a source so the
 * ASYNC_TX_XOR_ZERO_DST flag must be set to not include dest data in
 * the calculation.  The assumption with dma eninges is that they only
 * use the destination buffer as a source when it is explicity specified
 * in the source list.
 *
 * src_list note: if the dest is also a source it must be at index zero.
 * The contents of this array will be overwritten if a scribble region
 * is not specified.
D
Dan Williams 已提交
179 180 181
 */
struct dma_async_tx_descriptor *
async_xor(struct page *dest, struct page **src_list, unsigned int offset,
182
	  int src_cnt, size_t len, struct async_submit_ctl *submit)
D
Dan Williams 已提交
183
{
184
	struct dma_chan *chan = async_tx_find_channel(submit, DMA_XOR,
185 186
						      &dest, 1, src_list,
						      src_cnt, len);
187 188
	dma_addr_t *dma_src = NULL;

D
Dan Williams 已提交
189 190
	BUG_ON(src_cnt <= 1);

191 192 193 194 195
	if (submit->scribble)
		dma_src = submit->scribble;
	else if (sizeof(dma_addr_t) <= sizeof(struct page *))
		dma_src = (dma_addr_t *) src_list;

196
	if (dma_src && chan && is_dma_xor_aligned(chan->device, offset, 0, len)) {
197 198
		/* run the xor asynchronously */
		pr_debug("%s (async): len: %zu\n", __func__, len);
D
Dan Williams 已提交
199

200
		return do_async_xor(chan, dest, src_list, offset, src_cnt, len,
201
				    dma_src, submit);
202 203 204
	} else {
		/* run the xor synchronously */
		pr_debug("%s (sync): len: %zu\n", __func__, len);
205 206
		WARN_ONCE(chan, "%s: no space for dma address conversion\n",
			  __func__);
D
Dan Williams 已提交
207

208 209
		/* in the sync case the dest is an implied source
		 * (assumes the dest is the first source)
D
Dan Williams 已提交
210
		 */
211
		if (submit->flags & ASYNC_TX_XOR_DROP_DST) {
212 213 214
			src_cnt--;
			src_list++;
		}
D
Dan Williams 已提交
215

216
		/* wait for any prerequisite operations */
217
		async_tx_quiesce(&submit->depend_tx);
D
Dan Williams 已提交
218

219
		do_sync_xor(dest, src_list, offset, src_cnt, len, submit);
D
Dan Williams 已提交
220

221
		return NULL;
D
Dan Williams 已提交
222 223 224 225 226 227 228 229 230 231 232 233
	}
}
EXPORT_SYMBOL_GPL(async_xor);

static int page_is_zero(struct page *p, unsigned int offset, size_t len)
{
	char *a = page_address(p) + offset;
	return ((*(u32 *) a) == 0 &&
		memcmp(a, a + 4, len - 4) == 0);
}

/**
D
Dan Williams 已提交
234
 * async_xor_val - attempt a xor parity check with a dma engine.
D
Dan Williams 已提交
235
 * @dest: destination page used if the xor is performed synchronously
236
 * @src_list: array of source pages
D
Dan Williams 已提交
237 238 239 240
 * @offset: offset in pages to start transaction
 * @src_cnt: number of source pages
 * @len: length in bytes
 * @result: 0 if sum == 0 else non-zero
241 242 243 244 245 246 247
 * @submit: submission / completion modifiers
 *
 * honored flags: ASYNC_TX_ACK
 *
 * src_list note: if the dest is also a source it must be at index zero.
 * The contents of this array will be overwritten if a scribble region
 * is not specified.
D
Dan Williams 已提交
248 249
 */
struct dma_async_tx_descriptor *
250
async_xor_val(struct page *dest, struct page **src_list, unsigned int offset,
D
Dan Williams 已提交
251
	      int src_cnt, size_t len, enum sum_check_flags *result,
252
	      struct async_submit_ctl *submit)
D
Dan Williams 已提交
253
{
254
	struct dma_chan *chan = async_tx_find_channel(submit, DMA_XOR_VAL,
255 256
						      &dest, 1, src_list,
						      src_cnt, len);
D
Dan Williams 已提交
257
	struct dma_device *device = chan ? chan->device : NULL;
258
	struct dma_async_tx_descriptor *tx = NULL;
259
	dma_addr_t *dma_src = NULL;
D
Dan Williams 已提交
260 261 262

	BUG_ON(src_cnt <= 1);

263 264 265 266 267
	if (submit->scribble)
		dma_src = submit->scribble;
	else if (sizeof(dma_addr_t) <= sizeof(struct page *))
		dma_src = (dma_addr_t *) src_list;

268 269
	if (dma_src && device && src_cnt <= device->max_xor &&
	    is_dma_xor_aligned(device, offset, 0, len)) {
D
Dan Williams 已提交
270
		unsigned long dma_prep_flags = 0;
271
		int i;
D
Dan Williams 已提交
272

273
		pr_debug("%s: (async) len: %zu\n", __func__, len);
D
Dan Williams 已提交
274

D
Dan Williams 已提交
275 276 277 278
		if (submit->cb_fn)
			dma_prep_flags |= DMA_PREP_INTERRUPT;
		if (submit->flags & ASYNC_TX_FENCE)
			dma_prep_flags |= DMA_PREP_FENCE;
279 280 281 282
		for (i = 0; i < src_cnt; i++)
			dma_src[i] = dma_map_page(device->dev, src_list[i],
						  offset, len, DMA_TO_DEVICE);

D
Dan Williams 已提交
283 284 285
		tx = device->device_prep_dma_xor_val(chan, dma_src, src_cnt,
						     len, result,
						     dma_prep_flags);
286
		if (unlikely(!tx)) {
287
			async_tx_quiesce(&submit->depend_tx);
288

289
			while (!tx) {
290
				dma_async_issue_pending(chan);
D
Dan Williams 已提交
291
				tx = device->device_prep_dma_xor_val(chan,
292
					dma_src, src_cnt, len, result,
293
					dma_prep_flags);
294
			}
D
Dan Williams 已提交
295 296
		}

297
		async_tx_submit(chan, tx, submit);
D
Dan Williams 已提交
298
	} else {
299
		enum async_tx_flags flags_orig = submit->flags;
D
Dan Williams 已提交
300

301
		pr_debug("%s: (sync) len: %zu\n", __func__, len);
302 303 304
		WARN_ONCE(device && src_cnt <= device->max_xor,
			  "%s: no space for dma address conversion\n",
			  __func__);
D
Dan Williams 已提交
305

306 307
		submit->flags |= ASYNC_TX_XOR_DROP_DST;
		submit->flags &= ~ASYNC_TX_ACK;
D
Dan Williams 已提交
308

309
		tx = async_xor(dest, src_list, offset, src_cnt, len, submit);
D
Dan Williams 已提交
310

D
Dan Williams 已提交
311
		async_tx_quiesce(&tx);
D
Dan Williams 已提交
312

D
Dan Williams 已提交
313
		*result = !page_is_zero(dest, offset, len) << SUM_CHECK_P;
D
Dan Williams 已提交
314

315 316
		async_tx_sync_epilog(submit);
		submit->flags = flags_orig;
D
Dan Williams 已提交
317 318 319 320
	}

	return tx;
}
D
Dan Williams 已提交
321
EXPORT_SYMBOL_GPL(async_xor_val);
D
Dan Williams 已提交
322 323 324 325

MODULE_AUTHOR("Intel Corporation");
MODULE_DESCRIPTION("asynchronous xor/xor-zero-sum api");
MODULE_LICENSE("GPL");