dm.c 60.3 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 18 19 20
#include <linux/moduleparam.h>
#include <linux/blkpg.h>
#include <linux/bio.h>
#include <linux/buffer_head.h>
#include <linux/mempool.h>
#include <linux/slab.h>
#include <linux/idr.h>
D
Darrick J. Wong 已提交
21
#include <linux/hdreg.h>
22 23

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

25 26
#define DM_MSG_PREFIX "core"

M
Milan Broz 已提交
27 28 29 30 31 32 33
/*
 * 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 已提交
34 35 36 37 38
static const char *_name = DM_NAME;

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

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

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

K
Kiyoshi Ueda 已提交
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
/*
 * 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;
82
	struct dm_rq_target_io *tio;
K
Kiyoshi Ueda 已提交
83 84
};

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

92 93 94 95 96 97 98 99
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);

100 101
#define MINOR_ALLOCED ((void *)-1)

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

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

	unsigned long flags;

125
	struct request_queue *queue;
L
Linus Torvalds 已提交
126
	struct gendisk *disk;
M
Mike Anderson 已提交
127
	char name[16];
L
Linus Torvalds 已提交
128 129 130 131 132 133

	void *interface_ptr;

	/*
	 * A list of ios that arrived while we were suspended.
	 */
134
	atomic_t pending[2];
L
Linus Torvalds 已提交
135
	wait_queue_head_t wait;
136
	struct work_struct work;
K
Kiyoshi Ueda 已提交
137
	struct bio_list deferred;
138
	spinlock_t deferred_lock;
L
Linus Torvalds 已提交
139

140 141 142 143 144
	/*
	 * An error from the barrier request currently being processed.
	 */
	int barrier_error;

145 146 147 148 149 150
	/*
	 * Protect barrier_error from concurrent endio processing
	 * in request-based dm.
	 */
	spinlock_t barrier_error_lock;

151 152 153 154
	/*
	 * Processing queue (flush/barriers)
	 */
	struct workqueue_struct *wq;
155 156 157 158
	struct work_struct barrier_work;

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

L
Linus Torvalds 已提交
160 161 162 163 164 165 166 167 168 169 170
	/*
	 * The current mapping.
	 */
	struct dm_table *map;

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

S
Stefan Bader 已提交
171 172
	struct bio_set *bs;

L
Linus Torvalds 已提交
173 174 175 176 177
	/*
	 * Event handling.
	 */
	atomic_t event_nr;
	wait_queue_head_t eventq;
M
Mike Anderson 已提交
178 179 180
	atomic_t uevent_seq;
	struct list_head uevent_list;
	spinlock_t uevent_lock; /* Protect access to uevent_list */
L
Linus Torvalds 已提交
181 182 183 184 185

	/*
	 * freeze/thaw support require holding onto a super block
	 */
	struct super_block *frozen_sb;
186
	struct block_device *bdev;
D
Darrick J. Wong 已提交
187 188 189

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

191 192 193
	/* For saving the address of __make_request for request based dm */
	make_request_fn *saved_make_request_fn;

M
Milan Broz 已提交
194 195
	/* sysfs handle */
	struct kobject kobj;
196 197 198

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

K
Kiyoshi Ueda 已提交
201 202 203 204 205 206 207 208 209
/*
 * 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 已提交
210
#define MIN_IOS 256
211 212
static struct kmem_cache *_io_cache;
static struct kmem_cache *_tio_cache;
K
Kiyoshi Ueda 已提交
213 214
static struct kmem_cache *_rq_tio_cache;
static struct kmem_cache *_rq_bio_info_cache;
L
Linus Torvalds 已提交
215 216 217

static int __init local_init(void)
{
K
Kiyoshi Ueda 已提交
218
	int r = -ENOMEM;
L
Linus Torvalds 已提交
219 220

	/* allocate a slab for the dm_ios */
A
Alasdair G Kergon 已提交
221
	_io_cache = KMEM_CACHE(dm_io, 0);
L
Linus Torvalds 已提交
222
	if (!_io_cache)
K
Kiyoshi Ueda 已提交
223
		return r;
L
Linus Torvalds 已提交
224 225

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

K
Kiyoshi Ueda 已提交
230 231 232 233 234 235 236 237
	_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 已提交
238
	r = dm_uevent_init();
K
Kiyoshi Ueda 已提交
239
	if (r)
K
Kiyoshi Ueda 已提交
240
		goto out_free_rq_bio_info_cache;
M
Mike Anderson 已提交
241

L
Linus Torvalds 已提交
242 243
	_major = major;
	r = register_blkdev(_major, _name);
K
Kiyoshi Ueda 已提交
244 245
	if (r < 0)
		goto out_uevent_exit;
L
Linus Torvalds 已提交
246 247 248 249 250

	if (!_major)
		_major = r;

	return 0;
K
Kiyoshi Ueda 已提交
251 252 253

out_uevent_exit:
	dm_uevent_exit();
K
Kiyoshi Ueda 已提交
254 255 256 257
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 已提交
258 259 260 261 262 263
out_free_tio_cache:
	kmem_cache_destroy(_tio_cache);
out_free_io_cache:
	kmem_cache_destroy(_io_cache);

	return r;
L
Linus Torvalds 已提交
264 265 266 267
}

static void local_exit(void)
{
K
Kiyoshi Ueda 已提交
268 269
	kmem_cache_destroy(_rq_bio_info_cache);
	kmem_cache_destroy(_rq_tio_cache);
L
Linus Torvalds 已提交
270 271
	kmem_cache_destroy(_tio_cache);
	kmem_cache_destroy(_io_cache);
272
	unregister_blkdev(_major, _name);
M
Mike Anderson 已提交
273
	dm_uevent_exit();
L
Linus Torvalds 已提交
274 275 276 277 278 279

	_major = 0;

	DMINFO("cleaned up");
}

280
static int (*_inits[])(void) __initdata = {
L
Linus Torvalds 已提交
281 282 283 284
	local_init,
	dm_target_init,
	dm_linear_init,
	dm_stripe_init,
M
Mikulas Patocka 已提交
285
	dm_io_init,
286
	dm_kcopyd_init,
L
Linus Torvalds 已提交
287 288 289
	dm_interface_init,
};

290
static void (*_exits[])(void) = {
L
Linus Torvalds 已提交
291 292 293 294
	local_exit,
	dm_target_exit,
	dm_linear_exit,
	dm_stripe_exit,
M
Mikulas Patocka 已提交
295
	dm_io_exit,
296
	dm_kcopyd_exit,
L
Linus Torvalds 已提交
297 298 299 300 301 302 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
	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
 */
A
Al Viro 已提交
332
static int dm_blk_open(struct block_device *bdev, fmode_t mode)
L
Linus Torvalds 已提交
333 334 335
{
	struct mapped_device *md;

J
Jeff Mahoney 已提交
336 337
	spin_lock(&_minor_lock);

A
Al Viro 已提交
338
	md = bdev->bd_disk->private_data;
J
Jeff Mahoney 已提交
339 340 341
	if (!md)
		goto out;

342 343
	if (test_bit(DMF_FREEING, &md->flags) ||
	    test_bit(DMF_DELETING, &md->flags)) {
J
Jeff Mahoney 已提交
344 345 346 347
		md = NULL;
		goto out;
	}

L
Linus Torvalds 已提交
348
	dm_get(md);
349
	atomic_inc(&md->open_count);
J
Jeff Mahoney 已提交
350 351 352 353 354

out:
	spin_unlock(&_minor_lock);

	return md ? 0 : -ENXIO;
L
Linus Torvalds 已提交
355 356
}

A
Al Viro 已提交
357
static int dm_blk_close(struct gendisk *disk, fmode_t mode)
L
Linus Torvalds 已提交
358
{
A
Al Viro 已提交
359
	struct mapped_device *md = disk->private_data;
360
	atomic_dec(&md->open_count);
L
Linus Torvalds 已提交
361 362 363 364
	dm_put(md);
	return 0;
}

365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
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 已提交
389 390 391 392 393 394 395
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 已提交
396
static int dm_blk_ioctl(struct block_device *bdev, fmode_t mode,
397 398
			unsigned int cmd, unsigned long arg)
{
A
Al Viro 已提交
399
	struct mapped_device *md = bdev->bd_disk->private_data;
400
	struct dm_table *map = dm_get_live_table(md);
401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418
	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);

	if (dm_suspended(md)) {
		r = -EAGAIN;
		goto out;
	}

	if (tgt->type->ioctl)
419
		r = tgt->type->ioctl(tgt, cmd, arg);
420 421 422 423 424 425 426

out:
	dm_table_put(map);

	return r;
}

