2 * Copyright (C) 2003 Sistina Software
3 * Copyright (C) 2006 Red Hat GmbH
5 * This file is released under the GPL.
10 #include <linux/device-mapper.h>
12 #include <linux/bio.h>
13 #include <linux/completion.h>
14 #include <linux/mempool.h>
15 #include <linux/module.h>
16 #include <linux/sched.h>
17 #include <linux/slab.h>
18 #include <linux/dm-io.h>
20 #define DM_MSG_PREFIX "io"
22 #define DM_IO_MAX_REGIONS BITS_PER_LONG
30 * Aligning 'struct io' reduces the number of bits required to store
31 * its address. Refer to store_io_and_region_in_bio() below.
34 unsigned long error_bits
;
36 struct completion
*wait
;
37 struct dm_io_client
*client
;
38 io_notify_fn callback
;
40 void *vma_invalidate_address
;
41 unsigned long vma_invalidate_size
;
42 } __attribute__((aligned(DM_IO_MAX_REGIONS
)));
44 static struct kmem_cache
*_dm_io_cache
;
47 * Create a client with mempool and bioset.
49 struct dm_io_client
*dm_io_client_create(void)
51 struct dm_io_client
*client
;
52 unsigned min_ios
= dm_get_reserved_bio_based_ios();
54 client
= kmalloc(sizeof(*client
), GFP_KERNEL
);
56 return ERR_PTR(-ENOMEM
);
58 client
->pool
= mempool_create_slab_pool(min_ios
, _dm_io_cache
);
62 client
->bios
= bioset_create(min_ios
, 0);
70 mempool_destroy(client
->pool
);
72 return ERR_PTR(-ENOMEM
);
74 EXPORT_SYMBOL(dm_io_client_create
);
76 void dm_io_client_destroy(struct dm_io_client
*client
)
78 mempool_destroy(client
->pool
);
79 bioset_free(client
->bios
);
82 EXPORT_SYMBOL(dm_io_client_destroy
);
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
90 *---------------------------------------------------------------*/
91 static void store_io_and_region_in_bio(struct bio
*bio
, struct io
*io
,
94 if (unlikely(!IS_ALIGNED((unsigned long)io
, DM_IO_MAX_REGIONS
))) {
95 DMCRIT("Unaligned struct io pointer %p", io
);
99 bio
->bi_private
= (void *)((unsigned long)io
| region
);
102 static void retrieve_io_and_region_from_bio(struct bio
*bio
, struct io
**io
,
105 unsigned long val
= (unsigned long)bio
->bi_private
;
107 *io
= (void *)(val
& -(unsigned long)DM_IO_MAX_REGIONS
);
108 *region
= val
& (DM_IO_MAX_REGIONS
- 1);
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 *---------------------------------------------------------------*/
115 static void dec_count(struct io
*io
, unsigned int region
, int error
)
118 set_bit(region
, &io
->error_bits
);
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
);
129 unsigned long r
= io
->error_bits
;
130 io_notify_fn fn
= io
->callback
;
131 void *context
= io
->context
;
133 mempool_free(io
, io
->client
->pool
);
139 static void endio(struct bio
*bio
, int error
)
144 if (error
&& bio_data_dir(bio
) == READ
)
148 * The bio destructor in bio_put() may use the io object.
150 retrieve_io_and_region_from_bio(bio
, &io
, ®ion
);
154 dec_count(io
, region
, error
);
157 /*-----------------------------------------------------------------
158 * These little objects provide an abstraction for getting a new
159 * destination page for io.
160 *---------------------------------------------------------------*/
162 void (*get_page
)(struct dpages
*dp
,
163 struct page
**p
, unsigned long *len
, unsigned *offset
);
164 void (*next_page
)(struct dpages
*dp
);
169 void *vma_invalidate_address
;
170 unsigned long vma_invalidate_size
;
174 * Functions for getting the pages from a list.
176 static void list_get_page(struct dpages
*dp
,
177 struct page
**p
, unsigned long *len
, unsigned *offset
)
179 unsigned o
= dp
->context_u
;
180 struct page_list
*pl
= (struct page_list
*) dp
->context_ptr
;
183 *len
= PAGE_SIZE
- o
;
187 static void list_next_page(struct dpages
*dp
)
189 struct page_list
*pl
= (struct page_list
*) dp
->context_ptr
;
190 dp
->context_ptr
= pl
->next
;
194 static void list_dp_init(struct dpages
*dp
, struct page_list
*pl
, unsigned offset
)
196 dp
->get_page
= list_get_page
;
197 dp
->next_page
= list_next_page
;
198 dp
->context_u
= offset
;
199 dp
->context_ptr
= pl
;
203 * Functions for getting the pages from a bvec.
205 static void bvec_get_page(struct dpages
*dp
,
206 struct page
**p
, unsigned long *len
, unsigned *offset
)
208 struct bio_vec
*bvec
= (struct bio_vec
*) dp
->context_ptr
;
211 *offset
= bvec
->bv_offset
;
214 static void bvec_next_page(struct dpages
*dp
)
216 struct bio_vec
*bvec
= (struct bio_vec
*) dp
->context_ptr
;
217 dp
->context_ptr
= bvec
+ 1;
220 static void bvec_dp_init(struct dpages
*dp
, struct bio_vec
*bvec
)
222 dp
->get_page
= bvec_get_page
;
223 dp
->next_page
= bvec_next_page
;
224 dp
->context_ptr
= bvec
;
228 * Functions for getting the pages from a VMA.
230 static void vm_get_page(struct dpages
*dp
,
231 struct page
**p
, unsigned long *len
, unsigned *offset
)
233 *p
= vmalloc_to_page(dp
->context_ptr
);
234 *offset
= dp
->context_u
;
235 *len
= PAGE_SIZE
- dp
->context_u
;
238 static void vm_next_page(struct dpages
*dp
)
240 dp
->context_ptr
+= PAGE_SIZE
- dp
->context_u
;
244 static void vm_dp_init(struct dpages
*dp
, void *data
)
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
;
253 * Functions for getting the pages from kernel memory.
255 static void km_get_page(struct dpages
*dp
, struct page
**p
, unsigned long *len
,
258 *p
= virt_to_page(dp
->context_ptr
);
259 *offset
= dp
->context_u
;
260 *len
= PAGE_SIZE
- dp
->context_u
;
263 static void km_next_page(struct dpages
*dp
)
265 dp
->context_ptr
+= PAGE_SIZE
- dp
->context_u
;
269 static void km_dp_init(struct dpages
*dp
, void *data
)
271 dp
->get_page
= km_get_page
;
272 dp
->next_page
= km_next_page
;
273 dp
->context_u
= ((unsigned long) data
) & (PAGE_SIZE
- 1);
274 dp
->context_ptr
= data
;
277 /*-----------------------------------------------------------------
278 * IO routines that accept a list of pages.
279 *---------------------------------------------------------------*/
280 static void do_region(int rw
, unsigned region
, struct dm_io_region
*where
,
281 struct dpages
*dp
, struct io
*io
)
288 sector_t remaining
= where
->count
;
289 struct request_queue
*q
= bdev_get_queue(where
->bdev
);
290 unsigned short logical_block_size
= queue_logical_block_size(q
);
291 sector_t num_sectors
;
293 /* Reject unsupported discard requests */
294 if ((rw
& REQ_DISCARD
) && !blk_queue_discard(q
)) {
295 dec_count(io
, region
, -EOPNOTSUPP
);
300 * where->count may be zero if rw holds a flush and we need to
301 * send a zero-sized flush.
305 * Allocate a suitably sized-bio.
307 if ((rw
& REQ_DISCARD
) || (rw
& REQ_WRITE_SAME
))
310 num_bvecs
= min_t(int, bio_get_nr_vecs(where
->bdev
),
311 dm_sector_div_up(remaining
, (PAGE_SIZE
>> SECTOR_SHIFT
)));
313 bio
= bio_alloc_bioset(GFP_NOIO
, num_bvecs
, io
->client
->bios
);
314 bio
->bi_sector
= where
->sector
+ (where
->count
- remaining
);
315 bio
->bi_bdev
= where
->bdev
;
316 bio
->bi_end_io
= endio
;
317 store_io_and_region_in_bio(bio
, io
, region
);
319 if (rw
& REQ_DISCARD
) {
320 num_sectors
= min_t(sector_t
, q
->limits
.max_discard_sectors
, remaining
);
321 bio
->bi_size
= num_sectors
<< SECTOR_SHIFT
;
322 remaining
-= num_sectors
;
323 } else if (rw
& REQ_WRITE_SAME
) {
325 * WRITE SAME only uses a single page.
327 dp
->get_page(dp
, &page
, &len
, &offset
);
328 bio_add_page(bio
, page
, logical_block_size
, offset
);
329 num_sectors
= min_t(sector_t
, q
->limits
.max_write_same_sectors
, remaining
);
330 bio
->bi_size
= num_sectors
<< SECTOR_SHIFT
;
333 remaining
-= num_sectors
;
335 } else while (remaining
) {
337 * Try and add as many pages as possible.
339 dp
->get_page(dp
, &page
, &len
, &offset
);
340 len
= min(len
, to_bytes(remaining
));
341 if (!bio_add_page(bio
, page
, len
, offset
))
345 remaining
-= to_sector(len
);
349 atomic_inc(&io
->count
);
354 static void dispatch_io(int rw
, unsigned int num_regions
,
355 struct dm_io_region
*where
, struct dpages
*dp
,
356 struct io
*io
, int sync
)
359 struct dpages old_pages
= *dp
;
361 BUG_ON(num_regions
> DM_IO_MAX_REGIONS
);
367 * For multiple regions we need to be careful to rewind
368 * the dp object for each call to do_region.
370 for (i
= 0; i
< num_regions
; i
++) {
372 if (where
[i
].count
|| (rw
& REQ_FLUSH
))
373 do_region(rw
, i
, where
+ i
, dp
, io
);
377 * Drop the extra reference that we were holding to avoid
378 * the io being completed too early.
383 static int sync_io(struct dm_io_client
*client
, unsigned int num_regions
,
384 struct dm_io_region
*where
, int rw
, struct dpages
*dp
,
385 unsigned long *error_bits
)
388 * gcc <= 4.3 can't do the alignment for stack variables, so we must
389 * align it on our own.
390 * volatile prevents the optimizer from removing or reusing
391 * "io_" field from the stack frame (allowed in ANSI C).
393 volatile char io_
[sizeof(struct io
) + __alignof__(struct io
) - 1];
394 struct io
*io
= (struct io
*)PTR_ALIGN(&io_
, __alignof__(struct io
));
395 DECLARE_COMPLETION_ONSTACK(wait
);
397 if (num_regions
> 1 && (rw
& RW_MASK
) != WRITE
) {
403 atomic_set(&io
->count
, 1); /* see dispatch_io() */
407 io
->vma_invalidate_address
= dp
->vma_invalidate_address
;
408 io
->vma_invalidate_size
= dp
->vma_invalidate_size
;
410 dispatch_io(rw
, num_regions
, where
, dp
, io
, 1);
412 wait_for_completion_io(&wait
);
415 *error_bits
= io
->error_bits
;
417 return io
->error_bits
? -EIO
: 0;
420 static int async_io(struct dm_io_client
*client
, unsigned int num_regions
,
421 struct dm_io_region
*where
, int rw
, struct dpages
*dp
,
422 io_notify_fn fn
, void *context
)
426 if (num_regions
> 1 && (rw
& RW_MASK
) != WRITE
) {
432 io
= mempool_alloc(client
->pool
, GFP_NOIO
);
434 atomic_set(&io
->count
, 1); /* see dispatch_io() */
438 io
->context
= context
;
440 io
->vma_invalidate_address
= dp
->vma_invalidate_address
;
441 io
->vma_invalidate_size
= dp
->vma_invalidate_size
;
443 dispatch_io(rw
, num_regions
, where
, dp
, io
, 0);
447 static int dp_init(struct dm_io_request
*io_req
, struct dpages
*dp
,
450 /* Set up dpages based on memory type */
452 dp
->vma_invalidate_address
= NULL
;
453 dp
->vma_invalidate_size
= 0;
455 switch (io_req
->mem
.type
) {
456 case DM_IO_PAGE_LIST
:
457 list_dp_init(dp
, io_req
->mem
.ptr
.pl
, io_req
->mem
.offset
);
461 bvec_dp_init(dp
, io_req
->mem
.ptr
.bvec
);
465 flush_kernel_vmap_range(io_req
->mem
.ptr
.vma
, size
);
466 if ((io_req
->bi_rw
& RW_MASK
) == READ
) {
467 dp
->vma_invalidate_address
= io_req
->mem
.ptr
.vma
;
468 dp
->vma_invalidate_size
= size
;
470 vm_dp_init(dp
, io_req
->mem
.ptr
.vma
);
474 km_dp_init(dp
, io_req
->mem
.ptr
.addr
);
485 * New collapsed (a)synchronous interface.
487 * If the IO is asynchronous (i.e. it has notify.fn), you must either unplug
488 * the queue with blk_unplug() some time later or set REQ_SYNC in
489 io_req->bi_rw. If you fail to do one of these, the IO will be submitted to
490 * the disk after q->unplug_delay, which defaults to 3ms in blk-settings.c.
492 int dm_io(struct dm_io_request
*io_req
, unsigned num_regions
,
493 struct dm_io_region
*where
, unsigned long *sync_error_bits
)
498 r
= dp_init(io_req
, &dp
, (unsigned long)where
->count
<< SECTOR_SHIFT
);
502 if (!io_req
->notify
.fn
)
503 return sync_io(io_req
->client
, num_regions
, where
,
504 io_req
->bi_rw
, &dp
, sync_error_bits
);
506 return async_io(io_req
->client
, num_regions
, where
, io_req
->bi_rw
,
507 &dp
, io_req
->notify
.fn
, io_req
->notify
.context
);
509 EXPORT_SYMBOL(dm_io
);
511 int __init
dm_io_init(void)
513 _dm_io_cache
= KMEM_CACHE(io
, 0);
520 void dm_io_exit(void)
522 kmem_cache_destroy(_dm_io_cache
);