Home
last modified time | relevance | path

Searched refs:cache_node (Results 1 – 8 of 8) sorted by relevance

/openbmc/u-boot/fs/cbfs/
H A Dcbfs.c126 struct cbfs_cachenode *cache_node; in file_cbfs_fill_cache() local
131 cache_node = file_cache; in file_cbfs_fill_cache()
132 while (cache_node) { in file_cbfs_fill_cache()
133 struct cbfs_cachenode *oldNode = cache_node; in file_cbfs_fill_cache()
134 cache_node = cache_node->next; in file_cbfs_fill_cache()
235 struct cbfs_cachenode *cache_node = file_cache; in file_cbfs_find() local
242 while (cache_node) { in file_cbfs_find()
243 if (!strcmp(name, cache_node->name)) in file_cbfs_find()
245 cache_node = cache_node->next; in file_cbfs_find()
247 if (!cache_node) in file_cbfs_find()
[all …]
/openbmc/linux/scripts/gdb/linux/
H A Dslab.py199 cache_node = target_cache['node'][i]
200 if cache_node['nr_slabs']['counter'] == 0:
202 process_slab(loc_track, cache_node['partial'], alloc, target_cache)
203 process_slab(loc_track, cache_node['full'], alloc, target_cache)
304 cache_node = cache['node'][i]
306 nr_slabs += cache_node['nr_slabs']['counter']
307 nr_objs = int(cache_node['total_objects']['counter'])
308 nr_free = count_free(cache_node['partial'])
/openbmc/linux/drivers/of/
H A Dbase.c1895 struct device_node *child, *cache_node; in of_find_next_cache_node() local
1897 cache_node = of_parse_phandle(np, "l2-cache", 0); in of_find_next_cache_node()
1898 if (!cache_node) in of_find_next_cache_node()
1899 cache_node = of_parse_phandle(np, "next-level-cache", 0); in of_find_next_cache_node()
1901 if (cache_node) in of_find_next_cache_node()
1902 return cache_node; in of_find_next_cache_node()
/openbmc/linux/fs/btrfs/
H A Dblock-group.c194 cache = rb_entry(parent, struct btrfs_block_group, cache_node); in btrfs_add_block_group_cache()
206 rb_link_node(&block_group->cache_node, parent, p); in btrfs_add_block_group_cache()
207 rb_insert_color_cached(&block_group->cache_node, in btrfs_add_block_group_cache()
230 cache = rb_entry(n, struct btrfs_block_group, cache_node); in block_group_cache_tree_search()
283 if (RB_EMPTY_NODE(&cache->cache_node)) { in btrfs_next_block_group()
290 node = rb_next(&cache->cache_node); in btrfs_next_block_group()
293 cache = rb_entry(node, struct btrfs_block_group, cache_node); in btrfs_next_block_group()
1141 rb_erase_cached(&block_group->cache_node, in btrfs_remove_block_group()
1143 RB_CLEAR_NODE(&block_group->cache_node); in btrfs_remove_block_group()
4416 cache_node); in btrfs_free_block_groups()
[all …]
H A Dblock-group.h159 struct rb_node cache_node; member
H A Dfree-space-tree.c1190 cache_node); in btrfs_create_free_space_tree()
1337 cache_node); in btrfs_rebuild_free_space_tree()
H A Dfree-space-cache.c4114 block_group = rb_entry(node, struct btrfs_block_group, cache_node); in cleanup_free_space_cache_v1()
H A Dextent-tree.c2544 bg = rb_entry(leftmost, struct btrfs_block_group, cache_node); in first_logical_byte()