Home
last modified time | relevance | path

Searched refs:node_count (Results 1 – 10 of 10) sorted by relevance

/fs/hfs/
Dbtree.c88 tree->node_count = be32_to_cpu(head->node_count); in hfs_btree_open()
98 if (!tree->node_count) in hfs_btree_open()
178 head->node_count = cpu_to_be32(tree->node_count); in hfs_btree_write()
241 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
242 tree->node_count = count; in hfs_bmap_reserve()
Dbtree.h27 u32 node_count; member
148 __be32 node_count; /* (V) The total number of nodes */ member
Dbnode.c224 if (cnid >= tree->node_count) { in hfs_bnode_findhash()
247 if (cnid >= tree->node_count) { in __hfs_bnode_create()
Dinode.c123 } while (--i && nidx < tree->node_count); in hfs_releasepage()
/fs/hfsplus/
Dbtree.c172 tree->node_count = be32_to_cpu(head->node_count); in hfs_btree_open()
234 if (!tree->node_count) in hfs_btree_open()
301 head->node_count = cpu_to_be32(tree->node_count); in hfs_btree_write()
367 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
368 tree->node_count = count; in hfs_bmap_reserve()
Dxattr.c89 head->node_count = cpu_to_be32(tmp); in hfsplus_init_header_node()
90 head->free_nodes = cpu_to_be32(be32_to_cpu(head->node_count) - 1); in hfsplus_init_header_node()
100 if (be32_to_cpu(head->node_count) > hdr_node_map_rec_bits) { in hfsplus_init_header_node()
107 map_nodes = (be32_to_cpu(head->node_count) - in hfsplus_init_header_node()
115 be32_to_cpu(head->node_count) - be32_to_cpu(head->free_nodes); in hfsplus_init_header_node()
Dhfsplus_raw.h175 __be32 node_count; member
Dbnode.c389 if (cnid >= tree->node_count) { in hfs_bnode_findhash()
411 if (cnid >= tree->node_count) { in __hfs_bnode_create()
Dhfsplus_fs.h84 u32 node_count; member
Dinode.c121 } while (--i && nidx < tree->node_count); in hfsplus_releasepage()