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