A
Alasdair G Kergon 已提交
427
static struct dm_io *alloc_io(struct mapped_device *md)
L
Linus Torvalds 已提交
428 429 430 431
{
	return mempool_alloc(md->io_pool, GFP_NOIO);
}

A
Alasdair G Kergon 已提交
432
static void free_io(struct mapped_device *md, struct dm_io *io)
L
Linus Torvalds 已提交
433 434 435 436
{
	mempool_free(io, md->io_pool);
}

A
Alasdair G Kergon 已提交
437
static void free_tio(struct mapped_device *md, struct dm_target_io *tio)
L
Linus Torvalds 已提交
438 439 440 441
{
	mempool_free(tio, md->tio_pool);
}

K
Kiyoshi Ueda 已提交
442 443
static struct dm_rq_target_io *alloc_rq_tio(struct mapped_device *md,
					    gfp_t gfp_mask)
444
{
K
Kiyoshi Ueda 已提交
445
	return mempool_alloc(md->tio_pool, gfp_mask);
446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462
}

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 已提交
463 464 465 466 467 468
static int md_in_flight(struct mapped_device *md)
{
	return atomic_read(&md->pending[READ]) +
	       atomic_read(&md->pending[WRITE]);
}

469 470 471
static void start_io_acct(struct dm_io *io)
{
	struct mapped_device *md = io->md;
T
Tejun Heo 已提交
472
	int cpu;
473
	int rw = bio_data_dir(io->bio);
474 475 476

	io->start_time = jiffies;

T
Tejun Heo 已提交
477 478 479
	cpu = part_stat_lock();
	part_round_stats(cpu, &dm_disk(md)->part0);
	part_stat_unlock();
480
	dm_disk(md)->part0.in_flight[rw] = atomic_inc_return(&md->pending[rw]);
481 482
}

483
static void end_io_acct(struct dm_io *io)
484 485 486 487
{
	struct mapped_device *md = io->md;
	struct bio *bio = io->bio;
	unsigned long duration = jiffies - io->start_time;
T
Tejun Heo 已提交
488
	int pending, cpu;
489 490
	int rw = bio_data_dir(bio);

T
Tejun Heo 已提交
491 492 493 494
	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();
495

496 497 498 499
	/*
	 * After this is decremented the bio must not be touched if it is
	 * a barrier.
	 */
500 501 502
	dm_disk(md)->part0.in_flight[rw] = pending =
		atomic_dec_return(&md->pending[rw]);
	pending += atomic_read(&md->pending[rw^0x1]);
503

504 505 506
	/* nudge anyone waiting on suspend queue */
	if (!pending)
		wake_up(&md->wait);
507 508
}

L
Linus Torvalds 已提交
509 510 511
/*
 * Add the bio to the list of deferred io.
 */
M
Mikulas Patocka 已提交
512
static void queue_io(struct mapped_device *md, struct bio *bio)
L
Linus Torvalds 已提交
513
{
514
	down_write(&md->io_lock);
L
Linus Torvalds 已提交
515

516
	spin_lock_irq(&md->deferred_lock);
L
Linus Torvalds 已提交
517
	bio_list_add(&md->deferred, bio);
518
	spin_unlock_irq(&md->deferred_lock);
L
Linus Torvalds 已提交
519

M
Mikulas Patocka 已提交
520 521 522
	if (!test_and_set_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags))
		queue_work(md->wq, &md->work);

523
	up_write(&md->io_lock);
L
Linus Torvalds 已提交
524 525 526 527 528 529 530
}

/*
 * 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.
 */
531
struct dm_table *dm_get_live_table(struct mapped_device *md)
L
Linus Torvalds 已提交
532 533
{
	struct dm_table *t;
534
	unsigned long flags;
L
Linus Torvalds 已提交
535

536
	read_lock_irqsave(&md->map_lock, flags);
L
Linus Torvalds 已提交
537 538 539
	t = md->map;
	if (t)
		dm_table_get(t);
540
	read_unlock_irqrestore(&md->map_lock, flags);
L
Linus Torvalds 已提交
541 542 543 544

	return t;
}

D
Darrick J. Wong 已提交
545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571
/*
 * 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 已提交
572 573 574 575 576 577 578 579 580
/*-----------------------------------------------------------------
 * 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.
 *---------------------------------------------------------------*/

581 582 583 584 585
static int __noflush_suspending(struct mapped_device *md)
{
	return test_bit(DMF_NOFLUSH_SUSPENDING, &md->flags);
}

L
Linus Torvalds 已提交
586 587 588 589
/*
 * Decrements the number of outstanding ios that a bio has been
 * cloned into, completing the original io if necc.
 */
590
static void dec_pending(struct dm_io *io, int error)
L
Linus Torvalds 已提交
591
{
592
	unsigned long flags;
593 594 595
	int io_error;
	struct bio *bio;
	struct mapped_device *md = io->md;
596 597

	/* Push-back supersedes any I/O errors */
598 599 600 601 602 603
	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 已提交
604 605

	if (atomic_dec_and_test(&io->io_count)) {
606 607 608 609
		if (io->error == DM_ENDIO_REQUEUE) {
			/*
			 * Target requested pushing back the I/O.
			 */
610
			spin_lock_irqsave(&md->deferred_lock, flags);
611
			if (__noflush_suspending(md)) {
612
				if (!bio_rw_flagged(io->bio, BIO_RW_BARRIER))
613 614 615
					bio_list_add_head(&md->deferred,
							  io->bio);
			} else
616 617
				/* noflush suspend was interrupted. */
				io->error = -EIO;
618
			spin_unlock_irqrestore(&md->deferred_lock, flags);
619 620
		}

621 622
		io_error = io->error;
		bio = io->bio;
623

624
		if (bio_rw_flagged(bio, BIO_RW_BARRIER)) {
625 626 627 628 629
			/*
			 * 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
			 */
630
			if (!md->barrier_error && io_error != -EOPNOTSUPP)
631
				md->barrier_error = io_error;
632 633 634
			end_io_acct(io);
		} else {
			end_io_acct(io);
635

636 637
			if (io_error != DM_ENDIO_REQUEUE) {
				trace_block_bio_complete(md->queue, bio);
638

639 640
				bio_endio(bio, io_error);
			}
641
		}
642 643

		free_io(md, io);
L
Linus Torvalds 已提交
644 645 646
	}
}

647
static void clone_endio(struct bio *bio, int error)
L
Linus Torvalds 已提交
648 649
{
	int r = 0;
A
Alasdair G Kergon 已提交
650
	struct dm_target_io *tio = bio->bi_private;
651
	struct dm_io *io = tio->io;
S
Stefan Bader 已提交
652
	struct mapped_device *md = tio->io->md;
L
Linus Torvalds 已提交
653 654 655 656 657 658 659
	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);
660 661 662 663 664
		if (r < 0 || r == DM_ENDIO_REQUEUE)
			/*
			 * error and requeue request are handled
			 * in dec_pending().
			 */
L
Linus Torvalds 已提交
665
			error = r;
666 667
		else if (r == DM_ENDIO_INCOMPLETE)
			/* The target will handle the io */
668
			return;
669 670 671 672
		else if (r) {
			DMWARN("unimplemented target endio return value: %d", r);
			BUG();
		}
L
Linus Torvalds 已提交
673 674
	}

S
Stefan Bader 已提交
675 676 677 678 679 680
	/*
	 * Store md for cleanup instead of tio which is about to get freed.
	 */
	bio->bi_private = md->bs;

	free_tio(md, tio);
681 682
	bio_put(bio);
	dec_pending(io, error);
L
Linus Torvalds 已提交
683 684
}

685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 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
/*
 * 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);
}

735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751
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);
}

752 753 754 755 756
/*
 * 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.
 */
