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 and CONFIG_RCU_FANOUT.
  33  * In theory, it should be possible to add more levels straightforwardly.
  34  * In practice, this did work well going from three levels to four.
  35  * Of course, your mileage may vary.
  36  */
  37 #define MAX_RCU_LVLS 4
  38 #if CONFIG_RCU_FANOUT > 16
  39 #define RCU_FANOUT_LEAF       16
  40 #else /* #if CONFIG_RCU_FANOUT > 16 */
  41 #define RCU_FANOUT_LEAF       (CONFIG_RCU_FANOUT)
  42 #endif /* #else #if CONFIG_RCU_FANOUT > 16 */
  43 #define RCU_FANOUT_1          (RCU_FANOUT_LEAF)
  44 #define RCU_FANOUT_2          (RCU_FANOUT_1 * CONFIG_RCU_FANOUT)
  45 #define RCU_FANOUT_3          (RCU_FANOUT_2 * CONFIG_RCU_FANOUT)
  46 #define RCU_FANOUT_4          (RCU_FANOUT_3 * CONFIG_RCU_FANOUT)
  47
  48 #if NR_CPUS <= RCU_FANOUT_1
  49 #  define NUM_RCU_LVLS        1
  50 #  define NUM_RCU_LVL_0       1
  51 #  define NUM_RCU_LVL_1       (NR_CPUS)
  52 #  define NUM_RCU_LVL_2       0
  53 #  define NUM_RCU_LVL_3       0
  54 #  define NUM_RCU_LVL_4       0
  55 #elif NR_CPUS <= RCU_FANOUT_2
  56 #  define NUM_RCU_LVLS        2
  57 #  define NUM_RCU_LVL_0       1
  58 #  define NUM_RCU_LVL_1       DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
  59 #  define NUM_RCU_LVL_2       (NR_CPUS)
  60 #  define NUM_RCU_LVL_3       0
  61 #  define NUM_RCU_LVL_4       0
  62 #elif NR_CPUS <= RCU_FANOUT_3
  63 #  define NUM_RCU_LVLS        3
  64 #  define NUM_RCU_LVL_0       1
  65 #  define NUM_RCU_LVL_1       DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
  66 #  define NUM_RCU_LVL_2       DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
  67 #  define NUM_RCU_LVL_3       (NR_CPUS)
  68 #  define NUM_RCU_LVL_4       0
  69 #elif NR_CPUS <= RCU_FANOUT_4
  70 #  define NUM_RCU_LVLS        4
  71 #  define NUM_RCU_LVL_0       1
  72 #  define NUM_RCU_LVL_1       DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3)
  73 #  define NUM_RCU_LVL_2       DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
  74 #  define NUM_RCU_LVL_3       DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
  75 #  define NUM_RCU_LVL_4       (NR_CPUS)
  76 #else
  77 # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS"
  78 #endif /* #if (NR_CPUS) <= RCU_FANOUT_1 */
  79
  80 #define RCU_SUM (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2 + NUM_RCU_LVL_3 + NUM_RCU_LVL_4)
  81 #define NUM_RCU_NODES (RCU_SUM - NR_CPUS)
  82
  83 /*
  84  * Dynticks per-CPU state.
  85  */
  86 struct rcu_dynticks {
  87         int dynticks_nesting;   /* Track irq/process nesting level. */
  88         int dynticks_nmi_nesting; /* Track NMI nesting level. */
  89         atomic_t dynticks;      /* Even value for dynticks-idle, else odd. */
  90 };
  91
  92 /*
  93  * Definition for node within the RCU grace-period-detection hierarchy.
  94  */
  95 struct rcu_node {
  96         raw_spinlock_t lock;    /* Root rcu_node's lock protects some */
  97                                 /*  rcu_state fields as well as following. */
  98         unsigned long gpnum;    /* Current grace period for this node. */
  99                                 /*  This will either be equal to or one */
 100                                 /*  behind the root rcu_node's gpnum. */
 101         unsigned long completed; /* Last GP completed for this node. */
 102                                 /*  This will either be equal to or one */
 103                                 /*  behind the root rcu_node's gpnum. */
 104         unsigned long qsmask;   /* CPUs or groups that need to switch in */
 105                                 /*  order for current grace period to proceed.*/
 106                                 /*  In leaf rcu_node, each bit corresponds to */
 107                                 /*  an rcu_data structure, otherwise, each */
 108                                 /*  bit corresponds to a child rcu_node */
 109                                 /*  structure. */
 110         unsigned long expmask;  /* Groups that have ->blkd_tasks */
 111                                 /*  elements that need to drain to allow the */
 112                                 /*  current expedited grace period to */
 113                                 /*  complete (only for TREE_PREEMPT_RCU). */
 114         unsigned long wakemask; /* CPUs whose kthread needs to be awakened. */
 115         unsigned long qsmaskinit;
 116                                 /* Per-GP initial value for qsmask & expmask. */
 117         unsigned long grpmask;  /* Mask to apply to parent qsmask. */
 118                                 /*  Only one bit will be set in this mask. */
 119         int     grplo;          /* lowest-numbered CPU or group here. */
 120         int     grphi;          /* highest-numbered CPU or group here. */
 121         u8      grpnum;         /* CPU/group number for next level up. */
 122         u8      level;          /* root is at level 0. */
 123         struct rcu_node *parent;
 124         struct list_head blkd_tasks;
 125                                 /* Tasks blocked in RCU read-side critical */
 126                                 /*  section.  Tasks are placed at the head */
 127                                 /*  of this list and age towards the tail. */
 128         struct list_head *gp_tasks;
 129                                 /* Pointer to the first task blocking the */
 130                                 /*  current grace period, or NULL if there */
 131                                 /*  is no such task. */
 132         struct list_head *exp_tasks;
 133                                 /* Pointer to the first task blocking the */
 134                                 /*  current expedited grace period, or NULL */
 135                                 /*  if there is no such task.  If there */
 136                                 /*  is no current expedited grace period, */
 137                                 /*  then there can cannot be any such task. */
 138 #ifdef CONFIG_RCU_BOOST
 139         struct list_head *boost_tasks;
 140                                 /* Pointer to first task that needs to be */
 141                                 /*  priority boosted, or NULL if no priority */
 142                                 /*  boosting is needed for this rcu_node */
 143                                 /*  structure.  If there are no tasks */
 144                                 /*  queued on this rcu_node structure that */
 145                                 /*  are blocking the current grace period, */
 146                                 /*  there can be no such task. */
 147         unsigned long boost_time;
 148                                 /* When to start boosting (jiffies). */
 149         struct task_struct *boost_kthread_task;
 150                                 /* kthread that takes care of priority */
 151                                 /*  boosting for this rcu_node structure. */
 152         wait_queue_head_t boost_wq;
 153                                 /* Wait queue on which to park the boost */
 154                                 /*  kthread. */
 155         unsigned long n_tasks_boosted;
 156                                 /* Total number of tasks boosted. */
 157         unsigned long n_exp_boosts;
 158                                 /* Number of tasks boosted for expedited GP. */
 159         unsigned long n_normal_boosts;
 160                                 /* Number of tasks boosted for normal GP. */
 161         unsigned long n_balk_blkd_tasks;
 162                                 /* Refused to boost: no blocked tasks. */
 163         unsigned long n_balk_exp_gp_tasks;
 164                                 /* Refused to boost: nothing blocking GP. */
 165         unsigned long n_balk_boost_tasks;
 166                                 /* Refused to boost: already boosting. */
 167         unsigned long n_balk_notblocked;
 168                                 /* Refused to boost: RCU RS CS still running. */
 169         unsigned long n_balk_notyet;
 170                                 /* Refused to boost: not yet time. */
 171         unsigned long n_balk_nos;
 172                                 /* Refused to boost: not sure why, though. */
 173                                 /*  This can happen due to race conditions. */
 174 #endif /* #ifdef CONFIG_RCU_BOOST */
 175         struct task_struct *node_kthread_task;
 176                                 /* kthread that takes care of this rcu_node */
 177                                 /*  structure, for example, awakening the */
 178                                 /*  per-CPU kthreads as needed. */
 179         wait_queue_head_t node_wq;
 180                                 /* Wait queue on which to park the per-node */
 181                                 /*  kthread. */
 182 } ____cacheline_internodealigned_in_smp;
 183
 184 /*
 185  * Do a full breadth-first scan of the rcu_node structures for the
 186  * specified rcu_state structure.
 187  */
 188 #define rcu_for_each_node_breadth_first(rsp, rnp) \
 189         for ((rnp) = &(rsp)->node[0]; \
 190              (rnp) < &(rsp)->node[NUM_RCU_NODES]; (rnp)++)
 191
 192 /*
 193  * Do a breadth-first scan of the non-leaf rcu_node structures for the
 194  * specified rcu_state structure.  Note that if there is a singleton
 195  * rcu_node tree with but one rcu_node structure, this loop is a no-op.
 196  */
 197 #define rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) \
 198         for ((rnp) = &(rsp)->node[0]; \
 199              (rnp) < (rsp)->level[NUM_RCU_LVLS - 1]; (rnp)++)
 200
 201 /*
 202  * Scan the leaves of the rcu_node hierarchy for the specified rcu_state
 203  * structure.  Note that if there is a singleton rcu_node tree with but
 204  * one rcu_node structure, this loop -will- visit the rcu_node structure.
 205  * It is still a leaf node, even if it is also the root node.
 206  */
 207 #define rcu_for_each_leaf_node(rsp, rnp) \
 208         for ((rnp) = (rsp)->level[NUM_RCU_LVLS - 1]; \
 209              (rnp) < &(rsp)->node[NUM_RCU_NODES]; (rnp)++)
 210
 211 /* Index values for nxttail array in struct rcu_data. */
 212 #define RCU_DONE_TAIL           0       /* Also RCU_WAIT head. */
 213 #define RCU_WAIT_TAIL           1       /* Also RCU_NEXT_READY head. */
 214 #define RCU_NEXT_READY_TAIL     2       /* Also RCU_NEXT head. */
 215 #define RCU_NEXT_TAIL           3
 216 #define RCU_NEXT_SIZE           4
 217
 218 /* Per-CPU data for read-copy update. */
 219 struct rcu_data {
 220         /* 1) quiescent-state and grace-period handling : */
 221         unsigned long   completed;      /* Track rsp->completed gp number */
 222                                         /*  in order to detect GP end. */
 223         unsigned long   gpnum;          /* Highest gp number that this CPU */
 224                                         /*  is aware of having started. */
 225         unsigned long   passed_quiesc_completed;
 226                                         /* Value of completed at time of qs. */
 227         bool            passed_quiesc;  /* User-mode/idle loop etc. */
 228         bool            qs_pending;     /* Core waits for quiesc state. */
 229         bool            beenonline;     /* CPU online at least once. */
 230         bool            preemptable;    /* Preemptable RCU? */
 231         struct rcu_node *mynode;        /* This CPU's leaf of hierarchy */
 232         unsigned long grpmask;          /* Mask to apply to leaf qsmask. */
 233
 234         /* 2) batch handling */
 235         /*
 236          * If nxtlist is not NULL, it is partitioned as follows.
 237          * Any of the partitions might be empty, in which case the
 238          * pointer to that partition will be equal to the pointer for
 239          * the following partition.  When the list is empty, all of
 240          * the nxttail elements point to the ->nxtlist pointer itself,
 241          * which in that case is NULL.
 242          *
 243          * [nxtlist, *nxttail[RCU_DONE_TAIL]):
 244          *      Entries that batch # <= ->completed
 245          *      The grace period for these entries has completed, and
 246          *      the other grace-period-completed entries may be moved
 247          *      here temporarily in rcu_process_callbacks().
 248          * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]):
 249          *      Entries that batch # <= ->completed - 1: waiting for current GP
 250          * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]):
 251          *      Entries known to have arrived before current GP ended
 252          * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]):
 253          *      Entries that might have arrived after current GP ended
 254          *      Note that the value of *nxttail[RCU_NEXT_TAIL] will
 255          *      always be NULL, as this is the end of the list.
 256          */
 257         struct rcu_head *nxtlist;
 258         struct rcu_head **nxttail[RCU_NEXT_SIZE];
 259         long            qlen;           /* # of queued callbacks */
 260         long            qlen_last_fqs_check;
 261                                         /* qlen at last check for QS forcing */
 262         unsigned long   n_cbs_invoked;  /* count of RCU cbs invoked. */
 263         unsigned long   n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */
 264         unsigned long   n_cbs_adopted;  /* RCU cbs adopted from dying CPU */
 265         unsigned long   n_force_qs_snap;
 266                                         /* did other CPU force QS recently? */
 267         long            blimit;         /* Upper limit on a processed batch */
 268
 269 #ifdef CONFIG_NO_HZ
 270         /* 3) dynticks interface. */
 271         struct rcu_dynticks *dynticks;  /* Shared per-CPU dynticks state. */
 272         int dynticks_snap;              /* Per-GP tracking for dynticks. */
 273 #endif /* #ifdef CONFIG_NO_HZ */
 274
 275         /* 4) reasons this CPU needed to be kicked by force_quiescent_state */
 276 #ifdef CONFIG_NO_HZ
 277         unsigned long dynticks_fqs;     /* Kicked due to dynticks idle. */
 278 #endif /* #ifdef CONFIG_NO_HZ */
 279         unsigned long offline_fqs;      /* Kicked due to being offline. */
 280         unsigned long resched_ipi;      /* Sent a resched IPI. */
 281
 282         /* 5) __rcu_pending() statistics. */
 283         unsigned long n_rcu_pending;    /* rcu_pending() calls since boot. */
 284         unsigned long n_rp_qs_pending;
 285         unsigned long n_rp_report_qs;
 286         unsigned long n_rp_cb_ready;
 287         unsigned long n_rp_cpu_needs_gp;
 288         unsigned long n_rp_gp_completed;
 289         unsigned long n_rp_gp_started;
 290         unsigned long n_rp_need_fqs;
 291         unsigned long n_rp_need_nothing;
 292
 293         int cpu;
 294 };
 295
 296 /* Values for signaled field in struct rcu_state. */
 297 #define RCU_GP_IDLE             0       /* No grace period in progress. */
 298 #define RCU_GP_INIT             1       /* Grace period being initialized. */
 299 #define RCU_SAVE_DYNTICK        2       /* Need to scan dyntick state. */
 300 #define RCU_FORCE_QS            3       /* Need to force quiescent state. */
 301 #ifdef CONFIG_NO_HZ
 302 #define RCU_SIGNAL_INIT         RCU_SAVE_DYNTICK
 303 #else /* #ifdef CONFIG_NO_HZ */
 304 #define RCU_SIGNAL_INIT         RCU_FORCE_QS
 305 #endif /* #else #ifdef CONFIG_NO_HZ */
 306
 307 #define RCU_JIFFIES_TILL_FORCE_QS        3      /* for rsp->jiffies_force_qs */
 308
 309 #ifdef CONFIG_PROVE_RCU
 310 #define RCU_STALL_DELAY_DELTA          (5 * HZ)
 311 #else
 312 #define RCU_STALL_DELAY_DELTA          0
 313 #endif
 314
 315 #define RCU_SECONDS_TILL_STALL_CHECK   (CONFIG_RCU_CPU_STALL_TIMEOUT * HZ + \
 316                                         RCU_STALL_DELAY_DELTA)
 317                                                 /* for rsp->jiffies_stall */
 318 #define RCU_SECONDS_TILL_STALL_RECHECK (3 * RCU_SECONDS_TILL_STALL_CHECK + 30)
 319                                                 /* for rsp->jiffies_stall */
 320 #define RCU_STALL_RAT_DELAY             2       /* Allow other CPUs time */
 321                                                 /*  to take at least one */
 322                                                 /*  scheduling clock irq */
 323                                                 /*  before ratting on them. */
 324
 325
 326 /*
 327  * RCU global state, including node hierarchy.  This hierarchy is
 328  * represented in "heap" form in a dense array.  The root (first level)
 329  * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
 330  * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
 331  * and the third level in ->node[m+1] and following (->node[m+1] referenced
 332  * by ->level[2]).  The number of levels is determined by the number of
 333  * CPUs and by CONFIG_RCU_FANOUT.  Small systems will have a "hierarchy"
 334  * consisting of a single rcu_node.
 335  */
 336 struct rcu_state {
 337         struct rcu_node node[NUM_RCU_NODES];    /* Hierarchy. */
 338         struct rcu_node *level[NUM_RCU_LVLS];   /* Hierarchy levels. */
 339         u32 levelcnt[MAX_RCU_LVLS + 1];         /* # nodes in each level. */
 340         u8 levelspread[NUM_RCU_LVLS];           /* kids/node in each level. */
 341         struct rcu_data __percpu *rda;          /* pointer of percu rcu_data. */
 342
 343         /* The following fields are guarded by the root rcu_node's lock. */
 344
 345         u8      signaled ____cacheline_internodealigned_in_smp;
 346                                                 /* Force QS state. */
 347         u8      fqs_active;                     /* force_quiescent_state() */
 348                                                 /*  is running. */
 349         u8      fqs_need_gp;                    /* A CPU was prevented from */
 350                                                 /*  starting a new grace */
 351                                                 /*  period because */
 352                                                 /*  force_quiescent_state() */
 353                                                 /*  was running. */
 354         unsigned long gpnum;                    /* Current gp number. */
 355         unsigned long completed;                /* # of last completed gp. */
 356
 357         /* End of fields guarded by root rcu_node's lock. */
 358
 359         raw_spinlock_t onofflock;               /* exclude on/offline and */
 360                                                 /*  starting new GP. */
 361         raw_spinlock_t fqslock;                 /* Only one task forcing */
 362                                                 /*  quiescent states. */
 363         unsigned long jiffies_force_qs;         /* Time at which to invoke */
 364                                                 /*  force_quiescent_state(). */
 365         unsigned long n_force_qs;               /* Number of calls to */
 366                                                 /*  force_quiescent_state(). */
 367         unsigned long n_force_qs_lh;            /* ~Number of calls leaving */
 368                                                 /*  due to lock unavailable. */
 369         unsigned long n_force_qs_ngp;           /* Number of calls leaving */
 370                                                 /*  due to no GP active. */
 371         unsigned long gp_start;                 /* Time at which GP started, */
 372                                                 /*  but in jiffies. */
 373         unsigned long jiffies_stall;            /* Time at which to check */
 374                                                 /*  for CPU stalls. */
 375         char *name;                             /* Name of structure. */
 376 };
 377
 378 /* Return values for rcu_preempt_offline_tasks(). */
 379
 380 #define RCU_OFL_TASKS_NORM_GP   0x1             /* Tasks blocking normal */
 381                                                 /*  GP were moved to root. */
 382 #define RCU_OFL_TASKS_EXP_GP    0x2             /* Tasks blocking expedited */
 383                                                 /*  GP were moved to root. */
 384
 385 /*
 386  * RCU implementation internal declarations:
 387  */
 388 extern struct rcu_state rcu_sched_state;
 389 DECLARE_PER_CPU(struct rcu_data, rcu_sched_data);
 390
 391 extern struct rcu_state rcu_bh_state;
 392 DECLARE_PER_CPU(struct rcu_data, rcu_bh_data);
 393
 394 #ifdef CONFIG_TREE_PREEMPT_RCU
 395 extern struct rcu_state rcu_preempt_state;
 396 DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data);
 397 #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */
 398
 399 #ifndef RCU_TREE_NONCORE
 400
 401 /* Forward declarations for rcutree_plugin.h */
 402 static void rcu_bootup_announce(void);
 403 long rcu_batches_completed(void);
 404 static void rcu_preempt_note_context_switch(int cpu);
 405 static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
 406 #ifdef CONFIG_HOTPLUG_CPU
 407 static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp,
 408                                       unsigned long flags);
 409 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
 410 static void rcu_print_detail_task_stall(struct rcu_state *rsp);
 411 static void rcu_print_task_stall(struct rcu_node *rnp);
 412 static void rcu_preempt_stall_reset(void);
 413 static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
 414 #ifdef CONFIG_HOTPLUG_CPU
 415 static int rcu_preempt_offline_tasks(struct rcu_state *rsp,
 416                                      struct rcu_node *rnp,
 417                                      struct rcu_data *rdp);
 418 static void rcu_preempt_offline_cpu(int cpu);
 419 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
 420 static void rcu_preempt_check_callbacks(int cpu);
 421 static void rcu_preempt_process_callbacks(void);
 422 void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu));
 423 #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU)
 424 static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp);
 425 #endif /* #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU) */
 426 static int rcu_preempt_pending(int cpu);
 427 static int rcu_preempt_needs_cpu(int cpu);
 428 static void __cpuinit rcu_preempt_init_percpu_data(int cpu);
 429 static void rcu_preempt_send_cbs_to_online(void);
 430 static void __init __rcu_init_preempt(void);
 431 static void rcu_needs_cpu_flush(void);
 432 static void __init rcu_init_boost_waitqueue(struct rcu_node *rnp);
 433 static void rcu_initiate_boost(struct rcu_node *rnp);
 434 static void rcu_boost_kthread_setaffinity(struct rcu_node *rnp,
 435                                           cpumask_var_t cm);
 436 static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
 437 static int __cpuinit rcu_spawn_one_boost_kthread(struct rcu_state *rsp,
 438                                                  struct rcu_node *rnp,
 439                                                  int rnp_index);
 440 #ifdef CONFIG_HOTPLUG_CPU
 441 static void rcu_stop_boost_kthread(struct rcu_node *rnp);
 442 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
 443
 444 #endif /* #ifndef RCU_TREE_NONCORE */