Searched refs:free_nodes (Results 1 – 2 of 2) sorted by relevance
122 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()217 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()237 if (!tree->free_nodes) in hfs_bmap_new_bmap()239 tree->free_nodes--; in hfs_bmap_new_bmap()268 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()279 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()323 tree->free_nodes--; in hfs_bmap_alloc()416 tree->free_nodes++; in hfs_bmap_free()
90 struct pfect_lru_node *free_nodes; member108 lru->free_nodes = malloc(lru_size * sizeof(struct pfect_lru_node)); in pfect_lru_init()109 assert(lru->free_nodes); in pfect_lru_init()120 free(lru->free_nodes); in pfect_lru_destroy()139 node = &lru->free_nodes[lru->cur_size++]; in pfect_lru_lookup_or_insert()