757
static void rq_completed(struct mapped_device *md, int rw, int run_queue)
758
{
759
	atomic_dec(&md->pending[rw]);
760 761

	/* nudge anyone waiting on suspend queue */
762
	if (!md_in_flight(md))
763 764 765
		wake_up(&md->wait);

	if (run_queue)
766
		blk_run_queue(md->queue);
767 768 769 770 771 772 773

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

774 775 776 777 778 779 780 781
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 已提交
782 783 784 785 786 787 788
/*
 * 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);
789 790
	int run_queue = 1;
	bool is_barrier = blk_barrier_rq(clone);
K
Kiyoshi Ueda 已提交
791 792 793 794
	struct dm_rq_target_io *tio = clone->end_io_data;
	struct mapped_device *md = tio->md;
	struct request *rq = tio->orig;

795
	if (blk_pc_request(rq) && !is_barrier) {
K
Kiyoshi Ueda 已提交
796 797 798 799 800 801 802 803 804 805 806 807 808 809
		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);

810 811 812 813 814 815
	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 已提交
816

817
	rq_completed(md, rw, run_queue);
K
Kiyoshi Ueda 已提交
818 819
}

820 821 822 823 824 825 826
static void dm_unprep_request(struct request *rq)
{
	struct request *clone = rq->special;

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

827
	free_rq_clone(clone);
828 829 830 831 832 833 834
}

/*
 * Requeue the original request of a clone.
 */
void dm_requeue_unmapped_request(struct request *clone)
{
835
	int rw = rq_data_dir(clone);
836 837 838 839 840 841
	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;

842 843 844 845 846 847 848 849 850 851
	if (unlikely(blk_barrier_rq(clone))) {
		/*
		 * 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;
	}

852 853 854 855 856 857 858 859
	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);

860
	rq_completed(md, rw, 0);
861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892
}
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);
}

893
static void dm_done(struct request *clone, int error, bool mapped)
894
{
895
	int r = error;
896 897 898
	struct dm_rq_target_io *tio = clone->end_io_data;
	dm_request_endio_fn rq_end_io = tio->ti->type->rq_end_io;

899 900
	if (mapped && rq_end_io)
		r = rq_end_io(tio->ti, clone, error, &tio->info);
901

902
	if (r <= 0)
903
		/* The target wants to complete the I/O */
904 905
		dm_end_request(clone, r);
	else if (r == DM_ENDIO_INCOMPLETE)
906 907
		/* The target will handle the I/O */
		return;
908
	else if (r == DM_ENDIO_REQUEUE)
909 910 911
		/* The target wants to requeue the I/O */
		dm_requeue_unmapped_request(clone);
	else {
912
		DMWARN("unimplemented target endio return value: %d", r);
913 914 915 916
		BUG();
	}
}

917 918 919 920 921 922 923 924 925 926 927 928 929 930 931
/*
 * 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);
}

932 933 934 935 936 937 938 939 940
/*
 * 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;

941 942 943 944 945 946 947 948 949 950 951 952 953
	if (unlikely(blk_barrier_rq(clone))) {
		/*
		 * 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;
	}

954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969
	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;

970 971 972 973 974 975 976 977 978 979 980
	if (unlikely(blk_barrier_rq(clone))) {
		/*
		 * 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;
	}

981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009
	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);
}

L
Linus Torvalds 已提交
1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030
static sector_t max_io_len(struct mapped_device *md,
			   sector_t sector, struct dm_target *ti)
{
	sector_t offset = sector - ti->begin;
	sector_t len = ti->len - offset;

	/*
	 * Does the target need to split even further ?
	 */
	if (ti->split_io) {
		sector_t boundary;
		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 已提交
1031
		      struct dm_target_io *tio)
L
Linus Torvalds 已提交
1032 1033
{
	int r;
1034
	sector_t sector;
S
Stefan Bader 已提交
1035
	struct mapped_device *md;
L
Linus Torvalds 已提交
1036 1037 1038 1039 1040 1041 1042 1043 1044 1045

	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);
1046
	sector = clone->bi_sector;
L
Linus Torvalds 已提交
1047
	r = ti->type->map(ti, clone, &tio->info);
1048
	if (r == DM_MAPIO_REMAPPED) {
L
Linus Torvalds 已提交
1049
		/* the bio has been remapped so dispatch it */
1050

1051
		trace_block_remap(bdev_get_queue(clone->bi_bdev), clone,
1052
				    tio->io->bio->bi_bdev->bd_dev, sector);
1053

L
Linus Torvalds 已提交
1054
		generic_make_request(clone);
1055 1056
	} else if (r < 0 || r == DM_MAPIO_REQUEUE) {
		/* error the io and bail out, or requeue it if needed */
S
Stefan Bader 已提交
1057 1058 1059 1060 1061 1062
		md = tio->io->md;
		dec_pending(tio->io, r);
		/*
		 * Store bio_set for cleanup.
		 */
		clone->bi_private = md->bs;
L
Linus Torvalds 已提交
1063
		bio_put(clone);
S
Stefan Bader 已提交
1064
		free_tio(md, tio);
1065 1066 1067
	} else if (r) {
		DMWARN("unimplemented target map return value: %d", r);
		BUG();
L
Linus Torvalds 已提交
1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080
	}
}

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 已提交
1081 1082
static void dm_bio_destructor(struct bio *bio)
{
S
Stefan Bader 已提交
1083 1084 1085
	struct bio_set *bs = bio->bi_private;

	bio_free(bio, bs);
P
Peter Osterlund 已提交
1086 1087
}

L
Linus Torvalds 已提交
1088 1089 1090 1091 1092
/*
 * 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 已提交
1093
			      unsigned int len, struct bio_set *bs)
L
Linus Torvalds 已提交
1094 1095 1096 1097
{
	struct bio *clone;
	struct bio_vec *bv = bio->bi_io_vec + idx;

S
Stefan Bader 已提交
1098
	clone = bio_alloc_bioset(GFP_NOIO, 1, bs);
P
Peter Osterlund 已提交
1099
	clone->bi_destructor = dm_bio_destructor;
L
Linus Torvalds 已提交
1100 1101 1102 1103
	*clone->bi_io_vec = *bv;

	clone->bi_sector = sector;
	clone->bi_bdev = bio->bi_bdev;
1104
	clone->bi_rw = bio->bi_rw & ~(1 << BIO_RW_BARRIER);
L
Linus Torvalds 已提交
1105 1106 1107 1108
	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 已提交
1109
	clone->bi_flags |= 1 << BIO_CLONED;
L
Linus Torvalds 已提交
1110

M
Martin K. Petersen 已提交
1111
	if (bio_integrity(bio)) {
1112
		bio_integrity_clone(clone, bio, GFP_NOIO, bs);
M
Martin K. Petersen 已提交
1113 1114 1115 1116
		bio_integrity_trim(clone,
				   bio_sector_offset(bio, idx, offset), len);
	}

L
Linus Torvalds 已提交
1117 1118 1119 1120 1121 1122 1123 1124
	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 已提交
1125
			     unsigned int len, struct bio_set *bs)
L
Linus Torvalds 已提交
1126 1127 1128
{
	struct bio *clone;

S
Stefan Bader 已提交
1129 1130
	clone = bio_alloc_bioset(GFP_NOIO, bio->bi_max_vecs, bs);
	__bio_clone(clone, bio);
1131
	clone->bi_rw &= ~(1 << BIO_RW_BARRIER);
S
Stefan Bader 已提交
1132
	clone->bi_destructor = dm_bio_destructor;
L
Linus Torvalds 已提交
1133 1134 1135 1136 1137 1138
	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 已提交
1139
	if (bio_integrity(bio)) {
1140
		bio_integrity_clone(clone, bio, GFP_NOIO, bs);
M
Martin K. Petersen 已提交
1141 1142 1143 1144 1145 1146

		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 已提交
1147 1148 1149
	return clone;
}

1150 1151
static struct dm_target_io *alloc_tio(struct clone_info *ci,
				      struct dm_target *ti)
1152
{
1153
	struct dm_target_io *tio = mempool_alloc(ci->md->tio_pool, GFP_NOIO);
1154 1155 1156 1157

	tio->io = ci->io;
	tio->ti = ti;
	memset(&tio->info, 0, sizeof(tio->info));
1158 1159 1160 1161 1162 1163 1164 1165 1166 1167

	return tio;
}

static void __flush_target(struct clone_info *ci, struct dm_target *ti,
			  unsigned flush_nr)
{
	struct dm_target_io *tio = alloc_tio(ci, ti);
	struct bio *clone;

1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191
	tio->info.flush_request = flush_nr;

	clone = bio_alloc_bioset(GFP_NOIO, 0, ci->md->bs);
	__bio_clone(clone, ci->bio);
	clone->bi_destructor = dm_bio_destructor;

	__map_bio(ti, clone, tio);
}

static int __clone_and_map_empty_barrier(struct clone_info *ci)
{
	unsigned target_nr = 0, flush_nr;
	struct dm_target *ti;

	while ((ti = dm_table_get_target(ci->map, target_nr++)))
		for (flush_nr = 0; flush_nr < ti->num_flush_requests;
		     flush_nr++)
			__flush_target(ci, ti, flush_nr);

	ci->sector_count = 0;

	return 0;
}

1192
static int __clone_and_map(struct clone_info *ci)
L
Linus Torvalds 已提交
1193 1194
{
	struct bio *clone, *bio = ci->bio;
1195 1196
	struct dm_target *ti;
	sector_t len = 0, max;
A
Alasdair G Kergon 已提交
1197
	struct dm_target_io *tio;
L
Linus Torvalds 已提交
1198

1199 1200 1201
	if (unlikely(bio_empty_barrier(bio)))
		return __clone_and_map_empty_barrier(ci);

1202 1203 1204 1205 1206 1207
	ti = dm_table_find_target(ci->map, ci->sector);
	if (!dm_target_is_valid(ti))
		return -EIO;

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

L
Linus Torvalds 已提交
1208 1209 1210
	/*
	 * Allocate a target io object.
	 */
1211
	tio = alloc_tio(ci, ti);
L
Linus Torvalds 已提交
1212 1213 1214 1215 1216 1217 1218

	if (ci->sector_count <= max) {
		/*
		 * Optimise for the simple case where we can do all of
		 * the remaining io with a single clone.
		 */
		clone = clone_bio(bio, ci->sector, ci->idx,
S
Stefan Bader 已提交
1219 1220
				  bio->bi_vcnt - ci->idx, ci->sector_count,
				  ci->md->bs);
L
Linus Torvalds 已提交
1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242
		__map_bio(ti, clone, tio);
		ci->sector_count = 0;

	} 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;
		}

