]>
Commit | Line | Data |
---|---|---|
0b61f8a4 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 | 2 | /* |
7b718769 | 3 | * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc. |
24df33b4 | 4 | * Copyright (c) 2013 Red Hat, Inc. |
7b718769 | 5 | * All Rights Reserved. |
1da177e4 | 6 | */ |
1da177e4 | 7 | #include "xfs.h" |
a844f451 | 8 | #include "xfs_fs.h" |
5467b34b | 9 | #include "xfs_shared.h" |
a4fbe6ab | 10 | #include "xfs_format.h" |
239880ef DC |
11 | #include "xfs_log_format.h" |
12 | #include "xfs_trans_resv.h" | |
1da177e4 | 13 | #include "xfs_mount.h" |
1da177e4 LT |
14 | #include "xfs_inode.h" |
15 | #include "xfs_bmap.h" | |
2b9ab5ab | 16 | #include "xfs_dir2.h" |
57926640 | 17 | #include "xfs_dir2_priv.h" |
1da177e4 | 18 | #include "xfs_error.h" |
0b1b213f | 19 | #include "xfs_trace.h" |
239880ef | 20 | #include "xfs_trans.h" |
24df33b4 | 21 | #include "xfs_buf_item.h" |
1da177e4 LT |
22 | |
23 | /* | |
24 | * Local function declarations. | |
25 | */ | |
1d9025e5 | 26 | static int xfs_dir2_leaf_lookup_int(xfs_da_args_t *args, struct xfs_buf **lbpp, |
787b0893 CH |
27 | int *indexp, struct xfs_buf **dbpp, |
28 | struct xfs_dir3_icleaf_hdr *leafhdr); | |
bc85178a DC |
29 | static void xfs_dir3_leaf_log_bests(struct xfs_da_args *args, |
30 | struct xfs_buf *bp, int first, int last); | |
31 | static void xfs_dir3_leaf_log_tail(struct xfs_da_args *args, | |
32 | struct xfs_buf *bp); | |
ba0f32d4 | 33 | |
51842556 CH |
34 | void |
35 | xfs_dir2_leaf_hdr_from_disk( | |
36 | struct xfs_mount *mp, | |
37 | struct xfs_dir3_icleaf_hdr *to, | |
38 | struct xfs_dir2_leaf *from) | |
39 | { | |
ebd9027d | 40 | if (xfs_has_crc(mp)) { |
51842556 CH |
41 | struct xfs_dir3_leaf *from3 = (struct xfs_dir3_leaf *)from; |
42 | ||
43 | to->forw = be32_to_cpu(from3->hdr.info.hdr.forw); | |
44 | to->back = be32_to_cpu(from3->hdr.info.hdr.back); | |
45 | to->magic = be16_to_cpu(from3->hdr.info.hdr.magic); | |
46 | to->count = be16_to_cpu(from3->hdr.count); | |
47 | to->stale = be16_to_cpu(from3->hdr.stale); | |
787b0893 | 48 | to->ents = from3->__ents; |
51842556 CH |
49 | |
50 | ASSERT(to->magic == XFS_DIR3_LEAF1_MAGIC || | |
51 | to->magic == XFS_DIR3_LEAFN_MAGIC); | |
52 | } else { | |
53 | to->forw = be32_to_cpu(from->hdr.info.forw); | |
54 | to->back = be32_to_cpu(from->hdr.info.back); | |
55 | to->magic = be16_to_cpu(from->hdr.info.magic); | |
56 | to->count = be16_to_cpu(from->hdr.count); | |
57 | to->stale = be16_to_cpu(from->hdr.stale); | |
787b0893 | 58 | to->ents = from->__ents; |
51842556 CH |
59 | |
60 | ASSERT(to->magic == XFS_DIR2_LEAF1_MAGIC || | |
61 | to->magic == XFS_DIR2_LEAFN_MAGIC); | |
62 | } | |
63 | } | |
64 | ||
163fbbb3 CH |
65 | void |
66 | xfs_dir2_leaf_hdr_to_disk( | |
67 | struct xfs_mount *mp, | |
68 | struct xfs_dir2_leaf *to, | |
69 | struct xfs_dir3_icleaf_hdr *from) | |
70 | { | |
ebd9027d | 71 | if (xfs_has_crc(mp)) { |
163fbbb3 CH |
72 | struct xfs_dir3_leaf *to3 = (struct xfs_dir3_leaf *)to; |
73 | ||
74 | ASSERT(from->magic == XFS_DIR3_LEAF1_MAGIC || | |
75 | from->magic == XFS_DIR3_LEAFN_MAGIC); | |
76 | ||
77 | to3->hdr.info.hdr.forw = cpu_to_be32(from->forw); | |
78 | to3->hdr.info.hdr.back = cpu_to_be32(from->back); | |
79 | to3->hdr.info.hdr.magic = cpu_to_be16(from->magic); | |
80 | to3->hdr.count = cpu_to_be16(from->count); | |
81 | to3->hdr.stale = cpu_to_be16(from->stale); | |
82 | } else { | |
83 | ASSERT(from->magic == XFS_DIR2_LEAF1_MAGIC || | |
84 | from->magic == XFS_DIR2_LEAFN_MAGIC); | |
85 | ||
86 | to->hdr.info.forw = cpu_to_be32(from->forw); | |
87 | to->hdr.info.back = cpu_to_be32(from->back); | |
88 | to->hdr.info.magic = cpu_to_be16(from->magic); | |
89 | to->hdr.count = cpu_to_be16(from->count); | |
90 | to->hdr.stale = cpu_to_be16(from->stale); | |
91 | } | |
92 | } | |
93 | ||
24df33b4 DC |
94 | /* |
95 | * Check the internal consistency of a leaf1 block. | |
96 | * Pop an assert if something is wrong. | |
97 | */ | |
98 | #ifdef DEBUG | |
a6a781a5 | 99 | static xfs_failaddr_t |
24df33b4 | 100 | xfs_dir3_leaf1_check( |
4141956a | 101 | struct xfs_inode *dp, |
24df33b4 DC |
102 | struct xfs_buf *bp) |
103 | { | |
104 | struct xfs_dir2_leaf *leaf = bp->b_addr; | |
105 | struct xfs_dir3_icleaf_hdr leafhdr; | |
106 | ||
51842556 | 107 | xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); |
24df33b4 DC |
108 | |
109 | if (leafhdr.magic == XFS_DIR3_LEAF1_MAGIC) { | |
110 | struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; | |
9343ee76 | 111 | if (be64_to_cpu(leaf3->info.blkno) != xfs_buf_daddr(bp)) |
a6a781a5 | 112 | return __this_address; |
24df33b4 | 113 | } else if (leafhdr.magic != XFS_DIR2_LEAF1_MAGIC) |
a6a781a5 | 114 | return __this_address; |
24df33b4 | 115 | |
1fea323f | 116 | return xfs_dir3_leaf_check_int(dp->i_mount, &leafhdr, leaf, false); |
24df33b4 | 117 | } |
a6a781a5 DW |
118 | |
119 | static inline void | |
120 | xfs_dir3_leaf_check( | |
121 | struct xfs_inode *dp, | |
122 | struct xfs_buf *bp) | |
123 | { | |
124 | xfs_failaddr_t fa; | |
125 | ||
126 | fa = xfs_dir3_leaf1_check(dp, bp); | |
127 | if (!fa) | |
128 | return; | |
129 | xfs_corruption_error(__func__, XFS_ERRLEVEL_LOW, dp->i_mount, | |
2551a530 DW |
130 | bp->b_addr, BBTOB(bp->b_length), __FILE__, __LINE__, |
131 | fa); | |
a6a781a5 DW |
132 | ASSERT(0); |
133 | } | |
24df33b4 | 134 | #else |
4141956a | 135 | #define xfs_dir3_leaf_check(dp, bp) |
24df33b4 DC |
136 | #endif |
137 | ||
a6a781a5 | 138 | xfs_failaddr_t |
24df33b4 | 139 | xfs_dir3_leaf_check_int( |
23220fe2 CH |
140 | struct xfs_mount *mp, |
141 | struct xfs_dir3_icleaf_hdr *hdr, | |
1fea323f DC |
142 | struct xfs_dir2_leaf *leaf, |
143 | bool expensive_checking) | |
24df33b4 | 144 | { |
23220fe2 CH |
145 | struct xfs_da_geometry *geo = mp->m_dir_geo; |
146 | xfs_dir2_leaf_tail_t *ltp; | |
147 | int stale; | |
148 | int i; | |
01ba43b8 | 149 | |
8f66193c | 150 | ltp = xfs_dir2_leaf_tail_p(geo, leaf); |
24df33b4 DC |
151 | |
152 | /* | |
153 | * XXX (dgc): This value is not restrictive enough. | |
154 | * Should factor in the size of the bests table as well. | |
13d2c10b | 155 | * We can deduce a value for that from i_disk_size. |
24df33b4 | 156 | */ |
478c7835 | 157 | if (hdr->count > geo->leaf_max_ents) |
a6a781a5 | 158 | return __this_address; |
24df33b4 DC |
159 | |
160 | /* Leaves and bests don't overlap in leaf format. */ | |
161 | if ((hdr->magic == XFS_DIR2_LEAF1_MAGIC || | |
162 | hdr->magic == XFS_DIR3_LEAF1_MAGIC) && | |
787b0893 | 163 | (char *)&hdr->ents[hdr->count] > (char *)xfs_dir2_leaf_bests_p(ltp)) |
a6a781a5 | 164 | return __this_address; |
24df33b4 | 165 | |
1fea323f DC |
166 | if (!expensive_checking) |
167 | return NULL; | |
168 | ||
24df33b4 DC |
169 | /* Check hash value order, count stale entries. */ |
170 | for (i = stale = 0; i < hdr->count; i++) { | |
171 | if (i + 1 < hdr->count) { | |
787b0893 CH |
172 | if (be32_to_cpu(hdr->ents[i].hashval) > |
173 | be32_to_cpu(hdr->ents[i + 1].hashval)) | |
a6a781a5 | 174 | return __this_address; |
24df33b4 | 175 | } |
787b0893 | 176 | if (hdr->ents[i].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) |
24df33b4 DC |
177 | stale++; |
178 | } | |
179 | if (hdr->stale != stale) | |
a6a781a5 DW |
180 | return __this_address; |
181 | return NULL; | |
24df33b4 DC |
182 | } |
183 | ||
0f295a21 DC |
184 | /* |
185 | * We verify the magic numbers before decoding the leaf header so that on debug | |
186 | * kernels we don't get assertion failures in xfs_dir3_leaf_hdr_from_disk() due | |
187 | * to incorrect magic numbers. | |
188 | */ | |
a6a781a5 | 189 | static xfs_failaddr_t |
24df33b4 | 190 | xfs_dir3_leaf_verify( |
23220fe2 | 191 | struct xfs_buf *bp) |
24df33b4 | 192 | { |
23220fe2 CH |
193 | struct xfs_mount *mp = bp->b_mount; |
194 | struct xfs_dir3_icleaf_hdr leafhdr; | |
195 | xfs_failaddr_t fa; | |
24df33b4 | 196 | |
8764f983 BF |
197 | fa = xfs_da3_blkinfo_verify(bp, bp->b_addr); |
198 | if (fa) | |
199 | return fa; | |
0f295a21 | 200 | |
23220fe2 | 201 | xfs_dir2_leaf_hdr_from_disk(mp, &leafhdr, bp->b_addr); |
1fea323f | 202 | return xfs_dir3_leaf_check_int(mp, &leafhdr, bp->b_addr, true); |
24df33b4 DC |
203 | } |
204 | ||
205 | static void | |
09f42019 BF |
206 | xfs_dir3_leaf_read_verify( |
207 | struct xfs_buf *bp) | |
24df33b4 | 208 | { |
dbd329f1 | 209 | struct xfs_mount *mp = bp->b_mount; |
bc1a09b8 | 210 | xfs_failaddr_t fa; |
24df33b4 | 211 | |
38c26bfd | 212 | if (xfs_has_crc(mp) && |
ce5028cf | 213 | !xfs_buf_verify_cksum(bp, XFS_DIR3_LEAF_CRC_OFF)) |
bc1a09b8 DW |
214 | xfs_verifier_error(bp, -EFSBADCRC, __this_address); |
215 | else { | |
09f42019 | 216 | fa = xfs_dir3_leaf_verify(bp); |
bc1a09b8 DW |
217 | if (fa) |
218 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
219 | } | |
24df33b4 DC |
220 | } |
221 | ||
222 | static void | |
09f42019 BF |
223 | xfs_dir3_leaf_write_verify( |
224 | struct xfs_buf *bp) | |
e6f7667c | 225 | { |
dbd329f1 | 226 | struct xfs_mount *mp = bp->b_mount; |
fb1755a6 | 227 | struct xfs_buf_log_item *bip = bp->b_log_item; |
24df33b4 | 228 | struct xfs_dir3_leaf_hdr *hdr3 = bp->b_addr; |
bc1a09b8 | 229 | xfs_failaddr_t fa; |
e6f7667c | 230 | |
09f42019 | 231 | fa = xfs_dir3_leaf_verify(bp); |
bc1a09b8 DW |
232 | if (fa) { |
233 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
24df33b4 | 234 | return; |
e6f7667c | 235 | } |
24df33b4 | 236 | |
38c26bfd | 237 | if (!xfs_has_crc(mp)) |
24df33b4 DC |
238 | return; |
239 | ||
240 | if (bip) | |
241 | hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
242 | ||
f1dbcd7e | 243 | xfs_buf_update_cksum(bp, XFS_DIR3_LEAF_CRC_OFF); |
612cfbfe | 244 | } |
e6f7667c | 245 | |
d75afeb3 | 246 | const struct xfs_buf_ops xfs_dir3_leaf1_buf_ops = { |
233135b7 | 247 | .name = "xfs_dir3_leaf1", |
15baadf7 DW |
248 | .magic16 = { cpu_to_be16(XFS_DIR2_LEAF1_MAGIC), |
249 | cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) }, | |
09f42019 BF |
250 | .verify_read = xfs_dir3_leaf_read_verify, |
251 | .verify_write = xfs_dir3_leaf_write_verify, | |
252 | .verify_struct = xfs_dir3_leaf_verify, | |
1813dd64 DC |
253 | }; |
254 | ||
24df33b4 | 255 | const struct xfs_buf_ops xfs_dir3_leafn_buf_ops = { |
233135b7 | 256 | .name = "xfs_dir3_leafn", |
15baadf7 DW |
257 | .magic16 = { cpu_to_be16(XFS_DIR2_LEAFN_MAGIC), |
258 | cpu_to_be16(XFS_DIR3_LEAFN_MAGIC) }, | |
09f42019 BF |
259 | .verify_read = xfs_dir3_leaf_read_verify, |
260 | .verify_write = xfs_dir3_leaf_write_verify, | |
261 | .verify_struct = xfs_dir3_leaf_verify, | |
1813dd64 DC |
262 | }; |
263 | ||
26788097 | 264 | int |
24df33b4 | 265 | xfs_dir3_leaf_read( |
e6f7667c DC |
266 | struct xfs_trans *tp, |
267 | struct xfs_inode *dp, | |
268 | xfs_dablk_t fbno, | |
e6f7667c DC |
269 | struct xfs_buf **bpp) |
270 | { | |
d75afeb3 DC |
271 | int err; |
272 | ||
cd2c9f1b | 273 | err = xfs_da_read_buf(tp, dp, fbno, 0, bpp, XFS_DATA_FORK, |
c943c0b2 | 274 | &xfs_dir3_leaf1_buf_ops); |
cd87d867 | 275 | if (!err && tp && *bpp) |
61fe135c | 276 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAF1_BUF); |
d75afeb3 | 277 | return err; |
e6f7667c DC |
278 | } |
279 | ||
280 | int | |
24df33b4 | 281 | xfs_dir3_leafn_read( |
e6f7667c DC |
282 | struct xfs_trans *tp, |
283 | struct xfs_inode *dp, | |
284 | xfs_dablk_t fbno, | |
e6f7667c DC |
285 | struct xfs_buf **bpp) |
286 | { | |
d75afeb3 DC |
287 | int err; |
288 | ||
cd2c9f1b | 289 | err = xfs_da_read_buf(tp, dp, fbno, 0, bpp, XFS_DATA_FORK, |
f3fcb314 | 290 | &xfs_dir3_leafn_buf_ops); |
cd87d867 | 291 | if (!err && tp && *bpp) |
61fe135c | 292 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAFN_BUF); |
d75afeb3 | 293 | return err; |
24df33b4 DC |
294 | } |
295 | ||
296 | /* | |
297 | * Initialize a new leaf block, leaf1 or leafn magic accepted. | |
298 | */ | |
299 | static void | |
300 | xfs_dir3_leaf_init( | |
301 | struct xfs_mount *mp, | |
d75afeb3 | 302 | struct xfs_trans *tp, |
24df33b4 DC |
303 | struct xfs_buf *bp, |
304 | xfs_ino_t owner, | |
c8ce540d | 305 | uint16_t type) |
24df33b4 DC |
306 | { |
307 | struct xfs_dir2_leaf *leaf = bp->b_addr; | |
308 | ||
309 | ASSERT(type == XFS_DIR2_LEAF1_MAGIC || type == XFS_DIR2_LEAFN_MAGIC); | |
310 | ||
38c26bfd | 311 | if (xfs_has_crc(mp)) { |
24df33b4 DC |
312 | struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; |
313 | ||
314 | memset(leaf3, 0, sizeof(*leaf3)); | |
315 | ||
316 | leaf3->info.hdr.magic = (type == XFS_DIR2_LEAF1_MAGIC) | |
317 | ? cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) | |
318 | : cpu_to_be16(XFS_DIR3_LEAFN_MAGIC); | |
9343ee76 | 319 | leaf3->info.blkno = cpu_to_be64(xfs_buf_daddr(bp)); |
24df33b4 | 320 | leaf3->info.owner = cpu_to_be64(owner); |
ce748eaa | 321 | uuid_copy(&leaf3->info.uuid, &mp->m_sb.sb_meta_uuid); |
24df33b4 DC |
322 | } else { |
323 | memset(leaf, 0, sizeof(*leaf)); | |
324 | leaf->hdr.info.magic = cpu_to_be16(type); | |
325 | } | |
326 | ||
327 | /* | |
328 | * If it's a leaf-format directory initialize the tail. | |
329 | * Caller is responsible for initialising the bests table. | |
330 | */ | |
331 | if (type == XFS_DIR2_LEAF1_MAGIC) { | |
332 | struct xfs_dir2_leaf_tail *ltp; | |
333 | ||
8f66193c | 334 | ltp = xfs_dir2_leaf_tail_p(mp->m_dir_geo, leaf); |
24df33b4 DC |
335 | ltp->bestcount = 0; |
336 | bp->b_ops = &xfs_dir3_leaf1_buf_ops; | |
61fe135c | 337 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAF1_BUF); |
d75afeb3 | 338 | } else { |
24df33b4 | 339 | bp->b_ops = &xfs_dir3_leafn_buf_ops; |
61fe135c | 340 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAFN_BUF); |
d75afeb3 | 341 | } |
24df33b4 DC |
342 | } |
343 | ||
344 | int | |
345 | xfs_dir3_leaf_get_buf( | |
346 | xfs_da_args_t *args, | |
347 | xfs_dir2_db_t bno, | |
348 | struct xfs_buf **bpp, | |
c8ce540d | 349 | uint16_t magic) |
24df33b4 DC |
350 | { |
351 | struct xfs_inode *dp = args->dp; | |
352 | struct xfs_trans *tp = args->trans; | |
353 | struct xfs_mount *mp = dp->i_mount; | |
354 | struct xfs_buf *bp; | |
355 | int error; | |
356 | ||
357 | ASSERT(magic == XFS_DIR2_LEAF1_MAGIC || magic == XFS_DIR2_LEAFN_MAGIC); | |
30028030 DC |
358 | ASSERT(bno >= xfs_dir2_byte_to_db(args->geo, XFS_DIR2_LEAF_OFFSET) && |
359 | bno < xfs_dir2_byte_to_db(args->geo, XFS_DIR2_FREE_OFFSET)); | |
24df33b4 | 360 | |
2998ab1d | 361 | error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(args->geo, bno), |
2911edb6 | 362 | &bp, XFS_DATA_FORK); |
24df33b4 DC |
363 | if (error) |
364 | return error; | |
365 | ||
d75afeb3 | 366 | xfs_dir3_leaf_init(mp, tp, bp, dp->i_ino, magic); |
bc85178a | 367 | xfs_dir3_leaf_log_header(args, bp); |
24df33b4 | 368 | if (magic == XFS_DIR2_LEAF1_MAGIC) |
bc85178a | 369 | xfs_dir3_leaf_log_tail(args, bp); |
24df33b4 DC |
370 | *bpp = bp; |
371 | return 0; | |
e6f7667c | 372 | } |
1da177e4 LT |
373 | |
374 | /* | |
375 | * Convert a block form directory to a leaf form directory. | |
376 | */ | |
377 | int /* error */ | |
378 | xfs_dir2_block_to_leaf( | |
379 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 380 | struct xfs_buf *dbp) /* input block's buffer */ |
1da177e4 | 381 | { |
68b3a102 | 382 | __be16 *bestsp; /* leaf's bestsp entries */ |
1da177e4 | 383 | xfs_dablk_t blkno; /* leaf block's bno */ |
4f6ae1a4 | 384 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
1da177e4 LT |
385 | xfs_dir2_leaf_entry_t *blp; /* block's leaf entries */ |
386 | xfs_dir2_block_tail_t *btp; /* block's tail */ | |
387 | xfs_inode_t *dp; /* incore directory inode */ | |
388 | int error; /* error return code */ | |
1d9025e5 | 389 | struct xfs_buf *lbp; /* leaf block's buffer */ |
1da177e4 LT |
390 | xfs_dir2_db_t ldb; /* leaf block's bno */ |
391 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
392 | xfs_dir2_leaf_tail_t *ltp; /* leaf's tail */ | |
1da177e4 LT |
393 | int needlog; /* need to log block header */ |
394 | int needscan; /* need to rescan bestfree */ | |
395 | xfs_trans_t *tp; /* transaction pointer */ | |
33363fee | 396 | struct xfs_dir2_data_free *bf; |
24df33b4 | 397 | struct xfs_dir3_icleaf_hdr leafhdr; |
1da177e4 | 398 | |
0b1b213f CH |
399 | trace_xfs_dir2_block_to_leaf(args); |
400 | ||
1da177e4 | 401 | dp = args->dp; |
1da177e4 LT |
402 | tp = args->trans; |
403 | /* | |
404 | * Add the leaf block to the inode. | |
405 | * This interface will only put blocks in the leaf/node range. | |
406 | * Since that's empty now, we'll get the root (block 0 in range). | |
407 | */ | |
408 | if ((error = xfs_da_grow_inode(args, &blkno))) { | |
409 | return error; | |
410 | } | |
2998ab1d | 411 | ldb = xfs_dir2_da_to_db(args->geo, blkno); |
30028030 | 412 | ASSERT(ldb == xfs_dir2_byte_to_db(args->geo, XFS_DIR2_LEAF_OFFSET)); |
1da177e4 LT |
413 | /* |
414 | * Initialize the leaf block, get a buffer for it. | |
415 | */ | |
24df33b4 DC |
416 | error = xfs_dir3_leaf_get_buf(args, ldb, &lbp, XFS_DIR2_LEAF1_MAGIC); |
417 | if (error) | |
1da177e4 | 418 | return error; |
24df33b4 | 419 | |
1d9025e5 DC |
420 | leaf = lbp->b_addr; |
421 | hdr = dbp->b_addr; | |
33363fee | 422 | xfs_dir3_data_check(dp, dbp); |
8f66193c | 423 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
bbaaf538 | 424 | blp = xfs_dir2_block_leaf_p(btp); |
1848b607 | 425 | bf = xfs_dir2_data_bestfree_p(dp->i_mount, hdr); |
24df33b4 | 426 | |
1da177e4 LT |
427 | /* |
428 | * Set the counts in the leaf header. | |
429 | */ | |
51842556 | 430 | xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); |
24df33b4 DC |
431 | leafhdr.count = be32_to_cpu(btp->count); |
432 | leafhdr.stale = be32_to_cpu(btp->stale); | |
163fbbb3 | 433 | xfs_dir2_leaf_hdr_to_disk(dp->i_mount, leaf, &leafhdr); |
bc85178a | 434 | xfs_dir3_leaf_log_header(args, lbp); |
24df33b4 | 435 | |
1da177e4 LT |
436 | /* |
437 | * Could compact these but I think we always do the conversion | |
438 | * after squeezing out stale entries. | |
439 | */ | |
787b0893 CH |
440 | memcpy(leafhdr.ents, blp, |
441 | be32_to_cpu(btp->count) * sizeof(struct xfs_dir2_leaf_entry)); | |
442 | xfs_dir3_leaf_log_ents(args, &leafhdr, lbp, 0, leafhdr.count - 1); | |
1da177e4 LT |
443 | needscan = 0; |
444 | needlog = 1; | |
445 | /* | |
446 | * Make the space formerly occupied by the leaf entries and block | |
447 | * tail be free. | |
448 | */ | |
bc85178a | 449 | xfs_dir2_data_make_free(args, dbp, |
4f6ae1a4 | 450 | (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr), |
8f66193c | 451 | (xfs_dir2_data_aoff_t)((char *)hdr + args->geo->blksize - |
1da177e4 LT |
452 | (char *)blp), |
453 | &needlog, &needscan); | |
454 | /* | |
455 | * Fix up the block header, make it a data block. | |
456 | */ | |
33363fee | 457 | dbp->b_ops = &xfs_dir3_data_buf_ops; |
61fe135c | 458 | xfs_trans_buf_set_type(tp, dbp, XFS_BLFT_DIR_DATA_BUF); |
33363fee DC |
459 | if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC)) |
460 | hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC); | |
461 | else | |
462 | hdr->magic = cpu_to_be32(XFS_DIR3_DATA_MAGIC); | |
463 | ||
1da177e4 | 464 | if (needscan) |
ae42976d | 465 | xfs_dir2_data_freescan(dp->i_mount, hdr, &needlog); |
1da177e4 LT |
466 | /* |
467 | * Set up leaf tail and bests table. | |
468 | */ | |
8f66193c | 469 | ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); |
afbcb3f9 | 470 | ltp->bestcount = cpu_to_be32(1); |
bbaaf538 | 471 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
f5f3d9b0 | 472 | bestsp[0] = bf[0].length; |
1da177e4 LT |
473 | /* |
474 | * Log the data header and leaf bests table. | |
475 | */ | |
476 | if (needlog) | |
bc85178a | 477 | xfs_dir2_data_log_header(args, dbp); |
4141956a | 478 | xfs_dir3_leaf_check(dp, lbp); |
33363fee | 479 | xfs_dir3_data_check(dp, dbp); |
bc85178a | 480 | xfs_dir3_leaf_log_bests(args, lbp, 0, 0); |
1da177e4 LT |
481 | return 0; |
482 | } | |
483 | ||
a230a1df | 484 | STATIC void |
24df33b4 DC |
485 | xfs_dir3_leaf_find_stale( |
486 | struct xfs_dir3_icleaf_hdr *leafhdr, | |
487 | struct xfs_dir2_leaf_entry *ents, | |
a230a1df CH |
488 | int index, |
489 | int *lowstale, | |
490 | int *highstale) | |
491 | { | |
492 | /* | |
493 | * Find the first stale entry before our index, if any. | |
494 | */ | |
495 | for (*lowstale = index - 1; *lowstale >= 0; --*lowstale) { | |
24df33b4 | 496 | if (ents[*lowstale].address == |
a230a1df CH |
497 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) |
498 | break; | |
499 | } | |
500 | ||
501 | /* | |
502 | * Find the first stale entry at or after our index, if any. | |
503 | * Stop if the result would require moving more entries than using | |
504 | * lowstale. | |
505 | */ | |
24df33b4 DC |
506 | for (*highstale = index; *highstale < leafhdr->count; ++*highstale) { |
507 | if (ents[*highstale].address == | |
a230a1df CH |
508 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) |
509 | break; | |
510 | if (*lowstale >= 0 && index - *lowstale <= *highstale - index) | |
511 | break; | |
512 | } | |
513 | } | |
514 | ||
4fb44c82 | 515 | struct xfs_dir2_leaf_entry * |
24df33b4 DC |
516 | xfs_dir3_leaf_find_entry( |
517 | struct xfs_dir3_icleaf_hdr *leafhdr, | |
518 | struct xfs_dir2_leaf_entry *ents, | |
4fb44c82 CH |
519 | int index, /* leaf table position */ |
520 | int compact, /* need to compact leaves */ | |
521 | int lowstale, /* index of prev stale leaf */ | |
522 | int highstale, /* index of next stale leaf */ | |
523 | int *lfloglow, /* low leaf logging index */ | |
524 | int *lfloghigh) /* high leaf logging index */ | |
525 | { | |
24df33b4 | 526 | if (!leafhdr->stale) { |
4fb44c82 CH |
527 | xfs_dir2_leaf_entry_t *lep; /* leaf entry table pointer */ |
528 | ||
529 | /* | |
530 | * Now we need to make room to insert the leaf entry. | |
531 | * | |
532 | * If there are no stale entries, just insert a hole at index. | |
533 | */ | |
24df33b4 DC |
534 | lep = &ents[index]; |
535 | if (index < leafhdr->count) | |
4fb44c82 | 536 | memmove(lep + 1, lep, |
24df33b4 | 537 | (leafhdr->count - index) * sizeof(*lep)); |
4fb44c82 CH |
538 | |
539 | /* | |
540 | * Record low and high logging indices for the leaf. | |
541 | */ | |
542 | *lfloglow = index; | |
24df33b4 | 543 | *lfloghigh = leafhdr->count++; |
4fb44c82 CH |
544 | return lep; |
545 | } | |
546 | ||
547 | /* | |
548 | * There are stale entries. | |
549 | * | |
550 | * We will use one of them for the new entry. It's probably not at | |
551 | * the right location, so we'll have to shift some up or down first. | |
552 | * | |
553 | * If we didn't compact before, we need to find the nearest stale | |
554 | * entries before and after our insertion point. | |
555 | */ | |
a230a1df | 556 | if (compact == 0) |
24df33b4 DC |
557 | xfs_dir3_leaf_find_stale(leafhdr, ents, index, |
558 | &lowstale, &highstale); | |
4fb44c82 CH |
559 | |
560 | /* | |
561 | * If the low one is better, use it. | |
562 | */ | |
563 | if (lowstale >= 0 && | |
24df33b4 | 564 | (highstale == leafhdr->count || |
4fb44c82 CH |
565 | index - lowstale - 1 < highstale - index)) { |
566 | ASSERT(index - lowstale - 1 >= 0); | |
24df33b4 | 567 | ASSERT(ents[lowstale].address == |
69ef921b | 568 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)); |
4fb44c82 CH |
569 | |
570 | /* | |
571 | * Copy entries up to cover the stale entry and make room | |
572 | * for the new entry. | |
573 | */ | |
574 | if (index - lowstale - 1 > 0) { | |
24df33b4 | 575 | memmove(&ents[lowstale], &ents[lowstale + 1], |
4fb44c82 | 576 | (index - lowstale - 1) * |
24df33b4 | 577 | sizeof(xfs_dir2_leaf_entry_t)); |
4fb44c82 | 578 | } |
9bb54cb5 DC |
579 | *lfloglow = min(lowstale, *lfloglow); |
580 | *lfloghigh = max(index - 1, *lfloghigh); | |
24df33b4 DC |
581 | leafhdr->stale--; |
582 | return &ents[index - 1]; | |
4fb44c82 CH |
583 | } |
584 | ||
585 | /* | |
586 | * The high one is better, so use that one. | |
587 | */ | |
588 | ASSERT(highstale - index >= 0); | |
24df33b4 | 589 | ASSERT(ents[highstale].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)); |
4fb44c82 CH |
590 | |
591 | /* | |
592 | * Copy entries down to cover the stale entry and make room for the | |
593 | * new entry. | |
594 | */ | |
595 | if (highstale - index > 0) { | |
24df33b4 | 596 | memmove(&ents[index + 1], &ents[index], |
4fb44c82 CH |
597 | (highstale - index) * sizeof(xfs_dir2_leaf_entry_t)); |
598 | } | |
9bb54cb5 DC |
599 | *lfloglow = min(index, *lfloglow); |
600 | *lfloghigh = max(highstale, *lfloghigh); | |
24df33b4 DC |
601 | leafhdr->stale--; |
602 | return &ents[index]; | |
4fb44c82 CH |
603 | } |
604 | ||
1da177e4 LT |
605 | /* |
606 | * Add an entry to a leaf form directory. | |
607 | */ | |
608 | int /* error */ | |
609 | xfs_dir2_leaf_addname( | |
6ef50fe9 | 610 | struct xfs_da_args *args) /* operation arguments */ |
1da177e4 | 611 | { |
6ef50fe9 DW |
612 | struct xfs_dir3_icleaf_hdr leafhdr; |
613 | struct xfs_trans *tp = args->trans; | |
68b3a102 | 614 | __be16 *bestsp; /* freespace table in leaf */ |
6ef50fe9 | 615 | __be16 *tagp; /* end of data entry */ |
1d9025e5 | 616 | struct xfs_buf *dbp; /* data block buffer */ |
6ef50fe9 DW |
617 | struct xfs_buf *lbp; /* leaf's buffer */ |
618 | struct xfs_dir2_leaf *leaf; /* leaf structure */ | |
619 | struct xfs_inode *dp = args->dp; /* incore directory inode */ | |
620 | struct xfs_dir2_data_hdr *hdr; /* data block header */ | |
621 | struct xfs_dir2_data_entry *dep; /* data block entry */ | |
622 | struct xfs_dir2_leaf_entry *lep; /* leaf entry table pointer */ | |
623 | struct xfs_dir2_leaf_entry *ents; | |
624 | struct xfs_dir2_data_unused *dup; /* data unused entry */ | |
625 | struct xfs_dir2_leaf_tail *ltp; /* leaf tail pointer */ | |
626 | struct xfs_dir2_data_free *bf; /* bestfree table */ | |
627 | int compact; /* need to compact leaves */ | |
1da177e4 LT |
628 | int error; /* error return value */ |
629 | int grown; /* allocated new data block */ | |
f51fac68 | 630 | int highstale = 0; /* index of next stale leaf */ |
1da177e4 LT |
631 | int i; /* temporary, index */ |
632 | int index; /* leaf table position */ | |
1da177e4 | 633 | int length; /* length of new entry */ |
1da177e4 LT |
634 | int lfloglow; /* low leaf logging index */ |
635 | int lfloghigh; /* high leaf logging index */ | |
f51fac68 | 636 | int lowstale = 0; /* index of prev stale leaf */ |
1da177e4 LT |
637 | int needbytes; /* leaf block bytes needed */ |
638 | int needlog; /* need to log data header */ | |
639 | int needscan; /* need to rescan data free */ | |
1da177e4 LT |
640 | xfs_dir2_db_t use_block; /* data block number */ |
641 | ||
0b1b213f CH |
642 | trace_xfs_dir2_leaf_addname(args); |
643 | ||
c943c0b2 | 644 | error = xfs_dir3_leaf_read(tp, dp, args->geo->leafblk, &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; |
8f66193c | 656 | ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); |
51842556 | 657 | xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); |
787b0893 | 658 | ents = leafhdr.ents; |
bbaaf538 | 659 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
fdbb8c5b | 660 | length = xfs_dir2_data_entsize(dp->i_mount, 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); |
2451337d | 732 | return -ENOSPC; |
1da177e4 LT |
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); |
2451337d | 756 | return use_block == -1 ? -ENOSPC : 0; |
1da177e4 LT |
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); |
2451337d | 764 | return -ENOSPC; |
1da177e4 LT |
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); |
bc85178a DC |
813 | xfs_dir3_leaf_log_tail(args, lbp); |
814 | xfs_dir3_leaf_log_bests(args, lbp, 0, | |
815 | be32_to_cpu(ltp->bestcount) - 1); | |
1da177e4 LT |
816 | } |
817 | /* | |
818 | * If we're filling in a previously empty block just log it. | |
819 | */ | |
820 | else | |
bc85178a | 821 | xfs_dir3_leaf_log_bests(args, lbp, use_block, use_block); |
1d9025e5 | 822 | hdr = dbp->b_addr; |
1848b607 | 823 | bf = xfs_dir2_data_bestfree_p(dp->i_mount, hdr); |
33363fee | 824 | bestsp[use_block] = bf[0].length; |
1da177e4 | 825 | grown = 1; |
e4813572 DC |
826 | } else { |
827 | /* | |
828 | * Already had space in some data block. | |
829 | * Just read that one in. | |
830 | */ | |
33363fee | 831 | error = xfs_dir3_data_read(tp, dp, |
2998ab1d | 832 | xfs_dir2_db_to_da(args->geo, use_block), |
cd2c9f1b | 833 | 0, &dbp); |
4bb20a83 | 834 | if (error) { |
1d9025e5 | 835 | xfs_trans_brelse(tp, lbp); |
1da177e4 LT |
836 | return error; |
837 | } | |
1d9025e5 | 838 | hdr = dbp->b_addr; |
1848b607 | 839 | bf = xfs_dir2_data_bestfree_p(dp->i_mount, hdr); |
1da177e4 LT |
840 | grown = 0; |
841 | } | |
1da177e4 LT |
842 | /* |
843 | * Point to the biggest freespace in our data block. | |
844 | */ | |
845 | dup = (xfs_dir2_data_unused_t *) | |
33363fee | 846 | ((char *)hdr + be16_to_cpu(bf[0].offset)); |
1da177e4 LT |
847 | needscan = needlog = 0; |
848 | /* | |
849 | * Mark the initial part of our freespace in use for the new entry. | |
850 | */ | |
6915ef35 DW |
851 | error = xfs_dir2_data_use_free(args, dbp, dup, |
852 | (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), | |
853 | length, &needlog, &needscan); | |
854 | if (error) { | |
855 | xfs_trans_brelse(tp, lbp); | |
856 | return error; | |
857 | } | |
1da177e4 LT |
858 | /* |
859 | * Initialize our new entry (at last). | |
860 | */ | |
861 | dep = (xfs_dir2_data_entry_t *)dup; | |
ff9901c1 | 862 | dep->inumber = cpu_to_be64(args->inumber); |
1da177e4 LT |
863 | dep->namelen = args->namelen; |
864 | memcpy(dep->name, args->name, dep->namelen); | |
59b8b465 | 865 | xfs_dir2_data_put_ftype(dp->i_mount, dep, args->filetype); |
7e8ae7bd | 866 | tagp = xfs_dir2_data_entry_tag_p(dp->i_mount, dep); |
c2066e26 | 867 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
1da177e4 LT |
868 | /* |
869 | * Need to scan fix up the bestfree table. | |
870 | */ | |
871 | if (needscan) | |
ae42976d | 872 | xfs_dir2_data_freescan(dp->i_mount, hdr, &needlog); |
1da177e4 LT |
873 | /* |
874 | * Need to log the data block's header. | |
875 | */ | |
876 | if (needlog) | |
bc85178a DC |
877 | xfs_dir2_data_log_header(args, dbp); |
878 | xfs_dir2_data_log_entry(args, dbp, dep); | |
1da177e4 LT |
879 | /* |
880 | * If the bests table needs to be changed, do it. | |
881 | * Log the change unless we've already done that. | |
882 | */ | |
33363fee DC |
883 | if (be16_to_cpu(bestsp[use_block]) != be16_to_cpu(bf[0].length)) { |
884 | bestsp[use_block] = bf[0].length; | |
1da177e4 | 885 | if (!grown) |
bc85178a | 886 | xfs_dir3_leaf_log_bests(args, lbp, use_block, use_block); |
1da177e4 | 887 | } |
4fb44c82 | 888 | |
24df33b4 | 889 | lep = xfs_dir3_leaf_find_entry(&leafhdr, ents, index, compact, lowstale, |
4fb44c82 CH |
890 | highstale, &lfloglow, &lfloghigh); |
891 | ||
1da177e4 LT |
892 | /* |
893 | * Fill in the new leaf entry. | |
894 | */ | |
3c1f9c15 | 895 | lep->hashval = cpu_to_be32(args->hashval); |
30028030 DC |
896 | lep->address = cpu_to_be32( |
897 | xfs_dir2_db_off_to_dataptr(args->geo, use_block, | |
3d693c6e | 898 | be16_to_cpu(*tagp))); |
1da177e4 LT |
899 | /* |
900 | * Log the leaf fields and give up the buffers. | |
901 | */ | |
163fbbb3 | 902 | xfs_dir2_leaf_hdr_to_disk(dp->i_mount, leaf, &leafhdr); |
bc85178a | 903 | xfs_dir3_leaf_log_header(args, lbp); |
787b0893 | 904 | xfs_dir3_leaf_log_ents(args, &leafhdr, lbp, lfloglow, lfloghigh); |
4141956a | 905 | xfs_dir3_leaf_check(dp, lbp); |
33363fee | 906 | xfs_dir3_data_check(dp, dbp); |
1da177e4 LT |
907 | return 0; |
908 | } | |
909 | ||
1da177e4 LT |
910 | /* |
911 | * Compact out any stale entries in the leaf. | |
912 | * Log the header and changed leaf entries, if any. | |
913 | */ | |
914 | void | |
24df33b4 | 915 | xfs_dir3_leaf_compact( |
1da177e4 | 916 | xfs_da_args_t *args, /* operation arguments */ |
24df33b4 | 917 | struct xfs_dir3_icleaf_hdr *leafhdr, |
1d9025e5 | 918 | struct xfs_buf *bp) /* leaf buffer */ |
1da177e4 LT |
919 | { |
920 | int from; /* source leaf index */ | |
921 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
922 | int loglow; /* first leaf entry to log */ | |
923 | int to; /* target leaf index */ | |
01ba43b8 | 924 | struct xfs_inode *dp = args->dp; |
1da177e4 | 925 | |
1d9025e5 | 926 | leaf = bp->b_addr; |
24df33b4 | 927 | if (!leafhdr->stale) |
1da177e4 | 928 | return; |
24df33b4 | 929 | |
1da177e4 LT |
930 | /* |
931 | * Compress out the stale entries in place. | |
932 | */ | |
24df33b4 | 933 | for (from = to = 0, loglow = -1; from < leafhdr->count; from++) { |
787b0893 CH |
934 | if (leafhdr->ents[from].address == |
935 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) | |
1da177e4 LT |
936 | continue; |
937 | /* | |
938 | * Only actually copy the entries that are different. | |
939 | */ | |
940 | if (from > to) { | |
941 | if (loglow == -1) | |
942 | loglow = to; | |
787b0893 | 943 | leafhdr->ents[to] = leafhdr->ents[from]; |
1da177e4 LT |
944 | } |
945 | to++; | |
946 | } | |
947 | /* | |
948 | * Update and log the header, log the leaf entries. | |
949 | */ | |
24df33b4 DC |
950 | ASSERT(leafhdr->stale == from - to); |
951 | leafhdr->count -= leafhdr->stale; | |
952 | leafhdr->stale = 0; | |
953 | ||
163fbbb3 | 954 | xfs_dir2_leaf_hdr_to_disk(dp->i_mount, leaf, leafhdr); |
bc85178a | 955 | xfs_dir3_leaf_log_header(args, bp); |
1da177e4 | 956 | if (loglow != -1) |
787b0893 | 957 | xfs_dir3_leaf_log_ents(args, leafhdr, bp, loglow, to - 1); |
1da177e4 LT |
958 | } |
959 | ||
960 | /* | |
961 | * Compact the leaf entries, removing stale ones. | |
962 | * Leave one stale entry behind - the one closest to our | |
963 | * insertion index - and the caller will shift that one to our insertion | |
964 | * point later. | |
965 | * Return new insertion index, where the remaining stale entry is, | |
966 | * and leaf logging indices. | |
967 | */ | |
968 | void | |
24df33b4 DC |
969 | xfs_dir3_leaf_compact_x1( |
970 | struct xfs_dir3_icleaf_hdr *leafhdr, | |
971 | struct xfs_dir2_leaf_entry *ents, | |
1da177e4 LT |
972 | int *indexp, /* insertion index */ |
973 | int *lowstalep, /* out: stale entry before us */ | |
974 | int *highstalep, /* out: stale entry after us */ | |
975 | int *lowlogp, /* out: low log index */ | |
976 | int *highlogp) /* out: high log index */ | |
977 | { | |
978 | int from; /* source copy index */ | |
979 | int highstale; /* stale entry at/after index */ | |
980 | int index; /* insertion index */ | |
981 | int keepstale; /* source index of kept stale */ | |
1da177e4 LT |
982 | int lowstale; /* stale entry before index */ |
983 | int newindex=0; /* new insertion index */ | |
984 | int to; /* destination copy index */ | |
985 | ||
24df33b4 | 986 | ASSERT(leafhdr->stale > 1); |
1da177e4 | 987 | index = *indexp; |
a230a1df | 988 | |
24df33b4 | 989 | xfs_dir3_leaf_find_stale(leafhdr, ents, index, &lowstale, &highstale); |
a230a1df | 990 | |
1da177e4 LT |
991 | /* |
992 | * Pick the better of lowstale and highstale. | |
993 | */ | |
994 | if (lowstale >= 0 && | |
24df33b4 | 995 | (highstale == leafhdr->count || |
1da177e4 LT |
996 | index - lowstale <= highstale - index)) |
997 | keepstale = lowstale; | |
998 | else | |
999 | keepstale = highstale; | |
1000 | /* | |
1001 | * Copy the entries in place, removing all the stale entries | |
1002 | * except keepstale. | |
1003 | */ | |
24df33b4 | 1004 | for (from = to = 0; from < leafhdr->count; from++) { |
1da177e4 LT |
1005 | /* |
1006 | * Notice the new value of index. | |
1007 | */ | |
1008 | if (index == from) | |
1009 | newindex = to; | |
1010 | if (from != keepstale && | |
24df33b4 | 1011 | ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) { |
1da177e4 LT |
1012 | if (from == to) |
1013 | *lowlogp = to; | |
1014 | continue; | |
1015 | } | |
1016 | /* | |
1017 | * Record the new keepstale value for the insertion. | |
1018 | */ | |
1019 | if (from == keepstale) | |
1020 | lowstale = highstale = to; | |
1021 | /* | |
1022 | * Copy only the entries that have moved. | |
1023 | */ | |
1024 | if (from > to) | |
24df33b4 | 1025 | ents[to] = ents[from]; |
1da177e4 LT |
1026 | to++; |
1027 | } | |
1028 | ASSERT(from > to); | |
1029 | /* | |
1030 | * If the insertion point was past the last entry, | |
1031 | * set the new insertion point accordingly. | |
1032 | */ | |
1033 | if (index == from) | |
1034 | newindex = to; | |
1035 | *indexp = newindex; | |
1036 | /* | |
1037 | * Adjust the leaf header values. | |
1038 | */ | |
24df33b4 DC |
1039 | leafhdr->count -= from - to; |
1040 | leafhdr->stale = 1; | |
1da177e4 LT |
1041 | /* |
1042 | * Remember the low/high stale value only in the "right" | |
1043 | * direction. | |
1044 | */ | |
1045 | if (lowstale >= newindex) | |
1046 | lowstale = -1; | |
1047 | else | |
24df33b4 DC |
1048 | highstale = leafhdr->count; |
1049 | *highlogp = leafhdr->count - 1; | |
1da177e4 LT |
1050 | *lowstalep = lowstale; |
1051 | *highstalep = highstale; | |
1052 | } | |
1053 | ||
1da177e4 LT |
1054 | /* |
1055 | * Log the bests entries indicated from a leaf1 block. | |
1056 | */ | |
ba0f32d4 | 1057 | static void |
24df33b4 | 1058 | xfs_dir3_leaf_log_bests( |
bc85178a | 1059 | struct xfs_da_args *args, |
1d9025e5 | 1060 | struct xfs_buf *bp, /* leaf buffer */ |
1da177e4 LT |
1061 | int first, /* first entry to log */ |
1062 | int last) /* last entry to log */ | |
1063 | { | |
68b3a102 NS |
1064 | __be16 *firstb; /* pointer to first entry */ |
1065 | __be16 *lastb; /* pointer to last entry */ | |
24df33b4 | 1066 | struct xfs_dir2_leaf *leaf = bp->b_addr; |
1da177e4 LT |
1067 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ |
1068 | ||
24df33b4 DC |
1069 | ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || |
1070 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC)); | |
1071 | ||
bc85178a | 1072 | ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); |
bbaaf538 CH |
1073 | firstb = xfs_dir2_leaf_bests_p(ltp) + first; |
1074 | lastb = xfs_dir2_leaf_bests_p(ltp) + last; | |
bc85178a DC |
1075 | xfs_trans_log_buf(args->trans, bp, |
1076 | (uint)((char *)firstb - (char *)leaf), | |
1da177e4 LT |
1077 | (uint)((char *)lastb - (char *)leaf + sizeof(*lastb) - 1)); |
1078 | } | |
1079 | ||
1080 | /* | |
1081 | * Log the leaf entries indicated from a leaf1 or leafn block. | |
1082 | */ | |
1083 | void | |
24df33b4 | 1084 | xfs_dir3_leaf_log_ents( |
bc85178a | 1085 | struct xfs_da_args *args, |
787b0893 | 1086 | struct xfs_dir3_icleaf_hdr *hdr, |
4141956a DC |
1087 | struct xfs_buf *bp, |
1088 | int first, | |
1089 | int last) | |
1da177e4 LT |
1090 | { |
1091 | xfs_dir2_leaf_entry_t *firstlep; /* pointer to first entry */ | |
1092 | xfs_dir2_leaf_entry_t *lastlep; /* pointer to last entry */ | |
24df33b4 | 1093 | struct xfs_dir2_leaf *leaf = bp->b_addr; |
1da177e4 | 1094 | |
69ef921b | 1095 | ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || |
24df33b4 DC |
1096 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) || |
1097 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || | |
1098 | leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)); | |
1099 | ||
787b0893 CH |
1100 | firstlep = &hdr->ents[first]; |
1101 | lastlep = &hdr->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), | |
545910bc | 1124 | args->geo->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_entry_t *lep; /* leaf entry */ |
1164 | xfs_trans_t *tp; /* transaction pointer */ | |
787b0893 | 1165 | struct xfs_dir3_icleaf_hdr leafhdr; |
1da177e4 | 1166 | |
0b1b213f CH |
1167 | trace_xfs_dir2_leaf_lookup(args); |
1168 | ||
1da177e4 LT |
1169 | /* |
1170 | * Look up name in the leaf block, returning both buffers and index. | |
1171 | */ | |
787b0893 CH |
1172 | error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp, &leafhdr); |
1173 | if (error) | |
1da177e4 | 1174 | return error; |
787b0893 | 1175 | |
1da177e4 LT |
1176 | tp = args->trans; |
1177 | dp = args->dp; | |
4141956a | 1178 | xfs_dir3_leaf_check(dp, lbp); |
787b0893 | 1179 | |
1da177e4 LT |
1180 | /* |
1181 | * Get to the leaf entry and contained data entry address. | |
1182 | */ | |
787b0893 | 1183 | lep = &leafhdr.ents[index]; |
24df33b4 | 1184 | |
1da177e4 LT |
1185 | /* |
1186 | * Point to the data entry. | |
1187 | */ | |
1188 | dep = (xfs_dir2_data_entry_t *) | |
1d9025e5 | 1189 | ((char *)dbp->b_addr + |
30028030 | 1190 | xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address))); |
1da177e4 | 1191 | /* |
384f3ced | 1192 | * Return the found inode number & CI name if appropriate |
1da177e4 | 1193 | */ |
ff9901c1 | 1194 | args->inumber = be64_to_cpu(dep->inumber); |
59b8b465 | 1195 | args->filetype = xfs_dir2_data_get_ftype(dp->i_mount, dep); |
384f3ced | 1196 | error = xfs_dir_cilookup_result(args, dep->name, dep->namelen); |
1d9025e5 DC |
1197 | xfs_trans_brelse(tp, dbp); |
1198 | xfs_trans_brelse(tp, lbp); | |
b474c7ae | 1199 | return error; |
1da177e4 LT |
1200 | } |
1201 | ||
1202 | /* | |
1203 | * Look up name/hash in the leaf block. | |
1204 | * Fill in indexp with the found index, and dbpp with the data buffer. | |
1205 | * If not found dbpp will be NULL, and ENOENT comes back. | |
1206 | * lbpp will always be filled in with the leaf buffer unless there's an error. | |
1207 | */ | |
1208 | static int /* error */ | |
1209 | xfs_dir2_leaf_lookup_int( | |
1210 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 1211 | struct xfs_buf **lbpp, /* out: leaf buffer */ |
1da177e4 | 1212 | int *indexp, /* out: index in leaf block */ |
787b0893 CH |
1213 | struct xfs_buf **dbpp, /* out: data buffer */ |
1214 | struct xfs_dir3_icleaf_hdr *leafhdr) | |
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 */ |
1da177e4 LT |
1230 | |
1231 | dp = args->dp; | |
1232 | tp = args->trans; | |
1233 | mp = dp->i_mount; | |
e6f7667c | 1234 | |
c943c0b2 | 1235 | error = xfs_dir3_leaf_read(tp, dp, args->geo->leafblk, &lbp); |
07fe4dd4 | 1236 | if (error) |
1da177e4 | 1237 | return error; |
e6f7667c | 1238 | |
1da177e4 | 1239 | *lbpp = lbp; |
1d9025e5 | 1240 | leaf = lbp->b_addr; |
4141956a | 1241 | xfs_dir3_leaf_check(dp, lbp); |
787b0893 | 1242 | xfs_dir2_leaf_hdr_from_disk(mp, leafhdr, leaf); |
24df33b4 | 1243 | |
1da177e4 LT |
1244 | /* |
1245 | * Look for the first leaf entry with our hash value. | |
1246 | */ | |
1247 | index = xfs_dir2_leaf_search_hash(args, lbp); | |
1248 | /* | |
1249 | * Loop over all the entries with the right hash value | |
1250 | * looking to match the name. | |
1251 | */ | |
787b0893 CH |
1252 | for (lep = &leafhdr->ents[index]; |
1253 | index < leafhdr->count && | |
1254 | be32_to_cpu(lep->hashval) == args->hashval; | |
24df33b4 | 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 | 1274 | xfs_dir2_db_to_da(args->geo, newdb), |
cd2c9f1b | 1275 | 0, &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 | */ |
d8d11fc7 | 1293 | cmp = xfs_dir2_compname(args, dep->name, dep->namelen); |
5163f95a BN |
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 | 1316 | xfs_dir2_db_to_da(args->geo, cidb), |
cd2c9f1b | 1317 | 0, &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 | 1326 | /* |
2451337d | 1327 | * No match found, return -ENOENT. |
1da177e4 | 1328 | */ |
07fe4dd4 | 1329 | ASSERT(cidb == -1); |
1da177e4 | 1330 | if (dbp) |
1d9025e5 DC |
1331 | xfs_trans_brelse(tp, dbp); |
1332 | xfs_trans_brelse(tp, lbp); | |
2451337d | 1333 | return -ENOENT; |
1da177e4 LT |
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 | { | |
d73e1cee | 1343 | struct xfs_da_geometry *geo = args->geo; |
68b3a102 | 1344 | __be16 *bestsp; /* leaf block best freespace */ |
c2066e26 | 1345 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 | 1346 | xfs_dir2_db_t db; /* data block number */ |
1d9025e5 | 1347 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1348 | xfs_dir2_data_entry_t *dep; /* data entry structure */ |
1349 | xfs_inode_t *dp; /* incore directory inode */ | |
1350 | int error; /* error return code */ | |
1351 | xfs_dir2_db_t i; /* temporary data block # */ | |
1352 | int index; /* index into leaf entries */ | |
1d9025e5 | 1353 | struct xfs_buf *lbp; /* leaf buffer */ |
1da177e4 LT |
1354 | xfs_dir2_leaf_t *leaf; /* leaf structure */ |
1355 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
1356 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ | |
1da177e4 LT |
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 */ | |
33363fee | 1360 | struct xfs_dir2_data_free *bf; /* bestfree table */ |
24df33b4 | 1361 | struct xfs_dir3_icleaf_hdr leafhdr; |
1da177e4 | 1362 | |
0b1b213f CH |
1363 | trace_xfs_dir2_leaf_removename(args); |
1364 | ||
1da177e4 LT |
1365 | /* |
1366 | * Lookup the leaf entry, get the leaf and data blocks read in. | |
1367 | */ | |
787b0893 CH |
1368 | error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp, &leafhdr); |
1369 | if (error) | |
1da177e4 | 1370 | return error; |
787b0893 | 1371 | |
1da177e4 | 1372 | dp = args->dp; |
1d9025e5 DC |
1373 | leaf = lbp->b_addr; |
1374 | hdr = dbp->b_addr; | |
33363fee | 1375 | xfs_dir3_data_check(dp, dbp); |
1848b607 | 1376 | bf = xfs_dir2_data_bestfree_p(dp->i_mount, hdr); |
787b0893 | 1377 | |
1da177e4 LT |
1378 | /* |
1379 | * Point to the leaf entry, use that to point to the data entry. | |
1380 | */ | |
787b0893 | 1381 | lep = &leafhdr.ents[index]; |
d73e1cee | 1382 | db = xfs_dir2_dataptr_to_db(geo, be32_to_cpu(lep->address)); |
30028030 | 1383 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + |
d73e1cee | 1384 | xfs_dir2_dataptr_to_off(geo, be32_to_cpu(lep->address))); |
1da177e4 | 1385 | needscan = needlog = 0; |
33363fee | 1386 | oldbest = be16_to_cpu(bf[0].length); |
d73e1cee | 1387 | ltp = xfs_dir2_leaf_tail_p(geo, leaf); |
bbaaf538 | 1388 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
a5155b87 | 1389 | if (be16_to_cpu(bestsp[db]) != oldbest) { |
8d57c216 | 1390 | xfs_buf_mark_corrupt(lbp); |
3f883f5b | 1391 | return -EFSCORRUPTED; |
a5155b87 | 1392 | } |
1da177e4 LT |
1393 | /* |
1394 | * Mark the former data entry unused. | |
1395 | */ | |
bc85178a | 1396 | xfs_dir2_data_make_free(args, dbp, |
c2066e26 | 1397 | (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr), |
fdbb8c5b CH |
1398 | xfs_dir2_data_entsize(dp->i_mount, dep->namelen), &needlog, |
1399 | &needscan); | |
1da177e4 LT |
1400 | /* |
1401 | * We just mark the leaf entry stale by putting a null in it. | |
1402 | */ | |
24df33b4 | 1403 | leafhdr.stale++; |
163fbbb3 | 1404 | xfs_dir2_leaf_hdr_to_disk(dp->i_mount, leaf, &leafhdr); |
bc85178a | 1405 | xfs_dir3_leaf_log_header(args, lbp); |
24df33b4 | 1406 | |
3c1f9c15 | 1407 | lep->address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); |
787b0893 | 1408 | xfs_dir3_leaf_log_ents(args, &leafhdr, 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) | |
ae42976d | 1415 | xfs_dir2_data_freescan(dp->i_mount, hdr, &needlog); |
1da177e4 | 1416 | if (needlog) |
bc85178a | 1417 | xfs_dir2_data_log_header(args, 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; | |
bc85178a | 1424 | xfs_dir3_leaf_log_bests(args, 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) == |
d73e1cee CH |
1431 | geo->blksize - geo->data_entry_offset) { |
1432 | ASSERT(db != 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 | */ | |
2451337d | 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)); |
bc85178a DC |
1465 | xfs_dir3_leaf_log_tail(args, lbp); |
1466 | xfs_dir3_leaf_log_bests(args, lbp, 0, | |
1467 | be32_to_cpu(ltp->bestcount) - 1); | |
1da177e4 | 1468 | } else |
68b3a102 | 1469 | bestsp[db] = cpu_to_be16(NULLDATAOFF); |
1da177e4 LT |
1470 | } |
1471 | /* | |
1472 | * If the data block was not the first one, drop it. | |
1473 | */ | |
d73e1cee | 1474 | else if (db != geo->datablk) |
1da177e4 | 1475 | dbp = NULL; |
1d9025e5 | 1476 | |
4141956a | 1477 | xfs_dir3_leaf_check(dp, lbp); |
1da177e4 LT |
1478 | /* |
1479 | * See if we can convert to block form. | |
1480 | */ | |
1481 | return xfs_dir2_leaf_to_block(args, lbp, dbp); | |
1482 | } | |
1483 | ||
1484 | /* | |
1485 | * Replace the inode number in a leaf format directory entry. | |
1486 | */ | |
1487 | int /* error */ | |
1488 | xfs_dir2_leaf_replace( | |
1489 | xfs_da_args_t *args) /* operation arguments */ | |
1490 | { | |
1d9025e5 | 1491 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1492 | xfs_dir2_data_entry_t *dep; /* data block entry */ |
1493 | xfs_inode_t *dp; /* incore directory inode */ | |
1494 | int error; /* error return code */ | |
1495 | int index; /* index of leaf entry */ | |
1d9025e5 | 1496 | struct xfs_buf *lbp; /* leaf buffer */ |
1da177e4 LT |
1497 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ |
1498 | xfs_trans_t *tp; /* transaction pointer */ | |
787b0893 | 1499 | struct xfs_dir3_icleaf_hdr leafhdr; |
1da177e4 | 1500 | |
0b1b213f CH |
1501 | trace_xfs_dir2_leaf_replace(args); |
1502 | ||
1da177e4 LT |
1503 | /* |
1504 | * Look up the entry. | |
1505 | */ | |
787b0893 CH |
1506 | error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp, &leafhdr); |
1507 | if (error) | |
1da177e4 | 1508 | return error; |
787b0893 | 1509 | |
1da177e4 | 1510 | dp = args->dp; |
1da177e4 LT |
1511 | /* |
1512 | * Point to the leaf entry, get data address from it. | |
1513 | */ | |
787b0893 | 1514 | lep = &leafhdr.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); |
59b8b465 | 1526 | xfs_dir2_data_put_ftype(dp->i_mount, 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 */ | |
1da177e4 LT |
1548 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ |
1549 | int mid=0; /* current leaf index */ | |
24df33b4 | 1550 | struct xfs_dir3_icleaf_hdr leafhdr; |
1da177e4 | 1551 | |
787b0893 | 1552 | xfs_dir2_leaf_hdr_from_disk(args->dp->i_mount, &leafhdr, lbp->b_addr); |
24df33b4 | 1553 | |
1da177e4 LT |
1554 | /* |
1555 | * Note, the table cannot be empty, so we have to go through the loop. | |
1556 | * Binary search the leaf entries looking for our hash value. | |
1557 | */ | |
787b0893 | 1558 | for (lep = leafhdr.ents, low = 0, high = leafhdr.count - 1, |
1da177e4 LT |
1559 | hashwant = args->hashval; |
1560 | low <= high; ) { | |
1561 | mid = (low + high) >> 1; | |
3c1f9c15 | 1562 | if ((hash = be32_to_cpu(lep[mid].hashval)) == hashwant) |
1da177e4 LT |
1563 | break; |
1564 | if (hash < hashwant) | |
1565 | low = mid + 1; | |
1566 | else | |
1567 | high = mid - 1; | |
1568 | } | |
1569 | /* | |
1570 | * Found one, back up through all the equal hash values. | |
1571 | */ | |
1572 | if (hash == hashwant) { | |
3c1f9c15 | 1573 | while (mid > 0 && be32_to_cpu(lep[mid - 1].hashval) == hashwant) { |
1da177e4 LT |
1574 | mid--; |
1575 | } | |
1576 | } | |
1577 | /* | |
1578 | * Need to point to an entry higher than ours. | |
1579 | */ | |
1580 | else if (hash < hashwant) | |
1581 | mid++; | |
1582 | return mid; | |
1583 | } | |
1584 | ||
1585 | /* | |
1586 | * Trim off a trailing data block. We know it's empty since the leaf | |
1587 | * freespace table says so. | |
1588 | */ | |
1589 | int /* error */ | |
1590 | xfs_dir2_leaf_trim_data( | |
1591 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 1592 | struct xfs_buf *lbp, /* leaf buffer */ |
1da177e4 LT |
1593 | xfs_dir2_db_t db) /* data block number */ |
1594 | { | |
d73e1cee | 1595 | struct xfs_da_geometry *geo = args->geo; |
68b3a102 | 1596 | __be16 *bestsp; /* leaf bests table */ |
1d9025e5 | 1597 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1598 | xfs_inode_t *dp; /* incore directory inode */ |
1599 | int error; /* error return value */ | |
1600 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
1601 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ | |
1da177e4 LT |
1602 | xfs_trans_t *tp; /* transaction pointer */ |
1603 | ||
1604 | dp = args->dp; | |
1da177e4 LT |
1605 | tp = args->trans; |
1606 | /* | |
1607 | * Read the offending data block. We need its buffer. | |
1608 | */ | |
cd2c9f1b | 1609 | error = xfs_dir3_data_read(tp, dp, xfs_dir2_db_to_da(geo, db), 0, &dbp); |
4bb20a83 | 1610 | if (error) |
1da177e4 | 1611 | return error; |
1da177e4 | 1612 | |
1d9025e5 | 1613 | leaf = lbp->b_addr; |
d73e1cee | 1614 | ltp = xfs_dir2_leaf_tail_p(geo, leaf); |
c2066e26 CH |
1615 | |
1616 | #ifdef DEBUG | |
1617 | { | |
1d9025e5 | 1618 | struct xfs_dir2_data_hdr *hdr = dbp->b_addr; |
1848b607 CH |
1619 | struct xfs_dir2_data_free *bf = |
1620 | xfs_dir2_data_bestfree_p(dp->i_mount, hdr); | |
c2066e26 | 1621 | |
33363fee DC |
1622 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
1623 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)); | |
1624 | ASSERT(be16_to_cpu(bf[0].length) == | |
d73e1cee | 1625 | geo->blksize - geo->data_entry_offset); |
afbcb3f9 | 1626 | ASSERT(db == be32_to_cpu(ltp->bestcount) - 1); |
c2066e26 CH |
1627 | } |
1628 | #endif | |
1629 | ||
1da177e4 LT |
1630 | /* |
1631 | * Get rid of the data block. | |
1632 | */ | |
1633 | if ((error = xfs_dir2_shrink_inode(args, db, dbp))) { | |
2451337d | 1634 | ASSERT(error != -ENOSPC); |
1d9025e5 | 1635 | xfs_trans_brelse(tp, dbp); |
1da177e4 LT |
1636 | return error; |
1637 | } | |
1638 | /* | |
1639 | * Eliminate the last bests entry from the table. | |
1640 | */ | |
bbaaf538 | 1641 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
413d57c9 | 1642 | be32_add_cpu(<p->bestcount, -1); |
afbcb3f9 | 1643 | memmove(&bestsp[1], &bestsp[0], be32_to_cpu(ltp->bestcount) * sizeof(*bestsp)); |
bc85178a DC |
1644 | xfs_dir3_leaf_log_tail(args, lbp); |
1645 | xfs_dir3_leaf_log_bests(args, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); | |
1da177e4 LT |
1646 | return 0; |
1647 | } | |
1648 | ||
2282396d | 1649 | static inline size_t |
24df33b4 DC |
1650 | xfs_dir3_leaf_size( |
1651 | struct xfs_dir3_icleaf_hdr *hdr, | |
2282396d CH |
1652 | int counts) |
1653 | { | |
24df33b4 DC |
1654 | int entries; |
1655 | int hdrsize; | |
1656 | ||
1657 | entries = hdr->count - hdr->stale; | |
1658 | if (hdr->magic == XFS_DIR2_LEAF1_MAGIC || | |
1659 | hdr->magic == XFS_DIR2_LEAFN_MAGIC) | |
1660 | hdrsize = sizeof(struct xfs_dir2_leaf_hdr); | |
1661 | else | |
1662 | hdrsize = sizeof(struct xfs_dir3_leaf_hdr); | |
2282396d | 1663 | |
24df33b4 DC |
1664 | return hdrsize + entries * sizeof(xfs_dir2_leaf_entry_t) |
1665 | + counts * sizeof(xfs_dir2_data_off_t) | |
1666 | + sizeof(xfs_dir2_leaf_tail_t); | |
2282396d CH |
1667 | } |
1668 | ||
1da177e4 LT |
1669 | /* |
1670 | * Convert node form directory to leaf form directory. | |
1671 | * The root of the node form dir needs to already be a LEAFN block. | |
1672 | * Just return if we can't do anything. | |
1673 | */ | |
1674 | int /* error */ | |
1675 | xfs_dir2_node_to_leaf( | |
1676 | xfs_da_state_t *state) /* directory operation state */ | |
1677 | { | |
1678 | xfs_da_args_t *args; /* operation arguments */ | |
1679 | xfs_inode_t *dp; /* incore directory inode */ | |
1680 | int error; /* error return code */ | |
1d9025e5 | 1681 | struct xfs_buf *fbp; /* buffer for freespace block */ |
1da177e4 | 1682 | xfs_fileoff_t fo; /* freespace file offset */ |
1d9025e5 | 1683 | struct xfs_buf *lbp; /* buffer for leaf block */ |
1da177e4 LT |
1684 | xfs_dir2_leaf_tail_t *ltp; /* tail of leaf structure */ |
1685 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
1686 | xfs_mount_t *mp; /* filesystem mount point */ | |
1687 | int rval; /* successful free trim? */ | |
1688 | xfs_trans_t *tp; /* transaction pointer */ | |
24df33b4 | 1689 | struct xfs_dir3_icleaf_hdr leafhdr; |
cbc8adf8 | 1690 | struct xfs_dir3_icfree_hdr freehdr; |
1da177e4 LT |
1691 | |
1692 | /* | |
1693 | * There's more than a leaf level in the btree, so there must | |
1694 | * be multiple leafn blocks. Give up. | |
1695 | */ | |
1696 | if (state->path.active > 1) | |
1697 | return 0; | |
1698 | args = state->args; | |
0b1b213f CH |
1699 | |
1700 | trace_xfs_dir2_node_to_leaf(args); | |
1701 | ||
1da177e4 LT |
1702 | mp = state->mp; |
1703 | dp = args->dp; | |
1704 | tp = args->trans; | |
1705 | /* | |
1706 | * Get the last offset in the file. | |
1707 | */ | |
7fb2cd4d | 1708 | if ((error = xfs_bmap_last_offset(dp, &fo, XFS_DATA_FORK))) { |
1da177e4 LT |
1709 | return error; |
1710 | } | |
d6cf1305 | 1711 | fo -= args->geo->fsbcount; |
1da177e4 LT |
1712 | /* |
1713 | * If there are freespace blocks other than the first one, | |
1714 | * take this opportunity to remove trailing empty freespace blocks | |
1715 | * that may have been left behind during no-space-reservation | |
1716 | * operations. | |
1717 | */ | |
7dda6e86 | 1718 | while (fo > args->geo->freeblk) { |
1da177e4 LT |
1719 | if ((error = xfs_dir2_node_trim_free(args, fo, &rval))) { |
1720 | return error; | |
1721 | } | |
1722 | if (rval) | |
d6cf1305 | 1723 | fo -= args->geo->fsbcount; |
1da177e4 LT |
1724 | else |
1725 | return 0; | |
1726 | } | |
1727 | /* | |
1728 | * Now find the block just before the freespace block. | |
1729 | */ | |
1730 | if ((error = xfs_bmap_last_before(tp, dp, &fo, XFS_DATA_FORK))) { | |
1731 | return error; | |
1732 | } | |
1733 | /* | |
1734 | * If it's not the single leaf block, give up. | |
1735 | */ | |
8f66193c | 1736 | if (XFS_FSB_TO_B(mp, fo) > XFS_DIR2_LEAF_OFFSET + args->geo->blksize) |
1da177e4 LT |
1737 | return 0; |
1738 | lbp = state->path.blk[0].bp; | |
1d9025e5 | 1739 | leaf = lbp->b_addr; |
51842556 | 1740 | xfs_dir2_leaf_hdr_from_disk(mp, &leafhdr, leaf); |
24df33b4 DC |
1741 | |
1742 | ASSERT(leafhdr.magic == XFS_DIR2_LEAFN_MAGIC || | |
1743 | leafhdr.magic == XFS_DIR3_LEAFN_MAGIC); | |
1744 | ||
1da177e4 LT |
1745 | /* |
1746 | * Read the freespace block. | |
1747 | */ | |
7dda6e86 | 1748 | error = xfs_dir2_free_read(tp, dp, args->geo->freeblk, &fbp); |
4bb20a83 | 1749 | if (error) |
1da177e4 | 1750 | return error; |
a84f3d5c | 1751 | xfs_dir2_free_hdr_from_disk(mp, &freehdr, fbp->b_addr); |
cbc8adf8 DC |
1752 | |
1753 | ASSERT(!freehdr.firstdb); | |
2282396d | 1754 | |
1da177e4 LT |
1755 | /* |
1756 | * Now see if the leafn and free data will fit in a leaf1. | |
1757 | * If not, release the buffer and give up. | |
1758 | */ | |
8f66193c | 1759 | if (xfs_dir3_leaf_size(&leafhdr, freehdr.nvalid) > args->geo->blksize) { |
1d9025e5 | 1760 | xfs_trans_brelse(tp, fbp); |
1da177e4 LT |
1761 | return 0; |
1762 | } | |
2282396d | 1763 | |
1da177e4 LT |
1764 | /* |
1765 | * If the leaf has any stale entries in it, compress them out. | |
1da177e4 | 1766 | */ |
24df33b4 DC |
1767 | if (leafhdr.stale) |
1768 | xfs_dir3_leaf_compact(args, &leafhdr, lbp); | |
b0f539de | 1769 | |
24df33b4 | 1770 | lbp->b_ops = &xfs_dir3_leaf1_buf_ops; |
61fe135c | 1771 | xfs_trans_buf_set_type(tp, lbp, XFS_BLFT_DIR_LEAF1_BUF); |
24df33b4 DC |
1772 | leafhdr.magic = (leafhdr.magic == XFS_DIR2_LEAFN_MAGIC) |
1773 | ? XFS_DIR2_LEAF1_MAGIC | |
1774 | : XFS_DIR3_LEAF1_MAGIC; | |
b0f539de | 1775 | |
1da177e4 LT |
1776 | /* |
1777 | * Set up the leaf tail from the freespace block. | |
1778 | */ | |
8f66193c | 1779 | ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); |
cbc8adf8 | 1780 | ltp->bestcount = cpu_to_be32(freehdr.nvalid); |
24df33b4 | 1781 | |
1da177e4 LT |
1782 | /* |
1783 | * Set up the leaf bests table. | |
1784 | */ | |
a84f3d5c | 1785 | memcpy(xfs_dir2_leaf_bests_p(ltp), freehdr.bests, |
cbc8adf8 | 1786 | freehdr.nvalid * sizeof(xfs_dir2_data_off_t)); |
24df33b4 | 1787 | |
163fbbb3 | 1788 | xfs_dir2_leaf_hdr_to_disk(mp, leaf, &leafhdr); |
bc85178a DC |
1789 | xfs_dir3_leaf_log_header(args, lbp); |
1790 | xfs_dir3_leaf_log_bests(args, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); | |
1791 | xfs_dir3_leaf_log_tail(args, lbp); | |
4141956a | 1792 | xfs_dir3_leaf_check(dp, lbp); |
24df33b4 | 1793 | |
1da177e4 LT |
1794 | /* |
1795 | * Get rid of the freespace block. | |
1796 | */ | |
8c44a285 | 1797 | error = xfs_dir2_shrink_inode(args, |
30028030 DC |
1798 | xfs_dir2_byte_to_db(args->geo, XFS_DIR2_FREE_OFFSET), |
1799 | fbp); | |
1da177e4 LT |
1800 | if (error) { |
1801 | /* | |
1802 | * This can't fail here because it can only happen when | |
1803 | * punching out the middle of an extent, and this is an | |
1804 | * isolated block. | |
1805 | */ | |
2451337d | 1806 | ASSERT(error != -ENOSPC); |
1da177e4 LT |
1807 | return error; |
1808 | } | |
1809 | fbp = NULL; | |
1810 | /* | |
1811 | * Now see if we can convert the single-leaf directory | |
1812 | * down to a block form directory. | |
1813 | * This routine always kills the dabuf for the leaf, so | |
1814 | * eliminate it from the path. | |
1815 | */ | |
1816 | error = xfs_dir2_leaf_to_block(args, lbp, NULL); | |
1817 | state->path.blk[0].bp = NULL; | |
1818 | return error; | |
1819 | } |