]>
Commit | Line | Data |
---|---|---|
0b61f8a4 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 | 2 | /* |
7b718769 | 3 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
517c2220 | 4 | * Copyright (c) 2013 Red Hat, Inc. |
7b718769 | 5 | * All Rights Reserved. |
1da177e4 | 6 | */ |
1da177e4 | 7 | #include "xfs.h" |
a844f451 | 8 | #include "xfs_fs.h" |
632b89e8 | 9 | #include "xfs_shared.h" |
a4fbe6ab | 10 | #include "xfs_format.h" |
239880ef DC |
11 | #include "xfs_log_format.h" |
12 | #include "xfs_trans_resv.h" | |
1da177e4 | 13 | #include "xfs_sb.h" |
1da177e4 | 14 | #include "xfs_mount.h" |
57062787 | 15 | #include "xfs_da_format.h" |
a844f451 | 16 | #include "xfs_da_btree.h" |
1da177e4 | 17 | #include "xfs_inode.h" |
239880ef | 18 | #include "xfs_trans.h" |
a4fbe6ab | 19 | #include "xfs_bmap_btree.h" |
1da177e4 | 20 | #include "xfs_bmap.h" |
a4fbe6ab DC |
21 | #include "xfs_attr_sf.h" |
22 | #include "xfs_attr_remote.h" | |
1da177e4 LT |
23 | #include "xfs_attr.h" |
24 | #include "xfs_attr_leaf.h" | |
25 | #include "xfs_error.h" | |
0b1b213f | 26 | #include "xfs_trace.h" |
517c2220 | 27 | #include "xfs_buf_item.h" |
4bceb18f | 28 | #include "xfs_dir2.h" |
a45086e2 | 29 | #include "xfs_log.h" |
517c2220 | 30 | |
1da177e4 LT |
31 | |
32 | /* | |
33 | * xfs_attr_leaf.c | |
34 | * | |
35 | * Routines to implement leaf blocks of attributes as Btrees of hashed names. | |
36 | */ | |
37 | ||
38 | /*======================================================================== | |
39 | * Function prototypes for the kernel. | |
40 | *========================================================================*/ | |
41 | ||
42 | /* | |
43 | * Routines used for growing the Btree. | |
44 | */ | |
517c2220 DC |
45 | STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args, |
46 | xfs_dablk_t which_block, struct xfs_buf **bpp); | |
47 | STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer, | |
48 | struct xfs_attr3_icleaf_hdr *ichdr, | |
49 | struct xfs_da_args *args, int freemap_index); | |
50 | STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args, | |
51 | struct xfs_attr3_icleaf_hdr *ichdr, | |
52 | struct xfs_buf *leaf_buffer); | |
53 | STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state, | |
1da177e4 LT |
54 | xfs_da_state_blk_t *blk1, |
55 | xfs_da_state_blk_t *blk2); | |
517c2220 DC |
56 | STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state, |
57 | xfs_da_state_blk_t *leaf_blk_1, | |
58 | struct xfs_attr3_icleaf_hdr *ichdr1, | |
59 | xfs_da_state_blk_t *leaf_blk_2, | |
60 | struct xfs_attr3_icleaf_hdr *ichdr2, | |
61 | int *number_entries_in_blk1, | |
62 | int *number_usedbytes_in_blk1); | |
1da177e4 LT |
63 | |
64 | /* | |
65 | * Utility routines. | |
66 | */ | |
c2c4c477 DC |
67 | STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args, |
68 | struct xfs_attr_leafblock *src_leaf, | |
517c2220 DC |
69 | struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start, |
70 | struct xfs_attr_leafblock *dst_leaf, | |
71 | struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start, | |
c2c4c477 | 72 | int move_count); |
ba0f32d4 | 73 | STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index); |
726801ba | 74 | |
e87021a2 BF |
75 | /* |
76 | * attr3 block 'firstused' conversion helpers. | |
77 | * | |
78 | * firstused refers to the offset of the first used byte of the nameval region | |
79 | * of an attr leaf block. The region starts at the tail of the block and expands | |
80 | * backwards towards the middle. As such, firstused is initialized to the block | |
81 | * size for an empty leaf block and is reduced from there. | |
82 | * | |
83 | * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k. | |
84 | * The in-core firstused field is 32-bit and thus supports the maximum fsb size. | |
85 | * The on-disk field is only 16-bit, however, and overflows at 64k. Since this | |
86 | * only occurs at exactly 64k, we use zero as a magic on-disk value to represent | |
87 | * the attr block size. The following helpers manage the conversion between the | |
88 | * in-core and on-disk formats. | |
89 | */ | |
90 | ||
91 | static void | |
92 | xfs_attr3_leaf_firstused_from_disk( | |
93 | struct xfs_da_geometry *geo, | |
94 | struct xfs_attr3_icleaf_hdr *to, | |
95 | struct xfs_attr_leafblock *from) | |
96 | { | |
97 | struct xfs_attr3_leaf_hdr *hdr3; | |
98 | ||
99 | if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { | |
100 | hdr3 = (struct xfs_attr3_leaf_hdr *) from; | |
101 | to->firstused = be16_to_cpu(hdr3->firstused); | |
102 | } else { | |
103 | to->firstused = be16_to_cpu(from->hdr.firstused); | |
104 | } | |
105 | ||
106 | /* | |
107 | * Convert from the magic fsb size value to actual blocksize. This | |
108 | * should only occur for empty blocks when the block size overflows | |
109 | * 16-bits. | |
110 | */ | |
111 | if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) { | |
112 | ASSERT(!to->count && !to->usedbytes); | |
113 | ASSERT(geo->blksize > USHRT_MAX); | |
114 | to->firstused = geo->blksize; | |
115 | } | |
116 | } | |
117 | ||
118 | static void | |
119 | xfs_attr3_leaf_firstused_to_disk( | |
120 | struct xfs_da_geometry *geo, | |
121 | struct xfs_attr_leafblock *to, | |
122 | struct xfs_attr3_icleaf_hdr *from) | |
123 | { | |
124 | struct xfs_attr3_leaf_hdr *hdr3; | |
125 | uint32_t firstused; | |
126 | ||
127 | /* magic value should only be seen on disk */ | |
128 | ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF); | |
129 | ||
130 | /* | |
131 | * Scale down the 32-bit in-core firstused value to the 16-bit on-disk | |
132 | * value. This only overflows at the max supported value of 64k. Use the | |
133 | * magic on-disk value to represent block size in this case. | |
134 | */ | |
135 | firstused = from->firstused; | |
136 | if (firstused > USHRT_MAX) { | |
137 | ASSERT(from->firstused == geo->blksize); | |
138 | firstused = XFS_ATTR3_LEAF_NULLOFF; | |
139 | } | |
140 | ||
141 | if (from->magic == XFS_ATTR3_LEAF_MAGIC) { | |
142 | hdr3 = (struct xfs_attr3_leaf_hdr *) to; | |
143 | hdr3->firstused = cpu_to_be16(firstused); | |
144 | } else { | |
145 | to->hdr.firstused = cpu_to_be16(firstused); | |
146 | } | |
147 | } | |
148 | ||
517c2220 DC |
149 | void |
150 | xfs_attr3_leaf_hdr_from_disk( | |
2f661241 | 151 | struct xfs_da_geometry *geo, |
517c2220 DC |
152 | struct xfs_attr3_icleaf_hdr *to, |
153 | struct xfs_attr_leafblock *from) | |
154 | { | |
155 | int i; | |
156 | ||
157 | ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) || | |
158 | from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)); | |
159 | ||
160 | if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { | |
161 | struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from; | |
162 | ||
163 | to->forw = be32_to_cpu(hdr3->info.hdr.forw); | |
164 | to->back = be32_to_cpu(hdr3->info.hdr.back); | |
165 | to->magic = be16_to_cpu(hdr3->info.hdr.magic); | |
166 | to->count = be16_to_cpu(hdr3->count); | |
167 | to->usedbytes = be16_to_cpu(hdr3->usedbytes); | |
e87021a2 | 168 | xfs_attr3_leaf_firstused_from_disk(geo, to, from); |
517c2220 DC |
169 | to->holes = hdr3->holes; |
170 | ||
171 | for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { | |
172 | to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base); | |
173 | to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size); | |
174 | } | |
175 | return; | |
176 | } | |
177 | to->forw = be32_to_cpu(from->hdr.info.forw); | |
178 | to->back = be32_to_cpu(from->hdr.info.back); | |
179 | to->magic = be16_to_cpu(from->hdr.info.magic); | |
180 | to->count = be16_to_cpu(from->hdr.count); | |
181 | to->usedbytes = be16_to_cpu(from->hdr.usedbytes); | |
e87021a2 | 182 | xfs_attr3_leaf_firstused_from_disk(geo, to, from); |
517c2220 DC |
183 | to->holes = from->hdr.holes; |
184 | ||
185 | for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { | |
186 | to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base); | |
187 | to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size); | |
188 | } | |
189 | } | |
190 | ||
191 | void | |
192 | xfs_attr3_leaf_hdr_to_disk( | |
2f661241 | 193 | struct xfs_da_geometry *geo, |
517c2220 DC |
194 | struct xfs_attr_leafblock *to, |
195 | struct xfs_attr3_icleaf_hdr *from) | |
196 | { | |
e87021a2 | 197 | int i; |
517c2220 DC |
198 | |
199 | ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC || | |
200 | from->magic == XFS_ATTR3_LEAF_MAGIC); | |
201 | ||
202 | if (from->magic == XFS_ATTR3_LEAF_MAGIC) { | |
203 | struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to; | |
204 | ||
205 | hdr3->info.hdr.forw = cpu_to_be32(from->forw); | |
206 | hdr3->info.hdr.back = cpu_to_be32(from->back); | |
207 | hdr3->info.hdr.magic = cpu_to_be16(from->magic); | |
208 | hdr3->count = cpu_to_be16(from->count); | |
209 | hdr3->usedbytes = cpu_to_be16(from->usedbytes); | |
e87021a2 | 210 | xfs_attr3_leaf_firstused_to_disk(geo, to, from); |
517c2220 DC |
211 | hdr3->holes = from->holes; |
212 | hdr3->pad1 = 0; | |
213 | ||
214 | for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { | |
215 | hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base); | |
216 | hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size); | |
217 | } | |
218 | return; | |
219 | } | |
220 | to->hdr.info.forw = cpu_to_be32(from->forw); | |
221 | to->hdr.info.back = cpu_to_be32(from->back); | |
222 | to->hdr.info.magic = cpu_to_be16(from->magic); | |
223 | to->hdr.count = cpu_to_be16(from->count); | |
224 | to->hdr.usedbytes = cpu_to_be16(from->usedbytes); | |
e87021a2 | 225 | xfs_attr3_leaf_firstused_to_disk(geo, to, from); |
517c2220 DC |
226 | to->hdr.holes = from->holes; |
227 | to->hdr.pad1 = 0; | |
228 | ||
229 | for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { | |
230 | to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base); | |
231 | to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size); | |
232 | } | |
233 | } | |
234 | ||
a6a781a5 | 235 | static xfs_failaddr_t |
517c2220 | 236 | xfs_attr3_leaf_verify( |
79a69bf8 | 237 | struct xfs_buf *bp) |
ad14c33a | 238 | { |
79a69bf8 | 239 | struct xfs_attr3_icleaf_hdr ichdr; |
dbd329f1 | 240 | struct xfs_mount *mp = bp->b_mount; |
79a69bf8 | 241 | struct xfs_attr_leafblock *leaf = bp->b_addr; |
79a69bf8 | 242 | struct xfs_attr_leaf_entry *entries; |
837514f7 | 243 | uint32_t end; /* must be 32bit - see below */ |
65cfcc38 | 244 | int i; |
8764f983 | 245 | xfs_failaddr_t fa; |
ad14c33a | 246 | |
2f661241 | 247 | xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); |
517c2220 | 248 | |
8764f983 BF |
249 | fa = xfs_da3_blkinfo_verify(bp, bp->b_addr); |
250 | if (fa) | |
251 | return fa; | |
517c2220 | 252 | |
2e1d2337 ES |
253 | /* |
254 | * In recovery there is a transient state where count == 0 is valid | |
255 | * because we may have transitioned an empty shortform attr to a leaf | |
256 | * if the attr didn't fit in shortform. | |
257 | */ | |
0c60d3aa | 258 | if (!xfs_log_in_recovery(mp) && ichdr.count == 0) |
a6a781a5 | 259 | return __this_address; |
517c2220 | 260 | |
79a69bf8 DW |
261 | /* |
262 | * firstused is the block offset of the first name info structure. | |
263 | * Make sure it doesn't go off the block or crash into the header. | |
264 | */ | |
265 | if (ichdr.firstused > mp->m_attr_geo->blksize) | |
266 | return __this_address; | |
267 | if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) | |
268 | return __this_address; | |
269 | ||
270 | /* Make sure the entries array doesn't crash into the name info. */ | |
271 | entries = xfs_attr3_leaf_entryp(bp->b_addr); | |
272 | if ((char *)&entries[ichdr.count] > | |
273 | (char *)bp->b_addr + ichdr.firstused) | |
274 | return __this_address; | |
275 | ||
517c2220 DC |
276 | /* XXX: need to range check rest of attr header values */ |
277 | /* XXX: hash order check? */ | |
278 | ||
65cfcc38 DW |
279 | /* |
280 | * Quickly check the freemap information. Attribute data has to be | |
281 | * aligned to 4-byte boundaries, and likewise for the free space. | |
837514f7 DC |
282 | * |
283 | * Note that for 64k block size filesystems, the freemap entries cannot | |
284 | * overflow as they are only be16 fields. However, when checking end | |
285 | * pointer of the freemap, we have to be careful to detect overflows and | |
286 | * so use uint32_t for those checks. | |
65cfcc38 DW |
287 | */ |
288 | for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { | |
289 | if (ichdr.freemap[i].base > mp->m_attr_geo->blksize) | |
290 | return __this_address; | |
291 | if (ichdr.freemap[i].base & 0x3) | |
292 | return __this_address; | |
293 | if (ichdr.freemap[i].size > mp->m_attr_geo->blksize) | |
294 | return __this_address; | |
295 | if (ichdr.freemap[i].size & 0x3) | |
296 | return __this_address; | |
837514f7 DC |
297 | |
298 | /* be care of 16 bit overflows here */ | |
299 | end = (uint32_t)ichdr.freemap[i].base + ichdr.freemap[i].size; | |
65cfcc38 DW |
300 | if (end < ichdr.freemap[i].base) |
301 | return __this_address; | |
302 | if (end > mp->m_attr_geo->blksize) | |
303 | return __this_address; | |
304 | } | |
305 | ||
a6a781a5 | 306 | return NULL; |
612cfbfe DC |
307 | } |
308 | ||
309 | static void | |
517c2220 | 310 | xfs_attr3_leaf_write_verify( |
612cfbfe DC |
311 | struct xfs_buf *bp) |
312 | { | |
dbd329f1 | 313 | struct xfs_mount *mp = bp->b_mount; |
fb1755a6 | 314 | struct xfs_buf_log_item *bip = bp->b_log_item; |
517c2220 | 315 | struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr; |
bc1a09b8 | 316 | xfs_failaddr_t fa; |
517c2220 | 317 | |
bc1a09b8 DW |
318 | fa = xfs_attr3_leaf_verify(bp); |
319 | if (fa) { | |
320 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
517c2220 DC |
321 | return; |
322 | } | |
323 | ||
324 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
325 | return; | |
326 | ||
327 | if (bip) | |
328 | hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
329 | ||
f1dbcd7e | 330 | xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF); |
612cfbfe | 331 | } |
ad14c33a | 332 | |
517c2220 DC |
333 | /* |
334 | * leaf/node format detection on trees is sketchy, so a node read can be done on | |
335 | * leaf level blocks when detection identifies the tree as a node format tree | |
336 | * incorrectly. In this case, we need to swap the verifier to match the correct | |
337 | * format of the block being read. | |
338 | */ | |
1813dd64 | 339 | static void |
517c2220 DC |
340 | xfs_attr3_leaf_read_verify( |
341 | struct xfs_buf *bp) | |
612cfbfe | 342 | { |
dbd329f1 | 343 | struct xfs_mount *mp = bp->b_mount; |
bc1a09b8 | 344 | xfs_failaddr_t fa; |
517c2220 | 345 | |
ce5028cf ES |
346 | if (xfs_sb_version_hascrc(&mp->m_sb) && |
347 | !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF)) | |
bc1a09b8 DW |
348 | xfs_verifier_error(bp, -EFSBADCRC, __this_address); |
349 | else { | |
350 | fa = xfs_attr3_leaf_verify(bp); | |
351 | if (fa) | |
352 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
353 | } | |
ad14c33a DC |
354 | } |
355 | ||
517c2220 | 356 | const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = { |
233135b7 | 357 | .name = "xfs_attr3_leaf", |
15baadf7 DW |
358 | .magic16 = { cpu_to_be16(XFS_ATTR_LEAF_MAGIC), |
359 | cpu_to_be16(XFS_ATTR3_LEAF_MAGIC) }, | |
517c2220 DC |
360 | .verify_read = xfs_attr3_leaf_read_verify, |
361 | .verify_write = xfs_attr3_leaf_write_verify, | |
b5572597 | 362 | .verify_struct = xfs_attr3_leaf_verify, |
1813dd64 | 363 | }; |
612cfbfe | 364 | |
ad14c33a | 365 | int |
517c2220 | 366 | xfs_attr3_leaf_read( |
ad14c33a DC |
367 | struct xfs_trans *tp, |
368 | struct xfs_inode *dp, | |
369 | xfs_dablk_t bno, | |
370 | xfs_daddr_t mappedbno, | |
371 | struct xfs_buf **bpp) | |
372 | { | |
d75afeb3 DC |
373 | int err; |
374 | ||
375 | err = xfs_da_read_buf(tp, dp, bno, mappedbno, bpp, | |
517c2220 | 376 | XFS_ATTR_FORK, &xfs_attr3_leaf_buf_ops); |
cd87d867 | 377 | if (!err && tp && *bpp) |
61fe135c | 378 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF); |
d75afeb3 | 379 | return err; |
ad14c33a DC |
380 | } |
381 | ||
726801ba TS |
382 | /*======================================================================== |
383 | * Namespace helper routines | |
384 | *========================================================================*/ | |
385 | ||
726801ba TS |
386 | /* |
387 | * If namespace bits don't match return 0. | |
388 | * If all match then return 1. | |
389 | */ | |
b8f82a4a | 390 | STATIC int |
726801ba TS |
391 | xfs_attr_namesp_match(int arg_flags, int ondisk_flags) |
392 | { | |
393 | return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags); | |
394 | } | |
395 | ||
9df243a1 DC |
396 | static int |
397 | xfs_attr_copy_value( | |
398 | struct xfs_da_args *args, | |
399 | unsigned char *value, | |
400 | int valuelen) | |
401 | { | |
402 | /* | |
403 | * No copy if all we have to do is get the length | |
404 | */ | |
405 | if (args->flags & ATTR_KERNOVAL) { | |
406 | args->valuelen = valuelen; | |
407 | return 0; | |
408 | } | |
409 | ||
410 | /* | |
411 | * No copy if the length of the existing buffer is too small | |
412 | */ | |
413 | if (args->valuelen < valuelen) { | |
414 | args->valuelen = valuelen; | |
415 | return -ERANGE; | |
416 | } | |
ddbca70c DC |
417 | |
418 | if (args->op_flags & XFS_DA_OP_ALLOCVAL) { | |
419 | args->value = kmem_alloc_large(valuelen, 0); | |
420 | if (!args->value) | |
421 | return -ENOMEM; | |
422 | } | |
9df243a1 DC |
423 | args->valuelen = valuelen; |
424 | ||
425 | /* remote block xattr requires IO for copy-in */ | |
426 | if (args->rmtblkno) | |
427 | return xfs_attr_rmtval_get(args); | |
428 | ||
429 | /* | |
430 | * This is to prevent a GCC warning because the remote xattr case | |
431 | * doesn't have a value to pass in. In that case, we never reach here, | |
432 | * but GCC can't work that out and so throws a "passing NULL to | |
433 | * memcpy" warning. | |
434 | */ | |
435 | if (!value) | |
436 | return -EINVAL; | |
437 | memcpy(args->value, value, valuelen); | |
438 | return 0; | |
439 | } | |
1da177e4 LT |
440 | |
441 | /*======================================================================== | |
d8cc890d | 442 | * External routines when attribute fork size < XFS_LITINO(mp). |
1da177e4 LT |
443 | *========================================================================*/ |
444 | ||
445 | /* | |
d8cc890d NS |
446 | * Query whether the requested number of additional bytes of extended |
447 | * attribute space will be able to fit inline. | |
4c393a60 | 448 | * |
d8cc890d NS |
449 | * Returns zero if not, else the di_forkoff fork offset to be used in the |
450 | * literal area for attribute data once the new bytes have been added. | |
451 | * | |
452 | * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value; | |
453 | * special case for dev/uuid inodes, they have fixed size data forks. | |
1da177e4 LT |
454 | */ |
455 | int | |
e72e5cd0 DC |
456 | xfs_attr_shortform_bytesfit( |
457 | struct xfs_inode *dp, | |
458 | int bytes) | |
d8cc890d | 459 | { |
e72e5cd0 DC |
460 | struct xfs_mount *mp = dp->i_mount; |
461 | int64_t dsize; | |
462 | int minforkoff; | |
463 | int maxforkoff; | |
464 | int offset; | |
d8cc890d | 465 | |
56cea2d0 CH |
466 | /* rounded down */ |
467 | offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3; | |
d8cc890d | 468 | |
42b67dc6 | 469 | if (dp->i_d.di_format == XFS_DINODE_FMT_DEV) { |
d8cc890d NS |
470 | minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3; |
471 | return (offset >= minforkoff) ? minforkoff : 0; | |
d8cc890d NS |
472 | } |
473 | ||
4c393a60 CH |
474 | /* |
475 | * If the requested numbers of bytes is smaller or equal to the | |
476 | * current attribute fork size we can always proceed. | |
477 | * | |
478 | * Note that if_bytes in the data fork might actually be larger than | |
479 | * the current data fork size is due to delalloc extents. In that | |
480 | * case either the extent count will go down when they are converted | |
481 | * to real extents, or the delalloc conversion will take care of the | |
482 | * literal area rebalancing. | |
483 | */ | |
484 | if (bytes <= XFS_IFORK_ASIZE(dp)) | |
485 | return dp->i_d.di_forkoff; | |
486 | ||
487 | /* | |
488 | * For attr2 we can try to move the forkoff if there is space in the | |
489 | * literal area, but for the old format we are done if there is no | |
490 | * space in the fixed attribute fork. | |
491 | */ | |
492 | if (!(mp->m_flags & XFS_MOUNT_ATTR2)) | |
da087bad | 493 | return 0; |
da087bad | 494 | |
e5889e90 | 495 | dsize = dp->i_df.if_bytes; |
4c393a60 | 496 | |
e5889e90 BN |
497 | switch (dp->i_d.di_format) { |
498 | case XFS_DINODE_FMT_EXTENTS: | |
4c393a60 | 499 | /* |
e5889e90 | 500 | * If there is no attr fork and the data fork is extents, |
4c393a60 CH |
501 | * determine if creating the default attr fork will result |
502 | * in the extents form migrating to btree. If so, the | |
503 | * minimum offset only needs to be the space required for | |
e5889e90 | 504 | * the btree root. |
4c393a60 | 505 | */ |
1a5902c5 CH |
506 | if (!dp->i_d.di_forkoff && dp->i_df.if_bytes > |
507 | xfs_default_attroffset(dp)) | |
e5889e90 BN |
508 | dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS); |
509 | break; | |
e5889e90 BN |
510 | case XFS_DINODE_FMT_BTREE: |
511 | /* | |
4c393a60 CH |
512 | * If we have a data btree then keep forkoff if we have one, |
513 | * otherwise we are adding a new attr, so then we set | |
514 | * minforkoff to where the btree root can finish so we have | |
e5889e90 BN |
515 | * plenty of room for attrs |
516 | */ | |
517 | if (dp->i_d.di_forkoff) { | |
4c393a60 | 518 | if (offset < dp->i_d.di_forkoff) |
e5889e90 | 519 | return 0; |
4c393a60 CH |
520 | return dp->i_d.di_forkoff; |
521 | } | |
ee1a47ab | 522 | dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot); |
e5889e90 BN |
523 | break; |
524 | } | |
4c393a60 CH |
525 | |
526 | /* | |
527 | * A data fork btree root must have space for at least | |
e5889e90 BN |
528 | * MINDBTPTRS key/ptr pairs if the data fork is small or empty. |
529 | */ | |
e72e5cd0 | 530 | minforkoff = max_t(int64_t, dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS)); |
d8cc890d NS |
531 | minforkoff = roundup(minforkoff, 8) >> 3; |
532 | ||
533 | /* attr fork btree root can have at least this many key/ptr pairs */ | |
56cea2d0 CH |
534 | maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) - |
535 | XFS_BMDR_SPACE_CALC(MINABTPTRS); | |
d8cc890d NS |
536 | maxforkoff = maxforkoff >> 3; /* rounded down */ |
537 | ||
d8cc890d NS |
538 | if (offset >= maxforkoff) |
539 | return maxforkoff; | |
4c393a60 CH |
540 | if (offset >= minforkoff) |
541 | return offset; | |
d8cc890d NS |
542 | return 0; |
543 | } | |
544 | ||
545 | /* | |
546 | * Switch on the ATTR2 superblock bit (implies also FEATURES2) | |
547 | */ | |
548 | STATIC void | |
549 | xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp) | |
550 | { | |
13059ff0 | 551 | if ((mp->m_flags & XFS_MOUNT_ATTR2) && |
62118709 | 552 | !(xfs_sb_version_hasattr2(&mp->m_sb))) { |
3685c2a1 | 553 | spin_lock(&mp->m_sb_lock); |
62118709 ES |
554 | if (!xfs_sb_version_hasattr2(&mp->m_sb)) { |
555 | xfs_sb_version_addattr2(&mp->m_sb); | |
3685c2a1 | 556 | spin_unlock(&mp->m_sb_lock); |
61e63ecb | 557 | xfs_log_sb(tp); |
d8cc890d | 558 | } else |
3685c2a1 | 559 | spin_unlock(&mp->m_sb_lock); |
d8cc890d NS |
560 | } |
561 | } | |
562 | ||
563 | /* | |
564 | * Create the initial contents of a shortform attribute list. | |
565 | */ | |
566 | void | |
1da177e4 LT |
567 | xfs_attr_shortform_create(xfs_da_args_t *args) |
568 | { | |
569 | xfs_attr_sf_hdr_t *hdr; | |
570 | xfs_inode_t *dp; | |
3ba738df | 571 | struct xfs_ifork *ifp; |
1da177e4 | 572 | |
5a5881cd DC |
573 | trace_xfs_attr_sf_create(args); |
574 | ||
1da177e4 LT |
575 | dp = args->dp; |
576 | ASSERT(dp != NULL); | |
577 | ifp = dp->i_afp; | |
578 | ASSERT(ifp != NULL); | |
579 | ASSERT(ifp->if_bytes == 0); | |
580 | if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) { | |
581 | ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */ | |
582 | dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL; | |
583 | ifp->if_flags |= XFS_IFINLINE; | |
584 | } else { | |
585 | ASSERT(ifp->if_flags & XFS_IFINLINE); | |
586 | } | |
587 | xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK); | |
09db2800 DW |
588 | hdr = (struct xfs_attr_sf_hdr *)ifp->if_u1.if_data; |
589 | memset(hdr, 0, sizeof(*hdr)); | |
3b244aa8 | 590 | hdr->totsize = cpu_to_be16(sizeof(*hdr)); |
1da177e4 | 591 | xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); |
1da177e4 LT |
592 | } |
593 | ||
594 | /* | |
595 | * Add a name/value pair to the shortform attribute list. | |
596 | * Overflow from the inode has already been checked for. | |
597 | */ | |
d8cc890d NS |
598 | void |
599 | xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff) | |
1da177e4 LT |
600 | { |
601 | xfs_attr_shortform_t *sf; | |
602 | xfs_attr_sf_entry_t *sfe; | |
603 | int i, offset, size; | |
d8cc890d | 604 | xfs_mount_t *mp; |
1da177e4 | 605 | xfs_inode_t *dp; |
3ba738df | 606 | struct xfs_ifork *ifp; |
1da177e4 | 607 | |
5a5881cd DC |
608 | trace_xfs_attr_sf_add(args); |
609 | ||
1da177e4 | 610 | dp = args->dp; |
d8cc890d NS |
611 | mp = dp->i_mount; |
612 | dp->i_d.di_forkoff = forkoff; | |
d8cc890d | 613 | |
1da177e4 LT |
614 | ifp = dp->i_afp; |
615 | ASSERT(ifp->if_flags & XFS_IFINLINE); | |
616 | sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; | |
617 | sfe = &sf->list[0]; | |
3b244aa8 | 618 | for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { |
d8cc890d | 619 | #ifdef DEBUG |
1da177e4 LT |
620 | if (sfe->namelen != args->namelen) |
621 | continue; | |
622 | if (memcmp(args->name, sfe->nameval, args->namelen) != 0) | |
623 | continue; | |
726801ba | 624 | if (!xfs_attr_namesp_match(args->flags, sfe->flags)) |
1da177e4 | 625 | continue; |
d8cc890d NS |
626 | ASSERT(0); |
627 | #endif | |
1da177e4 LT |
628 | } |
629 | ||
630 | offset = (char *)sfe - (char *)sf; | |
631 | size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen); | |
632 | xfs_idata_realloc(dp, size, XFS_ATTR_FORK); | |
633 | sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; | |
634 | sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset); | |
635 | ||
636 | sfe->namelen = args->namelen; | |
3b244aa8 | 637 | sfe->valuelen = args->valuelen; |
726801ba | 638 | sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags); |
1da177e4 LT |
639 | memcpy(sfe->nameval, args->name, args->namelen); |
640 | memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen); | |
3b244aa8 | 641 | sf->hdr.count++; |
413d57c9 | 642 | be16_add_cpu(&sf->hdr.totsize, size); |
1da177e4 LT |
643 | xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); |
644 | ||
d8cc890d | 645 | xfs_sbversion_add_attr2(mp, args->trans); |
1da177e4 LT |
646 | } |
647 | ||
e1486dea CH |
648 | /* |
649 | * After the last attribute is removed revert to original inode format, | |
650 | * making all literal area available to the data fork once more. | |
651 | */ | |
6dfe5a04 DC |
652 | void |
653 | xfs_attr_fork_remove( | |
e1486dea CH |
654 | struct xfs_inode *ip, |
655 | struct xfs_trans *tp) | |
656 | { | |
657 | xfs_idestroy_fork(ip, XFS_ATTR_FORK); | |
658 | ip->i_d.di_forkoff = 0; | |
659 | ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS; | |
660 | ||
661 | ASSERT(ip->i_d.di_anextents == 0); | |
662 | ASSERT(ip->i_afp == NULL); | |
663 | ||
e1486dea CH |
664 | xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); |
665 | } | |
666 | ||
1da177e4 | 667 | /* |
d8cc890d | 668 | * Remove an attribute from the shortform attribute list structure. |
1da177e4 LT |
669 | */ |
670 | int | |
671 | xfs_attr_shortform_remove(xfs_da_args_t *args) | |
672 | { | |
673 | xfs_attr_shortform_t *sf; | |
674 | xfs_attr_sf_entry_t *sfe; | |
675 | int base, size=0, end, totsize, i; | |
d8cc890d | 676 | xfs_mount_t *mp; |
1da177e4 LT |
677 | xfs_inode_t *dp; |
678 | ||
5a5881cd DC |
679 | trace_xfs_attr_sf_remove(args); |
680 | ||
1da177e4 | 681 | dp = args->dp; |
d8cc890d | 682 | mp = dp->i_mount; |
1da177e4 LT |
683 | base = sizeof(xfs_attr_sf_hdr_t); |
684 | sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data; | |
685 | sfe = &sf->list[0]; | |
3b244aa8 | 686 | end = sf->hdr.count; |
d8cc890d | 687 | for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), |
1da177e4 LT |
688 | base += size, i++) { |
689 | size = XFS_ATTR_SF_ENTSIZE(sfe); | |
690 | if (sfe->namelen != args->namelen) | |
691 | continue; | |
692 | if (memcmp(sfe->nameval, args->name, args->namelen) != 0) | |
693 | continue; | |
726801ba | 694 | if (!xfs_attr_namesp_match(args->flags, sfe->flags)) |
1da177e4 LT |
695 | continue; |
696 | break; | |
697 | } | |
d8cc890d | 698 | if (i == end) |
2451337d | 699 | return -ENOATTR; |
1da177e4 | 700 | |
d8cc890d NS |
701 | /* |
702 | * Fix up the attribute fork data, covering the hole | |
703 | */ | |
1da177e4 | 704 | end = base + size; |
3b244aa8 | 705 | totsize = be16_to_cpu(sf->hdr.totsize); |
d8cc890d NS |
706 | if (end != totsize) |
707 | memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end); | |
3b244aa8 | 708 | sf->hdr.count--; |
413d57c9 | 709 | be16_add_cpu(&sf->hdr.totsize, -size); |
d8cc890d NS |
710 | |
711 | /* | |
712 | * Fix up the start offset of the attribute fork | |
713 | */ | |
714 | totsize -= size; | |
6a178100 | 715 | if (totsize == sizeof(xfs_attr_sf_hdr_t) && |
e1486dea CH |
716 | (mp->m_flags & XFS_MOUNT_ATTR2) && |
717 | (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) && | |
718 | !(args->op_flags & XFS_DA_OP_ADDNAME)) { | |
6dfe5a04 | 719 | xfs_attr_fork_remove(dp, args->trans); |
d8cc890d NS |
720 | } else { |
721 | xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); | |
722 | dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize); | |
723 | ASSERT(dp->i_d.di_forkoff); | |
6a178100 BN |
724 | ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) || |
725 | (args->op_flags & XFS_DA_OP_ADDNAME) || | |
726 | !(mp->m_flags & XFS_MOUNT_ATTR2) || | |
727 | dp->i_d.di_format == XFS_DINODE_FMT_BTREE); | |
d8cc890d NS |
728 | xfs_trans_log_inode(args->trans, dp, |
729 | XFS_ILOG_CORE | XFS_ILOG_ADATA); | |
730 | } | |
731 | ||
732 | xfs_sbversion_add_attr2(mp, args->trans); | |
1da177e4 | 733 | |
d99831ff | 734 | return 0; |
1da177e4 LT |
735 | } |
736 | ||
737 | /* | |
738 | * Look up a name in a shortform attribute list structure. | |
739 | */ | |
740 | /*ARGSUSED*/ | |
741 | int | |
742 | xfs_attr_shortform_lookup(xfs_da_args_t *args) | |
743 | { | |
744 | xfs_attr_shortform_t *sf; | |
745 | xfs_attr_sf_entry_t *sfe; | |
746 | int i; | |
3ba738df | 747 | struct xfs_ifork *ifp; |
1da177e4 | 748 | |
5a5881cd DC |
749 | trace_xfs_attr_sf_lookup(args); |
750 | ||
1da177e4 LT |
751 | ifp = args->dp->i_afp; |
752 | ASSERT(ifp->if_flags & XFS_IFINLINE); | |
753 | sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; | |
754 | sfe = &sf->list[0]; | |
3b244aa8 | 755 | for (i = 0; i < sf->hdr.count; |
1da177e4 LT |
756 | sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { |
757 | if (sfe->namelen != args->namelen) | |
758 | continue; | |
759 | if (memcmp(args->name, sfe->nameval, args->namelen) != 0) | |
760 | continue; | |
726801ba | 761 | if (!xfs_attr_namesp_match(args->flags, sfe->flags)) |
1da177e4 | 762 | continue; |
2451337d | 763 | return -EEXIST; |
1da177e4 | 764 | } |
2451337d | 765 | return -ENOATTR; |
1da177e4 LT |
766 | } |
767 | ||
768 | /* | |
728bcaa3 DC |
769 | * Retreive the attribute value and length. |
770 | * | |
771 | * If ATTR_KERNOVAL is specified, only the length needs to be returned. | |
772 | * Unlike a lookup, we only return an error if the attribute does not | |
773 | * exist or we can't retrieve the value. | |
1da177e4 | 774 | */ |
1da177e4 | 775 | int |
9df243a1 DC |
776 | xfs_attr_shortform_getvalue( |
777 | struct xfs_da_args *args) | |
1da177e4 | 778 | { |
9df243a1 DC |
779 | struct xfs_attr_shortform *sf; |
780 | struct xfs_attr_sf_entry *sfe; | |
781 | int i; | |
1da177e4 | 782 | |
914ed44b | 783 | ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE); |
1da177e4 LT |
784 | sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data; |
785 | sfe = &sf->list[0]; | |
3b244aa8 | 786 | for (i = 0; i < sf->hdr.count; |
1da177e4 LT |
787 | sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { |
788 | if (sfe->namelen != args->namelen) | |
789 | continue; | |
790 | if (memcmp(args->name, sfe->nameval, args->namelen) != 0) | |
791 | continue; | |
726801ba | 792 | if (!xfs_attr_namesp_match(args->flags, sfe->flags)) |
1da177e4 | 793 | continue; |
9df243a1 DC |
794 | return xfs_attr_copy_value(args, &sfe->nameval[args->namelen], |
795 | sfe->valuelen); | |
1da177e4 | 796 | } |
2451337d | 797 | return -ENOATTR; |
1da177e4 LT |
798 | } |
799 | ||
800 | /* | |
6e643cd0 DW |
801 | * Convert from using the shortform to the leaf. On success, return the |
802 | * buffer so that we can keep it locked until we're totally done with it. | |
1da177e4 LT |
803 | */ |
804 | int | |
6e643cd0 | 805 | xfs_attr_shortform_to_leaf( |
32a9b7c6 BF |
806 | struct xfs_da_args *args, |
807 | struct xfs_buf **leaf_bp) | |
1da177e4 | 808 | { |
32a9b7c6 BF |
809 | struct xfs_inode *dp; |
810 | struct xfs_attr_shortform *sf; | |
811 | struct xfs_attr_sf_entry *sfe; | |
812 | struct xfs_da_args nargs; | |
813 | char *tmpbuffer; | |
814 | int error, i, size; | |
815 | xfs_dablk_t blkno; | |
816 | struct xfs_buf *bp; | |
817 | struct xfs_ifork *ifp; | |
1da177e4 | 818 | |
5a5881cd DC |
819 | trace_xfs_attr_sf_to_leaf(args); |
820 | ||
1da177e4 LT |
821 | dp = args->dp; |
822 | ifp = dp->i_afp; | |
823 | sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; | |
3b244aa8 | 824 | size = be16_to_cpu(sf->hdr.totsize); |
707e0dda | 825 | tmpbuffer = kmem_alloc(size, 0); |
1da177e4 LT |
826 | ASSERT(tmpbuffer != NULL); |
827 | memcpy(tmpbuffer, ifp->if_u1.if_data, size); | |
828 | sf = (xfs_attr_shortform_t *)tmpbuffer; | |
829 | ||
830 | xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); | |
aeea4b75 | 831 | xfs_bmap_local_to_extents_empty(args->trans, dp, XFS_ATTR_FORK); |
f3508bcd | 832 | |
1da177e4 LT |
833 | bp = NULL; |
834 | error = xfs_da_grow_inode(args, &blkno); | |
603efebd | 835 | if (error) |
1da177e4 | 836 | goto out; |
1da177e4 LT |
837 | |
838 | ASSERT(blkno == 0); | |
517c2220 | 839 | error = xfs_attr3_leaf_create(args, blkno, &bp); |
603efebd | 840 | if (error) |
1da177e4 | 841 | goto out; |
1da177e4 LT |
842 | |
843 | memset((char *)&nargs, 0, sizeof(nargs)); | |
844 | nargs.dp = dp; | |
0650b554 | 845 | nargs.geo = args->geo; |
1da177e4 LT |
846 | nargs.total = args->total; |
847 | nargs.whichfork = XFS_ATTR_FORK; | |
848 | nargs.trans = args->trans; | |
6a178100 | 849 | nargs.op_flags = XFS_DA_OP_OKNOENT; |
1da177e4 LT |
850 | |
851 | sfe = &sf->list[0]; | |
3b244aa8 | 852 | for (i = 0; i < sf->hdr.count; i++) { |
a9273ca5 | 853 | nargs.name = sfe->nameval; |
1da177e4 | 854 | nargs.namelen = sfe->namelen; |
a9273ca5 | 855 | nargs.value = &sfe->nameval[nargs.namelen]; |
3b244aa8 | 856 | nargs.valuelen = sfe->valuelen; |
a9273ca5 | 857 | nargs.hashval = xfs_da_hashname(sfe->nameval, |
1da177e4 | 858 | sfe->namelen); |
726801ba | 859 | nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags); |
517c2220 | 860 | error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */ |
2451337d | 861 | ASSERT(error == -ENOATTR); |
517c2220 | 862 | error = xfs_attr3_leaf_add(bp, &nargs); |
2451337d | 863 | ASSERT(error != -ENOSPC); |
1da177e4 LT |
864 | if (error) |
865 | goto out; | |
866 | sfe = XFS_ATTR_SF_NEXTENTRY(sfe); | |
867 | } | |
868 | error = 0; | |
6e643cd0 | 869 | *leaf_bp = bp; |
1da177e4 | 870 | out: |
f0e2d93c | 871 | kmem_free(tmpbuffer); |
d99831ff | 872 | return error; |
1da177e4 LT |
873 | } |
874 | ||
1da177e4 LT |
875 | /* |
876 | * Check a leaf attribute block to see if all the entries would fit into | |
877 | * a shortform attribute list. | |
878 | */ | |
879 | int | |
1d9025e5 | 880 | xfs_attr_shortform_allfit( |
b38958d7 DC |
881 | struct xfs_buf *bp, |
882 | struct xfs_inode *dp) | |
1da177e4 | 883 | { |
b38958d7 DC |
884 | struct xfs_attr_leafblock *leaf; |
885 | struct xfs_attr_leaf_entry *entry; | |
1da177e4 | 886 | xfs_attr_leaf_name_local_t *name_loc; |
b38958d7 DC |
887 | struct xfs_attr3_icleaf_hdr leafhdr; |
888 | int bytes; | |
889 | int i; | |
dbd329f1 | 890 | struct xfs_mount *mp = bp->b_mount; |
1da177e4 | 891 | |
1d9025e5 | 892 | leaf = bp->b_addr; |
2f661241 | 893 | xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf); |
b38958d7 | 894 | entry = xfs_attr3_leaf_entryp(leaf); |
1da177e4 | 895 | |
1da177e4 | 896 | bytes = sizeof(struct xfs_attr_sf_hdr); |
b38958d7 | 897 | for (i = 0; i < leafhdr.count; entry++, i++) { |
1da177e4 LT |
898 | if (entry->flags & XFS_ATTR_INCOMPLETE) |
899 | continue; /* don't copy partial entries */ | |
900 | if (!(entry->flags & XFS_ATTR_LOCAL)) | |
d99831ff | 901 | return 0; |
517c2220 | 902 | name_loc = xfs_attr3_leaf_name_local(leaf, i); |
1da177e4 | 903 | if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX) |
d99831ff | 904 | return 0; |
053b5758 | 905 | if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX) |
d99831ff | 906 | return 0; |
b38958d7 | 907 | bytes += sizeof(struct xfs_attr_sf_entry) - 1 |
1da177e4 | 908 | + name_loc->namelen |
053b5758 | 909 | + be16_to_cpu(name_loc->valuelen); |
1da177e4 | 910 | } |
13059ff0 | 911 | if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) && |
e5889e90 | 912 | (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) && |
e0144ca5 | 913 | (bytes == sizeof(struct xfs_attr_sf_hdr))) |
b38958d7 DC |
914 | return -1; |
915 | return xfs_attr_shortform_bytesfit(dp, bytes); | |
1da177e4 LT |
916 | } |
917 | ||
1e1bbd8e DW |
918 | /* Verify the consistency of an inline attribute fork. */ |
919 | xfs_failaddr_t | |
920 | xfs_attr_shortform_verify( | |
921 | struct xfs_inode *ip) | |
922 | { | |
923 | struct xfs_attr_shortform *sfp; | |
924 | struct xfs_attr_sf_entry *sfep; | |
925 | struct xfs_attr_sf_entry *next_sfep; | |
926 | char *endp; | |
927 | struct xfs_ifork *ifp; | |
928 | int i; | |
e72e5cd0 | 929 | int64_t size; |
1e1bbd8e DW |
930 | |
931 | ASSERT(ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL); | |
932 | ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK); | |
933 | sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data; | |
934 | size = ifp->if_bytes; | |
935 | ||
936 | /* | |
937 | * Give up if the attribute is way too short. | |
938 | */ | |
939 | if (size < sizeof(struct xfs_attr_sf_hdr)) | |
940 | return __this_address; | |
941 | ||
942 | endp = (char *)sfp + size; | |
943 | ||
944 | /* Check all reported entries */ | |
945 | sfep = &sfp->list[0]; | |
946 | for (i = 0; i < sfp->hdr.count; i++) { | |
947 | /* | |
948 | * struct xfs_attr_sf_entry has a variable length. | |
949 | * Check the fixed-offset parts of the structure are | |
950 | * within the data buffer. | |
9c67e046 ES |
951 | * xfs_attr_sf_entry is defined with a 1-byte variable |
952 | * array at the end, so we must subtract that off. | |
1e1bbd8e | 953 | */ |
9c67e046 | 954 | if (((char *)sfep + sizeof(*sfep) - 1) >= endp) |
1e1bbd8e DW |
955 | return __this_address; |
956 | ||
957 | /* Don't allow names with known bad length. */ | |
958 | if (sfep->namelen == 0) | |
959 | return __this_address; | |
960 | ||
961 | /* | |
962 | * Check that the variable-length part of the structure is | |
963 | * within the data buffer. The next entry starts after the | |
964 | * name component, so nextentry is an acceptable test. | |
965 | */ | |
966 | next_sfep = XFS_ATTR_SF_NEXTENTRY(sfep); | |
967 | if ((char *)next_sfep > endp) | |
968 | return __this_address; | |
969 | ||
970 | /* | |
971 | * Check for unknown flags. Short form doesn't support | |
972 | * the incomplete or local bits, so we can use the namespace | |
973 | * mask here. | |
974 | */ | |
975 | if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK) | |
976 | return __this_address; | |
977 | ||
978 | /* | |
979 | * Check for invalid namespace combinations. We only allow | |
980 | * one namespace flag per xattr, so we can just count the | |
981 | * bits (i.e. hweight) here. | |
982 | */ | |
983 | if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1) | |
984 | return __this_address; | |
985 | ||
986 | sfep = next_sfep; | |
987 | } | |
988 | if ((void *)sfep != (void *)endp) | |
989 | return __this_address; | |
990 | ||
991 | return NULL; | |
992 | } | |
993 | ||
1da177e4 LT |
994 | /* |
995 | * Convert a leaf attribute list to shortform attribute list | |
996 | */ | |
997 | int | |
517c2220 DC |
998 | xfs_attr3_leaf_to_shortform( |
999 | struct xfs_buf *bp, | |
1000 | struct xfs_da_args *args, | |
1001 | int forkoff) | |
1da177e4 | 1002 | { |
517c2220 DC |
1003 | struct xfs_attr_leafblock *leaf; |
1004 | struct xfs_attr3_icleaf_hdr ichdr; | |
1005 | struct xfs_attr_leaf_entry *entry; | |
1006 | struct xfs_attr_leaf_name_local *name_loc; | |
1007 | struct xfs_da_args nargs; | |
1008 | struct xfs_inode *dp = args->dp; | |
1009 | char *tmpbuffer; | |
1010 | int error; | |
1011 | int i; | |
1da177e4 | 1012 | |
5a5881cd DC |
1013 | trace_xfs_attr_leaf_to_sf(args); |
1014 | ||
707e0dda | 1015 | tmpbuffer = kmem_alloc(args->geo->blksize, 0); |
517c2220 | 1016 | if (!tmpbuffer) |
2451337d | 1017 | return -ENOMEM; |
1da177e4 | 1018 | |
c2c4c477 | 1019 | memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); |
517c2220 | 1020 | |
1da177e4 | 1021 | leaf = (xfs_attr_leafblock_t *)tmpbuffer; |
2f661241 | 1022 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); |
517c2220 DC |
1023 | entry = xfs_attr3_leaf_entryp(leaf); |
1024 | ||
1025 | /* XXX (dgc): buffer is about to be marked stale - why zero it? */ | |
c2c4c477 | 1026 | memset(bp->b_addr, 0, args->geo->blksize); |
1da177e4 LT |
1027 | |
1028 | /* | |
1029 | * Clean out the prior contents of the attribute list. | |
1030 | */ | |
1031 | error = xfs_da_shrink_inode(args, 0, bp); | |
1032 | if (error) | |
1033 | goto out; | |
d8cc890d NS |
1034 | |
1035 | if (forkoff == -1) { | |
13059ff0 | 1036 | ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2); |
e5889e90 | 1037 | ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE); |
6dfe5a04 | 1038 | xfs_attr_fork_remove(dp, args->trans); |
1da177e4 | 1039 | goto out; |
d8cc890d NS |
1040 | } |
1041 | ||
1042 | xfs_attr_shortform_create(args); | |
1da177e4 LT |
1043 | |
1044 | /* | |
1045 | * Copy the attributes | |
1046 | */ | |
1047 | memset((char *)&nargs, 0, sizeof(nargs)); | |
0650b554 | 1048 | nargs.geo = args->geo; |
1da177e4 | 1049 | nargs.dp = dp; |
1da177e4 LT |
1050 | nargs.total = args->total; |
1051 | nargs.whichfork = XFS_ATTR_FORK; | |
1052 | nargs.trans = args->trans; | |
6a178100 | 1053 | nargs.op_flags = XFS_DA_OP_OKNOENT; |
517c2220 DC |
1054 | |
1055 | for (i = 0; i < ichdr.count; entry++, i++) { | |
1da177e4 LT |
1056 | if (entry->flags & XFS_ATTR_INCOMPLETE) |
1057 | continue; /* don't copy partial entries */ | |
1058 | if (!entry->nameidx) | |
1059 | continue; | |
1060 | ASSERT(entry->flags & XFS_ATTR_LOCAL); | |
517c2220 | 1061 | name_loc = xfs_attr3_leaf_name_local(leaf, i); |
a9273ca5 | 1062 | nargs.name = name_loc->nameval; |
1da177e4 | 1063 | nargs.namelen = name_loc->namelen; |
a9273ca5 | 1064 | nargs.value = &name_loc->nameval[nargs.namelen]; |
053b5758 | 1065 | nargs.valuelen = be16_to_cpu(name_loc->valuelen); |
6b19f2d8 | 1066 | nargs.hashval = be32_to_cpu(entry->hashval); |
726801ba | 1067 | nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags); |
d8cc890d | 1068 | xfs_attr_shortform_add(&nargs, forkoff); |
1da177e4 LT |
1069 | } |
1070 | error = 0; | |
1071 | ||
1072 | out: | |
f0e2d93c | 1073 | kmem_free(tmpbuffer); |
517c2220 | 1074 | return error; |
1da177e4 LT |
1075 | } |
1076 | ||
1077 | /* | |
1078 | * Convert from using a single leaf to a root node and a leaf. | |
1079 | */ | |
1080 | int | |
517c2220 DC |
1081 | xfs_attr3_leaf_to_node( |
1082 | struct xfs_da_args *args) | |
1da177e4 | 1083 | { |
517c2220 DC |
1084 | struct xfs_attr_leafblock *leaf; |
1085 | struct xfs_attr3_icleaf_hdr icleafhdr; | |
1086 | struct xfs_attr_leaf_entry *entries; | |
f5ea1100 | 1087 | struct xfs_da_node_entry *btree; |
517c2220 DC |
1088 | struct xfs_da3_icnode_hdr icnodehdr; |
1089 | struct xfs_da_intnode *node; | |
1090 | struct xfs_inode *dp = args->dp; | |
1091 | struct xfs_mount *mp = dp->i_mount; | |
1092 | struct xfs_buf *bp1 = NULL; | |
1093 | struct xfs_buf *bp2 = NULL; | |
1094 | xfs_dablk_t blkno; | |
1095 | int error; | |
1da177e4 | 1096 | |
5a5881cd DC |
1097 | trace_xfs_attr_leaf_to_node(args); |
1098 | ||
1da177e4 LT |
1099 | error = xfs_da_grow_inode(args, &blkno); |
1100 | if (error) | |
1101 | goto out; | |
517c2220 | 1102 | error = xfs_attr3_leaf_read(args->trans, dp, 0, -1, &bp1); |
1da177e4 LT |
1103 | if (error) |
1104 | goto out; | |
ad14c33a | 1105 | |
517c2220 | 1106 | error = xfs_da_get_buf(args->trans, dp, blkno, -1, &bp2, XFS_ATTR_FORK); |
1da177e4 LT |
1107 | if (error) |
1108 | goto out; | |
517c2220 DC |
1109 | |
1110 | /* copy leaf to new buffer, update identifiers */ | |
61fe135c | 1111 | xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF); |
1813dd64 | 1112 | bp2->b_ops = bp1->b_ops; |
c2c4c477 | 1113 | memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize); |
517c2220 DC |
1114 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
1115 | struct xfs_da3_blkinfo *hdr3 = bp2->b_addr; | |
1116 | hdr3->blkno = cpu_to_be64(bp2->b_bn); | |
1117 | } | |
c2c4c477 | 1118 | xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1); |
1da177e4 LT |
1119 | |
1120 | /* | |
1121 | * Set up the new root node. | |
1122 | */ | |
f5ea1100 | 1123 | error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK); |
1da177e4 LT |
1124 | if (error) |
1125 | goto out; | |
1d9025e5 | 1126 | node = bp1->b_addr; |
01ba43b8 | 1127 | dp->d_ops->node_hdr_from_disk(&icnodehdr, node); |
4bceb18f | 1128 | btree = dp->d_ops->node_tree_p(node); |
517c2220 | 1129 | |
1d9025e5 | 1130 | leaf = bp2->b_addr; |
2f661241 | 1131 | xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf); |
517c2220 DC |
1132 | entries = xfs_attr3_leaf_entryp(leaf); |
1133 | ||
1da177e4 | 1134 | /* both on-disk, don't endian-flip twice */ |
517c2220 | 1135 | btree[0].hashval = entries[icleafhdr.count - 1].hashval; |
f5ea1100 | 1136 | btree[0].before = cpu_to_be32(blkno); |
517c2220 | 1137 | icnodehdr.count = 1; |
01ba43b8 | 1138 | dp->d_ops->node_hdr_to_disk(node, &icnodehdr); |
c2c4c477 | 1139 | xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1); |
1da177e4 LT |
1140 | error = 0; |
1141 | out: | |
517c2220 | 1142 | return error; |
1da177e4 LT |
1143 | } |
1144 | ||
1da177e4 LT |
1145 | /*======================================================================== |
1146 | * Routines used for growing the Btree. | |
1147 | *========================================================================*/ | |
1148 | ||
1149 | /* | |
1150 | * Create the initial contents of a leaf attribute list | |
1151 | * or a leaf in a node attribute list. | |
1152 | */ | |
ba0f32d4 | 1153 | STATIC int |
517c2220 DC |
1154 | xfs_attr3_leaf_create( |
1155 | struct xfs_da_args *args, | |
1156 | xfs_dablk_t blkno, | |
1157 | struct xfs_buf **bpp) | |
1da177e4 | 1158 | { |
517c2220 DC |
1159 | struct xfs_attr_leafblock *leaf; |
1160 | struct xfs_attr3_icleaf_hdr ichdr; | |
1161 | struct xfs_inode *dp = args->dp; | |
1162 | struct xfs_mount *mp = dp->i_mount; | |
1163 | struct xfs_buf *bp; | |
1164 | int error; | |
1da177e4 | 1165 | |
5a5881cd DC |
1166 | trace_xfs_attr_leaf_create(args); |
1167 | ||
1da177e4 LT |
1168 | error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp, |
1169 | XFS_ATTR_FORK); | |
1170 | if (error) | |
517c2220 DC |
1171 | return error; |
1172 | bp->b_ops = &xfs_attr3_leaf_buf_ops; | |
61fe135c | 1173 | xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF); |
1d9025e5 | 1174 | leaf = bp->b_addr; |
c2c4c477 | 1175 | memset(leaf, 0, args->geo->blksize); |
517c2220 DC |
1176 | |
1177 | memset(&ichdr, 0, sizeof(ichdr)); | |
c2c4c477 | 1178 | ichdr.firstused = args->geo->blksize; |
517c2220 DC |
1179 | |
1180 | if (xfs_sb_version_hascrc(&mp->m_sb)) { | |
1181 | struct xfs_da3_blkinfo *hdr3 = bp->b_addr; | |
1182 | ||
1183 | ichdr.magic = XFS_ATTR3_LEAF_MAGIC; | |
1184 | ||
1185 | hdr3->blkno = cpu_to_be64(bp->b_bn); | |
1186 | hdr3->owner = cpu_to_be64(dp->i_ino); | |
ce748eaa | 1187 | uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); |
1da177e4 | 1188 | |
517c2220 DC |
1189 | ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr); |
1190 | } else { | |
1191 | ichdr.magic = XFS_ATTR_LEAF_MAGIC; | |
1192 | ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr); | |
1193 | } | |
1194 | ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base; | |
1da177e4 | 1195 | |
2f661241 | 1196 | xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); |
c2c4c477 | 1197 | xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1); |
1da177e4 LT |
1198 | |
1199 | *bpp = bp; | |
517c2220 | 1200 | return 0; |
1da177e4 LT |
1201 | } |
1202 | ||
1203 | /* | |
1204 | * Split the leaf node, rebalance, then add the new entry. | |
1205 | */ | |
1206 | int | |
517c2220 DC |
1207 | xfs_attr3_leaf_split( |
1208 | struct xfs_da_state *state, | |
1209 | struct xfs_da_state_blk *oldblk, | |
1210 | struct xfs_da_state_blk *newblk) | |
1da177e4 LT |
1211 | { |
1212 | xfs_dablk_t blkno; | |
1213 | int error; | |
1214 | ||
5a5881cd DC |
1215 | trace_xfs_attr_leaf_split(state->args); |
1216 | ||
1da177e4 LT |
1217 | /* |
1218 | * Allocate space for a new leaf node. | |
1219 | */ | |
1220 | ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC); | |
1221 | error = xfs_da_grow_inode(state->args, &blkno); | |
1222 | if (error) | |
d99831ff | 1223 | return error; |
517c2220 | 1224 | error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp); |
1da177e4 | 1225 | if (error) |
d99831ff | 1226 | return error; |
1da177e4 LT |
1227 | newblk->blkno = blkno; |
1228 | newblk->magic = XFS_ATTR_LEAF_MAGIC; | |
1229 | ||
1230 | /* | |
1231 | * Rebalance the entries across the two leaves. | |
1232 | * NOTE: rebalance() currently depends on the 2nd block being empty. | |
1233 | */ | |
517c2220 | 1234 | xfs_attr3_leaf_rebalance(state, oldblk, newblk); |
f5ea1100 | 1235 | error = xfs_da3_blk_link(state, oldblk, newblk); |
1da177e4 | 1236 | if (error) |
d99831ff | 1237 | return error; |
1da177e4 LT |
1238 | |
1239 | /* | |
1240 | * Save info on "old" attribute for "atomic rename" ops, leaf_add() | |
1241 | * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the | |
1242 | * "new" attrs info. Will need the "old" info to remove it later. | |
1243 | * | |
1244 | * Insert the "new" entry in the correct block. | |
1245 | */ | |
5a5881cd DC |
1246 | if (state->inleaf) { |
1247 | trace_xfs_attr_leaf_add_old(state->args); | |
517c2220 | 1248 | error = xfs_attr3_leaf_add(oldblk->bp, state->args); |
5a5881cd DC |
1249 | } else { |
1250 | trace_xfs_attr_leaf_add_new(state->args); | |
517c2220 | 1251 | error = xfs_attr3_leaf_add(newblk->bp, state->args); |
5a5881cd | 1252 | } |
1da177e4 LT |
1253 | |
1254 | /* | |
1255 | * Update last hashval in each block since we added the name. | |
1256 | */ | |
1257 | oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL); | |
1258 | newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL); | |
d99831ff | 1259 | return error; |
1da177e4 LT |
1260 | } |
1261 | ||
1262 | /* | |
1263 | * Add a name to the leaf attribute list structure. | |
1264 | */ | |
1265 | int | |
517c2220 | 1266 | xfs_attr3_leaf_add( |
1d9025e5 DC |
1267 | struct xfs_buf *bp, |
1268 | struct xfs_da_args *args) | |
1da177e4 | 1269 | { |
517c2220 DC |
1270 | struct xfs_attr_leafblock *leaf; |
1271 | struct xfs_attr3_icleaf_hdr ichdr; | |
1272 | int tablesize; | |
1273 | int entsize; | |
1274 | int sum; | |
1275 | int tmp; | |
1276 | int i; | |
1da177e4 | 1277 | |
5a5881cd DC |
1278 | trace_xfs_attr_leaf_add(args); |
1279 | ||
1d9025e5 | 1280 | leaf = bp->b_addr; |
2f661241 | 1281 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); |
517c2220 | 1282 | ASSERT(args->index >= 0 && args->index <= ichdr.count); |
c59f0ad2 | 1283 | entsize = xfs_attr_leaf_newentsize(args, NULL); |
1da177e4 LT |
1284 | |
1285 | /* | |
1286 | * Search through freemap for first-fit on new name length. | |
1287 | * (may need to figure in size of entry struct too) | |
1288 | */ | |
517c2220 DC |
1289 | tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t) |
1290 | + xfs_attr3_leaf_hdr_size(leaf); | |
1291 | for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) { | |
1292 | if (tablesize > ichdr.firstused) { | |
1293 | sum += ichdr.freemap[i].size; | |
1da177e4 LT |
1294 | continue; |
1295 | } | |
517c2220 | 1296 | if (!ichdr.freemap[i].size) |
1da177e4 LT |
1297 | continue; /* no space in this map */ |
1298 | tmp = entsize; | |
517c2220 | 1299 | if (ichdr.freemap[i].base < ichdr.firstused) |
1da177e4 | 1300 | tmp += sizeof(xfs_attr_leaf_entry_t); |
517c2220 DC |
1301 | if (ichdr.freemap[i].size >= tmp) { |
1302 | tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i); | |
1303 | goto out_log_hdr; | |
1da177e4 | 1304 | } |
517c2220 | 1305 | sum += ichdr.freemap[i].size; |
1da177e4 LT |
1306 | } |
1307 | ||
1308 | /* | |
1309 | * If there are no holes in the address space of the block, | |
1310 | * and we don't have enough freespace, then compaction will do us | |
1311 | * no good and we should just give up. | |
1312 | */ | |
517c2220 | 1313 | if (!ichdr.holes && sum < entsize) |
2451337d | 1314 | return -ENOSPC; |
1da177e4 LT |
1315 | |
1316 | /* | |
1317 | * Compact the entries to coalesce free space. | |
1318 | * This may change the hdr->count via dropping INCOMPLETE entries. | |
1319 | */ | |
517c2220 | 1320 | xfs_attr3_leaf_compact(args, &ichdr, bp); |
1da177e4 LT |
1321 | |
1322 | /* | |
1323 | * After compaction, the block is guaranteed to have only one | |
1324 | * free region, in freemap[0]. If it is not big enough, give up. | |
1325 | */ | |
517c2220 | 1326 | if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) { |
2451337d | 1327 | tmp = -ENOSPC; |
517c2220 DC |
1328 | goto out_log_hdr; |
1329 | } | |
1330 | ||
1331 | tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0); | |
1da177e4 | 1332 | |
517c2220 | 1333 | out_log_hdr: |
2f661241 | 1334 | xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); |
517c2220 DC |
1335 | xfs_trans_log_buf(args->trans, bp, |
1336 | XFS_DA_LOGRANGE(leaf, &leaf->hdr, | |
1337 | xfs_attr3_leaf_hdr_size(leaf))); | |
1338 | return tmp; | |
1da177e4 LT |
1339 | } |
1340 | ||
1341 | /* | |
1342 | * Add a name to a leaf attribute list structure. | |
1343 | */ | |
1344 | STATIC int | |
517c2220 DC |
1345 | xfs_attr3_leaf_add_work( |
1346 | struct xfs_buf *bp, | |
1347 | struct xfs_attr3_icleaf_hdr *ichdr, | |
1348 | struct xfs_da_args *args, | |
1349 | int mapindex) | |
1da177e4 | 1350 | { |
517c2220 DC |
1351 | struct xfs_attr_leafblock *leaf; |
1352 | struct xfs_attr_leaf_entry *entry; | |
1353 | struct xfs_attr_leaf_name_local *name_loc; | |
1354 | struct xfs_attr_leaf_name_remote *name_rmt; | |
1355 | struct xfs_mount *mp; | |
1356 | int tmp; | |
1357 | int i; | |
1da177e4 | 1358 | |
ee73259b DC |
1359 | trace_xfs_attr_leaf_add_work(args); |
1360 | ||
1d9025e5 | 1361 | leaf = bp->b_addr; |
517c2220 DC |
1362 | ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE); |
1363 | ASSERT(args->index >= 0 && args->index <= ichdr->count); | |
1da177e4 LT |
1364 | |
1365 | /* | |
1366 | * Force open some space in the entry array and fill it in. | |
1367 | */ | |
517c2220 DC |
1368 | entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; |
1369 | if (args->index < ichdr->count) { | |
1370 | tmp = ichdr->count - args->index; | |
1da177e4 | 1371 | tmp *= sizeof(xfs_attr_leaf_entry_t); |
517c2220 | 1372 | memmove(entry + 1, entry, tmp); |
1d9025e5 | 1373 | xfs_trans_log_buf(args->trans, bp, |
1da177e4 LT |
1374 | XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry))); |
1375 | } | |
517c2220 | 1376 | ichdr->count++; |
1da177e4 LT |
1377 | |
1378 | /* | |
1379 | * Allocate space for the new string (at the end of the run). | |
1380 | */ | |
1da177e4 | 1381 | mp = args->trans->t_mountp; |
c2c4c477 | 1382 | ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize); |
517c2220 DC |
1383 | ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0); |
1384 | ASSERT(ichdr->freemap[mapindex].size >= | |
c59f0ad2 | 1385 | xfs_attr_leaf_newentsize(args, NULL)); |
c2c4c477 | 1386 | ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize); |
517c2220 DC |
1387 | ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0); |
1388 | ||
c59f0ad2 | 1389 | ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp); |
517c2220 DC |
1390 | |
1391 | entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base + | |
1392 | ichdr->freemap[mapindex].size); | |
6b19f2d8 | 1393 | entry->hashval = cpu_to_be32(args->hashval); |
1da177e4 | 1394 | entry->flags = tmp ? XFS_ATTR_LOCAL : 0; |
726801ba | 1395 | entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags); |
6a178100 | 1396 | if (args->op_flags & XFS_DA_OP_RENAME) { |
1da177e4 LT |
1397 | entry->flags |= XFS_ATTR_INCOMPLETE; |
1398 | if ((args->blkno2 == args->blkno) && | |
1399 | (args->index2 <= args->index)) { | |
1400 | args->index2++; | |
1401 | } | |
1402 | } | |
1d9025e5 | 1403 | xfs_trans_log_buf(args->trans, bp, |
1da177e4 | 1404 | XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); |
6b19f2d8 NS |
1405 | ASSERT((args->index == 0) || |
1406 | (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval))); | |
517c2220 | 1407 | ASSERT((args->index == ichdr->count - 1) || |
6b19f2d8 | 1408 | (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval))); |
1da177e4 LT |
1409 | |
1410 | /* | |
1da177e4 LT |
1411 | * For "remote" attribute values, simply note that we need to |
1412 | * allocate space for the "remote" value. We can't actually | |
1413 | * allocate the extents in this transaction, and we can't decide | |
1414 | * which blocks they should be as we might allocate more blocks | |
1415 | * as part of this transaction (a split operation for example). | |
1416 | */ | |
1417 | if (entry->flags & XFS_ATTR_LOCAL) { | |
517c2220 | 1418 | name_loc = xfs_attr3_leaf_name_local(leaf, args->index); |
1da177e4 | 1419 | name_loc->namelen = args->namelen; |
053b5758 | 1420 | name_loc->valuelen = cpu_to_be16(args->valuelen); |
1da177e4 LT |
1421 | memcpy((char *)name_loc->nameval, args->name, args->namelen); |
1422 | memcpy((char *)&name_loc->nameval[args->namelen], args->value, | |
053b5758 | 1423 | be16_to_cpu(name_loc->valuelen)); |
1da177e4 | 1424 | } else { |
517c2220 | 1425 | name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); |
1da177e4 LT |
1426 | name_rmt->namelen = args->namelen; |
1427 | memcpy((char *)name_rmt->name, args->name, args->namelen); | |
1428 | entry->flags |= XFS_ATTR_INCOMPLETE; | |
1429 | /* just in case */ | |
1430 | name_rmt->valuelen = 0; | |
1431 | name_rmt->valueblk = 0; | |
1432 | args->rmtblkno = 1; | |
ad1858d7 | 1433 | args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen); |
8275cdd0 | 1434 | args->rmtvaluelen = args->valuelen; |
1da177e4 | 1435 | } |
1d9025e5 | 1436 | xfs_trans_log_buf(args->trans, bp, |
517c2220 | 1437 | XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), |
1da177e4 LT |
1438 | xfs_attr_leaf_entsize(leaf, args->index))); |
1439 | ||
1440 | /* | |
1441 | * Update the control info for this leaf node | |
1442 | */ | |
517c2220 DC |
1443 | if (be16_to_cpu(entry->nameidx) < ichdr->firstused) |
1444 | ichdr->firstused = be16_to_cpu(entry->nameidx); | |
1445 | ||
1446 | ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t) | |
1447 | + xfs_attr3_leaf_hdr_size(leaf)); | |
1448 | tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t) | |
1449 | + xfs_attr3_leaf_hdr_size(leaf); | |
1450 | ||
1451 | for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { | |
1452 | if (ichdr->freemap[i].base == tmp) { | |
1453 | ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t); | |
d274767f BF |
1454 | ichdr->freemap[i].size -= |
1455 | min_t(uint16_t, ichdr->freemap[i].size, | |
1456 | sizeof(xfs_attr_leaf_entry_t)); | |
1da177e4 LT |
1457 | } |
1458 | } | |
517c2220 DC |
1459 | ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index); |
1460 | return 0; | |
1da177e4 LT |
1461 | } |
1462 | ||
1463 | /* | |
1464 | * Garbage collect a leaf attribute list block by copying it to a new buffer. | |
1465 | */ | |
1466 | STATIC void | |
517c2220 | 1467 | xfs_attr3_leaf_compact( |
ee73259b | 1468 | struct xfs_da_args *args, |
d4c712bc | 1469 | struct xfs_attr3_icleaf_hdr *ichdr_dst, |
ee73259b | 1470 | struct xfs_buf *bp) |
1da177e4 | 1471 | { |
d4c712bc DC |
1472 | struct xfs_attr_leafblock *leaf_src; |
1473 | struct xfs_attr_leafblock *leaf_dst; | |
1474 | struct xfs_attr3_icleaf_hdr ichdr_src; | |
ee73259b | 1475 | struct xfs_trans *trans = args->trans; |
ee73259b DC |
1476 | char *tmpbuffer; |
1477 | ||
1478 | trace_xfs_attr_leaf_compact(args); | |
1da177e4 | 1479 | |
707e0dda | 1480 | tmpbuffer = kmem_alloc(args->geo->blksize, 0); |
c2c4c477 DC |
1481 | memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); |
1482 | memset(bp->b_addr, 0, args->geo->blksize); | |
d4c712bc DC |
1483 | leaf_src = (xfs_attr_leafblock_t *)tmpbuffer; |
1484 | leaf_dst = bp->b_addr; | |
1da177e4 LT |
1485 | |
1486 | /* | |
d4c712bc DC |
1487 | * Copy the on-disk header back into the destination buffer to ensure |
1488 | * all the information in the header that is not part of the incore | |
1489 | * header structure is preserved. | |
1da177e4 | 1490 | */ |
d4c712bc DC |
1491 | memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src)); |
1492 | ||
1493 | /* Initialise the incore headers */ | |
1494 | ichdr_src = *ichdr_dst; /* struct copy */ | |
c2c4c477 | 1495 | ichdr_dst->firstused = args->geo->blksize; |
d4c712bc DC |
1496 | ichdr_dst->usedbytes = 0; |
1497 | ichdr_dst->count = 0; | |
1498 | ichdr_dst->holes = 0; | |
1499 | ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src); | |
1500 | ichdr_dst->freemap[0].size = ichdr_dst->firstused - | |
1501 | ichdr_dst->freemap[0].base; | |
1502 | ||
d4c712bc | 1503 | /* write the header back to initialise the underlying buffer */ |
2f661241 | 1504 | xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst); |
1da177e4 LT |
1505 | |
1506 | /* | |
1507 | * Copy all entry's in the same (sorted) order, | |
1508 | * but allocate name/value pairs packed and in sequence. | |
1509 | */ | |
c2c4c477 DC |
1510 | xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0, |
1511 | leaf_dst, ichdr_dst, 0, ichdr_src.count); | |
517c2220 DC |
1512 | /* |
1513 | * this logs the entire buffer, but the caller must write the header | |
1514 | * back to the buffer when it is finished modifying it. | |
1515 | */ | |
c2c4c477 | 1516 | xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1); |
1da177e4 | 1517 | |
f0e2d93c | 1518 | kmem_free(tmpbuffer); |
1da177e4 LT |
1519 | } |
1520 | ||
517c2220 DC |
1521 | /* |
1522 | * Compare two leaf blocks "order". | |
1523 | * Return 0 unless leaf2 should go before leaf1. | |
1524 | */ | |
1525 | static int | |
1526 | xfs_attr3_leaf_order( | |
1527 | struct xfs_buf *leaf1_bp, | |
1528 | struct xfs_attr3_icleaf_hdr *leaf1hdr, | |
1529 | struct xfs_buf *leaf2_bp, | |
1530 | struct xfs_attr3_icleaf_hdr *leaf2hdr) | |
1531 | { | |
1532 | struct xfs_attr_leaf_entry *entries1; | |
1533 | struct xfs_attr_leaf_entry *entries2; | |
1534 | ||
1535 | entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr); | |
1536 | entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr); | |
1537 | if (leaf1hdr->count > 0 && leaf2hdr->count > 0 && | |
1538 | ((be32_to_cpu(entries2[0].hashval) < | |
1539 | be32_to_cpu(entries1[0].hashval)) || | |
1540 | (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) < | |
1541 | be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) { | |
1542 | return 1; | |
1543 | } | |
1544 | return 0; | |
1545 | } | |
1546 | ||
1547 | int | |
1548 | xfs_attr_leaf_order( | |
1549 | struct xfs_buf *leaf1_bp, | |
1550 | struct xfs_buf *leaf2_bp) | |
1551 | { | |
1552 | struct xfs_attr3_icleaf_hdr ichdr1; | |
1553 | struct xfs_attr3_icleaf_hdr ichdr2; | |
dbd329f1 | 1554 | struct xfs_mount *mp = leaf1_bp->b_mount; |
517c2220 | 1555 | |
2f661241 BF |
1556 | xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr); |
1557 | xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr); | |
517c2220 DC |
1558 | return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2); |
1559 | } | |
1560 | ||
1da177e4 LT |
1561 | /* |
1562 | * Redistribute the attribute list entries between two leaf nodes, | |
1563 | * taking into account the size of the new entry. | |
1564 | * | |
1565 | * NOTE: if new block is empty, then it will get the upper half of the | |
1566 | * old block. At present, all (one) callers pass in an empty second block. | |
1567 | * | |
1568 | * This code adjusts the args->index/blkno and args->index2/blkno2 fields | |
1569 | * to match what it is doing in splitting the attribute leaf block. Those | |
1570 | * values are used in "atomic rename" operations on attributes. Note that | |
1571 | * the "new" and "old" values can end up in different blocks. | |
1572 | */ | |
1573 | STATIC void | |
517c2220 DC |
1574 | xfs_attr3_leaf_rebalance( |
1575 | struct xfs_da_state *state, | |
1576 | struct xfs_da_state_blk *blk1, | |
1577 | struct xfs_da_state_blk *blk2) | |
1da177e4 | 1578 | { |
517c2220 DC |
1579 | struct xfs_da_args *args; |
1580 | struct xfs_attr_leafblock *leaf1; | |
1581 | struct xfs_attr_leafblock *leaf2; | |
1582 | struct xfs_attr3_icleaf_hdr ichdr1; | |
1583 | struct xfs_attr3_icleaf_hdr ichdr2; | |
1584 | struct xfs_attr_leaf_entry *entries1; | |
1585 | struct xfs_attr_leaf_entry *entries2; | |
1586 | int count; | |
1587 | int totallen; | |
1588 | int max; | |
1589 | int space; | |
1590 | int swap; | |
1da177e4 LT |
1591 | |
1592 | /* | |
1593 | * Set up environment. | |
1594 | */ | |
1595 | ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC); | |
1596 | ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC); | |
1d9025e5 DC |
1597 | leaf1 = blk1->bp->b_addr; |
1598 | leaf2 = blk2->bp->b_addr; | |
2f661241 BF |
1599 | xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1); |
1600 | xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2); | |
517c2220 | 1601 | ASSERT(ichdr2.count == 0); |
1da177e4 LT |
1602 | args = state->args; |
1603 | ||
5a5881cd DC |
1604 | trace_xfs_attr_leaf_rebalance(args); |
1605 | ||
1da177e4 LT |
1606 | /* |
1607 | * Check ordering of blocks, reverse if it makes things simpler. | |
1608 | * | |
1609 | * NOTE: Given that all (current) callers pass in an empty | |
1610 | * second block, this code should never set "swap". | |
1611 | */ | |
1612 | swap = 0; | |
517c2220 | 1613 | if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) { |
1d5bebba | 1614 | swap(blk1, blk2); |
517c2220 | 1615 | |
1d5bebba GS |
1616 | /* swap structures rather than reconverting them */ |
1617 | swap(ichdr1, ichdr2); | |
517c2220 | 1618 | |
1d9025e5 DC |
1619 | leaf1 = blk1->bp->b_addr; |
1620 | leaf2 = blk2->bp->b_addr; | |
1da177e4 LT |
1621 | swap = 1; |
1622 | } | |
1da177e4 LT |
1623 | |
1624 | /* | |
1625 | * Examine entries until we reduce the absolute difference in | |
1626 | * byte usage between the two blocks to a minimum. Then get | |
1627 | * the direction to copy and the number of elements to move. | |
1628 | * | |
1629 | * "inleaf" is true if the new entry should be inserted into blk1. | |
1630 | * If "swap" is also true, then reverse the sense of "inleaf". | |
1631 | */ | |
517c2220 DC |
1632 | state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1, |
1633 | blk2, &ichdr2, | |
1634 | &count, &totallen); | |
1da177e4 LT |
1635 | if (swap) |
1636 | state->inleaf = !state->inleaf; | |
1637 | ||
1638 | /* | |
1639 | * Move any entries required from leaf to leaf: | |
1640 | */ | |
517c2220 | 1641 | if (count < ichdr1.count) { |
1da177e4 LT |
1642 | /* |
1643 | * Figure the total bytes to be added to the destination leaf. | |
1644 | */ | |
1645 | /* number entries being moved */ | |
517c2220 DC |
1646 | count = ichdr1.count - count; |
1647 | space = ichdr1.usedbytes - totallen; | |
1da177e4 LT |
1648 | space += count * sizeof(xfs_attr_leaf_entry_t); |
1649 | ||
1650 | /* | |
1651 | * leaf2 is the destination, compact it if it looks tight. | |
1652 | */ | |
517c2220 DC |
1653 | max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1); |
1654 | max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t); | |
ee73259b | 1655 | if (space > max) |
517c2220 | 1656 | xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp); |
1da177e4 LT |
1657 | |
1658 | /* | |
1659 | * Move high entries from leaf1 to low end of leaf2. | |
1660 | */ | |
c2c4c477 DC |
1661 | xfs_attr3_leaf_moveents(args, leaf1, &ichdr1, |
1662 | ichdr1.count - count, leaf2, &ichdr2, 0, count); | |
1da177e4 | 1663 | |
517c2220 | 1664 | } else if (count > ichdr1.count) { |
1da177e4 LT |
1665 | /* |
1666 | * I assert that since all callers pass in an empty | |
1667 | * second buffer, this code should never execute. | |
1668 | */ | |
07428d7f | 1669 | ASSERT(0); |
1da177e4 LT |
1670 | |
1671 | /* | |
1672 | * Figure the total bytes to be added to the destination leaf. | |
1673 | */ | |
1674 | /* number entries being moved */ | |
517c2220 DC |
1675 | count -= ichdr1.count; |
1676 | space = totallen - ichdr1.usedbytes; | |
1da177e4 LT |
1677 | space += count * sizeof(xfs_attr_leaf_entry_t); |
1678 | ||
1679 | /* | |
1680 | * leaf1 is the destination, compact it if it looks tight. | |
1681 | */ | |
517c2220 DC |
1682 | max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1); |
1683 | max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t); | |
ee73259b | 1684 | if (space > max) |
517c2220 | 1685 | xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp); |
1da177e4 LT |
1686 | |
1687 | /* | |
1688 | * Move low entries from leaf2 to high end of leaf1. | |
1689 | */ | |
c2c4c477 DC |
1690 | xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1, |
1691 | ichdr1.count, count); | |
1da177e4 LT |
1692 | } |
1693 | ||
2f661241 BF |
1694 | xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1); |
1695 | xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2); | |
b2a21e7a DC |
1696 | xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1); |
1697 | xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1); | |
517c2220 | 1698 | |
1da177e4 LT |
1699 | /* |
1700 | * Copy out last hashval in each block for B-tree code. | |
1701 | */ | |
517c2220 DC |
1702 | entries1 = xfs_attr3_leaf_entryp(leaf1); |
1703 | entries2 = xfs_attr3_leaf_entryp(leaf2); | |
1704 | blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval); | |
1705 | blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval); | |
1da177e4 LT |
1706 | |
1707 | /* | |
1708 | * Adjust the expected index for insertion. | |
1709 | * NOTE: this code depends on the (current) situation that the | |
1710 | * second block was originally empty. | |
1711 | * | |
1712 | * If the insertion point moved to the 2nd block, we must adjust | |
1713 | * the index. We must also track the entry just following the | |
1714 | * new entry for use in an "atomic rename" operation, that entry | |
1715 | * is always the "old" entry and the "new" entry is what we are | |
1716 | * inserting. The index/blkno fields refer to the "old" entry, | |
1717 | * while the index2/blkno2 fields refer to the "new" entry. | |
1718 | */ | |
517c2220 | 1719 | if (blk1->index > ichdr1.count) { |
1da177e4 | 1720 | ASSERT(state->inleaf == 0); |
517c2220 | 1721 | blk2->index = blk1->index - ichdr1.count; |
1da177e4 LT |
1722 | args->index = args->index2 = blk2->index; |
1723 | args->blkno = args->blkno2 = blk2->blkno; | |
517c2220 | 1724 | } else if (blk1->index == ichdr1.count) { |
1da177e4 LT |
1725 | if (state->inleaf) { |
1726 | args->index = blk1->index; | |
1727 | args->blkno = blk1->blkno; | |
1728 | args->index2 = 0; | |
1729 | args->blkno2 = blk2->blkno; | |
1730 | } else { | |
07428d7f DC |
1731 | /* |
1732 | * On a double leaf split, the original attr location | |
1733 | * is already stored in blkno2/index2, so don't | |
1734 | * overwrite it overwise we corrupt the tree. | |
1735 | */ | |
517c2220 | 1736 | blk2->index = blk1->index - ichdr1.count; |
07428d7f DC |
1737 | args->index = blk2->index; |
1738 | args->blkno = blk2->blkno; | |
1739 | if (!state->extravalid) { | |
1740 | /* | |
1741 | * set the new attr location to match the old | |
1742 | * one and let the higher level split code | |
1743 | * decide where in the leaf to place it. | |
1744 | */ | |
1745 | args->index2 = blk2->index; | |
1746 | args->blkno2 = blk2->blkno; | |
1747 | } | |
1da177e4 LT |
1748 | } |
1749 | } else { | |
1750 | ASSERT(state->inleaf == 1); | |
1751 | args->index = args->index2 = blk1->index; | |
1752 | args->blkno = args->blkno2 = blk1->blkno; | |
1753 | } | |
1754 | } | |
1755 | ||
1756 | /* | |
1757 | * Examine entries until we reduce the absolute difference in | |
1758 | * byte usage between the two blocks to a minimum. | |
1759 | * GROT: Is this really necessary? With other than a 512 byte blocksize, | |
1760 | * GROT: there will always be enough room in either block for a new entry. | |
1761 | * GROT: Do a double-split for this case? | |
1762 | */ | |
1763 | STATIC int | |
517c2220 DC |
1764 | xfs_attr3_leaf_figure_balance( |
1765 | struct xfs_da_state *state, | |
1766 | struct xfs_da_state_blk *blk1, | |
1767 | struct xfs_attr3_icleaf_hdr *ichdr1, | |
1768 | struct xfs_da_state_blk *blk2, | |
1769 | struct xfs_attr3_icleaf_hdr *ichdr2, | |
1770 | int *countarg, | |
1771 | int *usedbytesarg) | |
1da177e4 | 1772 | { |
517c2220 DC |
1773 | struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr; |
1774 | struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr; | |
1775 | struct xfs_attr_leaf_entry *entry; | |
1776 | int count; | |
1777 | int max; | |
1778 | int index; | |
1779 | int totallen = 0; | |
1780 | int half; | |
1781 | int lastdelta; | |
1782 | int foundit = 0; | |
1783 | int tmp; | |
1da177e4 LT |
1784 | |
1785 | /* | |
1786 | * Examine entries until we reduce the absolute difference in | |
1787 | * byte usage between the two blocks to a minimum. | |
1788 | */ | |
517c2220 DC |
1789 | max = ichdr1->count + ichdr2->count; |
1790 | half = (max + 1) * sizeof(*entry); | |
1791 | half += ichdr1->usedbytes + ichdr2->usedbytes + | |
c59f0ad2 | 1792 | xfs_attr_leaf_newentsize(state->args, NULL); |
1da177e4 | 1793 | half /= 2; |
b2a21e7a | 1794 | lastdelta = state->args->geo->blksize; |
517c2220 | 1795 | entry = xfs_attr3_leaf_entryp(leaf1); |
1da177e4 LT |
1796 | for (count = index = 0; count < max; entry++, index++, count++) { |
1797 | ||
1798 | #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A)) | |
1799 | /* | |
1800 | * The new entry is in the first block, account for it. | |
1801 | */ | |
1802 | if (count == blk1->index) { | |
1803 | tmp = totallen + sizeof(*entry) + | |
c59f0ad2 | 1804 | xfs_attr_leaf_newentsize(state->args, NULL); |
1da177e4 LT |
1805 | if (XFS_ATTR_ABS(half - tmp) > lastdelta) |
1806 | break; | |
1807 | lastdelta = XFS_ATTR_ABS(half - tmp); | |
1808 | totallen = tmp; | |
1809 | foundit = 1; | |
1810 | } | |
1811 | ||
1812 | /* | |
1813 | * Wrap around into the second block if necessary. | |
1814 | */ | |
517c2220 | 1815 | if (count == ichdr1->count) { |
1da177e4 | 1816 | leaf1 = leaf2; |
517c2220 | 1817 | entry = xfs_attr3_leaf_entryp(leaf1); |
1da177e4 LT |
1818 | index = 0; |
1819 | } | |
1820 | ||
1821 | /* | |
1822 | * Figure out if next leaf entry would be too much. | |
1823 | */ | |
1824 | tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1, | |
1825 | index); | |
1826 | if (XFS_ATTR_ABS(half - tmp) > lastdelta) | |
1827 | break; | |
1828 | lastdelta = XFS_ATTR_ABS(half - tmp); | |
1829 | totallen = tmp; | |
1830 | #undef XFS_ATTR_ABS | |
1831 | } | |
1832 | ||
1833 | /* | |
1834 | * Calculate the number of usedbytes that will end up in lower block. | |
1835 | * If new entry not in lower block, fix up the count. | |
1836 | */ | |
1837 | totallen -= count * sizeof(*entry); | |
1838 | if (foundit) { | |
1839 | totallen -= sizeof(*entry) + | |
c59f0ad2 | 1840 | xfs_attr_leaf_newentsize(state->args, NULL); |
1da177e4 LT |
1841 | } |
1842 | ||
1843 | *countarg = count; | |
1844 | *usedbytesarg = totallen; | |
517c2220 | 1845 | return foundit; |
1da177e4 LT |
1846 | } |
1847 | ||
1848 | /*======================================================================== | |
1849 | * Routines used for shrinking the Btree. | |
1850 | *========================================================================*/ | |
1851 | ||
1852 | /* | |
1853 | * Check a leaf block and its neighbors to see if the block should be | |
1854 | * collapsed into one or the other neighbor. Always keep the block | |
1855 | * with the smaller block number. | |
1856 | * If the current block is over 50% full, don't try to join it, return 0. | |
1857 | * If the block is empty, fill in the state structure and return 2. | |
1858 | * If it can be collapsed, fill in the state structure and return 1. | |
1859 | * If nothing can be done, return 0. | |
1860 | * | |
1861 | * GROT: allow for INCOMPLETE entries in calculation. | |
1862 | */ | |
1863 | int | |
517c2220 DC |
1864 | xfs_attr3_leaf_toosmall( |
1865 | struct xfs_da_state *state, | |
1866 | int *action) | |
1da177e4 | 1867 | { |
517c2220 DC |
1868 | struct xfs_attr_leafblock *leaf; |
1869 | struct xfs_da_state_blk *blk; | |
1870 | struct xfs_attr3_icleaf_hdr ichdr; | |
1871 | struct xfs_buf *bp; | |
1872 | xfs_dablk_t blkno; | |
1873 | int bytes; | |
1874 | int forward; | |
1875 | int error; | |
1876 | int retval; | |
1877 | int i; | |
1da177e4 | 1878 | |
ee73259b DC |
1879 | trace_xfs_attr_leaf_toosmall(state->args); |
1880 | ||
1da177e4 LT |
1881 | /* |
1882 | * Check for the degenerate case of the block being over 50% full. | |
1883 | * If so, it's not worth even looking to see if we might be able | |
1884 | * to coalesce with a sibling. | |
1885 | */ | |
1886 | blk = &state->path.blk[ state->path.active-1 ]; | |
517c2220 | 1887 | leaf = blk->bp->b_addr; |
2f661241 | 1888 | xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf); |
517c2220 DC |
1889 | bytes = xfs_attr3_leaf_hdr_size(leaf) + |
1890 | ichdr.count * sizeof(xfs_attr_leaf_entry_t) + | |
1891 | ichdr.usedbytes; | |
b2a21e7a | 1892 | if (bytes > (state->args->geo->blksize >> 1)) { |
1da177e4 | 1893 | *action = 0; /* blk over 50%, don't try to join */ |
d99831ff | 1894 | return 0; |
1da177e4 LT |
1895 | } |
1896 | ||
1897 | /* | |
1898 | * Check for the degenerate case of the block being empty. | |
1899 | * If the block is empty, we'll simply delete it, no need to | |
c41564b5 | 1900 | * coalesce it with a sibling block. We choose (arbitrarily) |
1da177e4 LT |
1901 | * to merge with the forward block unless it is NULL. |
1902 | */ | |
517c2220 | 1903 | if (ichdr.count == 0) { |
1da177e4 LT |
1904 | /* |
1905 | * Make altpath point to the block we want to keep and | |
1906 | * path point to the block we want to drop (this one). | |
1907 | */ | |
517c2220 | 1908 | forward = (ichdr.forw != 0); |
1da177e4 | 1909 | memcpy(&state->altpath, &state->path, sizeof(state->path)); |
f5ea1100 | 1910 | error = xfs_da3_path_shift(state, &state->altpath, forward, |
1da177e4 LT |
1911 | 0, &retval); |
1912 | if (error) | |
d99831ff | 1913 | return error; |
1da177e4 LT |
1914 | if (retval) { |
1915 | *action = 0; | |
1916 | } else { | |
1917 | *action = 2; | |
1918 | } | |
517c2220 | 1919 | return 0; |
1da177e4 LT |
1920 | } |
1921 | ||
1922 | /* | |
1923 | * Examine each sibling block to see if we can coalesce with | |
1924 | * at least 25% free space to spare. We need to figure out | |
1925 | * whether to merge with the forward or the backward block. | |
1926 | * We prefer coalescing with the lower numbered sibling so as | |
1927 | * to shrink an attribute list over time. | |
1928 | */ | |
1929 | /* start with smaller blk num */ | |
517c2220 | 1930 | forward = ichdr.forw < ichdr.back; |
1da177e4 | 1931 | for (i = 0; i < 2; forward = !forward, i++) { |
517c2220 | 1932 | struct xfs_attr3_icleaf_hdr ichdr2; |
1da177e4 | 1933 | if (forward) |
517c2220 | 1934 | blkno = ichdr.forw; |
1da177e4 | 1935 | else |
517c2220 | 1936 | blkno = ichdr.back; |
1da177e4 LT |
1937 | if (blkno == 0) |
1938 | continue; | |
517c2220 | 1939 | error = xfs_attr3_leaf_read(state->args->trans, state->args->dp, |
ad14c33a | 1940 | blkno, -1, &bp); |
1da177e4 | 1941 | if (error) |
d99831ff | 1942 | return error; |
1da177e4 | 1943 | |
2f661241 | 1944 | xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr); |
517c2220 | 1945 | |
b2a21e7a DC |
1946 | bytes = state->args->geo->blksize - |
1947 | (state->args->geo->blksize >> 2) - | |
517c2220 DC |
1948 | ichdr.usedbytes - ichdr2.usedbytes - |
1949 | ((ichdr.count + ichdr2.count) * | |
1950 | sizeof(xfs_attr_leaf_entry_t)) - | |
1951 | xfs_attr3_leaf_hdr_size(leaf); | |
1952 | ||
1d9025e5 | 1953 | xfs_trans_brelse(state->args->trans, bp); |
1da177e4 LT |
1954 | if (bytes >= 0) |
1955 | break; /* fits with at least 25% to spare */ | |
1956 | } | |
1957 | if (i >= 2) { | |
1958 | *action = 0; | |
d99831ff | 1959 | return 0; |
1da177e4 LT |
1960 | } |
1961 | ||
1962 | /* | |
1963 | * Make altpath point to the block we want to keep (the lower | |
1964 | * numbered block) and path point to the block we want to drop. | |
1965 | */ | |
1966 | memcpy(&state->altpath, &state->path, sizeof(state->path)); | |
1967 | if (blkno < blk->blkno) { | |
f5ea1100 | 1968 | error = xfs_da3_path_shift(state, &state->altpath, forward, |
1da177e4 LT |
1969 | 0, &retval); |
1970 | } else { | |
f5ea1100 | 1971 | error = xfs_da3_path_shift(state, &state->path, forward, |
1da177e4 LT |
1972 | 0, &retval); |
1973 | } | |
1974 | if (error) | |
d99831ff | 1975 | return error; |
1da177e4 LT |
1976 | if (retval) { |
1977 | *action = 0; | |
1978 | } else { | |
1979 | *action = 1; | |
1980 | } | |
d99831ff | 1981 | return 0; |
1da177e4 LT |
1982 | } |
1983 | ||
1984 | /* | |
1985 | * Remove a name from the leaf attribute list structure. | |
1986 | * | |
1987 | * Return 1 if leaf is less than 37% full, 0 if >= 37% full. | |
1988 | * If two leaves are 37% full, when combined they will leave 25% free. | |
1989 | */ | |
1990 | int | |
517c2220 DC |
1991 | xfs_attr3_leaf_remove( |
1992 | struct xfs_buf *bp, | |
1993 | struct xfs_da_args *args) | |
1da177e4 | 1994 | { |
517c2220 DC |
1995 | struct xfs_attr_leafblock *leaf; |
1996 | struct xfs_attr3_icleaf_hdr ichdr; | |
1997 | struct xfs_attr_leaf_entry *entry; | |
517c2220 DC |
1998 | int before; |
1999 | int after; | |
2000 | int smallest; | |
2001 | int entsize; | |
2002 | int tablesize; | |
2003 | int tmp; | |
2004 | int i; | |
1da177e4 | 2005 | |
ee73259b DC |
2006 | trace_xfs_attr_leaf_remove(args); |
2007 | ||
1d9025e5 | 2008 | leaf = bp->b_addr; |
2f661241 | 2009 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); |
517c2220 | 2010 | |
c2c4c477 | 2011 | ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8); |
517c2220 DC |
2012 | ASSERT(args->index >= 0 && args->index < ichdr.count); |
2013 | ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) + | |
2014 | xfs_attr3_leaf_hdr_size(leaf)); | |
2015 | ||
2016 | entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; | |
2017 | ||
2018 | ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); | |
c2c4c477 | 2019 | ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); |
1da177e4 LT |
2020 | |
2021 | /* | |
2022 | * Scan through free region table: | |
2023 | * check for adjacency of free'd entry with an existing one, | |
2024 | * find smallest free region in case we need to replace it, | |
2025 | * adjust any map that borders the entry table, | |
2026 | */ | |
517c2220 DC |
2027 | tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t) |
2028 | + xfs_attr3_leaf_hdr_size(leaf); | |
2029 | tmp = ichdr.freemap[0].size; | |
1da177e4 LT |
2030 | before = after = -1; |
2031 | smallest = XFS_ATTR_LEAF_MAPSIZE - 1; | |
2032 | entsize = xfs_attr_leaf_entsize(leaf, args->index); | |
517c2220 | 2033 | for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { |
c2c4c477 DC |
2034 | ASSERT(ichdr.freemap[i].base < args->geo->blksize); |
2035 | ASSERT(ichdr.freemap[i].size < args->geo->blksize); | |
517c2220 DC |
2036 | if (ichdr.freemap[i].base == tablesize) { |
2037 | ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t); | |
2038 | ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t); | |
1da177e4 LT |
2039 | } |
2040 | ||
517c2220 DC |
2041 | if (ichdr.freemap[i].base + ichdr.freemap[i].size == |
2042 | be16_to_cpu(entry->nameidx)) { | |
1da177e4 | 2043 | before = i; |
517c2220 DC |
2044 | } else if (ichdr.freemap[i].base == |
2045 | (be16_to_cpu(entry->nameidx) + entsize)) { | |
1da177e4 | 2046 | after = i; |
517c2220 DC |
2047 | } else if (ichdr.freemap[i].size < tmp) { |
2048 | tmp = ichdr.freemap[i].size; | |
1da177e4 LT |
2049 | smallest = i; |
2050 | } | |
2051 | } | |
2052 | ||
2053 | /* | |
2054 | * Coalesce adjacent freemap regions, | |
2055 | * or replace the smallest region. | |
2056 | */ | |
2057 | if ((before >= 0) || (after >= 0)) { | |
2058 | if ((before >= 0) && (after >= 0)) { | |
517c2220 DC |
2059 | ichdr.freemap[before].size += entsize; |
2060 | ichdr.freemap[before].size += ichdr.freemap[after].size; | |
2061 | ichdr.freemap[after].base = 0; | |
2062 | ichdr.freemap[after].size = 0; | |
1da177e4 | 2063 | } else if (before >= 0) { |
517c2220 | 2064 | ichdr.freemap[before].size += entsize; |
1da177e4 | 2065 | } else { |
517c2220 DC |
2066 | ichdr.freemap[after].base = be16_to_cpu(entry->nameidx); |
2067 | ichdr.freemap[after].size += entsize; | |
1da177e4 LT |
2068 | } |
2069 | } else { | |
2070 | /* | |
2071 | * Replace smallest region (if it is smaller than free'd entry) | |
2072 | */ | |
517c2220 DC |
2073 | if (ichdr.freemap[smallest].size < entsize) { |
2074 | ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx); | |
2075 | ichdr.freemap[smallest].size = entsize; | |
1da177e4 LT |
2076 | } |
2077 | } | |
2078 | ||
2079 | /* | |
2080 | * Did we remove the first entry? | |
2081 | */ | |
517c2220 | 2082 | if (be16_to_cpu(entry->nameidx) == ichdr.firstused) |
1da177e4 LT |
2083 | smallest = 1; |
2084 | else | |
2085 | smallest = 0; | |
2086 | ||
2087 | /* | |
2088 | * Compress the remaining entries and zero out the removed stuff. | |
2089 | */ | |
517c2220 DC |
2090 | memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize); |
2091 | ichdr.usedbytes -= entsize; | |
1d9025e5 | 2092 | xfs_trans_log_buf(args->trans, bp, |
517c2220 | 2093 | XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), |
1da177e4 LT |
2094 | entsize)); |
2095 | ||
517c2220 DC |
2096 | tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t); |
2097 | memmove(entry, entry + 1, tmp); | |
2098 | ichdr.count--; | |
1d9025e5 | 2099 | xfs_trans_log_buf(args->trans, bp, |
517c2220 DC |
2100 | XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t))); |
2101 | ||
2102 | entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count]; | |
2103 | memset(entry, 0, sizeof(xfs_attr_leaf_entry_t)); | |
1da177e4 LT |
2104 | |
2105 | /* | |
2106 | * If we removed the first entry, re-find the first used byte | |
2107 | * in the name area. Note that if the entry was the "firstused", | |
2108 | * then we don't have a "hole" in our block resulting from | |
2109 | * removing the name. | |
2110 | */ | |
2111 | if (smallest) { | |
c2c4c477 | 2112 | tmp = args->geo->blksize; |
517c2220 DC |
2113 | entry = xfs_attr3_leaf_entryp(leaf); |
2114 | for (i = ichdr.count - 1; i >= 0; entry++, i--) { | |
2115 | ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); | |
c2c4c477 | 2116 | ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); |
6b19f2d8 NS |
2117 | |
2118 | if (be16_to_cpu(entry->nameidx) < tmp) | |
2119 | tmp = be16_to_cpu(entry->nameidx); | |
1da177e4 | 2120 | } |
517c2220 | 2121 | ichdr.firstused = tmp; |
66db8104 | 2122 | ASSERT(ichdr.firstused != 0); |
1da177e4 | 2123 | } else { |
517c2220 | 2124 | ichdr.holes = 1; /* mark as needing compaction */ |
1da177e4 | 2125 | } |
2f661241 | 2126 | xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); |
1d9025e5 | 2127 | xfs_trans_log_buf(args->trans, bp, |
517c2220 DC |
2128 | XFS_DA_LOGRANGE(leaf, &leaf->hdr, |
2129 | xfs_attr3_leaf_hdr_size(leaf))); | |
1da177e4 LT |
2130 | |
2131 | /* | |
2132 | * Check if leaf is less than 50% full, caller may want to | |
2133 | * "join" the leaf with a sibling if so. | |
2134 | */ | |
517c2220 DC |
2135 | tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) + |
2136 | ichdr.count * sizeof(xfs_attr_leaf_entry_t); | |
2137 | ||
ed358c00 | 2138 | return tmp < args->geo->magicpct; /* leaf is < 37% full */ |
1da177e4 LT |
2139 | } |
2140 | ||
2141 | /* | |
2142 | * Move all the attribute list entries from drop_leaf into save_leaf. | |
2143 | */ | |
2144 | void | |
517c2220 DC |
2145 | xfs_attr3_leaf_unbalance( |
2146 | struct xfs_da_state *state, | |
2147 | struct xfs_da_state_blk *drop_blk, | |
2148 | struct xfs_da_state_blk *save_blk) | |
1da177e4 | 2149 | { |
517c2220 DC |
2150 | struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr; |
2151 | struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr; | |
2152 | struct xfs_attr3_icleaf_hdr drophdr; | |
2153 | struct xfs_attr3_icleaf_hdr savehdr; | |
2154 | struct xfs_attr_leaf_entry *entry; | |
1da177e4 | 2155 | |
5a5881cd DC |
2156 | trace_xfs_attr_leaf_unbalance(state->args); |
2157 | ||
1d9025e5 DC |
2158 | drop_leaf = drop_blk->bp->b_addr; |
2159 | save_leaf = save_blk->bp->b_addr; | |
2f661241 BF |
2160 | xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf); |
2161 | xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf); | |
517c2220 | 2162 | entry = xfs_attr3_leaf_entryp(drop_leaf); |
1da177e4 LT |
2163 | |
2164 | /* | |
2165 | * Save last hashval from dying block for later Btree fixup. | |
2166 | */ | |
517c2220 | 2167 | drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval); |
1da177e4 LT |
2168 | |
2169 | /* | |
2170 | * Check if we need a temp buffer, or can we do it in place. | |
2171 | * Note that we don't check "leaf" for holes because we will | |
2172 | * always be dropping it, toosmall() decided that for us already. | |
2173 | */ | |
517c2220 | 2174 | if (savehdr.holes == 0) { |
1da177e4 LT |
2175 | /* |
2176 | * dest leaf has no holes, so we add there. May need | |
2177 | * to make some room in the entry array. | |
2178 | */ | |
517c2220 DC |
2179 | if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, |
2180 | drop_blk->bp, &drophdr)) { | |
c2c4c477 DC |
2181 | xfs_attr3_leaf_moveents(state->args, |
2182 | drop_leaf, &drophdr, 0, | |
517c2220 | 2183 | save_leaf, &savehdr, 0, |
c2c4c477 | 2184 | drophdr.count); |
1da177e4 | 2185 | } else { |
c2c4c477 DC |
2186 | xfs_attr3_leaf_moveents(state->args, |
2187 | drop_leaf, &drophdr, 0, | |
517c2220 | 2188 | save_leaf, &savehdr, |
c2c4c477 | 2189 | savehdr.count, drophdr.count); |
1da177e4 LT |
2190 | } |
2191 | } else { | |
2192 | /* | |
2193 | * Destination has holes, so we make a temporary copy | |
2194 | * of the leaf and add them both to that. | |
2195 | */ | |
517c2220 DC |
2196 | struct xfs_attr_leafblock *tmp_leaf; |
2197 | struct xfs_attr3_icleaf_hdr tmphdr; | |
2198 | ||
707e0dda | 2199 | tmp_leaf = kmem_zalloc(state->args->geo->blksize, 0); |
8517de2a DC |
2200 | |
2201 | /* | |
2202 | * Copy the header into the temp leaf so that all the stuff | |
2203 | * not in the incore header is present and gets copied back in | |
2204 | * once we've moved all the entries. | |
2205 | */ | |
2206 | memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf)); | |
517c2220 | 2207 | |
8517de2a | 2208 | memset(&tmphdr, 0, sizeof(tmphdr)); |
517c2220 DC |
2209 | tmphdr.magic = savehdr.magic; |
2210 | tmphdr.forw = savehdr.forw; | |
2211 | tmphdr.back = savehdr.back; | |
b2a21e7a | 2212 | tmphdr.firstused = state->args->geo->blksize; |
8517de2a DC |
2213 | |
2214 | /* write the header to the temp buffer to initialise it */ | |
2f661241 | 2215 | xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr); |
8517de2a | 2216 | |
517c2220 DC |
2217 | if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, |
2218 | drop_blk->bp, &drophdr)) { | |
c2c4c477 DC |
2219 | xfs_attr3_leaf_moveents(state->args, |
2220 | drop_leaf, &drophdr, 0, | |
517c2220 | 2221 | tmp_leaf, &tmphdr, 0, |
c2c4c477 DC |
2222 | drophdr.count); |
2223 | xfs_attr3_leaf_moveents(state->args, | |
2224 | save_leaf, &savehdr, 0, | |
517c2220 | 2225 | tmp_leaf, &tmphdr, tmphdr.count, |
c2c4c477 | 2226 | savehdr.count); |
1da177e4 | 2227 | } else { |
c2c4c477 DC |
2228 | xfs_attr3_leaf_moveents(state->args, |
2229 | save_leaf, &savehdr, 0, | |
517c2220 | 2230 | tmp_leaf, &tmphdr, 0, |
c2c4c477 DC |
2231 | savehdr.count); |
2232 | xfs_attr3_leaf_moveents(state->args, | |
2233 | drop_leaf, &drophdr, 0, | |
517c2220 | 2234 | tmp_leaf, &tmphdr, tmphdr.count, |
c2c4c477 | 2235 | drophdr.count); |
1da177e4 | 2236 | } |
b2a21e7a | 2237 | memcpy(save_leaf, tmp_leaf, state->args->geo->blksize); |
517c2220 DC |
2238 | savehdr = tmphdr; /* struct copy */ |
2239 | kmem_free(tmp_leaf); | |
1da177e4 LT |
2240 | } |
2241 | ||
2f661241 | 2242 | xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr); |
1d9025e5 | 2243 | xfs_trans_log_buf(state->args->trans, save_blk->bp, 0, |
b2a21e7a | 2244 | state->args->geo->blksize - 1); |
1da177e4 LT |
2245 | |
2246 | /* | |
2247 | * Copy out last hashval in each block for B-tree code. | |
2248 | */ | |
517c2220 DC |
2249 | entry = xfs_attr3_leaf_entryp(save_leaf); |
2250 | save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval); | |
1da177e4 LT |
2251 | } |
2252 | ||
2253 | /*======================================================================== | |
2254 | * Routines used for finding things in the Btree. | |
2255 | *========================================================================*/ | |
2256 | ||
2257 | /* | |
2258 | * Look up a name in a leaf attribute list structure. | |
2259 | * This is the internal routine, it uses the caller's buffer. | |
2260 | * | |
2261 | * Note that duplicate keys are allowed, but only check within the | |
2262 | * current leaf node. The Btree code must check in adjacent leaf nodes. | |
2263 | * | |
2264 | * Return in args->index the index into the entry[] array of either | |
2265 | * the found entry, or where the entry should have been (insert before | |
2266 | * that entry). | |
2267 | * | |
2268 | * Don't change the args->value unless we find the attribute. | |
2269 | */ | |
2270 | int | |
517c2220 DC |
2271 | xfs_attr3_leaf_lookup_int( |
2272 | struct xfs_buf *bp, | |
2273 | struct xfs_da_args *args) | |
1da177e4 | 2274 | { |
517c2220 DC |
2275 | struct xfs_attr_leafblock *leaf; |
2276 | struct xfs_attr3_icleaf_hdr ichdr; | |
2277 | struct xfs_attr_leaf_entry *entry; | |
2278 | struct xfs_attr_leaf_entry *entries; | |
2279 | struct xfs_attr_leaf_name_local *name_loc; | |
2280 | struct xfs_attr_leaf_name_remote *name_rmt; | |
2281 | xfs_dahash_t hashval; | |
2282 | int probe; | |
2283 | int span; | |
1da177e4 | 2284 | |
5a5881cd DC |
2285 | trace_xfs_attr_leaf_lookup(args); |
2286 | ||
1d9025e5 | 2287 | leaf = bp->b_addr; |
2f661241 | 2288 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); |
517c2220 | 2289 | entries = xfs_attr3_leaf_entryp(leaf); |
8ba92d43 DW |
2290 | if (ichdr.count >= args->geo->blksize / 8) |
2291 | return -EFSCORRUPTED; | |
1da177e4 LT |
2292 | |
2293 | /* | |
2294 | * Binary search. (note: small blocks will skip this loop) | |
2295 | */ | |
2296 | hashval = args->hashval; | |
517c2220 DC |
2297 | probe = span = ichdr.count / 2; |
2298 | for (entry = &entries[probe]; span > 4; entry = &entries[probe]) { | |
1da177e4 | 2299 | span /= 2; |
6b19f2d8 | 2300 | if (be32_to_cpu(entry->hashval) < hashval) |
1da177e4 | 2301 | probe += span; |
6b19f2d8 | 2302 | else if (be32_to_cpu(entry->hashval) > hashval) |
1da177e4 LT |
2303 | probe -= span; |
2304 | else | |
2305 | break; | |
2306 | } | |
8ba92d43 DW |
2307 | if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count))) |
2308 | return -EFSCORRUPTED; | |
2309 | if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval)) | |
2310 | return -EFSCORRUPTED; | |
1da177e4 LT |
2311 | |
2312 | /* | |
2313 | * Since we may have duplicate hashval's, find the first matching | |
2314 | * hashval in the leaf. | |
2315 | */ | |
517c2220 | 2316 | while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) { |
1da177e4 LT |
2317 | entry--; |
2318 | probe--; | |
2319 | } | |
517c2220 DC |
2320 | while (probe < ichdr.count && |
2321 | be32_to_cpu(entry->hashval) < hashval) { | |
1da177e4 LT |
2322 | entry++; |
2323 | probe++; | |
2324 | } | |
517c2220 | 2325 | if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) { |
1da177e4 | 2326 | args->index = probe; |
2451337d | 2327 | return -ENOATTR; |
1da177e4 LT |
2328 | } |
2329 | ||
2330 | /* | |
2331 | * Duplicate keys may be present, so search all of them for a match. | |
2332 | */ | |
517c2220 | 2333 | for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval); |
1da177e4 LT |
2334 | entry++, probe++) { |
2335 | /* | |
2336 | * GROT: Add code to remove incomplete entries. | |
2337 | */ | |
2338 | /* | |
2339 | * If we are looking for INCOMPLETE entries, show only those. | |
2340 | * If we are looking for complete entries, show only those. | |
2341 | */ | |
2342 | if ((args->flags & XFS_ATTR_INCOMPLETE) != | |
2343 | (entry->flags & XFS_ATTR_INCOMPLETE)) { | |
2344 | continue; | |
2345 | } | |
2346 | if (entry->flags & XFS_ATTR_LOCAL) { | |
517c2220 | 2347 | name_loc = xfs_attr3_leaf_name_local(leaf, probe); |
1da177e4 LT |
2348 | if (name_loc->namelen != args->namelen) |
2349 | continue; | |
517c2220 DC |
2350 | if (memcmp(args->name, name_loc->nameval, |
2351 | args->namelen) != 0) | |
1da177e4 | 2352 | continue; |
726801ba | 2353 | if (!xfs_attr_namesp_match(args->flags, entry->flags)) |
1da177e4 LT |
2354 | continue; |
2355 | args->index = probe; | |
2451337d | 2356 | return -EEXIST; |
1da177e4 | 2357 | } else { |
517c2220 | 2358 | name_rmt = xfs_attr3_leaf_name_remote(leaf, probe); |
1da177e4 LT |
2359 | if (name_rmt->namelen != args->namelen) |
2360 | continue; | |
517c2220 DC |
2361 | if (memcmp(args->name, name_rmt->name, |
2362 | args->namelen) != 0) | |
1da177e4 | 2363 | continue; |
726801ba | 2364 | if (!xfs_attr_namesp_match(args->flags, entry->flags)) |
1da177e4 LT |
2365 | continue; |
2366 | args->index = probe; | |
8275cdd0 | 2367 | args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); |
c0f054e7 | 2368 | args->rmtblkno = be32_to_cpu(name_rmt->valueblk); |
ad1858d7 DC |
2369 | args->rmtblkcnt = xfs_attr3_rmt_blocks( |
2370 | args->dp->i_mount, | |
8275cdd0 | 2371 | args->rmtvaluelen); |
2451337d | 2372 | return -EEXIST; |
1da177e4 LT |
2373 | } |
2374 | } | |
2375 | args->index = probe; | |
2451337d | 2376 | return -ENOATTR; |
1da177e4 LT |
2377 | } |
2378 | ||
2379 | /* | |
2380 | * Get the value associated with an attribute name from a leaf attribute | |
2381 | * list structure. | |
728bcaa3 DC |
2382 | * |
2383 | * If ATTR_KERNOVAL is specified, only the length needs to be returned. | |
2384 | * Unlike a lookup, we only return an error if the attribute does not | |
2385 | * exist or we can't retrieve the value. | |
1da177e4 LT |
2386 | */ |
2387 | int | |
517c2220 DC |
2388 | xfs_attr3_leaf_getvalue( |
2389 | struct xfs_buf *bp, | |
2390 | struct xfs_da_args *args) | |
1da177e4 | 2391 | { |
517c2220 DC |
2392 | struct xfs_attr_leafblock *leaf; |
2393 | struct xfs_attr3_icleaf_hdr ichdr; | |
2394 | struct xfs_attr_leaf_entry *entry; | |
2395 | struct xfs_attr_leaf_name_local *name_loc; | |
2396 | struct xfs_attr_leaf_name_remote *name_rmt; | |
1da177e4 | 2397 | |
1d9025e5 | 2398 | leaf = bp->b_addr; |
2f661241 | 2399 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); |
c2c4c477 | 2400 | ASSERT(ichdr.count < args->geo->blksize / 8); |
517c2220 | 2401 | ASSERT(args->index < ichdr.count); |
1da177e4 | 2402 | |
517c2220 | 2403 | entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; |
1da177e4 | 2404 | if (entry->flags & XFS_ATTR_LOCAL) { |
517c2220 | 2405 | name_loc = xfs_attr3_leaf_name_local(leaf, args->index); |
1da177e4 LT |
2406 | ASSERT(name_loc->namelen == args->namelen); |
2407 | ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0); | |
9df243a1 DC |
2408 | return xfs_attr_copy_value(args, |
2409 | &name_loc->nameval[args->namelen], | |
2410 | be16_to_cpu(name_loc->valuelen)); | |
a0e959d3 DC |
2411 | } |
2412 | ||
2413 | name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); | |
2414 | ASSERT(name_rmt->namelen == args->namelen); | |
2415 | ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0); | |
2416 | args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); | |
2417 | args->rmtblkno = be32_to_cpu(name_rmt->valueblk); | |
2418 | args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount, | |
2419 | args->rmtvaluelen); | |
9df243a1 | 2420 | return xfs_attr_copy_value(args, NULL, args->rmtvaluelen); |
1da177e4 LT |
2421 | } |
2422 | ||
2423 | /*======================================================================== | |
2424 | * Utility routines. | |
2425 | *========================================================================*/ | |
2426 | ||
2427 | /* | |
2428 | * Move the indicated entries from one leaf to another. | |
2429 | * NOTE: this routine modifies both source and destination leaves. | |
2430 | */ | |
2431 | /*ARGSUSED*/ | |
2432 | STATIC void | |
517c2220 | 2433 | xfs_attr3_leaf_moveents( |
c2c4c477 | 2434 | struct xfs_da_args *args, |
517c2220 DC |
2435 | struct xfs_attr_leafblock *leaf_s, |
2436 | struct xfs_attr3_icleaf_hdr *ichdr_s, | |
2437 | int start_s, | |
2438 | struct xfs_attr_leafblock *leaf_d, | |
2439 | struct xfs_attr3_icleaf_hdr *ichdr_d, | |
2440 | int start_d, | |
c2c4c477 | 2441 | int count) |
1da177e4 | 2442 | { |
517c2220 DC |
2443 | struct xfs_attr_leaf_entry *entry_s; |
2444 | struct xfs_attr_leaf_entry *entry_d; | |
2445 | int desti; | |
2446 | int tmp; | |
2447 | int i; | |
1da177e4 LT |
2448 | |
2449 | /* | |
2450 | * Check for nothing to do. | |
2451 | */ | |
2452 | if (count == 0) | |
2453 | return; | |
2454 | ||
2455 | /* | |
2456 | * Set up environment. | |
2457 | */ | |
517c2220 DC |
2458 | ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC || |
2459 | ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC); | |
2460 | ASSERT(ichdr_s->magic == ichdr_d->magic); | |
c2c4c477 | 2461 | ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8); |
517c2220 DC |
2462 | ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s)) |
2463 | + xfs_attr3_leaf_hdr_size(leaf_s)); | |
c2c4c477 | 2464 | ASSERT(ichdr_d->count < args->geo->blksize / 8); |
517c2220 DC |
2465 | ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d)) |
2466 | + xfs_attr3_leaf_hdr_size(leaf_d)); | |
2467 | ||
2468 | ASSERT(start_s < ichdr_s->count); | |
2469 | ASSERT(start_d <= ichdr_d->count); | |
2470 | ASSERT(count <= ichdr_s->count); | |
2471 | ||
1da177e4 LT |
2472 | |
2473 | /* | |
2474 | * Move the entries in the destination leaf up to make a hole? | |
2475 | */ | |
517c2220 DC |
2476 | if (start_d < ichdr_d->count) { |
2477 | tmp = ichdr_d->count - start_d; | |
1da177e4 | 2478 | tmp *= sizeof(xfs_attr_leaf_entry_t); |
517c2220 DC |
2479 | entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; |
2480 | entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count]; | |
2481 | memmove(entry_d, entry_s, tmp); | |
1da177e4 LT |
2482 | } |
2483 | ||
2484 | /* | |
2485 | * Copy all entry's in the same (sorted) order, | |
2486 | * but allocate attribute info packed and in sequence. | |
2487 | */ | |
517c2220 DC |
2488 | entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; |
2489 | entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; | |
1da177e4 LT |
2490 | desti = start_d; |
2491 | for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) { | |
517c2220 | 2492 | ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused); |
1da177e4 LT |
2493 | tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i); |
2494 | #ifdef GROT | |
2495 | /* | |
2496 | * Code to drop INCOMPLETE entries. Difficult to use as we | |
2497 | * may also need to change the insertion index. Code turned | |
2498 | * off for 6.2, should be revisited later. | |
2499 | */ | |
2500 | if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */ | |
517c2220 DC |
2501 | memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); |
2502 | ichdr_s->usedbytes -= tmp; | |
2503 | ichdr_s->count -= 1; | |
1da177e4 LT |
2504 | entry_d--; /* to compensate for ++ in loop hdr */ |
2505 | desti--; | |
2506 | if ((start_s + i) < offset) | |
2507 | result++; /* insertion index adjustment */ | |
2508 | } else { | |
2509 | #endif /* GROT */ | |
517c2220 | 2510 | ichdr_d->firstused -= tmp; |
1da177e4 LT |
2511 | /* both on-disk, don't endian flip twice */ |
2512 | entry_d->hashval = entry_s->hashval; | |
517c2220 | 2513 | entry_d->nameidx = cpu_to_be16(ichdr_d->firstused); |
1da177e4 | 2514 | entry_d->flags = entry_s->flags; |
6b19f2d8 | 2515 | ASSERT(be16_to_cpu(entry_d->nameidx) + tmp |
c2c4c477 | 2516 | <= args->geo->blksize); |
517c2220 DC |
2517 | memmove(xfs_attr3_leaf_name(leaf_d, desti), |
2518 | xfs_attr3_leaf_name(leaf_s, start_s + i), tmp); | |
6b19f2d8 | 2519 | ASSERT(be16_to_cpu(entry_s->nameidx) + tmp |
c2c4c477 | 2520 | <= args->geo->blksize); |
517c2220 DC |
2521 | memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); |
2522 | ichdr_s->usedbytes -= tmp; | |
2523 | ichdr_d->usedbytes += tmp; | |
2524 | ichdr_s->count -= 1; | |
2525 | ichdr_d->count += 1; | |
2526 | tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t) | |
2527 | + xfs_attr3_leaf_hdr_size(leaf_d); | |
2528 | ASSERT(ichdr_d->firstused >= tmp); | |
1da177e4 LT |
2529 | #ifdef GROT |
2530 | } | |
2531 | #endif /* GROT */ | |
2532 | } | |
2533 | ||
2534 | /* | |
2535 | * Zero out the entries we just copied. | |
2536 | */ | |
517c2220 | 2537 | if (start_s == ichdr_s->count) { |
1da177e4 | 2538 | tmp = count * sizeof(xfs_attr_leaf_entry_t); |
517c2220 | 2539 | entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; |
1da177e4 | 2540 | ASSERT(((char *)entry_s + tmp) <= |
c2c4c477 | 2541 | ((char *)leaf_s + args->geo->blksize)); |
517c2220 | 2542 | memset(entry_s, 0, tmp); |
1da177e4 LT |
2543 | } else { |
2544 | /* | |
2545 | * Move the remaining entries down to fill the hole, | |
2546 | * then zero the entries at the top. | |
2547 | */ | |
517c2220 DC |
2548 | tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t); |
2549 | entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count]; | |
2550 | entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; | |
2551 | memmove(entry_d, entry_s, tmp); | |
1da177e4 LT |
2552 | |
2553 | tmp = count * sizeof(xfs_attr_leaf_entry_t); | |
517c2220 | 2554 | entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count]; |
1da177e4 | 2555 | ASSERT(((char *)entry_s + tmp) <= |
c2c4c477 | 2556 | ((char *)leaf_s + args->geo->blksize)); |
517c2220 | 2557 | memset(entry_s, 0, tmp); |
1da177e4 LT |
2558 | } |
2559 | ||
2560 | /* | |
2561 | * Fill in the freemap information | |
2562 | */ | |
517c2220 DC |
2563 | ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d); |
2564 | ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t); | |
2565 | ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base; | |
2566 | ichdr_d->freemap[1].base = 0; | |
2567 | ichdr_d->freemap[2].base = 0; | |
2568 | ichdr_d->freemap[1].size = 0; | |
2569 | ichdr_d->freemap[2].size = 0; | |
2570 | ichdr_s->holes = 1; /* leaf may not be compact */ | |
1da177e4 LT |
2571 | } |
2572 | ||
2573 | /* | |
2574 | * Pick up the last hashvalue from a leaf block. | |
2575 | */ | |
2576 | xfs_dahash_t | |
1d9025e5 DC |
2577 | xfs_attr_leaf_lasthash( |
2578 | struct xfs_buf *bp, | |
2579 | int *count) | |
1da177e4 | 2580 | { |
517c2220 DC |
2581 | struct xfs_attr3_icleaf_hdr ichdr; |
2582 | struct xfs_attr_leaf_entry *entries; | |
dbd329f1 | 2583 | struct xfs_mount *mp = bp->b_mount; |
1da177e4 | 2584 | |
2f661241 | 2585 | xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr); |
517c2220 | 2586 | entries = xfs_attr3_leaf_entryp(bp->b_addr); |
1da177e4 | 2587 | if (count) |
517c2220 DC |
2588 | *count = ichdr.count; |
2589 | if (!ichdr.count) | |
2590 | return 0; | |
2591 | return be32_to_cpu(entries[ichdr.count - 1].hashval); | |
1da177e4 LT |
2592 | } |
2593 | ||
2594 | /* | |
2595 | * Calculate the number of bytes used to store the indicated attribute | |
2596 | * (whether local or remote only calculate bytes in this block). | |
2597 | */ | |
ba0f32d4 | 2598 | STATIC int |
1da177e4 LT |
2599 | xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) |
2600 | { | |
517c2220 | 2601 | struct xfs_attr_leaf_entry *entries; |
1da177e4 LT |
2602 | xfs_attr_leaf_name_local_t *name_loc; |
2603 | xfs_attr_leaf_name_remote_t *name_rmt; | |
2604 | int size; | |
2605 | ||
517c2220 DC |
2606 | entries = xfs_attr3_leaf_entryp(leaf); |
2607 | if (entries[index].flags & XFS_ATTR_LOCAL) { | |
2608 | name_loc = xfs_attr3_leaf_name_local(leaf, index); | |
c9fb86a9 | 2609 | size = xfs_attr_leaf_entsize_local(name_loc->namelen, |
053b5758 | 2610 | be16_to_cpu(name_loc->valuelen)); |
1da177e4 | 2611 | } else { |
517c2220 | 2612 | name_rmt = xfs_attr3_leaf_name_remote(leaf, index); |
c9fb86a9 | 2613 | size = xfs_attr_leaf_entsize_remote(name_rmt->namelen); |
1da177e4 | 2614 | } |
517c2220 | 2615 | return size; |
1da177e4 LT |
2616 | } |
2617 | ||
2618 | /* | |
2619 | * Calculate the number of bytes that would be required to store the new | |
2620 | * attribute (whether local or remote only calculate bytes in this block). | |
2621 | * This routine decides as a side effect whether the attribute will be | |
2622 | * a "local" or a "remote" attribute. | |
2623 | */ | |
2624 | int | |
c59f0ad2 DC |
2625 | xfs_attr_leaf_newentsize( |
2626 | struct xfs_da_args *args, | |
2627 | int *local) | |
1da177e4 | 2628 | { |
c59f0ad2 | 2629 | int size; |
1da177e4 | 2630 | |
c59f0ad2 DC |
2631 | size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen); |
2632 | if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) { | |
2633 | if (local) | |
1da177e4 | 2634 | *local = 1; |
c59f0ad2 | 2635 | return size; |
1da177e4 | 2636 | } |
c59f0ad2 DC |
2637 | if (local) |
2638 | *local = 0; | |
2639 | return xfs_attr_leaf_entsize_remote(args->namelen); | |
1da177e4 LT |
2640 | } |
2641 | ||
1da177e4 LT |
2642 | |
2643 | /*======================================================================== | |
2644 | * Manage the INCOMPLETE flag in a leaf entry | |
2645 | *========================================================================*/ | |
2646 | ||
2647 | /* | |
2648 | * Clear the INCOMPLETE flag on an entry in a leaf block. | |
2649 | */ | |
2650 | int | |
517c2220 DC |
2651 | xfs_attr3_leaf_clearflag( |
2652 | struct xfs_da_args *args) | |
1da177e4 | 2653 | { |
517c2220 DC |
2654 | struct xfs_attr_leafblock *leaf; |
2655 | struct xfs_attr_leaf_entry *entry; | |
2656 | struct xfs_attr_leaf_name_remote *name_rmt; | |
2657 | struct xfs_buf *bp; | |
2658 | int error; | |
1da177e4 | 2659 | #ifdef DEBUG |
517c2220 | 2660 | struct xfs_attr3_icleaf_hdr ichdr; |
1da177e4 LT |
2661 | xfs_attr_leaf_name_local_t *name_loc; |
2662 | int namelen; | |
2663 | char *name; | |
2664 | #endif /* DEBUG */ | |
2665 | ||
5a5881cd | 2666 | trace_xfs_attr_leaf_clearflag(args); |
1da177e4 LT |
2667 | /* |
2668 | * Set up the operation. | |
2669 | */ | |
517c2220 | 2670 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
ad14c33a | 2671 | if (error) |
d99831ff | 2672 | return error; |
1da177e4 | 2673 | |
1d9025e5 | 2674 | leaf = bp->b_addr; |
517c2220 | 2675 | entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; |
1da177e4 LT |
2676 | ASSERT(entry->flags & XFS_ATTR_INCOMPLETE); |
2677 | ||
2678 | #ifdef DEBUG | |
2f661241 | 2679 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); |
517c2220 DC |
2680 | ASSERT(args->index < ichdr.count); |
2681 | ASSERT(args->index >= 0); | |
2682 | ||
1da177e4 | 2683 | if (entry->flags & XFS_ATTR_LOCAL) { |
517c2220 | 2684 | name_loc = xfs_attr3_leaf_name_local(leaf, args->index); |
1da177e4 LT |
2685 | namelen = name_loc->namelen; |
2686 | name = (char *)name_loc->nameval; | |
2687 | } else { | |
517c2220 | 2688 | name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); |
1da177e4 LT |
2689 | namelen = name_rmt->namelen; |
2690 | name = (char *)name_rmt->name; | |
2691 | } | |
6b19f2d8 | 2692 | ASSERT(be32_to_cpu(entry->hashval) == args->hashval); |
1da177e4 LT |
2693 | ASSERT(namelen == args->namelen); |
2694 | ASSERT(memcmp(name, args->name, namelen) == 0); | |
2695 | #endif /* DEBUG */ | |
2696 | ||
2697 | entry->flags &= ~XFS_ATTR_INCOMPLETE; | |
1d9025e5 | 2698 | xfs_trans_log_buf(args->trans, bp, |
1da177e4 LT |
2699 | XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); |
2700 | ||
2701 | if (args->rmtblkno) { | |
2702 | ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0); | |
517c2220 | 2703 | name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); |
c0f054e7 | 2704 | name_rmt->valueblk = cpu_to_be32(args->rmtblkno); |
8275cdd0 | 2705 | name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); |
1d9025e5 | 2706 | xfs_trans_log_buf(args->trans, bp, |
1da177e4 LT |
2707 | XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); |
2708 | } | |
1da177e4 LT |
2709 | |
2710 | /* | |
2711 | * Commit the flag value change and start the next trans in series. | |
2712 | */ | |
411350df | 2713 | return xfs_trans_roll_inode(&args->trans, args->dp); |
1da177e4 LT |
2714 | } |
2715 | ||
2716 | /* | |
2717 | * Set the INCOMPLETE flag on an entry in a leaf block. | |
2718 | */ | |
2719 | int | |
517c2220 DC |
2720 | xfs_attr3_leaf_setflag( |
2721 | struct xfs_da_args *args) | |
1da177e4 | 2722 | { |
517c2220 DC |
2723 | struct xfs_attr_leafblock *leaf; |
2724 | struct xfs_attr_leaf_entry *entry; | |
2725 | struct xfs_attr_leaf_name_remote *name_rmt; | |
2726 | struct xfs_buf *bp; | |
1da177e4 | 2727 | int error; |
517c2220 DC |
2728 | #ifdef DEBUG |
2729 | struct xfs_attr3_icleaf_hdr ichdr; | |
2730 | #endif | |
1da177e4 | 2731 | |
5a5881cd DC |
2732 | trace_xfs_attr_leaf_setflag(args); |
2733 | ||
1da177e4 LT |
2734 | /* |
2735 | * Set up the operation. | |
2736 | */ | |
517c2220 | 2737 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
ad14c33a | 2738 | if (error) |
d99831ff | 2739 | return error; |
1da177e4 | 2740 | |
1d9025e5 | 2741 | leaf = bp->b_addr; |
517c2220 | 2742 | #ifdef DEBUG |
2f661241 | 2743 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); |
517c2220 | 2744 | ASSERT(args->index < ichdr.count); |
1da177e4 | 2745 | ASSERT(args->index >= 0); |
517c2220 DC |
2746 | #endif |
2747 | entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; | |
1da177e4 LT |
2748 | |
2749 | ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0); | |
2750 | entry->flags |= XFS_ATTR_INCOMPLETE; | |
1d9025e5 | 2751 | xfs_trans_log_buf(args->trans, bp, |
1da177e4 LT |
2752 | XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); |
2753 | if ((entry->flags & XFS_ATTR_LOCAL) == 0) { | |
517c2220 | 2754 | name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); |
1da177e4 LT |
2755 | name_rmt->valueblk = 0; |
2756 | name_rmt->valuelen = 0; | |
1d9025e5 | 2757 | xfs_trans_log_buf(args->trans, bp, |
1da177e4 LT |
2758 | XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); |
2759 | } | |
1da177e4 LT |
2760 | |
2761 | /* | |
2762 | * Commit the flag value change and start the next trans in series. | |
2763 | */ | |
411350df | 2764 | return xfs_trans_roll_inode(&args->trans, args->dp); |
1da177e4 LT |
2765 | } |
2766 | ||
2767 | /* | |
2768 | * In a single transaction, clear the INCOMPLETE flag on the leaf entry | |
2769 | * given by args->blkno/index and set the INCOMPLETE flag on the leaf | |
2770 | * entry given by args->blkno2/index2. | |
2771 | * | |
2772 | * Note that they could be in different blocks, or in the same block. | |
2773 | */ | |
2774 | int | |
517c2220 DC |
2775 | xfs_attr3_leaf_flipflags( |
2776 | struct xfs_da_args *args) | |
1da177e4 | 2777 | { |
517c2220 DC |
2778 | struct xfs_attr_leafblock *leaf1; |
2779 | struct xfs_attr_leafblock *leaf2; | |
2780 | struct xfs_attr_leaf_entry *entry1; | |
2781 | struct xfs_attr_leaf_entry *entry2; | |
2782 | struct xfs_attr_leaf_name_remote *name_rmt; | |
2783 | struct xfs_buf *bp1; | |
2784 | struct xfs_buf *bp2; | |
1da177e4 LT |
2785 | int error; |
2786 | #ifdef DEBUG | |
517c2220 DC |
2787 | struct xfs_attr3_icleaf_hdr ichdr1; |
2788 | struct xfs_attr3_icleaf_hdr ichdr2; | |
1da177e4 LT |
2789 | xfs_attr_leaf_name_local_t *name_loc; |
2790 | int namelen1, namelen2; | |
2791 | char *name1, *name2; | |
2792 | #endif /* DEBUG */ | |
2793 | ||
5a5881cd DC |
2794 | trace_xfs_attr_leaf_flipflags(args); |
2795 | ||
1da177e4 LT |
2796 | /* |
2797 | * Read the block containing the "old" attr | |
2798 | */ | |
517c2220 | 2799 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp1); |
ad14c33a DC |
2800 | if (error) |
2801 | return error; | |
1da177e4 LT |
2802 | |
2803 | /* | |
2804 | * Read the block containing the "new" attr, if it is different | |
2805 | */ | |
2806 | if (args->blkno2 != args->blkno) { | |
517c2220 | 2807 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2, |
ad14c33a DC |
2808 | -1, &bp2); |
2809 | if (error) | |
2810 | return error; | |
1da177e4 LT |
2811 | } else { |
2812 | bp2 = bp1; | |
2813 | } | |
2814 | ||
1d9025e5 | 2815 | leaf1 = bp1->b_addr; |
517c2220 | 2816 | entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index]; |
1da177e4 | 2817 | |
1d9025e5 | 2818 | leaf2 = bp2->b_addr; |
517c2220 | 2819 | entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2]; |
1da177e4 LT |
2820 | |
2821 | #ifdef DEBUG | |
2f661241 | 2822 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1); |
517c2220 DC |
2823 | ASSERT(args->index < ichdr1.count); |
2824 | ASSERT(args->index >= 0); | |
2825 | ||
2f661241 | 2826 | xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2); |
517c2220 DC |
2827 | ASSERT(args->index2 < ichdr2.count); |
2828 | ASSERT(args->index2 >= 0); | |
2829 | ||
1da177e4 | 2830 | if (entry1->flags & XFS_ATTR_LOCAL) { |
517c2220 | 2831 | name_loc = xfs_attr3_leaf_name_local(leaf1, args->index); |
1da177e4 LT |
2832 | namelen1 = name_loc->namelen; |
2833 | name1 = (char *)name_loc->nameval; | |
2834 | } else { | |
517c2220 | 2835 | name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); |
1da177e4 LT |
2836 | namelen1 = name_rmt->namelen; |
2837 | name1 = (char *)name_rmt->name; | |
2838 | } | |
2839 | if (entry2->flags & XFS_ATTR_LOCAL) { | |
517c2220 | 2840 | name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2); |
1da177e4 LT |
2841 | namelen2 = name_loc->namelen; |
2842 | name2 = (char *)name_loc->nameval; | |
2843 | } else { | |
517c2220 | 2844 | name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); |
1da177e4 LT |
2845 | namelen2 = name_rmt->namelen; |
2846 | name2 = (char *)name_rmt->name; | |
2847 | } | |
6b19f2d8 | 2848 | ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval)); |
1da177e4 LT |
2849 | ASSERT(namelen1 == namelen2); |
2850 | ASSERT(memcmp(name1, name2, namelen1) == 0); | |
2851 | #endif /* DEBUG */ | |
2852 | ||
2853 | ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE); | |
2854 | ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0); | |
2855 | ||
2856 | entry1->flags &= ~XFS_ATTR_INCOMPLETE; | |
1d9025e5 | 2857 | xfs_trans_log_buf(args->trans, bp1, |
1da177e4 LT |
2858 | XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1))); |
2859 | if (args->rmtblkno) { | |
2860 | ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0); | |
517c2220 | 2861 | name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); |
c0f054e7 | 2862 | name_rmt->valueblk = cpu_to_be32(args->rmtblkno); |
8275cdd0 | 2863 | name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); |
1d9025e5 | 2864 | xfs_trans_log_buf(args->trans, bp1, |
1da177e4 LT |
2865 | XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt))); |
2866 | } | |
2867 | ||
2868 | entry2->flags |= XFS_ATTR_INCOMPLETE; | |
1d9025e5 | 2869 | xfs_trans_log_buf(args->trans, bp2, |
1da177e4 LT |
2870 | XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2))); |
2871 | if ((entry2->flags & XFS_ATTR_LOCAL) == 0) { | |
517c2220 | 2872 | name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); |
1da177e4 LT |
2873 | name_rmt->valueblk = 0; |
2874 | name_rmt->valuelen = 0; | |
1d9025e5 | 2875 | xfs_trans_log_buf(args->trans, bp2, |
1da177e4 LT |
2876 | XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt))); |
2877 | } | |
1da177e4 LT |
2878 | |
2879 | /* | |
2880 | * Commit the flag value change and start the next trans in series. | |
2881 | */ | |
411350df | 2882 | error = xfs_trans_roll_inode(&args->trans, args->dp); |
1da177e4 | 2883 | |
517c2220 | 2884 | return error; |
1da177e4 | 2885 | } |