drbd_req.c 38 KB

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