dm.c 64.7 KB
Newer Older
L
Linus Torvalds 已提交
1 2
/*
 * Copyright (C) 2001, 2002 Sistina Software (UK) Limited.
M
Milan Broz 已提交
3
 * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
L
Linus Torvalds 已提交
4 5 6 7 8
 *
 * This file is released under the GPL.
 */

#include "dm.h"
M
Mike Anderson 已提交
9
#include "dm-uevent.h"
L
Linus Torvalds 已提交
10 11 12

#include <linux/init.h>
#include <linux/module.h>
A
Arjan van de Ven 已提交
13
#include <linux/mutex.h>
L
Linus Torvalds 已提交
14 15 16 17
#include <linux/moduleparam.h>
#include <linux/blkpg.h>
#include <linux/bio.h>
#include <linux/buffer_head.h>
18
#include <linux/smp_lock.h>
L
Linus Torvalds 已提交
19 20 21
#include <linux/mempool.h>
#include <linux/slab.h>
#include <linux/idr.h>
D
Darrick J. Wong 已提交
22
#include <linux/hdreg.h>
23
#include <linux/delay.h>
24 25

#include <trace/events/block.h>
L
Linus Torvalds 已提交
26

27 28
#define DM_MSG_PREFIX "core"

M
Milan Broz 已提交
29 30 31 32 33 34 35
/*
 * Cookies are numeric values sent with CHANGE and REMOVE
 * uevents while resuming, removing or renaming the device.
 */
#define DM_COOKIE_ENV_VAR_NAME "DM_COOKIE"
#define DM_COOKIE_LENGTH 24

L
Linus Torvalds 已提交
36 37 38 39 40
static const char *_name = DM_NAME;

static unsigned int major = 0;
static unsigned int _major = 0;

41
static DEFINE_SPINLOCK(_minor_lock);
L
Linus Torvalds 已提交
42
/*
K
Kiyoshi Ueda 已提交
43
 * For bio-based dm.
L
Linus Torvalds 已提交
44 45 46 47 48 49
 * One of these is allocated per bio.
 */
struct dm_io {
	struct mapped_device *md;
	int error;
	atomic_t io_count;
R
Richard Kennedy 已提交
50
	struct bio *bio;
51
	unsigned long start_time;
52
	spinlock_t endio_lock;
L
Linus Torvalds 已提交
53 54 55
};

/*
K
Kiyoshi Ueda 已提交
56
 * For bio-based dm.
L
Linus Torvalds 已提交
57 58 59
 * One of these is allocated per target within a bio.  Hopefully
 * this will be simplified out one day.
 */
A
Alasdair G Kergon 已提交
60
struct dm_target_io {
L
Linus Torvalds 已提交
61 62 63 64 65
	struct dm_io *io;
	struct dm_target *ti;
	union map_info info;
};

K
Kiyoshi Ueda 已提交
66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
/*
 * For request-based dm.
 * One of these is allocated per request.
 */
struct dm_rq_target_io {
	struct mapped_device *md;
	struct dm_target *ti;
	struct request *orig, clone;
	int error;
	union map_info info;
};

/*
 * For request-based dm.
 * One of these is allocated per bio.
 */
struct dm_rq_clone_bio_info {
	struct bio *orig;
84
	struct dm_rq_target_io *tio;
K
Kiyoshi Ueda 已提交
85 86
};

L
Linus Torvalds 已提交
87 88
union map_info *dm_get_mapinfo(struct bio *bio)
{
A
Alasdair G Kergon 已提交
89
	if (bio && bio->bi_private)
A
Alasdair G Kergon 已提交
90
		return &((struct dm_target_io *)bio->bi_private)->info;
A
Alasdair G Kergon 已提交
91
	return NULL;
L
Linus Torvalds 已提交
92 93
}

94 95 96 97 98 99 100 101
union map_info *dm_get_rq_mapinfo(struct request *rq)
{
	if (rq && rq->end_io_data)
		return &((struct dm_rq_target_io *)rq->end_io_data)->info;
	return NULL;
}
EXPORT_SYMBOL_GPL(dm_get_rq_mapinfo);

102 103
#define MINOR_ALLOCED ((void *)-1)

L
Linus Torvalds 已提交
104 105 106
/*
 * Bits for the md->flags field.
 */
107
#define DMF_BLOCK_IO_FOR_SUSPEND 0
L
Linus Torvalds 已提交
108
#define DMF_SUSPENDED 1
109
#define DMF_FROZEN 2
J
Jeff Mahoney 已提交
110
#define DMF_FREEING 3
111
#define DMF_DELETING 4
112
#define DMF_NOFLUSH_SUSPENDING 5
113
#define DMF_QUEUE_IO_TO_THREAD 6
L
Linus Torvalds 已提交
114

115 116 117
/*
 * Work processed by per-device workqueue.
 */
L
Linus Torvalds 已提交
118
struct mapped_device {
119
	struct rw_semaphore io_lock;
120
	struct mutex suspend_lock;
L
Linus Torvalds 已提交
121 122
	rwlock_t map_lock;
	atomic_t holders;
123
	atomic_t open_count;
L
Linus Torvalds 已提交
124 125 126

	unsigned long flags;

127
	struct request_queue *queue;
128
	unsigned type;
129
	/* Protect queue and type against concurrent access. */
130 131
	struct mutex type_lock;

L
Linus Torvalds 已提交
132
	struct gendisk *disk;
M
Mike Anderson 已提交
133
	char name[16];
L
Linus Torvalds 已提交
134 135 136 137 138 139

	void *interface_ptr;

	/*
	 * A list of ios that arrived while we were suspended.
	 */
140
	atomic_t pending[2];
L
Linus Torvalds 已提交
141
	wait_queue_head_t wait;
142
	struct work_struct work;
K
Kiyoshi Ueda 已提交
143
	struct bio_list deferred;
144
	spinlock_t deferred_lock;
L
Linus Torvalds 已提交
145

146 147 148 149 150
	/*
	 * An error from the barrier request currently being processed.
	 */
	int barrier_error;

151 152 153 154 155 156
	/*
	 * Protect barrier_error from concurrent endio processing
	 * in request-based dm.
	 */
	spinlock_t barrier_error_lock;

157 158 159 160
	/*
	 * Processing queue (flush/barriers)
	 */
	struct workqueue_struct *wq;
161 162 163 164
	struct work_struct barrier_work;

	/* A pointer to the currently processing pre/post flush request */
	struct request *flush_request;
165

L
Linus Torvalds 已提交
166 167 168 169 170 171 172 173 174 175 176
	/*
	 * The current mapping.
	 */
	struct dm_table *map;

	/*
	 * io objects are allocated from here.
	 */
	mempool_t *io_pool;
	mempool_t *tio_pool;

S
Stefan Bader 已提交
177 178
	struct bio_set *bs;

L
Linus Torvalds 已提交
179 180 181 182 183
	/*
	 * Event handling.
	 */
	atomic_t event_nr;
	wait_queue_head_t eventq;
M
Mike Anderson 已提交
184 185 186
	atomic_t uevent_seq;
	struct list_head uevent_list;
	spinlock_t uevent_lock; /* Protect access to uevent_list */
L
Linus Torvalds 已提交
187 188 189 190 191

	/*
	 * freeze/thaw support require holding onto a super block
	 */
	struct super_block *frozen_sb;
192
	struct block_device *bdev;
D
Darrick J. Wong 已提交
193 194 195

	/* forced geometry settings */
	struct hd_geometry geometry;
M
Milan Broz 已提交
196

197 198 199
	/* For saving the address of __make_request for request based dm */
	make_request_fn *saved_make_request_fn;

M
Milan Broz 已提交
200 201
	/* sysfs handle */
	struct kobject kobj;
202 203 204

	/* zero-length barrier that will be cloned and submitted to targets */
	struct bio barrier_bio;
L
Linus Torvalds 已提交
205 206
};

K
Kiyoshi Ueda 已提交
207 208 209 210 211 212 213 214 215
/*
 * For mempools pre-allocation at the table loading time.
 */
struct dm_md_mempools {
	mempool_t *io_pool;
	mempool_t *tio_pool;
	struct bio_set *bs;
};

L
Linus Torvalds 已提交
216
#define MIN_IOS 256
217 218
static struct kmem_cache *_io_cache;
static struct kmem_cache *_tio_cache;
K
Kiyoshi Ueda 已提交
219 220
static struct kmem_cache *_rq_tio_cache;
static struct kmem_cache *_rq_bio_info_cache;
L
Linus Torvalds 已提交
221 222 223

static int __init local_init(void)
{
K
Kiyoshi Ueda 已提交
224
	int r = -ENOMEM;
L
Linus Torvalds 已提交
225 226

	/* allocate a slab for the dm_ios */
A
Alasdair G Kergon 已提交
227
	_io_cache = KMEM_CACHE(dm_io, 0);
L
Linus Torvalds 已提交
228
	if (!_io_cache)
K
Kiyoshi Ueda 已提交
229
		return r;
L
Linus Torvalds 已提交
230 231

	/* allocate a slab for the target ios */
A
Alasdair G Kergon 已提交
232
	_tio_cache = KMEM_CACHE(dm_target_io, 0);
K
Kiyoshi Ueda 已提交
233 234
	if (!_tio_cache)
		goto out_free_io_cache;
L
Linus Torvalds 已提交
235

K
Kiyoshi Ueda 已提交
236 237 238 239 240 241 242 243
	_rq_tio_cache = KMEM_CACHE(dm_rq_target_io, 0);
	if (!_rq_tio_cache)
		goto out_free_tio_cache;

	_rq_bio_info_cache = KMEM_CACHE(dm_rq_clone_bio_info, 0);
	if (!_rq_bio_info_cache)
		goto out_free_rq_tio_cache;

M
Mike Anderson 已提交
244
	r = dm_uevent_init();
K
Kiyoshi Ueda 已提交
245
	if (r)
K
Kiyoshi Ueda 已提交
246
		goto out_free_rq_bio_info_cache;
M
Mike Anderson 已提交
247

L
Linus Torvalds 已提交
248 249
	_major = major;
	r = register_blkdev(_major, _name);
K
Kiyoshi Ueda 已提交
250 251
	if (r < 0)
		goto out_uevent_exit;
L
Linus Torvalds 已提交
252 253 254 255 256

	if (!_major)
		_major = r;

	return 0;
K
Kiyoshi Ueda 已提交
257 258 259

out_uevent_exit:
	dm_uevent_exit();
K
Kiyoshi Ueda 已提交
260 261 262 263
out_free_rq_bio_info_cache:
	kmem_cache_destroy(_rq_bio_info_cache);
out_free_rq_tio_cache:
	kmem_cache_destroy(_rq_tio_cache);
K
Kiyoshi Ueda 已提交
264 265 266 267 268 269
out_free_tio_cache:
	kmem_cache_destroy(_tio_cache);
out_free_io_cache:
	kmem_cache_destroy(_io_cache);

	return r;
L
Linus Torvalds 已提交
270 271 272 273
}

static void local_exit(void)
{
K
Kiyoshi Ueda 已提交
274 275
	kmem_cache_destroy(_rq_bio_info_cache);
	kmem_cache_destroy(_rq_tio_cache);
L
Linus Torvalds 已提交
276 277
	kmem_cache_destroy(_tio_cache);
	kmem_cache_destroy(_io_cache);
278
	unregister_blkdev(_major, _name);
M
Mike Anderson 已提交
279
	dm_uevent_exit();
L
Linus Torvalds 已提交
280 281 282 283 284 285

	_major = 0;

	DMINFO("cleaned up");
}

286
static int (*_inits[])(void) __initdata = {
L
Linus Torvalds 已提交
287 288 289 290
	local_init,
	dm_target_init,
	dm_linear_init,
	dm_stripe_init,
M
Mikulas Patocka 已提交
291
	dm_io_init,
292
	dm_kcopyd_init,
L
Linus Torvalds 已提交
293 294 295
	dm_interface_init,
};

296
static void (*_exits[])(void) = {
L
Linus Torvalds 已提交
297 298 299 300
	local_exit,
	dm_target_exit,
	dm_linear_exit,
	dm_stripe_exit,
M
Mikulas Patocka 已提交
301
	dm_io_exit,
302
	dm_kcopyd_exit,
L
Linus Torvalds 已提交
303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337
	dm_interface_exit,
};

static int __init dm_init(void)
{
	const int count = ARRAY_SIZE(_inits);

	int r, i;

	for (i = 0; i < count; i++) {
		r = _inits[i]();
		if (r)
			goto bad;
	}

	return 0;

      bad:
	while (i--)
		_exits[i]();

	return r;
}

static void __exit dm_exit(void)
{
	int i = ARRAY_SIZE(_exits);

	while (i--)
		_exits[i]();
}

/*
 * Block device functions
 */
M
Mike Anderson 已提交
338 339 340 341 342
int dm_deleting_md(struct mapped_device *md)
{
	return test_bit(DMF_DELETING, &md->flags);
}

A
Al Viro 已提交
343
static int dm_blk_open(struct block_device *bdev, fmode_t mode)
L
Linus Torvalds 已提交
344 345 346
{
	struct mapped_device *md;

347
	lock_kernel();
J
Jeff Mahoney 已提交
348 349
	spin_lock(&_minor_lock);

A
Al Viro 已提交
350
	md = bdev->bd_disk->private_data;
J
Jeff Mahoney 已提交
351 352 353
	if (!md)
		goto out;

354
	if (test_bit(DMF_FREEING, &md->flags) ||
M
Mike Anderson 已提交
355
	    dm_deleting_md(md)) {
J
Jeff Mahoney 已提交
356 357 358 359
		md = NULL;
		goto out;
	}

L
Linus Torvalds 已提交
360
	dm_get(md);
361
	atomic_inc(&md->open_count);
J
Jeff Mahoney 已提交
362 363 364

out:
	spin_unlock(&_minor_lock);
365
	unlock_kernel();
J
Jeff Mahoney 已提交
366 367

	return md ? 0 : -ENXIO;
L
Linus Torvalds 已提交
368 369
}

