LXR linux/fs/xfs/xfs_trans

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