drbd_req.c 37 KB

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