diff options
author | Anton Salikhmetov <alexo@tuxera.com> | 2010-12-16 18:08:39 +0200 |
---|---|---|
committer | Christoph Hellwig <hch@tuxera.com> | 2010-12-16 18:08:46 +0100 |
commit | 21f2296a598c4089e0a9bdf54634269ac913a693 (patch) | |
tree | f55214d1b9b0627f1a9f7951a57183e76458d079 /fs/hfsplus/bnode.c | |
parent | 2753cc281c9a0e8a0a45ee2b8110866a9fe63bdd (diff) |
hfsplus: C99 comments clean-up
Match coding style restriction against C99 comments where
checkpatch.pl reported errors about their usage.
Signed-off-by: Anton Salikhmetov <alexo@tuxera.com>
Signed-off-by: Christoph Hellwig <hch@tuxera.com>
Diffstat (limited to 'fs/hfsplus/bnode.c')
-rw-r--r-- | fs/hfsplus/bnode.c | 18 |
1 files changed, 10 insertions, 8 deletions
diff --git a/fs/hfsplus/bnode.c b/fs/hfsplus/bnode.c index cf7dc8dac76..c8f4ea4bb5e 100644 --- a/fs/hfsplus/bnode.c +++ b/fs/hfsplus/bnode.c @@ -42,7 +42,7 @@ void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) { __be16 data; - // optimize later... + /* TODO: optimize later... */ hfs_bnode_read(node, &data, off, 2); return be16_to_cpu(data); } @@ -50,7 +50,7 @@ u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) { u8 data; - // optimize later... + /* TODO: optimize later... */ hfs_bnode_read(node, &data, off, 1); return data; } @@ -96,7 +96,7 @@ void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len) void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data) { __be16 v = cpu_to_be16(data); - // optimize later... + /* TODO: optimize later... */ hfs_bnode_write(node, &v, off, 2); } @@ -362,7 +362,7 @@ void hfs_bnode_unlink(struct hfs_bnode *node) } else if (node->type == HFS_NODE_LEAF) tree->leaf_tail = node->prev; - // move down? + /* move down? */ if (!node->prev && !node->next) { dprint(DBG_BNODE_MOD, "hfs_btree_del_level\n"); } @@ -569,11 +569,13 @@ node_error: void hfs_bnode_free(struct hfs_bnode *node) { - //int i; +#if 0 + int i; - //for (i = 0; i < node->tree->pages_per_bnode; i++) - // if (node->page[i]) - // page_cache_release(node->page[i]); + for (i = 0; i < node->tree->pages_per_bnode; i++) + if (node->page[i]) + page_cache_release(node->page[i]); +#endif kfree(node); } |