xfs_trans_priv.h 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  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 xfs_ail_cursor *next;
  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 task_struct *xa_task;
  64. struct list_head xa_ail;
  65. xfs_lsn_t xa_target;
  66. struct xfs_ail_cursor xa_cursors;
  67. spinlock_t xa_lock;
  68. xfs_lsn_t xa_last_pushed_lsn;
  69. };
  70. /*
  71. * From xfs_trans_ail.c
  72. */
  73. void xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
  74. struct xfs_ail_cursor *cur,
  75. struct xfs_log_item **log_items, int nr_items,
  76. xfs_lsn_t lsn) __releases(ailp->xa_lock);
  77. static inline void
  78. xfs_trans_ail_update(
  79. struct xfs_ail *ailp,
  80. struct xfs_log_item *lip,
  81. xfs_lsn_t lsn) __releases(ailp->xa_lock)
  82. {
  83. xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
  84. }
  85. void xfs_trans_ail_delete_bulk(struct xfs_ail *ailp,
  86. struct xfs_log_item **log_items, int nr_items)
  87. __releases(ailp->xa_lock);
  88. static inline void
  89. xfs_trans_ail_delete(
  90. struct xfs_ail *ailp,
  91. xfs_log_item_t *lip) __releases(ailp->xa_lock)
  92. {
  93. xfs_trans_ail_delete_bulk(ailp, &lip, 1);
  94. }
  95. void xfs_ail_push(struct xfs_ail *, xfs_lsn_t);
  96. void xfs_ail_push_all(struct xfs_ail *);
  97. xfs_lsn_t xfs_ail_min_lsn(struct xfs_ail *ailp);
  98. void xfs_trans_unlocked_item(struct xfs_ail *,
  99. xfs_log_item_t *);
  100. struct xfs_log_item * xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
  101. struct xfs_ail_cursor *cur,
  102. xfs_lsn_t lsn);
  103. struct xfs_log_item * xfs_trans_ail_cursor_last(struct xfs_ail *ailp,
  104. struct xfs_ail_cursor *cur,
  105. xfs_lsn_t lsn);
  106. struct xfs_log_item * xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
  107. struct xfs_ail_cursor *cur);
  108. void xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
  109. struct xfs_ail_cursor *cur);
  110. #if BITS_PER_LONG != 64
  111. static inline void
  112. xfs_trans_ail_copy_lsn(
  113. struct xfs_ail *ailp,
  114. xfs_lsn_t *dst,
  115. xfs_lsn_t *src)
  116. {
  117. ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
  118. spin_lock(&ailp->xa_lock);
  119. *dst = *src;
  120. spin_unlock(&ailp->xa_lock);
  121. }
  122. #else
  123. static inline void
  124. xfs_trans_ail_copy_lsn(
  125. struct xfs_ail *ailp,
  126. xfs_lsn_t *dst,
  127. xfs_lsn_t *src)
  128. {
  129. ASSERT(sizeof(xfs_lsn_t) == 8);
  130. *dst = *src;
  131. }
  132. #endif
  133. #endif /* __XFS_TRANS_PRIV_H__ */