dm.c 85.1 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
#include <linux/moduleparam.h>
#include <linux/blkpg.h>
#include <linux/bio.h>
#include <linux/mempool.h>
#include <linux/slab.h>
#include <linux/idr.h>
D
Darrick J. Wong 已提交
20
#include <linux/hdreg.h>
21
#include <linux/delay.h>
22
#include <linux/wait.h>
23
#include <linux/kthread.h>
24
#include <linux/ktime.h>
25
#include <linux/elevator.h> /* for rq_end_sector() */
26
#include <linux/blk-mq.h>
27 28

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

30 31
#define DM_MSG_PREFIX "core"

N
Namhyung Kim 已提交
32 33 34 35 36 37 38 39 40 41
#ifdef CONFIG_PRINTK
/*
 * ratelimit state to be used in DMXXX_LIMIT().
 */
DEFINE_RATELIMIT_STATE(dm_ratelimit_state,
		       DEFAULT_RATELIMIT_INTERVAL,
		       DEFAULT_RATELIMIT_BURST);
EXPORT_SYMBOL(dm_ratelimit_state);
#endif

M
Milan Broz 已提交
42 43 44 45 46 47 48
/*
 * 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 已提交
49 50 51 52 53
static const char *_name = DM_NAME;

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

54 55
static DEFINE_IDR(_minor_idr);

56
static DEFINE_SPINLOCK(_minor_lock);
M
Mikulas Patocka 已提交
57 58 59 60 61

static void do_deferred_remove(struct work_struct *w);

static DECLARE_WORK(deferred_remove_work, do_deferred_remove);

62 63
static struct workqueue_struct *deferred_remove_workqueue;

L
Linus Torvalds 已提交
64
/*
K
Kiyoshi Ueda 已提交
65
 * For bio-based dm.
L
Linus Torvalds 已提交
66 67 68 69 70 71
 * One of these is allocated per bio.
 */
struct dm_io {
	struct mapped_device *md;
	int error;
	atomic_t io_count;
R
Richard Kennedy 已提交
72
	struct bio *bio;
73
	unsigned long start_time;
74
	spinlock_t endio_lock;
M
Mikulas Patocka 已提交
75
	struct dm_stats_aux stats_aux;
L
Linus Torvalds 已提交
76 77
};

K
Kiyoshi Ueda 已提交
78 79 80 81 82 83 84
/*
 * For request-based dm.
 * One of these is allocated per request.
 */
struct dm_rq_target_io {
	struct mapped_device *md;
	struct dm_target *ti;
85
	struct request *orig, *clone;
86
	struct kthread_work work;
K
Kiyoshi Ueda 已提交
87 88
	int error;
	union map_info info;
89 90 91
	struct dm_stats_aux stats_aux;
	unsigned long duration_jiffies;
	unsigned n_sectors;
K
Kiyoshi Ueda 已提交
92 93 94
};

/*
95 96 97 98 99 100
 * For request-based dm - the bio clones we allocate are embedded in these
 * structs.
 *
 * We allocate these with bio_alloc_bioset, using the front_pad parameter when
 * the bioset is created - this means the bio has to come at the end of the
 * struct.
K
Kiyoshi Ueda 已提交
101 102 103
 */
struct dm_rq_clone_bio_info {
	struct bio *orig;
104
	struct dm_rq_target_io *tio;
105
	struct bio clone;
K
Kiyoshi Ueda 已提交
106 107
};

108 109 110 111 112 113 114 115
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);

116 117
#define MINOR_ALLOCED ((void *)-1)

L
Linus Torvalds 已提交
118 119 120
/*
 * Bits for the md->flags field.
 */
121
#define DMF_BLOCK_IO_FOR_SUSPEND 0
L
Linus Torvalds 已提交
122
#define DMF_SUSPENDED 1
123
#define DMF_FROZEN 2
J
Jeff Mahoney 已提交
124
#define DMF_FREEING 3
125
#define DMF_DELETING 4
126
#define DMF_NOFLUSH_SUSPENDING 5
127
#define DMF_MERGE_IS_OPTIONAL 6
M
Mikulas Patocka 已提交
128
#define DMF_DEFERRED_REMOVE 7
129
#define DMF_SUSPENDED_INTERNALLY 8
L
Linus Torvalds 已提交
130

M
Mikulas Patocka 已提交
131 132 133 134 135 136 137 138
/*
 * A dummy definition to make RCU happy.
 * struct dm_table should never be dereferenced in this file.
 */
struct dm_table {
	int undefined__;
};

139 140 141
/*
 * Work processed by per-device workqueue.
 */
L
Linus Torvalds 已提交
142
struct mapped_device {
M
Mikulas Patocka 已提交
143
	struct srcu_struct io_barrier;
144
	struct mutex suspend_lock;
L
Linus Torvalds 已提交
145
	atomic_t holders;
146
	atomic_t open_count;
L
Linus Torvalds 已提交
147

M
Mikulas Patocka 已提交
148 149 150 151 152
	/*
	 * The current mapping.
	 * Use dm_get_live_table{_fast} or take suspend_lock for
	 * dereference.
	 */
153
	struct dm_table __rcu *map;
M
Mikulas Patocka 已提交
154

155 156 157
	struct list_head table_devices;
	struct mutex table_devices_lock;

L
Linus Torvalds 已提交
158 159
	unsigned long flags;

160
	struct request_queue *queue;
161
	unsigned type;
162
	/* Protect queue and type against concurrent access. */
163 164
	struct mutex type_lock;

165 166
	struct target_type *immutable_target_type;

L
Linus Torvalds 已提交
167
	struct gendisk *disk;
M
Mike Anderson 已提交
168
	char name[16];
L
Linus Torvalds 已提交
169 170 171 172 173 174

	void *interface_ptr;

	/*
	 * A list of ios that arrived while we were suspended.
	 */
175
	atomic_t pending[2];
L
Linus Torvalds 已提交
176
	wait_queue_head_t wait;
177
	struct work_struct work;
K
Kiyoshi Ueda 已提交
178
	struct bio_list deferred;
179
	spinlock_t deferred_lock;
L
Linus Torvalds 已提交
180

181
	/*
182
	 * Processing queue (flush)
183 184 185
	 */
	struct workqueue_struct *wq;

L
Linus Torvalds 已提交
186 187 188 189
	/*
	 * io objects are allocated from here.
	 */
	mempool_t *io_pool;
190
	mempool_t *rq_pool;
L
Linus Torvalds 已提交
191

S
Stefan Bader 已提交
192 193
	struct bio_set *bs;

L
Linus Torvalds 已提交
194 195 196 197 198
	/*
	 * Event handling.
	 */
	atomic_t event_nr;
	wait_queue_head_t eventq;
M
Mike Anderson 已提交
199 200 201
	atomic_t uevent_seq;
	struct list_head uevent_list;
	spinlock_t uevent_lock; /* Protect access to uevent_list */
L
Linus Torvalds 已提交
202 203 204 205 206

	/*
	 * freeze/thaw support require holding onto a super block
	 */
	struct super_block *frozen_sb;
207
	struct block_device *bdev;
D
Darrick J. Wong 已提交
208 209 210

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

212 213
	/* kobject and completion */
	struct dm_kobject_holder kobj_holder;
214

215 216
	/* zero-length flush that will be cloned and submitted to targets */
	struct bio flush_bio;
M
Mikulas Patocka 已提交
217

218 219 220
	/* the number of internal suspends */
	unsigned internal_suspend_count;

M
Mikulas Patocka 已提交
221
	struct dm_stats stats;
222 223 224

	struct kthread_worker kworker;
	struct task_struct *kworker_task;
225 226

	/* for request-based merge heuristic in dm_request_fn() */
227
	unsigned seq_rq_merge_deadline_usecs;
228
	int last_rq_rw;
229 230
	sector_t last_rq_pos;
	ktime_t last_rq_start_time;
231 232 233

	/* for blk-mq request-based DM support */
	struct blk_mq_tag_set tag_set;
234
	bool use_blk_mq;
L
Linus Torvalds 已提交
235 236
};

237 238 239 240 241 242 243 244 245 246 247
#ifdef CONFIG_DM_MQ_DEFAULT
static bool use_blk_mq = true;
#else
static bool use_blk_mq = false;
#endif

bool dm_use_blk_mq(struct mapped_device *md)
{
	return md->use_blk_mq;
}

K
Kiyoshi Ueda 已提交
248 249 250 251 252
/*
 * For mempools pre-allocation at the table loading time.
 */
struct dm_md_mempools {
	mempool_t *io_pool;
253
	mempool_t *rq_pool;
K
Kiyoshi Ueda 已提交
254 255 256
	struct bio_set *bs;
};

257 258 259 260 261 262
struct table_device {
	struct list_head list;
	atomic_t count;
	struct dm_dev dm_dev;
};

263 264
#define RESERVED_BIO_BASED_IOS		16
#define RESERVED_REQUEST_BASED_IOS	256
265
#define RESERVED_MAX_IOS		1024
266
static struct kmem_cache *_io_cache;
K
Kiyoshi Ueda 已提交
267
static struct kmem_cache *_rq_tio_cache;
268
static struct kmem_cache *_rq_cache;
269

270 271 272 273 274
/*
 * Bio-based DM's mempools' reserved IOs set by the user.
 */
static unsigned reserved_bio_based_ios = RESERVED_BIO_BASED_IOS;

275 276 277 278 279
/*
 * Request-based DM's mempools' reserved IOs set by the user.
 */
static unsigned reserved_rq_based_ios = RESERVED_REQUEST_BASED_IOS;

280
static unsigned __dm_get_module_param(unsigned *module_param,
281 282
				      unsigned def, unsigned max)
{
283 284
	unsigned param = ACCESS_ONCE(*module_param);
	unsigned modified_param = 0;
285

286 287 288 289
	if (!param)
		modified_param = def;
	else if (param > max)
		modified_param = max;
290

291 292 293
	if (modified_param) {
		(void)cmpxchg(module_param, param, modified_param);
		param = modified_param;
294 295
	}

296
	return param;
297 298
}

299 300
unsigned dm_get_reserved_bio_based_ios(void)
{
301
	return __dm_get_module_param(&reserved_bio_based_ios,
302 303 304 305
				     RESERVED_BIO_BASED_IOS, RESERVED_MAX_IOS);
}
EXPORT_SYMBOL_GPL(dm_get_reserved_bio_based_ios);

306 307
unsigned dm_get_reserved_rq_based_ios(void)
{
308
	return __dm_get_module_param(&reserved_rq_based_ios,
309 310 311 312
				     RESERVED_REQUEST_BASED_IOS, RESERVED_MAX_IOS);
}
EXPORT_SYMBOL_GPL(dm_get_reserved_rq_based_ios);

L
Linus Torvalds 已提交
313 314
static int __init local_init(void)
{
K
Kiyoshi Ueda 已提交
315
	int r = -ENOMEM;
L
Linus Torvalds 已提交
316 317

	/* allocate a slab for the dm_ios */
A
Alasdair G Kergon 已提交
318
	_io_cache = KMEM_CACHE(dm_io, 0);
L
Linus Torvalds 已提交
319
	if (!_io_cache)
K
Kiyoshi Ueda 已提交
320
		return r;
L
Linus Torvalds 已提交
321

K
Kiyoshi Ueda 已提交
322 323
	_rq_tio_cache = KMEM_CACHE(dm_rq_target_io, 0);
	if (!_rq_tio_cache)
324
		goto out_free_io_cache;
K
Kiyoshi Ueda 已提交
325

326 327 328 329 330
	_rq_cache = kmem_cache_create("dm_clone_request", sizeof(struct request),
				      __alignof__(struct request), 0, NULL);
	if (!_rq_cache)
		goto out_free_rq_tio_cache;

M
Mike Anderson 已提交
331
	r = dm_uevent_init();
K
Kiyoshi Ueda 已提交
332
	if (r)
333
		goto out_free_rq_cache;
M
Mike Anderson 已提交
334

335 336 337 338 339 340
	deferred_remove_workqueue = alloc_workqueue("kdmremove", WQ_UNBOUND, 1);
	if (!deferred_remove_workqueue) {
		r = -ENOMEM;
		goto out_uevent_exit;
	}

L
Linus Torvalds 已提交
341 342
	_major = major;
	r = register_blkdev(_major, _name);
K
Kiyoshi Ueda 已提交
343
	if (r < 0)
344
		goto out_free_workqueue;
L
Linus Torvalds 已提交
345 346 347 348 349

	if (!_major)
		_major = r;

	return 0;
K
Kiyoshi Ueda 已提交
350

351 352
out_free_workqueue:
	destroy_workqueue(deferred_remove_workqueue);
K
Kiyoshi Ueda 已提交
353 354
out_uevent_exit:
	dm_uevent_exit();
355 356
out_free_rq_cache:
	kmem_cache_destroy(_rq_cache);
K
Kiyoshi Ueda 已提交
357 358
out_free_rq_tio_cache:
	kmem_cache_destroy(_rq_tio_cache);
K
Kiyoshi Ueda 已提交
359 360 361 362
out_free_io_cache:
	kmem_cache_destroy(_io_cache);

	return r;
L
Linus Torvalds 已提交
363 364 365 366
}

static void local_exit(void)
{
M
Mikulas Patocka 已提交
367
	flush_scheduled_work();
368
	destroy_workqueue(deferred_remove_workqueue);
M
Mikulas Patocka 已提交
369

370
	kmem_cache_destroy(_rq_cache);
K
Kiyoshi Ueda 已提交
371
	kmem_cache_destroy(_rq_tio_cache);
L
Linus Torvalds 已提交
372
	kmem_cache_destroy(_io_cache);
373
	unregister_blkdev(_major, _name);
M
Mike Anderson 已提交
374
	dm_uevent_exit();
L
Linus Torvalds 已提交
375 376 377 378 379 380

	_major = 0;

	DMINFO("cleaned up");
}

381
static int (*_inits[])(void) __initdata = {
L
Linus Torvalds 已提交
382 383 384 385
	local_init,
	dm_target_init,
	dm_linear_init,
	dm_stripe_init,
M
Mikulas Patocka 已提交
386
	dm_io_init,
387
	dm_kcopyd_init,
L
Linus Torvalds 已提交
388
	dm_interface_init,
M
Mikulas Patocka 已提交
389
	dm_statistics_init,
L
Linus Torvalds 已提交
390 391
};

392
static void (*_exits[])(void) = {
L
Linus Torvalds 已提交
393 394 395 396
	local_exit,
	dm_target_exit,
	dm_linear_exit,
	dm_stripe_exit,
M
Mikulas Patocka 已提交
397
	dm_io_exit,
398
	dm_kcopyd_exit,
L
Linus Torvalds 已提交
399
	dm_interface_exit,
M
Mikulas Patocka 已提交
400
	dm_statistics_exit,
L
Linus Torvalds 已提交
401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429
};

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]();
430 431 432 433 434

	/*
	 * Should be empty by this point.
	 */
	idr_destroy(&_minor_idr);
L
Linus Torvalds 已提交
435 436 437 438 439
}

/*
 * Block device functions
 */
M
Mike Anderson 已提交
440 441 442 443 444
int dm_deleting_md(struct mapped_device *md)
{
	return test_bit(DMF_DELETING, &md->flags);
}

A
Al Viro 已提交
445
static int dm_blk_open(struct block_device *bdev, fmode_t mode)
L
Linus Torvalds 已提交
446 447 448
{
	struct mapped_device *md;

J
Jeff Mahoney 已提交
449 450
	spin_lock(&_minor_lock);

A
Al Viro 已提交
451
	md = bdev->bd_disk->private_data;
J
Jeff Mahoney 已提交
452 453 454
	if (!md)
		goto out;

455
	if (test_bit(DMF_FREEING, &md->flags) ||
M
Mike Anderson 已提交
456
	    dm_deleting_md(md)) {
J
Jeff Mahoney 已提交
457 458 459 460
		md = NULL;
		goto out;
	}

L
Linus Torvalds 已提交
461
	dm_get(md);
462
	atomic_inc(&md->open_count);
J
Jeff Mahoney 已提交
463 464 465 466
out:
	spin_unlock(&_minor_lock);

	return md ? 0 : -ENXIO;
L
Linus Torvalds 已提交
467 468
}

