Commit | Line | Data |
---|---|---|
eacd6f04 PM |
1 | /* SPDX-License-Identifier: GPL-2.0+ */ |
2 | /* | |
3 | * Task-based RCU implementations. | |
4 | * | |
5 | * Copyright (C) 2020 Paul E. McKenney | |
6 | */ | |
7 | ||
8fd8ca38 | 8 | #ifdef CONFIG_TASKS_RCU_GENERIC |
9b073de1 | 9 | #include "rcu_segcblist.h" |
5873b8a9 PM |
10 | |
11 | //////////////////////////////////////////////////////////////////////// | |
12 | // | |
13 | // Generic data structures. | |
14 | ||
15 | struct rcu_tasks; | |
16 | typedef void (*rcu_tasks_gp_func_t)(struct rcu_tasks *rtp); | |
7460ade1 | 17 | typedef void (*pregp_func_t)(struct list_head *hop); |
e4fe5dd6 | 18 | typedef void (*pertask_func_t)(struct task_struct *t, struct list_head *hop); |
9796e1ae | 19 | typedef void (*postscan_func_t)(struct list_head *hop); |
e4fe5dd6 | 20 | typedef void (*holdouts_func_t)(struct list_head *hop, bool ndrpt, bool *frptp); |
af051ca4 | 21 | typedef void (*postgp_func_t)(struct rcu_tasks *rtp); |
eacd6f04 | 22 | |
07e10515 | 23 | /** |
cafafd67 | 24 | * struct rcu_tasks_percpu - Per-CPU component of definition for a Tasks-RCU-like mechanism. |
9b073de1 | 25 | * @cblist: Callback list. |
381a4f3b | 26 | * @lock: Lock protecting per-CPU callback list. |
7d13d30b PM |
27 | * @rtp_jiffies: Jiffies counter value for statistics. |
28 | * @rtp_n_lock_retries: Rough lock-contention statistic. | |
d363f833 | 29 | * @rtp_work: Work queue for invoking callbacks. |
3063b33a | 30 | * @rtp_irq_work: IRQ work queue for deferred wakeups. |
ce9b1c66 | 31 | * @barrier_q_head: RCU callback for barrier operation. |
434c9eef | 32 | * @rtp_blkd_tasks: List of tasks blocked as readers. |
ce9b1c66 PM |
33 | * @cpu: CPU number corresponding to this entry. |
34 | * @rtpp: Pointer to the rcu_tasks structure. | |
cafafd67 PM |
35 | */ |
36 | struct rcu_tasks_percpu { | |
9b073de1 | 37 | struct rcu_segcblist cblist; |
381a4f3b | 38 | raw_spinlock_t __private lock; |
7d13d30b PM |
39 | unsigned long rtp_jiffies; |
40 | unsigned long rtp_n_lock_retries; | |
d363f833 | 41 | struct work_struct rtp_work; |
3063b33a | 42 | struct irq_work rtp_irq_work; |
ce9b1c66 | 43 | struct rcu_head barrier_q_head; |
434c9eef | 44 | struct list_head rtp_blkd_tasks; |
d363f833 PM |
45 | int cpu; |
46 | struct rcu_tasks *rtpp; | |
cafafd67 PM |
47 | }; |
48 | ||
49 | /** | |
50 | * struct rcu_tasks - Definition for a Tasks-RCU-like mechanism. | |
88db792b | 51 | * @cbs_wait: RCU wait allowing a new callback to get kthread's attention. |
cafafd67 | 52 | * @cbs_gbl_lock: Lock protecting callback list. |
d96225fd | 53 | * @tasks_gp_mutex: Mutex protecting grace period, needed during mid-boot dead zone. |
07e10515 | 54 | * @kthread_ptr: This flavor's grace-period/callback-invocation kthread. |
5873b8a9 | 55 | * @gp_func: This flavor's grace-period-wait function. |
af051ca4 | 56 | * @gp_state: Grace period's most recent state transition (debugging). |
4fe192df | 57 | * @gp_sleep: Per-grace-period sleep to prevent CPU-bound looping. |
2393a613 | 58 | * @init_fract: Initial backoff sleep interval. |
af051ca4 PM |
59 | * @gp_jiffies: Time of last @gp_state transition. |
60 | * @gp_start: Most recent grace-period start in jiffies. | |
b14fb4fb | 61 | * @tasks_gp_seq: Number of grace periods completed since boot. |
238dbce3 | 62 | * @n_ipis: Number of IPIs sent to encourage grace periods to end. |
7e0669c3 | 63 | * @n_ipis_fails: Number of IPI-send failures. |
e4fe5dd6 PM |
64 | * @pregp_func: This flavor's pre-grace-period function (optional). |
65 | * @pertask_func: This flavor's per-task scan function (optional). | |
66 | * @postscan_func: This flavor's post-task scan function (optional). | |
85b86994 | 67 | * @holdouts_func: This flavor's holdout-list scan function (optional). |
e4fe5dd6 | 68 | * @postgp_func: This flavor's post-grace-period function (optional). |
5873b8a9 | 69 | * @call_func: This flavor's call_rcu()-equivalent function. |
cafafd67 | 70 | * @rtpcpu: This flavor's rcu_tasks_percpu structure. |
7a30871b | 71 | * @percpu_enqueue_shift: Shift down CPU ID this much when enqueuing callbacks. |
2cee0789 PM |
72 | * @percpu_enqueue_lim: Number of per-CPU callback queues in use for enqueuing. |
73 | * @percpu_dequeue_lim: Number of per-CPU callback queues in use for dequeuing. | |
fd796e41 | 74 | * @percpu_dequeue_gpseq: RCU grace-period number to propagate enqueue limit to dequeuers. |
ce9b1c66 PM |
75 | * @barrier_q_mutex: Serialize barrier operations. |
76 | * @barrier_q_count: Number of queues being waited on. | |
77 | * @barrier_q_completion: Barrier wait/wakeup mechanism. | |
78 | * @barrier_q_seq: Sequence number for barrier operations. | |
c97d12a6 PM |
79 | * @name: This flavor's textual name. |
80 | * @kname: This flavor's kthread name. | |
07e10515 PM |
81 | */ |
82 | struct rcu_tasks { | |
88db792b | 83 | struct rcuwait cbs_wait; |
cafafd67 | 84 | raw_spinlock_t cbs_gbl_lock; |
d96225fd | 85 | struct mutex tasks_gp_mutex; |
af051ca4 | 86 | int gp_state; |
4fe192df | 87 | int gp_sleep; |
2393a613 | 88 | int init_fract; |
af051ca4 | 89 | unsigned long gp_jiffies; |
88092d0c | 90 | unsigned long gp_start; |
b14fb4fb | 91 | unsigned long tasks_gp_seq; |
238dbce3 | 92 | unsigned long n_ipis; |
7e0669c3 | 93 | unsigned long n_ipis_fails; |
07e10515 | 94 | struct task_struct *kthread_ptr; |
5873b8a9 | 95 | rcu_tasks_gp_func_t gp_func; |
e4fe5dd6 PM |
96 | pregp_func_t pregp_func; |
97 | pertask_func_t pertask_func; | |
98 | postscan_func_t postscan_func; | |
99 | holdouts_func_t holdouts_func; | |
100 | postgp_func_t postgp_func; | |
5873b8a9 | 101 | call_rcu_func_t call_func; |
cafafd67 | 102 | struct rcu_tasks_percpu __percpu *rtpcpu; |
7a30871b | 103 | int percpu_enqueue_shift; |
8dd593fd | 104 | int percpu_enqueue_lim; |
2cee0789 | 105 | int percpu_dequeue_lim; |
fd796e41 | 106 | unsigned long percpu_dequeue_gpseq; |
ce9b1c66 PM |
107 | struct mutex barrier_q_mutex; |
108 | atomic_t barrier_q_count; | |
109 | struct completion barrier_q_completion; | |
110 | unsigned long barrier_q_seq; | |
c97d12a6 PM |
111 | char *name; |
112 | char *kname; | |
07e10515 PM |
113 | }; |
114 | ||
3063b33a PM |
115 | static void call_rcu_tasks_iw_wakeup(struct irq_work *iwp); |
116 | ||
cafafd67 PM |
117 | #define DEFINE_RCU_TASKS(rt_name, gp, call, n) \ |
118 | static DEFINE_PER_CPU(struct rcu_tasks_percpu, rt_name ## __percpu) = { \ | |
381a4f3b | 119 | .lock = __RAW_SPIN_LOCK_UNLOCKED(rt_name ## __percpu.cbs_pcpu_lock), \ |
88db792b | 120 | .rtp_irq_work = IRQ_WORK_INIT_HARD(call_rcu_tasks_iw_wakeup), \ |
cafafd67 PM |
121 | }; \ |
122 | static struct rcu_tasks rt_name = \ | |
123 | { \ | |
88db792b | 124 | .cbs_wait = __RCUWAIT_INITIALIZER(rt_name.wait), \ |
cafafd67 | 125 | .cbs_gbl_lock = __RAW_SPIN_LOCK_UNLOCKED(rt_name.cbs_gbl_lock), \ |
d96225fd | 126 | .tasks_gp_mutex = __MUTEX_INITIALIZER(rt_name.tasks_gp_mutex), \ |
cafafd67 PM |
127 | .gp_func = gp, \ |
128 | .call_func = call, \ | |
129 | .rtpcpu = &rt_name ## __percpu, \ | |
130 | .name = n, \ | |
2bcd18e0 | 131 | .percpu_enqueue_shift = order_base_2(CONFIG_NR_CPUS), \ |
8dd593fd | 132 | .percpu_enqueue_lim = 1, \ |
2cee0789 | 133 | .percpu_dequeue_lim = 1, \ |
ce9b1c66 PM |
134 | .barrier_q_mutex = __MUTEX_INITIALIZER(rt_name.barrier_q_mutex), \ |
135 | .barrier_q_seq = (0UL - 50UL) << RCU_SEQ_CTR_SHIFT, \ | |
cafafd67 | 136 | .kname = #rt_name, \ |
07e10515 PM |
137 | } |
138 | ||
eacd6f04 PM |
139 | /* Track exiting tasks in order to allow them to be waited for. */ |
140 | DEFINE_STATIC_SRCU(tasks_rcu_exit_srcu); | |
141 | ||
b0afa0f0 | 142 | /* Avoid IPIing CPUs early in the grace period. */ |
574de876 | 143 | #define RCU_TASK_IPI_DELAY (IS_ENABLED(CONFIG_TASKS_TRACE_RCU_READ_MB) ? HZ / 2 : 0) |
b0afa0f0 PM |
144 | static int rcu_task_ipi_delay __read_mostly = RCU_TASK_IPI_DELAY; |
145 | module_param(rcu_task_ipi_delay, int, 0644); | |
146 | ||
eacd6f04 PM |
147 | /* Control stall timeouts. Disable with <= 0, otherwise jiffies till stall. */ |
148 | #define RCU_TASK_STALL_TIMEOUT (HZ * 60 * 10) | |
149 | static int rcu_task_stall_timeout __read_mostly = RCU_TASK_STALL_TIMEOUT; | |
150 | module_param(rcu_task_stall_timeout, int, 0644); | |
f2539003 PM |
151 | #define RCU_TASK_STALL_INFO (HZ * 10) |
152 | static int rcu_task_stall_info __read_mostly = RCU_TASK_STALL_INFO; | |
153 | module_param(rcu_task_stall_info, int, 0644); | |
154 | static int rcu_task_stall_info_mult __read_mostly = 3; | |
155 | module_param(rcu_task_stall_info_mult, int, 0444); | |
eacd6f04 | 156 | |
8610b656 PM |
157 | static int rcu_task_enqueue_lim __read_mostly = -1; |
158 | module_param(rcu_task_enqueue_lim, int, 0444); | |
159 | ||
ab97152f PM |
160 | static bool rcu_task_cb_adjust; |
161 | static int rcu_task_contend_lim __read_mostly = 100; | |
162 | module_param(rcu_task_contend_lim, int, 0444); | |
fd796e41 PM |
163 | static int rcu_task_collapse_lim __read_mostly = 10; |
164 | module_param(rcu_task_collapse_lim, int, 0444); | |
ab97152f | 165 | |
af051ca4 PM |
166 | /* RCU tasks grace-period state for debugging. */ |
167 | #define RTGS_INIT 0 | |
168 | #define RTGS_WAIT_WAIT_CBS 1 | |
169 | #define RTGS_WAIT_GP 2 | |
170 | #define RTGS_PRE_WAIT_GP 3 | |
171 | #define RTGS_SCAN_TASKLIST 4 | |
172 | #define RTGS_POST_SCAN_TASKLIST 5 | |
173 | #define RTGS_WAIT_SCAN_HOLDOUTS 6 | |
174 | #define RTGS_SCAN_HOLDOUTS 7 | |
175 | #define RTGS_POST_GP 8 | |
176 | #define RTGS_WAIT_READERS 9 | |
177 | #define RTGS_INVOKE_CBS 10 | |
178 | #define RTGS_WAIT_CBS 11 | |
8344496e | 179 | #ifndef CONFIG_TINY_RCU |
af051ca4 PM |
180 | static const char * const rcu_tasks_gp_state_names[] = { |
181 | "RTGS_INIT", | |
182 | "RTGS_WAIT_WAIT_CBS", | |
183 | "RTGS_WAIT_GP", | |
184 | "RTGS_PRE_WAIT_GP", | |
185 | "RTGS_SCAN_TASKLIST", | |
186 | "RTGS_POST_SCAN_TASKLIST", | |
187 | "RTGS_WAIT_SCAN_HOLDOUTS", | |
188 | "RTGS_SCAN_HOLDOUTS", | |
189 | "RTGS_POST_GP", | |
190 | "RTGS_WAIT_READERS", | |
191 | "RTGS_INVOKE_CBS", | |
192 | "RTGS_WAIT_CBS", | |
193 | }; | |
8344496e | 194 | #endif /* #ifndef CONFIG_TINY_RCU */ |
af051ca4 | 195 | |
5873b8a9 PM |
196 | //////////////////////////////////////////////////////////////////////// |
197 | // | |
198 | // Generic code. | |
199 | ||
d363f833 PM |
200 | static void rcu_tasks_invoke_cbs_wq(struct work_struct *wp); |
201 | ||
af051ca4 PM |
202 | /* Record grace-period phase and time. */ |
203 | static void set_tasks_gp_state(struct rcu_tasks *rtp, int newstate) | |
204 | { | |
205 | rtp->gp_state = newstate; | |
206 | rtp->gp_jiffies = jiffies; | |
207 | } | |
208 | ||
8344496e | 209 | #ifndef CONFIG_TINY_RCU |
af051ca4 PM |
210 | /* Return state name. */ |
211 | static const char *tasks_gp_state_getname(struct rcu_tasks *rtp) | |
212 | { | |
213 | int i = data_race(rtp->gp_state); // Let KCSAN detect update races | |
214 | int j = READ_ONCE(i); // Prevent the compiler from reading twice | |
215 | ||
216 | if (j >= ARRAY_SIZE(rcu_tasks_gp_state_names)) | |
217 | return "???"; | |
218 | return rcu_tasks_gp_state_names[j]; | |
219 | } | |
8344496e | 220 | #endif /* #ifndef CONFIG_TINY_RCU */ |
af051ca4 | 221 | |
cafafd67 PM |
222 | // Initialize per-CPU callback lists for the specified flavor of |
223 | // Tasks RCU. | |
224 | static void cblist_init_generic(struct rcu_tasks *rtp) | |
225 | { | |
226 | int cpu; | |
227 | unsigned long flags; | |
8610b656 | 228 | int lim; |
da123016 | 229 | int shift; |
cafafd67 PM |
230 | |
231 | raw_spin_lock_irqsave(&rtp->cbs_gbl_lock, flags); | |
ab97152f PM |
232 | if (rcu_task_enqueue_lim < 0) { |
233 | rcu_task_enqueue_lim = 1; | |
234 | rcu_task_cb_adjust = true; | |
235 | pr_info("%s: Setting adjustable number of callback queues.\n", __func__); | |
236 | } else if (rcu_task_enqueue_lim == 0) { | |
8610b656 | 237 | rcu_task_enqueue_lim = 1; |
ab97152f | 238 | } |
8610b656 PM |
239 | lim = rcu_task_enqueue_lim; |
240 | ||
241 | if (lim > nr_cpu_ids) | |
242 | lim = nr_cpu_ids; | |
da123016 PM |
243 | shift = ilog2(nr_cpu_ids / lim); |
244 | if (((nr_cpu_ids - 1) >> shift) >= lim) | |
245 | shift++; | |
246 | WRITE_ONCE(rtp->percpu_enqueue_shift, shift); | |
2cee0789 | 247 | WRITE_ONCE(rtp->percpu_dequeue_lim, lim); |
8610b656 | 248 | smp_store_release(&rtp->percpu_enqueue_lim, lim); |
cafafd67 PM |
249 | for_each_possible_cpu(cpu) { |
250 | struct rcu_tasks_percpu *rtpcp = per_cpu_ptr(rtp->rtpcpu, cpu); | |
251 | ||
252 | WARN_ON_ONCE(!rtpcp); | |
253 | if (cpu) | |
381a4f3b PM |
254 | raw_spin_lock_init(&ACCESS_PRIVATE(rtpcp, lock)); |
255 | raw_spin_lock_rcu_node(rtpcp); // irqs already disabled. | |
9b073de1 PM |
256 | if (rcu_segcblist_empty(&rtpcp->cblist)) |
257 | rcu_segcblist_init(&rtpcp->cblist); | |
d363f833 PM |
258 | INIT_WORK(&rtpcp->rtp_work, rcu_tasks_invoke_cbs_wq); |
259 | rtpcp->cpu = cpu; | |
260 | rtpcp->rtpp = rtp; | |
434c9eef PM |
261 | if (!rtpcp->rtp_blkd_tasks.next) |
262 | INIT_LIST_HEAD(&rtpcp->rtp_blkd_tasks); | |
381a4f3b | 263 | raw_spin_unlock_rcu_node(rtpcp); // irqs remain disabled. |
cafafd67 PM |
264 | } |
265 | raw_spin_unlock_irqrestore(&rtp->cbs_gbl_lock, flags); | |
8610b656 | 266 | pr_info("%s: Setting shift to %d and lim to %d.\n", __func__, data_race(rtp->percpu_enqueue_shift), data_race(rtp->percpu_enqueue_lim)); |
cafafd67 PM |
267 | } |
268 | ||
3063b33a PM |
269 | // IRQ-work handler that does deferred wakeup for call_rcu_tasks_generic(). |
270 | static void call_rcu_tasks_iw_wakeup(struct irq_work *iwp) | |
271 | { | |
272 | struct rcu_tasks *rtp; | |
273 | struct rcu_tasks_percpu *rtpcp = container_of(iwp, struct rcu_tasks_percpu, rtp_irq_work); | |
274 | ||
275 | rtp = rtpcp->rtpp; | |
88db792b | 276 | rcuwait_wake_up(&rtp->cbs_wait); |
3063b33a PM |
277 | } |
278 | ||
5873b8a9 PM |
279 | // Enqueue a callback for the specified flavor of Tasks RCU. |
280 | static void call_rcu_tasks_generic(struct rcu_head *rhp, rcu_callback_t func, | |
281 | struct rcu_tasks *rtp) | |
eacd6f04 | 282 | { |
07d95c34 | 283 | int chosen_cpu; |
eacd6f04 | 284 | unsigned long flags; |
07d95c34 | 285 | int ideal_cpu; |
7d13d30b | 286 | unsigned long j; |
ab97152f | 287 | bool needadjust = false; |
eacd6f04 | 288 | bool needwake; |
cafafd67 | 289 | struct rcu_tasks_percpu *rtpcp; |
eacd6f04 PM |
290 | |
291 | rhp->next = NULL; | |
292 | rhp->func = func; | |
cafafd67 | 293 | local_irq_save(flags); |
fd796e41 | 294 | rcu_read_lock(); |
07d95c34 ED |
295 | ideal_cpu = smp_processor_id() >> READ_ONCE(rtp->percpu_enqueue_shift); |
296 | chosen_cpu = cpumask_next(ideal_cpu - 1, cpu_possible_mask); | |
297 | rtpcp = per_cpu_ptr(rtp->rtpcpu, chosen_cpu); | |
7d13d30b PM |
298 | if (!raw_spin_trylock_rcu_node(rtpcp)) { // irqs already disabled. |
299 | raw_spin_lock_rcu_node(rtpcp); // irqs already disabled. | |
300 | j = jiffies; | |
301 | if (rtpcp->rtp_jiffies != j) { | |
302 | rtpcp->rtp_jiffies = j; | |
303 | rtpcp->rtp_n_lock_retries = 0; | |
304 | } | |
ab97152f PM |
305 | if (rcu_task_cb_adjust && ++rtpcp->rtp_n_lock_retries > rcu_task_contend_lim && |
306 | READ_ONCE(rtp->percpu_enqueue_lim) != nr_cpu_ids) | |
307 | needadjust = true; // Defer adjustment to avoid deadlock. | |
7d13d30b | 308 | } |
9b073de1 | 309 | if (!rcu_segcblist_is_enabled(&rtpcp->cblist)) { |
381a4f3b | 310 | raw_spin_unlock_rcu_node(rtpcp); // irqs remain disabled. |
cafafd67 | 311 | cblist_init_generic(rtp); |
381a4f3b | 312 | raw_spin_lock_rcu_node(rtpcp); // irqs already disabled. |
cafafd67 | 313 | } |
9b073de1 PM |
314 | needwake = rcu_segcblist_empty(&rtpcp->cblist); |
315 | rcu_segcblist_enqueue(&rtpcp->cblist, rhp); | |
381a4f3b | 316 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); |
ab97152f PM |
317 | if (unlikely(needadjust)) { |
318 | raw_spin_lock_irqsave(&rtp->cbs_gbl_lock, flags); | |
319 | if (rtp->percpu_enqueue_lim != nr_cpu_ids) { | |
00a8b4b5 | 320 | WRITE_ONCE(rtp->percpu_enqueue_shift, 0); |
fd796e41 | 321 | WRITE_ONCE(rtp->percpu_dequeue_lim, nr_cpu_ids); |
ab97152f PM |
322 | smp_store_release(&rtp->percpu_enqueue_lim, nr_cpu_ids); |
323 | pr_info("Switching %s to per-CPU callback queuing.\n", rtp->name); | |
324 | } | |
325 | raw_spin_unlock_irqrestore(&rtp->cbs_gbl_lock, flags); | |
326 | } | |
fd796e41 | 327 | rcu_read_unlock(); |
eacd6f04 | 328 | /* We can't create the thread unless interrupts are enabled. */ |
07e10515 | 329 | if (needwake && READ_ONCE(rtp->kthread_ptr)) |
3063b33a | 330 | irq_work_queue(&rtpcp->rtp_irq_work); |
eacd6f04 | 331 | } |
eacd6f04 | 332 | |
ce9b1c66 PM |
333 | // RCU callback function for rcu_barrier_tasks_generic(). |
334 | static void rcu_barrier_tasks_generic_cb(struct rcu_head *rhp) | |
335 | { | |
336 | struct rcu_tasks *rtp; | |
337 | struct rcu_tasks_percpu *rtpcp; | |
338 | ||
339 | rtpcp = container_of(rhp, struct rcu_tasks_percpu, barrier_q_head); | |
340 | rtp = rtpcp->rtpp; | |
341 | if (atomic_dec_and_test(&rtp->barrier_q_count)) | |
342 | complete(&rtp->barrier_q_completion); | |
343 | } | |
344 | ||
345 | // Wait for all in-flight callbacks for the specified RCU Tasks flavor. | |
346 | // Operates in a manner similar to rcu_barrier(). | |
347 | static void rcu_barrier_tasks_generic(struct rcu_tasks *rtp) | |
348 | { | |
349 | int cpu; | |
350 | unsigned long flags; | |
351 | struct rcu_tasks_percpu *rtpcp; | |
352 | unsigned long s = rcu_seq_snap(&rtp->barrier_q_seq); | |
353 | ||
354 | mutex_lock(&rtp->barrier_q_mutex); | |
355 | if (rcu_seq_done(&rtp->barrier_q_seq, s)) { | |
356 | smp_mb(); | |
357 | mutex_unlock(&rtp->barrier_q_mutex); | |
358 | return; | |
359 | } | |
360 | rcu_seq_start(&rtp->barrier_q_seq); | |
361 | init_completion(&rtp->barrier_q_completion); | |
362 | atomic_set(&rtp->barrier_q_count, 2); | |
363 | for_each_possible_cpu(cpu) { | |
2cee0789 | 364 | if (cpu >= smp_load_acquire(&rtp->percpu_dequeue_lim)) |
ce9b1c66 PM |
365 | break; |
366 | rtpcp = per_cpu_ptr(rtp->rtpcpu, cpu); | |
367 | rtpcp->barrier_q_head.func = rcu_barrier_tasks_generic_cb; | |
368 | raw_spin_lock_irqsave_rcu_node(rtpcp, flags); | |
369 | if (rcu_segcblist_entrain(&rtpcp->cblist, &rtpcp->barrier_q_head)) | |
370 | atomic_inc(&rtp->barrier_q_count); | |
371 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); | |
372 | } | |
373 | if (atomic_sub_and_test(2, &rtp->barrier_q_count)) | |
374 | complete(&rtp->barrier_q_completion); | |
375 | wait_for_completion(&rtp->barrier_q_completion); | |
376 | rcu_seq_end(&rtp->barrier_q_seq); | |
377 | mutex_unlock(&rtp->barrier_q_mutex); | |
378 | } | |
379 | ||
4d1114c0 PM |
380 | // Advance callbacks and indicate whether either a grace period or |
381 | // callback invocation is needed. | |
382 | static int rcu_tasks_need_gpcb(struct rcu_tasks *rtp) | |
383 | { | |
384 | int cpu; | |
385 | unsigned long flags; | |
fd796e41 PM |
386 | long n; |
387 | long ncbs = 0; | |
388 | long ncbsnz = 0; | |
4d1114c0 PM |
389 | int needgpcb = 0; |
390 | ||
2cee0789 | 391 | for (cpu = 0; cpu < smp_load_acquire(&rtp->percpu_dequeue_lim); cpu++) { |
4d1114c0 PM |
392 | struct rcu_tasks_percpu *rtpcp = per_cpu_ptr(rtp->rtpcpu, cpu); |
393 | ||
394 | /* Advance and accelerate any new callbacks. */ | |
fd796e41 | 395 | if (!rcu_segcblist_n_cbs(&rtpcp->cblist)) |
4d1114c0 PM |
396 | continue; |
397 | raw_spin_lock_irqsave_rcu_node(rtpcp, flags); | |
fd796e41 PM |
398 | // Should we shrink down to a single callback queue? |
399 | n = rcu_segcblist_n_cbs(&rtpcp->cblist); | |
400 | if (n) { | |
401 | ncbs += n; | |
402 | if (cpu > 0) | |
403 | ncbsnz += n; | |
404 | } | |
4d1114c0 PM |
405 | rcu_segcblist_advance(&rtpcp->cblist, rcu_seq_current(&rtp->tasks_gp_seq)); |
406 | (void)rcu_segcblist_accelerate(&rtpcp->cblist, rcu_seq_snap(&rtp->tasks_gp_seq)); | |
407 | if (rcu_segcblist_pend_cbs(&rtpcp->cblist)) | |
408 | needgpcb |= 0x3; | |
409 | if (!rcu_segcblist_empty(&rtpcp->cblist)) | |
410 | needgpcb |= 0x1; | |
411 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); | |
412 | } | |
fd796e41 PM |
413 | |
414 | // Shrink down to a single callback queue if appropriate. | |
415 | // This is done in two stages: (1) If there are no more than | |
416 | // rcu_task_collapse_lim callbacks on CPU 0 and none on any other | |
417 | // CPU, limit enqueueing to CPU 0. (2) After an RCU grace period, | |
418 | // if there has not been an increase in callbacks, limit dequeuing | |
419 | // to CPU 0. Note the matching RCU read-side critical section in | |
420 | // call_rcu_tasks_generic(). | |
421 | if (rcu_task_cb_adjust && ncbs <= rcu_task_collapse_lim) { | |
422 | raw_spin_lock_irqsave(&rtp->cbs_gbl_lock, flags); | |
423 | if (rtp->percpu_enqueue_lim > 1) { | |
2bcd18e0 | 424 | WRITE_ONCE(rtp->percpu_enqueue_shift, order_base_2(nr_cpu_ids)); |
fd796e41 PM |
425 | smp_store_release(&rtp->percpu_enqueue_lim, 1); |
426 | rtp->percpu_dequeue_gpseq = get_state_synchronize_rcu(); | |
427 | pr_info("Starting switch %s to CPU-0 callback queuing.\n", rtp->name); | |
428 | } | |
429 | raw_spin_unlock_irqrestore(&rtp->cbs_gbl_lock, flags); | |
430 | } | |
431 | if (rcu_task_cb_adjust && !ncbsnz && | |
432 | poll_state_synchronize_rcu(rtp->percpu_dequeue_gpseq)) { | |
433 | raw_spin_lock_irqsave(&rtp->cbs_gbl_lock, flags); | |
434 | if (rtp->percpu_enqueue_lim < rtp->percpu_dequeue_lim) { | |
435 | WRITE_ONCE(rtp->percpu_dequeue_lim, 1); | |
436 | pr_info("Completing switch %s to CPU-0 callback queuing.\n", rtp->name); | |
437 | } | |
4cf0585c PM |
438 | for (cpu = rtp->percpu_dequeue_lim; cpu < nr_cpu_ids; cpu++) { |
439 | struct rcu_tasks_percpu *rtpcp = per_cpu_ptr(rtp->rtpcpu, cpu); | |
440 | ||
441 | WARN_ON_ONCE(rcu_segcblist_n_cbs(&rtpcp->cblist)); | |
442 | } | |
fd796e41 PM |
443 | raw_spin_unlock_irqrestore(&rtp->cbs_gbl_lock, flags); |
444 | } | |
445 | ||
4d1114c0 PM |
446 | return needgpcb; |
447 | } | |
448 | ||
57881863 | 449 | // Advance callbacks and invoke any that are ready. |
d363f833 | 450 | static void rcu_tasks_invoke_cbs(struct rcu_tasks *rtp, struct rcu_tasks_percpu *rtpcp) |
eacd6f04 | 451 | { |
57881863 | 452 | int cpu; |
d363f833 | 453 | int cpunext; |
eacd6f04 | 454 | unsigned long flags; |
9b073de1 | 455 | int len; |
9b073de1 | 456 | struct rcu_head *rhp; |
d363f833 PM |
457 | struct rcu_cblist rcl = RCU_CBLIST_INITIALIZER(rcl); |
458 | struct rcu_tasks_percpu *rtpcp_next; | |
459 | ||
460 | cpu = rtpcp->cpu; | |
461 | cpunext = cpu * 2 + 1; | |
2cee0789 | 462 | if (cpunext < smp_load_acquire(&rtp->percpu_dequeue_lim)) { |
d363f833 PM |
463 | rtpcp_next = per_cpu_ptr(rtp->rtpcpu, cpunext); |
464 | queue_work_on(cpunext, system_wq, &rtpcp_next->rtp_work); | |
465 | cpunext++; | |
2cee0789 | 466 | if (cpunext < smp_load_acquire(&rtp->percpu_dequeue_lim)) { |
d363f833 PM |
467 | rtpcp_next = per_cpu_ptr(rtp->rtpcpu, cpunext); |
468 | queue_work_on(cpunext, system_wq, &rtpcp_next->rtp_work); | |
57881863 | 469 | } |
57881863 | 470 | } |
d363f833 | 471 | |
ab2756ea | 472 | if (rcu_segcblist_empty(&rtpcp->cblist) || !cpu_possible(cpu)) |
d363f833 PM |
473 | return; |
474 | raw_spin_lock_irqsave_rcu_node(rtpcp, flags); | |
475 | rcu_segcblist_advance(&rtpcp->cblist, rcu_seq_current(&rtp->tasks_gp_seq)); | |
476 | rcu_segcblist_extract_done_cbs(&rtpcp->cblist, &rcl); | |
477 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); | |
478 | len = rcl.len; | |
479 | for (rhp = rcu_cblist_dequeue(&rcl); rhp; rhp = rcu_cblist_dequeue(&rcl)) { | |
480 | local_bh_disable(); | |
481 | rhp->func(rhp); | |
482 | local_bh_enable(); | |
483 | cond_resched(); | |
484 | } | |
485 | raw_spin_lock_irqsave_rcu_node(rtpcp, flags); | |
486 | rcu_segcblist_add_len(&rtpcp->cblist, -len); | |
487 | (void)rcu_segcblist_accelerate(&rtpcp->cblist, rcu_seq_snap(&rtp->tasks_gp_seq)); | |
488 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); | |
489 | } | |
490 | ||
491 | // Workqueue flood to advance callbacks and invoke any that are ready. | |
492 | static void rcu_tasks_invoke_cbs_wq(struct work_struct *wp) | |
493 | { | |
494 | struct rcu_tasks *rtp; | |
495 | struct rcu_tasks_percpu *rtpcp = container_of(wp, struct rcu_tasks_percpu, rtp_work); | |
496 | ||
497 | rtp = rtpcp->rtpp; | |
498 | rcu_tasks_invoke_cbs(rtp, rtpcp); | |
57881863 PM |
499 | } |
500 | ||
d96225fd | 501 | // Wait for one grace period. |
4a8cc433 | 502 | static void rcu_tasks_one_gp(struct rcu_tasks *rtp, bool midboot) |
57881863 PM |
503 | { |
504 | int needgpcb; | |
d96225fd PM |
505 | |
506 | mutex_lock(&rtp->tasks_gp_mutex); | |
d96225fd PM |
507 | |
508 | // If there were none, wait a bit and start over. | |
4a8cc433 PM |
509 | if (unlikely(midboot)) { |
510 | needgpcb = 0x2; | |
511 | } else { | |
512 | set_tasks_gp_state(rtp, RTGS_WAIT_CBS); | |
513 | rcuwait_wait_event(&rtp->cbs_wait, | |
514 | (needgpcb = rcu_tasks_need_gpcb(rtp)), | |
515 | TASK_IDLE); | |
516 | } | |
d96225fd PM |
517 | |
518 | if (needgpcb & 0x2) { | |
519 | // Wait for one grace period. | |
520 | set_tasks_gp_state(rtp, RTGS_WAIT_GP); | |
521 | rtp->gp_start = jiffies; | |
522 | rcu_seq_start(&rtp->tasks_gp_seq); | |
523 | rtp->gp_func(rtp); | |
524 | rcu_seq_end(&rtp->tasks_gp_seq); | |
525 | } | |
526 | ||
527 | // Invoke callbacks. | |
528 | set_tasks_gp_state(rtp, RTGS_INVOKE_CBS); | |
529 | rcu_tasks_invoke_cbs(rtp, per_cpu_ptr(rtp->rtpcpu, 0)); | |
530 | mutex_unlock(&rtp->tasks_gp_mutex); | |
531 | } | |
532 | ||
533 | // RCU-tasks kthread that detects grace periods and invokes callbacks. | |
534 | static int __noreturn rcu_tasks_kthread(void *arg) | |
535 | { | |
07e10515 | 536 | struct rcu_tasks *rtp = arg; |
eacd6f04 PM |
537 | |
538 | /* Run on housekeeping CPUs by default. Sysadm can move if desired. */ | |
04d4e665 | 539 | housekeeping_affine(current, HK_TYPE_RCU); |
07e10515 | 540 | WRITE_ONCE(rtp->kthread_ptr, current); // Let GPs start! |
eacd6f04 PM |
541 | |
542 | /* | |
543 | * Each pass through the following loop makes one check for | |
544 | * newly arrived callbacks, and, if there are some, waits for | |
545 | * one RCU-tasks grace period and then invokes the callbacks. | |
546 | * This loop is terminated by the system going down. ;-) | |
547 | */ | |
548 | for (;;) { | |
d96225fd PM |
549 | // Wait for one grace period and invoke any callbacks |
550 | // that are ready. | |
4a8cc433 | 551 | rcu_tasks_one_gp(rtp, false); |
57881863 | 552 | |
d96225fd | 553 | // Paranoid sleep to keep this from entering a tight loop. |
4fe192df | 554 | schedule_timeout_idle(rtp->gp_sleep); |
eacd6f04 PM |
555 | } |
556 | } | |
557 | ||
68cb4720 PM |
558 | // Wait for a grace period for the specified flavor of Tasks RCU. |
559 | static void synchronize_rcu_tasks_generic(struct rcu_tasks *rtp) | |
560 | { | |
561 | /* Complain if the scheduler has not started. */ | |
562 | RCU_LOCKDEP_WARN(rcu_scheduler_active == RCU_SCHEDULER_INACTIVE, | |
563 | "synchronize_rcu_tasks called too soon"); | |
564 | ||
4a8cc433 PM |
565 | // If the grace-period kthread is running, use it. |
566 | if (READ_ONCE(rtp->kthread_ptr)) { | |
567 | wait_rcu_gp(rtp->call_func); | |
568 | return; | |
569 | } | |
570 | rcu_tasks_one_gp(rtp, true); | |
68cb4720 PM |
571 | } |
572 | ||
1b04fa99 | 573 | /* Spawn RCU-tasks grace-period kthread. */ |
5873b8a9 | 574 | static void __init rcu_spawn_tasks_kthread_generic(struct rcu_tasks *rtp) |
eacd6f04 PM |
575 | { |
576 | struct task_struct *t; | |
577 | ||
c97d12a6 PM |
578 | t = kthread_run(rcu_tasks_kthread, rtp, "%s_kthread", rtp->kname); |
579 | if (WARN_ONCE(IS_ERR(t), "%s: Could not start %s grace-period kthread, OOM is now expected behavior\n", __func__, rtp->name)) | |
5873b8a9 | 580 | return; |
eacd6f04 | 581 | smp_mb(); /* Ensure others see full kthread. */ |
eacd6f04 | 582 | } |
eacd6f04 | 583 | |
eacd6f04 PM |
584 | #ifndef CONFIG_TINY_RCU |
585 | ||
586 | /* | |
587 | * Print any non-default Tasks RCU settings. | |
588 | */ | |
589 | static void __init rcu_tasks_bootup_oddness(void) | |
590 | { | |
d5f177d3 | 591 | #if defined(CONFIG_TASKS_RCU) || defined(CONFIG_TASKS_TRACE_RCU) |
f2539003 PM |
592 | int rtsimc; |
593 | ||
eacd6f04 PM |
594 | if (rcu_task_stall_timeout != RCU_TASK_STALL_TIMEOUT) |
595 | pr_info("\tTasks-RCU CPU stall warnings timeout set to %d (rcu_task_stall_timeout).\n", rcu_task_stall_timeout); | |
f2539003 PM |
596 | rtsimc = clamp(rcu_task_stall_info_mult, 1, 10); |
597 | if (rtsimc != rcu_task_stall_info_mult) { | |
598 | pr_info("\tTasks-RCU CPU stall info multiplier clamped to %d (rcu_task_stall_info_mult).\n", rtsimc); | |
599 | rcu_task_stall_info_mult = rtsimc; | |
600 | } | |
d5f177d3 PM |
601 | #endif /* #ifdef CONFIG_TASKS_RCU */ |
602 | #ifdef CONFIG_TASKS_RCU | |
603 | pr_info("\tTrampoline variant of Tasks RCU enabled.\n"); | |
eacd6f04 | 604 | #endif /* #ifdef CONFIG_TASKS_RCU */ |
c84aad76 PM |
605 | #ifdef CONFIG_TASKS_RUDE_RCU |
606 | pr_info("\tRude variant of Tasks RCU enabled.\n"); | |
607 | #endif /* #ifdef CONFIG_TASKS_RUDE_RCU */ | |
d5f177d3 PM |
608 | #ifdef CONFIG_TASKS_TRACE_RCU |
609 | pr_info("\tTracing variant of Tasks RCU enabled.\n"); | |
610 | #endif /* #ifdef CONFIG_TASKS_TRACE_RCU */ | |
eacd6f04 PM |
611 | } |
612 | ||
613 | #endif /* #ifndef CONFIG_TINY_RCU */ | |
5873b8a9 | 614 | |
8344496e | 615 | #ifndef CONFIG_TINY_RCU |
e21408ce PM |
616 | /* Dump out rcutorture-relevant state common to all RCU-tasks flavors. */ |
617 | static void show_rcu_tasks_generic_gp_kthread(struct rcu_tasks *rtp, char *s) | |
618 | { | |
10b3742f PM |
619 | int cpu; |
620 | bool havecbs = false; | |
621 | ||
622 | for_each_possible_cpu(cpu) { | |
623 | struct rcu_tasks_percpu *rtpcp = per_cpu_ptr(rtp->rtpcpu, cpu); | |
624 | ||
625 | if (!data_race(rcu_segcblist_empty(&rtpcp->cblist))) { | |
626 | havecbs = true; | |
627 | break; | |
628 | } | |
629 | } | |
7e0669c3 | 630 | pr_info("%s: %s(%d) since %lu g:%lu i:%lu/%lu %c%c %s\n", |
e21408ce | 631 | rtp->kname, |
7e0669c3 | 632 | tasks_gp_state_getname(rtp), data_race(rtp->gp_state), |
af051ca4 | 633 | jiffies - data_race(rtp->gp_jiffies), |
b14fb4fb | 634 | data_race(rcu_seq_current(&rtp->tasks_gp_seq)), |
7e0669c3 | 635 | data_race(rtp->n_ipis_fails), data_race(rtp->n_ipis), |
e21408ce | 636 | ".k"[!!data_race(rtp->kthread_ptr)], |
10b3742f | 637 | ".C"[havecbs], |
e21408ce PM |
638 | s); |
639 | } | |
27c0f144 | 640 | #endif // #ifndef CONFIG_TINY_RCU |
e21408ce | 641 | |
25246fc8 PM |
642 | static void exit_tasks_rcu_finish_trace(struct task_struct *t); |
643 | ||
644 | #if defined(CONFIG_TASKS_RCU) || defined(CONFIG_TASKS_TRACE_RCU) | |
5873b8a9 | 645 | |
d01aa263 PM |
646 | //////////////////////////////////////////////////////////////////////// |
647 | // | |
648 | // Shared code between task-list-scanning variants of Tasks RCU. | |
649 | ||
650 | /* Wait for one RCU-tasks grace period. */ | |
651 | static void rcu_tasks_wait_gp(struct rcu_tasks *rtp) | |
652 | { | |
f2539003 | 653 | struct task_struct *g; |
d01aa263 | 654 | int fract; |
f2539003 PM |
655 | LIST_HEAD(holdouts); |
656 | unsigned long j; | |
657 | unsigned long lastinfo; | |
658 | unsigned long lastreport; | |
659 | bool reported = false; | |
660 | int rtsi; | |
661 | struct task_struct *t; | |
d01aa263 | 662 | |
af051ca4 | 663 | set_tasks_gp_state(rtp, RTGS_PRE_WAIT_GP); |
7460ade1 | 664 | rtp->pregp_func(&holdouts); |
d01aa263 PM |
665 | |
666 | /* | |
667 | * There were callbacks, so we need to wait for an RCU-tasks | |
668 | * grace period. Start off by scanning the task list for tasks | |
669 | * that are not already voluntarily blocked. Mark these tasks | |
670 | * and make a list of them in holdouts. | |
671 | */ | |
af051ca4 | 672 | set_tasks_gp_state(rtp, RTGS_SCAN_TASKLIST); |
d01aa263 PM |
673 | rcu_read_lock(); |
674 | for_each_process_thread(g, t) | |
675 | rtp->pertask_func(t, &holdouts); | |
676 | rcu_read_unlock(); | |
677 | ||
af051ca4 | 678 | set_tasks_gp_state(rtp, RTGS_POST_SCAN_TASKLIST); |
9796e1ae | 679 | rtp->postscan_func(&holdouts); |
d01aa263 PM |
680 | |
681 | /* | |
682 | * Each pass through the following loop scans the list of holdout | |
683 | * tasks, removing any that are no longer holdouts. When the list | |
684 | * is empty, we are done. | |
685 | */ | |
686 | lastreport = jiffies; | |
f2539003 PM |
687 | lastinfo = lastreport; |
688 | rtsi = READ_ONCE(rcu_task_stall_info); | |
d01aa263 | 689 | |
2393a613 PM |
690 | // Start off with initial wait and slowly back off to 1 HZ wait. |
691 | fract = rtp->init_fract; | |
d01aa263 | 692 | |
77dc1741 | 693 | while (!list_empty(&holdouts)) { |
777570d9 | 694 | ktime_t exp; |
d01aa263 PM |
695 | bool firstreport; |
696 | bool needreport; | |
697 | int rtst; | |
698 | ||
f2539003 | 699 | // Slowly back off waiting for holdouts |
af051ca4 | 700 | set_tasks_gp_state(rtp, RTGS_WAIT_SCAN_HOLDOUTS); |
bddf7122 PM |
701 | if (!IS_ENABLED(CONFIG_PREEMPT_RT)) { |
702 | schedule_timeout_idle(fract); | |
703 | } else { | |
704 | exp = jiffies_to_nsecs(fract); | |
705 | __set_current_state(TASK_IDLE); | |
706 | schedule_hrtimeout_range(&exp, jiffies_to_nsecs(HZ / 2), HRTIMER_MODE_REL_HARD); | |
707 | } | |
d01aa263 | 708 | |
75dc2da5 PM |
709 | if (fract < HZ) |
710 | fract++; | |
d01aa263 PM |
711 | |
712 | rtst = READ_ONCE(rcu_task_stall_timeout); | |
713 | needreport = rtst > 0 && time_after(jiffies, lastreport + rtst); | |
f2539003 | 714 | if (needreport) { |
d01aa263 | 715 | lastreport = jiffies; |
f2539003 PM |
716 | reported = true; |
717 | } | |
d01aa263 PM |
718 | firstreport = true; |
719 | WARN_ON(signal_pending(current)); | |
af051ca4 | 720 | set_tasks_gp_state(rtp, RTGS_SCAN_HOLDOUTS); |
d01aa263 | 721 | rtp->holdouts_func(&holdouts, needreport, &firstreport); |
f2539003 PM |
722 | |
723 | // Print pre-stall informational messages if needed. | |
724 | j = jiffies; | |
725 | if (rtsi > 0 && !reported && time_after(j, lastinfo + rtsi)) { | |
726 | lastinfo = j; | |
727 | rtsi = rtsi * rcu_task_stall_info_mult; | |
728 | pr_info("%s: %s grace period %lu is %lu jiffies old.\n", | |
729 | __func__, rtp->kname, rtp->tasks_gp_seq, j - rtp->gp_start); | |
730 | } | |
d01aa263 PM |
731 | } |
732 | ||
af051ca4 PM |
733 | set_tasks_gp_state(rtp, RTGS_POST_GP); |
734 | rtp->postgp_func(rtp); | |
d01aa263 PM |
735 | } |
736 | ||
25246fc8 PM |
737 | #endif /* #if defined(CONFIG_TASKS_RCU) || defined(CONFIG_TASKS_TRACE_RCU) */ |
738 | ||
739 | #ifdef CONFIG_TASKS_RCU | |
740 | ||
5873b8a9 PM |
741 | //////////////////////////////////////////////////////////////////////// |
742 | // | |
743 | // Simple variant of RCU whose quiescent states are voluntary context | |
8af9e2c7 | 744 | // switch, cond_resched_tasks_rcu_qs(), user-space execution, and idle. |
5873b8a9 PM |
745 | // As such, grace periods can take one good long time. There are no |
746 | // read-side primitives similar to rcu_read_lock() and rcu_read_unlock() | |
747 | // because this implementation is intended to get the system into a safe | |
748 | // state for some of the manipulations involved in tracing and the like. | |
749 | // Finally, this implementation does not support high call_rcu_tasks() | |
750 | // rates from multiple CPUs. If this is required, per-CPU callback lists | |
751 | // will be needed. | |
06a3ec92 PM |
752 | // |
753 | // The implementation uses rcu_tasks_wait_gp(), which relies on function | |
754 | // pointers in the rcu_tasks structure. The rcu_spawn_tasks_kthread() | |
755 | // function sets these function pointers up so that rcu_tasks_wait_gp() | |
756 | // invokes these functions in this order: | |
757 | // | |
758 | // rcu_tasks_pregp_step(): | |
759 | // Invokes synchronize_rcu() in order to wait for all in-flight | |
760 | // t->on_rq and t->nvcsw transitions to complete. This works because | |
761 | // all such transitions are carried out with interrupts disabled. | |
762 | // rcu_tasks_pertask(), invoked on every non-idle task: | |
763 | // For every runnable non-idle task other than the current one, use | |
764 | // get_task_struct() to pin down that task, snapshot that task's | |
765 | // number of voluntary context switches, and add that task to the | |
766 | // holdout list. | |
767 | // rcu_tasks_postscan(): | |
768 | // Invoke synchronize_srcu() to ensure that all tasks that were | |
769 | // in the process of exiting (and which thus might not know to | |
770 | // synchronize with this RCU Tasks grace period) have completed | |
771 | // exiting. | |
772 | // check_all_holdout_tasks(), repeatedly until holdout list is empty: | |
773 | // Scans the holdout list, attempting to identify a quiescent state | |
774 | // for each task on the list. If there is a quiescent state, the | |
775 | // corresponding task is removed from the holdout list. | |
776 | // rcu_tasks_postgp(): | |
777 | // Invokes synchronize_rcu() in order to ensure that all prior | |
778 | // t->on_rq and t->nvcsw transitions are seen by all CPUs and tasks | |
779 | // to have happened before the end of this RCU Tasks grace period. | |
780 | // Again, this works because all such transitions are carried out | |
781 | // with interrupts disabled. | |
782 | // | |
783 | // For each exiting task, the exit_tasks_rcu_start() and | |
784 | // exit_tasks_rcu_finish() functions begin and end, respectively, the SRCU | |
785 | // read-side critical sections waited for by rcu_tasks_postscan(). | |
786 | // | |
381a4f3b PM |
787 | // Pre-grace-period update-side code is ordered before the grace |
788 | // via the raw_spin_lock.*rcu_node(). Pre-grace-period read-side code | |
789 | // is ordered before the grace period via synchronize_rcu() call in | |
790 | // rcu_tasks_pregp_step() and by the scheduler's locks and interrupt | |
06a3ec92 | 791 | // disabling. |
5873b8a9 | 792 | |
e4fe5dd6 | 793 | /* Pre-grace-period preparation. */ |
7460ade1 | 794 | static void rcu_tasks_pregp_step(struct list_head *hop) |
e4fe5dd6 PM |
795 | { |
796 | /* | |
797 | * Wait for all pre-existing t->on_rq and t->nvcsw transitions | |
798 | * to complete. Invoking synchronize_rcu() suffices because all | |
799 | * these transitions occur with interrupts disabled. Without this | |
800 | * synchronize_rcu(), a read-side critical section that started | |
801 | * before the grace period might be incorrectly seen as having | |
802 | * started after the grace period. | |
803 | * | |
804 | * This synchronize_rcu() also dispenses with the need for a | |
805 | * memory barrier on the first store to t->rcu_tasks_holdout, | |
806 | * as it forces the store to happen after the beginning of the | |
807 | * grace period. | |
808 | */ | |
809 | synchronize_rcu(); | |
810 | } | |
811 | ||
812 | /* Per-task initial processing. */ | |
813 | static void rcu_tasks_pertask(struct task_struct *t, struct list_head *hop) | |
814 | { | |
815 | if (t != current && READ_ONCE(t->on_rq) && !is_idle_task(t)) { | |
816 | get_task_struct(t); | |
817 | t->rcu_tasks_nvcsw = READ_ONCE(t->nvcsw); | |
818 | WRITE_ONCE(t->rcu_tasks_holdout, true); | |
819 | list_add(&t->rcu_tasks_holdout_list, hop); | |
820 | } | |
821 | } | |
822 | ||
823 | /* Processing between scanning taskslist and draining the holdout list. */ | |
04a3c5aa | 824 | static void rcu_tasks_postscan(struct list_head *hop) |
e4fe5dd6 PM |
825 | { |
826 | /* | |
827 | * Wait for tasks that are in the process of exiting. This | |
828 | * does only part of the job, ensuring that all tasks that were | |
829 | * previously exiting reach the point where they have disabled | |
830 | * preemption, allowing the later synchronize_rcu() to finish | |
831 | * the job. | |
832 | */ | |
833 | synchronize_srcu(&tasks_rcu_exit_srcu); | |
834 | } | |
835 | ||
5873b8a9 PM |
836 | /* See if tasks are still holding out, complain if so. */ |
837 | static void check_holdout_task(struct task_struct *t, | |
838 | bool needreport, bool *firstreport) | |
839 | { | |
840 | int cpu; | |
841 | ||
842 | if (!READ_ONCE(t->rcu_tasks_holdout) || | |
843 | t->rcu_tasks_nvcsw != READ_ONCE(t->nvcsw) || | |
844 | !READ_ONCE(t->on_rq) || | |
845 | (IS_ENABLED(CONFIG_NO_HZ_FULL) && | |
846 | !is_idle_task(t) && t->rcu_tasks_idle_cpu >= 0)) { | |
847 | WRITE_ONCE(t->rcu_tasks_holdout, false); | |
848 | list_del_init(&t->rcu_tasks_holdout_list); | |
849 | put_task_struct(t); | |
850 | return; | |
851 | } | |
852 | rcu_request_urgent_qs_task(t); | |
853 | if (!needreport) | |
854 | return; | |
855 | if (*firstreport) { | |
856 | pr_err("INFO: rcu_tasks detected stalls on tasks:\n"); | |
857 | *firstreport = false; | |
858 | } | |
859 | cpu = task_cpu(t); | |
860 | pr_alert("%p: %c%c nvcsw: %lu/%lu holdout: %d idle_cpu: %d/%d\n", | |
861 | t, ".I"[is_idle_task(t)], | |
862 | "N."[cpu < 0 || !tick_nohz_full_cpu(cpu)], | |
863 | t->rcu_tasks_nvcsw, t->nvcsw, t->rcu_tasks_holdout, | |
864 | t->rcu_tasks_idle_cpu, cpu); | |
865 | sched_show_task(t); | |
866 | } | |
867 | ||
e4fe5dd6 PM |
868 | /* Scan the holdout lists for tasks no longer holding out. */ |
869 | static void check_all_holdout_tasks(struct list_head *hop, | |
870 | bool needreport, bool *firstreport) | |
871 | { | |
872 | struct task_struct *t, *t1; | |
873 | ||
874 | list_for_each_entry_safe(t, t1, hop, rcu_tasks_holdout_list) { | |
875 | check_holdout_task(t, needreport, firstreport); | |
876 | cond_resched(); | |
877 | } | |
878 | } | |
879 | ||
880 | /* Finish off the Tasks-RCU grace period. */ | |
af051ca4 | 881 | static void rcu_tasks_postgp(struct rcu_tasks *rtp) |
e4fe5dd6 PM |
882 | { |
883 | /* | |
884 | * Because ->on_rq and ->nvcsw are not guaranteed to have a full | |
885 | * memory barriers prior to them in the schedule() path, memory | |
886 | * reordering on other CPUs could cause their RCU-tasks read-side | |
887 | * critical sections to extend past the end of the grace period. | |
888 | * However, because these ->nvcsw updates are carried out with | |
889 | * interrupts disabled, we can use synchronize_rcu() to force the | |
890 | * needed ordering on all such CPUs. | |
891 | * | |
892 | * This synchronize_rcu() also confines all ->rcu_tasks_holdout | |
893 | * accesses to be within the grace period, avoiding the need for | |
894 | * memory barriers for ->rcu_tasks_holdout accesses. | |
895 | * | |
896 | * In addition, this synchronize_rcu() waits for exiting tasks | |
897 | * to complete their final preempt_disable() region of execution, | |
898 | * cleaning up after the synchronize_srcu() above. | |
899 | */ | |
900 | synchronize_rcu(); | |
901 | } | |
902 | ||
5873b8a9 | 903 | void call_rcu_tasks(struct rcu_head *rhp, rcu_callback_t func); |
c97d12a6 | 904 | DEFINE_RCU_TASKS(rcu_tasks, rcu_tasks_wait_gp, call_rcu_tasks, "RCU Tasks"); |
5873b8a9 PM |
905 | |
906 | /** | |
907 | * call_rcu_tasks() - Queue an RCU for invocation task-based grace period | |
908 | * @rhp: structure to be used for queueing the RCU updates. | |
909 | * @func: actual callback function to be invoked after the grace period | |
910 | * | |
911 | * The callback function will be invoked some time after a full grace | |
912 | * period elapses, in other words after all currently executing RCU | |
913 | * read-side critical sections have completed. call_rcu_tasks() assumes | |
914 | * that the read-side critical sections end at a voluntary context | |
8af9e2c7 | 915 | * switch (not a preemption!), cond_resched_tasks_rcu_qs(), entry into idle, |
5873b8a9 PM |
916 | * or transition to usermode execution. As such, there are no read-side |
917 | * primitives analogous to rcu_read_lock() and rcu_read_unlock() because | |
918 | * this primitive is intended to determine that all tasks have passed | |
a616aec9 | 919 | * through a safe state, not so much for data-structure synchronization. |
5873b8a9 PM |
920 | * |
921 | * See the description of call_rcu() for more detailed information on | |
922 | * memory ordering guarantees. | |
923 | */ | |
924 | void call_rcu_tasks(struct rcu_head *rhp, rcu_callback_t func) | |
925 | { | |
926 | call_rcu_tasks_generic(rhp, func, &rcu_tasks); | |
927 | } | |
928 | EXPORT_SYMBOL_GPL(call_rcu_tasks); | |
929 | ||
930 | /** | |
931 | * synchronize_rcu_tasks - wait until an rcu-tasks grace period has elapsed. | |
932 | * | |
933 | * Control will return to the caller some time after a full rcu-tasks | |
934 | * grace period has elapsed, in other words after all currently | |
935 | * executing rcu-tasks read-side critical sections have elapsed. These | |
936 | * read-side critical sections are delimited by calls to schedule(), | |
937 | * cond_resched_tasks_rcu_qs(), idle execution, userspace execution, calls | |
938 | * to synchronize_rcu_tasks(), and (in theory, anyway) cond_resched(). | |
939 | * | |
940 | * This is a very specialized primitive, intended only for a few uses in | |
941 | * tracing and other situations requiring manipulation of function | |
942 | * preambles and profiling hooks. The synchronize_rcu_tasks() function | |
943 | * is not (yet) intended for heavy use from multiple CPUs. | |
944 | * | |
945 | * See the description of synchronize_rcu() for more detailed information | |
946 | * on memory ordering guarantees. | |
947 | */ | |
948 | void synchronize_rcu_tasks(void) | |
949 | { | |
950 | synchronize_rcu_tasks_generic(&rcu_tasks); | |
951 | } | |
952 | EXPORT_SYMBOL_GPL(synchronize_rcu_tasks); | |
953 | ||
954 | /** | |
955 | * rcu_barrier_tasks - Wait for in-flight call_rcu_tasks() callbacks. | |
956 | * | |
957 | * Although the current implementation is guaranteed to wait, it is not | |
958 | * obligated to, for example, if there are no pending callbacks. | |
959 | */ | |
960 | void rcu_barrier_tasks(void) | |
961 | { | |
ce9b1c66 | 962 | rcu_barrier_tasks_generic(&rcu_tasks); |
5873b8a9 PM |
963 | } |
964 | EXPORT_SYMBOL_GPL(rcu_barrier_tasks); | |
965 | ||
966 | static int __init rcu_spawn_tasks_kthread(void) | |
967 | { | |
cafafd67 | 968 | cblist_init_generic(&rcu_tasks); |
4fe192df | 969 | rcu_tasks.gp_sleep = HZ / 10; |
75dc2da5 | 970 | rcu_tasks.init_fract = HZ / 10; |
e4fe5dd6 PM |
971 | rcu_tasks.pregp_func = rcu_tasks_pregp_step; |
972 | rcu_tasks.pertask_func = rcu_tasks_pertask; | |
973 | rcu_tasks.postscan_func = rcu_tasks_postscan; | |
974 | rcu_tasks.holdouts_func = check_all_holdout_tasks; | |
975 | rcu_tasks.postgp_func = rcu_tasks_postgp; | |
5873b8a9 PM |
976 | rcu_spawn_tasks_kthread_generic(&rcu_tasks); |
977 | return 0; | |
978 | } | |
5873b8a9 | 979 | |
27c0f144 PM |
980 | #if !defined(CONFIG_TINY_RCU) |
981 | void show_rcu_tasks_classic_gp_kthread(void) | |
e21408ce PM |
982 | { |
983 | show_rcu_tasks_generic_gp_kthread(&rcu_tasks, ""); | |
984 | } | |
27c0f144 PM |
985 | EXPORT_SYMBOL_GPL(show_rcu_tasks_classic_gp_kthread); |
986 | #endif // !defined(CONFIG_TINY_RCU) | |
e21408ce | 987 | |
25246fc8 PM |
988 | /* Do the srcu_read_lock() for the above synchronize_srcu(). */ |
989 | void exit_tasks_rcu_start(void) __acquires(&tasks_rcu_exit_srcu) | |
990 | { | |
991 | preempt_disable(); | |
992 | current->rcu_tasks_idx = __srcu_read_lock(&tasks_rcu_exit_srcu); | |
993 | preempt_enable(); | |
994 | } | |
995 | ||
996 | /* Do the srcu_read_unlock() for the above synchronize_srcu(). */ | |
997 | void exit_tasks_rcu_finish(void) __releases(&tasks_rcu_exit_srcu) | |
998 | { | |
999 | struct task_struct *t = current; | |
1000 | ||
1001 | preempt_disable(); | |
1002 | __srcu_read_unlock(&tasks_rcu_exit_srcu, t->rcu_tasks_idx); | |
1003 | preempt_enable(); | |
1004 | exit_tasks_rcu_finish_trace(t); | |
1005 | } | |
1006 | ||
e21408ce | 1007 | #else /* #ifdef CONFIG_TASKS_RCU */ |
25246fc8 PM |
1008 | void exit_tasks_rcu_start(void) { } |
1009 | void exit_tasks_rcu_finish(void) { exit_tasks_rcu_finish_trace(current); } | |
e21408ce | 1010 | #endif /* #else #ifdef CONFIG_TASKS_RCU */ |
c84aad76 PM |
1011 | |
1012 | #ifdef CONFIG_TASKS_RUDE_RCU | |
1013 | ||
1014 | //////////////////////////////////////////////////////////////////////// | |
1015 | // | |
1016 | // "Rude" variant of Tasks RCU, inspired by Steve Rostedt's trick of | |
1017 | // passing an empty function to schedule_on_each_cpu(). This approach | |
e4be1f44 PM |
1018 | // provides an asynchronous call_rcu_tasks_rude() API and batching of |
1019 | // concurrent calls to the synchronous synchronize_rcu_tasks_rude() API. | |
9fc98e31 PM |
1020 | // This invokes schedule_on_each_cpu() in order to send IPIs far and wide |
1021 | // and induces otherwise unnecessary context switches on all online CPUs, | |
1022 | // whether idle or not. | |
1023 | // | |
1024 | // Callback handling is provided by the rcu_tasks_kthread() function. | |
1025 | // | |
1026 | // Ordering is provided by the scheduler's context-switch code. | |
c84aad76 PM |
1027 | |
1028 | // Empty function to allow workqueues to force a context switch. | |
1029 | static void rcu_tasks_be_rude(struct work_struct *work) | |
1030 | { | |
1031 | } | |
1032 | ||
1033 | // Wait for one rude RCU-tasks grace period. | |
1034 | static void rcu_tasks_rude_wait_gp(struct rcu_tasks *rtp) | |
1035 | { | |
f75fd4b9 PS |
1036 | if (num_online_cpus() <= 1) |
1037 | return; // Fastpath for only one CPU. | |
1038 | ||
238dbce3 | 1039 | rtp->n_ipis += cpumask_weight(cpu_online_mask); |
c84aad76 PM |
1040 | schedule_on_each_cpu(rcu_tasks_be_rude); |
1041 | } | |
1042 | ||
1043 | void call_rcu_tasks_rude(struct rcu_head *rhp, rcu_callback_t func); | |
c97d12a6 PM |
1044 | DEFINE_RCU_TASKS(rcu_tasks_rude, rcu_tasks_rude_wait_gp, call_rcu_tasks_rude, |
1045 | "RCU Tasks Rude"); | |
c84aad76 PM |
1046 | |
1047 | /** | |
1048 | * call_rcu_tasks_rude() - Queue a callback rude task-based grace period | |
1049 | * @rhp: structure to be used for queueing the RCU updates. | |
1050 | * @func: actual callback function to be invoked after the grace period | |
1051 | * | |
1052 | * The callback function will be invoked some time after a full grace | |
1053 | * period elapses, in other words after all currently executing RCU | |
1054 | * read-side critical sections have completed. call_rcu_tasks_rude() | |
1055 | * assumes that the read-side critical sections end at context switch, | |
8af9e2c7 | 1056 | * cond_resched_tasks_rcu_qs(), or transition to usermode execution (as |
a6517e9c NU |
1057 | * usermode execution is schedulable). As such, there are no read-side |
1058 | * primitives analogous to rcu_read_lock() and rcu_read_unlock() because | |
1059 | * this primitive is intended to determine that all tasks have passed | |
1060 | * through a safe state, not so much for data-structure synchronization. | |
c84aad76 PM |
1061 | * |
1062 | * See the description of call_rcu() for more detailed information on | |
1063 | * memory ordering guarantees. | |
1064 | */ | |
1065 | void call_rcu_tasks_rude(struct rcu_head *rhp, rcu_callback_t func) | |
1066 | { | |
1067 | call_rcu_tasks_generic(rhp, func, &rcu_tasks_rude); | |
1068 | } | |
1069 | EXPORT_SYMBOL_GPL(call_rcu_tasks_rude); | |
1070 | ||
1071 | /** | |
1072 | * synchronize_rcu_tasks_rude - wait for a rude rcu-tasks grace period | |
1073 | * | |
1074 | * Control will return to the caller some time after a rude rcu-tasks | |
1075 | * grace period has elapsed, in other words after all currently | |
1076 | * executing rcu-tasks read-side critical sections have elapsed. These | |
1077 | * read-side critical sections are delimited by calls to schedule(), | |
a6517e9c NU |
1078 | * cond_resched_tasks_rcu_qs(), userspace execution (which is a schedulable |
1079 | * context), and (in theory, anyway) cond_resched(). | |
c84aad76 PM |
1080 | * |
1081 | * This is a very specialized primitive, intended only for a few uses in | |
1082 | * tracing and other situations requiring manipulation of function preambles | |
1083 | * and profiling hooks. The synchronize_rcu_tasks_rude() function is not | |
1084 | * (yet) intended for heavy use from multiple CPUs. | |
1085 | * | |
1086 | * See the description of synchronize_rcu() for more detailed information | |
1087 | * on memory ordering guarantees. | |
1088 | */ | |
1089 | void synchronize_rcu_tasks_rude(void) | |
1090 | { | |
1091 | synchronize_rcu_tasks_generic(&rcu_tasks_rude); | |
1092 | } | |
1093 | EXPORT_SYMBOL_GPL(synchronize_rcu_tasks_rude); | |
1094 | ||
1095 | /** | |
1096 | * rcu_barrier_tasks_rude - Wait for in-flight call_rcu_tasks_rude() callbacks. | |
1097 | * | |
1098 | * Although the current implementation is guaranteed to wait, it is not | |
1099 | * obligated to, for example, if there are no pending callbacks. | |
1100 | */ | |
1101 | void rcu_barrier_tasks_rude(void) | |
1102 | { | |
ce9b1c66 | 1103 | rcu_barrier_tasks_generic(&rcu_tasks_rude); |
c84aad76 PM |
1104 | } |
1105 | EXPORT_SYMBOL_GPL(rcu_barrier_tasks_rude); | |
1106 | ||
1107 | static int __init rcu_spawn_tasks_rude_kthread(void) | |
1108 | { | |
cafafd67 | 1109 | cblist_init_generic(&rcu_tasks_rude); |
4fe192df | 1110 | rcu_tasks_rude.gp_sleep = HZ / 10; |
c84aad76 PM |
1111 | rcu_spawn_tasks_kthread_generic(&rcu_tasks_rude); |
1112 | return 0; | |
1113 | } | |
c84aad76 | 1114 | |
27c0f144 PM |
1115 | #if !defined(CONFIG_TINY_RCU) |
1116 | void show_rcu_tasks_rude_gp_kthread(void) | |
e21408ce PM |
1117 | { |
1118 | show_rcu_tasks_generic_gp_kthread(&rcu_tasks_rude, ""); | |
1119 | } | |
27c0f144 PM |
1120 | EXPORT_SYMBOL_GPL(show_rcu_tasks_rude_gp_kthread); |
1121 | #endif // !defined(CONFIG_TINY_RCU) | |
1122 | #endif /* #ifdef CONFIG_TASKS_RUDE_RCU */ | |
d5f177d3 PM |
1123 | |
1124 | //////////////////////////////////////////////////////////////////////// | |
1125 | // | |
1126 | // Tracing variant of Tasks RCU. This variant is designed to be used | |
1127 | // to protect tracing hooks, including those of BPF. This variant | |
1128 | // therefore: | |
1129 | // | |
1130 | // 1. Has explicit read-side markers to allow finite grace periods | |
1131 | // in the face of in-kernel loops for PREEMPT=n builds. | |
1132 | // | |
1133 | // 2. Protects code in the idle loop, exception entry/exit, and | |
1134 | // CPU-hotplug code paths, similar to the capabilities of SRCU. | |
1135 | // | |
c4f113ac | 1136 | // 3. Avoids expensive read-side instructions, having overhead similar |
d5f177d3 PM |
1137 | // to that of Preemptible RCU. |
1138 | // | |
1139 | // There are of course downsides. The grace-period code can send IPIs to | |
1140 | // CPUs, even when those CPUs are in the idle loop or in nohz_full userspace. | |
1141 | // It is necessary to scan the full tasklist, much as for Tasks RCU. There | |
1142 | // is a single callback queue guarded by a single lock, again, much as for | |
1143 | // Tasks RCU. If needed, these downsides can be at least partially remedied. | |
1144 | // | |
1145 | // Perhaps most important, this variant of RCU does not affect the vanilla | |
1146 | // flavors, rcu_preempt and rcu_sched. The fact that RCU Tasks Trace | |
1147 | // readers can operate from idle, offline, and exception entry/exit in no | |
1148 | // way allows rcu_preempt and rcu_sched readers to also do so. | |
a434dd10 PM |
1149 | // |
1150 | // The implementation uses rcu_tasks_wait_gp(), which relies on function | |
1151 | // pointers in the rcu_tasks structure. The rcu_spawn_tasks_trace_kthread() | |
1152 | // function sets these function pointers up so that rcu_tasks_wait_gp() | |
1153 | // invokes these functions in this order: | |
1154 | // | |
1155 | // rcu_tasks_trace_pregp_step(): | |
1156 | // Initialize the count of readers and block CPU-hotplug operations. | |
1157 | // rcu_tasks_trace_pertask(), invoked on every non-idle task: | |
1158 | // Initialize per-task state and attempt to identify an immediate | |
1159 | // quiescent state for that task, or, failing that, attempt to | |
1160 | // set that task's .need_qs flag so that task's next outermost | |
1161 | // rcu_read_unlock_trace() will report the quiescent state (in which | |
1162 | // case the count of readers is incremented). If both attempts fail, | |
45f4b4a2 PM |
1163 | // the task is added to a "holdout" list. Note that IPIs are used |
1164 | // to invoke trc_read_check_handler() in the context of running tasks | |
1165 | // in order to avoid ordering overhead on common-case shared-variable | |
1166 | // accessses. | |
a434dd10 PM |
1167 | // rcu_tasks_trace_postscan(): |
1168 | // Initialize state and attempt to identify an immediate quiescent | |
1169 | // state as above (but only for idle tasks), unblock CPU-hotplug | |
1170 | // operations, and wait for an RCU grace period to avoid races with | |
1171 | // tasks that are in the process of exiting. | |
1172 | // check_all_holdout_tasks_trace(), repeatedly until holdout list is empty: | |
1173 | // Scans the holdout list, attempting to identify a quiescent state | |
1174 | // for each task on the list. If there is a quiescent state, the | |
1175 | // corresponding task is removed from the holdout list. | |
1176 | // rcu_tasks_trace_postgp(): | |
1177 | // Wait for the count of readers do drop to zero, reporting any stalls. | |
1178 | // Also execute full memory barriers to maintain ordering with code | |
1179 | // executing after the grace period. | |
1180 | // | |
1181 | // The exit_tasks_rcu_finish_trace() synchronizes with exiting tasks. | |
1182 | // | |
1183 | // Pre-grace-period update-side code is ordered before the grace | |
1184 | // period via the ->cbs_lock and barriers in rcu_tasks_kthread(). | |
1185 | // Pre-grace-period read-side code is ordered before the grace period by | |
1186 | // atomic_dec_and_test() of the count of readers (for IPIed readers) and by | |
1187 | // scheduler context-switch ordering (for locked-down non-running readers). | |
d5f177d3 PM |
1188 | |
1189 | // The lockdep state must be outside of #ifdef to be useful. | |
1190 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
1191 | static struct lock_class_key rcu_lock_trace_key; | |
1192 | struct lockdep_map rcu_trace_lock_map = | |
1193 | STATIC_LOCKDEP_MAP_INIT("rcu_read_lock_trace", &rcu_lock_trace_key); | |
1194 | EXPORT_SYMBOL_GPL(rcu_trace_lock_map); | |
1195 | #endif /* #ifdef CONFIG_DEBUG_LOCK_ALLOC */ | |
1196 | ||
1197 | #ifdef CONFIG_TASKS_TRACE_RCU | |
1198 | ||
d5f177d3 PM |
1199 | // Record outstanding IPIs to each CPU. No point in sending two... |
1200 | static DEFINE_PER_CPU(bool, trc_ipi_to_cpu); | |
1201 | ||
40471509 PM |
1202 | // The number of detections of task quiescent state relying on |
1203 | // heavyweight readers executing explicit memory barriers. | |
6731da9e PM |
1204 | static unsigned long n_heavy_reader_attempts; |
1205 | static unsigned long n_heavy_reader_updates; | |
1206 | static unsigned long n_heavy_reader_ofl_updates; | |
40471509 | 1207 | |
b0afa0f0 PM |
1208 | void call_rcu_tasks_trace(struct rcu_head *rhp, rcu_callback_t func); |
1209 | DEFINE_RCU_TASKS(rcu_tasks_trace, rcu_tasks_wait_gp, call_rcu_tasks_trace, | |
1210 | "RCU Tasks Trace"); | |
1211 | ||
3847b645 PM |
1212 | /* Load from ->trc_reader_special.b.need_qs with proper ordering. */ |
1213 | static u8 rcu_ld_need_qs(struct task_struct *t) | |
1214 | { | |
1215 | smp_mb(); // Enforce full grace-period ordering. | |
1216 | return smp_load_acquire(&t->trc_reader_special.b.need_qs); | |
1217 | } | |
1218 | ||
1219 | /* Store to ->trc_reader_special.b.need_qs with proper ordering. */ | |
1220 | static void rcu_st_need_qs(struct task_struct *t, u8 v) | |
1221 | { | |
1222 | smp_store_release(&t->trc_reader_special.b.need_qs, v); | |
1223 | smp_mb(); // Enforce full grace-period ordering. | |
1224 | } | |
1225 | ||
1226 | /* | |
1227 | * Do a cmpxchg() on ->trc_reader_special.b.need_qs, allowing for | |
1228 | * the four-byte operand-size restriction of some platforms. | |
1229 | * Returns the old value, which is often ignored. | |
1230 | */ | |
1231 | u8 rcu_trc_cmpxchg_need_qs(struct task_struct *t, u8 old, u8 new) | |
1232 | { | |
1233 | union rcu_special ret; | |
1234 | union rcu_special trs_old = READ_ONCE(t->trc_reader_special); | |
1235 | union rcu_special trs_new = trs_old; | |
1236 | ||
1237 | if (trs_old.b.need_qs != old) | |
1238 | return trs_old.b.need_qs; | |
1239 | trs_new.b.need_qs = new; | |
1240 | ret.s = cmpxchg(&t->trc_reader_special.s, trs_old.s, trs_new.s); | |
1241 | return ret.b.need_qs; | |
1242 | } | |
1243 | EXPORT_SYMBOL_GPL(rcu_trc_cmpxchg_need_qs); | |
1244 | ||
d5f177d3 | 1245 | /* If we are the last reader, wake up the grace-period kthread. */ |
a5c071cc | 1246 | void rcu_read_unlock_trace_special(struct task_struct *t) |
d5f177d3 | 1247 | { |
0bcb3868 PM |
1248 | unsigned long flags; |
1249 | struct rcu_tasks_percpu *rtpcp; | |
1250 | union rcu_special trs; | |
1251 | ||
1252 | // Open-coded full-word version of rcu_ld_need_qs(). | |
1253 | smp_mb(); // Enforce full grace-period ordering. | |
1254 | trs = smp_load_acquire(&t->trc_reader_special); | |
276c4104 | 1255 | |
3847b645 | 1256 | if (IS_ENABLED(CONFIG_TASKS_TRACE_RCU_READ_MB) && t->trc_reader_special.b.need_mb) |
276c4104 PM |
1257 | smp_mb(); // Pairs with update-side barriers. |
1258 | // Update .need_qs before ->trc_reader_nesting for irq/NMI handlers. | |
0bcb3868 | 1259 | if (trs.b.need_qs == (TRC_NEED_QS_CHECKED | TRC_NEED_QS)) { |
3847b645 PM |
1260 | u8 result = rcu_trc_cmpxchg_need_qs(t, TRC_NEED_QS_CHECKED | TRC_NEED_QS, |
1261 | TRC_NEED_QS_CHECKED); | |
1262 | ||
0bcb3868 PM |
1263 | WARN_ONCE(result != trs.b.need_qs, "%s: result = %d", __func__, result); |
1264 | } | |
1265 | if (trs.b.blocked) { | |
1266 | rtpcp = per_cpu_ptr(rcu_tasks_trace.rtpcpu, t->trc_blkd_cpu); | |
1267 | raw_spin_lock_irqsave_rcu_node(rtpcp, flags); | |
1268 | list_del_init(&t->trc_blkd_node); | |
1269 | WRITE_ONCE(t->trc_reader_special.b.blocked, false); | |
1270 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); | |
3847b645 | 1271 | } |
a5c071cc | 1272 | WRITE_ONCE(t->trc_reader_nesting, 0); |
d5f177d3 PM |
1273 | } |
1274 | EXPORT_SYMBOL_GPL(rcu_read_unlock_trace_special); | |
1275 | ||
0356d4e6 PM |
1276 | /* Add a newly blocked reader task to its CPU's list. */ |
1277 | void rcu_tasks_trace_qs_blkd(struct task_struct *t) | |
1278 | { | |
1279 | unsigned long flags; | |
1280 | struct rcu_tasks_percpu *rtpcp; | |
1281 | ||
1282 | local_irq_save(flags); | |
1283 | rtpcp = this_cpu_ptr(rcu_tasks_trace.rtpcpu); | |
1284 | raw_spin_lock_rcu_node(rtpcp); // irqs already disabled | |
1285 | t->trc_blkd_cpu = smp_processor_id(); | |
1286 | if (!rtpcp->rtp_blkd_tasks.next) | |
1287 | INIT_LIST_HEAD(&rtpcp->rtp_blkd_tasks); | |
1288 | list_add(&t->trc_blkd_node, &rtpcp->rtp_blkd_tasks); | |
0bcb3868 | 1289 | WRITE_ONCE(t->trc_reader_special.b.blocked, true); |
0356d4e6 PM |
1290 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); |
1291 | } | |
1292 | EXPORT_SYMBOL_GPL(rcu_tasks_trace_qs_blkd); | |
1293 | ||
d5f177d3 PM |
1294 | /* Add a task to the holdout list, if it is not already on the list. */ |
1295 | static void trc_add_holdout(struct task_struct *t, struct list_head *bhp) | |
1296 | { | |
1297 | if (list_empty(&t->trc_holdout_list)) { | |
1298 | get_task_struct(t); | |
1299 | list_add(&t->trc_holdout_list, bhp); | |
1300 | } | |
1301 | } | |
1302 | ||
1303 | /* Remove a task from the holdout list, if it is in fact present. */ | |
1304 | static void trc_del_holdout(struct task_struct *t) | |
1305 | { | |
1306 | if (!list_empty(&t->trc_holdout_list)) { | |
1307 | list_del_init(&t->trc_holdout_list); | |
1308 | put_task_struct(t); | |
1309 | } | |
1310 | } | |
1311 | ||
1312 | /* IPI handler to check task state. */ | |
1313 | static void trc_read_check_handler(void *t_in) | |
1314 | { | |
9ff86b4c | 1315 | int nesting; |
d5f177d3 PM |
1316 | struct task_struct *t = current; |
1317 | struct task_struct *texp = t_in; | |
1318 | ||
1319 | // If the task is no longer running on this CPU, leave. | |
3847b645 | 1320 | if (unlikely(texp != t)) |
d5f177d3 | 1321 | goto reset_ipi; // Already on holdout list, so will check later. |
d5f177d3 PM |
1322 | |
1323 | // If the task is not in a read-side critical section, and | |
1324 | // if this is the last reader, awaken the grace-period kthread. | |
9ff86b4c PM |
1325 | nesting = READ_ONCE(t->trc_reader_nesting); |
1326 | if (likely(!nesting)) { | |
3847b645 | 1327 | rcu_trc_cmpxchg_need_qs(t, 0, TRC_NEED_QS_CHECKED); |
d5f177d3 PM |
1328 | goto reset_ipi; |
1329 | } | |
ba3a86e4 | 1330 | // If we are racing with an rcu_read_unlock_trace(), try again later. |
9ff86b4c | 1331 | if (unlikely(nesting < 0)) |
ba3a86e4 | 1332 | goto reset_ipi; |
d5f177d3 PM |
1333 | |
1334 | // Get here if the task is in a read-side critical section. Set | |
1335 | // its state so that it will awaken the grace-period kthread upon | |
1336 | // exit from that critical section. | |
55061126 | 1337 | rcu_trc_cmpxchg_need_qs(t, 0, TRC_NEED_QS | TRC_NEED_QS_CHECKED); |
d5f177d3 PM |
1338 | |
1339 | reset_ipi: | |
1340 | // Allow future IPIs to be sent on CPU and for task. | |
1341 | // Also order this IPI handler against any later manipulations of | |
1342 | // the intended task. | |
8211e922 | 1343 | smp_store_release(per_cpu_ptr(&trc_ipi_to_cpu, smp_processor_id()), false); // ^^^ |
d5f177d3 PM |
1344 | smp_store_release(&texp->trc_ipi_to_cpu, -1); // ^^^ |
1345 | } | |
1346 | ||
1347 | /* Callback function for scheduler to check locked-down task. */ | |
3847b645 | 1348 | static int trc_inspect_reader(struct task_struct *t, void *bhp_in) |
d5f177d3 | 1349 | { |
3847b645 | 1350 | struct list_head *bhp = bhp_in; |
7d0c9c50 | 1351 | int cpu = task_cpu(t); |
18f08e75 | 1352 | int nesting; |
7e3b70e0 | 1353 | bool ofl = cpu_is_offline(cpu); |
7d0c9c50 | 1354 | |
897ba84d | 1355 | if (task_curr(t) && !ofl) { |
7d0c9c50 | 1356 | // If no chance of heavyweight readers, do it the hard way. |
897ba84d | 1357 | if (!IS_ENABLED(CONFIG_TASKS_TRACE_RCU_READ_MB)) |
9b3c4ab3 | 1358 | return -EINVAL; |
7d0c9c50 PM |
1359 | |
1360 | // If heavyweight readers are enabled on the remote task, | |
1361 | // we can inspect its state despite its currently running. | |
1362 | // However, we cannot safely change its state. | |
40471509 | 1363 | n_heavy_reader_attempts++; |
897ba84d PM |
1364 | // Check for "running" idle tasks on offline CPUs. |
1365 | if (!rcu_dynticks_zero_in_eqs(cpu, &t->trc_reader_nesting)) | |
9b3c4ab3 | 1366 | return -EINVAL; // No quiescent state, do it the hard way. |
40471509 | 1367 | n_heavy_reader_updates++; |
18f08e75 | 1368 | nesting = 0; |
7d0c9c50 | 1369 | } else { |
bdb0cca0 | 1370 | // The task is not running, so C-language access is safe. |
18f08e75 | 1371 | nesting = t->trc_reader_nesting; |
897ba84d PM |
1372 | WARN_ON_ONCE(ofl && task_curr(t) && !is_idle_task(t)); |
1373 | if (IS_ENABLED(CONFIG_TASKS_TRACE_RCU_READ_MB) && ofl) | |
1374 | n_heavy_reader_ofl_updates++; | |
7d0c9c50 | 1375 | } |
d5f177d3 | 1376 | |
18f08e75 PM |
1377 | // If not exiting a read-side critical section, mark as checked |
1378 | // so that the grace-period kthread will remove it from the | |
1379 | // holdout list. | |
0968e892 PM |
1380 | if (!nesting) { |
1381 | rcu_trc_cmpxchg_need_qs(t, 0, TRC_NEED_QS_CHECKED); | |
1382 | return 0; // In QS, so done. | |
3847b645 | 1383 | } |
0968e892 PM |
1384 | if (nesting < 0) |
1385 | return -EINVAL; // QS transitioning, try again later. | |
7d0c9c50 PM |
1386 | |
1387 | // The task is in a read-side critical section, so set up its | |
0968e892 PM |
1388 | // state so that it will update state upon exit from that critical |
1389 | // section. | |
55061126 | 1390 | if (!rcu_trc_cmpxchg_need_qs(t, 0, TRC_NEED_QS | TRC_NEED_QS_CHECKED)) |
3847b645 | 1391 | trc_add_holdout(t, bhp); |
9b3c4ab3 | 1392 | return 0; |
d5f177d3 PM |
1393 | } |
1394 | ||
1395 | /* Attempt to extract the state for the specified task. */ | |
1396 | static void trc_wait_for_one_reader(struct task_struct *t, | |
1397 | struct list_head *bhp) | |
1398 | { | |
1399 | int cpu; | |
1400 | ||
1401 | // If a previous IPI is still in flight, let it complete. | |
1402 | if (smp_load_acquire(&t->trc_ipi_to_cpu) != -1) // Order IPI | |
1403 | return; | |
1404 | ||
1405 | // The current task had better be in a quiescent state. | |
1406 | if (t == current) { | |
3847b645 | 1407 | rcu_trc_cmpxchg_need_qs(t, 0, TRC_NEED_QS_CHECKED); |
bdb0cca0 | 1408 | WARN_ON_ONCE(READ_ONCE(t->trc_reader_nesting)); |
d5f177d3 PM |
1409 | return; |
1410 | } | |
1411 | ||
1412 | // Attempt to nail down the task for inspection. | |
1413 | get_task_struct(t); | |
3847b645 | 1414 | if (!task_call_func(t, trc_inspect_reader, bhp)) { |
d5f177d3 PM |
1415 | put_task_struct(t); |
1416 | return; | |
1417 | } | |
1418 | put_task_struct(t); | |
1419 | ||
45f4b4a2 PM |
1420 | // If this task is not yet on the holdout list, then we are in |
1421 | // an RCU read-side critical section. Otherwise, the invocation of | |
d0a85858 | 1422 | // trc_add_holdout() that added it to the list did the necessary |
45f4b4a2 PM |
1423 | // get_task_struct(). Either way, the task cannot be freed out |
1424 | // from under this code. | |
1425 | ||
d5f177d3 PM |
1426 | // If currently running, send an IPI, either way, add to list. |
1427 | trc_add_holdout(t, bhp); | |
574de876 PM |
1428 | if (task_curr(t) && |
1429 | time_after(jiffies + 1, rcu_tasks_trace.gp_start + rcu_task_ipi_delay)) { | |
d5f177d3 PM |
1430 | // The task is currently running, so try IPIing it. |
1431 | cpu = task_cpu(t); | |
1432 | ||
1433 | // If there is already an IPI outstanding, let it happen. | |
1434 | if (per_cpu(trc_ipi_to_cpu, cpu) || t->trc_ipi_to_cpu >= 0) | |
1435 | return; | |
1436 | ||
d5f177d3 PM |
1437 | per_cpu(trc_ipi_to_cpu, cpu) = true; |
1438 | t->trc_ipi_to_cpu = cpu; | |
238dbce3 | 1439 | rcu_tasks_trace.n_ipis++; |
96017bf9 | 1440 | if (smp_call_function_single(cpu, trc_read_check_handler, t, 0)) { |
d5f177d3 PM |
1441 | // Just in case there is some other reason for |
1442 | // failure than the target CPU being offline. | |
46aa886c NU |
1443 | WARN_ONCE(1, "%s(): smp_call_function_single() failed for CPU: %d\n", |
1444 | __func__, cpu); | |
7e0669c3 | 1445 | rcu_tasks_trace.n_ipis_fails++; |
d5f177d3 | 1446 | per_cpu(trc_ipi_to_cpu, cpu) = false; |
46aa886c | 1447 | t->trc_ipi_to_cpu = -1; |
d5f177d3 PM |
1448 | } |
1449 | } | |
1450 | } | |
1451 | ||
7460ade1 PM |
1452 | /* |
1453 | * Initialize for first-round processing for the specified task. | |
1454 | * Return false if task is NULL or already taken care of, true otherwise. | |
1455 | */ | |
1456 | static bool rcu_tasks_trace_pertask_prep(struct task_struct *t, bool notself) | |
d5f177d3 | 1457 | { |
1b04fa99 | 1458 | // During early boot when there is only the one boot CPU, there |
19415004 PM |
1459 | // is no idle task for the other CPUs. Also, the grace-period |
1460 | // kthread is always in a quiescent state. In addition, just return | |
1461 | // if this task is already on the list. | |
7460ade1 PM |
1462 | if (unlikely(t == NULL) || (t == current && notself) || !list_empty(&t->trc_holdout_list)) |
1463 | return false; | |
1b04fa99 | 1464 | |
3847b645 | 1465 | rcu_st_need_qs(t, 0); |
d5f177d3 | 1466 | t->trc_ipi_to_cpu = -1; |
7460ade1 PM |
1467 | return true; |
1468 | } | |
1469 | ||
1470 | /* Do first-round processing for the specified task. */ | |
1471 | static void rcu_tasks_trace_pertask(struct task_struct *t, struct list_head *hop) | |
1472 | { | |
1473 | if (rcu_tasks_trace_pertask_prep(t, true)) | |
1474 | trc_wait_for_one_reader(t, hop); | |
1475 | } | |
1476 | ||
1477 | /* | |
1478 | * Get the current CPU's current task on the holdout list. | |
1479 | * Calls to this function must be serialized. | |
1480 | */ | |
1481 | static void rcu_tasks_trace_pertask_handler(void *hop_in) | |
1482 | { | |
1483 | struct list_head *hop = hop_in; | |
1484 | struct task_struct *t = current; | |
1485 | ||
1486 | // Pull in the currently running task, but only if it is currently | |
1487 | // in an RCU tasks trace read-side critical section. | |
1488 | if (rcu_tasks_trace_pertask_prep(t, false)) | |
1489 | trc_add_holdout(t, hop); | |
d5f177d3 PM |
1490 | } |
1491 | ||
1fa98e2e | 1492 | /* Initialize for a new RCU-tasks-trace grace period. */ |
7460ade1 | 1493 | static void rcu_tasks_trace_pregp_step(struct list_head *hop) |
1fa98e2e | 1494 | { |
dc7d54b4 | 1495 | LIST_HEAD(blkd_tasks); |
1fa98e2e | 1496 | int cpu; |
dc7d54b4 PM |
1497 | unsigned long flags; |
1498 | struct rcu_tasks_percpu *rtpcp; | |
1499 | struct task_struct *t; | |
1fa98e2e PM |
1500 | |
1501 | // There shouldn't be any old IPIs, but... | |
1502 | for_each_possible_cpu(cpu) | |
1503 | WARN_ON_ONCE(per_cpu(trc_ipi_to_cpu, cpu)); | |
1504 | ||
7460ade1 | 1505 | // Disable CPU hotplug across the CPU scan. |
1fa98e2e PM |
1506 | // This also waits for all readers in CPU-hotplug code paths. |
1507 | cpus_read_lock(); | |
7460ade1 PM |
1508 | |
1509 | // These smp_call_function_single() calls are serialized to | |
1510 | // allow safe access to the hop list. | |
1511 | for_each_online_cpu(cpu) | |
1512 | smp_call_function_single(cpu, rcu_tasks_trace_pertask_handler, hop, 1); | |
dc7d54b4 PM |
1513 | |
1514 | // Only after all running tasks have been accounted for is it | |
1515 | // safe to take care of the tasks that have blocked within their | |
1516 | // current RCU tasks trace read-side critical section. | |
1517 | for_each_possible_cpu(cpu) { | |
1518 | rtpcp = per_cpu_ptr(rcu_tasks_trace.rtpcpu, cpu); | |
1519 | raw_spin_lock_irqsave_rcu_node(rtpcp, flags); | |
1520 | list_splice_init(&rtpcp->rtp_blkd_tasks, &blkd_tasks); | |
1521 | while (!list_empty(&blkd_tasks)) { | |
1522 | rcu_read_lock(); | |
1523 | t = list_first_entry(&blkd_tasks, struct task_struct, trc_blkd_node); | |
1524 | list_del_init(&t->trc_blkd_node); | |
1525 | list_add(&t->trc_blkd_node, &rtpcp->rtp_blkd_tasks); | |
1526 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); | |
1527 | rcu_tasks_trace_pertask(t, hop); | |
1528 | rcu_read_unlock(); | |
1529 | raw_spin_lock_irqsave_rcu_node(rtpcp, flags); | |
1530 | } | |
1531 | raw_spin_unlock_irqrestore_rcu_node(rtpcp, flags); | |
1532 | } | |
1fa98e2e PM |
1533 | } |
1534 | ||
9796e1ae | 1535 | /* |
955a0192 | 1536 | * Do intermediate processing between task and holdout scans. |
9796e1ae PM |
1537 | */ |
1538 | static void rcu_tasks_trace_postscan(struct list_head *hop) | |
d5f177d3 | 1539 | { |
81b4a7bc PM |
1540 | // Re-enable CPU hotplug now that the tasklist scan has completed. |
1541 | cpus_read_unlock(); | |
1542 | ||
d5f177d3 PM |
1543 | // Wait for late-stage exiting tasks to finish exiting. |
1544 | // These might have passed the call to exit_tasks_rcu_finish(). | |
1545 | synchronize_rcu(); | |
3847b645 PM |
1546 | // Any tasks that exit after this point will set |
1547 | // TRC_NEED_QS_CHECKED in ->trc_reader_special.b.need_qs. | |
d5f177d3 PM |
1548 | } |
1549 | ||
65b629e7 NU |
1550 | /* Communicate task state back to the RCU tasks trace stall warning request. */ |
1551 | struct trc_stall_chk_rdr { | |
1552 | int nesting; | |
1553 | int ipi_to_cpu; | |
1554 | u8 needqs; | |
1555 | }; | |
1556 | ||
1557 | static int trc_check_slow_task(struct task_struct *t, void *arg) | |
1558 | { | |
1559 | struct trc_stall_chk_rdr *trc_rdrp = arg; | |
1560 | ||
f90f19da | 1561 | if (task_curr(t) && cpu_online(task_cpu(t))) |
65b629e7 NU |
1562 | return false; // It is running, so decline to inspect it. |
1563 | trc_rdrp->nesting = READ_ONCE(t->trc_reader_nesting); | |
1564 | trc_rdrp->ipi_to_cpu = READ_ONCE(t->trc_ipi_to_cpu); | |
3847b645 | 1565 | trc_rdrp->needqs = rcu_ld_need_qs(t); |
65b629e7 NU |
1566 | return true; |
1567 | } | |
1568 | ||
4593e772 PM |
1569 | /* Show the state of a task stalling the current RCU tasks trace GP. */ |
1570 | static void show_stalled_task_trace(struct task_struct *t, bool *firstreport) | |
1571 | { | |
1572 | int cpu; | |
65b629e7 NU |
1573 | struct trc_stall_chk_rdr trc_rdr; |
1574 | bool is_idle_tsk = is_idle_task(t); | |
4593e772 PM |
1575 | |
1576 | if (*firstreport) { | |
1577 | pr_err("INFO: rcu_tasks_trace detected stalls on tasks:\n"); | |
1578 | *firstreport = false; | |
1579 | } | |
4593e772 | 1580 | cpu = task_cpu(t); |
65b629e7 | 1581 | if (!task_call_func(t, trc_check_slow_task, &trc_rdr)) |
9f3eb5fb | 1582 | pr_alert("P%d: %c%c\n", |
65b629e7 | 1583 | t->pid, |
9f3eb5fb | 1584 | ".I"[t->trc_ipi_to_cpu >= 0], |
65b629e7 NU |
1585 | ".i"[is_idle_tsk]); |
1586 | else | |
387c0ad7 | 1587 | pr_alert("P%d: %c%c%c%c nesting: %d%c%c cpu: %d%s\n", |
65b629e7 NU |
1588 | t->pid, |
1589 | ".I"[trc_rdr.ipi_to_cpu >= 0], | |
1590 | ".i"[is_idle_tsk], | |
1591 | ".N"[cpu >= 0 && tick_nohz_full_cpu(cpu)], | |
387c0ad7 | 1592 | ".B"[!!data_race(t->trc_reader_special.b.blocked)], |
65b629e7 | 1593 | trc_rdr.nesting, |
be15a164 PM |
1594 | " !CN"[trc_rdr.needqs & 0x3], |
1595 | " ?"[trc_rdr.needqs > 0x3], | |
c8c03ad9 | 1596 | cpu, cpu_online(cpu) ? "" : "(offline)"); |
4593e772 PM |
1597 | sched_show_task(t); |
1598 | } | |
1599 | ||
1600 | /* List stalled IPIs for RCU tasks trace. */ | |
1601 | static void show_stalled_ipi_trace(void) | |
1602 | { | |
1603 | int cpu; | |
1604 | ||
1605 | for_each_possible_cpu(cpu) | |
1606 | if (per_cpu(trc_ipi_to_cpu, cpu)) | |
1607 | pr_alert("\tIPI outstanding to CPU %d\n", cpu); | |
1608 | } | |
1609 | ||
d5f177d3 PM |
1610 | /* Do one scan of the holdout list. */ |
1611 | static void check_all_holdout_tasks_trace(struct list_head *hop, | |
4593e772 | 1612 | bool needreport, bool *firstreport) |
d5f177d3 PM |
1613 | { |
1614 | struct task_struct *g, *t; | |
1615 | ||
81b4a7bc PM |
1616 | // Disable CPU hotplug across the holdout list scan. |
1617 | cpus_read_lock(); | |
1618 | ||
d5f177d3 PM |
1619 | list_for_each_entry_safe(t, g, hop, trc_holdout_list) { |
1620 | // If safe and needed, try to check the current task. | |
1621 | if (READ_ONCE(t->trc_ipi_to_cpu) == -1 && | |
3847b645 | 1622 | !(rcu_ld_need_qs(t) & TRC_NEED_QS_CHECKED)) |
d5f177d3 PM |
1623 | trc_wait_for_one_reader(t, hop); |
1624 | ||
1625 | // If check succeeded, remove this task from the list. | |
f5dbc594 | 1626 | if (smp_load_acquire(&t->trc_ipi_to_cpu) == -1 && |
3847b645 | 1627 | rcu_ld_need_qs(t) == TRC_NEED_QS_CHECKED) |
d5f177d3 | 1628 | trc_del_holdout(t); |
4593e772 PM |
1629 | else if (needreport) |
1630 | show_stalled_task_trace(t, firstreport); | |
1631 | } | |
81b4a7bc PM |
1632 | |
1633 | // Re-enable CPU hotplug now that the holdout list scan has completed. | |
1634 | cpus_read_unlock(); | |
1635 | ||
4593e772 | 1636 | if (needreport) { |
89401176 | 1637 | if (*firstreport) |
4593e772 PM |
1638 | pr_err("INFO: rcu_tasks_trace detected stalls? (Late IPI?)\n"); |
1639 | show_stalled_ipi_trace(); | |
d5f177d3 PM |
1640 | } |
1641 | } | |
1642 | ||
cbe0d8d9 PM |
1643 | static void rcu_tasks_trace_empty_fn(void *unused) |
1644 | { | |
1645 | } | |
1646 | ||
d5f177d3 | 1647 | /* Wait for grace period to complete and provide ordering. */ |
af051ca4 | 1648 | static void rcu_tasks_trace_postgp(struct rcu_tasks *rtp) |
d5f177d3 | 1649 | { |
cbe0d8d9 | 1650 | int cpu; |
4593e772 | 1651 | |
cbe0d8d9 PM |
1652 | // Wait for any lingering IPI handlers to complete. Note that |
1653 | // if a CPU has gone offline or transitioned to userspace in the | |
1654 | // meantime, all IPI handlers should have been drained beforehand. | |
1655 | // Yes, this assumes that CPUs process IPIs in order. If that ever | |
1656 | // changes, there will need to be a recheck and/or timed wait. | |
1657 | for_each_online_cpu(cpu) | |
f5dbc594 | 1658 | if (WARN_ON_ONCE(smp_load_acquire(per_cpu_ptr(&trc_ipi_to_cpu, cpu)))) |
cbe0d8d9 PM |
1659 | smp_call_function_single(cpu, rcu_tasks_trace_empty_fn, NULL, 1); |
1660 | ||
d5f177d3 | 1661 | smp_mb(); // Caller's code must be ordered after wakeup. |
43766c3e | 1662 | // Pairs with pretty much every ordering primitive. |
d5f177d3 PM |
1663 | } |
1664 | ||
1665 | /* Report any needed quiescent state for this exiting task. */ | |
25246fc8 | 1666 | static void exit_tasks_rcu_finish_trace(struct task_struct *t) |
d5f177d3 | 1667 | { |
0356d4e6 PM |
1668 | union rcu_special trs = READ_ONCE(t->trc_reader_special); |
1669 | ||
3847b645 | 1670 | rcu_trc_cmpxchg_need_qs(t, 0, TRC_NEED_QS_CHECKED); |
bdb0cca0 | 1671 | WARN_ON_ONCE(READ_ONCE(t->trc_reader_nesting)); |
0bcb3868 | 1672 | if (WARN_ON_ONCE(rcu_ld_need_qs(t) & TRC_NEED_QS || trs.b.blocked)) |
a5c071cc | 1673 | rcu_read_unlock_trace_special(t); |
3847b645 PM |
1674 | else |
1675 | WRITE_ONCE(t->trc_reader_nesting, 0); | |
d5f177d3 PM |
1676 | } |
1677 | ||
d5f177d3 PM |
1678 | /** |
1679 | * call_rcu_tasks_trace() - Queue a callback trace task-based grace period | |
1680 | * @rhp: structure to be used for queueing the RCU updates. | |
1681 | * @func: actual callback function to be invoked after the grace period | |
1682 | * | |
ed42c380 NU |
1683 | * The callback function will be invoked some time after a trace rcu-tasks |
1684 | * grace period elapses, in other words after all currently executing | |
1685 | * trace rcu-tasks read-side critical sections have completed. These | |
1686 | * read-side critical sections are delimited by calls to rcu_read_lock_trace() | |
1687 | * and rcu_read_unlock_trace(). | |
d5f177d3 PM |
1688 | * |
1689 | * See the description of call_rcu() for more detailed information on | |
1690 | * memory ordering guarantees. | |
1691 | */ | |
1692 | void call_rcu_tasks_trace(struct rcu_head *rhp, rcu_callback_t func) | |
1693 | { | |
1694 | call_rcu_tasks_generic(rhp, func, &rcu_tasks_trace); | |
1695 | } | |
1696 | EXPORT_SYMBOL_GPL(call_rcu_tasks_trace); | |
1697 | ||
1698 | /** | |
1699 | * synchronize_rcu_tasks_trace - wait for a trace rcu-tasks grace period | |
1700 | * | |
1701 | * Control will return to the caller some time after a trace rcu-tasks | |
c7dcf810 | 1702 | * grace period has elapsed, in other words after all currently executing |
ed42c380 | 1703 | * trace rcu-tasks read-side critical sections have elapsed. These read-side |
c7dcf810 PM |
1704 | * critical sections are delimited by calls to rcu_read_lock_trace() |
1705 | * and rcu_read_unlock_trace(). | |
d5f177d3 PM |
1706 | * |
1707 | * This is a very specialized primitive, intended only for a few uses in | |
1708 | * tracing and other situations requiring manipulation of function preambles | |
1709 | * and profiling hooks. The synchronize_rcu_tasks_trace() function is not | |
1710 | * (yet) intended for heavy use from multiple CPUs. | |
1711 | * | |
1712 | * See the description of synchronize_rcu() for more detailed information | |
1713 | * on memory ordering guarantees. | |
1714 | */ | |
1715 | void synchronize_rcu_tasks_trace(void) | |
1716 | { | |
1717 | RCU_LOCKDEP_WARN(lock_is_held(&rcu_trace_lock_map), "Illegal synchronize_rcu_tasks_trace() in RCU Tasks Trace read-side critical section"); | |
1718 | synchronize_rcu_tasks_generic(&rcu_tasks_trace); | |
1719 | } | |
1720 | EXPORT_SYMBOL_GPL(synchronize_rcu_tasks_trace); | |
1721 | ||
1722 | /** | |
1723 | * rcu_barrier_tasks_trace - Wait for in-flight call_rcu_tasks_trace() callbacks. | |
1724 | * | |
1725 | * Although the current implementation is guaranteed to wait, it is not | |
1726 | * obligated to, for example, if there are no pending callbacks. | |
1727 | */ | |
1728 | void rcu_barrier_tasks_trace(void) | |
1729 | { | |
ce9b1c66 | 1730 | rcu_barrier_tasks_generic(&rcu_tasks_trace); |
d5f177d3 PM |
1731 | } |
1732 | EXPORT_SYMBOL_GPL(rcu_barrier_tasks_trace); | |
1733 | ||
1734 | static int __init rcu_spawn_tasks_trace_kthread(void) | |
1735 | { | |
cafafd67 | 1736 | cblist_init_generic(&rcu_tasks_trace); |
2393a613 | 1737 | if (IS_ENABLED(CONFIG_TASKS_TRACE_RCU_READ_MB)) { |
4fe192df | 1738 | rcu_tasks_trace.gp_sleep = HZ / 10; |
75dc2da5 | 1739 | rcu_tasks_trace.init_fract = HZ / 10; |
2393a613 | 1740 | } else { |
4fe192df PM |
1741 | rcu_tasks_trace.gp_sleep = HZ / 200; |
1742 | if (rcu_tasks_trace.gp_sleep <= 0) | |
1743 | rcu_tasks_trace.gp_sleep = 1; | |
75dc2da5 | 1744 | rcu_tasks_trace.init_fract = HZ / 200; |
2393a613 PM |
1745 | if (rcu_tasks_trace.init_fract <= 0) |
1746 | rcu_tasks_trace.init_fract = 1; | |
1747 | } | |
d5f177d3 PM |
1748 | rcu_tasks_trace.pregp_func = rcu_tasks_trace_pregp_step; |
1749 | rcu_tasks_trace.pertask_func = rcu_tasks_trace_pertask; | |
1750 | rcu_tasks_trace.postscan_func = rcu_tasks_trace_postscan; | |
1751 | rcu_tasks_trace.holdouts_func = check_all_holdout_tasks_trace; | |
1752 | rcu_tasks_trace.postgp_func = rcu_tasks_trace_postgp; | |
1753 | rcu_spawn_tasks_kthread_generic(&rcu_tasks_trace); | |
1754 | return 0; | |
1755 | } | |
d5f177d3 | 1756 | |
27c0f144 PM |
1757 | #if !defined(CONFIG_TINY_RCU) |
1758 | void show_rcu_tasks_trace_gp_kthread(void) | |
e21408ce | 1759 | { |
40471509 | 1760 | char buf[64]; |
e21408ce | 1761 | |
55061126 | 1762 | sprintf(buf, "h:%lu/%lu/%lu", |
edf3775f | 1763 | data_race(n_heavy_reader_ofl_updates), |
40471509 PM |
1764 | data_race(n_heavy_reader_updates), |
1765 | data_race(n_heavy_reader_attempts)); | |
e21408ce PM |
1766 | show_rcu_tasks_generic_gp_kthread(&rcu_tasks_trace, buf); |
1767 | } | |
27c0f144 PM |
1768 | EXPORT_SYMBOL_GPL(show_rcu_tasks_trace_gp_kthread); |
1769 | #endif // !defined(CONFIG_TINY_RCU) | |
e21408ce | 1770 | |
d5f177d3 | 1771 | #else /* #ifdef CONFIG_TASKS_TRACE_RCU */ |
25246fc8 | 1772 | static void exit_tasks_rcu_finish_trace(struct task_struct *t) { } |
d5f177d3 | 1773 | #endif /* #else #ifdef CONFIG_TASKS_TRACE_RCU */ |
8fd8ca38 | 1774 | |
8344496e | 1775 | #ifndef CONFIG_TINY_RCU |
e21408ce PM |
1776 | void show_rcu_tasks_gp_kthreads(void) |
1777 | { | |
1778 | show_rcu_tasks_classic_gp_kthread(); | |
1779 | show_rcu_tasks_rude_gp_kthread(); | |
1780 | show_rcu_tasks_trace_gp_kthread(); | |
1781 | } | |
8344496e | 1782 | #endif /* #ifndef CONFIG_TINY_RCU */ |
e21408ce | 1783 | |
bfba7ed0 URS |
1784 | #ifdef CONFIG_PROVE_RCU |
1785 | struct rcu_tasks_test_desc { | |
1786 | struct rcu_head rh; | |
1787 | const char *name; | |
1788 | bool notrun; | |
1789 | }; | |
1790 | ||
1791 | static struct rcu_tasks_test_desc tests[] = { | |
1792 | { | |
1793 | .name = "call_rcu_tasks()", | |
1794 | /* If not defined, the test is skipped. */ | |
1795 | .notrun = !IS_ENABLED(CONFIG_TASKS_RCU), | |
1796 | }, | |
1797 | { | |
1798 | .name = "call_rcu_tasks_rude()", | |
1799 | /* If not defined, the test is skipped. */ | |
1800 | .notrun = !IS_ENABLED(CONFIG_TASKS_RUDE_RCU), | |
1801 | }, | |
1802 | { | |
1803 | .name = "call_rcu_tasks_trace()", | |
1804 | /* If not defined, the test is skipped. */ | |
1805 | .notrun = !IS_ENABLED(CONFIG_TASKS_TRACE_RCU) | |
1806 | } | |
1807 | }; | |
1808 | ||
1809 | static void test_rcu_tasks_callback(struct rcu_head *rhp) | |
1810 | { | |
1811 | struct rcu_tasks_test_desc *rttd = | |
1812 | container_of(rhp, struct rcu_tasks_test_desc, rh); | |
1813 | ||
1814 | pr_info("Callback from %s invoked.\n", rttd->name); | |
1815 | ||
1816 | rttd->notrun = true; | |
1817 | } | |
1818 | ||
1819 | static void rcu_tasks_initiate_self_tests(void) | |
1820 | { | |
1821 | pr_info("Running RCU-tasks wait API self tests\n"); | |
1822 | #ifdef CONFIG_TASKS_RCU | |
1823 | synchronize_rcu_tasks(); | |
1824 | call_rcu_tasks(&tests[0].rh, test_rcu_tasks_callback); | |
1825 | #endif | |
1826 | ||
1827 | #ifdef CONFIG_TASKS_RUDE_RCU | |
1828 | synchronize_rcu_tasks_rude(); | |
1829 | call_rcu_tasks_rude(&tests[1].rh, test_rcu_tasks_callback); | |
1830 | #endif | |
1831 | ||
1832 | #ifdef CONFIG_TASKS_TRACE_RCU | |
1833 | synchronize_rcu_tasks_trace(); | |
1834 | call_rcu_tasks_trace(&tests[2].rh, test_rcu_tasks_callback); | |
1835 | #endif | |
1836 | } | |
1837 | ||
1838 | static int rcu_tasks_verify_self_tests(void) | |
1839 | { | |
1840 | int ret = 0; | |
1841 | int i; | |
1842 | ||
1843 | for (i = 0; i < ARRAY_SIZE(tests); i++) { | |
1844 | if (!tests[i].notrun) { // still hanging. | |
1845 | pr_err("%s has been failed.\n", tests[i].name); | |
1846 | ret = -1; | |
1847 | } | |
1848 | } | |
1849 | ||
1850 | if (ret) | |
1851 | WARN_ON(1); | |
1852 | ||
1853 | return ret; | |
1854 | } | |
1855 | late_initcall(rcu_tasks_verify_self_tests); | |
1856 | #else /* #ifdef CONFIG_PROVE_RCU */ | |
1857 | static void rcu_tasks_initiate_self_tests(void) { } | |
1858 | #endif /* #else #ifdef CONFIG_PROVE_RCU */ | |
1859 | ||
1b04fa99 URS |
1860 | void __init rcu_init_tasks_generic(void) |
1861 | { | |
1862 | #ifdef CONFIG_TASKS_RCU | |
1863 | rcu_spawn_tasks_kthread(); | |
1864 | #endif | |
1865 | ||
1866 | #ifdef CONFIG_TASKS_RUDE_RCU | |
1867 | rcu_spawn_tasks_rude_kthread(); | |
1868 | #endif | |
1869 | ||
1870 | #ifdef CONFIG_TASKS_TRACE_RCU | |
1871 | rcu_spawn_tasks_trace_kthread(); | |
1872 | #endif | |
bfba7ed0 URS |
1873 | |
1874 | // Run the self-tests. | |
1875 | rcu_tasks_initiate_self_tests(); | |
1b04fa99 URS |
1876 | } |
1877 | ||
8fd8ca38 PM |
1878 | #else /* #ifdef CONFIG_TASKS_RCU_GENERIC */ |
1879 | static inline void rcu_tasks_bootup_oddness(void) {} | |
1880 | #endif /* #else #ifdef CONFIG_TASKS_RCU_GENERIC */ |