From 3a67a3ff62208e22c68d35223b26df68425ac2d1 Mon Sep 17 00:00:00 2001 From: Lachlan McIlroy Date: Sat, 10 Feb 2007 18:35:27 +1100 Subject: [PATCH] --- yaml --- r: 47842 b: refs/heads/master c: 1c91ad3aedba82a64ae06a5a0a5651105d378112 h: refs/heads/master v: v3 --- [refs] | 2 +- trunk/fs/xfs/xfs_da_btree.c | 3 +-- 2 files changed, 2 insertions(+), 3 deletions(-) diff --git a/[refs] b/[refs] index 804d88bdc406..2667e6204c2f 100644 --- a/[refs] +++ b/[refs] @@ -1,2 +1,2 @@ --- -refs/heads/master: e5eb7f202b7a1a2d20a0b9866805314bf6464fd0 +refs/heads/master: 1c91ad3aedba82a64ae06a5a0a5651105d378112 diff --git a/trunk/fs/xfs/xfs_da_btree.c b/trunk/fs/xfs/xfs_da_btree.c index a68bc1f1a313..cccf69edb81b 100644 --- a/trunk/fs/xfs/xfs_da_btree.c +++ b/trunk/fs/xfs/xfs_da_btree.c @@ -1090,8 +1090,7 @@ xfs_da_node_lookup_int(xfs_da_state_t *state, int *result) if (blk->magic == XFS_DA_NODE_MAGIC) { node = blk->bp->data; max = be16_to_cpu(node->hdr.count); - btreehashval = node->btree[max-1].hashval; - blk->hashval = be32_to_cpu(btreehashval); + blk->hashval = be32_to_cpu(node->btree[max-1].hashval); /* * Binary search. (note: small blocks will skip loop)