diff options
author | Andrew Morton <akpm@linux-foundation.org> | 2008-04-30 03:54:54 -0400 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2008-04-30 11:29:52 -0400 |
commit | 487798df6d25e76ed6558b3e17c44cf0458cc6f3 (patch) | |
tree | 3c7918f1e8e4146ab716e403daede83bbde4030a | |
parent | 3e5a5097303eedb4ffae2719843eb064221b1db4 (diff) |
hfsplus: fix warning with 64k PAGE_SIZE
fs/hfsplus/btree.c: In function 'hfsplus_bmap_alloc':
fs/hfsplus/btree.c:239: warning: comparison is always false due to limited range of data type
But this might hide a real bug?
Cc: Roman Zippel <zippel@linux-m68k.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
-rw-r--r-- | fs/hfsplus/btree.c | 10 |
1 files changed, 7 insertions, 3 deletions
diff --git a/fs/hfsplus/btree.c b/fs/hfsplus/btree.c index bb5433608a42..e49fcee1e293 100644 --- a/fs/hfsplus/btree.c +++ b/fs/hfsplus/btree.c | |||
@@ -184,7 +184,9 @@ struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) | |||
184 | struct hfs_bnode *node, *next_node; | 184 | struct hfs_bnode *node, *next_node; |
185 | struct page **pagep; | 185 | struct page **pagep; |
186 | u32 nidx, idx; | 186 | u32 nidx, idx; |
187 | u16 off, len; | 187 | unsigned off; |
188 | u16 off16; | ||
189 | u16 len; | ||
188 | u8 *data, byte, m; | 190 | u8 *data, byte, m; |
189 | int i; | 191 | int i; |
190 | 192 | ||
@@ -211,7 +213,8 @@ struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) | |||
211 | node = hfs_bnode_find(tree, nidx); | 213 | node = hfs_bnode_find(tree, nidx); |
212 | if (IS_ERR(node)) | 214 | if (IS_ERR(node)) |
213 | return node; | 215 | return node; |
214 | len = hfs_brec_lenoff(node, 2, &off); | 216 | len = hfs_brec_lenoff(node, 2, &off16); |
217 | off = off16; | ||
215 | 218 | ||
216 | off += node->page_offset; | 219 | off += node->page_offset; |
217 | pagep = node->page + (off >> PAGE_CACHE_SHIFT); | 220 | pagep = node->page + (off >> PAGE_CACHE_SHIFT); |
@@ -256,7 +259,8 @@ struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) | |||
256 | return next_node; | 259 | return next_node; |
257 | node = next_node; | 260 | node = next_node; |
258 | 261 | ||
259 | len = hfs_brec_lenoff(node, 0, &off); | 262 | len = hfs_brec_lenoff(node, 0, &off16); |
263 | off = off16; | ||
260 | off += node->page_offset; | 264 | off += node->page_offset; |
261 | pagep = node->page + (off >> PAGE_CACHE_SHIFT); | 265 | pagep = node->page + (off >> PAGE_CACHE_SHIFT); |
262 | data = kmap(*pagep); | 266 | data = kmap(*pagep); |