Home
last modified time | relevance | path

Searched refs:subtrees (Results 1 – 5 of 5) sorted by relevance

/linux/drivers/md/dm-pcache/
H A Dcache_key.c654 cache_subtree = &cache->req_key_tree.subtrees[i]; in clean_fn()
840 cache_tree->subtrees = kvzalloc_objs(struct pcache_cache_subtree, in cache_tree_init()
842 if (!cache_tree->subtrees) { in cache_tree_init()
848 struct pcache_cache_subtree *cache_subtree = &cache_tree->subtrees[i]; in cache_tree_init()
870 cache_subtree = &cache_tree->subtrees[i]; in cache_tree_clear()
887 kvfree(cache_tree->subtrees); in cache_tree_exit()
H A Dcache.h105 struct pcache_cache_subtree *subtrees; member
358 return &cache_tree->subtrees[0]; in get_subtree()
360 return &cache_tree->subtrees[off >> PCACHE_CACHE_SUBTREE_SIZE_SHIFT]; in get_subtree()
/linux/Documentation/filesystems/
H A Ddirectory-locking.rst76 is a bunch of subtrees visible in dcache and locking happens on those.
80 several scenarios, starting from "somebody mounted two nested subtrees
/linux/lib/
H A Dmaple_tree.c904 * mas_mat_destroy() - Free all nodes and subtrees in a dead list.
1799 * the dead subtrees and topiary the nodes that are no longer of use.
1807 * [index, last] are dead subtrees, others need to be freed and followed.
1818 MA_TOPIARY(subtrees, mas->tree); in mas_topiary_replace()
1877 mat_add(&subtrees, tmp_next[n].node); in mas_topiary_replace()
1900 mas_mat_destroy(mas, &subtrees); in mas_topiary_replace()
/linux/Documentation/admin-guide/
H A Dcgroup-v2.rst204 and not any subtrees. This is legacy behaviour, the default
212 entire subtrees, without requiring explicit downward
214 subtrees from one another, while retaining free competition
215 within those subtrees. This should have been the default
3445 effective low, which makes delegation of subtrees possible. It also