drbd_req.c 36 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172
  1. /*
  2. drbd_req.c
  3. This file is part of DRBD by Philipp Reisner and Lars Ellenberg.
  4. Copyright (C) 2001-2008, LINBIT Information Technologies GmbH.
  5. Copyright (C) 1999-2008, Philipp Reisner <philipp.reisner@linbit.com>.
  6. Copyright (C) 2002-2008, Lars Ellenberg <lars.ellenberg@linbit.com>.
  7. drbd is free software; you can redistribute it and/or modify
  8. it under the terms of the GNU General Public License as published by
  9. the Free Software Foundation; either version 2, or (at your option)
  10. any later version.
  11. drbd is distributed in the hope that it will be useful,
  12. but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. GNU General Public License for more details.
  15. You should have received a copy of the GNU General Public License
  16. along with drbd; see the file COPYING. If not, write to
  17. the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
  18. */
  19. #include <linux/module.h>
  20. #include <linux/slab.h>
  21. #include <linux/drbd.h>
  22. #include "drbd_int.h"
  23. #include "drbd_req.h"
  24. /* Update disk stats at start of I/O request */
  25. static void _drbd_start_io_acct(struct drbd_conf *mdev, struct drbd_request *req, struct bio *bio)
  26. {
  27. const int rw = bio_data_dir(bio);
  28. int cpu;
  29. cpu = part_stat_lock();
  30. part_stat_inc(cpu, &mdev->vdisk->part0, ios[rw]);
  31. part_stat_add(cpu, &mdev->vdisk->part0, sectors[rw], bio_sectors(bio));
  32. part_inc_in_flight(&mdev->vdisk->part0, rw);
  33. part_stat_unlock();
  34. }
  35. /* Update disk stats when completing request upwards */
  36. static void _drbd_end_io_acct(struct drbd_conf *mdev, struct drbd_request *req)
  37. {
  38. int rw = bio_data_dir(req->master_bio);
  39. unsigned long duration = jiffies - req->start_time;
  40. int cpu;
  41. cpu = part_stat_lock();
  42. part_stat_add(cpu, &mdev->vdisk->part0, ticks[rw], duration);
  43. part_round_stats(cpu, &mdev->vdisk->part0);
  44. part_dec_in_flight(&mdev->vdisk->part0, rw);
  45. part_stat_unlock();
  46. }
  47. static void _req_is_done(struct drbd_conf *mdev, struct drbd_request *req, const int rw)
  48. {
  49. const unsigned long s = req->rq_state;
  50. /* remove it from the transfer log.
  51. * well, only if it had been there in the first
  52. * place... if it had not (local only or conflicting
  53. * and never sent), it should still be "empty" as
  54. * initialized in drbd_req_new(), so we can list_del() it
  55. * here unconditionally */
  56. list_del(&req->tl_requests);
  57. /* if it was a write, we may have to set the corresponding
  58. * bit(s) out-of-sync first. If it had a local part, we need to
  59. * release the reference to the activity log. */
  60. if (rw == WRITE) {
  61. /* Set out-of-sync unless both OK flags are set
  62. * (local only or remote failed).
  63. * Other places where we set out-of-sync:
  64. * READ with local io-error */
  65. if (!(s & RQ_NET_OK) || !(s & RQ_LOCAL_OK))
  66. drbd_set_out_of_sync(mdev, req->sector, req->size);
  67. if ((s & RQ_NET_OK) && (s & RQ_LOCAL_OK) && (s & RQ_NET_SIS))
  68. drbd_set_in_sync(mdev, req->sector, req->size);
  69. /* one might be tempted to move the drbd_al_complete_io
  70. * to the local io completion callback drbd_endio_pri.
  71. * but, if this was a mirror write, we may only
  72. * drbd_al_complete_io after this is RQ_NET_DONE,
  73. * otherwise the extent could be dropped from the al
  74. * before it has actually been written on the peer.
  75. * if we crash before our peer knows about the request,
  76. * but after the extent has been dropped from the al,
  77. * we would forget to resync the corresponding extent.
  78. */
  79. if (s & RQ_LOCAL_MASK) {
  80. if (get_ldev_if_state(mdev, D_FAILED)) {
  81. if (s & RQ_IN_ACT_LOG)
  82. drbd_al_complete_io(mdev, req->sector);
  83. put_ldev(mdev);
  84. } else if (__ratelimit(&drbd_ratelimit_state)) {
  85. dev_warn(DEV, "Should have called drbd_al_complete_io(, %llu), "
  86. "but my Disk seems to have failed :(\n",
  87. (unsigned long long) req->sector);
  88. }
  89. }
  90. }
  91. drbd_req_free(req);
  92. }
  93. static void queue_barrier(struct drbd_conf *mdev)
  94. {
  95. struct drbd_tl_epoch *b;
  96. /* We are within the req_lock. Once we queued the barrier for sending,
  97. * we set the CREATE_BARRIER bit. It is cleared as soon as a new
  98. * barrier/epoch object is added. This is the only place this bit is
  99. * set. It indicates that the barrier for this epoch is already queued,
  100. * and no new epoch has been created yet. */
  101. if (test_bit(CREATE_BARRIER, &mdev->flags))
  102. return;
  103. b = mdev->newest_tle;
  104. b->w.cb = w_send_barrier;
  105. /* inc_ap_pending done here, so we won't
  106. * get imbalanced on connection loss.
  107. * dec_ap_pending will be done in got_BarrierAck
  108. * or (on connection loss) in tl_clear. */
  109. inc_ap_pending(mdev);
  110. drbd_queue_work(&mdev->data.work, &b->w);
  111. set_bit(CREATE_BARRIER, &mdev->flags);
  112. }
  113. static void _about_to_complete_local_write(struct drbd_conf *mdev,
  114. struct drbd_request *req)
  115. {
  116. const unsigned long s = req->rq_state;
  117. struct drbd_request *i;
  118. struct drbd_epoch_entry *e;
  119. struct hlist_node *n;
  120. struct hlist_head *slot;
  121. /* before we can signal completion to the upper layers,
  122. * we may need to close the current epoch */
  123. if (mdev->state.conn >= C_CONNECTED &&
  124. req->epoch == mdev->newest_tle->br_number)
  125. queue_barrier(mdev);
  126. /* we need to do the conflict detection stuff,
  127. * if we have the ee_hash (two_primaries) and
  128. * this has been on the network */
  129. if ((s & RQ_NET_DONE) && mdev->ee_hash != NULL) {
  130. const sector_t sector = req->sector;
  131. const int size = req->size;
  132. /* ASSERT:
  133. * there must be no conflicting requests, since
  134. * they must have been failed on the spot */
  135. #define OVERLAPS overlaps(sector, size, i->sector, i->size)
  136. slot = tl_hash_slot(mdev, sector);
  137. hlist_for_each_entry(i, n, slot, colision) {
  138. if (OVERLAPS) {
  139. dev_alert(DEV, "LOGIC BUG: completed: %p %llus +%u; "
  140. "other: %p %llus +%u\n",
  141. req, (unsigned long long)sector, size,
  142. i, (unsigned long long)i->sector, i->size);
  143. }
  144. }
  145. /* maybe "wake" those conflicting epoch entries
  146. * that wait for this request to finish.
  147. *
  148. * currently, there can be only _one_ such ee
  149. * (well, or some more, which would be pending
  150. * P_DISCARD_ACK not yet sent by the asender...),
  151. * since we block the receiver thread upon the
  152. * first conflict detection, which will wait on
  153. * misc_wait. maybe we want to assert that?
  154. *
  155. * anyways, if we found one,
  156. * we just have to do a wake_up. */
  157. #undef OVERLAPS
  158. #define OVERLAPS overlaps(sector, size, e->sector, e->size)
  159. slot = ee_hash_slot(mdev, req->sector);
  160. hlist_for_each_entry(e, n, slot, colision) {
  161. if (OVERLAPS) {
  162. wake_up(&mdev->misc_wait);
  163. break;
  164. }
  165. }
  166. }
  167. #undef OVERLAPS
  168. }
  169. void complete_master_bio(struct drbd_conf *mdev,
  170. struct bio_and_error *m)
  171. {
  172. bio_endio(m->bio, m->error);
  173. dec_ap_bio(mdev);
  174. }
  175. /* Helper for __req_mod().
  176. * Set m->bio to the master bio, if it is fit to be completed,
  177. * or leave it alone (it is initialized to NULL in __req_mod),
  178. * if it has already been completed, or cannot be completed yet.
  179. * If m->bio is set, the error status to be returned is placed in m->error.
  180. */
  181. void _req_may_be_done(struct drbd_request *req, struct bio_and_error *m)
  182. {
  183. const unsigned long s = req->rq_state;
  184. struct drbd_conf *mdev = req->mdev;
  185. /* only WRITES may end up here without a master bio (on barrier ack) */
  186. int rw = req->master_bio ? bio_data_dir(req->master_bio) : WRITE;
  187. /* we must not complete the master bio, while it is
  188. * still being processed by _drbd_send_zc_bio (drbd_send_dblock)
  189. * not yet acknowledged by the peer
  190. * not yet completed by the local io subsystem
  191. * these flags may get cleared in any order by
  192. * the worker,
  193. * the receiver,
  194. * the bio_endio completion callbacks.
  195. */
  196. if (s & RQ_NET_QUEUED)
  197. return;
  198. if (s & RQ_NET_PENDING)
  199. return;
  200. if (s & RQ_LOCAL_PENDING)
  201. return;
  202. if (req->master_bio) {
  203. /* this is data_received (remote read)
  204. * or protocol C P_WRITE_ACK
  205. * or protocol B P_RECV_ACK
  206. * or protocol A "handed_over_to_network" (SendAck)
  207. * or canceled or failed,
  208. * or killed from the transfer log due to connection loss.
  209. */
  210. /*
  211. * figure out whether to report success or failure.
  212. *
  213. * report success when at least one of the operations succeeded.
  214. * or, to put the other way,
  215. * only report failure, when both operations failed.
  216. *
  217. * what to do about the failures is handled elsewhere.
  218. * what we need to do here is just: complete the master_bio.
  219. *
  220. * local completion error, if any, has been stored as ERR_PTR
  221. * in private_bio within drbd_endio_pri.
  222. */
  223. int ok = (s & RQ_LOCAL_OK) || (s & RQ_NET_OK);
  224. int error = PTR_ERR(req->private_bio);
  225. /* remove the request from the conflict detection
  226. * respective block_id verification hash */
  227. if (!hlist_unhashed(&req->colision))
  228. hlist_del(&req->colision);
  229. else
  230. D_ASSERT((s & (RQ_NET_MASK & ~RQ_NET_DONE)) == 0);
  231. /* for writes we need to do some extra housekeeping */
  232. if (rw == WRITE)
  233. _about_to_complete_local_write(mdev, req);
  234. /* Update disk stats */
  235. _drbd_end_io_acct(mdev, req);
  236. m->error = ok ? 0 : (error ?: -EIO);
  237. m->bio = req->master_bio;
  238. req->master_bio = NULL;
  239. }
  240. if ((s & RQ_NET_MASK) == 0 || (s & RQ_NET_DONE)) {
  241. /* this is disconnected (local only) operation,
  242. * or protocol C P_WRITE_ACK,
  243. * or protocol A or B P_BARRIER_ACK,
  244. * or killed from the transfer log due to connection loss. */
  245. _req_is_done(mdev, req, rw);
  246. }
  247. /* else: network part and not DONE yet. that is
  248. * protocol A or B, barrier ack still pending... */
  249. }
  250. static void _req_may_be_done_not_susp(struct drbd_request *req, struct bio_and_error *m)
  251. {
  252. struct drbd_conf *mdev = req->mdev;
  253. if (!is_susp(mdev->state))
  254. _req_may_be_done(req, m);
  255. }
  256. /*
  257. * checks whether there was an overlapping request
  258. * or ee already registered.
  259. *
  260. * if so, return 1, in which case this request is completed on the spot,
  261. * without ever being submitted or send.
  262. *
  263. * return 0 if it is ok to submit this request.
  264. *
  265. * NOTE:
  266. * paranoia: assume something above us is broken, and issues different write
  267. * requests for the same block simultaneously...
  268. *
  269. * To ensure these won't be reordered differently on both nodes, resulting in
  270. * diverging data sets, we discard the later one(s). Not that this is supposed
  271. * to happen, but this is the rationale why we also have to check for
  272. * conflicting requests with local origin, and why we have to do so regardless
  273. * of whether we allowed multiple primaries.
  274. *
  275. * BTW, in case we only have one primary, the ee_hash is empty anyways, and the
  276. * second hlist_for_each_entry becomes a noop. This is even simpler than to
  277. * grab a reference on the net_conf, and check for the two_primaries flag...
  278. */
  279. static int _req_conflicts(struct drbd_request *req)
  280. {
  281. struct drbd_conf *mdev = req->mdev;
  282. const sector_t sector = req->sector;
  283. const int size = req->size;
  284. struct drbd_request *i;
  285. struct drbd_epoch_entry *e;
  286. struct hlist_node *n;
  287. struct hlist_head *slot;
  288. D_ASSERT(hlist_unhashed(&req->colision));
  289. if (!get_net_conf(mdev))
  290. return 0;
  291. /* BUG_ON */
  292. ERR_IF (mdev->tl_hash_s == 0)
  293. goto out_no_conflict;
  294. BUG_ON(mdev->tl_hash == NULL);
  295. #define OVERLAPS overlaps(i->sector, i->size, sector, size)
  296. slot = tl_hash_slot(mdev, sector);
  297. hlist_for_each_entry(i, n, slot, colision) {
  298. if (OVERLAPS) {
  299. dev_alert(DEV, "%s[%u] Concurrent local write detected! "
  300. "[DISCARD L] new: %llus +%u; "
  301. "pending: %llus +%u\n",
  302. current->comm, current->pid,
  303. (unsigned long long)sector, size,
  304. (unsigned long long)i->sector, i->size);
  305. goto out_conflict;
  306. }
  307. }
  308. if (mdev->ee_hash_s) {
  309. /* now, check for overlapping requests with remote origin */
  310. BUG_ON(mdev->ee_hash == NULL);
  311. #undef OVERLAPS
  312. #define OVERLAPS overlaps(e->sector, e->size, sector, size)
  313. slot = ee_hash_slot(mdev, sector);
  314. hlist_for_each_entry(e, n, slot, colision) {
  315. if (OVERLAPS) {
  316. dev_alert(DEV, "%s[%u] Concurrent remote write detected!"
  317. " [DISCARD L] new: %llus +%u; "
  318. "pending: %llus +%u\n",
  319. current->comm, current->pid,
  320. (unsigned long long)sector, size,
  321. (unsigned long long)e->sector, e->size);
  322. goto out_conflict;
  323. }
  324. }
  325. }
  326. #undef OVERLAPS
  327. out_no_conflict:
  328. /* this is like it should be, and what we expected.
  329. * our users do behave after all... */
  330. put_net_conf(mdev);
  331. return 0;
  332. out_conflict:
  333. put_net_conf(mdev);
  334. return 1;
  335. }
  336. /* obviously this could be coded as many single functions
  337. * instead of one huge switch,
  338. * or by putting the code directly in the respective locations
  339. * (as it has been before).
  340. *
  341. * but having it this way
  342. * enforces that it is all in this one place, where it is easier to audit,
  343. * it makes it obvious that whatever "event" "happens" to a request should
  344. * happen "atomically" within the req_lock,
  345. * and it enforces that we have to think in a very structured manner
  346. * about the "events" that may happen to a request during its life time ...
  347. */
  348. int __req_mod(struct drbd_request *req, enum drbd_req_event what,
  349. struct bio_and_error *m)
  350. {
  351. struct drbd_conf *mdev = req->mdev;
  352. int rv = 0;
  353. m->bio = NULL;
  354. switch (what) {
  355. default:
  356. dev_err(DEV, "LOGIC BUG in %s:%u\n", __FILE__ , __LINE__);
  357. break;
  358. /* does not happen...
  359. * initialization done in drbd_req_new
  360. case created:
  361. break;
  362. */
  363. case to_be_send: /* via network */
  364. /* reached via drbd_make_request_common
  365. * and from w_read_retry_remote */
  366. D_ASSERT(!(req->rq_state & RQ_NET_MASK));
  367. req->rq_state |= RQ_NET_PENDING;
  368. inc_ap_pending(mdev);
  369. break;
  370. case to_be_submitted: /* locally */
  371. /* reached via drbd_make_request_common */
  372. D_ASSERT(!(req->rq_state & RQ_LOCAL_MASK));
  373. req->rq_state |= RQ_LOCAL_PENDING;
  374. break;
  375. case completed_ok:
  376. if (bio_data_dir(req->master_bio) == WRITE)
  377. mdev->writ_cnt += req->size>>9;
  378. else
  379. mdev->read_cnt += req->size>>9;
  380. req->rq_state |= (RQ_LOCAL_COMPLETED|RQ_LOCAL_OK);
  381. req->rq_state &= ~RQ_LOCAL_PENDING;
  382. _req_may_be_done_not_susp(req, m);
  383. put_ldev(mdev);
  384. break;
  385. case write_completed_with_error:
  386. req->rq_state |= RQ_LOCAL_COMPLETED;
  387. req->rq_state &= ~RQ_LOCAL_PENDING;
  388. __drbd_chk_io_error(mdev, FALSE);
  389. _req_may_be_done_not_susp(req, m);
  390. put_ldev(mdev);
  391. break;
  392. case read_ahead_completed_with_error:
  393. /* it is legal to fail READA */
  394. req->rq_state |= RQ_LOCAL_COMPLETED;
  395. req->rq_state &= ~RQ_LOCAL_PENDING;
  396. _req_may_be_done_not_susp(req, m);
  397. put_ldev(mdev);
  398. break;
  399. case read_completed_with_error:
  400. drbd_set_out_of_sync(mdev, req->sector, req->size);
  401. req->rq_state |= RQ_LOCAL_COMPLETED;
  402. req->rq_state &= ~RQ_LOCAL_PENDING;
  403. D_ASSERT(!(req->rq_state & RQ_NET_MASK));
  404. __drbd_chk_io_error(mdev, FALSE);
  405. put_ldev(mdev);
  406. /* no point in retrying if there is no good remote data,
  407. * or we have no connection. */
  408. if (mdev->state.pdsk != D_UP_TO_DATE) {
  409. _req_may_be_done_not_susp(req, m);
  410. break;
  411. }
  412. /* _req_mod(req,to_be_send); oops, recursion... */
  413. req->rq_state |= RQ_NET_PENDING;
  414. inc_ap_pending(mdev);
  415. /* fall through: _req_mod(req,queue_for_net_read); */
  416. case queue_for_net_read:
  417. /* READ or READA, and
  418. * no local disk,
  419. * or target area marked as invalid,
  420. * or just got an io-error. */
  421. /* from drbd_make_request_common
  422. * or from bio_endio during read io-error recovery */
  423. /* so we can verify the handle in the answer packet
  424. * corresponding hlist_del is in _req_may_be_done() */
  425. hlist_add_head(&req->colision, ar_hash_slot(mdev, req->sector));
  426. set_bit(UNPLUG_REMOTE, &mdev->flags);
  427. D_ASSERT(req->rq_state & RQ_NET_PENDING);
  428. req->rq_state |= RQ_NET_QUEUED;
  429. req->w.cb = (req->rq_state & RQ_LOCAL_MASK)
  430. ? w_read_retry_remote
  431. : w_send_read_req;
  432. drbd_queue_work(&mdev->data.work, &req->w);
  433. break;
  434. case queue_for_net_write:
  435. /* assert something? */
  436. /* from drbd_make_request_common only */
  437. hlist_add_head(&req->colision, tl_hash_slot(mdev, req->sector));
  438. /* corresponding hlist_del is in _req_may_be_done() */
  439. /* NOTE
  440. * In case the req ended up on the transfer log before being
  441. * queued on the worker, it could lead to this request being
  442. * missed during cleanup after connection loss.
  443. * So we have to do both operations here,
  444. * within the same lock that protects the transfer log.
  445. *
  446. * _req_add_to_epoch(req); this has to be after the
  447. * _maybe_start_new_epoch(req); which happened in
  448. * drbd_make_request_common, because we now may set the bit
  449. * again ourselves to close the current epoch.
  450. *
  451. * Add req to the (now) current epoch (barrier). */
  452. /* otherwise we may lose an unplug, which may cause some remote
  453. * io-scheduler timeout to expire, increasing maximum latency,
  454. * hurting performance. */
  455. set_bit(UNPLUG_REMOTE, &mdev->flags);
  456. /* see drbd_make_request_common,
  457. * just after it grabs the req_lock */
  458. D_ASSERT(test_bit(CREATE_BARRIER, &mdev->flags) == 0);
  459. req->epoch = mdev->newest_tle->br_number;
  460. /* increment size of current epoch */
  461. mdev->newest_tle->n_writes++;
  462. /* queue work item to send data */
  463. D_ASSERT(req->rq_state & RQ_NET_PENDING);
  464. req->rq_state |= RQ_NET_QUEUED;
  465. req->w.cb = w_send_dblock;
  466. drbd_queue_work(&mdev->data.work, &req->w);
  467. /* close the epoch, in case it outgrew the limit */
  468. if (mdev->newest_tle->n_writes >= mdev->net_conf->max_epoch_size)
  469. queue_barrier(mdev);
  470. break;
  471. case send_canceled:
  472. /* treat it the same */
  473. case send_failed:
  474. /* real cleanup will be done from tl_clear. just update flags
  475. * so it is no longer marked as on the worker queue */
  476. req->rq_state &= ~RQ_NET_QUEUED;
  477. /* if we did it right, tl_clear should be scheduled only after
  478. * this, so this should not be necessary! */
  479. _req_may_be_done_not_susp(req, m);
  480. break;
  481. case handed_over_to_network:
  482. /* assert something? */
  483. if (bio_data_dir(req->master_bio) == WRITE)
  484. atomic_add(req->size>>9, &mdev->ap_in_flight);
  485. if (bio_data_dir(req->master_bio) == WRITE &&
  486. mdev->net_conf->wire_protocol == DRBD_PROT_A) {
  487. /* this is what is dangerous about protocol A:
  488. * pretend it was successfully written on the peer. */
  489. if (req->rq_state & RQ_NET_PENDING) {
  490. dec_ap_pending(mdev);
  491. req->rq_state &= ~RQ_NET_PENDING;
  492. req->rq_state |= RQ_NET_OK;
  493. } /* else: neg-ack was faster... */
  494. /* it is still not yet RQ_NET_DONE until the
  495. * corresponding epoch barrier got acked as well,
  496. * so we know what to dirty on connection loss */
  497. }
  498. req->rq_state &= ~RQ_NET_QUEUED;
  499. req->rq_state |= RQ_NET_SENT;
  500. /* because _drbd_send_zc_bio could sleep, and may want to
  501. * dereference the bio even after the "write_acked_by_peer" and
  502. * "completed_ok" events came in, once we return from
  503. * _drbd_send_zc_bio (drbd_send_dblock), we have to check
  504. * whether it is done already, and end it. */
  505. _req_may_be_done_not_susp(req, m);
  506. break;
  507. case read_retry_remote_canceled:
  508. req->rq_state &= ~RQ_NET_QUEUED;
  509. /* fall through, in case we raced with drbd_disconnect */
  510. case connection_lost_while_pending:
  511. /* transfer log cleanup after connection loss */
  512. /* assert something? */
  513. if (req->rq_state & RQ_NET_PENDING)
  514. dec_ap_pending(mdev);
  515. req->rq_state &= ~(RQ_NET_OK|RQ_NET_PENDING);
  516. req->rq_state |= RQ_NET_DONE;
  517. if (req->rq_state & RQ_NET_SENT && req->rq_state & RQ_WRITE)
  518. atomic_sub(req->size>>9, &mdev->ap_in_flight);
  519. /* if it is still queued, we may not complete it here.
  520. * it will be canceled soon. */
  521. if (!(req->rq_state & RQ_NET_QUEUED))
  522. _req_may_be_done(req, m); /* Allowed while state.susp */
  523. break;
  524. case write_acked_by_peer_and_sis:
  525. req->rq_state |= RQ_NET_SIS;
  526. case conflict_discarded_by_peer:
  527. /* for discarded conflicting writes of multiple primaries,
  528. * there is no need to keep anything in the tl, potential
  529. * node crashes are covered by the activity log. */
  530. if (what == conflict_discarded_by_peer)
  531. dev_alert(DEV, "Got DiscardAck packet %llus +%u!"
  532. " DRBD is not a random data generator!\n",
  533. (unsigned long long)req->sector, req->size);
  534. req->rq_state |= RQ_NET_DONE;
  535. /* fall through */
  536. case write_acked_by_peer:
  537. /* protocol C; successfully written on peer.
  538. * Nothing to do here.
  539. * We want to keep the tl in place for all protocols, to cater
  540. * for volatile write-back caches on lower level devices.
  541. *
  542. * A barrier request is expected to have forced all prior
  543. * requests onto stable storage, so completion of a barrier
  544. * request could set NET_DONE right here, and not wait for the
  545. * P_BARRIER_ACK, but that is an unnecessary optimization. */
  546. /* this makes it effectively the same as for: */
  547. case recv_acked_by_peer:
  548. /* protocol B; pretends to be successfully written on peer.
  549. * see also notes above in handed_over_to_network about
  550. * protocol != C */
  551. req->rq_state |= RQ_NET_OK;
  552. D_ASSERT(req->rq_state & RQ_NET_PENDING);
  553. dec_ap_pending(mdev);
  554. atomic_sub(req->size>>9, &mdev->ap_in_flight);
  555. req->rq_state &= ~RQ_NET_PENDING;
  556. _req_may_be_done_not_susp(req, m);
  557. break;
  558. case neg_acked:
  559. /* assert something? */
  560. if (req->rq_state & RQ_NET_PENDING) {
  561. dec_ap_pending(mdev);
  562. atomic_sub(req->size>>9, &mdev->ap_in_flight);
  563. }
  564. req->rq_state &= ~(RQ_NET_OK|RQ_NET_PENDING);
  565. req->rq_state |= RQ_NET_DONE;
  566. _req_may_be_done_not_susp(req, m);
  567. /* else: done by handed_over_to_network */
  568. break;
  569. case fail_frozen_disk_io:
  570. if (!(req->rq_state & RQ_LOCAL_COMPLETED))
  571. break;
  572. _req_may_be_done(req, m); /* Allowed while state.susp */
  573. break;
  574. case restart_frozen_disk_io:
  575. if (!(req->rq_state & RQ_LOCAL_COMPLETED))
  576. break;
  577. req->rq_state &= ~RQ_LOCAL_COMPLETED;
  578. rv = MR_READ;
  579. if (bio_data_dir(req->master_bio) == WRITE)
  580. rv = MR_WRITE;
  581. get_ldev(mdev);
  582. req->w.cb = w_restart_disk_io;
  583. drbd_queue_work(&mdev->data.work, &req->w);
  584. break;
  585. case resend:
  586. /* If RQ_NET_OK is already set, we got a P_WRITE_ACK or P_RECV_ACK
  587. before the connection loss (B&C only); only P_BARRIER_ACK was missing.
  588. Trowing them out of the TL here by pretending we got a BARRIER_ACK
  589. We ensure that the peer was not rebooted */
  590. if (!(req->rq_state & RQ_NET_OK)) {
  591. if (req->w.cb) {
  592. drbd_queue_work(&mdev->data.work, &req->w);
  593. rv = req->rq_state & RQ_WRITE ? MR_WRITE : MR_READ;
  594. }
  595. break;
  596. }
  597. /* else, fall through to barrier_acked */
  598. case barrier_acked:
  599. if (!(req->rq_state & RQ_WRITE))
  600. break;
  601. if (req->rq_state & RQ_NET_PENDING) {
  602. /* barrier came in before all requests have been acked.
  603. * this is bad, because if the connection is lost now,
  604. * we won't be able to clean them up... */
  605. dev_err(DEV, "FIXME (barrier_acked but pending)\n");
  606. list_move(&req->tl_requests, &mdev->out_of_sequence_requests);
  607. }
  608. D_ASSERT(req->rq_state & RQ_NET_SENT);
  609. req->rq_state |= RQ_NET_DONE;
  610. if (mdev->net_conf->wire_protocol == DRBD_PROT_A)
  611. atomic_sub(req->size>>9, &mdev->ap_in_flight);
  612. _req_may_be_done(req, m); /* Allowed while state.susp */
  613. break;
  614. case data_received:
  615. D_ASSERT(req->rq_state & RQ_NET_PENDING);
  616. dec_ap_pending(mdev);
  617. req->rq_state &= ~RQ_NET_PENDING;
  618. req->rq_state |= (RQ_NET_OK|RQ_NET_DONE);
  619. _req_may_be_done_not_susp(req, m);
  620. break;
  621. };
  622. return rv;
  623. }
  624. /* we may do a local read if:
  625. * - we are consistent (of course),
  626. * - or we are generally inconsistent,
  627. * BUT we are still/already IN SYNC for this area.
  628. * since size may be bigger than BM_BLOCK_SIZE,
  629. * we may need to check several bits.
  630. */
  631. static int drbd_may_do_local_read(struct drbd_conf *mdev, sector_t sector, int size)
  632. {
  633. unsigned long sbnr, ebnr;
  634. sector_t esector, nr_sectors;
  635. if (mdev->state.disk == D_UP_TO_DATE)
  636. return 1;
  637. if (mdev->state.disk >= D_OUTDATED)
  638. return 0;
  639. if (mdev->state.disk < D_INCONSISTENT)
  640. return 0;
  641. /* state.disk == D_INCONSISTENT We will have a look at the BitMap */
  642. nr_sectors = drbd_get_capacity(mdev->this_bdev);
  643. esector = sector + (size >> 9) - 1;
  644. D_ASSERT(sector < nr_sectors);
  645. D_ASSERT(esector < nr_sectors);
  646. sbnr = BM_SECT_TO_BIT(sector);
  647. ebnr = BM_SECT_TO_BIT(esector);
  648. return 0 == drbd_bm_count_bits(mdev, sbnr, ebnr);
  649. }
  650. static int drbd_make_request_common(struct drbd_conf *mdev, struct bio *bio)
  651. {
  652. const int rw = bio_rw(bio);
  653. const int size = bio->bi_size;
  654. const sector_t sector = bio->bi_sector;
  655. struct drbd_tl_epoch *b = NULL;
  656. struct drbd_request *req;
  657. int local, remote;
  658. int err = -EIO;
  659. int ret = 0;
  660. /* allocate outside of all locks; */
  661. req = drbd_req_new(mdev, bio);
  662. if (!req) {
  663. dec_ap_bio(mdev);
  664. /* only pass the error to the upper layers.
  665. * if user cannot handle io errors, that's not our business. */
  666. dev_err(DEV, "could not kmalloc() req\n");
  667. bio_endio(bio, -ENOMEM);
  668. return 0;
  669. }
  670. local = get_ldev(mdev);
  671. if (!local) {
  672. bio_put(req->private_bio); /* or we get a bio leak */
  673. req->private_bio = NULL;
  674. }
  675. if (rw == WRITE) {
  676. remote = 1;
  677. } else {
  678. /* READ || READA */
  679. if (local) {
  680. if (!drbd_may_do_local_read(mdev, sector, size)) {
  681. /* we could kick the syncer to
  682. * sync this extent asap, wait for
  683. * it, then continue locally.
  684. * Or just issue the request remotely.
  685. */
  686. local = 0;
  687. bio_put(req->private_bio);
  688. req->private_bio = NULL;
  689. put_ldev(mdev);
  690. }
  691. }
  692. remote = !local && mdev->state.pdsk >= D_UP_TO_DATE;
  693. }
  694. /* If we have a disk, but a READA request is mapped to remote,
  695. * we are R_PRIMARY, D_INCONSISTENT, SyncTarget.
  696. * Just fail that READA request right here.
  697. *
  698. * THINK: maybe fail all READA when not local?
  699. * or make this configurable...
  700. * if network is slow, READA won't do any good.
  701. */
  702. if (rw == READA && mdev->state.disk >= D_INCONSISTENT && !local) {
  703. err = -EWOULDBLOCK;
  704. goto fail_and_free_req;
  705. }
  706. /* For WRITES going to the local disk, grab a reference on the target
  707. * extent. This waits for any resync activity in the corresponding
  708. * resync extent to finish, and, if necessary, pulls in the target
  709. * extent into the activity log, which involves further disk io because
  710. * of transactional on-disk meta data updates. */
  711. if (rw == WRITE && local && !test_bit(AL_SUSPENDED, &mdev->flags)) {
  712. req->rq_state |= RQ_IN_ACT_LOG;
  713. drbd_al_begin_io(mdev, sector);
  714. }
  715. remote = remote && (mdev->state.pdsk == D_UP_TO_DATE ||
  716. (mdev->state.pdsk == D_INCONSISTENT &&
  717. mdev->state.conn >= C_CONNECTED));
  718. if (!(local || remote) && !is_susp(mdev->state)) {
  719. if (__ratelimit(&drbd_ratelimit_state))
  720. dev_err(DEV, "IO ERROR: neither local nor remote disk\n");
  721. goto fail_free_complete;
  722. }
  723. /* For WRITE request, we have to make sure that we have an
  724. * unused_spare_tle, in case we need to start a new epoch.
  725. * I try to be smart and avoid to pre-allocate always "just in case",
  726. * but there is a race between testing the bit and pointer outside the
  727. * spinlock, and grabbing the spinlock.
  728. * if we lost that race, we retry. */
  729. if (rw == WRITE && remote &&
  730. mdev->unused_spare_tle == NULL &&
  731. test_bit(CREATE_BARRIER, &mdev->flags)) {
  732. allocate_barrier:
  733. b = kmalloc(sizeof(struct drbd_tl_epoch), GFP_NOIO);
  734. if (!b) {
  735. dev_err(DEV, "Failed to alloc barrier.\n");
  736. err = -ENOMEM;
  737. goto fail_free_complete;
  738. }
  739. }
  740. /* GOOD, everything prepared, grab the spin_lock */
  741. spin_lock_irq(&mdev->req_lock);
  742. if (is_susp(mdev->state)) {
  743. /* If we got suspended, use the retry mechanism of
  744. generic_make_request() to restart processing of this
  745. bio. In the next call to drbd_make_request_26
  746. we sleep in inc_ap_bio() */
  747. ret = 1;
  748. spin_unlock_irq(&mdev->req_lock);
  749. goto fail_free_complete;
  750. }
  751. if (remote) {
  752. remote = (mdev->state.pdsk == D_UP_TO_DATE ||
  753. (mdev->state.pdsk == D_INCONSISTENT &&
  754. mdev->state.conn >= C_CONNECTED));
  755. if (!remote)
  756. dev_warn(DEV, "lost connection while grabbing the req_lock!\n");
  757. if (!(local || remote)) {
  758. dev_err(DEV, "IO ERROR: neither local nor remote disk\n");
  759. spin_unlock_irq(&mdev->req_lock);
  760. goto fail_free_complete;
  761. }
  762. }
  763. if (b && mdev->unused_spare_tle == NULL) {
  764. mdev->unused_spare_tle = b;
  765. b = NULL;
  766. }
  767. if (rw == WRITE && remote &&
  768. mdev->unused_spare_tle == NULL &&
  769. test_bit(CREATE_BARRIER, &mdev->flags)) {
  770. /* someone closed the current epoch
  771. * while we were grabbing the spinlock */
  772. spin_unlock_irq(&mdev->req_lock);
  773. goto allocate_barrier;
  774. }
  775. /* Update disk stats */
  776. _drbd_start_io_acct(mdev, req, bio);
  777. /* _maybe_start_new_epoch(mdev);
  778. * If we need to generate a write barrier packet, we have to add the
  779. * new epoch (barrier) object, and queue the barrier packet for sending,
  780. * and queue the req's data after it _within the same lock_, otherwise
  781. * we have race conditions were the reorder domains could be mixed up.
  782. *
  783. * Even read requests may start a new epoch and queue the corresponding
  784. * barrier packet. To get the write ordering right, we only have to
  785. * make sure that, if this is a write request and it triggered a
  786. * barrier packet, this request is queued within the same spinlock. */
  787. if (remote && mdev->unused_spare_tle &&
  788. test_and_clear_bit(CREATE_BARRIER, &mdev->flags)) {
  789. _tl_add_barrier(mdev, mdev->unused_spare_tle);
  790. mdev->unused_spare_tle = NULL;
  791. } else {
  792. D_ASSERT(!(remote && rw == WRITE &&
  793. test_bit(CREATE_BARRIER, &mdev->flags)));
  794. }
  795. /* NOTE
  796. * Actually, 'local' may be wrong here already, since we may have failed
  797. * to write to the meta data, and may become wrong anytime because of
  798. * local io-error for some other request, which would lead to us
  799. * "detaching" the local disk.
  800. *
  801. * 'remote' may become wrong any time because the network could fail.
  802. *
  803. * This is a harmless race condition, though, since it is handled
  804. * correctly at the appropriate places; so it just defers the failure
  805. * of the respective operation.
  806. */
  807. /* mark them early for readability.
  808. * this just sets some state flags. */
  809. if (remote)
  810. _req_mod(req, to_be_send);
  811. if (local)
  812. _req_mod(req, to_be_submitted);
  813. /* check this request on the collision detection hash tables.
  814. * if we have a conflict, just complete it here.
  815. * THINK do we want to check reads, too? (I don't think so...) */
  816. if (rw == WRITE && _req_conflicts(req))
  817. goto fail_conflicting;
  818. list_add_tail(&req->tl_requests, &mdev->newest_tle->requests);
  819. /* NOTE remote first: to get the concurrent write detection right,
  820. * we must register the request before start of local IO. */
  821. if (remote) {
  822. /* either WRITE and C_CONNECTED,
  823. * or READ, and no local disk,
  824. * or READ, but not in sync.
  825. */
  826. _req_mod(req, (rw == WRITE)
  827. ? queue_for_net_write
  828. : queue_for_net_read);
  829. }
  830. if (remote && mdev->net_conf->on_congestion != OC_BLOCK) {
  831. int congested = 0;
  832. if (mdev->net_conf->cong_fill &&
  833. atomic_read(&mdev->ap_in_flight) >= mdev->net_conf->cong_fill) {
  834. dev_info(DEV, "Congestion-fill threshold reached\n");
  835. congested = 1;
  836. }
  837. if (mdev->act_log->used >= mdev->net_conf->cong_extents) {
  838. dev_info(DEV, "Congestion-extents threshold reached\n");
  839. congested = 1;
  840. }
  841. if (congested) {
  842. if (mdev->net_conf->on_congestion == OC_PULL_AHEAD)
  843. _drbd_set_state(_NS(mdev, conn, C_AHEAD), 0, NULL);
  844. else /*mdev->net_conf->on_congestion == OC_DISCONNECT */
  845. _drbd_set_state(_NS(mdev, conn, C_DISCONNECTING), 0, NULL);
  846. }
  847. }
  848. spin_unlock_irq(&mdev->req_lock);
  849. kfree(b); /* if someone else has beaten us to it... */
  850. if (local) {
  851. req->private_bio->bi_bdev = mdev->ldev->backing_bdev;
  852. /* State may have changed since we grabbed our reference on the
  853. * mdev->ldev member. Double check, and short-circuit to endio.
  854. * In case the last activity log transaction failed to get on
  855. * stable storage, and this is a WRITE, we may not even submit
  856. * this bio. */
  857. if (get_ldev(mdev)) {
  858. if (FAULT_ACTIVE(mdev, rw == WRITE ? DRBD_FAULT_DT_WR
  859. : rw == READ ? DRBD_FAULT_DT_RD
  860. : DRBD_FAULT_DT_RA))
  861. bio_endio(req->private_bio, -EIO);
  862. else
  863. generic_make_request(req->private_bio);
  864. put_ldev(mdev);
  865. } else
  866. bio_endio(req->private_bio, -EIO);
  867. }
  868. return 0;
  869. fail_conflicting:
  870. /* this is a conflicting request.
  871. * even though it may have been only _partially_
  872. * overlapping with one of the currently pending requests,
  873. * without even submitting or sending it, we will
  874. * pretend that it was successfully served right now.
  875. */
  876. _drbd_end_io_acct(mdev, req);
  877. spin_unlock_irq(&mdev->req_lock);
  878. if (remote)
  879. dec_ap_pending(mdev);
  880. /* THINK: do we want to fail it (-EIO), or pretend success?
  881. * this pretends success. */
  882. err = 0;
  883. fail_free_complete:
  884. if (rw == WRITE && local)
  885. drbd_al_complete_io(mdev, sector);
  886. fail_and_free_req:
  887. if (local) {
  888. bio_put(req->private_bio);
  889. req->private_bio = NULL;
  890. put_ldev(mdev);
  891. }
  892. if (!ret)
  893. bio_endio(bio, err);
  894. drbd_req_free(req);
  895. dec_ap_bio(mdev);
  896. kfree(b);
  897. return ret;
  898. }
  899. /* helper function for drbd_make_request
  900. * if we can determine just by the mdev (state) that this request will fail,
  901. * return 1
  902. * otherwise return 0
  903. */
  904. static int drbd_fail_request_early(struct drbd_conf *mdev, int is_write)
  905. {
  906. if (mdev->state.role != R_PRIMARY &&
  907. (!allow_oos || is_write)) {
  908. if (__ratelimit(&drbd_ratelimit_state)) {
  909. dev_err(DEV, "Process %s[%u] tried to %s; "
  910. "since we are not in Primary state, "
  911. "we cannot allow this\n",
  912. current->comm, current->pid,
  913. is_write ? "WRITE" : "READ");
  914. }
  915. return 1;
  916. }
  917. return 0;
  918. }
  919. int drbd_make_request_26(struct request_queue *q, struct bio *bio)
  920. {
  921. unsigned int s_enr, e_enr;
  922. struct drbd_conf *mdev = (struct drbd_conf *) q->queuedata;
  923. if (drbd_fail_request_early(mdev, bio_data_dir(bio) & WRITE)) {
  924. bio_endio(bio, -EPERM);
  925. return 0;
  926. }
  927. /*
  928. * what we "blindly" assume:
  929. */
  930. D_ASSERT(bio->bi_size > 0);
  931. D_ASSERT((bio->bi_size & 0x1ff) == 0);
  932. D_ASSERT(bio->bi_idx == 0);
  933. /* to make some things easier, force alignment of requests within the
  934. * granularity of our hash tables */
  935. s_enr = bio->bi_sector >> HT_SHIFT;
  936. e_enr = (bio->bi_sector+(bio->bi_size>>9)-1) >> HT_SHIFT;
  937. if (likely(s_enr == e_enr)) {
  938. inc_ap_bio(mdev, 1);
  939. return drbd_make_request_common(mdev, bio);
  940. }
  941. /* can this bio be split generically?
  942. * Maybe add our own split-arbitrary-bios function. */
  943. if (bio->bi_vcnt != 1 || bio->bi_idx != 0 || bio->bi_size > DRBD_MAX_BIO_SIZE) {
  944. /* rather error out here than BUG in bio_split */
  945. dev_err(DEV, "bio would need to, but cannot, be split: "
  946. "(vcnt=%u,idx=%u,size=%u,sector=%llu)\n",
  947. bio->bi_vcnt, bio->bi_idx, bio->bi_size,
  948. (unsigned long long)bio->bi_sector);
  949. bio_endio(bio, -EINVAL);
  950. } else {
  951. /* This bio crosses some boundary, so we have to split it. */
  952. struct bio_pair *bp;
  953. /* works for the "do not cross hash slot boundaries" case
  954. * e.g. sector 262269, size 4096
  955. * s_enr = 262269 >> 6 = 4097
  956. * e_enr = (262269+8-1) >> 6 = 4098
  957. * HT_SHIFT = 6
  958. * sps = 64, mask = 63
  959. * first_sectors = 64 - (262269 & 63) = 3
  960. */
  961. const sector_t sect = bio->bi_sector;
  962. const int sps = 1 << HT_SHIFT; /* sectors per slot */
  963. const int mask = sps - 1;
  964. const sector_t first_sectors = sps - (sect & mask);
  965. bp = bio_split(bio,
  966. #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,28)
  967. bio_split_pool,
  968. #endif
  969. first_sectors);
  970. /* we need to get a "reference count" (ap_bio_cnt)
  971. * to avoid races with the disconnect/reconnect/suspend code.
  972. * In case we need to split the bio here, we need to get three references
  973. * atomically, otherwise we might deadlock when trying to submit the
  974. * second one! */
  975. inc_ap_bio(mdev, 3);
  976. D_ASSERT(e_enr == s_enr + 1);
  977. while (drbd_make_request_common(mdev, &bp->bio1))
  978. inc_ap_bio(mdev, 1);
  979. while (drbd_make_request_common(mdev, &bp->bio2))
  980. inc_ap_bio(mdev, 1);
  981. dec_ap_bio(mdev);
  982. bio_pair_release(bp);
  983. }
  984. return 0;
  985. }
  986. /* This is called by bio_add_page(). With this function we reduce
  987. * the number of BIOs that span over multiple DRBD_MAX_BIO_SIZEs
  988. * units (was AL_EXTENTs).
  989. *
  990. * we do the calculation within the lower 32bit of the byte offsets,
  991. * since we don't care for actual offset, but only check whether it
  992. * would cross "activity log extent" boundaries.
  993. *
  994. * As long as the BIO is empty we have to allow at least one bvec,
  995. * regardless of size and offset. so the resulting bio may still
  996. * cross extent boundaries. those are dealt with (bio_split) in
  997. * drbd_make_request_26.
  998. */
  999. int drbd_merge_bvec(struct request_queue *q, struct bvec_merge_data *bvm, struct bio_vec *bvec)
  1000. {
  1001. struct drbd_conf *mdev = (struct drbd_conf *) q->queuedata;
  1002. unsigned int bio_offset =
  1003. (unsigned int)bvm->bi_sector << 9; /* 32 bit */
  1004. unsigned int bio_size = bvm->bi_size;
  1005. int limit, backing_limit;
  1006. limit = DRBD_MAX_BIO_SIZE
  1007. - ((bio_offset & (DRBD_MAX_BIO_SIZE-1)) + bio_size);
  1008. if (limit < 0)
  1009. limit = 0;
  1010. if (bio_size == 0) {
  1011. if (limit <= bvec->bv_len)
  1012. limit = bvec->bv_len;
  1013. } else if (limit && get_ldev(mdev)) {
  1014. struct request_queue * const b =
  1015. mdev->ldev->backing_bdev->bd_disk->queue;
  1016. if (b->merge_bvec_fn) {
  1017. backing_limit = b->merge_bvec_fn(b, bvm, bvec);
  1018. limit = min(limit, backing_limit);
  1019. }
  1020. put_ldev(mdev);
  1021. }
  1022. return limit;
  1023. }