Home
last modified time | relevance | path

Searched refs:nr_nodes (Results 1 – 3 of 3) sorted by relevance

/linux-4.19.296/lib/
Drbtree_test.c186 static void check_postorder_foreach(int nr_nodes) in check_postorder_foreach() argument
193 WARN_ON_ONCE(count != nr_nodes); in check_postorder_foreach()
196 static void check_postorder(int nr_nodes) in check_postorder() argument
203 WARN_ON_ONCE(count != nr_nodes); in check_postorder()
206 static void check(int nr_nodes) in check() argument
226 WARN_ON_ONCE(count != nr_nodes); in check()
229 check_postorder(nr_nodes); in check()
230 check_postorder_foreach(nr_nodes); in check()
233 static void check_augmented(int nr_nodes) in check_augmented() argument
237 check(nr_nodes); in check_augmented()
Dradix-tree.c562 int nr_nodes, subtree_height; in radix_tree_maybe_preload_order() local
586 nr_nodes = RADIX_TREE_MAX_PATH; in radix_tree_maybe_preload_order()
589 nr_nodes += RADIX_TREE_MAX_PATH - subtree_height; in radix_tree_maybe_preload_order()
592 nr_nodes--; in radix_tree_maybe_preload_order()
595 nr_nodes += nr_subtrees * height_to_maxnodes[subtree_height]; in radix_tree_maybe_preload_order()
597 return __radix_tree_preload(gfp_mask, nr_nodes); in radix_tree_maybe_preload_order()
/linux-4.19.296/fs/btrfs/
Drelocation.c108 int nr_nodes; member
231 ASSERT(!cache->nr_nodes); in backref_cache_cleanup()
245 cache->nr_nodes++; in alloc_backref_node()
254 cache->nr_nodes--; in free_backref_node()