S
Stefan Bader 已提交
1243 1244
		clone = clone_bio(bio, ci->sector, ci->idx, i - ci->idx, len,
				  ci->md->bs);
L
Linus Torvalds 已提交
1245 1246 1247 1248 1249 1250 1251 1252
		__map_bio(ti, clone, tio);

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

	} else {
		/*
1253
		 * Handle a bvec that must be split between two or more targets.
L
Linus Torvalds 已提交
1254 1255
		 */
		struct bio_vec *bv = bio->bi_io_vec + ci->idx;
1256 1257
		sector_t remaining = to_sector(bv->bv_len);
		unsigned int offset = 0;
L
Linus Torvalds 已提交
1258

1259 1260 1261
		do {
			if (offset) {
				ti = dm_table_find_target(ci->map, ci->sector);
1262 1263 1264
				if (!dm_target_is_valid(ti))
					return -EIO;

1265
				max = max_io_len(ci->md, ci->sector, ti);
L
Linus Torvalds 已提交
1266

1267
				tio = alloc_tio(ci, ti);
1268 1269 1270 1271 1272
			}

			len = min(remaining, max);

			clone = split_bvec(bio, ci->sector, ci->idx,
S
Stefan Bader 已提交
1273 1274
					   bv->bv_offset + offset, len,
					   ci->md->bs);
1275 1276 1277 1278 1279 1280 1281

			__map_bio(ti, clone, tio);

			ci->sector += len;
			ci->sector_count -= len;
			offset += to_bytes(len);
		} while (remaining -= len);
L
Linus Torvalds 已提交
1282 1283 1284

		ci->idx++;
	}
1285 1286

	return 0;
L
Linus Torvalds 已提交
1287 1288 1289
}

/*
M
Mikulas Patocka 已提交
1290
 * Split the bio into several clones and submit it to targets.
L
Linus Torvalds 已提交
1291
 */
1292
static void __split_and_process_bio(struct mapped_device *md, struct bio *bio)
L
Linus Torvalds 已提交
1293 1294
{
	struct clone_info ci;
1295
	int error = 0;
L
Linus Torvalds 已提交
1296

1297
	ci.map = dm_get_live_table(md);
1298
	if (unlikely(!ci.map)) {
1299
		if (!bio_rw_flagged(bio, BIO_RW_BARRIER))
1300 1301
			bio_io_error(bio);
		else
1302 1303
			if (!md->barrier_error)
				md->barrier_error = -EIO;
1304 1305
		return;
	}
1306

L
Linus Torvalds 已提交
1307 1308 1309 1310 1311 1312 1313
	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;
1314
	spin_lock_init(&ci.io->endio_lock);
L
Linus Torvalds 已提交
1315 1316
	ci.sector = bio->bi_sector;
	ci.sector_count = bio_sectors(bio);
1317 1318
	if (unlikely(bio_empty_barrier(bio)))
		ci.sector_count = 1;
L
Linus Torvalds 已提交
1319 1320
	ci.idx = bio->bi_idx;

1321
	start_io_acct(ci.io);
1322 1323
	while (ci.sector_count && !error)
		error = __clone_and_map(&ci);
L
Linus Torvalds 已提交
1324 1325

	/* drop the extra reference count */
1326
	dec_pending(ci.io, error);
L
Linus Torvalds 已提交
1327 1328 1329 1330 1331 1332
	dm_table_put(ci.map);
}
/*-----------------------------------------------------------------
 * CRUD END
 *---------------------------------------------------------------*/

M
Milan Broz 已提交
1333 1334 1335 1336 1337
static int dm_merge_bvec(struct request_queue *q,
			 struct bvec_merge_data *bvm,
			 struct bio_vec *biovec)
{
	struct mapped_device *md = q->queuedata;
1338
	struct dm_table *map = dm_get_live_table(md);
M
Milan Broz 已提交
1339 1340
	struct dm_target *ti;
	sector_t max_sectors;
1341
	int max_size = 0;
M
Milan Broz 已提交
1342 1343

	if (unlikely(!map))
1344
		goto out;
M
Milan Broz 已提交
1345 1346

	ti = dm_table_find_target(map, bvm->bi_sector);
1347 1348
	if (!dm_target_is_valid(ti))
		goto out_table;
M
Milan Broz 已提交
1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365

	/*
	 * Find maximum amount of I/O that won't need splitting
	 */
	max_sectors = min(max_io_len(md, bvm->bi_sector, ti),
			  (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);
1366 1367 1368 1369 1370 1371 1372 1373 1374 1375
	/*
	 * 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 已提交
1376

1377
out_table:
1378 1379 1380
	dm_table_put(map);

out:
M
Milan Broz 已提交
1381 1382 1383 1384 1385 1386 1387 1388 1389
	/*
	 * 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 已提交
1390 1391 1392 1393
/*
 * The request function that just remaps the bio built up by
 * dm_merge_bvec.
 */
1394
static int _dm_request(struct request_queue *q, struct bio *bio)
L
Linus Torvalds 已提交
1395
{
1396
	int rw = bio_data_dir(bio);
L
Linus Torvalds 已提交
1397
	struct mapped_device *md = q->queuedata;
T
Tejun Heo 已提交
1398
	int cpu;
L
Linus Torvalds 已提交
1399

1400
	down_read(&md->io_lock);
L
Linus Torvalds 已提交
1401

T
Tejun Heo 已提交
1402 1403 1404 1405
	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();
1406

L
Linus Torvalds 已提交
1407
	/*
1408 1409
	 * If we're suspended or the thread is processing barriers
	 * we have to queue this io for later.
L
Linus Torvalds 已提交
1410
	 */
1411
	if (unlikely(test_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags)) ||
1412
	    unlikely(bio_rw_flagged(bio, BIO_RW_BARRIER))) {
1413
		up_read(&md->io_lock);
L
Linus Torvalds 已提交
1414

A
Alasdair G Kergon 已提交
1415 1416 1417 1418 1419
		if (unlikely(test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) &&
		    bio_rw(bio) == READA) {
			bio_io_error(bio);
			return 0;
		}
L
Linus Torvalds 已提交
1420

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

M
Mikulas Patocka 已提交
1423
		return 0;
L
Linus Torvalds 已提交
1424 1425
	}

1426
	__split_and_process_bio(md, bio);
1427
	up_read(&md->io_lock);
1428
	return 0;
L
Linus Torvalds 已提交
1429 1430
}

1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452
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);
}

