diff options
Diffstat (limited to 'fs/hfs/btree.c')
-rw-r--r-- | fs/hfs/btree.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/fs/hfs/btree.c b/fs/hfs/btree.c index 1ab19e660e69..37cdd955eceb 100644 --- a/fs/hfs/btree.c +++ b/fs/hfs/btree.c | |||
@@ -116,14 +116,14 @@ struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id, btree_keycmp ke | |||
116 | } | 116 | } |
117 | 117 | ||
118 | tree->node_size_shift = ffs(size) - 1; | 118 | tree->node_size_shift = ffs(size) - 1; |
119 | tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT; | 119 | tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT; |
120 | 120 | ||
121 | kunmap(page); | 121 | kunmap(page); |
122 | page_cache_release(page); | 122 | put_page(page); |
123 | return tree; | 123 | return tree; |
124 | 124 | ||
125 | fail_page: | 125 | fail_page: |
126 | page_cache_release(page); | 126 | put_page(page); |
127 | free_inode: | 127 | free_inode: |
128 | tree->inode->i_mapping->a_ops = &hfs_aops; | 128 | tree->inode->i_mapping->a_ops = &hfs_aops; |
129 | iput(tree->inode); | 129 | iput(tree->inode); |
@@ -257,9 +257,9 @@ struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) | |||
257 | off = off16; | 257 | off = off16; |
258 | 258 | ||
259 | off += node->page_offset; | 259 | off += node->page_offset; |
260 | pagep = node->page + (off >> PAGE_CACHE_SHIFT); | 260 | pagep = node->page + (off >> PAGE_SHIFT); |
261 | data = kmap(*pagep); | 261 | data = kmap(*pagep); |
262 | off &= ~PAGE_CACHE_MASK; | 262 | off &= ~PAGE_MASK; |
263 | idx = 0; | 263 | idx = 0; |
264 | 264 | ||
265 | for (;;) { | 265 | for (;;) { |
@@ -279,7 +279,7 @@ struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) | |||
279 | } | 279 | } |
280 | } | 280 | } |
281 | } | 281 | } |
282 | if (++off >= PAGE_CACHE_SIZE) { | 282 | if (++off >= PAGE_SIZE) { |
283 | kunmap(*pagep); | 283 | kunmap(*pagep); |
284 | data = kmap(*++pagep); | 284 | data = kmap(*++pagep); |
285 | off = 0; | 285 | off = 0; |
@@ -302,9 +302,9 @@ struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) | |||
302 | len = hfs_brec_lenoff(node, 0, &off16); | 302 | len = hfs_brec_lenoff(node, 0, &off16); |
303 | off = off16; | 303 | off = off16; |
304 | off += node->page_offset; | 304 | off += node->page_offset; |
305 | pagep = node->page + (off >> PAGE_CACHE_SHIFT); | 305 | pagep = node->page + (off >> PAGE_SHIFT); |
306 | data = kmap(*pagep); | 306 | data = kmap(*pagep); |
307 | off &= ~PAGE_CACHE_MASK; | 307 | off &= ~PAGE_MASK; |
308 | } | 308 | } |
309 | } | 309 | } |
310 | 310 | ||
@@ -348,9 +348,9 @@ void hfs_bmap_free(struct hfs_bnode *node) | |||
348 | len = hfs_brec_lenoff(node, 0, &off); | 348 | len = hfs_brec_lenoff(node, 0, &off); |
349 | } | 349 | } |
350 | off += node->page_offset + nidx / 8; | 350 | off += node->page_offset + nidx / 8; |
351 | page = node->page[off >> PAGE_CACHE_SHIFT]; | 351 | page = node->page[off >> PAGE_SHIFT]; |
352 | data = kmap(page); | 352 | data = kmap(page); |
353 | off &= ~PAGE_CACHE_MASK; | 353 | off &= ~PAGE_MASK; |
354 | m = 1 << (~nidx & 7); | 354 | m = 1 << (~nidx & 7); |
355 | byte = data[off]; | 355 | byte = data[off]; |
356 | if (!(byte & m)) { | 356 | if (!(byte & m)) { |