469
static void dm_blk_close(struct gendisk *disk, fmode_t mode)
L
Linus Torvalds 已提交
470
{
471
	struct mapped_device *md;
472

473 474
	spin_lock(&_minor_lock);

475 476 477 478
	md = disk->private_data;
	if (WARN_ON(!md))
		goto out;

M
Mikulas Patocka 已提交
479 480
	if (atomic_dec_and_test(&md->open_count) &&
	    (test_bit(DMF_DEFERRED_REMOVE, &md->flags)))
481
		queue_work(deferred_remove_workqueue, &deferred_remove_work);
M
Mikulas Patocka 已提交
482

L
Linus Torvalds 已提交
483
	dm_put(md);
484
out:
485
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
486 487
}

488 489 490 491 492 493 494 495
int dm_open_count(struct mapped_device *md)
{
	return atomic_read(&md->open_count);
}

/*
 * Guarantees nothing is using the device before it's deleted.
 */
M
Mikulas Patocka 已提交
496
int dm_lock_for_deletion(struct mapped_device *md, bool mark_deferred, bool only_deferred)
497 498 499 500 501
{
	int r = 0;

	spin_lock(&_minor_lock);

M
Mikulas Patocka 已提交
502
	if (dm_open_count(md)) {
503
		r = -EBUSY;
M
Mikulas Patocka 已提交
504 505 506 507
		if (mark_deferred)
			set_bit(DMF_DEFERRED_REMOVE, &md->flags);
	} else if (only_deferred && !test_bit(DMF_DEFERRED_REMOVE, &md->flags))
		r = -EEXIST;
508 509 510 511 512 513 514 515
	else
		set_bit(DMF_DELETING, &md->flags);

	spin_unlock(&_minor_lock);

	return r;
}

M
Mikulas Patocka 已提交
516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536
int dm_cancel_deferred_remove(struct mapped_device *md)
{
	int r = 0;

	spin_lock(&_minor_lock);

	if (test_bit(DMF_DELETING, &md->flags))
		r = -EBUSY;
	else
		clear_bit(DMF_DEFERRED_REMOVE, &md->flags);

	spin_unlock(&_minor_lock);

	return r;
}

static void do_deferred_remove(struct work_struct *w)
{
	dm_deferred_remove();
}

M
Mikulas Patocka 已提交
537 538 539 540 541
sector_t dm_get_size(struct mapped_device *md)
{
	return get_capacity(md->disk);
}

542 543 544 545 546
struct request_queue *dm_get_md_queue(struct mapped_device *md)
{
	return md->queue;
}

M
Mikulas Patocka 已提交
547 548 549 550 551
struct dm_stats *dm_get_stats(struct mapped_device *md)
{
	return &md->stats;
}

D
Darrick J. Wong 已提交
552 553 554 555 556 557 558
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 已提交
559
static int dm_blk_ioctl(struct block_device *bdev, fmode_t mode,
560 561
			unsigned int cmd, unsigned long arg)
{
A
Al Viro 已提交
562
	struct mapped_device *md = bdev->bd_disk->private_data;
M
Mikulas Patocka 已提交
563
	int srcu_idx;
564
	struct dm_table *map;
565 566 567
	struct dm_target *tgt;
	int r = -ENOTTY;

568
retry:
M
Mikulas Patocka 已提交
569 570
	map = dm_get_live_table(md, &srcu_idx);

571 572 573 574 575 576 577 578
	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);
579 580
	if (!tgt->type->ioctl)
		goto out;
581

582
	if (dm_suspended_md(md)) {
583 584 585 586
		r = -EAGAIN;
		goto out;
	}

587
	r = tgt->type->ioctl(tgt, cmd, arg);
588 589

out:
M
Mikulas Patocka 已提交
590
	dm_put_live_table(md, srcu_idx);
591

592 593 594 595 596
	if (r == -ENOTCONN) {
		msleep(10);
		goto retry;
	}

597 598 599
	return r;
}

A
Alasdair G Kergon 已提交
600
static struct dm_io *alloc_io(struct mapped_device *md)
L
Linus Torvalds 已提交
601 602 603 604
{
	return mempool_alloc(md->io_pool, GFP_NOIO);
}

A
Alasdair G Kergon 已提交
605
static void free_io(struct mapped_device *md, struct dm_io *io)
L
Linus Torvalds 已提交
606 607 608 609
{
	mempool_free(io, md->io_pool);
}

A
Alasdair G Kergon 已提交
610
static void free_tio(struct mapped_device *md, struct dm_target_io *tio)
L
Linus Torvalds 已提交
611
{
612
	bio_put(&tio->clone);
L
Linus Torvalds 已提交
613 614
}

K
Kiyoshi Ueda 已提交
615 616
static struct dm_rq_target_io *alloc_rq_tio(struct mapped_device *md,
					    gfp_t gfp_mask)
617
{
J
Jun'ichi Nomura 已提交
618
	return mempool_alloc(md->io_pool, gfp_mask);
619 620 621 622
}

static void free_rq_tio(struct dm_rq_target_io *tio)
{
J
Jun'ichi Nomura 已提交
623
	mempool_free(tio, tio->md->io_pool);
624 625
}

626 627 628 629 630 631 632 633 634 635 636
static struct request *alloc_clone_request(struct mapped_device *md,
					   gfp_t gfp_mask)
{
	return mempool_alloc(md->rq_pool, gfp_mask);
}

static void free_clone_request(struct mapped_device *md, struct request *rq)
{
	mempool_free(rq, md->rq_pool);
}

K
Kiyoshi Ueda 已提交
637 638 639 640 641 642
static int md_in_flight(struct mapped_device *md)
{
	return atomic_read(&md->pending[READ]) +
	       atomic_read(&md->pending[WRITE]);
}

643 644 645
static void start_io_acct(struct dm_io *io)
{
	struct mapped_device *md = io->md;
M
Mikulas Patocka 已提交
646
	struct bio *bio = io->bio;
T
Tejun Heo 已提交
647
	int cpu;
M
Mikulas Patocka 已提交
648
	int rw = bio_data_dir(bio);
649 650 651

	io->start_time = jiffies;

T
Tejun Heo 已提交
652 653 654
	cpu = part_stat_lock();
	part_round_stats(cpu, &dm_disk(md)->part0);
	part_stat_unlock();
655 656
	atomic_set(&dm_disk(md)->part0.in_flight[rw],
		atomic_inc_return(&md->pending[rw]));
M
Mikulas Patocka 已提交
657 658

	if (unlikely(dm_stats_used(&md->stats)))
659
		dm_stats_account_io(&md->stats, bio->bi_rw, bio->bi_iter.bi_sector,
M
Mikulas Patocka 已提交
660
				    bio_sectors(bio), false, 0, &io->stats_aux);
661 662
}

663
static void end_io_acct(struct dm_io *io)
664 665 666 667
{
	struct mapped_device *md = io->md;
	struct bio *bio = io->bio;
	unsigned long duration = jiffies - io->start_time;
668
	int pending;
669 670
	int rw = bio_data_dir(bio);

671
	generic_end_io_acct(rw, &dm_disk(md)->part0, io->start_time);
672

M
Mikulas Patocka 已提交
673
	if (unlikely(dm_stats_used(&md->stats)))
674
		dm_stats_account_io(&md->stats, bio->bi_rw, bio->bi_iter.bi_sector,
M
Mikulas Patocka 已提交
675 676
				    bio_sectors(bio), true, duration, &io->stats_aux);

677 678
	/*
	 * After this is decremented the bio must not be touched if it is
679
	 * a flush.
680
	 */
681 682
	pending = atomic_dec_return(&md->pending[rw]);
	atomic_set(&dm_disk(md)->part0.in_flight[rw], pending);
683
	pending += atomic_read(&md->pending[rw^0x1]);
684

685 686 687
	/* nudge anyone waiting on suspend queue */
	if (!pending)
		wake_up(&md->wait);
688 689
}

L
Linus Torvalds 已提交
690 691 692
/*
 * Add the bio to the list of deferred io.
 */
M
Mikulas Patocka 已提交
693
static void queue_io(struct mapped_device *md, struct bio *bio)
L
Linus Torvalds 已提交
694
{
695
	unsigned long flags;
L
Linus Torvalds 已提交
696

697
	spin_lock_irqsave(&md->deferred_lock, flags);
L
Linus Torvalds 已提交
698
	bio_list_add(&md->deferred, bio);
699
	spin_unlock_irqrestore(&md->deferred_lock, flags);
700
	queue_work(md->wq, &md->work);
L
Linus Torvalds 已提交
701 702 703 704 705
}

/*
 * Everyone (including functions in this file), should use this
 * function to access the md->map field, and make sure they call
M
Mikulas Patocka 已提交
706
 * dm_put_live_table() when finished.
L
Linus Torvalds 已提交
707
 */
M
Mikulas Patocka 已提交
708
struct dm_table *dm_get_live_table(struct mapped_device *md, int *srcu_idx) __acquires(md->io_barrier)
L
Linus Torvalds 已提交
709
{
M
Mikulas Patocka 已提交
710 711 712 713
	*srcu_idx = srcu_read_lock(&md->io_barrier);

	return srcu_dereference(md->map, &md->io_barrier);
}
L
Linus Torvalds 已提交
714

M
Mikulas Patocka 已提交
715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734
void dm_put_live_table(struct mapped_device *md, int srcu_idx) __releases(md->io_barrier)
{
	srcu_read_unlock(&md->io_barrier, srcu_idx);
}

void dm_sync_table(struct mapped_device *md)
{
	synchronize_srcu(&md->io_barrier);
	synchronize_rcu_expedited();
}

/*
 * A fast alternative to dm_get_live_table/dm_put_live_table.
 * The caller must not block between these two functions.
 */
static struct dm_table *dm_get_live_table_fast(struct mapped_device *md) __acquires(RCU)
{
	rcu_read_lock();
	return rcu_dereference(md->map);
}
L
Linus Torvalds 已提交
735

M
Mikulas Patocka 已提交
736 737 738
static void dm_put_live_table_fast(struct mapped_device *md) __releases(RCU)
{
	rcu_read_unlock();
L
Linus Torvalds 已提交
739 740
}

741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854
/*
 * Open a table device so we can use it as a map destination.
 */
static int open_table_device(struct table_device *td, dev_t dev,
			     struct mapped_device *md)
{
	static char *_claim_ptr = "I belong to device-mapper";
	struct block_device *bdev;

	int r;

	BUG_ON(td->dm_dev.bdev);

	bdev = blkdev_get_by_dev(dev, td->dm_dev.mode | FMODE_EXCL, _claim_ptr);
	if (IS_ERR(bdev))
		return PTR_ERR(bdev);

	r = bd_link_disk_holder(bdev, dm_disk(md));
	if (r) {
		blkdev_put(bdev, td->dm_dev.mode | FMODE_EXCL);
		return r;
	}

	td->dm_dev.bdev = bdev;
	return 0;
}

/*
 * Close a table device that we've been using.
 */
static void close_table_device(struct table_device *td, struct mapped_device *md)
{
	if (!td->dm_dev.bdev)
		return;

	bd_unlink_disk_holder(td->dm_dev.bdev, dm_disk(md));
	blkdev_put(td->dm_dev.bdev, td->dm_dev.mode | FMODE_EXCL);
	td->dm_dev.bdev = NULL;
}

static struct table_device *find_table_device(struct list_head *l, dev_t dev,
					      fmode_t mode) {
	struct table_device *td;

	list_for_each_entry(td, l, list)
		if (td->dm_dev.bdev->bd_dev == dev && td->dm_dev.mode == mode)
			return td;

	return NULL;
}

int dm_get_table_device(struct mapped_device *md, dev_t dev, fmode_t mode,
			struct dm_dev **result) {
	int r;
	struct table_device *td;

	mutex_lock(&md->table_devices_lock);
	td = find_table_device(&md->table_devices, dev, mode);
	if (!td) {
		td = kmalloc(sizeof(*td), GFP_KERNEL);
		if (!td) {
			mutex_unlock(&md->table_devices_lock);
			return -ENOMEM;
		}

		td->dm_dev.mode = mode;
		td->dm_dev.bdev = NULL;

		if ((r = open_table_device(td, dev, md))) {
			mutex_unlock(&md->table_devices_lock);
			kfree(td);
			return r;
		}

		format_dev_t(td->dm_dev.name, dev);

		atomic_set(&td->count, 0);
		list_add(&td->list, &md->table_devices);
	}
	atomic_inc(&td->count);
	mutex_unlock(&md->table_devices_lock);

	*result = &td->dm_dev;
	return 0;
}
EXPORT_SYMBOL_GPL(dm_get_table_device);

void dm_put_table_device(struct mapped_device *md, struct dm_dev *d)
{
	struct table_device *td = container_of(d, struct table_device, dm_dev);

	mutex_lock(&md->table_devices_lock);
	if (atomic_dec_and_test(&td->count)) {
		close_table_device(td, md);
		list_del(&td->list);
		kfree(td);
	}
	mutex_unlock(&md->table_devices_lock);
}
EXPORT_SYMBOL(dm_put_table_device);

static void free_table_devices(struct list_head *devices)
{
	struct list_head *tmp, *next;

	list_for_each_safe(tmp, next, devices) {
		struct table_device *td = list_entry(tmp, struct table_device, list);

		DMWARN("dm_destroy: %s still exists with %d references",
		       td->dm_dev.name, atomic_read(&td->count));
		kfree(td);
	}
}

D
Darrick J. Wong 已提交
855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881
/*
 * 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 已提交
882 883 884 885 886 887 888 889 890
/*-----------------------------------------------------------------
 * 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.
 *---------------------------------------------------------------*/

891 892 893 894 895
static int __noflush_suspending(struct mapped_device *md)
{
	return test_bit(DMF_NOFLUSH_SUSPENDING, &md->flags);
}

L
Linus Torvalds 已提交
896 897 898 899
/*
 * Decrements the number of outstanding ios that a bio has been
 * cloned into, completing the original io if necc.
 */
900
static void dec_pending(struct dm_io *io, int error)
L
Linus Torvalds 已提交
901
{
902
	unsigned long flags;
903 904 905
	int io_error;
	struct bio *bio;
	struct mapped_device *md = io->md;
906 907

	/* Push-back supersedes any I/O errors */
908 909 910 911 912 913
	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 已提交
914 915

	if (atomic_dec_and_test(&io->io_count)) {
916 917 918 919
		if (io->error == DM_ENDIO_REQUEUE) {
			/*
			 * Target requested pushing back the I/O.
			 */
920
			spin_lock_irqsave(&md->deferred_lock, flags);
921 922 923
			if (__noflush_suspending(md))
				bio_list_add_head(&md->deferred, io->bio);
			else
924 925
				/* noflush suspend was interrupted. */
				io->error = -EIO;
926
			spin_unlock_irqrestore(&md->deferred_lock, flags);
927 928
		}

929 930
		io_error = io->error;
		bio = io->bio;
931 932 933 934 935
		end_io_acct(io);
		free_io(md, io);

		if (io_error == DM_ENDIO_REQUEUE)
			return;
936

937
		if ((bio->bi_rw & REQ_FLUSH) && bio->bi_iter.bi_size) {
938
			/*
939 940
			 * Preflush done for flush with data, reissue
			 * without REQ_FLUSH.
941
			 */
942 943
			bio->bi_rw &= ~REQ_FLUSH;
			queue_io(md, bio);
944
		} else {
945
			/* done with normal IO or empty flush */
946
			trace_block_bio_complete(md->queue, bio, io_error);
947 948
			bio->bi_error = io_error;
			bio_endio(bio);
949
		}
L
Linus Torvalds 已提交
950 951 952
	}
}

953 954 955 956 957 958 959 960
static void disable_write_same(struct mapped_device *md)
{
	struct queue_limits *limits = dm_get_queue_limits(md);

	/* device doesn't really support WRITE SAME, disable it */
	limits->max_write_same_sectors = 0;
}

