free_nodes 89 fs/hfs/btree.c tree->free_nodes = be32_to_cpu(head->free_nodes); free_nodes 179 fs/hfs/btree.c head->free_nodes = cpu_to_be32(tree->free_nodes); free_nodes 199 fs/hfs/btree.c if (!tree->free_nodes) free_nodes 201 fs/hfs/btree.c tree->free_nodes--; free_nodes 230 fs/hfs/btree.c while (tree->free_nodes < rsvd_nodes) { free_nodes 241 fs/hfs/btree.c tree->free_nodes += count - tree->node_count; free_nodes 285 fs/hfs/btree.c tree->free_nodes--; free_nodes 378 fs/hfs/btree.c tree->free_nodes++; free_nodes 28 fs/hfs/btree.h u32 free_nodes; free_nodes 149 fs/hfs/btree.h __be32 free_nodes; /* (V) The number of unused nodes */ free_nodes 173 fs/hfsplus/btree.c tree->free_nodes = be32_to_cpu(head->free_nodes); free_nodes 302 fs/hfsplus/btree.c head->free_nodes = cpu_to_be32(tree->free_nodes); free_nodes 323 fs/hfsplus/btree.c tree->free_nodes--; free_nodes 356 fs/hfsplus/btree.c while (tree->free_nodes < rsvd_nodes) { free_nodes 367 fs/hfsplus/btree.c tree->free_nodes += count - tree->node_count; free_nodes 411 fs/hfsplus/btree.c tree->free_nodes--; free_nodes 509 fs/hfsplus/btree.c tree->free_nodes++; free_nodes 84 fs/hfsplus/hfsplus_fs.h u32 free_nodes; free_nodes 176 fs/hfsplus/hfsplus_raw.h __be32 free_nodes; free_nodes 84 fs/hfsplus/xattr.c head->free_nodes = cpu_to_be32(be32_to_cpu(head->node_count) - 1); free_nodes 104 fs/hfsplus/xattr.c be32_add_cpu(&head->free_nodes, 0 - map_nodes); free_nodes 109 fs/hfsplus/xattr.c be32_to_cpu(head->node_count) - be32_to_cpu(head->free_nodes); free_nodes 96 samples/bpf/test_lru_dist.c struct pfect_lru_node *free_nodes; free_nodes 114 samples/bpf/test_lru_dist.c lru->free_nodes = malloc(lru_size * sizeof(struct pfect_lru_node)); free_nodes 115 samples/bpf/test_lru_dist.c assert(lru->free_nodes); free_nodes 126 samples/bpf/test_lru_dist.c free(lru->free_nodes); free_nodes 145 samples/bpf/test_lru_dist.c node = &lru->free_nodes[lru->cur_size++];