Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/fs/hfs/
H A Dbtree.c89 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()
230 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()
241 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
285 tree->free_nodes--; in hfs_bmap_alloc()
378 tree->free_nodes in hfs_bmap_free()
[all...]
H A Dbtree.h35 u32 free_nodes; member
156 __be32 free_nodes; /* (V) The number of unused nodes */ member
/kernel/linux/linux-6.6/fs/hfs/
H A Dbtree.c90 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()
182 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()
202 if (!tree->free_nodes) in hfs_bmap_new_bmap()
204 tree->free_nodes--; in hfs_bmap_new_bmap()
233 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()
244 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
288 tree->free_nodes--; in hfs_bmap_alloc()
381 tree->free_nodes in hfs_bmap_free()
[all...]
H A Dbtree.h35 u32 free_nodes; member
156 __be32 free_nodes; /* (V) The number of unused nodes */ member
/kernel/linux/linux-5.10/fs/hfsplus/
H A Dbtree.c173 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 < rsvd_nodes) { in hfs_bmap_reserve()
367 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
411 tree->free_nodes--; in hfs_bmap_alloc()
509 tree->free_nodes++; in hfs_bmap_free()
H A Dxattr.c84 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()
H A Dhfsplus_raw.h176 __be32 free_nodes; member
H A Dhfsplus_fs.h84 u32 free_nodes; member
/kernel/linux/linux-6.6/fs/hfsplus/
H A Dbtree.c173 tree->free_nodes = be32_to_cpu(head->free_nodes); in hfs_btree_open()
303 head->free_nodes = cpu_to_be32(tree->free_nodes); in hfs_btree_write()
324 tree->free_nodes--; in hfs_bmap_new_bmap()
357 while (tree->free_nodes < rsvd_nodes) { in hfs_bmap_reserve()
368 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
412 tree->free_nodes--; in hfs_bmap_alloc()
510 tree->free_nodes++; in hfs_bmap_free()
H A Dxattr.c84 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()
H A Dhfsplus_raw.h176 __be32 free_nodes; member
H A Dhfsplus_fs.h84 u32 free_nodes; member
/kernel/linux/linux-5.10/samples/bpf/
H A Dtest_lru_dist.c96 struct pfect_lru_node *free_nodes; member
114 lru->free_nodes = malloc(lru_size * sizeof(struct pfect_lru_node)); in pfect_lru_init()
115 assert(lru->free_nodes); in pfect_lru_init()
126 free(lru->free_nodes); in pfect_lru_destroy()
145 node = &lru->free_nodes[lru->cur_size++]; in pfect_lru_lookup_or_insert()
/kernel/linux/linux-6.6/samples/bpf/
H A Dtest_lru_dist.c90 struct pfect_lru_node *free_nodes; member
108 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()

Completed in 12 milliseconds