961
static void clone_endio(struct bio *bio)
L
Linus Torvalds 已提交
962
{
963
	int error = bio->bi_error;
964
	int r = error;
M
Mikulas Patocka 已提交
965
	struct dm_target_io *tio = container_of(bio, struct dm_target_io, clone);
966
	struct dm_io *io = tio->io;
S
Stefan Bader 已提交
967
	struct mapped_device *md = tio->io->md;
L
Linus Torvalds 已提交
968 969 970
	dm_endio_fn endio = tio->ti->type->end_io;

	if (endio) {
M
Mikulas Patocka 已提交
971
		r = endio(tio->ti, bio, error);
972 973 974 975 976
		if (r < 0 || r == DM_ENDIO_REQUEUE)
			/*
			 * error and requeue request are handled
			 * in dec_pending().
			 */
L
Linus Torvalds 已提交
977
			error = r;
978 979
		else if (r == DM_ENDIO_INCOMPLETE)
			/* The target will handle the io */
980
			return;
981 982 983 984
		else if (r) {
			DMWARN("unimplemented target endio return value: %d", r);
			BUG();
		}
L
Linus Torvalds 已提交
985 986
	}

987 988 989 990
	if (unlikely(r == -EREMOTEIO && (bio->bi_rw & REQ_WRITE_SAME) &&
		     !bdev_get_queue(bio->bi_bdev)->limits.max_write_same_sectors))
		disable_write_same(md);

S
Stefan Bader 已提交
991
	free_tio(md, tio);
992
	dec_pending(io, error);
L
Linus Torvalds 已提交
993 994
}

995 996 997
/*
 * Partial completion handling for request-based dm
 */
998
static void end_clone_bio(struct bio *clone)
999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014
{
	struct dm_rq_clone_bio_info *info =
		container_of(clone, struct dm_rq_clone_bio_info, clone);
	struct dm_rq_target_io *tio = info->tio;
	struct bio *bio = info->orig;
	unsigned int nr_bytes = info->orig->bi_iter.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;
1015
	else if (bio->bi_error) {
1016 1017 1018 1019 1020
		/*
		 * 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.
		 */
1021
		tio->error = bio->bi_error;
1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045
		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);
}

1046 1047 1048 1049 1050
static struct dm_rq_target_io *tio_from_request(struct request *rq)
{
	return (rq->q->mq_ops ? blk_mq_rq_to_pdu(rq) : rq->special);
}

1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061
static void rq_end_stats(struct mapped_device *md, struct request *orig)
{
	if (unlikely(dm_stats_used(&md->stats))) {
		struct dm_rq_target_io *tio = tio_from_request(orig);
		tio->duration_jiffies = jiffies - tio->duration_jiffies;
		dm_stats_account_io(&md->stats, orig->cmd_flags, blk_rq_pos(orig),
				    tio->n_sectors, true, tio->duration_jiffies,
				    &tio->stats_aux);
	}
}

1062 1063 1064 1065 1066
/*
 * 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.
 */