1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471
/*
 * Mark this request as flush request, so that dm_request_fn() can
 * recognize.
 */
static void dm_rq_prepare_flush(struct request_queue *q, struct request *rq)
{
	rq->cmd_type = REQ_TYPE_LINUX_BLOCK;
	rq->cmd[0] = REQ_LB_OP_FLUSH;
}

static bool dm_rq_is_flush_request(struct request *rq)
{
	if (rq->cmd_type == REQ_TYPE_LINUX_BLOCK &&
	    rq->cmd[0] == REQ_LB_OP_FLUSH)
		return true;
	else
		return false;
}

1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516
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)
{
1517
	int r;
1518

1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533
	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;
	}
1534 1535 1536 1537 1538 1539 1540

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

	return 0;
}

K
Kiyoshi Ueda 已提交
1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566
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;
}

1567 1568 1569 1570 1571 1572 1573 1574
/*
 * 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;

1575 1576 1577
	if (unlikely(dm_rq_is_flush_request(rq)))
		return BLKPREP_OK;

1578 1579 1580 1581 1582
	if (unlikely(rq->special)) {
		DMWARN("Already has something in rq->special.");
		return BLKPREP_KILL;
	}

K
Kiyoshi Ueda 已提交
1583 1584
	clone = clone_rq(rq, md, GFP_ATOMIC);
	if (!clone)
1585 1586 1587 1588 1589 1590 1591 1592
		return BLKPREP_DEFER;

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

	return BLKPREP_OK;
}

1593
static void map_request(struct dm_target *ti, struct request *clone,
1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640
			struct mapped_device *md)
{
	int r;
	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 */
		dm_dispatch_request(clone);
		break;
	case DM_MAPIO_REQUEUE:
		/* The target wants to requeue the I/O */
		dm_requeue_unmapped_request(clone);
		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;
	}
}

/*
 * 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;
1641
	struct dm_table *map = dm_get_live_table(md);
1642
	struct dm_target *ti;
1643
	struct request *rq, *clone;
1644 1645

	/*
1646 1647 1648 1649
	 * 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().
1650 1651 1652 1653 1654 1655
	 */
	while (!blk_queue_plugged(q) && !blk_queue_stopped(q)) {
		rq = blk_peek_request(q);
		if (!rq)
			goto plug_and_out;

1656 1657 1658 1659 1660 1661 1662 1663
		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;
		}

1664 1665 1666 1667 1668
		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);
1669 1670 1671
		clone = rq->special;
		atomic_inc(&md->pending[rq_data_dir(clone)]);

1672
		spin_unlock(q->queue_lock);
1673
		map_request(ti, clone, md);
1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699
		spin_lock_irq(q->queue_lock);
	}

	goto out;

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;
1700
	struct dm_table *map = dm_get_live_table(md);
1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711

	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;
}

1712
static void dm_unplug_all(struct request_queue *q)
L
Linus Torvalds 已提交
1713 1714
{
	struct mapped_device *md = q->queuedata;
1715
	struct dm_table *map = dm_get_live_table(md);
L
Linus Torvalds 已提交
1716 1717

	if (map) {
1718 1719 1720
		if (dm_request_based(md))
			generic_unplug_device(q);

L
Linus Torvalds 已提交
1721 1722 1723 1724 1725 1726 1727
		dm_table_unplug_all(map);
		dm_table_put(map);
	}
}

