xfs_trans_priv.h 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  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. #ifndef __XFS_TRANS_PRIV_H__
  19. #define __XFS_TRANS_PRIV_H__
  20. struct xfs_log_item;
  21. struct xfs_log_item_desc;
  22. struct xfs_mount;
  23. struct xfs_trans;
  24. struct xfs_ail;
  25. struct xfs_log_vec;
  26. void xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *);
  27. void xfs_trans_del_item(struct xfs_log_item *);
  28. void xfs_trans_free_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn,
  29. int flags);
  30. void xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
  31. void xfs_trans_committed_bulk(struct xfs_ail *ailp, struct xfs_log_vec *lv,
  32. xfs_lsn_t commit_lsn, int aborted);
  33. /*
  34. * AIL traversal cursor.
  35. *
  36. * Rather than using a generation number for detecting changes in the ail, use
  37. * a cursor that is protected by the ail lock. The aild cursor exists in the
  38. * struct xfs_ail, but other traversals can declare it on the stack and link it
  39. * to the ail list.
  40. *
  41. * When an object is deleted from or moved int the AIL, the cursor list is
  42. * searched to see if the object is a designated cursor item. If it is, it is
  43. * deleted from the cursor so that the next time the cursor is used traversal
  44. * will return to the start.
  45. *
  46. * This means a traversal colliding with a removal will cause a restart of the
  47. * list scan, rather than any insertion or deletion anywhere in the list. The
  48. * low bit of the item pointer is set if the cursor has been invalidated so
  49. * that we can tell the difference between invalidation and reaching the end
  50. * of the list to trigger traversal restarts.
  51. */
  52. struct xfs_ail_cursor {
  53. struct list_head list;
  54. struct xfs_log_item *item;
  55. };
  56. /*
  57. * Private AIL structures.
  58. *
  59. * Eventually we need to drive the locking in here as well.
  60. */
  61. struct xfs_ail {
  62. struct xfs_mount *xa_mount;
  63. struct list_head xa_ail;
  64. xfs_lsn_t xa_target;
  65. struct list_head xa_cursors;
  66. spinlock_t xa_lock;
  67. struct delayed_work xa_work;
  68. xfs_lsn_t xa_last_pushed_lsn;
  69. unsigned long xa_flags;
  70. };
  71. #define XFS_AIL_PUSHING_BIT 0
  72. /*
  73. * From xfs_trans_ail.c
  74. */
  75. extern struct workqueue_struct *xfs_ail_wq; /* AIL workqueue */
  76. void xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
  77. struct xfs_ail_cursor *cur,
  78. struct xfs_log_item **log_items, int nr_items,
  79. xfs_lsn_t lsn) __releases(ailp->xa_lock);
  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->xa_lock)
  85. {
  86. xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
  87. }
  88. void xfs_trans_ail_delete_bulk(struct xfs_ail *ailp,
  89. struct xfs_log_item **log_items, int nr_items)
  90. __releases(ailp->xa_lock);
  91. static inline void
  92. xfs_trans_ail_delete(
  93. struct xfs_ail *ailp,
  94. xfs_log_item_t *lip) __releases(ailp->xa_lock)
  95. {
  96. xfs_trans_ail_delete_bulk(ailp, &lip, 1);
  97. }
  98. void xfs_ail_push(struct xfs_ail *, xfs_lsn_t);
  99. void xfs_ail_push_all(struct xfs_ail *);
  100. xfs_lsn_t xfs_ail_min_lsn(struct xfs_ail *ailp);
  101. void xfs_trans_unlocked_item(struct xfs_ail *,
  102. xfs_log_item_t *);
  103. struct xfs_log_item * xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
  104. struct xfs_ail_cursor *cur,
  105. xfs_lsn_t lsn);
  106. struct xfs_log_item * xfs_trans_ail_cursor_last(struct xfs_ail *ailp,
  107. struct xfs_ail_cursor *cur,
  108. xfs_lsn_t lsn);
  109. struct xfs_log_item * xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
  110. struct xfs_ail_cursor *cur);
  111. void xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
  112. struct xfs_ail_cursor *cur);
  113. #if BITS_PER_LONG != 64
  114. static inline void
  115. xfs_trans_ail_copy_lsn(
  116. struct xfs_ail *ailp,
  117. xfs_lsn_t *dst,
  118. xfs_lsn_t *src)
  119. {
  120. ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
  121. spin_lock(&ailp->xa_lock);
  122. *dst = *src;
  123. spin_unlock(&ailp->xa_lock);
  124. }
  125. #else
  126. static inline void
  127. xfs_trans_ail_copy_lsn(
  128. struct xfs_ail *ailp,
  129. xfs_lsn_t *dst,
  130. xfs_lsn_t *src)
  131. {
  132. ASSERT(sizeof(xfs_lsn_t) == 8);
  133. *dst = *src;
  134. }
  135. #endif
  136. #endif /* __XFS_TRANS_PRIV_H__ */