1067
static void rq_completed(struct mapped_device *md, int rw, bool run_queue)
1068
{
1069 1070
	int nr_requests_pending;

1071
	atomic_dec(&md->pending[rw]);
1072 1073

	/* nudge anyone waiting on suspend queue */
1074 1075
	nr_requests_pending = md_in_flight(md);
	if (!nr_requests_pending)
1076 1077
		wake_up(&md->wait);

1078 1079 1080 1081 1082 1083
	/*
	 * Run this off this callpath, as drivers could invoke end_io while
	 * inside their request_fn (and holding the queue lock). Calling
	 * back into ->request_fn() could deadlock attempting to grab the
	 * queue lock again.
	 */
1084
	if (run_queue) {
1085 1086 1087 1088
		if (md->queue->mq_ops)
			blk_mq_run_hw_queues(md->queue, true);
		else if (!nr_requests_pending ||
			 (nr_requests_pending >= md->queue->nr_congestion_on))
1089 1090
			blk_run_queue_async(md->queue);
	}
1091 1092 1093 1094 1095 1096 1097

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

1098
static void free_rq_clone(struct request *clone)
1099 1100
{
	struct dm_rq_target_io *tio = clone->end_io_data;
1101
	struct mapped_device *md = tio->md;
1102

1103 1104
	blk_rq_unprep_clone(clone);

1105 1106
	if (md->type == DM_TYPE_MQ_REQUEST_BASED)
		/* stacked on blk-mq queue(s) */
1107
		tio->ti->type->release_clone_rq(clone);
1108 1109
	else if (!md->queue->mq_ops)
		/* request_fn queue stacked on request_fn queue(s) */
1110
		free_clone_request(md, clone);
1111 1112 1113 1114 1115
	/*
	 * NOTE: for the blk-mq queue stacked on request_fn queue(s) case:
	 * no need to call free_clone_request() because we leverage blk-mq by
	 * allocating the clone at the end of the blk-mq pdu (see: clone_rq)
	 */
1116 1117 1118

	if (!md->queue->mq_ops)
		free_rq_tio(tio);
1119 1120
}

K
Kiyoshi Ueda 已提交
1121 1122
/*
 * Complete the clone and the original request.
1123 1124
 * Must be called without clone's queue lock held,
 * see end_clone_request() for more details.
K
Kiyoshi Ueda 已提交
1125 1126 1127 1128 1129 1130 1131 1132
 */
static void dm_end_request(struct request *clone, int error)
{
	int rw = rq_data_dir(clone);
	struct dm_rq_target_io *tio = clone->end_io_data;
	struct mapped_device *md = tio->md;
	struct request *rq = tio->orig;

1133
	if (rq->cmd_type == REQ_TYPE_BLOCK_PC) {
K
Kiyoshi Ueda 已提交
1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145
		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;
	}

1146
	free_rq_clone(clone);
1147
	rq_end_stats(md, rq);
1148 1149 1150 1151
	if (!rq->q->mq_ops)
		blk_end_request_all(rq, error);
	else
		blk_mq_end_request(rq, error);
1152
	rq_completed(md, rw, true);
K
Kiyoshi Ueda 已提交
1153 1154
}

1155 1156
static void dm_unprep_request(struct request *rq)
{
1157
	struct dm_rq_target_io *tio = tio_from_request(rq);
1158
	struct request *clone = tio->clone;
1159

1160 1161 1162 1163
	if (!rq->q->mq_ops) {
		rq->special = NULL;
		rq->cmd_flags &= ~REQ_DONTPREP;
	}
1164

1165
	if (clone)
1166
		free_rq_clone(clone);
1167 1168 1169 1170 1171
}

/*
 * Requeue the original request of a clone.
 */
1172
static void old_requeue_request(struct request *rq)
1173 1174 1175 1176 1177 1178
{
	struct request_queue *q = rq->q;
	unsigned long flags;

	spin_lock_irqsave(q->queue_lock, flags);
	blk_requeue_request(q, rq);
J
Junichi Nomura 已提交
1179
	blk_run_queue_async(q);
1180
	spin_unlock_irqrestore(q->queue_lock, flags);
1181 1182
}

1183 1184
static void dm_requeue_original_request(struct mapped_device *md,
					struct request *rq)
1185 1186 1187 1188 1189
{
	int rw = rq_data_dir(rq);

	dm_unprep_request(rq);

1190
	rq_end_stats(md, rq);
1191 1192 1193 1194 1195 1196
	if (!rq->q->mq_ops)
		old_requeue_request(rq);
	else {
		blk_mq_requeue_request(rq);
		blk_mq_kick_requeue_list(rq->q);
	}
1197

1198 1199 1200
	rq_completed(md, rw, false);
}

1201
static void old_stop_queue(struct request_queue *q)
1202 1203 1204
{
	unsigned long flags;

1205 1206 1207
	if (blk_queue_stopped(q))
		return;

1208
	spin_lock_irqsave(q->queue_lock, flags);
1209
	blk_stop_queue(q);
1210 1211 1212
	spin_unlock_irqrestore(q->queue_lock, flags);
}

1213
static void stop_queue(struct request_queue *q)
1214
{
1215 1216 1217 1218
	if (!q->mq_ops)
		old_stop_queue(q);
	else
		blk_mq_stop_hw_queues(q);
1219 1220
}

1221
static void old_start_queue(struct request_queue *q)
1222 1223 1224 1225
{
	unsigned long flags;

	spin_lock_irqsave(q->queue_lock, flags);
1226 1227
	if (blk_queue_stopped(q))
		blk_start_queue(q);
1228 1229 1230
	spin_unlock_irqrestore(q->queue_lock, flags);
}

1231 1232 1233 1234 1235 1236 1237 1238
static void start_queue(struct request_queue *q)
{
	if (!q->mq_ops)
		old_start_queue(q);
	else
		blk_mq_start_stopped_hw_queues(q, true);
}

1239
static void dm_done(struct request *clone, int error, bool mapped)
1240
{
1241
	int r = error;
1242
	struct dm_rq_target_io *tio = clone->end_io_data;
1243
	dm_request_endio_fn rq_end_io = NULL;
1244

1245 1246 1247 1248 1249 1250
	if (tio->ti) {
		rq_end_io = tio->ti->type->rq_end_io;

		if (mapped && rq_end_io)
			r = rq_end_io(tio->ti, clone, error, &tio->info);
	}
1251

1252 1253 1254 1255
	if (unlikely(r == -EREMOTEIO && (clone->cmd_flags & REQ_WRITE_SAME) &&
		     !clone->q->limits.max_write_same_sectors))
		disable_write_same(tio->md);

1256
	if (r <= 0)
1257
		/* The target wants to complete the I/O */
1258 1259
		dm_end_request(clone, r);
	else if (r == DM_ENDIO_INCOMPLETE)
1260 1261
		/* The target will handle the I/O */
		return;
1262
	else if (r == DM_ENDIO_REQUEUE)
1263
		/* The target wants to requeue the I/O */
1264
		dm_requeue_original_request(tio->md, tio->orig);
1265
	else {
1266
		DMWARN("unimplemented target endio return value: %d", r);
1267 1268 1269 1270
		BUG();
	}
}

1271 1272 1273 1274 1275 1276
/*
 * Request completion handler for request-based dm
 */
static void dm_softirq_done(struct request *rq)
{
	bool mapped = true;
1277
	struct dm_rq_target_io *tio = tio_from_request(rq);
1278
	struct request *clone = tio->clone;
1279
	int rw;
1280

1281
	if (!clone) {
1282
		rq_end_stats(tio->md, rq);
1283 1284 1285 1286 1287 1288 1289 1290 1291
		rw = rq_data_dir(rq);
		if (!rq->q->mq_ops) {
			blk_end_request_all(rq, tio->error);
			rq_completed(tio->md, rw, false);
			free_rq_tio(tio);
		} else {
			blk_mq_end_request(rq, tio->error);
			rq_completed(tio->md, rw, false);
		}
1292 1293
		return;
	}
1294 1295 1296 1297 1298 1299 1300

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

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

1301 1302 1303 1304
/*
 * Complete the clone and the original request with the error status
 * through softirq context.
 */
1305
static void dm_complete_request(struct request *rq, int error)
1306
{
1307
	struct dm_rq_target_io *tio = tio_from_request(rq);
1308 1309 1310 1311 1312 1313 1314 1315 1316

	tio->error = error;
	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.
1317
 * This may be used when the target's map_rq() or clone_and_map_rq() functions fail.
1318
 */
1319
static void dm_kill_unmapped_request(struct request *rq, int error)
1320 1321
{
	rq->cmd_flags |= REQ_FAILED;
1322
	dm_complete_request(rq, error);
1323 1324 1325
}

/*
1326
 * Called with the clone's queue lock held (for non-blk-mq)
1327 1328 1329
 */
static void end_clone_request(struct request *clone, int error)
{
1330 1331
	struct dm_rq_target_io *tio = clone->end_io_data;

1332 1333 1334 1335 1336 1337 1338 1339 1340
	if (!clone->q->mq_ops) {
		/*
		 * 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 (REQ_ALLOCED isn't set).
		 */
		__blk_put_request(clone->q, clone);
	}
1341 1342 1343

	/*
	 * Actual request completion is done in a softirq context which doesn't
1344
	 * hold the clone's queue lock.  Otherwise, deadlock could occur because:
1345 1346 1347
	 *     - 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
1348
	 *       against this clone's queue
1349
	 */
1350
	dm_complete_request(tio->orig, error);
1351 1352
}

1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364
/*
 * 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 已提交
1365
{
1366
	sector_t len = max_io_len_target_boundary(sector, ti);
1367
	sector_t offset, max_len;
L
Linus Torvalds 已提交
1368 1369

	/*
1370
	 * Does the target need to split even further?
L
Linus Torvalds 已提交
1371
	 */
1372 1373 1374 1375 1376 1377 1378 1379 1380 1381
	if (ti->max_io_len) {
		offset = dm_target_offset(ti, sector);
		if (unlikely(ti->max_io_len & (ti->max_io_len - 1)))
			max_len = sector_div(offset, ti->max_io_len);
		else
			max_len = offset & (ti->max_io_len - 1);
		max_len = ti->max_io_len - max_len;

		if (len > max_len)
			len = max_len;
L
Linus Torvalds 已提交
1382 1383 1384 1385 1386
	}

	return len;
}

1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401
int dm_set_target_max_io_len(struct dm_target *ti, sector_t len)
{
	if (len > UINT_MAX) {
		DMERR("Specified maximum size of target IO (%llu) exceeds limit (%u)",
		      (unsigned long long)len, UINT_MAX);
		ti->error = "Maximum size of target IO is too large";
		return -EINVAL;
	}

	ti->max_io_len = (uint32_t) len;

	return 0;
}
EXPORT_SYMBOL_GPL(dm_set_target_max_io_len);

1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441
/*
 * A target may call dm_accept_partial_bio only from the map routine.  It is
 * allowed for all bio types except REQ_FLUSH.
 *
 * dm_accept_partial_bio informs the dm that the target only wants to process
 * additional n_sectors sectors of the bio and the rest of the data should be
 * sent in a next bio.
 *
 * A diagram that explains the arithmetics:
 * +--------------------+---------------+-------+
 * |         1          |       2       |   3   |
 * +--------------------+---------------+-------+
 *
 * <-------------- *tio->len_ptr --------------->
 *                      <------- bi_size ------->
 *                      <-- n_sectors -->
 *
 * Region 1 was already iterated over with bio_advance or similar function.
 *	(it may be empty if the target doesn't use bio_advance)
 * Region 2 is the remaining bio size that the target wants to process.
 *	(it may be empty if region 1 is non-empty, although there is no reason
 *	 to make it empty)
 * The target requires that region 3 is to be sent in the next bio.
 *
 * If the target wants to receive multiple copies of the bio (via num_*bios, etc),
 * the partially processed part (the sum of regions 1+2) must be the same for all
 * copies of the bio.
 */
void dm_accept_partial_bio(struct bio *bio, unsigned n_sectors)
{
	struct dm_target_io *tio = container_of(bio, struct dm_target_io, clone);
	unsigned bi_size = bio->bi_iter.bi_size >> SECTOR_SHIFT;
	BUG_ON(bio->bi_rw & REQ_FLUSH);
	BUG_ON(bi_size > *tio->len_ptr);
	BUG_ON(n_sectors > bi_size);
	*tio->len_ptr -= bi_size - n_sectors;
	bio->bi_iter.bi_size = n_sectors << SECTOR_SHIFT;
}
EXPORT_SYMBOL_GPL(dm_accept_partial_bio);

A
Alasdair G Kergon 已提交
1442
static void __map_bio(struct dm_target_io *tio)
L
Linus Torvalds 已提交
1443 1444
{
	int r;
1445
	sector_t sector;
S
Stefan Bader 已提交
1446
	struct mapped_device *md;
1447
	struct bio *clone = &tio->clone;
A
Alasdair G Kergon 已提交
1448
	struct dm_target *ti = tio->ti;
L
Linus Torvalds 已提交
1449 1450 1451 1452 1453 1454 1455 1456 1457

	clone->bi_end_io = clone_endio;

	/*
	 * 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);
1458
	sector = clone->bi_iter.bi_sector;
M
Mikulas Patocka 已提交
1459
	r = ti->type->map(ti, clone);
1460
	if (r == DM_MAPIO_REMAPPED) {
L
Linus Torvalds 已提交
1461
		/* the bio has been remapped so dispatch it */
1462

1463 1464
		trace_block_bio_remap(bdev_get_queue(clone->bi_bdev), clone,
				      tio->io->bio->bi_bdev->bd_dev, sector);
1465

L
Linus Torvalds 已提交
1466
		generic_make_request(clone);
1467 1468
	} else if (r < 0 || r == DM_MAPIO_REQUEUE) {
		/* error the io and bail out, or requeue it if needed */
S
Stefan Bader 已提交
1469 1470 1471
		md = tio->io->md;
		dec_pending(tio->io, r);
		free_tio(md, tio);
1472 1473 1474
	} else if (r) {
		DMWARN("unimplemented target map return value: %d", r);
		BUG();
L
Linus Torvalds 已提交
1475 1476 1477 1478 1479 1480 1481 1482 1483
	}
}

struct clone_info {
	struct mapped_device *md;
	struct dm_table *map;
	struct bio *bio;
	struct dm_io *io;
	sector_t sector;
1484
	unsigned sector_count;
L
Linus Torvalds 已提交
1485 1486
};

1487
static void bio_setup_sector(struct bio *bio, sector_t sector, unsigned len)
A
Alasdair G Kergon 已提交
1488
{
1489 1490
	bio->bi_iter.bi_sector = sector;
	bio->bi_iter.bi_size = to_bytes(len);
L
Linus Torvalds 已提交
1491 1492 1493 1494 1495
}

/*
 * Creates a bio that consists of range of complete bvecs.
 */
1496
static void clone_bio(struct dm_target_io *tio, struct bio *bio,
1497
		      sector_t sector, unsigned len)
L
Linus Torvalds 已提交
1498
{
1499
	struct bio *clone = &tio->clone;
L
Linus Torvalds 已提交
1500

1501 1502 1503 1504
	__bio_clone_fast(clone, bio);

	if (bio_integrity(bio))
		bio_integrity_clone(clone, bio, GFP_NOIO);
A
Alasdair G Kergon 已提交
1505

1506 1507 1508 1509 1510
	bio_advance(clone, to_bytes(sector - clone->bi_iter.bi_sector));
	clone->bi_iter.bi_size = to_bytes(len);

	if (bio_integrity(bio))
		bio_integrity_trim(clone, 0, len);
L
Linus Torvalds 已提交
1511 1512
}

1513
static struct dm_target_io *alloc_tio(struct clone_info *ci,
1514
				      struct dm_target *ti,
1515
				      unsigned target_bio_nr)
1516
{
1517 1518 1519
	struct dm_target_io *tio;
	struct bio *clone;

1520
	clone = bio_alloc_bioset(GFP_NOIO, 0, ci->md->bs);
1521
	tio = container_of(clone, struct dm_target_io, clone);
1522 1523 1524

	tio->io = ci->io;
	tio->ti = ti;
1525
	tio->target_bio_nr = target_bio_nr;
1526 1527 1528 1529

	return tio;
}

1530 1531
static void __clone_and_map_simple_bio(struct clone_info *ci,
				       struct dm_target *ti,
1532
				       unsigned target_bio_nr, unsigned *len)
1533
{
1534
	struct dm_target_io *tio = alloc_tio(ci, ti, target_bio_nr);
1535
	struct bio *clone = &tio->clone;
1536

1537 1538
	tio->len_ptr = len;

1539
	__bio_clone_fast(clone, ci->bio);
A
Alasdair G Kergon 已提交
1540
	if (len)
1541
		bio_setup_sector(clone, ci->sector, *len);
1542

A
Alasdair G Kergon 已提交
1543
	__map_bio(tio);
1544 1545
}

1546
static void __send_duplicate_bios(struct clone_info *ci, struct dm_target *ti,
1547
				  unsigned num_bios, unsigned *len)
1548
{
1549
	unsigned target_bio_nr;
1550

1551
	for (target_bio_nr = 0; target_bio_nr < num_bios; target_bio_nr++)
1552
		__clone_and_map_simple_bio(ci, ti, target_bio_nr, len);
1553 1554
}

1555
static int __send_empty_flush(struct clone_info *ci)
1556
{
1557
	unsigned target_nr = 0;
1558 1559
	struct dm_target *ti;

1560
	BUG_ON(bio_has_data(ci->bio));
1561
	while ((ti = dm_table_get_target(ci->map, target_nr++)))
1562
		__send_duplicate_bios(ci, ti, ti->num_flush_bios, NULL);
1563 1564 1565 1566

	return 0;
}

A
Alasdair G Kergon 已提交
1567
static void __clone_and_map_data_bio(struct clone_info *ci, struct dm_target *ti,
1568
				     sector_t sector, unsigned *len)
M
Mike Snitzer 已提交
1569
{
1570
	struct bio *bio = ci->bio;
M
Mike Snitzer 已提交
1571
	struct dm_target_io *tio;
1572 1573
	unsigned target_bio_nr;
	unsigned num_target_bios = 1;
M
Mike Snitzer 已提交
1574

1575 1576 1577 1578 1579
	/*
	 * Does the target want to receive duplicate copies of the bio?
	 */
	if (bio_data_dir(bio) == WRITE && ti->num_write_bios)
		num_target_bios = ti->num_write_bios(ti, bio);
A
Alasdair G Kergon 已提交
1580

1581
	for (target_bio_nr = 0; target_bio_nr < num_target_bios; target_bio_nr++) {
1582
		tio = alloc_tio(ci, ti, target_bio_nr);
1583 1584
		tio->len_ptr = len;
		clone_bio(tio, bio, sector, *len);
1585 1586
		__map_bio(tio);
	}
M
Mike Snitzer 已提交
1587 1588
}

1589
typedef unsigned (*get_num_bios_fn)(struct dm_target *ti);
M
Mike Snitzer 已提交
1590

1591
static unsigned get_num_discard_bios(struct dm_target *ti)
M
Mike Snitzer 已提交
1592
{
1593
	return ti->num_discard_bios;
M
Mike Snitzer 已提交
1594 1595
}

1596
static unsigned get_num_write_same_bios(struct dm_target *ti)
M
Mike Snitzer 已提交
1597
{
1598
	return ti->num_write_same_bios;
M
Mike Snitzer 已提交
1599 1600 1601 1602 1603 1604
}

typedef bool (*is_split_required_fn)(struct dm_target *ti);

static bool is_split_required_for_discard(struct dm_target *ti)
{
1605
	return ti->split_discard_bios;
M
Mike Snitzer 已提交
1606 1607
}

1608 1609 1610
static int __send_changing_extent_only(struct clone_info *ci,
				       get_num_bios_fn get_num_bios,
				       is_split_required_fn is_split_required)
M
Mike Snitzer 已提交
1611 1612
{
	struct dm_target *ti;
1613
	unsigned len;
1614
	unsigned num_bios;
M
Mike Snitzer 已提交
1615

1616 1617 1618 1619
	do {
		ti = dm_table_find_target(ci->map, ci->sector);
		if (!dm_target_is_valid(ti))
			return -EIO;
M
Mike Snitzer 已提交
1620 1621

		/*
M
Mike Snitzer 已提交
1622 1623
		 * Even though the device advertised support for this type of
		 * request, that does not mean every target supports it, and
M
Mike Snitzer 已提交
1624
		 * reconfiguration might also have changed that since the
1625
		 * check was performed.
M
Mike Snitzer 已提交
1626
		 */
1627 1628
		num_bios = get_num_bios ? get_num_bios(ti) : 0;
		if (!num_bios)
1629
			return -EOPNOTSUPP;
M
Mike Snitzer 已提交
1630

M
Mike Snitzer 已提交
1631
		if (is_split_required && !is_split_required(ti))
1632
			len = min((sector_t)ci->sector_count, max_io_len_target_boundary(ci->sector, ti));
1633
		else
1634
			len = min((sector_t)ci->sector_count, max_io_len(ci->sector, ti));
1635

1636
		__send_duplicate_bios(ci, ti, num_bios, &len);
1637 1638 1639

		ci->sector += len;
	} while (ci->sector_count -= len);
M
Mike Snitzer 已提交
1640 1641 1642 1643

	return 0;
}

1644
static int __send_discard(struct clone_info *ci)
M
Mike Snitzer 已提交
1645
{
1646 1647
	return __send_changing_extent_only(ci, get_num_discard_bios,
					   is_split_required_for_discard);
M
Mike Snitzer 已提交
1648 1649
}

1650
static int __send_write_same(struct clone_info *ci)
M
Mike Snitzer 已提交
1651
{
1652
	return __send_changing_extent_only(ci, get_num_write_same_bios, NULL);
M
Mike Snitzer 已提交
1653 1654
}

A
Alasdair G Kergon 已提交
1655 1656 1657
/*
 * Select the correct strategy for processing a non-flush bio.
 */
1658
static int __split_and_process_non_flush(struct clone_info *ci)
L
Linus Torvalds 已提交
1659
{
1660
	struct bio *bio = ci->bio;
1661
	struct dm_target *ti;
1662
	unsigned len;
L
Linus Torvalds 已提交
1663

M
Mike Snitzer 已提交
1664
	if (unlikely(bio->bi_rw & REQ_DISCARD))
1665
		return __send_discard(ci);
M
Mike Snitzer 已提交
1666
	else if (unlikely(bio->bi_rw & REQ_WRITE_SAME))
1667
		return __send_write_same(ci);
M
Mike Snitzer 已提交
1668

1669 1670 1671 1672
	ti = dm_table_find_target(ci->map, ci->sector);
	if (!dm_target_is_valid(ti))
		return -EIO;

1673
	len = min_t(sector_t, max_io_len(ci->sector, ti), ci->sector_count);
L
Linus Torvalds 已提交
1674

1675
	__clone_and_map_data_bio(ci, ti, ci->sector, &len);
L
Linus Torvalds 已提交
1676

1677 1678
	ci->sector += len;
	ci->sector_count -= len;
L
Linus Torvalds 已提交
1679

1680
	return 0;
L
Linus Torvalds 已提交
1681 1682 1683
}

/*
1684
 * Entry point to split a bio into clones and submit them to the targets.
L
Linus Torvalds 已提交
1685
 */
M
Mikulas Patocka 已提交
1686 1687
static void __split_and_process_bio(struct mapped_device *md,
				    struct dm_table *map, struct bio *bio)
L
Linus Torvalds 已提交
1688 1689
{
	struct clone_info ci;
1690
	int error = 0;
L
Linus Torvalds 已提交
1691

M
Mikulas Patocka 已提交
1692
	if (unlikely(!map)) {
1693
		bio_io_error(bio);
1694 1695
		return;
	}
1696

M
Mikulas Patocka 已提交
1697
	ci.map = map;
L
Linus Torvalds 已提交
1698 1699 1700 1701 1702 1703
	ci.md = md;
	ci.io = alloc_io(md);
	ci.io->error = 0;
	atomic_set(&ci.io->io_count, 1);
	ci.io->bio = bio;
	ci.io->md = md;
1704
	spin_lock_init(&ci.io->endio_lock);
1705
	ci.sector = bio->bi_iter.bi_sector;
L
Linus Torvalds 已提交
1706

1707
	start_io_acct(ci.io);
A
Alasdair G Kergon 已提交
1708

1709 1710 1711
	if (bio->bi_rw & REQ_FLUSH) {
		ci.bio = &ci.md->flush_bio;
		ci.sector_count = 0;
1712
		error = __send_empty_flush(&ci);
1713 1714
		/* dec_pending submits any data associated with flush */
	} else {
1715
		ci.bio = bio;
1716
		ci.sector_count = bio_sectors(bio);
1717
		while (ci.sector_count && !error)
1718
			error = __split_and_process_non_flush(&ci);
1719
	}
L
Linus Torvalds 已提交
1720 1721

	/* drop the extra reference count */
1722
	dec_pending(ci.io, error);
L
Linus Torvalds 已提交
1723 1724 1725 1726 1727
}
/*-----------------------------------------------------------------
 * CRUD END
 *---------------------------------------------------------------*/

M
Milan Broz 已提交
1728 1729 1730 1731 1732
static int dm_merge_bvec(struct request_queue *q,
			 struct bvec_merge_data *bvm,
			 struct bio_vec *biovec)
{
	struct mapped_device *md = q->queuedata;
M
Mikulas Patocka 已提交
1733
	struct dm_table *map = dm_get_live_table_fast(md);
M
Milan Broz 已提交
1734
	struct dm_target *ti;
1735
	sector_t max_sectors, max_size = 0;
M
Milan Broz 已提交
1736 1737

	if (unlikely(!map))
1738
		goto out;
M
Milan Broz 已提交
1739 1740

	ti = dm_table_find_target(map, bvm->bi_sector);
1741
	if (!dm_target_is_valid(ti))
M
Mikulas Patocka 已提交
1742
		goto out;
M
Milan Broz 已提交
1743 1744 1745 1746

	/*
	 * Find maximum amount of I/O that won't need splitting
	 */
1747
	max_sectors = min(max_io_len(bvm->bi_sector, ti),
1748
			  (sector_t) queue_max_sectors(q));
M
Milan Broz 已提交
1749
	max_size = (max_sectors << SECTOR_SHIFT) - bvm->bi_size;
1750 1751 1752 1753 1754 1755 1756 1757 1758 1759

	/*
	 * FIXME: this stop-gap fix _must_ be cleaned up (by passing a sector_t
	 * to the targets' merge function since it holds sectors not bytes).
	 * Just doing this as an interim fix for stable@ because the more
	 * comprehensive cleanup of switching to sector_t will impact every
	 * DM target that implements a ->merge hook.
	 */
	if (max_size > INT_MAX)
		max_size = INT_MAX;
M
Milan Broz 已提交
1760 1761 1762 1763 1764 1765 1766

	/*
	 * 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)
1767
		max_size = ti->type->merge(ti, bvm, biovec, (int) max_size);
1768 1769
	/*
	 * If the target doesn't support merge method and some of the devices
1770 1771 1772 1773
	 * provided their merge_bvec method (we know this by looking for the
	 * max_hw_sectors that dm_set_device_limits may set), 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.
1774 1775 1776
	 */
	else if (queue_max_hw_sectors(q) <= PAGE_SIZE >> 9)
		max_size = 0;
M
Milan Broz 已提交
1777

1778
out:
M
Mikulas Patocka 已提交
1779
	dm_put_live_table_fast(md);
M
Milan Broz 已提交
1780 1781 1782 1783 1784 1785 1786 1787 1788
	/*
	 * 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 已提交
1789 1790 1791 1792
/*
 * The request function that just remaps the bio built up by
 * dm_merge_bvec.
 */
1793
static void dm_make_request(struct request_queue *q, struct bio *bio)
L
Linus Torvalds 已提交
1794
{
1795
	int rw = bio_data_dir(bio);
L
Linus Torvalds 已提交
1796
	struct mapped_device *md = q->queuedata;
M
Mikulas Patocka 已提交
1797 1798
	int srcu_idx;
	struct dm_table *map;
L
Linus Torvalds 已提交
1799

M
Mikulas Patocka 已提交
1800
	map = dm_get_live_table(md, &srcu_idx);
L
Linus Torvalds 已提交
1801

1802 1803
	blk_queue_split(q, &bio, q->bio_split);

1804
	generic_start_io_acct(rw, bio_sectors(bio), &dm_disk(md)->part0);
1805

1806 1807
	/* if we're suspended, we have to queue this io for later */
	if (unlikely(test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags))) {
M
Mikulas Patocka 已提交
1808
		dm_put_live_table(md, srcu_idx);
L
Linus Torvalds 已提交
1809

1810 1811 1812
		if (bio_rw(bio) != READA)
			queue_io(md, bio);
		else
A
Alasdair G Kergon 已提交
1813
			bio_io_error(bio);
1814
		return;
L
Linus Torvalds 已提交
1815 1816
	}

M
Mikulas Patocka 已提交
1817 1818
	__split_and_process_bio(md, map, bio);
	dm_put_live_table(md, srcu_idx);
1819
	return;
1820 1821
}

M
Mikulas Patocka 已提交
1822
int dm_request_based(struct mapped_device *md)
1823 1824 1825 1826
{
	return blk_queue_stackable(md->queue);
}

1827
static void dm_dispatch_clone_request(struct request *clone, struct request *rq)
1828 1829 1830
{
	int r;

1831 1832
	if (blk_queue_io_stat(clone->q))
		clone->cmd_flags |= REQ_IO_STAT;
1833

1834 1835
	clone->start_time = jiffies;
	r = blk_insert_cloned_request(clone->q, clone);
1836
	if (r)
1837
		/* must complete clone in terms of original request */
1838 1839 1840
		dm_complete_request(rq, r);
}

1841 1842
static int dm_rq_bio_constructor(struct bio *bio, struct bio *bio_orig,
				 void *data)
1843
{
1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856
	struct dm_rq_target_io *tio = data;
	struct dm_rq_clone_bio_info *info =
		container_of(bio, struct dm_rq_clone_bio_info, clone);

	info->orig = bio_orig;
	info->tio = tio;
	bio->bi_end_io = end_clone_bio;

	return 0;
}

static int setup_clone(struct request *clone, struct request *rq,
		       struct dm_rq_target_io *tio, gfp_t gfp_mask)
1857
{
1858 1859 1860 1861 1862 1863 1864 1865 1866 1867
	int r;

	r = blk_rq_prep_clone(clone, rq, tio->md->bs, gfp_mask,
			      dm_rq_bio_constructor, tio);
	if (r)
		return r;

	clone->cmd = rq->cmd;
	clone->cmd_len = rq->cmd_len;
	clone->sense = rq->sense;
1868 1869
	clone->end_io = end_clone_request;
	clone->end_io_data = tio;
1870

1871
	tio->clone = clone;
1872 1873

	return 0;
1874 1875
}

K
Kiyoshi Ueda 已提交
1876
static struct request *clone_rq(struct request *rq, struct mapped_device *md,
1877
				struct dm_rq_target_io *tio, gfp_t gfp_mask)
1878
{
1879 1880 1881 1882 1883 1884
	/*
	 * Do not allocate a clone if tio->clone was already set
	 * (see: dm_mq_queue_rq).
	 */
	bool alloc_clone = !tio->clone;
	struct request *clone;
1885

1886 1887 1888 1889 1890 1891
	if (alloc_clone) {
		clone = alloc_clone_request(md, gfp_mask);
		if (!clone)
			return NULL;
	} else
		clone = tio->clone;
1892 1893

	blk_rq_init(NULL, clone);
1894 1895 1896 1897 1898 1899
	if (setup_clone(clone, rq, tio, gfp_mask)) {
		/* -ENOMEM */
		if (alloc_clone)
			free_clone_request(md, clone);
		return NULL;
	}
1900 1901 1902 1903

	return clone;
}

1904 1905
static void map_tio_request(struct kthread_work *work);

1906 1907 1908 1909 1910 1911 1912 1913 1914
static void init_tio(struct dm_rq_target_io *tio, struct request *rq,
		     struct mapped_device *md)
{
	tio->md = md;
	tio->ti = NULL;
	tio->clone = NULL;
	tio->orig = rq;
	tio->error = 0;
	memset(&tio->info, 0, sizeof(tio->info));
1915 1916
	if (md->kworker_task)
		init_kthread_work(&tio->work, map_tio_request);
1917 1918
}

1919 1920
static struct dm_rq_target_io *prep_tio(struct request *rq,
					struct mapped_device *md, gfp_t gfp_mask)
K
Kiyoshi Ueda 已提交
1921 1922
{
	struct dm_rq_target_io *tio;
1923 1924
	int srcu_idx;
	struct dm_table *table;
K
Kiyoshi Ueda 已提交
1925 1926 1927 1928 1929

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

1930
	init_tio(tio, rq, md);
K
Kiyoshi Ueda 已提交
1931

1932 1933 1934 1935 1936 1937 1938
	table = dm_get_live_table(md, &srcu_idx);
	if (!dm_table_mq_request_based(table)) {
		if (!clone_rq(rq, md, tio, gfp_mask)) {
			dm_put_live_table(md, srcu_idx);
			free_rq_tio(tio);
			return NULL;
		}
K
Kiyoshi Ueda 已提交
1939
	}
1940
	dm_put_live_table(md, srcu_idx);
K
Kiyoshi Ueda 已提交
1941

1942
	return tio;
K
Kiyoshi Ueda 已提交
1943 1944
}

1945 1946 1947 1948 1949 1950
/*
 * Called with the queue lock held.
 */
static int dm_prep_fn(struct request_queue *q, struct request *rq)
{
	struct mapped_device *md = q->queuedata;
1951
	struct dm_rq_target_io *tio;
1952 1953 1954 1955 1956 1957

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

1958 1959
	tio = prep_tio(rq, md, GFP_ATOMIC);
	if (!tio)
1960 1961
		return BLKPREP_DEFER;

1962
	rq->special = tio;
1963 1964 1965 1966 1967
	rq->cmd_flags |= REQ_DONTPREP;

	return BLKPREP_OK;
}

1968 1969
/*
 * Returns:
1970 1971 1972
 * 0                : the request has been processed
 * DM_MAPIO_REQUEUE : the original request needs to be requeued
 * < 0              : the request was completed due to failure
1973
 */
1974
static int map_request(struct dm_rq_target_io *tio, struct request *rq,
1975
		       struct mapped_device *md)
1976
{
1977
	int r;
1978
	struct dm_target *ti = tio->ti;
1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990
	struct request *clone = NULL;

	if (tio->clone) {
		clone = tio->clone;
		r = ti->type->map_rq(ti, clone, &tio->info);
	} else {
		r = ti->type->clone_and_map_rq(ti, rq, &tio->info, &clone);
		if (r < 0) {
			/* The target wants to complete the I/O */
			dm_kill_unmapped_request(rq, r);
			return r;
		}
1991 1992
		if (r != DM_MAPIO_REMAPPED)
			return r;
1993 1994 1995 1996 1997
		if (setup_clone(clone, rq, tio, GFP_ATOMIC)) {
			/* -ENOMEM */
			ti->type->release_clone_rq(clone);
			return DM_MAPIO_REQUEUE;
		}
1998
	}
1999 2000 2001 2002 2003 2004 2005

	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 */
2006
		trace_block_rq_remap(clone->q, clone, disk_devt(dm_disk(md)),
2007 2008
				     blk_rq_pos(rq));
		dm_dispatch_clone_request(clone, rq);
2009 2010 2011
		break;
	case DM_MAPIO_REQUEUE:
		/* The target wants to requeue the I/O */
2012
		dm_requeue_original_request(md, tio->orig);
2013 2014 2015 2016 2017 2018 2019 2020
		break;
	default:
		if (r > 0) {
			DMWARN("unimplemented target map return value: %d", r);
			BUG();
		}

		/* The target wants to complete the I/O */
2021
		dm_kill_unmapped_request(rq, r);
2022
		return r;
2023
	}
2024

2025
	return 0;
2026 2027
}

