]>
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; | |
71 | } else { | |
72 | if (hdr3->magic != cpu_to_be32(XFS_DIR2_BLOCK_MAGIC)) | |
73 | return false; | |
a2ceac1f | 74 | } |
90ea28c3 | 75 | if (__xfs_dir3_data_check(NULL, bp)) |
693fc8f6 DC |
76 | return false; |
77 | return true; | |
a2ceac1f DC |
78 | } |
79 | ||
80 | static void | |
693fc8f6 | 81 | xfs_dir3_block_read_verify( |
a2ceac1f DC |
82 | struct xfs_buf *bp) |
83 | { | |
693fc8f6 DC |
84 | struct xfs_mount *mp = bp->b_target->bt_mount; |
85 | ||
45922933 DC |
86 | if (xfs_sb_version_hascrc(&mp->m_sb) && |
87 | !xfs_buf_verify_cksum(bp, XFS_DIR3_DATA_CRC_OFF)) | |
12b53197 | 88 | xfs_buf_ioerror(bp, -EFSBADCRC); |
45922933 | 89 | else if (!xfs_dir3_block_verify(bp)) |
12b53197 | 90 | xfs_buf_ioerror(bp, -EFSCORRUPTED); |
45922933 DC |
91 | |
92 | if (bp->b_error) | |
93 | xfs_verifier_error(bp); | |
a2ceac1f DC |
94 | } |
95 | ||
96 | static void | |
693fc8f6 | 97 | xfs_dir3_block_write_verify( |
a2ceac1f DC |
98 | struct xfs_buf *bp) |
99 | { | |
693fc8f6 DC |
100 | struct xfs_mount *mp = bp->b_target->bt_mount; |
101 | struct xfs_buf_log_item *bip = bp->b_fspriv; | |
102 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; | |
103 | ||
104 | if (!xfs_dir3_block_verify(bp)) { | |
12b53197 | 105 | xfs_buf_ioerror(bp, -EFSCORRUPTED); |
45922933 | 106 | xfs_verifier_error(bp); |
693fc8f6 DC |
107 | return; |
108 | } | |
109 | ||
110 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
111 | return; | |
112 | ||
113 | if (bip) | |
114 | hdr3->lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
115 | ||
43b5aeed | 116 | xfs_buf_update_cksum(bp, XFS_DIR3_DATA_CRC_OFF); |
a2ceac1f DC |
117 | } |
118 | ||
693fc8f6 DC |
119 | const struct xfs_buf_ops xfs_dir3_block_buf_ops = { |
120 | .verify_read = xfs_dir3_block_read_verify, | |
121 | .verify_write = xfs_dir3_block_write_verify, | |
a2ceac1f DC |
122 | }; |
123 | ||
494434d7 | 124 | int |
693fc8f6 | 125 | xfs_dir3_block_read( |
a2ceac1f DC |
126 | struct xfs_trans *tp, |
127 | struct xfs_inode *dp, | |
128 | struct xfs_buf **bpp) | |
129 | { | |
130 | struct xfs_mount *mp = dp->i_mount; | |
8b4dc4a9 | 131 | int err; |
a2ceac1f | 132 | |
ff105f75 | 133 | err = xfs_da_read_buf(tp, dp, mp->m_dir_geo->datablk, -1, bpp, |
693fc8f6 | 134 | XFS_DATA_FORK, &xfs_dir3_block_buf_ops); |
8b4dc4a9 | 135 | if (!err && tp) |
bdc16ee5 | 136 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_BLOCK_BUF); |
8b4dc4a9 | 137 | return err; |
693fc8f6 DC |
138 | } |
139 | ||
140 | static void | |
141 | xfs_dir3_block_init( | |
142 | struct xfs_mount *mp, | |
8b4dc4a9 | 143 | struct xfs_trans *tp, |
693fc8f6 DC |
144 | struct xfs_buf *bp, |
145 | struct xfs_inode *dp) | |
146 | { | |
147 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; | |
148 | ||
149 | bp->b_ops = &xfs_dir3_block_buf_ops; | |
bdc16ee5 | 150 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_BLOCK_BUF); |
693fc8f6 DC |
151 | |
152 | if (xfs_sb_version_hascrc(&mp->m_sb)) { | |
153 | memset(hdr3, 0, sizeof(*hdr3)); | |
154 | hdr3->magic = cpu_to_be32(XFS_DIR3_BLOCK_MAGIC); | |
155 | hdr3->blkno = cpu_to_be64(bp->b_bn); | |
156 | hdr3->owner = cpu_to_be64(dp->i_ino); | |
9c4e12fb | 157 | uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); |
693fc8f6 DC |
158 | return; |
159 | ||
160 | } | |
161 | hdr3->magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC); | |
a2ceac1f DC |
162 | } |
163 | ||
164 | static void | |
165 | xfs_dir2_block_need_space( | |
ff105f75 | 166 | struct xfs_inode *dp, |
a2ceac1f DC |
167 | struct xfs_dir2_data_hdr *hdr, |
168 | struct xfs_dir2_block_tail *btp, | |
169 | struct xfs_dir2_leaf_entry *blp, | |
170 | __be16 **tagpp, | |
171 | struct xfs_dir2_data_unused **dupp, | |
172 | struct xfs_dir2_data_unused **enddupp, | |
173 | int *compact, | |
174 | int len) | |
175 | { | |
176 | struct xfs_dir2_data_free *bf; | |
177 | __be16 *tagp = NULL; | |
178 | struct xfs_dir2_data_unused *dup = NULL; | |
179 | struct xfs_dir2_data_unused *enddup = NULL; | |
180 | ||
181 | *compact = 0; | |
ff105f75 | 182 | bf = dp->d_ops->data_bestfree_p(hdr); |
a2ceac1f DC |
183 | |
184 | /* | |
185 | * If there are stale entries we'll use one for the leaf. | |
186 | */ | |
187 | if (btp->stale) { | |
188 | if (be16_to_cpu(bf[0].length) >= len) { | |
189 | /* | |
190 | * The biggest entry enough to avoid compaction. | |
191 | */ | |
192 | dup = (xfs_dir2_data_unused_t *) | |
193 | ((char *)hdr + be16_to_cpu(bf[0].offset)); | |
194 | goto out; | |
195 | } | |
196 | ||
197 | /* | |
198 | * Will need to compact to make this work. | |
199 | * Tag just before the first leaf entry. | |
200 | */ | |
201 | *compact = 1; | |
202 | tagp = (__be16 *)blp - 1; | |
203 | ||
204 | /* Data object just before the first leaf entry. */ | |
205 | dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); | |
206 | ||
207 | /* | |
208 | * If it's not free then the data will go where the | |
209 | * leaf data starts now, if it works at all. | |
210 | */ | |
211 | if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { | |
212 | if (be16_to_cpu(dup->length) + (be32_to_cpu(btp->stale) - 1) * | |
213 | (uint)sizeof(*blp) < len) | |
214 | dup = NULL; | |
215 | } else if ((be32_to_cpu(btp->stale) - 1) * (uint)sizeof(*blp) < len) | |
216 | dup = NULL; | |
217 | else | |
218 | dup = (xfs_dir2_data_unused_t *)blp; | |
219 | goto out; | |
220 | } | |
221 | ||
222 | /* | |
223 | * no stale entries, so just use free space. | |
224 | * Tag just before the first leaf entry. | |
225 | */ | |
226 | tagp = (__be16 *)blp - 1; | |
227 | ||
228 | /* Data object just before the first leaf entry. */ | |
229 | enddup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); | |
230 | ||
231 | /* | |
232 | * If it's not free then can't do this add without cleaning up: | |
233 | * the space before the first leaf entry needs to be free so it | |
234 | * can be expanded to hold the pointer to the new entry. | |
235 | */ | |
236 | if (be16_to_cpu(enddup->freetag) == XFS_DIR2_DATA_FREE_TAG) { | |
237 | /* | |
238 | * Check out the biggest freespace and see if it's the same one. | |
239 | */ | |
240 | dup = (xfs_dir2_data_unused_t *) | |
241 | ((char *)hdr + be16_to_cpu(bf[0].offset)); | |
242 | if (dup != enddup) { | |
243 | /* | |
244 | * Not the same free entry, just check its length. | |
245 | */ | |
246 | if (be16_to_cpu(dup->length) < len) | |
247 | dup = NULL; | |
248 | goto out; | |
249 | } | |
250 | ||
251 | /* | |
252 | * It is the biggest freespace, can it hold the leaf too? | |
253 | */ | |
254 | if (be16_to_cpu(dup->length) < len + (uint)sizeof(*blp)) { | |
255 | /* | |
256 | * Yes, use the second-largest entry instead if it works. | |
257 | */ | |
258 | if (be16_to_cpu(bf[1].length) >= len) | |
259 | dup = (xfs_dir2_data_unused_t *) | |
260 | ((char *)hdr + be16_to_cpu(bf[1].offset)); | |
261 | else | |
262 | dup = NULL; | |
263 | } | |
264 | } | |
265 | out: | |
266 | *tagpp = tagp; | |
267 | *dupp = dup; | |
268 | *enddupp = enddup; | |
269 | } | |
270 | ||
271 | /* | |
272 | * compact the leaf entries. | |
273 | * Leave the highest-numbered stale entry stale. | |
274 | * XXX should be the one closest to mid but mid is not yet computed. | |
275 | */ | |
276 | static void | |
277 | xfs_dir2_block_compact( | |
ff105f75 | 278 | struct xfs_da_args *args, |
a2ceac1f DC |
279 | struct xfs_buf *bp, |
280 | struct xfs_dir2_data_hdr *hdr, | |
281 | struct xfs_dir2_block_tail *btp, | |
282 | struct xfs_dir2_leaf_entry *blp, | |
283 | int *needlog, | |
284 | int *lfloghigh, | |
285 | int *lfloglow) | |
286 | { | |
287 | int fromidx; /* source leaf index */ | |
288 | int toidx; /* target leaf index */ | |
289 | int needscan = 0; | |
290 | int highstale; /* high stale index */ | |
291 | ||
292 | fromidx = toidx = be32_to_cpu(btp->count) - 1; | |
293 | highstale = *lfloghigh = -1; | |
294 | for (; fromidx >= 0; fromidx--) { | |
295 | if (blp[fromidx].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) { | |
296 | if (highstale == -1) | |
297 | highstale = toidx; | |
298 | else { | |
299 | if (*lfloghigh == -1) | |
300 | *lfloghigh = toidx; | |
301 | continue; | |
302 | } | |
303 | } | |
304 | if (fromidx < toidx) | |
305 | blp[toidx] = blp[fromidx]; | |
306 | toidx--; | |
307 | } | |
308 | *lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1); | |
309 | *lfloghigh -= be32_to_cpu(btp->stale) - 1; | |
310 | be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1)); | |
ff105f75 | 311 | xfs_dir2_data_make_free(args, bp, |
a2ceac1f DC |
312 | (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr), |
313 | (xfs_dir2_data_aoff_t)((be32_to_cpu(btp->stale) - 1) * sizeof(*blp)), | |
314 | needlog, &needscan); | |
a2ceac1f DC |
315 | btp->stale = cpu_to_be32(1); |
316 | /* | |
317 | * If we now need to rebuild the bestfree map, do so. | |
318 | * This needs to happen before the next call to use_free. | |
319 | */ | |
320 | if (needscan) | |
19ebedcf | 321 | xfs_dir2_data_freescan(args->dp, hdr, needlog); |
a2ceac1f DC |
322 | } |
323 | ||
2bd0ea18 NS |
324 | /* |
325 | * Add an entry to a block directory. | |
326 | */ | |
327 | int /* error */ | |
328 | xfs_dir2_block_addname( | |
329 | xfs_da_args_t *args) /* directory op arguments */ | |
330 | { | |
a2ceac1f | 331 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 332 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 333 | struct xfs_buf *bp; /* buffer for block */ |
2bd0ea18 NS |
334 | xfs_dir2_block_tail_t *btp; /* block tail */ |
335 | int compact; /* need to compact leaf ents */ | |
336 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
337 | xfs_inode_t *dp; /* directory inode */ | |
338 | xfs_dir2_data_unused_t *dup; /* block unused entry */ | |
339 | int error; /* error return value */ | |
0e266570 | 340 | xfs_dir2_data_unused_t *enddup=NULL; /* unused at end of data */ |
2bd0ea18 NS |
341 | xfs_dahash_t hash; /* hash value of found entry */ |
342 | int high; /* high index for binary srch */ | |
343 | int highstale; /* high stale index */ | |
0e266570 NS |
344 | int lfloghigh=0; /* last final leaf to log */ |
345 | int lfloglow=0; /* first final leaf to log */ | |
2bd0ea18 NS |
346 | int len; /* length of the new entry */ |
347 | int low; /* low index for binary srch */ | |
348 | int lowstale; /* low stale index */ | |
0e266570 | 349 | int mid=0; /* midpoint for binary srch */ |
2bd0ea18 NS |
350 | int needlog; /* need to log header */ |
351 | int needscan; /* need to rescan freespace */ | |
5e656dbb | 352 | __be16 *tagp; /* pointer to tag value */ |
2bd0ea18 NS |
353 | xfs_trans_t *tp; /* transaction structure */ |
354 | ||
56b2de80 DC |
355 | trace_xfs_dir2_block_addname(args); |
356 | ||
2bd0ea18 NS |
357 | dp = args->dp; |
358 | tp = args->trans; | |
a2ceac1f DC |
359 | |
360 | /* Read the (one and only) directory block into bp. */ | |
693fc8f6 | 361 | error = xfs_dir3_block_read(tp, dp, &bp); |
a2ceac1f | 362 | if (error) |
2bd0ea18 | 363 | return error; |
a2ceac1f | 364 | |
ff105f75 | 365 | len = dp->d_ops->data_entsize(args->namelen); |
a2ceac1f | 366 | |
2bd0ea18 NS |
367 | /* |
368 | * Set up pointers to parts of the block. | |
369 | */ | |
a2ceac1f | 370 | hdr = bp->b_addr; |
ff105f75 | 371 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 372 | blp = xfs_dir2_block_leaf_p(btp); |
a2ceac1f | 373 | |
2bd0ea18 | 374 | /* |
a2ceac1f DC |
375 | * Find out if we can reuse stale entries or whether we need extra |
376 | * space for entry and new leaf. | |
2bd0ea18 | 377 | */ |
ff105f75 | 378 | xfs_dir2_block_need_space(dp, hdr, btp, blp, &tagp, &dup, |
a2ceac1f DC |
379 | &enddup, &compact, len); |
380 | ||
2bd0ea18 | 381 | /* |
a2ceac1f | 382 | * Done everything we need for a space check now. |
2bd0ea18 | 383 | */ |
a2ceac1f DC |
384 | if (args->op_flags & XFS_DA_OP_JUSTCHECK) { |
385 | xfs_trans_brelse(tp, bp); | |
386 | if (!dup) | |
12b53197 | 387 | return -ENOSPC; |
a2ceac1f | 388 | return 0; |
2bd0ea18 | 389 | } |
a2ceac1f | 390 | |
2bd0ea18 NS |
391 | /* |
392 | * If we don't have space for the new entry & leaf ... | |
393 | */ | |
394 | if (!dup) { | |
a2ceac1f DC |
395 | /* Don't have a space reservation: return no-space. */ |
396 | if (args->total == 0) | |
12b53197 | 397 | return -ENOSPC; |
2bd0ea18 NS |
398 | /* |
399 | * Convert to the next larger format. | |
400 | * Then add the new entry in that format. | |
401 | */ | |
402 | error = xfs_dir2_block_to_leaf(args, bp); | |
2bd0ea18 NS |
403 | if (error) |
404 | return error; | |
405 | return xfs_dir2_leaf_addname(args); | |
406 | } | |
a2ceac1f | 407 | |
2bd0ea18 | 408 | needlog = needscan = 0; |
a2ceac1f | 409 | |
2bd0ea18 NS |
410 | /* |
411 | * If need to compact the leaf entries, do it now. | |
2bd0ea18 | 412 | */ |
49f693fa | 413 | if (compact) { |
ff105f75 | 414 | xfs_dir2_block_compact(args, bp, hdr, btp, blp, &needlog, |
a2ceac1f | 415 | &lfloghigh, &lfloglow); |
49f693fa DC |
416 | /* recalculate blp post-compaction */ |
417 | blp = xfs_dir2_block_leaf_p(btp); | |
418 | } else if (btp->stale) { | |
2bd0ea18 | 419 | /* |
a2ceac1f DC |
420 | * Set leaf logging boundaries to impossible state. |
421 | * For the no-stale case they're set explicitly. | |
2bd0ea18 | 422 | */ |
5e656dbb | 423 | lfloglow = be32_to_cpu(btp->count); |
2bd0ea18 NS |
424 | lfloghigh = -1; |
425 | } | |
a2ceac1f | 426 | |
2bd0ea18 NS |
427 | /* |
428 | * Find the slot that's first lower than our hash value, -1 if none. | |
429 | */ | |
5e656dbb | 430 | for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { |
2bd0ea18 | 431 | mid = (low + high) >> 1; |
5e656dbb | 432 | if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) |
2bd0ea18 NS |
433 | break; |
434 | if (hash < args->hashval) | |
435 | low = mid + 1; | |
436 | else | |
437 | high = mid - 1; | |
438 | } | |
5e656dbb | 439 | while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) { |
2bd0ea18 NS |
440 | mid--; |
441 | } | |
442 | /* | |
443 | * No stale entries, will use enddup space to hold new leaf. | |
444 | */ | |
46eca962 | 445 | if (!btp->stale) { |
2bd0ea18 NS |
446 | /* |
447 | * Mark the space needed for the new leaf entry, now in use. | |
448 | */ | |
ff105f75 | 449 | xfs_dir2_data_use_free(args, bp, enddup, |
2bd0ea18 | 450 | (xfs_dir2_data_aoff_t) |
a2ceac1f | 451 | ((char *)enddup - (char *)hdr + be16_to_cpu(enddup->length) - |
2bd0ea18 NS |
452 | sizeof(*blp)), |
453 | (xfs_dir2_data_aoff_t)sizeof(*blp), | |
454 | &needlog, &needscan); | |
455 | /* | |
456 | * Update the tail (entry count). | |
457 | */ | |
5e656dbb | 458 | be32_add_cpu(&btp->count, 1); |
2bd0ea18 NS |
459 | /* |
460 | * If we now need to rebuild the bestfree map, do so. | |
461 | * This needs to happen before the next call to use_free. | |
462 | */ | |
463 | if (needscan) { | |
19ebedcf | 464 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
2bd0ea18 NS |
465 | needscan = 0; |
466 | } | |
467 | /* | |
468 | * Adjust pointer to the first leaf entry, we're about to move | |
469 | * the table up one to open up space for the new leaf entry. | |
470 | * Then adjust our index to match. | |
471 | */ | |
472 | blp--; | |
473 | mid++; | |
474 | if (mid) | |
32181a02 | 475 | memmove(blp, &blp[1], mid * sizeof(*blp)); |
2bd0ea18 NS |
476 | lfloglow = 0; |
477 | lfloghigh = mid; | |
478 | } | |
479 | /* | |
480 | * Use a stale leaf for our new entry. | |
481 | */ | |
482 | else { | |
483 | for (lowstale = mid; | |
484 | lowstale >= 0 && | |
a2ceac1f DC |
485 | blp[lowstale].address != |
486 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR); | |
2bd0ea18 NS |
487 | lowstale--) |
488 | continue; | |
489 | for (highstale = mid + 1; | |
5e656dbb | 490 | highstale < be32_to_cpu(btp->count) && |
a2ceac1f DC |
491 | blp[highstale].address != |
492 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR) && | |
2bd0ea18 NS |
493 | (lowstale < 0 || mid - lowstale > highstale - mid); |
494 | highstale++) | |
495 | continue; | |
496 | /* | |
497 | * Move entries toward the low-numbered stale entry. | |
498 | */ | |
499 | if (lowstale >= 0 && | |
5e656dbb | 500 | (highstale == be32_to_cpu(btp->count) || |
2bd0ea18 NS |
501 | mid - lowstale <= highstale - mid)) { |
502 | if (mid - lowstale) | |
32181a02 | 503 | memmove(&blp[lowstale], &blp[lowstale + 1], |
2bd0ea18 NS |
504 | (mid - lowstale) * sizeof(*blp)); |
505 | lfloglow = MIN(lowstale, lfloglow); | |
506 | lfloghigh = MAX(mid, lfloghigh); | |
507 | } | |
508 | /* | |
509 | * Move entries toward the high-numbered stale entry. | |
510 | */ | |
511 | else { | |
5e656dbb | 512 | ASSERT(highstale < be32_to_cpu(btp->count)); |
2bd0ea18 NS |
513 | mid++; |
514 | if (highstale - mid) | |
32181a02 | 515 | memmove(&blp[mid + 1], &blp[mid], |
2bd0ea18 NS |
516 | (highstale - mid) * sizeof(*blp)); |
517 | lfloglow = MIN(mid, lfloglow); | |
518 | lfloghigh = MAX(highstale, lfloghigh); | |
519 | } | |
5e656dbb | 520 | be32_add_cpu(&btp->stale, -1); |
2bd0ea18 NS |
521 | } |
522 | /* | |
523 | * Point to the new data entry. | |
524 | */ | |
525 | dep = (xfs_dir2_data_entry_t *)dup; | |
526 | /* | |
527 | * Fill in the leaf entry. | |
528 | */ | |
5e656dbb | 529 | blp[mid].hashval = cpu_to_be32(args->hashval); |
ff105f75 | 530 | blp[mid].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( |
a2ceac1f | 531 | (char *)dep - (char *)hdr)); |
2bd0ea18 NS |
532 | xfs_dir2_block_log_leaf(tp, bp, lfloglow, lfloghigh); |
533 | /* | |
534 | * Mark space for the data entry used. | |
535 | */ | |
ff105f75 | 536 | xfs_dir2_data_use_free(args, bp, dup, |
a2ceac1f | 537 | (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), |
2bd0ea18 NS |
538 | (xfs_dir2_data_aoff_t)len, &needlog, &needscan); |
539 | /* | |
540 | * Create the new data entry. | |
541 | */ | |
5e656dbb | 542 | dep->inumber = cpu_to_be64(args->inumber); |
2bd0ea18 | 543 | dep->namelen = args->namelen; |
32181a02 | 544 | memcpy(dep->name, args->name, args->namelen); |
ff105f75 DC |
545 | dp->d_ops->data_put_ftype(dep, args->filetype); |
546 | tagp = dp->d_ops->data_entry_tag_p(dep); | |
a2ceac1f | 547 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
2bd0ea18 NS |
548 | /* |
549 | * Clean up the bestfree array and log the header, tail, and entry. | |
550 | */ | |
551 | if (needscan) | |
19ebedcf | 552 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
2bd0ea18 | 553 | if (needlog) |
ff105f75 | 554 | xfs_dir2_data_log_header(args, bp); |
2bd0ea18 | 555 | xfs_dir2_block_log_tail(tp, bp); |
ff105f75 | 556 | xfs_dir2_data_log_entry(args, bp, dep); |
90ea28c3 | 557 | xfs_dir3_data_check(dp, bp); |
2bd0ea18 NS |
558 | return 0; |
559 | } | |
560 | ||
561 | /* | |
562 | * Log leaf entries from the block. | |
563 | */ | |
5e656dbb | 564 | static void |
2bd0ea18 NS |
565 | xfs_dir2_block_log_leaf( |
566 | xfs_trans_t *tp, /* transaction structure */ | |
a2ceac1f | 567 | struct xfs_buf *bp, /* block buffer */ |
2bd0ea18 NS |
568 | int first, /* index of first logged leaf */ |
569 | int last) /* index of last logged leaf */ | |
570 | { | |
a2ceac1f DC |
571 | xfs_dir2_data_hdr_t *hdr = bp->b_addr; |
572 | xfs_dir2_leaf_entry_t *blp; | |
573 | xfs_dir2_block_tail_t *btp; | |
2bd0ea18 | 574 | |
ff105f75 | 575 | btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr); |
5e656dbb | 576 | blp = xfs_dir2_block_leaf_p(btp); |
a2ceac1f DC |
577 | xfs_trans_log_buf(tp, bp, (uint)((char *)&blp[first] - (char *)hdr), |
578 | (uint)((char *)&blp[last + 1] - (char *)hdr - 1)); | |
2bd0ea18 NS |
579 | } |
580 | ||
581 | /* | |
582 | * Log the block tail. | |
583 | */ | |
5e656dbb | 584 | static void |
2bd0ea18 NS |
585 | xfs_dir2_block_log_tail( |
586 | xfs_trans_t *tp, /* transaction structure */ | |
a2ceac1f | 587 | struct xfs_buf *bp) /* block buffer */ |
2bd0ea18 | 588 | { |
a2ceac1f DC |
589 | xfs_dir2_data_hdr_t *hdr = bp->b_addr; |
590 | xfs_dir2_block_tail_t *btp; | |
2bd0ea18 | 591 | |
ff105f75 | 592 | btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr); |
a2ceac1f DC |
593 | xfs_trans_log_buf(tp, bp, (uint)((char *)btp - (char *)hdr), |
594 | (uint)((char *)(btp + 1) - (char *)hdr - 1)); | |
2bd0ea18 NS |
595 | } |
596 | ||
597 | /* | |
598 | * Look up an entry in the block. This is the external routine, | |
599 | * xfs_dir2_block_lookup_int does the real work. | |
600 | */ | |
601 | int /* error */ | |
602 | xfs_dir2_block_lookup( | |
603 | xfs_da_args_t *args) /* dir lookup arguments */ | |
604 | { | |
a2ceac1f | 605 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 606 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 607 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
608 | xfs_dir2_block_tail_t *btp; /* block tail */ |
609 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
610 | xfs_inode_t *dp; /* incore inode */ | |
611 | int ent; /* entry index */ | |
612 | int error; /* error return value */ | |
2bd0ea18 | 613 | |
56b2de80 DC |
614 | trace_xfs_dir2_block_lookup(args); |
615 | ||
2bd0ea18 NS |
616 | /* |
617 | * Get the buffer, look up the entry. | |
618 | * If not found (ENOENT) then return, have no buffer. | |
619 | */ | |
0e266570 | 620 | if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) |
2bd0ea18 NS |
621 | return error; |
622 | dp = args->dp; | |
a2ceac1f | 623 | hdr = bp->b_addr; |
90ea28c3 | 624 | xfs_dir3_data_check(dp, bp); |
ff105f75 | 625 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 626 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
627 | /* |
628 | * Get the offset from the leaf entry, to point to the data. | |
629 | */ | |
a2ceac1f | 630 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + |
ff105f75 DC |
631 | xfs_dir2_dataptr_to_off(args->geo, |
632 | be32_to_cpu(blp[ent].address))); | |
2bd0ea18 | 633 | /* |
5e656dbb | 634 | * Fill in inode number, CI name if appropriate, release the block. |
2bd0ea18 | 635 | */ |
5e656dbb | 636 | args->inumber = be64_to_cpu(dep->inumber); |
ff105f75 | 637 | args->filetype = dp->d_ops->data_get_ftype(dep); |
5e656dbb | 638 | error = xfs_dir_cilookup_result(args, dep->name, dep->namelen); |
a2ceac1f | 639 | xfs_trans_brelse(args->trans, bp); |
1e68581b | 640 | return error; |
2bd0ea18 NS |
641 | } |
642 | ||
643 | /* | |
644 | * Internal block lookup routine. | |
645 | */ | |
5e656dbb | 646 | static int /* error */ |
2bd0ea18 NS |
647 | xfs_dir2_block_lookup_int( |
648 | xfs_da_args_t *args, /* dir lookup arguments */ | |
a2ceac1f | 649 | struct xfs_buf **bpp, /* returned block buffer */ |
2bd0ea18 NS |
650 | int *entno) /* returned entry number */ |
651 | { | |
652 | xfs_dir2_dataptr_t addr; /* data entry address */ | |
a2ceac1f | 653 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 654 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 655 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
656 | xfs_dir2_block_tail_t *btp; /* block tail */ |
657 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
658 | xfs_inode_t *dp; /* incore inode */ | |
659 | int error; /* error return value */ | |
660 | xfs_dahash_t hash; /* found hash value */ | |
661 | int high; /* binary search high index */ | |
662 | int low; /* binary search low index */ | |
663 | int mid; /* binary search current idx */ | |
664 | xfs_mount_t *mp; /* filesystem mount point */ | |
665 | xfs_trans_t *tp; /* transaction pointer */ | |
5e656dbb | 666 | enum xfs_dacmp cmp; /* comparison result */ |
2bd0ea18 NS |
667 | |
668 | dp = args->dp; | |
669 | tp = args->trans; | |
670 | mp = dp->i_mount; | |
a2ceac1f | 671 | |
693fc8f6 | 672 | error = xfs_dir3_block_read(tp, dp, &bp); |
a2ceac1f | 673 | if (error) |
2bd0ea18 | 674 | return error; |
a2ceac1f DC |
675 | |
676 | hdr = bp->b_addr; | |
90ea28c3 | 677 | xfs_dir3_data_check(dp, bp); |
ff105f75 | 678 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 679 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
680 | /* |
681 | * Loop doing a binary search for our hash value. | |
682 | * Find our entry, ENOENT if it's not there. | |
683 | */ | |
5e656dbb | 684 | for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { |
2bd0ea18 NS |
685 | ASSERT(low <= high); |
686 | mid = (low + high) >> 1; | |
5e656dbb | 687 | if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) |
2bd0ea18 NS |
688 | break; |
689 | if (hash < args->hashval) | |
690 | low = mid + 1; | |
691 | else | |
692 | high = mid - 1; | |
693 | if (low > high) { | |
5e656dbb | 694 | ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); |
a2ceac1f | 695 | xfs_trans_brelse(tp, bp); |
12b53197 | 696 | return -ENOENT; |
2bd0ea18 NS |
697 | } |
698 | } | |
699 | /* | |
700 | * Back up to the first one with the right hash value. | |
701 | */ | |
5e656dbb | 702 | while (mid > 0 && be32_to_cpu(blp[mid - 1].hashval) == args->hashval) { |
2bd0ea18 NS |
703 | mid--; |
704 | } | |
705 | /* | |
706 | * Now loop forward through all the entries with the | |
707 | * right hash value looking for our name. | |
708 | */ | |
709 | do { | |
5e656dbb | 710 | if ((addr = be32_to_cpu(blp[mid].address)) == XFS_DIR2_NULL_DATAPTR) |
2bd0ea18 NS |
711 | continue; |
712 | /* | |
713 | * Get pointer to the entry from the leaf. | |
714 | */ | |
715 | dep = (xfs_dir2_data_entry_t *) | |
ff105f75 | 716 | ((char *)hdr + xfs_dir2_dataptr_to_off(args->geo, addr)); |
2bd0ea18 | 717 | /* |
5e656dbb BN |
718 | * Compare name and if it's an exact match, return the index |
719 | * and buffer. If it's the first case-insensitive match, store | |
720 | * the index and buffer and continue looking for an exact match. | |
2bd0ea18 | 721 | */ |
5e656dbb BN |
722 | cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen); |
723 | if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) { | |
724 | args->cmpresult = cmp; | |
2bd0ea18 NS |
725 | *bpp = bp; |
726 | *entno = mid; | |
5e656dbb BN |
727 | if (cmp == XFS_CMP_EXACT) |
728 | return 0; | |
2bd0ea18 | 729 | } |
5e656dbb BN |
730 | } while (++mid < be32_to_cpu(btp->count) && |
731 | be32_to_cpu(blp[mid].hashval) == hash); | |
732 | ||
733 | ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); | |
734 | /* | |
735 | * Here, we can only be doing a lookup (not a rename or replace). | |
736 | * If a case-insensitive match was found earlier, return success. | |
737 | */ | |
738 | if (args->cmpresult == XFS_CMP_CASE) | |
739 | return 0; | |
2bd0ea18 NS |
740 | /* |
741 | * No match, release the buffer and return ENOENT. | |
742 | */ | |
a2ceac1f | 743 | xfs_trans_brelse(tp, bp); |
12b53197 | 744 | return -ENOENT; |
2bd0ea18 NS |
745 | } |
746 | ||
747 | /* | |
748 | * Remove an entry from a block format directory. | |
749 | * If that makes the block small enough to fit in shortform, transform it. | |
750 | */ | |
751 | int /* error */ | |
752 | xfs_dir2_block_removename( | |
753 | xfs_da_args_t *args) /* directory operation args */ | |
754 | { | |
a2ceac1f | 755 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 756 | xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */ |
a2ceac1f | 757 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
758 | xfs_dir2_block_tail_t *btp; /* block tail */ |
759 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
760 | xfs_inode_t *dp; /* incore inode */ | |
761 | int ent; /* block leaf entry index */ | |
762 | int error; /* error return value */ | |
2bd0ea18 NS |
763 | int needlog; /* need to log block header */ |
764 | int needscan; /* need to fixup bestfree */ | |
765 | xfs_dir2_sf_hdr_t sfh; /* shortform header */ | |
766 | int size; /* shortform size */ | |
767 | xfs_trans_t *tp; /* transaction pointer */ | |
768 | ||
56b2de80 DC |
769 | trace_xfs_dir2_block_removename(args); |
770 | ||
2bd0ea18 NS |
771 | /* |
772 | * Look up the entry in the block. Gets the buffer and entry index. | |
773 | * It will always be there, the vnodeops level does a lookup first. | |
774 | */ | |
0e266570 | 775 | if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { |
2bd0ea18 NS |
776 | return error; |
777 | } | |
778 | dp = args->dp; | |
779 | tp = args->trans; | |
a2ceac1f | 780 | hdr = bp->b_addr; |
ff105f75 | 781 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 782 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
783 | /* |
784 | * Point to the data entry using the leaf entry. | |
785 | */ | |
ff105f75 DC |
786 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + |
787 | xfs_dir2_dataptr_to_off(args->geo, | |
788 | be32_to_cpu(blp[ent].address))); | |
2bd0ea18 NS |
789 | /* |
790 | * Mark the data entry's space free. | |
791 | */ | |
792 | needlog = needscan = 0; | |
ff105f75 | 793 | xfs_dir2_data_make_free(args, bp, |
a2ceac1f | 794 | (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr), |
ff105f75 | 795 | dp->d_ops->data_entsize(dep->namelen), &needlog, &needscan); |
2bd0ea18 NS |
796 | /* |
797 | * Fix up the block tail. | |
798 | */ | |
5e656dbb | 799 | be32_add_cpu(&btp->stale, 1); |
2bd0ea18 NS |
800 | xfs_dir2_block_log_tail(tp, bp); |
801 | /* | |
802 | * Remove the leaf entry by marking it stale. | |
803 | */ | |
5e656dbb | 804 | blp[ent].address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); |
2bd0ea18 NS |
805 | xfs_dir2_block_log_leaf(tp, bp, ent, ent); |
806 | /* | |
807 | * Fix up bestfree, log the header if necessary. | |
808 | */ | |
809 | if (needscan) | |
19ebedcf | 810 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
2bd0ea18 | 811 | if (needlog) |
ff105f75 | 812 | xfs_dir2_data_log_header(args, bp); |
90ea28c3 | 813 | xfs_dir3_data_check(dp, bp); |
2bd0ea18 NS |
814 | /* |
815 | * See if the size as a shortform is good enough. | |
816 | */ | |
a2ceac1f DC |
817 | size = xfs_dir2_block_sfsize(dp, hdr, &sfh); |
818 | if (size > XFS_IFORK_DSIZE(dp)) | |
2bd0ea18 | 819 | return 0; |
a2ceac1f | 820 | |
2bd0ea18 NS |
821 | /* |
822 | * If it works, do the conversion. | |
823 | */ | |
824 | return xfs_dir2_block_to_sf(args, bp, size, &sfh); | |
825 | } | |
826 | ||
827 | /* | |
828 | * Replace an entry in a V2 block directory. | |
829 | * Change the inode number to the new value. | |
830 | */ | |
831 | int /* error */ | |
832 | xfs_dir2_block_replace( | |
833 | xfs_da_args_t *args) /* directory operation args */ | |
834 | { | |
a2ceac1f | 835 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 | 836 | xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ |
a2ceac1f | 837 | struct xfs_buf *bp; /* block buffer */ |
2bd0ea18 NS |
838 | xfs_dir2_block_tail_t *btp; /* block tail */ |
839 | xfs_dir2_data_entry_t *dep; /* block data entry */ | |
840 | xfs_inode_t *dp; /* incore inode */ | |
841 | int ent; /* leaf entry index */ | |
842 | int error; /* error return value */ | |
2bd0ea18 | 843 | |
56b2de80 DC |
844 | trace_xfs_dir2_block_replace(args); |
845 | ||
2bd0ea18 NS |
846 | /* |
847 | * Lookup the entry in the directory. Get buffer and entry index. | |
848 | * This will always succeed since the caller has already done a lookup. | |
849 | */ | |
0e266570 | 850 | if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { |
2bd0ea18 NS |
851 | return error; |
852 | } | |
853 | dp = args->dp; | |
a2ceac1f | 854 | hdr = bp->b_addr; |
ff105f75 | 855 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
5e656dbb | 856 | blp = xfs_dir2_block_leaf_p(btp); |
2bd0ea18 NS |
857 | /* |
858 | * Point to the data entry we need to change. | |
859 | */ | |
ff105f75 DC |
860 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + |
861 | xfs_dir2_dataptr_to_off(args->geo, | |
862 | be32_to_cpu(blp[ent].address))); | |
5e656dbb | 863 | ASSERT(be64_to_cpu(dep->inumber) != args->inumber); |
2bd0ea18 NS |
864 | /* |
865 | * Change the inode number to the new value. | |
866 | */ | |
5e656dbb | 867 | dep->inumber = cpu_to_be64(args->inumber); |
ff105f75 DC |
868 | dp->d_ops->data_put_ftype(dep, args->filetype); |
869 | xfs_dir2_data_log_entry(args, bp, dep); | |
90ea28c3 | 870 | xfs_dir3_data_check(dp, bp); |
2bd0ea18 NS |
871 | return 0; |
872 | } | |
873 | ||
874 | /* | |
875 | * Qsort comparison routine for the block leaf entries. | |
876 | */ | |
877 | static int /* sort order */ | |
878 | xfs_dir2_block_sort( | |
879 | const void *a, /* first leaf entry */ | |
880 | const void *b) /* second leaf entry */ | |
881 | { | |
882 | const xfs_dir2_leaf_entry_t *la; /* first leaf entry */ | |
883 | const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */ | |
884 | ||
885 | la = a; | |
886 | lb = b; | |
5e656dbb BN |
887 | return be32_to_cpu(la->hashval) < be32_to_cpu(lb->hashval) ? -1 : |
888 | (be32_to_cpu(la->hashval) > be32_to_cpu(lb->hashval) ? 1 : 0); | |
2bd0ea18 NS |
889 | } |
890 | ||
891 | /* | |
892 | * Convert a V2 leaf directory to a V2 block directory if possible. | |
893 | */ | |
894 | int /* error */ | |
895 | xfs_dir2_leaf_to_block( | |
896 | xfs_da_args_t *args, /* operation arguments */ | |
a2ceac1f DC |
897 | struct xfs_buf *lbp, /* leaf buffer */ |
898 | struct xfs_buf *dbp) /* data buffer */ | |
2bd0ea18 | 899 | { |
5e656dbb | 900 | __be16 *bestsp; /* leaf bests table */ |
a2ceac1f | 901 | xfs_dir2_data_hdr_t *hdr; /* block header */ |
2bd0ea18 NS |
902 | xfs_dir2_block_tail_t *btp; /* block tail */ |
903 | xfs_inode_t *dp; /* incore directory inode */ | |
904 | xfs_dir2_data_unused_t *dup; /* unused data entry */ | |
905 | int error; /* error return value */ | |
906 | int from; /* leaf from index */ | |
907 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
908 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
909 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ | |
910 | xfs_mount_t *mp; /* file system mount point */ | |
911 | int needlog; /* need to log data header */ | |
912 | int needscan; /* need to scan for bestfree */ | |
913 | xfs_dir2_sf_hdr_t sfh; /* shortform header */ | |
914 | int size; /* bytes used */ | |
5e656dbb | 915 | __be16 *tagp; /* end of entry (tag) */ |
2bd0ea18 NS |
916 | int to; /* block/leaf to index */ |
917 | xfs_trans_t *tp; /* transaction pointer */ | |
65b80c98 DC |
918 | struct xfs_dir2_leaf_entry *ents; |
919 | struct xfs_dir3_icleaf_hdr leafhdr; | |
2bd0ea18 | 920 | |
56b2de80 DC |
921 | trace_xfs_dir2_leaf_to_block(args); |
922 | ||
2bd0ea18 NS |
923 | dp = args->dp; |
924 | tp = args->trans; | |
925 | mp = dp->i_mount; | |
a2ceac1f | 926 | leaf = lbp->b_addr; |
ff105f75 DC |
927 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
928 | ents = dp->d_ops->leaf_ents_p(leaf); | |
929 | ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); | |
65b80c98 DC |
930 | |
931 | ASSERT(leafhdr.magic == XFS_DIR2_LEAF1_MAGIC || | |
932 | leafhdr.magic == XFS_DIR3_LEAF1_MAGIC); | |
2bd0ea18 NS |
933 | /* |
934 | * If there are data blocks other than the first one, take this | |
935 | * opportunity to remove trailing empty data blocks that may have | |
936 | * been left behind during no-space-reservation operations. | |
937 | * These will show up in the leaf bests table. | |
938 | */ | |
ff105f75 | 939 | while (dp->i_d.di_size > args->geo->blksize) { |
693fc8f6 DC |
940 | int hdrsz; |
941 | ||
ff105f75 | 942 | hdrsz = dp->d_ops->data_entry_offset; |
5e656dbb BN |
943 | bestsp = xfs_dir2_leaf_bests_p(ltp); |
944 | if (be16_to_cpu(bestsp[be32_to_cpu(ltp->bestcount) - 1]) == | |
ff105f75 | 945 | args->geo->blksize - hdrsz) { |
0e266570 | 946 | if ((error = |
2bd0ea18 | 947 | xfs_dir2_leaf_trim_data(args, lbp, |
5e656dbb | 948 | (xfs_dir2_db_t)(be32_to_cpu(ltp->bestcount) - 1)))) |
a2ceac1f DC |
949 | return error; |
950 | } else | |
951 | return 0; | |
2bd0ea18 NS |
952 | } |
953 | /* | |
954 | * Read the data block if we don't already have it, give up if it fails. | |
955 | */ | |
a2ceac1f | 956 | if (!dbp) { |
ff105f75 | 957 | error = xfs_dir3_data_read(tp, dp, args->geo->datablk, -1, &dbp); |
a2ceac1f DC |
958 | if (error) |
959 | return error; | |
2bd0ea18 | 960 | } |
a2ceac1f | 961 | hdr = dbp->b_addr; |
90ea28c3 DC |
962 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
963 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)); | |
964 | ||
2bd0ea18 NS |
965 | /* |
966 | * Size of the "leaf" area in the block. | |
967 | */ | |
a2ceac1f | 968 | size = (uint)sizeof(xfs_dir2_block_tail_t) + |
65b80c98 | 969 | (uint)sizeof(*lep) * (leafhdr.count - leafhdr.stale); |
2bd0ea18 NS |
970 | /* |
971 | * Look at the last data entry. | |
972 | */ | |
ff105f75 | 973 | tagp = (__be16 *)((char *)hdr + args->geo->blksize) - 1; |
a2ceac1f | 974 | dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); |
2bd0ea18 NS |
975 | /* |
976 | * If it's not free or is too short we can't do it. | |
977 | */ | |
5e656dbb | 978 | if (be16_to_cpu(dup->freetag) != XFS_DIR2_DATA_FREE_TAG || |
a2ceac1f DC |
979 | be16_to_cpu(dup->length) < size) |
980 | return 0; | |
981 | ||
2bd0ea18 NS |
982 | /* |
983 | * Start converting it to block form. | |
984 | */ | |
8b4dc4a9 | 985 | xfs_dir3_block_init(mp, tp, dbp, dp); |
693fc8f6 | 986 | |
2bd0ea18 NS |
987 | needlog = 1; |
988 | needscan = 0; | |
989 | /* | |
990 | * Use up the space at the end of the block (blp/btp). | |
991 | */ | |
ff105f75 | 992 | xfs_dir2_data_use_free(args, dbp, dup, args->geo->blksize - size, size, |
2bd0ea18 NS |
993 | &needlog, &needscan); |
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); | |
1105 | if (error) { | |
a2ceac1f | 1106 | kmem_free(sfp); |
2bd0ea18 NS |
1107 | return error; |
1108 | } | |
1109 | /* | |
693fc8f6 | 1110 | * Initialize the data block, then convert it to block format. |
2bd0ea18 | 1111 | */ |
693fc8f6 | 1112 | error = xfs_dir3_data_init(args, blkno, &bp); |
2bd0ea18 | 1113 | if (error) { |
a2ceac1f | 1114 | kmem_free(sfp); |
2bd0ea18 NS |
1115 | return error; |
1116 | } | |
8b4dc4a9 | 1117 | xfs_dir3_block_init(mp, tp, bp, dp); |
a2ceac1f | 1118 | hdr = bp->b_addr; |
693fc8f6 | 1119 | |
2bd0ea18 NS |
1120 | /* |
1121 | * Compute size of block "tail" area. | |
1122 | */ | |
1123 | i = (uint)sizeof(*btp) + | |
a2ceac1f | 1124 | (sfp->count + 2) * (uint)sizeof(xfs_dir2_leaf_entry_t); |
2bd0ea18 NS |
1125 | /* |
1126 | * The whole thing is initialized to free by the init routine. | |
1127 | * Say we're using the leaf and tail area. | |
1128 | */ | |
ff105f75 | 1129 | dup = dp->d_ops->data_unused_p(hdr); |
2bd0ea18 | 1130 | needlog = needscan = 0; |
ff105f75 DC |
1131 | xfs_dir2_data_use_free(args, bp, dup, args->geo->blksize - i, |
1132 | i, &needlog, &needscan); | |
2bd0ea18 NS |
1133 | ASSERT(needscan == 0); |
1134 | /* | |
1135 | * Fill in the tail. | |
1136 | */ | |
ff105f75 | 1137 | btp = xfs_dir2_block_tail_p(args->geo, hdr); |
a2ceac1f | 1138 | btp->count = cpu_to_be32(sfp->count + 2); /* ., .. */ |
46eca962 | 1139 | btp->stale = 0; |
5e656dbb | 1140 | blp = xfs_dir2_block_leaf_p(btp); |
a2ceac1f | 1141 | endoffset = (uint)((char *)blp - (char *)hdr); |
2bd0ea18 NS |
1142 | /* |
1143 | * Remove the freespace, we'll manage it. | |
1144 | */ | |
ff105f75 | 1145 | xfs_dir2_data_use_free(args, bp, dup, |
a2ceac1f | 1146 | (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), |
5e656dbb | 1147 | be16_to_cpu(dup->length), &needlog, &needscan); |
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 NS |
1250 | return 0; |
1251 | } |