xfs_buf_item.c 30 KB

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