xfs/libxfs/xfs_alloc.c

471  * actual (current) free extent fbno for flen blocks.
480 	xfs_extlen_t	flen,		/* length of free extent */
505 				   nflen1 != flen)) {
511 		if ((error = xfs_alloc_lookup_eq(cnt_cur, fbno, flen, &i)))
528 				   nflen1 != flen)) {
534 		if ((error = xfs_alloc_lookup_eq(bno_cur, fbno, flen, &i)))
564 	if (rbno == fbno && rlen == flen)
568 		nflen1 = flen - rlen;
570 	} else if (rbno + rlen == fbno + flen) {
572 		nflen1 = flen - rlen;
578 		nflen2 = (fbno + flen) - nfbno2;
1118 	xfs_extlen_t		flen = 0;
1132 		error = xfs_alloc_get_rec(ccur, &fbno, &flen, &i);
1194 	if (flen < args->minlen) {
1197 		flen = 0;
1200 	*flenp = flen;
1225 	xfs_extlen_t	flen;	/* length of found extent */
1254 	error = xfs_alloc_get_rec(bno_cur, &fbno, &flen, &i);
1268 	tlen = flen;
1301 	error = xfs_alloc_fixup_trees(cnt_cur, bno_cur, fbno, flen, args->agbno,
1699 	xfs_extlen_t		flen;		/* length of found freespace */
1733 						   &fbno, &flen, &i);
1736 		if (i == 0 || flen == 0) {
1742 		busy = xfs_alloc_compute_aligned(args, fbno, flen, &rbno,
1749 			error = xfs_alloc_get_rec(cnt_cur, &fbno, &flen, &i);
1758 			busy = xfs_alloc_compute_aligned(args, fbno, flen,
1798 			   (rlen > flen ||
1799 			    rbno + rlen > fbno + flen))) {
1812 		bestflen = flen;
1819 			if ((error = xfs_alloc_get_rec(cnt_cur, &fbno, &flen,
1827 			if (flen < bestrlen)
1829 			busy = xfs_alloc_compute_aligned(args, fbno, flen,
1834 					   (rlen > flen ||
1835 					    rbno + rlen > fbno + flen))) {
1843 				bestflen = flen;
1859 		flen = bestflen;
1891 	if (XFS_IS_CORRUPT(args->mp, rlen > flen)) {
1901 	if ((error = xfs_alloc_fixup_trees(cnt_cur, bno_cur, fbno, flen,
2754 	xfs_extlen_t		flen;
2769 	error = xfs_alloc_get_rec(cnt_cur, &fbno, &flen, stat);
2773 	if (*stat == 1 && flen != args->minlen)