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_alloc.h"
19 #include "xfs_attr_remote.h"
20 #include "xfs_trans.h"
21 #include "xfs_inode_item.h"
24 #include "xfs_attr_leaf.h"
25 #include "xfs_error.h"
26 #include "xfs_quota.h"
27 #include "xfs_trace.h"
31 * Look at all the extents for this logical region,
32 * invalidate any buffers that are incore/in transactions.
35 xfs_attr3_leaf_freextent(
36 struct xfs_trans **trans,
41 struct xfs_bmbt_irec map;
51 * Roll through the "value", invalidating the attribute value's
58 * Try to remember where we decided to put the value.
61 error = xfs_bmapi_read(dp, (xfs_fileoff_t)tblkno, tblkcnt,
62 &map, &nmap, XFS_BMAPI_ATTRFORK);
67 ASSERT(map.br_startblock != DELAYSTARTBLOCK);
70 * If it's a hole, these are already unmapped
71 * so there's nothing to invalidate.
73 if (map.br_startblock != HOLESTARTBLOCK) {
75 dblkno = XFS_FSB_TO_DADDR(dp->i_mount,
77 dblkcnt = XFS_FSB_TO_BB(dp->i_mount,
79 bp = xfs_trans_get_buf(*trans,
80 dp->i_mount->m_ddev_targp,
84 xfs_trans_binval(*trans, bp);
86 * Roll to next transaction.
88 error = xfs_trans_roll_inode(trans, dp);
93 tblkno += map.br_blockcount;
94 tblkcnt -= map.br_blockcount;
101 * Invalidate all of the "remote" value regions pointed to by a particular
103 * Note that we must release the lock on the buffer so that we are not
104 * caught holding something that the logging code wants to flush to disk.
107 xfs_attr3_leaf_inactive(
108 struct xfs_trans **trans,
109 struct xfs_inode *dp,
112 struct xfs_attr_leafblock *leaf;
113 struct xfs_attr3_icleaf_hdr ichdr;
114 struct xfs_attr_leaf_entry *entry;
115 struct xfs_attr_leaf_name_remote *name_rmt;
116 struct xfs_attr_inactive_list *list;
117 struct xfs_attr_inactive_list *lp;
123 struct xfs_mount *mp = bp->b_target->bt_mount;
126 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
129 * Count the number of "remote" value extents.
132 entry = xfs_attr3_leaf_entryp(leaf);
133 for (i = 0; i < ichdr.count; entry++, i++) {
134 if (be16_to_cpu(entry->nameidx) &&
135 ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
136 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
137 if (name_rmt->valueblk)
143 * If there are no "remote" values, we're done.
146 xfs_trans_brelse(*trans, bp);
151 * Allocate storage for a list of all the "remote" value extents.
153 size = count * sizeof(xfs_attr_inactive_list_t);
154 list = kmem_alloc(size, KM_SLEEP);
157 * Identify each of the "remote" value extents.
160 entry = xfs_attr3_leaf_entryp(leaf);
161 for (i = 0; i < ichdr.count; entry++, i++) {
162 if (be16_to_cpu(entry->nameidx) &&
163 ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
164 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
165 if (name_rmt->valueblk) {
166 lp->valueblk = be32_to_cpu(name_rmt->valueblk);
167 lp->valuelen = xfs_attr3_rmt_blocks(dp->i_mount,
168 be32_to_cpu(name_rmt->valuelen));
173 xfs_trans_brelse(*trans, bp); /* unlock for trans. in freextent() */
176 * Invalidate each of the "remote" value extents.
179 for (lp = list, i = 0; i < count; i++, lp++) {
180 tmp = xfs_attr3_leaf_freextent(trans, dp,
181 lp->valueblk, lp->valuelen);
184 error = tmp; /* save only the 1st errno */
192 * Recurse (gasp!) through the attribute nodes until we find leaves.
193 * We're doing a depth-first traversal in order to invalidate everything.
196 xfs_attr3_node_inactive(
197 struct xfs_trans **trans,
198 struct xfs_inode *dp,
202 xfs_da_blkinfo_t *info;
203 xfs_da_intnode_t *node;
204 xfs_dablk_t child_fsb;
205 xfs_daddr_t parent_blkno, child_blkno;
207 struct xfs_buf *child_bp;
208 struct xfs_da_node_entry *btree;
209 struct xfs_da3_icnode_hdr ichdr;
212 * Since this code is recursive (gasp!) we must protect ourselves.
214 if (level > XFS_DA_NODE_MAXDEPTH) {
215 xfs_trans_brelse(*trans, bp); /* no locks for later trans */
220 dp->d_ops->node_hdr_from_disk(&ichdr, node);
221 parent_blkno = bp->b_bn;
223 xfs_trans_brelse(*trans, bp);
226 btree = dp->d_ops->node_tree_p(node);
227 child_fsb = be32_to_cpu(btree[0].before);
228 xfs_trans_brelse(*trans, bp); /* no locks for later trans */
231 * If this is the node level just above the leaves, simply loop
232 * over the leaves removing all of them. If this is higher up
233 * in the tree, recurse downward.
235 for (i = 0; i < ichdr.count; i++) {
237 * Read the subsidiary block to see what we have to work with.
238 * Don't do this in a transaction. This is a depth-first
239 * traversal of the tree so we may deal with many blocks
240 * before we come back to this one.
242 error = xfs_da3_node_read(*trans, dp, child_fsb, -1, &child_bp,
247 /* save for re-read later */
248 child_blkno = XFS_BUF_ADDR(child_bp);
251 * Invalidate the subtree, however we have to.
253 info = child_bp->b_addr;
254 switch (info->magic) {
255 case cpu_to_be16(XFS_DA_NODE_MAGIC):
256 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
257 error = xfs_attr3_node_inactive(trans, dp, child_bp,
260 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
261 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
262 error = xfs_attr3_leaf_inactive(trans, dp, child_bp);
266 xfs_trans_brelse(*trans, child_bp);
273 * Remove the subsidiary block from the cache and from the log.
275 error = xfs_da_get_buf(*trans, dp, 0, child_blkno, &child_bp,
279 xfs_trans_binval(*trans, child_bp);
282 * If we're not done, re-read the parent to get the next
283 * child block number.
285 if (i + 1 < ichdr.count) {
286 error = xfs_da3_node_read(*trans, dp, 0, parent_blkno,
291 btree = dp->d_ops->node_tree_p(node);
292 child_fsb = be32_to_cpu(btree[i + 1].before);
293 xfs_trans_brelse(*trans, bp);
296 * Atomically commit the whole invalidate stuff.
298 error = xfs_trans_roll_inode(trans, dp);
307 * Indiscriminately delete the entire attribute fork
309 * Recurse (gasp!) through the attribute nodes until we find leaves.
310 * We're doing a depth-first traversal in order to invalidate everything.
313 xfs_attr3_root_inactive(
314 struct xfs_trans **trans,
315 struct xfs_inode *dp)
317 struct xfs_da_blkinfo *info;
323 * Read block 0 to see what we have to work with.
324 * We only get here if we have extents, since we remove
325 * the extents in reverse order the extent containing
326 * block 0 must still be there.
328 error = xfs_da3_node_read(*trans, dp, 0, -1, &bp, XFS_ATTR_FORK);
334 * Invalidate the tree, even if the "tree" is only a single leaf block.
335 * This is a depth-first traversal!
338 switch (info->magic) {
339 case cpu_to_be16(XFS_DA_NODE_MAGIC):
340 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
341 error = xfs_attr3_node_inactive(trans, dp, bp, 1);
343 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
344 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
345 error = xfs_attr3_leaf_inactive(trans, dp, bp);
349 xfs_trans_brelse(*trans, bp);
356 * Invalidate the incore copy of the root block.
358 error = xfs_da_get_buf(*trans, dp, 0, blkno, &bp, XFS_ATTR_FORK);
361 xfs_trans_binval(*trans, bp); /* remove from cache */
363 * Commit the invalidate and start the next transaction.
365 error = xfs_trans_roll_inode(trans, dp);
371 * xfs_attr_inactive kills all traces of an attribute fork on an inode. It
372 * removes both the on-disk and in-memory inode fork. Note that this also has to
373 * handle the condition of inodes without attributes but with an attribute fork
374 * configured, so we can't use xfs_inode_hasattr() here.
376 * The in-memory attribute fork is removed even on error.
380 struct xfs_inode *dp)
382 struct xfs_trans *trans;
383 struct xfs_mount *mp;
384 int lock_mode = XFS_ILOCK_SHARED;
388 ASSERT(! XFS_NOT_DQATTACHED(mp, dp));
390 xfs_ilock(dp, lock_mode);
391 if (!XFS_IFORK_Q(dp))
392 goto out_destroy_fork;
393 xfs_iunlock(dp, lock_mode);
397 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_attrinval, 0, 0, 0, &trans);
399 goto out_destroy_fork;
401 lock_mode = XFS_ILOCK_EXCL;
402 xfs_ilock(dp, lock_mode);
404 if (!XFS_IFORK_Q(dp))
408 * No need to make quota reservations here. We expect to release some
409 * blocks, not allocate, in the common case.
411 xfs_trans_ijoin(trans, dp, 0);
414 * Invalidate and truncate the attribute fork extents. Make sure the
415 * fork actually has attributes as otherwise the invalidation has no
416 * blocks to read and returns an error. In this case, just do the fork
419 if (xfs_inode_hasattr(dp) &&
420 dp->i_d.di_aformat != XFS_DINODE_FMT_LOCAL) {
421 error = xfs_attr3_root_inactive(&trans, dp);
425 error = xfs_itruncate_extents(&trans, dp, XFS_ATTR_FORK, 0);
430 /* Reset the attribute fork - this also destroys the in-core fork */
431 xfs_attr_fork_remove(dp, trans);
433 error = xfs_trans_commit(trans);
434 xfs_iunlock(dp, lock_mode);
438 xfs_trans_cancel(trans);
440 /* kill the in-core attr fork before we drop the inode lock */
442 xfs_idestroy_fork(dp, XFS_ATTR_FORK);
444 xfs_iunlock(dp, lock_mode);