xfs_trans_priv.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
  4. * All Rights Reserved.
  5. */
  6. #ifndef __XFS_TRANS_PRIV_H__
  7. #define __XFS_TRANS_PRIV_H__
  8. struct xlog;
  9. struct xfs_log_item;
  10. struct xfs_mount;
  11. struct xfs_trans;
  12. struct xfs_ail;
  13. struct xfs_log_vec;
  14. void xfs_trans_init(struct xfs_mount *);
  15. void xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *);
  16. void xfs_trans_del_item(struct xfs_log_item *);
  17. void xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
  18. void xfs_trans_committed_bulk(struct xfs_ail *ailp,
  19. struct list_head *lv_chain,
  20. xfs_lsn_t commit_lsn, bool aborted);
  21. /*
  22. * AIL traversal cursor.
  23. *
  24. * Rather than using a generation number for detecting changes in the ail, use
  25. * a cursor that is protected by the ail lock. The aild cursor exists in the
  26. * struct xfs_ail, but other traversals can declare it on the stack and link it
  27. * to the ail list.
  28. *
  29. * When an object is deleted from or moved int the AIL, the cursor list is
  30. * searched to see if the object is a designated cursor item. If it is, it is
  31. * deleted from the cursor so that the next time the cursor is used traversal
  32. * will return to the start.
  33. *
  34. * This means a traversal colliding with a removal will cause a restart of the
  35. * list scan, rather than any insertion or deletion anywhere in the list. The
  36. * low bit of the item pointer is set if the cursor has been invalidated so
  37. * that we can tell the difference between invalidation and reaching the end
  38. * of the list to trigger traversal restarts.
  39. */
  40. struct xfs_ail_cursor {
  41. struct list_head list;
  42. struct xfs_log_item *item;
  43. };
  44. /*
  45. * Private AIL structures.
  46. *
  47. * Eventually we need to drive the locking in here as well.
  48. */
  49. struct xfs_ail {
  50. struct xlog *ail_log;
  51. struct task_struct *ail_task;
  52. struct list_head ail_head;
  53. xfs_lsn_t ail_target;
  54. xfs_lsn_t ail_target_prev;
  55. struct list_head ail_cursors;
  56. spinlock_t ail_lock;
  57. xfs_lsn_t ail_last_pushed_lsn;
  58. int ail_log_flush;
  59. struct list_head ail_buf_list;
  60. wait_queue_head_t ail_empty;
  61. };
  62. /*
  63. * From xfs_trans_ail.c
  64. */
  65. void xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
  66. struct xfs_ail_cursor *cur,
  67. struct xfs_log_item **log_items, int nr_items,
  68. xfs_lsn_t lsn) __releases(ailp->ail_lock);
  69. /*
  70. * Return a pointer to the first item in the AIL. If the AIL is empty, then
  71. * return NULL.
  72. */
  73. static inline struct xfs_log_item *
  74. xfs_ail_min(
  75. struct xfs_ail *ailp)
  76. {
  77. return list_first_entry_or_null(&ailp->ail_head, struct xfs_log_item,
  78. li_ail);
  79. }
  80. static inline void
  81. xfs_trans_ail_update(
  82. struct xfs_ail *ailp,
  83. struct xfs_log_item *lip,
  84. xfs_lsn_t lsn) __releases(ailp->ail_lock)
  85. {
  86. xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
  87. }
  88. void xfs_trans_ail_insert(struct xfs_ail *ailp, struct xfs_log_item *lip,
  89. xfs_lsn_t lsn);
  90. xfs_lsn_t xfs_ail_delete_one(struct xfs_ail *ailp, struct xfs_log_item *lip);
  91. void xfs_ail_update_finish(struct xfs_ail *ailp, xfs_lsn_t old_lsn)
  92. __releases(ailp->ail_lock);
  93. void xfs_trans_ail_delete(struct xfs_log_item *lip, int shutdown_type);
  94. void xfs_ail_push(struct xfs_ail *, xfs_lsn_t);
  95. void xfs_ail_push_all(struct xfs_ail *);
  96. void xfs_ail_push_all_sync(struct xfs_ail *);
  97. struct xfs_log_item *xfs_ail_min(struct xfs_ail *ailp);
  98. xfs_lsn_t xfs_ail_min_lsn(struct xfs_ail *ailp);
  99. struct xfs_log_item * xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
  100. struct xfs_ail_cursor *cur,
  101. xfs_lsn_t lsn);
  102. struct xfs_log_item * xfs_trans_ail_cursor_last(struct xfs_ail *ailp,
  103. struct xfs_ail_cursor *cur,
  104. xfs_lsn_t lsn);
  105. struct xfs_log_item * xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
  106. struct xfs_ail_cursor *cur);
  107. void xfs_trans_ail_cursor_done(struct xfs_ail_cursor *cur);
  108. #if BITS_PER_LONG != 64
  109. static inline void
  110. xfs_trans_ail_copy_lsn(
  111. struct xfs_ail *ailp,
  112. xfs_lsn_t *dst,
  113. xfs_lsn_t *src)
  114. {
  115. ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
  116. spin_lock(&ailp->ail_lock);
  117. *dst = *src;
  118. spin_unlock(&ailp->ail_lock);
  119. }
  120. #else
  121. static inline void
  122. xfs_trans_ail_copy_lsn(
  123. struct xfs_ail *ailp,
  124. xfs_lsn_t *dst,
  125. xfs_lsn_t *src)
  126. {
  127. ASSERT(sizeof(xfs_lsn_t) == 8);
  128. *dst = *src;
  129. }
  130. #endif
  131. static inline void
  132. xfs_clear_li_failed(
  133. struct xfs_log_item *lip)
  134. {
  135. struct xfs_buf *bp = lip->li_buf;
  136. ASSERT(test_bit(XFS_LI_IN_AIL, &lip->li_flags));
  137. lockdep_assert_held(&lip->li_ailp->ail_lock);
  138. if (test_and_clear_bit(XFS_LI_FAILED, &lip->li_flags)) {
  139. lip->li_buf = NULL;
  140. xfs_buf_rele(bp);
  141. }
  142. }
  143. static inline void
  144. xfs_set_li_failed(
  145. struct xfs_log_item *lip,
  146. struct xfs_buf *bp)
  147. {
  148. lockdep_assert_held(&lip->li_ailp->ail_lock);
  149. if (!test_and_set_bit(XFS_LI_FAILED, &lip->li_flags)) {
  150. xfs_buf_hold(bp);
  151. lip->li_buf = bp;
  152. }
  153. }
  154. #endif /* __XFS_TRANS_PRIV_H__ */