Loading...
1/*
2 * Copyright (c) 2000,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#include "xfs.h"
19#include "xfs_fs.h"
20#include "xfs_shared.h"
21#include "xfs_format.h"
22#include "xfs_log_format.h"
23#include "xfs_trans_resv.h"
24#include "xfs_mount.h"
25#include "xfs_inode.h"
26#include "xfs_trans.h"
27#include "xfs_trans_priv.h"
28#include "xfs_inode_item.h"
29#include "xfs_trace.h"
30
31#include <linux/iversion.h>
32
33/*
34 * Add a locked inode to the transaction.
35 *
36 * The inode must be locked, and it cannot be associated with any transaction.
37 * If lock_flags is non-zero the inode will be unlocked on transaction commit.
38 */
39void
40xfs_trans_ijoin(
41 struct xfs_trans *tp,
42 struct xfs_inode *ip,
43 uint lock_flags)
44{
45 xfs_inode_log_item_t *iip;
46
47 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
48 if (ip->i_itemp == NULL)
49 xfs_inode_item_init(ip, ip->i_mount);
50 iip = ip->i_itemp;
51
52 ASSERT(iip->ili_lock_flags == 0);
53 iip->ili_lock_flags = lock_flags;
54
55 /*
56 * Get a log_item_desc to point at the new item.
57 */
58 xfs_trans_add_item(tp, &iip->ili_item);
59}
60
61/*
62 * Transactional inode timestamp update. Requires the inode to be locked and
63 * joined to the transaction supplied. Relies on the transaction subsystem to
64 * track dirty state and update/writeback the inode accordingly.
65 */
66void
67xfs_trans_ichgtime(
68 struct xfs_trans *tp,
69 struct xfs_inode *ip,
70 int flags)
71{
72 struct inode *inode = VFS_I(ip);
73 struct timespec tv;
74
75 ASSERT(tp);
76 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
77
78 tv = current_time(inode);
79
80 if (flags & XFS_ICHGTIME_MOD)
81 inode->i_mtime = tv;
82 if (flags & XFS_ICHGTIME_CHG)
83 inode->i_ctime = tv;
84}
85
86/*
87 * This is called to mark the fields indicated in fieldmask as needing
88 * to be logged when the transaction is committed. The inode must
89 * already be associated with the given transaction.
90 *
91 * The values for fieldmask are defined in xfs_inode_item.h. We always
92 * log all of the core inode if any of it has changed, and we always log
93 * all of the inline data/extents/b-tree root if any of them has changed.
94 */
95void
96xfs_trans_log_inode(
97 xfs_trans_t *tp,
98 xfs_inode_t *ip,
99 uint flags)
100{
101 struct inode *inode = VFS_I(ip);
102
103 ASSERT(ip->i_itemp != NULL);
104 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
105
106 /*
107 * Don't bother with i_lock for the I_DIRTY_TIME check here, as races
108 * don't matter - we either will need an extra transaction in 24 hours
109 * to log the timestamps, or will clear already cleared fields in the
110 * worst case.
111 */
112 if (inode->i_state & (I_DIRTY_TIME | I_DIRTY_TIME_EXPIRED)) {
113 spin_lock(&inode->i_lock);
114 inode->i_state &= ~(I_DIRTY_TIME | I_DIRTY_TIME_EXPIRED);
115 spin_unlock(&inode->i_lock);
116 }
117
118 /*
119 * Record the specific change for fdatasync optimisation. This
120 * allows fdatasync to skip log forces for inodes that are only
121 * timestamp dirty. We do this before the change count so that
122 * the core being logged in this case does not impact on fdatasync
123 * behaviour.
124 */
125 ip->i_itemp->ili_fsync_fields |= flags;
126
127 /*
128 * First time we log the inode in a transaction, bump the inode change
129 * counter if it is configured for this to occur. While we have the
130 * inode locked exclusively for metadata modification, we can usually
131 * avoid setting XFS_ILOG_CORE if no one has queried the value since
132 * the last time it was incremented. If we have XFS_ILOG_CORE already
133 * set however, then go ahead and bump the i_version counter
134 * unconditionally.
135 */
136 if (!(ip->i_itemp->ili_item.li_desc->lid_flags & XFS_LID_DIRTY) &&
137 IS_I_VERSION(VFS_I(ip))) {
138 if (inode_maybe_inc_iversion(VFS_I(ip), flags & XFS_ILOG_CORE))
139 flags |= XFS_ILOG_CORE;
140 }
141
142 tp->t_flags |= XFS_TRANS_DIRTY;
143 ip->i_itemp->ili_item.li_desc->lid_flags |= XFS_LID_DIRTY;
144
145 /*
146 * Always OR in the bits from the ili_last_fields field.
147 * This is to coordinate with the xfs_iflush() and xfs_iflush_done()
148 * routines in the eventual clearing of the ili_fields bits.
149 * See the big comment in xfs_iflush() for an explanation of
150 * this coordination mechanism.
151 */
152 flags |= ip->i_itemp->ili_last_fields;
153 ip->i_itemp->ili_fields |= flags;
154}
155
156int
157xfs_trans_roll_inode(
158 struct xfs_trans **tpp,
159 struct xfs_inode *ip)
160{
161 int error;
162
163 xfs_trans_log_inode(*tpp, ip, XFS_ILOG_CORE);
164 error = xfs_trans_roll(tpp);
165 if (!error)
166 xfs_trans_ijoin(*tpp, ip, 0);
167 return error;
168}
1/*
2 * Copyright (c) 2000,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#include "xfs.h"
19#include "xfs_fs.h"
20#include "xfs_types.h"
21#include "xfs_bit.h"
22#include "xfs_log.h"
23#include "xfs_inum.h"
24#include "xfs_trans.h"
25#include "xfs_sb.h"
26#include "xfs_ag.h"
27#include "xfs_mount.h"
28#include "xfs_bmap_btree.h"
29#include "xfs_alloc_btree.h"
30#include "xfs_ialloc_btree.h"
31#include "xfs_dinode.h"
32#include "xfs_inode.h"
33#include "xfs_btree.h"
34#include "xfs_trans_priv.h"
35#include "xfs_inode_item.h"
36#include "xfs_trace.h"
37
38#ifdef XFS_TRANS_DEBUG
39STATIC void
40xfs_trans_inode_broot_debug(
41 xfs_inode_t *ip);
42#else
43#define xfs_trans_inode_broot_debug(ip)
44#endif
45
46/*
47 * Add a locked inode to the transaction.
48 *
49 * The inode must be locked, and it cannot be associated with any transaction.
50 */
51void
52xfs_trans_ijoin(
53 struct xfs_trans *tp,
54 struct xfs_inode *ip)
55{
56 xfs_inode_log_item_t *iip;
57
58 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
59 if (ip->i_itemp == NULL)
60 xfs_inode_item_init(ip, ip->i_mount);
61 iip = ip->i_itemp;
62 ASSERT(iip->ili_lock_flags == 0);
63
64 /*
65 * Get a log_item_desc to point at the new item.
66 */
67 xfs_trans_add_item(tp, &iip->ili_item);
68
69 xfs_trans_inode_broot_debug(ip);
70}
71
72/*
73 * Add a locked inode to the transaction.
74 *
75 *
76 * Grabs a reference to the inode which will be dropped when the transaction
77 * is committed. The inode will also be unlocked at that point. The inode
78 * must be locked, and it cannot be associated with any transaction.
79 */
80void
81xfs_trans_ijoin_ref(
82 struct xfs_trans *tp,
83 struct xfs_inode *ip,
84 uint lock_flags)
85{
86 xfs_trans_ijoin(tp, ip);
87 IHOLD(ip);
88 ip->i_itemp->ili_lock_flags = lock_flags;
89}
90
91/*
92 * Transactional inode timestamp update. Requires the inode to be locked and
93 * joined to the transaction supplied. Relies on the transaction subsystem to
94 * track dirty state and update/writeback the inode accordingly.
95 */
96void
97xfs_trans_ichgtime(
98 struct xfs_trans *tp,
99 struct xfs_inode *ip,
100 int flags)
101{
102 struct inode *inode = VFS_I(ip);
103 timespec_t tv;
104
105 ASSERT(tp);
106 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
107
108 tv = current_fs_time(inode->i_sb);
109
110 if ((flags & XFS_ICHGTIME_MOD) &&
111 !timespec_equal(&inode->i_mtime, &tv)) {
112 inode->i_mtime = tv;
113 }
114 if ((flags & XFS_ICHGTIME_CHG) &&
115 !timespec_equal(&inode->i_ctime, &tv)) {
116 inode->i_ctime = tv;
117 }
118}
119
120/*
121 * This is called to mark the fields indicated in fieldmask as needing
122 * to be logged when the transaction is committed. The inode must
123 * already be associated with the given transaction.
124 *
125 * The values for fieldmask are defined in xfs_inode_item.h. We always
126 * log all of the core inode if any of it has changed, and we always log
127 * all of the inline data/extents/b-tree root if any of them has changed.
128 */
129void
130xfs_trans_log_inode(
131 xfs_trans_t *tp,
132 xfs_inode_t *ip,
133 uint flags)
134{
135 ASSERT(ip->i_itemp != NULL);
136 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
137
138 tp->t_flags |= XFS_TRANS_DIRTY;
139 ip->i_itemp->ili_item.li_desc->lid_flags |= XFS_LID_DIRTY;
140
141 /*
142 * Always OR in the bits from the ili_last_fields field.
143 * This is to coordinate with the xfs_iflush() and xfs_iflush_done()
144 * routines in the eventual clearing of the ilf_fields bits.
145 * See the big comment in xfs_iflush() for an explanation of
146 * this coordination mechanism.
147 */
148 flags |= ip->i_itemp->ili_last_fields;
149 ip->i_itemp->ili_format.ilf_fields |= flags;
150}
151
152#ifdef XFS_TRANS_DEBUG
153/*
154 * Keep track of the state of the inode btree root to make sure we
155 * log it properly.
156 */
157STATIC void
158xfs_trans_inode_broot_debug(
159 xfs_inode_t *ip)
160{
161 xfs_inode_log_item_t *iip;
162
163 ASSERT(ip->i_itemp != NULL);
164 iip = ip->i_itemp;
165 if (iip->ili_root_size != 0) {
166 ASSERT(iip->ili_orig_root != NULL);
167 kmem_free(iip->ili_orig_root);
168 iip->ili_root_size = 0;
169 iip->ili_orig_root = NULL;
170 }
171 if (ip->i_d.di_format == XFS_DINODE_FMT_BTREE) {
172 ASSERT((ip->i_df.if_broot != NULL) &&
173 (ip->i_df.if_broot_bytes > 0));
174 iip->ili_root_size = ip->i_df.if_broot_bytes;
175 iip->ili_orig_root =
176 (char*)kmem_alloc(iip->ili_root_size, KM_SLEEP);
177 memcpy(iip->ili_orig_root, (char*)(ip->i_df.if_broot),
178 iip->ili_root_size);
179 }
180}
181#endif