]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright (C) 2002 Sistina Software (UK) Limited. | |
373a392b | 3 | * Copyright (C) 2006 Red Hat GmbH |
1da177e4 LT |
4 | * |
5 | * This file is released under the GPL. | |
6 | * | |
7 | * Kcopyd provides a simple interface for copying an area of one | |
8 | * block-device to one or more other block-devices, with an asynchronous | |
9 | * completion notification. | |
10 | */ | |
11 | ||
eb69aca5 | 12 | #include <linux/types.h> |
60063497 | 13 | #include <linux/atomic.h> |
1da177e4 | 14 | #include <linux/blkdev.h> |
1da177e4 LT |
15 | #include <linux/fs.h> |
16 | #include <linux/init.h> | |
17 | #include <linux/list.h> | |
18 | #include <linux/mempool.h> | |
19 | #include <linux/module.h> | |
20 | #include <linux/pagemap.h> | |
21 | #include <linux/slab.h> | |
22 | #include <linux/vmalloc.h> | |
23 | #include <linux/workqueue.h> | |
48c9c27b | 24 | #include <linux/mutex.h> |
586e80e6 | 25 | #include <linux/device-mapper.h> |
a765e20e | 26 | #include <linux/dm-kcopyd.h> |
1da177e4 | 27 | |
22a1ceb1 | 28 | #include "dm.h" |
1da177e4 | 29 | |
c6ea41fb MP |
30 | #define SUB_JOB_SIZE 128 |
31 | #define SPLIT_COUNT 8 | |
32 | #define MIN_JOBS 8 | |
5f43ba29 | 33 | #define RESERVE_PAGES (DIV_ROUND_UP(SUB_JOB_SIZE << SECTOR_SHIFT, PAGE_SIZE)) |
c6ea41fb | 34 | |
1da177e4 LT |
35 | /*----------------------------------------------------------------- |
36 | * Each kcopyd client has its own little pool of preallocated | |
37 | * pages for kcopyd io. | |
38 | *---------------------------------------------------------------*/ | |
eb69aca5 | 39 | struct dm_kcopyd_client { |
1da177e4 | 40 | struct page_list *pages; |
d0471458 MP |
41 | unsigned nr_reserved_pages; |
42 | unsigned nr_free_pages; | |
138728dc | 43 | |
373a392b MB |
44 | struct dm_io_client *io_client; |
45 | ||
138728dc AK |
46 | wait_queue_head_t destroyq; |
47 | atomic_t nr_jobs; | |
8c0cbc2f | 48 | |
08d8757a MP |
49 | mempool_t *job_pool; |
50 | ||
8c0cbc2f MP |
51 | struct workqueue_struct *kcopyd_wq; |
52 | struct work_struct kcopyd_work; | |
53 | ||
54 | /* | |
55 | * We maintain three lists of jobs: | |
56 | * | |
57 | * i) jobs waiting for pages | |
58 | * ii) jobs that have pages, and are waiting for the io to be issued. | |
59 | * iii) jobs that have completed. | |
60 | * | |
61 | * All three of these are protected by job_lock. | |
62 | */ | |
63 | spinlock_t job_lock; | |
64 | struct list_head complete_jobs; | |
65 | struct list_head io_jobs; | |
66 | struct list_head pages_jobs; | |
1da177e4 LT |
67 | }; |
68 | ||
8c0cbc2f MP |
69 | static void wake(struct dm_kcopyd_client *kc) |
70 | { | |
71 | queue_work(kc->kcopyd_wq, &kc->kcopyd_work); | |
72 | } | |
73 | ||
d0471458 MP |
74 | /* |
75 | * Obtain one page for the use of kcopyd. | |
76 | */ | |
f99b55ee | 77 | static struct page_list *alloc_pl(gfp_t gfp) |
1da177e4 LT |
78 | { |
79 | struct page_list *pl; | |
80 | ||
f99b55ee | 81 | pl = kmalloc(sizeof(*pl), gfp); |
1da177e4 LT |
82 | if (!pl) |
83 | return NULL; | |
84 | ||
f99b55ee | 85 | pl->page = alloc_page(gfp); |
1da177e4 LT |
86 | if (!pl->page) { |
87 | kfree(pl); | |
88 | return NULL; | |
89 | } | |
90 | ||
91 | return pl; | |
92 | } | |
93 | ||
94 | static void free_pl(struct page_list *pl) | |
95 | { | |
96 | __free_page(pl->page); | |
97 | kfree(pl); | |
98 | } | |
99 | ||
d0471458 MP |
100 | /* |
101 | * Add the provided pages to a client's free page list, releasing | |
102 | * back to the system any beyond the reserved_pages limit. | |
103 | */ | |
104 | static void kcopyd_put_pages(struct dm_kcopyd_client *kc, struct page_list *pl) | |
1da177e4 | 105 | { |
d0471458 | 106 | struct page_list *next; |
1da177e4 | 107 | |
d0471458 MP |
108 | do { |
109 | next = pl->next; | |
1da177e4 | 110 | |
d0471458 MP |
111 | if (kc->nr_free_pages >= kc->nr_reserved_pages) |
112 | free_pl(pl); | |
113 | else { | |
114 | pl->next = kc->pages; | |
115 | kc->pages = pl; | |
116 | kc->nr_free_pages++; | |
117 | } | |
1da177e4 | 118 | |
d0471458 MP |
119 | pl = next; |
120 | } while (pl); | |
1da177e4 LT |
121 | } |
122 | ||
d0471458 MP |
123 | static int kcopyd_get_pages(struct dm_kcopyd_client *kc, |
124 | unsigned int nr, struct page_list **pages) | |
1da177e4 | 125 | { |
d0471458 | 126 | struct page_list *pl; |
1da177e4 | 127 | |
d0471458 MP |
128 | *pages = NULL; |
129 | ||
130 | do { | |
131 | pl = alloc_pl(__GFP_NOWARN | __GFP_NORETRY); | |
132 | if (unlikely(!pl)) { | |
133 | /* Use reserved pages */ | |
134 | pl = kc->pages; | |
135 | if (unlikely(!pl)) | |
136 | goto out_of_memory; | |
137 | kc->pages = pl->next; | |
138 | kc->nr_free_pages--; | |
139 | } | |
140 | pl->next = *pages; | |
141 | *pages = pl; | |
142 | } while (--nr); | |
143 | ||
144 | return 0; | |
1da177e4 | 145 | |
d0471458 MP |
146 | out_of_memory: |
147 | if (*pages) | |
148 | kcopyd_put_pages(kc, *pages); | |
149 | return -ENOMEM; | |
1da177e4 LT |
150 | } |
151 | ||
152 | /* | |
153 | * These three functions resize the page pool. | |
154 | */ | |
155 | static void drop_pages(struct page_list *pl) | |
156 | { | |
157 | struct page_list *next; | |
158 | ||
159 | while (pl) { | |
160 | next = pl->next; | |
161 | free_pl(pl); | |
162 | pl = next; | |
163 | } | |
164 | } | |
165 | ||
d0471458 MP |
166 | /* |
167 | * Allocate and reserve nr_pages for the use of a specific client. | |
168 | */ | |
169 | static int client_reserve_pages(struct dm_kcopyd_client *kc, unsigned nr_pages) | |
1da177e4 | 170 | { |
d0471458 | 171 | unsigned i; |
1da177e4 LT |
172 | struct page_list *pl = NULL, *next; |
173 | ||
d0471458 | 174 | for (i = 0; i < nr_pages; i++) { |
f99b55ee | 175 | next = alloc_pl(GFP_KERNEL); |
1da177e4 LT |
176 | if (!next) { |
177 | if (pl) | |
178 | drop_pages(pl); | |
179 | return -ENOMEM; | |
180 | } | |
181 | next->next = pl; | |
182 | pl = next; | |
183 | } | |
184 | ||
d0471458 | 185 | kc->nr_reserved_pages += nr_pages; |
1da177e4 | 186 | kcopyd_put_pages(kc, pl); |
d0471458 | 187 | |
1da177e4 LT |
188 | return 0; |
189 | } | |
190 | ||
eb69aca5 | 191 | static void client_free_pages(struct dm_kcopyd_client *kc) |
1da177e4 | 192 | { |
d0471458 | 193 | BUG_ON(kc->nr_free_pages != kc->nr_reserved_pages); |
1da177e4 LT |
194 | drop_pages(kc->pages); |
195 | kc->pages = NULL; | |
d0471458 | 196 | kc->nr_free_pages = kc->nr_reserved_pages = 0; |
1da177e4 LT |
197 | } |
198 | ||
199 | /*----------------------------------------------------------------- | |
200 | * kcopyd_jobs need to be allocated by the *clients* of kcopyd, | |
201 | * for this reason we use a mempool to prevent the client from | |
202 | * ever having to do io (which could cause a deadlock). | |
203 | *---------------------------------------------------------------*/ | |
204 | struct kcopyd_job { | |
eb69aca5 | 205 | struct dm_kcopyd_client *kc; |
1da177e4 LT |
206 | struct list_head list; |
207 | unsigned long flags; | |
208 | ||
209 | /* | |
210 | * Error state of the job. | |
211 | */ | |
212 | int read_err; | |
4cdc1d1f | 213 | unsigned long write_err; |
1da177e4 LT |
214 | |
215 | /* | |
216 | * Either READ or WRITE | |
217 | */ | |
218 | int rw; | |
22a1ceb1 | 219 | struct dm_io_region source; |
1da177e4 LT |
220 | |
221 | /* | |
222 | * The destinations for the transfer. | |
223 | */ | |
224 | unsigned int num_dests; | |
eb69aca5 | 225 | struct dm_io_region dests[DM_KCOPYD_MAX_REGIONS]; |
1da177e4 | 226 | |
1da177e4 LT |
227 | struct page_list *pages; |
228 | ||
229 | /* | |
230 | * Set this to ensure you are notified when the job has | |
231 | * completed. 'context' is for callback to use. | |
232 | */ | |
eb69aca5 | 233 | dm_kcopyd_notify_fn fn; |
1da177e4 LT |
234 | void *context; |
235 | ||
236 | /* | |
237 | * These fields are only used if the job has been split | |
238 | * into more manageable parts. | |
239 | */ | |
def5b5b2 | 240 | struct mutex lock; |
1da177e4 LT |
241 | atomic_t sub_jobs; |
242 | sector_t progress; | |
1da177e4 | 243 | |
c6ea41fb MP |
244 | struct kcopyd_job *master_job; |
245 | }; | |
1da177e4 | 246 | |
e18b890b | 247 | static struct kmem_cache *_job_cache; |
1da177e4 | 248 | |
945fa4d2 | 249 | int __init dm_kcopyd_init(void) |
1da177e4 | 250 | { |
c6ea41fb MP |
251 | _job_cache = kmem_cache_create("kcopyd_job", |
252 | sizeof(struct kcopyd_job) * (SPLIT_COUNT + 1), | |
253 | __alignof__(struct kcopyd_job), 0, NULL); | |
1da177e4 LT |
254 | if (!_job_cache) |
255 | return -ENOMEM; | |
256 | ||
1da177e4 LT |
257 | return 0; |
258 | } | |
259 | ||
945fa4d2 | 260 | void dm_kcopyd_exit(void) |
1da177e4 | 261 | { |
1da177e4 | 262 | kmem_cache_destroy(_job_cache); |
1da177e4 LT |
263 | _job_cache = NULL; |
264 | } | |
265 | ||
266 | /* | |
267 | * Functions to push and pop a job onto the head of a given job | |
268 | * list. | |
269 | */ | |
8c0cbc2f MP |
270 | static struct kcopyd_job *pop(struct list_head *jobs, |
271 | struct dm_kcopyd_client *kc) | |
1da177e4 LT |
272 | { |
273 | struct kcopyd_job *job = NULL; | |
274 | unsigned long flags; | |
275 | ||
8c0cbc2f | 276 | spin_lock_irqsave(&kc->job_lock, flags); |
1da177e4 LT |
277 | |
278 | if (!list_empty(jobs)) { | |
279 | job = list_entry(jobs->next, struct kcopyd_job, list); | |
280 | list_del(&job->list); | |
281 | } | |
8c0cbc2f | 282 | spin_unlock_irqrestore(&kc->job_lock, flags); |
1da177e4 LT |
283 | |
284 | return job; | |
285 | } | |
286 | ||
028867ac | 287 | static void push(struct list_head *jobs, struct kcopyd_job *job) |
1da177e4 LT |
288 | { |
289 | unsigned long flags; | |
8c0cbc2f | 290 | struct dm_kcopyd_client *kc = job->kc; |
1da177e4 | 291 | |
8c0cbc2f | 292 | spin_lock_irqsave(&kc->job_lock, flags); |
1da177e4 | 293 | list_add_tail(&job->list, jobs); |
8c0cbc2f | 294 | spin_unlock_irqrestore(&kc->job_lock, flags); |
1da177e4 LT |
295 | } |
296 | ||
b673c3a8 KI |
297 | |
298 | static void push_head(struct list_head *jobs, struct kcopyd_job *job) | |
299 | { | |
300 | unsigned long flags; | |
301 | struct dm_kcopyd_client *kc = job->kc; | |
302 | ||
303 | spin_lock_irqsave(&kc->job_lock, flags); | |
304 | list_add(&job->list, jobs); | |
305 | spin_unlock_irqrestore(&kc->job_lock, flags); | |
306 | } | |
307 | ||
1da177e4 LT |
308 | /* |
309 | * These three functions process 1 item from the corresponding | |
310 | * job list. | |
311 | * | |
312 | * They return: | |
313 | * < 0: error | |
314 | * 0: success | |
315 | * > 0: can't process yet. | |
316 | */ | |
317 | static int run_complete_job(struct kcopyd_job *job) | |
318 | { | |
319 | void *context = job->context; | |
320 | int read_err = job->read_err; | |
4cdc1d1f | 321 | unsigned long write_err = job->write_err; |
eb69aca5 HM |
322 | dm_kcopyd_notify_fn fn = job->fn; |
323 | struct dm_kcopyd_client *kc = job->kc; | |
1da177e4 | 324 | |
73830857 MP |
325 | if (job->pages) |
326 | kcopyd_put_pages(kc, job->pages); | |
c6ea41fb MP |
327 | /* |
328 | * If this is the master job, the sub jobs have already | |
329 | * completed so we can free everything. | |
330 | */ | |
331 | if (job->master_job == job) | |
332 | mempool_free(job, kc->job_pool); | |
1da177e4 | 333 | fn(read_err, write_err, context); |
138728dc AK |
334 | |
335 | if (atomic_dec_and_test(&kc->nr_jobs)) | |
336 | wake_up(&kc->destroyq); | |
337 | ||
1da177e4 LT |
338 | return 0; |
339 | } | |
340 | ||
341 | static void complete_io(unsigned long error, void *context) | |
342 | { | |
343 | struct kcopyd_job *job = (struct kcopyd_job *) context; | |
8c0cbc2f | 344 | struct dm_kcopyd_client *kc = job->kc; |
1da177e4 LT |
345 | |
346 | if (error) { | |
347 | if (job->rw == WRITE) | |
ce503f59 | 348 | job->write_err |= error; |
1da177e4 LT |
349 | else |
350 | job->read_err = 1; | |
351 | ||
eb69aca5 | 352 | if (!test_bit(DM_KCOPYD_IGNORE_ERROR, &job->flags)) { |
8c0cbc2f MP |
353 | push(&kc->complete_jobs, job); |
354 | wake(kc); | |
1da177e4 LT |
355 | return; |
356 | } | |
357 | } | |
358 | ||
359 | if (job->rw == WRITE) | |
8c0cbc2f | 360 | push(&kc->complete_jobs, job); |
1da177e4 LT |
361 | |
362 | else { | |
363 | job->rw = WRITE; | |
8c0cbc2f | 364 | push(&kc->io_jobs, job); |
1da177e4 LT |
365 | } |
366 | ||
8c0cbc2f | 367 | wake(kc); |
1da177e4 LT |
368 | } |
369 | ||
370 | /* | |
371 | * Request io on as many buffer heads as we can currently get for | |
372 | * a particular job. | |
373 | */ | |
374 | static int run_io_job(struct kcopyd_job *job) | |
375 | { | |
376 | int r; | |
373a392b | 377 | struct dm_io_request io_req = { |
8d35d3e3 | 378 | .bi_rw = job->rw, |
373a392b MB |
379 | .mem.type = DM_IO_PAGE_LIST, |
380 | .mem.ptr.pl = job->pages, | |
4622afb3 | 381 | .mem.offset = 0, |
373a392b MB |
382 | .notify.fn = complete_io, |
383 | .notify.context = job, | |
384 | .client = job->kc->io_client, | |
385 | }; | |
1da177e4 | 386 | |
7eaceacc | 387 | if (job->rw == READ) |
373a392b | 388 | r = dm_io(&io_req, 1, &job->source, NULL); |
721a9602 | 389 | else |
373a392b | 390 | r = dm_io(&io_req, job->num_dests, job->dests, NULL); |
1da177e4 LT |
391 | |
392 | return r; | |
393 | } | |
394 | ||
395 | static int run_pages_job(struct kcopyd_job *job) | |
396 | { | |
397 | int r; | |
5bf45a3d | 398 | unsigned nr_pages = dm_div_up(job->dests[0].count, PAGE_SIZE >> 9); |
1da177e4 | 399 | |
5bf45a3d | 400 | r = kcopyd_get_pages(job->kc, nr_pages, &job->pages); |
1da177e4 LT |
401 | if (!r) { |
402 | /* this job is ready for io */ | |
8c0cbc2f | 403 | push(&job->kc->io_jobs, job); |
1da177e4 LT |
404 | return 0; |
405 | } | |
406 | ||
407 | if (r == -ENOMEM) | |
408 | /* can't complete now */ | |
409 | return 1; | |
410 | ||
411 | return r; | |
412 | } | |
413 | ||
414 | /* | |
415 | * Run through a list for as long as possible. Returns the count | |
416 | * of successful jobs. | |
417 | */ | |
8c0cbc2f MP |
418 | static int process_jobs(struct list_head *jobs, struct dm_kcopyd_client *kc, |
419 | int (*fn) (struct kcopyd_job *)) | |
1da177e4 LT |
420 | { |
421 | struct kcopyd_job *job; | |
422 | int r, count = 0; | |
423 | ||
8c0cbc2f | 424 | while ((job = pop(jobs, kc))) { |
1da177e4 LT |
425 | |
426 | r = fn(job); | |
427 | ||
428 | if (r < 0) { | |
429 | /* error this rogue job */ | |
430 | if (job->rw == WRITE) | |
4cdc1d1f | 431 | job->write_err = (unsigned long) -1L; |
1da177e4 LT |
432 | else |
433 | job->read_err = 1; | |
8c0cbc2f | 434 | push(&kc->complete_jobs, job); |
1da177e4 LT |
435 | break; |
436 | } | |
437 | ||
438 | if (r > 0) { | |
439 | /* | |
440 | * We couldn't service this job ATM, so | |
441 | * push this job back onto the list. | |
442 | */ | |
b673c3a8 | 443 | push_head(jobs, job); |
1da177e4 LT |
444 | break; |
445 | } | |
446 | ||
447 | count++; | |
448 | } | |
449 | ||
450 | return count; | |
451 | } | |
452 | ||
453 | /* | |
454 | * kcopyd does this every time it's woken up. | |
455 | */ | |
8c0cbc2f | 456 | static void do_work(struct work_struct *work) |
1da177e4 | 457 | { |
8c0cbc2f MP |
458 | struct dm_kcopyd_client *kc = container_of(work, |
459 | struct dm_kcopyd_client, kcopyd_work); | |
7eaceacc | 460 | struct blk_plug plug; |
8c0cbc2f | 461 | |
1da177e4 LT |
462 | /* |
463 | * The order that these are called is *very* important. | |
464 | * complete jobs can free some pages for pages jobs. | |
465 | * Pages jobs when successful will jump onto the io jobs | |
466 | * list. io jobs call wake when they complete and it all | |
467 | * starts again. | |
468 | */ | |
7eaceacc | 469 | blk_start_plug(&plug); |
8c0cbc2f MP |
470 | process_jobs(&kc->complete_jobs, kc, run_complete_job); |
471 | process_jobs(&kc->pages_jobs, kc, run_pages_job); | |
472 | process_jobs(&kc->io_jobs, kc, run_io_job); | |
7eaceacc | 473 | blk_finish_plug(&plug); |
1da177e4 LT |
474 | } |
475 | ||
476 | /* | |
477 | * If we are copying a small region we just dispatch a single job | |
478 | * to do the copy, otherwise the io has to be split up into many | |
479 | * jobs. | |
480 | */ | |
481 | static void dispatch_job(struct kcopyd_job *job) | |
482 | { | |
8c0cbc2f MP |
483 | struct dm_kcopyd_client *kc = job->kc; |
484 | atomic_inc(&kc->nr_jobs); | |
9ca170a3 MP |
485 | if (unlikely(!job->source.count)) |
486 | push(&kc->complete_jobs, job); | |
487 | else | |
488 | push(&kc->pages_jobs, job); | |
8c0cbc2f | 489 | wake(kc); |
1da177e4 LT |
490 | } |
491 | ||
4cdc1d1f AK |
492 | static void segment_complete(int read_err, unsigned long write_err, |
493 | void *context) | |
1da177e4 LT |
494 | { |
495 | /* FIXME: tidy this function */ | |
496 | sector_t progress = 0; | |
497 | sector_t count = 0; | |
c6ea41fb MP |
498 | struct kcopyd_job *sub_job = (struct kcopyd_job *) context; |
499 | struct kcopyd_job *job = sub_job->master_job; | |
73830857 | 500 | struct dm_kcopyd_client *kc = job->kc; |
1da177e4 | 501 | |
def5b5b2 | 502 | mutex_lock(&job->lock); |
1da177e4 LT |
503 | |
504 | /* update the error */ | |
505 | if (read_err) | |
506 | job->read_err = 1; | |
507 | ||
508 | if (write_err) | |
ce503f59 | 509 | job->write_err |= write_err; |
1da177e4 LT |
510 | |
511 | /* | |
512 | * Only dispatch more work if there hasn't been an error. | |
513 | */ | |
514 | if ((!job->read_err && !job->write_err) || | |
eb69aca5 | 515 | test_bit(DM_KCOPYD_IGNORE_ERROR, &job->flags)) { |
1da177e4 LT |
516 | /* get the next chunk of work */ |
517 | progress = job->progress; | |
518 | count = job->source.count - progress; | |
519 | if (count) { | |
520 | if (count > SUB_JOB_SIZE) | |
521 | count = SUB_JOB_SIZE; | |
522 | ||
523 | job->progress += count; | |
524 | } | |
525 | } | |
def5b5b2 | 526 | mutex_unlock(&job->lock); |
1da177e4 LT |
527 | |
528 | if (count) { | |
529 | int i; | |
1da177e4 LT |
530 | |
531 | *sub_job = *job; | |
532 | sub_job->source.sector += progress; | |
533 | sub_job->source.count = count; | |
534 | ||
535 | for (i = 0; i < job->num_dests; i++) { | |
536 | sub_job->dests[i].sector += progress; | |
537 | sub_job->dests[i].count = count; | |
538 | } | |
539 | ||
540 | sub_job->fn = segment_complete; | |
c6ea41fb | 541 | sub_job->context = sub_job; |
1da177e4 LT |
542 | dispatch_job(sub_job); |
543 | ||
544 | } else if (atomic_dec_and_test(&job->sub_jobs)) { | |
545 | ||
546 | /* | |
340cd444 MP |
547 | * Queue the completion callback to the kcopyd thread. |
548 | * | |
549 | * Some callers assume that all the completions are called | |
550 | * from a single thread and don't race with each other. | |
551 | * | |
552 | * We must not call the callback directly here because this | |
553 | * code may not be executing in the thread. | |
1da177e4 | 554 | */ |
340cd444 MP |
555 | push(&kc->complete_jobs, job); |
556 | wake(kc); | |
1da177e4 LT |
557 | } |
558 | } | |
559 | ||
560 | /* | |
c6ea41fb | 561 | * Create some sub jobs to share the work between them. |
1da177e4 | 562 | */ |
c6ea41fb | 563 | static void split_job(struct kcopyd_job *master_job) |
1da177e4 LT |
564 | { |
565 | int i; | |
566 | ||
c6ea41fb | 567 | atomic_inc(&master_job->kc->nr_jobs); |
340cd444 | 568 | |
c6ea41fb MP |
569 | atomic_set(&master_job->sub_jobs, SPLIT_COUNT); |
570 | for (i = 0; i < SPLIT_COUNT; i++) { | |
571 | master_job[i + 1].master_job = master_job; | |
572 | segment_complete(0, 0u, &master_job[i + 1]); | |
573 | } | |
1da177e4 LT |
574 | } |
575 | ||
eb69aca5 HM |
576 | int dm_kcopyd_copy(struct dm_kcopyd_client *kc, struct dm_io_region *from, |
577 | unsigned int num_dests, struct dm_io_region *dests, | |
578 | unsigned int flags, dm_kcopyd_notify_fn fn, void *context) | |
1da177e4 LT |
579 | { |
580 | struct kcopyd_job *job; | |
581 | ||
582 | /* | |
c6ea41fb MP |
583 | * Allocate an array of jobs consisting of one master job |
584 | * followed by SPLIT_COUNT sub jobs. | |
1da177e4 | 585 | */ |
08d8757a | 586 | job = mempool_alloc(kc->job_pool, GFP_NOIO); |
1da177e4 LT |
587 | |
588 | /* | |
589 | * set up for the read. | |
590 | */ | |
591 | job->kc = kc; | |
592 | job->flags = flags; | |
593 | job->read_err = 0; | |
594 | job->write_err = 0; | |
595 | job->rw = READ; | |
596 | ||
597 | job->source = *from; | |
598 | ||
599 | job->num_dests = num_dests; | |
600 | memcpy(&job->dests, dests, sizeof(*dests) * num_dests); | |
601 | ||
1da177e4 LT |
602 | job->pages = NULL; |
603 | ||
604 | job->fn = fn; | |
605 | job->context = context; | |
c6ea41fb | 606 | job->master_job = job; |
1da177e4 | 607 | |
a705a34a | 608 | if (job->source.count <= SUB_JOB_SIZE) |
1da177e4 | 609 | dispatch_job(job); |
1da177e4 | 610 | else { |
def5b5b2 | 611 | mutex_init(&job->lock); |
1da177e4 LT |
612 | job->progress = 0; |
613 | split_job(job); | |
614 | } | |
615 | ||
616 | return 0; | |
617 | } | |
eb69aca5 | 618 | EXPORT_SYMBOL(dm_kcopyd_copy); |
1da177e4 LT |
619 | |
620 | /* | |
621 | * Cancels a kcopyd job, eg. someone might be deactivating a | |
622 | * mirror. | |
623 | */ | |
0b56306e | 624 | #if 0 |
1da177e4 LT |
625 | int kcopyd_cancel(struct kcopyd_job *job, int block) |
626 | { | |
627 | /* FIXME: finish */ | |
628 | return -1; | |
629 | } | |
0b56306e | 630 | #endif /* 0 */ |
1da177e4 LT |
631 | |
632 | /*----------------------------------------------------------------- | |
945fa4d2 | 633 | * Client setup |
1da177e4 | 634 | *---------------------------------------------------------------*/ |
fa34ce73 | 635 | struct dm_kcopyd_client *dm_kcopyd_client_create(void) |
1da177e4 | 636 | { |
945fa4d2 | 637 | int r = -ENOMEM; |
eb69aca5 | 638 | struct dm_kcopyd_client *kc; |
1da177e4 | 639 | |
1da177e4 | 640 | kc = kmalloc(sizeof(*kc), GFP_KERNEL); |
945fa4d2 | 641 | if (!kc) |
fa34ce73 | 642 | return ERR_PTR(-ENOMEM); |
1da177e4 | 643 | |
8c0cbc2f MP |
644 | spin_lock_init(&kc->job_lock); |
645 | INIT_LIST_HEAD(&kc->complete_jobs); | |
646 | INIT_LIST_HEAD(&kc->io_jobs); | |
647 | INIT_LIST_HEAD(&kc->pages_jobs); | |
648 | ||
08d8757a | 649 | kc->job_pool = mempool_create_slab_pool(MIN_JOBS, _job_cache); |
945fa4d2 MP |
650 | if (!kc->job_pool) |
651 | goto bad_slab; | |
08d8757a | 652 | |
8c0cbc2f | 653 | INIT_WORK(&kc->kcopyd_work, do_work); |
9c4376de TH |
654 | kc->kcopyd_wq = alloc_workqueue("kcopyd", |
655 | WQ_NON_REENTRANT | WQ_MEM_RECLAIM, 0); | |
945fa4d2 MP |
656 | if (!kc->kcopyd_wq) |
657 | goto bad_workqueue; | |
8c0cbc2f | 658 | |
1da177e4 | 659 | kc->pages = NULL; |
d0471458 | 660 | kc->nr_reserved_pages = kc->nr_free_pages = 0; |
5f43ba29 | 661 | r = client_reserve_pages(kc, RESERVE_PAGES); |
945fa4d2 MP |
662 | if (r) |
663 | goto bad_client_pages; | |
1da177e4 | 664 | |
bda8efec | 665 | kc->io_client = dm_io_client_create(); |
373a392b MB |
666 | if (IS_ERR(kc->io_client)) { |
667 | r = PTR_ERR(kc->io_client); | |
945fa4d2 | 668 | goto bad_io_client; |
1da177e4 LT |
669 | } |
670 | ||
138728dc AK |
671 | init_waitqueue_head(&kc->destroyq); |
672 | atomic_set(&kc->nr_jobs, 0); | |
673 | ||
fa34ce73 | 674 | return kc; |
945fa4d2 MP |
675 | |
676 | bad_io_client: | |
677 | client_free_pages(kc); | |
678 | bad_client_pages: | |
679 | destroy_workqueue(kc->kcopyd_wq); | |
680 | bad_workqueue: | |
681 | mempool_destroy(kc->job_pool); | |
682 | bad_slab: | |
683 | kfree(kc); | |
684 | ||
fa34ce73 | 685 | return ERR_PTR(r); |
1da177e4 | 686 | } |
eb69aca5 | 687 | EXPORT_SYMBOL(dm_kcopyd_client_create); |
1da177e4 | 688 | |
eb69aca5 | 689 | void dm_kcopyd_client_destroy(struct dm_kcopyd_client *kc) |
1da177e4 | 690 | { |
138728dc AK |
691 | /* Wait for completion of all jobs submitted by this client. */ |
692 | wait_event(kc->destroyq, !atomic_read(&kc->nr_jobs)); | |
693 | ||
8c0cbc2f MP |
694 | BUG_ON(!list_empty(&kc->complete_jobs)); |
695 | BUG_ON(!list_empty(&kc->io_jobs)); | |
696 | BUG_ON(!list_empty(&kc->pages_jobs)); | |
697 | destroy_workqueue(kc->kcopyd_wq); | |
373a392b | 698 | dm_io_client_destroy(kc->io_client); |
1da177e4 | 699 | client_free_pages(kc); |
08d8757a | 700 | mempool_destroy(kc->job_pool); |
1da177e4 | 701 | kfree(kc); |
1da177e4 | 702 | } |
eb69aca5 | 703 | EXPORT_SYMBOL(dm_kcopyd_client_destroy); |