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