2011-04-15 06:25:47 +08:00
|
|
|
/******************************************************************************
|
|
|
|
*
|
|
|
|
* Back-end of the driver for virtual block devices. This portion of the
|
|
|
|
* driver exports a 'unified' block-device interface that can be accessed
|
|
|
|
* by any operating system that implements a compatible front end. A
|
|
|
|
* reference front-end implementation can be found in:
|
2011-04-15 05:05:23 +08:00
|
|
|
* drivers/block/xen-blkfront.c
|
2011-04-15 06:25:47 +08:00
|
|
|
*
|
|
|
|
* Copyright (c) 2003-2004, Keir Fraser & Steve Hand
|
|
|
|
* Copyright (c) 2005, Christopher Clark
|
|
|
|
*
|
|
|
|
* 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/spinlock.h>
|
|
|
|
#include <linux/kthread.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/delay.h>
|
2009-02-10 04:05:51 +08:00
|
|
|
#include <linux/freezer.h>
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
#include <linux/bitmap.h>
|
2009-09-16 05:12:37 +08:00
|
|
|
|
2009-02-10 04:05:51 +08:00
|
|
|
#include <xen/events.h>
|
|
|
|
#include <xen/page.h>
|
2012-08-09 01:21:14 +08:00
|
|
|
#include <xen/xen.h>
|
2009-02-10 04:05:51 +08:00
|
|
|
#include <asm/xen/hypervisor.h>
|
|
|
|
#include <asm/xen/hypercall.h>
|
2011-04-15 06:25:47 +08:00
|
|
|
#include "common.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These are rather arbitrary. They are fairly large because adjacent requests
|
|
|
|
* pulled from a communication ring are quite likely to end up being part of
|
|
|
|
* the same scatter/gather request at the disc.
|
|
|
|
*
|
2011-04-20 23:50:43 +08:00
|
|
|
* ** TRY INCREASING 'xen_blkif_reqs' IF WRITE SPEEDS SEEM TOO LOW **
|
2011-04-15 06:25:47 +08:00
|
|
|
*
|
|
|
|
* This will increase the chances of being able to write whole tracks.
|
|
|
|
* 64 should be enough to keep us competitive with Linux.
|
|
|
|
*/
|
2011-04-20 23:50:43 +08:00
|
|
|
static int xen_blkif_reqs = 64;
|
|
|
|
module_param_named(reqs, xen_blkif_reqs, int, 0);
|
2011-04-15 06:25:47 +08:00
|
|
|
MODULE_PARM_DESC(reqs, "Number of blkback requests to allocate");
|
|
|
|
|
|
|
|
/* Run-time switchable: /sys/module/blkback/parameters/ */
|
2011-04-15 05:42:07 +08:00
|
|
|
static unsigned int log_stats;
|
2011-04-15 06:25:47 +08:00
|
|
|
module_param(log_stats, int, 0644);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Each outstanding request that we've passed to the lower device layers has a
|
|
|
|
* 'pending_req' allocated to it. Each buffer_head that completes decrements
|
|
|
|
* the pendcnt towards zero. When it hits zero, the specified domain has a
|
|
|
|
* response queued for it, with the saved 'id' passed back.
|
|
|
|
*/
|
2011-04-15 05:42:07 +08:00
|
|
|
struct pending_req {
|
2011-05-13 04:47:48 +08:00
|
|
|
struct xen_blkif *blkif;
|
2011-05-12 03:57:09 +08:00
|
|
|
u64 id;
|
|
|
|
int nr_pages;
|
|
|
|
atomic_t pendcnt;
|
|
|
|
unsigned short operation;
|
|
|
|
int status;
|
|
|
|
struct list_head free_list;
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
DECLARE_BITMAP(unmap_seg, BLKIF_MAX_SEGMENTS_PER_REQUEST);
|
2011-04-15 05:42:07 +08:00
|
|
|
};
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
#define BLKBACK_INVALID_HANDLE (~0)
|
|
|
|
|
2011-02-25 23:51:29 +08:00
|
|
|
struct xen_blkbk {
|
2011-04-15 05:42:07 +08:00
|
|
|
struct pending_req *pending_reqs;
|
2011-04-15 05:05:23 +08:00
|
|
|
/* List of all 'pending_req' available */
|
2011-02-25 23:51:29 +08:00
|
|
|
struct list_head pending_free;
|
2011-04-15 05:05:23 +08:00
|
|
|
/* And its spinlock. */
|
2011-02-25 23:51:29 +08:00
|
|
|
spinlock_t pending_free_lock;
|
|
|
|
wait_queue_head_t pending_free_wq;
|
2011-04-15 05:05:23 +08:00
|
|
|
/* The list of all pages that are available. */
|
2011-02-25 23:51:29 +08:00
|
|
|
struct page **pending_pages;
|
2011-04-15 05:05:23 +08:00
|
|
|
/* And the grant handles that are available. */
|
2011-02-25 23:51:29 +08:00
|
|
|
grant_handle_t *pending_grant_handles;
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct xen_blkbk *blkbk;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
/*
|
|
|
|
* Maximum number of grant pages that can be mapped in blkback.
|
|
|
|
* BLKIF_MAX_SEGMENTS_PER_REQUEST * RING_SIZE is the maximum number of
|
|
|
|
* pages that blkback will persistently map.
|
|
|
|
* Currently, this is:
|
|
|
|
* RING_SIZE = 32 (for all known ring types)
|
|
|
|
* BLKIF_MAX_SEGMENTS_PER_REQUEST = 11
|
|
|
|
* sizeof(struct persistent_gnt) = 48
|
|
|
|
* So the maximum memory used to store the grants is:
|
|
|
|
* 32 * 11 * 48 = 16896 bytes
|
|
|
|
*/
|
|
|
|
static inline unsigned int max_mapped_grant_pages(enum blkif_protocol protocol)
|
|
|
|
{
|
|
|
|
switch (protocol) {
|
|
|
|
case BLKIF_PROTOCOL_NATIVE:
|
|
|
|
return __CONST_RING_SIZE(blkif, PAGE_SIZE) *
|
|
|
|
BLKIF_MAX_SEGMENTS_PER_REQUEST;
|
|
|
|
case BLKIF_PROTOCOL_X86_32:
|
|
|
|
return __CONST_RING_SIZE(blkif_x86_32, PAGE_SIZE) *
|
|
|
|
BLKIF_MAX_SEGMENTS_PER_REQUEST;
|
|
|
|
case BLKIF_PROTOCOL_X86_64:
|
|
|
|
return __CONST_RING_SIZE(blkif_x86_64, PAGE_SIZE) *
|
|
|
|
BLKIF_MAX_SEGMENTS_PER_REQUEST;
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
|
|
|
* Little helpful macro to figure out the index and virtual address of the
|
|
|
|
* pending_pages[..]. For each 'pending_req' we have have up to
|
|
|
|
* BLKIF_MAX_SEGMENTS_PER_REQUEST (11) pages. The seg would be from 0 through
|
2011-05-12 03:57:09 +08:00
|
|
|
* 10 and would index in the pending_pages[..].
|
|
|
|
*/
|
2011-04-15 05:42:07 +08:00
|
|
|
static inline int vaddr_pagenr(struct pending_req *req, int seg)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
2011-04-15 05:42:07 +08:00
|
|
|
return (req - blkbk->pending_reqs) *
|
|
|
|
BLKIF_MAX_SEGMENTS_PER_REQUEST + seg;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2010-02-06 03:19:33 +08:00
|
|
|
#define pending_page(req, seg) pending_pages[vaddr_pagenr(req, seg)]
|
|
|
|
|
2011-04-15 05:42:07 +08:00
|
|
|
static inline unsigned long vaddr(struct pending_req *req, int seg)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
2011-02-25 23:51:29 +08:00
|
|
|
unsigned long pfn = page_to_pfn(blkbk->pending_page(req, seg));
|
2011-04-15 06:25:47 +08:00
|
|
|
return (unsigned long)pfn_to_kaddr(pfn);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define pending_handle(_req, _seg) \
|
2011-02-25 23:51:29 +08:00
|
|
|
(blkbk->pending_grant_handles[vaddr_pagenr(_req, _seg)])
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
|
2011-05-13 04:47:48 +08:00
|
|
|
static int do_block_io_op(struct xen_blkif *blkif);
|
|
|
|
static int dispatch_rw_block_io(struct xen_blkif *blkif,
|
2011-05-06 01:37:23 +08:00
|
|
|
struct blkif_request *req,
|
|
|
|
struct pending_req *pending_req);
|
2011-05-13 04:47:48 +08:00
|
|
|
static void make_response(struct xen_blkif *blkif, u64 id,
|
2011-04-15 06:25:47 +08:00
|
|
|
unsigned short op, int st);
|
|
|
|
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
#define foreach_grant(pos, rbtree, node) \
|
|
|
|
for ((pos) = container_of(rb_first((rbtree)), typeof(*(pos)), node); \
|
|
|
|
&(pos)->node != NULL; \
|
|
|
|
(pos) = container_of(rb_next(&(pos)->node), typeof(*(pos)), node))
|
|
|
|
|
|
|
|
|
|
|
|
static void add_persistent_gnt(struct rb_root *root,
|
|
|
|
struct persistent_gnt *persistent_gnt)
|
|
|
|
{
|
|
|
|
struct rb_node **new = &(root->rb_node), *parent = NULL;
|
|
|
|
struct persistent_gnt *this;
|
|
|
|
|
|
|
|
/* Figure out where to put new node */
|
|
|
|
while (*new) {
|
|
|
|
this = container_of(*new, struct persistent_gnt, node);
|
|
|
|
|
|
|
|
parent = *new;
|
|
|
|
if (persistent_gnt->gnt < this->gnt)
|
|
|
|
new = &((*new)->rb_left);
|
|
|
|
else if (persistent_gnt->gnt > this->gnt)
|
|
|
|
new = &((*new)->rb_right);
|
|
|
|
else {
|
|
|
|
pr_alert(DRV_PFX " trying to add a gref that's already in the tree\n");
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add new node and rebalance tree. */
|
|
|
|
rb_link_node(&(persistent_gnt->node), parent, new);
|
|
|
|
rb_insert_color(&(persistent_gnt->node), root);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct persistent_gnt *get_persistent_gnt(struct rb_root *root,
|
|
|
|
grant_ref_t gref)
|
|
|
|
{
|
|
|
|
struct persistent_gnt *data;
|
|
|
|
struct rb_node *node = root->rb_node;
|
|
|
|
|
|
|
|
while (node) {
|
|
|
|
data = container_of(node, struct persistent_gnt, node);
|
|
|
|
|
|
|
|
if (gref < data->gnt)
|
|
|
|
node = node->rb_left;
|
|
|
|
else if (gref > data->gnt)
|
|
|
|
node = node->rb_right;
|
|
|
|
else
|
|
|
|
return data;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-11-17 02:26:48 +08:00
|
|
|
static void free_persistent_gnts(struct rb_root *root, unsigned int num)
|
|
|
|
{
|
|
|
|
struct gnttab_unmap_grant_ref unmap[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
|
|
|
struct page *pages[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
|
|
|
struct persistent_gnt *persistent_gnt;
|
|
|
|
int ret = 0;
|
|
|
|
int segs_to_unmap = 0;
|
|
|
|
|
|
|
|
foreach_grant(persistent_gnt, root, node) {
|
|
|
|
BUG_ON(persistent_gnt->handle ==
|
|
|
|
BLKBACK_INVALID_HANDLE);
|
|
|
|
gnttab_set_unmap_op(&unmap[segs_to_unmap],
|
|
|
|
(unsigned long) pfn_to_kaddr(page_to_pfn(
|
|
|
|
persistent_gnt->page)),
|
|
|
|
GNTMAP_host_map,
|
|
|
|
persistent_gnt->handle);
|
|
|
|
|
|
|
|
pages[segs_to_unmap] = persistent_gnt->page;
|
|
|
|
rb_erase(&persistent_gnt->node, root);
|
|
|
|
kfree(persistent_gnt);
|
|
|
|
num--;
|
|
|
|
|
|
|
|
if (++segs_to_unmap == BLKIF_MAX_SEGMENTS_PER_REQUEST ||
|
|
|
|
!rb_next(&persistent_gnt->node)) {
|
|
|
|
ret = gnttab_unmap_refs(unmap, NULL, pages,
|
|
|
|
segs_to_unmap);
|
|
|
|
BUG_ON(ret);
|
|
|
|
segs_to_unmap = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
BUG_ON(num != 0);
|
|
|
|
}
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
|
|
|
* Retrieve from the 'pending_reqs' a free pending_req structure to be used.
|
2011-04-15 06:25:47 +08:00
|
|
|
*/
|
2011-04-15 05:42:07 +08:00
|
|
|
static struct pending_req *alloc_req(void)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
2011-04-15 05:42:07 +08:00
|
|
|
struct pending_req *req = NULL;
|
2011-04-15 06:25:47 +08:00
|
|
|
unsigned long flags;
|
|
|
|
|
2011-02-25 23:51:29 +08:00
|
|
|
spin_lock_irqsave(&blkbk->pending_free_lock, flags);
|
|
|
|
if (!list_empty(&blkbk->pending_free)) {
|
2011-04-15 05:42:07 +08:00
|
|
|
req = list_entry(blkbk->pending_free.next, struct pending_req,
|
|
|
|
free_list);
|
2011-04-15 06:25:47 +08:00
|
|
|
list_del(&req->free_list);
|
|
|
|
}
|
2011-02-25 23:51:29 +08:00
|
|
|
spin_unlock_irqrestore(&blkbk->pending_free_lock, flags);
|
2011-04-15 06:25:47 +08:00
|
|
|
return req;
|
|
|
|
}
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
|
|
|
* Return the 'pending_req' structure back to the freepool. We also
|
|
|
|
* wake up the thread if it was waiting for a free page.
|
|
|
|
*/
|
2011-04-15 05:42:07 +08:00
|
|
|
static void free_req(struct pending_req *req)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
int was_empty;
|
|
|
|
|
2011-02-25 23:51:29 +08:00
|
|
|
spin_lock_irqsave(&blkbk->pending_free_lock, flags);
|
|
|
|
was_empty = list_empty(&blkbk->pending_free);
|
|
|
|
list_add(&req->free_list, &blkbk->pending_free);
|
|
|
|
spin_unlock_irqrestore(&blkbk->pending_free_lock, flags);
|
2011-04-15 06:25:47 +08:00
|
|
|
if (was_empty)
|
2011-02-25 23:51:29 +08:00
|
|
|
wake_up(&blkbk->pending_free_wq);
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2011-04-20 22:57:29 +08:00
|
|
|
/*
|
|
|
|
* Routines for managing virtual block devices (vbds).
|
|
|
|
*/
|
2011-05-13 04:53:56 +08:00
|
|
|
static int xen_vbd_translate(struct phys_req *req, struct xen_blkif *blkif,
|
|
|
|
int operation)
|
2011-04-20 22:57:29 +08:00
|
|
|
{
|
2011-05-13 04:53:56 +08:00
|
|
|
struct xen_vbd *vbd = &blkif->vbd;
|
2011-04-20 22:57:29 +08:00
|
|
|
int rc = -EACCES;
|
|
|
|
|
|
|
|
if ((operation != READ) && vbd->readonly)
|
|
|
|
goto out;
|
|
|
|
|
2011-05-17 18:07:05 +08:00
|
|
|
if (likely(req->nr_sects)) {
|
|
|
|
blkif_sector_t end = req->sector_number + req->nr_sects;
|
|
|
|
|
|
|
|
if (unlikely(end < req->sector_number))
|
|
|
|
goto out;
|
|
|
|
if (unlikely(end > vbd_sz(vbd)))
|
|
|
|
goto out;
|
|
|
|
}
|
2011-04-20 22:57:29 +08:00
|
|
|
|
|
|
|
req->dev = vbd->pdevice;
|
|
|
|
req->bdev = vbd->bdev;
|
|
|
|
rc = 0;
|
|
|
|
|
|
|
|
out:
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2011-05-13 04:53:56 +08:00
|
|
|
static void xen_vbd_resize(struct xen_blkif *blkif)
|
2011-04-20 22:57:29 +08:00
|
|
|
{
|
2011-05-13 04:53:56 +08:00
|
|
|
struct xen_vbd *vbd = &blkif->vbd;
|
2011-04-20 22:57:29 +08:00
|
|
|
struct xenbus_transaction xbt;
|
|
|
|
int err;
|
2011-04-20 23:50:43 +08:00
|
|
|
struct xenbus_device *dev = xen_blkbk_xenbus(blkif->be);
|
2011-04-20 23:21:43 +08:00
|
|
|
unsigned long long new_size = vbd_sz(vbd);
|
2011-04-20 22:57:29 +08:00
|
|
|
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_info(DRV_PFX "VBD Resize: Domid: %d, Device: (%d, %d)\n",
|
2011-04-20 22:57:29 +08:00
|
|
|
blkif->domid, MAJOR(vbd->pdevice), MINOR(vbd->pdevice));
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_info(DRV_PFX "VBD Resize: new size %llu\n", new_size);
|
2011-04-20 22:57:29 +08:00
|
|
|
vbd->size = new_size;
|
|
|
|
again:
|
|
|
|
err = xenbus_transaction_start(&xbt);
|
|
|
|
if (err) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_warn(DRV_PFX "Error starting transaction");
|
2011-04-20 22:57:29 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
err = xenbus_printf(xbt, dev->nodename, "sectors", "%llu",
|
2011-04-20 23:21:43 +08:00
|
|
|
(unsigned long long)vbd_sz(vbd));
|
2011-04-20 22:57:29 +08:00
|
|
|
if (err) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_warn(DRV_PFX "Error writing new size");
|
2011-04-20 22:57:29 +08:00
|
|
|
goto abort;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Write the current state; we will use this to synchronize
|
|
|
|
* the front-end. If the current state is "connected" the
|
|
|
|
* front-end will get the new size information online.
|
|
|
|
*/
|
|
|
|
err = xenbus_printf(xbt, dev->nodename, "state", "%d", dev->state);
|
|
|
|
if (err) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_warn(DRV_PFX "Error writing the state");
|
2011-04-20 22:57:29 +08:00
|
|
|
goto abort;
|
|
|
|
}
|
|
|
|
|
|
|
|
err = xenbus_transaction_end(xbt, 0);
|
|
|
|
if (err == -EAGAIN)
|
|
|
|
goto again;
|
|
|
|
if (err)
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_warn(DRV_PFX "Error ending transaction");
|
2011-05-13 21:45:40 +08:00
|
|
|
return;
|
2011-04-20 22:57:29 +08:00
|
|
|
abort:
|
|
|
|
xenbus_transaction_end(xbt, 1);
|
|
|
|
}
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
2011-04-15 22:58:05 +08:00
|
|
|
* Notification from the guest OS.
|
|
|
|
*/
|
2011-05-13 04:47:48 +08:00
|
|
|
static void blkif_notify_work(struct xen_blkif *blkif)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
2011-04-15 22:58:05 +08:00
|
|
|
blkif->waiting_reqs = 1;
|
|
|
|
wake_up(&blkif->wq);
|
|
|
|
}
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
irqreturn_t xen_blkif_be_int(int irq, void *dev_id)
|
2011-04-15 22:58:05 +08:00
|
|
|
{
|
|
|
|
blkif_notify_work(dev_id);
|
|
|
|
return IRQ_HANDLED;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2011-04-15 05:42:07 +08:00
|
|
|
/*
|
2011-04-15 06:25:47 +08:00
|
|
|
* SCHEDULER FUNCTIONS
|
|
|
|
*/
|
|
|
|
|
2011-05-13 04:47:48 +08:00
|
|
|
static void print_stats(struct xen_blkif *blkif)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
2011-09-01 18:39:10 +08:00
|
|
|
pr_info("xen-blkback (%s): oo %3d | rd %4d | wr %4d | f %4d"
|
|
|
|
" | ds %4d\n",
|
2011-05-13 04:42:31 +08:00
|
|
|
current->comm, blkif->st_oo_req,
|
2011-09-01 18:39:10 +08:00
|
|
|
blkif->st_rd_req, blkif->st_wr_req,
|
|
|
|
blkif->st_f_req, blkif->st_ds_req);
|
2011-04-15 06:25:47 +08:00
|
|
|
blkif->st_print = jiffies + msecs_to_jiffies(10 * 1000);
|
|
|
|
blkif->st_rd_req = 0;
|
|
|
|
blkif->st_wr_req = 0;
|
|
|
|
blkif->st_oo_req = 0;
|
2011-09-01 18:39:10 +08:00
|
|
|
blkif->st_ds_req = 0;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
int xen_blkif_schedule(void *arg)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
2011-05-13 04:47:48 +08:00
|
|
|
struct xen_blkif *blkif = arg;
|
2011-05-13 04:53:56 +08:00
|
|
|
struct xen_vbd *vbd = &blkif->vbd;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
xen_blkif_get(blkif);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
while (!kthread_should_stop()) {
|
|
|
|
if (try_to_freeze())
|
|
|
|
continue;
|
2011-04-20 23:21:43 +08:00
|
|
|
if (unlikely(vbd->size != vbd_sz(vbd)))
|
2011-05-13 04:53:56 +08:00
|
|
|
xen_vbd_resize(blkif);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
wait_event_interruptible(
|
|
|
|
blkif->wq,
|
|
|
|
blkif->waiting_reqs || kthread_should_stop());
|
|
|
|
wait_event_interruptible(
|
2011-02-25 23:51:29 +08:00
|
|
|
blkbk->pending_free_wq,
|
2011-04-15 05:42:07 +08:00
|
|
|
!list_empty(&blkbk->pending_free) ||
|
|
|
|
kthread_should_stop());
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
blkif->waiting_reqs = 0;
|
|
|
|
smp_mb(); /* clear flag *before* checking for work */
|
|
|
|
|
|
|
|
if (do_block_io_op(blkif))
|
|
|
|
blkif->waiting_reqs = 1;
|
|
|
|
|
|
|
|
if (log_stats && time_after(jiffies, blkif->st_print))
|
|
|
|
print_stats(blkif);
|
|
|
|
}
|
|
|
|
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
/* Free all persistent grant pages */
|
2012-11-17 02:26:48 +08:00
|
|
|
if (!RB_EMPTY_ROOT(&blkif->persistent_gnts))
|
|
|
|
free_persistent_gnts(&blkif->persistent_gnts,
|
|
|
|
blkif->persistent_gnt_c);
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
|
|
|
|
BUG_ON(!RB_EMPTY_ROOT(&blkif->persistent_gnts));
|
2012-11-17 02:26:48 +08:00
|
|
|
blkif->persistent_gnt_c = 0;
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
|
2011-04-15 06:25:47 +08:00
|
|
|
if (log_stats)
|
|
|
|
print_stats(blkif);
|
|
|
|
|
|
|
|
blkif->xenblkd = NULL;
|
2011-04-20 23:50:43 +08:00
|
|
|
xen_blkif_put(blkif);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-04-15 23:35:13 +08:00
|
|
|
struct seg_buf {
|
|
|
|
unsigned long buf;
|
|
|
|
unsigned int nsec;
|
|
|
|
};
|
2011-04-15 22:58:05 +08:00
|
|
|
/*
|
|
|
|
* Unmap the grant references, and also remove the M2P over-rides
|
|
|
|
* used in the 'pending_req'.
|
2011-05-12 03:57:09 +08:00
|
|
|
*/
|
2011-04-15 23:50:34 +08:00
|
|
|
static void xen_blkbk_unmap(struct pending_req *req)
|
2011-04-15 22:58:05 +08:00
|
|
|
{
|
|
|
|
struct gnttab_unmap_grant_ref unmap[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
2011-11-29 00:49:03 +08:00
|
|
|
struct page *pages[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
2011-04-15 22:58:05 +08:00
|
|
|
unsigned int i, invcount = 0;
|
|
|
|
grant_handle_t handle;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
for (i = 0; i < req->nr_pages; i++) {
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
if (!test_bit(i, req->unmap_seg))
|
|
|
|
continue;
|
2011-04-15 22:58:05 +08:00
|
|
|
handle = pending_handle(req, i);
|
|
|
|
if (handle == BLKBACK_INVALID_HANDLE)
|
|
|
|
continue;
|
|
|
|
gnttab_set_unmap_op(&unmap[invcount], vaddr(req, i),
|
|
|
|
GNTMAP_host_map, handle);
|
|
|
|
pending_handle(req, i) = BLKBACK_INVALID_HANDLE;
|
2011-11-29 00:49:03 +08:00
|
|
|
pages[invcount] = virt_to_page(vaddr(req, i));
|
2011-04-15 22:58:05 +08:00
|
|
|
invcount++;
|
|
|
|
}
|
|
|
|
|
2012-09-12 19:44:30 +08:00
|
|
|
ret = gnttab_unmap_refs(unmap, NULL, pages, invcount);
|
2011-04-15 22:58:05 +08:00
|
|
|
BUG_ON(ret);
|
|
|
|
}
|
2011-05-12 03:57:09 +08:00
|
|
|
|
|
|
|
static int xen_blkbk_map(struct blkif_request *req,
|
|
|
|
struct pending_req *pending_req,
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
struct seg_buf seg[],
|
|
|
|
struct page *pages[])
|
2011-04-15 23:35:13 +08:00
|
|
|
{
|
|
|
|
struct gnttab_map_grant_ref map[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
struct persistent_gnt *persistent_gnts[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
|
|
|
struct page *pages_to_gnt[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
|
|
|
struct persistent_gnt *persistent_gnt = NULL;
|
|
|
|
struct xen_blkif *blkif = pending_req->blkif;
|
|
|
|
phys_addr_t addr = 0;
|
|
|
|
int i, j;
|
|
|
|
bool new_map;
|
2011-10-13 00:12:36 +08:00
|
|
|
int nseg = req->u.rw.nr_segments;
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
int segs_to_map = 0;
|
2011-04-15 23:35:13 +08:00
|
|
|
int ret = 0;
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
int use_persistent_gnts;
|
|
|
|
|
|
|
|
use_persistent_gnts = (blkif->vbd.feature_gnt_persistent);
|
|
|
|
|
|
|
|
BUG_ON(blkif->persistent_gnt_c >
|
|
|
|
max_mapped_grant_pages(pending_req->blkif->blk_protocol));
|
2011-05-12 03:57:09 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Fill out preq.nr_sects with proper amount of sectors, and setup
|
2011-04-15 23:35:13 +08:00
|
|
|
* assign map[..] with the PFN of the page in our domain with the
|
|
|
|
* corresponding grant reference for each page.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < nseg; i++) {
|
|
|
|
uint32_t flags;
|
|
|
|
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
if (use_persistent_gnts)
|
|
|
|
persistent_gnt = get_persistent_gnt(
|
|
|
|
&blkif->persistent_gnts,
|
|
|
|
req->u.rw.seg[i].gref);
|
|
|
|
|
|
|
|
if (persistent_gnt) {
|
|
|
|
/*
|
|
|
|
* We are using persistent grants and
|
|
|
|
* the grant is already mapped
|
|
|
|
*/
|
|
|
|
new_map = false;
|
|
|
|
} else if (use_persistent_gnts &&
|
|
|
|
blkif->persistent_gnt_c <
|
|
|
|
max_mapped_grant_pages(blkif->blk_protocol)) {
|
|
|
|
/*
|
|
|
|
* We are using persistent grants, the grant is
|
|
|
|
* not mapped but we have room for it
|
|
|
|
*/
|
|
|
|
new_map = true;
|
2012-11-02 23:43:04 +08:00
|
|
|
persistent_gnt = kmalloc(
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
sizeof(struct persistent_gnt),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!persistent_gnt)
|
|
|
|
return -ENOMEM;
|
|
|
|
persistent_gnt->page = alloc_page(GFP_KERNEL);
|
|
|
|
if (!persistent_gnt->page) {
|
|
|
|
kfree(persistent_gnt);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
persistent_gnt->gnt = req->u.rw.seg[i].gref;
|
2012-11-02 23:43:04 +08:00
|
|
|
persistent_gnt->handle = BLKBACK_INVALID_HANDLE;
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
|
|
|
|
pages_to_gnt[segs_to_map] =
|
|
|
|
persistent_gnt->page;
|
|
|
|
addr = (unsigned long) pfn_to_kaddr(
|
|
|
|
page_to_pfn(persistent_gnt->page));
|
|
|
|
|
|
|
|
add_persistent_gnt(&blkif->persistent_gnts,
|
|
|
|
persistent_gnt);
|
|
|
|
blkif->persistent_gnt_c++;
|
|
|
|
pr_debug(DRV_PFX " grant %u added to the tree of persistent grants, using %u/%u\n",
|
|
|
|
persistent_gnt->gnt, blkif->persistent_gnt_c,
|
|
|
|
max_mapped_grant_pages(blkif->blk_protocol));
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* We are either using persistent grants and
|
|
|
|
* hit the maximum limit of grants mapped,
|
|
|
|
* or we are not using persistent grants.
|
|
|
|
*/
|
|
|
|
if (use_persistent_gnts &&
|
|
|
|
!blkif->vbd.overflow_max_grants) {
|
|
|
|
blkif->vbd.overflow_max_grants = 1;
|
|
|
|
pr_alert(DRV_PFX " domain %u, device %#x is using maximum number of persistent grants\n",
|
|
|
|
blkif->domid, blkif->vbd.handle);
|
|
|
|
}
|
|
|
|
new_map = true;
|
|
|
|
pages[i] = blkbk->pending_page(pending_req, i);
|
|
|
|
addr = vaddr(pending_req, i);
|
|
|
|
pages_to_gnt[segs_to_map] =
|
|
|
|
blkbk->pending_page(pending_req, i);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (persistent_gnt) {
|
|
|
|
pages[i] = persistent_gnt->page;
|
|
|
|
persistent_gnts[i] = persistent_gnt;
|
|
|
|
} else {
|
|
|
|
persistent_gnts[i] = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (new_map) {
|
|
|
|
flags = GNTMAP_host_map;
|
|
|
|
if (!persistent_gnt &&
|
|
|
|
(pending_req->operation != BLKIF_OP_READ))
|
|
|
|
flags |= GNTMAP_readonly;
|
|
|
|
gnttab_set_map_op(&map[segs_to_map++], addr,
|
|
|
|
flags, req->u.rw.seg[i].gref,
|
|
|
|
blkif->domid);
|
|
|
|
}
|
2011-04-15 23:35:13 +08:00
|
|
|
}
|
|
|
|
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
if (segs_to_map) {
|
|
|
|
ret = gnttab_map_refs(map, NULL, pages_to_gnt, segs_to_map);
|
|
|
|
BUG_ON(ret);
|
|
|
|
}
|
2011-04-15 23:35:13 +08:00
|
|
|
|
2011-05-12 03:57:09 +08:00
|
|
|
/*
|
|
|
|
* Now swizzle the MFN in our domain with the MFN from the other domain
|
2011-04-15 23:35:13 +08:00
|
|
|
* so that when we access vaddr(pending_req,i) it has the contents of
|
|
|
|
* the page from the other domain.
|
|
|
|
*/
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
bitmap_zero(pending_req->unmap_seg, BLKIF_MAX_SEGMENTS_PER_REQUEST);
|
|
|
|
for (i = 0, j = 0; i < nseg; i++) {
|
2012-11-02 23:43:04 +08:00
|
|
|
if (!persistent_gnts[i] ||
|
|
|
|
persistent_gnts[i]->handle == BLKBACK_INVALID_HANDLE) {
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
/* This is a newly mapped grant */
|
|
|
|
BUG_ON(j >= segs_to_map);
|
|
|
|
if (unlikely(map[j].status != 0)) {
|
|
|
|
pr_debug(DRV_PFX "invalid buffer -- could not remap it\n");
|
|
|
|
map[j].handle = BLKBACK_INVALID_HANDLE;
|
|
|
|
ret |= 1;
|
|
|
|
if (persistent_gnts[i]) {
|
|
|
|
rb_erase(&persistent_gnts[i]->node,
|
|
|
|
&blkif->persistent_gnts);
|
|
|
|
blkif->persistent_gnt_c--;
|
|
|
|
kfree(persistent_gnts[i]);
|
|
|
|
persistent_gnts[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (persistent_gnts[i]) {
|
2012-11-02 23:43:04 +08:00
|
|
|
if (persistent_gnts[i]->handle ==
|
|
|
|
BLKBACK_INVALID_HANDLE) {
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
/*
|
|
|
|
* If this is a new persistent grant
|
|
|
|
* save the handler
|
|
|
|
*/
|
|
|
|
persistent_gnts[i]->handle = map[j].handle;
|
|
|
|
persistent_gnts[i]->dev_bus_addr =
|
|
|
|
map[j++].dev_bus_addr;
|
|
|
|
}
|
|
|
|
pending_handle(pending_req, i) =
|
|
|
|
persistent_gnts[i]->handle;
|
|
|
|
|
|
|
|
if (ret)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
seg[i].buf = persistent_gnts[i]->dev_bus_addr |
|
|
|
|
(req->u.rw.seg[i].first_sect << 9);
|
|
|
|
} else {
|
|
|
|
pending_handle(pending_req, i) = map[j].handle;
|
|
|
|
bitmap_set(pending_req->unmap_seg, i, 1);
|
|
|
|
|
|
|
|
if (ret) {
|
|
|
|
j++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
seg[i].buf = map[j++].dev_bus_addr |
|
|
|
|
(req->u.rw.seg[i].first_sect << 9);
|
2011-04-15 23:35:13 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2011-10-13 05:26:47 +08:00
|
|
|
static int dispatch_discard_io(struct xen_blkif *blkif,
|
|
|
|
struct blkif_request *req)
|
2011-09-01 18:39:10 +08:00
|
|
|
{
|
|
|
|
int err = 0;
|
|
|
|
int status = BLKIF_RSP_OKAY;
|
|
|
|
struct block_device *bdev = blkif->vbd.bdev;
|
2012-03-14 06:43:23 +08:00
|
|
|
unsigned long secure;
|
2011-09-01 18:39:10 +08:00
|
|
|
|
2011-10-13 05:26:47 +08:00
|
|
|
blkif->st_ds_req++;
|
|
|
|
|
|
|
|
xen_blkif_get(blkif);
|
2012-03-14 06:43:23 +08:00
|
|
|
secure = (blkif->vbd.discard_secure &&
|
|
|
|
(req->u.discard.flag & BLKIF_DISCARD_SECURE)) ?
|
|
|
|
BLKDEV_DISCARD_SECURE : 0;
|
|
|
|
|
|
|
|
err = blkdev_issue_discard(bdev, req->u.discard.sector_number,
|
|
|
|
req->u.discard.nr_sectors,
|
|
|
|
GFP_KERNEL, secure);
|
2011-09-01 18:39:10 +08:00
|
|
|
|
|
|
|
if (err == -EOPNOTSUPP) {
|
|
|
|
pr_debug(DRV_PFX "discard op failed, not supported\n");
|
|
|
|
status = BLKIF_RSP_EOPNOTSUPP;
|
|
|
|
} else if (err)
|
|
|
|
status = BLKIF_RSP_ERROR;
|
|
|
|
|
2011-10-13 00:12:36 +08:00
|
|
|
make_response(blkif, req->u.discard.id, req->operation, status);
|
2011-10-13 05:26:47 +08:00
|
|
|
xen_blkif_put(blkif);
|
|
|
|
return err;
|
2011-09-01 18:39:10 +08:00
|
|
|
}
|
|
|
|
|
2011-10-10 12:42:22 +08:00
|
|
|
static void xen_blk_drain_io(struct xen_blkif *blkif)
|
|
|
|
{
|
|
|
|
atomic_set(&blkif->drain, 1);
|
|
|
|
do {
|
2011-10-18 02:27:48 +08:00
|
|
|
/* The initial value is one, and one refcnt taken at the
|
|
|
|
* start of the xen_blkif_schedule thread. */
|
|
|
|
if (atomic_read(&blkif->refcnt) <= 2)
|
|
|
|
break;
|
2011-10-10 12:42:22 +08:00
|
|
|
wait_for_completion_interruptible_timeout(
|
|
|
|
&blkif->drain_complete, HZ);
|
|
|
|
|
|
|
|
if (!atomic_read(&blkif->drain))
|
|
|
|
break;
|
|
|
|
} while (!kthread_should_stop());
|
|
|
|
atomic_set(&blkif->drain, 0);
|
|
|
|
}
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
|
|
|
* Completion callback on the bio's. Called as bh->b_end_io()
|
2011-04-15 06:25:47 +08:00
|
|
|
*/
|
|
|
|
|
2011-04-15 05:42:07 +08:00
|
|
|
static void __end_block_io_op(struct pending_req *pending_req, int error)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
|
|
|
/* An error fails the entire request. */
|
2011-05-05 05:07:27 +08:00
|
|
|
if ((pending_req->operation == BLKIF_OP_FLUSH_DISKCACHE) &&
|
2011-04-15 06:25:47 +08:00
|
|
|
(error == -EOPNOTSUPP)) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_debug(DRV_PFX "flush diskcache op failed, not supported\n");
|
2011-05-05 05:07:27 +08:00
|
|
|
xen_blkbk_flush_diskcache(XBT_NIL, pending_req->blkif->be, 0);
|
2011-04-15 06:25:47 +08:00
|
|
|
pending_req->status = BLKIF_RSP_EOPNOTSUPP;
|
2011-10-10 12:42:22 +08:00
|
|
|
} else if ((pending_req->operation == BLKIF_OP_WRITE_BARRIER) &&
|
|
|
|
(error == -EOPNOTSUPP)) {
|
|
|
|
pr_debug(DRV_PFX "write barrier op failed, not supported\n");
|
|
|
|
xen_blkbk_barrier(XBT_NIL, pending_req->blkif->be, 0);
|
|
|
|
pending_req->status = BLKIF_RSP_EOPNOTSUPP;
|
2011-04-15 06:25:47 +08:00
|
|
|
} else if (error) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_debug(DRV_PFX "Buffer not up-to-date at end of operation,"
|
2011-05-13 04:42:31 +08:00
|
|
|
" error=%d\n", error);
|
2011-04-15 06:25:47 +08:00
|
|
|
pending_req->status = BLKIF_RSP_ERROR;
|
|
|
|
}
|
|
|
|
|
2011-05-12 03:57:09 +08:00
|
|
|
/*
|
|
|
|
* If all of the bio's have completed it is time to unmap
|
2011-04-15 05:05:23 +08:00
|
|
|
* the grant references associated with 'request' and provide
|
2011-04-15 05:42:07 +08:00
|
|
|
* the proper response on the ring.
|
|
|
|
*/
|
2011-04-15 06:25:47 +08:00
|
|
|
if (atomic_dec_and_test(&pending_req->pendcnt)) {
|
2011-04-15 23:50:34 +08:00
|
|
|
xen_blkbk_unmap(pending_req);
|
2011-04-15 06:25:47 +08:00
|
|
|
make_response(pending_req->blkif, pending_req->id,
|
|
|
|
pending_req->operation, pending_req->status);
|
2011-04-20 23:50:43 +08:00
|
|
|
xen_blkif_put(pending_req->blkif);
|
2011-10-10 12:42:22 +08:00
|
|
|
if (atomic_read(&pending_req->blkif->refcnt) <= 2) {
|
|
|
|
if (atomic_read(&pending_req->blkif->drain))
|
|
|
|
complete(&pending_req->blkif->drain_complete);
|
|
|
|
}
|
2011-04-15 06:25:47 +08:00
|
|
|
free_req(pending_req);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
|
|
|
* bio callback.
|
|
|
|
*/
|
2009-02-10 04:05:51 +08:00
|
|
|
static void end_block_io_op(struct bio *bio, int error)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
|
|
|
__end_block_io_op(bio->bi_private, error);
|
|
|
|
bio_put(bio);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
|
|
|
* Function to copy the from the ring buffer the 'struct blkif_request'
|
|
|
|
* (which has the sectors we want, number of them, grant references, etc),
|
|
|
|
* and transmute it to the block API to hand it over to the proper block disk.
|
2011-04-15 06:25:47 +08:00
|
|
|
*/
|
2011-05-29 04:21:10 +08:00
|
|
|
static int
|
|
|
|
__do_block_io_op(struct xen_blkif *blkif)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
2009-02-10 04:05:51 +08:00
|
|
|
union blkif_back_rings *blk_rings = &blkif->blk_rings;
|
|
|
|
struct blkif_request req;
|
2011-04-15 05:42:07 +08:00
|
|
|
struct pending_req *pending_req;
|
2011-04-15 06:25:47 +08:00
|
|
|
RING_IDX rc, rp;
|
|
|
|
int more_to_do = 0;
|
|
|
|
|
|
|
|
rc = blk_rings->common.req_cons;
|
|
|
|
rp = blk_rings->common.sring->req_prod;
|
|
|
|
rmb(); /* Ensure we see queued requests up to 'rp'. */
|
|
|
|
|
|
|
|
while (rc != rp) {
|
|
|
|
|
|
|
|
if (RING_REQUEST_CONS_OVERFLOW(&blk_rings->common, rc))
|
|
|
|
break;
|
|
|
|
|
2009-03-06 16:29:15 +08:00
|
|
|
if (kthread_should_stop()) {
|
2011-04-15 06:25:47 +08:00
|
|
|
more_to_do = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2009-03-06 16:29:15 +08:00
|
|
|
pending_req = alloc_req();
|
|
|
|
if (NULL == pending_req) {
|
|
|
|
blkif->st_oo_req++;
|
2011-04-15 06:25:47 +08:00
|
|
|
more_to_do = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (blkif->blk_protocol) {
|
|
|
|
case BLKIF_PROTOCOL_NATIVE:
|
|
|
|
memcpy(&req, RING_GET_REQUEST(&blk_rings->native, rc), sizeof(req));
|
|
|
|
break;
|
|
|
|
case BLKIF_PROTOCOL_X86_32:
|
|
|
|
blkif_get_x86_32_req(&req, RING_GET_REQUEST(&blk_rings->x86_32, rc));
|
|
|
|
break;
|
|
|
|
case BLKIF_PROTOCOL_X86_64:
|
|
|
|
blkif_get_x86_64_req(&req, RING_GET_REQUEST(&blk_rings->x86_64, rc));
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
blk_rings->common.req_cons = ++rc; /* before make_response() */
|
|
|
|
|
|
|
|
/* Apply all sanity checks to /private copy/ of request. */
|
|
|
|
barrier();
|
2011-10-13 05:26:47 +08:00
|
|
|
if (unlikely(req.operation == BLKIF_OP_DISCARD)) {
|
|
|
|
free_req(pending_req);
|
|
|
|
if (dispatch_discard_io(blkif, &req))
|
|
|
|
break;
|
|
|
|
} else if (dispatch_rw_block_io(blkif, &req, pending_req))
|
2011-04-15 06:25:47 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* Yield point for this unbounded loop. */
|
|
|
|
cond_resched();
|
|
|
|
}
|
|
|
|
|
|
|
|
return more_to_do;
|
|
|
|
}
|
|
|
|
|
2011-05-29 04:21:10 +08:00
|
|
|
static int
|
|
|
|
do_block_io_op(struct xen_blkif *blkif)
|
|
|
|
{
|
|
|
|
union blkif_back_rings *blk_rings = &blkif->blk_rings;
|
|
|
|
int more_to_do;
|
|
|
|
|
|
|
|
do {
|
|
|
|
more_to_do = __do_block_io_op(blkif);
|
|
|
|
if (more_to_do)
|
|
|
|
break;
|
|
|
|
|
|
|
|
RING_FINAL_CHECK_FOR_REQUESTS(&blk_rings->common, more_to_do);
|
|
|
|
} while (more_to_do);
|
|
|
|
|
|
|
|
return more_to_do;
|
|
|
|
}
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
2011-05-12 03:57:09 +08:00
|
|
|
* Transmutation of the 'struct blkif_request' to a proper 'struct bio'
|
|
|
|
* and call the 'submit_bio' to pass it to the underlying storage.
|
2011-04-15 05:05:23 +08:00
|
|
|
*/
|
2011-05-13 04:47:48 +08:00
|
|
|
static int dispatch_rw_block_io(struct xen_blkif *blkif,
|
|
|
|
struct blkif_request *req,
|
|
|
|
struct pending_req *pending_req)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
|
|
|
struct phys_req preq;
|
2011-04-15 23:35:13 +08:00
|
|
|
struct seg_buf seg[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
2011-04-15 06:25:47 +08:00
|
|
|
unsigned int nseg;
|
|
|
|
struct bio *bio = NULL;
|
2011-04-15 22:51:27 +08:00
|
|
|
struct bio *biolist[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
2011-04-15 23:35:13 +08:00
|
|
|
int i, nbio = 0;
|
2011-04-15 06:25:47 +08:00
|
|
|
int operation;
|
2011-04-28 00:40:11 +08:00
|
|
|
struct blk_plug plug;
|
2011-10-10 12:42:22 +08:00
|
|
|
bool drain = false;
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
struct page *pages[BLKIF_MAX_SEGMENTS_PER_REQUEST];
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
switch (req->operation) {
|
|
|
|
case BLKIF_OP_READ:
|
2011-05-06 01:37:23 +08:00
|
|
|
blkif->st_rd_req++;
|
2011-04-15 06:25:47 +08:00
|
|
|
operation = READ;
|
|
|
|
break;
|
|
|
|
case BLKIF_OP_WRITE:
|
2011-05-06 01:37:23 +08:00
|
|
|
blkif->st_wr_req++;
|
2011-04-27 04:24:18 +08:00
|
|
|
operation = WRITE_ODIRECT;
|
2011-04-15 06:25:47 +08:00
|
|
|
break;
|
2011-10-10 12:42:22 +08:00
|
|
|
case BLKIF_OP_WRITE_BARRIER:
|
|
|
|
drain = true;
|
2011-05-05 05:07:27 +08:00
|
|
|
case BLKIF_OP_FLUSH_DISKCACHE:
|
2011-05-06 01:37:23 +08:00
|
|
|
blkif->st_f_req++;
|
2011-05-05 05:07:27 +08:00
|
|
|
operation = WRITE_FLUSH;
|
2011-04-15 06:25:47 +08:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
operation = 0; /* make gcc happy */
|
2011-05-06 01:37:23 +08:00
|
|
|
goto fail_response;
|
|
|
|
break;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2011-10-13 05:26:47 +08:00
|
|
|
/* Check that the number of segments is sane. */
|
|
|
|
nseg = req->u.rw.nr_segments;
|
2011-10-13 00:12:36 +08:00
|
|
|
|
2011-10-13 05:26:47 +08:00
|
|
|
if (unlikely(nseg == 0 && operation != WRITE_FLUSH) ||
|
2011-04-15 06:25:47 +08:00
|
|
|
unlikely(nseg > BLKIF_MAX_SEGMENTS_PER_REQUEST)) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_debug(DRV_PFX "Bad number of segments in request (%d)\n",
|
2011-05-13 04:42:31 +08:00
|
|
|
nseg);
|
2011-04-15 23:35:13 +08:00
|
|
|
/* Haven't submitted any bio's yet. */
|
2011-04-15 06:25:47 +08:00
|
|
|
goto fail_response;
|
|
|
|
}
|
|
|
|
|
2011-10-13 00:12:36 +08:00
|
|
|
preq.dev = req->u.rw.handle;
|
2011-03-02 05:22:28 +08:00
|
|
|
preq.sector_number = req->u.rw.sector_number;
|
2011-04-15 06:25:47 +08:00
|
|
|
preq.nr_sects = 0;
|
|
|
|
|
|
|
|
pending_req->blkif = blkif;
|
2011-10-13 00:12:36 +08:00
|
|
|
pending_req->id = req->u.rw.id;
|
2011-04-15 06:25:47 +08:00
|
|
|
pending_req->operation = req->operation;
|
|
|
|
pending_req->status = BLKIF_RSP_OKAY;
|
|
|
|
pending_req->nr_pages = nseg;
|
2011-04-18 23:34:55 +08:00
|
|
|
|
2011-04-15 06:25:47 +08:00
|
|
|
for (i = 0; i < nseg; i++) {
|
2011-03-02 05:22:28 +08:00
|
|
|
seg[i].nsec = req->u.rw.seg[i].last_sect -
|
|
|
|
req->u.rw.seg[i].first_sect + 1;
|
|
|
|
if ((req->u.rw.seg[i].last_sect >= (PAGE_SIZE >> 9)) ||
|
|
|
|
(req->u.rw.seg[i].last_sect < req->u.rw.seg[i].first_sect))
|
2011-04-15 06:25:47 +08:00
|
|
|
goto fail_response;
|
|
|
|
preq.nr_sects += seg[i].nsec;
|
2011-04-15 23:38:29 +08:00
|
|
|
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2011-05-13 04:53:56 +08:00
|
|
|
if (xen_vbd_translate(&preq, blkif, operation) != 0) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_debug(DRV_PFX "access denied: %s of [%llu,%llu] on dev=%04x\n",
|
2011-05-13 04:42:31 +08:00
|
|
|
operation == READ ? "read" : "write",
|
|
|
|
preq.sector_number,
|
|
|
|
preq.sector_number + preq.nr_sects, preq.dev);
|
2011-04-15 23:35:13 +08:00
|
|
|
goto fail_response;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
2011-05-12 03:57:09 +08:00
|
|
|
|
|
|
|
/*
|
2011-05-13 04:53:56 +08:00
|
|
|
* This check _MUST_ be done after xen_vbd_translate as the preq.bdev
|
2011-05-12 03:57:09 +08:00
|
|
|
* is set there.
|
|
|
|
*/
|
2011-04-18 23:34:55 +08:00
|
|
|
for (i = 0; i < nseg; i++) {
|
|
|
|
if (((int)preq.sector_number|(int)seg[i].nsec) &
|
|
|
|
((bdev_logical_block_size(preq.bdev) >> 9) - 1)) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_debug(DRV_PFX "Misaligned I/O request from domain %d",
|
2011-05-13 04:42:31 +08:00
|
|
|
blkif->domid);
|
2011-04-18 23:34:55 +08:00
|
|
|
goto fail_response;
|
|
|
|
}
|
|
|
|
}
|
2011-05-12 03:57:09 +08:00
|
|
|
|
2011-10-10 12:42:22 +08:00
|
|
|
/* Wait on all outstanding I/O's and once that has been completed
|
|
|
|
* issue the WRITE_FLUSH.
|
|
|
|
*/
|
|
|
|
if (drain)
|
|
|
|
xen_blk_drain_io(pending_req->blkif);
|
|
|
|
|
2011-05-12 03:57:09 +08:00
|
|
|
/*
|
|
|
|
* If we have failed at this point, we need to undo the M2P override,
|
2011-04-15 05:42:07 +08:00
|
|
|
* set gnttab_set_unmap_op on all of the grant references and perform
|
|
|
|
* the hypercall to unmap the grants - that is all done in
|
2011-04-15 23:50:34 +08:00
|
|
|
* xen_blkbk_unmap.
|
2011-04-15 05:42:07 +08:00
|
|
|
*/
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
if (xen_blkbk_map(req, pending_req, seg, pages))
|
2011-04-15 06:25:47 +08:00
|
|
|
goto fail_flush;
|
|
|
|
|
2011-09-01 18:39:10 +08:00
|
|
|
/*
|
|
|
|
* This corresponding xen_blkif_put is done in __end_block_io_op, or
|
|
|
|
* below (in "!bio") if we are handling a BLKIF_OP_DISCARD.
|
|
|
|
*/
|
2011-04-20 23:50:43 +08:00
|
|
|
xen_blkif_get(blkif);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
for (i = 0; i < nseg; i++) {
|
|
|
|
while ((bio == NULL) ||
|
|
|
|
(bio_add_page(bio,
|
xen/blkback: Persistent grant maps for xen blk drivers
This patch implements persistent grants for the xen-blk{front,back}
mechanism. The effect of this change is to reduce the number of unmap
operations performed, since they cause a (costly) TLB shootdown. This
allows the I/O performance to scale better when a large number of VMs
are performing I/O.
Previously, the blkfront driver was supplied a bvec[] from the request
queue. This was granted to dom0; dom0 performed the I/O and wrote
directly into the grant-mapped memory and unmapped it; blkfront then
removed foreign access for that grant. The cost of unmapping scales
badly with the number of CPUs in Dom0. An experiment showed that when
Dom0 has 24 VCPUs, and guests are performing parallel I/O to a
ramdisk, the IPIs from performing unmap's is a bottleneck at 5 guests
(at which point 650,000 IOPS are being performed in total). If more
than 5 guests are used, the performance declines. By 10 guests, only
400,000 IOPS are being performed.
This patch improves performance by only unmapping when the connection
between blkfront and back is broken.
On startup blkfront notifies blkback that it is using persistent
grants, and blkback will do the same. If blkback is not capable of
persistent mapping, blkfront will still use the same grants, since it
is compatible with the previous protocol, and simplifies the code
complexity in blkfront.
To perform a read, in persistent mode, blkfront uses a separate pool
of pages that it maps to dom0. When a request comes in, blkfront
transmutes the request so that blkback will write into one of these
free pages. Blkback keeps note of which grefs it has already
mapped. When a new ring request comes to blkback, it looks to see if
it has already mapped that page. If so, it will not map it again. If
the page hasn't been previously mapped, it is mapped now, and a record
is kept of this mapping. Blkback proceeds as usual. When blkfront is
notified that blkback has completed a request, it memcpy's from the
shared memory, into the bvec supplied. A record that the {gref, page}
tuple is mapped, and not inflight is kept.
Writes are similar, except that the memcpy is peformed from the
supplied bvecs, into the shared pages, before the request is put onto
the ring.
Blkback stores a mapping of grefs=>{page mapped to by gref} in
a red-black tree. As the grefs are not known apriori, and provide no
guarantees on their ordering, we have to perform a search
through this tree to find the page, for every gref we receive. This
operation takes O(log n) time in the worst case. In blkfront grants
are stored using a single linked list.
The maximum number of grants that blkback will persistenly map is
currently set to RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, to
prevent a malicios guest from attempting a DoS, by supplying fresh
grefs, causing the Dom0 kernel to map excessively. If a guest
is using persistent grants and exceeds the maximum number of grants to
map persistenly the newly passed grefs will be mapped and unmaped.
Using this approach, we can have requests that mix persistent and
non-persistent grants, and we need to handle them correctly.
This allows us to set the maximum number of persistent grants to a
lower value than RING_SIZE * BLKIF_MAX_SEGMENTS_PER_REQUEST, although
setting it will lead to unpredictable performance.
In writing this patch, the question arrises as to if the additional
cost of performing memcpys in the guest (to/from the pool of granted
pages) outweigh the gains of not performing TLB shootdowns. The answer
to that question is `no'. There appears to be very little, if any
additional cost to the guest of using persistent grants. There is
perhaps a small saving, from the reduced number of hypercalls
performed in granting, and ending foreign access.
Signed-off-by: Oliver Chick <oliver.chick@citrix.com>
Signed-off-by: Roger Pau Monne <roger.pau@citrix.com>
Signed-off-by: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
[v1: Fixed up the misuse of bool as int]
2012-10-25 00:58:45 +08:00
|
|
|
pages[i],
|
2011-04-15 06:25:47 +08:00
|
|
|
seg[i].nsec << 9,
|
|
|
|
seg[i].buf & ~PAGE_MASK) == 0)) {
|
2011-04-15 05:42:07 +08:00
|
|
|
|
2011-05-13 04:19:23 +08:00
|
|
|
bio = bio_alloc(GFP_KERNEL, nseg-i);
|
2011-04-15 06:25:47 +08:00
|
|
|
if (unlikely(bio == NULL))
|
|
|
|
goto fail_put_bio;
|
|
|
|
|
2011-05-13 04:19:23 +08:00
|
|
|
biolist[nbio++] = bio;
|
2011-04-15 06:25:47 +08:00
|
|
|
bio->bi_bdev = preq.bdev;
|
|
|
|
bio->bi_private = pending_req;
|
|
|
|
bio->bi_end_io = end_block_io_op;
|
|
|
|
bio->bi_sector = preq.sector_number;
|
|
|
|
}
|
|
|
|
|
|
|
|
preq.sector_number += seg[i].nsec;
|
|
|
|
}
|
|
|
|
|
2011-09-01 18:39:10 +08:00
|
|
|
/* This will be hit if the operation was a flush or discard. */
|
2011-04-15 06:25:47 +08:00
|
|
|
if (!bio) {
|
2011-10-13 05:26:47 +08:00
|
|
|
BUG_ON(operation != WRITE_FLUSH);
|
2011-05-13 04:23:06 +08:00
|
|
|
|
2011-10-13 05:26:47 +08:00
|
|
|
bio = bio_alloc(GFP_KERNEL, 0);
|
|
|
|
if (unlikely(bio == NULL))
|
|
|
|
goto fail_put_bio;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-10-13 05:26:47 +08:00
|
|
|
biolist[nbio++] = bio;
|
|
|
|
bio->bi_bdev = preq.bdev;
|
|
|
|
bio->bi_private = pending_req;
|
|
|
|
bio->bi_end_io = end_block_io_op;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2011-05-12 03:57:09 +08:00
|
|
|
/*
|
|
|
|
* We set it one so that the last submit_bio does not have to call
|
2011-04-15 22:51:27 +08:00
|
|
|
* atomic_inc.
|
|
|
|
*/
|
|
|
|
atomic_set(&pending_req->pendcnt, nbio);
|
|
|
|
|
2011-04-28 00:40:11 +08:00
|
|
|
/* Get a reference count for the disk queue and start sending I/O */
|
|
|
|
blk_start_plug(&plug);
|
|
|
|
|
2011-04-15 22:51:27 +08:00
|
|
|
for (i = 0; i < nbio; i++)
|
|
|
|
submit_bio(operation, biolist[i]);
|
|
|
|
|
2011-04-28 00:40:11 +08:00
|
|
|
/* Let the I/Os go.. */
|
2011-05-06 01:42:10 +08:00
|
|
|
blk_finish_plug(&plug);
|
2011-04-28 00:40:11 +08:00
|
|
|
|
2011-04-15 06:25:47 +08:00
|
|
|
if (operation == READ)
|
|
|
|
blkif->st_rd_sect += preq.nr_sects;
|
2011-10-11 00:33:21 +08:00
|
|
|
else if (operation & WRITE)
|
2011-04-15 06:25:47 +08:00
|
|
|
blkif->st_wr_sect += preq.nr_sects;
|
|
|
|
|
2011-05-06 01:37:23 +08:00
|
|
|
return 0;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
fail_flush:
|
2011-04-15 23:50:34 +08:00
|
|
|
xen_blkbk_unmap(pending_req);
|
2011-04-15 06:25:47 +08:00
|
|
|
fail_response:
|
2011-04-15 05:58:19 +08:00
|
|
|
/* Haven't submitted any bio's yet. */
|
2011-10-13 00:12:36 +08:00
|
|
|
make_response(blkif, req->u.rw.id, req->operation, BLKIF_RSP_ERROR);
|
2011-04-15 06:25:47 +08:00
|
|
|
free_req(pending_req);
|
|
|
|
msleep(1); /* back off a bit */
|
2011-05-06 01:37:23 +08:00
|
|
|
return -EIO;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
fail_put_bio:
|
2011-05-13 04:19:23 +08:00
|
|
|
for (i = 0; i < nbio; i++)
|
2011-04-15 22:51:27 +08:00
|
|
|
bio_put(biolist[i]);
|
2011-04-15 06:25:47 +08:00
|
|
|
__end_block_io_op(pending_req, -EINVAL);
|
|
|
|
msleep(1); /* back off a bit */
|
2011-05-06 01:37:23 +08:00
|
|
|
return -EIO;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-04-15 05:05:23 +08:00
|
|
|
/*
|
|
|
|
* Put a response on the ring on how the operation fared.
|
2011-04-15 06:25:47 +08:00
|
|
|
*/
|
2011-05-13 04:47:48 +08:00
|
|
|
static void make_response(struct xen_blkif *blkif, u64 id,
|
2011-04-15 06:25:47 +08:00
|
|
|
unsigned short op, int st)
|
|
|
|
{
|
2009-02-10 04:05:51 +08:00
|
|
|
struct blkif_response resp;
|
2011-04-15 06:25:47 +08:00
|
|
|
unsigned long flags;
|
2009-02-10 04:05:51 +08:00
|
|
|
union blkif_back_rings *blk_rings = &blkif->blk_rings;
|
2011-04-15 06:25:47 +08:00
|
|
|
int notify;
|
|
|
|
|
|
|
|
resp.id = id;
|
|
|
|
resp.operation = op;
|
|
|
|
resp.status = st;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&blkif->blk_ring_lock, flags);
|
|
|
|
/* Place on the response ring for the relevant domain. */
|
|
|
|
switch (blkif->blk_protocol) {
|
|
|
|
case BLKIF_PROTOCOL_NATIVE:
|
|
|
|
memcpy(RING_GET_RESPONSE(&blk_rings->native, blk_rings->native.rsp_prod_pvt),
|
|
|
|
&resp, sizeof(resp));
|
|
|
|
break;
|
|
|
|
case BLKIF_PROTOCOL_X86_32:
|
|
|
|
memcpy(RING_GET_RESPONSE(&blk_rings->x86_32, blk_rings->x86_32.rsp_prod_pvt),
|
|
|
|
&resp, sizeof(resp));
|
|
|
|
break;
|
|
|
|
case BLKIF_PROTOCOL_X86_64:
|
|
|
|
memcpy(RING_GET_RESPONSE(&blk_rings->x86_64, blk_rings->x86_64.rsp_prod_pvt),
|
|
|
|
&resp, sizeof(resp));
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
blk_rings->common.rsp_prod_pvt++;
|
|
|
|
RING_PUSH_RESPONSES_AND_CHECK_NOTIFY(&blk_rings->common, notify);
|
|
|
|
spin_unlock_irqrestore(&blkif->blk_ring_lock, flags);
|
|
|
|
if (notify)
|
|
|
|
notify_remote_via_irq(blkif->irq);
|
|
|
|
}
|
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
static int __init xen_blkif_init(void)
|
2011-04-15 06:25:47 +08:00
|
|
|
{
|
|
|
|
int i, mmap_pages;
|
2009-10-09 01:23:09 +08:00
|
|
|
int rc = 0;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-11-29 00:49:05 +08:00
|
|
|
if (!xen_domain())
|
2011-04-15 06:25:47 +08:00
|
|
|
return -ENODEV;
|
|
|
|
|
2011-04-15 05:42:07 +08:00
|
|
|
blkbk = kzalloc(sizeof(struct xen_blkbk), GFP_KERNEL);
|
2011-02-25 23:51:29 +08:00
|
|
|
if (!blkbk) {
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_alert(DRV_PFX "%s: out of memory!\n", __func__);
|
2011-02-25 23:51:29 +08:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
mmap_pages = xen_blkif_reqs * BLKIF_MAX_SEGMENTS_PER_REQUEST;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-09-16 15:38:09 +08:00
|
|
|
blkbk->pending_reqs = kzalloc(sizeof(blkbk->pending_reqs[0]) *
|
2011-04-20 23:50:43 +08:00
|
|
|
xen_blkif_reqs, GFP_KERNEL);
|
2011-09-16 15:38:09 +08:00
|
|
|
blkbk->pending_grant_handles = kmalloc(sizeof(blkbk->pending_grant_handles[0]) *
|
2011-03-15 00:41:26 +08:00
|
|
|
mmap_pages, GFP_KERNEL);
|
|
|
|
blkbk->pending_pages = kzalloc(sizeof(blkbk->pending_pages[0]) *
|
|
|
|
mmap_pages, GFP_KERNEL);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-04-15 05:42:07 +08:00
|
|
|
if (!blkbk->pending_reqs || !blkbk->pending_grant_handles ||
|
|
|
|
!blkbk->pending_pages) {
|
2009-10-09 01:23:09 +08:00
|
|
|
rc = -ENOMEM;
|
2011-04-15 06:25:47 +08:00
|
|
|
goto out_of_memory;
|
2009-10-09 01:23:09 +08:00
|
|
|
}
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-03-02 05:26:10 +08:00
|
|
|
for (i = 0; i < mmap_pages; i++) {
|
2011-02-25 23:51:29 +08:00
|
|
|
blkbk->pending_grant_handles[i] = BLKBACK_INVALID_HANDLE;
|
2011-03-15 00:41:26 +08:00
|
|
|
blkbk->pending_pages[i] = alloc_page(GFP_KERNEL);
|
2011-03-02 05:26:10 +08:00
|
|
|
if (blkbk->pending_pages[i] == NULL) {
|
|
|
|
rc = -ENOMEM;
|
|
|
|
goto out_of_memory;
|
|
|
|
}
|
|
|
|
}
|
2011-04-20 23:50:43 +08:00
|
|
|
rc = xen_blkif_interface_init();
|
2009-10-09 01:23:09 +08:00
|
|
|
if (rc)
|
|
|
|
goto failed_init;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-02-25 23:51:29 +08:00
|
|
|
INIT_LIST_HEAD(&blkbk->pending_free);
|
|
|
|
spin_lock_init(&blkbk->pending_free_lock);
|
|
|
|
init_waitqueue_head(&blkbk->pending_free_wq);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
for (i = 0; i < xen_blkif_reqs; i++)
|
2011-04-15 05:42:07 +08:00
|
|
|
list_add_tail(&blkbk->pending_reqs[i].free_list,
|
|
|
|
&blkbk->pending_free);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
rc = xen_blkif_xenbus_init();
|
2009-10-09 01:23:09 +08:00
|
|
|
if (rc)
|
|
|
|
goto failed_init;
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
out_of_memory:
|
2011-05-13 04:43:12 +08:00
|
|
|
pr_alert(DRV_PFX "%s: out of memory\n", __func__);
|
2009-10-09 01:23:09 +08:00
|
|
|
failed_init:
|
2011-02-25 23:51:29 +08:00
|
|
|
kfree(blkbk->pending_reqs);
|
2011-03-15 00:41:26 +08:00
|
|
|
kfree(blkbk->pending_grant_handles);
|
2011-05-27 14:27:16 +08:00
|
|
|
if (blkbk->pending_pages) {
|
|
|
|
for (i = 0; i < mmap_pages; i++) {
|
|
|
|
if (blkbk->pending_pages[i])
|
|
|
|
__free_page(blkbk->pending_pages[i]);
|
|
|
|
}
|
|
|
|
kfree(blkbk->pending_pages);
|
2011-03-02 05:26:10 +08:00
|
|
|
}
|
2011-03-15 00:41:26 +08:00
|
|
|
kfree(blkbk);
|
2011-02-25 23:51:29 +08:00
|
|
|
blkbk = NULL;
|
2009-10-09 01:23:09 +08:00
|
|
|
return rc;
|
2011-04-15 06:25:47 +08:00
|
|
|
}
|
|
|
|
|
2011-04-20 23:50:43 +08:00
|
|
|
module_init(xen_blkif_init);
|
2011-04-15 06:25:47 +08:00
|
|
|
|
|
|
|
MODULE_LICENSE("Dual BSD/GPL");
|
2011-06-29 20:40:50 +08:00
|
|
|
MODULE_ALIAS("xen-backend:vbd");
|