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