2028
static void map_tio_request(struct kthread_work *work)
2029
{
2030
	struct dm_rq_target_io *tio = container_of(work, struct dm_rq_target_io, work);
2031 2032
	struct request *rq = tio->orig;
	struct mapped_device *md = tio->md;
2033

2034
	if (map_request(tio, rq, md) == DM_MAPIO_REQUEUE)
2035
		dm_requeue_original_request(md, rq);
2036 2037
}

2038
static void dm_start_request(struct mapped_device *md, struct request *orig)
2039
{
2040 2041 2042 2043
	if (!orig->q->mq_ops)
		blk_start_request(orig);
	else
		blk_mq_start_request(orig);
2044
	atomic_inc(&md->pending[rq_data_dir(orig)]);
2045

2046 2047 2048 2049 2050
	if (md->seq_rq_merge_deadline_usecs) {
		md->last_rq_pos = rq_end_sector(orig);
		md->last_rq_rw = rq_data_dir(orig);
		md->last_rq_start_time = ktime_get();
	}
2051

2052 2053 2054 2055 2056 2057 2058 2059
	if (unlikely(dm_stats_used(&md->stats))) {
		struct dm_rq_target_io *tio = tio_from_request(orig);
		tio->duration_jiffies = jiffies;
		tio->n_sectors = blk_rq_sectors(orig);
		dm_stats_account_io(&md->stats, orig->cmd_flags, blk_rq_pos(orig),
				    tio->n_sectors, false, 0, &tio->stats_aux);
	}

2060 2061 2062 2063 2064 2065 2066 2067 2068 2069
	/*
	 * 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);
}

2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081
#define MAX_SEQ_RQ_MERGE_DEADLINE_USECS 100000

ssize_t dm_attr_rq_based_seq_io_merge_deadline_show(struct mapped_device *md, char *buf)
{
	return sprintf(buf, "%u\n", md->seq_rq_merge_deadline_usecs);
}

ssize_t dm_attr_rq_based_seq_io_merge_deadline_store(struct mapped_device *md,
						     const char *buf, size_t count)
{
	unsigned deadline;

2082
	if (!dm_request_based(md) || md->use_blk_mq)
2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108
		return count;

	if (kstrtouint(buf, 10, &deadline))
		return -EINVAL;

	if (deadline > MAX_SEQ_RQ_MERGE_DEADLINE_USECS)
		deadline = MAX_SEQ_RQ_MERGE_DEADLINE_USECS;

	md->seq_rq_merge_deadline_usecs = deadline;

	return count;
}

static bool dm_request_peeked_before_merge_deadline(struct mapped_device *md)
{
	ktime_t kt_deadline;

	if (!md->seq_rq_merge_deadline_usecs)
		return false;

	kt_deadline = ns_to_ktime((u64)md->seq_rq_merge_deadline_usecs * NSEC_PER_USEC);
	kt_deadline = ktime_add_safe(md->last_rq_start_time, kt_deadline);

	return !ktime_after(ktime_get(), kt_deadline);
}

2109 2110 2111 2112 2113 2114 2115
/*
 * 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;
M
Mikulas Patocka 已提交
2116 2117
	int srcu_idx;
	struct dm_table *map = dm_get_live_table(md, &srcu_idx);
2118
	struct dm_target *ti;
2119
	struct request *rq;
2120
	struct dm_rq_target_io *tio;
2121
	sector_t pos;
2122 2123

	/*
2124 2125 2126 2127
	 * 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().
2128
	 */
J
Jens Axboe 已提交
2129
	while (!blk_queue_stopped(q)) {
2130 2131
		rq = blk_peek_request(q);
		if (!rq)
2132
			goto out;
2133

2134 2135 2136 2137 2138 2139
		/* always use block 0 to find the target for flushes for now */
		pos = 0;
		if (!(rq->cmd_flags & REQ_FLUSH))
			pos = blk_rq_pos(rq);

		ti = dm_table_find_target(map, pos);
2140 2141
		if (!dm_target_is_valid(ti)) {
			/*
2142
			 * Must perform setup, that rq_completed() requires,
2143 2144 2145
			 * before calling dm_kill_unmapped_request
			 */
			DMERR_LIMIT("request attempted access beyond the end of device");
2146 2147
			dm_start_request(md, rq);
			dm_kill_unmapped_request(rq, -EIO);
2148 2149
			continue;
		}
2150

2151 2152
		if (dm_request_peeked_before_merge_deadline(md) &&
		    md_in_flight(md) && rq->bio && rq->bio->bi_vcnt == 1 &&
2153 2154 2155
		    md->last_rq_pos == pos && md->last_rq_rw == rq_data_dir(rq))
			goto delay_and_out;

2156
		if (ti->type->busy && ti->type->busy(ti))
J
Jens Axboe 已提交
2157
			goto delay_and_out;
2158

2159
		dm_start_request(md, rq);
2160

2161
		tio = tio_from_request(rq);
2162 2163 2164
		/* Establish tio->ti before queuing work (map_tio_request) */
		tio->ti = ti;
		queue_kthread_work(&md->kworker, &tio->work);
2165
		BUG_ON(!irqs_disabled());
2166 2167 2168 2169
	}

	goto out;

J
Jens Axboe 已提交
2170
delay_and_out:
2171
	blk_delay_queue(q, HZ / 100);
2172
out:
M
Mikulas Patocka 已提交
2173
	dm_put_live_table(md, srcu_idx);
2174 2175
}

L
Linus Torvalds 已提交
2176 2177
static int dm_any_congested(void *congested_data, int bdi_bits)
{
2178 2179 2180
	int r = bdi_bits;
	struct mapped_device *md = congested_data;
	struct dm_table *map;
L
Linus Torvalds 已提交
2181

2182
	if (!test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) {
M
Mikulas Patocka 已提交
2183
		map = dm_get_live_table_fast(md);
2184
		if (map) {
2185 2186 2187 2188 2189
			/*
			 * Request-based dm cares about only own queue for
			 * the query about congestion status of request_queue
			 */
			if (dm_request_based(md))
2190
				r = md->queue->backing_dev_info.wb.state &
2191 2192 2193
				    bdi_bits;
			else
				r = dm_table_any_congested(map, bdi_bits);
2194
		}
M
Mikulas Patocka 已提交
2195
		dm_put_live_table_fast(md);
2196 2197
	}

L
Linus Torvalds 已提交
2198 2199 2200 2201 2202 2203
	return r;
}

/*-----------------------------------------------------------------
 * An IDR is used to keep track of allocated minor numbers.
 *---------------------------------------------------------------*/
2204
static void free_minor(int minor)
L
Linus Torvalds 已提交
2205
{
2206
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
2207
	idr_remove(&_minor_idr, minor);
2208
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
2209 2210 2211 2212 2213
}

/*
 * See if the device with a specific minor # is free.
 */
2214
static int specific_minor(int minor)
L
Linus Torvalds 已提交
2215
{
T
Tejun Heo 已提交
2216
	int r;
L
Linus Torvalds 已提交
2217 2218 2219 2220

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

T
Tejun Heo 已提交
2221
	idr_preload(GFP_KERNEL);
2222
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
2223

T
Tejun Heo 已提交
2224
	r = idr_alloc(&_minor_idr, MINOR_ALLOCED, minor, minor + 1, GFP_NOWAIT);
L
Linus Torvalds 已提交
2225

2226
	spin_unlock(&_minor_lock);
T
Tejun Heo 已提交
2227 2228 2229 2230
	idr_preload_end();
	if (r < 0)
		return r == -ENOSPC ? -EBUSY : r;
	return 0;
L
Linus Torvalds 已提交
2231 2232
}

2233
static int next_free_minor(int *minor)
L
Linus Torvalds 已提交
2234
{
T
Tejun Heo 已提交
2235
	int r;
J
Jeff Mahoney 已提交
2236

T
Tejun Heo 已提交
2237
	idr_preload(GFP_KERNEL);
2238
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
2239

T
Tejun Heo 已提交
2240
	r = idr_alloc(&_minor_idr, MINOR_ALLOCED, 0, 1 << MINORBITS, GFP_NOWAIT);
L
Linus Torvalds 已提交
2241

2242
	spin_unlock(&_minor_lock);
T
Tejun Heo 已提交
2243 2244 2245 2246 2247
	idr_preload_end();
	if (r < 0)
		return r;
	*minor = r;
	return 0;
L
Linus Torvalds 已提交
2248 2249
}

2250
static const struct block_device_operations dm_blk_dops;
L
Linus Torvalds 已提交
2251

2252 2253
static void dm_wq_work(struct work_struct *work);

2254 2255 2256 2257
static void dm_init_md_queue(struct mapped_device *md)
{
	/*
	 * Request-based dm devices cannot be stacked on top of bio-based dm
2258
	 * devices.  The type of this dm device may not have been decided yet.
2259 2260 2261 2262 2263 2264 2265
	 * 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);
2266
}
2267

2268 2269
static void dm_init_old_md_queue(struct mapped_device *md)
{
2270
	md->use_blk_mq = false;
2271 2272 2273 2274 2275
	dm_init_md_queue(md);

	/*
	 * Initialize aspects of queue that aren't relevant for blk-mq
	 */
2276 2277 2278
	md->queue->queuedata = md;
	md->queue->backing_dev_info.congested_fn = dm_any_congested;
	md->queue->backing_dev_info.congested_data = md;
2279

2280 2281 2282
	blk_queue_bounce_limit(md->queue, BLK_BOUNCE_ANY);
}

2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316
static void cleanup_mapped_device(struct mapped_device *md)
{
	cleanup_srcu_struct(&md->io_barrier);

	if (md->wq)
		destroy_workqueue(md->wq);
	if (md->kworker_task)
		kthread_stop(md->kworker_task);
	if (md->io_pool)
		mempool_destroy(md->io_pool);
	if (md->rq_pool)
		mempool_destroy(md->rq_pool);
	if (md->bs)
		bioset_free(md->bs);

	if (md->disk) {
		spin_lock(&_minor_lock);
		md->disk->private_data = NULL;
		spin_unlock(&_minor_lock);
		if (blk_get_integrity(md->disk))
			blk_integrity_unregister(md->disk);
		del_gendisk(md->disk);
		put_disk(md->disk);
	}

	if (md->queue)
		blk_cleanup_queue(md->queue);

	if (md->bdev) {
		bdput(md->bdev);
		md->bdev = NULL;
	}
}

