blkback.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819
  1. /******************************************************************************
  2. *
  3. * Back-end of the driver for virtual block devices. This portion of the
  4. * driver exports a 'unified' block-device interface that can be accessed
  5. * by any operating system that implements a compatible front end. A
  6. * reference front-end implementation can be found in:
  7. * drivers/block/xen-blkfront.c
  8. *
  9. * Copyright (c) 2003-2004, Keir Fraser & Steve Hand
  10. * Copyright (c) 2005, Christopher Clark
  11. *
  12. * This program is free software; you can redistribute it and/or
  13. * modify it under the terms of the GNU General Public License version 2
  14. * as published by the Free Software Foundation; or, when distributed
  15. * separately from the Linux kernel or incorporated into other
  16. * software packages, subject to the following license:
  17. *
  18. * Permission is hereby granted, free of charge, to any person obtaining a copy
  19. * of this source file (the "Software"), to deal in the Software without
  20. * restriction, including without limitation the rights to use, copy, modify,
  21. * merge, publish, distribute, sublicense, and/or sell copies of the Software,
  22. * and to permit persons to whom the Software is furnished to do so, subject to
  23. * the following conditions:
  24. *
  25. * The above copyright notice and this permission notice shall be included in
  26. * all copies or substantial portions of the Software.
  27. *
  28. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  29. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  30. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  31. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  32. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  33. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  34. * IN THE SOFTWARE.
  35. */
  36. #include <linux/spinlock.h>
  37. #include <linux/kthread.h>
  38. #include <linux/list.h>
  39. #include <linux/delay.h>
  40. #include <linux/freezer.h>
  41. #include <xen/events.h>
  42. #include <xen/page.h>
  43. #include <asm/xen/hypervisor.h>
  44. #include <asm/xen/hypercall.h>
  45. #include "common.h"
  46. /*
  47. * These are rather arbitrary. They are fairly large because adjacent requests
  48. * pulled from a communication ring are quite likely to end up being part of
  49. * the same scatter/gather request at the disc.
  50. *
  51. * ** TRY INCREASING 'xen_blkif_reqs' IF WRITE SPEEDS SEEM TOO LOW **
  52. *
  53. * This will increase the chances of being able to write whole tracks.
  54. * 64 should be enough to keep us competitive with Linux.
  55. */
  56. static int xen_blkif_reqs = 64;
  57. module_param_named(reqs, xen_blkif_reqs, int, 0);
  58. MODULE_PARM_DESC(reqs, "Number of blkback requests to allocate");
  59. /* Run-time switchable: /sys/module/blkback/parameters/ */
  60. static unsigned int log_stats;
  61. module_param(log_stats, int, 0644);
  62. /*
  63. * Each outstanding request that we've passed to the lower device layers has a
  64. * 'pending_req' allocated to it. Each buffer_head that completes decrements
  65. * the pendcnt towards zero. When it hits zero, the specified domain has a
  66. * response queued for it, with the saved 'id' passed back.
  67. */
  68. struct pending_req {
  69. struct blkif_st *blkif;
  70. u64 id;
  71. int nr_pages;
  72. atomic_t pendcnt;
  73. unsigned short operation;
  74. int status;
  75. struct list_head free_list;
  76. };
  77. #define BLKBACK_INVALID_HANDLE (~0)
  78. struct xen_blkbk {
  79. struct pending_req *pending_reqs;
  80. /* List of all 'pending_req' available */
  81. struct list_head pending_free;
  82. /* And its spinlock. */
  83. spinlock_t pending_free_lock;
  84. wait_queue_head_t pending_free_wq;
  85. /* The list of all pages that are available. */
  86. struct page **pending_pages;
  87. /* And the grant handles that are available. */
  88. grant_handle_t *pending_grant_handles;
  89. };
  90. static struct xen_blkbk *blkbk;
  91. /*
  92. * Little helpful macro to figure out the index and virtual address of the
  93. * pending_pages[..]. For each 'pending_req' we have have up to
  94. * BLKIF_MAX_SEGMENTS_PER_REQUEST (11) pages. The seg would be from 0 through
  95. * 10 and would index in the pending_pages[..].
  96. */
  97. static inline int vaddr_pagenr(struct pending_req *req, int seg)
  98. {
  99. return (req - blkbk->pending_reqs) *
  100. BLKIF_MAX_SEGMENTS_PER_REQUEST + seg;
  101. }
  102. #define pending_page(req, seg) pending_pages[vaddr_pagenr(req, seg)]
  103. static inline unsigned long vaddr(struct pending_req *req, int seg)
  104. {
  105. unsigned long pfn = page_to_pfn(blkbk->pending_page(req, seg));
  106. return (unsigned long)pfn_to_kaddr(pfn);
  107. }
  108. #define pending_handle(_req, _seg) \
  109. (blkbk->pending_grant_handles[vaddr_pagenr(_req, _seg)])
  110. static int do_block_io_op(struct blkif_st *blkif);
  111. static int dispatch_rw_block_io(struct blkif_st *blkif,
  112. struct blkif_request *req,
  113. struct pending_req *pending_req);
  114. static void make_response(struct blkif_st *blkif, u64 id,
  115. unsigned short op, int st);
  116. /*
  117. * Retrieve from the 'pending_reqs' a free pending_req structure to be used.
  118. */
  119. static struct pending_req *alloc_req(void)
  120. {
  121. struct pending_req *req = NULL;
  122. unsigned long flags;
  123. spin_lock_irqsave(&blkbk->pending_free_lock, flags);
  124. if (!list_empty(&blkbk->pending_free)) {
  125. req = list_entry(blkbk->pending_free.next, struct pending_req,
  126. free_list);
  127. list_del(&req->free_list);
  128. }
  129. spin_unlock_irqrestore(&blkbk->pending_free_lock, flags);
  130. return req;
  131. }
  132. /*
  133. * Return the 'pending_req' structure back to the freepool. We also
  134. * wake up the thread if it was waiting for a free page.
  135. */
  136. static void free_req(struct pending_req *req)
  137. {
  138. unsigned long flags;
  139. int was_empty;
  140. spin_lock_irqsave(&blkbk->pending_free_lock, flags);
  141. was_empty = list_empty(&blkbk->pending_free);
  142. list_add(&req->free_list, &blkbk->pending_free);
  143. spin_unlock_irqrestore(&blkbk->pending_free_lock, flags);
  144. if (was_empty)
  145. wake_up(&blkbk->pending_free_wq);
  146. }
  147. /*
  148. * Routines for managing virtual block devices (vbds).
  149. */
  150. static int vbd_translate(struct phys_req *req, struct blkif_st *blkif,
  151. int operation)
  152. {
  153. struct vbd *vbd = &blkif->vbd;
  154. int rc = -EACCES;
  155. if ((operation != READ) && vbd->readonly)
  156. goto out;
  157. if (unlikely((req->sector_number + req->nr_sects) > vbd_sz(vbd)))
  158. goto out;
  159. req->dev = vbd->pdevice;
  160. req->bdev = vbd->bdev;
  161. rc = 0;
  162. out:
  163. return rc;
  164. }
  165. static void vbd_resize(struct blkif_st *blkif)
  166. {
  167. struct vbd *vbd = &blkif->vbd;
  168. struct xenbus_transaction xbt;
  169. int err;
  170. struct xenbus_device *dev = xen_blkbk_xenbus(blkif->be);
  171. unsigned long long new_size = vbd_sz(vbd);
  172. pr_info(DRV_PFX "VBD Resize: Domid: %d, Device: (%d, %d)\n",
  173. blkif->domid, MAJOR(vbd->pdevice), MINOR(vbd->pdevice));
  174. pr_info(DRV_PFX "VBD Resize: new size %llu\n", new_size);
  175. vbd->size = new_size;
  176. again:
  177. err = xenbus_transaction_start(&xbt);
  178. if (err) {
  179. pr_warn(DRV_PFX "Error starting transaction");
  180. return;
  181. }
  182. err = xenbus_printf(xbt, dev->nodename, "sectors", "%llu",
  183. (unsigned long long)vbd_sz(vbd));
  184. if (err) {
  185. pr_warn(DRV_PFX "Error writing new size");
  186. goto abort;
  187. }
  188. /*
  189. * Write the current state; we will use this to synchronize
  190. * the front-end. If the current state is "connected" the
  191. * front-end will get the new size information online.
  192. */
  193. err = xenbus_printf(xbt, dev->nodename, "state", "%d", dev->state);
  194. if (err) {
  195. pr_warn(DRV_PFX "Error writing the state");
  196. goto abort;
  197. }
  198. err = xenbus_transaction_end(xbt, 0);
  199. if (err == -EAGAIN)
  200. goto again;
  201. if (err)
  202. pr_warn(DRV_PFX "Error ending transaction");
  203. abort:
  204. xenbus_transaction_end(xbt, 1);
  205. }
  206. /*
  207. * Notification from the guest OS.
  208. */
  209. static void blkif_notify_work(struct blkif_st *blkif)
  210. {
  211. blkif->waiting_reqs = 1;
  212. wake_up(&blkif->wq);
  213. }
  214. irqreturn_t xen_blkif_be_int(int irq, void *dev_id)
  215. {
  216. blkif_notify_work(dev_id);
  217. return IRQ_HANDLED;
  218. }
  219. /*
  220. * SCHEDULER FUNCTIONS
  221. */
  222. static void print_stats(struct blkif_st *blkif)
  223. {
  224. pr_debug("xen-blkback (%s): oo %3d | rd %4d | wr %4d | f %4d\n",
  225. current->comm, blkif->st_oo_req,
  226. blkif->st_rd_req, blkif->st_wr_req, blkif->st_f_req);
  227. blkif->st_print = jiffies + msecs_to_jiffies(10 * 1000);
  228. blkif->st_rd_req = 0;
  229. blkif->st_wr_req = 0;
  230. blkif->st_oo_req = 0;
  231. }
  232. int xen_blkif_schedule(void *arg)
  233. {
  234. struct blkif_st *blkif = arg;
  235. struct vbd *vbd = &blkif->vbd;
  236. xen_blkif_get(blkif);
  237. while (!kthread_should_stop()) {
  238. if (try_to_freeze())
  239. continue;
  240. if (unlikely(vbd->size != vbd_sz(vbd)))
  241. vbd_resize(blkif);
  242. wait_event_interruptible(
  243. blkif->wq,
  244. blkif->waiting_reqs || kthread_should_stop());
  245. wait_event_interruptible(
  246. blkbk->pending_free_wq,
  247. !list_empty(&blkbk->pending_free) ||
  248. kthread_should_stop());
  249. blkif->waiting_reqs = 0;
  250. smp_mb(); /* clear flag *before* checking for work */
  251. if (do_block_io_op(blkif))
  252. blkif->waiting_reqs = 1;
  253. if (log_stats && time_after(jiffies, blkif->st_print))
  254. print_stats(blkif);
  255. }
  256. if (log_stats)
  257. print_stats(blkif);
  258. blkif->xenblkd = NULL;
  259. xen_blkif_put(blkif);
  260. return 0;
  261. }
  262. struct seg_buf {
  263. unsigned long buf;
  264. unsigned int nsec;
  265. };
  266. /*
  267. * Unmap the grant references, and also remove the M2P over-rides
  268. * used in the 'pending_req'.
  269. */
  270. static void xen_blkbk_unmap(struct pending_req *req)
  271. {
  272. struct gnttab_unmap_grant_ref unmap[BLKIF_MAX_SEGMENTS_PER_REQUEST];
  273. unsigned int i, invcount = 0;
  274. grant_handle_t handle;
  275. int ret;
  276. for (i = 0; i < req->nr_pages; i++) {
  277. handle = pending_handle(req, i);
  278. if (handle == BLKBACK_INVALID_HANDLE)
  279. continue;
  280. gnttab_set_unmap_op(&unmap[invcount], vaddr(req, i),
  281. GNTMAP_host_map, handle);
  282. pending_handle(req, i) = BLKBACK_INVALID_HANDLE;
  283. invcount++;
  284. }
  285. ret = HYPERVISOR_grant_table_op(
  286. GNTTABOP_unmap_grant_ref, unmap, invcount);
  287. BUG_ON(ret);
  288. /*
  289. * Note, we use invcount, so nr->pages, so we can't index
  290. * using vaddr(req, i).
  291. */
  292. for (i = 0; i < invcount; i++) {
  293. ret = m2p_remove_override(
  294. virt_to_page(unmap[i].host_addr), false);
  295. if (ret) {
  296. pr_alert(DRV_PFX "Failed to remove M2P override for %lx\n",
  297. (unsigned long)unmap[i].host_addr);
  298. continue;
  299. }
  300. }
  301. }
  302. static int xen_blkbk_map(struct blkif_request *req,
  303. struct pending_req *pending_req,
  304. struct seg_buf seg[])
  305. {
  306. struct gnttab_map_grant_ref map[BLKIF_MAX_SEGMENTS_PER_REQUEST];
  307. int i;
  308. int nseg = req->nr_segments;
  309. int ret = 0;
  310. /*
  311. * Fill out preq.nr_sects with proper amount of sectors, and setup
  312. * assign map[..] with the PFN of the page in our domain with the
  313. * corresponding grant reference for each page.
  314. */
  315. for (i = 0; i < nseg; i++) {
  316. uint32_t flags;
  317. flags = GNTMAP_host_map;
  318. if (pending_req->operation != BLKIF_OP_READ)
  319. flags |= GNTMAP_readonly;
  320. gnttab_set_map_op(&map[i], vaddr(pending_req, i), flags,
  321. req->u.rw.seg[i].gref,
  322. pending_req->blkif->domid);
  323. }
  324. ret = HYPERVISOR_grant_table_op(GNTTABOP_map_grant_ref, map, nseg);
  325. BUG_ON(ret);
  326. /*
  327. * Now swizzle the MFN in our domain with the MFN from the other domain
  328. * so that when we access vaddr(pending_req,i) it has the contents of
  329. * the page from the other domain.
  330. */
  331. for (i = 0; i < nseg; i++) {
  332. if (unlikely(map[i].status != 0)) {
  333. pr_debug(DRV_PFX "invalid buffer -- could not remap it\n");
  334. map[i].handle = BLKBACK_INVALID_HANDLE;
  335. ret |= 1;
  336. }
  337. pending_handle(pending_req, i) = map[i].handle;
  338. if (ret)
  339. continue;
  340. ret = m2p_add_override(PFN_DOWN(map[i].dev_bus_addr),
  341. blkbk->pending_page(pending_req, i), false);
  342. if (ret) {
  343. pr_alert(DRV_PFX "Failed to install M2P override for %lx (ret: %d)\n",
  344. (unsigned long)map[i].dev_bus_addr, ret);
  345. /* We could switch over to GNTTABOP_copy */
  346. continue;
  347. }
  348. seg[i].buf = map[i].dev_bus_addr |
  349. (req->u.rw.seg[i].first_sect << 9);
  350. }
  351. return ret;
  352. }
  353. /*
  354. * Completion callback on the bio's. Called as bh->b_end_io()
  355. */
  356. static void __end_block_io_op(struct pending_req *pending_req, int error)
  357. {
  358. /* An error fails the entire request. */
  359. if ((pending_req->operation == BLKIF_OP_FLUSH_DISKCACHE) &&
  360. (error == -EOPNOTSUPP)) {
  361. pr_debug(DRV_PFX "flush diskcache op failed, not supported\n");
  362. xen_blkbk_flush_diskcache(XBT_NIL, pending_req->blkif->be, 0);
  363. pending_req->status = BLKIF_RSP_EOPNOTSUPP;
  364. } else if (error) {
  365. pr_debug(DRV_PFX "Buffer not up-to-date at end of operation,"
  366. " error=%d\n", error);
  367. pending_req->status = BLKIF_RSP_ERROR;
  368. }
  369. /*
  370. * If all of the bio's have completed it is time to unmap
  371. * the grant references associated with 'request' and provide
  372. * the proper response on the ring.
  373. */
  374. if (atomic_dec_and_test(&pending_req->pendcnt)) {
  375. xen_blkbk_unmap(pending_req);
  376. make_response(pending_req->blkif, pending_req->id,
  377. pending_req->operation, pending_req->status);
  378. xen_blkif_put(pending_req->blkif);
  379. free_req(pending_req);
  380. }
  381. }
  382. /*
  383. * bio callback.
  384. */
  385. static void end_block_io_op(struct bio *bio, int error)
  386. {
  387. __end_block_io_op(bio->bi_private, error);
  388. bio_put(bio);
  389. }
  390. /*
  391. * Function to copy the from the ring buffer the 'struct blkif_request'
  392. * (which has the sectors we want, number of them, grant references, etc),
  393. * and transmute it to the block API to hand it over to the proper block disk.
  394. */
  395. static int do_block_io_op(struct blkif_st *blkif)
  396. {
  397. union blkif_back_rings *blk_rings = &blkif->blk_rings;
  398. struct blkif_request req;
  399. struct pending_req *pending_req;
  400. RING_IDX rc, rp;
  401. int more_to_do = 0;
  402. rc = blk_rings->common.req_cons;
  403. rp = blk_rings->common.sring->req_prod;
  404. rmb(); /* Ensure we see queued requests up to 'rp'. */
  405. while (rc != rp) {
  406. if (RING_REQUEST_CONS_OVERFLOW(&blk_rings->common, rc))
  407. break;
  408. if (kthread_should_stop()) {
  409. more_to_do = 1;
  410. break;
  411. }
  412. pending_req = alloc_req();
  413. if (NULL == pending_req) {
  414. blkif->st_oo_req++;
  415. more_to_do = 1;
  416. break;
  417. }
  418. switch (blkif->blk_protocol) {
  419. case BLKIF_PROTOCOL_NATIVE:
  420. memcpy(&req, RING_GET_REQUEST(&blk_rings->native, rc), sizeof(req));
  421. break;
  422. case BLKIF_PROTOCOL_X86_32:
  423. blkif_get_x86_32_req(&req, RING_GET_REQUEST(&blk_rings->x86_32, rc));
  424. break;
  425. case BLKIF_PROTOCOL_X86_64:
  426. blkif_get_x86_64_req(&req, RING_GET_REQUEST(&blk_rings->x86_64, rc));
  427. break;
  428. default:
  429. BUG();
  430. }
  431. blk_rings->common.req_cons = ++rc; /* before make_response() */
  432. /* Apply all sanity checks to /private copy/ of request. */
  433. barrier();
  434. if (dispatch_rw_block_io(blkif, &req, pending_req))
  435. break;
  436. /* Yield point for this unbounded loop. */
  437. cond_resched();
  438. }
  439. return more_to_do;
  440. }
  441. /*
  442. * Transmutation of the 'struct blkif_request' to a proper 'struct bio'
  443. * and call the 'submit_bio' to pass it to the underlying storage.
  444. */
  445. static int dispatch_rw_block_io(struct blkif_st *blkif,
  446. struct blkif_request *req,
  447. struct pending_req *pending_req)
  448. {
  449. struct phys_req preq;
  450. struct seg_buf seg[BLKIF_MAX_SEGMENTS_PER_REQUEST];
  451. unsigned int nseg;
  452. struct bio *bio = NULL;
  453. struct bio *biolist[BLKIF_MAX_SEGMENTS_PER_REQUEST];
  454. int i, nbio = 0;
  455. int operation;
  456. struct blk_plug plug;
  457. switch (req->operation) {
  458. case BLKIF_OP_READ:
  459. blkif->st_rd_req++;
  460. operation = READ;
  461. break;
  462. case BLKIF_OP_WRITE:
  463. blkif->st_wr_req++;
  464. operation = WRITE_ODIRECT;
  465. break;
  466. case BLKIF_OP_FLUSH_DISKCACHE:
  467. blkif->st_f_req++;
  468. operation = WRITE_FLUSH;
  469. /*
  470. * The frontend likes to set this to -1, which vbd_translate
  471. * is alergic too.
  472. */
  473. req->u.rw.sector_number = 0;
  474. break;
  475. case BLKIF_OP_WRITE_BARRIER:
  476. default:
  477. operation = 0; /* make gcc happy */
  478. goto fail_response;
  479. break;
  480. }
  481. /* Check that the number of segments is sane. */
  482. nseg = req->nr_segments;
  483. if (unlikely(nseg == 0 && operation != WRITE_FLUSH) ||
  484. unlikely(nseg > BLKIF_MAX_SEGMENTS_PER_REQUEST)) {
  485. pr_debug(DRV_PFX "Bad number of segments in request (%d)\n",
  486. nseg);
  487. /* Haven't submitted any bio's yet. */
  488. goto fail_response;
  489. }
  490. preq.dev = req->handle;
  491. preq.sector_number = req->u.rw.sector_number;
  492. preq.nr_sects = 0;
  493. pending_req->blkif = blkif;
  494. pending_req->id = req->id;
  495. pending_req->operation = req->operation;
  496. pending_req->status = BLKIF_RSP_OKAY;
  497. pending_req->nr_pages = nseg;
  498. for (i = 0; i < nseg; i++) {
  499. seg[i].nsec = req->u.rw.seg[i].last_sect -
  500. req->u.rw.seg[i].first_sect + 1;
  501. if ((req->u.rw.seg[i].last_sect >= (PAGE_SIZE >> 9)) ||
  502. (req->u.rw.seg[i].last_sect < req->u.rw.seg[i].first_sect))
  503. goto fail_response;
  504. preq.nr_sects += seg[i].nsec;
  505. }
  506. if (vbd_translate(&preq, blkif, operation) != 0) {
  507. pr_debug(DRV_PFX "access denied: %s of [%llu,%llu] on dev=%04x\n",
  508. operation == READ ? "read" : "write",
  509. preq.sector_number,
  510. preq.sector_number + preq.nr_sects, preq.dev);
  511. goto fail_response;
  512. }
  513. /*
  514. * This check _MUST_ be done after vbd_translate as the preq.bdev
  515. * is set there.
  516. */
  517. for (i = 0; i < nseg; i++) {
  518. if (((int)preq.sector_number|(int)seg[i].nsec) &
  519. ((bdev_logical_block_size(preq.bdev) >> 9) - 1)) {
  520. pr_debug(DRV_PFX "Misaligned I/O request from domain %d",
  521. blkif->domid);
  522. goto fail_response;
  523. }
  524. }
  525. /*
  526. * If we have failed at this point, we need to undo the M2P override,
  527. * set gnttab_set_unmap_op on all of the grant references and perform
  528. * the hypercall to unmap the grants - that is all done in
  529. * xen_blkbk_unmap.
  530. */
  531. if (xen_blkbk_map(req, pending_req, seg))
  532. goto fail_flush;
  533. /* This corresponding xen_blkif_put is done in __end_block_io_op */
  534. xen_blkif_get(blkif);
  535. for (i = 0; i < nseg; i++) {
  536. while ((bio == NULL) ||
  537. (bio_add_page(bio,
  538. blkbk->pending_page(pending_req, i),
  539. seg[i].nsec << 9,
  540. seg[i].buf & ~PAGE_MASK) == 0)) {
  541. bio = biolist[nbio++] = bio_alloc(GFP_KERNEL, nseg-i);
  542. if (unlikely(bio == NULL))
  543. goto fail_put_bio;
  544. bio->bi_bdev = preq.bdev;
  545. bio->bi_private = pending_req;
  546. bio->bi_end_io = end_block_io_op;
  547. bio->bi_sector = preq.sector_number;
  548. }
  549. preq.sector_number += seg[i].nsec;
  550. }
  551. /* This will be hit if the operation was a flush. */
  552. if (!bio) {
  553. BUG_ON(operation != WRITE_FLUSH);
  554. bio = biolist[nbio++] = bio_alloc(GFP_KERNEL, 0);
  555. if (unlikely(bio == NULL))
  556. goto fail_put_bio;
  557. bio->bi_bdev = preq.bdev;
  558. bio->bi_private = pending_req;
  559. bio->bi_end_io = end_block_io_op;
  560. }
  561. /*
  562. * We set it one so that the last submit_bio does not have to call
  563. * atomic_inc.
  564. */
  565. atomic_set(&pending_req->pendcnt, nbio);
  566. /* Get a reference count for the disk queue and start sending I/O */
  567. blk_start_plug(&plug);
  568. for (i = 0; i < nbio; i++)
  569. submit_bio(operation, biolist[i]);
  570. /* Let the I/Os go.. */
  571. blk_finish_plug(&plug);
  572. if (operation == READ)
  573. blkif->st_rd_sect += preq.nr_sects;
  574. else if (operation == WRITE || operation == WRITE_FLUSH)
  575. blkif->st_wr_sect += preq.nr_sects;
  576. return 0;
  577. fail_flush:
  578. xen_blkbk_unmap(pending_req);
  579. fail_response:
  580. /* Haven't submitted any bio's yet. */
  581. make_response(blkif, req->id, req->operation, BLKIF_RSP_ERROR);
  582. free_req(pending_req);
  583. msleep(1); /* back off a bit */
  584. return -EIO;
  585. fail_put_bio:
  586. for (i = 0; i < (nbio-1); i++)
  587. bio_put(biolist[i]);
  588. __end_block_io_op(pending_req, -EINVAL);
  589. msleep(1); /* back off a bit */
  590. return -EIO;
  591. }
  592. /*
  593. * Put a response on the ring on how the operation fared.
  594. */
  595. static void make_response(struct blkif_st *blkif, u64 id,
  596. unsigned short op, int st)
  597. {
  598. struct blkif_response resp;
  599. unsigned long flags;
  600. union blkif_back_rings *blk_rings = &blkif->blk_rings;
  601. int more_to_do = 0;
  602. int notify;
  603. resp.id = id;
  604. resp.operation = op;
  605. resp.status = st;
  606. spin_lock_irqsave(&blkif->blk_ring_lock, flags);
  607. /* Place on the response ring for the relevant domain. */
  608. switch (blkif->blk_protocol) {
  609. case BLKIF_PROTOCOL_NATIVE:
  610. memcpy(RING_GET_RESPONSE(&blk_rings->native, blk_rings->native.rsp_prod_pvt),
  611. &resp, sizeof(resp));
  612. break;
  613. case BLKIF_PROTOCOL_X86_32:
  614. memcpy(RING_GET_RESPONSE(&blk_rings->x86_32, blk_rings->x86_32.rsp_prod_pvt),
  615. &resp, sizeof(resp));
  616. break;
  617. case BLKIF_PROTOCOL_X86_64:
  618. memcpy(RING_GET_RESPONSE(&blk_rings->x86_64, blk_rings->x86_64.rsp_prod_pvt),
  619. &resp, sizeof(resp));
  620. break;
  621. default:
  622. BUG();
  623. }
  624. blk_rings->common.rsp_prod_pvt++;
  625. RING_PUSH_RESPONSES_AND_CHECK_NOTIFY(&blk_rings->common, notify);
  626. if (blk_rings->common.rsp_prod_pvt == blk_rings->common.req_cons) {
  627. /*
  628. * Tail check for pending requests. Allows frontend to avoid
  629. * notifications if requests are already in flight (lower
  630. * overheads and promotes batching).
  631. */
  632. RING_FINAL_CHECK_FOR_REQUESTS(&blk_rings->common, more_to_do);
  633. } else if (RING_HAS_UNCONSUMED_REQUESTS(&blk_rings->common)) {
  634. more_to_do = 1;
  635. }
  636. spin_unlock_irqrestore(&blkif->blk_ring_lock, flags);
  637. if (more_to_do)
  638. blkif_notify_work(blkif);
  639. if (notify)
  640. notify_remote_via_irq(blkif->irq);
  641. }
  642. static int __init xen_blkif_init(void)
  643. {
  644. int i, mmap_pages;
  645. int rc = 0;
  646. if (!xen_pv_domain())
  647. return -ENODEV;
  648. blkbk = kzalloc(sizeof(struct xen_blkbk), GFP_KERNEL);
  649. if (!blkbk) {
  650. pr_alert(DRV_PFX "%s: out of memory!\n", __func__);
  651. return -ENOMEM;
  652. }
  653. mmap_pages = xen_blkif_reqs * BLKIF_MAX_SEGMENTS_PER_REQUEST;
  654. blkbk->pending_reqs = kmalloc(sizeof(blkbk->pending_reqs[0]) *
  655. xen_blkif_reqs, GFP_KERNEL);
  656. blkbk->pending_grant_handles = kzalloc(sizeof(blkbk->pending_grant_handles[0]) *
  657. mmap_pages, GFP_KERNEL);
  658. blkbk->pending_pages = kzalloc(sizeof(blkbk->pending_pages[0]) *
  659. mmap_pages, GFP_KERNEL);
  660. if (!blkbk->pending_reqs || !blkbk->pending_grant_handles ||
  661. !blkbk->pending_pages) {
  662. rc = -ENOMEM;
  663. goto out_of_memory;
  664. }
  665. for (i = 0; i < mmap_pages; i++) {
  666. blkbk->pending_grant_handles[i] = BLKBACK_INVALID_HANDLE;
  667. blkbk->pending_pages[i] = alloc_page(GFP_KERNEL);
  668. if (blkbk->pending_pages[i] == NULL) {
  669. rc = -ENOMEM;
  670. goto out_of_memory;
  671. }
  672. }
  673. rc = xen_blkif_interface_init();
  674. if (rc)
  675. goto failed_init;
  676. memset(blkbk->pending_reqs, 0, sizeof(blkbk->pending_reqs));
  677. INIT_LIST_HEAD(&blkbk->pending_free);
  678. spin_lock_init(&blkbk->pending_free_lock);
  679. init_waitqueue_head(&blkbk->pending_free_wq);
  680. for (i = 0; i < xen_blkif_reqs; i++)
  681. list_add_tail(&blkbk->pending_reqs[i].free_list,
  682. &blkbk->pending_free);
  683. rc = xen_blkif_xenbus_init();
  684. if (rc)
  685. goto failed_init;
  686. return 0;
  687. out_of_memory:
  688. pr_alert(DRV_PFX "%s: out of memory\n", __func__);
  689. failed_init:
  690. kfree(blkbk->pending_reqs);
  691. kfree(blkbk->pending_grant_handles);
  692. for (i = 0; i < mmap_pages; i++) {
  693. if (blkbk->pending_pages[i])
  694. __free_page(blkbk->pending_pages[i]);
  695. }
  696. kfree(blkbk->pending_pages);
  697. kfree(blkbk);
  698. blkbk = NULL;
  699. return rc;
  700. }
  701. module_init(xen_blkif_init);
  702. MODULE_LICENSE("Dual BSD/GPL");