1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
4 * Copyright (c) 2013 Red Hat, Inc.
9 #include "xfs_shared.h"
10 #include "xfs_format.h"
11 #include "xfs_log_format.h"
12 #include "xfs_trans_resv.h"
14 #include "xfs_mount.h"
15 #include "xfs_da_format.h"
16 #include "xfs_da_btree.h"
17 #include "xfs_inode.h"
18 #include "xfs_attr_remote.h"
19 #include "xfs_trans.h"
22 #include "xfs_attr_leaf.h"
23 #include "xfs_quota.h"
25 #include "xfs_error.h"
28 * Invalidate any incore buffers associated with this remote attribute value
29 * extent. We never log remote attribute value buffers, which means that they
30 * won't be attached to a transaction and are therefore safe to mark stale.
31 * The actual bunmapi will be taken care of later.
39 struct xfs_bmbt_irec map;
44 * Roll through the "value", invalidating the attribute value's
49 * Try to remember where we decided to put the value.
52 error = xfs_bmapi_read(dp, (xfs_fileoff_t)blkno, blkcnt,
53 &map, &nmap, XFS_BMAPI_ATTRFORK);
59 * Mark any incore buffers for the remote value as stale. We
60 * never log remote attr value buffers, so the buffer should be
63 error = xfs_attr_rmtval_stale(dp, &map, 0);
67 blkno += map.br_blockcount;
68 blkcnt -= map.br_blockcount;
75 * Invalidate all of the "remote" value regions pointed to by a particular
77 * Note that we must release the lock on the buffer so that we are not
78 * caught holding something that the logging code wants to flush to disk.
81 xfs_attr3_leaf_inactive(
82 struct xfs_trans **trans,
86 struct xfs_attr3_icleaf_hdr ichdr;
87 struct xfs_mount *mp = bp->b_mount;
88 struct xfs_attr_leafblock *leaf = bp->b_addr;
89 struct xfs_attr_leaf_entry *entry;
90 struct xfs_attr_leaf_name_remote *name_rmt;
94 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
97 * Find the remote value extents for this leaf and invalidate their
100 entry = xfs_attr3_leaf_entryp(leaf);
101 for (i = 0; i < ichdr.count; entry++, i++) {
104 if (!entry->nameidx || (entry->flags & XFS_ATTR_LOCAL))
107 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
108 if (!name_rmt->valueblk)
111 blkcnt = xfs_attr3_rmt_blocks(dp->i_mount,
112 be32_to_cpu(name_rmt->valuelen));
113 error = xfs_attr3_rmt_stale(dp,
114 be32_to_cpu(name_rmt->valueblk), blkcnt);
119 xfs_trans_brelse(*trans, bp);
125 * Recurse (gasp!) through the attribute nodes until we find leaves.
126 * We're doing a depth-first traversal in order to invalidate everything.
129 xfs_attr3_node_inactive(
130 struct xfs_trans **trans,
131 struct xfs_inode *dp,
135 xfs_da_blkinfo_t *info;
136 xfs_da_intnode_t *node;
137 xfs_dablk_t child_fsb;
138 xfs_daddr_t parent_blkno, child_blkno;
140 struct xfs_buf *child_bp;
141 struct xfs_da_node_entry *btree;
142 struct xfs_da3_icnode_hdr ichdr;
145 * Since this code is recursive (gasp!) we must protect ourselves.
147 if (level > XFS_DA_NODE_MAXDEPTH) {
148 xfs_buf_mark_corrupt(bp);
149 xfs_trans_brelse(*trans, bp); /* no locks for later trans */
150 return -EFSCORRUPTED;
154 dp->d_ops->node_hdr_from_disk(&ichdr, node);
155 parent_blkno = bp->b_bn;
157 xfs_trans_brelse(*trans, bp);
160 btree = dp->d_ops->node_tree_p(node);
161 child_fsb = be32_to_cpu(btree[0].before);
162 xfs_trans_brelse(*trans, bp); /* no locks for later trans */
165 * If this is the node level just above the leaves, simply loop
166 * over the leaves removing all of them. If this is higher up
167 * in the tree, recurse downward.
169 for (i = 0; i < ichdr.count; i++) {
171 * Read the subsidiary block to see what we have to work with.
172 * Don't do this in a transaction. This is a depth-first
173 * traversal of the tree so we may deal with many blocks
174 * before we come back to this one.
176 error = xfs_da3_node_read(*trans, dp, child_fsb, -1, &child_bp,
181 /* save for re-read later */
182 child_blkno = XFS_BUF_ADDR(child_bp);
185 * Invalidate the subtree, however we have to.
187 info = child_bp->b_addr;
188 switch (info->magic) {
189 case cpu_to_be16(XFS_DA_NODE_MAGIC):
190 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
191 error = xfs_attr3_node_inactive(trans, dp, child_bp,
194 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
195 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
196 error = xfs_attr3_leaf_inactive(trans, dp, child_bp);
199 xfs_buf_mark_corrupt(child_bp);
200 xfs_trans_brelse(*trans, child_bp);
201 error = -EFSCORRUPTED;
208 * Remove the subsidiary block from the cache and from the log.
210 error = xfs_da_get_buf(*trans, dp, 0, child_blkno, &child_bp,
214 xfs_trans_binval(*trans, child_bp);
217 * If we're not done, re-read the parent to get the next
218 * child block number.
220 if (i + 1 < ichdr.count) {
221 error = xfs_da3_node_read(*trans, dp, 0, parent_blkno,
226 btree = dp->d_ops->node_tree_p(node);
227 child_fsb = be32_to_cpu(btree[i + 1].before);
228 xfs_trans_brelse(*trans, bp);
231 * Atomically commit the whole invalidate stuff.
233 error = xfs_trans_roll_inode(trans, dp);
242 * Indiscriminately delete the entire attribute fork
244 * Recurse (gasp!) through the attribute nodes until we find leaves.
245 * We're doing a depth-first traversal in order to invalidate everything.
248 xfs_attr3_root_inactive(
249 struct xfs_trans **trans,
250 struct xfs_inode *dp)
252 struct xfs_da_blkinfo *info;
258 * Read block 0 to see what we have to work with.
259 * We only get here if we have extents, since we remove
260 * the extents in reverse order the extent containing
261 * block 0 must still be there.
263 error = xfs_da3_node_read(*trans, dp, 0, -1, &bp, XFS_ATTR_FORK);
269 * Invalidate the tree, even if the "tree" is only a single leaf block.
270 * This is a depth-first traversal!
273 switch (info->magic) {
274 case cpu_to_be16(XFS_DA_NODE_MAGIC):
275 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
276 error = xfs_attr3_node_inactive(trans, dp, bp, 1);
278 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
279 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
280 error = xfs_attr3_leaf_inactive(trans, dp, bp);
283 error = -EFSCORRUPTED;
284 xfs_buf_mark_corrupt(bp);
285 xfs_trans_brelse(*trans, bp);
292 * Invalidate the incore copy of the root block.
294 error = xfs_da_get_buf(*trans, dp, 0, blkno, &bp, XFS_ATTR_FORK);
297 xfs_trans_binval(*trans, bp); /* remove from cache */
299 * Commit the invalidate and start the next transaction.
301 error = xfs_trans_roll_inode(trans, dp);
307 * xfs_attr_inactive kills all traces of an attribute fork on an inode. It
308 * removes both the on-disk and in-memory inode fork. Note that this also has to
309 * handle the condition of inodes without attributes but with an attribute fork
310 * configured, so we can't use xfs_inode_hasattr() here.
312 * The in-memory attribute fork is removed even on error.
316 struct xfs_inode *dp)
318 struct xfs_trans *trans;
319 struct xfs_mount *mp;
320 int lock_mode = XFS_ILOCK_SHARED;
324 ASSERT(! XFS_NOT_DQATTACHED(mp, dp));
326 xfs_ilock(dp, lock_mode);
327 if (!XFS_IFORK_Q(dp))
328 goto out_destroy_fork;
329 xfs_iunlock(dp, lock_mode);
333 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_attrinval, 0, 0, 0, &trans);
335 goto out_destroy_fork;
337 lock_mode = XFS_ILOCK_EXCL;
338 xfs_ilock(dp, lock_mode);
340 if (!XFS_IFORK_Q(dp))
344 * No need to make quota reservations here. We expect to release some
345 * blocks, not allocate, in the common case.
347 xfs_trans_ijoin(trans, dp, 0);
350 * Invalidate and truncate the attribute fork extents. Make sure the
351 * fork actually has attributes as otherwise the invalidation has no
352 * blocks to read and returns an error. In this case, just do the fork
355 if (xfs_inode_hasattr(dp) &&
356 dp->i_d.di_aformat != XFS_DINODE_FMT_LOCAL) {
357 error = xfs_attr3_root_inactive(&trans, dp);
361 error = xfs_itruncate_extents(&trans, dp, XFS_ATTR_FORK, 0);
366 /* Reset the attribute fork - this also destroys the in-core fork */
367 xfs_attr_fork_remove(dp, trans);
369 error = xfs_trans_commit(trans);
370 xfs_iunlock(dp, lock_mode);
374 xfs_trans_cancel(trans);
376 /* kill the in-core attr fork before we drop the inode lock */
378 xfs_idestroy_fork(dp, XFS_ATTR_FORK);
380 xfs_iunlock(dp, lock_mode);