A
Al Viro 已提交
370
static int dm_blk_close(struct gendisk *disk, fmode_t mode)
L
Linus Torvalds 已提交
371
{
A
Al Viro 已提交
372
	struct mapped_device *md = disk->private_data;
373 374

	lock_kernel();
375
	atomic_dec(&md->open_count);
L
Linus Torvalds 已提交
376
	dm_put(md);
377 378
	unlock_kernel();

L
Linus Torvalds 已提交
379 380 381
	return 0;
}

382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405
int dm_open_count(struct mapped_device *md)
{
	return atomic_read(&md->open_count);
}

/*
 * Guarantees nothing is using the device before it's deleted.
 */
int dm_lock_for_deletion(struct mapped_device *md)
{
	int r = 0;

	spin_lock(&_minor_lock);

	if (dm_open_count(md))
		r = -EBUSY;
	else
		set_bit(DMF_DELETING, &md->flags);

	spin_unlock(&_minor_lock);

	return r;
}

D
Darrick J. Wong 已提交
406 407 408 409 410 411 412
static int dm_blk_getgeo(struct block_device *bdev, struct hd_geometry *geo)
{
	struct mapped_device *md = bdev->bd_disk->private_data;

	return dm_get_geometry(md, geo);
}

A
Al Viro 已提交
413
static int dm_blk_ioctl(struct block_device *bdev, fmode_t mode,
414 415
			unsigned int cmd, unsigned long arg)
{
A
Al Viro 已提交
416
	struct mapped_device *md = bdev->bd_disk->private_data;
417
	struct dm_table *map = dm_get_live_table(md);
418 419 420 421 422 423 424 425 426 427 428 429
	struct dm_target *tgt;
	int r = -ENOTTY;

	if (!map || !dm_table_get_size(map))
		goto out;

	/* We only support devices that have a single target */
	if (dm_table_get_num_targets(map) != 1)
		goto out;

	tgt = dm_table_get_target(map, 0);

430
	if (dm_suspended_md(md)) {
431 432 433 434 435
		r = -EAGAIN;
		goto out;
	}

	if (tgt->type->ioctl)
436
		r = tgt->type->ioctl(tgt, cmd, arg);
437 438 439 440 441 442 443

out:
	dm_table_put(map);

	return r;
}

A
Alasdair G Kergon 已提交
444
static struct dm_io *alloc_io(struct mapped_device *md)
L
Linus Torvalds 已提交
445 446 447 448
{
	return mempool_alloc(md->io_pool, GFP_NOIO);
}

A
Alasdair G Kergon 已提交
449
static void free_io(struct mapped_device *md, struct dm_io *io)
L
Linus Torvalds 已提交
450 451 452 453
{
	mempool_free(io, md->io_pool);
}

A
Alasdair G Kergon 已提交
454
static void free_tio(struct mapped_device *md, struct dm_target_io *tio)
L
Linus Torvalds 已提交
455 456 457 458
{
	mempool_free(tio, md->tio_pool);
}

K
Kiyoshi Ueda 已提交
459 460
static struct dm_rq_target_io *alloc_rq_tio(struct mapped_device *md,
					    gfp_t gfp_mask)
461
{
K
Kiyoshi Ueda 已提交
462
	return mempool_alloc(md->tio_pool, gfp_mask);
463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479
}

static void free_rq_tio(struct dm_rq_target_io *tio)
{
	mempool_free(tio, tio->md->tio_pool);
}

static struct dm_rq_clone_bio_info *alloc_bio_info(struct mapped_device *md)
{
	return mempool_alloc(md->io_pool, GFP_ATOMIC);
}

static void free_bio_info(struct dm_rq_clone_bio_info *info)
{
	mempool_free(info, info->tio->md->io_pool);
}

K
Kiyoshi Ueda 已提交
480 481 482 483 484 485
static int md_in_flight(struct mapped_device *md)
{
	return atomic_read(&md->pending[READ]) +
	       atomic_read(&md->pending[WRITE]);
}

486 487 488
static void start_io_acct(struct dm_io *io)
{
	struct mapped_device *md = io->md;
T
Tejun Heo 已提交
489
	int cpu;
490
	int rw = bio_data_dir(io->bio);
491 492 493

	io->start_time = jiffies;

T
Tejun Heo 已提交
494 495 496
	cpu = part_stat_lock();
	part_round_stats(cpu, &dm_disk(md)->part0);
	part_stat_unlock();
497
	dm_disk(md)->part0.in_flight[rw] = atomic_inc_return(&md->pending[rw]);
498 499
}

500
static void end_io_acct(struct dm_io *io)
501 502 503 504
{
	struct mapped_device *md = io->md;
	struct bio *bio = io->bio;
	unsigned long duration = jiffies - io->start_time;
T
Tejun Heo 已提交
505
	int pending, cpu;
506 507
	int rw = bio_data_dir(bio);

T
Tejun Heo 已提交
508 509 510 511
	cpu = part_stat_lock();
	part_round_stats(cpu, &dm_disk(md)->part0);
	part_stat_add(cpu, &dm_disk(md)->part0, ticks[rw], duration);
	part_stat_unlock();
512

513 514 515 516
	/*
	 * After this is decremented the bio must not be touched if it is
	 * a barrier.
	 */
517 518 519
	dm_disk(md)->part0.in_flight[rw] = pending =
		atomic_dec_return(&md->pending[rw]);
	pending += atomic_read(&md->pending[rw^0x1]);
520

521 522 523
	/* nudge anyone waiting on suspend queue */
	if (!pending)
		wake_up(&md->wait);
524 525
}

L
Linus Torvalds 已提交
526 527 528
/*
 * Add the bio to the list of deferred io.
 */
M
Mikulas Patocka 已提交
529
static void queue_io(struct mapped_device *md, struct bio *bio)
L
Linus Torvalds 已提交
530
{
531
	down_write(&md->io_lock);
L
Linus Torvalds 已提交
532

533
	spin_lock_irq(&md->deferred_lock);
L
Linus Torvalds 已提交
534
	bio_list_add(&md->deferred, bio);
535
	spin_unlock_irq(&md->deferred_lock);
L
Linus Torvalds 已提交
536

M
Mikulas Patocka 已提交
537 538 539
	if (!test_and_set_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags))
		queue_work(md->wq, &md->work);

540
	up_write(&md->io_lock);
L
Linus Torvalds 已提交
541 542 543 544 545 546 547
}

/*
 * Everyone (including functions in this file), should use this
 * function to access the md->map field, and make sure they call
 * dm_table_put() when finished.
 */
548
struct dm_table *dm_get_live_table(struct mapped_device *md)
L
Linus Torvalds 已提交
549 550
{
	struct dm_table *t;
551
	unsigned long flags;
L
Linus Torvalds 已提交
552

553
	read_lock_irqsave(&md->map_lock, flags);
L
Linus Torvalds 已提交
554 555 556
	t = md->map;
	if (t)
		dm_table_get(t);
557
	read_unlock_irqrestore(&md->map_lock, flags);
L
Linus Torvalds 已提交
558 559 560 561

	return t;
}

D
Darrick J. Wong 已提交
562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588
/*
 * Get the geometry associated with a dm device
 */
int dm_get_geometry(struct mapped_device *md, struct hd_geometry *geo)
{
	*geo = md->geometry;

	return 0;
}

/*
 * Set the geometry of a device.
 */
int dm_set_geometry(struct mapped_device *md, struct hd_geometry *geo)
{
	sector_t sz = (sector_t)geo->cylinders * geo->heads * geo->sectors;

	if (geo->start > sz) {
		DMWARN("Start sector is beyond the geometry limits.");
		return -EINVAL;
	}

	md->geometry = *geo;

	return 0;
}

L
Linus Torvalds 已提交
589 590 591 592 593 594 595 596 597
/*-----------------------------------------------------------------
 * CRUD START:
 *   A more elegant soln is in the works that uses the queue
 *   merge fn, unfortunately there are a couple of changes to
 *   the block layer that I want to make for this.  So in the
 *   interests of getting something for people to use I give
 *   you this clearly demarcated crap.
 *---------------------------------------------------------------*/

598 599 600 601 602
static int __noflush_suspending(struct mapped_device *md)
{
	return test_bit(DMF_NOFLUSH_SUSPENDING, &md->flags);
}

L
Linus Torvalds 已提交
603 604 605 606
/*
 * Decrements the number of outstanding ios that a bio has been
 * cloned into, completing the original io if necc.
 */
607
static void dec_pending(struct dm_io *io, int error)
L
Linus Torvalds 已提交
608
{
609
	unsigned long flags;
610 611 612
	int io_error;
	struct bio *bio;
	struct mapped_device *md = io->md;
613 614

	/* Push-back supersedes any I/O errors */
615 616 617 618 619 620
	if (unlikely(error)) {
		spin_lock_irqsave(&io->endio_lock, flags);
		if (!(io->error > 0 && __noflush_suspending(md)))
			io->error = error;
		spin_unlock_irqrestore(&io->endio_lock, flags);
	}
L
Linus Torvalds 已提交
621 622

	if (atomic_dec_and_test(&io->io_count)) {
623 624 625 626
		if (io->error == DM_ENDIO_REQUEUE) {
			/*
			 * Target requested pushing back the I/O.
			 */
627
			spin_lock_irqsave(&md->deferred_lock, flags);
628
			if (__noflush_suspending(md)) {
629
				if (!(io->bio->bi_rw & REQ_HARDBARRIER))
630 631 632
					bio_list_add_head(&md->deferred,
							  io->bio);
			} else
633 634
				/* noflush suspend was interrupted. */
				io->error = -EIO;
635
			spin_unlock_irqrestore(&md->deferred_lock, flags);
636 637
		}

638 639
		io_error = io->error;
		bio = io->bio;
640

641
		if (bio->bi_rw & REQ_HARDBARRIER) {
642 643 644 645
			/*
			 * There can be just one barrier request so we use
			 * a per-device variable for error reporting.
			 * Note that you can't touch the bio after end_io_acct
646 647 648 649 650
			 *
			 * We ignore -EOPNOTSUPP for empty flush reported by
			 * underlying devices. We assume that if the device
			 * doesn't support empty barriers, it doesn't need
			 * cache flushing commands.
651
			 */
652 653
			if (!md->barrier_error &&
			    !(bio_empty_barrier(bio) && io_error == -EOPNOTSUPP))
654
				md->barrier_error = io_error;
655
			end_io_acct(io);
656
			free_io(md, io);
657 658
		} else {
			end_io_acct(io);
659
			free_io(md, io);
660

661 662
			if (io_error != DM_ENDIO_REQUEUE) {
				trace_block_bio_complete(md->queue, bio);
663

664 665
				bio_endio(bio, io_error);
			}
666
		}
L
Linus Torvalds 已提交
667 668 669
	}
}

670
static void clone_endio(struct bio *bio, int error)
L
Linus Torvalds 已提交
671 672
{
	int r = 0;
A
Alasdair G Kergon 已提交
673
	struct dm_target_io *tio = bio->bi_private;
674
	struct dm_io *io = tio->io;
S
Stefan Bader 已提交
675
	struct mapped_device *md = tio->io->md;
L
Linus Torvalds 已提交
676 677 678 679 680 681 682
	dm_endio_fn endio = tio->ti->type->end_io;

	if (!bio_flagged(bio, BIO_UPTODATE) && !error)
		error = -EIO;

	if (endio) {
		r = endio(tio->ti, bio, error, &tio->info);
683 684 685 686 687
		if (r < 0 || r == DM_ENDIO_REQUEUE)
			/*
			 * error and requeue request are handled
			 * in dec_pending().
			 */
L
Linus Torvalds 已提交
688
			error = r;
689 690
		else if (r == DM_ENDIO_INCOMPLETE)
			/* The target will handle the io */
691
			return;
692 693 694 695
		else if (r) {
			DMWARN("unimplemented target endio return value: %d", r);
			BUG();
		}
L
Linus Torvalds 已提交
696 697
	}

S
Stefan Bader 已提交
698 699 700 701 702 703
	/*
	 * Store md for cleanup instead of tio which is about to get freed.
	 */
	bio->bi_private = md->bs;

	free_tio(md, tio);
704 705
	bio_put(bio);
	dec_pending(io, error);
L
Linus Torvalds 已提交
706 707
}

708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757
/*
 * Partial completion handling for request-based dm
 */
static void end_clone_bio(struct bio *clone, int error)
{
	struct dm_rq_clone_bio_info *info = clone->bi_private;
	struct dm_rq_target_io *tio = info->tio;
	struct bio *bio = info->orig;
	unsigned int nr_bytes = info->orig->bi_size;

	bio_put(clone);

	if (tio->error)
		/*
		 * An error has already been detected on the request.
		 * Once error occurred, just let clone->end_io() handle
		 * the remainder.
		 */
		return;
	else if (error) {
		/*
		 * Don't notice the error to the upper layer yet.
		 * The error handling decision is made by the target driver,
		 * when the request is completed.
		 */
		tio->error = error;
		return;
	}

	/*
	 * I/O for the bio successfully completed.
	 * Notice the data completion to the upper layer.
	 */

	/*
	 * bios are processed from the head of the list.
	 * So the completing bio should always be rq->bio.
	 * If it's not, something wrong is happening.
	 */
	if (tio->orig->bio != bio)
		DMERR("bio completion is going in the middle of the request");

	/*
	 * Update the original request.
	 * Do not use blk_end_request() here, because it may complete
	 * the original request before the clone, and break the ordering.
	 */
	blk_update_request(tio->orig, 0, nr_bytes);
}

