Home
last modified time | relevance | path

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

/linux/include/linux/
A Drcu_node_tree.h55 # define RCU_NUM_LVLS 1 macro
62 # define RCU_NUM_LVLS 2 macro
70 # define RCU_NUM_LVLS 3 macro
79 # define RCU_NUM_LVLS 4 macro
A Dsrcutree.h66 struct srcu_node *level[RCU_NUM_LVLS + 1];
/linux/kernel/rcu/
A Dtree.c111 int rcu_num_lvls __read_mostly = RCU_NUM_LVLS;
4471 static struct lock_class_key rcu_node_class[RCU_NUM_LVLS]; in rcu_init_one()
4472 static struct lock_class_key rcu_fqs_class[RCU_NUM_LVLS]; in rcu_init_one()
4474 int levelspread[RCU_NUM_LVLS]; /* kids/node in each level. */ in rcu_init_one()
4480 BUILD_BUG_ON(RCU_NUM_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */ in rcu_init_one()
4483 if (rcu_num_lvls <= 0 || rcu_num_lvls > RCU_NUM_LVLS) in rcu_init_one()
4556 int rcu_capacity[RCU_NUM_LVLS]; in rcu_init_geometry()
4610 for (i = 1; i < RCU_NUM_LVLS; i++) in rcu_init_geometry()
4617 if (nr_cpu_ids > rcu_capacity[RCU_NUM_LVLS - 1]) { in rcu_init_geometry()
A Dtree.h300 struct rcu_node *level[RCU_NUM_LVLS + 1];
A Drcu.h292 for (i = 0; i < RCU_NUM_LVLS; i++) in rcu_init_levelspread()
A Dtree_plugin.h60 if (RCU_NUM_LVLS >= 4) in rcu_bootup_announce_oddness()
A Dsrcutree.c88 int levelspread[RCU_NUM_LVLS]; in init_srcu_struct_nodes()
/linux/Documentation/RCU/Design/Data-Structures/
A DData-Structures.rst572 27 # define RCU_NUM_LVLS 1
580 35 # define RCU_NUM_LVLS 2
589 44 # define RCU_NUM_LVLS 3
599 54 # define RCU_NUM_LVLS 4

Completed in 24 milliseconds