Update Linux kernel release to v7.2.8-2 for base and BORE kernels

Signed-off-by: Krzysztof Wilczyński <kwilczynski@omarchy.org>
2026-10-06 16:10:37 +09:00
1 parent 69c8193e2a
commit 8d103ac6e3
@@ -0,0 +1,97 @@
+diff --git a/fs/btrfs/block-group.c b/fs/btrfs/block-group.c
+--- a/fs/btrfs/block-group.c
+++ b/fs/btrfs/block-group.c
+@@ -3074,6 +3074,18 @@ struct btrfs_block_group *btrfs_make_block_group(struct btrfs_trans_handle *tran
+ 		return ERR_PTR(ret);
+ 	}
+ 
+	/*
+	 * Ensure the corresponding space_info object is created and
+	 * assigned to our block group. We want our bg to be added to the rbtree
+	 * with its ->space_info set.
+	 *
+	 * On a zoned filesystem btrfs_add_new_free_space() ends up in
+	 * __btrfs_add_free_space_zoned(), which dereferences
+	 * block_group->space_info, so it has to be set beforehand.
+	 */
+	cache->space_info = space_info;
+	ASSERT(cache->space_info);
+
+ 	ret = btrfs_add_new_free_space(cache, chunk_offset, chunk_offset + size, NULL);
+ 	btrfs_free_excluded_extents(cache);
+ 	if (ret) {
+@@ -3081,14 +3093,6 @@ struct btrfs_block_group *btrfs_make_block_group(struct btrfs_trans_handle *tran
+ 		return ERR_PTR(ret);
+ 	}
+ 
+-	/*
+-	 * Ensure the corresponding space_info object is created and
+-	 * assigned to our block group. We want our bg to be added to the rbtree
+-	 * with its ->space_info set.
+-	 */
+-	cache->space_info = space_info;
+-	ASSERT(cache->space_info);
+-
+ 	ret = btrfs_add_block_group_cache(cache);
+ 	if (ret) {
+ 		btrfs_remove_free_space_cache(cache);
+diff --git a/fs/btrfs/tree-checker.c b/fs/btrfs/tree-checker.c
+--- a/fs/btrfs/tree-checker.c
+++ b/fs/btrfs/tree-checker.c
+@@ -1909,6 +1909,16 @@ static int check_inode_ref(struct extent_buffer *leaf,
+ 		return -EUCLEAN;
+ 	}
+ 
+	if (unlikely(btrfs_is_fstree(btrfs_header_owner(leaf)) &&
+	     (key->offset < BTRFS_FIRST_FREE_OBJECTID ||
+	      key->offset > BTRFS_LAST_FREE_OBJECTID))) {
+		inode_ref_err(leaf, slot,
+			      "invalid offset for ref key, have %llu expect [%llu, %lld]",
+			      key->offset, BTRFS_FIRST_FREE_OBJECTID,
+			      BTRFS_LAST_FREE_OBJECTID);
+		return -EUCLEAN;
+	}
+
+ 	ptr = btrfs_item_ptr_offset(leaf, slot);
+ 	end = ptr + btrfs_item_size(leaf, slot);
+ 	while (ptr < end) {
+@@ -1952,12 +1962,14 @@ static int check_inode_extref(struct extent_buffer *leaf,
+ {
+ 	unsigned long ptr = btrfs_item_ptr_offset(leaf, slot);
+ 	unsigned long end = ptr + btrfs_item_size(leaf, slot);
+	const bool is_fstree = btrfs_is_fstree(btrfs_header_owner(leaf));
+ 
+ 	if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
+ 		return -EUCLEAN;
+ 
+ 	while (ptr < end) {
+ 		struct btrfs_inode_extref *extref = (struct btrfs_inode_extref *)ptr;
+		u64 parent;
+ 		u16 namelen;
+ 
+ 		if (unlikely(ptr + sizeof(*extref) > end)) {
+@@ -1967,7 +1979,24 @@ static int check_inode_extref(struct extent_buffer *leaf,
+ 			return -EUCLEAN;
+ 		}
+ 
+		parent = btrfs_inode_extref_parent(leaf, extref);
+		if (unlikely(is_fstree && (parent < BTRFS_FIRST_FREE_OBJECTID ||
+					   parent > BTRFS_LAST_FREE_OBJECTID))) {
+			inode_ref_err(leaf, slot,
+		      "invalid parent for extref key, have %llu expect [%llu, %lld]",
+			      parent, BTRFS_FIRST_FREE_OBJECTID,
+				      BTRFS_LAST_FREE_OBJECTID);
+			return -EUCLEAN;
+		}
+
+ 		namelen = btrfs_inode_extref_name_len(leaf, extref);
+		if (unlikely(namelen == 0 || namelen > BTRFS_NAME_LEN)) {
+			inode_ref_err(leaf, slot,
+				"invalid inode extref name length, has %u expect [1, %u]",
+				namelen, BTRFS_NAME_LEN);
+			return -EUCLEAN;
+		}
+
+ 		if (unlikely(ptr + sizeof(*extref) + namelen > end)) {
+ 			inode_ref_err(leaf, slot,
+ 				"inode extref overflow, ptr %lu end %lu namelen %u",