758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774
static void store_barrier_error(struct mapped_device *md, int error)
{
	unsigned long flags;

	spin_lock_irqsave(&md->barrier_error_lock, flags);
	/*
	 * Basically, the first error is taken, but:
	 *   -EOPNOTSUPP supersedes any I/O error.
	 *   Requeue request supersedes any I/O error but -EOPNOTSUPP.
	 */
	if (!md->barrier_error || error == -EOPNOTSUPP ||
	    (md->barrier_error != -EOPNOTSUPP &&
	     error == DM_ENDIO_REQUEUE))
		md->barrier_error = error;
	spin_unlock_irqrestore(&md->barrier_error_lock, flags);
}

775 776 777 778 779
/*
 * Don't touch any member of the md after calling this function because
 * the md may be freed in dm_put() at the end of this function.
 * Or do dm_get() before calling this function and dm_put() later.
 */
780
static void rq_completed(struct mapped_device *md, int rw, int run_queue)
781
{
782
	atomic_dec(&md->pending[rw]);
783 784

	/* nudge anyone waiting on suspend queue */
785
	if (!md_in_flight(md))
786 787 788
		wake_up(&md->wait);

	if (run_queue)
789
		blk_run_queue(md->queue);
790 791 792 793 794 795 796

	/*
	 * dm_put() must be at the end of this function. See the comment above
	 */
	dm_put(md);
}

797 798 799 800 801 802 803 804
static void free_rq_clone(struct request *clone)
{
	struct dm_rq_target_io *tio = clone->end_io_data;

	blk_rq_unprep_clone(clone);
	free_rq_tio(tio);
}

K
Kiyoshi Ueda 已提交
805 806 807 808 809 810 811
/*
 * Complete the clone and the original request.
 * Must be called without queue lock.
 */
static void dm_end_request(struct request *clone, int error)
{
	int rw = rq_data_dir(clone);
812
	int run_queue = 1;
813
	bool is_barrier = clone->cmd_flags & REQ_HARDBARRIER;
K
Kiyoshi Ueda 已提交
814 815 816 817
	struct dm_rq_target_io *tio = clone->end_io_data;
	struct mapped_device *md = tio->md;
	struct request *rq = tio->orig;

818
	if (rq->cmd_type == REQ_TYPE_BLOCK_PC && !is_barrier) {
K
Kiyoshi Ueda 已提交
819 820 821 822 823 824 825 826 827 828 829 830 831 832
		rq->errors = clone->errors;
		rq->resid_len = clone->resid_len;

		if (rq->sense)
			/*
			 * We are using the sense buffer of the original
			 * request.
			 * So setting the length of the sense data is enough.
			 */
			rq->sense_len = clone->sense_len;
	}

	free_rq_clone(clone);

833 834 835 836 837 838
	if (unlikely(is_barrier)) {
		if (unlikely(error))
			store_barrier_error(md, error);
		run_queue = 0;
	} else
		blk_end_request_all(rq, error);
K
Kiyoshi Ueda 已提交
839

840
	rq_completed(md, rw, run_queue);
K
Kiyoshi Ueda 已提交
841 842
}

843 844 845 846 847 848 849
static void dm_unprep_request(struct request *rq)
{
	struct request *clone = rq->special;

	rq->special = NULL;
	rq->cmd_flags &= ~REQ_DONTPREP;

850
	free_rq_clone(clone);
851 852 853 854 855 856 857
}

/*
 * Requeue the original request of a clone.
 */
void dm_requeue_unmapped_request(struct request *clone)
{
858
	int rw = rq_data_dir(clone);
859 860 861 862 863 864
	struct dm_rq_target_io *tio = clone->end_io_data;
	struct mapped_device *md = tio->md;
	struct request *rq = tio->orig;
	struct request_queue *q = rq->q;
	unsigned long flags;

865
	if (unlikely(clone->cmd_flags & REQ_HARDBARRIER)) {
866 867 868 869 870 871 872 873 874
		/*
		 * Barrier clones share an original request.
		 * Leave it to dm_end_request(), which handles this special
		 * case.
		 */
		dm_end_request(clone, DM_ENDIO_REQUEUE);
		return;
	}

875 876 877 878 879 880 881 882
	dm_unprep_request(rq);

	spin_lock_irqsave(q->queue_lock, flags);
	if (elv_queue_empty(q))
		blk_plug_device(q);
	blk_requeue_request(q, rq);
	spin_unlock_irqrestore(q->queue_lock, flags);

883
	rq_completed(md, rw, 0);
884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915
}
EXPORT_SYMBOL_GPL(dm_requeue_unmapped_request);

static void __stop_queue(struct request_queue *q)
{
	blk_stop_queue(q);
}

static void stop_queue(struct request_queue *q)
{
	unsigned long flags;

	spin_lock_irqsave(q->queue_lock, flags);
	__stop_queue(q);
	spin_unlock_irqrestore(q->queue_lock, flags);
}

static void __start_queue(struct request_queue *q)
{
	if (blk_queue_stopped(q))
		blk_start_queue(q);
}

static void start_queue(struct request_queue *q)
{
	unsigned long flags;

	spin_lock_irqsave(q->queue_lock, flags);
	__start_queue(q);
	spin_unlock_irqrestore(q->queue_lock, flags);
}

916
static void dm_done(struct request *clone, int error, bool mapped)
917
{
918
	int r = error;
919 920 921
	struct dm_rq_target_io *tio = clone->end_io_data;
	dm_request_endio_fn rq_end_io = tio->ti->type->rq_end_io;

922 923
	if (mapped && rq_end_io)
		r = rq_end_io(tio->ti, clone, error, &tio->info);
924

925
	if (r <= 0)
926
		/* The target wants to complete the I/O */
927 928
		dm_end_request(clone, r);
	else if (r == DM_ENDIO_INCOMPLETE)
929 930
		/* The target will handle the I/O */
		return;
931
	else if (r == DM_ENDIO_REQUEUE)
932 933 934
		/* The target wants to requeue the I/O */
		dm_requeue_unmapped_request(clone);
	else {
935
		DMWARN("unimplemented target endio return value: %d", r);
936 937 938 939
		BUG();
	}
}

940 941 942 943 944 945 946 947 948 949 950 951 952 953 954
/*
 * Request completion handler for request-based dm
 */
static void dm_softirq_done(struct request *rq)
{
	bool mapped = true;
	struct request *clone = rq->completion_data;
	struct dm_rq_target_io *tio = clone->end_io_data;

	if (rq->cmd_flags & REQ_FAILED)
		mapped = false;

	dm_done(clone, tio->error, mapped);
}

955 956 957 958 959 960 961 962 963
/*
 * Complete the clone and the original request with the error status
 * through softirq context.
 */
static void dm_complete_request(struct request *clone, int error)
{
	struct dm_rq_target_io *tio = clone->end_io_data;
	struct request *rq = tio->orig;

964
	if (unlikely(clone->cmd_flags & REQ_HARDBARRIER)) {
965 966 967 968 969 970 971 972 973 974 975 976
		/*
		 * Barrier clones share an original request.  So can't use
		 * softirq_done with the original.
		 * Pass the clone to dm_done() directly in this special case.
		 * It is safe (even if clone->q->queue_lock is held here)
		 * because there is no I/O dispatching during the completion
		 * of barrier clone.
		 */
		dm_done(clone, error, true);
		return;
	}

977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992
	tio->error = error;
	rq->completion_data = clone;
	blk_complete_request(rq);
}

/*
 * Complete the not-mapped clone and the original request with the error status
 * through softirq context.
 * Target's rq_end_io() function isn't called.
 * This may be used when the target's map_rq() function fails.
 */
void dm_kill_unmapped_request(struct request *clone, int error)
{
	struct dm_rq_target_io *tio = clone->end_io_data;
	struct request *rq = tio->orig;

993
	if (unlikely(clone->cmd_flags & REQ_HARDBARRIER)) {
994 995 996 997 998 999 1000 1001 1002 1003
		/*
		 * Barrier clones share an original request.
		 * Leave it to dm_end_request(), which handles this special
		 * case.
		 */
		BUG_ON(error > 0);
		dm_end_request(clone, error);
		return;
	}

1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032
	rq->cmd_flags |= REQ_FAILED;
	dm_complete_request(clone, error);
}
EXPORT_SYMBOL_GPL(dm_kill_unmapped_request);

/*
 * Called with the queue lock held
 */
static void end_clone_request(struct request *clone, int error)
{
	/*
	 * For just cleaning up the information of the queue in which
	 * the clone was dispatched.
	 * The clone is *NOT* freed actually here because it is alloced from
	 * dm own mempool and REQ_ALLOCED isn't set in clone->cmd_flags.
	 */
	__blk_put_request(clone->q, clone);

	/*
	 * Actual request completion is done in a softirq context which doesn't
	 * hold the queue lock.  Otherwise, deadlock could occur because:
	 *     - another request may be submitted by the upper level driver
	 *       of the stacking during the completion
	 *     - the submission which requires queue lock may be done
	 *       against this queue
	 */
	dm_complete_request(clone, error);
}

1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044
/*
 * Return maximum size of I/O possible at the supplied sector up to the current
 * target boundary.
 */
static sector_t max_io_len_target_boundary(sector_t sector, struct dm_target *ti)
{
	sector_t target_offset = dm_target_offset(ti, sector);

	return ti->len - target_offset;
}

static sector_t max_io_len(sector_t sector, struct dm_target *ti)
L
Linus Torvalds 已提交
1045
{
1046
	sector_t len = max_io_len_target_boundary(sector, ti);
L
Linus Torvalds 已提交
1047 1048 1049 1050 1051 1052

	/*
	 * Does the target need to split even further ?
	 */
	if (ti->split_io) {
		sector_t boundary;
1053
		sector_t offset = dm_target_offset(ti, sector);
L
Linus Torvalds 已提交
1054 1055 1056 1057 1058 1059 1060 1061 1062 1063
		boundary = ((offset + ti->split_io) & ~(ti->split_io - 1))
			   - offset;
		if (len > boundary)
			len = boundary;
	}

	return len;
}

static void __map_bio(struct dm_target *ti, struct bio *clone,
A
Alasdair G Kergon 已提交
1064
		      struct dm_target_io *tio)
L
Linus Torvalds 已提交
1065 1066
{
	int r;
1067
	sector_t sector;
S
Stefan Bader 已提交
1068
	struct mapped_device *md;
L
Linus Torvalds 已提交
1069 1070 1071 1072 1073 1074 1075 1076 1077 1078

	clone->bi_end_io = clone_endio;
	clone->bi_private = tio;

	/*
	 * Map the clone.  If r == 0 we don't need to do
	 * anything, the target has assumed ownership of
	 * this io.
	 */
	atomic_inc(&tio->io->io_count);
1079
	sector = clone->bi_sector;
L
Linus Torvalds 已提交
1080
	r = ti->type->map(ti, clone, &tio->info);
1081
	if (r == DM_MAPIO_REMAPPED) {
L
Linus Torvalds 已提交
1082
		/* the bio has been remapped so dispatch it */
1083

1084
		trace_block_remap(bdev_get_queue(clone->bi_bdev), clone,
1085
				    tio->io->bio->bi_bdev->bd_dev, sector);
1086

L
Linus Torvalds 已提交
1087
		generic_make_request(clone);
1088 1089
	} else if (r < 0 || r == DM_MAPIO_REQUEUE) {
		/* error the io and bail out, or requeue it if needed */
S
Stefan Bader 已提交
1090 1091 1092 1093 1094 1095
		md = tio->io->md;
		dec_pending(tio->io, r);
		/*
		 * Store bio_set for cleanup.
		 */
		clone->bi_private = md->bs;
L
Linus Torvalds 已提交
1096
		bio_put(clone);
S
Stefan Bader 已提交
1097
		free_tio(md, tio);
1098 1099 1100
	} else if (r) {
		DMWARN("unimplemented target map return value: %d", r);
		BUG();
L
Linus Torvalds 已提交
1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113
	}
}

struct clone_info {
	struct mapped_device *md;
	struct dm_table *map;
	struct bio *bio;
	struct dm_io *io;
	sector_t sector;
	sector_t sector_count;
	unsigned short idx;
};

P
Peter Osterlund 已提交
1114 1115
static void dm_bio_destructor(struct bio *bio)
{
S
Stefan Bader 已提交
1116 1117 1118
	struct bio_set *bs = bio->bi_private;

	bio_free(bio, bs);
P
Peter Osterlund 已提交
1119 1120
}

L
Linus Torvalds 已提交
1121 1122 1123 1124 1125
/*
 * Creates a little bio that is just does part of a bvec.
 */
static struct bio *split_bvec(struct bio *bio, sector_t sector,
			      unsigned short idx, unsigned int offset,
S
Stefan Bader 已提交
1126
			      unsigned int len, struct bio_set *bs)
