drbd_req.c 38 KB

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