mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-11-24 18:41:00 +07:00
rcu: Make rcu_init_new_rnp() stop upon already-set bit
Currently, rcu_init_new_rnp() walks up the rcu_node combining tree, setting bits in the ->qsmaskinit fields on the way up. It walks up unconditionally, regardless of the initial state of these bits. This is OK because only the corresponding RCU grace-period kthread ever tests or sets these bits during runtime. However, it is also pointless, and it increases both memory and lock contention (albeit only slightly), so this commit stops the walk as soon as an already-set bit is encountered. Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
This commit is contained in:
parent
c50cbe535c
commit
8d672fa6bf
@ -3479,9 +3479,10 @@ EXPORT_SYMBOL_GPL(rcu_barrier_sched);
|
|||||||
static void rcu_init_new_rnp(struct rcu_node *rnp_leaf)
|
static void rcu_init_new_rnp(struct rcu_node *rnp_leaf)
|
||||||
{
|
{
|
||||||
long mask;
|
long mask;
|
||||||
|
long oldmask;
|
||||||
struct rcu_node *rnp = rnp_leaf;
|
struct rcu_node *rnp = rnp_leaf;
|
||||||
|
|
||||||
raw_lockdep_assert_held_rcu_node(rnp);
|
raw_lockdep_assert_held_rcu_node(rnp_leaf);
|
||||||
WARN_ON_ONCE(rnp->wait_blkd_tasks);
|
WARN_ON_ONCE(rnp->wait_blkd_tasks);
|
||||||
for (;;) {
|
for (;;) {
|
||||||
mask = rnp->grpmask;
|
mask = rnp->grpmask;
|
||||||
@ -3489,8 +3490,11 @@ static void rcu_init_new_rnp(struct rcu_node *rnp_leaf)
|
|||||||
if (rnp == NULL)
|
if (rnp == NULL)
|
||||||
return;
|
return;
|
||||||
raw_spin_lock_rcu_node(rnp); /* Interrupts already disabled. */
|
raw_spin_lock_rcu_node(rnp); /* Interrupts already disabled. */
|
||||||
|
oldmask = rnp->qsmaskinit;
|
||||||
rnp->qsmaskinit |= mask;
|
rnp->qsmaskinit |= mask;
|
||||||
raw_spin_unlock_rcu_node(rnp); /* Interrupts remain disabled. */
|
raw_spin_unlock_rcu_node(rnp); /* Interrupts remain disabled. */
|
||||||
|
if (oldmask)
|
||||||
|
return;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user