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