L
Linus Torvalds 已提交
2317 2318 2319
/*
 * Allocate and initialise a blank device with a given minor.
 */
2320
static struct mapped_device *alloc_dev(int minor)
L
Linus Torvalds 已提交
2321 2322
{
	int r;
2323
	struct mapped_device *md = kzalloc(sizeof(*md), GFP_KERNEL);
2324
	void *old_md;
L
Linus Torvalds 已提交
2325 2326 2327 2328 2329 2330

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

2331
	if (!try_module_get(THIS_MODULE))
M
Milan Broz 已提交
2332
		goto bad_module_get;
2333

L
Linus Torvalds 已提交
2334
	/* get a minor number for the dev */
2335
	if (minor == DM_ANY_MINOR)
2336
		r = next_free_minor(&minor);
2337
	else
2338
		r = specific_minor(minor);
L
Linus Torvalds 已提交
2339
	if (r < 0)
M
Milan Broz 已提交
2340
		goto bad_minor;
L
Linus Torvalds 已提交
2341

M
Mikulas Patocka 已提交
2342 2343 2344 2345
	r = init_srcu_struct(&md->io_barrier);
	if (r < 0)
		goto bad_io_barrier;

2346
	md->use_blk_mq = use_blk_mq;
2347
	md->type = DM_TYPE_NONE;
2348
	mutex_init(&md->suspend_lock);
2349
	mutex_init(&md->type_lock);
2350
	mutex_init(&md->table_devices_lock);
2351
	spin_lock_init(&md->deferred_lock);
L
Linus Torvalds 已提交
2352
	atomic_set(&md->holders, 1);
2353
	atomic_set(&md->open_count, 0);
L
Linus Torvalds 已提交
2354
	atomic_set(&md->event_nr, 0);
M
Mike Anderson 已提交
2355 2356
	atomic_set(&md->uevent_seq, 0);
	INIT_LIST_HEAD(&md->uevent_list);
2357
	INIT_LIST_HEAD(&md->table_devices);
M
Mike Anderson 已提交
2358
	spin_lock_init(&md->uevent_lock);
L
Linus Torvalds 已提交
2359

2360
	md->queue = blk_alloc_queue(GFP_KERNEL);
L
Linus Torvalds 已提交
2361
	if (!md->queue)
2362
		goto bad;
L
Linus Torvalds 已提交
2363

2364
	dm_init_md_queue(md);
S
Stefan Bader 已提交
2365

L
Linus Torvalds 已提交
2366 2367
	md->disk = alloc_disk(1);
	if (!md->disk)
2368
		goto bad;
L
Linus Torvalds 已提交
2369

2370 2371
	atomic_set(&md->pending[0], 0);
	atomic_set(&md->pending[1], 0);
2372
	init_waitqueue_head(&md->wait);
2373
	INIT_WORK(&md->work, dm_wq_work);
2374
	init_waitqueue_head(&md->eventq);
2375
	init_completion(&md->kobj_holder.completion);
2376
	md->kworker_task = NULL;
2377

L
Linus Torvalds 已提交
2378 2379 2380 2381 2382 2383 2384
	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 已提交
2385
	format_dev_t(md->name, MKDEV(_major, minor));
L
Linus Torvalds 已提交
2386

T
Tejun Heo 已提交
2387
	md->wq = alloc_workqueue("kdmflush", WQ_MEM_RECLAIM, 0);
2388
	if (!md->wq)
2389
		goto bad;
2390

M
Mikulas Patocka 已提交
2391 2392
	md->bdev = bdget_disk(md->disk, 0);
	if (!md->bdev)
2393
		goto bad;
M
Mikulas Patocka 已提交
2394

2395 2396 2397 2398
	bio_init(&md->flush_bio);
	md->flush_bio.bi_bdev = md->bdev;
	md->flush_bio.bi_rw = WRITE_FLUSH;

M
Mikulas Patocka 已提交
2399 2400
	dm_stats_init(&md->stats);

2401
	/* Populate the mapping, nobody knows we exist yet */
2402
	spin_lock(&_minor_lock);
2403
	old_md = idr_replace(&_minor_idr, md, minor);
2404
	spin_unlock(&_minor_lock);
2405 2406 2407

	BUG_ON(old_md != MINOR_ALLOCED);

L
Linus Torvalds 已提交
2408 2409
	return md;

2410 2411
bad:
	cleanup_mapped_device(md);
M
Mikulas Patocka 已提交
2412
bad_io_barrier:
L
Linus Torvalds 已提交
2413
	free_minor(minor);
M
Milan Broz 已提交
2414
bad_minor:
2415
	module_put(THIS_MODULE);
M
Milan Broz 已提交
2416
bad_module_get:
L
Linus Torvalds 已提交
2417 2418 2419 2420
	kfree(md);
	return NULL;
}

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

L
Linus Torvalds 已提交
2423 2424
static void free_dev(struct mapped_device *md)
{
2425
	int minor = MINOR(disk_devt(md->disk));
2426

M
Mikulas Patocka 已提交
2427
	unlock_fs(md);
2428

2429 2430 2431
	cleanup_mapped_device(md);
	if (md->use_blk_mq)
		blk_mq_free_tag_set(&md->tag_set);
2432

2433
	free_table_devices(&md->table_devices);
2434 2435 2436
	dm_stats_cleanup(&md->stats);
	free_minor(minor);

2437
	module_put(THIS_MODULE);
L
Linus Torvalds 已提交
2438 2439 2440
	kfree(md);
}

K
Kiyoshi Ueda 已提交
2441 2442
static void __bind_mempools(struct mapped_device *md, struct dm_table *t)
{
M
Mikulas Patocka 已提交
2443
	struct dm_md_mempools *p = dm_table_get_md_mempools(t);
K
Kiyoshi Ueda 已提交
2444

2445 2446 2447
	if (md->bs) {
		/* The md already has necessary mempools. */
		if (dm_table_get_type(t) == DM_TYPE_BIO_BASED) {
2448 2449 2450 2451 2452 2453 2454 2455
			/*
			 * Reload bioset because front_pad may have changed
			 * because a different table was loaded.
			 */
			bioset_free(md->bs);
			md->bs = p->bs;
			p->bs = NULL;
		}
2456 2457 2458 2459 2460 2461 2462 2463 2464
		/*
		 * There's no need to reload with request-based dm
		 * because the size of front_pad doesn't change.
		 * Note for future: If you are to reload bioset,
		 * prep-ed requests in the queue may refer
		 * to bio from the old bioset, so you must walk
		 * through the queue to unprep.
		 */
		goto out;
M
Mikulas Patocka 已提交
2465
	}
K
Kiyoshi Ueda 已提交
2466

2467 2468
	BUG_ON(!p || md->io_pool || md->rq_pool || md->bs);

K
Kiyoshi Ueda 已提交
2469 2470
	md->io_pool = p->io_pool;
	p->io_pool = NULL;
2471 2472
	md->rq_pool = p->rq_pool;
	p->rq_pool = NULL;
K
Kiyoshi Ueda 已提交
2473 2474
	md->bs = p->bs;
	p->bs = NULL;
2475

K
Kiyoshi Ueda 已提交
2476
out:
2477
	/* mempool bind completed, no longer need any mempools in the table */
K
Kiyoshi Ueda 已提交
2478 2479 2480
	dm_table_free_md_mempools(t);
}

L
Linus Torvalds 已提交
2481 2482 2483 2484 2485
/*
 * Bind a table to the device.
 */
static void event_callback(void *context)
{
M
Mike Anderson 已提交
2486 2487
	unsigned long flags;
	LIST_HEAD(uevents);
L
Linus Torvalds 已提交
2488 2489
	struct mapped_device *md = (struct mapped_device *) context;

M
Mike Anderson 已提交
2490 2491 2492 2493
	spin_lock_irqsave(&md->uevent_lock, flags);
	list_splice_init(&md->uevent_list, &uevents);
	spin_unlock_irqrestore(&md->uevent_lock, flags);

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

L
Linus Torvalds 已提交
2496 2497 2498 2499
	atomic_inc(&md->event_nr);
	wake_up(&md->eventq);
}

2500 2501 2502
/*
 * Protected by md->suspend_lock obtained by dm_swap_table().
 */
2503
static void __set_size(struct mapped_device *md, sector_t size)
L
Linus Torvalds 已提交
2504
{
2505
	set_capacity(md->disk, size);
L
Linus Torvalds 已提交
2506

2507
	i_size_write(md->bdev->bd_inode, (loff_t)size << SECTOR_SHIFT);
L
Linus Torvalds 已提交
2508 2509
}

2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523
/*
 * Return 1 if the queue has a compulsory merge_bvec_fn function.
 *
 * If this function returns 0, then the device is either a non-dm
 * device without a merge_bvec_fn, or it is a dm device that is
 * able to split any bios it receives that are too big.
 */
int dm_queue_merge_is_compulsory(struct request_queue *q)
{
	struct mapped_device *dev_md;

	if (!q->merge_bvec_fn)
		return 0;

2524
	if (q->make_request_fn == dm_make_request) {
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 2558 2559 2560 2561 2562
		dev_md = q->queuedata;
		if (test_bit(DMF_MERGE_IS_OPTIONAL, &dev_md->flags))
			return 0;
	}

	return 1;
}

static int dm_device_merge_is_compulsory(struct dm_target *ti,
					 struct dm_dev *dev, sector_t start,
					 sector_t len, void *data)
{
	struct block_device *bdev = dev->bdev;
	struct request_queue *q = bdev_get_queue(bdev);

	return dm_queue_merge_is_compulsory(q);
}

/*
 * Return 1 if it is acceptable to ignore merge_bvec_fn based
 * on the properties of the underlying devices.
 */
static int dm_table_merge_is_optional(struct dm_table *table)
{
	unsigned i = 0;
	struct dm_target *ti;

	while (i < dm_table_get_num_targets(table)) {
		ti = dm_table_get_target(table, i++);

		if (ti->type->iterate_devices &&
		    ti->type->iterate_devices(ti, dm_device_merge_is_compulsory, NULL))
			return 0;
	}

	return 1;
}

2563 2564 2565 2566 2567
/*
 * 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 已提交
2568
{
2569
	struct dm_table *old_map;
2570
	struct request_queue *q = md->queue;
L
Linus Torvalds 已提交
2571
	sector_t size;
2572
	int merge_is_optional;
L
Linus Torvalds 已提交
2573 2574

	size = dm_table_get_size(t);
D
Darrick J. Wong 已提交
2575 2576 2577 2578

	/*
	 * Wipe any geometry if the size of the table changed.
	 */
M
Mikulas Patocka 已提交
2579
	if (size != dm_get_size(md))
D
Darrick J. Wong 已提交
2580 2581
		memset(&md->geometry, 0, sizeof(md->geometry));

M
Mikulas Patocka 已提交
2582
	__set_size(md, size);
2583

2584 2585
	dm_table_event_callback(t, event_callback, md);

K
Kiyoshi Ueda 已提交
2586 2587 2588 2589 2590 2591 2592
	/*
	 * 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.
	 */
2593
	if (dm_table_request_based(t))
K
Kiyoshi Ueda 已提交
2594 2595 2596 2597
		stop_queue(q);

	__bind_mempools(md, t);

2598 2599
	merge_is_optional = dm_table_merge_is_optional(t);

2600
	old_map = rcu_dereference_protected(md->map, lockdep_is_held(&md->suspend_lock));
M
Mikulas Patocka 已提交
2601
	rcu_assign_pointer(md->map, t);
2602 2603
	md->immutable_target_type = dm_table_get_immutable_target_type(t);

2604
	dm_table_set_restrictions(t, q, limits);
2605 2606 2607 2608
	if (merge_is_optional)
		set_bit(DMF_MERGE_IS_OPTIONAL, &md->flags);
	else
		clear_bit(DMF_MERGE_IS_OPTIONAL, &md->flags);
2609 2610
	if (old_map)
		dm_sync_table(md);
L
Linus Torvalds 已提交
2611

2612
	return old_map;
L
Linus Torvalds 已提交
2613 2614
}

2615 2616 2617 2618
/*
 * Returns unbound table for the caller to free.
 */
static struct dm_table *__unbind(struct mapped_device *md)
L
Linus Torvalds 已提交
2619
{
2620
	struct dm_table *map = rcu_dereference_protected(md->map, 1);
L
Linus Torvalds 已提交
2621 2622

	if (!map)
2623
		return NULL;
L
Linus Torvalds 已提交
2624 2625

	dm_table_event_callback(map, NULL, NULL);
2626
	RCU_INIT_POINTER(md->map, NULL);
M
Mikulas Patocka 已提交
2627
	dm_sync_table(md);
2628 2629

	return map;
L
Linus Torvalds 已提交
2630 2631 2632 2633 2634
}

/*
 * Constructor for a new device.
 */
2635
int dm_create(int minor, struct mapped_device **result)
L
Linus Torvalds 已提交
2636 2637 2638
{
	struct mapped_device *md;

2639
	md = alloc_dev(minor);
L
Linus Torvalds 已提交
2640 2641 2642
	if (!md)
		return -ENXIO;

M
Milan Broz 已提交
2643 2644
	dm_sysfs_init(md);

L
Linus Torvalds 已提交
2645 2646 2647 2648
	*result = md;
	return 0;
}

2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664
/*
 * 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)
{
2665
	BUG_ON(!mutex_is_locked(&md->type_lock));
2666 2667 2668 2669 2670
	md->type = type;
}

unsigned dm_get_md_type(struct mapped_device *md)
{
2671
	BUG_ON(!mutex_is_locked(&md->type_lock));
2672 2673 2674
	return md->type;
}

2675 2676 2677 2678 2679
struct target_type *dm_get_immutable_target_type(struct mapped_device *md)
{
	return md->immutable_target_type;
}

2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690
/*
 * The queue_limits are only valid as long as you have a reference
 * count on 'md'.
 */
struct queue_limits *dm_get_queue_limits(struct mapped_device *md)
{
	BUG_ON(!atomic_read(&md->holders));
	return &md->queue->limits;
}
EXPORT_SYMBOL_GPL(dm_get_queue_limits);

2691 2692 2693 2694 2695 2696 2697 2698
static void init_rq_based_worker_thread(struct mapped_device *md)
{
	/* Initialize the request-based DM worker thread */
	init_kthread_worker(&md->kworker);
	md->kworker_task = kthread_run(kthread_worker_fn, &md->kworker,
				       "kdmwork-%s", dm_device_name(md));
}

2699 2700 2701 2702 2703 2704 2705 2706 2707 2708
/*
 * 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;

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

2711 2712 2713
	/* disable dm_request_fn's merge heuristic by default */
	md->seq_rq_merge_deadline_usecs = 0;

2714
	md->queue = q;
2715
	dm_init_old_md_queue(md);
2716 2717 2718
	blk_queue_softirq_done(md->queue, dm_softirq_done);
	blk_queue_prep_rq(md->queue, dm_prep_fn);

2719
	init_rq_based_worker_thread(md);
2720

2721 2722
	elv_register_queue(md->queue);

2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778
	return 0;
}

static int dm_mq_init_request(void *data, struct request *rq,
			      unsigned int hctx_idx, unsigned int request_idx,
			      unsigned int numa_node)
{
	struct mapped_device *md = data;
	struct dm_rq_target_io *tio = blk_mq_rq_to_pdu(rq);

	/*
	 * Must initialize md member of tio, otherwise it won't
	 * be available in dm_mq_queue_rq.
	 */
	tio->md = md;

	return 0;
}

