xfs/libxfs/xfs_dir2_data.c

108 	xfs_dir2_data_free_t	*dfp;		/* bestfree entry */
197 			fa = xfs_dir2_data_freefind_verify(hdr, bf, dup, &dfp);
200 			if (dfp) {
201 				i = (int)(dfp - bf);
466 	struct xfs_dir2_data_free	*dfp;
479 	for (dfp = &bf[0]; dfp < &bf[XFS_DIR2_DATA_FD_COUNT]; dfp++) {
480 		if (!dfp->offset) {
481 			if (dfp->length)
488 		if (be16_to_cpu(dfp->offset) == off) {
490 			if (dfp->length != dup->length)
492 		} else if (be16_to_cpu(dfp->offset) > off) {
494 					be16_to_cpu(dfp->offset))
497 			if (be16_to_cpu(dfp->offset) +
498 					be16_to_cpu(dfp->length) > off)
502 		    be16_to_cpu(dfp->length) < be16_to_cpu(dup->length))
504 		if (dfp > &bf[0] &&
505 		    be16_to_cpu(dfp[-1].length) < be16_to_cpu(dfp[0].length))
524 	xfs_dir2_data_free_t	*dfp;		/* bestfree entry */
539 	for (dfp = &bf[0]; dfp < &bf[XFS_DIR2_DATA_FD_COUNT]; dfp++) {
540 		if (!dfp->offset)
542 		if (be16_to_cpu(dfp->offset) == off)
543 			return dfp;
557 	struct xfs_dir2_data_free *dfp,		/* bestfree table pointer */
574 	if (be16_to_cpu(new.length) > be16_to_cpu(dfp[0].length)) {
575 		dfp[2] = dfp[1];
576 		dfp[1] = dfp[0];
577 		dfp[0] = new;
579 		return &dfp[0];
581 	if (be16_to_cpu(new.length) > be16_to_cpu(dfp[1].length)) {
582 		dfp[2] = dfp[1];
583 		dfp[1] = new;
585 		return &dfp[1];
587 	if (be16_to_cpu(new.length) > be16_to_cpu(dfp[2].length)) {
588 		dfp[2] = new;
590 		return &dfp[2];
602 	struct xfs_dir2_data_free *dfp,		/* bestfree entry pointer */
614 	if (dfp == &bf[0]) {
621 	else if (dfp == &bf[1])
627 		ASSERT(dfp == &bf[2]);
846 	xfs_dir2_data_free_t	*dfp;		/* bestfree pointer */
899 		dfp = xfs_dir2_data_freefind(hdr, bf, prevdup);
918 			 * dfp and dfp2 (don't know which is which), and
922 			ASSERT(dfp && dfp2);
923 			if (dfp == &bf[1]) {
924 				dfp = &bf[0];
925 				ASSERT(dfp2 == dfp);
929 			xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
933 			dfp = xfs_dir2_data_freeinsert(hdr, bf, prevdup,
935 			ASSERT(dfp == &bf[0]);
936 			ASSERT(dfp->length == prevdup->length);
937 			ASSERT(!dfp[1].length);
938 			ASSERT(!dfp[2].length);
945 		dfp = xfs_dir2_data_freefind(hdr, bf, prevdup);
955 		if (dfp) {
956 			xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
971 		dfp = xfs_dir2_data_freefind(hdr, bf, postdup);
983 		if (dfp) {
984 			xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
1039 	struct xfs_dir2_data_free	*dfp,
1042 	if (dfp == NULL)
1044 	if (dfp->length != newdup->length)
1046 	if (be16_to_cpu(dfp->offset) != (char *)newdup - (char *)hdr)
1065 	xfs_dir2_data_free_t	*dfp;		/* bestfree pointer */
1084 	dfp = xfs_dir2_data_freefind(hdr, bf, dup);
1085 	ASSERT(dfp || oldlen <= be16_to_cpu(bf[2].length));
1098 		if (dfp) {
1101 				xfs_dir2_data_freeremove(hdr, bf, dfp,
1119 		if (dfp) {
1120 			xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
1121 			dfp = xfs_dir2_data_freeinsert(hdr, bf, newdup,
1123 			fa = xfs_dir2_data_check_new_free(hdr, dfp, newdup);
1131 			needscan = dfp == &bf[2];
1147 		if (dfp) {
1148 			xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
1149 			dfp = xfs_dir2_data_freeinsert(hdr, bf, newdup,
1151 			fa = xfs_dir2_data_check_new_free(hdr, dfp, newdup);
1159 			needscan = dfp == &bf[2];
1186 		if (dfp) {
1189 				xfs_dir2_data_freeremove(hdr, bf, dfp,