static int dm_any_congested(void *congested_data, int bdi_bits)
{
1728 1729 1730
	int r = bdi_bits;
	struct mapped_device *md = congested_data;
	struct dm_table *map;
L
Linus Torvalds 已提交
1731

1732
	if (!test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) {
1733
		map = dm_get_live_table(md);
1734
		if (map) {
1735 1736 1737 1738 1739 1740 1741 1742 1743 1744
			/*
			 * 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);

1745 1746 1747 1748
			dm_table_put(map);
		}
	}

L
Linus Torvalds 已提交
1749 1750 1751 1752 1753 1754 1755 1756
	return r;
}

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

1757
static void free_minor(int minor)
L
Linus Torvalds 已提交
1758
{
1759
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
1760
	idr_remove(&_minor_idr, minor);
1761
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
1762 1763 1764 1765 1766
}

/*
 * See if the device with a specific minor # is free.
 */
1767
static int specific_minor(int minor)
L
Linus Torvalds 已提交
1768 1769 1770 1771 1772 1773
{
	int r, m;

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

J
Jeff Mahoney 已提交
1774 1775 1776 1777
	r = idr_pre_get(&_minor_idr, GFP_KERNEL);
	if (!r)
		return -ENOMEM;

1778
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
1779 1780 1781 1782 1783 1784

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

1785
	r = idr_get_new_above(&_minor_idr, MINOR_ALLOCED, minor, &m);
J
Jeff Mahoney 已提交
1786
	if (r)
L
Linus Torvalds 已提交
1787 1788 1789 1790 1791 1792 1793 1794 1795
		goto out;

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

out:
1796
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
1797 1798 1799
	return r;
}

1800
static int next_free_minor(int *minor)
L
Linus Torvalds 已提交
1801
{
1802
	int r, m;
L
Linus Torvalds 已提交
1803 1804

	r = idr_pre_get(&_minor_idr, GFP_KERNEL);
J
Jeff Mahoney 已提交
1805 1806 1807
	if (!r)
		return -ENOMEM;

1808
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
1809

1810
	r = idr_get_new(&_minor_idr, MINOR_ALLOCED, &m);
1811
	if (r)
L
Linus Torvalds 已提交
1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822
		goto out;

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

	*minor = m;

out:
1823
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
1824 1825 1826
	return r;
}

1827
static const struct block_device_operations dm_blk_dops;
L
Linus Torvalds 已提交
1828

1829
static void dm_wq_work(struct work_struct *work);
1830
static void dm_rq_barrier_work(struct work_struct *work);
1831

L
Linus Torvalds 已提交
1832 1833 1834
/*
 * Allocate and initialise a blank device with a given minor.
 */
1835
static struct mapped_device *alloc_dev(int minor)
L
Linus Torvalds 已提交
1836 1837
{
	int r;
1838
	struct mapped_device *md = kzalloc(sizeof(*md), GFP_KERNEL);
1839
	void *old_md;
L
Linus Torvalds 已提交
1840 1841 1842 1843 1844 1845

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

1846
	if (!try_module_get(THIS_MODULE))
M
Milan Broz 已提交
1847
		goto bad_module_get;
1848

L
Linus Torvalds 已提交
1849
	/* get a minor number for the dev */
1850
	if (minor == DM_ANY_MINOR)
1851
		r = next_free_minor(&minor);
1852
	else
1853
		r = specific_minor(minor);
L
Linus Torvalds 已提交
1854
	if (r < 0)
M
Milan Broz 已提交
1855
		goto bad_minor;
L
Linus Torvalds 已提交
1856

1857
	init_rwsem(&md->io_lock);
1858
	mutex_init(&md->suspend_lock);
1859
	spin_lock_init(&md->deferred_lock);
1860
	spin_lock_init(&md->barrier_error_lock);
L
Linus Torvalds 已提交
1861 1862
	rwlock_init(&md->map_lock);
	atomic_set(&md->holders, 1);
1863
	atomic_set(&md->open_count, 0);
L
Linus Torvalds 已提交
1864
	atomic_set(&md->event_nr, 0);
M
Mike Anderson 已提交
1865 1866 1867
	atomic_set(&md->uevent_seq, 0);
	INIT_LIST_HEAD(&md->uevent_list);
	spin_lock_init(&md->uevent_lock);
L
Linus Torvalds 已提交
1868

K
Kiyoshi Ueda 已提交
1869
	md->queue = blk_init_queue(dm_request_fn, NULL);
L
Linus Torvalds 已提交
1870
	if (!md->queue)
M
Milan Broz 已提交
1871
		goto bad_queue;
L
Linus Torvalds 已提交
1872

K
Kiyoshi Ueda 已提交
1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884
	/*
	 * 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,
	 * although we initialized the queue using blk_init_queue().
	 * 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->saved_make_request_fn = md->queue->make_request_fn;
L
Linus Torvalds 已提交
1885 1886 1887 1888
	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);
1889
	blk_queue_bounce_limit(md->queue, BLK_BOUNCE_ANY);
L
Linus Torvalds 已提交
1890
	md->queue->unplug_fn = dm_unplug_all;
M
Milan Broz 已提交
1891
	blk_queue_merge_bvec(md->queue, dm_merge_bvec);
K
Kiyoshi Ueda 已提交
1892 1893 1894
	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);
1895 1896
	blk_queue_ordered(md->queue, QUEUE_ORDERED_DRAIN_FLUSH,
			  dm_rq_prepare_flush);
S
Stefan Bader 已提交
1897

L
Linus Torvalds 已提交
1898 1899
	md->disk = alloc_disk(1);
	if (!md->disk)
M
Milan Broz 已提交
1900
		goto bad_disk;
L
Linus Torvalds 已提交
1901

1902 1903
	atomic_set(&md->pending[0], 0);
	atomic_set(&md->pending[1], 0);
1904
	init_waitqueue_head(&md->wait);
1905
	INIT_WORK(&md->work, dm_wq_work);
1906
	INIT_WORK(&md->barrier_work, dm_rq_barrier_work);
1907 1908
	init_waitqueue_head(&md->eventq);

L
Linus Torvalds 已提交
1909 1910 1911 1912 1913 1914 1915
	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 已提交
1916
	format_dev_t(md->name, MKDEV(_major, minor));
L
Linus Torvalds 已提交
1917

1918 1919 1920 1921
	md->wq = create_singlethread_workqueue("kdmflush");
	if (!md->wq)
		goto bad_thread;

M
Mikulas Patocka 已提交
1922 1923 1924 1925
	md->bdev = bdget_disk(md->disk, 0);
	if (!md->bdev)
		goto bad_bdev;

1926
	/* Populate the mapping, nobody knows we exist yet */
1927
	spin_lock(&_minor_lock);
1928
	old_md = idr_replace(&_minor_idr, md, minor);
1929
	spin_unlock(&_minor_lock);
1930 1931 1932

	BUG_ON(old_md != MINOR_ALLOCED);

L
Linus Torvalds 已提交
1933 1934
	return md;

M
Mikulas Patocka 已提交
1935 1936
bad_bdev:
	destroy_workqueue(md->wq);
1937
bad_thread:
1938
	del_gendisk(md->disk);
1939
	put_disk(md->disk);
M
Milan Broz 已提交
1940
bad_disk:
1941
	blk_cleanup_queue(md->queue);
M
Milan Broz 已提交
1942
bad_queue:
L
Linus Torvalds 已提交
1943
	free_minor(minor);
M
Milan Broz 已提交
1944
bad_minor:
1945
	module_put(THIS_MODULE);
M
Milan Broz 已提交
1946
bad_module_get:
L
Linus Torvalds 已提交
1947 1948 1949 1950
	kfree(md);
	return NULL;
}

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

L
Linus Torvalds 已提交
1953 1954
static void free_dev(struct mapped_device *md)
{
1955
	int minor = MINOR(disk_devt(md->disk));
1956

M
Mikulas Patocka 已提交
1957 1958
	unlock_fs(md);
	bdput(md->bdev);
1959
	destroy_workqueue(md->wq);
K
Kiyoshi Ueda 已提交
1960 1961 1962 1963 1964 1965
	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 已提交
1966
	blk_integrity_unregister(md->disk);
L
Linus Torvalds 已提交
1967
	del_gendisk(md->disk);
1968
	free_minor(minor);
J
Jeff Mahoney 已提交
1969 1970 1971 1972 1973

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

L
Linus Torvalds 已提交
1974
	put_disk(md->disk);
1975
	blk_cleanup_queue(md->queue);
1976
	module_put(THIS_MODULE);
L
Linus Torvalds 已提交
1977 1978 1979
	kfree(md);
}

K
Kiyoshi Ueda 已提交
1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002
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 已提交
2003 2004 2005 2006 2007
/*
 * Bind a table to the device.
 */
static void event_callback(void *context)
{
M
Mike Anderson 已提交
2008 2009
	unsigned long flags;
	LIST_HEAD(uevents);
L
Linus Torvalds 已提交
2010 2011
	struct mapped_device *md = (struct mapped_device *) context;

M
Mike Anderson 已提交
2012 2013 2014 2015
	spin_lock_irqsave(&md->uevent_lock, flags);
	list_splice_init(&md->uevent_list, &uevents);
	spin_unlock_irqrestore(&md->uevent_lock, flags);

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

L
Linus Torvalds 已提交
2018 2019 2020 2021
	atomic_inc(&md->event_nr);
	wake_up(&md->eventq);
}

2022
static void __set_size(struct mapped_device *md, sector_t size)
L
Linus Torvalds 已提交
2023
{
2024
	set_capacity(md->disk, size);
L
Linus Torvalds 已提交
2025

2026 2027 2028
	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 已提交
2029 2030
}

2031 2032
static int __bind(struct mapped_device *md, struct dm_table *t,
		  struct queue_limits *limits)
L
Linus Torvalds 已提交
2033
{
2034
	struct request_queue *q = md->queue;
L
Linus Torvalds 已提交
2035
	sector_t size;
2036
	unsigned long flags;
L
Linus Torvalds 已提交
2037 2038

	size = dm_table_get_size(t);
D
Darrick J. Wong 已提交
2039 2040 2041 2042 2043 2044 2045

	/*
	 * 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 已提交
2046
	__set_size(md, size);
2047 2048 2049

	if (!size) {
		dm_table_destroy(t);
L
Linus Torvalds 已提交
2050
		return 0;
2051
	}
L
Linus Torvalds 已提交
2052

2053 2054
	dm_table_event_callback(t, event_callback, md);

K
Kiyoshi Ueda 已提交
2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066
	/*
	 * 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);

2067
	write_lock_irqsave(&md->map_lock, flags);
L
Linus Torvalds 已提交
2068
	md->map = t;
2069
	dm_table_set_restrictions(t, q, limits);
2070
	write_unlock_irqrestore(&md->map_lock, flags);
L
Linus Torvalds 已提交
2071 2072 2073 2074 2075 2076 2077

	return 0;
}

static void __unbind(struct mapped_device *md)
{
	struct dm_table *map = md->map;
2078
	unsigned long flags;
L
Linus Torvalds 已提交
2079 2080 2081 2082 2083

	if (!map)
		return;

	dm_table_event_callback(map, NULL, NULL);
2084
	write_lock_irqsave(&md->map_lock, flags);
L
Linus Torvalds 已提交
2085
	md->map = NULL;
2086
	write_unlock_irqrestore(&md->map_lock, flags);
2087
	dm_table_destroy(map);
L
Linus Torvalds 已提交
2088 2089 2090 2091 2092
}

/*
 * Constructor for a new device.
 */
2093
int dm_create(int minor, struct mapped_device **result)
L
Linus Torvalds 已提交
2094 2095 2096
{
	struct mapped_device *md;

2097
	md = alloc_dev(minor);
L
Linus Torvalds 已提交
2098 2099 2100
	if (!md)
		return -ENXIO;

M
Milan Broz 已提交
2101 2102
	dm_sysfs_init(md);

L
Linus Torvalds 已提交
2103 2104 2105 2106
	*result = md;
	return 0;
}

2107
static struct mapped_device *dm_find_md(dev_t dev)
L
Linus Torvalds 已提交
2108 2109 2110 2111 2112 2113 2114
{
	struct mapped_device *md;
	unsigned minor = MINOR(dev);

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

2115
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
2116 2117

	md = idr_find(&_minor_idr, minor);
J
Jeff Mahoney 已提交
2118
	if (md && (md == MINOR_ALLOCED ||
2119
		   (MINOR(disk_devt(dm_disk(md))) != minor) ||
A
Alasdair G Kergon 已提交
2120
		   test_bit(DMF_FREEING, &md->flags))) {
2121
		md = NULL;
J
Jeff Mahoney 已提交
2122 2123
		goto out;
	}
L
Linus Torvalds 已提交
2124

J
Jeff Mahoney 已提交
2125
out:
2126
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
2127

2128 2129 2130
	return md;
}

2131 2132 2133 2134 2135 2136 2137 2138 2139 2140
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 已提交
2141
void *dm_get_mdptr(struct mapped_device *md)
2142
{
A
Alasdair G Kergon 已提交
2143
	return md->interface_ptr;
L
Linus Torvalds 已提交
2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155
}

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);
}

2156 2157 2158 2159 2160 2161
const char *dm_device_name(struct mapped_device *md)
{
	return md->name;
}
EXPORT_SYMBOL_GPL(dm_device_name);

L
Linus Torvalds 已提交
2162 2163
void dm_put(struct mapped_device *md)
{
M
Mike Anderson 已提交
2164
	struct dm_table *map;
L
Linus Torvalds 已提交
2165

J
Jeff Mahoney 已提交
2166 2167
	BUG_ON(test_bit(DMF_FREEING, &md->flags));

2168
	if (atomic_dec_and_lock(&md->holders, &_minor_lock)) {
2169
		map = dm_get_live_table(md);
2170 2171
		idr_replace(&_minor_idr, MINOR_ALLOCED,
			    MINOR(disk_devt(dm_disk(md))));
J
Jeff Mahoney 已提交
2172
		set_bit(DMF_FREEING, &md->flags);
2173
		spin_unlock(&_minor_lock);
2174
		if (!dm_suspended(md)) {
L
Linus Torvalds 已提交
2175 2176 2177
			dm_table_presuspend_targets(map);
			dm_table_postsuspend_targets(map);
		}
M
Milan Broz 已提交
2178
		dm_sysfs_exit(md);
M
Mike Anderson 已提交
2179
		dm_table_put(map);
2180
		__unbind(md);
L
Linus Torvalds 已提交
2181 2182 2183
		free_dev(md);
	}
}
E
Edward Goggin 已提交
2184
EXPORT_SYMBOL_GPL(dm_put);
L
Linus Torvalds 已提交
2185

2186
static int dm_wait_for_completion(struct mapped_device *md, int interruptible)
2187 2188
{
	int r = 0;
2189 2190 2191 2192 2193
	DECLARE_WAITQUEUE(wait, current);

	dm_unplug_all(md->queue);

	add_wait_queue(&md->wait, &wait);
2194 2195

	while (1) {
2196
		set_current_state(interruptible);
2197 2198

		smp_mb();
2199
		if (!md_in_flight(md))
2200 2201
			break;

2202 2203
		if (interruptible == TASK_INTERRUPTIBLE &&
		    signal_pending(current)) {
2204 2205 2206 2207 2208 2209 2210 2211
			r = -EINTR;
			break;
		}

		io_schedule();
	}
	set_current_state(TASK_RUNNING);

2212 2213
	remove_wait_queue(&md->wait, &wait);

2214 2215 2216
	return r;
}

M
Mikulas Patocka 已提交
2217
static void dm_flush(struct mapped_device *md)
2218 2219
{
	dm_wait_for_completion(md, TASK_UNINTERRUPTIBLE);
2220 2221 2222 2223 2224 2225 2226

	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);
2227 2228 2229 2230
}

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

M
Mikulas Patocka 已提交
2233
	dm_flush(md);
2234

2235 2236 2237
	if (!bio_empty_barrier(bio)) {
		__split_and_process_bio(md, bio);
		dm_flush(md);
2238 2239 2240
	}

	if (md->barrier_error != DM_ENDIO_REQUEUE)
M
Mikulas Patocka 已提交
2241
		bio_endio(bio, md->barrier_error);
2242 2243 2244 2245 2246
	else {
		spin_lock_irq(&md->deferred_lock);
		bio_list_add_head(&md->deferred, bio);
		spin_unlock_irq(&md->deferred_lock);
	}
2247 2248
}

