lkml.org 
[lkml]   [2020]   [Mar]   [20]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH RFC v2 tip/core/rcu 04/22] rcu-tasks: Move Tasks RCU to its own file
On Fri, Mar 20, 2020 at 03:12:28PM +0800, Hillf Danton wrote:
>
> On Wed, 18 Mar 2020 17:10:42 -0700 "Paul E. McKenney" wrote:
> >
> > +/* RCU-tasks kthread that detects grace periods and invokes callbacks. */
> > +static int __noreturn rcu_tasks_kthread(void *arg)
> > +{
> > + unsigned long flags;
> > + struct task_struct *g, *t;
> > + unsigned long lastreport;
> > + struct rcu_head *list;
> > + struct rcu_head *next;
> > + LIST_HEAD(rcu_tasks_holdouts);
> > + int fract;
> > +
> > + /* Run on housekeeping CPUs by default. Sysadm can move if desired. */
> > + housekeeping_affine(current, HK_FLAG_RCU);
> > +
> > + /*
> > + * Each pass through the following loop makes one check for
> > + * newly arrived callbacks, and, if there are some, waits for
> > + * one RCU-tasks grace period and then invokes the callbacks.
> > + * This loop is terminated by the system going down. ;-)
> > + */
> > + for (;;) {
> > +
> > + /* Pick up any new callbacks. */
> > + raw_spin_lock_irqsave(&rcu_tasks_cbs_lock, flags);
> > + list = rcu_tasks_cbs_head;
> > + rcu_tasks_cbs_head = NULL;
> > + rcu_tasks_cbs_tail = &rcu_tasks_cbs_head;
> > + raw_spin_unlock_irqrestore(&rcu_tasks_cbs_lock, flags);
> > +
> > + /* If there were none, wait a bit and start over. */
> > + if (!list) {
> > + wait_event_interruptible(rcu_tasks_cbs_wq,
> > + READ_ONCE(rcu_tasks_cbs_head));
> > + if (!rcu_tasks_cbs_head) {
> > + WARN_ON(signal_pending(current));
> > + schedule_timeout_interruptible(HZ/10);
> > + }
> > + continue;
> > + }
> > +
> > + /*
> > + * Wait for all pre-existing t->on_rq and t->nvcsw
> > + * transitions to complete. Invoking synchronize_rcu()
> > + * suffices because all these transitions occur with
> > + * interrupts disabled. Without this synchronize_rcu(),
> > + * a read-side critical section that started before the
> > + * grace period might be incorrectly seen as having started
> > + * after the grace period.
> > + *
> > + * This synchronize_rcu() also dispenses with the
> > + * need for a memory barrier on the first store to
> > + * ->rcu_tasks_holdout, as it forces the store to happen
> > + * after the beginning of the grace period.
> > + */
> > + synchronize_rcu();
> > +
> > + /*
> > + * There were callbacks, so we need to wait for an
> > + * RCU-tasks grace period. Start off by scanning
> > + * the task list for tasks that are not already
> > + * voluntarily blocked. Mark these tasks and make
> > + * a list of them in rcu_tasks_holdouts.
> > + */
> > + rcu_read_lock();
> > + for_each_process_thread(g, t) {
> > + if (t != current && READ_ONCE(t->on_rq) &&
> > + !is_idle_task(t)) {
> > + get_task_struct(t);
> > + t->rcu_tasks_nvcsw = READ_ONCE(t->nvcsw);
> > + WRITE_ONCE(t->rcu_tasks_holdout, true);
> > + list_add(&t->rcu_tasks_holdout_list,
> > + &rcu_tasks_holdouts);
> > + }
> > + }
>
> Nit: report stall if it would take a jiffy longer than
> rcu_task_stall_timeout to collect the tasks?

Fair point!

That said, the wait time below is in hundreds of milliseconds and the
stall time defaults to ten minutes, so it is not clear that such a check
out constitute non-dead code.

Thanx, Paul

> > + rcu_read_unlock();
> > +
> > + /*
> > + * Wait for tasks that are in the process of exiting.
> > + * This does only part of the job, ensuring that all
> > + * tasks that were previously exiting reach the point
> > + * where they have disabled preemption, allowing the
> > + * later synchronize_rcu() to finish the job.
> > + */
> > + synchronize_srcu(&tasks_rcu_exit_srcu);
> > +
> > + /*
> > + * Each pass through the following loop scans the list
> > + * of holdout tasks, removing any that are no longer
> > + * holdouts. When the list is empty, we are done.
> > + */
> > + lastreport = jiffies;
> > +
> > + /* Start off with HZ/10 wait and slowly back off to 1 HZ wait*/
> > + fract = 10;
> > +
> > + for (;;) {
> > + bool firstreport;
> > + bool needreport;
> > + int rtst;
> > + struct task_struct *t1;
> > +
> > + if (list_empty(&rcu_tasks_holdouts))
> > + break;
> > +
> > + /* Slowly back off waiting for holdouts */
> > + schedule_timeout_interruptible(HZ/fract);
> > +
> > + if (fract > 1)
> > + fract--;
> > +
> > + rtst = READ_ONCE(rcu_task_stall_timeout);
> > + needreport = rtst > 0 &&
> > + time_after(jiffies, lastreport + rtst);
> > + if (needreport)
> > + lastreport = jiffies;
> > + firstreport = true;
> > + WARN_ON(signal_pending(current));
> > + list_for_each_entry_safe(t, t1, &rcu_tasks_holdouts,
> > + rcu_tasks_holdout_list) {
> > + check_holdout_task(t, needreport, &firstreport);
> > + cond_resched();
> > + }
> > + }
> > +
> > + /*
> > + * Because ->on_rq and ->nvcsw are not guaranteed
> > + * to have a full memory barriers prior to them in the
> > + * schedule() path, memory reordering on other CPUs could
> > + * cause their RCU-tasks read-side critical sections to
> > + * extend past the end of the grace period. However,
> > + * because these ->nvcsw updates are carried out with
> > + * interrupts disabled, we can use synchronize_rcu()
> > + * to force the needed ordering on all such CPUs.
> > + *
> > + * This synchronize_rcu() also confines all
> > + * ->rcu_tasks_holdout accesses to be within the grace
> > + * period, avoiding the need for memory barriers for
> > + * ->rcu_tasks_holdout accesses.
> > + *
> > + * In addition, this synchronize_rcu() waits for exiting
> > + * tasks to complete their final preempt_disable() region
> > + * of execution, cleaning up after the synchronize_srcu()
> > + * above.
> > + */
> > + synchronize_rcu();
> > +
> > + /* Invoke the callbacks. */
> > + while (list) {
> > + next = list->next;
> > + local_bh_disable();
> > + list->func(list);
> > + local_bh_enable();
> > + list = next;
> > + cond_resched();
> > + }
> > + /* Paranoid sleep to keep this from entering a tight loop */
> > + schedule_timeout_uninterruptible(HZ/10);
> > + }
> > +}
>

\
 
 \ /
  Last update: 2020-03-20 20:15    [W:0.595 / U:1.168 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site