xfs/libxfs/xfs_dir2_data.c

35 	return hdr->bestfree;
104 	xfs_dir2_data_free_t	*bf;		/* bestfree table */
108 	xfs_dir2_data_free_t	*dfp;		/* bestfree entry */
151 	 * Account for zero bestfree entries.
183 		 * If it's unused, look for the space in the bestfree table.
251 	 * Need to have seen all the entries and all the bestfree slots.
456  * Find the bestfree entry that exactly coincides with unused directory space
457  * or a verifier error because the bestfree data are bad.
475 	 * Validate some consistency in the bestfree table.
509 	/* Looks ok so far; now try to match up with a bestfree entry. */
516  * return the bestfree entry if any that corresponds to it.
521 	struct xfs_dir2_data_free *bf,		/* bestfree table pointer */
524 	xfs_dir2_data_free_t	*dfp;		/* bestfree entry */
530 	 * If this is smaller than the smallest bestfree entry,
537 	 * Look at the three bestfree entries for our guy.
552  * Insert an unused-space entry into the bestfree table.
557 	struct xfs_dir2_data_free *dfp,		/* bestfree table pointer */
561 	xfs_dir2_data_free_t	new;		/* new bestfree entry */
596  * Remove a bestfree entry from the table.
601 	struct xfs_dir2_data_free *bf,		/* bestfree table pointer */
602 	struct xfs_dir2_data_free *dfp,		/* bestfree entry pointer */
637  * Given a data block, reconstruct its bestfree map.
843 	int			*needscanp)	/* out: regen bestfree */
846 	xfs_dir2_data_free_t	*dfp;		/* bestfree pointer */
847 	int			needscan;	/* need to regen bestfree */
894 		xfs_dir2_data_free_t	*dfp2;	/* another bestfree pointer */
897 		 * See if prevdup and/or postdup are in bestfree table.
904 		 * since the third bestfree is there, there might be more
1035 /* Sanity-check a new bestfree entry. */
1062 	int			*needscanp)	/* out: need regen bestfree */
1065 	xfs_dir2_data_free_t	*dfp;		/* bestfree pointer */
1072 	int			needscan;	/* need to regen bestfree */
1080 	 * Look up the entry in the bestfree table.
1095 	 * the bestfree table.