Commit bf354410 authored by Carlos Maiolino's avatar Carlos Maiolino
Browse files

Merge tag 'xfs-6.13-fixes_2024-12-12' of... 

Merge tag 'xfs-6.13-fixes_2024-12-12' of https://git.kernel.org/pub/scm/linux/kernel/git/djwong/xfs-linux

 into next-rc

xfs: bug fixes for 6.13 [01/12]

Bug fixes for 6.13.

This has been running on the djcloud for months with no problems.  Enjoy!

Signed-off-by: default avatar"Darrick J. Wong" <djwong@kernel.org>
Signed-off-by: default avatarCarlos Maiolino <cem@kernel.org>
parents f932fb9b 12f2930f

fs/xfs/libxfs/xfs_btree.c

+25 −8
Original line number Diff line number Diff line
@@ -3557,14 +3557,31 @@ xfs_btree_insrec( 
	xfs_btree_log_block(cur, bp, XFS_BB_NUMRECS);



	/*

	 * If we just inserted into a new tree block, we have to

	 * recalculate nkey here because nkey is out of date.

	 * Update btree keys to reflect the newly added record or keyptr.

	 * There are three cases here to be aware of.  Normally, all we have to

	 * do is walk towards the root, updating keys as necessary.

	 *

	 * Otherwise we're just updating an existing block (having shoved

	 * some records into the new tree block), so use the regular key

	 * update mechanism.

	 */

	if (bp && xfs_buf_daddr(bp) != old_bn) {

	 * If the caller had us target a full block for the insertion, we dealt

	 * with that by calling the _make_block_unfull function.  If the

	 * "make unfull" function splits the block, it'll hand us back the key

	 * and pointer of the new block.  We haven't yet added the new block to

	 * the next level up, so if we decide to add the new record to the new

	 * block (bp->b_bn != old_bn), we have to update the caller's pointer

	 * so that the caller adds the new block with the correct key.

	 *

	 * However, there is a third possibility-- if the selected block is the

	 * root block of an inode-rooted btree and cannot be expanded further,

	 * the "make unfull" function moves the root block contents to a new

	 * block and updates the root block to point to the new block.  In this

	 * case, no block pointer is passed back because the block has already

	 * been added to the btree.  In this case, we need to use the regular

	 * key update function, just like the first case.  This is critical for

	 * overlapping btrees, because the high key must be updated to reflect

	 * the entire tree, not just the subtree accessible through the first

	 * child of the root (which is now two levels down from the root).

	 */

	if (!xfs_btree_ptr_is_null(cur, &nptr) &&

	    bp && xfs_buf_daddr(bp) != old_bn) {

		xfs_btree_get_keys(cur, block, lkey);

	} else if (xfs_btree_needs_key_update(cur, optr)) {

		error = xfs_btree_update_keys(cur, level);
@@ -5144,7 +5161,7 @@ xfs_btree_count_blocks_helper( 
	int			level,

	void			*data)

{

	xfs_extlen_t		*blocks = data;

	xfs_filblks_t		*blocks = data;

	(*blocks)++;



	return 0;
@@ -5154,7 +5171,7 @@ xfs_btree_count_blocks_helper( 
int

xfs_btree_count_blocks(

	struct xfs_btree_cur	*cur,

	xfs_extlen_t		*blocks)

	xfs_filblks_t		*blocks)

{

	*blocks = 0;

	return xfs_btree_visit_blocks(cur, xfs_btree_count_blocks_helper,

fs/xfs/libxfs/xfs_btree.h

+1 −1
Original line number Diff line number Diff line
@@ -484,7 +484,7 @@ typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level, 
int xfs_btree_visit_blocks(struct xfs_btree_cur *cur,

		xfs_btree_visit_blocks_fn fn, unsigned int flags, void *data);



int xfs_btree_count_blocks(struct xfs_btree_cur *cur, xfs_extlen_t *blocks);

int xfs_btree_count_blocks(struct xfs_btree_cur *cur, xfs_filblks_t *blocks);



union xfs_btree_rec *xfs_btree_rec_addr(struct xfs_btree_cur *cur, int n,

		struct xfs_btree_block *block);

fs/xfs/libxfs/xfs_ialloc_btree.c

+3 −1
Original line number Diff line number Diff line
@@ -744,6 +744,7 @@ xfs_finobt_count_blocks( 
{

	struct xfs_buf		*agbp = NULL;

	struct xfs_btree_cur	*cur;

	xfs_filblks_t		blocks;

	int			error;



	error = xfs_ialloc_read_agi(pag, tp, 0, &agbp);
@@ -751,9 +752,10 @@ xfs_finobt_count_blocks( 
		return error;



	cur = xfs_finobt_init_cursor(pag, tp, agbp);

	error = xfs_btree_count_blocks(cur, tree_blocks);

	error = xfs_btree_count_blocks(cur, &blocks);

	xfs_btree_del_cursor(cur, error);

	xfs_trans_brelse(tp, agbp);

	*tree_blocks = blocks;



	return error;

}

fs/xfs/libxfs/xfs_rtgroup.c

+1 −1
Original line number Diff line number Diff line
@@ -496,7 +496,7 @@ xfs_rtginode_create( 


	error = xfs_metadir_create(&upd, S_IFREG);

	if (error)

		return error;

		goto out_cancel;



	xfs_rtginode_lockdep_setup(upd.ip, rtg_rgno(rtg), type);

fs/xfs/libxfs/xfs_sb.c

+6 −5
Original line number Diff line number Diff line
@@ -494,12 +494,13 @@ xfs_validate_sb_common( 
				return -EINVAL;

			}



			if (!sbp->sb_spino_align ||

			    sbp->sb_spino_align > sbp->sb_inoalignmt ||

			    (sbp->sb_inoalignmt % sbp->sb_spino_align) != 0) {

			if (sbp->sb_spino_align &&

			    (sbp->sb_spino_align > sbp->sb_inoalignmt ||

			     (sbp->sb_inoalignmt % sbp->sb_spino_align) != 0)) {

				xfs_warn(mp,

				"Sparse inode alignment (%u) is invalid.",

					sbp->sb_spino_align);

"Sparse inode alignment (%u) is invalid, must be integer factor of (%u).",

					sbp->sb_spino_align,

					sbp->sb_inoalignmt);

				return -EINVAL;

			}

		} else if (sbp->sb_spino_align) {