L
Linus Torvalds 已提交
2249 2250 2251
/*
 * Process the deferred bios
 */
2252
static void dm_wq_work(struct work_struct *work)
L
Linus Torvalds 已提交
2253
{
2254 2255
	struct mapped_device *md = container_of(work, struct mapped_device,
						work);
2256
	struct bio *c;
L
Linus Torvalds 已提交
2257

2258 2259
	down_write(&md->io_lock);

2260
	while (!test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) {
A
Alasdair G Kergon 已提交
2261 2262 2263 2264 2265
		spin_lock_irq(&md->deferred_lock);
		c = bio_list_pop(&md->deferred);
		spin_unlock_irq(&md->deferred_lock);

		if (!c) {
2266
			clear_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags);
A
Alasdair G Kergon 已提交
2267 2268
			break;
		}
2269

2270 2271
		up_write(&md->io_lock);

K
Kiyoshi Ueda 已提交
2272 2273 2274
		if (dm_request_based(md))
			generic_make_request(c);
		else {
2275
			if (bio_rw_flagged(c, BIO_RW_BARRIER))
K
Kiyoshi Ueda 已提交
2276 2277 2278 2279
				process_barrier(md, c);
			else
				__split_and_process_bio(md, c);
		}
2280 2281

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

2284
	up_write(&md->io_lock);
L
Linus Torvalds 已提交
2285 2286
}

2287
static void dm_queue_flush(struct mapped_device *md)
2288
{
2289 2290
	clear_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags);
	smp_mb__after_clear_bit();
2291
	queue_work(md->wq, &md->work);
2292 2293
}

2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304
static void dm_rq_set_flush_nr(struct request *clone, unsigned flush_nr)
{
	struct dm_rq_target_io *tio = clone->end_io_data;

	tio->info.flush_request = flush_nr;
}

/* Issue barrier requests to targets and wait for their completion. */
static int dm_rq_barrier(struct mapped_device *md)
{
	int i, j;
2305
	struct dm_table *map = dm_get_live_table(md);
2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360
	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);
			dm_rq_set_flush_nr(clone, j);
			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 已提交
2361 2362 2363 2364 2365
/*
 * Swap in a new table (destroying old one).
 */
int dm_swap_table(struct mapped_device *md, struct dm_table *table)
{
2366
	struct queue_limits limits;
2367
	int r = -EINVAL;
L
Linus Torvalds 已提交
2368

2369
	mutex_lock(&md->suspend_lock);
L
Linus Torvalds 已提交
2370 2371

	/* device must be suspended */
2372
	if (!dm_suspended(md))
2373
		goto out;
L
Linus Torvalds 已提交
2374

2375 2376 2377 2378
	r = dm_calculate_queue_limits(table, &limits);
	if (r)
		goto out;

K
Kiyoshi Ueda 已提交
2379 2380 2381 2382 2383 2384 2385
	/* cannot change the device type, once a table is bound */
	if (md->map &&
	    (dm_table_get_type(md->map) != dm_table_get_type(table))) {
		DMWARN("can't change the device type after a table is bound");
		goto out;
	}

L
Linus Torvalds 已提交
2386
	__unbind(md);
2387
	r = __bind(md, table, &limits);
L
Linus Torvalds 已提交
2388

2389
out:
2390
	mutex_unlock(&md->suspend_lock);
2391
	return r;
L
Linus Torvalds 已提交
2392 2393 2394 2395 2396 2397
}

/*
 * Functions to lock and unlock any filesystem running on the
 * device.
 */
2398
static int lock_fs(struct mapped_device *md)
L
Linus Torvalds 已提交
2399
{
2400
	int r;
L
Linus Torvalds 已提交
2401 2402

	WARN_ON(md->frozen_sb);
2403

2404
	md->frozen_sb = freeze_bdev(md->bdev);
2405
	if (IS_ERR(md->frozen_sb)) {
2406
		r = PTR_ERR(md->frozen_sb);
2407 2408
		md->frozen_sb = NULL;
		return r;
2409 2410
	}

2411 2412
	set_bit(DMF_FROZEN, &md->flags);

L
Linus Torvalds 已提交
2413 2414 2415
	return 0;
}

