xfs_trans_buf.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878
  1. /*
  2. * Copyright (c) 2000-2002,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_bmap_btree.h"
  29. #include "xfs_alloc_btree.h"
  30. #include "xfs_ialloc_btree.h"
  31. #include "xfs_dinode.h"
  32. #include "xfs_inode.h"
  33. #include "xfs_buf_item.h"
  34. #include "xfs_trans_priv.h"
  35. #include "xfs_error.h"
  36. #include "xfs_rw.h"
  37. #include "xfs_trace.h"
  38. /*
  39. * Check to see if a buffer matching the given parameters is already
  40. * a part of the given transaction.
  41. */
  42. STATIC struct xfs_buf *
  43. xfs_trans_buf_item_match(
  44. struct xfs_trans *tp,
  45. struct xfs_buftarg *target,
  46. xfs_daddr_t blkno,
  47. int len)
  48. {
  49. struct xfs_log_item_desc *lidp;
  50. struct xfs_buf_log_item *blip;
  51. len = BBTOB(len);
  52. list_for_each_entry(lidp, &tp->t_items, lid_trans) {
  53. blip = (struct xfs_buf_log_item *)lidp->lid_item;
  54. if (blip->bli_item.li_type == XFS_LI_BUF &&
  55. XFS_BUF_TARGET(blip->bli_buf) == target &&
  56. XFS_BUF_ADDR(blip->bli_buf) == blkno &&
  57. XFS_BUF_COUNT(blip->bli_buf) == len)
  58. return blip->bli_buf;
  59. }
  60. return NULL;
  61. }
  62. /*
  63. * Add the locked buffer to the transaction.
  64. *
  65. * The buffer must be locked, and it cannot be associated with any
  66. * transaction.
  67. *
  68. * If the buffer does not yet have a buf log item associated with it,
  69. * then allocate one for it. Then add the buf item to the transaction.
  70. */
  71. STATIC void
  72. _xfs_trans_bjoin(
  73. struct xfs_trans *tp,
  74. struct xfs_buf *bp,
  75. int reset_recur)
  76. {
  77. struct xfs_buf_log_item *bip;
  78. ASSERT(XFS_BUF_ISBUSY(bp));
  79. ASSERT(XFS_BUF_FSPRIVATE2(bp, void *) == NULL);
  80. /*
  81. * The xfs_buf_log_item pointer is stored in b_fsprivate. If
  82. * it doesn't have one yet, then allocate one and initialize it.
  83. * The checks to see if one is there are in xfs_buf_item_init().
  84. */
  85. xfs_buf_item_init(bp, tp->t_mountp);
  86. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  87. ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
  88. ASSERT(!(bip->bli_format.blf_flags & XFS_BLF_CANCEL));
  89. ASSERT(!(bip->bli_flags & XFS_BLI_LOGGED));
  90. if (reset_recur)
  91. bip->bli_recur = 0;
  92. /*
  93. * Take a reference for this transaction on the buf item.
  94. */
  95. atomic_inc(&bip->bli_refcount);
  96. /*
  97. * Get a log_item_desc to point at the new item.
  98. */
  99. xfs_trans_add_item(tp, &bip->bli_item);
  100. /*
  101. * Initialize b_fsprivate2 so we can find it with incore_match()
  102. * in xfs_trans_get_buf() and friends above.
  103. */
  104. XFS_BUF_SET_FSPRIVATE2(bp, tp);
  105. }
  106. void
  107. xfs_trans_bjoin(
  108. struct xfs_trans *tp,
  109. struct xfs_buf *bp)
  110. {
  111. _xfs_trans_bjoin(tp, bp, 0);
  112. trace_xfs_trans_bjoin(bp->b_fspriv);
  113. }
  114. /*
  115. * Get and lock the buffer for the caller if it is not already
  116. * locked within the given transaction. If it is already locked
  117. * within the transaction, just increment its lock recursion count
  118. * and return a pointer to it.
  119. *
  120. * If the transaction pointer is NULL, make this just a normal
  121. * get_buf() call.
  122. */
  123. xfs_buf_t *
  124. xfs_trans_get_buf(xfs_trans_t *tp,
  125. xfs_buftarg_t *target_dev,
  126. xfs_daddr_t blkno,
  127. int len,
  128. uint flags)
  129. {
  130. xfs_buf_t *bp;
  131. xfs_buf_log_item_t *bip;
  132. if (flags == 0)
  133. flags = XBF_LOCK | XBF_MAPPED;
  134. /*
  135. * Default to a normal get_buf() call if the tp is NULL.
  136. */
  137. if (tp == NULL)
  138. return xfs_buf_get(target_dev, blkno, len,
  139. flags | XBF_DONT_BLOCK);
  140. /*
  141. * If we find the buffer in the cache with this transaction
  142. * pointer in its b_fsprivate2 field, then we know we already
  143. * have it locked. In this case we just increment the lock
  144. * recursion count and return the buffer to the caller.
  145. */
  146. bp = xfs_trans_buf_item_match(tp, target_dev, blkno, len);
  147. if (bp != NULL) {
  148. ASSERT(XFS_BUF_VALUSEMA(bp) <= 0);
  149. if (XFS_FORCED_SHUTDOWN(tp->t_mountp))
  150. XFS_BUF_SUPER_STALE(bp);
  151. /*
  152. * If the buffer is stale then it was binval'ed
  153. * since last read. This doesn't matter since the
  154. * caller isn't allowed to use the data anyway.
  155. */
  156. else if (XFS_BUF_ISSTALE(bp))
  157. ASSERT(!XFS_BUF_ISDELAYWRITE(bp));
  158. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  159. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  160. ASSERT(bip != NULL);
  161. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  162. bip->bli_recur++;
  163. trace_xfs_trans_get_buf_recur(bip);
  164. return (bp);
  165. }
  166. /*
  167. * We always specify the XBF_DONT_BLOCK flag within a transaction
  168. * so that get_buf does not try to push out a delayed write buffer
  169. * which might cause another transaction to take place (if the
  170. * buffer was delayed alloc). Such recursive transactions can
  171. * easily deadlock with our current transaction as well as cause
  172. * us to run out of stack space.
  173. */
  174. bp = xfs_buf_get(target_dev, blkno, len, flags | XBF_DONT_BLOCK);
  175. if (bp == NULL) {
  176. return NULL;
  177. }
  178. ASSERT(!XFS_BUF_GETERROR(bp));
  179. _xfs_trans_bjoin(tp, bp, 1);
  180. trace_xfs_trans_get_buf(bp->b_fspriv);
  181. return (bp);
  182. }
  183. /*
  184. * Get and lock the superblock buffer of this file system for the
  185. * given transaction.
  186. *
  187. * We don't need to use incore_match() here, because the superblock
  188. * buffer is a private buffer which we keep a pointer to in the
  189. * mount structure.
  190. */
  191. xfs_buf_t *
  192. xfs_trans_getsb(xfs_trans_t *tp,
  193. struct xfs_mount *mp,
  194. int flags)
  195. {
  196. xfs_buf_t *bp;
  197. xfs_buf_log_item_t *bip;
  198. /*
  199. * Default to just trying to lock the superblock buffer
  200. * if tp is NULL.
  201. */
  202. if (tp == NULL) {
  203. return (xfs_getsb(mp, flags));
  204. }
  205. /*
  206. * If the superblock buffer already has this transaction
  207. * pointer in its b_fsprivate2 field, then we know we already
  208. * have it locked. In this case we just increment the lock
  209. * recursion count and return the buffer to the caller.
  210. */
  211. bp = mp->m_sb_bp;
  212. if (XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp) {
  213. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t*);
  214. ASSERT(bip != NULL);
  215. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  216. bip->bli_recur++;
  217. trace_xfs_trans_getsb_recur(bip);
  218. return (bp);
  219. }
  220. bp = xfs_getsb(mp, flags);
  221. if (bp == NULL)
  222. return NULL;
  223. _xfs_trans_bjoin(tp, bp, 1);
  224. trace_xfs_trans_getsb(bp->b_fspriv);
  225. return (bp);
  226. }
  227. #ifdef DEBUG
  228. xfs_buftarg_t *xfs_error_target;
  229. int xfs_do_error;
  230. int xfs_req_num;
  231. int xfs_error_mod = 33;
  232. #endif
  233. /*
  234. * Get and lock the buffer for the caller if it is not already
  235. * locked within the given transaction. If it has not yet been
  236. * read in, read it from disk. If it is already locked
  237. * within the transaction and already read in, just increment its
  238. * lock recursion count and return a pointer to it.
  239. *
  240. * If the transaction pointer is NULL, make this just a normal
  241. * read_buf() call.
  242. */
  243. int
  244. xfs_trans_read_buf(
  245. xfs_mount_t *mp,
  246. xfs_trans_t *tp,
  247. xfs_buftarg_t *target,
  248. xfs_daddr_t blkno,
  249. int len,
  250. uint flags,
  251. xfs_buf_t **bpp)
  252. {
  253. xfs_buf_t *bp;
  254. xfs_buf_log_item_t *bip;
  255. int error;
  256. if (flags == 0)
  257. flags = XBF_LOCK | XBF_MAPPED;
  258. /*
  259. * Default to a normal get_buf() call if the tp is NULL.
  260. */
  261. if (tp == NULL) {
  262. bp = xfs_buf_read(target, blkno, len, flags | XBF_DONT_BLOCK);
  263. if (!bp)
  264. return (flags & XBF_TRYLOCK) ?
  265. EAGAIN : XFS_ERROR(ENOMEM);
  266. if (XFS_BUF_GETERROR(bp) != 0) {
  267. xfs_ioerror_alert("xfs_trans_read_buf", mp,
  268. bp, blkno);
  269. error = XFS_BUF_GETERROR(bp);
  270. xfs_buf_relse(bp);
  271. return error;
  272. }
  273. #ifdef DEBUG
  274. if (xfs_do_error) {
  275. if (xfs_error_target == target) {
  276. if (((xfs_req_num++) % xfs_error_mod) == 0) {
  277. xfs_buf_relse(bp);
  278. cmn_err(CE_DEBUG, "Returning error!\n");
  279. return XFS_ERROR(EIO);
  280. }
  281. }
  282. }
  283. #endif
  284. if (XFS_FORCED_SHUTDOWN(mp))
  285. goto shutdown_abort;
  286. *bpp = bp;
  287. return 0;
  288. }
  289. /*
  290. * If we find the buffer in the cache with this transaction
  291. * pointer in its b_fsprivate2 field, then we know we already
  292. * have it locked. If it is already read in we just increment
  293. * the lock recursion count and return the buffer to the caller.
  294. * If the buffer is not yet read in, then we read it in, increment
  295. * the lock recursion count, and return it to the caller.
  296. */
  297. bp = xfs_trans_buf_item_match(tp, target, blkno, len);
  298. if (bp != NULL) {
  299. ASSERT(XFS_BUF_VALUSEMA(bp) <= 0);
  300. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  301. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  302. ASSERT((XFS_BUF_ISERROR(bp)) == 0);
  303. if (!(XFS_BUF_ISDONE(bp))) {
  304. trace_xfs_trans_read_buf_io(bp, _RET_IP_);
  305. ASSERT(!XFS_BUF_ISASYNC(bp));
  306. XFS_BUF_READ(bp);
  307. xfsbdstrat(tp->t_mountp, bp);
  308. error = xfs_iowait(bp);
  309. if (error) {
  310. xfs_ioerror_alert("xfs_trans_read_buf", mp,
  311. bp, blkno);
  312. xfs_buf_relse(bp);
  313. /*
  314. * We can gracefully recover from most read
  315. * errors. Ones we can't are those that happen
  316. * after the transaction's already dirty.
  317. */
  318. if (tp->t_flags & XFS_TRANS_DIRTY)
  319. xfs_force_shutdown(tp->t_mountp,
  320. SHUTDOWN_META_IO_ERROR);
  321. return error;
  322. }
  323. }
  324. /*
  325. * We never locked this buf ourselves, so we shouldn't
  326. * brelse it either. Just get out.
  327. */
  328. if (XFS_FORCED_SHUTDOWN(mp)) {
  329. trace_xfs_trans_read_buf_shut(bp, _RET_IP_);
  330. *bpp = NULL;
  331. return XFS_ERROR(EIO);
  332. }
  333. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t*);
  334. bip->bli_recur++;
  335. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  336. trace_xfs_trans_read_buf_recur(bip);
  337. *bpp = bp;
  338. return 0;
  339. }
  340. /*
  341. * We always specify the XBF_DONT_BLOCK flag within a transaction
  342. * so that get_buf does not try to push out a delayed write buffer
  343. * which might cause another transaction to take place (if the
  344. * buffer was delayed alloc). Such recursive transactions can
  345. * easily deadlock with our current transaction as well as cause
  346. * us to run out of stack space.
  347. */
  348. bp = xfs_buf_read(target, blkno, len, flags | XBF_DONT_BLOCK);
  349. if (bp == NULL) {
  350. *bpp = NULL;
  351. return 0;
  352. }
  353. if (XFS_BUF_GETERROR(bp) != 0) {
  354. XFS_BUF_SUPER_STALE(bp);
  355. error = XFS_BUF_GETERROR(bp);
  356. xfs_ioerror_alert("xfs_trans_read_buf", mp,
  357. bp, blkno);
  358. if (tp->t_flags & XFS_TRANS_DIRTY)
  359. xfs_force_shutdown(tp->t_mountp, SHUTDOWN_META_IO_ERROR);
  360. xfs_buf_relse(bp);
  361. return error;
  362. }
  363. #ifdef DEBUG
  364. if (xfs_do_error && !(tp->t_flags & XFS_TRANS_DIRTY)) {
  365. if (xfs_error_target == target) {
  366. if (((xfs_req_num++) % xfs_error_mod) == 0) {
  367. xfs_force_shutdown(tp->t_mountp,
  368. SHUTDOWN_META_IO_ERROR);
  369. xfs_buf_relse(bp);
  370. cmn_err(CE_DEBUG, "Returning trans error!\n");
  371. return XFS_ERROR(EIO);
  372. }
  373. }
  374. }
  375. #endif
  376. if (XFS_FORCED_SHUTDOWN(mp))
  377. goto shutdown_abort;
  378. _xfs_trans_bjoin(tp, bp, 1);
  379. trace_xfs_trans_read_buf(bp->b_fspriv);
  380. *bpp = bp;
  381. return 0;
  382. shutdown_abort:
  383. /*
  384. * the theory here is that buffer is good but we're
  385. * bailing out because the filesystem is being forcibly
  386. * shut down. So we should leave the b_flags alone since
  387. * the buffer's not staled and just get out.
  388. */
  389. #if defined(DEBUG)
  390. if (XFS_BUF_ISSTALE(bp) && XFS_BUF_ISDELAYWRITE(bp))
  391. cmn_err(CE_NOTE, "about to pop assert, bp == 0x%p", bp);
  392. #endif
  393. ASSERT((XFS_BUF_BFLAGS(bp) & (XBF_STALE|XBF_DELWRI)) !=
  394. (XBF_STALE|XBF_DELWRI));
  395. trace_xfs_trans_read_buf_shut(bp, _RET_IP_);
  396. xfs_buf_relse(bp);
  397. *bpp = NULL;
  398. return XFS_ERROR(EIO);
  399. }
  400. /*
  401. * Release the buffer bp which was previously acquired with one of the
  402. * xfs_trans_... buffer allocation routines if the buffer has not
  403. * been modified within this transaction. If the buffer is modified
  404. * within this transaction, do decrement the recursion count but do
  405. * not release the buffer even if the count goes to 0. If the buffer is not
  406. * modified within the transaction, decrement the recursion count and
  407. * release the buffer if the recursion count goes to 0.
  408. *
  409. * If the buffer is to be released and it was not modified before
  410. * this transaction began, then free the buf_log_item associated with it.
  411. *
  412. * If the transaction pointer is NULL, make this just a normal
  413. * brelse() call.
  414. */
  415. void
  416. xfs_trans_brelse(xfs_trans_t *tp,
  417. xfs_buf_t *bp)
  418. {
  419. xfs_buf_log_item_t *bip;
  420. xfs_log_item_t *lip;
  421. /*
  422. * Default to a normal brelse() call if the tp is NULL.
  423. */
  424. if (tp == NULL) {
  425. ASSERT(XFS_BUF_FSPRIVATE2(bp, void *) == NULL);
  426. /*
  427. * If there's a buf log item attached to the buffer,
  428. * then let the AIL know that the buffer is being
  429. * unlocked.
  430. */
  431. if (XFS_BUF_FSPRIVATE(bp, void *) != NULL) {
  432. lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *);
  433. if (lip->li_type == XFS_LI_BUF) {
  434. bip = XFS_BUF_FSPRIVATE(bp,xfs_buf_log_item_t*);
  435. xfs_trans_unlocked_item(bip->bli_item.li_ailp,
  436. lip);
  437. }
  438. }
  439. xfs_buf_relse(bp);
  440. return;
  441. }
  442. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  443. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  444. ASSERT(bip->bli_item.li_type == XFS_LI_BUF);
  445. ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
  446. ASSERT(!(bip->bli_format.blf_flags & XFS_BLF_CANCEL));
  447. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  448. trace_xfs_trans_brelse(bip);
  449. /*
  450. * If the release is just for a recursive lock,
  451. * then decrement the count and return.
  452. */
  453. if (bip->bli_recur > 0) {
  454. bip->bli_recur--;
  455. return;
  456. }
  457. /*
  458. * If the buffer is dirty within this transaction, we can't
  459. * release it until we commit.
  460. */
  461. if (bip->bli_item.li_desc->lid_flags & XFS_LID_DIRTY)
  462. return;
  463. /*
  464. * If the buffer has been invalidated, then we can't release
  465. * it until the transaction commits to disk unless it is re-dirtied
  466. * as part of this transaction. This prevents us from pulling
  467. * the item from the AIL before we should.
  468. */
  469. if (bip->bli_flags & XFS_BLI_STALE)
  470. return;
  471. ASSERT(!(bip->bli_flags & XFS_BLI_LOGGED));
  472. /*
  473. * Free up the log item descriptor tracking the released item.
  474. */
  475. xfs_trans_del_item(&bip->bli_item);
  476. /*
  477. * Clear the hold flag in the buf log item if it is set.
  478. * We wouldn't want the next user of the buffer to
  479. * get confused.
  480. */
  481. if (bip->bli_flags & XFS_BLI_HOLD) {
  482. bip->bli_flags &= ~XFS_BLI_HOLD;
  483. }
  484. /*
  485. * Drop our reference to the buf log item.
  486. */
  487. atomic_dec(&bip->bli_refcount);
  488. /*
  489. * If the buf item is not tracking data in the log, then
  490. * we must free it before releasing the buffer back to the
  491. * free pool. Before releasing the buffer to the free pool,
  492. * clear the transaction pointer in b_fsprivate2 to dissolve
  493. * its relation to this transaction.
  494. */
  495. if (!xfs_buf_item_dirty(bip)) {
  496. /***
  497. ASSERT(bp->b_pincount == 0);
  498. ***/
  499. ASSERT(atomic_read(&bip->bli_refcount) == 0);
  500. ASSERT(!(bip->bli_item.li_flags & XFS_LI_IN_AIL));
  501. ASSERT(!(bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF));
  502. xfs_buf_item_relse(bp);
  503. bip = NULL;
  504. }
  505. XFS_BUF_SET_FSPRIVATE2(bp, NULL);
  506. /*
  507. * If we've still got a buf log item on the buffer, then
  508. * tell the AIL that the buffer is being unlocked.
  509. */
  510. if (bip != NULL) {
  511. xfs_trans_unlocked_item(bip->bli_item.li_ailp,
  512. (xfs_log_item_t*)bip);
  513. }
  514. xfs_buf_relse(bp);
  515. return;
  516. }
  517. /*
  518. * Mark the buffer as not needing to be unlocked when the buf item's
  519. * IOP_UNLOCK() routine is called. The buffer must already be locked
  520. * and associated with the given transaction.
  521. */
  522. /* ARGSUSED */
  523. void
  524. xfs_trans_bhold(xfs_trans_t *tp,
  525. xfs_buf_t *bp)
  526. {
  527. xfs_buf_log_item_t *bip;
  528. ASSERT(XFS_BUF_ISBUSY(bp));
  529. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  530. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  531. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  532. ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
  533. ASSERT(!(bip->bli_format.blf_flags & XFS_BLF_CANCEL));
  534. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  535. bip->bli_flags |= XFS_BLI_HOLD;
  536. trace_xfs_trans_bhold(bip);
  537. }
  538. /*
  539. * Cancel the previous buffer hold request made on this buffer
  540. * for this transaction.
  541. */
  542. void
  543. xfs_trans_bhold_release(xfs_trans_t *tp,
  544. xfs_buf_t *bp)
  545. {
  546. xfs_buf_log_item_t *bip;
  547. ASSERT(XFS_BUF_ISBUSY(bp));
  548. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  549. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  550. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  551. ASSERT(!(bip->bli_flags & XFS_BLI_STALE));
  552. ASSERT(!(bip->bli_format.blf_flags & XFS_BLF_CANCEL));
  553. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  554. ASSERT(bip->bli_flags & XFS_BLI_HOLD);
  555. bip->bli_flags &= ~XFS_BLI_HOLD;
  556. trace_xfs_trans_bhold_release(bip);
  557. }
  558. /*
  559. * This is called to mark bytes first through last inclusive of the given
  560. * buffer as needing to be logged when the transaction is committed.
  561. * The buffer must already be associated with the given transaction.
  562. *
  563. * First and last are numbers relative to the beginning of this buffer,
  564. * so the first byte in the buffer is numbered 0 regardless of the
  565. * value of b_blkno.
  566. */
  567. void
  568. xfs_trans_log_buf(xfs_trans_t *tp,
  569. xfs_buf_t *bp,
  570. uint first,
  571. uint last)
  572. {
  573. xfs_buf_log_item_t *bip;
  574. ASSERT(XFS_BUF_ISBUSY(bp));
  575. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  576. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  577. ASSERT((first <= last) && (last < XFS_BUF_COUNT(bp)));
  578. ASSERT((XFS_BUF_IODONE_FUNC(bp) == NULL) ||
  579. (XFS_BUF_IODONE_FUNC(bp) == xfs_buf_iodone_callbacks));
  580. /*
  581. * Mark the buffer as needing to be written out eventually,
  582. * and set its iodone function to remove the buffer's buf log
  583. * item from the AIL and free it when the buffer is flushed
  584. * to disk. See xfs_buf_attach_iodone() for more details
  585. * on li_cb and xfs_buf_iodone_callbacks().
  586. * If we end up aborting this transaction, we trap this buffer
  587. * inside the b_bdstrat callback so that this won't get written to
  588. * disk.
  589. */
  590. XFS_BUF_DELAYWRITE(bp);
  591. XFS_BUF_DONE(bp);
  592. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  593. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  594. XFS_BUF_SET_IODONE_FUNC(bp, xfs_buf_iodone_callbacks);
  595. bip->bli_item.li_cb = xfs_buf_iodone;
  596. trace_xfs_trans_log_buf(bip);
  597. /*
  598. * If we invalidated the buffer within this transaction, then
  599. * cancel the invalidation now that we're dirtying the buffer
  600. * again. There are no races with the code in xfs_buf_item_unpin(),
  601. * because we have a reference to the buffer this entire time.
  602. */
  603. if (bip->bli_flags & XFS_BLI_STALE) {
  604. bip->bli_flags &= ~XFS_BLI_STALE;
  605. ASSERT(XFS_BUF_ISSTALE(bp));
  606. XFS_BUF_UNSTALE(bp);
  607. bip->bli_format.blf_flags &= ~XFS_BLF_CANCEL;
  608. }
  609. tp->t_flags |= XFS_TRANS_DIRTY;
  610. bip->bli_item.li_desc->lid_flags |= XFS_LID_DIRTY;
  611. bip->bli_flags |= XFS_BLI_LOGGED;
  612. xfs_buf_item_log(bip, first, last);
  613. }
  614. /*
  615. * This called to invalidate a buffer that is being used within
  616. * a transaction. Typically this is because the blocks in the
  617. * buffer are being freed, so we need to prevent it from being
  618. * written out when we're done. Allowing it to be written again
  619. * might overwrite data in the free blocks if they are reallocated
  620. * to a file.
  621. *
  622. * We prevent the buffer from being written out by clearing the
  623. * B_DELWRI flag. We can't always
  624. * get rid of the buf log item at this point, though, because
  625. * the buffer may still be pinned by another transaction. If that
  626. * is the case, then we'll wait until the buffer is committed to
  627. * disk for the last time (we can tell by the ref count) and
  628. * free it in xfs_buf_item_unpin(). Until it is cleaned up we
  629. * will keep the buffer locked so that the buffer and buf log item
  630. * are not reused.
  631. */
  632. void
  633. xfs_trans_binval(
  634. xfs_trans_t *tp,
  635. xfs_buf_t *bp)
  636. {
  637. xfs_buf_log_item_t *bip;
  638. ASSERT(XFS_BUF_ISBUSY(bp));
  639. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  640. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  641. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  642. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  643. trace_xfs_trans_binval(bip);
  644. if (bip->bli_flags & XFS_BLI_STALE) {
  645. /*
  646. * If the buffer is already invalidated, then
  647. * just return.
  648. */
  649. ASSERT(!(XFS_BUF_ISDELAYWRITE(bp)));
  650. ASSERT(XFS_BUF_ISSTALE(bp));
  651. ASSERT(!(bip->bli_flags & (XFS_BLI_LOGGED | XFS_BLI_DIRTY)));
  652. ASSERT(!(bip->bli_format.blf_flags & XFS_BLF_INODE_BUF));
  653. ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL);
  654. ASSERT(bip->bli_item.li_desc->lid_flags & XFS_LID_DIRTY);
  655. ASSERT(tp->t_flags & XFS_TRANS_DIRTY);
  656. return;
  657. }
  658. /*
  659. * Clear the dirty bit in the buffer and set the STALE flag
  660. * in the buf log item. The STALE flag will be used in
  661. * xfs_buf_item_unpin() to determine if it should clean up
  662. * when the last reference to the buf item is given up.
  663. * We set the XFS_BLF_CANCEL flag in the buf log format structure
  664. * and log the buf item. This will be used at recovery time
  665. * to determine that copies of the buffer in the log before
  666. * this should not be replayed.
  667. * We mark the item descriptor and the transaction dirty so
  668. * that we'll hold the buffer until after the commit.
  669. *
  670. * Since we're invalidating the buffer, we also clear the state
  671. * about which parts of the buffer have been logged. We also
  672. * clear the flag indicating that this is an inode buffer since
  673. * the data in the buffer will no longer be valid.
  674. *
  675. * We set the stale bit in the buffer as well since we're getting
  676. * rid of it.
  677. */
  678. XFS_BUF_UNDELAYWRITE(bp);
  679. XFS_BUF_STALE(bp);
  680. bip->bli_flags |= XFS_BLI_STALE;
  681. bip->bli_flags &= ~(XFS_BLI_INODE_BUF | XFS_BLI_LOGGED | XFS_BLI_DIRTY);
  682. bip->bli_format.blf_flags &= ~XFS_BLF_INODE_BUF;
  683. bip->bli_format.blf_flags |= XFS_BLF_CANCEL;
  684. memset((char *)(bip->bli_format.blf_data_map), 0,
  685. (bip->bli_format.blf_map_size * sizeof(uint)));
  686. bip->bli_item.li_desc->lid_flags |= XFS_LID_DIRTY;
  687. tp->t_flags |= XFS_TRANS_DIRTY;
  688. }
  689. /*
  690. * This call is used to indicate that the buffer contains on-disk inodes which
  691. * must be handled specially during recovery. They require special handling
  692. * because only the di_next_unlinked from the inodes in the buffer should be
  693. * recovered. The rest of the data in the buffer is logged via the inodes
  694. * themselves.
  695. *
  696. * All we do is set the XFS_BLI_INODE_BUF flag in the items flags so it can be
  697. * transferred to the buffer's log format structure so that we'll know what to
  698. * do at recovery time.
  699. */
  700. void
  701. xfs_trans_inode_buf(
  702. xfs_trans_t *tp,
  703. xfs_buf_t *bp)
  704. {
  705. xfs_buf_log_item_t *bip;
  706. ASSERT(XFS_BUF_ISBUSY(bp));
  707. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  708. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  709. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  710. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  711. bip->bli_flags |= XFS_BLI_INODE_BUF;
  712. }
  713. /*
  714. * This call is used to indicate that the buffer is going to
  715. * be staled and was an inode buffer. This means it gets
  716. * special processing during unpin - where any inodes
  717. * associated with the buffer should be removed from ail.
  718. * There is also special processing during recovery,
  719. * any replay of the inodes in the buffer needs to be
  720. * prevented as the buffer may have been reused.
  721. */
  722. void
  723. xfs_trans_stale_inode_buf(
  724. xfs_trans_t *tp,
  725. xfs_buf_t *bp)
  726. {
  727. xfs_buf_log_item_t *bip;
  728. ASSERT(XFS_BUF_ISBUSY(bp));
  729. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  730. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  731. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  732. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  733. bip->bli_flags |= XFS_BLI_STALE_INODE;
  734. bip->bli_item.li_cb = xfs_buf_iodone;
  735. }
  736. /*
  737. * Mark the buffer as being one which contains newly allocated
  738. * inodes. We need to make sure that even if this buffer is
  739. * relogged as an 'inode buf' we still recover all of the inode
  740. * images in the face of a crash. This works in coordination with
  741. * xfs_buf_item_committed() to ensure that the buffer remains in the
  742. * AIL at its original location even after it has been relogged.
  743. */
  744. /* ARGSUSED */
  745. void
  746. xfs_trans_inode_alloc_buf(
  747. xfs_trans_t *tp,
  748. xfs_buf_t *bp)
  749. {
  750. xfs_buf_log_item_t *bip;
  751. ASSERT(XFS_BUF_ISBUSY(bp));
  752. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  753. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  754. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  755. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  756. bip->bli_flags |= XFS_BLI_INODE_ALLOC_BUF;
  757. }
  758. /*
  759. * Similar to xfs_trans_inode_buf(), this marks the buffer as a cluster of
  760. * dquots. However, unlike in inode buffer recovery, dquot buffers get
  761. * recovered in their entirety. (Hence, no XFS_BLI_DQUOT_ALLOC_BUF flag).
  762. * The only thing that makes dquot buffers different from regular
  763. * buffers is that we must not replay dquot bufs when recovering
  764. * if a _corresponding_ quotaoff has happened. We also have to distinguish
  765. * between usr dquot bufs and grp dquot bufs, because usr and grp quotas
  766. * can be turned off independently.
  767. */
  768. /* ARGSUSED */
  769. void
  770. xfs_trans_dquot_buf(
  771. xfs_trans_t *tp,
  772. xfs_buf_t *bp,
  773. uint type)
  774. {
  775. xfs_buf_log_item_t *bip;
  776. ASSERT(XFS_BUF_ISBUSY(bp));
  777. ASSERT(XFS_BUF_FSPRIVATE2(bp, xfs_trans_t *) == tp);
  778. ASSERT(XFS_BUF_FSPRIVATE(bp, void *) != NULL);
  779. ASSERT(type == XFS_BLF_UDQUOT_BUF ||
  780. type == XFS_BLF_PDQUOT_BUF ||
  781. type == XFS_BLF_GDQUOT_BUF);
  782. bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *);
  783. ASSERT(atomic_read(&bip->bli_refcount) > 0);
  784. bip->bli_format.blf_flags |= type;
  785. }