diff options
author | Joe Perches <joe@perches.com> | 2013-04-30 18:27:54 -0400 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2013-04-30 20:04:05 -0400 |
commit | c2b3e1f76e5c90215bc7f740b376c0220eb8a8e3 (patch) | |
tree | 4ffbb3029d06909e05621ebb96b66052640f3ff7 /fs/hfs | |
parent | 5f3726f9457d5a863721353786e3395cdbd0f943 (diff) |
hfs/hfsplus: convert dprint to hfs_dbg
Use a more current logging style.
Rename macro and uses.
Add do {} while (0) to macro.
Add DBG_ to macro.
Add and use hfs_dbg_cont variant where appropriate.
Signed-off-by: Joe Perches <joe@perches.com>
Cc: Vyacheslav Dubeyko <slava@dubeyko.com>
Cc: Hin-Tak Leung <htl10@users.sourceforge.net>
Cc: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'fs/hfs')
-rw-r--r-- | fs/hfs/bfind.c | 6 | ||||
-rw-r--r-- | fs/hfs/bitmap.c | 4 | ||||
-rw-r--r-- | fs/hfs/bnode.c | 35 | ||||
-rw-r--r-- | fs/hfs/brec.c | 11 | ||||
-rw-r--r-- | fs/hfs/btree.c | 2 | ||||
-rw-r--r-- | fs/hfs/catalog.c | 8 | ||||
-rw-r--r-- | fs/hfs/extent.c | 20 | ||||
-rw-r--r-- | fs/hfs/hfs_fs.h | 14 | ||||
-rw-r--r-- | fs/hfs/inode.c | 4 |
9 files changed, 63 insertions, 41 deletions
diff --git a/fs/hfs/bfind.c b/fs/hfs/bfind.c index 571abe97b42a..e928f6cfb05b 100644 --- a/fs/hfs/bfind.c +++ b/fs/hfs/bfind.c | |||
@@ -22,7 +22,8 @@ int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) | |||
22 | return -ENOMEM; | 22 | return -ENOMEM; |
23 | fd->search_key = ptr; | 23 | fd->search_key = ptr; |
24 | fd->key = ptr + tree->max_key_len + 2; | 24 | fd->key = ptr + tree->max_key_len + 2; |
25 | dprint(DBG_BNODE_REFS, "find_init: %d (%p)\n", tree->cnid, __builtin_return_address(0)); | 25 | hfs_dbg(BNODE_REFS, "find_init: %d (%p)\n", |
26 | tree->cnid, __builtin_return_address(0)); | ||
26 | mutex_lock(&tree->tree_lock); | 27 | mutex_lock(&tree->tree_lock); |
27 | return 0; | 28 | return 0; |
28 | } | 29 | } |
@@ -31,7 +32,8 @@ void hfs_find_exit(struct hfs_find_data *fd) | |||
31 | { | 32 | { |
32 | hfs_bnode_put(fd->bnode); | 33 | hfs_bnode_put(fd->bnode); |
33 | kfree(fd->search_key); | 34 | kfree(fd->search_key); |
34 | dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0)); | 35 | hfs_dbg(BNODE_REFS, "find_exit: %d (%p)\n", |
36 | fd->tree->cnid, __builtin_return_address(0)); | ||
35 | mutex_unlock(&fd->tree->tree_lock); | 37 | mutex_unlock(&fd->tree->tree_lock); |
36 | fd->tree = NULL; | 38 | fd->tree = NULL; |
37 | } | 39 | } |
diff --git a/fs/hfs/bitmap.c b/fs/hfs/bitmap.c index c6e97366e8ac..28307bc9ec1e 100644 --- a/fs/hfs/bitmap.c +++ b/fs/hfs/bitmap.c | |||
@@ -158,7 +158,7 @@ u32 hfs_vbm_search_free(struct super_block *sb, u32 goal, u32 *num_bits) | |||
158 | } | 158 | } |
159 | } | 159 | } |
160 | 160 | ||
161 | dprint(DBG_BITMAP, "alloc_bits: %u,%u\n", pos, *num_bits); | 161 | hfs_dbg(BITMAP, "alloc_bits: %u,%u\n", pos, *num_bits); |
162 | HFS_SB(sb)->free_ablocks -= *num_bits; | 162 | HFS_SB(sb)->free_ablocks -= *num_bits; |
163 | hfs_bitmap_dirty(sb); | 163 | hfs_bitmap_dirty(sb); |
164 | out: | 164 | out: |
@@ -200,7 +200,7 @@ int hfs_clear_vbm_bits(struct super_block *sb, u16 start, u16 count) | |||
200 | if (!count) | 200 | if (!count) |
201 | return 0; | 201 | return 0; |
202 | 202 | ||
203 | dprint(DBG_BITMAP, "clear_bits: %u,%u\n", start, count); | 203 | hfs_dbg(BITMAP, "clear_bits: %u,%u\n", start, count); |
204 | /* are all of the bits in range? */ | 204 | /* are all of the bits in range? */ |
205 | if ((start + count) > HFS_SB(sb)->fs_ablocks) | 205 | if ((start + count) > HFS_SB(sb)->fs_ablocks) |
206 | return -2; | 206 | return -2; |
diff --git a/fs/hfs/bnode.c b/fs/hfs/bnode.c index cdb41a1f6a64..869391902575 100644 --- a/fs/hfs/bnode.c +++ b/fs/hfs/bnode.c | |||
@@ -100,7 +100,7 @@ void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst, | |||
100 | struct hfs_btree *tree; | 100 | struct hfs_btree *tree; |
101 | struct page *src_page, *dst_page; | 101 | struct page *src_page, *dst_page; |
102 | 102 | ||
103 | dprint(DBG_BNODE_MOD, "copybytes: %u,%u,%u\n", dst, src, len); | 103 | hfs_dbg(BNODE_MOD, "copybytes: %u,%u,%u\n", dst, src, len); |
104 | if (!len) | 104 | if (!len) |
105 | return; | 105 | return; |
106 | tree = src_node->tree; | 106 | tree = src_node->tree; |
@@ -120,7 +120,7 @@ void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len) | |||
120 | struct page *page; | 120 | struct page *page; |
121 | void *ptr; | 121 | void *ptr; |
122 | 122 | ||
123 | dprint(DBG_BNODE_MOD, "movebytes: %u,%u,%u\n", dst, src, len); | 123 | hfs_dbg(BNODE_MOD, "movebytes: %u,%u,%u\n", dst, src, len); |
124 | if (!len) | 124 | if (!len) |
125 | return; | 125 | return; |
126 | src += node->page_offset; | 126 | src += node->page_offset; |
@@ -138,16 +138,16 @@ void hfs_bnode_dump(struct hfs_bnode *node) | |||
138 | __be32 cnid; | 138 | __be32 cnid; |
139 | int i, off, key_off; | 139 | int i, off, key_off; |
140 | 140 | ||
141 | dprint(DBG_BNODE_MOD, "bnode: %d\n", node->this); | 141 | hfs_dbg(BNODE_MOD, "bnode: %d\n", node->this); |
142 | hfs_bnode_read(node, &desc, 0, sizeof(desc)); | 142 | hfs_bnode_read(node, &desc, 0, sizeof(desc)); |
143 | dprint(DBG_BNODE_MOD, "%d, %d, %d, %d, %d\n", | 143 | hfs_dbg(BNODE_MOD, "%d, %d, %d, %d, %d\n", |
144 | be32_to_cpu(desc.next), be32_to_cpu(desc.prev), | 144 | be32_to_cpu(desc.next), be32_to_cpu(desc.prev), |
145 | desc.type, desc.height, be16_to_cpu(desc.num_recs)); | 145 | desc.type, desc.height, be16_to_cpu(desc.num_recs)); |
146 | 146 | ||
147 | off = node->tree->node_size - 2; | 147 | off = node->tree->node_size - 2; |
148 | for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { | 148 | for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) { |
149 | key_off = hfs_bnode_read_u16(node, off); | 149 | key_off = hfs_bnode_read_u16(node, off); |
150 | dprint(DBG_BNODE_MOD, " %d", key_off); | 150 | hfs_dbg_cont(BNODE_MOD, " %d", key_off); |
151 | if (i && node->type == HFS_NODE_INDEX) { | 151 | if (i && node->type == HFS_NODE_INDEX) { |
152 | int tmp; | 152 | int tmp; |
153 | 153 | ||
@@ -155,17 +155,18 @@ void hfs_bnode_dump(struct hfs_bnode *node) | |||
155 | tmp = (hfs_bnode_read_u8(node, key_off) | 1) + 1; | 155 | tmp = (hfs_bnode_read_u8(node, key_off) | 1) + 1; |
156 | else | 156 | else |
157 | tmp = node->tree->max_key_len + 1; | 157 | tmp = node->tree->max_key_len + 1; |
158 | dprint(DBG_BNODE_MOD, " (%d,%d", tmp, hfs_bnode_read_u8(node, key_off)); | 158 | hfs_dbg_cont(BNODE_MOD, " (%d,%d", |
159 | tmp, hfs_bnode_read_u8(node, key_off)); | ||
159 | hfs_bnode_read(node, &cnid, key_off + tmp, 4); | 160 | hfs_bnode_read(node, &cnid, key_off + tmp, 4); |
160 | dprint(DBG_BNODE_MOD, ",%d)", be32_to_cpu(cnid)); | 161 | hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid)); |
161 | } else if (i && node->type == HFS_NODE_LEAF) { | 162 | } else if (i && node->type == HFS_NODE_LEAF) { |
162 | int tmp; | 163 | int tmp; |
163 | 164 | ||
164 | tmp = hfs_bnode_read_u8(node, key_off); | 165 | tmp = hfs_bnode_read_u8(node, key_off); |
165 | dprint(DBG_BNODE_MOD, " (%d)", tmp); | 166 | hfs_dbg_cont(BNODE_MOD, " (%d)", tmp); |
166 | } | 167 | } |
167 | } | 168 | } |
168 | dprint(DBG_BNODE_MOD, "\n"); | 169 | hfs_dbg_cont(BNODE_MOD, "\n"); |
169 | } | 170 | } |
170 | 171 | ||
171 | void hfs_bnode_unlink(struct hfs_bnode *node) | 172 | void hfs_bnode_unlink(struct hfs_bnode *node) |
@@ -257,8 +258,8 @@ static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) | |||
257 | node->this = cnid; | 258 | node->this = cnid; |
258 | set_bit(HFS_BNODE_NEW, &node->flags); | 259 | set_bit(HFS_BNODE_NEW, &node->flags); |
259 | atomic_set(&node->refcnt, 1); | 260 | atomic_set(&node->refcnt, 1); |
260 | dprint(DBG_BNODE_REFS, "new_node(%d:%d): 1\n", | 261 | hfs_dbg(BNODE_REFS, "new_node(%d:%d): 1\n", |
261 | node->tree->cnid, node->this); | 262 | node->tree->cnid, node->this); |
262 | init_waitqueue_head(&node->lock_wq); | 263 | init_waitqueue_head(&node->lock_wq); |
263 | spin_lock(&tree->hash_lock); | 264 | spin_lock(&tree->hash_lock); |
264 | node2 = hfs_bnode_findhash(tree, cnid); | 265 | node2 = hfs_bnode_findhash(tree, cnid); |
@@ -301,7 +302,7 @@ void hfs_bnode_unhash(struct hfs_bnode *node) | |||
301 | { | 302 | { |
302 | struct hfs_bnode **p; | 303 | struct hfs_bnode **p; |
303 | 304 | ||
304 | dprint(DBG_BNODE_REFS, "remove_node(%d:%d): %d\n", | 305 | hfs_dbg(BNODE_REFS, "remove_node(%d:%d): %d\n", |
305 | node->tree->cnid, node->this, atomic_read(&node->refcnt)); | 306 | node->tree->cnid, node->this, atomic_read(&node->refcnt)); |
306 | for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; | 307 | for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; |
307 | *p && *p != node; p = &(*p)->next_hash) | 308 | *p && *p != node; p = &(*p)->next_hash) |
@@ -443,8 +444,9 @@ void hfs_bnode_get(struct hfs_bnode *node) | |||
443 | { | 444 | { |
444 | if (node) { | 445 | if (node) { |
445 | atomic_inc(&node->refcnt); | 446 | atomic_inc(&node->refcnt); |
446 | dprint(DBG_BNODE_REFS, "get_node(%d:%d): %d\n", | 447 | hfs_dbg(BNODE_REFS, "get_node(%d:%d): %d\n", |
447 | node->tree->cnid, node->this, atomic_read(&node->refcnt)); | 448 | node->tree->cnid, node->this, |
449 | atomic_read(&node->refcnt)); | ||
448 | } | 450 | } |
449 | } | 451 | } |
450 | 452 | ||
@@ -455,8 +457,9 @@ void hfs_bnode_put(struct hfs_bnode *node) | |||
455 | struct hfs_btree *tree = node->tree; | 457 | struct hfs_btree *tree = node->tree; |
456 | int i; | 458 | int i; |
457 | 459 | ||
458 | dprint(DBG_BNODE_REFS, "put_node(%d:%d): %d\n", | 460 | hfs_dbg(BNODE_REFS, "put_node(%d:%d): %d\n", |
459 | node->tree->cnid, node->this, atomic_read(&node->refcnt)); | 461 | node->tree->cnid, node->this, |
462 | atomic_read(&node->refcnt)); | ||
460 | BUG_ON(!atomic_read(&node->refcnt)); | 463 | BUG_ON(!atomic_read(&node->refcnt)); |
461 | if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock)) | 464 | if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock)) |
462 | return; | 465 | return; |
diff --git a/fs/hfs/brec.c b/fs/hfs/brec.c index 92fb358ce824..57642570c6d8 100644 --- a/fs/hfs/brec.c +++ b/fs/hfs/brec.c | |||
@@ -94,7 +94,8 @@ again: | |||
94 | end_rec_off = tree->node_size - (node->num_recs + 1) * 2; | 94 | end_rec_off = tree->node_size - (node->num_recs + 1) * 2; |
95 | end_off = hfs_bnode_read_u16(node, end_rec_off); | 95 | end_off = hfs_bnode_read_u16(node, end_rec_off); |
96 | end_rec_off -= 2; | 96 | end_rec_off -= 2; |
97 | dprint(DBG_BNODE_MOD, "insert_rec: %d, %d, %d, %d\n", rec, size, end_off, end_rec_off); | 97 | hfs_dbg(BNODE_MOD, "insert_rec: %d, %d, %d, %d\n", |
98 | rec, size, end_off, end_rec_off); | ||
98 | if (size > end_rec_off - end_off) { | 99 | if (size > end_rec_off - end_off) { |
99 | if (new_node) | 100 | if (new_node) |
100 | panic("not enough room!\n"); | 101 | panic("not enough room!\n"); |
@@ -190,7 +191,8 @@ again: | |||
190 | mark_inode_dirty(tree->inode); | 191 | mark_inode_dirty(tree->inode); |
191 | } | 192 | } |
192 | hfs_bnode_dump(node); | 193 | hfs_bnode_dump(node); |
193 | dprint(DBG_BNODE_MOD, "remove_rec: %d, %d\n", fd->record, fd->keylength + fd->entrylength); | 194 | hfs_dbg(BNODE_MOD, "remove_rec: %d, %d\n", |
195 | fd->record, fd->keylength + fd->entrylength); | ||
194 | if (!--node->num_recs) { | 196 | if (!--node->num_recs) { |
195 | hfs_bnode_unlink(node); | 197 | hfs_bnode_unlink(node); |
196 | if (!node->parent) | 198 | if (!node->parent) |
@@ -240,7 +242,7 @@ static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) | |||
240 | if (IS_ERR(new_node)) | 242 | if (IS_ERR(new_node)) |
241 | return new_node; | 243 | return new_node; |
242 | hfs_bnode_get(node); | 244 | hfs_bnode_get(node); |
243 | dprint(DBG_BNODE_MOD, "split_nodes: %d - %d - %d\n", | 245 | hfs_dbg(BNODE_MOD, "split_nodes: %d - %d - %d\n", |
244 | node->this, new_node->this, node->next); | 246 | node->this, new_node->this, node->next); |
245 | new_node->next = node->next; | 247 | new_node->next = node->next; |
246 | new_node->prev = node->this; | 248 | new_node->prev = node->this; |
@@ -374,7 +376,8 @@ again: | |||
374 | newkeylen = (hfs_bnode_read_u8(node, 14) | 1) + 1; | 376 | newkeylen = (hfs_bnode_read_u8(node, 14) | 1) + 1; |
375 | else | 377 | else |
376 | fd->keylength = newkeylen = tree->max_key_len + 1; | 378 | fd->keylength = newkeylen = tree->max_key_len + 1; |
377 | dprint(DBG_BNODE_MOD, "update_rec: %d, %d, %d\n", rec, fd->keylength, newkeylen); | 379 | hfs_dbg(BNODE_MOD, "update_rec: %d, %d, %d\n", |
380 | rec, fd->keylength, newkeylen); | ||
378 | 381 | ||
379 | rec_off = tree->node_size - (rec + 2) * 2; | 382 | rec_off = tree->node_size - (rec + 2) * 2; |
380 | end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; | 383 | end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; |
diff --git a/fs/hfs/btree.c b/fs/hfs/btree.c index 1cbdeea1db44..07d94ce1d278 100644 --- a/fs/hfs/btree.c +++ b/fs/hfs/btree.c | |||
@@ -316,7 +316,7 @@ void hfs_bmap_free(struct hfs_bnode *node) | |||
316 | u32 nidx; | 316 | u32 nidx; |
317 | u8 *data, byte, m; | 317 | u8 *data, byte, m; |
318 | 318 | ||
319 | dprint(DBG_BNODE_MOD, "btree_free_node: %u\n", node->this); | 319 | hfs_dbg(BNODE_MOD, "btree_free_node: %u\n", node->this); |
320 | tree = node->tree; | 320 | tree = node->tree; |
321 | nidx = node->this; | 321 | nidx = node->this; |
322 | node = hfs_bnode_find(tree, 0); | 322 | node = hfs_bnode_find(tree, 0); |
diff --git a/fs/hfs/catalog.c b/fs/hfs/catalog.c index 9569b39257ec..6ecb3d7efb78 100644 --- a/fs/hfs/catalog.c +++ b/fs/hfs/catalog.c | |||
@@ -87,7 +87,8 @@ int hfs_cat_create(u32 cnid, struct inode *dir, struct qstr *str, struct inode * | |||
87 | int entry_size; | 87 | int entry_size; |
88 | int err; | 88 | int err; |
89 | 89 | ||
90 | dprint(DBG_CAT_MOD, "create_cat: %s,%u(%d)\n", str->name, cnid, inode->i_nlink); | 90 | hfs_dbg(CAT_MOD, "create_cat: %s,%u(%d)\n", |
91 | str->name, cnid, inode->i_nlink); | ||
91 | if (dir->i_size >= HFS_MAX_VALENCE) | 92 | if (dir->i_size >= HFS_MAX_VALENCE) |
92 | return -ENOSPC; | 93 | return -ENOSPC; |
93 | 94 | ||
@@ -214,7 +215,7 @@ int hfs_cat_delete(u32 cnid, struct inode *dir, struct qstr *str) | |||
214 | struct list_head *pos; | 215 | struct list_head *pos; |
215 | int res, type; | 216 | int res, type; |
216 | 217 | ||
217 | dprint(DBG_CAT_MOD, "delete_cat: %s,%u\n", str ? str->name : NULL, cnid); | 218 | hfs_dbg(CAT_MOD, "delete_cat: %s,%u\n", str ? str->name : NULL, cnid); |
218 | sb = dir->i_sb; | 219 | sb = dir->i_sb; |
219 | res = hfs_find_init(HFS_SB(sb)->cat_tree, &fd); | 220 | res = hfs_find_init(HFS_SB(sb)->cat_tree, &fd); |
220 | if (res) | 221 | if (res) |
@@ -282,7 +283,8 @@ int hfs_cat_move(u32 cnid, struct inode *src_dir, struct qstr *src_name, | |||
282 | int entry_size, type; | 283 | int entry_size, type; |
283 | int err; | 284 | int err; |
284 | 285 | ||
285 | dprint(DBG_CAT_MOD, "rename_cat: %u - %lu,%s - %lu,%s\n", cnid, src_dir->i_ino, src_name->name, | 286 | hfs_dbg(CAT_MOD, "rename_cat: %u - %lu,%s - %lu,%s\n", |
287 | cnid, src_dir->i_ino, src_name->name, | ||
286 | dst_dir->i_ino, dst_name->name); | 288 | dst_dir->i_ino, dst_name->name); |
287 | sb = src_dir->i_sb; | 289 | sb = src_dir->i_sb; |
288 | err = hfs_find_init(HFS_SB(sb)->cat_tree, &src_fd); | 290 | err = hfs_find_init(HFS_SB(sb)->cat_tree, &src_fd); |
diff --git a/fs/hfs/extent.c b/fs/hfs/extent.c index 813447b5b052..e33a0d36a93e 100644 --- a/fs/hfs/extent.c +++ b/fs/hfs/extent.c | |||
@@ -205,11 +205,12 @@ static void hfs_dump_extent(struct hfs_extent *extent) | |||
205 | { | 205 | { |
206 | int i; | 206 | int i; |
207 | 207 | ||
208 | dprint(DBG_EXTENT, " "); | 208 | hfs_dbg(EXTENT, " "); |
209 | for (i = 0; i < 3; i++) | 209 | for (i = 0; i < 3; i++) |
210 | dprint(DBG_EXTENT, " %u:%u", be16_to_cpu(extent[i].block), | 210 | hfs_dbg_cont(EXTENT, " %u:%u", |
211 | be16_to_cpu(extent[i].count)); | 211 | be16_to_cpu(extent[i].block), |
212 | dprint(DBG_EXTENT, "\n"); | 212 | be16_to_cpu(extent[i].count)); |
213 | hfs_dbg_cont(EXTENT, "\n"); | ||
213 | } | 214 | } |
214 | 215 | ||
215 | static int hfs_add_extent(struct hfs_extent *extent, u16 offset, | 216 | static int hfs_add_extent(struct hfs_extent *extent, u16 offset, |
@@ -404,10 +405,10 @@ int hfs_extend_file(struct inode *inode) | |||
404 | goto out; | 405 | goto out; |
405 | } | 406 | } |
406 | 407 | ||
407 | dprint(DBG_EXTENT, "extend %lu: %u,%u\n", inode->i_ino, start, len); | 408 | hfs_dbg(EXTENT, "extend %lu: %u,%u\n", inode->i_ino, start, len); |
408 | if (HFS_I(inode)->alloc_blocks == HFS_I(inode)->first_blocks) { | 409 | if (HFS_I(inode)->alloc_blocks == HFS_I(inode)->first_blocks) { |
409 | if (!HFS_I(inode)->first_blocks) { | 410 | if (!HFS_I(inode)->first_blocks) { |
410 | dprint(DBG_EXTENT, "first extents\n"); | 411 | hfs_dbg(EXTENT, "first extents\n"); |
411 | /* no extents yet */ | 412 | /* no extents yet */ |
412 | HFS_I(inode)->first_extents[0].block = cpu_to_be16(start); | 413 | HFS_I(inode)->first_extents[0].block = cpu_to_be16(start); |
413 | HFS_I(inode)->first_extents[0].count = cpu_to_be16(len); | 414 | HFS_I(inode)->first_extents[0].count = cpu_to_be16(len); |
@@ -449,7 +450,7 @@ out: | |||
449 | return res; | 450 | return res; |
450 | 451 | ||
451 | insert_extent: | 452 | insert_extent: |
452 | dprint(DBG_EXTENT, "insert new extent\n"); | 453 | hfs_dbg(EXTENT, "insert new extent\n"); |
453 | res = hfs_ext_write_extent(inode); | 454 | res = hfs_ext_write_extent(inode); |
454 | if (res) | 455 | if (res) |
455 | goto out; | 456 | goto out; |
@@ -474,8 +475,9 @@ void hfs_file_truncate(struct inode *inode) | |||
474 | u32 size; | 475 | u32 size; |
475 | int res; | 476 | int res; |
476 | 477 | ||
477 | dprint(DBG_INODE, "truncate: %lu, %Lu -> %Lu\n", inode->i_ino, | 478 | hfs_dbg(INODE, "truncate: %lu, %Lu -> %Lu\n", |
478 | (long long)HFS_I(inode)->phys_size, inode->i_size); | 479 | inode->i_ino, (long long)HFS_I(inode)->phys_size, |
480 | inode->i_size); | ||
479 | if (inode->i_size > HFS_I(inode)->phys_size) { | 481 | if (inode->i_size > HFS_I(inode)->phys_size) { |
480 | struct address_space *mapping = inode->i_mapping; | 482 | struct address_space *mapping = inode->i_mapping; |
481 | void *fsdata; | 483 | void *fsdata; |
diff --git a/fs/hfs/hfs_fs.h b/fs/hfs/hfs_fs.h index 67817af96f82..d363b1e81ae9 100644 --- a/fs/hfs/hfs_fs.h +++ b/fs/hfs/hfs_fs.h | |||
@@ -34,8 +34,18 @@ | |||
34 | //#define DBG_MASK (DBG_CAT_MOD|DBG_BNODE_REFS|DBG_INODE|DBG_EXTENT) | 34 | //#define DBG_MASK (DBG_CAT_MOD|DBG_BNODE_REFS|DBG_INODE|DBG_EXTENT) |
35 | #define DBG_MASK (0) | 35 | #define DBG_MASK (0) |
36 | 36 | ||
37 | #define dprint(flg, fmt, args...) \ | 37 | #define hfs_dbg(flg, fmt, ...) \ |
38 | if (flg & DBG_MASK) printk(fmt , ## args) | 38 | do { \ |
39 | if (DBG_##flg & DBG_MASK) \ | ||
40 | printk(KERN_DEBUG fmt, ##__VA_ARGS__); \ | ||
41 | } while (0) | ||
42 | |||
43 | #define hfs_dbg_cont(flg, fmt, ...) \ | ||
44 | do { \ | ||
45 | if (DBG_##flg & DBG_MASK) \ | ||
46 | printk(KERN_CONT fmt, ##__VA_ARGS__); \ | ||
47 | } while (0) | ||
48 | |||
39 | 49 | ||
40 | /* | 50 | /* |
41 | * struct hfs_inode_info | 51 | * struct hfs_inode_info |
diff --git a/fs/hfs/inode.c b/fs/hfs/inode.c index 0847471ff04f..716e1aafb2e2 100644 --- a/fs/hfs/inode.c +++ b/fs/hfs/inode.c | |||
@@ -237,7 +237,7 @@ void hfs_delete_inode(struct inode *inode) | |||
237 | { | 237 | { |
238 | struct super_block *sb = inode->i_sb; | 238 | struct super_block *sb = inode->i_sb; |
239 | 239 | ||
240 | dprint(DBG_INODE, "delete_inode: %lu\n", inode->i_ino); | 240 | hfs_dbg(INODE, "delete_inode: %lu\n", inode->i_ino); |
241 | if (S_ISDIR(inode->i_mode)) { | 241 | if (S_ISDIR(inode->i_mode)) { |
242 | HFS_SB(sb)->folder_count--; | 242 | HFS_SB(sb)->folder_count--; |
243 | if (HFS_I(inode)->cat_key.ParID == cpu_to_be32(HFS_ROOT_CNID)) | 243 | if (HFS_I(inode)->cat_key.ParID == cpu_to_be32(HFS_ROOT_CNID)) |
@@ -418,7 +418,7 @@ int hfs_write_inode(struct inode *inode, struct writeback_control *wbc) | |||
418 | hfs_cat_rec rec; | 418 | hfs_cat_rec rec; |
419 | int res; | 419 | int res; |
420 | 420 | ||
421 | dprint(DBG_INODE, "hfs_write_inode: %lu\n", inode->i_ino); | 421 | hfs_dbg(INODE, "hfs_write_inode: %lu\n", inode->i_ino); |
422 | res = hfs_ext_write_extent(inode); | 422 | res = hfs_ext_write_extent(inode); |
423 | if (res) | 423 | if (res) |
424 | return res; | 424 | return res; |