On 3/10/2024 3:43 PM, Paul E. McKenney wrote: > On Fri, Mar 08, 2024 at 05:44:38PM -0500, Joel Fernandes (Google) wrote: >> This a confusing piece of code (rightfully so as the issue it deals with >> is complex). Recent discussions brought up a question -- what prevents the >> rcu_implicit_dyntick_qs() from warning about QS reports for offline >> CPUs. >> >> QS reporting for now-offline CPUs should only happen from: >> - gp_init() >> - rcutree_cpu_report_dead() >> >> Add some comments to this code explaining how QS reporting is not >> missed when these functions are concurrently running. >> >> Signed-off-by: Joel Fernandes (Google) <joel@xxxxxxxxxxxxxxxxx> > > Thank you for putting this together! > > A couple of questions below. > > Thanx, Paul > >> --- >> kernel/rcu/tree.c | 36 +++++++++++++++++++++++++++++++++++- >> 1 file changed, 35 insertions(+), 1 deletion(-) >> >> diff --git a/kernel/rcu/tree.c b/kernel/rcu/tree.c >> index bd29fe3c76bf..f3582f843a05 100644 >> --- a/kernel/rcu/tree.c >> +++ b/kernel/rcu/tree.c >> @@ -1917,7 +1917,22 @@ static noinline_for_stack bool rcu_gp_init(void) > > Would it make sense to tag the earlier arch_spin_lock(&rcu_state.ofl_lock) > as preventing grace period from starting concurrently with > rcutree_report_cpu_dead()? Yes, that makes sense. > >> trace_rcu_grace_period_init(rcu_state.name, rnp->gp_seq, >> rnp->level, rnp->grplo, >> rnp->grphi, rnp->qsmask); >> - /* Quiescent states for tasks on any now-offline CPUs. */ >> + /* >> + * === Quiescent states for tasks on any now-offline CPUs. === >> + * >> + * QS reporting for now-offline CPUs should only be performed from >> + * either here, i.e., gp_init() or from rcutree_report_cpu_dead(). >> + * >> + * Note that, when reporting quiescent states for now-offline CPUs, >> + * the sequence of code doing those reports while also accessing >> + * ->qsmask and ->qsmaskinitnext, has to be an atomic sequence so >> + * that QS reporting is not missed! Otherwise it possible that >> + * rcu_implicit_dyntick_qs() screams. This is ensured by keeping >> + * the rnp->lock acquired throughout these QS-reporting >> + * sequences, which is also acquired in >> + * rcutree_report_cpu_dead(), so, acquiring ofl_lock is not >> + * necessary here to synchronize with that function. >> + */ > > Would it be better to put the long-form description in the "Hotplug > CPU" section of Documentation/RCU/Design/Requirements/Requirements.rst? Yes, totally. In fact I see the following already in Requirements.rst Hotplug section: During the checking/modification of RCU's hotplug bookkeeping, the corresponding CPU's leaf node lock is held. This avoids race conditions between RCU's hotplug notifier hooks, the grace period initialization code, and the FQS loop, all of which refer to or modify this bookkeeping. -- So I/we could just expand it there and refer to the .rst from the code. > I will be the first to admit that this section is not as detailed as it > needs to be. This section is already referenced by the block comment > preceding the WARN_ON_ONCE() in rcu_implicit_dyntick_qs(), which is > where people will look first if any of this gets messed up. Yes great point, and it is referenced in rcu_gp_init() as well. > > Then these other places can refer to that comment or to that section of > Requirements.rst, allowing them to focus on the corresponding piece of > the puzzle. Makes sense. >> mask = rnp->qsmask & ~rnp->qsmaskinitnext; >> rnp->rcu_gp_init_mask = mask; >> if ((mask || rnp->wait_blkd_tasks) && rcu_is_leaf_node(rnp)) >> @@ -5116,6 +5131,25 @@ void rcutree_report_cpu_dead(void) >> raw_spin_lock_irqsave_rcu_node(rnp, flags); /* Enforce GP memory-order guarantee. */ >> rdp->rcu_ofl_gp_seq = READ_ONCE(rcu_state.gp_seq); >> rdp->rcu_ofl_gp_state = READ_ONCE(rcu_state.gp_state); >> + >> + /* >> + * === Quiescent state reporting for now-offline CPUs === >> + * >> + * QS reporting for now-offline CPUs should only be performed from >> + * either here, i.e. rcutree_report_cpu_dead(), or gp_init(). >> + * >> + * Note that, when reporting quiescent states for now-offline CPUs, >> + * the sequence of code doing those reports while also accessing >> + * ->qsmask and ->qsmaskinitnext, has to be an atomic sequence so >> + * that QS reporting is not missed! Otherwise it possible that >> + * rcu_implicit_dyntick_qs() screams. This is ensured by keeping >> + * the rnp->lock acquired throughout these QS-reporting sequences, which >> + * is also acquired in gp_init(). >> + * One slight change to this rule is below, where we release and >> + * reacquire the lock after a QS report, but before we clear the >> + * ->qsmaskinitnext bit. That is OK to do, because gp_init() report a >> + * QS again, if it acquired the rnp->lock before we reacquired below. >> + */ > > And then this need only say what is happening right here, but possibly > moved to within the following "if" statement, at which point we know that > we are in a grace period that cannot end until we report the quiescent > state (which releases the rcu_node structure's ->lock) and a new grace > period cannot look at this rcu_node structure's ->qsmaskinitnext until > we release rcu_state.ofl_lock. Yes, it makes sense and we should mention the ofl_lock as well as you note. I have an trip starting in 2 weeks that goes on for 3 weeks shortly so I'm scrambling a bit for time, and may get to this only after. If Neeraj is interested in documenting this, he is more than welcome, especially since he also understands this code very well ;-). (See what I did there with the 'also' ? :P) thanks, - Joel
