rcu_num_lvls 288 kernel/rcu/rcu.h extern int rcu_num_lvls; rcu_num_lvls 303 kernel/rcu/rcu.h levelspread[rcu_num_lvls - 1] = rcu_fanout_leaf; rcu_num_lvls 304 kernel/rcu/rcu.h for (i = rcu_num_lvls - 2; i >= 0; i--) rcu_num_lvls 311 kernel/rcu/rcu.h for (i = rcu_num_lvls - 1; i >= 0; i--) { rcu_num_lvls 320 kernel/rcu/rcu.h #define rcu_first_leaf_node() (rcu_state.level[rcu_num_lvls - 1]) rcu_num_lvls 323 kernel/rcu/rcu.h #define rcu_is_leaf_node(rnp) ((rnp)->level == rcu_num_lvls - 1) rcu_num_lvls 95 kernel/rcu/srcutree.c for (i = 1; i < rcu_num_lvls; i++) rcu_num_lvls 131 kernel/rcu/srcutree.c level = rcu_num_lvls - 1; rcu_num_lvls 547 kernel/rcu/srcutree.c last_lvl = snp >= ssp->level[rcu_num_lvls - 1]; rcu_num_lvls 111 kernel/rcu/tree.c int rcu_num_lvls __read_mostly = RCU_NUM_LVLS; rcu_num_lvls 3354 kernel/rcu/tree.c if (rcu_num_lvls <= 0 || rcu_num_lvls > RCU_NUM_LVLS) rcu_num_lvls 3359 kernel/rcu/tree.c for (i = 1; i < rcu_num_lvls; i++) rcu_num_lvls 3366 kernel/rcu/tree.c for (i = rcu_num_lvls - 1; i >= 0; i--) { rcu_num_lvls 3483 kernel/rcu/tree.c rcu_num_lvls = i + 1; rcu_num_lvls 3486 kernel/rcu/tree.c for (i = 0; i < rcu_num_lvls; i++) { rcu_num_lvls 3487 kernel/rcu/tree.c int cap = rcu_capacity[(rcu_num_lvls - 1) - i]; rcu_num_lvls 3493 kernel/rcu/tree.c for (i = 0; i < rcu_num_lvls; i++)