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