Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 | 2 | * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc. |
24df33b4 | 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" |
a4fbe6ab | 21 | #include "xfs_format.h" |
239880ef DC |
22 | #include "xfs_log_format.h" |
23 | #include "xfs_trans_resv.h" | |
1da177e4 LT |
24 | #include "xfs_sb.h" |
25 | #include "xfs_ag.h" | |
1da177e4 | 26 | #include "xfs_mount.h" |
57062787 | 27 | #include "xfs_da_format.h" |
a844f451 | 28 | #include "xfs_da_btree.h" |
1da177e4 LT |
29 | #include "xfs_inode.h" |
30 | #include "xfs_bmap.h" | |
2b9ab5ab | 31 | #include "xfs_dir2.h" |
57926640 | 32 | #include "xfs_dir2_priv.h" |
1da177e4 | 33 | #include "xfs_error.h" |
0b1b213f | 34 | #include "xfs_trace.h" |
239880ef | 35 | #include "xfs_trans.h" |
24df33b4 DC |
36 | #include "xfs_buf_item.h" |
37 | #include "xfs_cksum.h" | |
1da177e4 LT |
38 | |
39 | /* | |
40 | * Local function declarations. | |
41 | */ | |
1d9025e5 DC |
42 | static int xfs_dir2_leaf_lookup_int(xfs_da_args_t *args, struct xfs_buf **lbpp, |
43 | int *indexp, struct xfs_buf **dbpp); | |
24df33b4 | 44 | static void xfs_dir3_leaf_log_bests(struct xfs_trans *tp, struct xfs_buf *bp, |
ba0f32d4 | 45 | int first, int last); |
24df33b4 | 46 | static void xfs_dir3_leaf_log_tail(struct xfs_trans *tp, struct xfs_buf *bp); |
ba0f32d4 | 47 | |
24df33b4 DC |
48 | /* |
49 | * Check the internal consistency of a leaf1 block. | |
50 | * Pop an assert if something is wrong. | |
51 | */ | |
52 | #ifdef DEBUG | |
4141956a | 53 | #define xfs_dir3_leaf_check(dp, bp) \ |
24df33b4 | 54 | do { \ |
4141956a | 55 | if (!xfs_dir3_leaf1_check((dp), (bp))) \ |
24df33b4 DC |
56 | ASSERT(0); \ |
57 | } while (0); | |
58 | ||
59 | STATIC bool | |
60 | xfs_dir3_leaf1_check( | |
4141956a | 61 | struct xfs_inode *dp, |
24df33b4 DC |
62 | struct xfs_buf *bp) |
63 | { | |
64 | struct xfs_dir2_leaf *leaf = bp->b_addr; | |
65 | struct xfs_dir3_icleaf_hdr leafhdr; | |
66 | ||
01ba43b8 | 67 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
24df33b4 DC |
68 | |
69 | if (leafhdr.magic == XFS_DIR3_LEAF1_MAGIC) { | |
70 | struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; | |
71 | if (be64_to_cpu(leaf3->info.blkno) != bp->b_bn) | |
72 | return false; | |
73 | } else if (leafhdr.magic != XFS_DIR2_LEAF1_MAGIC) | |
74 | return false; | |
75 | ||
4141956a | 76 | return xfs_dir3_leaf_check_int(dp->i_mount, dp, &leafhdr, leaf); |
24df33b4 DC |
77 | } |
78 | #else | |
4141956a | 79 | #define xfs_dir3_leaf_check(dp, bp) |
24df33b4 DC |
80 | #endif |
81 | ||
24df33b4 DC |
82 | bool |
83 | xfs_dir3_leaf_check_int( | |
84 | struct xfs_mount *mp, | |
4141956a | 85 | struct xfs_inode *dp, |
24df33b4 DC |
86 | struct xfs_dir3_icleaf_hdr *hdr, |
87 | struct xfs_dir2_leaf *leaf) | |
88 | { | |
89 | struct xfs_dir2_leaf_entry *ents; | |
90 | xfs_dir2_leaf_tail_t *ltp; | |
91 | int stale; | |
92 | int i; | |
4141956a | 93 | const struct xfs_dir_ops *ops; |
01ba43b8 | 94 | struct xfs_dir3_icleaf_hdr leafhdr; |
24df33b4 | 95 | |
4141956a DC |
96 | /* |
97 | * we can be passed a null dp here from a verifier, so we need to go the | |
98 | * hard way to get them. | |
99 | */ | |
100 | ops = xfs_dir_get_ops(mp, dp); | |
101 | ||
01ba43b8 DC |
102 | if (!hdr) { |
103 | ops->leaf_hdr_from_disk(&leafhdr, leaf); | |
104 | hdr = &leafhdr; | |
105 | } | |
106 | ||
4141956a | 107 | ents = ops->leaf_ents_p(leaf); |
24df33b4 DC |
108 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
109 | ||
110 | /* | |
111 | * XXX (dgc): This value is not restrictive enough. | |
112 | * Should factor in the size of the bests table as well. | |
113 | * We can deduce a value for that from di_size. | |
114 | */ | |
4141956a | 115 | if (hdr->count > ops->leaf_max_ents(mp)) |
24df33b4 DC |
116 | return false; |
117 | ||
118 | /* Leaves and bests don't overlap in leaf format. */ | |
119 | if ((hdr->magic == XFS_DIR2_LEAF1_MAGIC || | |
120 | hdr->magic == XFS_DIR3_LEAF1_MAGIC) && | |
121 | (char *)&ents[hdr->count] > (char *)xfs_dir2_leaf_bests_p(ltp)) | |
122 | return false; | |
123 | ||
124 | /* Check hash value order, count stale entries. */ | |
125 | for (i = stale = 0; i < hdr->count; i++) { | |
126 | if (i + 1 < hdr->count) { | |
127 | if (be32_to_cpu(ents[i].hashval) > | |
128 | be32_to_cpu(ents[i + 1].hashval)) | |
129 | return false; | |
130 | } | |
131 | if (ents[i].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) | |
132 | stale++; | |
133 | } | |
134 | if (hdr->stale != stale) | |
135 | return false; | |
136 | return true; | |
137 | } | |
138 | ||
0f295a21 DC |
139 | /* |
140 | * We verify the magic numbers before decoding the leaf header so that on debug | |
141 | * kernels we don't get assertion failures in xfs_dir3_leaf_hdr_from_disk() due | |
142 | * to incorrect magic numbers. | |
143 | */ | |
24df33b4 DC |
144 | static bool |
145 | xfs_dir3_leaf_verify( | |
e6f7667c | 146 | struct xfs_buf *bp, |
24df33b4 DC |
147 | __uint16_t magic) |
148 | { | |
149 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
150 | struct xfs_dir2_leaf *leaf = bp->b_addr; | |
24df33b4 DC |
151 | |
152 | ASSERT(magic == XFS_DIR2_LEAF1_MAGIC || magic == XFS_DIR2_LEAFN_MAGIC); | |
153 | ||
24df33b4 DC |
154 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
155 | struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; | |
0f295a21 | 156 | __uint16_t magic3; |
24df33b4 | 157 | |
0f295a21 DC |
158 | magic3 = (magic == XFS_DIR2_LEAF1_MAGIC) ? XFS_DIR3_LEAF1_MAGIC |
159 | : XFS_DIR3_LEAFN_MAGIC; | |
24df33b4 | 160 | |
0f295a21 DC |
161 | if (leaf3->info.hdr.magic != cpu_to_be16(magic3)) |
162 | return false; | |
24df33b4 DC |
163 | if (!uuid_equal(&leaf3->info.uuid, &mp->m_sb.sb_uuid)) |
164 | return false; | |
165 | if (be64_to_cpu(leaf3->info.blkno) != bp->b_bn) | |
166 | return false; | |
167 | } else { | |
0f295a21 | 168 | if (leaf->hdr.info.magic != cpu_to_be16(magic)) |
24df33b4 DC |
169 | return false; |
170 | } | |
0f295a21 | 171 | |
01ba43b8 | 172 | return xfs_dir3_leaf_check_int(mp, NULL, NULL, leaf); |
24df33b4 DC |
173 | } |
174 | ||
175 | static void | |
176 | __read_verify( | |
177 | struct xfs_buf *bp, | |
178 | __uint16_t magic) | |
179 | { | |
180 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
181 | ||
ce5028cf ES |
182 | if (xfs_sb_version_hascrc(&mp->m_sb) && |
183 | !xfs_buf_verify_cksum(bp, XFS_DIR3_LEAF_CRC_OFF)) | |
184 | xfs_buf_ioerror(bp, EFSBADCRC); | |
185 | else if (!xfs_dir3_leaf_verify(bp, magic)) | |
24df33b4 | 186 | xfs_buf_ioerror(bp, EFSCORRUPTED); |
ce5028cf ES |
187 | |
188 | if (bp->b_error) | |
189 | xfs_verifier_error(bp); | |
24df33b4 DC |
190 | } |
191 | ||
192 | static void | |
193 | __write_verify( | |
194 | struct xfs_buf *bp, | |
195 | __uint16_t magic) | |
e6f7667c DC |
196 | { |
197 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
24df33b4 DC |
198 | struct xfs_buf_log_item *bip = bp->b_fspriv; |
199 | struct xfs_dir3_leaf_hdr *hdr3 = bp->b_addr; | |
e6f7667c | 200 | |
24df33b4 | 201 | if (!xfs_dir3_leaf_verify(bp, magic)) { |
e6f7667c | 202 | xfs_buf_ioerror(bp, EFSCORRUPTED); |
ce5028cf | 203 | xfs_verifier_error(bp); |
24df33b4 | 204 | return; |
e6f7667c | 205 | } |
24df33b4 DC |
206 | |
207 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
208 | return; | |
209 | ||
210 | if (bip) | |
211 | hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
212 | ||
f1dbcd7e | 213 | xfs_buf_update_cksum(bp, XFS_DIR3_LEAF_CRC_OFF); |
612cfbfe | 214 | } |
e6f7667c | 215 | |
612cfbfe | 216 | static void |
24df33b4 | 217 | xfs_dir3_leaf1_read_verify( |
612cfbfe DC |
218 | struct xfs_buf *bp) |
219 | { | |
24df33b4 | 220 | __read_verify(bp, XFS_DIR2_LEAF1_MAGIC); |
612cfbfe DC |
221 | } |
222 | ||
223 | static void | |
24df33b4 | 224 | xfs_dir3_leaf1_write_verify( |
612cfbfe DC |
225 | struct xfs_buf *bp) |
226 | { | |
24df33b4 | 227 | __write_verify(bp, XFS_DIR2_LEAF1_MAGIC); |
e6f7667c DC |
228 | } |
229 | ||
24df33b4 DC |
230 | static void |
231 | xfs_dir3_leafn_read_verify( | |
612cfbfe | 232 | struct xfs_buf *bp) |
e6f7667c | 233 | { |
24df33b4 | 234 | __read_verify(bp, XFS_DIR2_LEAFN_MAGIC); |
e6f7667c DC |
235 | } |
236 | ||
24df33b4 DC |
237 | static void |
238 | xfs_dir3_leafn_write_verify( | |
612cfbfe | 239 | struct xfs_buf *bp) |
e6f7667c | 240 | { |
24df33b4 | 241 | __write_verify(bp, XFS_DIR2_LEAFN_MAGIC); |
e6f7667c DC |
242 | } |
243 | ||
d75afeb3 | 244 | const struct xfs_buf_ops xfs_dir3_leaf1_buf_ops = { |
24df33b4 DC |
245 | .verify_read = xfs_dir3_leaf1_read_verify, |
246 | .verify_write = xfs_dir3_leaf1_write_verify, | |
1813dd64 DC |
247 | }; |
248 | ||
24df33b4 DC |
249 | const struct xfs_buf_ops xfs_dir3_leafn_buf_ops = { |
250 | .verify_read = xfs_dir3_leafn_read_verify, | |
251 | .verify_write = xfs_dir3_leafn_write_verify, | |
1813dd64 DC |
252 | }; |
253 | ||
e6f7667c | 254 | static int |
24df33b4 | 255 | xfs_dir3_leaf_read( |
e6f7667c DC |
256 | struct xfs_trans *tp, |
257 | struct xfs_inode *dp, | |
258 | xfs_dablk_t fbno, | |
259 | xfs_daddr_t mappedbno, | |
260 | struct xfs_buf **bpp) | |
261 | { | |
d75afeb3 DC |
262 | int err; |
263 | ||
264 | err = xfs_da_read_buf(tp, dp, fbno, mappedbno, bpp, | |
24df33b4 | 265 | XFS_DATA_FORK, &xfs_dir3_leaf1_buf_ops); |
d75afeb3 | 266 | if (!err && tp) |
61fe135c | 267 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAF1_BUF); |
d75afeb3 | 268 | return err; |
e6f7667c DC |
269 | } |
270 | ||
271 | int | |
24df33b4 | 272 | xfs_dir3_leafn_read( |
e6f7667c DC |
273 | struct xfs_trans *tp, |
274 | struct xfs_inode *dp, | |
275 | xfs_dablk_t fbno, | |
276 | xfs_daddr_t mappedbno, | |
277 | struct xfs_buf **bpp) | |
278 | { | |
d75afeb3 DC |
279 | int err; |
280 | ||
281 | err = xfs_da_read_buf(tp, dp, fbno, mappedbno, bpp, | |
24df33b4 | 282 | XFS_DATA_FORK, &xfs_dir3_leafn_buf_ops); |
d75afeb3 | 283 | if (!err && tp) |
61fe135c | 284 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAFN_BUF); |
d75afeb3 | 285 | return err; |
24df33b4 DC |
286 | } |
287 | ||
288 | /* | |
289 | * Initialize a new leaf block, leaf1 or leafn magic accepted. | |
290 | */ | |
291 | static void | |
292 | xfs_dir3_leaf_init( | |
293 | struct xfs_mount *mp, | |
d75afeb3 | 294 | struct xfs_trans *tp, |
24df33b4 DC |
295 | struct xfs_buf *bp, |
296 | xfs_ino_t owner, | |
297 | __uint16_t type) | |
298 | { | |
299 | struct xfs_dir2_leaf *leaf = bp->b_addr; | |
300 | ||
301 | ASSERT(type == XFS_DIR2_LEAF1_MAGIC || type == XFS_DIR2_LEAFN_MAGIC); | |
302 | ||
303 | if (xfs_sb_version_hascrc(&mp->m_sb)) { | |
304 | struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; | |
305 | ||
306 | memset(leaf3, 0, sizeof(*leaf3)); | |
307 | ||
308 | leaf3->info.hdr.magic = (type == XFS_DIR2_LEAF1_MAGIC) | |
309 | ? cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) | |
310 | : cpu_to_be16(XFS_DIR3_LEAFN_MAGIC); | |
311 | leaf3->info.blkno = cpu_to_be64(bp->b_bn); | |
312 | leaf3->info.owner = cpu_to_be64(owner); | |
313 | uuid_copy(&leaf3->info.uuid, &mp->m_sb.sb_uuid); | |
314 | } else { | |
315 | memset(leaf, 0, sizeof(*leaf)); | |
316 | leaf->hdr.info.magic = cpu_to_be16(type); | |
317 | } | |
318 | ||
319 | /* | |
320 | * If it's a leaf-format directory initialize the tail. | |
321 | * Caller is responsible for initialising the bests table. | |
322 | */ | |
323 | if (type == XFS_DIR2_LEAF1_MAGIC) { | |
324 | struct xfs_dir2_leaf_tail *ltp; | |
325 | ||
326 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); | |
327 | ltp->bestcount = 0; | |
328 | bp->b_ops = &xfs_dir3_leaf1_buf_ops; | |
61fe135c | 329 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAF1_BUF); |
d75afeb3 | 330 | } else { |
24df33b4 | 331 | bp->b_ops = &xfs_dir3_leafn_buf_ops; |
61fe135c | 332 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAFN_BUF); |
d75afeb3 | 333 | } |
24df33b4 DC |
334 | } |
335 | ||
336 | int | |
337 | xfs_dir3_leaf_get_buf( | |
338 | xfs_da_args_t *args, | |
339 | xfs_dir2_db_t bno, | |
340 | struct xfs_buf **bpp, | |
341 | __uint16_t magic) | |
342 | { | |
343 | struct xfs_inode *dp = args->dp; | |
344 | struct xfs_trans *tp = args->trans; | |
345 | struct xfs_mount *mp = dp->i_mount; | |
346 | struct xfs_buf *bp; | |
347 | int error; | |
348 | ||
349 | ASSERT(magic == XFS_DIR2_LEAF1_MAGIC || magic == XFS_DIR2_LEAFN_MAGIC); | |
30028030 DC |
350 | ASSERT(bno >= xfs_dir2_byte_to_db(args->geo, XFS_DIR2_LEAF_OFFSET) && |
351 | bno < xfs_dir2_byte_to_db(args->geo, XFS_DIR2_FREE_OFFSET)); | |
24df33b4 | 352 | |
2998ab1d DC |
353 | error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(args->geo, bno), |
354 | -1, &bp, XFS_DATA_FORK); | |
24df33b4 DC |
355 | if (error) |
356 | return error; | |
357 | ||
d75afeb3 | 358 | xfs_dir3_leaf_init(mp, tp, bp, dp->i_ino, magic); |
4141956a | 359 | xfs_dir3_leaf_log_header(tp, dp, bp); |
24df33b4 DC |
360 | if (magic == XFS_DIR2_LEAF1_MAGIC) |
361 | xfs_dir3_leaf_log_tail(tp, bp); | |
362 | *bpp = bp; | |
363 | return 0; | |
e6f7667c | 364 | } |
1da177e4 LT |
365 | |
366 | /* | |
367 | * Convert a block form directory to a leaf form directory. | |
368 | */ | |
369 | int /* error */ | |
370 | xfs_dir2_block_to_leaf( | |
371 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 372 | struct xfs_buf *dbp) /* input block's buffer */ |
1da177e4 | 373 | { |
68b3a102 | 374 | __be16 *bestsp; /* leaf's bestsp entries */ |
1da177e4 | 375 | xfs_dablk_t blkno; /* leaf block's bno */ |
4f6ae1a4 | 376 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
1da177e4 LT |
377 | xfs_dir2_leaf_entry_t *blp; /* block's leaf entries */ |
378 | xfs_dir2_block_tail_t *btp; /* block's tail */ | |
379 | xfs_inode_t *dp; /* incore directory inode */ | |
380 | int error; /* error return code */ | |
1d9025e5 | 381 | struct xfs_buf *lbp; /* leaf block's buffer */ |
1da177e4 LT |
382 | xfs_dir2_db_t ldb; /* leaf block's bno */ |
383 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
384 | xfs_dir2_leaf_tail_t *ltp; /* leaf's tail */ | |
385 | xfs_mount_t *mp; /* filesystem mount point */ | |
386 | int needlog; /* need to log block header */ | |
387 | int needscan; /* need to rescan bestfree */ | |
388 | xfs_trans_t *tp; /* transaction pointer */ | |
33363fee | 389 | struct xfs_dir2_data_free *bf; |
24df33b4 DC |
390 | struct xfs_dir2_leaf_entry *ents; |
391 | struct xfs_dir3_icleaf_hdr leafhdr; | |
1da177e4 | 392 | |
0b1b213f CH |
393 | trace_xfs_dir2_block_to_leaf(args); |
394 | ||
1da177e4 LT |
395 | dp = args->dp; |
396 | mp = dp->i_mount; | |
397 | tp = args->trans; | |
398 | /* | |
399 | * Add the leaf block to the inode. | |
400 | * This interface will only put blocks in the leaf/node range. | |
401 | * Since that's empty now, we'll get the root (block 0 in range). | |
402 | */ | |
403 | if ((error = xfs_da_grow_inode(args, &blkno))) { | |
404 | return error; | |
405 | } | |
2998ab1d | 406 | ldb = xfs_dir2_da_to_db(args->geo, blkno); |
30028030 | 407 | ASSERT(ldb == xfs_dir2_byte_to_db(args->geo, XFS_DIR2_LEAF_OFFSET)); |
1da177e4 LT |
408 | /* |
409 | * Initialize the leaf block, get a buffer for it. | |
410 | */ | |
24df33b4 DC |
411 | error = xfs_dir3_leaf_get_buf(args, ldb, &lbp, XFS_DIR2_LEAF1_MAGIC); |
412 | if (error) | |
1da177e4 | 413 | return error; |
24df33b4 | 414 | |
1d9025e5 DC |
415 | leaf = lbp->b_addr; |
416 | hdr = dbp->b_addr; | |
33363fee | 417 | xfs_dir3_data_check(dp, dbp); |
4f6ae1a4 | 418 | btp = xfs_dir2_block_tail_p(mp, hdr); |
bbaaf538 | 419 | blp = xfs_dir2_block_leaf_p(btp); |
2ca98774 | 420 | bf = dp->d_ops->data_bestfree_p(hdr); |
4141956a | 421 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 | 422 | |
1da177e4 LT |
423 | /* |
424 | * Set the counts in the leaf header. | |
425 | */ | |
01ba43b8 | 426 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
24df33b4 DC |
427 | leafhdr.count = be32_to_cpu(btp->count); |
428 | leafhdr.stale = be32_to_cpu(btp->stale); | |
01ba43b8 | 429 | dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); |
4141956a | 430 | xfs_dir3_leaf_log_header(tp, dp, lbp); |
24df33b4 | 431 | |
1da177e4 LT |
432 | /* |
433 | * Could compact these but I think we always do the conversion | |
434 | * after squeezing out stale entries. | |
435 | */ | |
24df33b4 | 436 | memcpy(ents, blp, be32_to_cpu(btp->count) * sizeof(xfs_dir2_leaf_entry_t)); |
4141956a | 437 | xfs_dir3_leaf_log_ents(tp, dp, lbp, 0, leafhdr.count - 1); |
1da177e4 LT |
438 | needscan = 0; |
439 | needlog = 1; | |
440 | /* | |
441 | * Make the space formerly occupied by the leaf entries and block | |
442 | * tail be free. | |
443 | */ | |
2ca98774 | 444 | xfs_dir2_data_make_free(tp, dp, dbp, |
4f6ae1a4 CH |
445 | (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr), |
446 | (xfs_dir2_data_aoff_t)((char *)hdr + mp->m_dirblksize - | |
1da177e4 LT |
447 | (char *)blp), |
448 | &needlog, &needscan); | |
449 | /* | |
450 | * Fix up the block header, make it a data block. | |
451 | */ | |
33363fee | 452 | dbp->b_ops = &xfs_dir3_data_buf_ops; |
61fe135c | 453 | xfs_trans_buf_set_type(tp, dbp, XFS_BLFT_DIR_DATA_BUF); |
33363fee DC |
454 | if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC)) |
455 | hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC); | |
456 | else | |
457 | hdr->magic = cpu_to_be32(XFS_DIR3_DATA_MAGIC); | |
458 | ||
1da177e4 | 459 | if (needscan) |
9d23fc85 | 460 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
1da177e4 LT |
461 | /* |
462 | * Set up leaf tail and bests table. | |
463 | */ | |
bbaaf538 | 464 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
afbcb3f9 | 465 | ltp->bestcount = cpu_to_be32(1); |
bbaaf538 | 466 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
f5f3d9b0 | 467 | bestsp[0] = bf[0].length; |
1da177e4 LT |
468 | /* |
469 | * Log the data header and leaf bests table. | |
470 | */ | |
471 | if (needlog) | |
2ca98774 | 472 | xfs_dir2_data_log_header(tp, dp, dbp); |
4141956a | 473 | xfs_dir3_leaf_check(dp, lbp); |
33363fee | 474 | xfs_dir3_data_check(dp, dbp); |
24df33b4 | 475 | xfs_dir3_leaf_log_bests(tp, lbp, 0, 0); |
1da177e4 LT |
476 | return 0; |
477 | } | |
478 | ||
a230a1df | 479 | STATIC void |
24df33b4 DC |
480 | xfs_dir3_leaf_find_stale( |
481 | struct xfs_dir3_icleaf_hdr *leafhdr, | |
482 | struct xfs_dir2_leaf_entry *ents, | |
a230a1df CH |
483 | int index, |
484 | int *lowstale, | |
485 | int *highstale) | |
486 | { | |
487 | /* | |
488 | * Find the first stale entry before our index, if any. | |
489 | */ | |
490 | for (*lowstale = index - 1; *lowstale >= 0; --*lowstale) { | |
24df33b4 | 491 | if (ents[*lowstale].address == |
a230a1df CH |
492 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) |
493 | break; | |
494 | } | |
495 | ||
496 | /* | |
497 | * Find the first stale entry at or after our index, if any. | |
498 | * Stop if the result would require moving more entries than using | |
499 | * lowstale. | |
500 | */ | |
24df33b4 DC |
501 | for (*highstale = index; *highstale < leafhdr->count; ++*highstale) { |
502 | if (ents[*highstale].address == | |
a230a1df CH |
503 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) |
504 | break; | |
505 | if (*lowstale >= 0 && index - *lowstale <= *highstale - index) | |
506 | break; | |
507 | } | |
508 | } | |
509 | ||
4fb44c82 | 510 | struct xfs_dir2_leaf_entry * |
24df33b4 DC |
511 | xfs_dir3_leaf_find_entry( |
512 | struct xfs_dir3_icleaf_hdr *leafhdr, | |
513 | struct xfs_dir2_leaf_entry *ents, | |
4fb44c82 CH |
514 | int index, /* leaf table position */ |
515 | int compact, /* need to compact leaves */ | |
516 | int lowstale, /* index of prev stale leaf */ | |
517 | int highstale, /* index of next stale leaf */ | |
518 | int *lfloglow, /* low leaf logging index */ | |
519 | int *lfloghigh) /* high leaf logging index */ | |
520 | { | |
24df33b4 | 521 | if (!leafhdr->stale) { |
4fb44c82 CH |
522 | xfs_dir2_leaf_entry_t *lep; /* leaf entry table pointer */ |
523 | ||
524 | /* | |
525 | * Now we need to make room to insert the leaf entry. | |
526 | * | |
527 | * If there are no stale entries, just insert a hole at index. | |
528 | */ | |
24df33b4 DC |
529 | lep = &ents[index]; |
530 | if (index < leafhdr->count) | |
4fb44c82 | 531 | memmove(lep + 1, lep, |
24df33b4 | 532 | (leafhdr->count - index) * sizeof(*lep)); |
4fb44c82 CH |
533 | |
534 | /* | |
535 | * Record low and high logging indices for the leaf. | |
536 | */ | |
537 | *lfloglow = index; | |
24df33b4 | 538 | *lfloghigh = leafhdr->count++; |
4fb44c82 CH |
539 | return lep; |
540 | } | |
541 | ||
542 | /* | |
543 | * There are stale entries. | |
544 | * | |
545 | * We will use one of them for the new entry. It's probably not at | |
546 | * the right location, so we'll have to shift some up or down first. | |
547 | * | |
548 | * If we didn't compact before, we need to find the nearest stale | |
549 | * entries before and after our insertion point. | |
550 | */ | |
a230a1df | 551 | if (compact == 0) |
24df33b4 DC |
552 | xfs_dir3_leaf_find_stale(leafhdr, ents, index, |
553 | &lowstale, &highstale); | |
4fb44c82 CH |
554 | |
555 | /* | |
556 | * If the low one is better, use it. | |
557 | */ | |
558 | if (lowstale >= 0 && | |
24df33b4 | 559 | (highstale == leafhdr->count || |
4fb44c82 CH |
560 | index - lowstale - 1 < highstale - index)) { |
561 | ASSERT(index - lowstale - 1 >= 0); | |
24df33b4 | 562 | ASSERT(ents[lowstale].address == |
69ef921b | 563 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)); |
4fb44c82 CH |
564 | |
565 | /* | |
566 | * Copy entries up to cover the stale entry and make room | |
567 | * for the new entry. | |
568 | */ | |
569 | if (index - lowstale - 1 > 0) { | |
24df33b4 | 570 | memmove(&ents[lowstale], &ents[lowstale + 1], |
4fb44c82 | 571 | (index - lowstale - 1) * |
24df33b4 | 572 | sizeof(xfs_dir2_leaf_entry_t)); |
4fb44c82 CH |
573 | } |
574 | *lfloglow = MIN(lowstale, *lfloglow); | |
575 | *lfloghigh = MAX(index - 1, *lfloghigh); | |
24df33b4 DC |
576 | leafhdr->stale--; |
577 | return &ents[index - 1]; | |
4fb44c82 CH |
578 | } |
579 | ||
580 | /* | |
581 | * The high one is better, so use that one. | |
582 | */ | |
583 | ASSERT(highstale - index >= 0); | |
24df33b4 | 584 | ASSERT(ents[highstale].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)); |
4fb44c82 CH |
585 | |
586 | /* | |
587 | * Copy entries down to cover the stale entry and make room for the | |
588 | * new entry. | |
589 | */ | |
590 | if (highstale - index > 0) { | |
24df33b4 | 591 | memmove(&ents[index + 1], &ents[index], |
4fb44c82 CH |
592 | (highstale - index) * sizeof(xfs_dir2_leaf_entry_t)); |
593 | } | |
594 | *lfloglow = MIN(index, *lfloglow); | |
595 | *lfloghigh = MAX(highstale, *lfloghigh); | |
24df33b4 DC |
596 | leafhdr->stale--; |
597 | return &ents[index]; | |
4fb44c82 CH |
598 | } |
599 | ||
1da177e4 LT |
600 | /* |
601 | * Add an entry to a leaf form directory. | |
602 | */ | |
603 | int /* error */ | |
604 | xfs_dir2_leaf_addname( | |
605 | xfs_da_args_t *args) /* operation arguments */ | |
606 | { | |
68b3a102 | 607 | __be16 *bestsp; /* freespace table in leaf */ |
1da177e4 | 608 | int compact; /* need to compact leaves */ |
c2066e26 | 609 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1d9025e5 | 610 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
611 | xfs_dir2_data_entry_t *dep; /* data block entry */ |
612 | xfs_inode_t *dp; /* incore directory inode */ | |
613 | xfs_dir2_data_unused_t *dup; /* data unused entry */ | |
614 | int error; /* error return value */ | |
615 | int grown; /* allocated new data block */ | |
616 | int highstale; /* index of next stale leaf */ | |
617 | int i; /* temporary, index */ | |
618 | int index; /* leaf table position */ | |
1d9025e5 | 619 | struct xfs_buf *lbp; /* leaf's buffer */ |
1da177e4 LT |
620 | xfs_dir2_leaf_t *leaf; /* leaf structure */ |
621 | int length; /* length of new entry */ | |
622 | xfs_dir2_leaf_entry_t *lep; /* leaf entry table pointer */ | |
623 | int lfloglow; /* low leaf logging index */ | |
624 | int lfloghigh; /* high leaf logging index */ | |
625 | int lowstale; /* index of prev stale leaf */ | |
626 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail pointer */ | |
627 | xfs_mount_t *mp; /* filesystem mount point */ | |
628 | int needbytes; /* leaf block bytes needed */ | |
629 | int needlog; /* need to log data header */ | |
630 | int needscan; /* need to rescan data free */ | |
3d693c6e | 631 | __be16 *tagp; /* end of data entry */ |
1da177e4 LT |
632 | xfs_trans_t *tp; /* transaction pointer */ |
633 | xfs_dir2_db_t use_block; /* data block number */ | |
33363fee | 634 | struct xfs_dir2_data_free *bf; /* bestfree table */ |
24df33b4 DC |
635 | struct xfs_dir2_leaf_entry *ents; |
636 | struct xfs_dir3_icleaf_hdr leafhdr; | |
1da177e4 | 637 | |
0b1b213f CH |
638 | trace_xfs_dir2_leaf_addname(args); |
639 | ||
1da177e4 LT |
640 | dp = args->dp; |
641 | tp = args->trans; | |
642 | mp = dp->i_mount; | |
e6f7667c | 643 | |
7dda6e86 | 644 | error = xfs_dir3_leaf_read(tp, dp, args->geo->leafblk, -1, &lbp); |
4bb20a83 | 645 | if (error) |
1da177e4 | 646 | return error; |
e6f7667c | 647 | |
1da177e4 LT |
648 | /* |
649 | * Look up the entry by hash value and name. | |
650 | * We know it's not there, our caller has already done a lookup. | |
651 | * So the index is of the entry to insert in front of. | |
652 | * But if there are dup hash values the index is of the first of those. | |
653 | */ | |
654 | index = xfs_dir2_leaf_search_hash(args, lbp); | |
1d9025e5 | 655 | leaf = lbp->b_addr; |
bbaaf538 | 656 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
4141956a | 657 | ents = dp->d_ops->leaf_ents_p(leaf); |
01ba43b8 | 658 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
bbaaf538 | 659 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
9d23fc85 | 660 | length = dp->d_ops->data_entsize(args->namelen); |
24df33b4 | 661 | |
1da177e4 LT |
662 | /* |
663 | * See if there are any entries with the same hash value | |
664 | * and space in their block for the new entry. | |
665 | * This is good because it puts multiple same-hash value entries | |
666 | * in a data block, improving the lookup of those entries. | |
667 | */ | |
24df33b4 DC |
668 | for (use_block = -1, lep = &ents[index]; |
669 | index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; | |
1da177e4 | 670 | index++, lep++) { |
3c1f9c15 | 671 | if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR) |
1da177e4 | 672 | continue; |
30028030 | 673 | i = xfs_dir2_dataptr_to_db(args->geo, be32_to_cpu(lep->address)); |
afbcb3f9 | 674 | ASSERT(i < be32_to_cpu(ltp->bestcount)); |
69ef921b | 675 | ASSERT(bestsp[i] != cpu_to_be16(NULLDATAOFF)); |
68b3a102 | 676 | if (be16_to_cpu(bestsp[i]) >= length) { |
1da177e4 LT |
677 | use_block = i; |
678 | break; | |
679 | } | |
680 | } | |
681 | /* | |
682 | * Didn't find a block yet, linear search all the data blocks. | |
683 | */ | |
684 | if (use_block == -1) { | |
afbcb3f9 | 685 | for (i = 0; i < be32_to_cpu(ltp->bestcount); i++) { |
1da177e4 LT |
686 | /* |
687 | * Remember a block we see that's missing. | |
688 | */ | |
69ef921b CH |
689 | if (bestsp[i] == cpu_to_be16(NULLDATAOFF) && |
690 | use_block == -1) | |
1da177e4 | 691 | use_block = i; |
68b3a102 | 692 | else if (be16_to_cpu(bestsp[i]) >= length) { |
1da177e4 LT |
693 | use_block = i; |
694 | break; | |
695 | } | |
696 | } | |
697 | } | |
698 | /* | |
699 | * How many bytes do we need in the leaf block? | |
700 | */ | |
2282396d | 701 | needbytes = 0; |
24df33b4 | 702 | if (!leafhdr.stale) |
2282396d CH |
703 | needbytes += sizeof(xfs_dir2_leaf_entry_t); |
704 | if (use_block == -1) | |
705 | needbytes += sizeof(xfs_dir2_data_off_t); | |
706 | ||
1da177e4 LT |
707 | /* |
708 | * Now kill use_block if it refers to a missing block, so we | |
709 | * can use it as an indication of allocation needed. | |
710 | */ | |
69ef921b | 711 | if (use_block != -1 && bestsp[use_block] == cpu_to_be16(NULLDATAOFF)) |
1da177e4 LT |
712 | use_block = -1; |
713 | /* | |
714 | * If we don't have enough free bytes but we can make enough | |
715 | * by compacting out stale entries, we'll do that. | |
716 | */ | |
24df33b4 DC |
717 | if ((char *)bestsp - (char *)&ents[leafhdr.count] < needbytes && |
718 | leafhdr.stale > 1) | |
1da177e4 | 719 | compact = 1; |
24df33b4 | 720 | |
1da177e4 LT |
721 | /* |
722 | * Otherwise if we don't have enough free bytes we need to | |
723 | * convert to node form. | |
724 | */ | |
24df33b4 | 725 | else if ((char *)bestsp - (char *)&ents[leafhdr.count] < needbytes) { |
1da177e4 LT |
726 | /* |
727 | * Just checking or no space reservation, give up. | |
728 | */ | |
6a178100 BN |
729 | if ((args->op_flags & XFS_DA_OP_JUSTCHECK) || |
730 | args->total == 0) { | |
1d9025e5 | 731 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
732 | return XFS_ERROR(ENOSPC); |
733 | } | |
734 | /* | |
735 | * Convert to node form. | |
736 | */ | |
737 | error = xfs_dir2_leaf_to_node(args, lbp); | |
1da177e4 LT |
738 | if (error) |
739 | return error; | |
740 | /* | |
741 | * Then add the new entry. | |
742 | */ | |
743 | return xfs_dir2_node_addname(args); | |
744 | } | |
745 | /* | |
746 | * Otherwise it will fit without compaction. | |
747 | */ | |
748 | else | |
749 | compact = 0; | |
750 | /* | |
751 | * If just checking, then it will fit unless we needed to allocate | |
752 | * a new data block. | |
753 | */ | |
6a178100 | 754 | if (args->op_flags & XFS_DA_OP_JUSTCHECK) { |
1d9025e5 | 755 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
756 | return use_block == -1 ? XFS_ERROR(ENOSPC) : 0; |
757 | } | |
758 | /* | |
759 | * If no allocations are allowed, return now before we've | |
760 | * changed anything. | |
761 | */ | |
762 | if (args->total == 0 && use_block == -1) { | |
1d9025e5 | 763 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
764 | return XFS_ERROR(ENOSPC); |
765 | } | |
766 | /* | |
767 | * Need to compact the leaf entries, removing stale ones. | |
768 | * Leave one stale entry behind - the one closest to our | |
769 | * insertion index - and we'll shift that one to our insertion | |
770 | * point later. | |
771 | */ | |
772 | if (compact) { | |
24df33b4 DC |
773 | xfs_dir3_leaf_compact_x1(&leafhdr, ents, &index, &lowstale, |
774 | &highstale, &lfloglow, &lfloghigh); | |
1da177e4 LT |
775 | } |
776 | /* | |
777 | * There are stale entries, so we'll need log-low and log-high | |
778 | * impossibly bad values later. | |
779 | */ | |
24df33b4 DC |
780 | else if (leafhdr.stale) { |
781 | lfloglow = leafhdr.count; | |
1da177e4 LT |
782 | lfloghigh = -1; |
783 | } | |
784 | /* | |
785 | * If there was no data block space found, we need to allocate | |
786 | * a new one. | |
787 | */ | |
788 | if (use_block == -1) { | |
789 | /* | |
790 | * Add the new data block. | |
791 | */ | |
792 | if ((error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, | |
793 | &use_block))) { | |
1d9025e5 | 794 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
795 | return error; |
796 | } | |
797 | /* | |
798 | * Initialize the block. | |
799 | */ | |
f5f3d9b0 | 800 | if ((error = xfs_dir3_data_init(args, use_block, &dbp))) { |
1d9025e5 | 801 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
802 | return error; |
803 | } | |
804 | /* | |
805 | * If we're adding a new data block on the end we need to | |
806 | * extend the bests table. Copy it up one entry. | |
807 | */ | |
afbcb3f9 | 808 | if (use_block >= be32_to_cpu(ltp->bestcount)) { |
1da177e4 LT |
809 | bestsp--; |
810 | memmove(&bestsp[0], &bestsp[1], | |
afbcb3f9 | 811 | be32_to_cpu(ltp->bestcount) * sizeof(bestsp[0])); |
413d57c9 | 812 | be32_add_cpu(<p->bestcount, 1); |
24df33b4 DC |
813 | xfs_dir3_leaf_log_tail(tp, lbp); |
814 | xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); | |
1da177e4 LT |
815 | } |
816 | /* | |
817 | * If we're filling in a previously empty block just log it. | |
818 | */ | |
819 | else | |
24df33b4 | 820 | xfs_dir3_leaf_log_bests(tp, lbp, use_block, use_block); |
1d9025e5 | 821 | hdr = dbp->b_addr; |
2ca98774 | 822 | bf = dp->d_ops->data_bestfree_p(hdr); |
33363fee | 823 | bestsp[use_block] = bf[0].length; |
1da177e4 | 824 | grown = 1; |
e4813572 DC |
825 | } else { |
826 | /* | |
827 | * Already had space in some data block. | |
828 | * Just read that one in. | |
829 | */ | |
33363fee | 830 | error = xfs_dir3_data_read(tp, dp, |
2998ab1d DC |
831 | xfs_dir2_db_to_da(args->geo, use_block), |
832 | -1, &dbp); | |
4bb20a83 | 833 | if (error) { |
1d9025e5 | 834 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
835 | return error; |
836 | } | |
1d9025e5 | 837 | hdr = dbp->b_addr; |
2ca98774 | 838 | bf = dp->d_ops->data_bestfree_p(hdr); |
1da177e4 LT |
839 | grown = 0; |
840 | } | |
1da177e4 LT |
841 | /* |
842 | * Point to the biggest freespace in our data block. | |
843 | */ | |
844 | dup = (xfs_dir2_data_unused_t *) | |
33363fee | 845 | ((char *)hdr + be16_to_cpu(bf[0].offset)); |
ad354eb3 | 846 | ASSERT(be16_to_cpu(dup->length) >= length); |
1da177e4 LT |
847 | needscan = needlog = 0; |
848 | /* | |
849 | * Mark the initial part of our freespace in use for the new entry. | |
850 | */ | |
2ca98774 | 851 | xfs_dir2_data_use_free(tp, dp, dbp, dup, |
c2066e26 | 852 | (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), length, |
1da177e4 LT |
853 | &needlog, &needscan); |
854 | /* | |
855 | * Initialize our new entry (at last). | |
856 | */ | |
857 | dep = (xfs_dir2_data_entry_t *)dup; | |
ff9901c1 | 858 | dep->inumber = cpu_to_be64(args->inumber); |
1da177e4 LT |
859 | dep->namelen = args->namelen; |
860 | memcpy(dep->name, args->name, dep->namelen); | |
9d23fc85 DC |
861 | dp->d_ops->data_put_ftype(dep, args->filetype); |
862 | tagp = dp->d_ops->data_entry_tag_p(dep); | |
c2066e26 | 863 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
1da177e4 LT |
864 | /* |
865 | * Need to scan fix up the bestfree table. | |
866 | */ | |
867 | if (needscan) | |
9d23fc85 | 868 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
1da177e4 LT |
869 | /* |
870 | * Need to log the data block's header. | |
871 | */ | |
872 | if (needlog) | |
2ca98774 | 873 | xfs_dir2_data_log_header(tp, dp, dbp); |
9d23fc85 | 874 | xfs_dir2_data_log_entry(tp, dp, dbp, dep); |
1da177e4 LT |
875 | /* |
876 | * If the bests table needs to be changed, do it. | |
877 | * Log the change unless we've already done that. | |
878 | */ | |
33363fee DC |
879 | if (be16_to_cpu(bestsp[use_block]) != be16_to_cpu(bf[0].length)) { |
880 | bestsp[use_block] = bf[0].length; | |
1da177e4 | 881 | if (!grown) |
24df33b4 | 882 | xfs_dir3_leaf_log_bests(tp, lbp, use_block, use_block); |
1da177e4 | 883 | } |
4fb44c82 | 884 | |
24df33b4 | 885 | lep = xfs_dir3_leaf_find_entry(&leafhdr, ents, index, compact, lowstale, |
4fb44c82 CH |
886 | highstale, &lfloglow, &lfloghigh); |
887 | ||
1da177e4 LT |
888 | /* |
889 | * Fill in the new leaf entry. | |
890 | */ | |
3c1f9c15 | 891 | lep->hashval = cpu_to_be32(args->hashval); |
30028030 DC |
892 | lep->address = cpu_to_be32( |
893 | xfs_dir2_db_off_to_dataptr(args->geo, use_block, | |
3d693c6e | 894 | be16_to_cpu(*tagp))); |
1da177e4 LT |
895 | /* |
896 | * Log the leaf fields and give up the buffers. | |
897 | */ | |
01ba43b8 | 898 | dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); |
4141956a DC |
899 | xfs_dir3_leaf_log_header(tp, dp, lbp); |
900 | xfs_dir3_leaf_log_ents(tp, dp, lbp, lfloglow, lfloghigh); | |
901 | xfs_dir3_leaf_check(dp, lbp); | |
33363fee | 902 | xfs_dir3_data_check(dp, dbp); |
1da177e4 LT |
903 | return 0; |
904 | } | |
905 | ||
1da177e4 LT |
906 | /* |
907 | * Compact out any stale entries in the leaf. | |
908 | * Log the header and changed leaf entries, if any. | |
909 | */ | |
910 | void | |
24df33b4 | 911 | xfs_dir3_leaf_compact( |
1da177e4 | 912 | xfs_da_args_t *args, /* operation arguments */ |
24df33b4 | 913 | struct xfs_dir3_icleaf_hdr *leafhdr, |
1d9025e5 | 914 | struct xfs_buf *bp) /* leaf buffer */ |
1da177e4 LT |
915 | { |
916 | int from; /* source leaf index */ | |
917 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
918 | int loglow; /* first leaf entry to log */ | |
919 | int to; /* target leaf index */ | |
24df33b4 | 920 | struct xfs_dir2_leaf_entry *ents; |
01ba43b8 | 921 | struct xfs_inode *dp = args->dp; |
1da177e4 | 922 | |
1d9025e5 | 923 | leaf = bp->b_addr; |
24df33b4 | 924 | if (!leafhdr->stale) |
1da177e4 | 925 | return; |
24df33b4 | 926 | |
1da177e4 LT |
927 | /* |
928 | * Compress out the stale entries in place. | |
929 | */ | |
01ba43b8 | 930 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 DC |
931 | for (from = to = 0, loglow = -1; from < leafhdr->count; from++) { |
932 | if (ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) | |
1da177e4 LT |
933 | continue; |
934 | /* | |
935 | * Only actually copy the entries that are different. | |
936 | */ | |
937 | if (from > to) { | |
938 | if (loglow == -1) | |
939 | loglow = to; | |
24df33b4 | 940 | ents[to] = ents[from]; |
1da177e4 LT |
941 | } |
942 | to++; | |
943 | } | |
944 | /* | |
945 | * Update and log the header, log the leaf entries. | |
946 | */ | |
24df33b4 DC |
947 | ASSERT(leafhdr->stale == from - to); |
948 | leafhdr->count -= leafhdr->stale; | |
949 | leafhdr->stale = 0; | |
950 | ||
01ba43b8 DC |
951 | dp->d_ops->leaf_hdr_to_disk(leaf, leafhdr); |
952 | xfs_dir3_leaf_log_header(args->trans, dp, bp); | |
1da177e4 | 953 | if (loglow != -1) |
01ba43b8 | 954 | xfs_dir3_leaf_log_ents(args->trans, dp, bp, loglow, to - 1); |
1da177e4 LT |
955 | } |
956 | ||
957 | /* | |
958 | * Compact the leaf entries, removing stale ones. | |
959 | * Leave one stale entry behind - the one closest to our | |
960 | * insertion index - and the caller will shift that one to our insertion | |
961 | * point later. | |
962 | * Return new insertion index, where the remaining stale entry is, | |
963 | * and leaf logging indices. | |
964 | */ | |
965 | void | |
24df33b4 DC |
966 | xfs_dir3_leaf_compact_x1( |
967 | struct xfs_dir3_icleaf_hdr *leafhdr, | |
968 | struct xfs_dir2_leaf_entry *ents, | |
1da177e4 LT |
969 | int *indexp, /* insertion index */ |
970 | int *lowstalep, /* out: stale entry before us */ | |
971 | int *highstalep, /* out: stale entry after us */ | |
972 | int *lowlogp, /* out: low log index */ | |
973 | int *highlogp) /* out: high log index */ | |
974 | { | |
975 | int from; /* source copy index */ | |
976 | int highstale; /* stale entry at/after index */ | |
977 | int index; /* insertion index */ | |
978 | int keepstale; /* source index of kept stale */ | |
1da177e4 LT |
979 | int lowstale; /* stale entry before index */ |
980 | int newindex=0; /* new insertion index */ | |
981 | int to; /* destination copy index */ | |
982 | ||
24df33b4 | 983 | ASSERT(leafhdr->stale > 1); |
1da177e4 | 984 | index = *indexp; |
a230a1df | 985 | |
24df33b4 | 986 | xfs_dir3_leaf_find_stale(leafhdr, ents, index, &lowstale, &highstale); |
a230a1df | 987 | |
1da177e4 LT |
988 | /* |
989 | * Pick the better of lowstale and highstale. | |
990 | */ | |
991 | if (lowstale >= 0 && | |
24df33b4 | 992 | (highstale == leafhdr->count || |
1da177e4 LT |
993 | index - lowstale <= highstale - index)) |
994 | keepstale = lowstale; | |
995 | else | |
996 | keepstale = highstale; | |
997 | /* | |
998 | * Copy the entries in place, removing all the stale entries | |
999 | * except keepstale. | |
1000 | */ | |
24df33b4 | 1001 | for (from = to = 0; from < leafhdr->count; from++) { |
1da177e4 LT |
1002 | /* |
1003 | * Notice the new value of index. | |
1004 | */ | |
1005 | if (index == from) | |
1006 | newindex = to; | |
1007 | if (from != keepstale && | |
24df33b4 | 1008 | ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) { |
1da177e4 LT |
1009 | if (from == to) |
1010 | *lowlogp = to; | |
1011 | continue; | |
1012 | } | |
1013 | /* | |
1014 | * Record the new keepstale value for the insertion. | |
1015 | */ | |
1016 | if (from == keepstale) | |
1017 | lowstale = highstale = to; | |
1018 | /* | |
1019 | * Copy only the entries that have moved. | |
1020 | */ | |
1021 | if (from > to) | |
24df33b4 | 1022 | ents[to] = ents[from]; |
1da177e4 LT |
1023 | to++; |
1024 | } | |
1025 | ASSERT(from > to); | |
1026 | /* | |
1027 | * If the insertion point was past the last entry, | |
1028 | * set the new insertion point accordingly. | |
1029 | */ | |
1030 | if (index == from) | |
1031 | newindex = to; | |
1032 | *indexp = newindex; | |
1033 | /* | |
1034 | * Adjust the leaf header values. | |
1035 | */ | |
24df33b4 DC |
1036 | leafhdr->count -= from - to; |
1037 | leafhdr->stale = 1; | |
1da177e4 LT |
1038 | /* |
1039 | * Remember the low/high stale value only in the "right" | |
1040 | * direction. | |
1041 | */ | |
1042 | if (lowstale >= newindex) | |
1043 | lowstale = -1; | |
1044 | else | |
24df33b4 DC |
1045 | highstale = leafhdr->count; |
1046 | *highlogp = leafhdr->count - 1; | |
1da177e4 LT |
1047 | *lowstalep = lowstale; |
1048 | *highstalep = highstale; | |
1049 | } | |
1050 | ||
1da177e4 LT |
1051 | /* |
1052 | * Log the bests entries indicated from a leaf1 block. | |
1053 | */ | |
ba0f32d4 | 1054 | static void |
24df33b4 | 1055 | xfs_dir3_leaf_log_bests( |
1da177e4 | 1056 | xfs_trans_t *tp, /* transaction pointer */ |
1d9025e5 | 1057 | struct xfs_buf *bp, /* leaf buffer */ |
1da177e4 LT |
1058 | int first, /* first entry to log */ |
1059 | int last) /* last entry to log */ | |
1060 | { | |
68b3a102 NS |
1061 | __be16 *firstb; /* pointer to first entry */ |
1062 | __be16 *lastb; /* pointer to last entry */ | |
24df33b4 | 1063 | struct xfs_dir2_leaf *leaf = bp->b_addr; |
1da177e4 LT |
1064 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ |
1065 | ||
24df33b4 DC |
1066 | ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || |
1067 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC)); | |
1068 | ||
bbaaf538 CH |
1069 | ltp = xfs_dir2_leaf_tail_p(tp->t_mountp, leaf); |
1070 | firstb = xfs_dir2_leaf_bests_p(ltp) + first; | |
1071 | lastb = xfs_dir2_leaf_bests_p(ltp) + last; | |
1d9025e5 | 1072 | xfs_trans_log_buf(tp, bp, (uint)((char *)firstb - (char *)leaf), |
1da177e4 LT |
1073 | (uint)((char *)lastb - (char *)leaf + sizeof(*lastb) - 1)); |
1074 | } | |
1075 | ||
1076 | /* | |
1077 | * Log the leaf entries indicated from a leaf1 or leafn block. | |
1078 | */ | |
1079 | void | |
24df33b4 | 1080 | xfs_dir3_leaf_log_ents( |
4141956a DC |
1081 | struct xfs_trans *tp, |
1082 | struct xfs_inode *dp, | |
1083 | struct xfs_buf *bp, | |
1084 | int first, | |
1085 | int last) | |
1da177e4 LT |
1086 | { |
1087 | xfs_dir2_leaf_entry_t *firstlep; /* pointer to first entry */ | |
1088 | xfs_dir2_leaf_entry_t *lastlep; /* pointer to last entry */ | |
24df33b4 DC |
1089 | struct xfs_dir2_leaf *leaf = bp->b_addr; |
1090 | struct xfs_dir2_leaf_entry *ents; | |
1da177e4 | 1091 | |
69ef921b | 1092 | ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || |
24df33b4 DC |
1093 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) || |
1094 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || | |
1095 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)); | |
1096 | ||
4141956a | 1097 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 DC |
1098 | firstlep = &ents[first]; |
1099 | lastlep = &ents[last]; | |
1d9025e5 | 1100 | xfs_trans_log_buf(tp, bp, (uint)((char *)firstlep - (char *)leaf), |
1da177e4 LT |
1101 | (uint)((char *)lastlep - (char *)leaf + sizeof(*lastlep) - 1)); |
1102 | } | |
1103 | ||
1104 | /* | |
1105 | * Log the header of the leaf1 or leafn block. | |
1106 | */ | |
1107 | void | |
24df33b4 | 1108 | xfs_dir3_leaf_log_header( |
1d9025e5 | 1109 | struct xfs_trans *tp, |
4141956a | 1110 | struct xfs_inode *dp, |
1d9025e5 | 1111 | struct xfs_buf *bp) |
1da177e4 | 1112 | { |
24df33b4 | 1113 | struct xfs_dir2_leaf *leaf = bp->b_addr; |
1da177e4 | 1114 | |
69ef921b | 1115 | ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || |
24df33b4 DC |
1116 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) || |
1117 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || | |
1118 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)); | |
1119 | ||
1d9025e5 | 1120 | xfs_trans_log_buf(tp, bp, (uint)((char *)&leaf->hdr - (char *)leaf), |
1c9a5b2e | 1121 | dp->d_ops->leaf_hdr_size - 1); |
1da177e4 LT |
1122 | } |
1123 | ||
1124 | /* | |
1125 | * Log the tail of the leaf1 block. | |
1126 | */ | |
ba0f32d4 | 1127 | STATIC void |
24df33b4 | 1128 | xfs_dir3_leaf_log_tail( |
1d9025e5 DC |
1129 | struct xfs_trans *tp, |
1130 | struct xfs_buf *bp) | |
1da177e4 | 1131 | { |
24df33b4 | 1132 | struct xfs_dir2_leaf *leaf = bp->b_addr; |
1da177e4 | 1133 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ |
24df33b4 DC |
1134 | struct xfs_mount *mp = tp->t_mountp; |
1135 | ||
1136 | ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || | |
1137 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) || | |
1138 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || | |
1139 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)); | |
1da177e4 | 1140 | |
bbaaf538 | 1141 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
1d9025e5 | 1142 | xfs_trans_log_buf(tp, bp, (uint)((char *)ltp - (char *)leaf), |
1da177e4 LT |
1143 | (uint)(mp->m_dirblksize - 1)); |
1144 | } | |
1145 | ||
1146 | /* | |
1147 | * Look up the entry referred to by args in the leaf format directory. | |
1148 | * Most of the work is done by the xfs_dir2_leaf_lookup_int routine which | |
1149 | * is also used by the node-format code. | |
1150 | */ | |
1151 | int | |
1152 | xfs_dir2_leaf_lookup( | |
1153 | xfs_da_args_t *args) /* operation arguments */ | |
1154 | { | |
1d9025e5 | 1155 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1156 | xfs_dir2_data_entry_t *dep; /* data block entry */ |
1157 | xfs_inode_t *dp; /* incore directory inode */ | |
1158 | int error; /* error return code */ | |
1159 | int index; /* found entry index */ | |
1d9025e5 | 1160 | struct xfs_buf *lbp; /* leaf buffer */ |
1da177e4 LT |
1161 | xfs_dir2_leaf_t *leaf; /* leaf structure */ |
1162 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
1163 | xfs_trans_t *tp; /* transaction pointer */ | |
24df33b4 | 1164 | struct xfs_dir2_leaf_entry *ents; |
1da177e4 | 1165 | |
0b1b213f CH |
1166 | trace_xfs_dir2_leaf_lookup(args); |
1167 | ||
1da177e4 LT |
1168 | /* |
1169 | * Look up name in the leaf block, returning both buffers and index. | |
1170 | */ | |
1171 | if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) { | |
1172 | return error; | |
1173 | } | |
1174 | tp = args->trans; | |
1175 | dp = args->dp; | |
4141956a | 1176 | xfs_dir3_leaf_check(dp, lbp); |
1d9025e5 | 1177 | leaf = lbp->b_addr; |
4141956a | 1178 | ents = dp->d_ops->leaf_ents_p(leaf); |
1da177e4 LT |
1179 | /* |
1180 | * Get to the leaf entry and contained data entry address. | |
1181 | */ | |
24df33b4 DC |
1182 | lep = &ents[index]; |
1183 | ||
1da177e4 LT |
1184 | /* |
1185 | * Point to the data entry. | |
1186 | */ | |
1187 | dep = (xfs_dir2_data_entry_t *) | |
1d9025e5 | 1188 | ((char *)dbp->b_addr + |
30028030 | 1189 | xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address))); |
1da177e4 | 1190 | /* |
384f3ced | 1191 | * Return the found inode number & CI name if appropriate |
1da177e4 | 1192 | */ |
ff9901c1 | 1193 | args->inumber = be64_to_cpu(dep->inumber); |
9d23fc85 | 1194 | args->filetype = dp->d_ops->data_get_ftype(dep); |
384f3ced | 1195 | error = xfs_dir_cilookup_result(args, dep->name, dep->namelen); |
1d9025e5 DC |
1196 | xfs_trans_brelse(tp, dbp); |
1197 | xfs_trans_brelse(tp, lbp); | |
384f3ced | 1198 | return XFS_ERROR(error); |
1da177e4 LT |
1199 | } |
1200 | ||
1201 | /* | |
1202 | * Look up name/hash in the leaf block. | |
1203 | * Fill in indexp with the found index, and dbpp with the data buffer. | |
1204 | * If not found dbpp will be NULL, and ENOENT comes back. | |
1205 | * lbpp will always be filled in with the leaf buffer unless there's an error. | |
1206 | */ | |
1207 | static int /* error */ | |
1208 | xfs_dir2_leaf_lookup_int( | |
1209 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 1210 | struct xfs_buf **lbpp, /* out: leaf buffer */ |
1da177e4 | 1211 | int *indexp, /* out: index in leaf block */ |
1d9025e5 | 1212 | struct xfs_buf **dbpp) /* out: data buffer */ |
1da177e4 | 1213 | { |
07fe4dd4 | 1214 | xfs_dir2_db_t curdb = -1; /* current data block number */ |
1d9025e5 | 1215 | struct xfs_buf *dbp = NULL; /* data buffer */ |
1da177e4 LT |
1216 | xfs_dir2_data_entry_t *dep; /* data entry */ |
1217 | xfs_inode_t *dp; /* incore directory inode */ | |
1218 | int error; /* error return code */ | |
1219 | int index; /* index in leaf block */ | |
1d9025e5 | 1220 | struct xfs_buf *lbp; /* leaf buffer */ |
1da177e4 LT |
1221 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ |
1222 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
1223 | xfs_mount_t *mp; /* filesystem mount point */ | |
1224 | xfs_dir2_db_t newdb; /* new data block number */ | |
1225 | xfs_trans_t *tp; /* transaction pointer */ | |
07fe4dd4 | 1226 | xfs_dir2_db_t cidb = -1; /* case match data block no. */ |
5163f95a | 1227 | enum xfs_dacmp cmp; /* name compare result */ |
24df33b4 DC |
1228 | struct xfs_dir2_leaf_entry *ents; |
1229 | struct xfs_dir3_icleaf_hdr leafhdr; | |
1da177e4 LT |
1230 | |
1231 | dp = args->dp; | |
1232 | tp = args->trans; | |
1233 | mp = dp->i_mount; | |
e6f7667c | 1234 | |
7dda6e86 | 1235 | error = xfs_dir3_leaf_read(tp, dp, args->geo->leafblk, -1, &lbp); |
07fe4dd4 | 1236 | if (error) |
1da177e4 | 1237 | return error; |
e6f7667c | 1238 | |
1da177e4 | 1239 | *lbpp = lbp; |
1d9025e5 | 1240 | leaf = lbp->b_addr; |
4141956a DC |
1241 | xfs_dir3_leaf_check(dp, lbp); |
1242 | ents = dp->d_ops->leaf_ents_p(leaf); | |
01ba43b8 | 1243 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
24df33b4 | 1244 | |
1da177e4 LT |
1245 | /* |
1246 | * Look for the first leaf entry with our hash value. | |
1247 | */ | |
1248 | index = xfs_dir2_leaf_search_hash(args, lbp); | |
1249 | /* | |
1250 | * Loop over all the entries with the right hash value | |
1251 | * looking to match the name. | |
1252 | */ | |
24df33b4 DC |
1253 | for (lep = &ents[index]; |
1254 | index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; | |
1255 | lep++, index++) { | |
1da177e4 LT |
1256 | /* |
1257 | * Skip over stale leaf entries. | |
1258 | */ | |
3c1f9c15 | 1259 | if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR) |
1da177e4 LT |
1260 | continue; |
1261 | /* | |
1262 | * Get the new data block number. | |
1263 | */ | |
30028030 DC |
1264 | newdb = xfs_dir2_dataptr_to_db(args->geo, |
1265 | be32_to_cpu(lep->address)); | |
1da177e4 LT |
1266 | /* |
1267 | * If it's not the same as the old data block number, | |
1268 | * need to pitch the old one and read the new one. | |
1269 | */ | |
1270 | if (newdb != curdb) { | |
07fe4dd4 | 1271 | if (dbp) |
1d9025e5 | 1272 | xfs_trans_brelse(tp, dbp); |
33363fee | 1273 | error = xfs_dir3_data_read(tp, dp, |
2998ab1d DC |
1274 | xfs_dir2_db_to_da(args->geo, newdb), |
1275 | -1, &dbp); | |
5163f95a | 1276 | if (error) { |
1d9025e5 | 1277 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
1278 | return error; |
1279 | } | |
1da177e4 LT |
1280 | curdb = newdb; |
1281 | } | |
1282 | /* | |
1283 | * Point to the data entry. | |
1284 | */ | |
1d9025e5 | 1285 | dep = (xfs_dir2_data_entry_t *)((char *)dbp->b_addr + |
30028030 DC |
1286 | xfs_dir2_dataptr_to_off(args->geo, |
1287 | be32_to_cpu(lep->address))); | |
1da177e4 | 1288 | /* |
5163f95a BN |
1289 | * Compare name and if it's an exact match, return the index |
1290 | * and buffer. If it's the first case-insensitive match, store | |
1291 | * the index and buffer and continue looking for an exact match. | |
1da177e4 | 1292 | */ |
5163f95a BN |
1293 | cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen); |
1294 | if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) { | |
1295 | args->cmpresult = cmp; | |
1da177e4 | 1296 | *indexp = index; |
07fe4dd4 | 1297 | /* case exact match: return the current buffer. */ |
5163f95a | 1298 | if (cmp == XFS_CMP_EXACT) { |
5163f95a BN |
1299 | *dbpp = dbp; |
1300 | return 0; | |
1301 | } | |
07fe4dd4 | 1302 | cidb = curdb; |
1da177e4 LT |
1303 | } |
1304 | } | |
6a178100 | 1305 | ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); |
5163f95a | 1306 | /* |
07fe4dd4 BN |
1307 | * Here, we can only be doing a lookup (not a rename or remove). |
1308 | * If a case-insensitive match was found earlier, re-read the | |
1309 | * appropriate data block if required and return it. | |
5163f95a BN |
1310 | */ |
1311 | if (args->cmpresult == XFS_CMP_CASE) { | |
07fe4dd4 BN |
1312 | ASSERT(cidb != -1); |
1313 | if (cidb != curdb) { | |
1d9025e5 | 1314 | xfs_trans_brelse(tp, dbp); |
33363fee | 1315 | error = xfs_dir3_data_read(tp, dp, |
2998ab1d DC |
1316 | xfs_dir2_db_to_da(args->geo, cidb), |
1317 | -1, &dbp); | |
07fe4dd4 | 1318 | if (error) { |
1d9025e5 | 1319 | xfs_trans_brelse(tp, lbp); |
07fe4dd4 BN |
1320 | return error; |
1321 | } | |
1322 | } | |
1323 | *dbpp = dbp; | |
5163f95a BN |
1324 | return 0; |
1325 | } | |
1da177e4 LT |
1326 | /* |
1327 | * No match found, return ENOENT. | |
1328 | */ | |
07fe4dd4 | 1329 | ASSERT(cidb == -1); |
1da177e4 | 1330 | if (dbp) |
1d9025e5 DC |
1331 | xfs_trans_brelse(tp, dbp); |
1332 | xfs_trans_brelse(tp, lbp); | |
1da177e4 LT |
1333 | return XFS_ERROR(ENOENT); |
1334 | } | |
1335 | ||
1336 | /* | |
1337 | * Remove an entry from a leaf format directory. | |
1338 | */ | |
1339 | int /* error */ | |
1340 | xfs_dir2_leaf_removename( | |
1341 | xfs_da_args_t *args) /* operation arguments */ | |
1342 | { | |
68b3a102 | 1343 | __be16 *bestsp; /* leaf block best freespace */ |
c2066e26 | 1344 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 | 1345 | xfs_dir2_db_t db; /* data block number */ |
1d9025e5 | 1346 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1347 | xfs_dir2_data_entry_t *dep; /* data entry structure */ |
1348 | xfs_inode_t *dp; /* incore directory inode */ | |
1349 | int error; /* error return code */ | |
1350 | xfs_dir2_db_t i; /* temporary data block # */ | |
1351 | int index; /* index into leaf entries */ | |
1d9025e5 | 1352 | struct xfs_buf *lbp; /* leaf buffer */ |
1da177e4 LT |
1353 | xfs_dir2_leaf_t *leaf; /* leaf structure */ |
1354 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
1355 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ | |
1356 | xfs_mount_t *mp; /* filesystem mount point */ | |
1357 | int needlog; /* need to log data header */ | |
1358 | int needscan; /* need to rescan data frees */ | |
1359 | xfs_dir2_data_off_t oldbest; /* old value of best free */ | |
1360 | xfs_trans_t *tp; /* transaction pointer */ | |
33363fee | 1361 | struct xfs_dir2_data_free *bf; /* bestfree table */ |
24df33b4 DC |
1362 | struct xfs_dir2_leaf_entry *ents; |
1363 | struct xfs_dir3_icleaf_hdr leafhdr; | |
1da177e4 | 1364 | |
0b1b213f CH |
1365 | trace_xfs_dir2_leaf_removename(args); |
1366 | ||
1da177e4 LT |
1367 | /* |
1368 | * Lookup the leaf entry, get the leaf and data blocks read in. | |
1369 | */ | |
1370 | if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) { | |
1371 | return error; | |
1372 | } | |
1373 | dp = args->dp; | |
1374 | tp = args->trans; | |
1375 | mp = dp->i_mount; | |
1d9025e5 DC |
1376 | leaf = lbp->b_addr; |
1377 | hdr = dbp->b_addr; | |
33363fee | 1378 | xfs_dir3_data_check(dp, dbp); |
2ca98774 | 1379 | bf = dp->d_ops->data_bestfree_p(hdr); |
01ba43b8 | 1380 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
4141956a | 1381 | ents = dp->d_ops->leaf_ents_p(leaf); |
1da177e4 LT |
1382 | /* |
1383 | * Point to the leaf entry, use that to point to the data entry. | |
1384 | */ | |
24df33b4 | 1385 | lep = &ents[index]; |
30028030 DC |
1386 | db = xfs_dir2_dataptr_to_db(args->geo, be32_to_cpu(lep->address)); |
1387 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + | |
1388 | xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address))); | |
1da177e4 | 1389 | needscan = needlog = 0; |
33363fee | 1390 | oldbest = be16_to_cpu(bf[0].length); |
bbaaf538 CH |
1391 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
1392 | bestsp = xfs_dir2_leaf_bests_p(ltp); | |
68b3a102 | 1393 | ASSERT(be16_to_cpu(bestsp[db]) == oldbest); |
1da177e4 LT |
1394 | /* |
1395 | * Mark the former data entry unused. | |
1396 | */ | |
2ca98774 | 1397 | xfs_dir2_data_make_free(tp, dp, dbp, |
c2066e26 | 1398 | (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr), |
9d23fc85 | 1399 | dp->d_ops->data_entsize(dep->namelen), &needlog, &needscan); |
1da177e4 LT |
1400 | /* |
1401 | * We just mark the leaf entry stale by putting a null in it. | |
1402 | */ | |
24df33b4 | 1403 | leafhdr.stale++; |
01ba43b8 | 1404 | dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); |
4141956a | 1405 | xfs_dir3_leaf_log_header(tp, dp, lbp); |
24df33b4 | 1406 | |
3c1f9c15 | 1407 | lep->address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); |
4141956a | 1408 | xfs_dir3_leaf_log_ents(tp, dp, lbp, index, index); |
24df33b4 | 1409 | |
1da177e4 LT |
1410 | /* |
1411 | * Scan the freespace in the data block again if necessary, | |
1412 | * log the data block header if necessary. | |
1413 | */ | |
1414 | if (needscan) | |
9d23fc85 | 1415 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
1da177e4 | 1416 | if (needlog) |
2ca98774 | 1417 | xfs_dir2_data_log_header(tp, dp, dbp); |
1da177e4 LT |
1418 | /* |
1419 | * If the longest freespace in the data block has changed, | |
1420 | * put the new value in the bests table and log that. | |
1421 | */ | |
33363fee DC |
1422 | if (be16_to_cpu(bf[0].length) != oldbest) { |
1423 | bestsp[db] = bf[0].length; | |
24df33b4 | 1424 | xfs_dir3_leaf_log_bests(tp, lbp, db, db); |
1da177e4 | 1425 | } |
33363fee | 1426 | xfs_dir3_data_check(dp, dbp); |
1da177e4 LT |
1427 | /* |
1428 | * If the data block is now empty then get rid of the data block. | |
1429 | */ | |
33363fee | 1430 | if (be16_to_cpu(bf[0].length) == |
1c9a5b2e | 1431 | mp->m_dirblksize - dp->d_ops->data_entry_offset) { |
7dda6e86 | 1432 | ASSERT(db != args->geo->datablk); |
1da177e4 LT |
1433 | if ((error = xfs_dir2_shrink_inode(args, db, dbp))) { |
1434 | /* | |
1435 | * Nope, can't get rid of it because it caused | |
1436 | * allocation of a bmap btree block to do so. | |
1437 | * Just go on, returning success, leaving the | |
1438 | * empty block in place. | |
1439 | */ | |
1d9025e5 | 1440 | if (error == ENOSPC && args->total == 0) |
1da177e4 | 1441 | error = 0; |
4141956a | 1442 | xfs_dir3_leaf_check(dp, lbp); |
1da177e4 LT |
1443 | return error; |
1444 | } | |
1445 | dbp = NULL; | |
1446 | /* | |
1447 | * If this is the last data block then compact the | |
1448 | * bests table by getting rid of entries. | |
1449 | */ | |
afbcb3f9 | 1450 | if (db == be32_to_cpu(ltp->bestcount) - 1) { |
1da177e4 LT |
1451 | /* |
1452 | * Look for the last active entry (i). | |
1453 | */ | |
1454 | for (i = db - 1; i > 0; i--) { | |
69ef921b | 1455 | if (bestsp[i] != cpu_to_be16(NULLDATAOFF)) |
1da177e4 LT |
1456 | break; |
1457 | } | |
1458 | /* | |
1459 | * Copy the table down so inactive entries at the | |
1460 | * end are removed. | |
1461 | */ | |
1462 | memmove(&bestsp[db - i], bestsp, | |
afbcb3f9 | 1463 | (be32_to_cpu(ltp->bestcount) - (db - i)) * sizeof(*bestsp)); |
413d57c9 | 1464 | be32_add_cpu(<p->bestcount, -(db - i)); |
24df33b4 DC |
1465 | xfs_dir3_leaf_log_tail(tp, lbp); |
1466 | xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); | |
1da177e4 | 1467 | } else |
68b3a102 | 1468 | bestsp[db] = cpu_to_be16(NULLDATAOFF); |
1da177e4 LT |
1469 | } |
1470 | /* | |
1471 | * If the data block was not the first one, drop it. | |
1472 | */ | |
7dda6e86 | 1473 | else if (db != args->geo->datablk) |
1da177e4 | 1474 | dbp = NULL; |
1d9025e5 | 1475 | |
4141956a | 1476 | xfs_dir3_leaf_check(dp, lbp); |
1da177e4 LT |
1477 | /* |
1478 | * See if we can convert to block form. | |
1479 | */ | |
1480 | return xfs_dir2_leaf_to_block(args, lbp, dbp); | |
1481 | } | |
1482 | ||
1483 | /* | |
1484 | * Replace the inode number in a leaf format directory entry. | |
1485 | */ | |
1486 | int /* error */ | |
1487 | xfs_dir2_leaf_replace( | |
1488 | xfs_da_args_t *args) /* operation arguments */ | |
1489 | { | |
1d9025e5 | 1490 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1491 | xfs_dir2_data_entry_t *dep; /* data block entry */ |
1492 | xfs_inode_t *dp; /* incore directory inode */ | |
1493 | int error; /* error return code */ | |
1494 | int index; /* index of leaf entry */ | |
1d9025e5 | 1495 | struct xfs_buf *lbp; /* leaf buffer */ |
1da177e4 LT |
1496 | xfs_dir2_leaf_t *leaf; /* leaf structure */ |
1497 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
1498 | xfs_trans_t *tp; /* transaction pointer */ | |
24df33b4 | 1499 | struct xfs_dir2_leaf_entry *ents; |
1da177e4 | 1500 | |
0b1b213f CH |
1501 | trace_xfs_dir2_leaf_replace(args); |
1502 | ||
1da177e4 LT |
1503 | /* |
1504 | * Look up the entry. | |
1505 | */ | |
1506 | if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) { | |
1507 | return error; | |
1508 | } | |
1509 | dp = args->dp; | |
1d9025e5 | 1510 | leaf = lbp->b_addr; |
4141956a | 1511 | ents = dp->d_ops->leaf_ents_p(leaf); |
1da177e4 LT |
1512 | /* |
1513 | * Point to the leaf entry, get data address from it. | |
1514 | */ | |
24df33b4 | 1515 | lep = &ents[index]; |
1da177e4 LT |
1516 | /* |
1517 | * Point to the data entry. | |
1518 | */ | |
1519 | dep = (xfs_dir2_data_entry_t *) | |
1d9025e5 | 1520 | ((char *)dbp->b_addr + |
30028030 | 1521 | xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address))); |
ff9901c1 | 1522 | ASSERT(args->inumber != be64_to_cpu(dep->inumber)); |
1da177e4 LT |
1523 | /* |
1524 | * Put the new inode number in, log it. | |
1525 | */ | |
ff9901c1 | 1526 | dep->inumber = cpu_to_be64(args->inumber); |
9d23fc85 | 1527 | dp->d_ops->data_put_ftype(dep, args->filetype); |
1da177e4 | 1528 | tp = args->trans; |
9d23fc85 | 1529 | xfs_dir2_data_log_entry(tp, dp, dbp, dep); |
4141956a | 1530 | xfs_dir3_leaf_check(dp, lbp); |
1d9025e5 | 1531 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
1532 | return 0; |
1533 | } | |
1534 | ||
1535 | /* | |
1536 | * Return index in the leaf block (lbp) which is either the first | |
1537 | * one with this hash value, or if there are none, the insert point | |
1538 | * for that hash value. | |
1539 | */ | |
1540 | int /* index value */ | |
1541 | xfs_dir2_leaf_search_hash( | |
1542 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 1543 | struct xfs_buf *lbp) /* leaf buffer */ |
1da177e4 LT |
1544 | { |
1545 | xfs_dahash_t hash=0; /* hash from this entry */ | |
1546 | xfs_dahash_t hashwant; /* hash value looking for */ | |
1547 | int high; /* high leaf index */ | |
1548 | int low; /* low leaf index */ | |
1549 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
1550 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
1551 | int mid=0; /* current leaf index */ | |
24df33b4 DC |
1552 | struct xfs_dir2_leaf_entry *ents; |
1553 | struct xfs_dir3_icleaf_hdr leafhdr; | |
1da177e4 | 1554 | |
1d9025e5 | 1555 | leaf = lbp->b_addr; |
4141956a | 1556 | ents = args->dp->d_ops->leaf_ents_p(leaf); |
01ba43b8 | 1557 | args->dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
24df33b4 | 1558 | |
1da177e4 LT |
1559 | /* |
1560 | * Note, the table cannot be empty, so we have to go through the loop. | |
1561 | * Binary search the leaf entries looking for our hash value. | |
1562 | */ | |
24df33b4 | 1563 | for (lep = ents, low = 0, high = leafhdr.count - 1, |
1da177e4 LT |
1564 | hashwant = args->hashval; |
1565 | low <= high; ) { | |
1566 | mid = (low + high) >> 1; | |
3c1f9c15 | 1567 | if ((hash = be32_to_cpu(lep[mid].hashval)) == hashwant) |
1da177e4 LT |
1568 | break; |
1569 | if (hash < hashwant) | |
1570 | low = mid + 1; | |
1571 | else | |
1572 | high = mid - 1; | |
1573 | } | |
1574 | /* | |
1575 | * Found one, back up through all the equal hash values. | |
1576 | */ | |
1577 | if (hash == hashwant) { | |
3c1f9c15 | 1578 | while (mid > 0 && be32_to_cpu(lep[mid - 1].hashval) == hashwant) { |
1da177e4 LT |
1579 | mid--; |
1580 | } | |
1581 | } | |
1582 | /* | |
1583 | * Need to point to an entry higher than ours. | |
1584 | */ | |
1585 | else if (hash < hashwant) | |
1586 | mid++; | |
1587 | return mid; | |
1588 | } | |
1589 | ||
1590 | /* | |
1591 | * Trim off a trailing data block. We know it's empty since the leaf | |
1592 | * freespace table says so. | |
1593 | */ | |
1594 | int /* error */ | |
1595 | xfs_dir2_leaf_trim_data( | |
1596 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 1597 | struct xfs_buf *lbp, /* leaf buffer */ |
1da177e4 LT |
1598 | xfs_dir2_db_t db) /* data block number */ |
1599 | { | |
68b3a102 | 1600 | __be16 *bestsp; /* leaf bests table */ |
1d9025e5 | 1601 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1602 | xfs_inode_t *dp; /* incore directory inode */ |
1603 | int error; /* error return value */ | |
1604 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
1605 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ | |
1606 | xfs_mount_t *mp; /* filesystem mount point */ | |
1607 | xfs_trans_t *tp; /* transaction pointer */ | |
1608 | ||
1609 | dp = args->dp; | |
1610 | mp = dp->i_mount; | |
1611 | tp = args->trans; | |
1612 | /* | |
1613 | * Read the offending data block. We need its buffer. | |
1614 | */ | |
2998ab1d DC |
1615 | error = xfs_dir3_data_read(tp, dp, xfs_dir2_db_to_da(args->geo, db), |
1616 | -1, &dbp); | |
4bb20a83 | 1617 | if (error) |
1da177e4 | 1618 | return error; |
1da177e4 | 1619 | |
1d9025e5 | 1620 | leaf = lbp->b_addr; |
bbaaf538 | 1621 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
c2066e26 CH |
1622 | |
1623 | #ifdef DEBUG | |
1624 | { | |
1d9025e5 | 1625 | struct xfs_dir2_data_hdr *hdr = dbp->b_addr; |
2ca98774 | 1626 | struct xfs_dir2_data_free *bf = dp->d_ops->data_bestfree_p(hdr); |
c2066e26 | 1627 | |
33363fee DC |
1628 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
1629 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)); | |
1630 | ASSERT(be16_to_cpu(bf[0].length) == | |
1c9a5b2e | 1631 | mp->m_dirblksize - dp->d_ops->data_entry_offset); |
afbcb3f9 | 1632 | ASSERT(db == be32_to_cpu(ltp->bestcount) - 1); |
c2066e26 CH |
1633 | } |
1634 | #endif | |
1635 | ||
1da177e4 LT |
1636 | /* |
1637 | * Get rid of the data block. | |
1638 | */ | |
1639 | if ((error = xfs_dir2_shrink_inode(args, db, dbp))) { | |
1640 | ASSERT(error != ENOSPC); | |
1d9025e5 | 1641 | xfs_trans_brelse(tp, dbp); |
1da177e4 LT |
1642 | return error; |
1643 | } | |
1644 | /* | |
1645 | * Eliminate the last bests entry from the table. | |
1646 | */ | |
bbaaf538 | 1647 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
413d57c9 | 1648 | be32_add_cpu(<p->bestcount, -1); |
afbcb3f9 | 1649 | memmove(&bestsp[1], &bestsp[0], be32_to_cpu(ltp->bestcount) * sizeof(*bestsp)); |
24df33b4 DC |
1650 | xfs_dir3_leaf_log_tail(tp, lbp); |
1651 | xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); | |
1da177e4 LT |
1652 | return 0; |
1653 | } | |
1654 | ||
2282396d | 1655 | static inline size_t |
24df33b4 DC |
1656 | xfs_dir3_leaf_size( |
1657 | struct xfs_dir3_icleaf_hdr *hdr, | |
2282396d CH |
1658 | int counts) |
1659 | { | |
24df33b4 DC |
1660 | int entries; |
1661 | int hdrsize; | |
1662 | ||
1663 | entries = hdr->count - hdr->stale; | |
1664 | if (hdr->magic == XFS_DIR2_LEAF1_MAGIC || | |
1665 | hdr->magic == XFS_DIR2_LEAFN_MAGIC) | |
1666 | hdrsize = sizeof(struct xfs_dir2_leaf_hdr); | |
1667 | else | |
1668 | hdrsize = sizeof(struct xfs_dir3_leaf_hdr); | |
2282396d | 1669 | |
24df33b4 DC |
1670 | return hdrsize + entries * sizeof(xfs_dir2_leaf_entry_t) |
1671 | + counts * sizeof(xfs_dir2_data_off_t) | |
1672 | + sizeof(xfs_dir2_leaf_tail_t); | |
2282396d CH |
1673 | } |
1674 | ||
1da177e4 LT |
1675 | /* |
1676 | * Convert node form directory to leaf form directory. | |
1677 | * The root of the node form dir needs to already be a LEAFN block. | |
1678 | * Just return if we can't do anything. | |
1679 | */ | |
1680 | int /* error */ | |
1681 | xfs_dir2_node_to_leaf( | |
1682 | xfs_da_state_t *state) /* directory operation state */ | |
1683 | { | |
1684 | xfs_da_args_t *args; /* operation arguments */ | |
1685 | xfs_inode_t *dp; /* incore directory inode */ | |
1686 | int error; /* error return code */ | |
1d9025e5 | 1687 | struct xfs_buf *fbp; /* buffer for freespace block */ |
1da177e4 LT |
1688 | xfs_fileoff_t fo; /* freespace file offset */ |
1689 | xfs_dir2_free_t *free; /* freespace structure */ | |
1d9025e5 | 1690 | struct xfs_buf *lbp; /* buffer for leaf block */ |
1da177e4 LT |
1691 | xfs_dir2_leaf_tail_t *ltp; /* tail of leaf structure */ |
1692 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
1693 | xfs_mount_t *mp; /* filesystem mount point */ | |
1694 | int rval; /* successful free trim? */ | |
1695 | xfs_trans_t *tp; /* transaction pointer */ | |
24df33b4 | 1696 | struct xfs_dir3_icleaf_hdr leafhdr; |
cbc8adf8 | 1697 | struct xfs_dir3_icfree_hdr freehdr; |
1da177e4 LT |
1698 | |
1699 | /* | |
1700 | * There's more than a leaf level in the btree, so there must | |
1701 | * be multiple leafn blocks. Give up. | |
1702 | */ | |
1703 | if (state->path.active > 1) | |
1704 | return 0; | |
1705 | args = state->args; | |
0b1b213f CH |
1706 | |
1707 | trace_xfs_dir2_node_to_leaf(args); | |
1708 | ||
1da177e4 LT |
1709 | mp = state->mp; |
1710 | dp = args->dp; | |
1711 | tp = args->trans; | |
1712 | /* | |
1713 | * Get the last offset in the file. | |
1714 | */ | |
7fb2cd4d | 1715 | if ((error = xfs_bmap_last_offset(dp, &fo, XFS_DATA_FORK))) { |
1da177e4 LT |
1716 | return error; |
1717 | } | |
d6cf1305 | 1718 | fo -= args->geo->fsbcount; |
1da177e4 LT |
1719 | /* |
1720 | * If there are freespace blocks other than the first one, | |
1721 | * take this opportunity to remove trailing empty freespace blocks | |
1722 | * that may have been left behind during no-space-reservation | |
1723 | * operations. | |
1724 | */ | |
7dda6e86 | 1725 | while (fo > args->geo->freeblk) { |
1da177e4 LT |
1726 | if ((error = xfs_dir2_node_trim_free(args, fo, &rval))) { |
1727 | return error; | |
1728 | } | |
1729 | if (rval) | |
d6cf1305 | 1730 | fo -= args->geo->fsbcount; |
1da177e4 LT |
1731 | else |
1732 | return 0; | |
1733 | } | |
1734 | /* | |
1735 | * Now find the block just before the freespace block. | |
1736 | */ | |
1737 | if ((error = xfs_bmap_last_before(tp, dp, &fo, XFS_DATA_FORK))) { | |
1738 | return error; | |
1739 | } | |
1740 | /* | |
1741 | * If it's not the single leaf block, give up. | |
1742 | */ | |
1743 | if (XFS_FSB_TO_B(mp, fo) > XFS_DIR2_LEAF_OFFSET + mp->m_dirblksize) | |
1744 | return 0; | |
1745 | lbp = state->path.blk[0].bp; | |
1d9025e5 | 1746 | leaf = lbp->b_addr; |
01ba43b8 | 1747 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
24df33b4 DC |
1748 | |
1749 | ASSERT(leafhdr.magic == XFS_DIR2_LEAFN_MAGIC || | |
1750 | leafhdr.magic == XFS_DIR3_LEAFN_MAGIC); | |
1751 | ||
1da177e4 LT |
1752 | /* |
1753 | * Read the freespace block. | |
1754 | */ | |
7dda6e86 | 1755 | error = xfs_dir2_free_read(tp, dp, args->geo->freeblk, &fbp); |
4bb20a83 | 1756 | if (error) |
1da177e4 | 1757 | return error; |
1d9025e5 | 1758 | free = fbp->b_addr; |
01ba43b8 | 1759 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
cbc8adf8 DC |
1760 | |
1761 | ASSERT(!freehdr.firstdb); | |
2282396d | 1762 | |
1da177e4 LT |
1763 | /* |
1764 | * Now see if the leafn and free data will fit in a leaf1. | |
1765 | * If not, release the buffer and give up. | |
1766 | */ | |
24df33b4 | 1767 | if (xfs_dir3_leaf_size(&leafhdr, freehdr.nvalid) > mp->m_dirblksize) { |
1d9025e5 | 1768 | xfs_trans_brelse(tp, fbp); |
1da177e4 LT |
1769 | return 0; |
1770 | } | |
2282396d | 1771 | |
1da177e4 LT |
1772 | /* |
1773 | * If the leaf has any stale entries in it, compress them out. | |
1da177e4 | 1774 | */ |
24df33b4 DC |
1775 | if (leafhdr.stale) |
1776 | xfs_dir3_leaf_compact(args, &leafhdr, lbp); | |
b0f539de | 1777 | |
24df33b4 | 1778 | lbp->b_ops = &xfs_dir3_leaf1_buf_ops; |
61fe135c | 1779 | xfs_trans_buf_set_type(tp, lbp, XFS_BLFT_DIR_LEAF1_BUF); |
24df33b4 DC |
1780 | leafhdr.magic = (leafhdr.magic == XFS_DIR2_LEAFN_MAGIC) |
1781 | ? XFS_DIR2_LEAF1_MAGIC | |
1782 | : XFS_DIR3_LEAF1_MAGIC; | |
b0f539de | 1783 | |
1da177e4 LT |
1784 | /* |
1785 | * Set up the leaf tail from the freespace block. | |
1786 | */ | |
bbaaf538 | 1787 | ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
cbc8adf8 | 1788 | ltp->bestcount = cpu_to_be32(freehdr.nvalid); |
24df33b4 | 1789 | |
1da177e4 LT |
1790 | /* |
1791 | * Set up the leaf bests table. | |
1792 | */ | |
24dd0f54 | 1793 | memcpy(xfs_dir2_leaf_bests_p(ltp), dp->d_ops->free_bests_p(free), |
cbc8adf8 | 1794 | freehdr.nvalid * sizeof(xfs_dir2_data_off_t)); |
24df33b4 | 1795 | |
01ba43b8 | 1796 | dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); |
4141956a | 1797 | xfs_dir3_leaf_log_header(tp, dp, lbp); |
24df33b4 DC |
1798 | xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); |
1799 | xfs_dir3_leaf_log_tail(tp, lbp); | |
4141956a | 1800 | xfs_dir3_leaf_check(dp, lbp); |
24df33b4 | 1801 | |
1da177e4 LT |
1802 | /* |
1803 | * Get rid of the freespace block. | |
1804 | */ | |
8c44a285 | 1805 | error = xfs_dir2_shrink_inode(args, |
30028030 DC |
1806 | xfs_dir2_byte_to_db(args->geo, XFS_DIR2_FREE_OFFSET), |
1807 | fbp); | |
1da177e4 LT |
1808 | if (error) { |
1809 | /* | |
1810 | * This can't fail here because it can only happen when | |
1811 | * punching out the middle of an extent, and this is an | |
1812 | * isolated block. | |
1813 | */ | |
1814 | ASSERT(error != ENOSPC); | |
1815 | return error; | |
1816 | } | |
1817 | fbp = NULL; | |
1818 | /* | |
1819 | * Now see if we can convert the single-leaf directory | |
1820 | * down to a block form directory. | |
1821 | * This routine always kills the dabuf for the leaf, so | |
1822 | * eliminate it from the path. | |
1823 | */ | |
1824 | error = xfs_dir2_leaf_to_block(args, lbp, NULL); | |
1825 | state->path.blk[0].bp = NULL; | |
1826 | return error; | |
1827 | } |