Loading...
1/*
2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
3 * Copyright (c) 2013 Red Hat, Inc.
4 * All Rights Reserved.
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it would be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
18 */
19#include "xfs.h"
20#include "xfs_fs.h"
21#include "xfs_shared.h"
22#include "xfs_format.h"
23#include "xfs_log_format.h"
24#include "xfs_trans_resv.h"
25#include "xfs_bit.h"
26#include "xfs_mount.h"
27#include "xfs_da_format.h"
28#include "xfs_da_btree.h"
29#include "xfs_inode.h"
30#include "xfs_alloc.h"
31#include "xfs_attr_remote.h"
32#include "xfs_trans.h"
33#include "xfs_inode_item.h"
34#include "xfs_bmap.h"
35#include "xfs_attr.h"
36#include "xfs_attr_leaf.h"
37#include "xfs_error.h"
38#include "xfs_quota.h"
39#include "xfs_trace.h"
40#include "xfs_dir2.h"
41
42/*
43 * Look at all the extents for this logical region,
44 * invalidate any buffers that are incore/in transactions.
45 */
46STATIC int
47xfs_attr3_leaf_freextent(
48 struct xfs_trans **trans,
49 struct xfs_inode *dp,
50 xfs_dablk_t blkno,
51 int blkcnt)
52{
53 struct xfs_bmbt_irec map;
54 struct xfs_buf *bp;
55 xfs_dablk_t tblkno;
56 xfs_daddr_t dblkno;
57 int tblkcnt;
58 int dblkcnt;
59 int nmap;
60 int error;
61
62 /*
63 * Roll through the "value", invalidating the attribute value's
64 * blocks.
65 */
66 tblkno = blkno;
67 tblkcnt = blkcnt;
68 while (tblkcnt > 0) {
69 /*
70 * Try to remember where we decided to put the value.
71 */
72 nmap = 1;
73 error = xfs_bmapi_read(dp, (xfs_fileoff_t)tblkno, tblkcnt,
74 &map, &nmap, XFS_BMAPI_ATTRFORK);
75 if (error) {
76 return error;
77 }
78 ASSERT(nmap == 1);
79 ASSERT(map.br_startblock != DELAYSTARTBLOCK);
80
81 /*
82 * If it's a hole, these are already unmapped
83 * so there's nothing to invalidate.
84 */
85 if (map.br_startblock != HOLESTARTBLOCK) {
86
87 dblkno = XFS_FSB_TO_DADDR(dp->i_mount,
88 map.br_startblock);
89 dblkcnt = XFS_FSB_TO_BB(dp->i_mount,
90 map.br_blockcount);
91 bp = xfs_trans_get_buf(*trans,
92 dp->i_mount->m_ddev_targp,
93 dblkno, dblkcnt, 0);
94 if (!bp)
95 return -ENOMEM;
96 xfs_trans_binval(*trans, bp);
97 /*
98 * Roll to next transaction.
99 */
100 error = xfs_trans_roll_inode(trans, dp);
101 if (error)
102 return error;
103 }
104
105 tblkno += map.br_blockcount;
106 tblkcnt -= map.br_blockcount;
107 }
108
109 return 0;
110}
111
112/*
113 * Invalidate all of the "remote" value regions pointed to by a particular
114 * leaf block.
115 * Note that we must release the lock on the buffer so that we are not
116 * caught holding something that the logging code wants to flush to disk.
117 */
118STATIC int
119xfs_attr3_leaf_inactive(
120 struct xfs_trans **trans,
121 struct xfs_inode *dp,
122 struct xfs_buf *bp)
123{
124 struct xfs_attr_leafblock *leaf;
125 struct xfs_attr3_icleaf_hdr ichdr;
126 struct xfs_attr_leaf_entry *entry;
127 struct xfs_attr_leaf_name_remote *name_rmt;
128 struct xfs_attr_inactive_list *list;
129 struct xfs_attr_inactive_list *lp;
130 int error;
131 int count;
132 int size;
133 int tmp;
134 int i;
135 struct xfs_mount *mp = bp->b_target->bt_mount;
136
137 leaf = bp->b_addr;
138 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
139
140 /*
141 * Count the number of "remote" value extents.
142 */
143 count = 0;
144 entry = xfs_attr3_leaf_entryp(leaf);
145 for (i = 0; i < ichdr.count; entry++, i++) {
146 if (be16_to_cpu(entry->nameidx) &&
147 ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
148 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
149 if (name_rmt->valueblk)
150 count++;
151 }
152 }
153
154 /*
155 * If there are no "remote" values, we're done.
156 */
157 if (count == 0) {
158 xfs_trans_brelse(*trans, bp);
159 return 0;
160 }
161
162 /*
163 * Allocate storage for a list of all the "remote" value extents.
164 */
165 size = count * sizeof(xfs_attr_inactive_list_t);
166 list = kmem_alloc(size, KM_SLEEP);
167
168 /*
169 * Identify each of the "remote" value extents.
170 */
171 lp = list;
172 entry = xfs_attr3_leaf_entryp(leaf);
173 for (i = 0; i < ichdr.count; entry++, i++) {
174 if (be16_to_cpu(entry->nameidx) &&
175 ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
176 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
177 if (name_rmt->valueblk) {
178 lp->valueblk = be32_to_cpu(name_rmt->valueblk);
179 lp->valuelen = xfs_attr3_rmt_blocks(dp->i_mount,
180 be32_to_cpu(name_rmt->valuelen));
181 lp++;
182 }
183 }
184 }
185 xfs_trans_brelse(*trans, bp); /* unlock for trans. in freextent() */
186
187 /*
188 * Invalidate each of the "remote" value extents.
189 */
190 error = 0;
191 for (lp = list, i = 0; i < count; i++, lp++) {
192 tmp = xfs_attr3_leaf_freextent(trans, dp,
193 lp->valueblk, lp->valuelen);
194
195 if (error == 0)
196 error = tmp; /* save only the 1st errno */
197 }
198
199 kmem_free(list);
200 return error;
201}
202
203/*
204 * Recurse (gasp!) through the attribute nodes until we find leaves.
205 * We're doing a depth-first traversal in order to invalidate everything.
206 */
207STATIC int
208xfs_attr3_node_inactive(
209 struct xfs_trans **trans,
210 struct xfs_inode *dp,
211 struct xfs_buf *bp,
212 int level)
213{
214 xfs_da_blkinfo_t *info;
215 xfs_da_intnode_t *node;
216 xfs_dablk_t child_fsb;
217 xfs_daddr_t parent_blkno, child_blkno;
218 int error, i;
219 struct xfs_buf *child_bp;
220 struct xfs_da_node_entry *btree;
221 struct xfs_da3_icnode_hdr ichdr;
222
223 /*
224 * Since this code is recursive (gasp!) we must protect ourselves.
225 */
226 if (level > XFS_DA_NODE_MAXDEPTH) {
227 xfs_trans_brelse(*trans, bp); /* no locks for later trans */
228 return -EIO;
229 }
230
231 node = bp->b_addr;
232 dp->d_ops->node_hdr_from_disk(&ichdr, node);
233 parent_blkno = bp->b_bn;
234 if (!ichdr.count) {
235 xfs_trans_brelse(*trans, bp);
236 return 0;
237 }
238 btree = dp->d_ops->node_tree_p(node);
239 child_fsb = be32_to_cpu(btree[0].before);
240 xfs_trans_brelse(*trans, bp); /* no locks for later trans */
241
242 /*
243 * If this is the node level just above the leaves, simply loop
244 * over the leaves removing all of them. If this is higher up
245 * in the tree, recurse downward.
246 */
247 for (i = 0; i < ichdr.count; i++) {
248 /*
249 * Read the subsidiary block to see what we have to work with.
250 * Don't do this in a transaction. This is a depth-first
251 * traversal of the tree so we may deal with many blocks
252 * before we come back to this one.
253 */
254 error = xfs_da3_node_read(*trans, dp, child_fsb, -1, &child_bp,
255 XFS_ATTR_FORK);
256 if (error)
257 return error;
258
259 /* save for re-read later */
260 child_blkno = XFS_BUF_ADDR(child_bp);
261
262 /*
263 * Invalidate the subtree, however we have to.
264 */
265 info = child_bp->b_addr;
266 switch (info->magic) {
267 case cpu_to_be16(XFS_DA_NODE_MAGIC):
268 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
269 error = xfs_attr3_node_inactive(trans, dp, child_bp,
270 level + 1);
271 break;
272 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
273 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
274 error = xfs_attr3_leaf_inactive(trans, dp, child_bp);
275 break;
276 default:
277 error = -EIO;
278 xfs_trans_brelse(*trans, child_bp);
279 break;
280 }
281 if (error)
282 return error;
283
284 /*
285 * Remove the subsidiary block from the cache and from the log.
286 */
287 error = xfs_da_get_buf(*trans, dp, 0, child_blkno, &child_bp,
288 XFS_ATTR_FORK);
289 if (error)
290 return error;
291 xfs_trans_binval(*trans, child_bp);
292
293 /*
294 * If we're not done, re-read the parent to get the next
295 * child block number.
296 */
297 if (i + 1 < ichdr.count) {
298 error = xfs_da3_node_read(*trans, dp, 0, parent_blkno,
299 &bp, XFS_ATTR_FORK);
300 if (error)
301 return error;
302 node = bp->b_addr;
303 btree = dp->d_ops->node_tree_p(node);
304 child_fsb = be32_to_cpu(btree[i + 1].before);
305 xfs_trans_brelse(*trans, bp);
306 }
307 /*
308 * Atomically commit the whole invalidate stuff.
309 */
310 error = xfs_trans_roll_inode(trans, dp);
311 if (error)
312 return error;
313 }
314
315 return 0;
316}
317
318/*
319 * Indiscriminately delete the entire attribute fork
320 *
321 * Recurse (gasp!) through the attribute nodes until we find leaves.
322 * We're doing a depth-first traversal in order to invalidate everything.
323 */
324static int
325xfs_attr3_root_inactive(
326 struct xfs_trans **trans,
327 struct xfs_inode *dp)
328{
329 struct xfs_da_blkinfo *info;
330 struct xfs_buf *bp;
331 xfs_daddr_t blkno;
332 int error;
333
334 /*
335 * Read block 0 to see what we have to work with.
336 * We only get here if we have extents, since we remove
337 * the extents in reverse order the extent containing
338 * block 0 must still be there.
339 */
340 error = xfs_da3_node_read(*trans, dp, 0, -1, &bp, XFS_ATTR_FORK);
341 if (error)
342 return error;
343 blkno = bp->b_bn;
344
345 /*
346 * Invalidate the tree, even if the "tree" is only a single leaf block.
347 * This is a depth-first traversal!
348 */
349 info = bp->b_addr;
350 switch (info->magic) {
351 case cpu_to_be16(XFS_DA_NODE_MAGIC):
352 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
353 error = xfs_attr3_node_inactive(trans, dp, bp, 1);
354 break;
355 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
356 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
357 error = xfs_attr3_leaf_inactive(trans, dp, bp);
358 break;
359 default:
360 error = -EIO;
361 xfs_trans_brelse(*trans, bp);
362 break;
363 }
364 if (error)
365 return error;
366
367 /*
368 * Invalidate the incore copy of the root block.
369 */
370 error = xfs_da_get_buf(*trans, dp, 0, blkno, &bp, XFS_ATTR_FORK);
371 if (error)
372 return error;
373 xfs_trans_binval(*trans, bp); /* remove from cache */
374 /*
375 * Commit the invalidate and start the next transaction.
376 */
377 error = xfs_trans_roll_inode(trans, dp);
378
379 return error;
380}
381
382/*
383 * xfs_attr_inactive kills all traces of an attribute fork on an inode. It
384 * removes both the on-disk and in-memory inode fork. Note that this also has to
385 * handle the condition of inodes without attributes but with an attribute fork
386 * configured, so we can't use xfs_inode_hasattr() here.
387 *
388 * The in-memory attribute fork is removed even on error.
389 */
390int
391xfs_attr_inactive(
392 struct xfs_inode *dp)
393{
394 struct xfs_trans *trans;
395 struct xfs_mount *mp;
396 int lock_mode = XFS_ILOCK_SHARED;
397 int error = 0;
398
399 mp = dp->i_mount;
400 ASSERT(! XFS_NOT_DQATTACHED(mp, dp));
401
402 xfs_ilock(dp, lock_mode);
403 if (!XFS_IFORK_Q(dp))
404 goto out_destroy_fork;
405 xfs_iunlock(dp, lock_mode);
406
407 lock_mode = 0;
408
409 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_attrinval, 0, 0, 0, &trans);
410 if (error)
411 goto out_destroy_fork;
412
413 lock_mode = XFS_ILOCK_EXCL;
414 xfs_ilock(dp, lock_mode);
415
416 if (!XFS_IFORK_Q(dp))
417 goto out_cancel;
418
419 /*
420 * No need to make quota reservations here. We expect to release some
421 * blocks, not allocate, in the common case.
422 */
423 xfs_trans_ijoin(trans, dp, 0);
424
425 /*
426 * Invalidate and truncate the attribute fork extents. Make sure the
427 * fork actually has attributes as otherwise the invalidation has no
428 * blocks to read and returns an error. In this case, just do the fork
429 * removal below.
430 */
431 if (xfs_inode_hasattr(dp) &&
432 dp->i_d.di_aformat != XFS_DINODE_FMT_LOCAL) {
433 error = xfs_attr3_root_inactive(&trans, dp);
434 if (error)
435 goto out_cancel;
436
437 error = xfs_itruncate_extents(&trans, dp, XFS_ATTR_FORK, 0);
438 if (error)
439 goto out_cancel;
440 }
441
442 /* Reset the attribute fork - this also destroys the in-core fork */
443 xfs_attr_fork_remove(dp, trans);
444
445 error = xfs_trans_commit(trans);
446 xfs_iunlock(dp, lock_mode);
447 return error;
448
449out_cancel:
450 xfs_trans_cancel(trans);
451out_destroy_fork:
452 /* kill the in-core attr fork before we drop the inode lock */
453 if (dp->i_afp)
454 xfs_idestroy_fork(dp, XFS_ATTR_FORK);
455 if (lock_mode)
456 xfs_iunlock(dp, lock_mode);
457 return error;
458}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
4 * Copyright (c) 2013 Red Hat, Inc.
5 * All Rights Reserved.
6 */
7#include "xfs.h"
8#include "xfs_fs.h"
9#include "xfs_shared.h"
10#include "xfs_format.h"
11#include "xfs_log_format.h"
12#include "xfs_trans_resv.h"
13#include "xfs_bit.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.h"
19#include "xfs_attr_remote.h"
20#include "xfs_trans.h"
21#include "xfs_bmap.h"
22#include "xfs_attr_leaf.h"
23#include "xfs_quota.h"
24#include "xfs_dir2.h"
25#include "xfs_error.h"
26
27/*
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.
32 */
33STATIC int
34xfs_attr3_rmt_stale(
35 struct xfs_inode *dp,
36 xfs_dablk_t blkno,
37 int blkcnt)
38{
39 struct xfs_bmbt_irec map;
40 int nmap;
41 int error;
42
43 /*
44 * Roll through the "value", invalidating the attribute value's
45 * blocks.
46 */
47 while (blkcnt > 0) {
48 /*
49 * Try to remember where we decided to put the value.
50 */
51 nmap = 1;
52 error = xfs_bmapi_read(dp, (xfs_fileoff_t)blkno, blkcnt,
53 &map, &nmap, XFS_BMAPI_ATTRFORK);
54 if (error)
55 return error;
56 if (XFS_IS_CORRUPT(dp->i_mount, nmap != 1))
57 return -EFSCORRUPTED;
58
59 /*
60 * Mark any incore buffers for the remote value as stale. We
61 * never log remote attr value buffers, so the buffer should be
62 * easy to kill.
63 */
64 error = xfs_attr_rmtval_stale(dp, &map, 0);
65 if (error)
66 return error;
67
68 blkno += map.br_blockcount;
69 blkcnt -= map.br_blockcount;
70 }
71
72 return 0;
73}
74
75/*
76 * Invalidate all of the "remote" value regions pointed to by a particular
77 * leaf block.
78 * Note that we must release the lock on the buffer so that we are not
79 * caught holding something that the logging code wants to flush to disk.
80 */
81STATIC int
82xfs_attr3_leaf_inactive(
83 struct xfs_trans **trans,
84 struct xfs_inode *dp,
85 struct xfs_buf *bp)
86{
87 struct xfs_attr3_icleaf_hdr ichdr;
88 struct xfs_mount *mp = bp->b_mount;
89 struct xfs_attr_leafblock *leaf = bp->b_addr;
90 struct xfs_attr_leaf_entry *entry;
91 struct xfs_attr_leaf_name_remote *name_rmt;
92 int error = 0;
93 int i;
94
95 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
96
97 /*
98 * Find the remote value extents for this leaf and invalidate their
99 * incore buffers.
100 */
101 entry = xfs_attr3_leaf_entryp(leaf);
102 for (i = 0; i < ichdr.count; entry++, i++) {
103 int blkcnt;
104
105 if (!entry->nameidx || (entry->flags & XFS_ATTR_LOCAL))
106 continue;
107
108 name_rmt = xfs_attr3_leaf_name_remote(leaf, i);
109 if (!name_rmt->valueblk)
110 continue;
111
112 blkcnt = xfs_attr3_rmt_blocks(dp->i_mount,
113 be32_to_cpu(name_rmt->valuelen));
114 error = xfs_attr3_rmt_stale(dp,
115 be32_to_cpu(name_rmt->valueblk), blkcnt);
116 if (error)
117 goto err;
118 }
119
120 xfs_trans_brelse(*trans, bp);
121err:
122 return error;
123}
124
125/*
126 * Recurse (gasp!) through the attribute nodes until we find leaves.
127 * We're doing a depth-first traversal in order to invalidate everything.
128 */
129STATIC int
130xfs_attr3_node_inactive(
131 struct xfs_trans **trans,
132 struct xfs_inode *dp,
133 struct xfs_buf *bp,
134 int level)
135{
136 struct xfs_mount *mp = dp->i_mount;
137 struct xfs_da_blkinfo *info;
138 xfs_dablk_t child_fsb;
139 xfs_daddr_t parent_blkno, child_blkno;
140 struct xfs_buf *child_bp;
141 struct xfs_da3_icnode_hdr ichdr;
142 int error, i;
143
144 /*
145 * Since this code is recursive (gasp!) we must protect ourselves.
146 */
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;
151 }
152
153 xfs_da3_node_hdr_from_disk(dp->i_mount, &ichdr, bp->b_addr);
154 parent_blkno = xfs_buf_daddr(bp);
155 if (!ichdr.count) {
156 xfs_trans_brelse(*trans, bp);
157 return 0;
158 }
159 child_fsb = be32_to_cpu(ichdr.btree[0].before);
160 xfs_trans_brelse(*trans, bp); /* no locks for later trans */
161 bp = NULL;
162
163 /*
164 * If this is the node level just above the leaves, simply loop
165 * over the leaves removing all of them. If this is higher up
166 * in the tree, recurse downward.
167 */
168 for (i = 0; i < ichdr.count; i++) {
169 /*
170 * Read the subsidiary block to see what we have to work with.
171 * Don't do this in a transaction. This is a depth-first
172 * traversal of the tree so we may deal with many blocks
173 * before we come back to this one.
174 */
175 error = xfs_da3_node_read(*trans, dp, child_fsb, &child_bp,
176 XFS_ATTR_FORK);
177 if (error)
178 return error;
179
180 /* save for re-read later */
181 child_blkno = xfs_buf_daddr(child_bp);
182
183 /*
184 * Invalidate the subtree, however we have to.
185 */
186 info = child_bp->b_addr;
187 switch (info->magic) {
188 case cpu_to_be16(XFS_DA_NODE_MAGIC):
189 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
190 error = xfs_attr3_node_inactive(trans, dp, child_bp,
191 level + 1);
192 break;
193 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
194 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
195 error = xfs_attr3_leaf_inactive(trans, dp, child_bp);
196 break;
197 default:
198 xfs_buf_mark_corrupt(child_bp);
199 xfs_trans_brelse(*trans, child_bp);
200 error = -EFSCORRUPTED;
201 break;
202 }
203 if (error)
204 return error;
205
206 /*
207 * Remove the subsidiary block from the cache and from the log.
208 */
209 error = xfs_trans_get_buf(*trans, mp->m_ddev_targp,
210 child_blkno,
211 XFS_FSB_TO_BB(mp, mp->m_attr_geo->fsbcount), 0,
212 &child_bp);
213 if (error)
214 return error;
215 xfs_trans_binval(*trans, child_bp);
216 child_bp = NULL;
217
218 /*
219 * If we're not done, re-read the parent to get the next
220 * child block number.
221 */
222 if (i + 1 < ichdr.count) {
223 struct xfs_da3_icnode_hdr phdr;
224
225 error = xfs_da3_node_read_mapped(*trans, dp,
226 parent_blkno, &bp, XFS_ATTR_FORK);
227 if (error)
228 return error;
229 xfs_da3_node_hdr_from_disk(dp->i_mount, &phdr,
230 bp->b_addr);
231 child_fsb = be32_to_cpu(phdr.btree[i + 1].before);
232 xfs_trans_brelse(*trans, bp);
233 bp = NULL;
234 }
235 /*
236 * Atomically commit the whole invalidate stuff.
237 */
238 error = xfs_trans_roll_inode(trans, dp);
239 if (error)
240 return error;
241 }
242
243 return 0;
244}
245
246/*
247 * Indiscriminately delete the entire attribute fork
248 *
249 * Recurse (gasp!) through the attribute nodes until we find leaves.
250 * We're doing a depth-first traversal in order to invalidate everything.
251 */
252static int
253xfs_attr3_root_inactive(
254 struct xfs_trans **trans,
255 struct xfs_inode *dp)
256{
257 struct xfs_mount *mp = dp->i_mount;
258 struct xfs_da_blkinfo *info;
259 struct xfs_buf *bp;
260 xfs_daddr_t blkno;
261 int error;
262
263 /*
264 * Read block 0 to see what we have to work with.
265 * We only get here if we have extents, since we remove
266 * the extents in reverse order the extent containing
267 * block 0 must still be there.
268 */
269 error = xfs_da3_node_read(*trans, dp, 0, &bp, XFS_ATTR_FORK);
270 if (error)
271 return error;
272 blkno = xfs_buf_daddr(bp);
273
274 /*
275 * Invalidate the tree, even if the "tree" is only a single leaf block.
276 * This is a depth-first traversal!
277 */
278 info = bp->b_addr;
279 switch (info->magic) {
280 case cpu_to_be16(XFS_DA_NODE_MAGIC):
281 case cpu_to_be16(XFS_DA3_NODE_MAGIC):
282 error = xfs_attr3_node_inactive(trans, dp, bp, 1);
283 break;
284 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC):
285 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC):
286 error = xfs_attr3_leaf_inactive(trans, dp, bp);
287 break;
288 default:
289 error = -EFSCORRUPTED;
290 xfs_buf_mark_corrupt(bp);
291 xfs_trans_brelse(*trans, bp);
292 break;
293 }
294 if (error)
295 return error;
296
297 /*
298 * Invalidate the incore copy of the root block.
299 */
300 error = xfs_trans_get_buf(*trans, mp->m_ddev_targp, blkno,
301 XFS_FSB_TO_BB(mp, mp->m_attr_geo->fsbcount), 0, &bp);
302 if (error)
303 return error;
304 error = bp->b_error;
305 if (error) {
306 xfs_trans_brelse(*trans, bp);
307 return error;
308 }
309 xfs_trans_binval(*trans, bp); /* remove from cache */
310 /*
311 * Commit the invalidate and start the next transaction.
312 */
313 error = xfs_trans_roll_inode(trans, dp);
314
315 return error;
316}
317
318/*
319 * xfs_attr_inactive kills all traces of an attribute fork on an inode. It
320 * removes both the on-disk and in-memory inode fork. Note that this also has to
321 * handle the condition of inodes without attributes but with an attribute fork
322 * configured, so we can't use xfs_inode_hasattr() here.
323 *
324 * The in-memory attribute fork is removed even on error.
325 */
326int
327xfs_attr_inactive(
328 struct xfs_inode *dp)
329{
330 struct xfs_trans *trans;
331 struct xfs_mount *mp;
332 int lock_mode = XFS_ILOCK_SHARED;
333 int error = 0;
334
335 mp = dp->i_mount;
336 ASSERT(! XFS_NOT_DQATTACHED(mp, dp));
337
338 xfs_ilock(dp, lock_mode);
339 if (!xfs_inode_has_attr_fork(dp))
340 goto out_destroy_fork;
341 xfs_iunlock(dp, lock_mode);
342
343 lock_mode = 0;
344
345 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_attrinval, 0, 0, 0, &trans);
346 if (error)
347 goto out_destroy_fork;
348
349 lock_mode = XFS_ILOCK_EXCL;
350 xfs_ilock(dp, lock_mode);
351
352 if (!xfs_inode_has_attr_fork(dp))
353 goto out_cancel;
354
355 /*
356 * No need to make quota reservations here. We expect to release some
357 * blocks, not allocate, in the common case.
358 */
359 xfs_trans_ijoin(trans, dp, 0);
360
361 /*
362 * Invalidate and truncate the attribute fork extents. Make sure the
363 * fork actually has xattr blocks as otherwise the invalidation has no
364 * blocks to read and returns an error. In this case, just do the fork
365 * removal below.
366 */
367 if (dp->i_af.if_nextents > 0) {
368 error = xfs_attr3_root_inactive(&trans, dp);
369 if (error)
370 goto out_cancel;
371
372 error = xfs_itruncate_extents(&trans, dp, XFS_ATTR_FORK, 0);
373 if (error)
374 goto out_cancel;
375 }
376
377 /* Reset the attribute fork - this also destroys the in-core fork */
378 xfs_attr_fork_remove(dp, trans);
379
380 error = xfs_trans_commit(trans);
381 xfs_iunlock(dp, lock_mode);
382 return error;
383
384out_cancel:
385 xfs_trans_cancel(trans);
386out_destroy_fork:
387 /* kill the in-core attr fork before we drop the inode lock */
388 xfs_ifork_zap_attr(dp);
389 if (lock_mode)
390 xfs_iunlock(dp, lock_mode);
391 return error;
392}