Lines Matching defs:leaf
207 * If there are stale entries we'll use one for the leaf.
221 * Tag just before the first leaf entry.
226 /* Data object just before the first leaf entry. */
231 * leaf data starts now, if it works at all.
246 * Tag just before the first leaf entry.
250 /* Data object just before the first leaf entry. */
255 * the space before the first leaf entry needs to be free so it
274 * It is the biggest freespace, can it hold the leaf too?
294 * compact the leaf entries.
309 int fromidx; /* source leaf index */
310 int toidx; /* target leaf index */
354 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
357 int compact; /* need to compact leaf ents */
366 int lfloghigh=0; /* last final leaf to log */
367 int lfloglow=0; /* first final leaf to log */
398 * space for entry and new leaf.
414 * If we don't have space for the new entry & leaf ...
433 * If need to compact the leaf entries, do it now.
442 * Set leaf logging boundaries to impossible state.
465 * No stale entries, will use enddup space to hold new leaf.
471 * Mark the space needed for the new leaf entry, now in use.
494 * Adjust pointer to the first leaf entry, we're about to move
495 * the table up one to open up space for the new leaf entry.
506 * Use a stale leaf for our new entry.
553 * Fill in the leaf entry.
590 * Log leaf entries from the block.
596 int first, /* index of first logged leaf */
597 int last) /* index of last logged leaf */
634 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
656 * Get the offset from the leaf entry, to point to the data.
682 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
739 * Get pointer to the entry from the leaf.
782 xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */
787 int ent; /* block leaf entry index */
810 * Point to the data entry using the leaf entry.
829 * Remove the leaf entry by marking it stale.
863 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
868 int ent; /* leaf entry index */
902 * Qsort comparison routine for the block leaf entries.
906 const void *a, /* first leaf entry */
907 const void *b) /* second leaf entry */
909 const xfs_dir2_leaf_entry_t *la; /* first leaf entry */
910 const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */
919 * Convert a V2 leaf directory to a V2 block directory if possible.
924 struct xfs_buf *lbp, /* leaf buffer */
927 __be16 *bestsp; /* leaf bests table */
933 int from; /* leaf from index */
934 xfs_dir2_leaf_t *leaf; /* leaf structure */
935 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
936 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
943 int to; /* block/leaf to index */
952 leaf = lbp->b_addr;
953 xfs_dir2_leaf_hdr_from_disk(mp, &leafhdr, leaf);
954 ltp = xfs_dir2_leaf_tail_p(args->geo, leaf);
962 * These will show up in the leaf bests table.
991 * Size of the "leaf" area in the block.
1029 * Initialize the block leaf area. We compact out stale entries.
1048 * Pitch the old leaf block.
1078 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
1142 * Say we're using the leaf and tail area.
1260 * Sort the leaf entries by hash value.
1264 * Log the leaf entry area and tail.