xen-blkfront.c 72.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39
/*
 * blkfront.c
 *
 * XenLinux virtual block device driver.
 *
 * Copyright (c) 2003-2004, Keir Fraser & Steve Hand
 * Modifications by Mark A. Williamson are (c) Intel Research Cambridge
 * Copyright (c) 2004, Christian Limpach
 * Copyright (c) 2004, Andrew Warfield
 * Copyright (c) 2005, Christopher Clark
 * Copyright (c) 2005, XenSource Ltd
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License version 2
 * as published by the Free Software Foundation; or, when distributed
 * separately from the Linux kernel or incorporated into other
 * software packages, subject to the following license:
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this source file (the "Software"), to deal in the Software without
 * restriction, including without limitation the rights to use, copy, modify,
 * merge, publish, distribute, sublicense, and/or sell copies of the Software,
 * and to permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
 * IN THE SOFTWARE.
 */

#include <linux/interrupt.h>
#include <linux/blkdev.h>
B
Bob Liu 已提交
40
#include <linux/blk-mq.h>
41
#include <linux/hdreg.h>
42
#include <linux/cdrom.h>
43
#include <linux/module.h>
44
#include <linux/slab.h>
45
#include <linux/mutex.h>
46
#include <linux/scatterlist.h>
47
#include <linux/bitmap.h>
48
#include <linux/list.h>
49

50
#include <xen/xen.h>
51 52 53 54
#include <xen/xenbus.h>
#include <xen/grant_table.h>
#include <xen/events.h>
#include <xen/page.h>
55
#include <xen/platform_pci.h>
56 57 58

#include <xen/interface/grant_table.h>
#include <xen/interface/io/blkif.h>
59
#include <xen/interface/io/protocols.h>
60 61 62

#include <asm/xen/hypervisor.h>

63 64 65 66 67 68 69 70 71 72 73 74 75 76
/*
 * The minimal size of segment supported by the block framework is PAGE_SIZE.
 * When Linux is using a different page size than Xen, it may not be possible
 * to put all the data in a single segment.
 * This can happen when the backend doesn't support indirect descriptor and
 * therefore the maximum amount of data that a request can carry is
 * BLKIF_MAX_SEGMENTS_PER_REQUEST * XEN_PAGE_SIZE = 44KB
 *
 * Note that we only support one extra request. So the Linux page size
 * should be <= ( 2 * BLKIF_MAX_SEGMENTS_PER_REQUEST * XEN_PAGE_SIZE) =
 * 88KB.
 */
#define HAS_EXTRA_REQ (BLKIF_MAX_SEGMENTS_PER_REQUEST < XEN_PFN_PER_PAGE)

77 78 79 80 81 82
enum blkif_state {
	BLKIF_STATE_DISCONNECTED,
	BLKIF_STATE_CONNECTED,
	BLKIF_STATE_SUSPENDED,
};

83 84
struct grant {
	grant_ref_t gref;
85
	struct page *page;
86
	struct list_head node;
87 88
};

89 90 91 92 93 94 95
enum blk_req_status {
	REQ_WAITING,
	REQ_DONE,
	REQ_ERROR,
	REQ_EOPNOTSUPP,
};

96 97
struct blk_shadow {
	struct blkif_request req;
98
	struct request *request;
99 100
	struct grant **grants_used;
	struct grant **indirect_grants;
101
	struct scatterlist *sg;
102
	unsigned int num_sg;
103 104 105 106 107 108 109 110
	enum blk_req_status status;

	#define NO_ASSOCIATED_ID ~0UL
	/*
	 * Id of the sibling if we ever need 2 requests when handling a
	 * block I/O request
	 */
	unsigned long associated_id;
111 112 113 114 115
};

struct split_bio {
	struct bio *bio;
	atomic_t pending;
116 117
};

118 119 120 121 122 123 124 125 126
struct blkif_req {
	int	error;
};

static inline struct blkif_req *blkif_req(struct request *rq)
{
	return blk_mq_rq_to_pdu(rq);
}

127
static DEFINE_MUTEX(blkfront_mutex);
128
static const struct block_device_operations xlvbd_block_fops;
129

130 131 132 133 134 135 136
/*
 * Maximum number of segments in indirect requests, the actual value used by
 * the frontend driver is the minimum of this value and the value provided
 * by the backend driver.
 */

static unsigned int xen_blkif_max_segments = 32;
137 138 139 140
module_param_named(max_indirect_segments, xen_blkif_max_segments, uint,
		   S_IRUGO);
MODULE_PARM_DESC(max_indirect_segments,
		 "Maximum amount of segments in indirect requests (default is 32)");
141

142 143 144 145
static unsigned int xen_blkif_max_queues = 4;
module_param_named(max_queues, xen_blkif_max_queues, uint, S_IRUGO);
MODULE_PARM_DESC(max_queues, "Maximum number of hardware queues/rings used per virtual disk");

B
Bob Liu 已提交
146 147 148 149 150 151 152 153
/*
 * Maximum order of pages to be used for the shared ring between front and
 * backend, 4KB page granularity is used.
 */
static unsigned int xen_blkif_max_ring_order;
module_param_named(max_ring_page_order, xen_blkif_max_ring_order, int, S_IRUGO);
MODULE_PARM_DESC(max_ring_page_order, "Maximum order of pages to be used for the shared ring");

154 155 156 157
#define BLK_RING_SIZE(info)	\
	__CONST_RING_SIZE(blkif, XEN_PAGE_SIZE * (info)->nr_ring_pages)

#define BLK_MAX_RING_SIZE	\
158
	__CONST_RING_SIZE(blkif, XEN_PAGE_SIZE * XENBUS_MAX_RING_GRANTS)
159

B
Bob Liu 已提交
160
/*
161 162
 * ring-ref%u i=(-1UL) would take 11 characters + 'ring-ref' is 8, so 19
 * characters are enough. Define to 20 to keep consistent with backend.
B
Bob Liu 已提交
163 164
 */
#define RINGREF_NAME_LEN (20)
165 166 167 168
/*
 * queue-%u would take 7 + 10(UINT_MAX) = 17 characters.
 */
#define QUEUE_NAME_LEN (17)
169

170 171 172 173 174 175
/*
 *  Per-ring info.
 *  Every blkfront device can associate with one or more blkfront_ring_info,
 *  depending on how many hardware queues/rings to be used.
 */
struct blkfront_ring_info {
B
Bob Liu 已提交
176 177
	/* Lock to protect data in every ring buffer. */
	spinlock_t ring_lock;
178 179 180 181 182 183 184
	struct blkif_front_ring ring;
	unsigned int ring_ref[XENBUS_MAX_RING_GRANTS];
	unsigned int evtchn, irq;
	struct work_struct work;
	struct gnttab_free_callback callback;
	struct blk_shadow shadow[BLK_MAX_RING_SIZE];
	struct list_head indirect_pages;
185 186
	struct list_head grants;
	unsigned int persistent_gnts_c;
187 188 189 190
	unsigned long shadow_free;
	struct blkfront_info *dev_info;
};

191 192 193 194 195 196 197
/*
 * We have one of these per vbd, whether ide, scsi or 'other'.  They
 * hang in private_data off the gendisk structure. We may end up
 * putting all kinds of interesting stuff here :-)
 */
struct blkfront_info
{
198
	struct mutex mutex;
199 200
	struct xenbus_device *xbdev;
	struct gendisk *gd;
201 202
	u16 sector_size;
	unsigned int physical_sector_size;
203 204 205
	int vdevice;
	blkif_vdev_t handle;
	enum blkif_state connected;
206
	/* Number of pages per ring buffer. */
B
Bob Liu 已提交
207
	unsigned int nr_ring_pages;
208
	struct request_queue *rq;
209 210
	unsigned int feature_flush:1;
	unsigned int feature_fua:1;
211 212
	unsigned int feature_discard:1;
	unsigned int feature_secdiscard:1;
213
	unsigned int feature_persistent:1;
214 215
	unsigned int discard_granularity;
	unsigned int discard_alignment;
216
	/* Number of 4KB segments handled */
217
	unsigned int max_indirect_segments;
218
	int is_ready;
B
Bob Liu 已提交
219
	struct blk_mq_tag_set tag_set;
220 221
	struct blkfront_ring_info *rinfo;
	unsigned int nr_rings;
222 223 224
	/* Save uncomplete reqs and bios for migration. */
	struct list_head requests;
	struct bio_list bio_list;
225 226
};

227 228 229 230
static unsigned int nr_minors;
static unsigned long *minors;
static DEFINE_SPINLOCK(minor_lock);

231 232 233
#define GRANT_INVALID_REF	0

#define PARTS_PER_DISK		16
234
#define PARTS_PER_EXT_DISK      256
235 236 237 238

#define BLKIF_MAJOR(dev) ((dev)>>8)
#define BLKIF_MINOR(dev) ((dev) & 0xff)

239 240 241 242
#define EXT_SHIFT 28
#define EXTENDED (1<<EXT_SHIFT)
#define VDEV_IS_EXTENDED(dev) ((dev)&(EXTENDED))
#define BLKIF_MINOR_EXT(dev) ((dev)&(~EXTENDED))
243 244
#define EMULATED_HD_DISK_MINOR_OFFSET (0)
#define EMULATED_HD_DISK_NAME_OFFSET (EMULATED_HD_DISK_MINOR_OFFSET / 256)
245 246
#define EMULATED_SD_DISK_MINOR_OFFSET (0)
#define EMULATED_SD_DISK_NAME_OFFSET (EMULATED_SD_DISK_MINOR_OFFSET / 256)
247

248
#define DEV_NAME	"xvd"	/* name in /dev */
249

250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
/*
 * Grants are always the same size as a Xen page (i.e 4KB).
 * A physical segment is always the same size as a Linux page.
 * Number of grants per physical segment
 */
#define GRANTS_PER_PSEG	(PAGE_SIZE / XEN_PAGE_SIZE)

#define GRANTS_PER_INDIRECT_FRAME \
	(XEN_PAGE_SIZE / sizeof(struct blkif_request_segment))

#define PSEGS_PER_INDIRECT_FRAME	\
	(GRANTS_INDIRECT_FRAME / GRANTS_PSEGS)

#define INDIRECT_GREFS(_grants)		\
	DIV_ROUND_UP(_grants, GRANTS_PER_INDIRECT_FRAME)

#define GREFS(_psegs)	((_psegs) * GRANTS_PER_PSEG)
267

268
static int blkfront_setup_indirect(struct blkfront_ring_info *rinfo);
269
static void blkfront_gather_backend_features(struct blkfront_info *info);
270

271
static int get_id_from_freelist(struct blkfront_ring_info *rinfo)
272
{
273 274 275 276 277
	unsigned long free = rinfo->shadow_free;

	BUG_ON(free >= BLK_RING_SIZE(rinfo->dev_info));
	rinfo->shadow_free = rinfo->shadow[free].req.u.rw.id;
	rinfo->shadow[free].req.u.rw.id = 0x0fffffee; /* debug */
278 279 280
	return free;
}

281
static int add_id_to_freelist(struct blkfront_ring_info *rinfo,
282
			      unsigned long id)
283
{
284
	if (rinfo->shadow[id].req.u.rw.id != id)
285
		return -EINVAL;
286
	if (rinfo->shadow[id].request == NULL)
287
		return -EINVAL;
288 289 290
	rinfo->shadow[id].req.u.rw.id  = rinfo->shadow_free;
	rinfo->shadow[id].request = NULL;
	rinfo->shadow_free = id;
291
	return 0;
292 293
}

294
static int fill_grant_buffer(struct blkfront_ring_info *rinfo, int num)
295
{
296
	struct blkfront_info *info = rinfo->dev_info;
297 298 299 300
	struct page *granted_page;
	struct grant *gnt_list_entry, *n;
	int i = 0;

301
	while (i < num) {
302 303 304 305
		gnt_list_entry = kzalloc(sizeof(struct grant), GFP_NOIO);
		if (!gnt_list_entry)
			goto out_of_memory;

306 307 308 309 310 311
		if (info->feature_persistent) {
			granted_page = alloc_page(GFP_NOIO);
			if (!granted_page) {
				kfree(gnt_list_entry);
				goto out_of_memory;
			}
312
			gnt_list_entry->page = granted_page;
313 314 315
		}

		gnt_list_entry->gref = GRANT_INVALID_REF;
316
		list_add(&gnt_list_entry->node, &rinfo->grants);
317 318 319 320 321 322 323
		i++;
	}

	return 0;

out_of_memory:
	list_for_each_entry_safe(gnt_list_entry, n,
324
	                         &rinfo->grants, node) {
325
		list_del(&gnt_list_entry->node);
326
		if (info->feature_persistent)
327
			__free_page(gnt_list_entry->page);
328 329 330 331 332 333 334
		kfree(gnt_list_entry);
		i--;
	}
	BUG_ON(i != 0);
	return -ENOMEM;
}

335
static struct grant *get_free_grant(struct blkfront_ring_info *rinfo)
336 337 338
{
	struct grant *gnt_list_entry;

339 340
	BUG_ON(list_empty(&rinfo->grants));
	gnt_list_entry = list_first_entry(&rinfo->grants, struct grant,
341
					  node);
342 343
	list_del(&gnt_list_entry->node);

344
	if (gnt_list_entry->gref != GRANT_INVALID_REF)
345
		rinfo->persistent_gnts_c--;
346 347 348 349 350 351 352 353 354 355 356 357 358 359 360

	return gnt_list_entry;
}

