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