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