static int dm_mq_queue_rq(struct blk_mq_hw_ctx *hctx,
			  const struct blk_mq_queue_data *bd)
{
	struct request *rq = bd->rq;
	struct dm_rq_target_io *tio = blk_mq_rq_to_pdu(rq);
	struct mapped_device *md = tio->md;
	int srcu_idx;
	struct dm_table *map = dm_get_live_table(md, &srcu_idx);
	struct dm_target *ti;
	sector_t pos;

	/* always use block 0 to find the target for flushes for now */
	pos = 0;
	if (!(rq->cmd_flags & REQ_FLUSH))
		pos = blk_rq_pos(rq);

	ti = dm_table_find_target(map, pos);
	if (!dm_target_is_valid(ti)) {
		dm_put_live_table(md, srcu_idx);
		DMERR_LIMIT("request attempted access beyond the end of device");
		/*
		 * Must perform setup, that rq_completed() requires,
		 * before returning BLK_MQ_RQ_QUEUE_ERROR
		 */
		dm_start_request(md, rq);
		return BLK_MQ_RQ_QUEUE_ERROR;
	}
	dm_put_live_table(md, srcu_idx);

	if (ti->type->busy && ti->type->busy(ti))
		return BLK_MQ_RQ_QUEUE_BUSY;

	dm_start_request(md, rq);

	/* Init tio using md established in .init_request */
	init_tio(tio, rq, md);

2779 2780 2781 2782
	/*
	 * Establish tio->ti before queuing work (map_tio_request)
	 * or making direct call to map_request().
	 */
2783
	tio->ti = ti;
2784 2785 2786 2787 2788

	/* Clone the request if underlying devices aren't blk-mq */
	if (dm_table_get_type(map) == DM_TYPE_REQUEST_BASED) {
		/* clone request is allocated at the end of the pdu */
		tio->clone = (void *)blk_mq_rq_to_pdu(rq) + sizeof(struct dm_rq_target_io);
2789
		(void) clone_rq(rq, md, tio, GFP_ATOMIC);
2790 2791 2792
		queue_kthread_work(&md->kworker, &tio->work);
	} else {
		/* Direct call is fine since .queue_rq allows allocations */
2793 2794
		if (map_request(tio, rq, md) == DM_MAPIO_REQUEUE) {
			/* Undo dm_start_request() before requeuing */
2795
			rq_end_stats(md, rq);
2796 2797 2798
			rq_completed(md, rq_data_dir(rq), false);
			return BLK_MQ_RQ_QUEUE_BUSY;
		}
2799
	}
2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812

	return BLK_MQ_RQ_QUEUE_OK;
}

static struct blk_mq_ops dm_mq_ops = {
	.queue_rq = dm_mq_queue_rq,
	.map_queue = blk_mq_map_queue,
	.complete = dm_softirq_done,
	.init_request = dm_mq_init_request,
};

static int dm_init_request_based_blk_mq_queue(struct mapped_device *md)
{
2813
	unsigned md_type = dm_get_md_type(md);
2814 2815 2816 2817 2818 2819 2820 2821 2822
	struct request_queue *q;
	int err;

	memset(&md->tag_set, 0, sizeof(md->tag_set));
	md->tag_set.ops = &dm_mq_ops;
	md->tag_set.queue_depth = BLKDEV_MAX_RQ;
	md->tag_set.numa_node = NUMA_NO_NODE;
	md->tag_set.flags = BLK_MQ_F_SHOULD_MERGE | BLK_MQ_F_SG_MERGE;
	md->tag_set.nr_hw_queues = 1;
2823 2824 2825 2826 2827
	if (md_type == DM_TYPE_REQUEST_BASED) {
		/* make the memory for non-blk-mq clone part of the pdu */
		md->tag_set.cmd_size = sizeof(struct dm_rq_target_io) + sizeof(struct request);
	} else
		md->tag_set.cmd_size = sizeof(struct dm_rq_target_io);
2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844
	md->tag_set.driver_data = md;

	err = blk_mq_alloc_tag_set(&md->tag_set);
	if (err)
		return err;

	q = blk_mq_init_allocated_queue(&md->tag_set, md->queue);
	if (IS_ERR(q)) {
		err = PTR_ERR(q);
		goto out_tag_set;
	}
	md->queue = q;
	dm_init_md_queue(md);

	/* backfill 'mq' sysfs registration normally done in blk_register_queue */
	blk_mq_register_disk(md->disk);

2845 2846
	if (md_type == DM_TYPE_REQUEST_BASED)
		init_rq_based_worker_thread(md);
2847 2848 2849 2850 2851 2852

	return 0;

out_tag_set:
	blk_mq_free_tag_set(&md->tag_set);
	return err;
2853 2854
}

2855 2856 2857 2858 2859 2860 2861 2862
static unsigned filter_md_type(unsigned type, struct mapped_device *md)
{
	if (type == DM_TYPE_BIO_BASED)
		return type;

	return !md->use_blk_mq ? DM_TYPE_REQUEST_BASED : DM_TYPE_MQ_REQUEST_BASED;
}

2863 2864 2865 2866 2867
/*
 * Setup the DM device's queue based on md's type
 */
int dm_setup_md_queue(struct mapped_device *md)
{
2868
	int r;
2869
	unsigned md_type = filter_md_type(dm_get_md_type(md), md);
2870 2871 2872 2873 2874

	switch (md_type) {
	case DM_TYPE_REQUEST_BASED:
		r = dm_init_request_based_queue(md);
		if (r) {
2875
			DMWARN("Cannot initialize queue for request-based mapped device");
2876
			return r;
2877
		}
2878 2879 2880 2881 2882 2883 2884 2885 2886 2887
		break;
	case DM_TYPE_MQ_REQUEST_BASED:
		r = dm_init_request_based_blk_mq_queue(md);
		if (r) {
			DMWARN("Cannot initialize queue for request-based blk-mq mapped device");
			return r;
		}
		break;
	case DM_TYPE_BIO_BASED:
		dm_init_old_md_queue(md);
2888 2889
		blk_queue_make_request(md->queue, dm_make_request);
		blk_queue_merge_bvec(md->queue, dm_merge_bvec);
2890
		break;
2891 2892 2893 2894 2895
	}

	return 0;
}

2896
struct mapped_device *dm_get_md(dev_t dev)
L
Linus Torvalds 已提交
2897 2898 2899 2900 2901 2902 2903
{
	struct mapped_device *md;
	unsigned minor = MINOR(dev);

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

2904
	spin_lock(&_minor_lock);
L
Linus Torvalds 已提交
2905 2906

	md = idr_find(&_minor_idr, minor);
2907 2908 2909 2910 2911 2912 2913 2914 2915
	if (md) {
		if ((md == MINOR_ALLOCED ||
		     (MINOR(disk_devt(dm_disk(md))) != minor) ||
		     dm_deleting_md(md) ||
		     test_bit(DMF_FREEING, &md->flags))) {
			md = NULL;
			goto out;
		}
		dm_get(md);
J
Jeff Mahoney 已提交
2916
	}
L
Linus Torvalds 已提交
2917

J
Jeff Mahoney 已提交
2918
out:
2919
	spin_unlock(&_minor_lock);
L
Linus Torvalds 已提交
2920

2921 2922
	return md;
}
A
Alasdair G Kergon 已提交
2923
EXPORT_SYMBOL_GPL(dm_get_md);
2924

A
Alasdair G Kergon 已提交
2925
void *dm_get_mdptr(struct mapped_device *md)
2926
{
A
Alasdair G Kergon 已提交
2927
	return md->interface_ptr;
L
Linus Torvalds 已提交
2928 2929 2930 2931 2932 2933 2934 2935 2936 2937
}

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);
2938
	BUG_ON(test_bit(DMF_FREEING, &md->flags));
L
Linus Torvalds 已提交
2939 2940
}

2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953
int dm_hold(struct mapped_device *md)
{
	spin_lock(&_minor_lock);
	if (test_bit(DMF_FREEING, &md->flags)) {
		spin_unlock(&_minor_lock);
		return -EBUSY;
	}
	dm_get(md);
	spin_unlock(&_minor_lock);
	return 0;
}
EXPORT_SYMBOL_GPL(dm_hold);

2954 2955 2956 2957 2958 2959
const char *dm_device_name(struct mapped_device *md)
{
	return md->name;
}
EXPORT_SYMBOL_GPL(dm_device_name);

2960
static void __dm_destroy(struct mapped_device *md, bool wait)
L
Linus Torvalds 已提交
2961
{
M
Mike Anderson 已提交
2962
	struct dm_table *map;
M
Mikulas Patocka 已提交
2963
	int srcu_idx;
L
Linus Torvalds 已提交
2964

2965
	might_sleep();
J
Jeff Mahoney 已提交
2966

M
Mikulas Patocka 已提交
2967
	map = dm_get_live_table(md, &srcu_idx);
2968 2969

	spin_lock(&_minor_lock);
2970 2971 2972 2973
	idr_replace(&_minor_idr, MINOR_ALLOCED, MINOR(disk_devt(dm_disk(md))));
	set_bit(DMF_FREEING, &md->flags);
	spin_unlock(&_minor_lock);

2974
	if (dm_request_based(md) && md->kworker_task)
2975 2976
		flush_kthread_worker(&md->kworker);

2977 2978 2979 2980 2981
	/*
	 * Take suspend_lock so that presuspend and postsuspend methods
	 * do not race with internal suspend.
	 */
	mutex_lock(&md->suspend_lock);
2982 2983 2984
	if (!dm_suspended_md(md)) {
		dm_table_presuspend_targets(map);
		dm_table_postsuspend_targets(map);
L
Linus Torvalds 已提交
2985
	}
2986
	mutex_unlock(&md->suspend_lock);
2987

M
Mikulas Patocka 已提交
2988 2989 2990
	/* dm_put_live_table must be before msleep, otherwise deadlock is possible */
	dm_put_live_table(md, srcu_idx);

2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021
	/*
	 * 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_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 已提交
3022
}
E
Edward Goggin 已提交
3023
EXPORT_SYMBOL_GPL(dm_put);
L
Linus Torvalds 已提交
3024

3025
static int dm_wait_for_completion(struct mapped_device *md, int interruptible)
3026 3027
{
	int r = 0;
3028 3029 3030
	DECLARE_WAITQUEUE(wait, current);

	add_wait_queue(&md->wait, &wait);
3031 3032

	while (1) {
3033
		set_current_state(interruptible);
3034

3035
		if (!md_in_flight(md))
3036 3037
			break;

3038 3039
		if (interruptible == TASK_INTERRUPTIBLE &&
		    signal_pending(current)) {
3040 3041 3042 3043 3044 3045 3046 3047
			r = -EINTR;
			break;
		}

		io_schedule();
	}
	set_current_state(TASK_RUNNING);

3048 3049
	remove_wait_queue(&md->wait, &wait);

3050 3051 3052
	return r;
}

L
Linus Torvalds 已提交
3053 3054 3055
/*
 * Process the deferred bios
 */
3056
static void dm_wq_work(struct work_struct *work)
L
Linus Torvalds 已提交
3057
{
3058 3059
	struct mapped_device *md = container_of(work, struct mapped_device,
						work);
3060
	struct bio *c;
M
Mikulas Patocka 已提交
3061 3062
	int srcu_idx;
	struct dm_table *map;
L
Linus Torvalds 已提交
3063

M
Mikulas Patocka 已提交
3064
	map = dm_get_live_table(md, &srcu_idx);
3065

3066
	while (!test_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags)) {
A
Alasdair G Kergon 已提交
3067 3068 3069 3070
		spin_lock_irq(&md->deferred_lock);
		c = bio_list_pop(&md->deferred);
		spin_unlock_irq(&md->deferred_lock);

3071
		if (!c)
A
Alasdair G Kergon 已提交
3072
			break;
3073

K
Kiyoshi Ueda 已提交
3074 3075
		if (dm_request_based(md))
			generic_make_request(c);
3076
		else
M
Mikulas Patocka 已提交
3077
			__split_and_process_bio(md, map, c);
3078
	}
M
Milan Broz 已提交
3079

M
Mikulas Patocka 已提交
3080
	dm_put_live_table(md, srcu_idx);
L
Linus Torvalds 已提交
3081 3082
}

3083
static void dm_queue_flush(struct mapped_device *md)
3084
{
3085
	clear_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags);
3086
	smp_mb__after_atomic();
3087
	queue_work(md->wq, &md->work);
3088 3089
}

L
Linus Torvalds 已提交
3090
/*
3091
 * Swap in a new table, returning the old one for the caller to destroy.
L
Linus Torvalds 已提交
3092
 */
3093
struct dm_table *dm_swap_table(struct mapped_device *md, struct dm_table *table)
L
Linus Torvalds 已提交
3094
{
3095
	struct dm_table *live_map = NULL, *map = ERR_PTR(-EINVAL);
3096
	struct queue_limits limits;
3097
	int r;
L
Linus Torvalds 已提交
3098

3099
	mutex_lock(&md->suspend_lock);
L
Linus Torvalds 已提交
3100 3101

	/* device must be suspended */
3102
	if (!dm_suspended_md(md))
3103
		goto out;
L
Linus Torvalds 已提交
3104

3105 3106 3107 3108 3109 3110 3111
	/*
	 * If the new table has no data devices, retain the existing limits.
	 * This helps multipath with queue_if_no_path if all paths disappear,
	 * then new I/O is queued based on these limits, and then some paths
	 * reappear.
	 */
	if (dm_table_has_no_data_devices(table)) {
M
Mikulas Patocka 已提交
3112
		live_map = dm_get_live_table_fast(md);
3113 3114
		if (live_map)
			limits = md->queue->limits;
M
Mikulas Patocka 已提交
3115
		dm_put_live_table_fast(md);
3116 3117
	}

3118 3119 3120 3121 3122 3123
	if (!live_map) {
		r = dm_calculate_queue_limits(table, &limits);
		if (r) {
			map = ERR_PTR(r);
			goto out;
		}
3124
	}
3125

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

3128
out:
3129
	mutex_unlock(&md->suspend_lock);
3130
	return map;
L
Linus Torvalds 已提交
3131 3132 3133 3134 3135 3136
}

/*
 * Functions to lock and unlock any filesystem running on the
 * device.
 */
3137
static int lock_fs(struct mapped_device *md)
L
Linus Torvalds 已提交
3138
{
3139
	int r;
L
Linus Torvalds 已提交
3140 3141

	WARN_ON(md->frozen_sb);
3142

3143
	md->frozen_sb = freeze_bdev(md->bdev);
3144
	if (IS_ERR(md->frozen_sb)) {
3145
		r = PTR_ERR(md->frozen_sb);
3146 3147
		md->frozen_sb = NULL;
		return r;
3148 3149
	}

3150 3151
	set_bit(DMF_FROZEN, &md->flags);

L
Linus Torvalds 已提交
3152 3153 3154
	return 0;
}

3155
static void unlock_fs(struct mapped_device *md)
L
Linus Torvalds 已提交
3156
{
3157 3158 3159
	if (!test_bit(DMF_FROZEN, &md->flags))
		return;

3160
	thaw_bdev(md->bdev, md->frozen_sb);
L
Linus Torvalds 已提交
3161
	md->frozen_sb = NULL;
3162
	clear_bit(DMF_FROZEN, &md->flags);
L
Linus Torvalds 已提交
3163 3164 3165
}

/*
3166 3167 3168
 * If __dm_suspend returns 0, the device is completely quiescent
 * now. There is no request-processing activity. All new requests
 * are being added to md->deferred list.
3169
 *
3170
 * Caller must hold md->suspend_lock
3171
 */
3172 3173
static int __dm_suspend(struct mapped_device *md, struct dm_table *map,
			unsigned suspend_flags, int interruptible)
L
Linus Torvalds 已提交
3174
{
3175 3176 3177
	bool do_lockfs = suspend_flags & DM_SUSPEND_LOCKFS_FLAG;
	bool noflush = suspend_flags & DM_SUSPEND_NOFLUSH_FLAG;
	int r;
L
Linus Torvalds 已提交
3178

3179 3180 3181 3182 3183 3184 3185
	/*
	 * 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);

3186 3187 3188 3189
	/*
	 * This gets reverted if there's an error later and the targets
	 * provide the .presuspend_undo hook.
	 */
3190 3191
	dm_table_presuspend_targets(map);

M
Mikulas Patocka 已提交
3192
	/*
K
Kiyoshi Ueda 已提交
3193 3194 3195 3196
	 * 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 已提交
3197 3198 3199
	 */
	if (!noflush && do_lockfs) {
		r = lock_fs(md);
3200 3201
		if (r) {
			dm_table_presuspend_undo_targets(map);
3202
			return r;
3203
		}
3204
	}
L
Linus Torvalds 已提交
3205 3206

	/*
3207 3208 3209 3210 3211 3212 3213
	 * 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
3214 3215 3216
	 * __split_and_process_bio from dm_request and quiesce the thread
	 * (dm_wq_work), we set BMF_BLOCK_IO_FOR_SUSPEND and call
	 * flush_workqueue(md->wq).
L
Linus Torvalds 已提交
3217
	 */
3218
	set_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags);
3219 3220
	if (map)
		synchronize_srcu(&md->io_barrier);
