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

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

Completed in 493 milliseconds