~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

TOMOYO Linux Cross Reference
Linux/fs/xfs/xfs_dir2_leaf.c

Version: ~ [ linux-5.12-rc1 ] ~ [ linux-5.11.2 ] ~ [ linux-5.10.19 ] ~ [ linux-5.9.16 ] ~ [ linux-5.8.18 ] ~ [ linux-5.7.19 ] ~ [ linux-5.6.19 ] ~ [ linux-5.5.19 ] ~ [ linux-5.4.101 ] ~ [ linux-5.3.18 ] ~ [ linux-5.2.21 ] ~ [ linux-5.1.21 ] ~ [ linux-5.0.21 ] ~ [ linux-4.20.17 ] ~ [ linux-4.19.177 ] ~ [ linux-4.18.20 ] ~ [ linux-4.17.19 ] ~ [ linux-4.16.18 ] ~ [ linux-4.15.18 ] ~ [ linux-4.14.222 ] ~ [ linux-4.13.16 ] ~ [ linux-4.12.14 ] ~ [ linux-4.11.12 ] ~ [ linux-4.10.17 ] ~ [ linux-4.9.258 ] ~ [ linux-4.8.17 ] ~ [ linux-4.7.10 ] ~ [ linux-4.6.7 ] ~ [ linux-4.5.7 ] ~ [ linux-4.4.258 ] ~ [ linux-4.3.6 ] ~ [ linux-4.2.8 ] ~ [ linux-4.1.52 ] ~ [ linux-4.0.9 ] ~ [ linux-3.18.140 ] ~ [ linux-3.16.85 ] ~ [ linux-3.14.79 ] ~ [ linux-3.12.74 ] ~ [ linux-3.10.108 ] ~ [ linux-2.6.32.71 ] ~ [ linux-2.6.0 ] ~ [ linux-2.4.37.11 ] ~ [ unix-v6-master ] ~ [ ccs-tools-1.8.5 ] ~ [ policy-sample ] ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  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_bit.h"
 22 #include "xfs_log.h"
 23 #include "xfs_inum.h"
 24 #include "xfs_trans.h"
 25 #include "xfs_sb.h"
 26 #include "xfs_ag.h"
 27 #include "xfs_dir2.h"
 28 #include "xfs_dmapi.h"
 29 #include "xfs_mount.h"
 30 #include "xfs_da_btree.h"
 31 #include "xfs_bmap_btree.h"
 32 #include "xfs_attr_sf.h"
 33 #include "xfs_dir2_sf.h"
 34 #include "xfs_dinode.h"
 35 #include "xfs_inode.h"
 36 #include "xfs_bmap.h"
 37 #include "xfs_dir2_data.h"
 38 #include "xfs_dir2_leaf.h"
 39 #include "xfs_dir2_block.h"
 40 #include "xfs_dir2_node.h"
 41 #include "xfs_dir2_trace.h"
 42 #include "xfs_error.h"
 43 
 44 /*
 45  * Local function declarations.
 46  */
 47 #ifdef DEBUG
 48 static void xfs_dir2_leaf_check(xfs_inode_t *dp, xfs_dabuf_t *bp);
 49 #else
 50 #define xfs_dir2_leaf_check(dp, bp)
 51 #endif
 52 static int xfs_dir2_leaf_lookup_int(xfs_da_args_t *args, xfs_dabuf_t **lbpp,
 53                                     int *indexp, xfs_dabuf_t **dbpp);
 54 static void xfs_dir2_leaf_log_bests(struct xfs_trans *tp, struct xfs_dabuf *bp,
 55                                     int first, int last);
 56 static void xfs_dir2_leaf_log_tail(struct xfs_trans *tp, struct xfs_dabuf *bp);
 57 
 58 
 59 /*
 60  * Convert a block form directory to a leaf form directory.
 61  */
 62 int                                             /* error */
 63 xfs_dir2_block_to_leaf(
 64         xfs_da_args_t           *args,          /* operation arguments */
 65         xfs_dabuf_t             *dbp)           /* input block's buffer */
 66 {
 67         __be16                  *bestsp;        /* leaf's bestsp entries */
 68         xfs_dablk_t             blkno;          /* leaf block's bno */
 69         xfs_dir2_block_t        *block;         /* block structure */
 70         xfs_dir2_leaf_entry_t   *blp;           /* block's leaf entries */
 71         xfs_dir2_block_tail_t   *btp;           /* block's tail */
 72         xfs_inode_t             *dp;            /* incore directory inode */
 73         int                     error;          /* error return code */
 74         xfs_dabuf_t             *lbp;           /* leaf block's buffer */
 75         xfs_dir2_db_t           ldb;            /* leaf block's bno */
 76         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
 77         xfs_dir2_leaf_tail_t    *ltp;           /* leaf's tail */
 78         xfs_mount_t             *mp;            /* filesystem mount point */
 79         int                     needlog;        /* need to log block header */
 80         int                     needscan;       /* need to rescan bestfree */
 81         xfs_trans_t             *tp;            /* transaction pointer */
 82 
 83         xfs_dir2_trace_args_b("block_to_leaf", args, dbp);
 84         dp = args->dp;
 85         mp = dp->i_mount;
 86         tp = args->trans;
 87         /*
 88          * Add the leaf block to the inode.
 89          * This interface will only put blocks in the leaf/node range.
 90          * Since that's empty now, we'll get the root (block 0 in range).
 91          */
 92         if ((error = xfs_da_grow_inode(args, &blkno))) {
 93                 return error;
 94         }
 95         ldb = xfs_dir2_da_to_db(mp, blkno);
 96         ASSERT(ldb == XFS_DIR2_LEAF_FIRSTDB(mp));
 97         /*
 98          * Initialize the leaf block, get a buffer for it.
 99          */
100         if ((error = xfs_dir2_leaf_init(args, ldb, &lbp, XFS_DIR2_LEAF1_MAGIC))) {
101                 return error;
102         }
103         ASSERT(lbp != NULL);
104         leaf = lbp->data;
105         block = dbp->data;
106         xfs_dir2_data_check(dp, dbp);
107         btp = xfs_dir2_block_tail_p(mp, block);
108         blp = xfs_dir2_block_leaf_p(btp);
109         /*
110          * Set the counts in the leaf header.
111          */
112         leaf->hdr.count = cpu_to_be16(be32_to_cpu(btp->count));
113         leaf->hdr.stale = cpu_to_be16(be32_to_cpu(btp->stale));
114         /*
115          * Could compact these but I think we always do the conversion
116          * after squeezing out stale entries.
117          */
118         memcpy(leaf->ents, blp, be32_to_cpu(btp->count) * sizeof(xfs_dir2_leaf_entry_t));
119         xfs_dir2_leaf_log_ents(tp, lbp, 0, be16_to_cpu(leaf->hdr.count) - 1);
120         needscan = 0;
121         needlog = 1;
122         /*
123          * Make the space formerly occupied by the leaf entries and block
124          * tail be free.
125          */
126         xfs_dir2_data_make_free(tp, dbp,
127                 (xfs_dir2_data_aoff_t)((char *)blp - (char *)block),
128                 (xfs_dir2_data_aoff_t)((char *)block + mp->m_dirblksize -
129                                        (char *)blp),
130                 &needlog, &needscan);
131         /*
132          * Fix up the block header, make it a data block.
133          */
134         block->hdr.magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC);
135         if (needscan)
136                 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog);
137         /*
138          * Set up leaf tail and bests table.
139          */
140         ltp = xfs_dir2_leaf_tail_p(mp, leaf);
141         ltp->bestcount = cpu_to_be32(1);
142         bestsp = xfs_dir2_leaf_bests_p(ltp);
143         bestsp[0] =  block->hdr.bestfree[0].length;
144         /*
145          * Log the data header and leaf bests table.
146          */
147         if (needlog)
148                 xfs_dir2_data_log_header(tp, dbp);
149         xfs_dir2_leaf_check(dp, lbp);
150         xfs_dir2_data_check(dp, dbp);
151         xfs_dir2_leaf_log_bests(tp, lbp, 0, 0);
152         xfs_da_buf_done(lbp);
153         return 0;
154 }
155 
156 /*
157  * Add an entry to a leaf form directory.
158  */
159 int                                             /* error */
160 xfs_dir2_leaf_addname(
161         xfs_da_args_t           *args)          /* operation arguments */
162 {
163         __be16                  *bestsp;        /* freespace table in leaf */
164         int                     compact;        /* need to compact leaves */
165         xfs_dir2_data_t         *data;          /* data block structure */
166         xfs_dabuf_t             *dbp;           /* data block buffer */
167         xfs_dir2_data_entry_t   *dep;           /* data block entry */
168         xfs_inode_t             *dp;            /* incore directory inode */
169         xfs_dir2_data_unused_t  *dup;           /* data unused entry */
170         int                     error;          /* error return value */
171         int                     grown;          /* allocated new data block */
172         int                     highstale;      /* index of next stale leaf */
173         int                     i;              /* temporary, index */
174         int                     index;          /* leaf table position */
175         xfs_dabuf_t             *lbp;           /* leaf's buffer */
176         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
177         int                     length;         /* length of new entry */
178         xfs_dir2_leaf_entry_t   *lep;           /* leaf entry table pointer */
179         int                     lfloglow;       /* low leaf logging index */
180         int                     lfloghigh;      /* high leaf logging index */
181         int                     lowstale;       /* index of prev stale leaf */
182         xfs_dir2_leaf_tail_t    *ltp;           /* leaf tail pointer */
183         xfs_mount_t             *mp;            /* filesystem mount point */
184         int                     needbytes;      /* leaf block bytes needed */
185         int                     needlog;        /* need to log data header */
186         int                     needscan;       /* need to rescan data free */
187         __be16                  *tagp;          /* end of data entry */
188         xfs_trans_t             *tp;            /* transaction pointer */
189         xfs_dir2_db_t           use_block;      /* data block number */
190 
191         xfs_dir2_trace_args("leaf_addname", args);
192         dp = args->dp;
193         tp = args->trans;
194         mp = dp->i_mount;
195         /*
196          * Read the leaf block.
197          */
198         error = xfs_da_read_buf(tp, dp, mp->m_dirleafblk, -1, &lbp,
199                 XFS_DATA_FORK);
200         if (error) {
201                 return error;
202         }
203         ASSERT(lbp != NULL);
204         /*
205          * Look up the entry by hash value and name.
206          * We know it's not there, our caller has already done a lookup.
207          * So the index is of the entry to insert in front of.
208          * But if there are dup hash values the index is of the first of those.
209          */
210         index = xfs_dir2_leaf_search_hash(args, lbp);
211         leaf = lbp->data;
212         ltp = xfs_dir2_leaf_tail_p(mp, leaf);
213         bestsp = xfs_dir2_leaf_bests_p(ltp);
214         length = xfs_dir2_data_entsize(args->namelen);
215         /*
216          * See if there are any entries with the same hash value
217          * and space in their block for the new entry.
218          * This is good because it puts multiple same-hash value entries
219          * in a data block, improving the lookup of those entries.
220          */
221         for (use_block = -1, lep = &leaf->ents[index];
222              index < be16_to_cpu(leaf->hdr.count) && be32_to_cpu(lep->hashval) == args->hashval;
223              index++, lep++) {
224                 if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR)
225                         continue;
226                 i = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address));
227                 ASSERT(i < be32_to_cpu(ltp->bestcount));
228                 ASSERT(be16_to_cpu(bestsp[i]) != NULLDATAOFF);
229                 if (be16_to_cpu(bestsp[i]) >= length) {
230                         use_block = i;
231                         break;
232                 }
233         }
234         /*
235          * Didn't find a block yet, linear search all the data blocks.
236          */
237         if (use_block == -1) {
238                 for (i = 0; i < be32_to_cpu(ltp->bestcount); i++) {
239                         /*
240                          * Remember a block we see that's missing.
241                          */
242                         if (be16_to_cpu(bestsp[i]) == NULLDATAOFF && use_block == -1)
243                                 use_block = i;
244                         else if (be16_to_cpu(bestsp[i]) >= length) {
245                                 use_block = i;
246                                 break;
247                         }
248                 }
249         }
250         /*
251          * How many bytes do we need in the leaf block?
252          */
253         needbytes =
254                 (leaf->hdr.stale ? 0 : (uint)sizeof(leaf->ents[0])) +
255                 (use_block != -1 ? 0 : (uint)sizeof(leaf->bests[0]));
256         /*
257          * Now kill use_block if it refers to a missing block, so we
258          * can use it as an indication of allocation needed.
259          */
260         if (use_block != -1 && be16_to_cpu(bestsp[use_block]) == NULLDATAOFF)
261                 use_block = -1;
262         /*
263          * If we don't have enough free bytes but we can make enough
264          * by compacting out stale entries, we'll do that.
265          */
266         if ((char *)bestsp - (char *)&leaf->ents[be16_to_cpu(leaf->hdr.count)] <
267                                 needbytes && be16_to_cpu(leaf->hdr.stale) > 1) {
268                 compact = 1;
269         }
270         /*
271          * Otherwise if we don't have enough free bytes we need to
272          * convert to node form.
273          */
274         else if ((char *)bestsp - (char *)&leaf->ents[be16_to_cpu(
275                                                 leaf->hdr.count)] < needbytes) {
276                 /*
277                  * Just checking or no space reservation, give up.
278                  */
279                 if ((args->op_flags & XFS_DA_OP_JUSTCHECK) ||
280                                                         args->total == 0) {
281                         xfs_da_brelse(tp, lbp);
282                         return XFS_ERROR(ENOSPC);
283                 }
284                 /*
285                  * Convert to node form.
286                  */
287                 error = xfs_dir2_leaf_to_node(args, lbp);
288                 xfs_da_buf_done(lbp);
289                 if (error)
290                         return error;
291                 /*
292                  * Then add the new entry.
293                  */
294                 return xfs_dir2_node_addname(args);
295         }
296         /*
297          * Otherwise it will fit without compaction.
298          */
299         else
300                 compact = 0;
301         /*
302          * If just checking, then it will fit unless we needed to allocate
303          * a new data block.
304          */
305         if (args->op_flags & XFS_DA_OP_JUSTCHECK) {
306                 xfs_da_brelse(tp, lbp);
307                 return use_block == -1 ? XFS_ERROR(ENOSPC) : 0;
308         }
309         /*
310          * If no allocations are allowed, return now before we've
311          * changed anything.
312          */
313         if (args->total == 0 && use_block == -1) {
314                 xfs_da_brelse(tp, lbp);
315                 return XFS_ERROR(ENOSPC);
316         }
317         /*
318          * Need to compact the leaf entries, removing stale ones.
319          * Leave one stale entry behind - the one closest to our
320          * insertion index - and we'll shift that one to our insertion
321          * point later.
322          */
323         if (compact) {
324                 xfs_dir2_leaf_compact_x1(lbp, &index, &lowstale, &highstale,
325                         &lfloglow, &lfloghigh);
326         }
327         /*
328          * There are stale entries, so we'll need log-low and log-high
329          * impossibly bad values later.
330          */
331         else if (be16_to_cpu(leaf->hdr.stale)) {
332                 lfloglow = be16_to_cpu(leaf->hdr.count);
333                 lfloghigh = -1;
334         }
335         /*
336          * If there was no data block space found, we need to allocate
337          * a new one.
338          */
339         if (use_block == -1) {
340                 /*
341                  * Add the new data block.
342                  */
343                 if ((error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE,
344                                 &use_block))) {
345                         xfs_da_brelse(tp, lbp);
346                         return error;
347                 }
348                 /*
349                  * Initialize the block.
350                  */
351                 if ((error = xfs_dir2_data_init(args, use_block, &dbp))) {
352                         xfs_da_brelse(tp, lbp);
353                         return error;
354                 }
355                 /*
356                  * If we're adding a new data block on the end we need to
357                  * extend the bests table.  Copy it up one entry.
358                  */
359                 if (use_block >= be32_to_cpu(ltp->bestcount)) {
360                         bestsp--;
361                         memmove(&bestsp[0], &bestsp[1],
362                                 be32_to_cpu(ltp->bestcount) * sizeof(bestsp[0]));
363                         be32_add_cpu(&ltp->bestcount, 1);
364                         xfs_dir2_leaf_log_tail(tp, lbp);
365                         xfs_dir2_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
366                 }
367                 /*
368                  * If we're filling in a previously empty block just log it.
369                  */
370                 else
371                         xfs_dir2_leaf_log_bests(tp, lbp, use_block, use_block);
372                 data = dbp->data;
373                 bestsp[use_block] = data->hdr.bestfree[0].length;
374                 grown = 1;
375         }
376         /*
377          * Already had space in some data block.
378          * Just read that one in.
379          */
380         else {
381                 if ((error =
382                     xfs_da_read_buf(tp, dp, xfs_dir2_db_to_da(mp, use_block),
383                             -1, &dbp, XFS_DATA_FORK))) {
384                         xfs_da_brelse(tp, lbp);
385                         return error;
386                 }
387                 data = dbp->data;
388                 grown = 0;
389         }
390         xfs_dir2_data_check(dp, dbp);
391         /*
392          * Point to the biggest freespace in our data block.
393          */
394         dup = (xfs_dir2_data_unused_t *)
395               ((char *)data + be16_to_cpu(data->hdr.bestfree[0].offset));
396         ASSERT(be16_to_cpu(dup->length) >= length);
397         needscan = needlog = 0;
398         /*
399          * Mark the initial part of our freespace in use for the new entry.
400          */
401         xfs_dir2_data_use_free(tp, dbp, dup,
402                 (xfs_dir2_data_aoff_t)((char *)dup - (char *)data), length,
403                 &needlog, &needscan);
404         /*
405          * Initialize our new entry (at last).
406          */
407         dep = (xfs_dir2_data_entry_t *)dup;
408         dep->inumber = cpu_to_be64(args->inumber);
409         dep->namelen = args->namelen;
410         memcpy(dep->name, args->name, dep->namelen);
411         tagp = xfs_dir2_data_entry_tag_p(dep);
412         *tagp = cpu_to_be16((char *)dep - (char *)data);
413         /*
414          * Need to scan fix up the bestfree table.
415          */
416         if (needscan)
417                 xfs_dir2_data_freescan(mp, data, &needlog);
418         /*
419          * Need to log the data block's header.
420          */
421         if (needlog)
422                 xfs_dir2_data_log_header(tp, dbp);
423         xfs_dir2_data_log_entry(tp, dbp, dep);
424         /*
425          * If the bests table needs to be changed, do it.
426          * Log the change unless we've already done that.
427          */
428         if (be16_to_cpu(bestsp[use_block]) != be16_to_cpu(data->hdr.bestfree[0].length)) {
429                 bestsp[use_block] = data->hdr.bestfree[0].length;
430                 if (!grown)
431                         xfs_dir2_leaf_log_bests(tp, lbp, use_block, use_block);
432         }
433         /*
434          * Now we need to make room to insert the leaf entry.
435          * If there are no stale entries, we just insert a hole at index.
436          */
437         if (!leaf->hdr.stale) {
438                 /*
439                  * lep is still good as the index leaf entry.
440                  */
441                 if (index < be16_to_cpu(leaf->hdr.count))
442                         memmove(lep + 1, lep,
443                                 (be16_to_cpu(leaf->hdr.count) - index) * sizeof(*lep));
444                 /*
445                  * Record low and high logging indices for the leaf.
446                  */
447                 lfloglow = index;
448                 lfloghigh = be16_to_cpu(leaf->hdr.count);
449                 be16_add_cpu(&leaf->hdr.count, 1);
450         }
451         /*
452          * There are stale entries.
453          * We will use one of them for the new entry.
454          * It's probably not at the right location, so we'll have to
455          * shift some up or down first.
456          */
457         else {
458                 /*
459                  * If we didn't compact before, we need to find the nearest
460                  * stale entries before and after our insertion point.
461                  */
462                 if (compact == 0) {
463                         /*
464                          * Find the first stale entry before the insertion
465                          * point, if any.
466                          */
467                         for (lowstale = index - 1;
468                              lowstale >= 0 &&
469                                 be32_to_cpu(leaf->ents[lowstale].address) !=
470                                 XFS_DIR2_NULL_DATAPTR;
471                              lowstale--)
472                                 continue;
473                         /*
474                          * Find the next stale entry at or after the insertion
475                          * point, if any.   Stop if we go so far that the
476                          * lowstale entry would be better.
477                          */
478                         for (highstale = index;
479                              highstale < be16_to_cpu(leaf->hdr.count) &&
480                                 be32_to_cpu(leaf->ents[highstale].address) !=
481                                 XFS_DIR2_NULL_DATAPTR &&
482                                 (lowstale < 0 ||
483                                  index - lowstale - 1 >= highstale - index);
484                              highstale++)
485                                 continue;
486                 }
487                 /*
488                  * If the low one is better, use it.
489                  */
490                 if (lowstale >= 0 &&
491                     (highstale == be16_to_cpu(leaf->hdr.count) ||
492                      index - lowstale - 1 < highstale - index)) {
493                         ASSERT(index - lowstale - 1 >= 0);
494                         ASSERT(be32_to_cpu(leaf->ents[lowstale].address) ==
495                                XFS_DIR2_NULL_DATAPTR);
496                         /*
497                          * Copy entries up to cover the stale entry
498                          * and make room for the new entry.
499                          */
500                         if (index - lowstale - 1 > 0)
501                                 memmove(&leaf->ents[lowstale],
502                                         &leaf->ents[lowstale + 1],
503                                         (index - lowstale - 1) * sizeof(*lep));
504                         lep = &leaf->ents[index - 1];
505                         lfloglow = MIN(lowstale, lfloglow);
506                         lfloghigh = MAX(index - 1, lfloghigh);
507                 }
508                 /*
509                  * The high one is better, so use that one.
510                  */
511                 else {
512                         ASSERT(highstale - index >= 0);
513                         ASSERT(be32_to_cpu(leaf->ents[highstale].address) ==
514                                XFS_DIR2_NULL_DATAPTR);
515                         /*
516                          * Copy entries down to cover the stale entry
517                          * and make room for the new entry.
518                          */
519                         if (highstale - index > 0)
520                                 memmove(&leaf->ents[index + 1],
521                                         &leaf->ents[index],
522                                         (highstale - index) * sizeof(*lep));
523                         lep = &leaf->ents[index];
524                         lfloglow = MIN(index, lfloglow);
525                         lfloghigh = MAX(highstale, lfloghigh);
526                 }
527                 be16_add_cpu(&leaf->hdr.stale, -1);
528         }
529         /*
530          * Fill in the new leaf entry.
531          */
532         lep->hashval = cpu_to_be32(args->hashval);
533         lep->address = cpu_to_be32(xfs_dir2_db_off_to_dataptr(mp, use_block,
534                                 be16_to_cpu(*tagp)));
535         /*
536          * Log the leaf fields and give up the buffers.
537          */
538         xfs_dir2_leaf_log_header(tp, lbp);
539         xfs_dir2_leaf_log_ents(tp, lbp, lfloglow, lfloghigh);
540         xfs_dir2_leaf_check(dp, lbp);
541         xfs_da_buf_done(lbp);
542         xfs_dir2_data_check(dp, dbp);
543         xfs_da_buf_done(dbp);
544         return 0;
545 }
546 
547 #ifdef DEBUG
548 /*
549  * Check the internal consistency of a leaf1 block.
550  * Pop an assert if something is wrong.
551  */
552 STATIC void
553 xfs_dir2_leaf_check(
554         xfs_inode_t             *dp,            /* incore directory inode */
555         xfs_dabuf_t             *bp)            /* leaf's buffer */
556 {
557         int                     i;              /* leaf index */
558         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
559         xfs_dir2_leaf_tail_t    *ltp;           /* leaf tail pointer */
560         xfs_mount_t             *mp;            /* filesystem mount point */
561         int                     stale;          /* count of stale leaves */
562 
563         leaf = bp->data;
564         mp = dp->i_mount;
565         ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAF1_MAGIC);
566         /*
567          * This value is not restrictive enough.
568          * Should factor in the size of the bests table as well.
569          * We can deduce a value for that from di_size.
570          */
571         ASSERT(be16_to_cpu(leaf->hdr.count) <= xfs_dir2_max_leaf_ents(mp));
572         ltp = xfs_dir2_leaf_tail_p(mp, leaf);
573         /*
574          * Leaves and bests don't overlap.
575          */
576         ASSERT((char *)&leaf->ents[be16_to_cpu(leaf->hdr.count)] <=
577                (char *)xfs_dir2_leaf_bests_p(ltp));
578         /*
579          * Check hash value order, count stale entries.
580          */
581         for (i = stale = 0; i < be16_to_cpu(leaf->hdr.count); i++) {
582                 if (i + 1 < be16_to_cpu(leaf->hdr.count))
583                         ASSERT(be32_to_cpu(leaf->ents[i].hashval) <=
584                                be32_to_cpu(leaf->ents[i + 1].hashval));
585                 if (be32_to_cpu(leaf->ents[i].address) == XFS_DIR2_NULL_DATAPTR)
586                         stale++;
587         }
588         ASSERT(be16_to_cpu(leaf->hdr.stale) == stale);
589 }
590 #endif  /* DEBUG */
591 
592 /*
593  * Compact out any stale entries in the leaf.
594  * Log the header and changed leaf entries, if any.
595  */
596 void
597 xfs_dir2_leaf_compact(
598         xfs_da_args_t   *args,          /* operation arguments */
599         xfs_dabuf_t     *bp)            /* leaf buffer */
600 {
601         int             from;           /* source leaf index */
602         xfs_dir2_leaf_t *leaf;          /* leaf structure */
603         int             loglow;         /* first leaf entry to log */
604         int             to;             /* target leaf index */
605 
606         leaf = bp->data;
607         if (!leaf->hdr.stale) {
608                 return;
609         }
610         /*
611          * Compress out the stale entries in place.
612          */
613         for (from = to = 0, loglow = -1; from < be16_to_cpu(leaf->hdr.count); from++) {
614                 if (be32_to_cpu(leaf->ents[from].address) == XFS_DIR2_NULL_DATAPTR)
615                         continue;
616                 /*
617                  * Only actually copy the entries that are different.
618                  */
619                 if (from > to) {
620                         if (loglow == -1)
621                                 loglow = to;
622                         leaf->ents[to] = leaf->ents[from];
623                 }
624                 to++;
625         }
626         /*
627          * Update and log the header, log the leaf entries.
628          */
629         ASSERT(be16_to_cpu(leaf->hdr.stale) == from - to);
630         be16_add_cpu(&leaf->hdr.count, -(be16_to_cpu(leaf->hdr.stale)));
631         leaf->hdr.stale = 0;
632         xfs_dir2_leaf_log_header(args->trans, bp);
633         if (loglow != -1)
634                 xfs_dir2_leaf_log_ents(args->trans, bp, loglow, to - 1);
635 }
636 
637 /*
638  * Compact the leaf entries, removing stale ones.
639  * Leave one stale entry behind - the one closest to our
640  * insertion index - and the caller will shift that one to our insertion
641  * point later.
642  * Return new insertion index, where the remaining stale entry is,
643  * and leaf logging indices.
644  */
645 void
646 xfs_dir2_leaf_compact_x1(
647         xfs_dabuf_t     *bp,            /* leaf buffer */
648         int             *indexp,        /* insertion index */
649         int             *lowstalep,     /* out: stale entry before us */
650         int             *highstalep,    /* out: stale entry after us */
651         int             *lowlogp,       /* out: low log index */
652         int             *highlogp)      /* out: high log index */
653 {
654         int             from;           /* source copy index */
655         int             highstale;      /* stale entry at/after index */
656         int             index;          /* insertion index */
657         int             keepstale;      /* source index of kept stale */
658         xfs_dir2_leaf_t *leaf;          /* leaf structure */
659         int             lowstale;       /* stale entry before index */
660         int             newindex=0;     /* new insertion index */
661         int             to;             /* destination copy index */
662 
663         leaf = bp->data;
664         ASSERT(be16_to_cpu(leaf->hdr.stale) > 1);
665         index = *indexp;
666         /*
667          * Find the first stale entry before our index, if any.
668          */
669         for (lowstale = index - 1;
670              lowstale >= 0 &&
671                 be32_to_cpu(leaf->ents[lowstale].address) != XFS_DIR2_NULL_DATAPTR;
672              lowstale--)
673                 continue;
674         /*
675          * Find the first stale entry at or after our index, if any.
676          * Stop if the answer would be worse than lowstale.
677          */
678         for (highstale = index;
679              highstale < be16_to_cpu(leaf->hdr.count) &&
680                 be32_to_cpu(leaf->ents[highstale].address) != XFS_DIR2_NULL_DATAPTR &&
681                 (lowstale < 0 || index - lowstale > highstale - index);
682              highstale++)
683                 continue;
684         /*
685          * Pick the better of lowstale and highstale.
686          */
687         if (lowstale >= 0 &&
688             (highstale == be16_to_cpu(leaf->hdr.count) ||
689              index - lowstale <= highstale - index))
690                 keepstale = lowstale;
691         else
692                 keepstale = highstale;
693         /*
694          * Copy the entries in place, removing all the stale entries
695          * except keepstale.
696          */
697         for (from = to = 0; from < be16_to_cpu(leaf->hdr.count); from++) {
698                 /*
699                  * Notice the new value of index.
700                  */
701                 if (index == from)
702                         newindex = to;
703                 if (from != keepstale &&
704                     be32_to_cpu(leaf->ents[from].address) == XFS_DIR2_NULL_DATAPTR) {
705                         if (from == to)
706                                 *lowlogp = to;
707                         continue;
708                 }
709                 /*
710                  * Record the new keepstale value for the insertion.
711                  */
712                 if (from == keepstale)
713                         lowstale = highstale = to;
714                 /*
715                  * Copy only the entries that have moved.
716                  */
717                 if (from > to)
718                         leaf->ents[to] = leaf->ents[from];
719                 to++;
720         }
721         ASSERT(from > to);
722         /*
723          * If the insertion point was past the last entry,
724          * set the new insertion point accordingly.
725          */
726         if (index == from)
727                 newindex = to;
728         *indexp = newindex;
729         /*
730          * Adjust the leaf header values.
731          */
732         be16_add_cpu(&leaf->hdr.count, -(from - to));
733         leaf->hdr.stale = cpu_to_be16(1);
734         /*
735          * Remember the low/high stale value only in the "right"
736          * direction.
737          */
738         if (lowstale >= newindex)
739                 lowstale = -1;
740         else
741                 highstale = be16_to_cpu(leaf->hdr.count);
742         *highlogp = be16_to_cpu(leaf->hdr.count) - 1;
743         *lowstalep = lowstale;
744         *highstalep = highstale;
745 }
746 
747 /*
748  * Getdents (readdir) for leaf and node directories.
749  * This reads the data blocks only, so is the same for both forms.
750  */
751 int                                             /* error */
752 xfs_dir2_leaf_getdents(
753         xfs_inode_t             *dp,            /* incore directory inode */
754         void                    *dirent,
755         size_t                  bufsize,
756         xfs_off_t               *offset,
757         filldir_t               filldir)
758 {
759         xfs_dabuf_t             *bp;            /* data block buffer */
760         int                     byteoff;        /* offset in current block */
761         xfs_dir2_db_t           curdb;          /* db for current block */
762         xfs_dir2_off_t          curoff;         /* current overall offset */
763         xfs_dir2_data_t         *data;          /* data block structure */
764         xfs_dir2_data_entry_t   *dep;           /* data entry */
765         xfs_dir2_data_unused_t  *dup;           /* unused entry */
766         int                     error = 0;      /* error return value */
767         int                     i;              /* temporary loop index */
768         int                     j;              /* temporary loop index */
769         int                     length;         /* temporary length value */
770         xfs_bmbt_irec_t         *map;           /* map vector for blocks */
771         xfs_extlen_t            map_blocks;     /* number of fsbs in map */
772         xfs_dablk_t             map_off;        /* last mapped file offset */
773         int                     map_size;       /* total entries in *map */
774         int                     map_valid;      /* valid entries in *map */
775         xfs_mount_t             *mp;            /* filesystem mount point */
776         xfs_dir2_off_t          newoff;         /* new curoff after new blk */
777         int                     nmap;           /* mappings to ask xfs_bmapi */
778         char                    *ptr = NULL;    /* pointer to current data */
779         int                     ra_current;     /* number of read-ahead blks */
780         int                     ra_index;       /* *map index for read-ahead */
781         int                     ra_offset;      /* map entry offset for ra */
782         int                     ra_want;        /* readahead count wanted */
783 
784         /*
785          * If the offset is at or past the largest allowed value,
786          * give up right away.
787          */
788         if (*offset >= XFS_DIR2_MAX_DATAPTR)
789                 return 0;
790 
791         mp = dp->i_mount;
792 
793         /*
794          * Set up to bmap a number of blocks based on the caller's
795          * buffer size, the directory block size, and the filesystem
796          * block size.
797          */
798         map_size = howmany(bufsize + mp->m_dirblksize, mp->m_sb.sb_blocksize);
799         map = kmem_alloc(map_size * sizeof(*map), KM_SLEEP);
800         map_valid = ra_index = ra_offset = ra_current = map_blocks = 0;
801         bp = NULL;
802 
803         /*
804          * Inside the loop we keep the main offset value as a byte offset
805          * in the directory file.
806          */
807         curoff = xfs_dir2_dataptr_to_byte(mp, *offset);
808 
809         /*
810          * Force this conversion through db so we truncate the offset
811          * down to get the start of the data block.
812          */
813         map_off = xfs_dir2_db_to_da(mp, xfs_dir2_byte_to_db(mp, curoff));
814         /*
815          * Loop over directory entries until we reach the end offset.
816          * Get more blocks and readahead as necessary.
817          */
818         while (curoff < XFS_DIR2_LEAF_OFFSET) {
819                 /*
820                  * If we have no buffer, or we're off the end of the
821                  * current buffer, need to get another one.
822                  */
823                 if (!bp || ptr >= (char *)bp->data + mp->m_dirblksize) {
824                         /*
825                          * If we have a buffer, we need to release it and
826                          * take it out of the mapping.
827                          */
828                         if (bp) {
829                                 xfs_da_brelse(NULL, bp);
830                                 bp = NULL;
831                                 map_blocks -= mp->m_dirblkfsbs;
832                                 /*
833                                  * Loop to get rid of the extents for the
834                                  * directory block.
835                                  */
836                                 for (i = mp->m_dirblkfsbs; i > 0; ) {
837                                         j = MIN((int)map->br_blockcount, i);
838                                         map->br_blockcount -= j;
839                                         map->br_startblock += j;
840                                         map->br_startoff += j;
841                                         /*
842                                          * If mapping is done, pitch it from
843                                          * the table.
844                                          */
845                                         if (!map->br_blockcount && --map_valid)
846                                                 memmove(&map[0], &map[1],
847                                                         sizeof(map[0]) *
848                                                         map_valid);
849                                         i -= j;
850                                 }
851                         }
852                         /*
853                          * Recalculate the readahead blocks wanted.
854                          */
855                         ra_want = howmany(bufsize + mp->m_dirblksize,
856                                           mp->m_sb.sb_blocksize) - 1;
857                         ASSERT(ra_want >= 0);
858 
859                         /*
860                          * If we don't have as many as we want, and we haven't
861                          * run out of data blocks, get some more mappings.
862                          */
863                         if (1 + ra_want > map_blocks &&
864                             map_off <
865                             xfs_dir2_byte_to_da(mp, XFS_DIR2_LEAF_OFFSET)) {
866                                 /*
867                                  * Get more bmaps, fill in after the ones
868                                  * we already have in the table.
869                                  */
870                                 nmap = map_size - map_valid;
871                                 error = xfs_bmapi(NULL, dp,
872                                         map_off,
873                                         xfs_dir2_byte_to_da(mp,
874                                                 XFS_DIR2_LEAF_OFFSET) - map_off,
875                                         XFS_BMAPI_METADATA, NULL, 0,
876                                         &map[map_valid], &nmap, NULL, NULL);
877                                 /*
878                                  * Don't know if we should ignore this or
879                                  * try to return an error.
880                                  * The trouble with returning errors
881                                  * is that readdir will just stop without
882                                  * actually passing the error through.
883                                  */
884                                 if (error)
885                                         break;  /* XXX */
886                                 /*
887                                  * If we got all the mappings we asked for,
888                                  * set the final map offset based on the
889                                  * last bmap value received.
890                                  * Otherwise, we've reached the end.
891                                  */
892                                 if (nmap == map_size - map_valid)
893                                         map_off =
894                                         map[map_valid + nmap - 1].br_startoff +
895                                         map[map_valid + nmap - 1].br_blockcount;
896                                 else
897                                         map_off =
898                                                 xfs_dir2_byte_to_da(mp,
899                                                         XFS_DIR2_LEAF_OFFSET);
900                                 /*
901                                  * Look for holes in the mapping, and
902                                  * eliminate them.  Count up the valid blocks.
903                                  */
904                                 for (i = map_valid; i < map_valid + nmap; ) {
905                                         if (map[i].br_startblock ==
906                                             HOLESTARTBLOCK) {
907                                                 nmap--;
908                                                 length = map_valid + nmap - i;
909                                                 if (length)
910                                                         memmove(&map[i],
911                                                                 &map[i + 1],
912                                                                 sizeof(map[i]) *
913                                                                 length);
914                                         } else {
915                                                 map_blocks +=
916                                                         map[i].br_blockcount;
917                                                 i++;
918                                         }
919                                 }
920                                 map_valid += nmap;
921                         }
922                         /*
923                          * No valid mappings, so no more data blocks.
924                          */
925                         if (!map_valid) {
926                                 curoff = xfs_dir2_da_to_byte(mp, map_off);
927                                 break;
928                         }
929                         /*
930                          * Read the directory block starting at the first
931                          * mapping.
932                          */
933                         curdb = xfs_dir2_da_to_db(mp, map->br_startoff);
934                         error = xfs_da_read_buf(NULL, dp, map->br_startoff,
935                                 map->br_blockcount >= mp->m_dirblkfsbs ?
936                                     XFS_FSB_TO_DADDR(mp, map->br_startblock) :
937                                     -1,
938                                 &bp, XFS_DATA_FORK);
939                         /*
940                          * Should just skip over the data block instead
941                          * of giving up.
942                          */
943                         if (error)
944                                 break;  /* XXX */
945                         /*
946                          * Adjust the current amount of read-ahead: we just
947                          * read a block that was previously ra.
948                          */
949                         if (ra_current)
950                                 ra_current -= mp->m_dirblkfsbs;
951                         /*
952                          * Do we need more readahead?
953                          */
954                         for (ra_index = ra_offset = i = 0;
955                              ra_want > ra_current && i < map_blocks;
956                              i += mp->m_dirblkfsbs) {
957                                 ASSERT(ra_index < map_valid);
958                                 /*
959                                  * Read-ahead a contiguous directory block.
960                                  */
961                                 if (i > ra_current &&
962                                     map[ra_index].br_blockcount >=
963                                     mp->m_dirblkfsbs) {
964                                         xfs_baread(mp->m_ddev_targp,
965                                                 XFS_FSB_TO_DADDR(mp,
966                                                    map[ra_index].br_startblock +
967                                                    ra_offset),
968                                                 (int)BTOBB(mp->m_dirblksize));
969                                         ra_current = i;
970                                 }
971                                 /*
972                                  * Read-ahead a non-contiguous directory block.
973                                  * This doesn't use our mapping, but this
974                                  * is a very rare case.
975                                  */
976                                 else if (i > ra_current) {
977                                         (void)xfs_da_reada_buf(NULL, dp,
978                                                 map[ra_index].br_startoff +
979                                                 ra_offset, XFS_DATA_FORK);
980                                         ra_current = i;
981                                 }
982                                 /*
983                                  * Advance offset through the mapping table.
984                                  */
985                                 for (j = 0; j < mp->m_dirblkfsbs; j++) {
986                                         /*
987                                          * The rest of this extent but not
988                                          * more than a dir block.
989                                          */
990                                         length = MIN(mp->m_dirblkfsbs,
991                                                 (int)(map[ra_index].br_blockcount -
992                                                 ra_offset));
993                                         j += length;
994                                         ra_offset += length;
995                                         /*
996                                          * Advance to the next mapping if
997                                          * this one is used up.
998                                          */
999                                         if (ra_offset ==
1000                                             map[ra_index].br_blockcount) {
1001                                                 ra_offset = 0;
1002                                                 ra_index++;
1003                                         }
1004                                 }
1005                         }
1006                         /*
1007                          * Having done a read, we need to set a new offset.
1008                          */
1009                         newoff = xfs_dir2_db_off_to_byte(mp, curdb, 0);
1010                         /*
1011                          * Start of the current block.
1012                          */
1013                         if (curoff < newoff)
1014                                 curoff = newoff;
1015                         /*
1016                          * Make sure we're in the right block.
1017                          */
1018                         else if (curoff > newoff)
1019                                 ASSERT(xfs_dir2_byte_to_db(mp, curoff) ==
1020                                        curdb);
1021                         data = bp->data;
1022                         xfs_dir2_data_check(dp, bp);
1023                         /*
1024                          * Find our position in the block.
1025                          */
1026                         ptr = (char *)&data->u;
1027                         byteoff = xfs_dir2_byte_to_off(mp, curoff);
1028                         /*
1029                          * Skip past the header.
1030                          */
1031                         if (byteoff == 0)
1032                                 curoff += (uint)sizeof(data->hdr);
1033                         /*
1034                          * Skip past entries until we reach our offset.
1035                          */
1036                         else {
1037                                 while ((char *)ptr - (char *)data < byteoff) {
1038                                         dup = (xfs_dir2_data_unused_t *)ptr;
1039 
1040                                         if (be16_to_cpu(dup->freetag)
1041                                                   == XFS_DIR2_DATA_FREE_TAG) {
1042 
1043                                                 length = be16_to_cpu(dup->length);
1044                                                 ptr += length;
1045                                                 continue;
1046                                         }
1047                                         dep = (xfs_dir2_data_entry_t *)ptr;
1048                                         length =
1049                                            xfs_dir2_data_entsize(dep->namelen);
1050                                         ptr += length;
1051                                 }
1052                                 /*
1053                                  * Now set our real offset.
1054                                  */
1055                                 curoff =
1056                                         xfs_dir2_db_off_to_byte(mp,
1057                                             xfs_dir2_byte_to_db(mp, curoff),
1058                                             (char *)ptr - (char *)data);
1059                                 if (ptr >= (char *)data + mp->m_dirblksize) {
1060                                         continue;
1061                                 }
1062                         }
1063                 }
1064                 /*
1065                  * We have a pointer to an entry.
1066                  * Is it a live one?
1067                  */
1068                 dup = (xfs_dir2_data_unused_t *)ptr;
1069                 /*
1070                  * No, it's unused, skip over it.
1071                  */
1072                 if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
1073                         length = be16_to_cpu(dup->length);
1074                         ptr += length;
1075                         curoff += length;
1076                         continue;
1077                 }
1078 
1079                 dep = (xfs_dir2_data_entry_t *)ptr;
1080                 length = xfs_dir2_data_entsize(dep->namelen);
1081 
1082                 if (filldir(dirent, dep->name, dep->namelen,
1083                             xfs_dir2_byte_to_dataptr(mp, curoff) & 0x7fffffff,
1084                             be64_to_cpu(dep->inumber), DT_UNKNOWN))
1085                         break;
1086 
1087                 /*
1088                  * Advance to next entry in the block.
1089                  */
1090                 ptr += length;
1091                 curoff += length;
1092                 /* bufsize may have just been a guess; don't go negative */
1093                 bufsize = bufsize > length ? bufsize - length : 0;
1094         }
1095 
1096         /*
1097          * All done.  Set output offset value to current offset.
1098          */
1099         if (curoff > xfs_dir2_dataptr_to_byte(mp, XFS_DIR2_MAX_DATAPTR))
1100                 *offset = XFS_DIR2_MAX_DATAPTR & 0x7fffffff;
1101         else
1102                 *offset = xfs_dir2_byte_to_dataptr(mp, curoff) & 0x7fffffff;
1103         kmem_free(map);
1104         if (bp)
1105                 xfs_da_brelse(NULL, bp);
1106         return error;
1107 }
1108 
1109 /*
1110  * Initialize a new leaf block, leaf1 or leafn magic accepted.
1111  */
1112 int
1113 xfs_dir2_leaf_init(
1114         xfs_da_args_t           *args,          /* operation arguments */
1115         xfs_dir2_db_t           bno,            /* directory block number */
1116         xfs_dabuf_t             **bpp,          /* out: leaf buffer */
1117         int                     magic)          /* magic number for block */
1118 {
1119         xfs_dabuf_t             *bp;            /* leaf buffer */
1120         xfs_inode_t             *dp;            /* incore directory inode */
1121         int                     error;          /* error return code */
1122         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1123         xfs_dir2_leaf_tail_t    *ltp;           /* leaf tail structure */
1124         xfs_mount_t             *mp;            /* filesystem mount point */
1125         xfs_trans_t             *tp;            /* transaction pointer */
1126 
1127         dp = args->dp;
1128         ASSERT(dp != NULL);
1129         tp = args->trans;
1130         mp = dp->i_mount;
1131         ASSERT(bno >= XFS_DIR2_LEAF_FIRSTDB(mp) &&
1132                bno < XFS_DIR2_FREE_FIRSTDB(mp));
1133         /*
1134          * Get the buffer for the block.
1135          */
1136         error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(mp, bno), -1, &bp,
1137                 XFS_DATA_FORK);
1138         if (error) {
1139                 return error;
1140         }
1141         ASSERT(bp != NULL);
1142         leaf = bp->data;
1143         /*
1144          * Initialize the header.
1145          */
1146         leaf->hdr.info.magic = cpu_to_be16(magic);
1147         leaf->hdr.info.forw = 0;
1148         leaf->hdr.info.back = 0;
1149         leaf->hdr.count = 0;
1150         leaf->hdr.stale = 0;
1151         xfs_dir2_leaf_log_header(tp, bp);
1152         /*
1153          * If it's a leaf-format directory initialize the tail.
1154          * In this case our caller has the real bests table to copy into
1155          * the block.
1156          */
1157         if (magic == XFS_DIR2_LEAF1_MAGIC) {
1158                 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
1159                 ltp->bestcount = 0;
1160                 xfs_dir2_leaf_log_tail(tp, bp);
1161         }
1162         *bpp = bp;
1163         return 0;
1164 }
1165 
1166 /*
1167  * Log the bests entries indicated from a leaf1 block.
1168  */
1169 static void
1170 xfs_dir2_leaf_log_bests(
1171         xfs_trans_t             *tp,            /* transaction pointer */
1172         xfs_dabuf_t             *bp,            /* leaf buffer */
1173         int                     first,          /* first entry to log */
1174         int                     last)           /* last entry to log */
1175 {
1176         __be16                  *firstb;        /* pointer to first entry */
1177         __be16                  *lastb;         /* pointer to last entry */
1178         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1179         xfs_dir2_leaf_tail_t    *ltp;           /* leaf tail structure */
1180 
1181         leaf = bp->data;
1182         ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAF1_MAGIC);
1183         ltp = xfs_dir2_leaf_tail_p(tp->t_mountp, leaf);
1184         firstb = xfs_dir2_leaf_bests_p(ltp) + first;
1185         lastb = xfs_dir2_leaf_bests_p(ltp) + last;
1186         xfs_da_log_buf(tp, bp, (uint)((char *)firstb - (char *)leaf),
1187                 (uint)((char *)lastb - (char *)leaf + sizeof(*lastb) - 1));
1188 }
1189 
1190 /*
1191  * Log the leaf entries indicated from a leaf1 or leafn block.
1192  */
1193 void
1194 xfs_dir2_leaf_log_ents(
1195         xfs_trans_t             *tp,            /* transaction pointer */
1196         xfs_dabuf_t             *bp,            /* leaf buffer */
1197         int                     first,          /* first entry to log */
1198         int                     last)           /* last entry to log */
1199 {
1200         xfs_dir2_leaf_entry_t   *firstlep;      /* pointer to first entry */
1201         xfs_dir2_leaf_entry_t   *lastlep;       /* pointer to last entry */
1202         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1203 
1204         leaf = bp->data;
1205         ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAF1_MAGIC ||
1206                be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAFN_MAGIC);
1207         firstlep = &leaf->ents[first];
1208         lastlep = &leaf->ents[last];
1209         xfs_da_log_buf(tp, bp, (uint)((char *)firstlep - (char *)leaf),
1210                 (uint)((char *)lastlep - (char *)leaf + sizeof(*lastlep) - 1));
1211 }
1212 
1213 /*
1214  * Log the header of the leaf1 or leafn block.
1215  */
1216 void
1217 xfs_dir2_leaf_log_header(
1218         xfs_trans_t             *tp,            /* transaction pointer */
1219         xfs_dabuf_t             *bp)            /* leaf buffer */
1220 {
1221         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1222 
1223         leaf = bp->data;
1224         ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAF1_MAGIC ||
1225                be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAFN_MAGIC);
1226         xfs_da_log_buf(tp, bp, (uint)((char *)&leaf->hdr - (char *)leaf),
1227                 (uint)(sizeof(leaf->hdr) - 1));
1228 }
1229 
1230 /*
1231  * Log the tail of the leaf1 block.
1232  */
1233 STATIC void
1234 xfs_dir2_leaf_log_tail(
1235         xfs_trans_t             *tp,            /* transaction pointer */
1236         xfs_dabuf_t             *bp)            /* leaf buffer */
1237 {
1238         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1239         xfs_dir2_leaf_tail_t    *ltp;           /* leaf tail structure */
1240         xfs_mount_t             *mp;            /* filesystem mount point */
1241 
1242         mp = tp->t_mountp;
1243         leaf = bp->data;
1244         ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAF1_MAGIC);
1245         ltp = xfs_dir2_leaf_tail_p(mp, leaf);
1246         xfs_da_log_buf(tp, bp, (uint)((char *)ltp - (char *)leaf),
1247                 (uint)(mp->m_dirblksize - 1));
1248 }
1249 
1250 /*
1251  * Look up the entry referred to by args in the leaf format directory.
1252  * Most of the work is done by the xfs_dir2_leaf_lookup_int routine which
1253  * is also used by the node-format code.
1254  */
1255 int
1256 xfs_dir2_leaf_lookup(
1257         xfs_da_args_t           *args)          /* operation arguments */
1258 {
1259         xfs_dabuf_t             *dbp;           /* data block buffer */
1260         xfs_dir2_data_entry_t   *dep;           /* data block entry */
1261         xfs_inode_t             *dp;            /* incore directory inode */
1262         int                     error;          /* error return code */
1263         int                     index;          /* found entry index */
1264         xfs_dabuf_t             *lbp;           /* leaf buffer */
1265         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1266         xfs_dir2_leaf_entry_t   *lep;           /* leaf entry */
1267         xfs_trans_t             *tp;            /* transaction pointer */
1268 
1269         xfs_dir2_trace_args("leaf_lookup", args);
1270         /*
1271          * Look up name in the leaf block, returning both buffers and index.
1272          */
1273         if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) {
1274                 return error;
1275         }
1276         tp = args->trans;
1277         dp = args->dp;
1278         xfs_dir2_leaf_check(dp, lbp);
1279         leaf = lbp->data;
1280         /*
1281          * Get to the leaf entry and contained data entry address.
1282          */
1283         lep = &leaf->ents[index];
1284         /*
1285          * Point to the data entry.
1286          */
1287         dep = (xfs_dir2_data_entry_t *)
1288               ((char *)dbp->data +
1289                xfs_dir2_dataptr_to_off(dp->i_mount, be32_to_cpu(lep->address)));
1290         /*
1291          * Return the found inode number & CI name if appropriate
1292          */
1293         args->inumber = be64_to_cpu(dep->inumber);
1294         error = xfs_dir_cilookup_result(args, dep->name, dep->namelen);
1295         xfs_da_brelse(tp, dbp);
1296         xfs_da_brelse(tp, lbp);
1297         return XFS_ERROR(error);
1298 }
1299 
1300 /*
1301  * Look up name/hash in the leaf block.
1302  * Fill in indexp with the found index, and dbpp with the data buffer.
1303  * If not found dbpp will be NULL, and ENOENT comes back.
1304  * lbpp will always be filled in with the leaf buffer unless there's an error.
1305  */
1306 static int                                      /* error */
1307 xfs_dir2_leaf_lookup_int(
1308         xfs_da_args_t           *args,          /* operation arguments */
1309         xfs_dabuf_t             **lbpp,         /* out: leaf buffer */
1310         int                     *indexp,        /* out: index in leaf block */
1311         xfs_dabuf_t             **dbpp)         /* out: data buffer */
1312 {
1313         xfs_dir2_db_t           curdb = -1;     /* current data block number */
1314         xfs_dabuf_t             *dbp = NULL;    /* data buffer */
1315         xfs_dir2_data_entry_t   *dep;           /* data entry */
1316         xfs_inode_t             *dp;            /* incore directory inode */
1317         int                     error;          /* error return code */
1318         int                     index;          /* index in leaf block */
1319         xfs_dabuf_t             *lbp;           /* leaf buffer */
1320         xfs_dir2_leaf_entry_t   *lep;           /* leaf entry */
1321         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1322         xfs_mount_t             *mp;            /* filesystem mount point */
1323         xfs_dir2_db_t           newdb;          /* new data block number */
1324         xfs_trans_t             *tp;            /* transaction pointer */
1325         xfs_dir2_db_t           cidb = -1;      /* case match data block no. */
1326         enum xfs_dacmp          cmp;            /* name compare result */
1327 
1328         dp = args->dp;
1329         tp = args->trans;
1330         mp = dp->i_mount;
1331         /*
1332          * Read the leaf block into the buffer.
1333          */
1334         error = xfs_da_read_buf(tp, dp, mp->m_dirleafblk, -1, &lbp,
1335                                                         XFS_DATA_FORK);
1336         if (error)
1337                 return error;
1338         *lbpp = lbp;
1339         leaf = lbp->data;
1340         xfs_dir2_leaf_check(dp, lbp);
1341         /*
1342          * Look for the first leaf entry with our hash value.
1343          */
1344         index = xfs_dir2_leaf_search_hash(args, lbp);
1345         /*
1346          * Loop over all the entries with the right hash value
1347          * looking to match the name.
1348          */
1349         for (lep = &leaf->ents[index]; index < be16_to_cpu(leaf->hdr.count) &&
1350                                 be32_to_cpu(lep->hashval) == args->hashval;
1351                                 lep++, index++) {
1352                 /*
1353                  * Skip over stale leaf entries.
1354                  */
1355                 if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR)
1356                         continue;
1357                 /*
1358                  * Get the new data block number.
1359                  */
1360                 newdb = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address));
1361                 /*
1362                  * If it's not the same as the old data block number,
1363                  * need to pitch the old one and read the new one.
1364                  */
1365                 if (newdb != curdb) {
1366                         if (dbp)
1367                                 xfs_da_brelse(tp, dbp);
1368                         error = xfs_da_read_buf(tp, dp,
1369                                                 xfs_dir2_db_to_da(mp, newdb),
1370                                                 -1, &dbp, XFS_DATA_FORK);
1371                         if (error) {
1372                                 xfs_da_brelse(tp, lbp);
1373                                 return error;
1374                         }
1375                         xfs_dir2_data_check(dp, dbp);
1376                         curdb = newdb;
1377                 }
1378                 /*
1379                  * Point to the data entry.
1380                  */
1381                 dep = (xfs_dir2_data_entry_t *)((char *)dbp->data +
1382                         xfs_dir2_dataptr_to_off(mp, be32_to_cpu(lep->address)));
1383                 /*
1384                  * Compare name and if it's an exact match, return the index
1385                  * and buffer. If it's the first case-insensitive match, store
1386                  * the index and buffer and continue looking for an exact match.
1387                  */
1388                 cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen);
1389                 if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) {
1390                         args->cmpresult = cmp;
1391                         *indexp = index;
1392                         /* case exact match: return the current buffer. */
1393                         if (cmp == XFS_CMP_EXACT) {
1394                                 *dbpp = dbp;
1395                                 return 0;
1396                         }
1397                         cidb = curdb;
1398                 }
1399         }
1400         ASSERT(args->op_flags & XFS_DA_OP_OKNOENT);
1401         /*
1402          * Here, we can only be doing a lookup (not a rename or remove).
1403          * If a case-insensitive match was found earlier, re-read the
1404          * appropriate data block if required and return it.
1405          */
1406         if (args->cmpresult == XFS_CMP_CASE) {
1407                 ASSERT(cidb != -1);
1408                 if (cidb != curdb) {
1409                         xfs_da_brelse(tp, dbp);
1410                         error = xfs_da_read_buf(tp, dp,
1411                                                 xfs_dir2_db_to_da(mp, cidb),
1412                                                 -1, &dbp, XFS_DATA_FORK);
1413                         if (error) {
1414                                 xfs_da_brelse(tp, lbp);
1415                                 return error;
1416                         }
1417                 }
1418                 *dbpp = dbp;
1419                 return 0;
1420         }
1421         /*
1422          * No match found, return ENOENT.
1423          */
1424         ASSERT(cidb == -1);
1425         if (dbp)
1426                 xfs_da_brelse(tp, dbp);
1427         xfs_da_brelse(tp, lbp);
1428         return XFS_ERROR(ENOENT);
1429 }
1430 
1431 /*
1432  * Remove an entry from a leaf format directory.
1433  */
1434 int                                             /* error */
1435 xfs_dir2_leaf_removename(
1436         xfs_da_args_t           *args)          /* operation arguments */
1437 {
1438         __be16                  *bestsp;        /* leaf block best freespace */
1439         xfs_dir2_data_t         *data;          /* data block structure */
1440         xfs_dir2_db_t           db;             /* data block number */
1441         xfs_dabuf_t             *dbp;           /* data block buffer */
1442         xfs_dir2_data_entry_t   *dep;           /* data entry structure */
1443         xfs_inode_t             *dp;            /* incore directory inode */
1444         int                     error;          /* error return code */
1445         xfs_dir2_db_t           i;              /* temporary data block # */
1446         int                     index;          /* index into leaf entries */
1447         xfs_dabuf_t             *lbp;           /* leaf buffer */
1448         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1449         xfs_dir2_leaf_entry_t   *lep;           /* leaf entry */
1450         xfs_dir2_leaf_tail_t    *ltp;           /* leaf tail structure */
1451         xfs_mount_t             *mp;            /* filesystem mount point */
1452         int                     needlog;        /* need to log data header */
1453         int                     needscan;       /* need to rescan data frees */
1454         xfs_dir2_data_off_t     oldbest;        /* old value of best free */
1455         xfs_trans_t             *tp;            /* transaction pointer */
1456 
1457         xfs_dir2_trace_args("leaf_removename", args);
1458         /*
1459          * Lookup the leaf entry, get the leaf and data blocks read in.
1460          */
1461         if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) {
1462                 return error;
1463         }
1464         dp = args->dp;
1465         tp = args->trans;
1466         mp = dp->i_mount;
1467         leaf = lbp->data;
1468         data = dbp->data;
1469         xfs_dir2_data_check(dp, dbp);
1470         /*
1471          * Point to the leaf entry, use that to point to the data entry.
1472          */
1473         lep = &leaf->ents[index];
1474         db = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address));
1475         dep = (xfs_dir2_data_entry_t *)
1476               ((char *)data + xfs_dir2_dataptr_to_off(mp, be32_to_cpu(lep->address)));
1477         needscan = needlog = 0;
1478         oldbest = be16_to_cpu(data->hdr.bestfree[0].length);
1479         ltp = xfs_dir2_leaf_tail_p(mp, leaf);
1480         bestsp = xfs_dir2_leaf_bests_p(ltp);
1481         ASSERT(be16_to_cpu(bestsp[db]) == oldbest);
1482         /*
1483          * Mark the former data entry unused.
1484          */
1485         xfs_dir2_data_make_free(tp, dbp,
1486                 (xfs_dir2_data_aoff_t)((char *)dep - (char *)data),
1487                 xfs_dir2_data_entsize(dep->namelen), &needlog, &needscan);
1488         /*
1489          * We just mark the leaf entry stale by putting a null in it.
1490          */
1491         be16_add_cpu(&leaf->hdr.stale, 1);
1492         xfs_dir2_leaf_log_header(tp, lbp);
1493         lep->address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR);
1494         xfs_dir2_leaf_log_ents(tp, lbp, index, index);
1495         /*
1496          * Scan the freespace in the data block again if necessary,
1497          * log the data block header if necessary.
1498          */
1499         if (needscan)
1500                 xfs_dir2_data_freescan(mp, data, &needlog);
1501         if (needlog)
1502                 xfs_dir2_data_log_header(tp, dbp);
1503         /*
1504          * If the longest freespace in the data block has changed,
1505          * put the new value in the bests table and log that.
1506          */
1507         if (be16_to_cpu(data->hdr.bestfree[0].length) != oldbest) {
1508                 bestsp[db] = data->hdr.bestfree[0].length;
1509                 xfs_dir2_leaf_log_bests(tp, lbp, db, db);
1510         }
1511         xfs_dir2_data_check(dp, dbp);
1512         /*
1513          * If the data block is now empty then get rid of the data block.
1514          */
1515         if (be16_to_cpu(data->hdr.bestfree[0].length) ==
1516             mp->m_dirblksize - (uint)sizeof(data->hdr)) {
1517                 ASSERT(db != mp->m_dirdatablk);
1518                 if ((error = xfs_dir2_shrink_inode(args, db, dbp))) {
1519                         /*
1520                          * Nope, can't get rid of it because it caused
1521                          * allocation of a bmap btree block to do so.
1522                          * Just go on, returning success, leaving the
1523                          * empty block in place.
1524                          */
1525                         if (error == ENOSPC && args->total == 0) {
1526                                 xfs_da_buf_done(dbp);
1527                                 error = 0;
1528                         }
1529                         xfs_dir2_leaf_check(dp, lbp);
1530                         xfs_da_buf_done(lbp);
1531                         return error;
1532                 }
1533                 dbp = NULL;
1534                 /*
1535                  * If this is the last data block then compact the
1536                  * bests table by getting rid of entries.
1537                  */
1538                 if (db == be32_to_cpu(ltp->bestcount) - 1) {
1539                         /*
1540                          * Look for the last active entry (i).
1541                          */
1542                         for (i = db - 1; i > 0; i--) {
1543                                 if (be16_to_cpu(bestsp[i]) != NULLDATAOFF)
1544                                         break;
1545                         }
1546                         /*
1547                          * Copy the table down so inactive entries at the
1548                          * end are removed.
1549                          */
1550                         memmove(&bestsp[db - i], bestsp,
1551                                 (be32_to_cpu(ltp->bestcount) - (db - i)) * sizeof(*bestsp));
1552                         be32_add_cpu(&ltp->bestcount, -(db - i));
1553                         xfs_dir2_leaf_log_tail(tp, lbp);
1554                         xfs_dir2_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
1555                 } else
1556                         bestsp[db] = cpu_to_be16(NULLDATAOFF);
1557         }
1558         /*
1559          * If the data block was not the first one, drop it.
1560          */
1561         else if (db != mp->m_dirdatablk && dbp != NULL) {
1562                 xfs_da_buf_done(dbp);
1563                 dbp = NULL;
1564         }
1565         xfs_dir2_leaf_check(dp, lbp);
1566         /*
1567          * See if we can convert to block form.
1568          */
1569         return xfs_dir2_leaf_to_block(args, lbp, dbp);
1570 }
1571 
1572 /*
1573  * Replace the inode number in a leaf format directory entry.
1574  */
1575 int                                             /* error */
1576 xfs_dir2_leaf_replace(
1577         xfs_da_args_t           *args)          /* operation arguments */
1578 {
1579         xfs_dabuf_t             *dbp;           /* data block buffer */
1580         xfs_dir2_data_entry_t   *dep;           /* data block entry */
1581         xfs_inode_t             *dp;            /* incore directory inode */
1582         int                     error;          /* error return code */
1583         int                     index;          /* index of leaf entry */
1584         xfs_dabuf_t             *lbp;           /* leaf buffer */
1585         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1586         xfs_dir2_leaf_entry_t   *lep;           /* leaf entry */
1587         xfs_trans_t             *tp;            /* transaction pointer */
1588 
1589         xfs_dir2_trace_args("leaf_replace", args);
1590         /*
1591          * Look up the entry.
1592          */
1593         if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) {
1594                 return error;
1595         }
1596         dp = args->dp;
1597         leaf = lbp->data;
1598         /*
1599          * Point to the leaf entry, get data address from it.
1600          */
1601         lep = &leaf->ents[index];
1602         /*
1603          * Point to the data entry.
1604          */
1605         dep = (xfs_dir2_data_entry_t *)
1606               ((char *)dbp->data +
1607                xfs_dir2_dataptr_to_off(dp->i_mount, be32_to_cpu(lep->address)));
1608         ASSERT(args->inumber != be64_to_cpu(dep->inumber));
1609         /*
1610          * Put the new inode number in, log it.
1611          */
1612         dep->inumber = cpu_to_be64(args->inumber);
1613         tp = args->trans;
1614         xfs_dir2_data_log_entry(tp, dbp, dep);
1615         xfs_da_buf_done(dbp);
1616         xfs_dir2_leaf_check(dp, lbp);
1617         xfs_da_brelse(tp, lbp);
1618         return 0;
1619 }
1620 
1621 /*
1622  * Return index in the leaf block (lbp) which is either the first
1623  * one with this hash value, or if there are none, the insert point
1624  * for that hash value.
1625  */
1626 int                                             /* index value */
1627 xfs_dir2_leaf_search_hash(
1628         xfs_da_args_t           *args,          /* operation arguments */
1629         xfs_dabuf_t             *lbp)           /* leaf buffer */
1630 {
1631         xfs_dahash_t            hash=0;         /* hash from this entry */
1632         xfs_dahash_t            hashwant;       /* hash value looking for */
1633         int                     high;           /* high leaf index */
1634         int                     low;            /* low leaf index */
1635         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1636         xfs_dir2_leaf_entry_t   *lep;           /* leaf entry */
1637         int                     mid=0;          /* current leaf index */
1638 
1639         leaf = lbp->data;
1640 #ifndef __KERNEL__
1641         if (!leaf->hdr.count)
1642                 return 0;
1643 #endif
1644         /*
1645          * Note, the table cannot be empty, so we have to go through the loop.
1646          * Binary search the leaf entries looking for our hash value.
1647          */
1648         for (lep = leaf->ents, low = 0, high = be16_to_cpu(leaf->hdr.count) - 1,
1649                 hashwant = args->hashval;
1650              low <= high; ) {
1651                 mid = (low + high) >> 1;
1652                 if ((hash = be32_to_cpu(lep[mid].hashval)) == hashwant)
1653                         break;
1654                 if (hash < hashwant)
1655                         low = mid + 1;
1656                 else
1657                         high = mid - 1;
1658         }
1659         /*
1660          * Found one, back up through all the equal hash values.
1661          */
1662         if (hash == hashwant) {
1663                 while (mid > 0 && be32_to_cpu(lep[mid - 1].hashval) == hashwant) {
1664                         mid--;
1665                 }
1666         }
1667         /*
1668          * Need to point to an entry higher than ours.
1669          */
1670         else if (hash < hashwant)
1671                 mid++;
1672         return mid;
1673 }
1674 
1675 /*
1676  * Trim off a trailing data block.  We know it's empty since the leaf
1677  * freespace table says so.
1678  */
1679 int                                             /* error */
1680 xfs_dir2_leaf_trim_data(
1681         xfs_da_args_t           *args,          /* operation arguments */
1682         xfs_dabuf_t             *lbp,           /* leaf buffer */
1683         xfs_dir2_db_t           db)             /* data block number */
1684 {
1685         __be16                  *bestsp;        /* leaf bests table */
1686 #ifdef DEBUG
1687         xfs_dir2_data_t         *data;          /* data block structure */
1688 #endif
1689         xfs_dabuf_t             *dbp;           /* data block buffer */
1690         xfs_inode_t             *dp;            /* incore directory inode */
1691         int                     error;          /* error return value */
1692         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1693         xfs_dir2_leaf_tail_t    *ltp;           /* leaf tail structure */
1694         xfs_mount_t             *mp;            /* filesystem mount point */
1695         xfs_trans_t             *tp;            /* transaction pointer */
1696 
1697         dp = args->dp;
1698         mp = dp->i_mount;
1699         tp = args->trans;
1700         /*
1701          * Read the offending data block.  We need its buffer.
1702          */
1703         if ((error = xfs_da_read_buf(tp, dp, xfs_dir2_db_to_da(mp, db), -1, &dbp,
1704                         XFS_DATA_FORK))) {
1705                 return error;
1706         }
1707 #ifdef DEBUG
1708         data = dbp->data;
1709         ASSERT(be32_to_cpu(data->hdr.magic) == XFS_DIR2_DATA_MAGIC);
1710 #endif
1711         /* this seems to be an error
1712          * data is only valid if DEBUG is defined?
1713          * RMC 09/08/1999
1714          */
1715 
1716         leaf = lbp->data;
1717         ltp = xfs_dir2_leaf_tail_p(mp, leaf);
1718         ASSERT(be16_to_cpu(data->hdr.bestfree[0].length) ==
1719                mp->m_dirblksize - (uint)sizeof(data->hdr));
1720         ASSERT(db == be32_to_cpu(ltp->bestcount) - 1);
1721         /*
1722          * Get rid of the data block.
1723          */
1724         if ((error = xfs_dir2_shrink_inode(args, db, dbp))) {
1725                 ASSERT(error != ENOSPC);
1726                 xfs_da_brelse(tp, dbp);
1727                 return error;
1728         }
1729         /*
1730          * Eliminate the last bests entry from the table.
1731          */
1732         bestsp = xfs_dir2_leaf_bests_p(ltp);
1733         be32_add_cpu(&ltp->bestcount, -1);
1734         memmove(&bestsp[1], &bestsp[0], be32_to_cpu(ltp->bestcount) * sizeof(*bestsp));
1735         xfs_dir2_leaf_log_tail(tp, lbp);
1736         xfs_dir2_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
1737         return 0;
1738 }
1739 
1740 /*
1741  * Convert node form directory to leaf form directory.
1742  * The root of the node form dir needs to already be a LEAFN block.
1743  * Just return if we can't do anything.
1744  */
1745 int                                             /* error */
1746 xfs_dir2_node_to_leaf(
1747         xfs_da_state_t          *state)         /* directory operation state */
1748 {
1749         xfs_da_args_t           *args;          /* operation arguments */
1750         xfs_inode_t             *dp;            /* incore directory inode */
1751         int                     error;          /* error return code */
1752         xfs_dabuf_t             *fbp;           /* buffer for freespace block */
1753         xfs_fileoff_t           fo;             /* freespace file offset */
1754         xfs_dir2_free_t         *free;          /* freespace structure */
1755         xfs_dabuf_t             *lbp;           /* buffer for leaf block */
1756         xfs_dir2_leaf_tail_t    *ltp;           /* tail of leaf structure */
1757         xfs_dir2_leaf_t         *leaf;          /* leaf structure */
1758         xfs_mount_t             *mp;            /* filesystem mount point */
1759         int                     rval;           /* successful free trim? */
1760         xfs_trans_t             *tp;            /* transaction pointer */
1761 
1762         /*
1763          * There's more than a leaf level in the btree, so there must
1764          * be multiple leafn blocks.  Give up.
1765          */
1766         if (state->path.active > 1)
1767                 return 0;
1768         args = state->args;
1769         xfs_dir2_trace_args("node_to_leaf", args);
1770         mp = state->mp;
1771         dp = args->dp;
1772         tp = args->trans;
1773         /*
1774          * Get the last offset in the file.
1775          */
1776         if ((error = xfs_bmap_last_offset(tp, dp, &fo, XFS_DATA_FORK))) {
1777                 return error;
1778         }
1779         fo -= mp->m_dirblkfsbs;
1780         /*
1781          * If there are freespace blocks other than the first one,
1782          * take this opportunity to remove trailing empty freespace blocks
1783          * that may have been left behind during no-space-reservation
1784          * operations.
1785          */
1786         while (fo > mp->m_dirfreeblk) {
1787                 if ((error = xfs_dir2_node_trim_free(args, fo, &rval))) {
1788                         return error;
1789                 }
1790                 if (rval)
1791                         fo -= mp->m_dirblkfsbs;
1792                 else
1793                         return 0;
1794         }
1795         /*
1796          * Now find the block just before the freespace block.
1797          */
1798         if ((error = xfs_bmap_last_before(tp, dp, &fo, XFS_DATA_FORK))) {
1799                 return error;
1800         }
1801         /*
1802          * If it's not the single leaf block, give up.
1803          */
1804         if (XFS_FSB_TO_B(mp, fo) > XFS_DIR2_LEAF_OFFSET + mp->m_dirblksize)
1805                 return 0;
1806         lbp = state->path.blk[0].bp;
1807         leaf = lbp->data;
1808         ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAFN_MAGIC);
1809         /*
1810          * Read the freespace block.
1811          */
1812         if ((error = xfs_da_read_buf(tp, dp, mp->m_dirfreeblk, -1, &fbp,
1813                         XFS_DATA_FORK))) {
1814                 return error;
1815         }
1816         free = fbp->data;
1817         ASSERT(be32_to_cpu(free->hdr.magic) == XFS_DIR2_FREE_MAGIC);
1818         ASSERT(!free->hdr.firstdb);
1819         /*
1820          * Now see if the leafn and free data will fit in a leaf1.
1821          * If not, release the buffer and give up.
1822          */
1823         if ((uint)sizeof(leaf->hdr) +
1824             (be16_to_cpu(leaf->hdr.count) - be16_to_cpu(leaf->hdr.stale)) * (uint)sizeof(leaf->ents[0]) +
1825             be32_to_cpu(free->hdr.nvalid) * (uint)sizeof(leaf->bests[0]) +
1826             (uint)sizeof(leaf->tail) >
1827             mp->m_dirblksize) {
1828                 xfs_da_brelse(tp, fbp);
1829                 return 0;
1830         }
1831         /*
1832          * If the leaf has any stale entries in it, compress them out.
1833          * The compact routine will log the header.
1834          */
1835         if (be16_to_cpu(leaf->hdr.stale))
1836                 xfs_dir2_leaf_compact(args, lbp);
1837         else
1838                 xfs_dir2_leaf_log_header(tp, lbp);
1839         leaf->hdr.info.magic = cpu_to_be16(XFS_DIR2_LEAF1_MAGIC);
1840         /*
1841          * Set up the leaf tail from the freespace block.
1842          */
1843         ltp = xfs_dir2_leaf_tail_p(mp, leaf);
1844         ltp->bestcount = free->hdr.nvalid;
1845         /*
1846          * Set up the leaf bests table.
1847          */
1848         memcpy(xfs_dir2_leaf_bests_p(ltp), free->bests,
1849                 be32_to_cpu(ltp->bestcount) * sizeof(leaf->bests[0]));
1850         xfs_dir2_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
1851         xfs_dir2_leaf_log_tail(tp, lbp);
1852         xfs_dir2_leaf_check(dp, lbp);
1853         /*
1854          * Get rid of the freespace block.
1855          */
1856         error = xfs_dir2_shrink_inode(args, XFS_DIR2_FREE_FIRSTDB(mp), fbp);
1857         if (error) {
1858                 /*
1859                  * This can't fail here because it can only happen when
1860                  * punching out the middle of an extent, and this is an
1861                  * isolated block.
1862                  */
1863                 ASSERT(error != ENOSPC);
1864                 return error;
1865         }
1866         fbp = NULL;
1867         /*
1868          * Now see if we can convert the single-leaf directory
1869          * down to a block form directory.
1870          * This routine always kills the dabuf for the leaf, so
1871          * eliminate it from the path.
1872          */
1873         error = xfs_dir2_leaf_to_block(args, lbp, NULL);
1874         state->path.blk[0].bp = NULL;
1875         return error;
1876 }
1877 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

kernel.org | git.kernel.org | LWN.net | Project Home | Wiki (Japanese) | Wiki (English) | SVN repository | Mail admin

Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.

osdn.jp