2416
static void unlock_fs(struct mapped_device *md)
L
Linus Torvalds 已提交
2417
{
2418 2419 2420
	if (!test_bit(DMF_FROZEN, &md->flags))
		return;

2421
	thaw_bdev(md->bdev, md->frozen_sb);
L
Linus Torvalds 已提交
2422
	md->frozen_sb = NULL;
2423
	clear_bit(DMF_FROZEN, &md->flags);
L
Linus Torvalds 已提交
2424 2425 2426 2427 2428 2429 2430 2431 2432
}

/*
 * 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.
 */
2433 2434 2435
/*
 * Suspend mechanism in request-based dm.
 *
K
Kiyoshi Ueda 已提交
2436 2437 2438
 * 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.
2439
 *
K
Kiyoshi Ueda 已提交
2440
 * To abort suspend, start the request_queue.
2441
 */
2442
int dm_suspend(struct mapped_device *md, unsigned suspend_flags)
L
Linus Torvalds 已提交
2443
{
2444
	struct dm_table *map = NULL;
2445
	int r = 0;
2446
	int do_lockfs = suspend_flags & DM_SUSPEND_LOCKFS_FLAG ? 1 : 0;
2447
	int noflush = suspend_flags & DM_SUSPEND_NOFLUSH_FLAG ? 1 : 0;
L
Linus Torvalds 已提交
2448

2449
	mutex_lock(&md->suspend_lock);
2450

M
Milan Broz 已提交
2451 2452
	if (dm_suspended(md)) {
		r = -EINVAL;
2453
		goto out_unlock;
M
Milan Broz 已提交
2454
	}
L
Linus Torvalds 已提交
2455

2456
	map = dm_get_live_table(md);
L
Linus Torvalds 已提交
2457

2458 2459 2460 2461 2462 2463 2464
	/*
	 * 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);

2465 2466 2467
	/* This does not get reverted if there's an error later. */
	dm_table_presuspend_targets(map);

M
Mikulas Patocka 已提交
2468
	/*
K
Kiyoshi Ueda 已提交
2469 2470 2471 2472
	 * 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 已提交
2473 2474 2475 2476
	 */
	if (!noflush && do_lockfs) {
		r = lock_fs(md);
		if (r)
K
Kiyoshi Ueda 已提交
2477
			goto out;
2478
	}
L
Linus Torvalds 已提交
2479 2480

	/*
2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494
	 * 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 已提交
2495
	 */
2496
	down_write(&md->io_lock);
2497 2498
	set_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags);
	set_bit(DMF_QUEUE_IO_TO_THREAD, &md->flags);
2499
	up_write(&md->io_lock);
L
Linus Torvalds 已提交
2500

2501 2502 2503 2504 2505
	/*
	 * 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.
	 */
2506
	if (dm_request_based(md))
K
Kiyoshi Ueda 已提交
2507
		stop_queue(md->queue);
2508

2509 2510
	flush_workqueue(md->wq);

L
Linus Torvalds 已提交
2511
	/*
2512 2513 2514
	 * 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 已提交
2515
	 */
2516
	r = dm_wait_for_completion(md, TASK_INTERRUPTIBLE);
L
Linus Torvalds 已提交
2517

2518
	down_write(&md->io_lock);
2519
	if (noflush)
2520
		clear_bit(DMF_NOFLUSH_SUSPENDING, &md->flags);
2521
	up_write(&md->io_lock);
2522

L
Linus Torvalds 已提交
2523
	/* were we interrupted ? */
2524
	if (r < 0) {
2525
		dm_queue_flush(md);
M
Milan Broz 已提交
2526

2527
		if (dm_request_based(md))
K
Kiyoshi Ueda 已提交
2528
			start_queue(md->queue);
2529

2530
		unlock_fs(md);
2531
		goto out; /* pushback list is already flushed, so skip flush */
2532
	}
L
Linus Torvalds 已提交
2533

2534 2535 2536 2537 2538 2539
	/*
	 * 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.
	 */

2540
	dm_table_postsuspend_targets(map);
L
Linus Torvalds 已提交
2541

2542
	set_bit(DMF_SUSPENDED, &md->flags);
2543

2544 2545
out:
	dm_table_put(map);
2546 2547

out_unlock:
2548
	mutex_unlock(&md->suspend_lock);
2549
	return r;
L
Linus Torvalds 已提交
2550 2551 2552 2553
}

int dm_resume(struct mapped_device *md)
{
2554 2555
	int r = -EINVAL;
	struct dm_table *map = NULL;
L
Linus Torvalds 已提交
2556

2557
	mutex_lock(&md->suspend_lock);
2558
	if (!dm_suspended(md))
2559 2560
		goto out;

2561
	map = dm_get_live_table(md);
2562
	if (!map || !dm_table_get_size(map))
2563
		goto out;
L
Linus Torvalds 已提交
2564

2565 2566 2567
	r = dm_table_resume_targets(map);
	if (r)
		goto out;
2568

2569
	dm_queue_flush(md);
2570

2571 2572 2573 2574 2575 2576 2577 2578
	/*
	 * 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);

2579 2580 2581 2582
	unlock_fs(md);

	clear_bit(DMF_SUSPENDED, &md->flags);

L
Linus Torvalds 已提交
2583
	dm_table_unplug_all(map);
2584 2585 2586
	r = 0;
out:
	dm_table_put(map);
2587
	mutex_unlock(&md->suspend_lock);
2588

2589
	return r;
L
Linus Torvalds 已提交
2590 2591 2592 2593 2594
}

/*-----------------------------------------------------------------
 * Event notification.
 *---------------------------------------------------------------*/
M
Milan Broz 已提交
2595 2596
void dm_kobject_uevent(struct mapped_device *md, enum kobject_action action,
		       unsigned cookie)
2597
{
M
Milan Broz 已提交
2598 2599 2600 2601 2602 2603 2604 2605 2606 2607
	char udev_cookie[DM_COOKIE_LENGTH];
	char *envp[] = { udev_cookie, NULL };

	if (!cookie)
		kobject_uevent(&disk_to_dev(md->disk)->kobj, action);
	else {
		snprintf(udev_cookie, DM_COOKIE_LENGTH, "%s=%u",
			 DM_COOKIE_ENV_VAR_NAME, cookie);
		kobject_uevent_env(&disk_to_dev(md->disk)->kobj, action, envp);
	}
2608 2609
}

M
Mike Anderson 已提交
2610 2611 2612 2613 2614
uint32_t dm_next_uevent_seq(struct mapped_device *md)
{
	return atomic_add_return(1, &md->uevent_seq);
}

L
Linus Torvalds 已提交
2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625
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 已提交
2626 2627 2628 2629 2630 2631 2632 2633 2634
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 已提交
2635 2636 2637 2638 2639 2640 2641 2642 2643
/*
 * 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 已提交
2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660
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;

2661 2662 2663 2664
	if (test_bit(DMF_FREEING, &md->flags) ||
	    test_bit(DMF_DELETING, &md->flags))
		return NULL;

M
Milan Broz 已提交
2665 2666 2667 2668
	dm_get(md);
	return md;
}

L
Linus Torvalds 已提交
2669 2670 2671 2672 2673
int dm_suspended(struct mapped_device *md)
{
	return test_bit(DMF_SUSPENDED, &md->flags);
}

2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684
int dm_noflush_suspending(struct dm_target *ti)
{
	struct mapped_device *md = dm_table_get_md(ti->table);
	int r = __noflush_suspending(md);

	dm_put(md);

	return r;
}
EXPORT_SYMBOL_GPL(dm_noflush_suspending);

K
Kiyoshi Ueda 已提交
2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739
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);
}

2740
static const struct block_device_operations dm_blk_dops = {
L
Linus Torvalds 已提交
2741 2742
	.open = dm_blk_open,
	.release = dm_blk_close,
2743
	.ioctl = dm_blk_ioctl,
D
Darrick J. Wong 已提交
2744
	.getgeo = dm_blk_getgeo,
L
Linus Torvalds 已提交
2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760
	.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");