static inline void grant_foreign_access(const struct grant *gnt_list_entry,
					const struct blkfront_info *info)
{
	gnttab_page_grant_foreign_access_ref_one(gnt_list_entry->gref,
						 info->xbdev->otherend_id,
						 gnt_list_entry->page,
						 0);
}

static struct grant *get_grant(grant_ref_t *gref_head,
			       unsigned long gfn,
361
			       struct blkfront_ring_info *rinfo)
362
{
363 364
	struct grant *gnt_list_entry = get_free_grant(rinfo);
	struct blkfront_info *info = rinfo->dev_info;
365 366

	if (gnt_list_entry->gref != GRANT_INVALID_REF)
367
		return gnt_list_entry;
368 369 370 371 372 373 374 375 376 377 378

	/* Assign a gref to this page */
	gnt_list_entry->gref = gnttab_claim_grant_reference(gref_head);
	BUG_ON(gnt_list_entry->gref == -ENOSPC);
	if (info->feature_persistent)
		grant_foreign_access(gnt_list_entry, info);
	else {
		/* Grant access to the GFN passed by the caller */
		gnttab_grant_foreign_access_ref(gnt_list_entry->gref,
						info->xbdev->otherend_id,
						gfn, 0);
379 380
	}

381 382 383 384
	return gnt_list_entry;
}

static struct grant *get_indirect_grant(grant_ref_t *gref_head,
385
					struct blkfront_ring_info *rinfo)
386
{
387 388
	struct grant *gnt_list_entry = get_free_grant(rinfo);
	struct blkfront_info *info = rinfo->dev_info;
389 390 391 392

	if (gnt_list_entry->gref != GRANT_INVALID_REF)
		return gnt_list_entry;

393 394 395
	/* Assign a gref to this page */
	gnt_list_entry->gref = gnttab_claim_grant_reference(gref_head);
	BUG_ON(gnt_list_entry->gref == -ENOSPC);
396
	if (!info->feature_persistent) {
397 398 399
		struct page *indirect_page;

		/* Fetch a pre-allocated page to use for indirect grefs */
400 401
		BUG_ON(list_empty(&rinfo->indirect_pages));
		indirect_page = list_first_entry(&rinfo->indirect_pages,
402 403 404
						 struct page, lru);
		list_del(&indirect_page->lru);
		gnt_list_entry->page = indirect_page;
405
	}
406 407
	grant_foreign_access(gnt_list_entry, info);

408 409 410
	return gnt_list_entry;
}

411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427
static const char *op_name(int op)
{
	static const char *const names[] = {
		[BLKIF_OP_READ] = "read",
		[BLKIF_OP_WRITE] = "write",
		[BLKIF_OP_WRITE_BARRIER] = "barrier",
		[BLKIF_OP_FLUSH_DISKCACHE] = "flush",
		[BLKIF_OP_DISCARD] = "discard" };

	if (op < 0 || op >= ARRAY_SIZE(names))
		return "unknown";

	if (!names[op])
		return "reserved";

	return names[op];
}
428 429 430 431 432 433 434 435
static int xlbd_reserve_minors(unsigned int minor, unsigned int nr)
{
	unsigned int end = minor + nr;
	int rc;

	if (end > nr_minors) {
		unsigned long *bitmap, *old;

436
		bitmap = kcalloc(BITS_TO_LONGS(end), sizeof(*bitmap),
437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455
				 GFP_KERNEL);
		if (bitmap == NULL)
			return -ENOMEM;

		spin_lock(&minor_lock);
		if (end > nr_minors) {
			old = minors;
			memcpy(bitmap, minors,
			       BITS_TO_LONGS(nr_minors) * sizeof(*bitmap));
			minors = bitmap;
			nr_minors = BITS_TO_LONGS(end) * BITS_PER_LONG;
		} else
			old = bitmap;
		spin_unlock(&minor_lock);
		kfree(old);
	}

	spin_lock(&minor_lock);
	if (find_next_bit(minors, end, minor) >= end) {
456
		bitmap_set(minors, minor, nr);
457 458 459 460 461 462 463 464 465 466 467 468 469 470
		rc = 0;
	} else
		rc = -EBUSY;
	spin_unlock(&minor_lock);

	return rc;
}

static void xlbd_release_minors(unsigned int minor, unsigned int nr)
{
	unsigned int end = minor + nr;

	BUG_ON(end > nr_minors);
	spin_lock(&minor_lock);
471
	bitmap_clear(minors,  minor, nr);
472 473 474
	spin_unlock(&minor_lock);
}

475 476
static void blkif_restart_queue_callback(void *arg)
{
477 478
	struct blkfront_ring_info *rinfo = (struct blkfront_ring_info *)arg;
	schedule_work(&rinfo->work);
479 480
}

H
Harvey Harrison 已提交
481
static int blkif_getgeo(struct block_device *bd, struct hd_geometry *hg)
482 483 484 485 486 487 488 489 490 491 492 493 494 495 496
{
	/* We don't have real geometry info, but let's at least return
	   values consistent with the size of the device */
	sector_t nsect = get_capacity(bd->bd_disk);
	sector_t cylinders = nsect;

	hg->heads = 0xff;
	hg->sectors = 0x3f;
	sector_div(cylinders, hg->heads * hg->sectors);
	hg->cylinders = cylinders;
	if ((sector_t)(hg->cylinders + 1) * hg->heads * hg->sectors < nsect)
		hg->cylinders = 0xffff;
	return 0;
}

A
Al Viro 已提交
497
static int blkif_ioctl(struct block_device *bdev, fmode_t mode,
498
		       unsigned command, unsigned long argument)
499
{
A
Al Viro 已提交
500
	struct blkfront_info *info = bdev->bd_disk->private_data;
501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529
	int i;

	dev_dbg(&info->xbdev->dev, "command: 0x%x, argument: 0x%lx\n",
		command, (long)argument);

	switch (command) {
	case CDROMMULTISESSION:
		dev_dbg(&info->xbdev->dev, "FIXME: support multisession CDs later\n");
		for (i = 0; i < sizeof(struct cdrom_multisession); i++)
			if (put_user(0, (char __user *)(argument + i)))
				return -EFAULT;
		return 0;

	case CDROM_GET_CAPABILITY: {
		struct gendisk *gd = info->gd;
		if (gd->flags & GENHD_FL_CD)
			return 0;
		return -EINVAL;
	}

	default:
		/*printk(KERN_ALERT "ioctl %08x not supported by Xen blkdev\n",
		  command);*/
		return -EINVAL; /* same return as native Linux */
	}

	return 0;
}

530 531 532 533 534 535 536 537 538 539 540
static unsigned long blkif_ring_get_request(struct blkfront_ring_info *rinfo,
					    struct request *req,
					    struct blkif_request **ring_req)
{
	unsigned long id;

	*ring_req = RING_GET_REQUEST(&rinfo->ring, rinfo->ring.req_prod_pvt);
	rinfo->ring.req_prod_pvt++;

	id = get_id_from_freelist(rinfo);
	rinfo->shadow[id].request = req;
541 542
	rinfo->shadow[id].status = REQ_WAITING;
	rinfo->shadow[id].associated_id = NO_ASSOCIATED_ID;
543 544 545 546 547 548

	(*ring_req)->u.rw.id = id;

	return id;
}

549
static int blkif_queue_discard_req(struct request *req, struct blkfront_ring_info *rinfo)
550
{
551
	struct blkfront_info *info = rinfo->dev_info;
552 553
	struct blkif_request *ring_req;
	unsigned long id;
554 555

	/* Fill out a communications ring structure. */
556
	id = blkif_ring_get_request(rinfo, req, &ring_req);
557 558 559 560 561

	ring_req->operation = BLKIF_OP_DISCARD;
	ring_req->u.discard.nr_sectors = blk_rq_sectors(req);
	ring_req->u.discard.id = id;
	ring_req->u.discard.sector_number = (blkif_sector_t)blk_rq_pos(req);
562
	if (req_op(req) == REQ_OP_SECURE_ERASE && info->feature_secdiscard)
563 564 565 566 567
		ring_req->u.discard.flag = BLKIF_DISCARD_SECURE;
	else
		ring_req->u.discard.flag = 0;

	/* Keep a private copy so we can reissue requests when recovering. */
568
	rinfo->shadow[id].req = *ring_req;
569 570 571 572

	return 0;
}

573 574 575
struct setup_rw_req {
	unsigned int grant_idx;
	struct blkif_request_segment *segments;
576
	struct blkfront_ring_info *rinfo;
577 578 579 580 581 582 583
	struct blkif_request *ring_req;
	grant_ref_t gref_head;
	unsigned int id;
	/* Only used when persistent grant is used and it's a read request */
	bool need_copy;
	unsigned int bvec_off;
	char *bvec_data;
584 585 586

	bool require_extra_req;
	struct blkif_request *extra_ring_req;
587 588 589 590 591 592 593 594
};

static void blkif_setup_rw_req_grant(unsigned long gfn, unsigned int offset,
				     unsigned int len, void *data)
{
	struct setup_rw_req *setup = data;
	int n, ref;
	struct grant *gnt_list_entry;
595
	unsigned int fsect, lsect;
596 597 598
	/* Convenient aliases */
	unsigned int grant_idx = setup->grant_idx;
	struct blkif_request *ring_req = setup->ring_req;
599
	struct blkfront_ring_info *rinfo = setup->rinfo;
600 601 602 603 604 605
	/*
	 * We always use the shadow of the first request to store the list
	 * of grant associated to the block I/O request. This made the
	 * completion more easy to handle even if the block I/O request is
	 * split.
	 */
606
	struct blk_shadow *shadow = &rinfo->shadow[setup->id];
607

608 609 610 611 612 613 614 615 616 617
	if (unlikely(setup->require_extra_req &&
		     grant_idx >= BLKIF_MAX_SEGMENTS_PER_REQUEST)) {
		/*
		 * We are using the second request, setup grant_idx
		 * to be the index of the segment array.
		 */
		grant_idx -= BLKIF_MAX_SEGMENTS_PER_REQUEST;
		ring_req = setup->extra_ring_req;
	}

618 619 620 621 622 623
	if ((ring_req->operation == BLKIF_OP_INDIRECT) &&
	    (grant_idx % GRANTS_PER_INDIRECT_FRAME == 0)) {
		if (setup->segments)
			kunmap_atomic(setup->segments);

		n = grant_idx / GRANTS_PER_INDIRECT_FRAME;
624
		gnt_list_entry = get_indirect_grant(&setup->gref_head, rinfo);
625 626 627 628 629
		shadow->indirect_grants[n] = gnt_list_entry;
		setup->segments = kmap_atomic(gnt_list_entry->page);
		ring_req->u.indirect.indirect_grefs[n] = gnt_list_entry->gref;
	}

630
	gnt_list_entry = get_grant(&setup->gref_head, gfn, rinfo);
631
	ref = gnt_list_entry->gref;
632 633 634 635 636
	/*
	 * All the grants are stored in the shadow of the first
	 * request. Therefore we have to use the global index.
	 */
	shadow->grants_used[setup->grant_idx] = gnt_list_entry;
637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677

	if (setup->need_copy) {
		void *shared_data;

		shared_data = kmap_atomic(gnt_list_entry->page);
		/*
		 * this does not wipe data stored outside the
		 * range sg->offset..sg->offset+sg->length.
		 * Therefore, blkback *could* see data from
		 * previous requests. This is OK as long as
		 * persistent grants are shared with just one
		 * domain. It may need refactoring if this
		 * changes
		 */
		memcpy(shared_data + offset,
		       setup->bvec_data + setup->bvec_off,
		       len);

		kunmap_atomic(shared_data);
		setup->bvec_off += len;
	}

	fsect = offset >> 9;
	lsect = fsect + (len >> 9) - 1;
	if (ring_req->operation != BLKIF_OP_INDIRECT) {
		ring_req->u.rw.seg[grant_idx] =
			(struct blkif_request_segment) {
				.gref       = ref,
				.first_sect = fsect,
				.last_sect  = lsect };
	} else {
		setup->segments[grant_idx % GRANTS_PER_INDIRECT_FRAME] =
			(struct blkif_request_segment) {
				.gref       = ref,
				.first_sect = fsect,
				.last_sect  = lsect };
	}

	(setup->grant_idx)++;
}

678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696
static void blkif_setup_extra_req(struct blkif_request *first,
				  struct blkif_request *second)
{
	uint16_t nr_segments = first->u.rw.nr_segments;

	/*
	 * The second request is only present when the first request uses
	 * all its segments. It's always the continuity of the first one.
	 */
	first->u.rw.nr_segments = BLKIF_MAX_SEGMENTS_PER_REQUEST;

	second->u.rw.nr_segments = nr_segments - BLKIF_MAX_SEGMENTS_PER_REQUEST;
	second->u.rw.sector_number = first->u.rw.sector_number +
		(BLKIF_MAX_SEGMENTS_PER_REQUEST * XEN_PAGE_SIZE) / 512;

	second->u.rw.handle = first->u.rw.handle;
	second->operation = first->operation;
}