L
Linus Torvalds 已提交
1127 1128 1129 1130
{
	struct bio *clone;
	struct bio_vec *bv = bio->bi_io_vec + idx;

S
Stefan Bader 已提交
1131
	clone = bio_alloc_bioset(GFP_NOIO, 1, bs);
P
Peter Osterlund 已提交
1132
	clone->bi_destructor = dm_bio_destructor;
L
Linus Torvalds 已提交
1133 1134 1135 1136
	*clone->bi_io_vec = *bv;

	clone->bi_sector = sector;
	clone->bi_bdev = bio->bi_bdev;
1137
	clone->bi_rw = bio->bi_rw & ~REQ_HARDBARRIER;
L
Linus Torvalds 已提交
1138 1139 1140 1141
	clone->bi_vcnt = 1;
	clone->bi_size = to_bytes(len);
	clone->bi_io_vec->bv_offset = offset;
	clone->bi_io_vec->bv_len = clone->bi_size;
M
Martin K. Petersen 已提交
1142
	clone->bi_flags |= 1 << BIO_CLONED;
L
Linus Torvalds 已提交
1143

M
Martin K. Petersen 已提交
1144
	if (bio_integrity(bio)) {
1145
		bio_integrity_clone(clone, bio, GFP_NOIO, bs);
M
Martin K. Petersen 已提交
1146 1147 1148 1149
		bio_integrity_trim(clone,
				   bio_sector_offset(bio, idx, offset), len);
	}

L
Linus Torvalds 已提交
1150 1151 1152 1153 1154 1155 1156 1157
	return clone;
}

/*
 * Creates a bio that consists of range of complete bvecs.
 */
static struct bio *clone_bio(struct bio *bio, sector_t sector,
			     unsigned short idx, unsigned short bv_count,
S
Stefan Bader 已提交
1158
			     unsigned int len, struct bio_set *bs)
L
Linus Torvalds 已提交
1159 1160 1161
{
	struct bio *clone;

S
Stefan Bader 已提交
1162 1163
	clone = bio_alloc_bioset(GFP_NOIO, bio->bi_max_vecs, bs);
	__bio_clone(clone, bio);
1164
	clone->bi_rw &= ~REQ_HARDBARRIER;
S
Stefan Bader 已提交
1165
	clone->bi_destructor = dm_bio_destructor;
L
Linus Torvalds 已提交
1166 1167 1168 1169 1170 1171
	clone->bi_sector = sector;
	clone->bi_idx = idx;
	clone->bi_vcnt = idx + bv_count;
	clone->bi_size = to_bytes(len);
	clone->bi_flags &= ~(1 << BIO_SEG_VALID);

M
Martin K. Petersen 已提交
1172
	if (bio_integrity(bio)) {
1173
		bio_integrity_clone(clone, bio, GFP_NOIO, bs);
M
Martin K. Petersen 已提交
1174 1175 1176 1177 1178 1179

		if (idx != bio->bi_idx || clone->bi_size < bio->bi_size)
			bio_integrity_trim(clone,
					   bio_sector_offset(bio, idx, 0), len);
	}

L
Linus Torvalds 已提交
1180 1181 1182
	return clone;
}

1183 1184
static struct dm_target_io *alloc_tio(struct clone_info *ci,
				      struct dm_target *ti)
1185
{
1186
	struct dm_target_io *tio = mempool_alloc(ci->md->tio_pool, GFP_NOIO);
1187 1188 1189 1190

	tio->io = ci->io;
	tio->ti = ti;
	memset(&tio->info, 0, sizeof(tio->info));
1191 1192 1193 1194

	return tio;
}

1195
static void __issue_target_request(struct clone_info *ci, struct dm_target *ti,
1196
				   unsigned request_nr, sector_t len)
1197 1198 1199 1200
{
	struct dm_target_io *tio = alloc_tio(ci, ti);
	struct bio *clone;

1201
	tio->info.target_request_nr = request_nr;
1202

1203 1204 1205 1206 1207 1208
	/*
	 * Discard requests require the bio's inline iovecs be initialized.
	 * ci->bio->bi_max_vecs is BIO_INLINE_VECS anyway, for both flush
	 * and discard, so no need for concern about wasted bvec allocations.
	 */
	clone = bio_alloc_bioset(GFP_NOIO, ci->bio->bi_max_vecs, ci->md->bs);
1209 1210
	__bio_clone(clone, ci->bio);
	clone->bi_destructor = dm_bio_destructor;
1211 1212 1213 1214
	if (len) {
		clone->bi_sector = ci->sector;
		clone->bi_size = to_bytes(len);
	}
1215 1216 1217 1218

	__map_bio(ti, clone, tio);
}

1219
static void __issue_target_requests(struct clone_info *ci, struct dm_target *ti,
1220
				    unsigned num_requests, sector_t len)
1221 1222 1223 1224
{
	unsigned request_nr;

	for (request_nr = 0; request_nr < num_requests; request_nr++)
1225
		__issue_target_request(ci, ti, request_nr, len);
1226 1227
}

1228 1229
static int __clone_and_map_empty_barrier(struct clone_info *ci)
{
1230
	unsigned target_nr = 0;
1231 1232 1233
	struct dm_target *ti;

	while ((ti = dm_table_get_target(ci->map, target_nr++)))
1234
		__issue_target_requests(ci, ti, ti->num_flush_requests, 0);
1235 1236 1237 1238 1239 1240

	ci->sector_count = 0;

	return 0;
}

M
Mike Snitzer 已提交
1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259
/*
 * Perform all io with a single clone.
 */
static void __clone_and_map_simple(struct clone_info *ci, struct dm_target *ti)
{
	struct bio *clone, *bio = ci->bio;
	struct dm_target_io *tio;

	tio = alloc_tio(ci, ti);
	clone = clone_bio(bio, ci->sector, ci->idx,
			  bio->bi_vcnt - ci->idx, ci->sector_count,
			  ci->md->bs);
	__map_bio(ti, clone, tio);
	ci->sector_count = 0;
}

static int __clone_and_map_discard(struct clone_info *ci)
{
	struct dm_target *ti;
1260
	sector_t len;
M
Mike Snitzer 已提交
1261

1262 1263 1264 1265
	do {
		ti = dm_table_find_target(ci->map, ci->sector);
		if (!dm_target_is_valid(ti))
			return -EIO;
M
Mike Snitzer 已提交
1266 1267

		/*
1268 1269 1270
		 * Even though the device advertised discard support,
		 * reconfiguration might have changed that since the
		 * check was performed.
M
Mike Snitzer 已提交
1271
		 */
1272 1273
		if (!ti->num_discard_requests)
			return -EOPNOTSUPP;
M
Mike Snitzer 已提交
1274

1275
		len = min(ci->sector_count, max_io_len_target_boundary(ci->sector, ti));
1276

1277 1278 1279 1280
		__issue_target_requests(ci, ti, ti->num_discard_requests, len);

		ci->sector += len;
	} while (ci->sector_count -= len);
M
Mike Snitzer 已提交
1281 1282 1283 1284

	return 0;
}

1285
static int __clone_and_map(struct clone_info *ci)
L
Linus Torvalds 已提交
1286 1287
{
	struct bio *clone, *bio = ci->bio;
1288 1289
	struct dm_target *ti;
	sector_t len = 0, max;
A
Alasdair G Kergon 已提交
1290
	struct dm_target_io *tio;
L
Linus Torvalds 已提交
1291

1292 1293 1294
	if (unlikely(bio_empty_barrier(bio)))
		return __clone_and_map_empty_barrier(ci);

M
Mike Snitzer 已提交
1295 1296 1297
	if (unlikely(bio->bi_rw & REQ_DISCARD))
		return __clone_and_map_discard(ci);

1298 1299 1300 1301
	ti = dm_table_find_target(ci->map, ci->sector);
	if (!dm_target_is_valid(ti))
		return -EIO;

1302
	max = max_io_len(ci->sector, ti);
1303

L
Linus Torvalds 已提交
1304 1305 1306 1307 1308
	if (ci->sector_count <= max) {
		/*
		 * Optimise for the simple case where we can do all of
		 * the remaining io with a single clone.
		 */
M
Mike Snitzer 已提交
1309
		__clone_and_map_simple(ci, ti);
L
Linus Torvalds 已提交
1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329

	} else if (to_sector(bio->bi_io_vec[ci->idx].bv_len) <= max) {
		/*
		 * There are some bvecs that don't span targets.
		 * Do as many of these as possible.
		 */
		int i;
		sector_t remaining = max;
		sector_t bv_len;

		for (i = ci->idx; remaining && (i < bio->bi_vcnt); i++) {
			bv_len = to_sector(bio->bi_io_vec[i].bv_len);

			if (bv_len > remaining)
				break;

			remaining -= bv_len;
			len += bv_len;
		}

M
Mike Snitzer 已提交
1330
		tio = alloc_tio(ci, ti);
S
Stefan Bader 已提交
1331 1332
		clone = clone_bio(bio, ci->sector, ci->idx, i - ci->idx, len,
				  ci->md->bs);
L
Linus Torvalds 已提交
1333 1334 1335 1336 1337 1338 1339 1340
		__map_bio(ti, clone, tio);

		ci->sector += len;
		ci->sector_count -= len;
		ci->idx = i;

	} else {
		/*
1341
		 * Handle a bvec that must be split between two or more targets.
L
Linus Torvalds 已提交
1342 1343
		 */
		struct bio_vec *bv = bio->bi_io_vec + ci->idx;
1344 1345
		sector_t remaining = to_sector(bv->bv_len);
		unsigned int offset = 0;
L
Linus Torvalds 已提交
1346

1347 1348 1349
		do {
			if (offset) {
				ti = dm_table_find_target(ci->map, ci->sector);
1350 1351 1352
				if (!dm_target_is_valid(ti))
					return -EIO;

1353
				max = max_io_len(ci->sector, ti);
1354 1355 1356 1357
			}

			len = min(remaining, max);

M
Mike Snitzer 已提交
1358
			tio = alloc_tio(ci, ti);
1359
			clone = split_bvec(bio, ci->sector, ci->idx,
S
Stefan Bader 已提交
1360 1361
					   bv->bv_offset + offset, len,
					   ci->md->bs);
1362 1363 1364 1365 1366 1367 1368

			__map_bio(ti, clone, tio);

			ci->sector += len;
			ci->sector_count -= len;
			offset += to_bytes(len);
		} while (remaining -= len);
L
Linus Torvalds 已提交
1369 1370 1371

		ci->idx++;
	}
1372 1373

	return 0;
L
Linus Torvalds 已提交
1374 1375 1376
}

/*
M
Mikulas Patocka 已提交
1377
 * Split the bio into several clones and submit it to targets.
L
Linus Torvalds 已提交
1378
 */
1379
static void __split_and_process_bio(struct mapped_device *md, struct bio *bio)
L
Linus Torvalds 已提交
1380 1381
{
	struct clone_info ci;
1382
	int error = 0;
L
Linus Torvalds 已提交
1383

1384
	ci.map = dm_get_live_table(md);
1385
	if (unlikely(!ci.map)) {
1386
		if (!(bio->bi_rw & REQ_HARDBARRIER))
1387 1388
			bio_io_error(bio);
		else
1389 1390
			if (!md->barrier_error)
				md->barrier_error = -EIO;
1391 1392
		return;
	}
1393

L
Linus Torvalds 已提交
1394 1395 1396 1397 1398 1399 1400
	ci.md = md;
	ci.bio = bio;
	ci.io = alloc_io(md);
	ci.io->error = 0;
	atomic_set(&ci.io->io_count, 1);
	ci.io->bio = bio;
	ci.io->md = md;
1401
	spin_lock_init(&ci.io->endio_lock);
L
Linus Torvalds 已提交
1402 1403
	ci.sector = bio->bi_sector;
	ci.sector_count = bio_sectors(bio);
1404 1405
	if (unlikely(bio_empty_barrier(bio)))
		ci.sector_count = 1;
L
Linus Torvalds 已提交
1406 1407
	ci.idx = bio->bi_idx;

1408
	start_io_acct(ci.io);
1409 1410
	while (ci.sector_count && !error)
		error = __clone_and_map(&ci);
L
Linus Torvalds 已提交
1411 1412

	/* drop the extra reference count */
1413
	dec_pending(ci.io, error);
L
Linus Torvalds 已提交
1414 1415 1416 1417 1418 1419
	dm_table_put(ci.map);
}
/*-----------------------------------------------------------------
 * CRUD END
 *---------------------------------------------------------------*/

M
Milan Broz 已提交
1420 1421 1422 1423 1424
static int dm_merge_bvec(struct request_queue *q,
			 struct bvec_merge_data *bvm,
			 struct bio_vec *biovec)
{
	struct mapped_device *md = q->queuedata;
1425
	struct dm_table *map = dm_get_live_table(md);
M
Milan Broz 已提交
1426 1427
	struct dm_target *ti;
	sector_t max_sectors;
1428
	int max_size = 0;
M
Milan Broz 已提交
1429 1430

	if (unlikely(!map))
1431
		goto out;
M
Milan Broz 已提交
1432 1433

	ti = dm_table_find_target(map, bvm->bi_sector);
1434 1435
	if (!dm_target_is_valid(ti))
		goto out_table;
M
Milan Broz 已提交
1436 1437 1438 1439

	/*
	 * Find maximum amount of I/O that won't need splitting
	 */
1440
	max_sectors = min(max_io_len(bvm->bi_sector, ti),
M
Milan Broz 已提交
1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452
			  (sector_t) BIO_MAX_SECTORS);
	max_size = (max_sectors << SECTOR_SHIFT) - bvm->bi_size;
	if (max_size < 0)
		max_size = 0;

	/*
	 * merge_bvec_fn() returns number of bytes
	 * it can accept at this offset
	 * max is precomputed maximal io size
	 */
	if (max_size && ti->type->merge)
		max_size = ti->type->merge(ti, bvm, biovec, max_size);
1453 1454 1455 1456 1457 1458 1459 1460 1461 1462
	/*
	 * If the target doesn't support merge method and some of the devices
	 * provided their merge_bvec method (we know this by looking at
	 * queue_max_hw_sectors), then we can't allow bios with multiple vector
	 * entries.  So always set max_size to 0, and the code below allows
	 * just one page.
	 */
	else if (queue_max_hw_sectors(q) <= PAGE_SIZE >> 9)

