rcu: Move rcu_barrier_completion to rcu_state structure
[deliverable/linux.git] / kernel / rcutree.h
1 /*
2 * Read-Copy Update mechanism for mutual exclusion (tree-based version)
3 * Internal non-public definitions.
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 *
19 * Copyright IBM Corporation, 2008
20 *
21 * Author: Ingo Molnar <mingo@elte.hu>
22 * Paul E. McKenney <paulmck@linux.vnet.ibm.com>
23 */
24
25 #include <linux/cache.h>
26 #include <linux/spinlock.h>
27 #include <linux/threads.h>
28 #include <linux/cpumask.h>
29 #include <linux/seqlock.h>
30
31 /*
32 * Define shape of hierarchy based on NR_CPUS, CONFIG_RCU_FANOUT, and
33 * CONFIG_RCU_FANOUT_LEAF.
34 * In theory, it should be possible to add more levels straightforwardly.
35 * In practice, this did work well going from three levels to four.
36 * Of course, your mileage may vary.
37 */
38 #define MAX_RCU_LVLS 4
39 #define RCU_FANOUT_1 (CONFIG_RCU_FANOUT_LEAF)
40 #define RCU_FANOUT_2 (RCU_FANOUT_1 * CONFIG_RCU_FANOUT)
41 #define RCU_FANOUT_3 (RCU_FANOUT_2 * CONFIG_RCU_FANOUT)
42 #define RCU_FANOUT_4 (RCU_FANOUT_3 * CONFIG_RCU_FANOUT)
43
44 #if NR_CPUS <= RCU_FANOUT_1
45 # define RCU_NUM_LVLS 1
46 # define NUM_RCU_LVL_0 1
47 # define NUM_RCU_LVL_1 (NR_CPUS)
48 # define NUM_RCU_LVL_2 0
49 # define NUM_RCU_LVL_3 0
50 # define NUM_RCU_LVL_4 0
51 #elif NR_CPUS <= RCU_FANOUT_2
52 # define RCU_NUM_LVLS 2
53 # define NUM_RCU_LVL_0 1
54 # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
55 # define NUM_RCU_LVL_2 (NR_CPUS)
56 # define NUM_RCU_LVL_3 0
57 # define NUM_RCU_LVL_4 0
58 #elif NR_CPUS <= RCU_FANOUT_3
59 # define RCU_NUM_LVLS 3
60 # define NUM_RCU_LVL_0 1
61 # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
62 # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
63 # define NUM_RCU_LVL_3 (NR_CPUS)
64 # define NUM_RCU_LVL_4 0
65 #elif NR_CPUS <= RCU_FANOUT_4
66 # define RCU_NUM_LVLS 4
67 # define NUM_RCU_LVL_0 1
68 # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3)
69 # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
70 # define NUM_RCU_LVL_3 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
71 # define NUM_RCU_LVL_4 (NR_CPUS)
72 #else
73 # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS"
74 #endif /* #if (NR_CPUS) <= RCU_FANOUT_1 */
75
76 #define RCU_SUM (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2 + NUM_RCU_LVL_3 + NUM_RCU_LVL_4)
77 #define NUM_RCU_NODES (RCU_SUM - NR_CPUS)
78
79 extern int rcu_num_lvls;
80 extern int rcu_num_nodes;
81
82 /*
83 * Dynticks per-CPU state.
84 */
85 struct rcu_dynticks {
86 long long dynticks_nesting; /* Track irq/process nesting level. */
87 /* Process level is worth LLONG_MAX/2. */
88 int dynticks_nmi_nesting; /* Track NMI nesting level. */
89 atomic_t dynticks; /* Even value for idle, else odd. */
90 #ifdef CONFIG_RCU_FAST_NO_HZ
91 int dyntick_drain; /* Prepare-for-idle state variable. */
92 unsigned long dyntick_holdoff;
93 /* No retries for the jiffy of failure. */
94 struct timer_list idle_gp_timer;
95 /* Wake up CPU sleeping with callbacks. */
96 unsigned long idle_gp_timer_expires;
97 /* When to wake up CPU (for repost). */
98 bool idle_first_pass; /* First pass of attempt to go idle? */
99 unsigned long nonlazy_posted;
100 /* # times non-lazy CBs posted to CPU. */
101 unsigned long nonlazy_posted_snap;
102 /* idle-period nonlazy_posted snapshot. */
103 #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
104 };
105
106 /* RCU's kthread states for tracing. */
107 #define RCU_KTHREAD_STOPPED 0
108 #define RCU_KTHREAD_RUNNING 1
109 #define RCU_KTHREAD_WAITING 2
110 #define RCU_KTHREAD_OFFCPU 3
111 #define RCU_KTHREAD_YIELDING 4
112 #define RCU_KTHREAD_MAX 4
113
114 /*
115 * Definition for node within the RCU grace-period-detection hierarchy.
116 */
117 struct rcu_node {
118 raw_spinlock_t lock; /* Root rcu_node's lock protects some */
119 /* rcu_state fields as well as following. */
120 unsigned long gpnum; /* Current grace period for this node. */
121 /* This will either be equal to or one */
122 /* behind the root rcu_node's gpnum. */
123 unsigned long completed; /* Last GP completed for this node. */
124 /* This will either be equal to or one */
125 /* behind the root rcu_node's gpnum. */
126 unsigned long qsmask; /* CPUs or groups that need to switch in */
127 /* order for current grace period to proceed.*/
128 /* In leaf rcu_node, each bit corresponds to */
129 /* an rcu_data structure, otherwise, each */
130 /* bit corresponds to a child rcu_node */
131 /* structure. */
132 unsigned long expmask; /* Groups that have ->blkd_tasks */
133 /* elements that need to drain to allow the */
134 /* current expedited grace period to */
135 /* complete (only for TREE_PREEMPT_RCU). */
136 atomic_t wakemask; /* CPUs whose kthread needs to be awakened. */
137 /* Since this has meaning only for leaf */
138 /* rcu_node structures, 32 bits suffices. */
139 unsigned long qsmaskinit;
140 /* Per-GP initial value for qsmask & expmask. */
141 unsigned long grpmask; /* Mask to apply to parent qsmask. */
142 /* Only one bit will be set in this mask. */
143 int grplo; /* lowest-numbered CPU or group here. */
144 int grphi; /* highest-numbered CPU or group here. */
145 u8 grpnum; /* CPU/group number for next level up. */
146 u8 level; /* root is at level 0. */
147 struct rcu_node *parent;
148 struct list_head blkd_tasks;
149 /* Tasks blocked in RCU read-side critical */
150 /* section. Tasks are placed at the head */
151 /* of this list and age towards the tail. */
152 struct list_head *gp_tasks;
153 /* Pointer to the first task blocking the */
154 /* current grace period, or NULL if there */
155 /* is no such task. */
156 struct list_head *exp_tasks;
157 /* Pointer to the first task blocking the */
158 /* current expedited grace period, or NULL */
159 /* if there is no such task. If there */
160 /* is no current expedited grace period, */
161 /* then there can cannot be any such task. */
162 #ifdef CONFIG_RCU_BOOST
163 struct list_head *boost_tasks;
164 /* Pointer to first task that needs to be */
165 /* priority boosted, or NULL if no priority */
166 /* boosting is needed for this rcu_node */
167 /* structure. If there are no tasks */
168 /* queued on this rcu_node structure that */
169 /* are blocking the current grace period, */
170 /* there can be no such task. */
171 unsigned long boost_time;
172 /* When to start boosting (jiffies). */
173 struct task_struct *boost_kthread_task;
174 /* kthread that takes care of priority */
175 /* boosting for this rcu_node structure. */
176 unsigned int boost_kthread_status;
177 /* State of boost_kthread_task for tracing. */
178 unsigned long n_tasks_boosted;
179 /* Total number of tasks boosted. */
180 unsigned long n_exp_boosts;
181 /* Number of tasks boosted for expedited GP. */
182 unsigned long n_normal_boosts;
183 /* Number of tasks boosted for normal GP. */
184 unsigned long n_balk_blkd_tasks;
185 /* Refused to boost: no blocked tasks. */
186 unsigned long n_balk_exp_gp_tasks;
187 /* Refused to boost: nothing blocking GP. */
188 unsigned long n_balk_boost_tasks;
189 /* Refused to boost: already boosting. */
190 unsigned long n_balk_notblocked;
191 /* Refused to boost: RCU RS CS still running. */
192 unsigned long n_balk_notyet;
193 /* Refused to boost: not yet time. */
194 unsigned long n_balk_nos;
195 /* Refused to boost: not sure why, though. */
196 /* This can happen due to race conditions. */
197 #endif /* #ifdef CONFIG_RCU_BOOST */
198 struct task_struct *node_kthread_task;
199 /* kthread that takes care of this rcu_node */
200 /* structure, for example, awakening the */
201 /* per-CPU kthreads as needed. */
202 unsigned int node_kthread_status;
203 /* State of node_kthread_task for tracing. */
204 } ____cacheline_internodealigned_in_smp;
205
206 /*
207 * Do a full breadth-first scan of the rcu_node structures for the
208 * specified rcu_state structure.
209 */
210 #define rcu_for_each_node_breadth_first(rsp, rnp) \
211 for ((rnp) = &(rsp)->node[0]; \
212 (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
213
214 /*
215 * Do a breadth-first scan of the non-leaf rcu_node structures for the
216 * specified rcu_state structure. Note that if there is a singleton
217 * rcu_node tree with but one rcu_node structure, this loop is a no-op.
218 */
219 #define rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) \
220 for ((rnp) = &(rsp)->node[0]; \
221 (rnp) < (rsp)->level[rcu_num_lvls - 1]; (rnp)++)
222
223 /*
224 * Scan the leaves of the rcu_node hierarchy for the specified rcu_state
225 * structure. Note that if there is a singleton rcu_node tree with but
226 * one rcu_node structure, this loop -will- visit the rcu_node structure.
227 * It is still a leaf node, even if it is also the root node.
228 */
229 #define rcu_for_each_leaf_node(rsp, rnp) \
230 for ((rnp) = (rsp)->level[rcu_num_lvls - 1]; \
231 (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
232
233 /* Index values for nxttail array in struct rcu_data. */
234 #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */
235 #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */
236 #define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */
237 #define RCU_NEXT_TAIL 3
238 #define RCU_NEXT_SIZE 4
239
240 /* Per-CPU data for read-copy update. */
241 struct rcu_data {
242 /* 1) quiescent-state and grace-period handling : */
243 unsigned long completed; /* Track rsp->completed gp number */
244 /* in order to detect GP end. */
245 unsigned long gpnum; /* Highest gp number that this CPU */
246 /* is aware of having started. */
247 unsigned long passed_quiesce_gpnum;
248 /* gpnum at time of quiescent state. */
249 bool passed_quiesce; /* User-mode/idle loop etc. */
250 bool qs_pending; /* Core waits for quiesc state. */
251 bool beenonline; /* CPU online at least once. */
252 bool preemptible; /* Preemptible RCU? */
253 struct rcu_node *mynode; /* This CPU's leaf of hierarchy */
254 unsigned long grpmask; /* Mask to apply to leaf qsmask. */
255 #ifdef CONFIG_RCU_CPU_STALL_INFO
256 unsigned long ticks_this_gp; /* The number of scheduling-clock */
257 /* ticks this CPU has handled */
258 /* during and after the last grace */
259 /* period it is aware of. */
260 #endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */
261
262 /* 2) batch handling */
263 /*
264 * If nxtlist is not NULL, it is partitioned as follows.
265 * Any of the partitions might be empty, in which case the
266 * pointer to that partition will be equal to the pointer for
267 * the following partition. When the list is empty, all of
268 * the nxttail elements point to the ->nxtlist pointer itself,
269 * which in that case is NULL.
270 *
271 * [nxtlist, *nxttail[RCU_DONE_TAIL]):
272 * Entries that batch # <= ->completed
273 * The grace period for these entries has completed, and
274 * the other grace-period-completed entries may be moved
275 * here temporarily in rcu_process_callbacks().
276 * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]):
277 * Entries that batch # <= ->completed - 1: waiting for current GP
278 * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]):
279 * Entries known to have arrived before current GP ended
280 * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]):
281 * Entries that might have arrived after current GP ended
282 * Note that the value of *nxttail[RCU_NEXT_TAIL] will
283 * always be NULL, as this is the end of the list.
284 */
285 struct rcu_head *nxtlist;
286 struct rcu_head **nxttail[RCU_NEXT_SIZE];
287 long qlen_lazy; /* # of lazy queued callbacks */
288 long qlen; /* # of queued callbacks, incl lazy */
289 long qlen_last_fqs_check;
290 /* qlen at last check for QS forcing */
291 unsigned long n_cbs_invoked; /* count of RCU cbs invoked. */
292 unsigned long n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */
293 unsigned long n_cbs_adopted; /* RCU cbs adopted from dying CPU */
294 unsigned long n_force_qs_snap;
295 /* did other CPU force QS recently? */
296 long blimit; /* Upper limit on a processed batch */
297
298 /* 3) dynticks interface. */
299 struct rcu_dynticks *dynticks; /* Shared per-CPU dynticks state. */
300 int dynticks_snap; /* Per-GP tracking for dynticks. */
301
302 /* 4) reasons this CPU needed to be kicked by force_quiescent_state */
303 unsigned long dynticks_fqs; /* Kicked due to dynticks idle. */
304 unsigned long offline_fqs; /* Kicked due to being offline. */
305
306 /* 5) __rcu_pending() statistics. */
307 unsigned long n_rcu_pending; /* rcu_pending() calls since boot. */
308 unsigned long n_rp_qs_pending;
309 unsigned long n_rp_report_qs;
310 unsigned long n_rp_cb_ready;
311 unsigned long n_rp_cpu_needs_gp;
312 unsigned long n_rp_gp_completed;
313 unsigned long n_rp_gp_started;
314 unsigned long n_rp_need_fqs;
315 unsigned long n_rp_need_nothing;
316
317 /* 6) _rcu_barrier() callback. */
318 struct rcu_head barrier_head;
319
320 int cpu;
321 struct rcu_state *rsp;
322 };
323
324 /* Values for fqs_state field in struct rcu_state. */
325 #define RCU_GP_IDLE 0 /* No grace period in progress. */
326 #define RCU_GP_INIT 1 /* Grace period being initialized. */
327 #define RCU_SAVE_DYNTICK 2 /* Need to scan dyntick state. */
328 #define RCU_FORCE_QS 3 /* Need to force quiescent state. */
329 #define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK
330
331 #define RCU_JIFFIES_TILL_FORCE_QS 3 /* for rsp->jiffies_force_qs */
332
333 #ifdef CONFIG_PROVE_RCU
334 #define RCU_STALL_DELAY_DELTA (5 * HZ)
335 #else
336 #define RCU_STALL_DELAY_DELTA 0
337 #endif
338 #define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time */
339 /* to take at least one */
340 /* scheduling clock irq */
341 /* before ratting on them. */
342
343 #define rcu_wait(cond) \
344 do { \
345 for (;;) { \
346 set_current_state(TASK_INTERRUPTIBLE); \
347 if (cond) \
348 break; \
349 schedule(); \
350 } \
351 __set_current_state(TASK_RUNNING); \
352 } while (0)
353
354 /*
355 * RCU global state, including node hierarchy. This hierarchy is
356 * represented in "heap" form in a dense array. The root (first level)
357 * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
358 * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
359 * and the third level in ->node[m+1] and following (->node[m+1] referenced
360 * by ->level[2]). The number of levels is determined by the number of
361 * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy"
362 * consisting of a single rcu_node.
363 */
364 struct rcu_state {
365 struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */
366 struct rcu_node *level[RCU_NUM_LVLS]; /* Hierarchy levels. */
367 u32 levelcnt[MAX_RCU_LVLS + 1]; /* # nodes in each level. */
368 u8 levelspread[RCU_NUM_LVLS]; /* kids/node in each level. */
369 struct rcu_data __percpu *rda; /* pointer of percu rcu_data. */
370 void (*call)(struct rcu_head *head, /* call_rcu() flavor. */
371 void (*func)(struct rcu_head *head));
372
373 /* The following fields are guarded by the root rcu_node's lock. */
374
375 u8 fqs_state ____cacheline_internodealigned_in_smp;
376 /* Force QS state. */
377 u8 fqs_active; /* force_quiescent_state() */
378 /* is running. */
379 u8 fqs_need_gp; /* A CPU was prevented from */
380 /* starting a new grace */
381 /* period because */
382 /* force_quiescent_state() */
383 /* was running. */
384 u8 boost; /* Subject to priority boost. */
385 unsigned long gpnum; /* Current gp number. */
386 unsigned long completed; /* # of last completed gp. */
387
388 /* End of fields guarded by root rcu_node's lock. */
389
390 raw_spinlock_t onofflock; /* exclude on/offline and */
391 /* starting new GP. */
392 struct rcu_head *orphan_nxtlist; /* Orphaned callbacks that */
393 /* need a grace period. */
394 struct rcu_head **orphan_nxttail; /* Tail of above. */
395 struct rcu_head *orphan_donelist; /* Orphaned callbacks that */
396 /* are ready to invoke. */
397 struct rcu_head **orphan_donetail; /* Tail of above. */
398 long qlen_lazy; /* Number of lazy callbacks. */
399 long qlen; /* Total number of callbacks. */
400 struct task_struct *rcu_barrier_in_progress;
401 /* Task doing rcu_barrier(), */
402 /* or NULL if no barrier. */
403 atomic_t barrier_cpu_count; /* # CPUs waiting on. */
404 struct completion barrier_completion; /* Wake at barrier end. */
405 raw_spinlock_t fqslock; /* Only one task forcing */
406 /* quiescent states. */
407 unsigned long jiffies_force_qs; /* Time at which to invoke */
408 /* force_quiescent_state(). */
409 unsigned long n_force_qs; /* Number of calls to */
410 /* force_quiescent_state(). */
411 unsigned long n_force_qs_lh; /* ~Number of calls leaving */
412 /* due to lock unavailable. */
413 unsigned long n_force_qs_ngp; /* Number of calls leaving */
414 /* due to no GP active. */
415 unsigned long gp_start; /* Time at which GP started, */
416 /* but in jiffies. */
417 unsigned long jiffies_stall; /* Time at which to check */
418 /* for CPU stalls. */
419 unsigned long gp_max; /* Maximum GP duration in */
420 /* jiffies. */
421 char *name; /* Name of structure. */
422 };
423
424 /* Return values for rcu_preempt_offline_tasks(). */
425
426 #define RCU_OFL_TASKS_NORM_GP 0x1 /* Tasks blocking normal */
427 /* GP were moved to root. */
428 #define RCU_OFL_TASKS_EXP_GP 0x2 /* Tasks blocking expedited */
429 /* GP were moved to root. */
430
431 /*
432 * RCU implementation internal declarations:
433 */
434 extern struct rcu_state rcu_sched_state;
435 DECLARE_PER_CPU(struct rcu_data, rcu_sched_data);
436
437 extern struct rcu_state rcu_bh_state;
438 DECLARE_PER_CPU(struct rcu_data, rcu_bh_data);
439
440 #ifdef CONFIG_TREE_PREEMPT_RCU
441 extern struct rcu_state rcu_preempt_state;
442 DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data);
443 #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */
444
445 #ifdef CONFIG_RCU_BOOST
446 DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_status);
447 DECLARE_PER_CPU(int, rcu_cpu_kthread_cpu);
448 DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_loops);
449 DECLARE_PER_CPU(char, rcu_cpu_has_work);
450 #endif /* #ifdef CONFIG_RCU_BOOST */
451
452 #ifndef RCU_TREE_NONCORE
453
454 /* Forward declarations for rcutree_plugin.h */
455 static void rcu_bootup_announce(void);
456 long rcu_batches_completed(void);
457 static void rcu_preempt_note_context_switch(int cpu);
458 static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
459 #ifdef CONFIG_HOTPLUG_CPU
460 static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp,
461 unsigned long flags);
462 static void rcu_stop_cpu_kthread(int cpu);
463 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
464 static void rcu_print_detail_task_stall(struct rcu_state *rsp);
465 static int rcu_print_task_stall(struct rcu_node *rnp);
466 static void rcu_preempt_stall_reset(void);
467 static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
468 #ifdef CONFIG_HOTPLUG_CPU
469 static int rcu_preempt_offline_tasks(struct rcu_state *rsp,
470 struct rcu_node *rnp,
471 struct rcu_data *rdp);
472 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
473 static void rcu_preempt_cleanup_dead_cpu(int cpu);
474 static void rcu_preempt_check_callbacks(int cpu);
475 static void rcu_preempt_process_callbacks(void);
476 void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu));
477 #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU)
478 static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp,
479 bool wake);
480 #endif /* #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU) */
481 static int rcu_preempt_pending(int cpu);
482 static int rcu_preempt_cpu_has_callbacks(int cpu);
483 static void __cpuinit rcu_preempt_init_percpu_data(int cpu);
484 static void rcu_preempt_cleanup_dying_cpu(void);
485 static void __init __rcu_init_preempt(void);
486 static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags);
487 static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
488 static void invoke_rcu_callbacks_kthread(void);
489 static bool rcu_is_callbacks_kthread(void);
490 #ifdef CONFIG_RCU_BOOST
491 static void rcu_preempt_do_callbacks(void);
492 static void rcu_boost_kthread_setaffinity(struct rcu_node *rnp,
493 cpumask_var_t cm);
494 static int __cpuinit rcu_spawn_one_boost_kthread(struct rcu_state *rsp,
495 struct rcu_node *rnp,
496 int rnp_index);
497 static void invoke_rcu_node_kthread(struct rcu_node *rnp);
498 static void rcu_yield(void (*f)(unsigned long), unsigned long arg);
499 #endif /* #ifdef CONFIG_RCU_BOOST */
500 static void rcu_cpu_kthread_setrt(int cpu, int to_rt);
501 static void __cpuinit rcu_prepare_kthreads(int cpu);
502 static void rcu_prepare_for_idle_init(int cpu);
503 static void rcu_cleanup_after_idle(int cpu);
504 static void rcu_prepare_for_idle(int cpu);
505 static void rcu_idle_count_callbacks_posted(void);
506 static void print_cpu_stall_info_begin(void);
507 static void print_cpu_stall_info(struct rcu_state *rsp, int cpu);
508 static void print_cpu_stall_info_end(void);
509 static void zero_cpu_stall_ticks(struct rcu_data *rdp);
510 static void increment_cpu_stall_ticks(void);
511
512 #endif /* #ifndef RCU_TREE_NONCORE */
This page took 0.041229 seconds and 5 git commands to generate.