xfs_trans_priv.h 4.3 KB

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