xfs/libxfs/xfs_dir2_block.c

209 	 * If there are stale entries we'll use one for the leaf.
223 		 * Tag just before the first leaf entry.
228 		/* Data object just before the first leaf entry.  */
233 		 * leaf data starts now, if it works at all.
248 	 * Tag just before the first leaf entry.
252 	/* Data object just before the first leaf entry.  */
257 	 * the space before the first leaf entry needs to be free so it
276 		 * It is the biggest freespace, can it hold the leaf too?
296  * compact the leaf entries.
311 	int			fromidx;	/* source leaf index */
312 	int			toidx;		/* target leaf index */
356 	xfs_dir2_leaf_entry_t	*blp;		/* block leaf entries */
359 	int			compact;	/* need to compact leaf ents */
368 	int			lfloghigh=0;	/* last final leaf to log */
369 	int			lfloglow=0;	/* first final leaf to log */
400 	 * space for entry and new leaf.
416 	 * If we don't have space for the new entry & leaf ...
435 	 * If need to compact the leaf entries, do it now.
444 		 * Set leaf logging boundaries to impossible state.
467 	 * No stale entries, will use enddup space to hold new leaf.
473 		 * Mark the space needed for the new leaf entry, now in use.
496 		 * Adjust pointer to the first leaf entry, we're about to move
497 		 * the table up one to open up space for the new leaf entry.
508 	 * Use a stale leaf for our new entry.
555 	 * Fill in the leaf entry.
592  * Log leaf entries from the block.
598 	int			first,		/* index of first logged leaf */
599 	int			last)		/* index of last logged leaf */
636 	xfs_dir2_leaf_entry_t	*blp;		/* block leaf entries */
658 	 * Get the offset from the leaf entry, to point to the data.
684 	xfs_dir2_leaf_entry_t	*blp;		/* block leaf entries */
741 		 * Get pointer to the entry from the leaf.
784 	xfs_dir2_leaf_entry_t	*blp;		/* block leaf pointer */
789 	int			ent;		/* block leaf entry index */
812 	 * Point to the data entry using the leaf entry.
831 	 * Remove the leaf entry by marking it stale.
865 	xfs_dir2_leaf_entry_t	*blp;		/* block leaf entries */
870 	int			ent;		/* leaf entry index */
904  * Qsort comparison routine for the block leaf entries.
908 	const void			*a,	/* first leaf entry */
909 	const void			*b)	/* second leaf entry */
911 	const xfs_dir2_leaf_entry_t	*la;	/* first leaf entry */
912 	const xfs_dir2_leaf_entry_t	*lb;	/* second leaf entry */
921  * Convert a V2 leaf directory to a V2 block directory if possible.
926 	struct xfs_buf		*lbp,		/* leaf buffer */
929 	__be16			*bestsp;	/* leaf bests table */
935 	int			from;		/* leaf from index */
936 	xfs_dir2_leaf_t		*leaf;		/* leaf structure */
937 	xfs_dir2_leaf_entry_t	*lep;		/* leaf entry */
938 	xfs_dir2_leaf_tail_t	*ltp;		/* leaf tail structure */
945 	int			to;		/* block/leaf to index */
954 	leaf = lbp->b_addr;
955 	xfs_dir2_leaf_hdr_from_disk(mp, &leafhdr, leaf);
956 	ltp = xfs_dir2_leaf_tail_p(args->geo, leaf);
964 	 * These will show up in the leaf bests table.
993 	 * Size of the "leaf" area in the block.
1031 	 * Initialize the block leaf area.  We compact out stale entries.
1050 	 * Pitch the old leaf block.
1080 	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.