Home
last modified time | relevance | path

Searched refs:free_nodes (Results 1 – 6 of 6) sorted by relevance

/fs/hfs/
Dbtree.c88 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()
178 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()
198 if (!tree->free_nodes) in hfs_bmap_new_bmap()
200 tree->free_nodes--; in hfs_bmap_new_bmap()
233 while (!tree->free_nodes) { in hfs_bmap_alloc()
248 tree->free_nodes = count - tree->node_count; in hfs_bmap_alloc()
275 tree->free_nodes--; in hfs_bmap_alloc()
367 tree->free_nodes++; in hfs_bmap_free()
Dbtree.h27 u32 free_nodes; member
147 __be32 free_nodes; /* (V) The number of unused nodes */ member
/fs/hfsplus/
Dbtree.c172 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()
301 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()
322 tree->free_nodes--; in hfs_bmap_new_bmap()
355 while (!tree->free_nodes) { in hfs_bmap_alloc()
371 tree->free_nodes = count - tree->node_count; in hfs_bmap_alloc()
398 tree->free_nodes--; in hfs_bmap_alloc()
495 tree->free_nodes++; in hfs_bmap_free()
Dxattr.c89 head->free_nodes = cpu_to_be32(be32_to_cpu(head->node_count) - 1); in hfsplus_init_header_node()
109 be32_add_cpu(&head->free_nodes, 0 - map_nodes); in hfsplus_init_header_node()
114 be32_to_cpu(head->node_count) - be32_to_cpu(head->free_nodes); in hfsplus_init_header_node()
Dhfsplus_raw.h175 __be32 free_nodes; member
Dhfsplus_fs.h84 u32 free_nodes; member