697
static int blkif_queue_rw_req(struct request *req, struct blkfront_ring_info *rinfo)
698
{
699
	struct blkfront_info *info = rinfo->dev_info;
700 701 702
	struct blkif_request *ring_req, *extra_ring_req = NULL;
	unsigned long id, extra_id = NO_ASSOCIATED_ID;
	bool require_extra_req = false;
703 704 705 706
	int i;
	struct setup_rw_req setup = {
		.grant_idx = 0,
		.segments = NULL,
707
		.rinfo = rinfo,
708 709
		.need_copy = rq_data_dir(req) && info->feature_persistent,
	};
710 711 712 713 714 715

	/*
	 * Used to store if we are able to queue the request by just using
	 * existing persistent grants, or if we have to get new grants,
	 * as there are not sufficiently many free.
	 */
716
	struct scatterlist *sg;
717
	int num_sg, max_grefs, num_grant;
718

719
	max_grefs = req->nr_phys_segments * GRANTS_PER_PSEG;
720 721 722 723 724
	if (max_grefs > BLKIF_MAX_SEGMENTS_PER_REQUEST)
		/*
		 * If we are using indirect segments we need to account
		 * for the indirect grefs used in the request.
		 */
725
		max_grefs += INDIRECT_GREFS(max_grefs);
726

727 728 729 730 731 732
	/*
	 * We have to reserve 'max_grefs' grants because persistent
	 * grants are shared by all rings.
	 */
	if (max_grefs > 0)
		if (gnttab_alloc_grant_references(max_grefs, &setup.gref_head) < 0) {
733
			gnttab_request_free_callback(
734
				&rinfo->callback,
735
				blkif_restart_queue_callback,
736
				rinfo,
737
				max_grefs);
738 739
			return 1;
		}
740 741

	/* Fill out a communications ring structure. */
742
	id = blkif_ring_get_request(rinfo, req, &ring_req);
743

744
	num_sg = blk_rq_map_sg(req->q, req, rinfo->shadow[id].sg);
745 746
	num_grant = 0;
	/* Calculate the number of grant used */
747
	for_each_sg(rinfo->shadow[id].sg, sg, num_sg, i)
748 749
	       num_grant += gnttab_count_grant(sg->offset, sg->length);

750 751 752 753
	require_extra_req = info->max_indirect_segments == 0 &&
		num_grant > BLKIF_MAX_SEGMENTS_PER_REQUEST;
	BUG_ON(!HAS_EXTRA_REQ && require_extra_req);

754
	rinfo->shadow[id].num_sg = num_sg;
755 756
	if (num_grant > BLKIF_MAX_SEGMENTS_PER_REQUEST &&
	    likely(!require_extra_req)) {
757 758 759 760
		/*
		 * The indirect operation can only be a BLKIF_OP_READ or
		 * BLKIF_OP_WRITE
		 */
761
		BUG_ON(req_op(req) == REQ_OP_FLUSH || req->cmd_flags & REQ_FUA);
762 763 764 765 766
		ring_req->operation = BLKIF_OP_INDIRECT;
		ring_req->u.indirect.indirect_op = rq_data_dir(req) ?
			BLKIF_OP_WRITE : BLKIF_OP_READ;
		ring_req->u.indirect.sector_number = (blkif_sector_t)blk_rq_pos(req);
		ring_req->u.indirect.handle = info->handle;
767
		ring_req->u.indirect.nr_segments = num_grant;
768
	} else {
769 770 771 772
		ring_req->u.rw.sector_number = (blkif_sector_t)blk_rq_pos(req);
		ring_req->u.rw.handle = info->handle;
		ring_req->operation = rq_data_dir(req) ?
			BLKIF_OP_WRITE : BLKIF_OP_READ;
773
		if (req_op(req) == REQ_OP_FLUSH || req->cmd_flags & REQ_FUA) {
774
			/*
775 776 777 778 779
			 * Ideally we can do an unordered flush-to-disk.
			 * In case the backend onlysupports barriers, use that.
			 * A barrier request a superset of FUA, so we can
			 * implement it the same way.  (It's also a FLUSH+FUA,
			 * since it is guaranteed ordered WRT previous writes.)
780
			 */
781
			if (info->feature_flush && info->feature_fua)
782 783
				ring_req->operation =
					BLKIF_OP_WRITE_BARRIER;
784
			else if (info->feature_flush)
785 786
				ring_req->operation =
					BLKIF_OP_FLUSH_DISKCACHE;
787
			else
788
				ring_req->operation = 0;
789
		}
790
		ring_req->u.rw.nr_segments = num_grant;
791 792 793 794 795 796 797 798 799 800 801 802 803 804 805
		if (unlikely(require_extra_req)) {
			extra_id = blkif_ring_get_request(rinfo, req,
							  &extra_ring_req);
			/*
			 * Only the first request contains the scatter-gather
			 * list.
			 */
			rinfo->shadow[extra_id].num_sg = 0;

			blkif_setup_extra_req(ring_req, extra_ring_req);

			/* Link the 2 requests together */
			rinfo->shadow[extra_id].associated_id = id;
			rinfo->shadow[id].associated_id = extra_id;
		}
806
	}
807

808 809
	setup.ring_req = ring_req;
	setup.id = id;
810 811 812 813 814

	setup.require_extra_req = require_extra_req;
	if (unlikely(require_extra_req))
		setup.extra_ring_req = extra_ring_req;

815
	for_each_sg(rinfo->shadow[id].sg, sg, num_sg, i) {
816
		BUG_ON(sg->offset + sg->length > PAGE_SIZE);
817

818 819 820 821
		if (setup.need_copy) {
			setup.bvec_off = sg->offset;
			setup.bvec_data = kmap_atomic(sg_page(sg));
		}
822

823 824 825 826 827
		gnttab_foreach_grant_in_range(sg_page(sg),
					      sg->offset,
					      sg->length,
					      blkif_setup_rw_req_grant,
					      &setup);
828

829 830
		if (setup.need_copy)
			kunmap_atomic(setup.bvec_data);
831
	}
832 833
	if (setup.segments)
		kunmap_atomic(setup.segments);
834 835

	/* Keep a private copy so we can reissue requests when recovering. */
836
	rinfo->shadow[id].req = *ring_req;
837 838
	if (unlikely(require_extra_req))
		rinfo->shadow[extra_id].req = *extra_ring_req;
839

840
	if (max_grefs > 0)
841
		gnttab_free_grant_references(setup.gref_head);
842 843 844 845

	return 0;
}

846 847 848 849 850 851
/*
 * Generate a Xen blkfront IO request from a blk layer request.  Reads
 * and writes are handled as expected.
 *
 * @req: a request struct
 */
852
static int blkif_queue_request(struct request *req, struct blkfront_ring_info *rinfo)
853
{
854
	if (unlikely(rinfo->dev_info->connected != BLKIF_STATE_CONNECTED))
855 856
		return 1;

M
Mike Christie 已提交
857
	if (unlikely(req_op(req) == REQ_OP_DISCARD ||
858
		     req_op(req) == REQ_OP_SECURE_ERASE))
859
		return blkif_queue_discard_req(req, rinfo);
860
	else
861
		return blkif_queue_rw_req(req, rinfo);
862
}
863

864
static inline void flush_requests(struct blkfront_ring_info *rinfo)
865 866 867
{
	int notify;

868
	RING_PUSH_REQUESTS_AND_CHECK_NOTIFY(&rinfo->ring, notify);
869 870

	if (notify)
871
		notify_remote_via_irq(rinfo->irq);
872 873
}

874 875
static inline bool blkif_request_flush_invalid(struct request *req,
					       struct blkfront_info *info)
876
{
877
	return (blk_rq_is_passthrough(req) ||
878
		((req_op(req) == REQ_OP_FLUSH) &&
879
		 !info->feature_flush) ||
880
		((req->cmd_flags & REQ_FUA) &&
881
		 !info->feature_fua));
882 883
}

B
Bob Liu 已提交
884
static int blkif_queue_rq(struct blk_mq_hw_ctx *hctx,
885
			  const struct blk_mq_queue_data *qd)
886
{
B
Bob Liu 已提交
887
	unsigned long flags;
888 889 890
	int qid = hctx->queue_num;
	struct blkfront_info *info = hctx->queue->queuedata;
	struct blkfront_ring_info *rinfo = NULL;
891

892 893
	BUG_ON(info->nr_rings <= qid);
	rinfo = &info->rinfo[qid];
B
Bob Liu 已提交
894
	blk_mq_start_request(qd->rq);
B
Bob Liu 已提交
895
	spin_lock_irqsave(&rinfo->ring_lock, flags);
896
	if (RING_FULL(&rinfo->ring))
B
Bob Liu 已提交
897
		goto out_busy;
898

899
	if (blkif_request_flush_invalid(qd->rq, rinfo->dev_info))
B
Bob Liu 已提交
900
		goto out_err;
901

902
	if (blkif_queue_request(qd->rq, rinfo))
B
Bob Liu 已提交
903
		goto out_busy;
904

905
	flush_requests(rinfo);
B
Bob Liu 已提交
906
	spin_unlock_irqrestore(&rinfo->ring_lock, flags);
B
Bob Liu 已提交
907
	return BLK_MQ_RQ_QUEUE_OK;
908

B
Bob Liu 已提交
909
out_err:
B
Bob Liu 已提交
910
	spin_unlock_irqrestore(&rinfo->ring_lock, flags);
B
Bob Liu 已提交
911
	return BLK_MQ_RQ_QUEUE_ERROR;
912

B
Bob Liu 已提交
913
out_busy:
B
Bob Liu 已提交
914
	spin_unlock_irqrestore(&rinfo->ring_lock, flags);
B
Bob Liu 已提交
915 916
	blk_mq_stop_hw_queue(hctx);
	return BLK_MQ_RQ_QUEUE_BUSY;
917 918
}

919 920 921 922 923
static void blkif_complete_rq(struct request *rq)
{
	blk_mq_end_request(rq, blkif_req(rq)->error);
}

924
static const struct blk_mq_ops blkfront_mq_ops = {
B
Bob Liu 已提交
925
	.queue_rq = blkif_queue_rq,
926
	.complete = blkif_complete_rq,
B
Bob Liu 已提交
927 928
};

929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965
static void blkif_set_queue_limits(struct blkfront_info *info)
{
	struct request_queue *rq = info->rq;
	struct gendisk *gd = info->gd;
	unsigned int segments = info->max_indirect_segments ? :
				BLKIF_MAX_SEGMENTS_PER_REQUEST;

	queue_flag_set_unlocked(QUEUE_FLAG_VIRT, rq);

	if (info->feature_discard) {
		queue_flag_set_unlocked(QUEUE_FLAG_DISCARD, rq);
		blk_queue_max_discard_sectors(rq, get_capacity(gd));
		rq->limits.discard_granularity = info->discard_granularity;
		rq->limits.discard_alignment = info->discard_alignment;
		if (info->feature_secdiscard)
			queue_flag_set_unlocked(QUEUE_FLAG_SECERASE, rq);
	}

	/* Hard sector size and max sectors impersonate the equiv. hardware. */
	blk_queue_logical_block_size(rq, info->sector_size);
	blk_queue_physical_block_size(rq, info->physical_sector_size);
	blk_queue_max_hw_sectors(rq, (segments * XEN_PAGE_SIZE) / 512);

	/* Each segment in a request is up to an aligned page in size. */
	blk_queue_segment_boundary(rq, PAGE_SIZE - 1);
	blk_queue_max_segment_size(rq, PAGE_SIZE);

	/* Ensure a merged request will fit in a single I/O ring slot. */
	blk_queue_max_segments(rq, segments / GRANTS_PER_PSEG);

	/* Make sure buffer addresses are sector-aligned. */
	blk_queue_dma_alignment(rq, 511);

	/* Make sure we don't use bounce buffers. */
	blk_queue_bounce_limit(rq, BLK_BOUNCE_ANY);
}

966
static int xlvbd_init_blk_queue(struct gendisk *gd, u16 sector_size,
967
				unsigned int physical_sector_size)
968
{
969
	struct request_queue *rq;
970
	struct blkfront_info *info = gd->private_data;
971

B
Bob Liu 已提交
972 973
	memset(&info->tag_set, 0, sizeof(info->tag_set));
	info->tag_set.ops = &blkfront_mq_ops;
974
	info->tag_set.nr_hw_queues = info->nr_rings;
975 976 977 978 979 980 981 982 983 984
	if (HAS_EXTRA_REQ && info->max_indirect_segments == 0) {
		/*
		 * When indirect descriptior is not supported, the I/O request
		 * will be split between multiple request in the ring.
		 * To avoid problems when sending the request, divide by
		 * 2 the depth of the queue.
		 */
		info->tag_set.queue_depth =  BLK_RING_SIZE(info) / 2;
	} else
		info->tag_set.queue_depth = BLK_RING_SIZE(info);
B
Bob Liu 已提交
985 986
	info->tag_set.numa_node = NUMA_NO_NODE;
	info->tag_set.flags = BLK_MQ_F_SHOULD_MERGE | BLK_MQ_F_SG_MERGE;
987
	info->tag_set.cmd_size = sizeof(struct blkif_req);
B
Bob Liu 已提交
988 989 990
	info->tag_set.driver_data = info;

	if (blk_mq_alloc_tag_set(&info->tag_set))
991
		return -EINVAL;
B
Bob Liu 已提交
992 993 994
	rq = blk_mq_init_queue(&info->tag_set);
	if (IS_ERR(rq)) {
		blk_mq_free_tag_set(&info->tag_set);
995
		return PTR_ERR(rq);
B
Bob Liu 已提交
996
	}
997

998
	rq->queuedata = info;
999 1000 1001 1002 1003
	info->rq = gd->queue = rq;
	info->gd = gd;
	info->sector_size = sector_size;
	info->physical_sector_size = physical_sector_size;
	blkif_set_queue_limits(info);
1004 1005 1006 1007

	return 0;
}

1008
static const char *flush_info(struct blkfront_info *info)
1009
{
1010
	if (info->feature_flush && info->feature_fua)
1011
		return "barrier: enabled;";
1012
	else if (info->feature_flush)
1013
		return "flush diskcache: enabled;";
1014
	else
1015 1016
		return "barrier or flush: disabled;";
}
1017