		max_size = 0;
M
Milan Broz 已提交
1463

1464
out_table:
1465 1466 1467
	dm_table_put(map);

out:
M
Milan Broz 已提交
1468 1469 1470 1471 1472 1473 1474 1475 1476
	/*
	 * Always allow an entire first page
	 */
	if (max_size <= biovec->bv_len && !(bvm->bi_size >> SECTOR_SHIFT))
		max_size = biovec->bv_len;

	return max_size;
}

L
Linus Torvalds 已提交
1477 1478 1479 1480
/*
 * The request function that just remaps the bio built up by
 * dm_merge_bvec.
 */
1481
static int _dm_request(struct request_queue *q, struct bio *bio)
L
Linus Torvalds 已提交
1482
{
1483
	int rw = bio_data_dir(bio);
L
Linus Torvalds 已提交
1484
	struct mapped_device *md = q->queuedata;
T
Tejun Heo 已提交
1485
	int cpu;
L
Linus Torvalds 已提交
1486

1487
	down_read(&md->io_lock);
L
Linus Torvalds 已提交
1488

T
Tejun Heo 已提交
1489 1490 1491 1492
	cpu = part_stat_lock();
	part_stat_inc(cpu, &dm_disk(md)->part0, ios[rw]);
	part_stat_add(cpu, &dm_disk(md)->part0, sectors[rw], bio_sectors(bio));
	part_stat_unlock();
1493

L
Linus Torvalds 已提交
1494
	/*
1495 1496
	 * If we're suspended or the thread is processing barriers
	 * we have to queue this io for later.
L
Linus Torvalds 已提交
1497
	 */
1498
	if (unlikely(test_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags)) ||
1499
	    unlikely(bio->bi_rw & REQ_HARDBARRIER)) {
1500
		up_read(&md->io_lock);
L
Linus Torvalds 已提交
1501

A
Alasdair G Kergon 已提交
1502 1503 1504 1505 1506
		if (unlikely(test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) &&
		    bio_rw(bio) == READA) {
			bio_io_error(bio);
			return 0;
		}
L
Linus Torvalds 已提交
1507

M
Mikulas Patocka 已提交
1508
		queue_io(md, bio);
L
Linus Torvalds 已提交
1509

M
Mikulas Patocka 已提交
1510
		return 0;
L
Linus Torvalds 已提交
1511 1512
	}

1513
	__split_and_process_bio(md, bio);
1514
	up_read(&md->io_lock);
1515
	return 0;
L
Linus Torvalds 已提交
1516 1517
}

1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539
static int dm_make_request(struct request_queue *q, struct bio *bio)
{
	struct mapped_device *md = q->queuedata;

	return md->saved_make_request_fn(q, bio); /* call __make_request() */
}

static int dm_request_based(struct mapped_device *md)
{
	return blk_queue_stackable(md->queue);
}

static int dm_request(struct request_queue *q, struct bio *bio)
{
	struct mapped_device *md = q->queuedata;

	if (dm_request_based(md))
		return dm_make_request(q, bio);

	return _dm_request(q, bio);
}

1540 1541
static bool dm_rq_is_flush_request(struct request *rq)
{
1542
	if (rq->cmd_flags & REQ_FLUSH)
1543 1544 1545 1546 1547
		return true;
	else
		return false;
}

1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592
void dm_dispatch_request(struct request *rq)
{
	int r;

	if (blk_queue_io_stat(rq->q))
		rq->cmd_flags |= REQ_IO_STAT;

	rq->start_time = jiffies;
	r = blk_insert_cloned_request(rq->q, rq);
	if (r)
		dm_complete_request(rq, r);
}
EXPORT_SYMBOL_GPL(dm_dispatch_request);

static void dm_rq_bio_destructor(struct bio *bio)
{
	struct dm_rq_clone_bio_info *info = bio->bi_private;
	struct mapped_device *md = info->tio->md;

	free_bio_info(info);
	bio_free(bio, md->bs);
}

static int dm_rq_bio_constructor(struct bio *bio, struct bio *bio_orig,
				 void *data)
{
	struct dm_rq_target_io *tio = data;
	struct mapped_device *md = tio->md;
	struct dm_rq_clone_bio_info *info = alloc_bio_info(md);

	if (!info)
		return -ENOMEM;

	info->orig = bio_orig;
	info->tio = tio;
	bio->bi_end_io = end_clone_bio;
	bio->bi_private = info;
	bio->bi_destructor = dm_rq_bio_destructor;

	return 0;
}

static int setup_clone(struct request *clone, struct request *rq,
		       struct dm_rq_target_io *tio)
{
1593
	int r;
1594

1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609
	if (dm_rq_is_flush_request(rq)) {
		blk_rq_init(NULL, clone);
		clone->cmd_type = REQ_TYPE_FS;
		clone->cmd_flags |= (REQ_HARDBARRIER | WRITE);
	} else {
		r = blk_rq_prep_clone(clone, rq, tio->md->bs, GFP_ATOMIC,
				      dm_rq_bio_constructor, tio);
		if (r)
			return r;

		clone->cmd = rq->cmd;
		clone->cmd_len = rq->cmd_len;
		clone->sense = rq->sense;
		clone->buffer = rq->buffer;
	}
1610 1611 1612 1613 1614 1615 1616

	clone->end_io = end_clone_request;
	clone->end_io_data = tio;

	return 0;
}

K
Kiyoshi Ueda 已提交
1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642
static struct request *clone_rq(struct request *rq, struct mapped_device *md,
				gfp_t gfp_mask)
{
	struct request *clone;
	struct dm_rq_target_io *tio;

	tio = alloc_rq_tio(md, gfp_mask);
	if (!tio)
		return NULL;

	tio->md = md;
	tio->ti = NULL;
	tio->orig = rq;
	tio->error = 0;
	memset(&tio->info, 0, sizeof(tio->info));

	clone = &tio->clone;
	if (setup_clone(clone, rq, tio)) {
		/* -ENOMEM */
		free_rq_tio(tio);
		return NULL;
	}

	return clone;
}

1643 1644 1645 1646 1647 1648 1649 1650
/*
 * Called with the queue lock held.
 */
static int dm_prep_fn(struct request_queue *q, struct request *rq)
{
	struct mapped_device *md = q->queuedata;
	struct request *clone;

1651 1652 1653
	if (unlikely(dm_rq_is_flush_request(rq)))
		return BLKPREP_OK;

1654 1655 1656 1657 1658
	if (unlikely(rq->special)) {
		DMWARN("Already has something in rq->special.");
		return BLKPREP_KILL;
	}

K
Kiyoshi Ueda 已提交
1659 1660
	clone = clone_rq(rq, md, GFP_ATOMIC);
	if (!clone)
1661 1662 1663 1664 1665 1666 1667 1668
		return BLKPREP_DEFER;

	rq->special = clone;
	rq->cmd_flags |= REQ_DONTPREP;

	return BLKPREP_OK;
}

1669 1670 1671 1672 1673 1674 1675
/*
 * Returns:
 * 0  : the request has been processed (not requeued)
 * !0 : the request has been requeued
 */
static int map_request(struct dm_target *ti, struct request *clone,
		       struct mapped_device *md)
1676
{
1677
	int r, requeued = 0;
1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696
	struct dm_rq_target_io *tio = clone->end_io_data;

	/*
	 * Hold the md reference here for the in-flight I/O.
	 * We can't rely on the reference count by device opener,
	 * because the device may be closed during the request completion
	 * when all bios are completed.
	 * See the comment in rq_completed() too.
	 */
	dm_get(md);

	tio->ti = ti;
	r = ti->type->map_rq(ti, clone, &tio->info);
	switch (r) {
	case DM_MAPIO_SUBMITTED:
		/* The target has taken the I/O to submit by itself later */
		break;
	case DM_MAPIO_REMAPPED:
		/* The target has remapped the I/O so dispatch it */
1697 1698
		trace_block_rq_remap(clone->q, clone, disk_devt(dm_disk(md)),
				     blk_rq_pos(tio->orig));
1699 1700 1701 1702 1703
		dm_dispatch_request(clone);
		break;
	case DM_MAPIO_REQUEUE:
		/* The target wants to requeue the I/O */
		dm_requeue_unmapped_request(clone);
1704
		requeued = 1;
1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715
		break;
	default:
		if (r > 0) {
			DMWARN("unimplemented target map return value: %d", r);
			BUG();
		}

		/* The target wants to complete the I/O */
		dm_kill_unmapped_request(clone, r);
		break;
	}
1716 1717

	return requeued;
1718 1719 1720 1721 1722 1723 1724 1725 1726
}

/*
 * q->request_fn for request-based dm.
 * Called with the queue lock held.
 */
static void dm_request_fn(struct request_queue *q)
{
	struct mapped_device *md = q->queuedata;
1727
	struct dm_table *map = dm_get_live_table(md);
1728
	struct dm_target *ti;
1729
	struct request *rq, *clone;
1730 1731

	/*
1732 1733 1734 1735
	 * For suspend, check blk_queue_stopped() and increment
	 * ->pending within a single queue_lock not to increment the
	 * number of in-flight I/Os after the queue is stopped in
	 * dm_suspend().
1736 1737 1738 1739 1740 1741
	 */
	while (!blk_queue_plugged(q) && !blk_queue_stopped(q)) {
		rq = blk_peek_request(q);
		if (!rq)
			goto plug_and_out;

1742 1743 1744 1745 1746 1747 1748 1749
		if (unlikely(dm_rq_is_flush_request(rq))) {
			BUG_ON(md->flush_request);
			md->flush_request = rq;
			blk_start_request(rq);
			queue_work(md->wq, &md->barrier_work);
			goto out;
		}

1750 1751 1752 1753 1754
		ti = dm_table_find_target(map, blk_rq_pos(rq));
		if (ti->type->busy && ti->type->busy(ti))
			goto plug_and_out;

		blk_start_request(rq);
1755 1756 1757
		clone = rq->special;
		atomic_inc(&md->pending[rq_data_dir(clone)]);

1758
		spin_unlock(q->queue_lock);
1759 1760 1761
		if (map_request(ti, clone, md))
			goto requeued;

1762 1763 1764 1765 1766
		spin_lock_irq(q->queue_lock);
	}

	goto out;

1767 1768 1769
requeued:
	spin_lock_irq(q->queue_lock);

1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790
plug_and_out:
	if (!elv_queue_empty(q))
		/* Some requests still remain, retry later */
		blk_plug_device(q);

out:
	dm_table_put(map);

	return;
}

int dm_underlying_device_busy(struct request_queue *q)
{
	return blk_lld_busy(q);
}
EXPORT_SYMBOL_GPL(dm_underlying_device_busy);

static int dm_lld_busy(struct request_queue *q)
{
	int r;
	struct mapped_device *md = q->queuedata;
1791
	struct dm_table *map = dm_get_live_table(md);
1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802

	if (!map || test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags))
		r = 1;
	else
		r = dm_table_any_busy_target(map);

	dm_table_put(map);

	return r;
}

1803
static void dm_unplug_all(struct request_queue *q)
L
Linus Torvalds 已提交
1804 1805
{
	struct mapped_device *md = q->queuedata;
1806
	struct dm_table *map = dm_get_live_table(md);
L
Linus Torvalds 已提交
1807 1808

	if (map) {
1809 1810 1811
		if (dm_request_based(md))
			generic_unplug_device(q);

L
Linus Torvalds 已提交
1812 1813 1814 1815 1816 1817 1818
		dm_table_unplug_all(map);
		dm_table_put(map);
	}
}

static int dm_any_congested(void *congested_data, int bdi_bits)
{
1819 1820 1821
	int r = bdi_bits;
	struct mapped_device *md = congested_data;
	struct dm_table *map;
L
Linus Torvalds 已提交
1822

1823
	if (!test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) {
1824
		map = dm_get_live_table(md);
1825
		if (map) {
1826 1827 1828 1829 1830 1831 1832 1833 1834 1835
			/*
			 * Request-based dm cares about only own queue for
			 * the query about congestion status of request_queue
			 */
			if (dm_request_based(md))
				r = md->queue->backing_dev_info.state &
				    bdi_bits;
			else
				r = dm_table_any_congested(map, bdi_bits);

1836 1837 1838 1839
			dm_table_put(map);
		}
	}

L
Linus Torvalds 已提交
1840 1841 1842 1843 1844 1845 1846 1847
	return r;
}

/*-----------------------------------------------------------------
 * An IDR is used to keep track of allocated minor numbers.
 *---------------------------------------------------------------*/
static DEFINE_IDR(_minor_idr);

1848
static void free_minor(int minor)
L
Linus Torvalds 已提交
1849
{
1850
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
1851
	idr_remove(&_minor_idr, minor);
1852
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
1853 1854 1855 1856 1857
}

/*
 * See if the device with a specific minor # is free.
 */
1858
static int specific_minor(int minor)
L
Linus Torvalds 已提交
1859 1860 1861 1862 1863 1864
{
	int r, m;

	if (minor >= (1 << MINORBITS))
		return -EINVAL;

J
Jeff Mahoney 已提交
1865 1866 1867 1868
	r = idr_pre_get(&_minor_idr, GFP_KERNEL);
	if (!r)
		return -ENOMEM;

1869
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
1870 1871 1872 1873 1874 1875

	if (idr_find(&_minor_idr, minor)) {
		r = -EBUSY;
		goto out;
	}

1876
	r = idr_get_new_above(&_minor_idr, MINOR_ALLOCED, minor, &m);
J
Jeff Mahoney 已提交
1877
	if (r)
L
Linus Torvalds 已提交
1878 1879 1880 1881 1882 1883 1884 1885 1886
		goto out;

	if (m != minor) {
		idr_remove(&_minor_idr, m);
		r = -EBUSY;
		goto out;
	}

out:
1887
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
1888 1889 1890
	return r;
}

