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