1018
static void xlvbd_flush(struct blkfront_info *info)
1019
{
1020 1021
	blk_queue_write_cache(info->rq, info->feature_flush ? true : false,
			      info->feature_fua ? true : false);
1022
	pr_info("blkfront: %s: %s %s %s %s %s\n",
1023
		info->gd->disk_name, flush_info(info),
1024 1025 1026
		"persistent grants:", info->feature_persistent ?
		"enabled;" : "disabled;", "indirect descriptors:",
		info->max_indirect_segments ? "enabled;" : "disabled;");
1027 1028
}

1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087
static int xen_translate_vdev(int vdevice, int *minor, unsigned int *offset)
{
	int major;
	major = BLKIF_MAJOR(vdevice);
	*minor = BLKIF_MINOR(vdevice);
	switch (major) {
		case XEN_IDE0_MAJOR:
			*offset = (*minor / 64) + EMULATED_HD_DISK_NAME_OFFSET;
			*minor = ((*minor / 64) * PARTS_PER_DISK) +
				EMULATED_HD_DISK_MINOR_OFFSET;
			break;
		case XEN_IDE1_MAJOR:
			*offset = (*minor / 64) + 2 + EMULATED_HD_DISK_NAME_OFFSET;
			*minor = (((*minor / 64) + 2) * PARTS_PER_DISK) +
				EMULATED_HD_DISK_MINOR_OFFSET;
			break;
		case XEN_SCSI_DISK0_MAJOR:
			*offset = (*minor / PARTS_PER_DISK) + EMULATED_SD_DISK_NAME_OFFSET;
			*minor = *minor + EMULATED_SD_DISK_MINOR_OFFSET;
			break;
		case XEN_SCSI_DISK1_MAJOR:
		case XEN_SCSI_DISK2_MAJOR:
		case XEN_SCSI_DISK3_MAJOR:
		case XEN_SCSI_DISK4_MAJOR:
		case XEN_SCSI_DISK5_MAJOR:
		case XEN_SCSI_DISK6_MAJOR:
		case XEN_SCSI_DISK7_MAJOR:
			*offset = (*minor / PARTS_PER_DISK) + 
				((major - XEN_SCSI_DISK1_MAJOR + 1) * 16) +
				EMULATED_SD_DISK_NAME_OFFSET;
			*minor = *minor +
				((major - XEN_SCSI_DISK1_MAJOR + 1) * 16 * PARTS_PER_DISK) +
				EMULATED_SD_DISK_MINOR_OFFSET;
			break;
		case XEN_SCSI_DISK8_MAJOR:
		case XEN_SCSI_DISK9_MAJOR:
		case XEN_SCSI_DISK10_MAJOR:
		case XEN_SCSI_DISK11_MAJOR:
		case XEN_SCSI_DISK12_MAJOR:
		case XEN_SCSI_DISK13_MAJOR:
		case XEN_SCSI_DISK14_MAJOR:
		case XEN_SCSI_DISK15_MAJOR:
			*offset = (*minor / PARTS_PER_DISK) + 
				((major - XEN_SCSI_DISK8_MAJOR + 8) * 16) +
				EMULATED_SD_DISK_NAME_OFFSET;
			*minor = *minor +
				((major - XEN_SCSI_DISK8_MAJOR + 8) * 16 * PARTS_PER_DISK) +
				EMULATED_SD_DISK_MINOR_OFFSET;
			break;
		case XENVBD_MAJOR:
			*offset = *minor / PARTS_PER_DISK;
			break;
		default:
			printk(KERN_WARNING "blkfront: your disk configuration is "
					"incorrect, please use an xvd device instead\n");
			return -ENODEV;
	}
	return 0;
}
1088

1089 1090 1091 1092 1093 1094 1095 1096
static char *encode_disk_name(char *ptr, unsigned int n)
{
	if (n >= 26)
		ptr = encode_disk_name(ptr, n / 26 - 1);
	*ptr = 'a' + n % 26;
	return ptr + 1;
}

1097 1098
static int xlvbd_alloc_gendisk(blkif_sector_t capacity,
			       struct blkfront_info *info,
1099 1100
			       u16 vdisk_info, u16 sector_size,
			       unsigned int physical_sector_size)
1101 1102 1103
{
	struct gendisk *gd;
	int nr_minors = 1;
1104
	int err;
1105 1106 1107
	unsigned int offset;
	int minor;
	int nr_parts;
1108
	char *ptr;
1109 1110 1111 1112

	BUG_ON(info->gd != NULL);
	BUG_ON(info->rq != NULL);

1113 1114 1115 1116 1117 1118 1119
	if ((info->vdevice>>EXT_SHIFT) > 1) {
		/* this is above the extended range; something is wrong */
		printk(KERN_WARNING "blkfront: vdevice 0x%x is above the extended range; ignoring\n", info->vdevice);
		return -ENODEV;
	}

	if (!VDEV_IS_EXTENDED(info->vdevice)) {
1120 1121 1122 1123
		err = xen_translate_vdev(info->vdevice, &minor, &offset);
		if (err)
			return err;		
 		nr_parts = PARTS_PER_DISK;
1124 1125 1126
	} else {
		minor = BLKIF_MINOR_EXT(info->vdevice);
		nr_parts = PARTS_PER_EXT_DISK;
1127
		offset = minor / nr_parts;
1128
		if (xen_hvm_domain() && offset < EMULATED_HD_DISK_NAME_OFFSET + 4)
1129 1130 1131
			printk(KERN_WARNING "blkfront: vdevice 0x%x might conflict with "
					"emulated IDE disks,\n\t choose an xvd device name"
					"from xvde on\n", info->vdevice);
1132
	}
1133 1134 1135 1136 1137
	if (minor >> MINORBITS) {
		pr_warn("blkfront: %#x's minor (%#x) out of range; ignoring\n",
			info->vdevice, minor);
		return -ENODEV;
	}
1138 1139 1140

	if ((minor % nr_parts) == 0)
		nr_minors = nr_parts;
1141

1142 1143 1144 1145 1146
	err = xlbd_reserve_minors(minor, nr_minors);
	if (err)
		goto out;
	err = -ENODEV;

1147 1148
	gd = alloc_disk(nr_minors);
	if (gd == NULL)
1149
		goto release;
1150

1151 1152 1153 1154 1155 1156 1157 1158
	strcpy(gd->disk_name, DEV_NAME);
	ptr = encode_disk_name(gd->disk_name + sizeof(DEV_NAME) - 1, offset);
	BUG_ON(ptr >= gd->disk_name + DISK_NAME_LEN);
	if (nr_minors > 1)
		*ptr = 0;
	else
		snprintf(ptr, gd->disk_name + DISK_NAME_LEN - ptr,
			 "%d", minor & (nr_parts - 1));
1159 1160 1161 1162 1163 1164 1165

	gd->major = XENVBD_MAJOR;
	gd->first_minor = minor;
	gd->fops = &xlvbd_block_fops;
	gd->private_data = info;
	set_capacity(gd, capacity);

1166
	if (xlvbd_init_blk_queue(gd, sector_size, physical_sector_size)) {
1167
		del_gendisk(gd);
1168
		goto release;
1169 1170
	}

1171
	xlvbd_flush(info);
1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183

	if (vdisk_info & VDISK_READONLY)
		set_disk_ro(gd, 1);

	if (vdisk_info & VDISK_REMOVABLE)
		gd->flags |= GENHD_FL_REMOVABLE;

	if (vdisk_info & VDISK_CDROM)
		gd->flags |= GENHD_FL_CD;

	return 0;

1184 1185
 release:
	xlbd_release_minors(minor, nr_minors);
1186 1187 1188 1189
 out:
	return err;
}

D
Daniel Stodden 已提交
1190 1191
static void xlvbd_release_gendisk(struct blkfront_info *info)
{
1192
	unsigned int minor, nr_minors, i;
D
Daniel Stodden 已提交
1193 1194 1195 1196 1197

	if (info->rq == NULL)
		return;

	/* No more blkif_request(). */
B
Bob Liu 已提交
1198
	blk_mq_stop_hw_queues(info->rq);
D
Daniel Stodden 已提交
1199

1200 1201
	for (i = 0; i < info->nr_rings; i++) {
		struct blkfront_ring_info *rinfo = &info->rinfo[i];
D
Daniel Stodden 已提交
1202

1203 1204 1205 1206 1207 1208
		/* No more gnttab callback work. */
		gnttab_cancel_free_callback(&rinfo->callback);

		/* Flush gnttab callback work. Must be done with no locks held. */
		flush_work(&rinfo->work);
	}
D
Daniel Stodden 已提交
1209 1210 1211 1212 1213 1214 1215 1216

	del_gendisk(info->gd);

	minor = info->gd->first_minor;
	nr_minors = info->gd->minors;
	xlbd_release_minors(minor, nr_minors);

	blk_cleanup_queue(info->rq);
B
Bob Liu 已提交
1217
	blk_mq_free_tag_set(&info->tag_set);
D
Daniel Stodden 已提交
1218 1219 1220 1221 1222 1223
	info->rq = NULL;

	put_disk(info->gd);
	info->gd = NULL;
}

B
Bob Liu 已提交
1224 1225
/* Already hold rinfo->ring_lock. */
static inline void kick_pending_request_queues_locked(struct blkfront_ring_info *rinfo)
1226
{
1227 1228
	if (!RING_FULL(&rinfo->ring))
		blk_mq_start_stopped_hw_queues(rinfo->dev_info->rq, true);
1229 1230
}

B
Bob Liu 已提交
1231 1232 1233 1234 1235 1236 1237 1238 1239
static void kick_pending_request_queues(struct blkfront_ring_info *rinfo)
{
	unsigned long flags;

	spin_lock_irqsave(&rinfo->ring_lock, flags);
	kick_pending_request_queues_locked(rinfo);
	spin_unlock_irqrestore(&rinfo->ring_lock, flags);
}

1240 1241
static void blkif_restart_queue(struct work_struct *work)
{
1242
	struct blkfront_ring_info *rinfo = container_of(work, struct blkfront_ring_info, work);
1243

1244 1245
	if (rinfo->dev_info->connected == BLKIF_STATE_CONNECTED)
		kick_pending_request_queues(rinfo);
1246 1247
}

1248
static void blkif_free_ring(struct blkfront_ring_info *rinfo)
1249
{
1250
	struct grant *persistent_gnt, *n;
1251
	struct blkfront_info *info = rinfo->dev_info;
1252
	int i, j, segs;
1253

1254 1255 1256 1257
	/*
	 * Remove indirect pages, this only happens when using indirect
	 * descriptors but not persistent grants
	 */
1258
	if (!list_empty(&rinfo->indirect_pages)) {
1259 1260 1261
		struct page *indirect_page, *n;

		BUG_ON(info->feature_persistent);
1262
		list_for_each_entry_safe(indirect_page, n, &rinfo->indirect_pages, lru) {
1263 1264 1265 1266 1267
			list_del(&indirect_page->lru);
			__free_page(indirect_page);
		}
	}

1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284
	/* Remove all persistent grants. */
	if (!list_empty(&rinfo->grants)) {
		list_for_each_entry_safe(persistent_gnt, n,
					 &rinfo->grants, node) {
			list_del(&persistent_gnt->node);
			if (persistent_gnt->gref != GRANT_INVALID_REF) {
				gnttab_end_foreign_access(persistent_gnt->gref,
							  0, 0UL);
				rinfo->persistent_gnts_c--;
			}
			if (info->feature_persistent)
				__free_page(persistent_gnt->page);
			kfree(persistent_gnt);
		}
	}
	BUG_ON(rinfo->persistent_gnts_c != 0);

B
Bob Liu 已提交
1285
	for (i = 0; i < BLK_RING_SIZE(info); i++) {
1286 1287 1288 1289
		/*
		 * Clear persistent grants present in requests already
		 * on the shared ring
		 */
1290
		if (!rinfo->shadow[i].request)
1291 1292
			goto free_shadow;

1293 1294 1295
		segs = rinfo->shadow[i].req.operation == BLKIF_OP_INDIRECT ?
		       rinfo->shadow[i].req.u.indirect.nr_segments :
		       rinfo->shadow[i].req.u.rw.nr_segments;
1296
		for (j = 0; j < segs; j++) {
1297
			persistent_gnt = rinfo->shadow[i].grants_used[j];
1298
			gnttab_end_foreign_access(persistent_gnt->gref, 0, 0UL);
1299
			if (info->feature_persistent)
1300
				__free_page(persistent_gnt->page);
1301 1302 1303
			kfree(persistent_gnt);
		}

1304
		if (rinfo->shadow[i].req.operation != BLKIF_OP_INDIRECT)
1305 1306 1307 1308 1309 1310 1311
			/*
			 * If this is not an indirect operation don't try to
			 * free indirect segments
			 */
			goto free_shadow;

		for (j = 0; j < INDIRECT_GREFS(segs); j++) {
1312
			persistent_gnt = rinfo->shadow[i].indirect_grants[j];
1313
			gnttab_end_foreign_access(persistent_gnt->gref, 0, 0UL);
1314
			__free_page(persistent_gnt->page);
1315 1316 1317 1318
			kfree(persistent_gnt);
		}

free_shadow:
1319 1320 1321 1322 1323 1324
		kfree(rinfo->shadow[i].grants_used);
		rinfo->shadow[i].grants_used = NULL;
		kfree(rinfo->shadow[i].indirect_grants);
		rinfo->shadow[i].indirect_grants = NULL;
		kfree(rinfo->shadow[i].sg);
		rinfo->shadow[i].sg = NULL;
1325 1326
	}

1327
	/* No more gnttab callback work. */
1328
	gnttab_cancel_free_callback(&rinfo->callback);
1329 1330

	/* Flush gnttab callback work. Must be done with no locks held. */
1331
	flush_work(&rinfo->work);
1332 1333

	/* Free resources associated with old device channel. */
B
Bob Liu 已提交
1334
	for (i = 0; i < info->nr_ring_pages; i++) {
1335 1336 1337
		if (rinfo->ring_ref[i] != GRANT_INVALID_REF) {
			gnttab_end_foreign_access(rinfo->ring_ref[i], 0, 0);
			rinfo->ring_ref[i] = GRANT_INVALID_REF;
B
Bob Liu 已提交
1338
		}
1339
	}
1340
	free_pages((unsigned long)rinfo->ring.sring, get_order(info->nr_ring_pages * XEN_PAGE_SIZE));
1341
	rinfo->ring.sring = NULL;
B
Bob Liu 已提交
1342

1343 1344 1345
	if (rinfo->irq)
		unbind_from_irqhandler(rinfo->irq, rinfo);
	rinfo->evtchn = rinfo->irq = 0;
1346
}
1347