1891
static int next_free_minor(int *minor)
L
Linus Torvalds 已提交
1892
{
1893
	int r, m;
L
Linus Torvalds 已提交
1894 1895

	r = idr_pre_get(&_minor_idr, GFP_KERNEL);
J
Jeff Mahoney 已提交
1896 1897 1898
	if (!r)
		return -ENOMEM;

1899
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
1900

1901
	r = idr_get_new(&_minor_idr, MINOR_ALLOCED, &m);
1902
	if (r)
L
Linus Torvalds 已提交
1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913
		goto out;

	if (m >= (1 << MINORBITS)) {
		idr_remove(&_minor_idr, m);
		r = -ENOSPC;
		goto out;
	}

	*minor = m;

out:
1914
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
1915 1916 1917
	return r;
}

1918
static const struct block_device_operations dm_blk_dops;
L
Linus Torvalds 已提交
1919

1920
static void dm_wq_work(struct work_struct *work);
1921
static void dm_rq_barrier_work(struct work_struct *work);
1922

1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944
static void dm_init_md_queue(struct mapped_device *md)
{
	/*
	 * Request-based dm devices cannot be stacked on top of bio-based dm
	 * devices.  The type of this dm device has not been decided yet.
	 * The type is decided at the first table loading time.
	 * To prevent problematic device stacking, clear the queue flag
	 * for request stacking support until then.
	 *
	 * This queue is new, so no concurrency on the queue_flags.
	 */
	queue_flag_clear_unlocked(QUEUE_FLAG_STACKABLE, md->queue);

	md->queue->queuedata = md;
	md->queue->backing_dev_info.congested_fn = dm_any_congested;
	md->queue->backing_dev_info.congested_data = md;
	blk_queue_make_request(md->queue, dm_request);
	blk_queue_bounce_limit(md->queue, BLK_BOUNCE_ANY);
	md->queue->unplug_fn = dm_unplug_all;
	blk_queue_merge_bvec(md->queue, dm_merge_bvec);
}

L
Linus Torvalds 已提交
1945 1946 1947
/*
 * Allocate and initialise a blank device with a given minor.
 */
1948
static struct mapped_device *alloc_dev(int minor)
L
Linus Torvalds 已提交
1949 1950
{
	int r;
1951
	struct mapped_device *md = kzalloc(sizeof(*md), GFP_KERNEL);
1952
	void *old_md;
L
Linus Torvalds 已提交
1953 1954 1955 1956 1957 1958

	if (!md) {
		DMWARN("unable to allocate device, out of memory.");
		return NULL;
	}

1959
	if (!try_module_get(THIS_MODULE))
M
Milan Broz 已提交
1960
		goto bad_module_get;
1961

L
Linus Torvalds 已提交
1962
	/* get a minor number for the dev */
1963
	if (minor == DM_ANY_MINOR)
1964
		r = next_free_minor(&minor);
1965
	else
1966
		r = specific_minor(minor);
L
Linus Torvalds 已提交
1967
	if (r < 0)
M
Milan Broz 已提交
1968
		goto bad_minor;
L
Linus Torvalds 已提交
1969

1970
	md->type = DM_TYPE_NONE;
1971
	init_rwsem(&md->io_lock);
1972
	mutex_init(&md->suspend_lock);
1973
	mutex_init(&md->type_lock);
1974
	spin_lock_init(&md->deferred_lock);
1975
	spin_lock_init(&md->barrier_error_lock);
L
Linus Torvalds 已提交
1976 1977
	rwlock_init(&md->map_lock);
	atomic_set(&md->holders, 1);
1978
	atomic_set(&md->open_count, 0);
L
Linus Torvalds 已提交
1979
	atomic_set(&md->event_nr, 0);
M
Mike Anderson 已提交
1980 1981 1982
	atomic_set(&md->uevent_seq, 0);
	INIT_LIST_HEAD(&md->uevent_list);
	spin_lock_init(&md->uevent_lock);
L
Linus Torvalds 已提交
1983

1984
	md->queue = blk_alloc_queue(GFP_KERNEL);
L
Linus Torvalds 已提交
1985
	if (!md->queue)
M
Milan Broz 已提交
1986
		goto bad_queue;
L
Linus Torvalds 已提交
1987

1988
	dm_init_md_queue(md);
S
Stefan Bader 已提交
1989

L
Linus Torvalds 已提交
1990 1991
	md->disk = alloc_disk(1);
	if (!md->disk)
M
Milan Broz 已提交
1992
		goto bad_disk;
L
Linus Torvalds 已提交
1993

1994 1995
	atomic_set(&md->pending[0], 0);
	atomic_set(&md->pending[1], 0);
1996
	init_waitqueue_head(&md->wait);
1997
	INIT_WORK(&md->work, dm_wq_work);
1998
	INIT_WORK(&md->barrier_work, dm_rq_barrier_work);
1999 2000
	init_waitqueue_head(&md->eventq);

L
Linus Torvalds 已提交
2001 2002 2003 2004 2005 2006 2007
	md->disk->major = _major;
	md->disk->first_minor = minor;
	md->disk->fops = &dm_blk_dops;
	md->disk->queue = md->queue;
	md->disk->private_data = md;
	sprintf(md->disk->disk_name, "dm-%d", minor);
	add_disk(md->disk);
M
Mike Anderson 已提交
2008
	format_dev_t(md->name, MKDEV(_major, minor));
L
Linus Torvalds 已提交
2009

2010 2011 2012 2013
	md->wq = create_singlethread_workqueue("kdmflush");
	if (!md->wq)
		goto bad_thread;

M
Mikulas Patocka 已提交
2014 2015 2016 2017
	md->bdev = bdget_disk(md->disk, 0);
	if (!md->bdev)
		goto bad_bdev;

2018
	/* Populate the mapping, nobody knows we exist yet */
2019
	spin_lock(&_minor_lock);
2020
	old_md = idr_replace(&_minor_idr, md, minor);
2021
	spin_unlock(&_minor_lock);
2022 2023 2024

	BUG_ON(old_md != MINOR_ALLOCED);

L
Linus Torvalds 已提交
2025 2026
	return md;

M
Mikulas Patocka 已提交
2027 2028
bad_bdev:
	destroy_workqueue(md->wq);
2029
bad_thread:
2030
	del_gendisk(md->disk);
2031
	put_disk(md->disk);
M
Milan Broz 已提交
2032
bad_disk:
2033
	blk_cleanup_queue(md->queue);
M
Milan Broz 已提交
2034
bad_queue:
L
Linus Torvalds 已提交
2035
	free_minor(minor);
M
Milan Broz 已提交
2036
bad_minor:
2037
	module_put(THIS_MODULE);
M
Milan Broz 已提交
2038
bad_module_get:
L
Linus Torvalds 已提交
2039 2040 2041 2042
	kfree(md);
	return NULL;
}

J
Jun'ichi Nomura 已提交
2043 2044
static void unlock_fs(struct mapped_device *md);

L
Linus Torvalds 已提交
2045 2046
static void free_dev(struct mapped_device *md)
{
2047
	int minor = MINOR(disk_devt(md->disk));
2048

M
Mikulas Patocka 已提交
2049 2050
	unlock_fs(md);
	bdput(md->bdev);
2051
	destroy_workqueue(md->wq);
K
Kiyoshi Ueda 已提交
2052 2053 2054 2055 2056 2057
	if (md->tio_pool)
		mempool_destroy(md->tio_pool);
	if (md->io_pool)
		mempool_destroy(md->io_pool);
	if (md->bs)
		bioset_free(md->bs);
M
Martin K. Petersen 已提交
2058
	blk_integrity_unregister(md->disk);
L
Linus Torvalds 已提交
2059
	del_gendisk(md->disk);
2060
	free_minor(minor);
J
Jeff Mahoney 已提交
2061 2062 2063 2064 2065

	spin_lock(&_minor_lock);
	md->disk->private_data = NULL;
	spin_unlock(&_minor_lock);

L
Linus Torvalds 已提交
2066
	put_disk(md->disk);
2067
	blk_cleanup_queue(md->queue);
2068
	module_put(THIS_MODULE);
L
Linus Torvalds 已提交
2069 2070 2071
	kfree(md);
}

K
Kiyoshi Ueda 已提交
2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094
static void __bind_mempools(struct mapped_device *md, struct dm_table *t)
{
	struct dm_md_mempools *p;

	if (md->io_pool && md->tio_pool && md->bs)
		/* the md already has necessary mempools */
		goto out;

	p = dm_table_get_md_mempools(t);
	BUG_ON(!p || md->io_pool || md->tio_pool || md->bs);

	md->io_pool = p->io_pool;
	p->io_pool = NULL;
	md->tio_pool = p->tio_pool;
	p->tio_pool = NULL;
	md->bs = p->bs;
	p->bs = NULL;

out:
	/* mempool bind completed, now no need any mempools in the table */
	dm_table_free_md_mempools(t);
}

L
Linus Torvalds 已提交
2095 2096 2097 2098 2099
/*
 * Bind a table to the device.
 */
static void event_callback(void *context)
{
M
Mike Anderson 已提交
2100 2101
	unsigned long flags;
	LIST_HEAD(uevents);
L
Linus Torvalds 已提交
2102 2103
	struct mapped_device *md = (struct mapped_device *) context;

M
Mike Anderson 已提交
2104 2105 2106 2107
	spin_lock_irqsave(&md->uevent_lock, flags);
	list_splice_init(&md->uevent_list, &uevents);
	spin_unlock_irqrestore(&md->uevent_lock, flags);

2108
	dm_send_uevents(&uevents, &disk_to_dev(md->disk)->kobj);
M
Mike Anderson 已提交
2109

L
Linus Torvalds 已提交
2110 2111 2112 2113
	atomic_inc(&md->event_nr);
	wake_up(&md->eventq);
}

2114
static void __set_size(struct mapped_device *md, sector_t size)
L
Linus Torvalds 已提交
2115
{
2116
	set_capacity(md->disk, size);
L
Linus Torvalds 已提交
2117

2118 2119 2120
	mutex_lock(&md->bdev->bd_inode->i_mutex);
	i_size_write(md->bdev->bd_inode, (loff_t)size << SECTOR_SHIFT);
	mutex_unlock(&md->bdev->bd_inode->i_mutex);
L
Linus Torvalds 已提交
2121 2122
}

2123 2124 2125 2126 2127
/*
 * Returns old map, which caller must destroy.
 */
static struct dm_table *__bind(struct mapped_device *md, struct dm_table *t,
			       struct queue_limits *limits)
L
Linus Torvalds 已提交
2128
{
2129
	struct dm_table *old_map;
2130
	struct request_queue *q = md->queue;
L
Linus Torvalds 已提交
2131
	sector_t size;
2132
	unsigned long flags;
L
Linus Torvalds 已提交
2133 2134

	size = dm_table_get_size(t);
D
Darrick J. Wong 已提交
2135 2136 2137 2138 2139 2140 2141

	/*
	 * Wipe any geometry if the size of the table changed.
	 */
	if (size != get_capacity(md->disk))
		memset(&md->geometry, 0, sizeof(md->geometry));

M
Mikulas Patocka 已提交
2142
	__set_size(md, size);
2143

2144 2145
	dm_table_event_callback(t, event_callback, md);

K
Kiyoshi Ueda 已提交
2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157
	/*
	 * The queue hasn't been stopped yet, if the old table type wasn't
	 * for request-based during suspension.  So stop it to prevent
	 * I/O mapping before resume.
	 * This must be done before setting the queue restrictions,
	 * because request-based dm may be run just after the setting.
	 */
	if (dm_table_request_based(t) && !blk_queue_stopped(q))
		stop_queue(q);

	__bind_mempools(md, t);

2158
	write_lock_irqsave(&md->map_lock, flags);
2159
	old_map = md->map;
L
Linus Torvalds 已提交
2160
	md->map = t;
2161
	dm_table_set_restrictions(t, q, limits);
2162
	write_unlock_irqrestore(&md->map_lock, flags);
L
Linus Torvalds 已提交
2163

2164
	return old_map;
L
Linus Torvalds 已提交
2165 2166
}

2167 2168 2169 2170
/*
 * Returns unbound table for the caller to free.
 */
static struct dm_table *__unbind(struct mapped_device *md)
L
Linus Torvalds 已提交
2171 2172
{
	struct dm_table *map = md->map;
2173
	unsigned long flags;
L
Linus Torvalds 已提交
2174 2175

	if (!map)
2176
		return NULL;
L
Linus Torvalds 已提交
2177 2178

	dm_table_event_callback(map, NULL, NULL);
2179
	write_lock_irqsave(&md->map_lock, flags);
L
Linus Torvalds 已提交
2180
	md->map = NULL;
2181
	write_unlock_irqrestore(&md->map_lock, flags);
2182 2183

	return map;
L
Linus Torvalds 已提交
2184 2185 2186 2187 2188
}

/*
 * Constructor for a new device.
 */
2189
int dm_create(int minor, struct mapped_device **result)
L
Linus Torvalds 已提交
2190 2191 2192
{
	struct mapped_device *md;

2193
	md = alloc_dev(minor);
L
Linus Torvalds 已提交
2194 2195 2196
	if (!md)
		return -ENXIO;

M
Milan Broz 已提交
2197 2198
	dm_sysfs_init(md);

L
Linus Torvalds 已提交
2199 2200 2201 2202
	*result = md;
	return 0;
}

2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226
/*
 * Functions to manage md->type.
 * All are required to hold md->type_lock.
 */
void dm_lock_md_type(struct mapped_device *md)
{
	mutex_lock(&md->type_lock);
}

