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