1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364
static void blkif_free(struct blkfront_info *info, int suspend)
{
	unsigned int i;

	/* Prevent new requests being issued until we fix things up. */
	info->connected = suspend ?
		BLKIF_STATE_SUSPENDED : BLKIF_STATE_DISCONNECTED;
	/* No more blkif_request(). */
	if (info->rq)
		blk_mq_stop_hw_queues(info->rq);

	for (i = 0; i < info->nr_rings; i++)
		blkif_free_ring(&info->rinfo[i]);

	kfree(info->rinfo);
	info->rinfo = NULL;
	info->nr_rings = 0;
1365 1366
}

1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392
struct copy_from_grant {
	const struct blk_shadow *s;
	unsigned int grant_idx;
	unsigned int bvec_offset;
	char *bvec_data;
};

static void blkif_copy_from_grant(unsigned long gfn, unsigned int offset,
				  unsigned int len, void *data)
{
	struct copy_from_grant *info = data;
	char *shared_data;
	/* Convenient aliases */
	const struct blk_shadow *s = info->s;

	shared_data = kmap_atomic(s->grants_used[info->grant_idx]->page);

	memcpy(info->bvec_data + info->bvec_offset,
	       shared_data + offset, len);

	info->bvec_offset += len;
	info->grant_idx++;

	kunmap_atomic(shared_data);
}

1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425
static enum blk_req_status blkif_rsp_to_req_status(int rsp)
{
	switch (rsp)
	{
	case BLKIF_RSP_OKAY:
		return REQ_DONE;
	case BLKIF_RSP_EOPNOTSUPP:
		return REQ_EOPNOTSUPP;
	case BLKIF_RSP_ERROR:
		/* Fallthrough. */
	default:
		return REQ_ERROR;
	}
}

/*
 * Get the final status of the block request based on two ring response
 */
static int blkif_get_final_status(enum blk_req_status s1,
				  enum blk_req_status s2)
{
	BUG_ON(s1 == REQ_WAITING);
	BUG_ON(s2 == REQ_WAITING);

	if (s1 == REQ_ERROR || s2 == REQ_ERROR)
		return BLKIF_RSP_ERROR;
	else if (s1 == REQ_EOPNOTSUPP || s2 == REQ_EOPNOTSUPP)
		return BLKIF_RSP_EOPNOTSUPP;
	return BLKIF_RSP_OKAY;
}

static bool blkif_completion(unsigned long *id,
			     struct blkfront_ring_info *rinfo,
1426
			     struct blkif_response *bret)
1427
{
1428
	int i = 0;
1429
	struct scatterlist *sg;
1430
	int num_sg, num_grant;
1431
	struct blkfront_info *info = rinfo->dev_info;
1432
	struct blk_shadow *s = &rinfo->shadow[*id];
1433 1434 1435
	struct copy_from_grant data = {
		.grant_idx = 0,
	};
1436

1437
	num_grant = s->req.operation == BLKIF_OP_INDIRECT ?
1438
		s->req.u.indirect.nr_segments : s->req.u.rw.nr_segments;
1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479

	/* The I/O request may be split in two. */
	if (unlikely(s->associated_id != NO_ASSOCIATED_ID)) {
		struct blk_shadow *s2 = &rinfo->shadow[s->associated_id];

		/* Keep the status of the current response in shadow. */
		s->status = blkif_rsp_to_req_status(bret->status);

		/* Wait the second response if not yet here. */
		if (s2->status == REQ_WAITING)
			return 0;

		bret->status = blkif_get_final_status(s->status,
						      s2->status);

		/*
		 * All the grants is stored in the first shadow in order
		 * to make the completion code simpler.
		 */
		num_grant += s2->req.u.rw.nr_segments;

		/*
		 * The two responses may not come in order. Only the
		 * first request will store the scatter-gather list.
		 */
		if (s2->num_sg != 0) {
			/* Update "id" with the ID of the first response. */
			*id = s->associated_id;
			s = s2;
		}

		/*
		 * We don't need anymore the second request, so recycling
		 * it now.
		 */
		if (add_id_to_freelist(rinfo, s->associated_id))
			WARN(1, "%s: can't recycle the second part (id = %ld) of the request\n",
			     info->gd->disk_name, s->associated_id);
	}

	data.s = s;
1480
	num_sg = s->num_sg;
1481

1482
	if (bret->operation == BLKIF_OP_READ && info->feature_persistent) {
1483
		for_each_sg(s->sg, sg, num_sg, i) {
1484
			BUG_ON(sg->offset + sg->length > PAGE_SIZE);
1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495

			data.bvec_offset = sg->offset;
			data.bvec_data = kmap_atomic(sg_page(sg));

			gnttab_foreach_grant_in_range(sg_page(sg),
						      sg->offset,
						      sg->length,
						      blkif_copy_from_grant,
						      &data);

			kunmap_atomic(data.bvec_data);
1496 1497 1498
		}
	}
	/* Add the persistent grant into the list of free grants */
1499
	for (i = 0; i < num_grant; i++) {
1500 1501 1502 1503 1504 1505 1506
		if (gnttab_query_foreign_access(s->grants_used[i]->gref)) {
			/*
			 * If the grant is still mapped by the backend (the
			 * backend has chosen to make this grant persistent)
			 * we add it at the head of the list, so it will be
			 * reused first.
			 */
1507 1508 1509
			if (!info->feature_persistent)
				pr_alert_ratelimited("backed has not unmapped grant: %u\n",
						     s->grants_used[i]->gref);
1510 1511
			list_add(&s->grants_used[i]->node, &rinfo->grants);
			rinfo->persistent_gnts_c++;
1512 1513 1514 1515 1516 1517 1518 1519 1520
		} else {
			/*
			 * If the grant is not mapped by the backend we end the
			 * foreign access and add it to the tail of the list,
			 * so it will not be picked again unless we run out of
			 * persistent grants.
			 */
			gnttab_end_foreign_access(s->grants_used[i]->gref, 0, 0UL);
			s->grants_used[i]->gref = GRANT_INVALID_REF;
1521
			list_add_tail(&s->grants_used[i]->node, &rinfo->grants);
1522
		}
1523
	}
1524
	if (s->req.operation == BLKIF_OP_INDIRECT) {
1525
		for (i = 0; i < INDIRECT_GREFS(num_grant); i++) {
1526
			if (gnttab_query_foreign_access(s->indirect_grants[i]->gref)) {
1527 1528 1529
				if (!info->feature_persistent)
					pr_alert_ratelimited("backed has not unmapped grant: %u\n",
							     s->indirect_grants[i]->gref);
1530 1531
				list_add(&s->indirect_grants[i]->node, &rinfo->grants);
				rinfo->persistent_gnts_c++;
1532
			} else {
1533 1534
				struct page *indirect_page;

1535
				gnttab_end_foreign_access(s->indirect_grants[i]->gref, 0, 0UL);
1536 1537 1538 1539
				/*
				 * Add the used indirect page back to the list of
				 * available pages for indirect grefs.
				 */
1540
				if (!info->feature_persistent) {
1541
					indirect_page = s->indirect_grants[i]->page;
1542
					list_add(&indirect_page->lru, &rinfo->indirect_pages);
1543
				}
1544
				s->indirect_grants[i]->gref = GRANT_INVALID_REF;
1545
				list_add_tail(&s->indirect_grants[i]->node, &rinfo->grants);
1546
			}
1547 1548
		}
	}
1549 1550

	return 1;
1551 1552 1553 1554 1555 1556 1557 1558
}

static irqreturn_t blkif_interrupt(int irq, void *dev_id)
{
	struct request *req;
	struct blkif_response *bret;
	RING_IDX i, rp;
	unsigned long flags;
1559 1560
	struct blkfront_ring_info *rinfo = (struct blkfront_ring_info *)dev_id;
	struct blkfront_info *info = rinfo->dev_info;
1561

B
Bob Liu 已提交
1562
	if (unlikely(info->connected != BLKIF_STATE_CONNECTED))
1563 1564
		return IRQ_HANDLED;

B
Bob Liu 已提交
1565
	spin_lock_irqsave(&rinfo->ring_lock, flags);
1566
 again:
1567
	rp = rinfo->ring.sring->rsp_prod;
1568 1569
	rmb(); /* Ensure we see queued responses up to 'rp'. */

1570
	for (i = rinfo->ring.rsp_cons; i != rp; i++) {
1571 1572
		unsigned long id;

1573
		bret = RING_GET_RESPONSE(&rinfo->ring, i);
1574
		id   = bret->id;
1575 1576 1577 1578 1579
		/*
		 * The backend has messed up and given us an id that we would
		 * never have given to it (we stamp it up to BLK_RING_SIZE -
		 * look in get_id_from_freelist.
		 */
B
Bob Liu 已提交
1580
		if (id >= BLK_RING_SIZE(info)) {
1581 1582 1583 1584 1585 1586
			WARN(1, "%s: response to %s has incorrect id (%ld)\n",
			     info->gd->disk_name, op_name(bret->operation), id);
			/* We can't safely get the 'struct request' as
			 * the id is busted. */
			continue;
		}
1587
		req  = rinfo->shadow[id].request;
1588

1589 1590 1591 1592 1593 1594 1595 1596
		if (bret->operation != BLKIF_OP_DISCARD) {
			/*
			 * We may need to wait for an extra response if the
			 * I/O request is split in 2
			 */
			if (!blkif_completion(&id, rinfo, bret))
				continue;
		}
1597

1598
		if (add_id_to_freelist(rinfo, id)) {
1599 1600 1601 1602
			WARN(1, "%s: response to %s (id %ld) couldn't be recycled!\n",
			     info->gd->disk_name, op_name(bret->operation), id);
			continue;
		}
1603

1604
		blkif_req(req)->error = (bret->status == BLKIF_RSP_OKAY) ? 0 : -EIO;
1605
		switch (bret->operation) {
1606 1607 1608
		case BLKIF_OP_DISCARD:
			if (unlikely(bret->status == BLKIF_RSP_EOPNOTSUPP)) {
				struct request_queue *rq = info->rq;
1609 1610
				printk(KERN_WARNING "blkfront: %s: %s op failed\n",
					   info->gd->disk_name, op_name(bret->operation));
1611
				blkif_req(req)->error = -EOPNOTSUPP;
1612
				info->feature_discard = 0;
1613
				info->feature_secdiscard = 0;
1614
				queue_flag_clear(QUEUE_FLAG_DISCARD, rq);
1615
				queue_flag_clear(QUEUE_FLAG_SECERASE, rq);
1616 1617
			}
			break;
1618
		case BLKIF_OP_FLUSH_DISKCACHE:
1619 1620
		case BLKIF_OP_WRITE_BARRIER:
			if (unlikely(bret->status == BLKIF_RSP_EOPNOTSUPP)) {
1621 1622
				printk(KERN_WARNING "blkfront: %s: %s op failed\n",
				       info->gd->disk_name, op_name(bret->operation));
1623
				blkif_req(req)->error = -EOPNOTSUPP;
1624 1625
			}
			if (unlikely(bret->status == BLKIF_RSP_ERROR &&
1626
				     rinfo->shadow[id].req.u.rw.nr_segments == 0)) {
1627 1628
				printk(KERN_WARNING "blkfront: %s: empty %s op failed\n",
				       info->gd->disk_name, op_name(bret->operation));
1629
				blkif_req(req)->error = -EOPNOTSUPP;
1630
			}
1631 1632 1633
			if (unlikely(blkif_req(req)->error)) {
				if (blkif_req(req)->error == -EOPNOTSUPP)
					blkif_req(req)->error = 0;
1634
				info->feature_fua = 0;
1635 1636
				info->feature_flush = 0;
				xlvbd_flush(info);
1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648
			}
			/* fall through */
		case BLKIF_OP_READ:
		case BLKIF_OP_WRITE:
			if (unlikely(bret->status != BLKIF_RSP_OKAY))
				dev_dbg(&info->xbdev->dev, "Bad return from blkdev data "
					"request: %x\n", bret->status);

			break;
		default:
			BUG();
		}
1649 1650

		blk_mq_complete_request(req, 0);
1651 1652
	}

1653
	rinfo->ring.rsp_cons = i;
1654

1655
	if (i != rinfo->ring.req_prod_pvt) {
1656
		int more_to_do;
1657
		RING_FINAL_CHECK_FOR_RESPONSES(&rinfo->ring, more_to_do);
1658 1659 1660
		if (more_to_do)
			goto again;
	} else
1661
		rinfo->ring.sring->rsp_event = i + 1;
1662

B
Bob Liu 已提交
1663
	kick_pending_request_queues_locked(rinfo);
1664

B
Bob Liu 已提交
1665
	spin_unlock_irqrestore(&rinfo->ring_lock, flags);
1666 1667 1668 1669 1670 1671

	return IRQ_HANDLED;
}


