Searched refs:node_count (Results 1 – 11 of 11) sorted by relevance
53 tree->node_count = be32_to_cpu(head->node_count); in hfs_btree_open()79 if (!tree->node_count) in hfs_btree_open()139 head->node_count = cpu_to_be32(tree->node_count); in hfs_btree_write()208 tree->free_nodes = count - tree->node_count; in hfs_bmap_alloc()209 tree->node_count = count; in hfs_bmap_alloc()
162 __be32 node_count; member
381 if (cnid >= tree->node_count) { in hfs_bnode_findhash()404 if (cnid >= tree->node_count) { in __hfs_bnode_create()
55 u32 node_count; member
97 } while (--i && nidx < tree->node_count); in hfsplus_releasepage()
72 tree->node_count = be32_to_cpu(head->node_count); in hfs_btree_open()82 if (!tree->node_count) in hfs_btree_open()161 head->node_count = cpu_to_be32(tree->node_count); in hfs_btree_write()232 tree->free_nodes = count - tree->node_count; in hfs_bmap_alloc()233 tree->node_count = count; in hfs_bmap_alloc()
26 u32 node_count; member146 __be32 node_count; /* (V) The total number of nodes */ member
221 if (cnid >= tree->node_count) { in hfs_bnode_findhash()244 if (cnid >= tree->node_count) { in __hfs_bnode_create()
100 } while (--i && nidx < tree->node_count); in hfs_releasepage()
199 for (i = 0; i < rv->node_count; i++) { in dlm_recover_members()232 for (i = 0; i < rv->node_count; i++) { in dlm_recover_members()358 rv->node_count = ids_count; in dlm_ls_start()368 (unsigned long long)rv_old->seq, rv_old->node_count); in dlm_ls_start()
134 int node_count; member