blob: 489d7fbcec51106026083ab9bcbfe15974e2cc78 [file] [log] [blame]
lh9ed821d2023-04-07 01:36:19 -07001/*
2 * Copyright (C) 2003 Sistina Software
3 * Copyright (C) 2006 Red Hat GmbH
4 *
5 * This file is released under the GPL.
6 */
7
8#include "dm.h"
9
10#include <linux/device-mapper.h>
11
12#include <linux/bio.h>
13#include <linux/mempool.h>
14#include <linux/module.h>
15#include <linux/sched.h>
16#include <linux/slab.h>
17#include <linux/dm-io.h>
18
19#define DM_MSG_PREFIX "io"
20
21#define DM_IO_MAX_REGIONS BITS_PER_LONG
22#define MIN_IOS 16
23#define MIN_BIOS 16
24
25struct dm_io_client {
26 mempool_t *pool;
27 struct bio_set *bios;
28};
29
30/*
31 * Aligning 'struct io' reduces the number of bits required to store
32 * its address. Refer to store_io_and_region_in_bio() below.
33 */
34struct io {
35 unsigned long error_bits;
36 atomic_t count;
37 struct task_struct *sleeper;
38 struct dm_io_client *client;
39 io_notify_fn callback;
40 void *context;
41 void *vma_invalidate_address;
42 unsigned long vma_invalidate_size;
43} __attribute__((aligned(DM_IO_MAX_REGIONS)));
44
45static struct kmem_cache *_dm_io_cache;
46
47/*
48 * Create a client with mempool and bioset.
49 */
50struct dm_io_client *dm_io_client_create(void)
51{
52 struct dm_io_client *client;
53
54 client = kmalloc(sizeof(*client), GFP_KERNEL);
55 if (!client)
56 return ERR_PTR(-ENOMEM);
57
58 client->pool = mempool_create_slab_pool(MIN_IOS, _dm_io_cache);
59 if (!client->pool)
60 goto bad;
61
62 client->bios = bioset_create(MIN_BIOS, 0);
63 if (!client->bios)
64 goto bad;
65
66 return client;
67
68 bad:
69 if (client->pool)
70 mempool_destroy(client->pool);
71 kfree(client);
72 return ERR_PTR(-ENOMEM);
73}
74EXPORT_SYMBOL(dm_io_client_create);
75
76void dm_io_client_destroy(struct dm_io_client *client)
77{
78 mempool_destroy(client->pool);
79 bioset_free(client->bios);
80 kfree(client);
81}
82EXPORT_SYMBOL(dm_io_client_destroy);
83
84/*-----------------------------------------------------------------
85 * We need to keep track of which region a bio is doing io for.
86 * To avoid a memory allocation to store just 5 or 6 bits, we
87 * ensure the 'struct io' pointer is aligned so enough low bits are
88 * always zero and then combine it with the region number directly in
89 * bi_private.
90 *---------------------------------------------------------------*/
91static void store_io_and_region_in_bio(struct bio *bio, struct io *io,
92 unsigned region)
93{
94 if (unlikely(!IS_ALIGNED((unsigned long)io, DM_IO_MAX_REGIONS))) {
95 DMCRIT("Unaligned struct io pointer %p", io);
96 BUG();
97 }
98
99 bio->bi_private = (void *)((unsigned long)io | region);
100}
101
102static void retrieve_io_and_region_from_bio(struct bio *bio, struct io **io,
103 unsigned *region)
104{
105 unsigned long val = (unsigned long)bio->bi_private;
106
107 *io = (void *)(val & -(unsigned long)DM_IO_MAX_REGIONS);
108 *region = val & (DM_IO_MAX_REGIONS - 1);
109}
110
111/*-----------------------------------------------------------------
112 * We need an io object to keep track of the number of bios that
113 * have been dispatched for a particular io.
114 *---------------------------------------------------------------*/
115static void dec_count(struct io *io, unsigned int region, int error)
116{
117 if (error)
118 set_bit(region, &io->error_bits);
119
120 if (atomic_dec_and_test(&io->count)) {
121 if (io->vma_invalidate_size)
122 invalidate_kernel_vmap_range(io->vma_invalidate_address,
123 io->vma_invalidate_size);
124
125 if (io->sleeper)
126 wake_up_process(io->sleeper);
127
128 else {
129 unsigned long r = io->error_bits;
130 io_notify_fn fn = io->callback;
131 void *context = io->context;
132
133 mempool_free(io, io->client->pool);
134 fn(r, context);
135 }
136 }
137}
138
139static void endio(struct bio *bio, int error)
140{
141 struct io *io;
142 unsigned region;
143
144 if (error && bio_data_dir(bio) == READ)
145 zero_fill_bio(bio);
146
147 /*
148 * The bio destructor in bio_put() may use the io object.
149 */
150 retrieve_io_and_region_from_bio(bio, &io, &region);
151
152 bio_put(bio);
153
154 dec_count(io, region, error);
155}
156
157/*-----------------------------------------------------------------
158 * These little objects provide an abstraction for getting a new
159 * destination page for io.
160 *---------------------------------------------------------------*/
161struct dpages {
162 void (*get_page)(struct dpages *dp,
163 struct page **p, unsigned long *len, unsigned *offset);
164 void (*next_page)(struct dpages *dp);
165
166 unsigned context_u;
167 void *context_ptr;
168
169 void *vma_invalidate_address;
170 unsigned long vma_invalidate_size;
171};
172
173/*
174 * Functions for getting the pages from a list.
175 */
176static void list_get_page(struct dpages *dp,
177 struct page **p, unsigned long *len, unsigned *offset)
178{
179 unsigned o = dp->context_u;
180 struct page_list *pl = (struct page_list *) dp->context_ptr;
181
182 *p = pl->page;
183 *len = PAGE_SIZE - o;
184 *offset = o;
185}
186
187static void list_next_page(struct dpages *dp)
188{
189 struct page_list *pl = (struct page_list *) dp->context_ptr;
190 dp->context_ptr = pl->next;
191 dp->context_u = 0;
192}
193
194static void list_dp_init(struct dpages *dp, struct page_list *pl, unsigned offset)
195{
196 dp->get_page = list_get_page;
197 dp->next_page = list_next_page;
198 dp->context_u = offset;
199 dp->context_ptr = pl;
200}
201
202/*
203 * Functions for getting the pages from a bvec.
204 */
205static void bvec_get_page(struct dpages *dp,
206 struct page **p, unsigned long *len, unsigned *offset)
207{
208 struct bio_vec *bvec = (struct bio_vec *) dp->context_ptr;
209 *p = bvec->bv_page;
210 *len = bvec->bv_len;
211 *offset = bvec->bv_offset;
212}
213
214static void bvec_next_page(struct dpages *dp)
215{
216 struct bio_vec *bvec = (struct bio_vec *) dp->context_ptr;
217 dp->context_ptr = bvec + 1;
218}
219
220static void bvec_dp_init(struct dpages *dp, struct bio_vec *bvec)
221{
222 dp->get_page = bvec_get_page;
223 dp->next_page = bvec_next_page;
224 dp->context_ptr = bvec;
225}
226
227/*
228 * Functions for getting the pages from a VMA.
229 */
230static void vm_get_page(struct dpages *dp,
231 struct page **p, unsigned long *len, unsigned *offset)
232{
233 *p = vmalloc_to_page(dp->context_ptr);
234 *offset = dp->context_u;
235 *len = PAGE_SIZE - dp->context_u;
236}
237
238static void vm_next_page(struct dpages *dp)
239{
240 dp->context_ptr += PAGE_SIZE - dp->context_u;
241 dp->context_u = 0;
242}
243
244static void vm_dp_init(struct dpages *dp, void *data)
245{
246 dp->get_page = vm_get_page;
247 dp->next_page = vm_next_page;
248 dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
249 dp->context_ptr = data;
250}
251
252static void dm_bio_destructor(struct bio *bio)
253{
254 unsigned region;
255 struct io *io;
256
257 retrieve_io_and_region_from_bio(bio, &io, &region);
258
259 bio_free(bio, io->client->bios);
260}
261
262/*
263 * Functions for getting the pages from kernel memory.
264 */
265static void km_get_page(struct dpages *dp, struct page **p, unsigned long *len,
266 unsigned *offset)
267{
268 *p = virt_to_page(dp->context_ptr);
269 *offset = dp->context_u;
270 *len = PAGE_SIZE - dp->context_u;
271}
272
273static void km_next_page(struct dpages *dp)
274{
275 dp->context_ptr += PAGE_SIZE - dp->context_u;
276 dp->context_u = 0;
277}
278
279static void km_dp_init(struct dpages *dp, void *data)
280{
281 dp->get_page = km_get_page;
282 dp->next_page = km_next_page;
283 dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
284 dp->context_ptr = data;
285}
286
287/*-----------------------------------------------------------------
288 * IO routines that accept a list of pages.
289 *---------------------------------------------------------------*/
290static void do_region(int rw, unsigned region, struct dm_io_region *where,
291 struct dpages *dp, struct io *io)
292{
293 struct bio *bio;
294 struct page *page;
295 unsigned long len;
296 unsigned offset;
297 unsigned num_bvecs;
298 sector_t remaining = where->count;
299 struct request_queue *q = bdev_get_queue(where->bdev);
300 sector_t discard_sectors;
301 unsigned int uninitialized_var(special_cmd_max_sectors);
302
303 /*
304 * Reject unsupported discard and write same requests.
305 */
306 if (rw & REQ_DISCARD) {
307 special_cmd_max_sectors = q->limits.max_discard_sectors;
308 if (special_cmd_max_sectors == 0) {
309 dec_count(io, region, -EOPNOTSUPP);
310 return;
311 }
312 }
313
314 /*
315 * where->count may be zero if rw holds a flush and we need to
316 * send a zero-sized flush.
317 */
318 do {
319 /*
320 * Allocate a suitably sized-bio.
321 */
322 if (rw & REQ_DISCARD)
323 num_bvecs = 1;
324 else
325 num_bvecs = min_t(int, bio_get_nr_vecs(where->bdev),
326 dm_sector_div_up(remaining, (PAGE_SIZE >> SECTOR_SHIFT)));
327
328 bio = bio_alloc_bioset(GFP_NOIO, num_bvecs, io->client->bios);
329 bio->bi_sector = where->sector + (where->count - remaining);
330 bio->bi_bdev = where->bdev;
331 bio->bi_end_io = endio;
332 bio->bi_destructor = dm_bio_destructor;
333 store_io_and_region_in_bio(bio, io, region);
334
335 if (rw & REQ_DISCARD) {
336 discard_sectors = min_t(sector_t, special_cmd_max_sectors, remaining);
337 bio->bi_size = discard_sectors << SECTOR_SHIFT;
338 remaining -= discard_sectors;
339 } else while (remaining) {
340 /*
341 * Try and add as many pages as possible.
342 */
343 dp->get_page(dp, &page, &len, &offset);
344 len = min(len, to_bytes(remaining));
345 if (!bio_add_page(bio, page, len, offset))
346 break;
347
348 offset = 0;
349 remaining -= to_sector(len);
350 dp->next_page(dp);
351 }
352
353 atomic_inc(&io->count);
354 submit_bio(rw, bio);
355 } while (remaining);
356}
357
358static void dispatch_io(int rw, unsigned int num_regions,
359 struct dm_io_region *where, struct dpages *dp,
360 struct io *io, int sync)
361{
362 int i;
363 struct dpages old_pages = *dp;
364
365 BUG_ON(num_regions > DM_IO_MAX_REGIONS);
366
367 if (sync)
368 rw |= REQ_SYNC;
369
370 /*
371 * For multiple regions we need to be careful to rewind
372 * the dp object for each call to do_region.
373 */
374 for (i = 0; i < num_regions; i++) {
375 *dp = old_pages;
376 if (where[i].count || (rw & REQ_FLUSH))
377 do_region(rw, i, where + i, dp, io);
378 }
379
380 /*
381 * Drop the extra reference that we were holding to avoid
382 * the io being completed too early.
383 */
384 dec_count(io, 0, 0);
385}
386
387static int sync_io(struct dm_io_client *client, unsigned int num_regions,
388 struct dm_io_region *where, int rw, struct dpages *dp,
389 unsigned long *error_bits)
390{
391 /*
392 * gcc <= 4.3 can't do the alignment for stack variables, so we must
393 * align it on our own.
394 * volatile prevents the optimizer from removing or reusing
395 * "io_" field from the stack frame (allowed in ANSI C).
396 */
397 volatile char io_[sizeof(struct io) + __alignof__(struct io) - 1];
398 struct io *io = (struct io *)PTR_ALIGN(&io_, __alignof__(struct io));
399
400 if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
401 WARN_ON(1);
402 return -EIO;
403 }
404
405 io->error_bits = 0;
406 atomic_set(&io->count, 1); /* see dispatch_io() */
407 io->sleeper = current;
408 io->client = client;
409
410 io->vma_invalidate_address = dp->vma_invalidate_address;
411 io->vma_invalidate_size = dp->vma_invalidate_size;
412
413 dispatch_io(rw, num_regions, where, dp, io, 1);
414
415 while (1) {
416 set_current_state(TASK_UNINTERRUPTIBLE);
417
418 if (!atomic_read(&io->count))
419 break;
420
421 io_schedule();
422 }
423 set_current_state(TASK_RUNNING);
424
425 if (error_bits)
426 *error_bits = io->error_bits;
427
428 return io->error_bits ? -EIO : 0;
429}
430
431static int async_io(struct dm_io_client *client, unsigned int num_regions,
432 struct dm_io_region *where, int rw, struct dpages *dp,
433 io_notify_fn fn, void *context)
434{
435 struct io *io;
436
437 if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
438 WARN_ON(1);
439 fn(1, context);
440 return -EIO;
441 }
442
443 io = mempool_alloc(client->pool, GFP_NOIO);
444 io->error_bits = 0;
445 atomic_set(&io->count, 1); /* see dispatch_io() */
446 io->sleeper = NULL;
447 io->client = client;
448 io->callback = fn;
449 io->context = context;
450
451 io->vma_invalidate_address = dp->vma_invalidate_address;
452 io->vma_invalidate_size = dp->vma_invalidate_size;
453
454 dispatch_io(rw, num_regions, where, dp, io, 0);
455 return 0;
456}
457
458static int dp_init(struct dm_io_request *io_req, struct dpages *dp,
459 unsigned long size)
460{
461 /* Set up dpages based on memory type */
462
463 dp->vma_invalidate_address = NULL;
464 dp->vma_invalidate_size = 0;
465
466 switch (io_req->mem.type) {
467 case DM_IO_PAGE_LIST:
468 list_dp_init(dp, io_req->mem.ptr.pl, io_req->mem.offset);
469 break;
470
471 case DM_IO_BVEC:
472 bvec_dp_init(dp, io_req->mem.ptr.bvec);
473 break;
474
475 case DM_IO_VMA:
476 flush_kernel_vmap_range(io_req->mem.ptr.vma, size);
477 if ((io_req->bi_rw & RW_MASK) == READ) {
478 dp->vma_invalidate_address = io_req->mem.ptr.vma;
479 dp->vma_invalidate_size = size;
480 }
481 vm_dp_init(dp, io_req->mem.ptr.vma);
482 break;
483
484 case DM_IO_KMEM:
485 km_dp_init(dp, io_req->mem.ptr.addr);
486 break;
487
488 default:
489 return -EINVAL;
490 }
491
492 return 0;
493}
494
495/*
496 * New collapsed (a)synchronous interface.
497 *
498 * If the IO is asynchronous (i.e. it has notify.fn), you must either unplug
499 * the queue with blk_unplug() some time later or set REQ_SYNC in
500io_req->bi_rw. If you fail to do one of these, the IO will be submitted to
501 * the disk after q->unplug_delay, which defaults to 3ms in blk-settings.c.
502 */
503int dm_io(struct dm_io_request *io_req, unsigned num_regions,
504 struct dm_io_region *where, unsigned long *sync_error_bits)
505{
506 int r;
507 struct dpages dp;
508
509 r = dp_init(io_req, &dp, (unsigned long)where->count << SECTOR_SHIFT);
510 if (r)
511 return r;
512
513 if (!io_req->notify.fn)
514 return sync_io(io_req->client, num_regions, where,
515 io_req->bi_rw, &dp, sync_error_bits);
516
517 return async_io(io_req->client, num_regions, where, io_req->bi_rw,
518 &dp, io_req->notify.fn, io_req->notify.context);
519}
520EXPORT_SYMBOL(dm_io);
521
522int __init dm_io_init(void)
523{
524 _dm_io_cache = KMEM_CACHE(io, 0);
525 if (!_dm_io_cache)
526 return -ENOMEM;
527
528 return 0;
529}
530
531void dm_io_exit(void)
532{
533 kmem_cache_destroy(_dm_io_cache);
534 _dm_io_cache = NULL;
535}