static int setup_blkring(struct xenbus_device *dev,
1672
			 struct blkfront_ring_info *rinfo)
1673 1674
{
	struct blkif_sring *sring;
B
Bob Liu 已提交
1675
	int err, i;
1676
	struct blkfront_info *info = rinfo->dev_info;
1677
	unsigned long ring_size = info->nr_ring_pages * XEN_PAGE_SIZE;
1678
	grant_ref_t gref[XENBUS_MAX_RING_GRANTS];
1679

B
Bob Liu 已提交
1680
	for (i = 0; i < info->nr_ring_pages; i++)
1681
		rinfo->ring_ref[i] = GRANT_INVALID_REF;
1682

B
Bob Liu 已提交
1683 1684
	sring = (struct blkif_sring *)__get_free_pages(GFP_NOIO | __GFP_HIGH,
						       get_order(ring_size));
1685 1686 1687 1688 1689
	if (!sring) {
		xenbus_dev_fatal(dev, -ENOMEM, "allocating shared ring");
		return -ENOMEM;
	}
	SHARED_RING_INIT(sring);
1690
	FRONT_RING_INIT(&rinfo->ring, sring, ring_size);
1691

1692
	err = xenbus_grant_ring(dev, rinfo->ring.sring, info->nr_ring_pages, gref);
1693
	if (err < 0) {
B
Bob Liu 已提交
1694
		free_pages((unsigned long)sring, get_order(ring_size));
1695
		rinfo->ring.sring = NULL;
1696 1697
		goto fail;
	}
B
Bob Liu 已提交
1698
	for (i = 0; i < info->nr_ring_pages; i++)
1699
		rinfo->ring_ref[i] = gref[i];
1700

1701
	err = xenbus_alloc_evtchn(dev, &rinfo->evtchn);
1702 1703 1704
	if (err)
		goto fail;

1705 1706
	err = bind_evtchn_to_irqhandler(rinfo->evtchn, blkif_interrupt, 0,
					"blkif", rinfo);
1707 1708 1709 1710 1711
	if (err <= 0) {
		xenbus_dev_fatal(dev, err,
				 "bind_evtchn_to_irqhandler failed");
		goto fail;
	}
1712
	rinfo->irq = err;
1713 1714 1715 1716 1717 1718 1719

	return 0;
fail:
	blkif_free(info, 0);
	return err;
}

1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766
/*
 * Write out per-ring/queue nodes including ring-ref and event-channel, and each
 * ring buffer may have multi pages depending on ->nr_ring_pages.
 */
static int write_per_ring_nodes(struct xenbus_transaction xbt,
				struct blkfront_ring_info *rinfo, const char *dir)
{
	int err;
	unsigned int i;
	const char *message = NULL;
	struct blkfront_info *info = rinfo->dev_info;

	if (info->nr_ring_pages == 1) {
		err = xenbus_printf(xbt, dir, "ring-ref", "%u", rinfo->ring_ref[0]);
		if (err) {
			message = "writing ring-ref";
			goto abort_transaction;
		}
	} else {
		for (i = 0; i < info->nr_ring_pages; i++) {
			char ring_ref_name[RINGREF_NAME_LEN];

			snprintf(ring_ref_name, RINGREF_NAME_LEN, "ring-ref%u", i);
			err = xenbus_printf(xbt, dir, ring_ref_name,
					    "%u", rinfo->ring_ref[i]);
			if (err) {
				message = "writing ring-ref";
				goto abort_transaction;
			}
		}
	}

	err = xenbus_printf(xbt, dir, "event-channel", "%u", rinfo->evtchn);
	if (err) {
		message = "writing event-channel";
		goto abort_transaction;
	}

	return 0;

abort_transaction:
	xenbus_transaction_end(xbt, 1);
	if (message)
		xenbus_dev_fatal(info->xbdev, err, "%s", message);

	return err;
}
1767 1768

/* Common code used when first setting up, and when resuming. */
1769
static int talk_to_blkback(struct xenbus_device *dev,
1770 1771 1772 1773
			   struct blkfront_info *info)
{
	const char *message = NULL;
	struct xenbus_transaction xbt;
1774
	int err;
1775 1776
	unsigned int i, max_page_order;
	unsigned int ring_page_order;
B
Bob Liu 已提交
1777

1778 1779 1780 1781
	max_page_order = xenbus_read_unsigned(info->xbdev->otherend,
					      "max-ring-page-order", 0);
	ring_page_order = min(xen_blkif_max_ring_order, max_page_order);
	info->nr_ring_pages = 1 << ring_page_order;
1782

1783
	for (i = 0; i < info->nr_rings; i++) {
1784 1785
		struct blkfront_ring_info *rinfo = &info->rinfo[i];

1786 1787 1788 1789 1790
		/* Create shared ring, alloc event channel. */
		err = setup_blkring(dev, rinfo);
		if (err)
			goto destroy_blkring;
	}
1791 1792 1793 1794 1795 1796 1797 1798

again:
	err = xenbus_transaction_start(&xbt);
	if (err) {
		xenbus_dev_fatal(dev, err, "starting transaction");
		goto destroy_blkring;
	}

1799 1800 1801 1802 1803 1804 1805 1806
	if (info->nr_ring_pages > 1) {
		err = xenbus_printf(xbt, dev->nodename, "ring-page-order", "%u",
				    ring_page_order);
		if (err) {
			message = "writing ring-page-order";
			goto abort_transaction;
		}
	}
1807

1808 1809 1810 1811 1812 1813 1814 1815
	/* We already got the number of queues/rings in _probe */
	if (info->nr_rings == 1) {
		err = write_per_ring_nodes(xbt, &info->rinfo[0], dev->nodename);
		if (err)
			goto destroy_blkring;
	} else {
		char *path;
		size_t pathsize;
1816

1817 1818
		err = xenbus_printf(xbt, dev->nodename, "multi-queue-num-queues", "%u",
				    info->nr_rings);
1819
		if (err) {
1820
			message = "writing multi-queue-num-queues";
1821 1822
			goto abort_transaction;
		}
1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841

		pathsize = strlen(dev->nodename) + QUEUE_NAME_LEN;
		path = kmalloc(pathsize, GFP_KERNEL);
		if (!path) {
			err = -ENOMEM;
			message = "ENOMEM while writing ring references";
			goto abort_transaction;
		}

		for (i = 0; i < info->nr_rings; i++) {
			memset(path, 0, pathsize);
			snprintf(path, pathsize, "%s/queue-%u", dev->nodename, i);
			err = write_per_ring_nodes(xbt, &info->rinfo[i], path);
			if (err) {
				kfree(path);
				goto destroy_blkring;
			}
		}
		kfree(path);
1842
	}
1843 1844 1845 1846 1847 1848
	err = xenbus_printf(xbt, dev->nodename, "protocol", "%s",
			    XEN_IO_PROTO_ABI_NATIVE);
	if (err) {
		message = "writing protocol";
		goto abort_transaction;
	}
1849
	err = xenbus_printf(xbt, dev->nodename,
1850
			    "feature-persistent", "%u", 1);
1851 1852 1853
	if (err)
		dev_warn(&dev->dev,
			 "writing persistent grants feature to xenbus");
1854 1855 1856 1857 1858 1859 1860 1861 1862

	err = xenbus_transaction_end(xbt, 0);
	if (err) {
		if (err == -EAGAIN)
			goto again;
		xenbus_dev_fatal(dev, err, "completing transaction");
		goto destroy_blkring;
	}

1863 1864
	for (i = 0; i < info->nr_rings; i++) {
		unsigned int j;
1865
		struct blkfront_ring_info *rinfo = &info->rinfo[i];
1866 1867 1868 1869 1870

		for (j = 0; j < BLK_RING_SIZE(info); j++)
			rinfo->shadow[j].req.u.rw.id = j + 1;
		rinfo->shadow[BLK_RING_SIZE(info)-1].req.u.rw.id = 0x0fffffff;
	}
1871 1872 1873 1874 1875 1876 1877 1878 1879 1880
	xenbus_switch_state(dev, XenbusStateInitialised);

	return 0;

 abort_transaction:
	xenbus_transaction_end(xbt, 1);
	if (message)
		xenbus_dev_fatal(dev, err, "%s", message);
 destroy_blkring:
	blkif_free(info, 0);
1881

1882 1883 1884
	kfree(info);
	dev_set_drvdata(&dev->dev, NULL);

1885 1886 1887
	return err;
}

1888 1889
static int negotiate_mq(struct blkfront_info *info)
{
1890
	unsigned int backend_max_queues;
1891 1892 1893 1894 1895
	unsigned int i;

	BUG_ON(info->nr_rings);

	/* Check if backend supports multiple queues. */
1896 1897
	backend_max_queues = xenbus_read_unsigned(info->xbdev->otherend,
						  "multi-queue-max-queues", 1);
1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920
	info->nr_rings = min(backend_max_queues, xen_blkif_max_queues);
	/* We need at least one ring. */
	if (!info->nr_rings)
		info->nr_rings = 1;

	info->rinfo = kzalloc(sizeof(struct blkfront_ring_info) * info->nr_rings, GFP_KERNEL);
	if (!info->rinfo) {
		xenbus_dev_fatal(info->xbdev, -ENOMEM, "allocating ring_info structure");
		return -ENOMEM;
	}

	for (i = 0; i < info->nr_rings; i++) {
		struct blkfront_ring_info *rinfo;

		rinfo = &info->rinfo[i];
		INIT_LIST_HEAD(&rinfo->indirect_pages);
		INIT_LIST_HEAD(&rinfo->grants);
		rinfo->dev_info = info;
		INIT_WORK(&rinfo->work, blkif_restart_queue);
		spin_lock_init(&rinfo->ring_lock);
	}
	return 0;
}
1921 1922 1923 1924 1925 1926 1927 1928 1929
/**
 * Entry point to this code when a new device is created.  Allocate the basic
 * structures and the ring buffer for communication with the backend, and
 * inform the backend of the appropriate details for those.  Switch to
 * Initialised state.
 */
static int blkfront_probe(struct xenbus_device *dev,
			  const struct xenbus_device_id *id)
{
B
Bob Liu 已提交
1930
	int err, vdevice;
1931 1932 1933 1934 1935 1936
	struct blkfront_info *info;

	/* FIXME: Use dynamic device id if this is not set. */
	err = xenbus_scanf(XBT_NIL, dev->nodename,
			   "virtual-device", "%i", &vdevice);
	if (err != 1) {
1937 1938 1939 1940 1941 1942 1943
		/* go looking in the extended area instead */
		err = xenbus_scanf(XBT_NIL, dev->nodename, "virtual-device-ext",
				   "%i", &vdevice);
		if (err != 1) {
			xenbus_dev_fatal(dev, err, "reading virtual-device");
			return err;
		}
1944 1945
	}

1946 1947 1948 1949
	if (xen_hvm_domain()) {
		char *type;
		int len;
		/* no unplug has been done: do not hook devices != xen vbds */
1950
		if (xen_has_pv_and_legacy_disk_devices()) {
1951 1952 1953 1954 1955 1956 1957 1958 1959 1960
			int major;

			if (!VDEV_IS_EXTENDED(vdevice))
				major = BLKIF_MAJOR(vdevice);
			else
				major = XENVBD_MAJOR;

			if (major != XENVBD_MAJOR) {
				printk(KERN_INFO
						"%s: HVM does not support vbd %d as xen block device\n",
1961
						__func__, vdevice);
1962 1963 1964 1965 1966 1967 1968 1969 1970
				return -ENODEV;
			}
		}
		/* do not create a PV cdrom device if we are an HVM guest */
		type = xenbus_read(XBT_NIL, dev->nodename, "device-type", &len);
		if (IS_ERR(type))
			return -ENODEV;
		if (strncmp(type, "cdrom", 5) == 0) {
			kfree(type);
1971 1972
			return -ENODEV;
		}
1973
		kfree(type);
1974
	}
1975 1976 1977 1978 1979 1980
	info = kzalloc(sizeof(*info), GFP_KERNEL);
	if (!info) {
		xenbus_dev_fatal(dev, -ENOMEM, "allocating info structure");
		return -ENOMEM;
	}

1981
	info->xbdev = dev;
1982 1983
	err = negotiate_mq(info);
	if (err) {
1984
		kfree(info);
1985
		return err;
1986
	}
1987

1988
	mutex_init(&info->mutex);
1989 1990 1991 1992 1993
	info->vdevice = vdevice;
	info->connected = BLKIF_STATE_DISCONNECTED;

	/* Front end dir is a number, which is used as the id. */
	info->handle = simple_strtoul(strrchr(dev->nodename, '/')+1, NULL, 0);
1994
	dev_set_drvdata(&dev->dev, info);
1995 1996 1997 1998

	return 0;
}

