btree.c (1da177e4c3f41524e886b7f1b8a0c1fc7321cac2) btree.c (634725a92938b0f282b17cec0b007dca77adebd2)
1/*
2 * linux/fs/hfsplus/btree.c
3 *
4 * Copyright (C) 2001
5 * Brad Boyer (flar@allandria.com)
6 * (C) 2003 Ardis Technologies <roman@ardistech.com>
7 *
8 * Handle opening/closing btree

--- 25 unchanged lines hidden (view full) ---

34 /* Set the correct compare function */
35 tree->sb = sb;
36 tree->cnid = id;
37 if (id == HFSPLUS_EXT_CNID) {
38 tree->keycmp = hfsplus_ext_cmp_key;
39 } else if (id == HFSPLUS_CAT_CNID) {
40 tree->keycmp = hfsplus_cat_cmp_key;
41 } else {
1/*
2 * linux/fs/hfsplus/btree.c
3 *
4 * Copyright (C) 2001
5 * Brad Boyer (flar@allandria.com)
6 * (C) 2003 Ardis Technologies <roman@ardistech.com>
7 *
8 * Handle opening/closing btree

--- 25 unchanged lines hidden (view full) ---

34 /* Set the correct compare function */
35 tree->sb = sb;
36 tree->cnid = id;
37 if (id == HFSPLUS_EXT_CNID) {
38 tree->keycmp = hfsplus_ext_cmp_key;
39 } else if (id == HFSPLUS_CAT_CNID) {
40 tree->keycmp = hfsplus_cat_cmp_key;
41 } else {
42 printk("HFS+-fs: unknown B*Tree requested\n");
42 printk(KERN_ERR "hfs: unknown B*Tree requested\n");
43 goto free_tree;
44 }
45 tree->inode = iget(sb, id);
46 if (!tree->inode)
47 goto free_tree;
48
49 mapping = tree->inode->i_mapping;
50 page = read_cache_page(mapping, 0, (filler_t *)mapping->a_ops->readpage, NULL);

--- 43 unchanged lines hidden (view full) ---

94
95 if (!tree)
96 return;
97
98 for (i = 0; i < NODE_HASH_SIZE; i++) {
99 while ((node = tree->node_hash[i])) {
100 tree->node_hash[i] = node->next_hash;
101 if (atomic_read(&node->refcnt))
43 goto free_tree;
44 }
45 tree->inode = iget(sb, id);
46 if (!tree->inode)
47 goto free_tree;
48
49 mapping = tree->inode->i_mapping;
50 page = read_cache_page(mapping, 0, (filler_t *)mapping->a_ops->readpage, NULL);

--- 43 unchanged lines hidden (view full) ---

94
95 if (!tree)
96 return;
97
98 for (i = 0; i < NODE_HASH_SIZE; i++) {
99 while ((node = tree->node_hash[i])) {
100 tree->node_hash[i] = node->next_hash;
101 if (atomic_read(&node->refcnt))
102 printk("HFS+: node %d:%d still has %d user(s)!\n",
102 printk(KERN_CRIT "hfs: node %d:%d still has %d user(s)!\n",
103 node->tree->cnid, node->this, atomic_read(&node->refcnt));
104 hfs_bnode_free(node);
105 tree->node_hash_cnt--;
106 }
107 }
108 iput(tree->inode);
109 kfree(tree);
110}

--- 107 unchanged lines hidden (view full) ---

218 if (!(byte & m)) {
219 idx += i;
220 data[off] |= m;
221 set_page_dirty(*pagep);
222 kunmap(*pagep);
223 tree->free_nodes--;
224 mark_inode_dirty(tree->inode);
225 hfs_bnode_put(node);
103 node->tree->cnid, node->this, atomic_read(&node->refcnt));
104 hfs_bnode_free(node);
105 tree->node_hash_cnt--;
106 }
107 }
108 iput(tree->inode);
109 kfree(tree);
110}

--- 107 unchanged lines hidden (view full) ---

