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