History

rcu-tasks: Use workqueues for multiple rcu_tasks_invoke_cbs() invocations

If there is a flood of callbacks, it is necessary to put multiple CPUs to work invoking those callbacks. This commit therefore uses a workqueue-flooding approach to parallelize RCU Tasks callback execution.

Paul E. McKenney committed 5 years ago

Commit d363f831 parent 57881861 file · +52 −23Browse files

Showing the changes to kernel (1 of 1 file). Show all

Unified · Split

kernel/rcu/tasks.h+52−23
@@ -24,10 +24,14 @@ typedef void (*postgp_func_t)(struct rcu_tasks *rtp); · 23 unmodified lines
2424 * struct rcu_tasks_percpu - Per-CPU component of definition for a Tasks-RCU-like mechanism.
2525 * @cblist: Callback list.
2626 * @lock: Lock protecting per-CPU callback list.
27+ * @rtp_work: Work queue for invoking callbacks.
2728 */
2829 struct rcu_tasks_percpu {
2930 struct rcu_segcblist cblist;
3031 raw_spinlock_t __private lock;
32+ struct work_struct rtp_work;
33+ int cpu;
34+ struct rcu_tasks *rtpp;
3135 };
3236
3337 /**
@@ -146,6 +150,8 @@ static const char * const rcu_tasks_gp_state_names[] = { · 112 unmodified lines
146150 //
147151 // Generic code.
148152
153+static void rcu_tasks_invoke_cbs_wq(struct work_struct *wp);
154+
149155 /* Record grace-period phase and time. */
150156 static void set_tasks_gp_state(struct rcu_tasks *rtp, int newstate)
151157 {
@@ -185,6 +191,9 @@ static void cblist_init_generic(struct rcu_tasks *rtp) · 33 unmodified lines
185191 raw_spin_lock_rcu_node(rtpcp); // irqs already disabled.
186192 if (rcu_segcblist_empty(&rtpcp->cblist))
187193 rcu_segcblist_init(&rtpcp->cblist);
194+ INIT_WORK(&rtpcp->rtp_work, rcu_tasks_invoke_cbs_wq);
195+ rtpcp->cpu = cpu;
196+ rtpcp->rtpp = rtp;
188197 raw_spin_unlock_rcu_node(rtpcp); // irqs remain disabled.
189198 }
190199 raw_spin_unlock_irqrestore(&rtp->cbs_gbl_lock, flags);
@@ -256,35 +265,55 @@ static int rcu_tasks_need_gpcb(struct rcu_tasks *rtp) · 65 unmodified lines
256265 }
257266
258267 // Advance callbacks and invoke any that are ready.
259−static void rcu_tasks_invoke_cbs(struct rcu_tasks *rtp)
268+static void rcu_tasks_invoke_cbs(struct rcu_tasks *rtp, struct rcu_tasks_percpu *rtpcp)
260269 {
261270 int cpu;
271+ int cpunext;
262272 unsigned long flags;
263273 int len;
264− struct rcu_cblist rcl = RCU_CBLIST_INITIALIZER(rcl);
265274 struct rcu_head *rhp;
266−
267− for (cpu = 0; cpu < rtp->percpu_enqueue_lim; cpu++) {
268− struct rcu_tasks_percpu *rtpcp = per_cpu_ptr(rtp->rtpcpu, cpu);
269−
270− if (rcu_segcblist_empty(&rtpcp->cblist))
271− continue;
272− raw_spin_lock_irqsave_rcu_node(rtpcp, flags);
273− rcu_segcblist_advance(&rtpcp->cblist, rcu_seq_current(&rtp->tasks_gp_seq));
274− rcu_segcblist_extract_done_cbs(&rtpcp->cblist, &rcl);
275− raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags);
276− len = rcl.len;
277− for (rhp = rcu_cblist_dequeue(&rcl); rhp; rhp = rcu_cblist_dequeue(&rcl)) {
278− local_bh_disable();
279− rhp->func(rhp);
280− local_bh_enable();
281− cond_resched();
275+ struct rcu_cblist rcl = RCU_CBLIST_INITIALIZER(rcl);
276+ struct rcu_tasks_percpu *rtpcp_next;
277+
278+ cpu = rtpcp->cpu;
279+ cpunext = cpu * 2 + 1;
280+ if (cpunext < rtp->percpu_enqueue_lim) {
281+ rtpcp_next = per_cpu_ptr(rtp->rtpcpu, cpunext);
282+ queue_work_on(cpunext, system_wq, &rtpcp_next->rtp_work);
283+ cpunext++;
284+ if (cpunext < rtp->percpu_enqueue_lim) {
285+ rtpcp_next = per_cpu_ptr(rtp->rtpcpu, cpunext);
286+ queue_work_on(cpunext, system_wq, &rtpcp_next->rtp_work);
282287 }
283− raw_spin_lock_irqsave_rcu_node(rtpcp, flags);
284− rcu_segcblist_add_len(&rtpcp->cblist, -len);
285− (void)rcu_segcblist_accelerate(&rtpcp->cblist, rcu_seq_snap(&rtp->tasks_gp_seq));
286− raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags);
287288 }
289+
290+ if (rcu_segcblist_empty(&rtpcp->cblist))
291+ return;
292+ raw_spin_lock_irqsave_rcu_node(rtpcp, flags);
293+ rcu_segcblist_advance(&rtpcp->cblist, rcu_seq_current(&rtp->tasks_gp_seq));
294+ rcu_segcblist_extract_done_cbs(&rtpcp->cblist, &rcl);
295+ raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags);
296+ len = rcl.len;
297+ for (rhp = rcu_cblist_dequeue(&rcl); rhp; rhp = rcu_cblist_dequeue(&rcl)) {
298+ local_bh_disable();
299+ rhp->func(rhp);
300+ local_bh_enable();
301+ cond_resched();
302+ }
303+ raw_spin_lock_irqsave_rcu_node(rtpcp, flags);
304+ rcu_segcblist_add_len(&rtpcp->cblist, -len);
305+ (void)rcu_segcblist_accelerate(&rtpcp->cblist, rcu_seq_snap(&rtp->tasks_gp_seq));
306+ raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags);
307+}
308+
309+// Workqueue flood to advance callbacks and invoke any that are ready.
310+static void rcu_tasks_invoke_cbs_wq(struct work_struct *wp)
311+{
312+ struct rcu_tasks *rtp;
313+ struct rcu_tasks_percpu *rtpcp = container_of(wp, struct rcu_tasks_percpu, rtp_work);
314+
315+ rtp = rtpcp->rtpp;
316+ rcu_tasks_invoke_cbs(rtp, rtpcp);
288317 }
289318
290319 /* RCU-tasks kthread that detects grace periods and invokes callbacks. */
@@ -320,7 +349,7 @@ static int __noreturn rcu_tasks_kthread(void *arg) · 29 unmodified lines
320349
321350 /* Invoke callbacks. */
322351 set_tasks_gp_state(rtp, RTGS_INVOKE_CBS);
323− rcu_tasks_invoke_cbs(rtp);
352+ rcu_tasks_invoke_cbs(rtp, per_cpu_ptr(rtp->rtpcpu, 0));
324353
325354 /* Paranoid sleep to keep this from entering a tight loop */
326355 schedule_timeout_idle(rtp->gp_sleep);