1999
static void split_bio_end(struct bio *bio)
2000 2001 2002 2003 2004
{
	struct split_bio *split_bio = bio->bi_private;

	if (atomic_dec_and_test(&split_bio->pending)) {
		split_bio->bio->bi_phys_segments = 0;
2005 2006
		split_bio->bio->bi_error = bio->bi_error;
		bio_endio(split_bio->bio);
2007 2008 2009 2010
		kfree(split_bio);
	}
	bio_put(bio);
}
2011 2012 2013

static int blkif_recover(struct blkfront_info *info)
{
2014
	unsigned int i, r_index;
2015 2016 2017 2018 2019 2020 2021
	struct request *req, *n;
	int rc;
	struct bio *bio, *cloned_bio;
	unsigned int segs, offset;
	int pending, size;
	struct split_bio *split_bio;

2022
	blkfront_gather_backend_features(info);
2023 2024
	/* Reset limits changed by blk_mq_update_nr_hw_queues(). */
	blkif_set_queue_limits(info);
2025
	segs = info->max_indirect_segments ? : BLKIF_MAX_SEGMENTS_PER_REQUEST;
2026
	blk_queue_max_segments(info->rq, segs / GRANTS_PER_PSEG);
2027

2028
	for (r_index = 0; r_index < info->nr_rings; r_index++) {
2029
		struct blkfront_ring_info *rinfo = &info->rinfo[r_index];
2030 2031

		rc = blkfront_setup_indirect(rinfo);
2032
		if (rc)
2033 2034
			return rc;
	}
2035 2036 2037 2038 2039
	xenbus_switch_state(info->xbdev, XenbusStateConnected);

	/* Now safe for us to use the shared ring */
	info->connected = BLKIF_STATE_CONNECTED;

2040 2041 2042 2043 2044 2045 2046
	for (r_index = 0; r_index < info->nr_rings; r_index++) {
		struct blkfront_ring_info *rinfo;

		rinfo = &info->rinfo[r_index];
		/* Kick any other new requests queued since we resumed */
		kick_pending_request_queues(rinfo);
	}
2047

2048
	list_for_each_entry_safe(req, n, &info->requests, queuelist) {
2049 2050 2051
		/* Requeue pending requests (flush or discard) */
		list_del_init(&req->queuelist);
		BUG_ON(req->nr_phys_segments > segs);
2052
		blk_mq_requeue_request(req, false);
2053
	}
2054
	blk_mq_start_stopped_hw_queues(info->rq, true);
B
Bob Liu 已提交
2055
	blk_mq_kick_requeue_list(info->rq);
2056

2057
	while ((bio = bio_list_pop(&info->bio_list)) != NULL) {
2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069
		/* Traverse the list of pending bios and re-queue them */
		if (bio_segments(bio) > segs) {
			/*
			 * This bio has more segments than what we can
			 * handle, we have to split it.
			 */
			pending = (bio_segments(bio) + segs - 1) / segs;
			split_bio = kzalloc(sizeof(*split_bio), GFP_NOIO);
			BUG_ON(split_bio == NULL);
			atomic_set(&split_bio->pending, pending);
			split_bio->bio = bio;
			for (i = 0; i < pending; i++) {
2070 2071
				offset = (i * segs * XEN_PAGE_SIZE) >> 9;
				size = min((unsigned int)(segs * XEN_PAGE_SIZE) >> 9,
2072
					   (unsigned int)bio_sectors(bio) - offset);
2073 2074
				cloned_bio = bio_clone(bio, GFP_NOIO);
				BUG_ON(cloned_bio == NULL);
2075
				bio_trim(cloned_bio, offset, size);
2076 2077
				cloned_bio->bi_private = split_bio;
				cloned_bio->bi_end_io = split_bio_end;
2078
				submit_bio(cloned_bio);
2079 2080 2081 2082 2083 2084 2085 2086
			}
			/*
			 * Now we have to wait for all those smaller bios to
			 * end, so we can also end the "parent" bio.
			 */
			continue;
		}
		/* We don't need to split this bio */
2087
		submit_bio(bio);
2088 2089
	}

2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100
	return 0;
}

/**
 * We are reconnecting to the backend, due to a suspend/resume, or a backend
 * driver restart.  We tear down our blkif structure and recreate it, but
 * leave the device-layer structures intact so that this is transparent to the
 * rest of the kernel.
 */
static int blkfront_resume(struct xenbus_device *dev)
{
2101
	struct blkfront_info *info = dev_get_drvdata(&dev->dev);
2102
	int err = 0;
2103
	unsigned int i, j;
2104 2105 2106

	dev_dbg(&dev->dev, "blkfront_resume: %s\n", dev->nodename);

2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121
	bio_list_init(&info->bio_list);
	INIT_LIST_HEAD(&info->requests);
	for (i = 0; i < info->nr_rings; i++) {
		struct blkfront_ring_info *rinfo = &info->rinfo[i];
		struct bio_list merge_bio;
		struct blk_shadow *shadow = rinfo->shadow;

		for (j = 0; j < BLK_RING_SIZE(info); j++) {
			/* Not in use? */
			if (!shadow[j].request)
				continue;

			/*
			 * Get the bios in the request so we can re-queue them.
			 */
2122 2123
			if (req_op(shadow[i].request) == REQ_OP_FLUSH ||
			    req_op(shadow[i].request) == REQ_OP_DISCARD ||
2124 2125
			    req_op(shadow[i].request) == REQ_OP_SECURE_ERASE ||
			    shadow[j].request->cmd_flags & REQ_FUA) {
2126 2127 2128
				/*
				 * Flush operations don't contain bios, so
				 * we need to requeue the whole request
2129 2130 2131
				 *
				 * XXX: but this doesn't make any sense for a
				 * write with the FUA flag set..
2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143
				 */
				list_add(&shadow[j].request->queuelist, &info->requests);
				continue;
			}
			merge_bio.head = shadow[j].request->bio;
			merge_bio.tail = shadow[j].request->biotail;
			bio_list_merge(&info->bio_list, &merge_bio);
			shadow[j].request->bio = NULL;
			blk_mq_end_request(shadow[j].request, 0);
		}
	}

2144 2145
	blkif_free(info, info->connected == BLKIF_STATE_CONNECTED);

2146 2147 2148 2149
	err = negotiate_mq(info);
	if (err)
		return err;

2150
	err = talk_to_blkback(dev, info);
2151 2152
	if (!err)
		blk_mq_update_nr_hw_queues(&info->tag_set, info->nr_rings);
2153 2154 2155 2156 2157 2158

	/*
	 * We have to wait for the backend to switch to
	 * connected state, since we want to read which
	 * features it supports.
	 */
2159 2160 2161 2162

	return err;
}

2163
static void blkfront_closing(struct blkfront_info *info)
2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186
{
	struct xenbus_device *xbdev = info->xbdev;
	struct block_device *bdev = NULL;

	mutex_lock(&info->mutex);

	if (xbdev->state == XenbusStateClosing) {
		mutex_unlock(&info->mutex);
		return;
	}

	if (info->gd)
		bdev = bdget_disk(info->gd, 0);

	mutex_unlock(&info->mutex);

	if (!bdev) {
		xenbus_frontend_closed(xbdev);
		return;
	}

	mutex_lock(&bdev->bd_mutex);

2187
	if (bdev->bd_openers) {
2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198
		xenbus_dev_error(xbdev, -EBUSY,
				 "Device in use; refusing to close");
		xenbus_switch_state(xbdev, XenbusStateClosing);
	} else {
		xlvbd_release_gendisk(info);
		xenbus_frontend_closed(xbdev);
	}

	mutex_unlock(&bdev->bd_mutex);
	bdput(bdev);
}
2199

2200 2201 2202 2203 2204 2205
static void blkfront_setup_discard(struct blkfront_info *info)
{
	int err;
	unsigned int discard_granularity;
	unsigned int discard_alignment;

2206 2207 2208 2209 2210 2211 2212 2213 2214
	info->feature_discard = 1;
	err = xenbus_gather(XBT_NIL, info->xbdev->otherend,
		"discard-granularity", "%u", &discard_granularity,
		"discard-alignment", "%u", &discard_alignment,
		NULL);
	if (!err) {
		info->discard_granularity = discard_granularity;
		info->discard_alignment = discard_alignment;
	}
2215 2216 2217
	info->feature_secdiscard =
		!!xenbus_read_unsigned(info->xbdev->otherend, "discard-secure",
				       0);
2218 2219
}

2220
static int blkfront_setup_indirect(struct blkfront_ring_info *rinfo)
2221
{
2222
	unsigned int psegs, grants;
2223
	int err, i;
2224
	struct blkfront_info *info = rinfo->dev_info;
2225

2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237
	if (info->max_indirect_segments == 0) {
		if (!HAS_EXTRA_REQ)
			grants = BLKIF_MAX_SEGMENTS_PER_REQUEST;
		else {
			/*
			 * When an extra req is required, the maximum
			 * grants supported is related to the size of the
			 * Linux block segment.
			 */
			grants = GRANTS_PER_PSEG;
		}
	}
2238
	else
2239
		grants = info->max_indirect_segments;
2240
	psegs = DIV_ROUND_UP(grants, GRANTS_PER_PSEG);
2241

2242
	err = fill_grant_buffer(rinfo,
2243
				(grants + INDIRECT_GREFS(grants)) * BLK_RING_SIZE(info));
2244 2245 2246
	if (err)
		goto out_of_memory;

2247 2248 2249 2250 2251 2252
	if (!info->feature_persistent && info->max_indirect_segments) {
		/*
		 * We are using indirect descriptors but not persistent
		 * grants, we need to allocate a set of pages that can be
		 * used for mapping indirect grefs
		 */
2253
		int num = INDIRECT_GREFS(grants) * BLK_RING_SIZE(info);
2254

2255
		BUG_ON(!list_empty(&rinfo->indirect_pages));
2256 2257 2258 2259
		for (i = 0; i < num; i++) {
			struct page *indirect_page = alloc_page(GFP_NOIO);
			if (!indirect_page)
				goto out_of_memory;
2260
			list_add(&indirect_page->lru, &rinfo->indirect_pages);
2261 2262 2263
		}
	}

B
Bob Liu 已提交
2264
	for (i = 0; i < BLK_RING_SIZE(info); i++) {
2265 2266
		rinfo->shadow[i].grants_used = kzalloc(
			sizeof(rinfo->shadow[i].grants_used[0]) * grants,
2267
			GFP_NOIO);
2268
		rinfo->shadow[i].sg = kzalloc(sizeof(rinfo->shadow[i].sg[0]) * psegs, GFP_NOIO);
2269
		if (info->max_indirect_segments)
2270 2271
			rinfo->shadow[i].indirect_grants = kzalloc(
				sizeof(rinfo->shadow[i].indirect_grants[0]) *
2272
				INDIRECT_GREFS(grants),
2273
				GFP_NOIO);
2274 2275
		if ((rinfo->shadow[i].grants_used == NULL) ||
			(rinfo->shadow[i].sg == NULL) ||
2276
		     (info->max_indirect_segments &&
2277
		     (rinfo->shadow[i].indirect_grants == NULL)))
2278
			goto out_of_memory;
2279
		sg_init_table(rinfo->shadow[i].sg, psegs);
2280 2281 2282 2283 2284 2285
	}


	return 0;

out_of_memory:
B
Bob Liu 已提交
2286
	for (i = 0; i < BLK_RING_SIZE(info); i++) {
2287 2288 2289 2290 2291 2292
		kfree(rinfo->shadow[i].grants_used);
		rinfo->shadow[i].grants_used = NULL;
		kfree(rinfo->shadow[i].sg);
		rinfo->shadow[i].sg = NULL;
		kfree(rinfo->shadow[i].indirect_grants);
		rinfo->shadow[i].indirect_grants = NULL;
2293
	}
2294
	if (!list_empty(&rinfo->indirect_pages)) {
2295
		struct page *indirect_page, *n;
2296
		list_for_each_entry_safe(indirect_page, n, &rinfo->indirect_pages, lru) {
2297 2298 2299 2300
			list_del(&indirect_page->lru);
			__free_page(indirect_page);
		}
	}
2301 2302 2303
	return -ENOMEM;
}

2304 2305 2306
/*
 * Gather all backend feature-*
 */
2307
static void blkfront_gather_backend_features(struct blkfront_info *info)
2308 2309 2310 2311
{
	unsigned int indirect_segments;

	info->feature_flush = 0;
2312
	info->feature_fua = 0;
2313 2314 2315 2316 2317 2318 2319 2320

	/*
	 * If there's no "feature-barrier" defined, then it means
	 * we're dealing with a very old backend which writes
	 * synchronously; nothing to do.
	 *
	 * If there are barriers, then we use flush.
	 */
2321
	if (xenbus_read_unsigned(info->xbdev->otherend, "feature-barrier", 0)) {
2322 2323 2324 2325
		info->feature_flush = 1;
		info->feature_fua = 1;
	}

2326 2327 2328 2329
	/*
	 * And if there is "feature-flush-cache" use that above
	 * barriers.
	 */
2330 2331
	if (xenbus_read_unsigned(info->xbdev->otherend, "feature-flush-cache",
				 0)) {
2332 2333 2334
		info->feature_flush = 1;
		info->feature_fua = 0;
	}
2335

2336
	if (xenbus_read_unsigned(info->xbdev->otherend, "feature-discard", 0))
2337 2338
		blkfront_setup_discard(info);

2339
	info->feature_persistent =
2340 2341
		!!xenbus_read_unsigned(info->xbdev->otherend,
				       "feature-persistent", 0);
2342

2343 2344
	indirect_segments = xenbus_read_unsigned(info->xbdev->otherend,
					"feature-max-indirect-segments", 0);
2345 2346 2347 2348 2349
	if (indirect_segments > xen_blkif_max_segments)
		indirect_segments = xen_blkif_max_segments;
	if (indirect_segments <= BLKIF_MAX_SEGMENTS_PER_REQUEST)
		indirect_segments = 0;
	info->max_indirect_segments = indirect_segments;
2350 2351
}

