Searched refs:free_nodes (Results 1 – 7 of 7) sorted by relevance
89 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()179 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()199 if (!tree->free_nodes) in hfs_bmap_new_bmap()201 tree->free_nodes--; in hfs_bmap_new_bmap()234 while (!tree->free_nodes) { in hfs_bmap_alloc()249 tree->free_nodes = count - tree->node_count; in hfs_bmap_alloc()276 tree->free_nodes--; in hfs_bmap_alloc()368 tree->free_nodes++; in hfs_bmap_free()
28 u32 free_nodes; member148 __be32 free_nodes; /* (V) The number of unused nodes */ member
173 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()302 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()323 tree->free_nodes--; in hfs_bmap_new_bmap()356 while (!tree->free_nodes) { in hfs_bmap_alloc()372 tree->free_nodes = count - tree->node_count; in hfs_bmap_alloc()399 tree->free_nodes--; in hfs_bmap_alloc()496 tree->free_nodes++; in hfs_bmap_free()
84 head->free_nodes = cpu_to_be32(be32_to_cpu(head->node_count) - 1); in hfsplus_init_header_node()104 be32_add_cpu(&head->free_nodes, 0 - map_nodes); in hfsplus_init_header_node()109 be32_to_cpu(head->node_count) - be32_to_cpu(head->free_nodes); in hfsplus_init_header_node()
176 __be32 free_nodes; member
84 u32 free_nodes; member
99 struct pfect_lru_node *free_nodes; member117 lru->free_nodes = malloc(lru_size * sizeof(struct pfect_lru_node)); in pfect_lru_init()118 assert(lru->free_nodes); in pfect_lru_init()129 free(lru->free_nodes); in pfect_lru_destroy()148 node = &lru->free_nodes[lru->cur_size++]; in pfect_lru_lookup_or_insert()
