Searched refs:free_nodes (Results 1 – 5 of 5) sorted by relevance
89 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()364 tree->free_nodes++; in hfs_bmap_free()
27 u32 free_nodes; member147 __be32 free_nodes; /* (V) The number of unused nodes */ member
61 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()182 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()202 tree->free_nodes--; in hfs_bmap_new_bmap()235 while (!tree->free_nodes) { in hfs_bmap_alloc()251 tree->free_nodes = count - tree->node_count; in hfs_bmap_alloc()278 tree->free_nodes--; in hfs_bmap_alloc()375 tree->free_nodes++; in hfs_bmap_free()
164 __be32 free_nodes; member
61 u32 free_nodes; member