void dm_unlock_md_type(struct mapped_device *md)
{
	mutex_unlock(&md->type_lock);
}

void dm_set_md_type(struct mapped_device *md, unsigned type)
{
	md->type = type;
}

unsigned dm_get_md_type(struct mapped_device *md)
{
	return md->type;
}

2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247
/*
 * Fully initialize a request-based queue (->elevator, ->request_fn, etc).
 */
static int dm_init_request_based_queue(struct mapped_device *md)
{
	struct request_queue *q = NULL;

	if (md->queue->elevator)
		return 1;

	/* Fully initialize the queue */
	q = blk_init_allocated_queue(md->queue, dm_request_fn, NULL);
	if (!q)
		return 0;

	md->queue = q;
	md->saved_make_request_fn = md->queue->make_request_fn;
	dm_init_md_queue(md);
	blk_queue_softirq_done(md->queue, dm_softirq_done);
	blk_queue_prep_rq(md->queue, dm_prep_fn);
	blk_queue_lld_busy(md->queue, dm_lld_busy);
2248
	blk_queue_flush(md->queue, REQ_FLUSH);
2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268

	elv_register_queue(md->queue);

	return 1;
}

/*
 * Setup the DM device's queue based on md's type
 */
int dm_setup_md_queue(struct mapped_device *md)
{
	if ((dm_get_md_type(md) == DM_TYPE_REQUEST_BASED) &&
	    !dm_init_request_based_queue(md)) {
		DMWARN("Cannot initialize queue for request-based mapped device");
		return -EINVAL;
	}

	return 0;
}

2269
static struct mapped_device *dm_find_md(dev_t dev)
L
Linus Torvalds 已提交
2270 2271 2272 2273 2274 2275 2276
{
	struct mapped_device *md;
	unsigned minor = MINOR(dev);

	if (MAJOR(dev) != _major || minor >= (1 << MINORBITS))
		return NULL;

2277
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
2278 2279

	md = idr_find(&_minor_idr, minor);
J
Jeff Mahoney 已提交
2280
	if (md && (md == MINOR_ALLOCED ||
2281
		   (MINOR(disk_devt(dm_disk(md))) != minor) ||
2282
		   dm_deleting_md(md) ||
A
Alasdair G Kergon 已提交
2283
		   test_bit(DMF_FREEING, &md->flags))) {
2284
		md = NULL;
J
Jeff Mahoney 已提交
2285 2286
		goto out;
	}
L
Linus Torvalds 已提交
2287

J
Jeff Mahoney 已提交
2288
out:
2289
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
2290

2291 2292 2293
	return md;
}

2294 2295 2296 2297 2298 2299 2300 2301 2302 2303
struct mapped_device *dm_get_md(dev_t dev)
{
	struct mapped_device *md = dm_find_md(dev);

	if (md)
		dm_get(md);

	return md;
}

A
Alasdair G Kergon 已提交
2304
void *dm_get_mdptr(struct mapped_device *md)
2305
{
A
Alasdair G Kergon 已提交
2306
	return md->interface_ptr;
L
Linus Torvalds 已提交
2307 2308 2309 2310 2311 2312 2313 2314 2315 2316
}

void dm_set_mdptr(struct mapped_device *md, void *ptr)
{
	md->interface_ptr = ptr;
}

void dm_get(struct mapped_device *md)
{
	atomic_inc(&md->holders);
2317
	BUG_ON(test_bit(DMF_FREEING, &md->flags));
L
Linus Torvalds 已提交
2318 2319
}

2320 2321 2322 2323 2324 2325
const char *dm_device_name(struct mapped_device *md)
{
	return md->name;
}
EXPORT_SYMBOL_GPL(dm_device_name);

2326
static void __dm_destroy(struct mapped_device *md, bool wait)
L
Linus Torvalds 已提交
2327
{
M
Mike Anderson 已提交
2328
	struct dm_table *map;
L
Linus Torvalds 已提交
2329

2330
	might_sleep();
J
Jeff Mahoney 已提交
2331

2332 2333 2334 2335 2336 2337 2338 2339 2340
	spin_lock(&_minor_lock);
	map = dm_get_live_table(md);
	idr_replace(&_minor_idr, MINOR_ALLOCED, MINOR(disk_devt(dm_disk(md))));
	set_bit(DMF_FREEING, &md->flags);
	spin_unlock(&_minor_lock);

	if (!dm_suspended_md(md)) {
		dm_table_presuspend_targets(map);
		dm_table_postsuspend_targets(map);
L
Linus Torvalds 已提交
2341
	}
2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374

	/*
	 * Rare, but there may be I/O requests still going to complete,
	 * for example.  Wait for all references to disappear.
	 * No one should increment the reference count of the mapped_device,
	 * after the mapped_device state becomes DMF_FREEING.
	 */
	if (wait)
		while (atomic_read(&md->holders))
			msleep(1);
	else if (atomic_read(&md->holders))
		DMWARN("%s: Forcibly removing mapped_device still in use! (%d users)",
		       dm_device_name(md), atomic_read(&md->holders));

	dm_sysfs_exit(md);
	dm_table_put(map);
	dm_table_destroy(__unbind(md));
	free_dev(md);
}

void dm_destroy(struct mapped_device *md)
{
	__dm_destroy(md, true);
}

void dm_destroy_immediate(struct mapped_device *md)
{
	__dm_destroy(md, false);
}

void dm_put(struct mapped_device *md)
{
	atomic_dec(&md->holders);
L
Linus Torvalds 已提交
2375
}
E
Edward Goggin 已提交
2376
EXPORT_SYMBOL_GPL(dm_put);
L
Linus Torvalds 已提交
2377

2378
static int dm_wait_for_completion(struct mapped_device *md, int interruptible)
2379 2380
{
	int r = 0;
2381 2382 2383 2384 2385
	DECLARE_WAITQUEUE(wait, current);

	dm_unplug_all(md->queue);

	add_wait_queue(&md->wait, &wait);
2386 2387

	while (1) {
2388
		set_current_state(interruptible);
2389 2390

		smp_mb();
2391
		if (!md_in_flight(md))
2392 2393
			break;

2394 2395
		if (interruptible == TASK_INTERRUPTIBLE &&
		    signal_pending(current)) {
2396 2397 2398 2399 2400 2401 2402 2403
			r = -EINTR;
			break;
		}

		io_schedule();
	}
	set_current_state(TASK_RUNNING);

2404 2405
	remove_wait_queue(&md->wait, &wait);

2406 2407 2408
	return r;
}

M
Mikulas Patocka 已提交
2409
static void dm_flush(struct mapped_device *md)
2410 2411
{
	dm_wait_for_completion(md, TASK_UNINTERRUPTIBLE);
2412 2413 2414 2415 2416 2417 2418

	bio_init(&md->barrier_bio);
	md->barrier_bio.bi_bdev = md->bdev;
	md->barrier_bio.bi_rw = WRITE_BARRIER;
	__split_and_process_bio(md, &md->barrier_bio);

	dm_wait_for_completion(md, TASK_UNINTERRUPTIBLE);
2419 2420 2421 2422
}

static void process_barrier(struct mapped_device *md, struct bio *bio)
{
2423 2424
	md->barrier_error = 0;

M
Mikulas Patocka 已提交
2425
	dm_flush(md);
2426

2427 2428
	if (!bio_empty_barrier(bio)) {
		__split_and_process_bio(md, bio);
2429 2430 2431 2432 2433 2434
		/*
		 * If the request isn't supported, don't waste time with
		 * the second flush.
		 */
		if (md->barrier_error != -EOPNOTSUPP)
			dm_flush(md);
2435 2436 2437
	}

	if (md->barrier_error != DM_ENDIO_REQUEUE)
M
Mikulas Patocka 已提交
2438
		bio_endio(bio, md->barrier_error);
2439 2440 2441 2442 2443
	else {
		spin_lock_irq(&md->deferred_lock);
		bio_list_add_head(&md->deferred, bio);
		spin_unlock_irq(&md->deferred_lock);
	}
2444 2445
}

L
Linus Torvalds 已提交
2446 2447 2448
/*
 * Process the deferred bios
 */
2449
static void dm_wq_work(struct work_struct *work)
L
Linus Torvalds 已提交
2450
{
2451 2452
	struct mapped_device *md = container_of(work, struct mapped_device,
						work);
2453
	struct bio *c;
L
Linus Torvalds 已提交
2454

2455 2456
	down_write(&md->io_lock);

2457
	while (!test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) {
A
Alasdair G Kergon 已提交
2458 2459 2460 2461 2462
		spin_lock_irq(&md->deferred_lock);
		c = bio_list_pop(&md->deferred);
		spin_unlock_irq(&md->deferred_lock);

		if (!c) {
2463
			clear_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags);
A
Alasdair G Kergon 已提交
2464 2465
			break;
		}
2466

2467 2468
		up_write(&md->io_lock);

K
Kiyoshi Ueda 已提交
2469 2470 2471
		if (dm_request_based(md))
			generic_make_request(c);
		else {
2472
			if (c->bi_rw & REQ_HARDBARRIER)
K
Kiyoshi Ueda 已提交
2473 2474 2475 2476
				process_barrier(md, c);
			else
				__split_and_process_bio(md, c);
		}
2477 2478

		down_write(&md->io_lock);
2479
	}
M
Milan Broz 已提交
2480

2481
	up_write(&md->io_lock);
L
Linus Torvalds 已提交
2482 2483
}

2484
static void dm_queue_flush(struct mapped_device *md)
2485
{
2486 2487
	clear_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags);
	smp_mb__after_clear_bit();
2488
	queue_work(md->wq, &md->work);
2489 2490
}

2491
static void dm_rq_set_target_request_nr(struct request *clone, unsigned request_nr)
2492 2493 2494
{
	struct dm_rq_target_io *tio = clone->end_io_data;

2495
	tio->info.target_request_nr = request_nr;
2496 2497 2498 2499 2500 2501
}

/* Issue barrier requests to targets and wait for their completion. */
static int dm_rq_barrier(struct mapped_device *md)
{
	int i, j;
2502
	struct dm_table *map = dm_get_live_table(md);
2503 2504 2505 2506 2507 2508 2509 2510 2511 2512
	unsigned num_targets = dm_table_get_num_targets(map);
	struct dm_target *ti;
	struct request *clone;

	md->barrier_error = 0;

	for (i = 0; i < num_targets; i++) {
		ti = dm_table_get_target(map, i);
		for (j = 0; j < ti->num_flush_requests; j++) {
			clone = clone_rq(md->flush_request, md, GFP_NOIO);
2513
			dm_rq_set_target_request_nr(clone, j);
2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557
			atomic_inc(&md->pending[rq_data_dir(clone)]);
			map_request(ti, clone, md);
		}
	}

	dm_wait_for_completion(md, TASK_UNINTERRUPTIBLE);
	dm_table_put(map);

	return md->barrier_error;
}

static void dm_rq_barrier_work(struct work_struct *work)
{
	int error;
	struct mapped_device *md = container_of(work, struct mapped_device,
						barrier_work);
	struct request_queue *q = md->queue;
	struct request *rq;
	unsigned long flags;

	/*
	 * Hold the md reference here and leave it at the last part so that
	 * the md can't be deleted by device opener when the barrier request
	 * completes.
	 */
	dm_get(md);

	error = dm_rq_barrier(md);

	rq = md->flush_request;
	md->flush_request = NULL;

	if (error == DM_ENDIO_REQUEUE) {
		spin_lock_irqsave(q->queue_lock, flags);
		blk_requeue_request(q, rq);
		spin_unlock_irqrestore(q->queue_lock, flags);
	} else
		blk_end_request_all(rq, error);

	blk_run_queue(q);

	dm_put(md);
}

L
Linus Torvalds 已提交
2558
/*
2559
 * Swap in a new table, returning the old one for the caller to destroy.
L
Linus Torvalds 已提交
2560
 */
2561
struct dm_table *dm_swap_table(struct mapped_device *md, struct dm_table *table)
L
Linus Torvalds 已提交
2562
{
2563
	struct dm_table *map = ERR_PTR(-EINVAL);
2564
	struct queue_limits limits;
2565
	int r;
L
Linus Torvalds 已提交
2566

2567
	mutex_lock(&md->suspend_lock);
L
Linus Torvalds 已提交
2568 2569

	/* device must be suspended */
2570
	if (!dm_suspended_md(md))
2571
		goto out;
L
Linus Torvalds 已提交
2572

2573
	r = dm_calculate_queue_limits(table, &limits);
2574 2575
	if (r) {
		map = ERR_PTR(r);
2576
		goto out;
2577
	}
2578

2579
	map = __bind(md, table, &limits);
L
Linus Torvalds 已提交
2580

2581
out:
2582
	mutex_unlock(&md->suspend_lock);
2583
	return map;
L
Linus Torvalds 已提交
2584 2585 2586 2587 2588 2589
}

/*
 * Functions to lock and unlock any filesystem running on the
 * device.
 */
2590
static int lock_fs(struct mapped_device *md)
L
Linus Torvalds 已提交
2591
{
2592
	int r;
L
Linus Torvalds 已提交
2593 2594

	WARN_ON(md->frozen_sb);
2595

2596
	md->frozen_sb = freeze_bdev(md->bdev);
2597
	if (IS_ERR(md->frozen_sb)) {
2598
		r = PTR_ERR(md->frozen_sb);
2599 2600
		md->frozen_sb = NULL;
		return r;
2601 2602
	}

2603 2604
	set_bit(DMF_FROZEN, &md->flags);

L
Linus Torvalds 已提交
2605 2606 2607
	return 0;
}

