diff options
Diffstat (limited to 'kernel/rcutree.h')
| -rw-r--r-- | kernel/rcutree.h | 97 |
1 files changed, 81 insertions, 16 deletions
diff --git a/kernel/rcutree.h b/kernel/rcutree.h index 8e8287a983c2..1899023b0962 100644 --- a/kernel/rcutree.h +++ b/kernel/rcutree.h | |||
| @@ -48,14 +48,14 @@ | |||
| 48 | #elif NR_CPUS <= RCU_FANOUT_SQ | 48 | #elif NR_CPUS <= RCU_FANOUT_SQ |
| 49 | # define NUM_RCU_LVLS 2 | 49 | # define NUM_RCU_LVLS 2 |
| 50 | # define NUM_RCU_LVL_0 1 | 50 | # define NUM_RCU_LVL_0 1 |
| 51 | # define NUM_RCU_LVL_1 (((NR_CPUS) + RCU_FANOUT - 1) / RCU_FANOUT) | 51 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT) |
| 52 | # define NUM_RCU_LVL_2 (NR_CPUS) | 52 | # define NUM_RCU_LVL_2 (NR_CPUS) |
| 53 | # define NUM_RCU_LVL_3 0 | 53 | # define NUM_RCU_LVL_3 0 |
| 54 | #elif NR_CPUS <= RCU_FANOUT_CUBE | 54 | #elif NR_CPUS <= RCU_FANOUT_CUBE |
| 55 | # define NUM_RCU_LVLS 3 | 55 | # define NUM_RCU_LVLS 3 |
| 56 | # define NUM_RCU_LVL_0 1 | 56 | # define NUM_RCU_LVL_0 1 |
| 57 | # define NUM_RCU_LVL_1 (((NR_CPUS) + RCU_FANOUT_SQ - 1) / RCU_FANOUT_SQ) | 57 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_SQ) |
| 58 | # define NUM_RCU_LVL_2 (((NR_CPUS) + (RCU_FANOUT) - 1) / (RCU_FANOUT)) | 58 | # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT) |
| 59 | # define NUM_RCU_LVL_3 NR_CPUS | 59 | # define NUM_RCU_LVL_3 NR_CPUS |
| 60 | #else | 60 | #else |
| 61 | # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS" | 61 | # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS" |
| @@ -79,15 +79,21 @@ struct rcu_dynticks { | |||
| 79 | * Definition for node within the RCU grace-period-detection hierarchy. | 79 | * Definition for node within the RCU grace-period-detection hierarchy. |
| 80 | */ | 80 | */ |
| 81 | struct rcu_node { | 81 | struct rcu_node { |
| 82 | spinlock_t lock; | 82 | spinlock_t lock; /* Root rcu_node's lock protects some */ |
| 83 | /* rcu_state fields as well as following. */ | ||
| 83 | long gpnum; /* Current grace period for this node. */ | 84 | long gpnum; /* Current grace period for this node. */ |
| 84 | /* This will either be equal to or one */ | 85 | /* This will either be equal to or one */ |
| 85 | /* behind the root rcu_node's gpnum. */ | 86 | /* behind the root rcu_node's gpnum. */ |
| 86 | unsigned long qsmask; /* CPUs or groups that need to switch in */ | 87 | unsigned long qsmask; /* CPUs or groups that need to switch in */ |
| 87 | /* order for current grace period to proceed.*/ | 88 | /* order for current grace period to proceed.*/ |
| 89 | /* In leaf rcu_node, each bit corresponds to */ | ||
| 90 | /* an rcu_data structure, otherwise, each */ | ||
| 91 | /* bit corresponds to a child rcu_node */ | ||
| 92 | /* structure. */ | ||
| 88 | unsigned long qsmaskinit; | 93 | unsigned long qsmaskinit; |
| 89 | /* Per-GP initialization for qsmask. */ | 94 | /* Per-GP initialization for qsmask. */ |
| 90 | unsigned long grpmask; /* Mask to apply to parent qsmask. */ | 95 | unsigned long grpmask; /* Mask to apply to parent qsmask. */ |
| 96 | /* Only one bit will be set in this mask. */ | ||
| 91 | int grplo; /* lowest-numbered CPU or group here. */ | 97 | int grplo; /* lowest-numbered CPU or group here. */ |
| 92 | int grphi; /* highest-numbered CPU or group here. */ | 98 | int grphi; /* highest-numbered CPU or group here. */ |
| 93 | u8 grpnum; /* CPU/group number for next level up. */ | 99 | u8 grpnum; /* CPU/group number for next level up. */ |
| @@ -95,8 +101,23 @@ struct rcu_node { | |||
| 95 | struct rcu_node *parent; | 101 | struct rcu_node *parent; |
| 96 | struct list_head blocked_tasks[2]; | 102 | struct list_head blocked_tasks[2]; |
| 97 | /* Tasks blocked in RCU read-side critsect. */ | 103 | /* Tasks blocked in RCU read-side critsect. */ |
| 104 | /* Grace period number (->gpnum) x blocked */ | ||
| 105 | /* by tasks on the (x & 0x1) element of the */ | ||
| 106 | /* blocked_tasks[] array. */ | ||
| 98 | } ____cacheline_internodealigned_in_smp; | 107 | } ____cacheline_internodealigned_in_smp; |
| 99 | 108 | ||
| 109 | /* | ||
| 110 | * Do a full breadth-first scan of the rcu_node structures for the | ||
| 111 | * specified rcu_state structure. | ||
| 112 | */ | ||
| 113 | #define rcu_for_each_node_breadth_first(rsp, rnp) \ | ||
| 114 | for ((rnp) = &(rsp)->node[0]; \ | ||
| 115 | (rnp) < &(rsp)->node[NUM_RCU_NODES]; (rnp)++) | ||
| 116 | |||
| 117 | #define rcu_for_each_leaf_node(rsp, rnp) \ | ||
| 118 | for ((rnp) = (rsp)->level[NUM_RCU_LVLS - 1]; \ | ||
| 119 | (rnp) < &(rsp)->node[NUM_RCU_NODES]; (rnp)++) | ||
| 120 | |||
| 100 | /* Index values for nxttail array in struct rcu_data. */ | 121 | /* Index values for nxttail array in struct rcu_data. */ |
| 101 | #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */ | 122 | #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */ |
| 102 | #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */ | 123 | #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */ |
| @@ -126,23 +147,30 @@ struct rcu_data { | |||
| 126 | * Any of the partitions might be empty, in which case the | 147 | * Any of the partitions might be empty, in which case the |
| 127 | * pointer to that partition will be equal to the pointer for | 148 | * pointer to that partition will be equal to the pointer for |
| 128 | * the following partition. When the list is empty, all of | 149 | * the following partition. When the list is empty, all of |
| 129 | * the nxttail elements point to nxtlist, which is NULL. | 150 | * the nxttail elements point to the ->nxtlist pointer itself, |
| 151 | * which in that case is NULL. | ||
| 130 | * | 152 | * |
| 131 | * [*nxttail[RCU_NEXT_READY_TAIL], NULL = *nxttail[RCU_NEXT_TAIL]): | ||
| 132 | * Entries that might have arrived after current GP ended | ||
| 133 | * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]): | ||
| 134 | * Entries known to have arrived before current GP ended | ||
| 135 | * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]): | ||
| 136 | * Entries that batch # <= ->completed - 1: waiting for current GP | ||
| 137 | * [nxtlist, *nxttail[RCU_DONE_TAIL]): | 153 | * [nxtlist, *nxttail[RCU_DONE_TAIL]): |
| 138 | * Entries that batch # <= ->completed | 154 | * Entries that batch # <= ->completed |
| 139 | * The grace period for these entries has completed, and | 155 | * The grace period for these entries has completed, and |
| 140 | * the other grace-period-completed entries may be moved | 156 | * the other grace-period-completed entries may be moved |
| 141 | * here temporarily in rcu_process_callbacks(). | 157 | * here temporarily in rcu_process_callbacks(). |
| 158 | * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]): | ||
| 159 | * Entries that batch # <= ->completed - 1: waiting for current GP | ||
| 160 | * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]): | ||
| 161 | * Entries known to have arrived before current GP ended | ||
| 162 | * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]): | ||
| 163 | * Entries that might have arrived after current GP ended | ||
| 164 | * Note that the value of *nxttail[RCU_NEXT_TAIL] will | ||
| 165 | * always be NULL, as this is the end of the list. | ||
| 142 | */ | 166 | */ |
| 143 | struct rcu_head *nxtlist; | 167 | struct rcu_head *nxtlist; |
| 144 | struct rcu_head **nxttail[RCU_NEXT_SIZE]; | 168 | struct rcu_head **nxttail[RCU_NEXT_SIZE]; |
| 145 | long qlen; /* # of queued callbacks */ | 169 | long qlen; /* # of queued callbacks */ |
| 170 | long qlen_last_fqs_check; | ||
| 171 | /* qlen at last check for QS forcing */ | ||
| 172 | unsigned long n_force_qs_snap; | ||
| 173 | /* did other CPU force QS recently? */ | ||
| 146 | long blimit; /* Upper limit on a processed batch */ | 174 | long blimit; /* Upper limit on a processed batch */ |
| 147 | 175 | ||
| 148 | #ifdef CONFIG_NO_HZ | 176 | #ifdef CONFIG_NO_HZ |
| @@ -173,9 +201,10 @@ struct rcu_data { | |||
| 173 | }; | 201 | }; |
| 174 | 202 | ||
| 175 | /* Values for signaled field in struct rcu_state. */ | 203 | /* Values for signaled field in struct rcu_state. */ |
| 176 | #define RCU_GP_INIT 0 /* Grace period being initialized. */ | 204 | #define RCU_GP_IDLE 0 /* No grace period in progress. */ |
| 177 | #define RCU_SAVE_DYNTICK 1 /* Need to scan dyntick state. */ | 205 | #define RCU_GP_INIT 1 /* Grace period being initialized. */ |
| 178 | #define RCU_FORCE_QS 2 /* Need to force quiescent state. */ | 206 | #define RCU_SAVE_DYNTICK 2 /* Need to scan dyntick state. */ |
| 207 | #define RCU_FORCE_QS 3 /* Need to force quiescent state. */ | ||
| 179 | #ifdef CONFIG_NO_HZ | 208 | #ifdef CONFIG_NO_HZ |
| 180 | #define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK | 209 | #define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK |
| 181 | #else /* #ifdef CONFIG_NO_HZ */ | 210 | #else /* #ifdef CONFIG_NO_HZ */ |
| @@ -216,8 +245,19 @@ struct rcu_state { | |||
| 216 | /* Force QS state. */ | 245 | /* Force QS state. */ |
| 217 | long gpnum; /* Current gp number. */ | 246 | long gpnum; /* Current gp number. */ |
| 218 | long completed; /* # of last completed gp. */ | 247 | long completed; /* # of last completed gp. */ |
| 248 | |||
| 249 | /* End of fields guarded by root rcu_node's lock. */ | ||
| 250 | |||
| 219 | spinlock_t onofflock; /* exclude on/offline and */ | 251 | spinlock_t onofflock; /* exclude on/offline and */ |
| 220 | /* starting new GP. */ | 252 | /* starting new GP. Also */ |
| 253 | /* protects the following */ | ||
| 254 | /* orphan_cbs fields. */ | ||
| 255 | struct rcu_head *orphan_cbs_list; /* list of rcu_head structs */ | ||
| 256 | /* orphaned by all CPUs in */ | ||
| 257 | /* a given leaf rcu_node */ | ||
| 258 | /* going offline. */ | ||
| 259 | struct rcu_head **orphan_cbs_tail; /* And tail pointer. */ | ||
| 260 | long orphan_qlen; /* Number of orphaned cbs. */ | ||
| 221 | spinlock_t fqslock; /* Only one task forcing */ | 261 | spinlock_t fqslock; /* Only one task forcing */ |
| 222 | /* quiescent states. */ | 262 | /* quiescent states. */ |
| 223 | unsigned long jiffies_force_qs; /* Time at which to invoke */ | 263 | unsigned long jiffies_force_qs; /* Time at which to invoke */ |
| @@ -255,5 +295,30 @@ extern struct rcu_state rcu_preempt_state; | |||
| 255 | DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data); | 295 | DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data); |
| 256 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ | 296 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ |
| 257 | 297 | ||
| 258 | #endif /* #ifdef RCU_TREE_NONCORE */ | 298 | #else /* #ifdef RCU_TREE_NONCORE */ |
| 299 | |||
| 300 | /* Forward declarations for rcutree_plugin.h */ | ||
| 301 | static inline void rcu_bootup_announce(void); | ||
| 302 | long rcu_batches_completed(void); | ||
| 303 | static void rcu_preempt_note_context_switch(int cpu); | ||
| 304 | static int rcu_preempted_readers(struct rcu_node *rnp); | ||
| 305 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR | ||
| 306 | static void rcu_print_task_stall(struct rcu_node *rnp); | ||
| 307 | #endif /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */ | ||
| 308 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp); | ||
| 309 | #ifdef CONFIG_HOTPLUG_CPU | ||
| 310 | static int rcu_preempt_offline_tasks(struct rcu_state *rsp, | ||
| 311 | struct rcu_node *rnp, | ||
| 312 | struct rcu_data *rdp); | ||
| 313 | static void rcu_preempt_offline_cpu(int cpu); | ||
| 314 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ | ||
| 315 | static void rcu_preempt_check_callbacks(int cpu); | ||
| 316 | static void rcu_preempt_process_callbacks(void); | ||
| 317 | void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu)); | ||
| 318 | static int rcu_preempt_pending(int cpu); | ||
| 319 | static int rcu_preempt_needs_cpu(int cpu); | ||
| 320 | static void __cpuinit rcu_preempt_init_percpu_data(int cpu); | ||
| 321 | static void rcu_preempt_send_cbs_to_orphanage(void); | ||
| 322 | static void __init __rcu_init_preempt(void); | ||
| 259 | 323 | ||
| 324 | #endif /* #else #ifdef RCU_TREE_NONCORE */ | ||
