Home
last modified time | relevance | path

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

/fs/hfs/
A Dbtree.c121 tree->node_count = be32_to_cpu(head->node_count); in hfs_btree_open()
131 if (!tree->node_count) in hfs_btree_open()
216 head->node_count = cpu_to_be32(tree->node_count); in hfs_btree_write()
279 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
280 tree->node_count = count; in hfs_bmap_reserve()
A Dbtree.h34 u32 node_count; member
155 __be32 node_count; /* (V) The total number of nodes */ member
A Dbnode.c328 if (cnid >= tree->node_count) { in hfs_bnode_findhash()
350 if (cnid >= tree->node_count) { in __hfs_bnode_create()
A Dinode.c118 } while (--i && nidx < tree->node_count); in hfs_release_folio()
/fs/hfsplus/
A Dbtree.c172 tree->node_count = be32_to_cpu(head->node_count); in hfs_btree_open()
234 if (!tree->node_count) in hfs_btree_open()
302 head->node_count = cpu_to_be32(tree->node_count); in hfs_btree_write()
368 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
369 tree->node_count = count; in hfs_bmap_reserve()
A Dxattr.c83 head->node_count = cpu_to_be32(tmp); in hfsplus_init_header_node()
84 head->free_nodes = cpu_to_be32(be32_to_cpu(head->node_count) - 1); in hfsplus_init_header_node()
94 if (be32_to_cpu(head->node_count) > hdr_node_map_rec_bits) { in hfsplus_init_header_node()
101 map_nodes = (be32_to_cpu(head->node_count) - in hfsplus_init_header_node()
109 be32_to_cpu(head->node_count) - be32_to_cpu(head->free_nodes); in hfsplus_init_header_node()
A Dhfsplus_raw.h175 __be32 node_count; member
A Dbnode.c478 if (cnid >= tree->node_count) { in hfs_bnode_findhash()
499 if (cnid >= tree->node_count) { in __hfs_bnode_create()
A Dhfsplus_fs.h84 u32 node_count; member
A Dinode.c117 } while (--i && nidx < tree->node_count); in hfsplus_release_folio()

Completed in 19 milliseconds