]>
Commit | Line | Data |
---|---|---|
37b3b4d6 | 1 | // SPDX-License-Identifier: GPL-2.0 |
2bd0ea18 | 2 | /* |
5e656dbb | 3 | * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc. |
693fc8f6 | 4 | * Copyright (c) 2013 Red Hat, Inc. |
da23017d | 5 | * All Rights Reserved. |
2bd0ea18 | 6 | */ |
9c799827 | 7 | #include "libxfs_priv.h" |
b626fb59 DC |
8 | #include "xfs_fs.h" |
9 | #include "xfs_format.h" | |
10 | #include "xfs_log_format.h" | |
11 | #include "xfs_trans_resv.h" | |
12 | #include "xfs_mount.h" | |
13 | #include "xfs_da_format.h" | |
14 | #include "xfs_da_btree.h" | |
15 | #include "xfs_inode.h" | |
16 | #include "xfs_trans.h" | |
17 | #include "xfs_bmap.h" | |
18 | #include "xfs_dir2.h" | |
19 | #include "xfs_dir2_priv.h" | |
20 | #include "xfs_trace.h" | |
21 | #include "xfs_cksum.h" | |
5e656dbb | 22 | |
2bd0ea18 | 23 | /* |
5e656dbb | 24 | * Local function prototypes. |
2bd0ea18 | 25 | */ |
a2ceac1f DC |
26 | static void xfs_dir2_block_log_leaf(xfs_trans_t *tp, struct xfs_buf *bp, |
27 | int first, int last); | |
28 | static void xfs_dir2_block_log_tail(xfs_trans_t *tp, struct xfs_buf *bp); | |
29 | static int xfs_dir2_block_lookup_int(xfs_da_args_t *args, struct xfs_buf **bpp, | |
5e656dbb BN |
30 | int *entno); |
31 | static int xfs_dir2_block_sort(const void *a, const void *b); | |
2bd0ea18 | 32 | |
5e656dbb BN |
33 | static xfs_dahash_t xfs_dir_hash_dot, xfs_dir_hash_dotdot; |
34 | ||
35 | /* | |
36 | * One-time startup routine called from xfs_init(). | |
37 | */ | |
38 | void | |
39 | xfs_dir_startup(void) | |
40 | { | |
56b2de80 DC |
41 | xfs_dir_hash_dot = xfs_da_hashname((unsigned char *)".", 1); |
42 | xfs_dir_hash_dotdot = xfs_da_hashname((unsigned char *)"..", 2); | |
5e656dbb | 43 | } |
2bd0ea18 | 44 | |
bc01119d | 45 | static xfs_failaddr_t |
693fc8f6 | 46 | xfs_dir3_block_verify( |
a2ceac1f DC |
47 | struct xfs_buf *bp) |
48 | { | |
49 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
693fc8f6 DC |
50 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; |
51 | ||
52 | if (xfs_sb_version_hascrc(&mp->m_sb)) { | |
53 | if (hdr3->magic != cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)) | |
bc01119d | 54 | return __this_address; |
9c4e12fb | 55 | if (!uuid_equal(&hdr3->uuid, &mp->m_sb.sb_meta_uuid)) |
bc01119d | 56 | return __this_address; |
693fc8f6 | 57 | if (be64_to_cpu(hdr3->blkno) != bp->b_bn) |
bc01119d | 58 | return __this_address; |
a65d8d29 | 59 | if (!xfs_log_check_lsn(mp, be64_to_cpu(hdr3->lsn))) |
bc01119d | 60 | return __this_address; |
693fc8f6 DC |
61 | } else { |
62 | if (hdr3->magic != cpu_to_be32(XFS_DIR2_BLOCK_MAGIC)) | |
bc01119d | 63 | return __this_address; |
a2ceac1f | 64 | } |
a7e32f0d | 65 | return __xfs_dir3_data_check(NULL, bp); |
a2ceac1f DC |
66 | } |
67 | ||
68 | static void | |
693fc8f6 | 69 | xfs_dir3_block_read_verify( |
a2ceac1f DC |
70 | struct xfs_buf *bp) |
71 | { | |
693fc8f6 | 72 | struct xfs_mount *mp = bp->b_target->bt_mount; |
1e697959 | 73 | xfs_failaddr_t fa; |
693fc8f6 | 74 | |
45922933 DC |
75 | if (xfs_sb_version_hascrc(&mp->m_sb) && |
76 | !xfs_buf_verify_cksum(bp, XFS_DIR3_DATA_CRC_OFF)) | |
1e697959 DW |
77 | xfs_verifier_error(bp, -EFSBADCRC, __this_address); |
78 | else { | |
79 | fa = xfs_dir3_block_verify(bp); | |
80 | if (fa) | |
81 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
82 | } | |
a2ceac1f DC |
83 | } |
84 | ||
85 | static void | |
693fc8f6 | 86 | xfs_dir3_block_write_verify( |
a2ceac1f DC |
87 | struct xfs_buf *bp) |
88 | { | |
693fc8f6 | 89 | struct xfs_mount *mp = bp->b_target->bt_mount; |
37d086ca | 90 | struct xfs_buf_log_item *bip = bp->b_log_item; |
693fc8f6 | 91 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; |
1e697959 | 92 | xfs_failaddr_t fa; |
693fc8f6 | 93 | |
1e697959 DW |
94 | fa = xfs_dir3_block_verify(bp); |
95 | if (fa) { | |
96 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
693fc8f6 DC |
97 | return; |
98 | } | |
99 | ||
100 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
101 | return; | |
102 | ||
103 | if (bip) | |
104 | hdr3->lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
105 | ||
43b5aeed | 106 | xfs_buf_update_cksum(bp, XFS_DIR3_DATA_CRC_OFF); |
a2ceac1f DC |
107 | } |
108 | ||
693fc8f6 | 109 | const struct xfs_buf_ops xfs_dir3_block_buf_ops = { |
a3fac935 | 110 | .name = "xfs_dir3_block", |
693fc8f6 DC |
111 | .verify_read = xfs_dir3_block_read_verify, |
112 | .verify_write = xfs_dir3_block_write_verify, | |
95d9582b | 113 | .verify_struct = xfs_dir3_block_verify, |
a2ceac1f DC |
114 | }; |
115 | ||
494434d7 | 116 | int |
693fc8f6 | 117 | xfs_dir3_block_read( |
a2ceac1f DC |
118 | struct xfs_trans *tp, |
119 | struct xfs_inode *dp, | |
120 | struct xfs_buf **bpp) | |
121 | { | |
122 | struct xfs_mount *mp = dp->i_mount; | |
8b4dc4a9 | 123 | int err; |
a2ceac1f | 124 | |
ff105f75 | 125 | err = xfs_da_read_buf(tp, dp, mp->m_dir_geo->datablk, -1, bpp, |
693fc8f6 | 126 | XFS_DATA_FORK, &xfs_dir3_block_buf_ops); |
a6c6b1bd | 127 | if (!err && tp && *bpp) |
bdc16ee5 | 128 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_BLOCK_BUF); |
8b4dc4a9 | 129 | return err; |
693fc8f6 DC |
130 | } |
131 | ||
132 | static void | |
133 | xfs_dir3_block_init( | |
134 | struct xfs_mount *mp, | |
8b4dc4a9 | 135 | struct xfs_trans *tp, |
693fc8f6 DC |
136 | struct xfs_buf *bp, |
137 | struct xfs_inode *dp) | |
138 | { | |
139 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; | |
140 | ||
141 | bp->b_ops = &xfs_dir3_block_buf_ops; | |
bdc16ee5 | 142 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_BLOCK_BUF); |
693fc8f6 DC |
143 | |
144 | if (xfs_sb_version_hascrc(&mp->m_sb)) { | |
145 | memset(hdr3, 0, sizeof(*hdr3)); | |
146 | hdr3->magic = cpu_to_be32(XFS_DIR3_BLOCK_MAGIC); | |
147 | hdr3->blkno = cpu_to_be64(bp->b_bn); | |
148 | hdr3->owner = cpu_to_be64(dp->i_ino); | |
9c4e12fb | 149 | uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); |
693fc8f6 DC |
150 | return; |
151 | ||
152 | } | |
153 | hdr3->magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC); | |
a2ceac1f DC |
154 | } |
155 | ||
156 | static void | |
157 | xfs_dir2_block_need_space( | |
ff105f75 | 158 | struct xfs_inode *dp, |
a2ceac1f DC |
159 | struct xfs_dir2_data_hdr *hdr, |
160 | struct xfs_dir2_block_tail *btp, | |
161 | struct xfs_dir2_leaf_entry *blp, | |
162 | __be16 **tagpp, | |
163 | struct xfs_dir2_data_unused **dupp, | |
164 | struct xfs_dir2_data_unused **enddupp, | |
165 | int *compact, | |
166 | int len) | |
167 | { | |
168 | struct xfs_dir2_data_free *bf; | |
169 | __be16 *tagp = NULL; | |
170 | struct xfs_dir2_data_unused *dup = NULL; | |
171 | struct xfs_dir2_data_unused *enddup = NULL; | |
172 | ||
173 | *compact = 0; | |
ff105f75 | 174 | bf = dp->d_ops->data_bestfree_p(hdr); |
a2ceac1f DC |
175 | |
176 | /* | |
177 | * If there are stale entries we'll use one for the leaf. | |
178 | */ | |
179 | if (btp->stale) { | |
180 | if (be16_to_cpu(bf[0].length) >= len) { | |
181 | /* | |
182 | * The biggest entry enough to avoid compaction. | |
183 | */ | |
184 | dup = (xfs_dir2_data_unused_t *) | |
185 | ((char *)hdr + be16_to_cpu(bf[0].offset)); | |
186 | goto out; | |
187 | } | |
188 | ||
189 | /* | |
190 | * Will need to compact to make this work. | |
191 | * Tag just before the first leaf entry. | |
192 | */ | |
193 | *compact = 1; | |
194 | tagp = (__be16 *)blp - 1; | |
195 | ||
196 | /* Data object just before the first leaf entry. */ | |
197 | dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); | |
198 | ||
199 | /* | |
200 | * If it's not free then the data will go where the | |
201 | * leaf data starts now, if it works at all. | |
202 | */ | |
203 | if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { | |
204 | if (be16_to_cpu(dup->length) + (be32_to_cpu(btp->stale) - 1) * | |
205 | (uint)sizeof(*blp) < len) | |
206 | dup = NULL; | |
207 | } else if ((be32_to_cpu(btp->stale) - 1) * (uint)sizeof(*blp) < len) | |
208 | dup = NULL; | |
209 | else | |
210 | dup = (xfs_dir2_data_unused_t *)blp; | |
211 | goto out; | |
212 | } | |
213 | ||
214 | /* | |
215 | * no stale entries, so just use free space. | |
216 | * Tag just before the first leaf entry. | |
217 | */ | |
218 | tagp = (__be16 *)blp - 1; | |
219 | ||
220 | /* Data object just before the first leaf entry. */ | |
221 | enddup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); | |
222 | ||
223 | /* | |
224 | * If it's not free then can't do this add without cleaning up: | |
225 | * the space before the first leaf entry needs to be free so it | |
226 | * can be expanded to hold the pointer to the new entry. | |
227 | */ | |
228 | if (be16_to_cpu(enddup->freetag) == XFS_DIR2_DATA_FREE_TAG) { | |
229 | /* | |
230 | * Check out the biggest freespace and see if it's the same one. | |
231 | */ | |
232 | dup = (xfs_dir2_data_unused_t *) | |
233 | ((char *)hdr + be16_to_cpu(bf[0].offset)); | |
234 | if (dup != enddup) { | |
235 | /* | |
236 | * Not the same free entry, just check its length. | |
237 | */ | |
238 | if (be16_to_cpu(dup->length) < len) | |
239 | dup = NULL; | |
240 | goto out; | |
241 | } | |
242 | ||
243 | /* | |
244 | * It is the biggest freespace, can it hold the leaf too? | |
245 | */ | |
246 | if (be16_to_cpu(dup->length) < len + (uint)sizeof(*blp)) { | |
247 | /* | |
248 | * Yes, use the second-largest entry instead if it works. | |
249 | */ | |
250 | if (be16_to_cpu(bf[1].length) >= len) | |
251 | dup = (xfs_dir2_data_unused_t *) | |
252 | ((char *)hdr + be16_to_cpu(bf[1].offset)); | |
253 | else | |
254 | dup = NULL; | |
255 | } | |
256 | } | |
257 | out: | |
258 | *tagpp = tagp; | |
259 | *dupp = dup; | |
260 | *enddupp = enddup; | |
261 | } | |
262 | ||
263 | /* | |
264 | * compact the leaf entries. | |
265 | * Leave the highest-numbered stale entry stale. | |
266 | * XXX should be the one closest to mid but mid is not yet computed. | |
267 | */ | |
268 | static void | |
269 | xfs_dir2_block_compact( | |
ff105f75 | 270 | struct xfs_da_args *args, |
a2ceac1f DC |
271 | struct xfs_buf *bp, |
272 | struct xfs_dir2_data_hdr *hdr, | |
273 | struct xfs_dir2_block_tail *btp, | |
274 | struct xfs_dir2_leaf_entry *blp, | |
275 | int *needlog, | |
276 | int *lfloghigh, | |
277 | int *lfloglow) | |
278 | { | |
279 | int fromidx; /* source leaf index */ | |
280 | int toidx; /* target leaf index */ | |
281 | int needscan = 0; | |
282 | int highstale; /* high stale index */ | |
283 | ||
284 | fromidx = toidx = be32_to_cpu(btp->count) - 1; | |
285 | highstale = *lfloghigh = -1; | |
286 | for (; fromidx >= 0; fromidx--) { | |
287 | if (blp[fromidx].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) { | |
288 | if (highstale == -1) | |
289 | highstale = toidx; | |
290 | else { | |
291 | if (*lfloghigh == -1) | |
292 | *lfloghigh = toidx; | |
293 | continue; | |
294 | } | |
295 | } | |
296 | if (fromidx < toidx) | |
297 | blp[toidx] = blp[fromidx]; | |
298 | toidx--; | |
299 | } | |
300 | *lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1); | |
301 | *lfloghigh -= be32_to_cpu(btp->stale) - 1; | |
302 | be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1)); | |
ff105f75 | 303 | xfs_dir2_data_make_free(args, bp, |
a2ceac1f DC |
304 | (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr), |
305 | (xfs_dir2_data_aoff_t)((be32_to_cpu(btp->stale) - 1) * sizeof(*blp)), | |
306 | needlog, &needscan); | |
a2ceac1f DC |
307 | btp->stale = cpu_to_be32(1); |
308 | /* | |
309 | * If we now need to rebuild the bestfree map, do so. | |
310 | * This needs to happen before the next call to use_free. | |
311 | */ | |
312 | if (needscan) | |
19ebedcf | 313 | xfs_dir2_data_freescan(args->dp, hdr, needlog); |
a2ceac1f DC |
314 | } |
315 | ||
2bd0ea18 NS |
316 | /* |
317 | * Add an entry to a block directory. | |
318 | */ | |
319 | int /* error */ | |
320 | xfs_dir2_block_addname( | |
321 | xfs_da_args_t *args) /* directory op arguments */ | |
322 | { | |
a2ceac1f | 323 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 324 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 325 | struct xfs_buf *bp; /* buffer for block */ |
2bd0ea18 NS |
326 | xfs_dir2_block_tail_t *btp; /* block tail */ |
327 | int compact; /* need to compact leaf ents */ | |
328 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
329 | xfs_inode_t *dp; /* directory inode */ | |
330 | xfs_dir2_data_unused_t *dup; /* block unused entry */ | |
331 | int error; /* error return value */ | |
0e266570 | 332 | xfs_dir2_data_unused_t *enddup=NULL; /* unused at end of data */ |
2bd0ea18 NS |
333 | xfs_dahash_t hash; /* hash value of found entry */ |
334 | int high; /* high index for binary srch */ | |
335 | int highstale; /* high stale index */ | |
0e266570 NS |
336 | int lfloghigh=0; /* last final leaf to log */ |
337 | int lfloglow=0; /* first final leaf to log */ | |
2bd0ea18 NS |
338 | int len; /* length of the new entry */ |
339 | int low; /* low index for binary srch */ | |
340 | int lowstale; /* low stale index */ | |
0e266570 | 341 | int mid=0; /* midpoint for binary srch */ |
2bd0ea18 NS |
342 | int needlog; /* need to log header */ |
343 | int needscan; /* need to rescan freespace */ | |
5e656dbb | 344 | __be16 *tagp; /* pointer to tag value */ |
2bd0ea18 NS |
345 | xfs_trans_t *tp; /* transaction structure */ |
346 | ||
56b2de80 DC |
347 | trace_xfs_dir2_block_addname(args); |
348 | ||
2bd0ea18 NS |
349 | dp = args->dp; |
350 | tp = args->trans; | |
a2ceac1f DC |
351 | |
352 | /* Read the (one and only) directory block into bp. */ | |
693fc8f6 | 353 | error = xfs_dir3_block_read(tp, dp, &bp); |
a2ceac1f | 354 | if (error) |
2bd0ea18 | 355 | return error; |
a2ceac1f | 356 | |
ff105f75 | 357 | len = dp->d_ops->data_entsize(args->namelen); |
a2ceac1f | 358 | |
2bd0ea18 NS |
359 | /* |
360 | * Set up pointers to parts of the block. | |
361 | */ | |
a2ceac1f | 362 | hdr = bp->b_addr; |
ff105f75 | 363 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 364 | blp = xfs_dir2_block_leaf_p(btp); |
a2ceac1f | 365 | |
2bd0ea18 | 366 | /* |
a2ceac1f DC |
367 | * Find out if we can reuse stale entries or whether we need extra |
368 | * space for entry and new leaf. | |
2bd0ea18 | 369 | */ |
ff105f75 | 370 | xfs_dir2_block_need_space(dp, hdr, btp, blp, &tagp, &dup, |
a2ceac1f DC |
371 | &enddup, &compact, len); |
372 | ||
2bd0ea18 | 373 | /* |
a2ceac1f | 374 | * Done everything we need for a space check now. |
2bd0ea18 | 375 | */ |
a2ceac1f DC |
376 | if (args->op_flags & XFS_DA_OP_JUSTCHECK) { |
377 | xfs_trans_brelse(tp, bp); | |
378 | if (!dup) | |
12b53197 | 379 | return -ENOSPC; |
a2ceac1f | 380 | return 0; |
2bd0ea18 | 381 | } |
a2ceac1f | 382 | |
2bd0ea18 NS |
383 | /* |
384 | * If we don't have space for the new entry & leaf ... | |
385 | */ | |
386 | if (!dup) { | |
a2ceac1f DC |
387 | /* Don't have a space reservation: return no-space. */ |
388 | if (args->total == 0) | |
12b53197 | 389 | return -ENOSPC; |
2bd0ea18 NS |
390 | /* |
391 | * Convert to the next larger format. | |
392 | * Then add the new entry in that format. | |
393 | */ | |
394 | error = xfs_dir2_block_to_leaf(args, bp); | |
2bd0ea18 NS |
395 | if (error) |
396 | return error; | |
397 | return xfs_dir2_leaf_addname(args); | |
398 | } | |
a2ceac1f | 399 | |
2bd0ea18 | 400 | needlog = needscan = 0; |
a2ceac1f | 401 | |
2bd0ea18 NS |
402 | /* |
403 | * If need to compact the leaf entries, do it now. | |
2bd0ea18 | 404 | */ |
49f693fa | 405 | if (compact) { |
ff105f75 | 406 | xfs_dir2_block_compact(args, bp, hdr, btp, blp, &needlog, |
a2ceac1f | 407 | &lfloghigh, &lfloglow); |
49f693fa DC |
408 | /* recalculate blp post-compaction */ |
409 | blp = xfs_dir2_block_leaf_p(btp); | |
410 | } else if (btp->stale) { | |
2bd0ea18 | 411 | /* |
a2ceac1f DC |
412 | * Set leaf logging boundaries to impossible state. |
413 | * For the no-stale case they're set explicitly. | |
2bd0ea18 | 414 | */ |
5e656dbb | 415 | lfloglow = be32_to_cpu(btp->count); |
2bd0ea18 NS |
416 | lfloghigh = -1; |
417 | } | |
a2ceac1f | 418 | |
2bd0ea18 NS |
419 | /* |
420 | * Find the slot that's first lower than our hash value, -1 if none. | |
421 | */ | |
5e656dbb | 422 | for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { |
2bd0ea18 | 423 | mid = (low + high) >> 1; |
5e656dbb | 424 | if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) |
2bd0ea18 NS |
425 | break; |
426 | if (hash < args->hashval) | |
427 | low = mid + 1; | |
428 | else | |
429 | high = mid - 1; | |
430 | } | |
5e656dbb | 431 | while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) { |
2bd0ea18 NS |
432 | mid--; |
433 | } | |
434 | /* | |
435 | * No stale entries, will use enddup space to hold new leaf. | |
436 | */ | |
46eca962 | 437 | if (!btp->stale) { |
15348e04 DW |
438 | xfs_dir2_data_aoff_t aoff; |
439 | ||
2bd0ea18 NS |
440 | /* |
441 | * Mark the space needed for the new leaf entry, now in use. | |
442 | */ | |
15348e04 DW |
443 | aoff = (xfs_dir2_data_aoff_t)((char *)enddup - (char *)hdr + |
444 | be16_to_cpu(enddup->length) - sizeof(*blp)); | |
445 | error = xfs_dir2_data_use_free(args, bp, enddup, aoff, | |
446 | (xfs_dir2_data_aoff_t)sizeof(*blp), &needlog, | |
447 | &needscan); | |
448 | if (error) | |
449 | return error; | |
450 | ||
2bd0ea18 NS |
451 | /* |
452 | * Update the tail (entry count). | |
453 | */ | |
5e656dbb | 454 | be32_add_cpu(&btp->count, 1); |
2bd0ea18 NS |
455 | /* |
456 | * If we now need to rebuild the bestfree map, do so. | |
457 | * This needs to happen before the next call to use_free. | |
458 | */ | |
459 | if (needscan) { | |
19ebedcf | 460 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
2bd0ea18 NS |
461 | needscan = 0; |
462 | } | |
463 | /* | |
464 | * Adjust pointer to the first leaf entry, we're about to move | |
465 | * the table up one to open up space for the new leaf entry. | |
466 | * Then adjust our index to match. | |
467 | */ | |
468 | blp--; | |
469 | mid++; | |
470 | if (mid) | |
32181a02 | 471 | memmove(blp, &blp[1], mid * sizeof(*blp)); |
2bd0ea18 NS |
472 | lfloglow = 0; |
473 | lfloghigh = mid; | |
474 | } | |
475 | /* | |
476 | * Use a stale leaf for our new entry. | |
477 | */ | |
478 | else { | |
479 | for (lowstale = mid; | |
480 | lowstale >= 0 && | |
a2ceac1f DC |
481 | blp[lowstale].address != |
482 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR); | |
2bd0ea18 NS |
483 | lowstale--) |
484 | continue; | |
485 | for (highstale = mid + 1; | |
5e656dbb | 486 | highstale < be32_to_cpu(btp->count) && |
a2ceac1f DC |
487 | blp[highstale].address != |
488 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR) && | |
2bd0ea18 NS |
489 | (lowstale < 0 || mid - lowstale > highstale - mid); |
490 | highstale++) | |
491 | continue; | |
492 | /* | |
493 | * Move entries toward the low-numbered stale entry. | |
494 | */ | |
495 | if (lowstale >= 0 && | |
5e656dbb | 496 | (highstale == be32_to_cpu(btp->count) || |
2bd0ea18 NS |
497 | mid - lowstale <= highstale - mid)) { |
498 | if (mid - lowstale) | |
32181a02 | 499 | memmove(&blp[lowstale], &blp[lowstale + 1], |
2bd0ea18 | 500 | (mid - lowstale) * sizeof(*blp)); |
d7ff12b8 DC |
501 | lfloglow = min(lowstale, lfloglow); |
502 | lfloghigh = max(mid, lfloghigh); | |
2bd0ea18 NS |
503 | } |
504 | /* | |
505 | * Move entries toward the high-numbered stale entry. | |
506 | */ | |
507 | else { | |
5e656dbb | 508 | ASSERT(highstale < be32_to_cpu(btp->count)); |
2bd0ea18 NS |
509 | mid++; |
510 | if (highstale - mid) | |
32181a02 | 511 | memmove(&blp[mid + 1], &blp[mid], |
2bd0ea18 | 512 | (highstale - mid) * sizeof(*blp)); |
d7ff12b8 DC |
513 | lfloglow = min(mid, lfloglow); |
514 | lfloghigh = max(highstale, lfloghigh); | |
2bd0ea18 | 515 | } |
5e656dbb | 516 | be32_add_cpu(&btp->stale, -1); |
2bd0ea18 NS |
517 | } |
518 | /* | |
519 | * Point to the new data entry. | |
520 | */ | |
521 | dep = (xfs_dir2_data_entry_t *)dup; | |
522 | /* | |
523 | * Fill in the leaf entry. | |
524 | */ | |
5e656dbb | 525 | blp[mid].hashval = cpu_to_be32(args->hashval); |
ff105f75 | 526 | blp[mid].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( |
a2ceac1f | 527 | (char *)dep - (char *)hdr)); |
2bd0ea18 NS |
528 | xfs_dir2_block_log_leaf(tp, bp, lfloglow, lfloghigh); |
529 | /* | |
530 | * Mark space for the data entry used. | |
531 | */ | |
15348e04 DW |
532 | error = xfs_dir2_data_use_free(args, bp, dup, |
533 | (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), | |
534 | (xfs_dir2_data_aoff_t)len, &needlog, &needscan); | |
535 | if (error) | |
536 | return error; | |
2bd0ea18 NS |
537 | /* |
538 | * Create the new data entry. | |
539 | */ | |
5e656dbb | 540 | dep->inumber = cpu_to_be64(args->inumber); |
2bd0ea18 | 541 | dep->namelen = args->namelen; |
32181a02 | 542 | memcpy(dep->name, args->name, args->namelen); |
ff105f75 DC |
543 | dp->d_ops->data_put_ftype(dep, args->filetype); |
544 | tagp = dp->d_ops->data_entry_tag_p(dep); | |
a2ceac1f | 545 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
2bd0ea18 NS |
546 | /* |
547 | * Clean up the bestfree array and log the header, tail, and entry. | |
548 | */ | |
549 | if (needscan) | |
19ebedcf | 550 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
2bd0ea18 | 551 | if (needlog) |
ff105f75 | 552 | xfs_dir2_data_log_header(args, bp); |
2bd0ea18 | 553 | xfs_dir2_block_log_tail(tp, bp); |
ff105f75 | 554 | xfs_dir2_data_log_entry(args, bp, dep); |
90ea28c3 | 555 | xfs_dir3_data_check(dp, bp); |
2bd0ea18 NS |
556 | return 0; |
557 | } | |
558 | ||
559 | /* | |
560 | * Log leaf entries from the block. | |
561 | */ | |
5e656dbb | 562 | static void |
2bd0ea18 NS |
563 | xfs_dir2_block_log_leaf( |
564 | xfs_trans_t *tp, /* transaction structure */ | |
a2ceac1f | 565 | struct xfs_buf *bp, /* block buffer */ |
2bd0ea18 NS |
566 | int first, /* index of first logged leaf */ |
567 | int last) /* index of last logged leaf */ | |
568 | { | |
a2ceac1f DC |
569 | xfs_dir2_data_hdr_t *hdr = bp->b_addr; |
570 | xfs_dir2_leaf_entry_t *blp; | |
571 | xfs_dir2_block_tail_t *btp; | |
2bd0ea18 | 572 | |
ff105f75 | 573 | btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr); |
5e656dbb | 574 | blp = xfs_dir2_block_leaf_p(btp); |
a2ceac1f DC |
575 | xfs_trans_log_buf(tp, bp, (uint)((char *)&blp[first] - (char *)hdr), |
576 | (uint)((char *)&blp[last + 1] - (char *)hdr - 1)); | |
2bd0ea18 NS |
577 | } |
578 | ||
579 | /* | |
580 | * Log the block tail. | |
581 | */ | |
5e656dbb | 582 | static void |
2bd0ea18 NS |
583 | xfs_dir2_block_log_tail( |
584 | xfs_trans_t *tp, /* transaction structure */ | |
a2ceac1f | 585 | struct xfs_buf *bp) /* block buffer */ |
2bd0ea18 | 586 | { |
a2ceac1f DC |
587 | xfs_dir2_data_hdr_t *hdr = bp->b_addr; |
588 | xfs_dir2_block_tail_t *btp; | |
2bd0ea18 | 589 | |
ff105f75 | 590 | btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr); |
a2ceac1f DC |
591 | xfs_trans_log_buf(tp, bp, (uint)((char *)btp - (char *)hdr), |
592 | (uint)((char *)(btp + 1) - (char *)hdr - 1)); | |
2bd0ea18 NS |
593 | } |
594 | ||
595 | /* | |
596 | * Look up an entry in the block. This is the external routine, | |
597 | * xfs_dir2_block_lookup_int does the real work. | |
598 | */ | |
599 | int /* error */ | |
600 | xfs_dir2_block_lookup( | |
601 | xfs_da_args_t *args) /* dir lookup arguments */ | |
602 | { | |
a2ceac1f | 603 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 604 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 605 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
606 | xfs_dir2_block_tail_t *btp; /* block tail */ |
607 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
608 | xfs_inode_t *dp; /* incore inode */ | |
609 | int ent; /* entry index */ | |
610 | int error; /* error return value */ | |
2bd0ea18 | 611 | |
56b2de80 DC |
612 | trace_xfs_dir2_block_lookup(args); |
613 | ||
2bd0ea18 NS |
614 | /* |
615 | * Get the buffer, look up the entry. | |
616 | * If not found (ENOENT) then return, have no buffer. | |
617 | */ | |
0e266570 | 618 | if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) |
2bd0ea18 NS |
619 | return error; |
620 | dp = args->dp; | |
a2ceac1f | 621 | hdr = bp->b_addr; |
90ea28c3 | 622 | xfs_dir3_data_check(dp, bp); |
ff105f75 | 623 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 624 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
625 | /* |
626 | * Get the offset from the leaf entry, to point to the data. | |
627 | */ | |
a2ceac1f | 628 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + |
ff105f75 DC |
629 | xfs_dir2_dataptr_to_off(args->geo, |
630 | be32_to_cpu(blp[ent].address))); | |
2bd0ea18 | 631 | /* |
5e656dbb | 632 | * Fill in inode number, CI name if appropriate, release the block. |
2bd0ea18 | 633 | */ |
5e656dbb | 634 | args->inumber = be64_to_cpu(dep->inumber); |
ff105f75 | 635 | args->filetype = dp->d_ops->data_get_ftype(dep); |
5e656dbb | 636 | error = xfs_dir_cilookup_result(args, dep->name, dep->namelen); |
a2ceac1f | 637 | xfs_trans_brelse(args->trans, bp); |
1e68581b | 638 | return error; |
2bd0ea18 NS |
639 | } |
640 | ||
641 | /* | |
642 | * Internal block lookup routine. | |
643 | */ | |
5e656dbb | 644 | static int /* error */ |
2bd0ea18 NS |
645 | xfs_dir2_block_lookup_int( |
646 | xfs_da_args_t *args, /* dir lookup arguments */ | |
a2ceac1f | 647 | struct xfs_buf **bpp, /* returned block buffer */ |
2bd0ea18 NS |
648 | int *entno) /* returned entry number */ |
649 | { | |
650 | xfs_dir2_dataptr_t addr; /* data entry address */ | |
a2ceac1f | 651 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 652 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 653 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
654 | xfs_dir2_block_tail_t *btp; /* block tail */ |
655 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
656 | xfs_inode_t *dp; /* incore inode */ | |
657 | int error; /* error return value */ | |
658 | xfs_dahash_t hash; /* found hash value */ | |
659 | int high; /* binary search high index */ | |
660 | int low; /* binary search low index */ | |
661 | int mid; /* binary search current idx */ | |
662 | xfs_mount_t *mp; /* filesystem mount point */ | |
663 | xfs_trans_t *tp; /* transaction pointer */ | |
5e656dbb | 664 | enum xfs_dacmp cmp; /* comparison result */ |
2bd0ea18 NS |
665 | |
666 | dp = args->dp; | |
667 | tp = args->trans; | |
668 | mp = dp->i_mount; | |
a2ceac1f | 669 | |
693fc8f6 | 670 | error = xfs_dir3_block_read(tp, dp, &bp); |
a2ceac1f | 671 | if (error) |
2bd0ea18 | 672 | return error; |
a2ceac1f DC |
673 | |
674 | hdr = bp->b_addr; | |
90ea28c3 | 675 | xfs_dir3_data_check(dp, bp); |
ff105f75 | 676 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 677 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
678 | /* |
679 | * Loop doing a binary search for our hash value. | |
680 | * Find our entry, ENOENT if it's not there. | |
681 | */ | |
5e656dbb | 682 | for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { |
2bd0ea18 NS |
683 | ASSERT(low <= high); |
684 | mid = (low + high) >> 1; | |
5e656dbb | 685 | if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) |
2bd0ea18 NS |
686 | break; |
687 | if (hash < args->hashval) | |
688 | low = mid + 1; | |
689 | else | |
690 | high = mid - 1; | |
691 | if (low > high) { | |
5e656dbb | 692 | ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); |
a2ceac1f | 693 | xfs_trans_brelse(tp, bp); |
12b53197 | 694 | return -ENOENT; |
2bd0ea18 NS |
695 | } |
696 | } | |
697 | /* | |
698 | * Back up to the first one with the right hash value. | |
699 | */ | |
5e656dbb | 700 | while (mid > 0 && be32_to_cpu(blp[mid - 1].hashval) == args->hashval) { |
2bd0ea18 NS |
701 | mid--; |
702 | } | |
703 | /* | |
704 | * Now loop forward through all the entries with the | |
705 | * right hash value looking for our name. | |
706 | */ | |
707 | do { | |
5e656dbb | 708 | if ((addr = be32_to_cpu(blp[mid].address)) == XFS_DIR2_NULL_DATAPTR) |
2bd0ea18 NS |
709 | continue; |
710 | /* | |
711 | * Get pointer to the entry from the leaf. | |
712 | */ | |
713 | dep = (xfs_dir2_data_entry_t *) | |
ff105f75 | 714 | ((char *)hdr + xfs_dir2_dataptr_to_off(args->geo, addr)); |
2bd0ea18 | 715 | /* |
5e656dbb BN |
716 | * Compare name and if it's an exact match, return the index |
717 | * and buffer. If it's the first case-insensitive match, store | |
718 | * the index and buffer and continue looking for an exact match. | |
2bd0ea18 | 719 | */ |
5e656dbb BN |
720 | cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen); |
721 | if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) { | |
722 | args->cmpresult = cmp; | |
2bd0ea18 NS |
723 | *bpp = bp; |
724 | *entno = mid; | |
5e656dbb BN |
725 | if (cmp == XFS_CMP_EXACT) |
726 | return 0; | |
2bd0ea18 | 727 | } |
5e656dbb BN |
728 | } while (++mid < be32_to_cpu(btp->count) && |
729 | be32_to_cpu(blp[mid].hashval) == hash); | |
730 | ||
731 | ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); | |
732 | /* | |
733 | * Here, we can only be doing a lookup (not a rename or replace). | |
734 | * If a case-insensitive match was found earlier, return success. | |
735 | */ | |
736 | if (args->cmpresult == XFS_CMP_CASE) | |
737 | return 0; | |
2bd0ea18 NS |
738 | /* |
739 | * No match, release the buffer and return ENOENT. | |
740 | */ | |
a2ceac1f | 741 | xfs_trans_brelse(tp, bp); |
12b53197 | 742 | return -ENOENT; |
2bd0ea18 NS |
743 | } |
744 | ||
745 | /* | |
746 | * Remove an entry from a block format directory. | |
747 | * If that makes the block small enough to fit in shortform, transform it. | |
748 | */ | |
749 | int /* error */ | |
750 | xfs_dir2_block_removename( | |
751 | xfs_da_args_t *args) /* directory operation args */ | |
752 | { | |
a2ceac1f | 753 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 754 | xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */ |
a2ceac1f | 755 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
756 | xfs_dir2_block_tail_t *btp; /* block tail */ |
757 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
758 | xfs_inode_t *dp; /* incore inode */ | |
759 | int ent; /* block leaf entry index */ | |
760 | int error; /* error return value */ | |
2bd0ea18 NS |
761 | int needlog; /* need to log block header */ |
762 | int needscan; /* need to fixup bestfree */ | |
763 | xfs_dir2_sf_hdr_t sfh; /* shortform header */ | |
764 | int size; /* shortform size */ | |
765 | xfs_trans_t *tp; /* transaction pointer */ | |
766 | ||
56b2de80 DC |
767 | trace_xfs_dir2_block_removename(args); |
768 | ||
2bd0ea18 NS |
769 | /* |
770 | * Look up the entry in the block. Gets the buffer and entry index. | |
771 | * It will always be there, the vnodeops level does a lookup first. | |
772 | */ | |
0e266570 | 773 | if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { |
2bd0ea18 NS |
774 | return error; |
775 | } | |
776 | dp = args->dp; | |
777 | tp = args->trans; | |
a2ceac1f | 778 | hdr = bp->b_addr; |
ff105f75 | 779 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 780 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
781 | /* |
782 | * Point to the data entry using the leaf entry. | |
783 | */ | |
ff105f75 DC |
784 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + |
785 | xfs_dir2_dataptr_to_off(args->geo, | |
786 | be32_to_cpu(blp[ent].address))); | |
2bd0ea18 NS |
787 | /* |
788 | * Mark the data entry's space free. | |
789 | */ | |
790 | needlog = needscan = 0; | |
ff105f75 | 791 | xfs_dir2_data_make_free(args, bp, |
a2ceac1f | 792 | (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr), |
ff105f75 | 793 | dp->d_ops->data_entsize(dep->namelen), &needlog, &needscan); |
2bd0ea18 NS |
794 | /* |
795 | * Fix up the block tail. | |
796 | */ | |
5e656dbb | 797 | be32_add_cpu(&btp->stale, 1); |
2bd0ea18 NS |
798 | xfs_dir2_block_log_tail(tp, bp); |
799 | /* | |
800 | * Remove the leaf entry by marking it stale. | |
801 | */ | |
5e656dbb | 802 | blp[ent].address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); |
2bd0ea18 NS |
803 | xfs_dir2_block_log_leaf(tp, bp, ent, ent); |
804 | /* | |
805 | * Fix up bestfree, log the header if necessary. | |
806 | */ | |
807 | if (needscan) | |
19ebedcf | 808 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
2bd0ea18 | 809 | if (needlog) |
ff105f75 | 810 | xfs_dir2_data_log_header(args, bp); |
90ea28c3 | 811 | xfs_dir3_data_check(dp, bp); |
2bd0ea18 NS |
812 | /* |
813 | * See if the size as a shortform is good enough. | |
814 | */ | |
a2ceac1f DC |
815 | size = xfs_dir2_block_sfsize(dp, hdr, &sfh); |
816 | if (size > XFS_IFORK_DSIZE(dp)) | |
2bd0ea18 | 817 | return 0; |
a2ceac1f | 818 | |
2bd0ea18 NS |
819 | /* |
820 | * If it works, do the conversion. | |
821 | */ | |
822 | return xfs_dir2_block_to_sf(args, bp, size, &sfh); | |
823 | } | |
824 | ||
825 | /* | |
826 | * Replace an entry in a V2 block directory. | |
827 | * Change the inode number to the new value. | |
828 | */ | |
829 | int /* error */ | |
830 | xfs_dir2_block_replace( | |
831 | xfs_da_args_t *args) /* directory operation args */ | |
832 | { | |
a2ceac1f | 833 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 834 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 835 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
836 | xfs_dir2_block_tail_t *btp; /* block tail */ |
837 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
838 | xfs_inode_t *dp; /* incore inode */ | |
839 | int ent; /* leaf entry index */ | |
840 | int error; /* error return value */ | |
2bd0ea18 | 841 | |
56b2de80 DC |
842 | trace_xfs_dir2_block_replace(args); |
843 | ||
2bd0ea18 NS |
844 | /* |
845 | * Lookup the entry in the directory. Get buffer and entry index. | |
846 | * This will always succeed since the caller has already done a lookup. | |
847 | */ | |
0e266570 | 848 | if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { |
2bd0ea18 NS |
849 | return error; |
850 | } | |
851 | dp = args->dp; | |
a2ceac1f | 852 | hdr = bp->b_addr; |
ff105f75 | 853 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 854 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
855 | /* |
856 | * Point to the data entry we need to change. | |
857 | */ | |
ff105f75 DC |
858 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + |
859 | xfs_dir2_dataptr_to_off(args->geo, | |
860 | be32_to_cpu(blp[ent].address))); | |
5e656dbb | 861 | ASSERT(be64_to_cpu(dep->inumber) != args->inumber); |
2bd0ea18 NS |
862 | /* |
863 | * Change the inode number to the new value. | |
864 | */ | |
5e656dbb | 865 | dep->inumber = cpu_to_be64(args->inumber); |
ff105f75 DC |
866 | dp->d_ops->data_put_ftype(dep, args->filetype); |
867 | xfs_dir2_data_log_entry(args, bp, dep); | |
90ea28c3 | 868 | xfs_dir3_data_check(dp, bp); |
2bd0ea18 NS |
869 | return 0; |
870 | } | |
871 | ||
872 | /* | |
873 | * Qsort comparison routine for the block leaf entries. | |
874 | */ | |
875 | static int /* sort order */ | |
876 | xfs_dir2_block_sort( | |
877 | const void *a, /* first leaf entry */ | |
878 | const void *b) /* second leaf entry */ | |
879 | { | |
880 | const xfs_dir2_leaf_entry_t *la; /* first leaf entry */ | |
881 | const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */ | |
882 | ||
883 | la = a; | |
884 | lb = b; | |
5e656dbb BN |
885 | return be32_to_cpu(la->hashval) < be32_to_cpu(lb->hashval) ? -1 : |
886 | (be32_to_cpu(la->hashval) > be32_to_cpu(lb->hashval) ? 1 : 0); | |
2bd0ea18 NS |
887 | } |
888 | ||
889 | /* | |
890 | * Convert a V2 leaf directory to a V2 block directory if possible. | |
891 | */ | |
892 | int /* error */ | |
893 | xfs_dir2_leaf_to_block( | |
894 | xfs_da_args_t *args, /* operation arguments */ | |
a2ceac1f DC |
895 | struct xfs_buf *lbp, /* leaf buffer */ |
896 | struct xfs_buf *dbp) /* data buffer */ | |
2bd0ea18 | 897 | { |
5e656dbb | 898 | __be16 *bestsp; /* leaf bests table */ |
a2ceac1f | 899 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 NS |
900 | xfs_dir2_block_tail_t *btp; /* block tail */ |
901 | xfs_inode_t *dp; /* incore directory inode */ | |
902 | xfs_dir2_data_unused_t *dup; /* unused data entry */ | |
903 | int error; /* error return value */ | |
904 | int from; /* leaf from index */ | |
905 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
906 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
907 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ | |
908 | xfs_mount_t *mp; /* file system mount point */ | |
909 | int needlog; /* need to log data header */ | |
910 | int needscan; /* need to scan for bestfree */ | |
911 | xfs_dir2_sf_hdr_t sfh; /* shortform header */ | |
912 | int size; /* bytes used */ | |
5e656dbb | 913 | __be16 *tagp; /* end of entry (tag) */ |
2bd0ea18 NS |
914 | int to; /* block/leaf to index */ |
915 | xfs_trans_t *tp; /* transaction pointer */ | |
65b80c98 DC |
916 | struct xfs_dir2_leaf_entry *ents; |
917 | struct xfs_dir3_icleaf_hdr leafhdr; | |
2bd0ea18 | 918 | |
56b2de80 DC |
919 | trace_xfs_dir2_leaf_to_block(args); |
920 | ||
2bd0ea18 NS |
921 | dp = args->dp; |
922 | tp = args->trans; | |
923 | mp = dp->i_mount; | |
a2ceac1f | 924 | leaf = lbp->b_addr; |
ff105f75 DC |
925 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
926 | ents = dp->d_ops->leaf_ents_p(leaf); | |
927 | ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); | |
65b80c98 DC |
928 | |
929 | ASSERT(leafhdr.magic == XFS_DIR2_LEAF1_MAGIC || | |
930 | leafhdr.magic == XFS_DIR3_LEAF1_MAGIC); | |
2bd0ea18 NS |
931 | /* |
932 | * If there are data blocks other than the first one, take this | |
933 | * opportunity to remove trailing empty data blocks that may have | |
934 | * been left behind during no-space-reservation operations. | |
935 | * These will show up in the leaf bests table. | |
936 | */ | |
ff105f75 | 937 | while (dp->i_d.di_size > args->geo->blksize) { |
693fc8f6 DC |
938 | int hdrsz; |
939 | ||
ff105f75 | 940 | hdrsz = dp->d_ops->data_entry_offset; |
5e656dbb BN |
941 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
942 | if (be16_to_cpu(bestsp[be32_to_cpu(ltp->bestcount) - 1]) == | |
ff105f75 | 943 | args->geo->blksize - hdrsz) { |
0e266570 | 944 | if ((error = |
2bd0ea18 | 945 | xfs_dir2_leaf_trim_data(args, lbp, |
5e656dbb | 946 | (xfs_dir2_db_t)(be32_to_cpu(ltp->bestcount) - 1)))) |
a2ceac1f DC |
947 | return error; |
948 | } else | |
949 | return 0; | |
2bd0ea18 NS |
950 | } |
951 | /* | |
952 | * Read the data block if we don't already have it, give up if it fails. | |
953 | */ | |
a2ceac1f | 954 | if (!dbp) { |
ff105f75 | 955 | error = xfs_dir3_data_read(tp, dp, args->geo->datablk, -1, &dbp); |
a2ceac1f DC |
956 | if (error) |
957 | return error; | |
2bd0ea18 | 958 | } |
a2ceac1f | 959 | hdr = dbp->b_addr; |
90ea28c3 DC |
960 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
961 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)); | |
962 | ||
2bd0ea18 NS |
963 | /* |
964 | * Size of the "leaf" area in the block. | |
965 | */ | |
a2ceac1f | 966 | size = (uint)sizeof(xfs_dir2_block_tail_t) + |
65b80c98 | 967 | (uint)sizeof(*lep) * (leafhdr.count - leafhdr.stale); |
2bd0ea18 NS |
968 | /* |
969 | * Look at the last data entry. | |
970 | */ | |
ff105f75 | 971 | tagp = (__be16 *)((char *)hdr + args->geo->blksize) - 1; |
a2ceac1f | 972 | dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); |
2bd0ea18 NS |
973 | /* |
974 | * If it's not free or is too short we can't do it. | |
975 | */ | |
5e656dbb | 976 | if (be16_to_cpu(dup->freetag) != XFS_DIR2_DATA_FREE_TAG || |
a2ceac1f DC |
977 | be16_to_cpu(dup->length) < size) |
978 | return 0; | |
979 | ||
2bd0ea18 NS |
980 | /* |
981 | * Start converting it to block form. | |
982 | */ | |
8b4dc4a9 | 983 | xfs_dir3_block_init(mp, tp, dbp, dp); |
693fc8f6 | 984 | |
2bd0ea18 NS |
985 | needlog = 1; |
986 | needscan = 0; | |
987 | /* | |
988 | * Use up the space at the end of the block (blp/btp). | |
989 | */ | |
15348e04 DW |
990 | error = xfs_dir2_data_use_free(args, dbp, dup, |
991 | args->geo->blksize - size, size, &needlog, &needscan); | |
992 | if (error) | |
993 | return error; | |
2bd0ea18 NS |
994 | /* |
995 | * Initialize the block tail. | |
996 | */ | |
ff105f75 | 997 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
65b80c98 | 998 | btp->count = cpu_to_be32(leafhdr.count - leafhdr.stale); |
46eca962 | 999 | btp->stale = 0; |
2bd0ea18 NS |
1000 | xfs_dir2_block_log_tail(tp, dbp); |
1001 | /* | |
1002 | * Initialize the block leaf area. We compact out stale entries. | |
1003 | */ | |
5e656dbb | 1004 | lep = xfs_dir2_block_leaf_p(btp); |
65b80c98 DC |
1005 | for (from = to = 0; from < leafhdr.count; from++) { |
1006 | if (ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) | |
2bd0ea18 | 1007 | continue; |
65b80c98 | 1008 | lep[to++] = ents[from]; |
2bd0ea18 | 1009 | } |
5e656dbb BN |
1010 | ASSERT(to == be32_to_cpu(btp->count)); |
1011 | xfs_dir2_block_log_leaf(tp, dbp, 0, be32_to_cpu(btp->count) - 1); | |
2bd0ea18 NS |
1012 | /* |
1013 | * Scan the bestfree if we need it and log the data block header. | |
1014 | */ | |
1015 | if (needscan) | |
19ebedcf | 1016 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
2bd0ea18 | 1017 | if (needlog) |
ff105f75 | 1018 | xfs_dir2_data_log_header(args, dbp); |
2bd0ea18 NS |
1019 | /* |
1020 | * Pitch the old leaf block. | |
1021 | */ | |
ff105f75 | 1022 | error = xfs_da_shrink_inode(args, args->geo->leafblk, lbp); |
a2ceac1f DC |
1023 | if (error) |
1024 | return error; | |
1025 | ||
2bd0ea18 NS |
1026 | /* |
1027 | * Now see if the resulting block can be shrunken to shortform. | |
1028 | */ | |
a2ceac1f DC |
1029 | size = xfs_dir2_block_sfsize(dp, hdr, &sfh); |
1030 | if (size > XFS_IFORK_DSIZE(dp)) | |
1031 | return 0; | |
1032 | ||
2bd0ea18 | 1033 | return xfs_dir2_block_to_sf(args, dbp, size, &sfh); |
2bd0ea18 NS |
1034 | } |
1035 | ||
1036 | /* | |
1037 | * Convert the shortform directory to block form. | |
1038 | */ | |
1039 | int /* error */ | |
1040 | xfs_dir2_sf_to_block( | |
1041 | xfs_da_args_t *args) /* operation arguments */ | |
1042 | { | |
1043 | xfs_dir2_db_t blkno; /* dir-relative block # (0) */ | |
a2ceac1f | 1044 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 1045 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 1046 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 | 1047 | xfs_dir2_block_tail_t *btp; /* block tail pointer */ |
2bd0ea18 NS |
1048 | xfs_dir2_data_entry_t *dep; /* data entry pointer */ |
1049 | xfs_inode_t *dp; /* incore directory inode */ | |
1050 | int dummy; /* trash */ | |
1051 | xfs_dir2_data_unused_t *dup; /* unused entry pointer */ | |
1052 | int endoffset; /* end of data objects */ | |
1053 | int error; /* error return value */ | |
1054 | int i; /* index */ | |
1055 | xfs_mount_t *mp; /* filesystem mount point */ | |
1056 | int needlog; /* need to log block header */ | |
1057 | int needscan; /* need to scan block freespc */ | |
1058 | int newoffset; /* offset from current entry */ | |
1059 | int offset; /* target block offset */ | |
1060 | xfs_dir2_sf_entry_t *sfep; /* sf entry pointer */ | |
a2ceac1f DC |
1061 | xfs_dir2_sf_hdr_t *oldsfp; /* old shortform header */ |
1062 | xfs_dir2_sf_hdr_t *sfp; /* shortform header */ | |
5e656dbb | 1063 | __be16 *tagp; /* end of data entry */ |
2bd0ea18 | 1064 | xfs_trans_t *tp; /* transaction pointer */ |
5e656dbb | 1065 | struct xfs_name name; |
3f17ed4b | 1066 | struct xfs_ifork *ifp; |
2bd0ea18 | 1067 | |
56b2de80 DC |
1068 | trace_xfs_dir2_sf_to_block(args); |
1069 | ||
2bd0ea18 NS |
1070 | dp = args->dp; |
1071 | tp = args->trans; | |
1072 | mp = dp->i_mount; | |
3f17ed4b DC |
1073 | ifp = XFS_IFORK_PTR(dp, XFS_DATA_FORK); |
1074 | ASSERT(ifp->if_flags & XFS_IFINLINE); | |
2bd0ea18 NS |
1075 | /* |
1076 | * Bomb out if the shortform directory is way too short. | |
1077 | */ | |
1078 | if (dp->i_d.di_size < offsetof(xfs_dir2_sf_hdr_t, parent)) { | |
2bd0ea18 | 1079 | ASSERT(XFS_FORCED_SHUTDOWN(mp)); |
12b53197 | 1080 | return -EIO; |
2bd0ea18 | 1081 | } |
a2ceac1f | 1082 | |
3f17ed4b | 1083 | oldsfp = (xfs_dir2_sf_hdr_t *)ifp->if_u1.if_data; |
a2ceac1f | 1084 | |
3f17ed4b DC |
1085 | ASSERT(ifp->if_bytes == dp->i_d.di_size); |
1086 | ASSERT(ifp->if_u1.if_data != NULL); | |
a2ceac1f | 1087 | ASSERT(dp->i_d.di_size >= xfs_dir2_sf_hdr_size(oldsfp->i8count)); |
3f17ed4b | 1088 | ASSERT(dp->i_d.di_nextents == 0); |
a2ceac1f | 1089 | |
2bd0ea18 | 1090 | /* |
a2ceac1f | 1091 | * Copy the directory into a temporary buffer. |
2bd0ea18 NS |
1092 | * Then pitch the incore inode data so we can make extents. |
1093 | */ | |
3f17ed4b DC |
1094 | sfp = kmem_alloc(ifp->if_bytes, KM_SLEEP); |
1095 | memcpy(sfp, oldsfp, ifp->if_bytes); | |
d663096d | 1096 | |
3f17ed4b DC |
1097 | xfs_idata_realloc(dp, -ifp->if_bytes, XFS_DATA_FORK); |
1098 | xfs_bmap_local_to_extents_empty(dp, XFS_DATA_FORK); | |
2bd0ea18 | 1099 | dp->i_d.di_size = 0; |
a2ceac1f | 1100 | |
2bd0ea18 NS |
1101 | /* |
1102 | * Add block 0 to the inode. | |
1103 | */ | |
1104 | error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, &blkno); | |
15348e04 DW |
1105 | if (error) |
1106 | goto out_free; | |
2bd0ea18 | 1107 | /* |
693fc8f6 | 1108 | * Initialize the data block, then convert it to block format. |
2bd0ea18 | 1109 | */ |
693fc8f6 | 1110 | error = xfs_dir3_data_init(args, blkno, &bp); |
15348e04 DW |
1111 | if (error) |
1112 | goto out_free; | |
8b4dc4a9 | 1113 | xfs_dir3_block_init(mp, tp, bp, dp); |
a2ceac1f | 1114 | hdr = bp->b_addr; |
693fc8f6 | 1115 | |
2bd0ea18 NS |
1116 | /* |
1117 | * Compute size of block "tail" area. | |
1118 | */ | |
1119 | i = (uint)sizeof(*btp) + | |
a2ceac1f | 1120 | (sfp->count + 2) * (uint)sizeof(xfs_dir2_leaf_entry_t); |
2bd0ea18 NS |
1121 | /* |
1122 | * The whole thing is initialized to free by the init routine. | |
1123 | * Say we're using the leaf and tail area. | |
1124 | */ | |
ff105f75 | 1125 | dup = dp->d_ops->data_unused_p(hdr); |
2bd0ea18 | 1126 | needlog = needscan = 0; |
15348e04 DW |
1127 | error = xfs_dir2_data_use_free(args, bp, dup, args->geo->blksize - i, |
1128 | i, &needlog, &needscan); | |
1129 | if (error) | |
1130 | goto out_free; | |
2bd0ea18 NS |
1131 | ASSERT(needscan == 0); |
1132 | /* | |
1133 | * Fill in the tail. | |
1134 | */ | |
ff105f75 | 1135 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
a2ceac1f | 1136 | btp->count = cpu_to_be32(sfp->count + 2); /* ., .. */ |
46eca962 | 1137 | btp->stale = 0; |
5e656dbb | 1138 | blp = xfs_dir2_block_leaf_p(btp); |
a2ceac1f | 1139 | endoffset = (uint)((char *)blp - (char *)hdr); |
2bd0ea18 NS |
1140 | /* |
1141 | * Remove the freespace, we'll manage it. | |
1142 | */ | |
15348e04 DW |
1143 | error = xfs_dir2_data_use_free(args, bp, dup, |
1144 | (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), | |
1145 | be16_to_cpu(dup->length), &needlog, &needscan); | |
1146 | if (error) | |
1147 | goto out_free; | |
2bd0ea18 NS |
1148 | /* |
1149 | * Create entry for . | |
1150 | */ | |
ff105f75 | 1151 | dep = dp->d_ops->data_dot_entry_p(hdr); |
5e656dbb | 1152 | dep->inumber = cpu_to_be64(dp->i_ino); |
2bd0ea18 NS |
1153 | dep->namelen = 1; |
1154 | dep->name[0] = '.'; | |
ff105f75 DC |
1155 | dp->d_ops->data_put_ftype(dep, XFS_DIR3_FT_DIR); |
1156 | tagp = dp->d_ops->data_entry_tag_p(dep); | |
a2ceac1f | 1157 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
ff105f75 | 1158 | xfs_dir2_data_log_entry(args, bp, dep); |
5e656dbb | 1159 | blp[0].hashval = cpu_to_be32(xfs_dir_hash_dot); |
ff105f75 | 1160 | blp[0].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( |
a2ceac1f | 1161 | (char *)dep - (char *)hdr)); |
2bd0ea18 NS |
1162 | /* |
1163 | * Create entry for .. | |
1164 | */ | |
ff105f75 DC |
1165 | dep = dp->d_ops->data_dotdot_entry_p(hdr); |
1166 | dep->inumber = cpu_to_be64(dp->d_ops->sf_get_parent_ino(sfp)); | |
2bd0ea18 NS |
1167 | dep->namelen = 2; |
1168 | dep->name[0] = dep->name[1] = '.'; | |
ff105f75 DC |
1169 | dp->d_ops->data_put_ftype(dep, XFS_DIR3_FT_DIR); |
1170 | tagp = dp->d_ops->data_entry_tag_p(dep); | |
a2ceac1f | 1171 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
ff105f75 | 1172 | xfs_dir2_data_log_entry(args, bp, dep); |
5e656dbb | 1173 | blp[1].hashval = cpu_to_be32(xfs_dir_hash_dotdot); |
ff105f75 | 1174 | blp[1].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( |
a2ceac1f | 1175 | (char *)dep - (char *)hdr)); |
ff105f75 | 1176 | offset = dp->d_ops->data_first_offset; |
2bd0ea18 NS |
1177 | /* |
1178 | * Loop over existing entries, stuff them in. | |
1179 | */ | |
a2ceac1f DC |
1180 | i = 0; |
1181 | if (!sfp->count) | |
2bd0ea18 NS |
1182 | sfep = NULL; |
1183 | else | |
5e656dbb | 1184 | sfep = xfs_dir2_sf_firstentry(sfp); |
2bd0ea18 NS |
1185 | /* |
1186 | * Need to preserve the existing offset values in the sf directory. | |
1187 | * Insert holes (unused entries) where necessary. | |
1188 | */ | |
1189 | while (offset < endoffset) { | |
1190 | /* | |
1191 | * sfep is null when we reach the end of the list. | |
1192 | */ | |
1193 | if (sfep == NULL) | |
1194 | newoffset = endoffset; | |
1195 | else | |
5e656dbb | 1196 | newoffset = xfs_dir2_sf_get_offset(sfep); |
2bd0ea18 NS |
1197 | /* |
1198 | * There should be a hole here, make one. | |
1199 | */ | |
1200 | if (offset < newoffset) { | |
a2ceac1f | 1201 | dup = (xfs_dir2_data_unused_t *)((char *)hdr + offset); |
5e656dbb BN |
1202 | dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); |
1203 | dup->length = cpu_to_be16(newoffset - offset); | |
1204 | *xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16( | |
a2ceac1f | 1205 | ((char *)dup - (char *)hdr)); |
ff105f75 DC |
1206 | xfs_dir2_data_log_unused(args, bp, dup); |
1207 | xfs_dir2_data_freeinsert(hdr, | |
1208 | dp->d_ops->data_bestfree_p(hdr), | |
1209 | dup, &dummy); | |
5e656dbb | 1210 | offset += be16_to_cpu(dup->length); |
2bd0ea18 NS |
1211 | continue; |
1212 | } | |
1213 | /* | |
1214 | * Copy a real entry. | |
1215 | */ | |
a2ceac1f | 1216 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + newoffset); |
ff105f75 | 1217 | dep->inumber = cpu_to_be64(dp->d_ops->sf_get_ino(sfp, sfep)); |
2bd0ea18 | 1218 | dep->namelen = sfep->namelen; |
ff105f75 | 1219 | dp->d_ops->data_put_ftype(dep, dp->d_ops->sf_get_ftype(sfep)); |
32181a02 | 1220 | memcpy(dep->name, sfep->name, dep->namelen); |
ff105f75 | 1221 | tagp = dp->d_ops->data_entry_tag_p(dep); |
a2ceac1f | 1222 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
ff105f75 | 1223 | xfs_dir2_data_log_entry(args, bp, dep); |
5e656dbb BN |
1224 | name.name = sfep->name; |
1225 | name.len = sfep->namelen; | |
1226 | blp[2 + i].hashval = cpu_to_be32(mp->m_dirnameops-> | |
1227 | hashname(&name)); | |
ff105f75 | 1228 | blp[2 + i].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( |
a2ceac1f DC |
1229 | (char *)dep - (char *)hdr)); |
1230 | offset = (int)((char *)(tagp + 1) - (char *)hdr); | |
1231 | if (++i == sfp->count) | |
2bd0ea18 NS |
1232 | sfep = NULL; |
1233 | else | |
ff105f75 | 1234 | sfep = dp->d_ops->sf_nextentry(sfp, sfep); |
2bd0ea18 | 1235 | } |
d663096d | 1236 | /* Done with the temporary buffer */ |
a2ceac1f | 1237 | kmem_free(sfp); |
2bd0ea18 NS |
1238 | /* |
1239 | * Sort the leaf entries by hash value. | |
1240 | */ | |
5e656dbb | 1241 | xfs_sort(blp, be32_to_cpu(btp->count), sizeof(*blp), xfs_dir2_block_sort); |
5000d01d | 1242 | /* |
2bd0ea18 NS |
1243 | * Log the leaf entry area and tail. |
1244 | * Already logged the header in data_init, ignore needlog. | |
1245 | */ | |
1246 | ASSERT(needscan == 0); | |
5e656dbb | 1247 | xfs_dir2_block_log_leaf(tp, bp, 0, be32_to_cpu(btp->count) - 1); |
2bd0ea18 | 1248 | xfs_dir2_block_log_tail(tp, bp); |
90ea28c3 | 1249 | xfs_dir3_data_check(dp, bp); |
2bd0ea18 | 1250 | return 0; |
15348e04 DW |
1251 | out_free: |
1252 | kmem_free(sfp); | |
1253 | return error; | |
2bd0ea18 | 1254 | } |