|
@@ -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);
|
|
|
}
|
|
|
|