xfs_buf_item.c 30 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061
  1. /*
  2. * Copyright (c) 2000-2005 Silicon Graphics, Inc.
  3. * All Rights Reserved.
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public License as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it would be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write the Free Software Foundation,
  16. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #include "xfs.h"
  19. #include "xfs_fs.h"
  20. #include "xfs_types.h"
  21. #include "xfs_bit.h"
  22. #include "xfs_log.h"
  23. #include "xfs_inum.h"
  24. #include "xfs_trans.h"
  25. #include "xfs_sb.h"
  26. #include "xfs_ag.h"
  27. #include "xfs_mount.h"
  28. #include "xfs_buf_item.h"
  29. #include "xfs_trans_priv.h"
  30. #include "xfs_error.h"
  31. #include "xfs_trace.h"
  32. kmem_zone_t *xfs_buf_item_zone;
  33. static inline struct xfs_buf_log_item *BUF_ITEM(struct xfs_log_item *lip)
  34. {
  35. return container_of(lip, struct xfs_buf_log_item, bli_item);
  36. }
  37. #ifdef XFS_TRANS_DEBUG
  38. /*
  39. * This function uses an alternate strategy for tracking the bytes
  40. * that the user requests to be logged. This can then be used
  41. * in conjunction with the bli_orig array in the buf log item to
  42. * catch bugs in our callers' code.
  43. *
  44. * We also double check the bits set in xfs_buf_item_log using a
  45. * simple algorithm to check that every byte is accounted for.
  46. */
  47. STATIC void
  48. xfs_buf_item_log_debug(
  49. xfs_buf_log_item_t *bip,
  50. uint first,
  51. uint last)
  52. {
  53. uint x;
  54. uint byte;
  55. uint nbytes;
  56. uint chunk_num;
  57. uint word_num;
  58. uint bit_num;
  59. uint bit_set;
  60. uint *wordp;
  61. ASSERT(bip->bli_logged != NULL);
  62. byte = first;
  63. nbytes = last - first + 1;
  64. bfset(bip->bli_logged, first, nbytes);
  65. for (x = 0; x < nbytes; x++) {
  66. chunk_num = byte >> XFS_BLF_SHIFT;
  67. word_num = chunk_num >> BIT_TO_WORD_SHIFT;
  68. bit_num = chunk_num & (NBWORD - 1);
  69. wordp = &(bip->bli_format.blf_data_map[word_num]);
  70. bit_set = *wordp & (1 << bit_num);
  71. ASSERT(bit_set);
  72. byte++;
  73. }
  74. }
  75. /*
  76. * This function is called when we flush something into a buffer without
  77. * logging it. This happens for things like inodes which are logged
  78. * separately from the buffer.
  79. */
  80. void
  81. xfs_buf_item_flush_log_debug(
  82. xfs_buf_t *bp,
  83. uint first,
  84. uint last)
  85. {
  86. xfs_buf_log_item_t *bip;
  87. uint nbytes;
  88. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t*);
  89. if ((bip == NULL) || (bip->bli_item.li_type != XFS_LI_BUF)) {
  90. return;
  91. }
  92. ASSERT(bip->bli_logged != NULL);
  93. nbytes = last - first + 1;
  94. bfset(bip->bli_logged, first, nbytes);
  95. }
  96. /*
  97. * This function is called to verify that our callers have logged
  98. * all the bytes that they changed.
  99. *
  100. * It does this by comparing the original copy of the buffer stored in
  101. * the buf log item's bli_orig array to the current copy of the buffer
  102. * and ensuring that all bytes which mismatch are set in the bli_logged
  103. * array of the buf log item.
  104. */
  105. STATIC void
  106. xfs_buf_item_log_check(
  107. xfs_buf_log_item_t *bip)
  108. {
  109. char *orig;
  110. char *buffer;
  111. int x;
  112. xfs_buf_t *bp;
  113. ASSERT(bip->bli_orig != NULL);
  114. ASSERT(bip->bli_logged != NULL);
  115. bp = bip->bli_buf;
  116. ASSERT(XFS_BUF_COUNT(bp) > 0);
  117. ASSERT(XFS_BUF_PTR(bp) != NULL);
  118. orig = bip->bli_orig;
  119. buffer = XFS_BUF_PTR(bp);
  120. for (x = 0; x < XFS_BUF_COUNT(bp); x++) {
  121. if (orig[x] != buffer[x] && !btst(bip->bli_logged, x))
  122. cmn_err(CE_PANIC,
  123. "xfs_buf_item_log_check bip %x buffer %x orig %x index %d",
  124. bip, bp, orig, x);
  125. }
  126. }
  127. #else
  128. #define xfs_buf_item_log_debug(x,y,z)
  129. #define xfs_buf_item_log_check(x)
  130. #endif
  131. STATIC void xfs_buf_do_callbacks(struct xfs_buf *bp);
  132. /*
  133. * This returns the number of log iovecs needed to log the
  134. * given buf log item.
  135. *
  136. * It calculates this as 1 iovec for the buf log format structure
  137. * and 1 for each stretch of non-contiguous chunks to be logged.
  138. * Contiguous chunks are logged in a single iovec.
  139. *
  140. * If the XFS_BLI_STALE flag has been set, then log nothing.
  141. */
  142. STATIC uint
  143. xfs_buf_item_size(
  144. struct xfs_log_item *lip)
  145. {
  146. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  147. struct xfs_buf *bp = bip->bli_buf;
  148. uint nvecs;
  149. int next_bit;
  150. int last_bit;
  151. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  152. if (bip->bli_flags & XFS_BLI_STALE) {
  153. /*
  154. * The buffer is stale, so all we need to log
  155. * is the buf log format structure with the
  156. * cancel flag in it.
  157. */
  158. trace_xfs_buf_item_size_stale(bip);
  159. ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
  160. return 1;
  161. }
  162. ASSERT(bip->bli_flags & XFS_BLI_LOGGED);
  163. nvecs = 1;
  164. last_bit = xfs_next_bit(bip->bli_format.blf_data_map,
  165. bip->bli_format.blf_map_size, 0);
  166. ASSERT(last_bit != -1);
  167. nvecs++;
  168. while (last_bit != -1) {
  169. /*
  170. * This takes the bit number to start looking from and
  171. * returns the next set bit from there. It returns -1
  172. * if there are no more bits set or the start bit is
  173. * beyond the end of the bitmap.
  174. */
  175. next_bit = xfs_next_bit(bip->bli_format.blf_data_map,
  176. bip->bli_format.blf_map_size,
  177. last_bit + 1);
  178. /*
  179. * If we run out of bits, leave the loop,
  180. * else if we find a new set of bits bump the number of vecs,
  181. * else keep scanning the current set of bits.
  182. */
  183. if (next_bit == -1) {
  184. last_bit = -1;
  185. } else if (next_bit != last_bit + 1) {
  186. last_bit = next_bit;
  187. nvecs++;
  188. } else if (xfs_buf_offset(bp, next_bit * XFS_BLF_CHUNK) !=
  189. (xfs_buf_offset(bp, last_bit * XFS_BLF_CHUNK) +
  190. XFS_BLF_CHUNK)) {
  191. last_bit = next_bit;
  192. nvecs++;
  193. } else {
  194. last_bit++;
  195. }
  196. }
  197. trace_xfs_buf_item_size(bip);
  198. return nvecs;
  199. }
  200. /*
  201. * This is called to fill in the vector of log iovecs for the
  202. * given log buf item. It fills the first entry with a buf log
  203. * format structure, and the rest point to contiguous chunks
  204. * within the buffer.
  205. */
  206. STATIC void
  207. xfs_buf_item_format(
  208. struct xfs_log_item *lip,
  209. struct xfs_log_iovec *vecp)
  210. {
  211. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  212. struct xfs_buf *bp = bip->bli_buf;
  213. uint base_size;
  214. uint nvecs;
  215. int first_bit;
  216. int last_bit;
  217. int next_bit;
  218. uint nbits;
  219. uint buffer_offset;
  220. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  221. ASSERT((bip->bli_flags & XFS_BLI_LOGGED) ||
  222. (bip->bli_flags & XFS_BLI_STALE));
  223. /*
  224. * The size of the base structure is the size of the
  225. * declared structure plus the space for the extra words
  226. * of the bitmap. We subtract one from the map size, because
  227. * the first element of the bitmap is accounted for in the
  228. * size of the base structure.
  229. */
  230. base_size =
  231. (uint)(sizeof(xfs_buf_log_format_t) +
  232. ((bip->bli_format.blf_map_size - 1) * sizeof(uint)));
  233. vecp->i_addr = &bip->bli_format;
  234. vecp->i_len = base_size;
  235. vecp->i_type = XLOG_REG_TYPE_BFORMAT;
  236. vecp++;
  237. nvecs = 1;
  238. /*
  239. * If it is an inode buffer, transfer the in-memory state to the
  240. * format flags and clear the in-memory state. We do not transfer
  241. * this state if the inode buffer allocation has not yet been committed
  242. * to the log as setting the XFS_BLI_INODE_BUF flag will prevent
  243. * correct replay of the inode allocation.
  244. */
  245. if (bip->bli_flags & XFS_BLI_INODE_BUF) {
  246. if (!((bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF) &&
  247. xfs_log_item_in_current_chkpt(lip)))
  248. bip->bli_format.blf_flags |= XFS_BLF_INODE_BUF;
  249. bip->bli_flags &= ~XFS_BLI_INODE_BUF;
  250. }
  251. if (bip->bli_flags & XFS_BLI_STALE) {
  252. /*
  253. * The buffer is stale, so all we need to log
  254. * is the buf log format structure with the
  255. * cancel flag in it.
  256. */
  257. trace_xfs_buf_item_format_stale(bip);
  258. ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
  259. bip->bli_format.blf_size = nvecs;
  260. return;
  261. }
  262. /*
  263. * Fill in an iovec for each set of contiguous chunks.
  264. */
  265. first_bit = xfs_next_bit(bip->bli_format.blf_data_map,
  266. bip->bli_format.blf_map_size, 0);
  267. ASSERT(first_bit != -1);
  268. last_bit = first_bit;
  269. nbits = 1;
  270. for (;;) {
  271. /*
  272. * This takes the bit number to start looking from and
  273. * returns the next set bit from there. It returns -1
  274. * if there are no more bits set or the start bit is
  275. * beyond the end of the bitmap.
  276. */
  277. next_bit = xfs_next_bit(bip->bli_format.blf_data_map,
  278. bip->bli_format.blf_map_size,
  279. (uint)last_bit + 1);
  280. /*
  281. * If we run out of bits fill in the last iovec and get
  282. * out of the loop.
  283. * Else if we start a new set of bits then fill in the
  284. * iovec for the series we were looking at and start
  285. * counting the bits in the new one.
  286. * Else we're still in the same set of bits so just
  287. * keep counting and scanning.
  288. */
  289. if (next_bit == -1) {
  290. buffer_offset = first_bit * XFS_BLF_CHUNK;
  291. vecp->i_addr = xfs_buf_offset(bp, buffer_offset);
  292. vecp->i_len = nbits * XFS_BLF_CHUNK;
  293. vecp->i_type = XLOG_REG_TYPE_BCHUNK;
  294. nvecs++;
  295. break;
  296. } else if (next_bit != last_bit + 1) {
  297. buffer_offset = first_bit * XFS_BLF_CHUNK;
  298. vecp->i_addr = xfs_buf_offset(bp, buffer_offset);
  299. vecp->i_len = nbits * XFS_BLF_CHUNK;
  300. vecp->i_type = XLOG_REG_TYPE_BCHUNK;
  301. nvecs++;
  302. vecp++;
  303. first_bit = next_bit;
  304. last_bit = next_bit;
  305. nbits = 1;
  306. } else if (xfs_buf_offset(bp, next_bit << XFS_BLF_SHIFT) !=
  307. (xfs_buf_offset(bp, last_bit << XFS_BLF_SHIFT) +
  308. XFS_BLF_CHUNK)) {
  309. buffer_offset = first_bit * XFS_BLF_CHUNK;
  310. vecp->i_addr = xfs_buf_offset(bp, buffer_offset);
  311. vecp->i_len = nbits * XFS_BLF_CHUNK;
  312. vecp->i_type = XLOG_REG_TYPE_BCHUNK;
  313. /* You would think we need to bump the nvecs here too, but we do not
  314. * this number is used by recovery, and it gets confused by the boundary
  315. * split here
  316. * nvecs++;
  317. */
  318. vecp++;
  319. first_bit = next_bit;
  320. last_bit = next_bit;
  321. nbits = 1;
  322. } else {
  323. last_bit++;
  324. nbits++;
  325. }
  326. }
  327. bip->bli_format.blf_size = nvecs;
  328. /*
  329. * Check to make sure everything is consistent.
  330. */
  331. trace_xfs_buf_item_format(bip);
  332. xfs_buf_item_log_check(bip);
  333. }
  334. /*
  335. * This is called to pin the buffer associated with the buf log item in memory
  336. * so it cannot be written out.
  337. *
  338. * We also always take a reference to the buffer log item here so that the bli
  339. * is held while the item is pinned in memory. This means that we can
  340. * unconditionally drop the reference count a transaction holds when the
  341. * transaction is completed.
  342. */
  343. STATIC void
  344. xfs_buf_item_pin(
  345. struct xfs_log_item *lip)
  346. {
  347. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  348. ASSERT(XFS_BUF_ISBUSY(bip->bli_buf));
  349. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  350. ASSERT((bip->bli_flags & XFS_BLI_LOGGED) ||
  351. (bip->bli_flags & XFS_BLI_STALE));
  352. trace_xfs_buf_item_pin(bip);
  353. atomic_inc(&bip->bli_refcount);
  354. atomic_inc(&bip->bli_buf->b_pin_count);
  355. }
  356. /*
  357. * This is called to unpin the buffer associated with the buf log
  358. * item which was previously pinned with a call to xfs_buf_item_pin().
  359. *
  360. * Also drop the reference to the buf item for the current transaction.
  361. * If the XFS_BLI_STALE flag is set and we are the last reference,
  362. * then free up the buf log item and unlock the buffer.
  363. *
  364. * If the remove flag is set we are called from uncommit in the
  365. * forced-shutdown path. If that is true and the reference count on
  366. * the log item is going to drop to zero we need to free the item's
  367. * descriptor in the transaction.
  368. */
  369. STATIC void
  370. xfs_buf_item_unpin(
  371. struct xfs_log_item *lip,
  372. int remove)
  373. {
  374. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  375. xfs_buf_t *bp = bip->bli_buf;
  376. struct xfs_ail *ailp = lip->li_ailp;
  377. int stale = bip->bli_flags & XFS_BLI_STALE;
  378. int freed;
  379. ASSERT(XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *) == bip);
  380. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  381. trace_xfs_buf_item_unpin(bip);
  382. freed = atomic_dec_and_test(&bip->bli_refcount);
  383. if (atomic_dec_and_test(&bp->b_pin_count))
  384. wake_up_all(&bp->b_waiters);
  385. if (freed && stale) {
  386. ASSERT(bip->bli_flags & XFS_BLI_STALE);
  387. ASSERT(XFS_BUF_VALUSEMA(bp) <= 0);
  388. ASSERT(!(XFS_BUF_ISDELAYWRITE(bp)));
  389. ASSERT(XFS_BUF_ISSTALE(bp));
  390. ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
  391. trace_xfs_buf_item_unpin_stale(bip);
  392. if (remove) {
  393. /*
  394. * We have to remove the log item from the transaction
  395. * as we are about to release our reference to the
  396. * buffer. If we don't, the unlock that occurs later
  397. * in xfs_trans_uncommit() will ry to reference the
  398. * buffer which we no longer have a hold on.
  399. */
  400. xfs_trans_del_item(lip);
  401. /*
  402. * Since the transaction no longer refers to the buffer,
  403. * the buffer should no longer refer to the transaction.
  404. */
  405. XFS_BUF_SET_FSPRIVATE2(bp, NULL);
  406. }
  407. /*
  408. * If we get called here because of an IO error, we may
  409. * or may not have the item on the AIL. xfs_trans_ail_delete()
  410. * will take care of that situation.
  411. * xfs_trans_ail_delete() drops the AIL lock.
  412. */
  413. if (bip->bli_flags & XFS_BLI_STALE_INODE) {
  414. xfs_buf_do_callbacks(bp);
  415. XFS_BUF_SET_FSPRIVATE(bp, NULL);
  416. XFS_BUF_CLR_IODONE_FUNC(bp);
  417. } else {
  418. spin_lock(&ailp->xa_lock);
  419. xfs_trans_ail_delete(ailp, (xfs_log_item_t *)bip);
  420. xfs_buf_item_relse(bp);
  421. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) == NULL);
  422. }
  423. xfs_buf_relse(bp);
  424. }
  425. }
  426. /*
  427. * This is called to attempt to lock the buffer associated with this
  428. * buf log item. Don't sleep on the buffer lock. If we can't get
  429. * the lock right away, return 0. If we can get the lock, take a
  430. * reference to the buffer. If this is a delayed write buffer that
  431. * needs AIL help to be written back, invoke the pushbuf routine
  432. * rather than the normal success path.
  433. */
  434. STATIC uint
  435. xfs_buf_item_trylock(
  436. struct xfs_log_item *lip)
  437. {
  438. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  439. struct xfs_buf *bp = bip->bli_buf;
  440. if (XFS_BUF_ISPINNED(bp))
  441. return XFS_ITEM_PINNED;
  442. if (!XFS_BUF_CPSEMA(bp))
  443. return XFS_ITEM_LOCKED;
  444. /* take a reference to the buffer. */
  445. XFS_BUF_HOLD(bp);
  446. ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
  447. trace_xfs_buf_item_trylock(bip);
  448. if (XFS_BUF_ISDELAYWRITE(bp))
  449. return XFS_ITEM_PUSHBUF;
  450. return XFS_ITEM_SUCCESS;
  451. }
  452. /*
  453. * Release the buffer associated with the buf log item. If there is no dirty
  454. * logged data associated with the buffer recorded in the buf log item, then
  455. * free the buf log item and remove the reference to it in the buffer.
  456. *
  457. * This call ignores the recursion count. It is only called when the buffer
  458. * should REALLY be unlocked, regardless of the recursion count.
  459. *
  460. * We unconditionally drop the transaction's reference to the log item. If the
  461. * item was logged, then another reference was taken when it was pinned, so we
  462. * can safely drop the transaction reference now. This also allows us to avoid
  463. * potential races with the unpin code freeing the bli by not referencing the
  464. * bli after we've dropped the reference count.
  465. *
  466. * If the XFS_BLI_HOLD flag is set in the buf log item, then free the log item
  467. * if necessary but do not unlock the buffer. This is for support of
  468. * xfs_trans_bhold(). Make sure the XFS_BLI_HOLD field is cleared if we don't
  469. * free the item.
  470. */
  471. STATIC void
  472. xfs_buf_item_unlock(
  473. struct xfs_log_item *lip)
  474. {
  475. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  476. struct xfs_buf *bp = bip->bli_buf;
  477. int aborted;
  478. uint hold;
  479. /* Clear the buffer's association with this transaction. */
  480. XFS_BUF_SET_FSPRIVATE2(bp, NULL);
  481. /*
  482. * If this is a transaction abort, don't return early. Instead, allow
  483. * the brelse to happen. Normally it would be done for stale
  484. * (cancelled) buffers at unpin time, but we'll never go through the
  485. * pin/unpin cycle if we abort inside commit.
  486. */
  487. aborted = (lip->li_flags & XFS_LI_ABORTED) != 0;
  488. /*
  489. * Before possibly freeing the buf item, determine if we should
  490. * release the buffer at the end of this routine.
  491. */
  492. hold = bip->bli_flags & XFS_BLI_HOLD;
  493. /* Clear the per transaction state. */
  494. bip->bli_flags &= ~(XFS_BLI_LOGGED | XFS_BLI_HOLD);
  495. /*
  496. * If the buf item is marked stale, then don't do anything. We'll
  497. * unlock the buffer and free the buf item when the buffer is unpinned
  498. * for the last time.
  499. */
  500. if (bip->bli_flags & XFS_BLI_STALE) {
  501. trace_xfs_buf_item_unlock_stale(bip);
  502. ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
  503. if (!aborted) {
  504. atomic_dec(&bip->bli_refcount);
  505. return;
  506. }
  507. }
  508. trace_xfs_buf_item_unlock(bip);
  509. /*
  510. * If the buf item isn't tracking any data, free it, otherwise drop the
  511. * reference we hold to it.
  512. */
  513. if (xfs_bitmap_empty(bip->bli_format.blf_data_map,
  514. bip->bli_format.blf_map_size))
  515. xfs_buf_item_relse(bp);
  516. else
  517. atomic_dec(&bip->bli_refcount);
  518. if (!hold)
  519. xfs_buf_relse(bp);
  520. }
  521. /*
  522. * This is called to find out where the oldest active copy of the
  523. * buf log item in the on disk log resides now that the last log
  524. * write of it completed at the given lsn.
  525. * We always re-log all the dirty data in a buffer, so usually the
  526. * latest copy in the on disk log is the only one that matters. For
  527. * those cases we simply return the given lsn.
  528. *
  529. * The one exception to this is for buffers full of newly allocated
  530. * inodes. These buffers are only relogged with the XFS_BLI_INODE_BUF
  531. * flag set, indicating that only the di_next_unlinked fields from the
  532. * inodes in the buffers will be replayed during recovery. If the
  533. * original newly allocated inode images have not yet been flushed
  534. * when the buffer is so relogged, then we need to make sure that we
  535. * keep the old images in the 'active' portion of the log. We do this
  536. * by returning the original lsn of that transaction here rather than
  537. * the current one.
  538. */
  539. STATIC xfs_lsn_t
  540. xfs_buf_item_committed(
  541. struct xfs_log_item *lip,
  542. xfs_lsn_t lsn)
  543. {
  544. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  545. trace_xfs_buf_item_committed(bip);
  546. if ((bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF) && lip->li_lsn != 0)
  547. return lip->li_lsn;
  548. return lsn;
  549. }
  550. /*
  551. * The buffer is locked, but is not a delayed write buffer. This happens
  552. * if we race with IO completion and hence we don't want to try to write it
  553. * again. Just release the buffer.
  554. */
  555. STATIC void
  556. xfs_buf_item_push(
  557. struct xfs_log_item *lip)
  558. {
  559. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  560. struct xfs_buf *bp = bip->bli_buf;
  561. ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
  562. ASSERT(!XFS_BUF_ISDELAYWRITE(bp));
  563. trace_xfs_buf_item_push(bip);
  564. xfs_buf_relse(bp);
  565. }
  566. /*
  567. * The buffer is locked and is a delayed write buffer. Promote the buffer
  568. * in the delayed write queue as the caller knows that they must invoke
  569. * the xfsbufd to get this buffer written. We have to unlock the buffer
  570. * to allow the xfsbufd to write it, too.
  571. */
  572. STATIC void
  573. xfs_buf_item_pushbuf(
  574. struct xfs_log_item *lip)
  575. {
  576. struct xfs_buf_log_item *bip = BUF_ITEM(lip);
  577. struct xfs_buf *bp = bip->bli_buf;
  578. ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
  579. ASSERT(XFS_BUF_ISDELAYWRITE(bp));
  580. trace_xfs_buf_item_pushbuf(bip);
  581. xfs_buf_delwri_promote(bp);
  582. xfs_buf_relse(bp);
  583. }
  584. STATIC void
  585. xfs_buf_item_committing(
  586. struct xfs_log_item *lip,
  587. xfs_lsn_t commit_lsn)
  588. {
  589. }
  590. /*
  591. * This is the ops vector shared by all buf log items.
  592. */
  593. static struct xfs_item_ops xfs_buf_item_ops = {
  594. .iop_size = xfs_buf_item_size,
  595. .iop_format = xfs_buf_item_format,
  596. .iop_pin = xfs_buf_item_pin,
  597. .iop_unpin = xfs_buf_item_unpin,
  598. .iop_trylock = xfs_buf_item_trylock,
  599. .iop_unlock = xfs_buf_item_unlock,
  600. .iop_committed = xfs_buf_item_committed,
  601. .iop_push = xfs_buf_item_push,
  602. .iop_pushbuf = xfs_buf_item_pushbuf,
  603. .iop_committing = xfs_buf_item_committing
  604. };
  605. /*
  606. * Allocate a new buf log item to go with the given buffer.
  607. * Set the buffer's b_fsprivate field to point to the new
  608. * buf log item. If there are other item's attached to the
  609. * buffer (see xfs_buf_attach_iodone() below), then put the
  610. * buf log item at the front.
  611. */
  612. void
  613. xfs_buf_item_init(
  614. xfs_buf_t *bp,
  615. xfs_mount_t *mp)
  616. {
  617. xfs_log_item_t *lip;
  618. xfs_buf_log_item_t *bip;
  619. int chunks;
  620. int map_size;
  621. /*
  622. * Check to see if there is already a buf log item for
  623. * this buffer. If there is, it is guaranteed to be
  624. * the first. If we do already have one, there is
  625. * nothing to do here so return.
  626. */
  627. ASSERT(bp->b_target->bt_mount == mp);
  628. if (XFS_BUF_FSPRIVATE(bp, void *) != NULL) {
  629. lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *);
  630. if (lip->li_type == XFS_LI_BUF) {
  631. return;
  632. }
  633. }
  634. /*
  635. * chunks is the number of XFS_BLF_CHUNK size pieces
  636. * the buffer can be divided into. Make sure not to
  637. * truncate any pieces. map_size is the size of the
  638. * bitmap needed to describe the chunks of the buffer.
  639. */
  640. chunks = (int)((XFS_BUF_COUNT(bp) + (XFS_BLF_CHUNK - 1)) >> XFS_BLF_SHIFT);
  641. map_size = (int)((chunks + NBWORD) >> BIT_TO_WORD_SHIFT);
  642. bip = (xfs_buf_log_item_t*)kmem_zone_zalloc(xfs_buf_item_zone,
  643. KM_SLEEP);
  644. xfs_log_item_init(mp, &bip->bli_item, XFS_LI_BUF, &xfs_buf_item_ops);
  645. bip->bli_buf = bp;
  646. xfs_buf_hold(bp);
  647. bip->bli_format.blf_type = XFS_LI_BUF;
  648. bip->bli_format.blf_blkno = (__int64_t)XFS_BUF_ADDR(bp);
  649. bip->bli_format.blf_len = (ushort)BTOBB(XFS_BUF_COUNT(bp));
  650. bip->bli_format.blf_map_size = map_size;
  651. #ifdef XFS_TRANS_DEBUG
  652. /*
  653. * Allocate the arrays for tracking what needs to be logged
  654. * and what our callers request to be logged. bli_orig
  655. * holds a copy of the original, clean buffer for comparison
  656. * against, and bli_logged keeps a 1 bit flag per byte in
  657. * the buffer to indicate which bytes the callers have asked
  658. * to have logged.
  659. */
  660. bip->bli_orig = (char *)kmem_alloc(XFS_BUF_COUNT(bp), KM_SLEEP);
  661. memcpy(bip->bli_orig, XFS_BUF_PTR(bp), XFS_BUF_COUNT(bp));
  662. bip->bli_logged = (char *)kmem_zalloc(XFS_BUF_COUNT(bp) / NBBY, KM_SLEEP);
  663. #endif
  664. /*
  665. * Put the buf item into the list of items attached to the
  666. * buffer at the front.
  667. */
  668. if (XFS_BUF_FSPRIVATE(bp, void *) != NULL) {
  669. bip->bli_item.li_bio_list =
  670. XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *);
  671. }
  672. XFS_BUF_SET_FSPRIVATE(bp, bip);
  673. }
  674. /*
  675. * Mark bytes first through last inclusive as dirty in the buf
  676. * item's bitmap.
  677. */
  678. void
  679. xfs_buf_item_log(
  680. xfs_buf_log_item_t *bip,
  681. uint first,
  682. uint last)
  683. {
  684. uint first_bit;
  685. uint last_bit;
  686. uint bits_to_set;
  687. uint bits_set;
  688. uint word_num;
  689. uint *wordp;
  690. uint bit;
  691. uint end_bit;
  692. uint mask;
  693. /*
  694. * Mark the item as having some dirty data for
  695. * quick reference in xfs_buf_item_dirty.
  696. */
  697. bip->bli_flags |= XFS_BLI_DIRTY;
  698. /*
  699. * Convert byte offsets to bit numbers.
  700. */
  701. first_bit = first >> XFS_BLF_SHIFT;
  702. last_bit = last >> XFS_BLF_SHIFT;
  703. /*
  704. * Calculate the total number of bits to be set.
  705. */
  706. bits_to_set = last_bit - first_bit + 1;
  707. /*
  708. * Get a pointer to the first word in the bitmap
  709. * to set a bit in.
  710. */
  711. word_num = first_bit >> BIT_TO_WORD_SHIFT;
  712. wordp = &(bip->bli_format.blf_data_map[word_num]);
  713. /*
  714. * Calculate the starting bit in the first word.
  715. */
  716. bit = first_bit & (uint)(NBWORD - 1);
  717. /*
  718. * First set any bits in the first word of our range.
  719. * If it starts at bit 0 of the word, it will be
  720. * set below rather than here. That is what the variable
  721. * bit tells us. The variable bits_set tracks the number
  722. * of bits that have been set so far. End_bit is the number
  723. * of the last bit to be set in this word plus one.
  724. */
  725. if (bit) {
  726. end_bit = MIN(bit + bits_to_set, (uint)NBWORD);
  727. mask = ((1 << (end_bit - bit)) - 1) << bit;
  728. *wordp |= mask;
  729. wordp++;
  730. bits_set = end_bit - bit;
  731. } else {
  732. bits_set = 0;
  733. }
  734. /*
  735. * Now set bits a whole word at a time that are between
  736. * first_bit and last_bit.
  737. */
  738. while ((bits_to_set - bits_set) >= NBWORD) {
  739. *wordp |= 0xffffffff;
  740. bits_set += NBWORD;
  741. wordp++;
  742. }
  743. /*
  744. * Finally, set any bits left to be set in one last partial word.
  745. */
  746. end_bit = bits_to_set - bits_set;
  747. if (end_bit) {
  748. mask = (1 << end_bit) - 1;
  749. *wordp |= mask;
  750. }
  751. xfs_buf_item_log_debug(bip, first, last);
  752. }
  753. /*
  754. * Return 1 if the buffer has some data that has been logged (at any
  755. * point, not just the current transaction) and 0 if not.
  756. */
  757. uint
  758. xfs_buf_item_dirty(
  759. xfs_buf_log_item_t *bip)
  760. {
  761. return (bip->bli_flags & XFS_BLI_DIRTY);
  762. }
  763. STATIC void
  764. xfs_buf_item_free(
  765. xfs_buf_log_item_t *bip)
  766. {
  767. #ifdef XFS_TRANS_DEBUG
  768. kmem_free(bip->bli_orig);
  769. kmem_free(bip->bli_logged);
  770. #endif /* XFS_TRANS_DEBUG */
  771. kmem_zone_free(xfs_buf_item_zone, bip);
  772. }
  773. /*
  774. * This is called when the buf log item is no longer needed. It should
  775. * free the buf log item associated with the given buffer and clear
  776. * the buffer's pointer to the buf log item. If there are no more
  777. * items in the list, clear the b_iodone field of the buffer (see
  778. * xfs_buf_attach_iodone() below).
  779. */
  780. void
  781. xfs_buf_item_relse(
  782. xfs_buf_t *bp)
  783. {
  784. xfs_buf_log_item_t *bip;
  785. trace_xfs_buf_item_relse(bp, _RET_IP_);
  786. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t*);
  787. XFS_BUF_SET_FSPRIVATE(bp, bip->bli_item.li_bio_list);
  788. if ((XFS_BUF_FSPRIVATE(bp, void *) == NULL) &&
  789. (XFS_BUF_IODONE_FUNC(bp) != NULL)) {
  790. XFS_BUF_CLR_IODONE_FUNC(bp);
  791. }
  792. xfs_buf_rele(bp);
  793. xfs_buf_item_free(bip);
  794. }
  795. /*
  796. * Add the given log item with its callback to the list of callbacks
  797. * to be called when the buffer's I/O completes. If it is not set
  798. * already, set the buffer's b_iodone() routine to be
  799. * xfs_buf_iodone_callbacks() and link the log item into the list of
  800. * items rooted at b_fsprivate. Items are always added as the second
  801. * entry in the list if there is a first, because the buf item code
  802. * assumes that the buf log item is first.
  803. */
  804. void
  805. xfs_buf_attach_iodone(
  806. xfs_buf_t *bp,
  807. void (*cb)(xfs_buf_t *, xfs_log_item_t *),
  808. xfs_log_item_t *lip)
  809. {
  810. xfs_log_item_t *head_lip;
  811. ASSERT(XFS_BUF_ISBUSY(bp));
  812. ASSERT(XFS_BUF_VALUSEMA(bp) <= 0);
  813. lip->li_cb = cb;
  814. if (XFS_BUF_FSPRIVATE(bp, void *) != NULL) {
  815. head_lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *);
  816. lip->li_bio_list = head_lip->li_bio_list;
  817. head_lip->li_bio_list = lip;
  818. } else {
  819. XFS_BUF_SET_FSPRIVATE(bp, lip);
  820. }
  821. ASSERT((XFS_BUF_IODONE_FUNC(bp) == xfs_buf_iodone_callbacks) ||
  822. (XFS_BUF_IODONE_FUNC(bp) == NULL));
  823. XFS_BUF_SET_IODONE_FUNC(bp, xfs_buf_iodone_callbacks);
  824. }
  825. /*
  826. * We can have many callbacks on a buffer. Running the callbacks individually
  827. * can cause a lot of contention on the AIL lock, so we allow for a single
  828. * callback to be able to scan the remaining lip->li_bio_list for other items
  829. * of the same type and callback to be processed in the first call.
  830. *
  831. * As a result, the loop walking the callback list below will also modify the
  832. * list. it removes the first item from the list and then runs the callback.
  833. * The loop then restarts from the new head of the list. This allows the
  834. * callback to scan and modify the list attached to the buffer and we don't
  835. * have to care about maintaining a next item pointer.
  836. */
  837. STATIC void
  838. xfs_buf_do_callbacks(
  839. struct xfs_buf *bp)
  840. {
  841. struct xfs_log_item *lip;
  842. while ((lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *)) != NULL) {
  843. XFS_BUF_SET_FSPRIVATE(bp, lip->li_bio_list);
  844. ASSERT(lip->li_cb != NULL);
  845. /*
  846. * Clear the next pointer so we don't have any
  847. * confusion if the item is added to another buf.
  848. * Don't touch the log item after calling its
  849. * callback, because it could have freed itself.
  850. */
  851. lip->li_bio_list = NULL;
  852. lip->li_cb(bp, lip);
  853. }
  854. }
  855. /*
  856. * This is the iodone() function for buffers which have had callbacks
  857. * attached to them by xfs_buf_attach_iodone(). It should remove each
  858. * log item from the buffer's list and call the callback of each in turn.
  859. * When done, the buffer's fsprivate field is set to NULL and the buffer
  860. * is unlocked with a call to iodone().
  861. */
  862. void
  863. xfs_buf_iodone_callbacks(
  864. struct xfs_buf *bp)
  865. {
  866. struct xfs_log_item *lip = bp->b_fspriv;
  867. struct xfs_mount *mp = lip->li_mountp;
  868. static ulong lasttime;
  869. static xfs_buftarg_t *lasttarg;
  870. if (likely(!XFS_BUF_GETERROR(bp)))
  871. goto do_callbacks;
  872. /*
  873. * If we've already decided to shutdown the filesystem because of
  874. * I/O errors, there's no point in giving this a retry.
  875. */
  876. if (XFS_FORCED_SHUTDOWN(mp)) {
  877. XFS_BUF_SUPER_STALE(bp);
  878. trace_xfs_buf_item_iodone(bp, _RET_IP_);
  879. goto do_callbacks;
  880. }
  881. if (XFS_BUF_TARGET(bp) != lasttarg ||
  882. time_after(jiffies, (lasttime + 5*HZ))) {
  883. lasttime = jiffies;
  884. cmn_err(CE_ALERT, "Device %s, XFS metadata write error"
  885. " block 0x%llx in %s",
  886. XFS_BUFTARG_NAME(XFS_BUF_TARGET(bp)),
  887. (__uint64_t)XFS_BUF_ADDR(bp), mp->m_fsname);
  888. }
  889. lasttarg = XFS_BUF_TARGET(bp);
  890. /*
  891. * If the write was asynchronous then noone will be looking for the
  892. * error. Clear the error state and write the buffer out again.
  893. *
  894. * During sync or umount we'll write all pending buffers again
  895. * synchronous, which will catch these errors if they keep hanging
  896. * around.
  897. */
  898. if (XFS_BUF_ISASYNC(bp)) {
  899. XFS_BUF_ERROR(bp, 0); /* errno of 0 unsets the flag */
  900. if (!XFS_BUF_ISSTALE(bp)) {
  901. XFS_BUF_DELAYWRITE(bp);
  902. XFS_BUF_DONE(bp);
  903. XFS_BUF_SET_START(bp);
  904. }
  905. ASSERT(XFS_BUF_IODONE_FUNC(bp));
  906. trace_xfs_buf_item_iodone_async(bp, _RET_IP_);
  907. xfs_buf_relse(bp);
  908. return;
  909. }
  910. /*
  911. * If the write of the buffer was synchronous, we want to make
  912. * sure to return the error to the caller of xfs_bwrite().
  913. */
  914. XFS_BUF_STALE(bp);
  915. XFS_BUF_DONE(bp);
  916. XFS_BUF_UNDELAYWRITE(bp);
  917. trace_xfs_buf_error_relse(bp, _RET_IP_);
  918. xfs_force_shutdown(mp, SHUTDOWN_META_IO_ERROR);
  919. do_callbacks:
  920. xfs_buf_do_callbacks(bp);
  921. XFS_BUF_SET_FSPRIVATE(bp, NULL);
  922. XFS_BUF_CLR_IODONE_FUNC(bp);
  923. xfs_buf_ioend(bp, 0);
  924. }
  925. /*
  926. * This is the iodone() function for buffers which have been
  927. * logged. It is called when they are eventually flushed out.
  928. * It should remove the buf item from the AIL, and free the buf item.
  929. * It is called by xfs_buf_iodone_callbacks() above which will take
  930. * care of cleaning up the buffer itself.
  931. */
  932. void
  933. xfs_buf_iodone(
  934. struct xfs_buf *bp,
  935. struct xfs_log_item *lip)
  936. {
  937. struct xfs_ail *ailp = lip->li_ailp;
  938. ASSERT(BUF_ITEM(lip)->bli_buf == bp);
  939. xfs_buf_rele(bp);
  940. /*
  941. * If we are forcibly shutting down, this may well be
  942. * off the AIL already. That's because we simulate the
  943. * log-committed callbacks to unpin these buffers. Or we may never
  944. * have put this item on AIL because of the transaction was
  945. * aborted forcibly. xfs_trans_ail_delete() takes care of these.
  946. *
  947. * Either way, AIL is useless if we're forcing a shutdown.
  948. */
  949. spin_lock(&ailp->xa_lock);
  950. xfs_trans_ail_delete(ailp, lip);
  951. xfs_buf_item_free(BUF_ITEM(lip));
  952. }