aboutsummaryrefslogtreecommitdiffstats
path: root/fs
diff options
context:
space:
mode:
authorMark Tinguely <tinguely@sgi.com>2013-09-23 13:18:58 -0400
committerGreg Kroah-Hartman <gregkh@linuxfoundation.org>2013-10-13 19:08:34 -0400
commit1fe36ec4914c34f63ea93c87ce6997606098628d (patch)
tree714a65164bc373681f8a39361ffde84a986f8981 /fs
parent2af8997a301609e2664c3c619865c6e1e518257d (diff)
xfs: fix node forward in xfs_node_toosmall
commit 997def25e4b9cee3b01609e18a52f926bca8bd2b upstream. Commit f5ea1100 cleans up the disk to host conversions for node directory entries, but because a variable is reused in xfs_node_toosmall() the next node is not correctly found. If the original node is small enough (<= 3/8 of the node size), this change may incorrectly cause a node collapse when it should not. That will cause an assert in xfstest generic/319: Assertion failed: first <= last && last < BBTOB(bp->b_length), file: /root/newest/xfs/fs/xfs/xfs_trans_buf.c, line: 569 Keep the original node header to get the correct forward node. (When a node is considered for a merge with a sibling, it overwrites the sibling pointers of the original incore nodehdr with the sibling's pointers. This leads to loop considering the original node as a merge candidate with itself in the second pass, and so it incorrectly determines a merge should occur.) [v3: added Dave Chinner's (slightly modified) suggestion to the commit header, cleaned up whitespace. -bpm] Signed-off-by: Mark Tinguely <tinguely@sgi.com> Reviewed-by: Ben Myers <bpm@sgi.com> Signed-off-by: Ben Myers <bpm@sgi.com> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Diffstat (limited to 'fs')
-rw-r--r--fs/xfs/xfs_da_btree.c5
1 files changed, 3 insertions, 2 deletions
diff --git a/fs/xfs/xfs_da_btree.c b/fs/xfs/xfs_da_btree.c
index 0b8b2a13cd24..eca6f9d8a263 100644
--- a/fs/xfs/xfs_da_btree.c
+++ b/fs/xfs/xfs_da_btree.c
@@ -1223,6 +1223,7 @@ xfs_da3_node_toosmall(
1223 /* start with smaller blk num */ 1223 /* start with smaller blk num */
1224 forward = nodehdr.forw < nodehdr.back; 1224 forward = nodehdr.forw < nodehdr.back;
1225 for (i = 0; i < 2; forward = !forward, i++) { 1225 for (i = 0; i < 2; forward = !forward, i++) {
1226 struct xfs_da3_icnode_hdr thdr;
1226 if (forward) 1227 if (forward)
1227 blkno = nodehdr.forw; 1228 blkno = nodehdr.forw;
1228 else 1229 else
@@ -1235,10 +1236,10 @@ xfs_da3_node_toosmall(
1235 return(error); 1236 return(error);
1236 1237
1237 node = bp->b_addr; 1238 node = bp->b_addr;
1238 xfs_da3_node_hdr_from_disk(&nodehdr, node); 1239 xfs_da3_node_hdr_from_disk(&thdr, node);
1239 xfs_trans_brelse(state->args->trans, bp); 1240 xfs_trans_brelse(state->args->trans, bp);
1240 1241
1241 if (count - nodehdr.count >= 0) 1242 if (count - thdr.count >= 0)
1242 break; /* fits with at least 25% to spare */ 1243 break; /* fits with at least 25% to spare */
1243 } 1244 }
1244 if (i >= 2) { 1245 if (i >= 2) {