L
Linus Torvalds 已提交
3221

3222
	/*
3223 3224
	 * Stop md->queue before flushing md->wq in case request-based
	 * dm defers requests to md->wq from md->queue.
3225
	 */
3226
	if (dm_request_based(md)) {
K
Kiyoshi Ueda 已提交
3227
		stop_queue(md->queue);
3228 3229
		if (md->kworker_task)
			flush_kthread_worker(&md->kworker);
3230
	}
3231

3232 3233
	flush_workqueue(md->wq);

L
Linus Torvalds 已提交
3234
	/*
3235 3236 3237
	 * 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 已提交
3238
	 */
3239
	r = dm_wait_for_completion(md, interruptible);
L
Linus Torvalds 已提交
3240

3241
	if (noflush)
3242
		clear_bit(DMF_NOFLUSH_SUSPENDING, &md->flags);
3243 3244
	if (map)
		synchronize_srcu(&md->io_barrier);
3245

L
Linus Torvalds 已提交
3246
	/* were we interrupted ? */
3247
	if (r < 0) {
3248
		dm_queue_flush(md);
M
Milan Broz 已提交
3249

3250
		if (dm_request_based(md))
K
Kiyoshi Ueda 已提交
3251
			start_queue(md->queue);
3252

3253
		unlock_fs(md);
3254
		dm_table_presuspend_undo_targets(map);
3255
		/* pushback list is already flushed, so skip flush */
3256
	}
L
Linus Torvalds 已提交
3257

3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298
	return r;
}

/*
 * 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.
 */
/*
 * Suspend mechanism in request-based dm.
 *
 * 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.
 *
 * To abort suspend, start the request_queue.
 */
int dm_suspend(struct mapped_device *md, unsigned suspend_flags)
{
	struct dm_table *map = NULL;
	int r = 0;

retry:
	mutex_lock_nested(&md->suspend_lock, SINGLE_DEPTH_NESTING);

	if (dm_suspended_md(md)) {
		r = -EINVAL;
		goto out_unlock;
	}

	if (dm_suspended_internally_md(md)) {
		/* already internally suspended, wait for internal resume */
		mutex_unlock(&md->suspend_lock);
		r = wait_on_bit(&md->flags, DMF_SUSPENDED_INTERNALLY, TASK_INTERRUPTIBLE);
		if (r)
			return r;
		goto retry;
	}

3299
	map = rcu_dereference_protected(md->map, lockdep_is_held(&md->suspend_lock));
3300 3301 3302 3303

	r = __dm_suspend(md, map, suspend_flags, TASK_INTERRUPTIBLE);
	if (r)
		goto out_unlock;
3304

3305
	set_bit(DMF_SUSPENDED, &md->flags);
3306

3307 3308
	dm_table_postsuspend_targets(map);

3309
out_unlock:
3310
	mutex_unlock(&md->suspend_lock);
3311
	return r;
L
Linus Torvalds 已提交
3312 3313
}

3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336
static int __dm_resume(struct mapped_device *md, struct dm_table *map)
{
	if (map) {
		int r = dm_table_resume_targets(map);
		if (r)
			return r;
	}

	dm_queue_flush(md);

	/*
	 * 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);

	unlock_fs(md);

	return 0;
}

L
Linus Torvalds 已提交
3337 3338
int dm_resume(struct mapped_device *md)
{
3339 3340
	int r = -EINVAL;
	struct dm_table *map = NULL;
L
Linus Torvalds 已提交
3341

3342 3343 3344
retry:
	mutex_lock_nested(&md->suspend_lock, SINGLE_DEPTH_NESTING);

3345
	if (!dm_suspended_md(md))
3346 3347
		goto out;

3348 3349 3350 3351 3352 3353 3354 3355 3356
	if (dm_suspended_internally_md(md)) {
		/* already internally suspended, wait for internal resume */
		mutex_unlock(&md->suspend_lock);
		r = wait_on_bit(&md->flags, DMF_SUSPENDED_INTERNALLY, TASK_INTERRUPTIBLE);
		if (r)
			return r;
		goto retry;
	}

3357
	map = rcu_dereference_protected(md->map, lockdep_is_held(&md->suspend_lock));
3358
	if (!map || !dm_table_get_size(map))
3359
		goto out;
L
Linus Torvalds 已提交
3360

3361
	r = __dm_resume(md, map);
3362 3363
	if (r)
		goto out;
3364 3365 3366

	clear_bit(DMF_SUSPENDED, &md->flags);

3367 3368
	r = 0;
out:
3369
	mutex_unlock(&md->suspend_lock);
3370

3371
	return r;
L
Linus Torvalds 已提交
3372 3373
}

M
Mikulas Patocka 已提交
3374 3375 3376 3377 3378 3379
/*
 * Internal suspend/resume works like userspace-driven suspend. It waits
 * until all bios finish and prevents issuing new bios to the target drivers.
 * It may be used only from the kernel.
 */

3380
static void __dm_internal_suspend(struct mapped_device *md, unsigned suspend_flags)
M
Mikulas Patocka 已提交
3381
{
3382 3383
	struct dm_table *map = NULL;

3384
	if (md->internal_suspend_count++)
3385 3386 3387 3388 3389 3390 3391
		return; /* nested internal suspend */

	if (dm_suspended_md(md)) {
		set_bit(DMF_SUSPENDED_INTERNALLY, &md->flags);
		return; /* nest suspend */
	}

3392
	map = rcu_dereference_protected(md->map, lockdep_is_held(&md->suspend_lock));
3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408

	/*
	 * Using TASK_UNINTERRUPTIBLE because only NOFLUSH internal suspend is
	 * supported.  Properly supporting a TASK_INTERRUPTIBLE internal suspend
	 * would require changing .presuspend to return an error -- avoid this
	 * until there is a need for more elaborate variants of internal suspend.
	 */
	(void) __dm_suspend(md, map, suspend_flags, TASK_UNINTERRUPTIBLE);

	set_bit(DMF_SUSPENDED_INTERNALLY, &md->flags);

	dm_table_postsuspend_targets(map);
}

static void __dm_internal_resume(struct mapped_device *md)
{
3409 3410 3411
	BUG_ON(!md->internal_suspend_count);

	if (--md->internal_suspend_count)
3412 3413
		return; /* resume from nested internal suspend */

M
Mikulas Patocka 已提交
3414
	if (dm_suspended_md(md))
3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453
		goto done; /* resume from nested suspend */

	/*
	 * NOTE: existing callers don't need to call dm_table_resume_targets
	 * (which may fail -- so best to avoid it for now by passing NULL map)
	 */
	(void) __dm_resume(md, NULL);

done:
	clear_bit(DMF_SUSPENDED_INTERNALLY, &md->flags);
	smp_mb__after_atomic();
	wake_up_bit(&md->flags, DMF_SUSPENDED_INTERNALLY);
}

void dm_internal_suspend_noflush(struct mapped_device *md)
{
	mutex_lock(&md->suspend_lock);
	__dm_internal_suspend(md, DM_SUSPEND_NOFLUSH_FLAG);
	mutex_unlock(&md->suspend_lock);
}
EXPORT_SYMBOL_GPL(dm_internal_suspend_noflush);

void dm_internal_resume(struct mapped_device *md)
{
	mutex_lock(&md->suspend_lock);
	__dm_internal_resume(md);
	mutex_unlock(&md->suspend_lock);
}
EXPORT_SYMBOL_GPL(dm_internal_resume);

/*
 * Fast variants of internal suspend/resume hold md->suspend_lock,
 * which prevents interaction with userspace-driven suspend.
 */

void dm_internal_suspend_fast(struct mapped_device *md)
{
	mutex_lock(&md->suspend_lock);
	if (dm_suspended_md(md) || dm_suspended_internally_md(md))
M
Mikulas Patocka 已提交
3454 3455 3456 3457 3458 3459 3460
		return;

	set_bit(DMF_BLOCK_IO_FOR_SUSPEND, &md->flags);
	synchronize_srcu(&md->io_barrier);
	flush_workqueue(md->wq);
	dm_wait_for_completion(md, TASK_UNINTERRUPTIBLE);
}
3461
EXPORT_SYMBOL_GPL(dm_internal_suspend_fast);
M
Mikulas Patocka 已提交
3462

3463
void dm_internal_resume_fast(struct mapped_device *md)
M
Mikulas Patocka 已提交
3464
{
3465
	if (dm_suspended_md(md) || dm_suspended_internally_md(md))
M
Mikulas Patocka 已提交
3466 3467 3468 3469 3470 3471 3472
		goto done;

	dm_queue_flush(md);

done:
	mutex_unlock(&md->suspend_lock);
}
3473
EXPORT_SYMBOL_GPL(dm_internal_resume_fast);
M
Mikulas Patocka 已提交
3474

L
Linus Torvalds 已提交
3475 3476 3477
/*-----------------------------------------------------------------
 * Event notification.
 *---------------------------------------------------------------*/
3478
int dm_kobject_uevent(struct mapped_device *md, enum kobject_action action,
M
Milan Broz 已提交
3479
		       unsigned cookie)
3480
{
M
Milan Broz 已提交
3481 3482 3483 3484
	char udev_cookie[DM_COOKIE_LENGTH];
	char *envp[] = { udev_cookie, NULL };

	if (!cookie)
3485
		return kobject_uevent(&disk_to_dev(md->disk)->kobj, action);
M
Milan Broz 已提交
3486 3487 3488
	else {
		snprintf(udev_cookie, DM_COOKIE_LENGTH, "%s=%u",
			 DM_COOKIE_ENV_VAR_NAME, cookie);
3489 3490
		return kobject_uevent_env(&disk_to_dev(md->disk)->kobj,
					  action, envp);
M
Milan Broz 已提交
3491
	}
3492 3493
}

M
Mike Anderson 已提交
3494 3495 3496 3497 3498
uint32_t dm_next_uevent_seq(struct mapped_device *md)
{
	return atomic_add_return(1, &md->uevent_seq);
}

L
Linus Torvalds 已提交
3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509
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 已提交
3510 3511 3512 3513 3514 3515 3516 3517 3518
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 已提交
3519 3520 3521 3522 3523 3524 3525 3526
/*
 * 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;
}
3527
EXPORT_SYMBOL_GPL(dm_disk);
L
Linus Torvalds 已提交
3528

M
Milan Broz 已提交
3529 3530
struct kobject *dm_kobject(struct mapped_device *md)
{
3531
	return &md->kobj_holder.kobj;
M
Milan Broz 已提交
3532 3533 3534 3535 3536 3537
}

struct mapped_device *dm_get_from_kobject(struct kobject *kobj)
{
	struct mapped_device *md;

3538
	md = container_of(kobj, struct mapped_device, kobj_holder.kobj);
M
Milan Broz 已提交
3539

3540
	if (test_bit(DMF_FREEING, &md->flags) ||
M
Mike Anderson 已提交
3541
	    dm_deleting_md(md))
3542 3543
		return NULL;

M
Milan Broz 已提交
3544 3545 3546 3547
	dm_get(md);
	return md;
}

3548
int dm_suspended_md(struct mapped_device *md)
L
Linus Torvalds 已提交
3549 3550 3551 3552
{
	return test_bit(DMF_SUSPENDED, &md->flags);
}

3553 3554 3555 3556 3557
int dm_suspended_internally_md(struct mapped_device *md)
{
	return test_bit(DMF_SUSPENDED_INTERNALLY, &md->flags);
}

M
Mikulas Patocka 已提交
3558 3559 3560 3561 3562
int dm_test_deferred_remove_flag(struct mapped_device *md)
{
	return test_bit(DMF_DEFERRED_REMOVE, &md->flags);
}

3563 3564
int dm_suspended(struct dm_target *ti)
{
3565
	return dm_suspended_md(dm_table_get_md(ti->table));
3566 3567 3568
}
EXPORT_SYMBOL_GPL(dm_suspended);

3569 3570
int dm_noflush_suspending(struct dm_target *ti)
{
3571
	return __noflush_suspending(dm_table_get_md(ti->table));
3572 3573 3574
}
EXPORT_SYMBOL_GPL(dm_noflush_suspending);

3575 3576
struct dm_md_mempools *dm_alloc_md_mempools(struct mapped_device *md, unsigned type,
					    unsigned integrity, unsigned per_bio_data_size)
K
Kiyoshi Ueda 已提交
3577
{
3578 3579 3580
	struct dm_md_mempools *pools = kzalloc(sizeof(*pools), GFP_KERNEL);
	struct kmem_cache *cachep = NULL;
	unsigned int pool_size = 0;
J
Jun'ichi Nomura 已提交
3581
	unsigned int front_pad;
K
Kiyoshi Ueda 已提交
3582 3583

	if (!pools)
3584
		return NULL;
K
Kiyoshi Ueda 已提交
3585

3586
	type = filter_md_type(type, md);
3587

3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616
	switch (type) {
	case DM_TYPE_BIO_BASED:
		cachep = _io_cache;
		pool_size = dm_get_reserved_bio_based_ios();
		front_pad = roundup(per_bio_data_size, __alignof__(struct dm_target_io)) + offsetof(struct dm_target_io, clone);
		break;
	case DM_TYPE_REQUEST_BASED:
		cachep = _rq_tio_cache;
		pool_size = dm_get_reserved_rq_based_ios();
		pools->rq_pool = mempool_create_slab_pool(pool_size, _rq_cache);
		if (!pools->rq_pool)
			goto out;
		/* fall through to setup remaining rq-based pools */
	case DM_TYPE_MQ_REQUEST_BASED:
		if (!pool_size)
			pool_size = dm_get_reserved_rq_based_ios();
		front_pad = offsetof(struct dm_rq_clone_bio_info, clone);
		/* per_bio_data_size is not used. See __bind_mempools(). */
		WARN_ON(per_bio_data_size != 0);
		break;
	default:
		BUG();
	}

	if (cachep) {
		pools->io_pool = mempool_create_slab_pool(pool_size, cachep);
		if (!pools->io_pool)
			goto out;
	}
K
Kiyoshi Ueda 已提交
3617

J
Junichi Nomura 已提交
3618
	pools->bs = bioset_create_nobvec(pool_size, front_pad);
K
Kiyoshi Ueda 已提交
3619
	if (!pools->bs)
J
Jun'ichi Nomura 已提交
3620
		goto out;
K
Kiyoshi Ueda 已提交
3621

3622
	if (integrity && bioset_integrity_create(pools->bs, pool_size))
J
Jun'ichi Nomura 已提交
3623
		goto out;
3624

K
Kiyoshi Ueda 已提交
3625
	return pools;
3626 3627 3628

out:
	dm_free_md_mempools(pools);
3629

3630
	return NULL;
K
Kiyoshi Ueda 已提交
3631 3632 3633 3634 3635 3636 3637 3638 3639 3640
}

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

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

3641 3642 3643
	if (pools->rq_pool)
		mempool_destroy(pools->rq_pool);

K
Kiyoshi Ueda 已提交
3644 3645 3646 3647 3648 3649
	if (pools->bs)
		bioset_free(pools->bs);

	kfree(pools);
}

3650
static const struct block_device_operations dm_blk_dops = {
L
Linus Torvalds 已提交
3651 3652
	.open = dm_blk_open,
	.release = dm_blk_close,
3653
	.ioctl = dm_blk_ioctl,
D
Darrick J. Wong 已提交
3654
	.getgeo = dm_blk_getgeo,
L
Linus Torvalds 已提交
3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665
	.owner = THIS_MODULE
};

/*
 * 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");
3666

3667 3668 3669
module_param(reserved_bio_based_ios, uint, S_IRUGO | S_IWUSR);
MODULE_PARM_DESC(reserved_bio_based_ios, "Reserved IOs in bio-based mempools");

3670 3671 3672
module_param(reserved_rq_based_ios, uint, S_IRUGO | S_IWUSR);
MODULE_PARM_DESC(reserved_rq_based_ios, "Reserved IOs in request-based mempools");

3673 3674 3675
module_param(use_blk_mq, bool, S_IRUGO | S_IWUSR);
MODULE_PARM_DESC(use_blk_mq, "Use block multiqueue for request-based DM devices");

L
Linus Torvalds 已提交
3676 3677 3678
MODULE_DESCRIPTION(DM_NAME " driver");
MODULE_AUTHOR("Joe Thornber <dm-devel@redhat.com>");
MODULE_LICENSE("GPL");