2608
static void unlock_fs(struct mapped_device *md)
L
Linus Torvalds 已提交
2609
{
2610 2611 2612
	if (!test_bit(DMF_FROZEN, &md->flags))
		return;

2613
	thaw_bdev(md->bdev, md->frozen_sb);
L
Linus Torvalds 已提交
2614
	md->frozen_sb = NULL;
2615
	clear_bit(DMF_FROZEN, &md->flags);
L
Linus Torvalds 已提交
2616 2617 2618 2619 2620 2621 2622 2623 2624
}

/*
 * We need to be able to change a mapping table under a mounted
 * filesystem.  For example we might want to move some data in
 * the background.  Before the table can be swapped with
 * dm_bind_table, dm_suspend must be called to flush any in
 * flight bios and ensure that any further io gets deferred.
 */
2625 2626 2627
/*
 * Suspend mechanism in request-based dm.
 *
K
Kiyoshi Ueda 已提交
2628 2629 2630
 * 1. Flush all I/Os by lock_fs() if needed.
 * 2. Stop dispatching any I/O by stopping the request_queue.
 * 3. Wait for all in-flight I/Os to be completed or requeued.
2631
 *
K
Kiyoshi Ueda 已提交
2632
 * To abort suspend, start the request_queue.
2633
 */
2634
int dm_suspend(struct mapped_device *md, unsigned suspend_flags)
L
Linus Torvalds 已提交
2635
{
2636
	struct dm_table *map = NULL;
2637
	int r = 0;
2638
	int do_lockfs = suspend_flags & DM_SUSPEND_LOCKFS_FLAG ? 1 : 0;
2639
	int noflush = suspend_flags & DM_SUSPEND_NOFLUSH_FLAG ? 1 : 0;
L
Linus Torvalds 已提交
2640

2641
	mutex_lock(&md->suspend_lock);
2642

2643
	if (dm_suspended_md(md)) {
M
Milan Broz 已提交
2644
		r = -EINVAL;
2645
		goto out_unlock;
M
Milan Broz 已提交
2646
	}
L
Linus Torvalds 已提交
2647

2648
	map = dm_get_live_table(md);
L
Linus Torvalds 已提交
2649

2650 2651 2652 2653 2654 2655 2656
	/*
	 * DMF_NOFLUSH_SUSPENDING must be set before presuspend.
	 * This flag is cleared before dm_suspend returns.
	 */
	if (noflush)
		set_bit(DMF_NOFLUSH_SUSPENDING, &md->flags);

2657 2658 2659
	/* This does not get reverted if there's an error later. */
	dm_table_presuspend_targets(map);

M
Mikulas Patocka 已提交
2660
	/*
K
Kiyoshi Ueda 已提交
2661 2662 2663 2664
	 * Flush I/O to the device.
	 * Any I/O submitted after lock_fs() may not be flushed.
	 * noflush takes precedence over do_lockfs.
	 * (lock_fs() flushes I/Os and waits for them to complete.)
M
Mikulas Patocka 已提交
2665 2666 2667 2668
	 */
	if (!noflush && do_lockfs) {
		r = lock_fs(md);
		if (r)
K
Kiyoshi Ueda 已提交
2669
			goto out;
2670
	}
L
Linus Torvalds 已提交
2671 2672

	/*
2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686
	 * Here we must make sure that no processes are submitting requests
	 * to target drivers i.e. no one may be executing
	 * __split_and_process_bio. This is called from dm_request and
	 * dm_wq_work.
	 *
	 * To get all processes out of __split_and_process_bio in dm_request,
	 * we take the write lock. To prevent any process from reentering
	 * __split_and_process_bio from dm_request, we set
	 * DMF_QUEUE_IO_TO_THREAD.
	 *
	 * To quiesce the thread (dm_wq_work), we set DMF_BLOCK_IO_FOR_SUSPEND
	 * and call flush_workqueue(md->wq). flush_workqueue will wait until
	 * dm_wq_work exits and DMF_BLOCK_IO_FOR_SUSPEND will prevent any
	 * further calls to __split_and_process_bio from dm_wq_work.
L
Linus Torvalds 已提交
2687
	 */
2688
	down_write(&md->io_lock);
2689 2690
	set_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags);
	set_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags);
2691
	up_write(&md->io_lock);
L
Linus Torvalds 已提交
2692

2693 2694 2695 2696 2697
	/*
	 * Request-based dm uses md->wq for barrier (dm_rq_barrier_work) which
	 * can be kicked until md->queue is stopped.  So stop md->queue before
	 * flushing md->wq.
	 */
2698
	if (dm_request_based(md))
K
Kiyoshi Ueda 已提交
2699
		stop_queue(md->queue);
2700

2701 2702
	flush_workqueue(md->wq);

L
Linus Torvalds 已提交
2703
	/*
2704 2705 2706
	 * At this point no more requests are entering target request routines.
	 * We call dm_wait_for_completion to wait for all existing requests
	 * to finish.
L
Linus Torvalds 已提交
2707
	 */
2708
	r = dm_wait_for_completion(md, TASK_INTERRUPTIBLE);
L
Linus Torvalds 已提交
2709

2710
	down_write(&md->io_lock);
2711
	if (noflush)
2712
		clear_bit(DMF_NOFLUSH_SUSPENDING, &md->flags);
2713
	up_write(&md->io_lock);
2714

L
Linus Torvalds 已提交
2715
	/* were we interrupted ? */
2716
	if (r < 0) {
2717
		dm_queue_flush(md);
M
Milan Broz 已提交
2718

2719
		if (dm_request_based(md))
K
Kiyoshi Ueda 已提交
2720
			start_queue(md->queue);
2721

2722
		unlock_fs(md);
2723
		goto out; /* pushback list is already flushed, so skip flush */
2724
	}
L
Linus Torvalds 已提交
2725

2726 2727 2728 2729 2730 2731
	/*
	 * If dm_wait_for_completion returned 0, the device is completely
	 * quiescent now. There is no request-processing activity. All new
	 * requests are being added to md->deferred list.
	 */

2732
	set_bit(DMF_SUSPENDED, &md->flags);
2733

2734 2735
	dm_table_postsuspend_targets(map);

2736 2737
out:
	dm_table_put(map);
2738 2739

out_unlock:
2740
	mutex_unlock(&md->suspend_lock);
2741
	return r;
L
Linus Torvalds 已提交
2742 2743 2744 2745
}

int dm_resume(struct mapped_device *md)
{
2746 2747
	int r = -EINVAL;
	struct dm_table *map = NULL;
L
Linus Torvalds 已提交
2748

2749
	mutex_lock(&md->suspend_lock);
2750
	if (!dm_suspended_md(md))
2751 2752
		goto out;

2753
	map = dm_get_live_table(md);
2754
	if (!map || !dm_table_get_size(map))
2755
		goto out;
L
Linus Torvalds 已提交
2756

2757 2758 2759
	r = dm_table_resume_targets(map);
	if (r)
		goto out;
2760

2761
	dm_queue_flush(md);
2762

2763 2764 2765 2766 2767 2768 2769 2770
	/*
	 * Flushing deferred I/Os must be done after targets are resumed
	 * so that mapping of targets can work correctly.
	 * Request-based dm is queueing the deferred I/Os in its request_queue.
	 */
	if (dm_request_based(md))
		start_queue(md->queue);

2771 2772 2773 2774
	unlock_fs(md);

	clear_bit(DMF_SUSPENDED, &md->flags);

L
Linus Torvalds 已提交
2775
	dm_table_unplug_all(map);
2776 2777 2778
	r = 0;
out:
	dm_table_put(map);
2779
	mutex_unlock(&md->suspend_lock);
2780

2781
	return r;
L
Linus Torvalds 已提交
2782 2783 2784 2785 2786
}

/*-----------------------------------------------------------------
 * Event notification.
 *---------------------------------------------------------------*/
2787
int dm_kobject_uevent(struct mapped_device *md, enum kobject_action action,
M
Milan Broz 已提交
2788
		       unsigned cookie)
2789
{
M
Milan Broz 已提交
2790 2791 2792 2793
	char udev_cookie[DM_COOKIE_LENGTH];
	char *envp[] = { udev_cookie, NULL };

	if (!cookie)
2794
		return kobject_uevent(&disk_to_dev(md->disk)->kobj, action);
M
Milan Broz 已提交
2795 2796 2797
	else {
		snprintf(udev_cookie, DM_COOKIE_LENGTH, "%s=%u",
			 DM_COOKIE_ENV_VAR_NAME, cookie);
2798 2799
		return kobject_uevent_env(&disk_to_dev(md->disk)->kobj,
					  action, envp);
M
Milan Broz 已提交
2800
	}
2801 2802
}

M
Mike Anderson 已提交
2803 2804 2805 2806 2807
uint32_t dm_next_uevent_seq(struct mapped_device *md)
{
	return atomic_add_return(1, &md->uevent_seq);
}

L
Linus Torvalds 已提交
2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818
uint32_t dm_get_event_nr(struct mapped_device *md)
{
	return atomic_read(&md->event_nr);
}

int dm_wait_event(struct mapped_device *md, int event_nr)
{
	return wait_event_interruptible(md->eventq,
			(event_nr != atomic_read(&md->event_nr)));
}

M
Mike Anderson 已提交
2819 2820 2821 2822 2823 2824 2825 2826 2827
void dm_uevent_add(struct mapped_device *md, struct list_head *elist)
{
	unsigned long flags;

	spin_lock_irqsave(&md->uevent_lock, flags);
	list_add(elist, &md->uevent_list);
	spin_unlock_irqrestore(&md->uevent_lock, flags);
}

L
Linus Torvalds 已提交
2828 2829 2830 2831 2832 2833 2834 2835 2836
/*
 * The gendisk is only valid as long as you have a reference
 * count on 'md'.
 */
struct gendisk *dm_disk(struct mapped_device *md)
{
	return md->disk;
}

M
Milan Broz 已提交
2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853
struct kobject *dm_kobject(struct mapped_device *md)
{
	return &md->kobj;
}

/*
 * struct mapped_device should not be exported outside of dm.c
 * so use this check to verify that kobj is part of md structure
 */
struct mapped_device *dm_get_from_kobject(struct kobject *kobj)
{
	struct mapped_device *md;

	md = container_of(kobj, struct mapped_device, kobj);
	if (&md->kobj != kobj)
		return NULL;

2854
	if (test_bit(DMF_FREEING, &md->flags) ||
M
Mike Anderson 已提交
2855
	    dm_deleting_md(md))
2856 2857
		return NULL;

M
Milan Broz 已提交
2858 2859 2860 2861
	dm_get(md);
	return md;
}

2862
int dm_suspended_md(struct mapped_device *md)
L
Linus Torvalds 已提交
2863 2864 2865 2866
{
	return test_bit(DMF_SUSPENDED, &md->flags);
}

2867 2868
int dm_suspended(struct dm_target *ti)
{
2869
	return dm_suspended_md(dm_table_get_md(ti->table));
2870 2871 2872
}
EXPORT_SYMBOL_GPL(dm_suspended);

2873 2874
int dm_noflush_suspending(struct dm_target *ti)
{
2875
	return __noflush_suspending(dm_table_get_md(ti->table));
2876 2877 2878
}
EXPORT_SYMBOL_GPL(dm_noflush_suspending);

K
Kiyoshi Ueda 已提交
2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933
struct dm_md_mempools *dm_alloc_md_mempools(unsigned type)
{
	struct dm_md_mempools *pools = kmalloc(sizeof(*pools), GFP_KERNEL);

	if (!pools)
		return NULL;

	pools->io_pool = (type == DM_TYPE_BIO_BASED) ?
			 mempool_create_slab_pool(MIN_IOS, _io_cache) :
			 mempool_create_slab_pool(MIN_IOS, _rq_bio_info_cache);
	if (!pools->io_pool)
		goto free_pools_and_out;

	pools->tio_pool = (type == DM_TYPE_BIO_BASED) ?
			  mempool_create_slab_pool(MIN_IOS, _tio_cache) :
			  mempool_create_slab_pool(MIN_IOS, _rq_tio_cache);
	if (!pools->tio_pool)
		goto free_io_pool_and_out;

	pools->bs = (type == DM_TYPE_BIO_BASED) ?
		    bioset_create(16, 0) : bioset_create(MIN_IOS, 0);
	if (!pools->bs)
		goto free_tio_pool_and_out;

	return pools;

free_tio_pool_and_out:
	mempool_destroy(pools->tio_pool);

free_io_pool_and_out:
	mempool_destroy(pools->io_pool);

free_pools_and_out:
	kfree(pools);

	return NULL;
}

void dm_free_md_mempools(struct dm_md_mempools *pools)
{
	if (!pools)
		return;

	if (pools->io_pool)
		mempool_destroy(pools->io_pool);

	if (pools->tio_pool)
		mempool_destroy(pools->tio_pool);

	if (pools->bs)
		bioset_free(pools->bs);

	kfree(pools);
}

2934
static const struct block_device_operations dm_blk_dops = {
L
Linus Torvalds 已提交
2935 2936
	.open = dm_blk_open,
	.release = dm_blk_close,
2937
	.ioctl = dm_blk_ioctl,
D
Darrick J. Wong 已提交
2938
	.getgeo = dm_blk_getgeo,
L
Linus Torvalds 已提交
2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954
	.owner = THIS_MODULE
};

EXPORT_SYMBOL(dm_get_mapinfo);

/*
 * module hooks
 */
module_init(dm_init);
module_exit(dm_exit);

module_param(major, uint, 0);
MODULE_PARM_DESC(major, "The major number of the device mapper");
MODULE_DESCRIPTION(DM_NAME " driver");
MODULE_AUTHOR("Joe Thornber <dm-devel@redhat.com>");
MODULE_LICENSE("GPL");