drbd_req.c 39 KB

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