Loading kernel/rcu/tree.c +1 −1 Original line number Diff line number Diff line Loading @@ -3582,7 +3582,7 @@ static void __init rcu_init_one(void) rnp->parent = NULL; } else { rnp->grpnum = j % levelspread[i - 1]; rnp->grpmask = 1UL << rnp->grpnum; rnp->grpmask = BIT(rnp->grpnum); rnp->parent = rcu_state.level[i - 1] + j / levelspread[i - 1]; } Loading kernel/rcu/tree.h +1 −1 Original line number Diff line number Diff line Loading @@ -168,7 +168,7 @@ struct rcu_node { * are indexed relative to this interval rather than the global CPU ID space. * This generates the bit for a CPU in node-local masks. */ #define leaf_node_cpu_bit(rnp, cpu) (1UL << ((cpu) - (rnp)->grplo)) #define leaf_node_cpu_bit(rnp, cpu) (BIT((cpu) - (rnp)->grplo)) /* * Union to allow "aggregate OR" operation on the need for a quiescent Loading Loading
kernel/rcu/tree.c +1 −1 Original line number Diff line number Diff line Loading @@ -3582,7 +3582,7 @@ static void __init rcu_init_one(void) rnp->parent = NULL; } else { rnp->grpnum = j % levelspread[i - 1]; rnp->grpmask = 1UL << rnp->grpnum; rnp->grpmask = BIT(rnp->grpnum); rnp->parent = rcu_state.level[i - 1] + j / levelspread[i - 1]; } Loading
kernel/rcu/tree.h +1 −1 Original line number Diff line number Diff line Loading @@ -168,7 +168,7 @@ struct rcu_node { * are indexed relative to this interval rather than the global CPU ID space. * This generates the bit for a CPU in node-local masks. */ #define leaf_node_cpu_bit(rnp, cpu) (1UL << ((cpu) - (rnp)->grplo)) #define leaf_node_cpu_bit(rnp, cpu) (BIT((cpu) - (rnp)->grplo)) /* * Union to allow "aggregate OR" operation on the need for a quiescent Loading