218 if (!(byte & m)) {
219 idx += i;
220 data[off] |= m;
221 set_page_dirty(*pagep);
222 kunmap(*pagep);
223 tree->free_nodes--;
224 mark_inode_dirty(tree->inode);
225 hfs_bnode_put(node);
226 if (!idx) {
227 printk("unexpected idx %u (%u)\n", idx, node->this);
228 BUG();
229 }
230 return hfs_bnode_create(tree, idx);
231 }
232 }
233 }
234 if (++off >= PAGE_CACHE_SIZE) {
235 kunmap(*pagep);
236 data = kmap(*++pagep);
237 off = 0;
238 }
239 idx += 8;
240 len--;
241 }
242 kunmap(*pagep);
243 nidx = node->next;
244 if (!nidx) {
226 return hfs_bnode_create(tree, idx);
227 }
228 }
229 }
230 if (++off >= PAGE_CACHE_SIZE) {
231 kunmap(*pagep);
232 data = kmap(*++pagep);
233 off = 0;
234 }
235 idx += 8;
236 len--;
237 }
238 kunmap(*pagep);
239 nidx = node->next;
240 if (!nidx) {
245 printk("create new bmap node...\n");
241 printk(KERN_DEBUG "hfs: create new bmap node...\n");
246 next_node = hfs_bmap_new_bmap(node, idx);
247 } else
248 next_node = hfs_bnode_find(tree, nidx);
249 hfs_bnode_put(node);
250 if (IS_ERR(next_node))
251 return next_node;
252 node = next_node;
253

--- 25 unchanged lines hidden (view full) ---

279 while (nidx >= len * 8) {
280 u32 i;
281
282 nidx -= len * 8;
283 i = node->next;
284 hfs_bnode_put(node);
285 if (!i) {
286 /* panic */;
242 next_node = hfs_bmap_new_bmap(node, idx);
243 } else
244 next_node = hfs_bnode_find(tree, nidx);
245 hfs_bnode_put(node);
246 if (IS_ERR(next_node))
247 return next_node;
248 node = next_node;
249

--- 25 unchanged lines hidden (view full) ---

275 while (nidx >= len * 8) {
276 u32 i;
277
278 nidx -= len * 8;
279 i = node->next;
280 hfs_bnode_put(node);
281 if (!i) {
282 /* panic */;
287 printk("HFS: unable to free bnode %u. bmap not found!\n", node->this);
283 printk(KERN_CRIT "hfs: unable to free bnode %u. bmap not found!\n", node->this);
288 return;
289 }
290 node = hfs_bnode_find(tree, i);
291 if (IS_ERR(node))
292 return;
293 if (node->type != HFS_NODE_MAP) {
294 /* panic */;
284 return;
285 }
286 node = hfs_bnode_find(tree, i);
287 if (IS_ERR(node))
288 return;
289 if (node->type != HFS_NODE_MAP) {
290 /* panic */;
295 printk("HFS: invalid bmap found! (%u,%d)\n", node->this, node->type);
291 printk(KERN_CRIT "hfs: invalid bmap found! (%u,%d)\n", node->this, node->type);
296 hfs_bnode_put(node);
297 return;
298 }
299 len = hfs_brec_lenoff(node, 0, &off);
300 }
301 off += node->page_offset + nidx / 8;
302 page = node->page[off >> PAGE_CACHE_SHIFT];
303 data = kmap(page);
304 off &= ~PAGE_CACHE_MASK;
305 m = 1 << (~nidx & 7);
306 byte = data[off];
307 if (!(byte & m)) {
292 hfs_bnode_put(node);
293 return;
294 }
295 len = hfs_brec_lenoff(node, 0, &off);
296 }
297 off += node->page_offset + nidx / 8;
298 page = node->page[off >> PAGE_CACHE_SHIFT];
299 data = kmap(page);
300 off &= ~PAGE_CACHE_MASK;
301 m = 1 << (~nidx & 7);
302 byte = data[off];
303 if (!(byte & m)) {
308 printk("HFS: trying to free free bnode %u(%d)\n", node->this, node->type);
304 printk(KERN_CRIT "hfs: trying to free free bnode %u(%d)\n", node->this, node->type);
309 kunmap(page);
310 hfs_bnode_put(node);
311 return;
312 }
313 data[off] = byte & ~m;
314 set_page_dirty(page);
315 kunmap(page);
316 hfs_bnode_put(node);
317 tree->free_nodes++;
318 mark_inode_dirty(tree->inode);
319}
305 kunmap(page);
306 hfs_bnode_put(node);
307 return;
308 }
309 data[off] = byte & ~m;
310 set_page_dirty(page);
311 kunmap(page);
312 hfs_bnode_put(node);
313 tree->free_nodes++;
314 mark_inode_dirty(tree->inode);
315}