Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
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 | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
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. | |
1da177e4 | 13 | * |
7b718769 NS |
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 | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
70a9883c | 20 | #include "xfs_shared.h" |
239880ef DC |
21 | #include "xfs_format.h" |
22 | #include "xfs_log_format.h" | |
23 | #include "xfs_trans_resv.h" | |
a844f451 | 24 | #include "xfs_bit.h" |
1da177e4 LT |
25 | #include "xfs_sb.h" |
26 | #include "xfs_ag.h" | |
1da177e4 | 27 | #include "xfs_mount.h" |
57062787 | 28 | #include "xfs_da_format.h" |
a844f451 | 29 | #include "xfs_da_btree.h" |
a844f451 | 30 | #include "xfs_attr_sf.h" |
1da177e4 | 31 | #include "xfs_inode.h" |
a844f451 | 32 | #include "xfs_alloc.h" |
239880ef | 33 | #include "xfs_trans.h" |
a844f451 | 34 | #include "xfs_inode_item.h" |
1da177e4 | 35 | #include "xfs_bmap.h" |
68988114 | 36 | #include "xfs_bmap_util.h" |
a4fbe6ab | 37 | #include "xfs_bmap_btree.h" |
1da177e4 LT |
38 | #include "xfs_attr.h" |
39 | #include "xfs_attr_leaf.h" | |
95920cd6 | 40 | #include "xfs_attr_remote.h" |
1da177e4 | 41 | #include "xfs_error.h" |
1da177e4 | 42 | #include "xfs_quota.h" |
1da177e4 | 43 | #include "xfs_trans_space.h" |
0b1b213f | 44 | #include "xfs_trace.h" |
a4fbe6ab | 45 | #include "xfs_dinode.h" |
1da177e4 LT |
46 | |
47 | /* | |
48 | * xfs_attr.c | |
49 | * | |
50 | * Provide the external interfaces to manage attribute lists. | |
51 | */ | |
52 | ||
53 | /*======================================================================== | |
54 | * Function prototypes for the kernel. | |
55 | *========================================================================*/ | |
56 | ||
57 | /* | |
58 | * Internal routines when attribute list fits inside the inode. | |
59 | */ | |
60 | STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args); | |
61 | ||
62 | /* | |
63 | * Internal routines when attribute list is one block. | |
64 | */ | |
ba0f32d4 | 65 | STATIC int xfs_attr_leaf_get(xfs_da_args_t *args); |
1da177e4 LT |
66 | STATIC int xfs_attr_leaf_addname(xfs_da_args_t *args); |
67 | STATIC int xfs_attr_leaf_removename(xfs_da_args_t *args); | |
1da177e4 LT |
68 | |
69 | /* | |
70 | * Internal routines when attribute list is more than one block. | |
71 | */ | |
ba0f32d4 | 72 | STATIC int xfs_attr_node_get(xfs_da_args_t *args); |
1da177e4 LT |
73 | STATIC int xfs_attr_node_addname(xfs_da_args_t *args); |
74 | STATIC int xfs_attr_node_removename(xfs_da_args_t *args); | |
1da177e4 LT |
75 | STATIC int xfs_attr_fillstate(xfs_da_state_t *state); |
76 | STATIC int xfs_attr_refillstate(xfs_da_state_t *state); | |
77 | ||
1da177e4 | 78 | |
e8b0ebaa BN |
79 | STATIC int |
80 | xfs_attr_name_to_xname( | |
81 | struct xfs_name *xname, | |
a9273ca5 | 82 | const unsigned char *aname) |
e8b0ebaa BN |
83 | { |
84 | if (!aname) | |
85 | return EINVAL; | |
86 | xname->name = aname; | |
a9273ca5 | 87 | xname->len = strlen((char *)aname); |
e8b0ebaa BN |
88 | if (xname->len >= MAXNAMELEN) |
89 | return EFAULT; /* match IRIX behaviour */ | |
90 | ||
91 | return 0; | |
92 | } | |
1da177e4 | 93 | |
abec5f2b | 94 | int |
caf8aabd CH |
95 | xfs_inode_hasattr( |
96 | struct xfs_inode *ip) | |
97 | { | |
98 | if (!XFS_IFORK_Q(ip) || | |
99 | (ip->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS && | |
100 | ip->i_d.di_anextents == 0)) | |
101 | return 0; | |
102 | return 1; | |
103 | } | |
104 | ||
1da177e4 LT |
105 | /*======================================================================== |
106 | * Overall external interface routines. | |
107 | *========================================================================*/ | |
108 | ||
b87d022c CH |
109 | int |
110 | xfs_attr_get( | |
e82fa0c7 | 111 | struct xfs_inode *ip, |
b87d022c | 112 | const unsigned char *name, |
a9273ca5 | 113 | unsigned char *value, |
e82fa0c7 CH |
114 | int *valuelenp, |
115 | int flags) | |
1da177e4 | 116 | { |
b87d022c CH |
117 | struct xfs_da_args args; |
118 | struct xfs_name xname; | |
119 | uint lock_mode; | |
120 | int error; | |
121 | ||
122 | XFS_STATS_INC(xs_attr_get); | |
123 | ||
124 | if (XFS_FORCED_SHUTDOWN(ip->i_mount)) | |
125 | return EIO; | |
1da177e4 | 126 | |
caf8aabd CH |
127 | if (!xfs_inode_hasattr(ip)) |
128 | return ENOATTR; | |
1da177e4 | 129 | |
b87d022c CH |
130 | error = xfs_attr_name_to_xname(&xname, name); |
131 | if (error) | |
132 | return error; | |
133 | ||
134 | memset(&args, 0, sizeof(args)); | |
135 | args.name = xname.name; | |
136 | args.namelen = xname.len; | |
1da177e4 LT |
137 | args.value = value; |
138 | args.valuelen = *valuelenp; | |
139 | args.flags = flags; | |
140 | args.hashval = xfs_da_hashname(args.name, args.namelen); | |
141 | args.dp = ip; | |
142 | args.whichfork = XFS_ATTR_FORK; | |
143 | ||
b87d022c CH |
144 | lock_mode = xfs_ilock_attr_map_shared(ip); |
145 | if (!xfs_inode_hasattr(ip)) | |
146 | error = ENOATTR; | |
147 | else if (ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) | |
1da177e4 | 148 | error = xfs_attr_shortform_getvalue(&args); |
b87d022c | 149 | else if (xfs_bmap_one_block(ip, XFS_ATTR_FORK)) |
1da177e4 | 150 | error = xfs_attr_leaf_get(&args); |
b87d022c | 151 | else |
1da177e4 | 152 | error = xfs_attr_node_get(&args); |
b87d022c | 153 | xfs_iunlock(ip, lock_mode); |
1da177e4 | 154 | |
1da177e4 | 155 | *valuelenp = args.valuelen; |
b87d022c | 156 | return error == EEXIST ? 0 : error; |
1da177e4 LT |
157 | } |
158 | ||
5e9da7b7 NS |
159 | /* |
160 | * Calculate how many blocks we need for the new attribute, | |
161 | */ | |
5d77c0dc | 162 | STATIC int |
5e9da7b7 NS |
163 | xfs_attr_calc_size( |
164 | struct xfs_inode *ip, | |
165 | int namelen, | |
166 | int valuelen, | |
167 | int *local) | |
168 | { | |
169 | struct xfs_mount *mp = ip->i_mount; | |
170 | int size; | |
171 | int nblks; | |
172 | ||
173 | /* | |
174 | * Determine space new attribute will use, and if it would be | |
175 | * "local" or "remote" (note: local != inline). | |
176 | */ | |
177 | size = xfs_attr_leaf_newentsize(namelen, valuelen, | |
178 | mp->m_sb.sb_blocksize, local); | |
179 | ||
180 | nblks = XFS_DAENTER_SPACE_RES(mp, XFS_ATTR_FORK); | |
181 | if (*local) { | |
182 | if (size > (mp->m_sb.sb_blocksize >> 1)) { | |
183 | /* Double split possible */ | |
184 | nblks *= 2; | |
185 | } | |
186 | } else { | |
187 | /* | |
188 | * Out of line attribute, cannot double split, but | |
189 | * make room for the attribute value itself. | |
190 | */ | |
191 | uint dblocks = XFS_B_TO_FSB(mp, valuelen); | |
192 | nblks += dblocks; | |
193 | nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK); | |
194 | } | |
195 | ||
196 | return nblks; | |
197 | } | |
198 | ||
c5b4ac39 CH |
199 | int |
200 | xfs_attr_set( | |
201 | struct xfs_inode *dp, | |
202 | const unsigned char *name, | |
203 | unsigned char *value, | |
204 | int valuelen, | |
205 | int flags) | |
1da177e4 | 206 | { |
3d3c8b52 | 207 | struct xfs_mount *mp = dp->i_mount; |
c5b4ac39 CH |
208 | struct xfs_da_args args; |
209 | struct xfs_bmap_free flist; | |
3d3c8b52 | 210 | struct xfs_trans_res tres; |
c5b4ac39 CH |
211 | struct xfs_name xname; |
212 | xfs_fsblock_t firstblock; | |
3d3c8b52 | 213 | int rsvd = (flags & ATTR_ROOT) != 0; |
c5b4ac39 CH |
214 | int error, err2, committed, local; |
215 | ||
216 | XFS_STATS_INC(xs_attr_set); | |
217 | ||
218 | if (XFS_FORCED_SHUTDOWN(dp->i_mount)) | |
219 | return EIO; | |
220 | ||
221 | error = xfs_attr_name_to_xname(&xname, name); | |
222 | if (error) | |
223 | return error; | |
1da177e4 | 224 | |
7d095257 CH |
225 | error = xfs_qm_dqattach(dp, 0); |
226 | if (error) | |
227 | return error; | |
1da177e4 LT |
228 | |
229 | /* | |
230 | * If the inode doesn't have an attribute fork, add one. | |
231 | * (inode must not be locked when we call this routine) | |
232 | */ | |
233 | if (XFS_IFORK_Q(dp) == 0) { | |
e5889e90 | 234 | int sf_size = sizeof(xfs_attr_sf_hdr_t) + |
c5b4ac39 | 235 | XFS_ATTR_SF_ENTSIZE_BYNAME(xname.len, valuelen); |
e5889e90 | 236 | |
c5b4ac39 CH |
237 | error = xfs_bmap_add_attrfork(dp, sf_size, rsvd); |
238 | if (error) | |
239 | return error; | |
1da177e4 LT |
240 | } |
241 | ||
c5b4ac39 CH |
242 | memset(&args, 0, sizeof(args)); |
243 | args.name = xname.name; | |
244 | args.namelen = xname.len; | |
1da177e4 LT |
245 | args.value = value; |
246 | args.valuelen = valuelen; | |
247 | args.flags = flags; | |
248 | args.hashval = xfs_da_hashname(args.name, args.namelen); | |
249 | args.dp = dp; | |
250 | args.firstblock = &firstblock; | |
251 | args.flist = &flist; | |
252 | args.whichfork = XFS_ATTR_FORK; | |
6a178100 | 253 | args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT; |
1da177e4 | 254 | |
1da177e4 | 255 | /* Size is now blocks for attribute data */ |
c5b4ac39 | 256 | args.total = xfs_attr_calc_size(dp, xname.len, valuelen, &local); |
1da177e4 LT |
257 | |
258 | /* | |
259 | * Start our first transaction of the day. | |
260 | * | |
261 | * All future transactions during this code must be "chained" off | |
262 | * this one via the trans_dup() call. All transactions will contain | |
263 | * the inode, and the inode will always be marked with trans_ihold(). | |
264 | * Since the inode will be locked in all transactions, we must log | |
265 | * the inode in every transaction to let it float upward through | |
266 | * the log. | |
267 | */ | |
268 | args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_SET); | |
269 | ||
270 | /* | |
271 | * Root fork attributes can use reserved data blocks for this | |
272 | * operation if necessary | |
273 | */ | |
274 | ||
275 | if (rsvd) | |
276 | args.trans->t_flags |= XFS_TRANS_RESERVE; | |
277 | ||
3d3c8b52 JL |
278 | tres.tr_logres = M_RES(mp)->tr_attrsetm.tr_logres + |
279 | M_RES(mp)->tr_attrsetrt.tr_logres * args.total; | |
280 | tres.tr_logcount = XFS_ATTRSET_LOG_COUNT; | |
281 | tres.tr_logflags = XFS_TRANS_PERM_LOG_RES; | |
282 | error = xfs_trans_reserve(args.trans, &tres, args.total, 0); | |
a21cd503 | 283 | if (error) { |
1da177e4 | 284 | xfs_trans_cancel(args.trans, 0); |
c5b4ac39 | 285 | return error; |
1da177e4 LT |
286 | } |
287 | xfs_ilock(dp, XFS_ILOCK_EXCL); | |
288 | ||
7d095257 | 289 | error = xfs_trans_reserve_quota_nblks(args.trans, dp, args.total, 0, |
5e9da7b7 NS |
290 | rsvd ? XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES : |
291 | XFS_QMOPT_RES_REGBLKS); | |
1da177e4 LT |
292 | if (error) { |
293 | xfs_iunlock(dp, XFS_ILOCK_EXCL); | |
294 | xfs_trans_cancel(args.trans, XFS_TRANS_RELEASE_LOG_RES); | |
c5b4ac39 | 295 | return error; |
1da177e4 LT |
296 | } |
297 | ||
ddc3415a | 298 | xfs_trans_ijoin(args.trans, dp, 0); |
1da177e4 LT |
299 | |
300 | /* | |
c41564b5 | 301 | * If the attribute list is non-existent or a shortform list, |
1da177e4 LT |
302 | * upgrade it to a single-leaf-block attribute list. |
303 | */ | |
c5b4ac39 CH |
304 | if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL || |
305 | (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS && | |
306 | dp->i_d.di_anextents == 0)) { | |
1da177e4 LT |
307 | |
308 | /* | |
309 | * Build initial attribute list (if required). | |
310 | */ | |
311 | if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) | |
d8cc890d | 312 | xfs_attr_shortform_create(&args); |
1da177e4 LT |
313 | |
314 | /* | |
315 | * Try to add the attr to the attribute list in | |
316 | * the inode. | |
317 | */ | |
318 | error = xfs_attr_shortform_addname(&args); | |
319 | if (error != ENOSPC) { | |
320 | /* | |
321 | * Commit the shortform mods, and we're done. | |
322 | * NOTE: this is also the error path (EEXIST, etc). | |
323 | */ | |
324 | ASSERT(args.trans != NULL); | |
325 | ||
326 | /* | |
327 | * If this is a synchronous mount, make sure that | |
328 | * the transaction goes to disk before returning | |
329 | * to the user. | |
330 | */ | |
c5b4ac39 | 331 | if (mp->m_flags & XFS_MOUNT_WSYNC) |
1da177e4 | 332 | xfs_trans_set_sync(args.trans); |
dcd79a14 DC |
333 | |
334 | if (!error && (flags & ATTR_KERNOTIME) == 0) { | |
335 | xfs_trans_ichgtime(args.trans, dp, | |
336 | XFS_ICHGTIME_CHG); | |
337 | } | |
1da177e4 | 338 | err2 = xfs_trans_commit(args.trans, |
1c72bf90 | 339 | XFS_TRANS_RELEASE_LOG_RES); |
1da177e4 LT |
340 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
341 | ||
c5b4ac39 | 342 | return error ? error : err2; |
1da177e4 LT |
343 | } |
344 | ||
345 | /* | |
346 | * It won't fit in the shortform, transform to a leaf block. | |
347 | * GROT: another possible req'mt for a double-split btree op. | |
348 | */ | |
9d87c319 | 349 | xfs_bmap_init(args.flist, args.firstblock); |
1da177e4 LT |
350 | error = xfs_attr_shortform_to_leaf(&args); |
351 | if (!error) { | |
352 | error = xfs_bmap_finish(&args.trans, args.flist, | |
f7c99b6f | 353 | &committed); |
1da177e4 LT |
354 | } |
355 | if (error) { | |
356 | ASSERT(committed); | |
357 | args.trans = NULL; | |
358 | xfs_bmap_cancel(&flist); | |
359 | goto out; | |
360 | } | |
361 | ||
362 | /* | |
363 | * bmap_finish() may have committed the last trans and started | |
364 | * a new one. We need the inode to be in all transactions. | |
365 | */ | |
898621d5 | 366 | if (committed) |
ddc3415a | 367 | xfs_trans_ijoin(args.trans, dp, 0); |
1da177e4 LT |
368 | |
369 | /* | |
370 | * Commit the leaf transformation. We'll need another (linked) | |
371 | * transaction to add the new attribute to the leaf. | |
372 | */ | |
322ff6b8 NS |
373 | |
374 | error = xfs_trans_roll(&args.trans, dp); | |
375 | if (error) | |
1da177e4 LT |
376 | goto out; |
377 | ||
378 | } | |
379 | ||
c5b4ac39 | 380 | if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) |
1da177e4 | 381 | error = xfs_attr_leaf_addname(&args); |
c5b4ac39 | 382 | else |
1da177e4 | 383 | error = xfs_attr_node_addname(&args); |
c5b4ac39 | 384 | if (error) |
1da177e4 | 385 | goto out; |
1da177e4 LT |
386 | |
387 | /* | |
388 | * If this is a synchronous mount, make sure that the | |
389 | * transaction goes to disk before returning to the user. | |
390 | */ | |
c5b4ac39 | 391 | if (mp->m_flags & XFS_MOUNT_WSYNC) |
1da177e4 | 392 | xfs_trans_set_sync(args.trans); |
1da177e4 | 393 | |
dcd79a14 DC |
394 | if ((flags & ATTR_KERNOTIME) == 0) |
395 | xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG); | |
396 | ||
1da177e4 LT |
397 | /* |
398 | * Commit the last in the sequence of transactions. | |
399 | */ | |
400 | xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE); | |
1c72bf90 | 401 | error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES); |
1da177e4 LT |
402 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
403 | ||
c5b4ac39 | 404 | return error; |
1da177e4 LT |
405 | |
406 | out: | |
c5b4ac39 | 407 | if (args.trans) { |
1da177e4 LT |
408 | xfs_trans_cancel(args.trans, |
409 | XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT); | |
c5b4ac39 | 410 | } |
1da177e4 | 411 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
c5b4ac39 | 412 | return error; |
aa82daa0 NS |
413 | } |
414 | ||
415 | /* | |
416 | * Generic handler routine to remove a name from an attribute list. | |
417 | * Transitions attribute list from Btree to shortform as necessary. | |
418 | */ | |
e8b0ebaa BN |
419 | STATIC int |
420 | xfs_attr_remove_int(xfs_inode_t *dp, struct xfs_name *name, int flags) | |
aa82daa0 NS |
421 | { |
422 | xfs_da_args_t args; | |
423 | xfs_fsblock_t firstblock; | |
424 | xfs_bmap_free_t flist; | |
425 | int error; | |
426 | xfs_mount_t *mp = dp->i_mount; | |
427 | ||
1da177e4 LT |
428 | /* |
429 | * Fill in the arg structure for this request. | |
430 | */ | |
431 | memset((char *)&args, 0, sizeof(args)); | |
e8b0ebaa BN |
432 | args.name = name->name; |
433 | args.namelen = name->len; | |
1da177e4 LT |
434 | args.flags = flags; |
435 | args.hashval = xfs_da_hashname(args.name, args.namelen); | |
436 | args.dp = dp; | |
437 | args.firstblock = &firstblock; | |
438 | args.flist = &flist; | |
439 | args.total = 0; | |
440 | args.whichfork = XFS_ATTR_FORK; | |
441 | ||
4a338212 DC |
442 | /* |
443 | * we have no control over the attribute names that userspace passes us | |
444 | * to remove, so we have to allow the name lookup prior to attribute | |
445 | * removal to fail. | |
446 | */ | |
447 | args.op_flags = XFS_DA_OP_OKNOENT; | |
448 | ||
1da177e4 LT |
449 | /* |
450 | * Attach the dquots to the inode. | |
451 | */ | |
7d095257 CH |
452 | error = xfs_qm_dqattach(dp, 0); |
453 | if (error) | |
454 | return error; | |
1da177e4 LT |
455 | |
456 | /* | |
457 | * Start our first transaction of the day. | |
458 | * | |
459 | * All future transactions during this code must be "chained" off | |
460 | * this one via the trans_dup() call. All transactions will contain | |
461 | * the inode, and the inode will always be marked with trans_ihold(). | |
462 | * Since the inode will be locked in all transactions, we must log | |
463 | * the inode in every transaction to let it float upward through | |
464 | * the log. | |
465 | */ | |
466 | args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM); | |
467 | ||
468 | /* | |
469 | * Root fork attributes can use reserved data blocks for this | |
470 | * operation if necessary | |
471 | */ | |
472 | ||
473 | if (flags & ATTR_ROOT) | |
474 | args.trans->t_flags |= XFS_TRANS_RESERVE; | |
475 | ||
3d3c8b52 JL |
476 | error = xfs_trans_reserve(args.trans, &M_RES(mp)->tr_attrrm, |
477 | XFS_ATTRRM_SPACE_RES(mp), 0); | |
478 | if (error) { | |
1da177e4 LT |
479 | xfs_trans_cancel(args.trans, 0); |
480 | return(error); | |
1da177e4 LT |
481 | } |
482 | ||
483 | xfs_ilock(dp, XFS_ILOCK_EXCL); | |
484 | /* | |
485 | * No need to make quota reservations here. We expect to release some | |
486 | * blocks not allocate in the common case. | |
487 | */ | |
ddc3415a | 488 | xfs_trans_ijoin(args.trans, dp, 0); |
1da177e4 LT |
489 | |
490 | /* | |
491 | * Decide on what work routines to call based on the inode size. | |
492 | */ | |
caf8aabd | 493 | if (!xfs_inode_hasattr(dp)) { |
1da177e4 LT |
494 | error = XFS_ERROR(ENOATTR); |
495 | goto out; | |
496 | } | |
497 | if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) { | |
498 | ASSERT(dp->i_afp->if_flags & XFS_IFINLINE); | |
499 | error = xfs_attr_shortform_remove(&args); | |
500 | if (error) { | |
501 | goto out; | |
502 | } | |
503 | } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) { | |
504 | error = xfs_attr_leaf_removename(&args); | |
505 | } else { | |
506 | error = xfs_attr_node_removename(&args); | |
507 | } | |
508 | if (error) { | |
509 | goto out; | |
510 | } | |
511 | ||
512 | /* | |
513 | * If this is a synchronous mount, make sure that the | |
514 | * transaction goes to disk before returning to the user. | |
515 | */ | |
516 | if (mp->m_flags & XFS_MOUNT_WSYNC) { | |
517 | xfs_trans_set_sync(args.trans); | |
518 | } | |
519 | ||
dcd79a14 DC |
520 | if ((flags & ATTR_KERNOTIME) == 0) |
521 | xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG); | |
522 | ||
1da177e4 LT |
523 | /* |
524 | * Commit the last in the sequence of transactions. | |
525 | */ | |
526 | xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE); | |
1c72bf90 | 527 | error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES); |
1da177e4 LT |
528 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
529 | ||
1da177e4 LT |
530 | return(error); |
531 | ||
532 | out: | |
533 | if (args.trans) | |
534 | xfs_trans_cancel(args.trans, | |
535 | XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT); | |
536 | xfs_iunlock(dp, XFS_ILOCK_EXCL); | |
537 | return(error); | |
538 | } | |
539 | ||
aa82daa0 | 540 | int |
993386c1 CH |
541 | xfs_attr_remove( |
542 | xfs_inode_t *dp, | |
a9273ca5 | 543 | const unsigned char *name, |
993386c1 | 544 | int flags) |
aa82daa0 | 545 | { |
e8b0ebaa BN |
546 | int error; |
547 | struct xfs_name xname; | |
aa82daa0 NS |
548 | |
549 | XFS_STATS_INC(xs_attr_remove); | |
550 | ||
aa82daa0 NS |
551 | if (XFS_FORCED_SHUTDOWN(dp->i_mount)) |
552 | return (EIO); | |
553 | ||
e8b0ebaa BN |
554 | error = xfs_attr_name_to_xname(&xname, name); |
555 | if (error) | |
556 | return error; | |
557 | ||
aa82daa0 | 558 | xfs_ilock(dp, XFS_ILOCK_SHARED); |
caf8aabd | 559 | if (!xfs_inode_hasattr(dp)) { |
aa82daa0 | 560 | xfs_iunlock(dp, XFS_ILOCK_SHARED); |
caf8aabd | 561 | return XFS_ERROR(ENOATTR); |
aa82daa0 NS |
562 | } |
563 | xfs_iunlock(dp, XFS_ILOCK_SHARED); | |
564 | ||
e8b0ebaa | 565 | return xfs_attr_remove_int(dp, &xname, flags); |
aa82daa0 NS |
566 | } |
567 | ||
1da177e4 LT |
568 | |
569 | /*======================================================================== | |
570 | * External routines when attribute list is inside the inode | |
571 | *========================================================================*/ | |
572 | ||
573 | /* | |
574 | * Add a name to the shortform attribute list structure | |
575 | * This is the external routine. | |
576 | */ | |
577 | STATIC int | |
578 | xfs_attr_shortform_addname(xfs_da_args_t *args) | |
579 | { | |
d8cc890d | 580 | int newsize, forkoff, retval; |
1da177e4 | 581 | |
5a5881cd DC |
582 | trace_xfs_attr_sf_addname(args); |
583 | ||
1da177e4 LT |
584 | retval = xfs_attr_shortform_lookup(args); |
585 | if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) { | |
586 | return(retval); | |
587 | } else if (retval == EEXIST) { | |
588 | if (args->flags & ATTR_CREATE) | |
589 | return(retval); | |
590 | retval = xfs_attr_shortform_remove(args); | |
591 | ASSERT(retval == 0); | |
592 | } | |
593 | ||
d8cc890d NS |
594 | if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX || |
595 | args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX) | |
596 | return(XFS_ERROR(ENOSPC)); | |
597 | ||
1da177e4 LT |
598 | newsize = XFS_ATTR_SF_TOTSIZE(args->dp); |
599 | newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen); | |
d8cc890d NS |
600 | |
601 | forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize); | |
602 | if (!forkoff) | |
1da177e4 | 603 | return(XFS_ERROR(ENOSPC)); |
d8cc890d NS |
604 | |
605 | xfs_attr_shortform_add(args, forkoff); | |
1da177e4 LT |
606 | return(0); |
607 | } | |
608 | ||
609 | ||
610 | /*======================================================================== | |
611 | * External routines when attribute list is one block | |
612 | *========================================================================*/ | |
613 | ||
614 | /* | |
615 | * Add a name to the leaf attribute list structure | |
616 | * | |
617 | * This leaf block cannot have a "remote" value, we only call this routine | |
618 | * if bmap_one_block() says there is only one block (ie: no remote blks). | |
619 | */ | |
a8272ce0 | 620 | STATIC int |
1da177e4 LT |
621 | xfs_attr_leaf_addname(xfs_da_args_t *args) |
622 | { | |
623 | xfs_inode_t *dp; | |
1d9025e5 | 624 | struct xfs_buf *bp; |
d8cc890d | 625 | int retval, error, committed, forkoff; |
1da177e4 | 626 | |
5a5881cd DC |
627 | trace_xfs_attr_leaf_addname(args); |
628 | ||
1da177e4 LT |
629 | /* |
630 | * Read the (only) block in the attribute list in. | |
631 | */ | |
632 | dp = args->dp; | |
633 | args->blkno = 0; | |
517c2220 | 634 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
1da177e4 | 635 | if (error) |
ad14c33a | 636 | return error; |
1da177e4 LT |
637 | |
638 | /* | |
639 | * Look up the given attribute in the leaf block. Figure out if | |
640 | * the given flags produce an error or call for an atomic rename. | |
641 | */ | |
517c2220 | 642 | retval = xfs_attr3_leaf_lookup_int(bp, args); |
1da177e4 | 643 | if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) { |
1d9025e5 | 644 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 645 | return retval; |
1da177e4 LT |
646 | } else if (retval == EEXIST) { |
647 | if (args->flags & ATTR_CREATE) { /* pure create op */ | |
1d9025e5 | 648 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 649 | return retval; |
1da177e4 | 650 | } |
5a5881cd DC |
651 | |
652 | trace_xfs_attr_leaf_replace(args); | |
653 | ||
6a178100 | 654 | args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */ |
1da177e4 LT |
655 | args->blkno2 = args->blkno; /* set 2nd entry info*/ |
656 | args->index2 = args->index; | |
657 | args->rmtblkno2 = args->rmtblkno; | |
658 | args->rmtblkcnt2 = args->rmtblkcnt; | |
659 | } | |
660 | ||
661 | /* | |
662 | * Add the attribute to the leaf block, transitioning to a Btree | |
663 | * if required. | |
664 | */ | |
517c2220 | 665 | retval = xfs_attr3_leaf_add(bp, args); |
1da177e4 LT |
666 | if (retval == ENOSPC) { |
667 | /* | |
668 | * Promote the attribute list to the Btree format, then | |
669 | * Commit that transaction so that the node_addname() call | |
670 | * can manage its own transactions. | |
671 | */ | |
9d87c319 | 672 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 673 | error = xfs_attr3_leaf_to_node(args); |
1da177e4 LT |
674 | if (!error) { |
675 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 676 | &committed); |
1da177e4 LT |
677 | } |
678 | if (error) { | |
679 | ASSERT(committed); | |
680 | args->trans = NULL; | |
681 | xfs_bmap_cancel(args->flist); | |
682 | return(error); | |
683 | } | |
684 | ||
685 | /* | |
686 | * bmap_finish() may have committed the last trans and started | |
687 | * a new one. We need the inode to be in all transactions. | |
688 | */ | |
898621d5 | 689 | if (committed) |
ddc3415a | 690 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
691 | |
692 | /* | |
693 | * Commit the current trans (including the inode) and start | |
694 | * a new one. | |
695 | */ | |
322ff6b8 NS |
696 | error = xfs_trans_roll(&args->trans, dp); |
697 | if (error) | |
1da177e4 LT |
698 | return (error); |
699 | ||
700 | /* | |
701 | * Fob the whole rest of the problem off on the Btree code. | |
702 | */ | |
703 | error = xfs_attr_node_addname(args); | |
704 | return(error); | |
705 | } | |
706 | ||
707 | /* | |
708 | * Commit the transaction that added the attr name so that | |
709 | * later routines can manage their own transactions. | |
710 | */ | |
322ff6b8 NS |
711 | error = xfs_trans_roll(&args->trans, dp); |
712 | if (error) | |
1da177e4 LT |
713 | return (error); |
714 | ||
715 | /* | |
716 | * If there was an out-of-line value, allocate the blocks we | |
717 | * identified for its storage and copy the value. This is done | |
718 | * after we create the attribute so that we don't overflow the | |
719 | * maximum size of a transaction and/or hit a deadlock. | |
720 | */ | |
721 | if (args->rmtblkno > 0) { | |
722 | error = xfs_attr_rmtval_set(args); | |
723 | if (error) | |
724 | return(error); | |
725 | } | |
726 | ||
727 | /* | |
728 | * If this is an atomic rename operation, we must "flip" the | |
729 | * incomplete flags on the "new" and "old" attribute/value pairs | |
730 | * so that one disappears and one appears atomically. Then we | |
731 | * must remove the "old" attribute/value pair. | |
732 | */ | |
6a178100 | 733 | if (args->op_flags & XFS_DA_OP_RENAME) { |
1da177e4 LT |
734 | /* |
735 | * In a separate transaction, set the incomplete flag on the | |
736 | * "old" attr and clear the incomplete flag on the "new" attr. | |
737 | */ | |
517c2220 | 738 | error = xfs_attr3_leaf_flipflags(args); |
1da177e4 LT |
739 | if (error) |
740 | return(error); | |
741 | ||
742 | /* | |
743 | * Dismantle the "old" attribute/value pair by removing | |
744 | * a "remote" value (if it exists). | |
745 | */ | |
746 | args->index = args->index2; | |
747 | args->blkno = args->blkno2; | |
748 | args->rmtblkno = args->rmtblkno2; | |
749 | args->rmtblkcnt = args->rmtblkcnt2; | |
750 | if (args->rmtblkno) { | |
751 | error = xfs_attr_rmtval_remove(args); | |
752 | if (error) | |
753 | return(error); | |
754 | } | |
755 | ||
756 | /* | |
757 | * Read in the block containing the "old" attr, then | |
758 | * remove the "old" attr from that block (neat, huh!) | |
759 | */ | |
517c2220 | 760 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, |
ad14c33a | 761 | -1, &bp); |
1da177e4 | 762 | if (error) |
ad14c33a DC |
763 | return error; |
764 | ||
517c2220 | 765 | xfs_attr3_leaf_remove(bp, args); |
1da177e4 LT |
766 | |
767 | /* | |
768 | * If the result is small enough, shrink it all into the inode. | |
769 | */ | |
d8cc890d | 770 | if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) { |
9d87c319 | 771 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 772 | error = xfs_attr3_leaf_to_shortform(bp, args, forkoff); |
1da177e4 LT |
773 | /* bp is gone due to xfs_da_shrink_inode */ |
774 | if (!error) { | |
775 | error = xfs_bmap_finish(&args->trans, | |
776 | args->flist, | |
1da177e4 LT |
777 | &committed); |
778 | } | |
779 | if (error) { | |
780 | ASSERT(committed); | |
781 | args->trans = NULL; | |
782 | xfs_bmap_cancel(args->flist); | |
783 | return(error); | |
784 | } | |
785 | ||
786 | /* | |
787 | * bmap_finish() may have committed the last trans | |
788 | * and started a new one. We need the inode to be | |
789 | * in all transactions. | |
790 | */ | |
898621d5 | 791 | if (committed) |
ddc3415a | 792 | xfs_trans_ijoin(args->trans, dp, 0); |
1d9025e5 | 793 | } |
1da177e4 LT |
794 | |
795 | /* | |
796 | * Commit the remove and start the next trans in series. | |
797 | */ | |
322ff6b8 | 798 | error = xfs_trans_roll(&args->trans, dp); |
1da177e4 LT |
799 | |
800 | } else if (args->rmtblkno > 0) { | |
801 | /* | |
802 | * Added a "remote" value, just clear the incomplete flag. | |
803 | */ | |
517c2220 | 804 | error = xfs_attr3_leaf_clearflag(args); |
1da177e4 | 805 | } |
517c2220 | 806 | return error; |
1da177e4 LT |
807 | } |
808 | ||
809 | /* | |
810 | * Remove a name from the leaf attribute list structure | |
811 | * | |
812 | * This leaf block cannot have a "remote" value, we only call this routine | |
813 | * if bmap_one_block() says there is only one block (ie: no remote blks). | |
814 | */ | |
815 | STATIC int | |
816 | xfs_attr_leaf_removename(xfs_da_args_t *args) | |
817 | { | |
818 | xfs_inode_t *dp; | |
1d9025e5 | 819 | struct xfs_buf *bp; |
d8cc890d | 820 | int error, committed, forkoff; |
1da177e4 | 821 | |
5a5881cd DC |
822 | trace_xfs_attr_leaf_removename(args); |
823 | ||
1da177e4 LT |
824 | /* |
825 | * Remove the attribute. | |
826 | */ | |
827 | dp = args->dp; | |
828 | args->blkno = 0; | |
517c2220 | 829 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
ad14c33a DC |
830 | if (error) |
831 | return error; | |
1da177e4 | 832 | |
517c2220 | 833 | error = xfs_attr3_leaf_lookup_int(bp, args); |
1da177e4 | 834 | if (error == ENOATTR) { |
1d9025e5 | 835 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 836 | return error; |
1da177e4 LT |
837 | } |
838 | ||
517c2220 | 839 | xfs_attr3_leaf_remove(bp, args); |
1da177e4 LT |
840 | |
841 | /* | |
842 | * If the result is small enough, shrink it all into the inode. | |
843 | */ | |
d8cc890d | 844 | if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) { |
9d87c319 | 845 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 846 | error = xfs_attr3_leaf_to_shortform(bp, args, forkoff); |
1da177e4 LT |
847 | /* bp is gone due to xfs_da_shrink_inode */ |
848 | if (!error) { | |
849 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 850 | &committed); |
1da177e4 LT |
851 | } |
852 | if (error) { | |
853 | ASSERT(committed); | |
854 | args->trans = NULL; | |
855 | xfs_bmap_cancel(args->flist); | |
517c2220 | 856 | return error; |
1da177e4 LT |
857 | } |
858 | ||
859 | /* | |
860 | * bmap_finish() may have committed the last trans and started | |
861 | * a new one. We need the inode to be in all transactions. | |
862 | */ | |
898621d5 | 863 | if (committed) |
ddc3415a | 864 | xfs_trans_ijoin(args->trans, dp, 0); |
1d9025e5 | 865 | } |
517c2220 | 866 | return 0; |
1da177e4 LT |
867 | } |
868 | ||
869 | /* | |
870 | * Look up a name in a leaf attribute list structure. | |
871 | * | |
872 | * This leaf block cannot have a "remote" value, we only call this routine | |
873 | * if bmap_one_block() says there is only one block (ie: no remote blks). | |
874 | */ | |
ba0f32d4 | 875 | STATIC int |
1da177e4 LT |
876 | xfs_attr_leaf_get(xfs_da_args_t *args) |
877 | { | |
1d9025e5 | 878 | struct xfs_buf *bp; |
1da177e4 LT |
879 | int error; |
880 | ||
ee73259b DC |
881 | trace_xfs_attr_leaf_get(args); |
882 | ||
1da177e4 | 883 | args->blkno = 0; |
517c2220 | 884 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
1da177e4 | 885 | if (error) |
ad14c33a | 886 | return error; |
1da177e4 | 887 | |
517c2220 | 888 | error = xfs_attr3_leaf_lookup_int(bp, args); |
1da177e4 | 889 | if (error != EEXIST) { |
1d9025e5 | 890 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 891 | return error; |
1da177e4 | 892 | } |
517c2220 | 893 | error = xfs_attr3_leaf_getvalue(bp, args); |
1d9025e5 | 894 | xfs_trans_brelse(args->trans, bp); |
1da177e4 LT |
895 | if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) { |
896 | error = xfs_attr_rmtval_get(args); | |
897 | } | |
517c2220 | 898 | return error; |
1da177e4 LT |
899 | } |
900 | ||
1da177e4 LT |
901 | /*======================================================================== |
902 | * External routines when attribute list size > XFS_LBSIZE(mp). | |
903 | *========================================================================*/ | |
904 | ||
905 | /* | |
906 | * Add a name to a Btree-format attribute list. | |
907 | * | |
908 | * This will involve walking down the Btree, and may involve splitting | |
909 | * leaf nodes and even splitting intermediate nodes up to and including | |
910 | * the root node (a special case of an intermediate node). | |
911 | * | |
912 | * "Remote" attribute values confuse the issue and atomic rename operations | |
913 | * add a whole extra layer of confusion on top of that. | |
914 | */ | |
915 | STATIC int | |
916 | xfs_attr_node_addname(xfs_da_args_t *args) | |
917 | { | |
918 | xfs_da_state_t *state; | |
919 | xfs_da_state_blk_t *blk; | |
920 | xfs_inode_t *dp; | |
921 | xfs_mount_t *mp; | |
922 | int committed, retval, error; | |
923 | ||
5a5881cd DC |
924 | trace_xfs_attr_node_addname(args); |
925 | ||
1da177e4 LT |
926 | /* |
927 | * Fill in bucket of arguments/results/context to carry around. | |
928 | */ | |
929 | dp = args->dp; | |
930 | mp = dp->i_mount; | |
931 | restart: | |
932 | state = xfs_da_state_alloc(); | |
933 | state->args = args; | |
934 | state->mp = mp; | |
935 | state->blocksize = state->mp->m_sb.sb_blocksize; | |
936 | state->node_ents = state->mp->m_attr_node_ents; | |
937 | ||
938 | /* | |
939 | * Search to see if name already exists, and get back a pointer | |
940 | * to where it should go. | |
941 | */ | |
f5ea1100 | 942 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
943 | if (error) |
944 | goto out; | |
945 | blk = &state->path.blk[ state->path.active-1 ]; | |
946 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
947 | if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) { | |
948 | goto out; | |
949 | } else if (retval == EEXIST) { | |
950 | if (args->flags & ATTR_CREATE) | |
951 | goto out; | |
5a5881cd DC |
952 | |
953 | trace_xfs_attr_node_replace(args); | |
954 | ||
6a178100 | 955 | args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */ |
1da177e4 LT |
956 | args->blkno2 = args->blkno; /* set 2nd entry info*/ |
957 | args->index2 = args->index; | |
958 | args->rmtblkno2 = args->rmtblkno; | |
959 | args->rmtblkcnt2 = args->rmtblkcnt; | |
960 | args->rmtblkno = 0; | |
961 | args->rmtblkcnt = 0; | |
962 | } | |
963 | ||
517c2220 | 964 | retval = xfs_attr3_leaf_add(blk->bp, state->args); |
1da177e4 LT |
965 | if (retval == ENOSPC) { |
966 | if (state->path.active == 1) { | |
967 | /* | |
968 | * Its really a single leaf node, but it had | |
969 | * out-of-line values so it looked like it *might* | |
970 | * have been a b-tree. | |
971 | */ | |
972 | xfs_da_state_free(state); | |
6dd93e9e | 973 | state = NULL; |
9d87c319 | 974 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 975 | error = xfs_attr3_leaf_to_node(args); |
1da177e4 LT |
976 | if (!error) { |
977 | error = xfs_bmap_finish(&args->trans, | |
978 | args->flist, | |
1da177e4 LT |
979 | &committed); |
980 | } | |
981 | if (error) { | |
982 | ASSERT(committed); | |
983 | args->trans = NULL; | |
984 | xfs_bmap_cancel(args->flist); | |
985 | goto out; | |
986 | } | |
987 | ||
988 | /* | |
989 | * bmap_finish() may have committed the last trans | |
990 | * and started a new one. We need the inode to be | |
991 | * in all transactions. | |
992 | */ | |
898621d5 | 993 | if (committed) |
ddc3415a | 994 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
995 | |
996 | /* | |
997 | * Commit the node conversion and start the next | |
998 | * trans in the chain. | |
999 | */ | |
322ff6b8 NS |
1000 | error = xfs_trans_roll(&args->trans, dp); |
1001 | if (error) | |
1da177e4 LT |
1002 | goto out; |
1003 | ||
1004 | goto restart; | |
1005 | } | |
1006 | ||
1007 | /* | |
1008 | * Split as many Btree elements as required. | |
1009 | * This code tracks the new and old attr's location | |
1010 | * in the index/blkno/rmtblkno/rmtblkcnt fields and | |
1011 | * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields. | |
1012 | */ | |
9d87c319 | 1013 | xfs_bmap_init(args->flist, args->firstblock); |
f5ea1100 | 1014 | error = xfs_da3_split(state); |
1da177e4 LT |
1015 | if (!error) { |
1016 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 1017 | &committed); |
1da177e4 LT |
1018 | } |
1019 | if (error) { | |
1020 | ASSERT(committed); | |
1021 | args->trans = NULL; | |
1022 | xfs_bmap_cancel(args->flist); | |
1023 | goto out; | |
1024 | } | |
1025 | ||
1026 | /* | |
1027 | * bmap_finish() may have committed the last trans and started | |
1028 | * a new one. We need the inode to be in all transactions. | |
1029 | */ | |
898621d5 | 1030 | if (committed) |
ddc3415a | 1031 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
1032 | } else { |
1033 | /* | |
1034 | * Addition succeeded, update Btree hashvals. | |
1035 | */ | |
f5ea1100 | 1036 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
1037 | } |
1038 | ||
1039 | /* | |
1040 | * Kill the state structure, we're done with it and need to | |
1041 | * allow the buffers to come back later. | |
1042 | */ | |
1043 | xfs_da_state_free(state); | |
1044 | state = NULL; | |
1045 | ||
1046 | /* | |
1047 | * Commit the leaf addition or btree split and start the next | |
1048 | * trans in the chain. | |
1049 | */ | |
322ff6b8 NS |
1050 | error = xfs_trans_roll(&args->trans, dp); |
1051 | if (error) | |
1da177e4 LT |
1052 | goto out; |
1053 | ||
1054 | /* | |
1055 | * If there was an out-of-line value, allocate the blocks we | |
1056 | * identified for its storage and copy the value. This is done | |
1057 | * after we create the attribute so that we don't overflow the | |
1058 | * maximum size of a transaction and/or hit a deadlock. | |
1059 | */ | |
1060 | if (args->rmtblkno > 0) { | |
1061 | error = xfs_attr_rmtval_set(args); | |
1062 | if (error) | |
1063 | return(error); | |
1064 | } | |
1065 | ||
1066 | /* | |
1067 | * If this is an atomic rename operation, we must "flip" the | |
1068 | * incomplete flags on the "new" and "old" attribute/value pairs | |
1069 | * so that one disappears and one appears atomically. Then we | |
1070 | * must remove the "old" attribute/value pair. | |
1071 | */ | |
6a178100 | 1072 | if (args->op_flags & XFS_DA_OP_RENAME) { |
1da177e4 LT |
1073 | /* |
1074 | * In a separate transaction, set the incomplete flag on the | |
1075 | * "old" attr and clear the incomplete flag on the "new" attr. | |
1076 | */ | |
517c2220 | 1077 | error = xfs_attr3_leaf_flipflags(args); |
1da177e4 LT |
1078 | if (error) |
1079 | goto out; | |
1080 | ||
1081 | /* | |
1082 | * Dismantle the "old" attribute/value pair by removing | |
1083 | * a "remote" value (if it exists). | |
1084 | */ | |
1085 | args->index = args->index2; | |
1086 | args->blkno = args->blkno2; | |
1087 | args->rmtblkno = args->rmtblkno2; | |
1088 | args->rmtblkcnt = args->rmtblkcnt2; | |
1089 | if (args->rmtblkno) { | |
1090 | error = xfs_attr_rmtval_remove(args); | |
1091 | if (error) | |
1092 | return(error); | |
1093 | } | |
1094 | ||
1095 | /* | |
1096 | * Re-find the "old" attribute entry after any split ops. | |
1097 | * The INCOMPLETE flag means that we will find the "old" | |
1098 | * attr, not the "new" one. | |
1099 | */ | |
1100 | args->flags |= XFS_ATTR_INCOMPLETE; | |
1101 | state = xfs_da_state_alloc(); | |
1102 | state->args = args; | |
1103 | state->mp = mp; | |
1104 | state->blocksize = state->mp->m_sb.sb_blocksize; | |
1105 | state->node_ents = state->mp->m_attr_node_ents; | |
1106 | state->inleaf = 0; | |
f5ea1100 | 1107 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
1108 | if (error) |
1109 | goto out; | |
1110 | ||
1111 | /* | |
1112 | * Remove the name and update the hashvals in the tree. | |
1113 | */ | |
1114 | blk = &state->path.blk[ state->path.active-1 ]; | |
1115 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
517c2220 | 1116 | error = xfs_attr3_leaf_remove(blk->bp, args); |
f5ea1100 | 1117 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
1118 | |
1119 | /* | |
1120 | * Check to see if the tree needs to be collapsed. | |
1121 | */ | |
1122 | if (retval && (state->path.active > 1)) { | |
9d87c319 | 1123 | xfs_bmap_init(args->flist, args->firstblock); |
f5ea1100 | 1124 | error = xfs_da3_join(state); |
1da177e4 LT |
1125 | if (!error) { |
1126 | error = xfs_bmap_finish(&args->trans, | |
1127 | args->flist, | |
1da177e4 LT |
1128 | &committed); |
1129 | } | |
1130 | if (error) { | |
1131 | ASSERT(committed); | |
1132 | args->trans = NULL; | |
1133 | xfs_bmap_cancel(args->flist); | |
1134 | goto out; | |
1135 | } | |
1136 | ||
1137 | /* | |
1138 | * bmap_finish() may have committed the last trans | |
1139 | * and started a new one. We need the inode to be | |
1140 | * in all transactions. | |
1141 | */ | |
898621d5 | 1142 | if (committed) |
ddc3415a | 1143 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
1144 | } |
1145 | ||
1146 | /* | |
1147 | * Commit and start the next trans in the chain. | |
1148 | */ | |
322ff6b8 NS |
1149 | error = xfs_trans_roll(&args->trans, dp); |
1150 | if (error) | |
1da177e4 LT |
1151 | goto out; |
1152 | ||
1153 | } else if (args->rmtblkno > 0) { | |
1154 | /* | |
1155 | * Added a "remote" value, just clear the incomplete flag. | |
1156 | */ | |
517c2220 | 1157 | error = xfs_attr3_leaf_clearflag(args); |
1da177e4 LT |
1158 | if (error) |
1159 | goto out; | |
1160 | } | |
1161 | retval = error = 0; | |
1162 | ||
1163 | out: | |
1164 | if (state) | |
1165 | xfs_da_state_free(state); | |
1166 | if (error) | |
1167 | return(error); | |
1168 | return(retval); | |
1169 | } | |
1170 | ||
1171 | /* | |
1172 | * Remove a name from a B-tree attribute list. | |
1173 | * | |
1174 | * This will involve walking down the Btree, and may involve joining | |
1175 | * leaf nodes and even joining intermediate nodes up to and including | |
1176 | * the root node (a special case of an intermediate node). | |
1177 | */ | |
1178 | STATIC int | |
1179 | xfs_attr_node_removename(xfs_da_args_t *args) | |
1180 | { | |
1181 | xfs_da_state_t *state; | |
1182 | xfs_da_state_blk_t *blk; | |
1183 | xfs_inode_t *dp; | |
1d9025e5 | 1184 | struct xfs_buf *bp; |
d8cc890d | 1185 | int retval, error, committed, forkoff; |
1da177e4 | 1186 | |
5a5881cd DC |
1187 | trace_xfs_attr_node_removename(args); |
1188 | ||
1da177e4 LT |
1189 | /* |
1190 | * Tie a string around our finger to remind us where we are. | |
1191 | */ | |
1192 | dp = args->dp; | |
1193 | state = xfs_da_state_alloc(); | |
1194 | state->args = args; | |
1195 | state->mp = dp->i_mount; | |
1196 | state->blocksize = state->mp->m_sb.sb_blocksize; | |
1197 | state->node_ents = state->mp->m_attr_node_ents; | |
1198 | ||
1199 | /* | |
1200 | * Search to see if name exists, and get back a pointer to it. | |
1201 | */ | |
f5ea1100 | 1202 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
1203 | if (error || (retval != EEXIST)) { |
1204 | if (error == 0) | |
1205 | error = retval; | |
1206 | goto out; | |
1207 | } | |
1208 | ||
1209 | /* | |
1210 | * If there is an out-of-line value, de-allocate the blocks. | |
1211 | * This is done before we remove the attribute so that we don't | |
1212 | * overflow the maximum size of a transaction and/or hit a deadlock. | |
1213 | */ | |
1214 | blk = &state->path.blk[ state->path.active-1 ]; | |
1215 | ASSERT(blk->bp != NULL); | |
1216 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
1217 | if (args->rmtblkno > 0) { | |
1218 | /* | |
1219 | * Fill in disk block numbers in the state structure | |
1220 | * so that we can get the buffers back after we commit | |
1221 | * several transactions in the following calls. | |
1222 | */ | |
1223 | error = xfs_attr_fillstate(state); | |
1224 | if (error) | |
1225 | goto out; | |
1226 | ||
1227 | /* | |
1228 | * Mark the attribute as INCOMPLETE, then bunmapi() the | |
1229 | * remote value. | |
1230 | */ | |
517c2220 | 1231 | error = xfs_attr3_leaf_setflag(args); |
1da177e4 LT |
1232 | if (error) |
1233 | goto out; | |
1234 | error = xfs_attr_rmtval_remove(args); | |
1235 | if (error) | |
1236 | goto out; | |
1237 | ||
1238 | /* | |
1239 | * Refill the state structure with buffers, the prior calls | |
1240 | * released our buffers. | |
1241 | */ | |
1242 | error = xfs_attr_refillstate(state); | |
1243 | if (error) | |
1244 | goto out; | |
1245 | } | |
1246 | ||
1247 | /* | |
1248 | * Remove the name and update the hashvals in the tree. | |
1249 | */ | |
1250 | blk = &state->path.blk[ state->path.active-1 ]; | |
1251 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
517c2220 | 1252 | retval = xfs_attr3_leaf_remove(blk->bp, args); |
f5ea1100 | 1253 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
1254 | |
1255 | /* | |
1256 | * Check to see if the tree needs to be collapsed. | |
1257 | */ | |
1258 | if (retval && (state->path.active > 1)) { | |
9d87c319 | 1259 | xfs_bmap_init(args->flist, args->firstblock); |
f5ea1100 | 1260 | error = xfs_da3_join(state); |
1da177e4 LT |
1261 | if (!error) { |
1262 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 1263 | &committed); |
1da177e4 LT |
1264 | } |
1265 | if (error) { | |
1266 | ASSERT(committed); | |
1267 | args->trans = NULL; | |
1268 | xfs_bmap_cancel(args->flist); | |
1269 | goto out; | |
1270 | } | |
1271 | ||
1272 | /* | |
1273 | * bmap_finish() may have committed the last trans and started | |
1274 | * a new one. We need the inode to be in all transactions. | |
1275 | */ | |
898621d5 | 1276 | if (committed) |
ddc3415a | 1277 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
1278 | |
1279 | /* | |
1280 | * Commit the Btree join operation and start a new trans. | |
1281 | */ | |
322ff6b8 NS |
1282 | error = xfs_trans_roll(&args->trans, dp); |
1283 | if (error) | |
1da177e4 LT |
1284 | goto out; |
1285 | } | |
1286 | ||
1287 | /* | |
1288 | * If the result is small enough, push it all into the inode. | |
1289 | */ | |
1290 | if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) { | |
1291 | /* | |
1292 | * Have to get rid of the copy of this dabuf in the state. | |
1293 | */ | |
1294 | ASSERT(state->path.active == 1); | |
1295 | ASSERT(state->path.blk[0].bp); | |
1da177e4 LT |
1296 | state->path.blk[0].bp = NULL; |
1297 | ||
517c2220 | 1298 | error = xfs_attr3_leaf_read(args->trans, args->dp, 0, -1, &bp); |
1da177e4 LT |
1299 | if (error) |
1300 | goto out; | |
1da177e4 | 1301 | |
d8cc890d | 1302 | if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) { |
9d87c319 | 1303 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 1304 | error = xfs_attr3_leaf_to_shortform(bp, args, forkoff); |
1da177e4 LT |
1305 | /* bp is gone due to xfs_da_shrink_inode */ |
1306 | if (!error) { | |
1307 | error = xfs_bmap_finish(&args->trans, | |
1308 | args->flist, | |
1da177e4 LT |
1309 | &committed); |
1310 | } | |
1311 | if (error) { | |
1312 | ASSERT(committed); | |
1313 | args->trans = NULL; | |
1314 | xfs_bmap_cancel(args->flist); | |
1315 | goto out; | |
1316 | } | |
1317 | ||
1318 | /* | |
1319 | * bmap_finish() may have committed the last trans | |
1320 | * and started a new one. We need the inode to be | |
1321 | * in all transactions. | |
1322 | */ | |
898621d5 | 1323 | if (committed) |
ddc3415a | 1324 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 | 1325 | } else |
1d9025e5 | 1326 | xfs_trans_brelse(args->trans, bp); |
1da177e4 LT |
1327 | } |
1328 | error = 0; | |
1329 | ||
1330 | out: | |
1331 | xfs_da_state_free(state); | |
1332 | return(error); | |
1333 | } | |
1334 | ||
1335 | /* | |
1336 | * Fill in the disk block numbers in the state structure for the buffers | |
1337 | * that are attached to the state structure. | |
1338 | * This is done so that we can quickly reattach ourselves to those buffers | |
c41564b5 | 1339 | * after some set of transaction commits have released these buffers. |
1da177e4 LT |
1340 | */ |
1341 | STATIC int | |
1342 | xfs_attr_fillstate(xfs_da_state_t *state) | |
1343 | { | |
1344 | xfs_da_state_path_t *path; | |
1345 | xfs_da_state_blk_t *blk; | |
1346 | int level; | |
1347 | ||
ee73259b DC |
1348 | trace_xfs_attr_fillstate(state->args); |
1349 | ||
1da177e4 LT |
1350 | /* |
1351 | * Roll down the "path" in the state structure, storing the on-disk | |
1352 | * block number for those buffers in the "path". | |
1353 | */ | |
1354 | path = &state->path; | |
1355 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1356 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1357 | if (blk->bp) { | |
1d9025e5 | 1358 | blk->disk_blkno = XFS_BUF_ADDR(blk->bp); |
1da177e4 LT |
1359 | blk->bp = NULL; |
1360 | } else { | |
1361 | blk->disk_blkno = 0; | |
1362 | } | |
1363 | } | |
1364 | ||
1365 | /* | |
1366 | * Roll down the "altpath" in the state structure, storing the on-disk | |
1367 | * block number for those buffers in the "altpath". | |
1368 | */ | |
1369 | path = &state->altpath; | |
1370 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1371 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1372 | if (blk->bp) { | |
1d9025e5 | 1373 | blk->disk_blkno = XFS_BUF_ADDR(blk->bp); |
1da177e4 LT |
1374 | blk->bp = NULL; |
1375 | } else { | |
1376 | blk->disk_blkno = 0; | |
1377 | } | |
1378 | } | |
1379 | ||
1380 | return(0); | |
1381 | } | |
1382 | ||
1383 | /* | |
1384 | * Reattach the buffers to the state structure based on the disk block | |
1385 | * numbers stored in the state structure. | |
c41564b5 | 1386 | * This is done after some set of transaction commits have released those |
1da177e4 LT |
1387 | * buffers from our grip. |
1388 | */ | |
1389 | STATIC int | |
1390 | xfs_attr_refillstate(xfs_da_state_t *state) | |
1391 | { | |
1392 | xfs_da_state_path_t *path; | |
1393 | xfs_da_state_blk_t *blk; | |
1394 | int level, error; | |
1395 | ||
ee73259b DC |
1396 | trace_xfs_attr_refillstate(state->args); |
1397 | ||
1da177e4 LT |
1398 | /* |
1399 | * Roll down the "path" in the state structure, storing the on-disk | |
1400 | * block number for those buffers in the "path". | |
1401 | */ | |
1402 | path = &state->path; | |
1403 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1404 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1405 | if (blk->disk_blkno) { | |
f5ea1100 | 1406 | error = xfs_da3_node_read(state->args->trans, |
1da177e4 LT |
1407 | state->args->dp, |
1408 | blk->blkno, blk->disk_blkno, | |
d9392a4b | 1409 | &blk->bp, XFS_ATTR_FORK); |
1da177e4 LT |
1410 | if (error) |
1411 | return(error); | |
1412 | } else { | |
1413 | blk->bp = NULL; | |
1414 | } | |
1415 | } | |
1416 | ||
1417 | /* | |
1418 | * Roll down the "altpath" in the state structure, storing the on-disk | |
1419 | * block number for those buffers in the "altpath". | |
1420 | */ | |
1421 | path = &state->altpath; | |
1422 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1423 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1424 | if (blk->disk_blkno) { | |
f5ea1100 | 1425 | error = xfs_da3_node_read(state->args->trans, |
1da177e4 LT |
1426 | state->args->dp, |
1427 | blk->blkno, blk->disk_blkno, | |
d9392a4b | 1428 | &blk->bp, XFS_ATTR_FORK); |
1da177e4 LT |
1429 | if (error) |
1430 | return(error); | |
1431 | } else { | |
1432 | blk->bp = NULL; | |
1433 | } | |
1434 | } | |
1435 | ||
1436 | return(0); | |
1437 | } | |
1438 | ||
1439 | /* | |
1440 | * Look up a filename in a node attribute list. | |
1441 | * | |
1442 | * This routine gets called for any attribute fork that has more than one | |
1443 | * block, ie: both true Btree attr lists and for single-leaf-blocks with | |
1444 | * "remote" values taking up more blocks. | |
1445 | */ | |
ba0f32d4 | 1446 | STATIC int |
1da177e4 LT |
1447 | xfs_attr_node_get(xfs_da_args_t *args) |
1448 | { | |
1449 | xfs_da_state_t *state; | |
1450 | xfs_da_state_blk_t *blk; | |
1451 | int error, retval; | |
1452 | int i; | |
1453 | ||
ee73259b DC |
1454 | trace_xfs_attr_node_get(args); |
1455 | ||
1da177e4 LT |
1456 | state = xfs_da_state_alloc(); |
1457 | state->args = args; | |
1458 | state->mp = args->dp->i_mount; | |
1459 | state->blocksize = state->mp->m_sb.sb_blocksize; | |
1460 | state->node_ents = state->mp->m_attr_node_ents; | |
1461 | ||
1462 | /* | |
1463 | * Search to see if name exists, and get back a pointer to it. | |
1464 | */ | |
f5ea1100 | 1465 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
1466 | if (error) { |
1467 | retval = error; | |
1468 | } else if (retval == EEXIST) { | |
1469 | blk = &state->path.blk[ state->path.active-1 ]; | |
1470 | ASSERT(blk->bp != NULL); | |
1471 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
1472 | ||
1473 | /* | |
1474 | * Get the value, local or "remote" | |
1475 | */ | |
517c2220 | 1476 | retval = xfs_attr3_leaf_getvalue(blk->bp, args); |
1da177e4 LT |
1477 | if (!retval && (args->rmtblkno > 0) |
1478 | && !(args->flags & ATTR_KERNOVAL)) { | |
1479 | retval = xfs_attr_rmtval_get(args); | |
1480 | } | |
1481 | } | |
1482 | ||
1483 | /* | |
1484 | * If not in a transaction, we have to release all the buffers. | |
1485 | */ | |
1486 | for (i = 0; i < state->path.active; i++) { | |
1d9025e5 | 1487 | xfs_trans_brelse(args->trans, state->path.blk[i].bp); |
1da177e4 LT |
1488 | state->path.blk[i].bp = NULL; |
1489 | } | |
1490 | ||
1491 | xfs_da_state_free(state); | |
1492 | return(retval); | |
1493 | } |