2352 2353 2354 2355 2356 2357 2358 2359
/*
 * Invoked when the backend is finally 'ready' (and has told produced
 * the details about the physical device - #sectors, size, etc).
 */
static void blkfront_connect(struct blkfront_info *info)
{
	unsigned long long sectors;
	unsigned long sector_size;
2360
	unsigned int physical_sector_size;
2361
	unsigned int binfo;
2362
	char *envp[] = { "RESIZE=1", NULL };
2363
	int err, i;
2364

2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377
	switch (info->connected) {
	case BLKIF_STATE_CONNECTED:
		/*
		 * Potentially, the back-end may be signalling
		 * a capacity change; update the capacity.
		 */
		err = xenbus_scanf(XBT_NIL, info->xbdev->otherend,
				   "sectors", "%Lu", &sectors);
		if (XENBUS_EXIST_ERR(err))
			return;
		printk(KERN_INFO "Setting capacity to %Lu\n",
		       sectors);
		set_capacity(info->gd, sectors);
2378
		revalidate_disk(info->gd);
2379 2380
		kobject_uevent_env(&disk_to_dev(info->gd)->kobj,
				   KOBJ_CHANGE, envp);
2381

2382
		return;
2383
	case BLKIF_STATE_SUSPENDED:
2384 2385 2386 2387 2388 2389 2390
		/*
		 * If we are recovering from suspension, we need to wait
		 * for the backend to announce it's features before
		 * reconnecting, at least we need to know if the backend
		 * supports indirect descriptors, and how many.
		 */
		blkif_recover(info);
2391 2392
		return;

2393 2394
	default:
		break;
2395
	}
2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411

	dev_dbg(&info->xbdev->dev, "%s:%s.\n",
		__func__, info->xbdev->otherend);

	err = xenbus_gather(XBT_NIL, info->xbdev->otherend,
			    "sectors", "%llu", &sectors,
			    "info", "%u", &binfo,
			    "sector-size", "%lu", &sector_size,
			    NULL);
	if (err) {
		xenbus_dev_fatal(info->xbdev, err,
				 "reading backend fields at %s",
				 info->xbdev->otherend);
		return;
	}

2412 2413 2414 2415 2416
	/*
	 * physcial-sector-size is a newer field, so old backends may not
	 * provide this. Assume physical sector size to be the same as
	 * sector_size in that case.
	 */
2417 2418 2419
	physical_sector_size = xenbus_read_unsigned(info->xbdev->otherend,
						    "physical-sector-size",
						    sector_size);
2420 2421 2422 2423 2424 2425 2426 2427 2428
	blkfront_gather_backend_features(info);
	for (i = 0; i < info->nr_rings; i++) {
		err = blkfront_setup_indirect(&info->rinfo[i]);
		if (err) {
			xenbus_dev_fatal(info->xbdev, err, "setup_indirect at %s",
					 info->xbdev->otherend);
			blkif_free(info, 0);
			break;
		}
2429 2430
	}

2431 2432
	err = xlvbd_alloc_gendisk(sectors, info, binfo, sector_size,
				  physical_sector_size);
2433 2434 2435
	if (err) {
		xenbus_dev_fatal(info->xbdev, err, "xlvbd_add at %s",
				 info->xbdev->otherend);
2436
		goto fail;
2437 2438 2439 2440 2441 2442
	}

	xenbus_switch_state(info->xbdev, XenbusStateConnected);

	/* Kick pending requests. */
	info->connected = BLKIF_STATE_CONNECTED;
2443 2444
	for (i = 0; i < info->nr_rings; i++)
		kick_pending_request_queues(&info->rinfo[i]);
2445

2446
	device_add_disk(&info->xbdev->dev, info->gd);
2447 2448

	info->is_ready = 1;
2449 2450 2451 2452 2453
	return;

fail:
	blkif_free(info, 0);
	return;
2454 2455 2456 2457 2458
}

/**
 * Callback received when the backend's state changes.
 */
2459
static void blkback_changed(struct xenbus_device *dev,
2460 2461
			    enum xenbus_state backend_state)
{
2462
	struct blkfront_info *info = dev_get_drvdata(&dev->dev);
2463

2464
	dev_dbg(&dev->dev, "blkfront:blkback_changed to state %d.\n", backend_state);
2465 2466 2467

	switch (backend_state) {
	case XenbusStateInitWait:
2468 2469
		if (dev->state != XenbusStateInitialising)
			break;
2470
		if (talk_to_blkback(dev, info))
2471 2472
			break;
	case XenbusStateInitialising:
2473
	case XenbusStateInitialised:
2474 2475
	case XenbusStateReconfiguring:
	case XenbusStateReconfigured:
2476 2477 2478 2479
	case XenbusStateUnknown:
		break;

	case XenbusStateConnected:
2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492
		/*
		 * talk_to_blkback sets state to XenbusStateInitialised
		 * and blkfront_connect sets it to XenbusStateConnected
		 * (if connection went OK).
		 *
		 * If the backend (or toolstack) decides to poke at backend
		 * state (and re-trigger the watch by setting the state repeatedly
		 * to XenbusStateConnected (4)) we need to deal with this.
		 * This is allowed as this is used to communicate to the guest
		 * that the size of disk has changed!
		 */
		if ((dev->state != XenbusStateInitialised) &&
		    (dev->state != XenbusStateConnected)) {
2493 2494 2495
			if (talk_to_blkback(dev, info))
				break;
		}
2496

2497 2498 2499
		blkfront_connect(info);
		break;

2500 2501 2502 2503
	case XenbusStateClosed:
		if (dev->state == XenbusStateClosed)
			break;
		/* Missed the backend's Closing state -- fallthrough */
2504
	case XenbusStateClosing:
2505 2506
		if (info)
			blkfront_closing(info);
2507 2508 2509 2510
		break;
	}
}

2511
static int blkfront_remove(struct xenbus_device *xbdev)
2512
{
2513 2514 2515
	struct blkfront_info *info = dev_get_drvdata(&xbdev->dev);
	struct block_device *bdev = NULL;
	struct gendisk *disk;
2516

2517
	dev_dbg(&xbdev->dev, "%s removed", xbdev->nodename);
2518 2519 2520

	blkif_free(info, 0);

2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543
	mutex_lock(&info->mutex);

	disk = info->gd;
	if (disk)
		bdev = bdget_disk(disk, 0);

	info->xbdev = NULL;
	mutex_unlock(&info->mutex);

	if (!bdev) {
		kfree(info);
		return 0;
	}

	/*
	 * The xbdev was removed before we reached the Closed
	 * state. See if it's safe to remove the disk. If the bdev
	 * isn't closed yet, we let release take care of it.
	 */

	mutex_lock(&bdev->bd_mutex);
	info = disk->private_data;

2544 2545 2546 2547
	dev_warn(disk_to_dev(disk),
		 "%s was hot-unplugged, %d stale handles\n",
		 xbdev->nodename, bdev->bd_openers);

2548
	if (info && !bdev->bd_openers) {
2549 2550
		xlvbd_release_gendisk(info);
		disk->private_data = NULL;
2551
		kfree(info);
2552 2553 2554 2555
	}

	mutex_unlock(&bdev->bd_mutex);
	bdput(bdev);
2556 2557 2558 2559

	return 0;
}

2560 2561
static int blkfront_is_ready(struct xenbus_device *dev)
{
2562
	struct blkfront_info *info = dev_get_drvdata(&dev->dev);
2563

2564
	return info->is_ready && info->xbdev;
2565 2566
}

A
Al Viro 已提交
2567
static int blkif_open(struct block_device *bdev, fmode_t mode)
2568
{
2569 2570 2571
	struct gendisk *disk = bdev->bd_disk;
	struct blkfront_info *info;
	int err = 0;
2572

2573
	mutex_lock(&blkfront_mutex);
2574

2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590
	info = disk->private_data;
	if (!info) {
		/* xbdev gone */
		err = -ERESTARTSYS;
		goto out;
	}

	mutex_lock(&info->mutex);

	if (!info->gd)
		/* xbdev is closed */
		err = -ERESTARTSYS;

	mutex_unlock(&info->mutex);

out:
2591
	mutex_unlock(&blkfront_mutex);
2592
	return err;
2593 2594
}

2595
static void blkif_release(struct gendisk *disk, fmode_t mode)
2596
{
A
Al Viro 已提交
2597
	struct blkfront_info *info = disk->private_data;
2598 2599 2600
	struct block_device *bdev;
	struct xenbus_device *xbdev;

2601
	mutex_lock(&blkfront_mutex);
2602 2603 2604

	bdev = bdget_disk(disk, 0);

2605 2606 2607 2608
	if (!bdev) {
		WARN(1, "Block device %s yanked out from us!\n", disk->disk_name);
		goto out_mutex;
	}
2609 2610 2611
	if (bdev->bd_openers)
		goto out;

2612 2613 2614 2615 2616 2617 2618 2619 2620 2621
	/*
	 * Check if we have been instructed to close. We will have
	 * deferred this request, because the bdev was still open.
	 */

	mutex_lock(&info->mutex);
	xbdev = info->xbdev;

	if (xbdev && xbdev->state == XenbusStateClosing) {
		/* pending switch to state closed */
2622
		dev_info(disk_to_dev(bdev->bd_disk), "releasing disk\n");
2623 2624 2625 2626 2627 2628 2629 2630
		xlvbd_release_gendisk(info);
		xenbus_frontend_closed(info->xbdev);
 	}

	mutex_unlock(&info->mutex);

	if (!xbdev) {
		/* sudden device removal */
2631
		dev_info(disk_to_dev(bdev->bd_disk), "releasing disk\n");
2632 2633 2634
		xlvbd_release_gendisk(info);
		disk->private_data = NULL;
		kfree(info);
2635
	}
2636

J
Jens Axboe 已提交
2637
out:
2638
	bdput(bdev);
2639
out_mutex:
2640
	mutex_unlock(&blkfront_mutex);
2641 2642
}

2643
static const struct block_device_operations xlvbd_block_fops =
2644 2645
{
	.owner = THIS_MODULE,
A
Al Viro 已提交
2646 2647
	.open = blkif_open,
	.release = blkif_release,
2648
	.getgeo = blkif_getgeo,
2649
	.ioctl = blkif_ioctl,
2650 2651 2652
};


2653
static const struct xenbus_device_id blkfront_ids[] = {
2654 2655 2656 2657
	{ "vbd" },
	{ "" }
};

2658 2659
static struct xenbus_driver blkfront_driver = {
	.ids  = blkfront_ids,
2660 2661 2662
	.probe = blkfront_probe,
	.remove = blkfront_remove,
	.resume = blkfront_resume,
2663
	.otherend_changed = blkback_changed,
2664
	.is_ready = blkfront_is_ready,
2665
};
2666 2667 2668

static int __init xlblk_init(void)
{
2669
	int ret;
2670
	int nr_cpus = num_online_cpus();
2671

2672
	if (!xen_domain())
2673 2674
		return -ENODEV;

2675 2676 2677
	if (xen_blkif_max_segments < BLKIF_MAX_SEGMENTS_PER_REQUEST)
		xen_blkif_max_segments = BLKIF_MAX_SEGMENTS_PER_REQUEST;

2678
	if (xen_blkif_max_ring_order > XENBUS_MAX_RING_GRANT_ORDER) {
B
Bob Liu 已提交
2679
		pr_info("Invalid max_ring_order (%d), will use default max: %d.\n",
2680
			xen_blkif_max_ring_order, XENBUS_MAX_RING_GRANT_ORDER);
2681
		xen_blkif_max_ring_order = XENBUS_MAX_RING_GRANT_ORDER;
B
Bob Liu 已提交
2682 2683
	}

2684 2685 2686 2687 2688 2689
	if (xen_blkif_max_queues > nr_cpus) {
		pr_info("Invalid max_queues (%d), will use default max: %d.\n",
			xen_blkif_max_queues, nr_cpus);
		xen_blkif_max_queues = nr_cpus;
	}

2690
	if (!xen_has_pv_disk_devices())
2691 2692
		return -ENODEV;

2693 2694 2695 2696 2697 2698
	if (register_blkdev(XENVBD_MAJOR, DEV_NAME)) {
		printk(KERN_WARNING "xen_blk: can't get major %d with name %s\n",
		       XENVBD_MAJOR, DEV_NAME);
		return -ENODEV;
	}

2699
	ret = xenbus_register_frontend(&blkfront_driver);
2700 2701 2702 2703 2704 2705
	if (ret) {
		unregister_blkdev(XENVBD_MAJOR, DEV_NAME);
		return ret;
	}

	return 0;
2706 2707 2708 2709
}
module_init(xlblk_init);


2710
static void __exit xlblk_exit(void)
2711
{
2712 2713 2714
	xenbus_unregister_driver(&blkfront_driver);
	unregister_blkdev(XENVBD_MAJOR, DEV_NAME);
	kfree(minors);
2715 2716 2717 2718 2719 2720
}
module_exit(xlblk_exit);

MODULE_DESCRIPTION("Xen virtual block device frontend");
MODULE_LICENSE("GPL");
MODULE_ALIAS_BLOCKDEV_MAJOR(XENVBD_MAJOR);
2721
MODULE_ALIAS("xen:vbd");
2722
MODULE_ALIAS("xenblk");