drbd_req.c 36 KB

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