diff options
author | Dave Kleikamp <shaggy@austin.ibm.com> | 2006-01-24 15:34:47 -0500 |
---|---|---|
committer | Dave Kleikamp <shaggy@austin.ibm.com> | 2006-01-24 15:34:47 -0500 |
commit | 0a0fc0ddbe732779366ab6b1b879f62195e65967 (patch) | |
tree | 7b42490a676cf39ae0691b6859ecf7fd410f229b /fs/hfs/btree.c | |
parent | 4d5dbd0945d9e0833dd7964a3d6ee33157f7cc7a (diff) | |
parent | 3ee68c4af3fd7228c1be63254b9f884614f9ebb2 (diff) |
Merge with /home/shaggy/git/linus-clean/
Diffstat (limited to 'fs/hfs/btree.c')
-rw-r--r-- | fs/hfs/btree.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/fs/hfs/btree.c b/fs/hfs/btree.c index 394725efa1c8..7bb11edd1488 100644 --- a/fs/hfs/btree.c +++ b/fs/hfs/btree.c | |||
@@ -111,7 +111,7 @@ void hfs_btree_close(struct hfs_btree *tree) | |||
111 | while ((node = tree->node_hash[i])) { | 111 | while ((node = tree->node_hash[i])) { |
112 | tree->node_hash[i] = node->next_hash; | 112 | tree->node_hash[i] = node->next_hash; |
113 | if (atomic_read(&node->refcnt)) | 113 | if (atomic_read(&node->refcnt)) |
114 | printk("HFS: node %d:%d still has %d user(s)!\n", | 114 | printk(KERN_ERR "hfs: node %d:%d still has %d user(s)!\n", |
115 | node->tree->cnid, node->this, atomic_read(&node->refcnt)); | 115 | node->tree->cnid, node->this, atomic_read(&node->refcnt)); |
116 | hfs_bnode_free(node); | 116 | hfs_bnode_free(node); |
117 | tree->node_hash_cnt--; | 117 | tree->node_hash_cnt--; |
@@ -252,7 +252,7 @@ struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) | |||
252 | kunmap(*pagep); | 252 | kunmap(*pagep); |
253 | nidx = node->next; | 253 | nidx = node->next; |
254 | if (!nidx) { | 254 | if (!nidx) { |
255 | printk("create new bmap node...\n"); | 255 | printk(KERN_DEBUG "hfs: create new bmap node...\n"); |
256 | next_node = hfs_bmap_new_bmap(node, idx); | 256 | next_node = hfs_bmap_new_bmap(node, idx); |
257 | } else | 257 | } else |
258 | next_node = hfs_bnode_find(tree, nidx); | 258 | next_node = hfs_bnode_find(tree, nidx); |
@@ -292,7 +292,7 @@ void hfs_bmap_free(struct hfs_bnode *node) | |||
292 | hfs_bnode_put(node); | 292 | hfs_bnode_put(node); |
293 | if (!i) { | 293 | if (!i) { |
294 | /* panic */; | 294 | /* panic */; |
295 | printk("HFS: unable to free bnode %u. bmap not found!\n", node->this); | 295 | printk(KERN_CRIT "hfs: unable to free bnode %u. bmap not found!\n", node->this); |
296 | return; | 296 | return; |
297 | } | 297 | } |
298 | node = hfs_bnode_find(tree, i); | 298 | node = hfs_bnode_find(tree, i); |
@@ -300,7 +300,7 @@ void hfs_bmap_free(struct hfs_bnode *node) | |||
300 | return; | 300 | return; |
301 | if (node->type != HFS_NODE_MAP) { | 301 | if (node->type != HFS_NODE_MAP) { |
302 | /* panic */; | 302 | /* panic */; |
303 | printk("HFS: invalid bmap found! (%u,%d)\n", node->this, node->type); | 303 | printk(KERN_CRIT "hfs: invalid bmap found! (%u,%d)\n", node->this, node->type); |
304 | hfs_bnode_put(node); | 304 | hfs_bnode_put(node); |
305 | return; | 305 | return; |
306 | } | 306 | } |
@@ -313,7 +313,7 @@ void hfs_bmap_free(struct hfs_bnode *node) | |||
313 | m = 1 << (~nidx & 7); | 313 | m = 1 << (~nidx & 7); |
314 | byte = data[off]; | 314 | byte = data[off]; |
315 | if (!(byte & m)) { | 315 | if (!(byte & m)) { |
316 | printk("HFS: trying to free free bnode %u(%d)\n", node->this, node->type); | 316 | printk(KERN_CRIT "hfs: trying to free free bnode %u(%d)\n", node->this, node->type); |
317 | kunmap(page); | 317 | kunmap(page); |
318 | hfs_bnode_put(node); | 318 | hfs_bnode_put(node); |
319 | return; | 319 | return; |