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