diff options
Diffstat (limited to 'kernel')
| -rw-r--r-- | kernel/Makefile | 1 | ||||
| -rw-r--r-- | kernel/cgroup.c | 15 | ||||
| -rw-r--r-- | kernel/exit.c | 14 | ||||
| -rw-r--r-- | kernel/fork.c | 1 | ||||
| -rw-r--r-- | kernel/hw_breakpoint.c | 2 | ||||
| -rw-r--r-- | kernel/kfifo.c | 3 | ||||
| -rw-r--r-- | kernel/kprobes.c | 1 | ||||
| -rw-r--r-- | kernel/lockdep.c | 18 | ||||
| -rw-r--r-- | kernel/notifier.c | 6 | ||||
| -rw-r--r-- | kernel/padata.c | 690 | ||||
| -rw-r--r-- | kernel/perf_event.c | 13 | ||||
| -rw-r--r-- | kernel/pid.c | 2 | ||||
| -rw-r--r-- | kernel/power/Kconfig | 19 | ||||
| -rw-r--r-- | kernel/power/main.c | 31 | ||||
| -rw-r--r-- | kernel/power/snapshot.c | 4 | ||||
| -rw-r--r-- | kernel/power/swap.c | 4 | ||||
| -rw-r--r-- | kernel/power/swsusp.c | 58 | ||||
| -rw-r--r-- | kernel/power/user.c | 23 | ||||
| -rw-r--r-- | kernel/rcupdate.c | 29 | ||||
| -rw-r--r-- | kernel/rcutorture.c | 94 | ||||
| -rw-r--r-- | kernel/rcutree.c | 268 | ||||
| -rw-r--r-- | kernel/rcutree.h | 61 | ||||
| -rw-r--r-- | kernel/rcutree_plugin.h | 229 | ||||
| -rw-r--r-- | kernel/rcutree_trace.c | 14 | ||||
| -rw-r--r-- | kernel/resource.c | 44 | ||||
| -rw-r--r-- | kernel/sched.c | 11 | ||||
| -rw-r--r-- | kernel/smp.c | 8 | ||||
| -rw-r--r-- | kernel/softirq.c | 15 | ||||
| -rw-r--r-- | kernel/srcu.c | 52 | ||||
| -rw-r--r-- | kernel/sys.c | 2 | ||||
| -rw-r--r-- | kernel/trace/trace_kprobe.c | 2 | ||||
| -rw-r--r-- | kernel/trace/trace_stack.c | 24 |
32 files changed, 1435 insertions, 323 deletions
diff --git a/kernel/Makefile b/kernel/Makefile index 864ff75d65f2..6aebdeb2aa34 100644 --- a/kernel/Makefile +++ b/kernel/Makefile | |||
| @@ -100,6 +100,7 @@ obj-$(CONFIG_SLOW_WORK_DEBUG) += slow-work-debugfs.o | |||
| 100 | obj-$(CONFIG_PERF_EVENTS) += perf_event.o | 100 | obj-$(CONFIG_PERF_EVENTS) += perf_event.o |
| 101 | obj-$(CONFIG_HAVE_HW_BREAKPOINT) += hw_breakpoint.o | 101 | obj-$(CONFIG_HAVE_HW_BREAKPOINT) += hw_breakpoint.o |
| 102 | obj-$(CONFIG_USER_RETURN_NOTIFIER) += user-return-notifier.o | 102 | obj-$(CONFIG_USER_RETURN_NOTIFIER) += user-return-notifier.o |
| 103 | obj-$(CONFIG_PADATA) += padata.o | ||
| 103 | 104 | ||
| 104 | ifneq ($(CONFIG_SCHED_OMIT_FRAME_POINTER),y) | 105 | ifneq ($(CONFIG_SCHED_OMIT_FRAME_POINTER),y) |
| 105 | # According to Alan Modra <alan@linuxcare.com.au>, the -fno-omit-frame-pointer is | 106 | # According to Alan Modra <alan@linuxcare.com.au>, the -fno-omit-frame-pointer is |
diff --git a/kernel/cgroup.c b/kernel/cgroup.c index aa3bee566446..4fd90e129772 100644 --- a/kernel/cgroup.c +++ b/kernel/cgroup.c | |||
| @@ -23,6 +23,7 @@ | |||
| 23 | */ | 23 | */ |
| 24 | 24 | ||
| 25 | #include <linux/cgroup.h> | 25 | #include <linux/cgroup.h> |
| 26 | #include <linux/module.h> | ||
| 26 | #include <linux/ctype.h> | 27 | #include <linux/ctype.h> |
| 27 | #include <linux/errno.h> | 28 | #include <linux/errno.h> |
| 28 | #include <linux/fs.h> | 29 | #include <linux/fs.h> |
| @@ -166,6 +167,20 @@ static DEFINE_SPINLOCK(hierarchy_id_lock); | |||
| 166 | */ | 167 | */ |
| 167 | static int need_forkexit_callback __read_mostly; | 168 | static int need_forkexit_callback __read_mostly; |
| 168 | 169 | ||
| 170 | #ifdef CONFIG_PROVE_LOCKING | ||
| 171 | int cgroup_lock_is_held(void) | ||
| 172 | { | ||
| 173 | return lockdep_is_held(&cgroup_mutex); | ||
| 174 | } | ||
| 175 | #else /* #ifdef CONFIG_PROVE_LOCKING */ | ||
| 176 | int cgroup_lock_is_held(void) | ||
| 177 | { | ||
| 178 | return mutex_is_locked(&cgroup_mutex); | ||
| 179 | } | ||
| 180 | #endif /* #else #ifdef CONFIG_PROVE_LOCKING */ | ||
| 181 | |||
| 182 | EXPORT_SYMBOL_GPL(cgroup_lock_is_held); | ||
| 183 | |||
| 169 | /* convenient tests for these bits */ | 184 | /* convenient tests for these bits */ |
| 170 | inline int cgroup_is_removed(const struct cgroup *cgrp) | 185 | inline int cgroup_is_removed(const struct cgroup *cgrp) |
| 171 | { | 186 | { |
diff --git a/kernel/exit.c b/kernel/exit.c index 546774a31a66..45ed043b8bf5 100644 --- a/kernel/exit.c +++ b/kernel/exit.c | |||
| @@ -85,7 +85,9 @@ static void __exit_signal(struct task_struct *tsk) | |||
| 85 | BUG_ON(!sig); | 85 | BUG_ON(!sig); |
| 86 | BUG_ON(!atomic_read(&sig->count)); | 86 | BUG_ON(!atomic_read(&sig->count)); |
| 87 | 87 | ||
| 88 | sighand = rcu_dereference(tsk->sighand); | 88 | sighand = rcu_dereference_check(tsk->sighand, |
| 89 | rcu_read_lock_held() || | ||
| 90 | lockdep_is_held(&tasklist_lock)); | ||
| 89 | spin_lock(&sighand->siglock); | 91 | spin_lock(&sighand->siglock); |
| 90 | 92 | ||
| 91 | posix_cpu_timers_exit(tsk); | 93 | posix_cpu_timers_exit(tsk); |
| @@ -170,8 +172,10 @@ void release_task(struct task_struct * p) | |||
| 170 | repeat: | 172 | repeat: |
| 171 | tracehook_prepare_release_task(p); | 173 | tracehook_prepare_release_task(p); |
| 172 | /* don't need to get the RCU readlock here - the process is dead and | 174 | /* don't need to get the RCU readlock here - the process is dead and |
| 173 | * can't be modifying its own credentials */ | 175 | * can't be modifying its own credentials. But shut RCU-lockdep up */ |
| 176 | rcu_read_lock(); | ||
| 174 | atomic_dec(&__task_cred(p)->user->processes); | 177 | atomic_dec(&__task_cred(p)->user->processes); |
| 178 | rcu_read_unlock(); | ||
| 175 | 179 | ||
| 176 | proc_flush_task(p); | 180 | proc_flush_task(p); |
| 177 | 181 | ||
| @@ -473,9 +477,11 @@ static void close_files(struct files_struct * files) | |||
| 473 | /* | 477 | /* |
| 474 | * It is safe to dereference the fd table without RCU or | 478 | * It is safe to dereference the fd table without RCU or |
| 475 | * ->file_lock because this is the last reference to the | 479 | * ->file_lock because this is the last reference to the |
| 476 | * files structure. | 480 | * files structure. But use RCU to shut RCU-lockdep up. |
| 477 | */ | 481 | */ |
| 482 | rcu_read_lock(); | ||
| 478 | fdt = files_fdtable(files); | 483 | fdt = files_fdtable(files); |
| 484 | rcu_read_unlock(); | ||
| 479 | for (;;) { | 485 | for (;;) { |
| 480 | unsigned long set; | 486 | unsigned long set; |
| 481 | i = j * __NFDBITS; | 487 | i = j * __NFDBITS; |
| @@ -521,10 +527,12 @@ void put_files_struct(struct files_struct *files) | |||
| 521 | * at the end of the RCU grace period. Otherwise, | 527 | * at the end of the RCU grace period. Otherwise, |
| 522 | * you can free files immediately. | 528 | * you can free files immediately. |
| 523 | */ | 529 | */ |
| 530 | rcu_read_lock(); | ||
| 524 | fdt = files_fdtable(files); | 531 | fdt = files_fdtable(files); |
| 525 | if (fdt != &files->fdtab) | 532 | if (fdt != &files->fdtab) |
| 526 | kmem_cache_free(files_cachep, files); | 533 | kmem_cache_free(files_cachep, files); |
| 527 | free_fdtable(fdt); | 534 | free_fdtable(fdt); |
| 535 | rcu_read_unlock(); | ||
| 528 | } | 536 | } |
| 529 | } | 537 | } |
| 530 | 538 | ||
diff --git a/kernel/fork.c b/kernel/fork.c index f88bd984df35..17bbf093356d 100644 --- a/kernel/fork.c +++ b/kernel/fork.c | |||
| @@ -86,6 +86,7 @@ int max_threads; /* tunable limit on nr_threads */ | |||
| 86 | DEFINE_PER_CPU(unsigned long, process_counts) = 0; | 86 | DEFINE_PER_CPU(unsigned long, process_counts) = 0; |
| 87 | 87 | ||
| 88 | __cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */ | 88 | __cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */ |
| 89 | EXPORT_SYMBOL_GPL(tasklist_lock); | ||
| 89 | 90 | ||
| 90 | int nr_processes(void) | 91 | int nr_processes(void) |
| 91 | { | 92 | { |
diff --git a/kernel/hw_breakpoint.c b/kernel/hw_breakpoint.c index 8a5c7d55ac9f..967e66143e11 100644 --- a/kernel/hw_breakpoint.c +++ b/kernel/hw_breakpoint.c | |||
| @@ -360,8 +360,8 @@ EXPORT_SYMBOL_GPL(register_user_hw_breakpoint); | |||
| 360 | int modify_user_hw_breakpoint(struct perf_event *bp, struct perf_event_attr *attr) | 360 | int modify_user_hw_breakpoint(struct perf_event *bp, struct perf_event_attr *attr) |
| 361 | { | 361 | { |
| 362 | u64 old_addr = bp->attr.bp_addr; | 362 | u64 old_addr = bp->attr.bp_addr; |
| 363 | u64 old_len = bp->attr.bp_len; | ||
| 363 | int old_type = bp->attr.bp_type; | 364 | int old_type = bp->attr.bp_type; |
| 364 | int old_len = bp->attr.bp_len; | ||
| 365 | int err = 0; | 365 | int err = 0; |
| 366 | 366 | ||
| 367 | perf_event_disable(bp); | 367 | perf_event_disable(bp); |
diff --git a/kernel/kfifo.c b/kernel/kfifo.c index 498cabba225e..35edbe22e9a9 100644 --- a/kernel/kfifo.c +++ b/kernel/kfifo.c | |||
| @@ -80,7 +80,7 @@ int kfifo_alloc(struct kfifo *fifo, unsigned int size, gfp_t gfp_mask) | |||
| 80 | 80 | ||
| 81 | buffer = kmalloc(size, gfp_mask); | 81 | buffer = kmalloc(size, gfp_mask); |
| 82 | if (!buffer) { | 82 | if (!buffer) { |
| 83 | _kfifo_init(fifo, 0, 0); | 83 | _kfifo_init(fifo, NULL, 0); |
| 84 | return -ENOMEM; | 84 | return -ENOMEM; |
| 85 | } | 85 | } |
| 86 | 86 | ||
| @@ -97,6 +97,7 @@ EXPORT_SYMBOL(kfifo_alloc); | |||
| 97 | void kfifo_free(struct kfifo *fifo) | 97 | void kfifo_free(struct kfifo *fifo) |
| 98 | { | 98 | { |
| 99 | kfree(fifo->buffer); | 99 | kfree(fifo->buffer); |
| 100 | _kfifo_init(fifo, NULL, 0); | ||
| 100 | } | 101 | } |
| 101 | EXPORT_SYMBOL(kfifo_free); | 102 | EXPORT_SYMBOL(kfifo_free); |
| 102 | 103 | ||
diff --git a/kernel/kprobes.c b/kernel/kprobes.c index b7df302a0204..c4b43430d393 100644 --- a/kernel/kprobes.c +++ b/kernel/kprobes.c | |||
| @@ -93,6 +93,7 @@ static struct kprobe_blackpoint kprobe_blacklist[] = { | |||
| 93 | {"native_get_debugreg",}, | 93 | {"native_get_debugreg",}, |
| 94 | {"irq_entries_start",}, | 94 | {"irq_entries_start",}, |
| 95 | {"common_interrupt",}, | 95 | {"common_interrupt",}, |
| 96 | {"mcount",}, /* mcount can be called from everywhere */ | ||
| 96 | {NULL} /* Terminator */ | 97 | {NULL} /* Terminator */ |
| 97 | }; | 98 | }; |
| 98 | 99 | ||
diff --git a/kernel/lockdep.c b/kernel/lockdep.c index c62ec14609b9..0c30d0455de1 100644 --- a/kernel/lockdep.c +++ b/kernel/lockdep.c | |||
| @@ -3809,3 +3809,21 @@ void lockdep_sys_exit(void) | |||
| 3809 | lockdep_print_held_locks(curr); | 3809 | lockdep_print_held_locks(curr); |
| 3810 | } | 3810 | } |
| 3811 | } | 3811 | } |
| 3812 | |||
| 3813 | void lockdep_rcu_dereference(const char *file, const int line) | ||
| 3814 | { | ||
| 3815 | struct task_struct *curr = current; | ||
| 3816 | |||
| 3817 | if (!debug_locks_off()) | ||
| 3818 | return; | ||
| 3819 | printk("\n===================================================\n"); | ||
| 3820 | printk( "[ INFO: suspicious rcu_dereference_check() usage. ]\n"); | ||
| 3821 | printk( "---------------------------------------------------\n"); | ||
| 3822 | printk("%s:%d invoked rcu_dereference_check() without protection!\n", | ||
| 3823 | file, line); | ||
| 3824 | printk("\nother info that might help us debug this:\n\n"); | ||
| 3825 | lockdep_print_held_locks(curr); | ||
| 3826 | printk("\nstack backtrace:\n"); | ||
| 3827 | dump_stack(); | ||
| 3828 | } | ||
| 3829 | EXPORT_SYMBOL_GPL(lockdep_rcu_dereference); | ||
diff --git a/kernel/notifier.c b/kernel/notifier.c index acd24e7643eb..2488ba7eb568 100644 --- a/kernel/notifier.c +++ b/kernel/notifier.c | |||
| @@ -78,10 +78,10 @@ static int __kprobes notifier_call_chain(struct notifier_block **nl, | |||
| 78 | int ret = NOTIFY_DONE; | 78 | int ret = NOTIFY_DONE; |
| 79 | struct notifier_block *nb, *next_nb; | 79 | struct notifier_block *nb, *next_nb; |
| 80 | 80 | ||
| 81 | nb = rcu_dereference(*nl); | 81 | nb = rcu_dereference_raw(*nl); |
| 82 | 82 | ||
| 83 | while (nb && nr_to_call) { | 83 | while (nb && nr_to_call) { |
| 84 | next_nb = rcu_dereference(nb->next); | 84 | next_nb = rcu_dereference_raw(nb->next); |
| 85 | 85 | ||
| 86 | #ifdef CONFIG_DEBUG_NOTIFIERS | 86 | #ifdef CONFIG_DEBUG_NOTIFIERS |
| 87 | if (unlikely(!func_ptr_is_kernel_text(nb->notifier_call))) { | 87 | if (unlikely(!func_ptr_is_kernel_text(nb->notifier_call))) { |
| @@ -309,7 +309,7 @@ int __blocking_notifier_call_chain(struct blocking_notifier_head *nh, | |||
| 309 | * racy then it does not matter what the result of the test | 309 | * racy then it does not matter what the result of the test |
| 310 | * is, we re-check the list after having taken the lock anyway: | 310 | * is, we re-check the list after having taken the lock anyway: |
| 311 | */ | 311 | */ |
| 312 | if (rcu_dereference(nh->head)) { | 312 | if (rcu_dereference_raw(nh->head)) { |
| 313 | down_read(&nh->rwsem); | 313 | down_read(&nh->rwsem); |
| 314 | ret = notifier_call_chain(&nh->head, val, v, nr_to_call, | 314 | ret = notifier_call_chain(&nh->head, val, v, nr_to_call, |
| 315 | nr_calls); | 315 | nr_calls); |
diff --git a/kernel/padata.c b/kernel/padata.c new file mode 100644 index 000000000000..6f9bcb8313d6 --- /dev/null +++ b/kernel/padata.c | |||
| @@ -0,0 +1,690 @@ | |||
| 1 | /* | ||
| 2 | * padata.c - generic interface to process data streams in parallel | ||
| 3 | * | ||
| 4 | * Copyright (C) 2008, 2009 secunet Security Networks AG | ||
| 5 | * Copyright (C) 2008, 2009 Steffen Klassert <steffen.klassert@secunet.com> | ||
| 6 | * | ||
| 7 | * This program is free software; you can redistribute it and/or modify it | ||
| 8 | * under the terms and conditions of the GNU General Public License, | ||
| 9 | * version 2, as published by the Free Software Foundation. | ||
| 10 | * | ||
| 11 | * This program is distributed in the hope it will be useful, but WITHOUT | ||
| 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | ||
| 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | ||
| 14 | * more details. | ||
| 15 | * | ||
| 16 | * You should have received a copy of the GNU General Public License along with | ||
| 17 | * this program; if not, write to the Free Software Foundation, Inc., | ||
| 18 | * 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA. | ||
| 19 | */ | ||
| 20 | |||
| 21 | #include <linux/module.h> | ||
| 22 | #include <linux/cpumask.h> | ||
| 23 | #include <linux/err.h> | ||
| 24 | #include <linux/cpu.h> | ||
| 25 | #include <linux/padata.h> | ||
| 26 | #include <linux/mutex.h> | ||
| 27 | #include <linux/sched.h> | ||
| 28 | #include <linux/rcupdate.h> | ||
| 29 | |||
| 30 | #define MAX_SEQ_NR INT_MAX - NR_CPUS | ||
| 31 | #define MAX_OBJ_NUM 10000 * NR_CPUS | ||
| 32 | |||
| 33 | static int padata_index_to_cpu(struct parallel_data *pd, int cpu_index) | ||
| 34 | { | ||
| 35 | int cpu, target_cpu; | ||
| 36 | |||
| 37 | target_cpu = cpumask_first(pd->cpumask); | ||
| 38 | for (cpu = 0; cpu < cpu_index; cpu++) | ||
| 39 | target_cpu = cpumask_next(target_cpu, pd->cpumask); | ||
| 40 | |||
| 41 | return target_cpu; | ||
| 42 | } | ||
| 43 | |||
| 44 | static int padata_cpu_hash(struct padata_priv *padata) | ||
| 45 | { | ||
| 46 | int cpu_index; | ||
| 47 | struct parallel_data *pd; | ||
| 48 | |||
| 49 | pd = padata->pd; | ||
| 50 | |||
| 51 | /* | ||
| 52 | * Hash the sequence numbers to the cpus by taking | ||
| 53 | * seq_nr mod. number of cpus in use. | ||
| 54 | */ | ||
| 55 | cpu_index = padata->seq_nr % cpumask_weight(pd->cpumask); | ||
| 56 | |||
| 57 | return padata_index_to_cpu(pd, cpu_index); | ||
| 58 | } | ||
| 59 | |||
| 60 | static void padata_parallel_worker(struct work_struct *work) | ||
| 61 | { | ||
| 62 | struct padata_queue *queue; | ||
| 63 | struct parallel_data *pd; | ||
| 64 | struct padata_instance *pinst; | ||
| 65 | LIST_HEAD(local_list); | ||
| 66 | |||
| 67 | local_bh_disable(); | ||
| 68 | queue = container_of(work, struct padata_queue, pwork); | ||
| 69 | pd = queue->pd; | ||
| 70 | pinst = pd->pinst; | ||
| 71 | |||
| 72 | spin_lock(&queue->parallel.lock); | ||
| 73 | list_replace_init(&queue->parallel.list, &local_list); | ||
| 74 | spin_unlock(&queue->parallel.lock); | ||
| 75 | |||
| 76 | while (!list_empty(&local_list)) { | ||
| 77 | struct padata_priv *padata; | ||
| 78 | |||
| 79 | padata = list_entry(local_list.next, | ||
| 80 | struct padata_priv, list); | ||
| 81 | |||
| 82 | list_del_init(&padata->list); | ||
| 83 | |||
| 84 | padata->parallel(padata); | ||
| 85 | } | ||
| 86 | |||
| 87 | local_bh_enable(); | ||
| 88 | } | ||
| 89 | |||
| 90 | /* | ||
| 91 | * padata_do_parallel - padata parallelization function | ||
| 92 | * | ||
| 93 | * @pinst: padata instance | ||
| 94 | * @padata: object to be parallelized | ||
| 95 | * @cb_cpu: cpu the serialization callback function will run on, | ||
| 96 | * must be in the cpumask of padata. | ||
| 97 | * | ||
| 98 | * The parallelization callback function will run with BHs off. | ||
| 99 | * Note: Every object which is parallelized by padata_do_parallel | ||
| 100 | * must be seen by padata_do_serial. | ||
| 101 | */ | ||
| 102 | int padata_do_parallel(struct padata_instance *pinst, | ||
| 103 | struct padata_priv *padata, int cb_cpu) | ||
| 104 | { | ||
| 105 | int target_cpu, err; | ||
| 106 | struct padata_queue *queue; | ||
| 107 | struct parallel_data *pd; | ||
| 108 | |||
| 109 | rcu_read_lock_bh(); | ||
| 110 | |||
| 111 | pd = rcu_dereference(pinst->pd); | ||
| 112 | |||
| 113 | err = 0; | ||
| 114 | if (!(pinst->flags & PADATA_INIT)) | ||
| 115 | goto out; | ||
| 116 | |||
| 117 | err = -EBUSY; | ||
| 118 | if ((pinst->flags & PADATA_RESET)) | ||
| 119 | goto out; | ||
| 120 | |||
| 121 | if (atomic_read(&pd->refcnt) >= MAX_OBJ_NUM) | ||
| 122 | goto out; | ||
| 123 | |||
| 124 | err = -EINVAL; | ||
| 125 | if (!cpumask_test_cpu(cb_cpu, pd->cpumask)) | ||
| 126 | goto out; | ||
| 127 | |||
| 128 | err = -EINPROGRESS; | ||
| 129 | atomic_inc(&pd->refcnt); | ||
| 130 | padata->pd = pd; | ||
| 131 | padata->cb_cpu = cb_cpu; | ||
| 132 | |||
| 133 | if (unlikely(atomic_read(&pd->seq_nr) == pd->max_seq_nr)) | ||
| 134 | atomic_set(&pd->seq_nr, -1); | ||
| 135 | |||
| 136 | padata->seq_nr = atomic_inc_return(&pd->seq_nr); | ||
| 137 | |||
| 138 | target_cpu = padata_cpu_hash(padata); | ||
| 139 | queue = per_cpu_ptr(pd->queue, target_cpu); | ||
| 140 | |||
| 141 | spin_lock(&queue->parallel.lock); | ||
| 142 | list_add_tail(&padata->list, &queue->parallel.list); | ||
| 143 | spin_unlock(&queue->parallel.lock); | ||
| 144 | |||
| 145 | queue_work_on(target_cpu, pinst->wq, &queue->pwork); | ||
| 146 | |||
| 147 | out: | ||
| 148 | rcu_read_unlock_bh(); | ||
| 149 | |||
| 150 | return err; | ||
| 151 | } | ||
| 152 | EXPORT_SYMBOL(padata_do_parallel); | ||
| 153 | |||
| 154 | static struct padata_priv *padata_get_next(struct parallel_data *pd) | ||
| 155 | { | ||
| 156 | int cpu, num_cpus, empty, calc_seq_nr; | ||
| 157 | int seq_nr, next_nr, overrun, next_overrun; | ||
| 158 | struct padata_queue *queue, *next_queue; | ||
| 159 | struct padata_priv *padata; | ||
| 160 | struct padata_list *reorder; | ||
| 161 | |||
| 162 | empty = 0; | ||
| 163 | next_nr = -1; | ||
| 164 | next_overrun = 0; | ||
| 165 | next_queue = NULL; | ||
| 166 | |||
| 167 | num_cpus = cpumask_weight(pd->cpumask); | ||
| 168 | |||
| 169 | for_each_cpu(cpu, pd->cpumask) { | ||
| 170 | queue = per_cpu_ptr(pd->queue, cpu); | ||
| 171 | reorder = &queue->reorder; | ||
| 172 | |||
| 173 | /* | ||
| 174 | * Calculate the seq_nr of the object that should be | ||
| 175 | * next in this queue. | ||
| 176 | */ | ||
| 177 | overrun = 0; | ||
| 178 | calc_seq_nr = (atomic_read(&queue->num_obj) * num_cpus) | ||
| 179 | + queue->cpu_index; | ||
| 180 | |||
| 181 | if (unlikely(calc_seq_nr > pd->max_seq_nr)) { | ||
| 182 | calc_seq_nr = calc_seq_nr - pd->max_seq_nr - 1; | ||
| 183 | overrun = 1; | ||
| 184 | } | ||
| 185 | |||
| 186 | if (!list_empty(&reorder->list)) { | ||
| 187 | padata = list_entry(reorder->list.next, | ||
| 188 | struct padata_priv, list); | ||
| 189 | |||
| 190 | seq_nr = padata->seq_nr; | ||
| 191 | BUG_ON(calc_seq_nr != seq_nr); | ||
| 192 | } else { | ||
| 193 | seq_nr = calc_seq_nr; | ||
| 194 | empty++; | ||
| 195 | } | ||
| 196 | |||
| 197 | if (next_nr < 0 || seq_nr < next_nr | ||
| 198 | || (next_overrun && !overrun)) { | ||
| 199 | next_nr = seq_nr; | ||
| 200 | next_overrun = overrun; | ||
| 201 | next_queue = queue; | ||
| 202 | } | ||
| 203 | } | ||
| 204 | |||
| 205 | padata = NULL; | ||
| 206 | |||
| 207 | if (empty == num_cpus) | ||
| 208 | goto out; | ||
| 209 | |||
| 210 | reorder = &next_queue->reorder; | ||
| 211 | |||
| 212 | if (!list_empty(&reorder->list)) { | ||
| 213 | padata = list_entry(reorder->list.next, | ||
| 214 | struct padata_priv, list); | ||
| 215 | |||
| 216 | if (unlikely(next_overrun)) { | ||
| 217 | for_each_cpu(cpu, pd->cpumask) { | ||
| 218 | queue = per_cpu_ptr(pd->queue, cpu); | ||
| 219 | atomic_set(&queue->num_obj, 0); | ||
| 220 | } | ||
| 221 | } | ||
| 222 | |||
| 223 | spin_lock(&reorder->lock); | ||
| 224 | list_del_init(&padata->list); | ||
| 225 | atomic_dec(&pd->reorder_objects); | ||
| 226 | spin_unlock(&reorder->lock); | ||
| 227 | |||
| 228 | atomic_inc(&next_queue->num_obj); | ||
| 229 | |||
| 230 | goto out; | ||
| 231 | } | ||
| 232 | |||
| 233 | if (next_nr % num_cpus == next_queue->cpu_index) { | ||
| 234 | padata = ERR_PTR(-ENODATA); | ||
| 235 | goto out; | ||
| 236 | } | ||
| 237 | |||
| 238 | padata = ERR_PTR(-EINPROGRESS); | ||
| 239 | out: | ||
| 240 | return padata; | ||
| 241 | } | ||
| 242 | |||
| 243 | static void padata_reorder(struct parallel_data *pd) | ||
| 244 | { | ||
| 245 | struct padata_priv *padata; | ||
| 246 | struct padata_queue *queue; | ||
| 247 | struct padata_instance *pinst = pd->pinst; | ||
| 248 | |||
| 249 | try_again: | ||
| 250 | if (!spin_trylock_bh(&pd->lock)) | ||
| 251 | goto out; | ||
| 252 | |||
| 253 | while (1) { | ||
| 254 | padata = padata_get_next(pd); | ||
| 255 | |||
| 256 | if (!padata || PTR_ERR(padata) == -EINPROGRESS) | ||
| 257 | break; | ||
| 258 | |||
| 259 | if (PTR_ERR(padata) == -ENODATA) { | ||
| 260 | spin_unlock_bh(&pd->lock); | ||
| 261 | goto out; | ||
| 262 | } | ||
| 263 | |||
| 264 | queue = per_cpu_ptr(pd->queue, padata->cb_cpu); | ||
| 265 | |||
| 266 | spin_lock(&queue->serial.lock); | ||
| 267 | list_add_tail(&padata->list, &queue->serial.list); | ||
| 268 | spin_unlock(&queue->serial.lock); | ||
| 269 | |||
| 270 | queue_work_on(padata->cb_cpu, pinst->wq, &queue->swork); | ||
| 271 | } | ||
| 272 | |||
| 273 | spin_unlock_bh(&pd->lock); | ||
| 274 | |||
| 275 | if (atomic_read(&pd->reorder_objects)) | ||
| 276 | goto try_again; | ||
| 277 | |||
| 278 | out: | ||
| 279 | return; | ||
| 280 | } | ||
| 281 | |||
| 282 | static void padata_serial_worker(struct work_struct *work) | ||
| 283 | { | ||
| 284 | struct padata_queue *queue; | ||
| 285 | struct parallel_data *pd; | ||
| 286 | LIST_HEAD(local_list); | ||
| 287 | |||
| 288 | local_bh_disable(); | ||
| 289 | queue = container_of(work, struct padata_queue, swork); | ||
| 290 | pd = queue->pd; | ||
| 291 | |||
| 292 | spin_lock(&queue->serial.lock); | ||
| 293 | list_replace_init(&queue->serial.list, &local_list); | ||
| 294 | spin_unlock(&queue->serial.lock); | ||
| 295 | |||
| 296 | while (!list_empty(&local_list)) { | ||
| 297 | struct padata_priv *padata; | ||
| 298 | |||
| 299 | padata = list_entry(local_list.next, | ||
| 300 | struct padata_priv, list); | ||
| 301 | |||
| 302 | list_del_init(&padata->list); | ||
| 303 | |||
| 304 | padata->serial(padata); | ||
| 305 | atomic_dec(&pd->refcnt); | ||
| 306 | } | ||
| 307 | local_bh_enable(); | ||
| 308 | } | ||
| 309 | |||
| 310 | /* | ||
| 311 | * padata_do_serial - padata serialization function | ||
| 312 | * | ||
| 313 | * @padata: object to be serialized. | ||
| 314 | * | ||
| 315 | * padata_do_serial must be called for every parallelized object. | ||
| 316 | * The serialization callback function will run with BHs off. | ||
| 317 | */ | ||
| 318 | void padata_do_serial(struct padata_priv *padata) | ||
| 319 | { | ||
| 320 | int cpu; | ||
| 321 | struct padata_queue *queue; | ||
| 322 | struct parallel_data *pd; | ||
| 323 | |||
| 324 | pd = padata->pd; | ||
| 325 | |||
| 326 | cpu = get_cpu(); | ||
| 327 | queue = per_cpu_ptr(pd->queue, cpu); | ||
| 328 | |||
| 329 | spin_lock(&queue->reorder.lock); | ||
| 330 | atomic_inc(&pd->reorder_objects); | ||
| 331 | list_add_tail(&padata->list, &queue->reorder.list); | ||
| 332 | spin_unlock(&queue->reorder.lock); | ||
| 333 | |||
| 334 | put_cpu(); | ||
| 335 | |||
| 336 | padata_reorder(pd); | ||
| 337 | } | ||
| 338 | EXPORT_SYMBOL(padata_do_serial); | ||
| 339 | |||
| 340 | static struct parallel_data *padata_alloc_pd(struct padata_instance *pinst, | ||
| 341 | const struct cpumask *cpumask) | ||
| 342 | { | ||
| 343 | int cpu, cpu_index, num_cpus; | ||
| 344 | struct padata_queue *queue; | ||
| 345 | struct parallel_data *pd; | ||
| 346 | |||
| 347 | cpu_index = 0; | ||
| 348 | |||
| 349 | pd = kzalloc(sizeof(struct parallel_data), GFP_KERNEL); | ||
| 350 | if (!pd) | ||
| 351 | goto err; | ||
| 352 | |||
| 353 | pd->queue = alloc_percpu(struct padata_queue); | ||
| 354 | if (!pd->queue) | ||
| 355 | goto err_free_pd; | ||
| 356 | |||
| 357 | if (!alloc_cpumask_var(&pd->cpumask, GFP_KERNEL)) | ||
| 358 | goto err_free_queue; | ||
| 359 | |||
| 360 | for_each_possible_cpu(cpu) { | ||
| 361 | queue = per_cpu_ptr(pd->queue, cpu); | ||
| 362 | |||
| 363 | queue->pd = pd; | ||
| 364 | |||
| 365 | if (cpumask_test_cpu(cpu, cpumask) | ||
| 366 | && cpumask_test_cpu(cpu, cpu_active_mask)) { | ||
| 367 | queue->cpu_index = cpu_index; | ||
| 368 | cpu_index++; | ||
| 369 | } else | ||
| 370 | queue->cpu_index = -1; | ||
| 371 | |||
| 372 | INIT_LIST_HEAD(&queue->reorder.list); | ||
| 373 | INIT_LIST_HEAD(&queue->parallel.list); | ||
| 374 | INIT_LIST_HEAD(&queue->serial.list); | ||
| 375 | spin_lock_init(&queue->reorder.lock); | ||
| 376 | spin_lock_init(&queue->parallel.lock); | ||
| 377 | spin_lock_init(&queue->serial.lock); | ||
| 378 | |||
| 379 | INIT_WORK(&queue->pwork, padata_parallel_worker); | ||
| 380 | INIT_WORK(&queue->swork, padata_serial_worker); | ||
| 381 | atomic_set(&queue->num_obj, 0); | ||
| 382 | } | ||
| 383 | |||
| 384 | cpumask_and(pd->cpumask, cpumask, cpu_active_mask); | ||
| 385 | |||
| 386 | num_cpus = cpumask_weight(pd->cpumask); | ||
| 387 | pd->max_seq_nr = (MAX_SEQ_NR / num_cpus) * num_cpus - 1; | ||
| 388 | |||
| 389 | atomic_set(&pd->seq_nr, -1); | ||
| 390 | atomic_set(&pd->reorder_objects, 0); | ||
| 391 | atomic_set(&pd->refcnt, 0); | ||
| 392 | pd->pinst = pinst; | ||
| 393 | spin_lock_init(&pd->lock); | ||
| 394 | |||
| 395 | return pd; | ||
| 396 | |||
| 397 | err_free_queue: | ||
| 398 | free_percpu(pd->queue); | ||
| 399 | err_free_pd: | ||
| 400 | kfree(pd); | ||
| 401 | err: | ||
| 402 | return NULL; | ||
| 403 | } | ||
| 404 | |||
| 405 | static void padata_free_pd(struct parallel_data *pd) | ||
| 406 | { | ||
| 407 | free_cpumask_var(pd->cpumask); | ||
| 408 | free_percpu(pd->queue); | ||
| 409 | kfree(pd); | ||
| 410 | } | ||
| 411 | |||
| 412 | static void padata_replace(struct padata_instance *pinst, | ||
| 413 | struct parallel_data *pd_new) | ||
| 414 | { | ||
| 415 | struct parallel_data *pd_old = pinst->pd; | ||
| 416 | |||
| 417 | pinst->flags |= PADATA_RESET; | ||
| 418 | |||
| 419 | rcu_assign_pointer(pinst->pd, pd_new); | ||
| 420 | |||
| 421 | synchronize_rcu(); | ||
| 422 | |||
| 423 | while (atomic_read(&pd_old->refcnt) != 0) | ||
| 424 | yield(); | ||
| 425 | |||
| 426 | flush_workqueue(pinst->wq); | ||
| 427 | |||
| 428 | padata_free_pd(pd_old); | ||
| 429 | |||
| 430 | pinst->flags &= ~PADATA_RESET; | ||
| 431 | } | ||
| 432 | |||
| 433 | /* | ||
| 434 | * padata_set_cpumask - set the cpumask that padata should use | ||
| 435 | * | ||
| 436 | * @pinst: padata instance | ||
| 437 | * @cpumask: the cpumask to use | ||
| 438 | */ | ||
| 439 | int padata_set_cpumask(struct padata_instance *pinst, | ||
| 440 | cpumask_var_t cpumask) | ||
| 441 | { | ||
| 442 | struct parallel_data *pd; | ||
| 443 | int err = 0; | ||
| 444 | |||
| 445 | might_sleep(); | ||
| 446 | |||
| 447 | mutex_lock(&pinst->lock); | ||
| 448 | |||
| 449 | pd = padata_alloc_pd(pinst, cpumask); | ||
| 450 | if (!pd) { | ||
| 451 | err = -ENOMEM; | ||
| 452 | goto out; | ||
| 453 | } | ||
| 454 | |||
| 455 | cpumask_copy(pinst->cpumask, cpumask); | ||
| 456 | |||
| 457 | padata_replace(pinst, pd); | ||
| 458 | |||
| 459 | out: | ||
| 460 | mutex_unlock(&pinst->lock); | ||
| 461 | |||
| 462 | return err; | ||
| 463 | } | ||
| 464 | EXPORT_SYMBOL(padata_set_cpumask); | ||
| 465 | |||
| 466 | static int __padata_add_cpu(struct padata_instance *pinst, int cpu) | ||
| 467 | { | ||
| 468 | struct parallel_data *pd; | ||
| 469 | |||
| 470 | if (cpumask_test_cpu(cpu, cpu_active_mask)) { | ||
| 471 | pd = padata_alloc_pd(pinst, pinst->cpumask); | ||
| 472 | if (!pd) | ||
| 473 | return -ENOMEM; | ||
| 474 | |||
| 475 | padata_replace(pinst, pd); | ||
| 476 | } | ||
| 477 | |||
| 478 | return 0; | ||
| 479 | } | ||
| 480 | |||
| 481 | /* | ||
| 482 | * padata_add_cpu - add a cpu to the padata cpumask | ||
| 483 | * | ||
| 484 | * @pinst: padata instance | ||
| 485 | * @cpu: cpu to add | ||
| 486 | */ | ||
| 487 | int padata_add_cpu(struct padata_instance *pinst, int cpu) | ||
| 488 | { | ||
| 489 | int err; | ||
| 490 | |||
| 491 | might_sleep(); | ||
| 492 | |||
| 493 | mutex_lock(&pinst->lock); | ||
| 494 | |||
| 495 | cpumask_set_cpu(cpu, pinst->cpumask); | ||
| 496 | err = __padata_add_cpu(pinst, cpu); | ||
| 497 | |||
| 498 | mutex_unlock(&pinst->lock); | ||
| 499 | |||
| 500 | return err; | ||
| 501 | } | ||
| 502 | EXPORT_SYMBOL(padata_add_cpu); | ||
| 503 | |||
| 504 | static int __padata_remove_cpu(struct padata_instance *pinst, int cpu) | ||
| 505 | { | ||
| 506 | struct parallel_data *pd; | ||
| 507 | |||
| 508 | if (cpumask_test_cpu(cpu, cpu_online_mask)) { | ||
| 509 | pd = padata_alloc_pd(pinst, pinst->cpumask); | ||
| 510 | if (!pd) | ||
| 511 | return -ENOMEM; | ||
| 512 | |||
| 513 | padata_replace(pinst, pd); | ||
| 514 | } | ||
| 515 | |||
| 516 | return 0; | ||
| 517 | } | ||
| 518 | |||
| 519 | /* | ||
| 520 | * padata_remove_cpu - remove a cpu from the padata cpumask | ||
| 521 | * | ||
| 522 | * @pinst: padata instance | ||
| 523 | * @cpu: cpu to remove | ||
| 524 | */ | ||
| 525 | int padata_remove_cpu(struct padata_instance *pinst, int cpu) | ||
| 526 | { | ||
| 527 | int err; | ||
| 528 | |||
| 529 | might_sleep(); | ||
| 530 | |||
| 531 | mutex_lock(&pinst->lock); | ||
| 532 | |||
| 533 | cpumask_clear_cpu(cpu, pinst->cpumask); | ||
| 534 | err = __padata_remove_cpu(pinst, cpu); | ||
| 535 | |||
| 536 | mutex_unlock(&pinst->lock); | ||
| 537 | |||
| 538 | return err; | ||
| 539 | } | ||
| 540 | EXPORT_SYMBOL(padata_remove_cpu); | ||
| 541 | |||
| 542 | /* | ||
| 543 | * padata_start - start the parallel processing | ||
| 544 | * | ||
| 545 | * @pinst: padata instance to start | ||
| 546 | */ | ||
| 547 | void padata_start(struct padata_instance *pinst) | ||
| 548 | { | ||
| 549 | might_sleep(); | ||
| 550 | |||
| 551 | mutex_lock(&pinst->lock); | ||
| 552 | pinst->flags |= PADATA_INIT; | ||
| 553 | mutex_unlock(&pinst->lock); | ||
| 554 | } | ||
| 555 | EXPORT_SYMBOL(padata_start); | ||
| 556 | |||
| 557 | /* | ||
| 558 | * padata_stop - stop the parallel processing | ||
| 559 | * | ||
| 560 | * @pinst: padata instance to stop | ||
| 561 | */ | ||
| 562 | void padata_stop(struct padata_instance *pinst) | ||
| 563 | { | ||
| 564 | might_sleep(); | ||
| 565 | |||
| 566 | mutex_lock(&pinst->lock); | ||
| 567 | pinst->flags &= ~PADATA_INIT; | ||
| 568 | mutex_unlock(&pinst->lock); | ||
| 569 | } | ||
| 570 | EXPORT_SYMBOL(padata_stop); | ||
| 571 | |||
| 572 | static int __cpuinit padata_cpu_callback(struct notifier_block *nfb, | ||
| 573 | unsigned long action, void *hcpu) | ||
| 574 | { | ||
| 575 | int err; | ||
| 576 | struct padata_instance *pinst; | ||
| 577 | int cpu = (unsigned long)hcpu; | ||
| 578 | |||
| 579 | pinst = container_of(nfb, struct padata_instance, cpu_notifier); | ||
| 580 | |||
| 581 | switch (action) { | ||
| 582 | case CPU_ONLINE: | ||
| 583 | case CPU_ONLINE_FROZEN: | ||
| 584 | if (!cpumask_test_cpu(cpu, pinst->cpumask)) | ||
| 585 | break; | ||
| 586 | mutex_lock(&pinst->lock); | ||
| 587 | err = __padata_add_cpu(pinst, cpu); | ||
| 588 | mutex_unlock(&pinst->lock); | ||
| 589 | if (err) | ||
| 590 | return NOTIFY_BAD; | ||
| 591 | break; | ||
| 592 | |||
| 593 | case CPU_DOWN_PREPARE: | ||
| 594 | case CPU_DOWN_PREPARE_FROZEN: | ||
| 595 | if (!cpumask_test_cpu(cpu, pinst->cpumask)) | ||
| 596 | break; | ||
| 597 | mutex_lock(&pinst->lock); | ||
| 598 | err = __padata_remove_cpu(pinst, cpu); | ||
| 599 | mutex_unlock(&pinst->lock); | ||
| 600 | if (err) | ||
| 601 | return NOTIFY_BAD; | ||
| 602 | break; | ||
| 603 | |||
| 604 | case CPU_UP_CANCELED: | ||
| 605 | case CPU_UP_CANCELED_FROZEN: | ||
| 606 | if (!cpumask_test_cpu(cpu, pinst->cpumask)) | ||
| 607 | break; | ||
| 608 | mutex_lock(&pinst->lock); | ||
| 609 | __padata_remove_cpu(pinst, cpu); | ||
| 610 | mutex_unlock(&pinst->lock); | ||
| 611 | |||
| 612 | case CPU_DOWN_FAILED: | ||
| 613 | case CPU_DOWN_FAILED_FROZEN: | ||
| 614 | if (!cpumask_test_cpu(cpu, pinst->cpumask)) | ||
| 615 | break; | ||
| 616 | mutex_lock(&pinst->lock); | ||
| 617 | __padata_add_cpu(pinst, cpu); | ||
| 618 | mutex_unlock(&pinst->lock); | ||
| 619 | } | ||
| 620 | |||
| 621 | return NOTIFY_OK; | ||
| 622 | } | ||
| 623 | |||
| 624 | /* | ||
| 625 | * padata_alloc - allocate and initialize a padata instance | ||
| 626 | * | ||
| 627 | * @cpumask: cpumask that padata uses for parallelization | ||
| 628 | * @wq: workqueue to use for the allocated padata instance | ||
| 629 | */ | ||
| 630 | struct padata_instance *padata_alloc(const struct cpumask *cpumask, | ||
| 631 | struct workqueue_struct *wq) | ||
| 632 | { | ||
| 633 | int err; | ||
| 634 | struct padata_instance *pinst; | ||
| 635 | struct parallel_data *pd; | ||
| 636 | |||
| 637 | pinst = kzalloc(sizeof(struct padata_instance), GFP_KERNEL); | ||
| 638 | if (!pinst) | ||
| 639 | goto err; | ||
| 640 | |||
| 641 | pd = padata_alloc_pd(pinst, cpumask); | ||
| 642 | if (!pd) | ||
| 643 | goto err_free_inst; | ||
| 644 | |||
| 645 | rcu_assign_pointer(pinst->pd, pd); | ||
| 646 | |||
| 647 | pinst->wq = wq; | ||
| 648 | |||
| 649 | cpumask_copy(pinst->cpumask, cpumask); | ||
| 650 | |||
| 651 | pinst->flags = 0; | ||
| 652 | |||
| 653 | pinst->cpu_notifier.notifier_call = padata_cpu_callback; | ||
| 654 | pinst->cpu_notifier.priority = 0; | ||
| 655 | err = register_hotcpu_notifier(&pinst->cpu_notifier); | ||
| 656 | if (err) | ||
| 657 | goto err_free_pd; | ||
| 658 | |||
| 659 | mutex_init(&pinst->lock); | ||
| 660 | |||
| 661 | return pinst; | ||
| 662 | |||
| 663 | err_free_pd: | ||
| 664 | padata_free_pd(pd); | ||
| 665 | err_free_inst: | ||
| 666 | kfree(pinst); | ||
| 667 | err: | ||
| 668 | return NULL; | ||
| 669 | } | ||
| 670 | EXPORT_SYMBOL(padata_alloc); | ||
| 671 | |||
| 672 | /* | ||
| 673 | * padata_free - free a padata instance | ||
| 674 | * | ||
| 675 | * @ padata_inst: padata instance to free | ||
| 676 | */ | ||
| 677 | void padata_free(struct padata_instance *pinst) | ||
| 678 | { | ||
| 679 | padata_stop(pinst); | ||
| 680 | |||
| 681 | synchronize_rcu(); | ||
| 682 | |||
| 683 | while (atomic_read(&pinst->pd->refcnt) != 0) | ||
| 684 | yield(); | ||
| 685 | |||
| 686 | unregister_hotcpu_notifier(&pinst->cpu_notifier); | ||
| 687 | padata_free_pd(pinst->pd); | ||
| 688 | kfree(pinst); | ||
| 689 | } | ||
| 690 | EXPORT_SYMBOL(padata_free); | ||
diff --git a/kernel/perf_event.c b/kernel/perf_event.c index d27746bd3a06..2ae7409bf38f 100644 --- a/kernel/perf_event.c +++ b/kernel/perf_event.c | |||
| @@ -3259,8 +3259,6 @@ static void perf_event_task_output(struct perf_event *event, | |||
| 3259 | task_event->event_id.tid = perf_event_tid(event, task); | 3259 | task_event->event_id.tid = perf_event_tid(event, task); |
| 3260 | task_event->event_id.ptid = perf_event_tid(event, current); | 3260 | task_event->event_id.ptid = perf_event_tid(event, current); |
| 3261 | 3261 | ||
| 3262 | task_event->event_id.time = perf_clock(); | ||
| 3263 | |||
| 3264 | perf_output_put(&handle, task_event->event_id); | 3262 | perf_output_put(&handle, task_event->event_id); |
| 3265 | 3263 | ||
| 3266 | perf_output_end(&handle); | 3264 | perf_output_end(&handle); |
| @@ -3268,7 +3266,7 @@ static void perf_event_task_output(struct perf_event *event, | |||
| 3268 | 3266 | ||
| 3269 | static int perf_event_task_match(struct perf_event *event) | 3267 | static int perf_event_task_match(struct perf_event *event) |
| 3270 | { | 3268 | { |
| 3271 | if (event->state != PERF_EVENT_STATE_ACTIVE) | 3269 | if (event->state < PERF_EVENT_STATE_INACTIVE) |
| 3272 | return 0; | 3270 | return 0; |
| 3273 | 3271 | ||
| 3274 | if (event->cpu != -1 && event->cpu != smp_processor_id()) | 3272 | if (event->cpu != -1 && event->cpu != smp_processor_id()) |
| @@ -3300,7 +3298,7 @@ static void perf_event_task_event(struct perf_task_event *task_event) | |||
| 3300 | cpuctx = &get_cpu_var(perf_cpu_context); | 3298 | cpuctx = &get_cpu_var(perf_cpu_context); |
| 3301 | perf_event_task_ctx(&cpuctx->ctx, task_event); | 3299 | perf_event_task_ctx(&cpuctx->ctx, task_event); |
| 3302 | if (!ctx) | 3300 | if (!ctx) |
| 3303 | ctx = rcu_dereference(task_event->task->perf_event_ctxp); | 3301 | ctx = rcu_dereference(current->perf_event_ctxp); |
| 3304 | if (ctx) | 3302 | if (ctx) |
| 3305 | perf_event_task_ctx(ctx, task_event); | 3303 | perf_event_task_ctx(ctx, task_event); |
| 3306 | put_cpu_var(perf_cpu_context); | 3304 | put_cpu_var(perf_cpu_context); |
| @@ -3331,6 +3329,7 @@ static void perf_event_task(struct task_struct *task, | |||
| 3331 | /* .ppid */ | 3329 | /* .ppid */ |
| 3332 | /* .tid */ | 3330 | /* .tid */ |
| 3333 | /* .ptid */ | 3331 | /* .ptid */ |
| 3332 | .time = perf_clock(), | ||
| 3334 | }, | 3333 | }, |
| 3335 | }; | 3334 | }; |
| 3336 | 3335 | ||
| @@ -3380,7 +3379,7 @@ static void perf_event_comm_output(struct perf_event *event, | |||
| 3380 | 3379 | ||
| 3381 | static int perf_event_comm_match(struct perf_event *event) | 3380 | static int perf_event_comm_match(struct perf_event *event) |
| 3382 | { | 3381 | { |
| 3383 | if (event->state != PERF_EVENT_STATE_ACTIVE) | 3382 | if (event->state < PERF_EVENT_STATE_INACTIVE) |
| 3384 | return 0; | 3383 | return 0; |
| 3385 | 3384 | ||
| 3386 | if (event->cpu != -1 && event->cpu != smp_processor_id()) | 3385 | if (event->cpu != -1 && event->cpu != smp_processor_id()) |
| @@ -3500,7 +3499,7 @@ static void perf_event_mmap_output(struct perf_event *event, | |||
| 3500 | static int perf_event_mmap_match(struct perf_event *event, | 3499 | static int perf_event_mmap_match(struct perf_event *event, |
| 3501 | struct perf_mmap_event *mmap_event) | 3500 | struct perf_mmap_event *mmap_event) |
| 3502 | { | 3501 | { |
| 3503 | if (event->state != PERF_EVENT_STATE_ACTIVE) | 3502 | if (event->state < PERF_EVENT_STATE_INACTIVE) |
| 3504 | return 0; | 3503 | return 0; |
| 3505 | 3504 | ||
| 3506 | if (event->cpu != -1 && event->cpu != smp_processor_id()) | 3505 | if (event->cpu != -1 && event->cpu != smp_processor_id()) |
| @@ -4580,7 +4579,7 @@ static int perf_copy_attr(struct perf_event_attr __user *uattr, | |||
| 4580 | if (attr->type >= PERF_TYPE_MAX) | 4579 | if (attr->type >= PERF_TYPE_MAX) |
| 4581 | return -EINVAL; | 4580 | return -EINVAL; |
| 4582 | 4581 | ||
| 4583 | if (attr->__reserved_1 || attr->__reserved_2) | 4582 | if (attr->__reserved_1) |
| 4584 | return -EINVAL; | 4583 | return -EINVAL; |
| 4585 | 4584 | ||
| 4586 | if (attr->sample_type & ~(PERF_SAMPLE_MAX-1)) | 4585 | if (attr->sample_type & ~(PERF_SAMPLE_MAX-1)) |
diff --git a/kernel/pid.c b/kernel/pid.c index 2e17c9c92cbe..b08e697cd83f 100644 --- a/kernel/pid.c +++ b/kernel/pid.c | |||
| @@ -367,7 +367,7 @@ struct task_struct *pid_task(struct pid *pid, enum pid_type type) | |||
| 367 | struct task_struct *result = NULL; | 367 | struct task_struct *result = NULL; |
| 368 | if (pid) { | 368 | if (pid) { |
| 369 | struct hlist_node *first; | 369 | struct hlist_node *first; |
| 370 | first = rcu_dereference(pid->tasks[type].first); | 370 | first = rcu_dereference_check(pid->tasks[type].first, rcu_read_lock_held() || lockdep_is_held(&tasklist_lock)); |
| 371 | if (first) | 371 | if (first) |
| 372 | result = hlist_entry(first, struct task_struct, pids[(type)].node); | 372 | result = hlist_entry(first, struct task_struct, pids[(type)].node); |
| 373 | } | 373 | } |
diff --git a/kernel/power/Kconfig b/kernel/power/Kconfig index 91e09d3b2eb2..5c36ea9d55d2 100644 --- a/kernel/power/Kconfig +++ b/kernel/power/Kconfig | |||
| @@ -27,6 +27,15 @@ config PM_DEBUG | |||
| 27 | code. This is helpful when debugging and reporting PM bugs, like | 27 | code. This is helpful when debugging and reporting PM bugs, like |
| 28 | suspend support. | 28 | suspend support. |
| 29 | 29 | ||
| 30 | config PM_ADVANCED_DEBUG | ||
| 31 | bool "Extra PM attributes in sysfs for low-level debugging/testing" | ||
| 32 | depends on PM_DEBUG | ||
| 33 | default n | ||
| 34 | ---help--- | ||
| 35 | Add extra sysfs attributes allowing one to access some Power Management | ||
| 36 | fields of device objects from user space. If you are not a kernel | ||
| 37 | developer interested in debugging/testing Power Management, say "no". | ||
| 38 | |||
| 30 | config PM_VERBOSE | 39 | config PM_VERBOSE |
| 31 | bool "Verbose Power Management debugging" | 40 | bool "Verbose Power Management debugging" |
| 32 | depends on PM_DEBUG | 41 | depends on PM_DEBUG |
| @@ -85,6 +94,11 @@ config PM_SLEEP | |||
| 85 | depends on SUSPEND || HIBERNATION || XEN_SAVE_RESTORE | 94 | depends on SUSPEND || HIBERNATION || XEN_SAVE_RESTORE |
| 86 | default y | 95 | default y |
| 87 | 96 | ||
| 97 | config PM_SLEEP_ADVANCED_DEBUG | ||
| 98 | bool | ||
| 99 | depends on PM_ADVANCED_DEBUG | ||
| 100 | default n | ||
| 101 | |||
| 88 | config SUSPEND | 102 | config SUSPEND |
| 89 | bool "Suspend to RAM and standby" | 103 | bool "Suspend to RAM and standby" |
| 90 | depends on PM && ARCH_SUSPEND_POSSIBLE | 104 | depends on PM && ARCH_SUSPEND_POSSIBLE |
| @@ -222,3 +236,8 @@ config PM_RUNTIME | |||
| 222 | and the bus type drivers of the buses the devices are on are | 236 | and the bus type drivers of the buses the devices are on are |
| 223 | responsible for the actual handling of the autosuspend requests and | 237 | responsible for the actual handling of the autosuspend requests and |
| 224 | wake-up events. | 238 | wake-up events. |
| 239 | |||
| 240 | config PM_OPS | ||
| 241 | bool | ||
| 242 | depends on PM_SLEEP || PM_RUNTIME | ||
| 243 | default y | ||
diff --git a/kernel/power/main.c b/kernel/power/main.c index 0998c7139053..b58800b21fc0 100644 --- a/kernel/power/main.c +++ b/kernel/power/main.c | |||
| @@ -44,6 +44,32 @@ int pm_notifier_call_chain(unsigned long val) | |||
| 44 | == NOTIFY_BAD) ? -EINVAL : 0; | 44 | == NOTIFY_BAD) ? -EINVAL : 0; |
| 45 | } | 45 | } |
| 46 | 46 | ||
| 47 | /* If set, devices may be suspended and resumed asynchronously. */ | ||
| 48 | int pm_async_enabled = 1; | ||
| 49 | |||
| 50 | static ssize_t pm_async_show(struct kobject *kobj, struct kobj_attribute *attr, | ||
| 51 | char *buf) | ||
| 52 | { | ||
| 53 | return sprintf(buf, "%d\n", pm_async_enabled); | ||
| 54 | } | ||
| 55 | |||
| 56 | static ssize_t pm_async_store(struct kobject *kobj, struct kobj_attribute *attr, | ||
| 57 | const char *buf, size_t n) | ||
| 58 | { | ||
| 59 | unsigned long val; | ||
| 60 | |||
| 61 | if (strict_strtoul(buf, 10, &val)) | ||
| 62 | return -EINVAL; | ||
| 63 | |||
| 64 | if (val > 1) | ||
| 65 | return -EINVAL; | ||
| 66 | |||
| 67 | pm_async_enabled = val; | ||
| 68 | return n; | ||
| 69 | } | ||
| 70 | |||
| 71 | power_attr(pm_async); | ||
| 72 | |||
| 47 | #ifdef CONFIG_PM_DEBUG | 73 | #ifdef CONFIG_PM_DEBUG |
| 48 | int pm_test_level = TEST_NONE; | 74 | int pm_test_level = TEST_NONE; |
| 49 | 75 | ||
| @@ -208,9 +234,12 @@ static struct attribute * g[] = { | |||
| 208 | #ifdef CONFIG_PM_TRACE | 234 | #ifdef CONFIG_PM_TRACE |
| 209 | &pm_trace_attr.attr, | 235 | &pm_trace_attr.attr, |
| 210 | #endif | 236 | #endif |
| 211 | #if defined(CONFIG_PM_SLEEP) && defined(CONFIG_PM_DEBUG) | 237 | #ifdef CONFIG_PM_SLEEP |
| 238 | &pm_async_attr.attr, | ||
| 239 | #ifdef CONFIG_PM_DEBUG | ||
| 212 | &pm_test_attr.attr, | 240 | &pm_test_attr.attr, |
| 213 | #endif | 241 | #endif |
| 242 | #endif | ||
| 214 | NULL, | 243 | NULL, |
| 215 | }; | 244 | }; |
| 216 | 245 | ||
diff --git a/kernel/power/snapshot.c b/kernel/power/snapshot.c index 36cb168e4330..830cadecbdfc 100644 --- a/kernel/power/snapshot.c +++ b/kernel/power/snapshot.c | |||
| @@ -1181,7 +1181,7 @@ static void free_unnecessary_pages(void) | |||
| 1181 | 1181 | ||
| 1182 | memory_bm_position_reset(©_bm); | 1182 | memory_bm_position_reset(©_bm); |
| 1183 | 1183 | ||
| 1184 | while (to_free_normal > 0 && to_free_highmem > 0) { | 1184 | while (to_free_normal > 0 || to_free_highmem > 0) { |
| 1185 | unsigned long pfn = memory_bm_next_pfn(©_bm); | 1185 | unsigned long pfn = memory_bm_next_pfn(©_bm); |
| 1186 | struct page *page = pfn_to_page(pfn); | 1186 | struct page *page = pfn_to_page(pfn); |
| 1187 | 1187 | ||
| @@ -1500,7 +1500,7 @@ asmlinkage int swsusp_save(void) | |||
| 1500 | { | 1500 | { |
| 1501 | unsigned int nr_pages, nr_highmem; | 1501 | unsigned int nr_pages, nr_highmem; |
| 1502 | 1502 | ||
| 1503 | printk(KERN_INFO "PM: Creating hibernation image: \n"); | 1503 | printk(KERN_INFO "PM: Creating hibernation image:\n"); |
| 1504 | 1504 | ||
| 1505 | drain_local_pages(NULL); | 1505 | drain_local_pages(NULL); |
| 1506 | nr_pages = count_data_pages(); | 1506 | nr_pages = count_data_pages(); |
diff --git a/kernel/power/swap.c b/kernel/power/swap.c index 09b2b0ae9e9d..1d575733d4e1 100644 --- a/kernel/power/swap.c +++ b/kernel/power/swap.c | |||
| @@ -657,10 +657,6 @@ int swsusp_read(unsigned int *flags_p) | |||
| 657 | struct swsusp_info *header; | 657 | struct swsusp_info *header; |
| 658 | 658 | ||
| 659 | *flags_p = swsusp_header->flags; | 659 | *flags_p = swsusp_header->flags; |
| 660 | if (IS_ERR(resume_bdev)) { | ||
| 661 | pr_debug("PM: Image device not initialised\n"); | ||
| 662 | return PTR_ERR(resume_bdev); | ||
| 663 | } | ||
| 664 | 660 | ||
| 665 | memset(&snapshot, 0, sizeof(struct snapshot_handle)); | 661 | memset(&snapshot, 0, sizeof(struct snapshot_handle)); |
| 666 | error = snapshot_write_next(&snapshot, PAGE_SIZE); | 662 | error = snapshot_write_next(&snapshot, PAGE_SIZE); |
diff --git a/kernel/power/swsusp.c b/kernel/power/swsusp.c deleted file mode 100644 index 5b3601bd1893..000000000000 --- a/kernel/power/swsusp.c +++ /dev/null | |||
| @@ -1,58 +0,0 @@ | |||
| 1 | /* | ||
| 2 | * linux/kernel/power/swsusp.c | ||
| 3 | * | ||
| 4 | * This file provides code to write suspend image to swap and read it back. | ||
| 5 | * | ||
| 6 | * Copyright (C) 1998-2001 Gabor Kuti <seasons@fornax.hu> | ||
| 7 | * Copyright (C) 1998,2001-2005 Pavel Machek <pavel@suse.cz> | ||
| 8 | * | ||
| 9 | * This file is released under the GPLv2. | ||
| 10 | * | ||
| 11 | * I'd like to thank the following people for their work: | ||
| 12 | * | ||
| 13 | * Pavel Machek <pavel@ucw.cz>: | ||
| 14 | * Modifications, defectiveness pointing, being with me at the very beginning, | ||
| 15 | * suspend to swap space, stop all tasks. Port to 2.4.18-ac and 2.5.17. | ||
| 16 | * | ||
| 17 | * Steve Doddi <dirk@loth.demon.co.uk>: | ||
| 18 | * Support the possibility of hardware state restoring. | ||
| 19 | * | ||
| 20 | * Raph <grey.havens@earthling.net>: | ||
| 21 | * Support for preserving states of network devices and virtual console | ||
| 22 | * (including X and svgatextmode) | ||
| 23 | * | ||
| 24 | * Kurt Garloff <garloff@suse.de>: | ||
| 25 | * Straightened the critical function in order to prevent compilers from | ||
| 26 | * playing tricks with local variables. | ||
| 27 | * | ||
| 28 | * Andreas Mohr <a.mohr@mailto.de> | ||
| 29 | * | ||
| 30 | * Alex Badea <vampire@go.ro>: | ||
| 31 | * Fixed runaway init | ||
| 32 | * | ||
| 33 | * Rafael J. Wysocki <rjw@sisk.pl> | ||
| 34 | * Reworked the freeing of memory and the handling of swap | ||
| 35 | * | ||
| 36 | * More state savers are welcome. Especially for the scsi layer... | ||
| 37 | * | ||
| 38 | * For TODOs,FIXMEs also look in Documentation/power/swsusp.txt | ||
| 39 | */ | ||
| 40 | |||
| 41 | #include <linux/mm.h> | ||
| 42 | #include <linux/suspend.h> | ||
| 43 | #include <linux/spinlock.h> | ||
| 44 | #include <linux/kernel.h> | ||
| 45 | #include <linux/major.h> | ||
| 46 | #include <linux/swap.h> | ||
| 47 | #include <linux/pm.h> | ||
| 48 | #include <linux/swapops.h> | ||
| 49 | #include <linux/bootmem.h> | ||
| 50 | #include <linux/syscalls.h> | ||
| 51 | #include <linux/highmem.h> | ||
| 52 | #include <linux/time.h> | ||
| 53 | #include <linux/rbtree.h> | ||
| 54 | #include <linux/io.h> | ||
| 55 | |||
| 56 | #include "power.h" | ||
| 57 | |||
| 58 | int in_suspend __nosavedata = 0; | ||
diff --git a/kernel/power/user.c b/kernel/power/user.c index bf0014d6a5f0..4d2289626a84 100644 --- a/kernel/power/user.c +++ b/kernel/power/user.c | |||
| @@ -195,6 +195,15 @@ static ssize_t snapshot_write(struct file *filp, const char __user *buf, | |||
| 195 | return res; | 195 | return res; |
| 196 | } | 196 | } |
| 197 | 197 | ||
| 198 | static void snapshot_deprecated_ioctl(unsigned int cmd) | ||
| 199 | { | ||
| 200 | if (printk_ratelimit()) | ||
| 201 | printk(KERN_NOTICE "%pf: ioctl '%.8x' is deprecated and will " | ||
| 202 | "be removed soon, update your suspend-to-disk " | ||
| 203 | "utilities\n", | ||
| 204 | __builtin_return_address(0), cmd); | ||
| 205 | } | ||
| 206 | |||
| 198 | static long snapshot_ioctl(struct file *filp, unsigned int cmd, | 207 | static long snapshot_ioctl(struct file *filp, unsigned int cmd, |
| 199 | unsigned long arg) | 208 | unsigned long arg) |
| 200 | { | 209 | { |
| @@ -246,8 +255,9 @@ static long snapshot_ioctl(struct file *filp, unsigned int cmd, | |||
| 246 | data->frozen = 0; | 255 | data->frozen = 0; |
| 247 | break; | 256 | break; |
| 248 | 257 | ||
| 249 | case SNAPSHOT_CREATE_IMAGE: | ||
| 250 | case SNAPSHOT_ATOMIC_SNAPSHOT: | 258 | case SNAPSHOT_ATOMIC_SNAPSHOT: |
| 259 | snapshot_deprecated_ioctl(cmd); | ||
| 260 | case SNAPSHOT_CREATE_IMAGE: | ||
| 251 | if (data->mode != O_RDONLY || !data->frozen || data->ready) { | 261 | if (data->mode != O_RDONLY || !data->frozen || data->ready) { |
| 252 | error = -EPERM; | 262 | error = -EPERM; |
| 253 | break; | 263 | break; |
| @@ -275,8 +285,9 @@ static long snapshot_ioctl(struct file *filp, unsigned int cmd, | |||
| 275 | data->ready = 0; | 285 | data->ready = 0; |
| 276 | break; | 286 | break; |
| 277 | 287 | ||
| 278 | case SNAPSHOT_PREF_IMAGE_SIZE: | ||
| 279 | case SNAPSHOT_SET_IMAGE_SIZE: | 288 | case SNAPSHOT_SET_IMAGE_SIZE: |
| 289 | snapshot_deprecated_ioctl(cmd); | ||
| 290 | case SNAPSHOT_PREF_IMAGE_SIZE: | ||
| 280 | image_size = arg; | 291 | image_size = arg; |
| 281 | break; | 292 | break; |
| 282 | 293 | ||
| @@ -290,15 +301,17 @@ static long snapshot_ioctl(struct file *filp, unsigned int cmd, | |||
| 290 | error = put_user(size, (loff_t __user *)arg); | 301 | error = put_user(size, (loff_t __user *)arg); |
| 291 | break; | 302 | break; |
| 292 | 303 | ||
| 293 | case SNAPSHOT_AVAIL_SWAP_SIZE: | ||
| 294 | case SNAPSHOT_AVAIL_SWAP: | 304 | case SNAPSHOT_AVAIL_SWAP: |
| 305 | snapshot_deprecated_ioctl(cmd); | ||
| 306 | case SNAPSHOT_AVAIL_SWAP_SIZE: | ||
| 295 | size = count_swap_pages(data->swap, 1); | 307 | size = count_swap_pages(data->swap, 1); |
| 296 | size <<= PAGE_SHIFT; | 308 | size <<= PAGE_SHIFT; |
| 297 | error = put_user(size, (loff_t __user *)arg); | 309 | error = put_user(size, (loff_t __user *)arg); |
| 298 | break; | 310 | break; |
| 299 | 311 | ||
| 300 | case SNAPSHOT_ALLOC_SWAP_PAGE: | ||
| 301 | case SNAPSHOT_GET_SWAP_PAGE: | 312 | case SNAPSHOT_GET_SWAP_PAGE: |
| 313 | snapshot_deprecated_ioctl(cmd); | ||
| 314 | case SNAPSHOT_ALLOC_SWAP_PAGE: | ||
| 302 | if (data->swap < 0 || data->swap >= MAX_SWAPFILES) { | 315 | if (data->swap < 0 || data->swap >= MAX_SWAPFILES) { |
| 303 | error = -ENODEV; | 316 | error = -ENODEV; |
| 304 | break; | 317 | break; |
| @@ -321,6 +334,7 @@ static long snapshot_ioctl(struct file *filp, unsigned int cmd, | |||
| 321 | break; | 334 | break; |
| 322 | 335 | ||
| 323 | case SNAPSHOT_SET_SWAP_FILE: /* This ioctl is deprecated */ | 336 | case SNAPSHOT_SET_SWAP_FILE: /* This ioctl is deprecated */ |
| 337 | snapshot_deprecated_ioctl(cmd); | ||
| 324 | if (!swsusp_swap_in_use()) { | 338 | if (!swsusp_swap_in_use()) { |
| 325 | /* | 339 | /* |
| 326 | * User space encodes device types as two-byte values, | 340 | * User space encodes device types as two-byte values, |
| @@ -362,6 +376,7 @@ static long snapshot_ioctl(struct file *filp, unsigned int cmd, | |||
| 362 | break; | 376 | break; |
| 363 | 377 | ||
| 364 | case SNAPSHOT_PMOPS: /* This ioctl is deprecated */ | 378 | case SNAPSHOT_PMOPS: /* This ioctl is deprecated */ |
| 379 | snapshot_deprecated_ioctl(cmd); | ||
| 365 | error = -EINVAL; | 380 | error = -EINVAL; |
| 366 | 381 | ||
| 367 | switch (arg) { | 382 | switch (arg) { |
diff --git a/kernel/rcupdate.c b/kernel/rcupdate.c index 9b7fd4723878..f1125c1a6321 100644 --- a/kernel/rcupdate.c +++ b/kernel/rcupdate.c | |||
| @@ -44,14 +44,43 @@ | |||
| 44 | #include <linux/cpu.h> | 44 | #include <linux/cpu.h> |
| 45 | #include <linux/mutex.h> | 45 | #include <linux/mutex.h> |
| 46 | #include <linux/module.h> | 46 | #include <linux/module.h> |
| 47 | #include <linux/kernel_stat.h> | ||
| 47 | 48 | ||
| 48 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | 49 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
| 49 | static struct lock_class_key rcu_lock_key; | 50 | static struct lock_class_key rcu_lock_key; |
| 50 | struct lockdep_map rcu_lock_map = | 51 | struct lockdep_map rcu_lock_map = |
| 51 | STATIC_LOCKDEP_MAP_INIT("rcu_read_lock", &rcu_lock_key); | 52 | STATIC_LOCKDEP_MAP_INIT("rcu_read_lock", &rcu_lock_key); |
| 52 | EXPORT_SYMBOL_GPL(rcu_lock_map); | 53 | EXPORT_SYMBOL_GPL(rcu_lock_map); |
| 54 | |||
| 55 | static struct lock_class_key rcu_bh_lock_key; | ||
| 56 | struct lockdep_map rcu_bh_lock_map = | ||
| 57 | STATIC_LOCKDEP_MAP_INIT("rcu_read_lock_bh", &rcu_bh_lock_key); | ||
| 58 | EXPORT_SYMBOL_GPL(rcu_bh_lock_map); | ||
| 59 | |||
| 60 | static struct lock_class_key rcu_sched_lock_key; | ||
| 61 | struct lockdep_map rcu_sched_lock_map = | ||
| 62 | STATIC_LOCKDEP_MAP_INIT("rcu_read_lock_sched", &rcu_sched_lock_key); | ||
| 63 | EXPORT_SYMBOL_GPL(rcu_sched_lock_map); | ||
| 53 | #endif | 64 | #endif |
| 54 | 65 | ||
| 66 | int rcu_scheduler_active __read_mostly; | ||
| 67 | EXPORT_SYMBOL_GPL(rcu_scheduler_active); | ||
| 68 | |||
| 69 | /* | ||
| 70 | * This function is invoked towards the end of the scheduler's initialization | ||
| 71 | * process. Before this is called, the idle task might contain | ||
| 72 | * RCU read-side critical sections (during which time, this idle | ||
| 73 | * task is booting the system). After this function is called, the | ||
| 74 | * idle tasks are prohibited from containing RCU read-side critical | ||
| 75 | * sections. | ||
| 76 | */ | ||
| 77 | void rcu_scheduler_starting(void) | ||
| 78 | { | ||
| 79 | WARN_ON(num_online_cpus() != 1); | ||
| 80 | WARN_ON(nr_context_switches() > 0); | ||
| 81 | rcu_scheduler_active = 1; | ||
| 82 | } | ||
| 83 | |||
| 55 | /* | 84 | /* |
| 56 | * Awaken the corresponding synchronize_rcu() instance now that a | 85 | * Awaken the corresponding synchronize_rcu() instance now that a |
| 57 | * grace period has elapsed. | 86 | * grace period has elapsed. |
diff --git a/kernel/rcutorture.c b/kernel/rcutorture.c index 9bb52177af02..258cdf0a91eb 100644 --- a/kernel/rcutorture.c +++ b/kernel/rcutorture.c | |||
| @@ -61,6 +61,9 @@ static int test_no_idle_hz; /* Test RCU's support for tickless idle CPUs. */ | |||
| 61 | static int shuffle_interval = 3; /* Interval between shuffles (in sec)*/ | 61 | static int shuffle_interval = 3; /* Interval between shuffles (in sec)*/ |
| 62 | static int stutter = 5; /* Start/stop testing interval (in sec) */ | 62 | static int stutter = 5; /* Start/stop testing interval (in sec) */ |
| 63 | static int irqreader = 1; /* RCU readers from irq (timers). */ | 63 | static int irqreader = 1; /* RCU readers from irq (timers). */ |
| 64 | static int fqs_duration = 0; /* Duration of bursts (us), 0 to disable. */ | ||
| 65 | static int fqs_holdoff = 0; /* Hold time within burst (us). */ | ||
| 66 | static int fqs_stutter = 3; /* Wait time between bursts (s). */ | ||
| 64 | static char *torture_type = "rcu"; /* What RCU implementation to torture. */ | 67 | static char *torture_type = "rcu"; /* What RCU implementation to torture. */ |
| 65 | 68 | ||
| 66 | module_param(nreaders, int, 0444); | 69 | module_param(nreaders, int, 0444); |
| @@ -79,6 +82,12 @@ module_param(stutter, int, 0444); | |||
| 79 | MODULE_PARM_DESC(stutter, "Number of seconds to run/halt test"); | 82 | MODULE_PARM_DESC(stutter, "Number of seconds to run/halt test"); |
| 80 | module_param(irqreader, int, 0444); | 83 | module_param(irqreader, int, 0444); |
| 81 | MODULE_PARM_DESC(irqreader, "Allow RCU readers from irq handlers"); | 84 | MODULE_PARM_DESC(irqreader, "Allow RCU readers from irq handlers"); |
| 85 | module_param(fqs_duration, int, 0444); | ||
| 86 | MODULE_PARM_DESC(fqs_duration, "Duration of fqs bursts (us)"); | ||
| 87 | module_param(fqs_holdoff, int, 0444); | ||
| 88 | MODULE_PARM_DESC(fqs_holdoff, "Holdoff time within fqs bursts (us)"); | ||
| 89 | module_param(fqs_stutter, int, 0444); | ||
| 90 | MODULE_PARM_DESC(fqs_stutter, "Wait time between fqs bursts (s)"); | ||
| 82 | module_param(torture_type, charp, 0444); | 91 | module_param(torture_type, charp, 0444); |
| 83 | MODULE_PARM_DESC(torture_type, "Type of RCU to torture (rcu, rcu_bh, srcu)"); | 92 | MODULE_PARM_DESC(torture_type, "Type of RCU to torture (rcu, rcu_bh, srcu)"); |
| 84 | 93 | ||
| @@ -99,6 +108,7 @@ static struct task_struct **reader_tasks; | |||
| 99 | static struct task_struct *stats_task; | 108 | static struct task_struct *stats_task; |
| 100 | static struct task_struct *shuffler_task; | 109 | static struct task_struct *shuffler_task; |
| 101 | static struct task_struct *stutter_task; | 110 | static struct task_struct *stutter_task; |
| 111 | static struct task_struct *fqs_task; | ||
| 102 | 112 | ||
| 103 | #define RCU_TORTURE_PIPE_LEN 10 | 113 | #define RCU_TORTURE_PIPE_LEN 10 |
| 104 | 114 | ||
| @@ -263,6 +273,7 @@ struct rcu_torture_ops { | |||
| 263 | void (*deferred_free)(struct rcu_torture *p); | 273 | void (*deferred_free)(struct rcu_torture *p); |
| 264 | void (*sync)(void); | 274 | void (*sync)(void); |
| 265 | void (*cb_barrier)(void); | 275 | void (*cb_barrier)(void); |
| 276 | void (*fqs)(void); | ||
| 266 | int (*stats)(char *page); | 277 | int (*stats)(char *page); |
| 267 | int irq_capable; | 278 | int irq_capable; |
| 268 | char *name; | 279 | char *name; |
| @@ -347,6 +358,7 @@ static struct rcu_torture_ops rcu_ops = { | |||
| 347 | .deferred_free = rcu_torture_deferred_free, | 358 | .deferred_free = rcu_torture_deferred_free, |
| 348 | .sync = synchronize_rcu, | 359 | .sync = synchronize_rcu, |
| 349 | .cb_barrier = rcu_barrier, | 360 | .cb_barrier = rcu_barrier, |
| 361 | .fqs = rcu_force_quiescent_state, | ||
| 350 | .stats = NULL, | 362 | .stats = NULL, |
| 351 | .irq_capable = 1, | 363 | .irq_capable = 1, |
| 352 | .name = "rcu" | 364 | .name = "rcu" |
| @@ -388,6 +400,7 @@ static struct rcu_torture_ops rcu_sync_ops = { | |||
| 388 | .deferred_free = rcu_sync_torture_deferred_free, | 400 | .deferred_free = rcu_sync_torture_deferred_free, |
| 389 | .sync = synchronize_rcu, | 401 | .sync = synchronize_rcu, |
| 390 | .cb_barrier = NULL, | 402 | .cb_barrier = NULL, |
| 403 | .fqs = rcu_force_quiescent_state, | ||
| 391 | .stats = NULL, | 404 | .stats = NULL, |
| 392 | .irq_capable = 1, | 405 | .irq_capable = 1, |
| 393 | .name = "rcu_sync" | 406 | .name = "rcu_sync" |
| @@ -403,6 +416,7 @@ static struct rcu_torture_ops rcu_expedited_ops = { | |||
| 403 | .deferred_free = rcu_sync_torture_deferred_free, | 416 | .deferred_free = rcu_sync_torture_deferred_free, |
| 404 | .sync = synchronize_rcu_expedited, | 417 | .sync = synchronize_rcu_expedited, |
| 405 | .cb_barrier = NULL, | 418 | .cb_barrier = NULL, |
| 419 | .fqs = rcu_force_quiescent_state, | ||
| 406 | .stats = NULL, | 420 | .stats = NULL, |
| 407 | .irq_capable = 1, | 421 | .irq_capable = 1, |
| 408 | .name = "rcu_expedited" | 422 | .name = "rcu_expedited" |
| @@ -465,6 +479,7 @@ static struct rcu_torture_ops rcu_bh_ops = { | |||
| 465 | .deferred_free = rcu_bh_torture_deferred_free, | 479 | .deferred_free = rcu_bh_torture_deferred_free, |
| 466 | .sync = rcu_bh_torture_synchronize, | 480 | .sync = rcu_bh_torture_synchronize, |
| 467 | .cb_barrier = rcu_barrier_bh, | 481 | .cb_barrier = rcu_barrier_bh, |
| 482 | .fqs = rcu_bh_force_quiescent_state, | ||
| 468 | .stats = NULL, | 483 | .stats = NULL, |
| 469 | .irq_capable = 1, | 484 | .irq_capable = 1, |
| 470 | .name = "rcu_bh" | 485 | .name = "rcu_bh" |
| @@ -480,6 +495,7 @@ static struct rcu_torture_ops rcu_bh_sync_ops = { | |||
| 480 | .deferred_free = rcu_sync_torture_deferred_free, | 495 | .deferred_free = rcu_sync_torture_deferred_free, |
| 481 | .sync = rcu_bh_torture_synchronize, | 496 | .sync = rcu_bh_torture_synchronize, |
| 482 | .cb_barrier = NULL, | 497 | .cb_barrier = NULL, |
| 498 | .fqs = rcu_bh_force_quiescent_state, | ||
| 483 | .stats = NULL, | 499 | .stats = NULL, |
| 484 | .irq_capable = 1, | 500 | .irq_capable = 1, |
| 485 | .name = "rcu_bh_sync" | 501 | .name = "rcu_bh_sync" |
| @@ -621,6 +637,7 @@ static struct rcu_torture_ops sched_ops = { | |||
| 621 | .deferred_free = rcu_sched_torture_deferred_free, | 637 | .deferred_free = rcu_sched_torture_deferred_free, |
| 622 | .sync = sched_torture_synchronize, | 638 | .sync = sched_torture_synchronize, |
| 623 | .cb_barrier = rcu_barrier_sched, | 639 | .cb_barrier = rcu_barrier_sched, |
| 640 | .fqs = rcu_sched_force_quiescent_state, | ||
| 624 | .stats = NULL, | 641 | .stats = NULL, |
| 625 | .irq_capable = 1, | 642 | .irq_capable = 1, |
| 626 | .name = "sched" | 643 | .name = "sched" |
| @@ -636,6 +653,7 @@ static struct rcu_torture_ops sched_sync_ops = { | |||
| 636 | .deferred_free = rcu_sync_torture_deferred_free, | 653 | .deferred_free = rcu_sync_torture_deferred_free, |
| 637 | .sync = sched_torture_synchronize, | 654 | .sync = sched_torture_synchronize, |
| 638 | .cb_barrier = NULL, | 655 | .cb_barrier = NULL, |
| 656 | .fqs = rcu_sched_force_quiescent_state, | ||
| 639 | .stats = NULL, | 657 | .stats = NULL, |
| 640 | .name = "sched_sync" | 658 | .name = "sched_sync" |
| 641 | }; | 659 | }; |
| @@ -650,12 +668,45 @@ static struct rcu_torture_ops sched_expedited_ops = { | |||
| 650 | .deferred_free = rcu_sync_torture_deferred_free, | 668 | .deferred_free = rcu_sync_torture_deferred_free, |
| 651 | .sync = synchronize_sched_expedited, | 669 | .sync = synchronize_sched_expedited, |
| 652 | .cb_barrier = NULL, | 670 | .cb_barrier = NULL, |
| 671 | .fqs = rcu_sched_force_quiescent_state, | ||
| 653 | .stats = rcu_expedited_torture_stats, | 672 | .stats = rcu_expedited_torture_stats, |
| 654 | .irq_capable = 1, | 673 | .irq_capable = 1, |
| 655 | .name = "sched_expedited" | 674 | .name = "sched_expedited" |
| 656 | }; | 675 | }; |
| 657 | 676 | ||
| 658 | /* | 677 | /* |
| 678 | * RCU torture force-quiescent-state kthread. Repeatedly induces | ||
| 679 | * bursts of calls to force_quiescent_state(), increasing the probability | ||
| 680 | * of occurrence of some important types of race conditions. | ||
| 681 | */ | ||
| 682 | static int | ||
| 683 | rcu_torture_fqs(void *arg) | ||
| 684 | { | ||
| 685 | unsigned long fqs_resume_time; | ||
| 686 | int fqs_burst_remaining; | ||
| 687 | |||
| 688 | VERBOSE_PRINTK_STRING("rcu_torture_fqs task started"); | ||
| 689 | do { | ||
| 690 | fqs_resume_time = jiffies + fqs_stutter * HZ; | ||
| 691 | while (jiffies - fqs_resume_time > LONG_MAX) { | ||
| 692 | schedule_timeout_interruptible(1); | ||
| 693 | } | ||
| 694 | fqs_burst_remaining = fqs_duration; | ||
| 695 | while (fqs_burst_remaining > 0) { | ||
| 696 | cur_ops->fqs(); | ||
| 697 | udelay(fqs_holdoff); | ||
| 698 | fqs_burst_remaining -= fqs_holdoff; | ||
| 699 | } | ||
| 700 | rcu_stutter_wait("rcu_torture_fqs"); | ||
| 701 | } while (!kthread_should_stop() && fullstop == FULLSTOP_DONTSTOP); | ||
| 702 | VERBOSE_PRINTK_STRING("rcu_torture_fqs task stopping"); | ||
| 703 | rcutorture_shutdown_absorb("rcu_torture_fqs"); | ||
| 704 | while (!kthread_should_stop()) | ||
| 705 | schedule_timeout_uninterruptible(1); | ||
| 706 | return 0; | ||
| 707 | } | ||
| 708 | |||
| 709 | /* | ||
| 659 | * RCU torture writer kthread. Repeatedly substitutes a new structure | 710 | * RCU torture writer kthread. Repeatedly substitutes a new structure |
| 660 | * for that pointed to by rcu_torture_current, freeing the old structure | 711 | * for that pointed to by rcu_torture_current, freeing the old structure |
| 661 | * after a series of grace periods (the "pipeline"). | 712 | * after a series of grace periods (the "pipeline"). |
| @@ -745,7 +796,11 @@ static void rcu_torture_timer(unsigned long unused) | |||
| 745 | 796 | ||
| 746 | idx = cur_ops->readlock(); | 797 | idx = cur_ops->readlock(); |
| 747 | completed = cur_ops->completed(); | 798 | completed = cur_ops->completed(); |
| 748 | p = rcu_dereference(rcu_torture_current); | 799 | p = rcu_dereference_check(rcu_torture_current, |
| 800 | rcu_read_lock_held() || | ||
| 801 | rcu_read_lock_bh_held() || | ||
| 802 | rcu_read_lock_sched_held() || | ||
| 803 | srcu_read_lock_held(&srcu_ctl)); | ||
| 749 | if (p == NULL) { | 804 | if (p == NULL) { |
| 750 | /* Leave because rcu_torture_writer is not yet underway */ | 805 | /* Leave because rcu_torture_writer is not yet underway */ |
| 751 | cur_ops->readunlock(idx); | 806 | cur_ops->readunlock(idx); |
| @@ -798,11 +853,15 @@ rcu_torture_reader(void *arg) | |||
| 798 | do { | 853 | do { |
| 799 | if (irqreader && cur_ops->irq_capable) { | 854 | if (irqreader && cur_ops->irq_capable) { |
| 800 | if (!timer_pending(&t)) | 855 | if (!timer_pending(&t)) |
| 801 | mod_timer(&t, 1); | 856 | mod_timer(&t, jiffies + 1); |
| 802 | } | 857 | } |
| 803 | idx = cur_ops->readlock(); | 858 | idx = cur_ops->readlock(); |
| 804 | completed = cur_ops->completed(); | 859 | completed = cur_ops->completed(); |
| 805 | p = rcu_dereference(rcu_torture_current); | 860 | p = rcu_dereference_check(rcu_torture_current, |
| 861 | rcu_read_lock_held() || | ||
| 862 | rcu_read_lock_bh_held() || | ||
| 863 | rcu_read_lock_sched_held() || | ||
| 864 | srcu_read_lock_held(&srcu_ctl)); | ||
| 806 | if (p == NULL) { | 865 | if (p == NULL) { |
| 807 | /* Wait for rcu_torture_writer to get underway */ | 866 | /* Wait for rcu_torture_writer to get underway */ |
| 808 | cur_ops->readunlock(idx); | 867 | cur_ops->readunlock(idx); |
| @@ -1030,10 +1089,11 @@ rcu_torture_print_module_parms(char *tag) | |||
| 1030 | printk(KERN_ALERT "%s" TORTURE_FLAG | 1089 | printk(KERN_ALERT "%s" TORTURE_FLAG |
| 1031 | "--- %s: nreaders=%d nfakewriters=%d " | 1090 | "--- %s: nreaders=%d nfakewriters=%d " |
| 1032 | "stat_interval=%d verbose=%d test_no_idle_hz=%d " | 1091 | "stat_interval=%d verbose=%d test_no_idle_hz=%d " |
| 1033 | "shuffle_interval=%d stutter=%d irqreader=%d\n", | 1092 | "shuffle_interval=%d stutter=%d irqreader=%d " |
| 1093 | "fqs_duration=%d fqs_holdoff=%d fqs_stutter=%d\n", | ||
| 1034 | torture_type, tag, nrealreaders, nfakewriters, | 1094 | torture_type, tag, nrealreaders, nfakewriters, |
| 1035 | stat_interval, verbose, test_no_idle_hz, shuffle_interval, | 1095 | stat_interval, verbose, test_no_idle_hz, shuffle_interval, |
| 1036 | stutter, irqreader); | 1096 | stutter, irqreader, fqs_duration, fqs_holdoff, fqs_stutter); |
| 1037 | } | 1097 | } |
| 1038 | 1098 | ||
| 1039 | static struct notifier_block rcutorture_nb = { | 1099 | static struct notifier_block rcutorture_nb = { |
| @@ -1109,6 +1169,12 @@ rcu_torture_cleanup(void) | |||
| 1109 | } | 1169 | } |
| 1110 | stats_task = NULL; | 1170 | stats_task = NULL; |
| 1111 | 1171 | ||
| 1172 | if (fqs_task) { | ||
| 1173 | VERBOSE_PRINTK_STRING("Stopping rcu_torture_fqs task"); | ||
| 1174 | kthread_stop(fqs_task); | ||
| 1175 | } | ||
| 1176 | fqs_task = NULL; | ||
| 1177 | |||
| 1112 | /* Wait for all RCU callbacks to fire. */ | 1178 | /* Wait for all RCU callbacks to fire. */ |
| 1113 | 1179 | ||
| 1114 | if (cur_ops->cb_barrier != NULL) | 1180 | if (cur_ops->cb_barrier != NULL) |
| @@ -1154,6 +1220,11 @@ rcu_torture_init(void) | |||
| 1154 | mutex_unlock(&fullstop_mutex); | 1220 | mutex_unlock(&fullstop_mutex); |
| 1155 | return -EINVAL; | 1221 | return -EINVAL; |
| 1156 | } | 1222 | } |
| 1223 | if (cur_ops->fqs == NULL && fqs_duration != 0) { | ||
| 1224 | printk(KERN_ALERT "rcu-torture: ->fqs NULL and non-zero " | ||
| 1225 | "fqs_duration, fqs disabled.\n"); | ||
| 1226 | fqs_duration = 0; | ||
| 1227 | } | ||
| 1157 | if (cur_ops->init) | 1228 | if (cur_ops->init) |
| 1158 | cur_ops->init(); /* no "goto unwind" prior to this point!!! */ | 1229 | cur_ops->init(); /* no "goto unwind" prior to this point!!! */ |
| 1159 | 1230 | ||
| @@ -1282,6 +1353,19 @@ rcu_torture_init(void) | |||
| 1282 | goto unwind; | 1353 | goto unwind; |
| 1283 | } | 1354 | } |
| 1284 | } | 1355 | } |
| 1356 | if (fqs_duration < 0) | ||
| 1357 | fqs_duration = 0; | ||
| 1358 | if (fqs_duration) { | ||
| 1359 | /* Create the stutter thread */ | ||
| 1360 | fqs_task = kthread_run(rcu_torture_fqs, NULL, | ||
| 1361 | "rcu_torture_fqs"); | ||
| 1362 | if (IS_ERR(fqs_task)) { | ||
| 1363 | firsterr = PTR_ERR(fqs_task); | ||
| 1364 | VERBOSE_PRINTK_ERRSTRING("Failed to create fqs"); | ||
| 1365 | fqs_task = NULL; | ||
| 1366 | goto unwind; | ||
| 1367 | } | ||
| 1368 | } | ||
| 1285 | register_reboot_notifier(&rcutorture_nb); | 1369 | register_reboot_notifier(&rcutorture_nb); |
| 1286 | mutex_unlock(&fullstop_mutex); | 1370 | mutex_unlock(&fullstop_mutex); |
| 1287 | return 0; | 1371 | return 0; |
diff --git a/kernel/rcutree.c b/kernel/rcutree.c index 53ae9598f798..3ec8160fc75f 100644 --- a/kernel/rcutree.c +++ b/kernel/rcutree.c | |||
| @@ -46,7 +46,6 @@ | |||
| 46 | #include <linux/cpu.h> | 46 | #include <linux/cpu.h> |
| 47 | #include <linux/mutex.h> | 47 | #include <linux/mutex.h> |
| 48 | #include <linux/time.h> | 48 | #include <linux/time.h> |
| 49 | #include <linux/kernel_stat.h> | ||
| 50 | 49 | ||
| 51 | #include "rcutree.h" | 50 | #include "rcutree.h" |
| 52 | 51 | ||
| @@ -66,11 +65,11 @@ static struct lock_class_key rcu_node_class[NUM_RCU_LVLS]; | |||
| 66 | .signaled = RCU_GP_IDLE, \ | 65 | .signaled = RCU_GP_IDLE, \ |
| 67 | .gpnum = -300, \ | 66 | .gpnum = -300, \ |
| 68 | .completed = -300, \ | 67 | .completed = -300, \ |
| 69 | .onofflock = __SPIN_LOCK_UNLOCKED(&name.onofflock), \ | 68 | .onofflock = __RAW_SPIN_LOCK_UNLOCKED(&name.onofflock), \ |
| 70 | .orphan_cbs_list = NULL, \ | 69 | .orphan_cbs_list = NULL, \ |
| 71 | .orphan_cbs_tail = &name.orphan_cbs_list, \ | 70 | .orphan_cbs_tail = &name.orphan_cbs_list, \ |
| 72 | .orphan_qlen = 0, \ | 71 | .orphan_qlen = 0, \ |
| 73 | .fqslock = __SPIN_LOCK_UNLOCKED(&name.fqslock), \ | 72 | .fqslock = __RAW_SPIN_LOCK_UNLOCKED(&name.fqslock), \ |
| 74 | .n_force_qs = 0, \ | 73 | .n_force_qs = 0, \ |
| 75 | .n_force_qs_ngp = 0, \ | 74 | .n_force_qs_ngp = 0, \ |
| 76 | } | 75 | } |
| @@ -81,9 +80,6 @@ DEFINE_PER_CPU(struct rcu_data, rcu_sched_data); | |||
| 81 | struct rcu_state rcu_bh_state = RCU_STATE_INITIALIZER(rcu_bh_state); | 80 | struct rcu_state rcu_bh_state = RCU_STATE_INITIALIZER(rcu_bh_state); |
| 82 | DEFINE_PER_CPU(struct rcu_data, rcu_bh_data); | 81 | DEFINE_PER_CPU(struct rcu_data, rcu_bh_data); |
| 83 | 82 | ||
| 84 | static int rcu_scheduler_active __read_mostly; | ||
| 85 | |||
| 86 | |||
| 87 | /* | 83 | /* |
| 88 | * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s | 84 | * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s |
| 89 | * permit this function to be invoked without holding the root rcu_node | 85 | * permit this function to be invoked without holding the root rcu_node |
| @@ -157,6 +153,24 @@ long rcu_batches_completed_bh(void) | |||
| 157 | EXPORT_SYMBOL_GPL(rcu_batches_completed_bh); | 153 | EXPORT_SYMBOL_GPL(rcu_batches_completed_bh); |
| 158 | 154 | ||
| 159 | /* | 155 | /* |
| 156 | * Force a quiescent state for RCU BH. | ||
| 157 | */ | ||
| 158 | void rcu_bh_force_quiescent_state(void) | ||
| 159 | { | ||
| 160 | force_quiescent_state(&rcu_bh_state, 0); | ||
| 161 | } | ||
| 162 | EXPORT_SYMBOL_GPL(rcu_bh_force_quiescent_state); | ||
| 163 | |||
| 164 | /* | ||
| 165 | * Force a quiescent state for RCU-sched. | ||
| 166 | */ | ||
| 167 | void rcu_sched_force_quiescent_state(void) | ||
| 168 | { | ||
| 169 | force_quiescent_state(&rcu_sched_state, 0); | ||
| 170 | } | ||
| 171 | EXPORT_SYMBOL_GPL(rcu_sched_force_quiescent_state); | ||
| 172 | |||
| 173 | /* | ||
| 160 | * Does the CPU have callbacks ready to be invoked? | 174 | * Does the CPU have callbacks ready to be invoked? |
| 161 | */ | 175 | */ |
| 162 | static int | 176 | static int |
| @@ -439,10 +453,10 @@ static void print_other_cpu_stall(struct rcu_state *rsp) | |||
| 439 | 453 | ||
| 440 | /* Only let one CPU complain about others per time interval. */ | 454 | /* Only let one CPU complain about others per time interval. */ |
| 441 | 455 | ||
| 442 | spin_lock_irqsave(&rnp->lock, flags); | 456 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 443 | delta = jiffies - rsp->jiffies_stall; | 457 | delta = jiffies - rsp->jiffies_stall; |
| 444 | if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) { | 458 | if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) { |
| 445 | spin_unlock_irqrestore(&rnp->lock, flags); | 459 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 446 | return; | 460 | return; |
| 447 | } | 461 | } |
| 448 | rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_RECHECK; | 462 | rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_RECHECK; |
| @@ -452,13 +466,15 @@ static void print_other_cpu_stall(struct rcu_state *rsp) | |||
| 452 | * due to CPU offlining. | 466 | * due to CPU offlining. |
| 453 | */ | 467 | */ |
| 454 | rcu_print_task_stall(rnp); | 468 | rcu_print_task_stall(rnp); |
| 455 | spin_unlock_irqrestore(&rnp->lock, flags); | 469 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 456 | 470 | ||
| 457 | /* OK, time to rat on our buddy... */ | 471 | /* OK, time to rat on our buddy... */ |
| 458 | 472 | ||
| 459 | printk(KERN_ERR "INFO: RCU detected CPU stalls:"); | 473 | printk(KERN_ERR "INFO: RCU detected CPU stalls:"); |
| 460 | rcu_for_each_leaf_node(rsp, rnp) { | 474 | rcu_for_each_leaf_node(rsp, rnp) { |
| 475 | raw_spin_lock_irqsave(&rnp->lock, flags); | ||
| 461 | rcu_print_task_stall(rnp); | 476 | rcu_print_task_stall(rnp); |
| 477 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | ||
| 462 | if (rnp->qsmask == 0) | 478 | if (rnp->qsmask == 0) |
| 463 | continue; | 479 | continue; |
| 464 | for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++) | 480 | for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++) |
| @@ -469,6 +485,10 @@ static void print_other_cpu_stall(struct rcu_state *rsp) | |||
| 469 | smp_processor_id(), (long)(jiffies - rsp->gp_start)); | 485 | smp_processor_id(), (long)(jiffies - rsp->gp_start)); |
| 470 | trigger_all_cpu_backtrace(); | 486 | trigger_all_cpu_backtrace(); |
| 471 | 487 | ||
| 488 | /* If so configured, complain about tasks blocking the grace period. */ | ||
| 489 | |||
| 490 | rcu_print_detail_task_stall(rsp); | ||
| 491 | |||
| 472 | force_quiescent_state(rsp, 0); /* Kick them all. */ | 492 | force_quiescent_state(rsp, 0); /* Kick them all. */ |
| 473 | } | 493 | } |
| 474 | 494 | ||
| @@ -481,11 +501,11 @@ static void print_cpu_stall(struct rcu_state *rsp) | |||
| 481 | smp_processor_id(), jiffies - rsp->gp_start); | 501 | smp_processor_id(), jiffies - rsp->gp_start); |
| 482 | trigger_all_cpu_backtrace(); | 502 | trigger_all_cpu_backtrace(); |
| 483 | 503 | ||
| 484 | spin_lock_irqsave(&rnp->lock, flags); | 504 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 485 | if ((long)(jiffies - rsp->jiffies_stall) >= 0) | 505 | if (ULONG_CMP_GE(jiffies, rsp->jiffies_stall)) |
| 486 | rsp->jiffies_stall = | 506 | rsp->jiffies_stall = |
| 487 | jiffies + RCU_SECONDS_TILL_STALL_RECHECK; | 507 | jiffies + RCU_SECONDS_TILL_STALL_RECHECK; |
| 488 | spin_unlock_irqrestore(&rnp->lock, flags); | 508 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 489 | 509 | ||
| 490 | set_need_resched(); /* kick ourselves to get things going. */ | 510 | set_need_resched(); /* kick ourselves to get things going. */ |
| 491 | } | 511 | } |
| @@ -545,12 +565,12 @@ static void note_new_gpnum(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 545 | local_irq_save(flags); | 565 | local_irq_save(flags); |
| 546 | rnp = rdp->mynode; | 566 | rnp = rdp->mynode; |
| 547 | if (rdp->gpnum == ACCESS_ONCE(rnp->gpnum) || /* outside lock. */ | 567 | if (rdp->gpnum == ACCESS_ONCE(rnp->gpnum) || /* outside lock. */ |
| 548 | !spin_trylock(&rnp->lock)) { /* irqs already off, retry later. */ | 568 | !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */ |
| 549 | local_irq_restore(flags); | 569 | local_irq_restore(flags); |
| 550 | return; | 570 | return; |
| 551 | } | 571 | } |
| 552 | __note_new_gpnum(rsp, rnp, rdp); | 572 | __note_new_gpnum(rsp, rnp, rdp); |
| 553 | spin_unlock_irqrestore(&rnp->lock, flags); | 573 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 554 | } | 574 | } |
| 555 | 575 | ||
| 556 | /* | 576 | /* |
| @@ -609,12 +629,12 @@ rcu_process_gp_end(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 609 | local_irq_save(flags); | 629 | local_irq_save(flags); |
| 610 | rnp = rdp->mynode; | 630 | rnp = rdp->mynode; |
| 611 | if (rdp->completed == ACCESS_ONCE(rnp->completed) || /* outside lock. */ | 631 | if (rdp->completed == ACCESS_ONCE(rnp->completed) || /* outside lock. */ |
| 612 | !spin_trylock(&rnp->lock)) { /* irqs already off, retry later. */ | 632 | !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */ |
| 613 | local_irq_restore(flags); | 633 | local_irq_restore(flags); |
| 614 | return; | 634 | return; |
| 615 | } | 635 | } |
| 616 | __rcu_process_gp_end(rsp, rnp, rdp); | 636 | __rcu_process_gp_end(rsp, rnp, rdp); |
| 617 | spin_unlock_irqrestore(&rnp->lock, flags); | 637 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 618 | } | 638 | } |
| 619 | 639 | ||
| 620 | /* | 640 | /* |
| @@ -659,12 +679,14 @@ rcu_start_gp(struct rcu_state *rsp, unsigned long flags) | |||
| 659 | struct rcu_data *rdp = rsp->rda[smp_processor_id()]; | 679 | struct rcu_data *rdp = rsp->rda[smp_processor_id()]; |
| 660 | struct rcu_node *rnp = rcu_get_root(rsp); | 680 | struct rcu_node *rnp = rcu_get_root(rsp); |
| 661 | 681 | ||
| 662 | if (!cpu_needs_another_gp(rsp, rdp)) { | 682 | if (!cpu_needs_another_gp(rsp, rdp) || rsp->fqs_active) { |
| 683 | if (cpu_needs_another_gp(rsp, rdp)) | ||
| 684 | rsp->fqs_need_gp = 1; | ||
| 663 | if (rnp->completed == rsp->completed) { | 685 | if (rnp->completed == rsp->completed) { |
| 664 | spin_unlock_irqrestore(&rnp->lock, flags); | 686 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 665 | return; | 687 | return; |
| 666 | } | 688 | } |
| 667 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 689 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 668 | 690 | ||
| 669 | /* | 691 | /* |
| 670 | * Propagate new ->completed value to rcu_node structures | 692 | * Propagate new ->completed value to rcu_node structures |
| @@ -672,9 +694,9 @@ rcu_start_gp(struct rcu_state *rsp, unsigned long flags) | |||
| 672 | * of the next grace period to process their callbacks. | 694 | * of the next grace period to process their callbacks. |
| 673 | */ | 695 | */ |
| 674 | rcu_for_each_node_breadth_first(rsp, rnp) { | 696 | rcu_for_each_node_breadth_first(rsp, rnp) { |
| 675 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 697 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 676 | rnp->completed = rsp->completed; | 698 | rnp->completed = rsp->completed; |
| 677 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 699 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 678 | } | 700 | } |
| 679 | local_irq_restore(flags); | 701 | local_irq_restore(flags); |
| 680 | return; | 702 | return; |
| @@ -695,15 +717,15 @@ rcu_start_gp(struct rcu_state *rsp, unsigned long flags) | |||
| 695 | rnp->completed = rsp->completed; | 717 | rnp->completed = rsp->completed; |
| 696 | rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state OK. */ | 718 | rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state OK. */ |
| 697 | rcu_start_gp_per_cpu(rsp, rnp, rdp); | 719 | rcu_start_gp_per_cpu(rsp, rnp, rdp); |
| 698 | spin_unlock_irqrestore(&rnp->lock, flags); | 720 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 699 | return; | 721 | return; |
| 700 | } | 722 | } |
| 701 | 723 | ||
| 702 | spin_unlock(&rnp->lock); /* leave irqs disabled. */ | 724 | raw_spin_unlock(&rnp->lock); /* leave irqs disabled. */ |
| 703 | 725 | ||
| 704 | 726 | ||
| 705 | /* Exclude any concurrent CPU-hotplug operations. */ | 727 | /* Exclude any concurrent CPU-hotplug operations. */ |
| 706 | spin_lock(&rsp->onofflock); /* irqs already disabled. */ | 728 | raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */ |
| 707 | 729 | ||
| 708 | /* | 730 | /* |
| 709 | * Set the quiescent-state-needed bits in all the rcu_node | 731 | * Set the quiescent-state-needed bits in all the rcu_node |
| @@ -723,21 +745,21 @@ rcu_start_gp(struct rcu_state *rsp, unsigned long flags) | |||
| 723 | * irqs disabled. | 745 | * irqs disabled. |
| 724 | */ | 746 | */ |
| 725 | rcu_for_each_node_breadth_first(rsp, rnp) { | 747 | rcu_for_each_node_breadth_first(rsp, rnp) { |
| 726 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 748 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 727 | rcu_preempt_check_blocked_tasks(rnp); | 749 | rcu_preempt_check_blocked_tasks(rnp); |
| 728 | rnp->qsmask = rnp->qsmaskinit; | 750 | rnp->qsmask = rnp->qsmaskinit; |
| 729 | rnp->gpnum = rsp->gpnum; | 751 | rnp->gpnum = rsp->gpnum; |
| 730 | rnp->completed = rsp->completed; | 752 | rnp->completed = rsp->completed; |
| 731 | if (rnp == rdp->mynode) | 753 | if (rnp == rdp->mynode) |
| 732 | rcu_start_gp_per_cpu(rsp, rnp, rdp); | 754 | rcu_start_gp_per_cpu(rsp, rnp, rdp); |
| 733 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 755 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 734 | } | 756 | } |
| 735 | 757 | ||
| 736 | rnp = rcu_get_root(rsp); | 758 | rnp = rcu_get_root(rsp); |
| 737 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 759 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 738 | rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state now OK. */ | 760 | rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state now OK. */ |
| 739 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 761 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 740 | spin_unlock_irqrestore(&rsp->onofflock, flags); | 762 | raw_spin_unlock_irqrestore(&rsp->onofflock, flags); |
| 741 | } | 763 | } |
| 742 | 764 | ||
| 743 | /* | 765 | /* |
| @@ -776,14 +798,14 @@ rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp, | |||
| 776 | if (!(rnp->qsmask & mask)) { | 798 | if (!(rnp->qsmask & mask)) { |
| 777 | 799 | ||
| 778 | /* Our bit has already been cleared, so done. */ | 800 | /* Our bit has already been cleared, so done. */ |
| 779 | spin_unlock_irqrestore(&rnp->lock, flags); | 801 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 780 | return; | 802 | return; |
| 781 | } | 803 | } |
| 782 | rnp->qsmask &= ~mask; | 804 | rnp->qsmask &= ~mask; |
| 783 | if (rnp->qsmask != 0 || rcu_preempted_readers(rnp)) { | 805 | if (rnp->qsmask != 0 || rcu_preempted_readers(rnp)) { |
| 784 | 806 | ||
| 785 | /* Other bits still set at this level, so done. */ | 807 | /* Other bits still set at this level, so done. */ |
| 786 | spin_unlock_irqrestore(&rnp->lock, flags); | 808 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 787 | return; | 809 | return; |
| 788 | } | 810 | } |
| 789 | mask = rnp->grpmask; | 811 | mask = rnp->grpmask; |
| @@ -793,10 +815,10 @@ rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp, | |||
| 793 | 815 | ||
| 794 | break; | 816 | break; |
| 795 | } | 817 | } |
| 796 | spin_unlock_irqrestore(&rnp->lock, flags); | 818 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 797 | rnp_c = rnp; | 819 | rnp_c = rnp; |
| 798 | rnp = rnp->parent; | 820 | rnp = rnp->parent; |
| 799 | spin_lock_irqsave(&rnp->lock, flags); | 821 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 800 | WARN_ON_ONCE(rnp_c->qsmask); | 822 | WARN_ON_ONCE(rnp_c->qsmask); |
| 801 | } | 823 | } |
| 802 | 824 | ||
| @@ -825,7 +847,7 @@ rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp, long las | |||
| 825 | struct rcu_node *rnp; | 847 | struct rcu_node *rnp; |
| 826 | 848 | ||
| 827 | rnp = rdp->mynode; | 849 | rnp = rdp->mynode; |
| 828 | spin_lock_irqsave(&rnp->lock, flags); | 850 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 829 | if (lastcomp != rnp->completed) { | 851 | if (lastcomp != rnp->completed) { |
| 830 | 852 | ||
| 831 | /* | 853 | /* |
| @@ -837,12 +859,12 @@ rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp, long las | |||
| 837 | * race occurred. | 859 | * race occurred. |
| 838 | */ | 860 | */ |
| 839 | rdp->passed_quiesc = 0; /* try again later! */ | 861 | rdp->passed_quiesc = 0; /* try again later! */ |
| 840 | spin_unlock_irqrestore(&rnp->lock, flags); | 862 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 841 | return; | 863 | return; |
| 842 | } | 864 | } |
| 843 | mask = rdp->grpmask; | 865 | mask = rdp->grpmask; |
| 844 | if ((rnp->qsmask & mask) == 0) { | 866 | if ((rnp->qsmask & mask) == 0) { |
| 845 | spin_unlock_irqrestore(&rnp->lock, flags); | 867 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 846 | } else { | 868 | } else { |
| 847 | rdp->qs_pending = 0; | 869 | rdp->qs_pending = 0; |
| 848 | 870 | ||
| @@ -906,7 +928,7 @@ static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp) | |||
| 906 | 928 | ||
| 907 | if (rdp->nxtlist == NULL) | 929 | if (rdp->nxtlist == NULL) |
| 908 | return; /* irqs disabled, so comparison is stable. */ | 930 | return; /* irqs disabled, so comparison is stable. */ |
| 909 | spin_lock(&rsp->onofflock); /* irqs already disabled. */ | 931 | raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */ |
| 910 | *rsp->orphan_cbs_tail = rdp->nxtlist; | 932 | *rsp->orphan_cbs_tail = rdp->nxtlist; |
| 911 | rsp->orphan_cbs_tail = rdp->nxttail[RCU_NEXT_TAIL]; | 933 | rsp->orphan_cbs_tail = rdp->nxttail[RCU_NEXT_TAIL]; |
| 912 | rdp->nxtlist = NULL; | 934 | rdp->nxtlist = NULL; |
| @@ -914,7 +936,7 @@ static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp) | |||
| 914 | rdp->nxttail[i] = &rdp->nxtlist; | 936 | rdp->nxttail[i] = &rdp->nxtlist; |
| 915 | rsp->orphan_qlen += rdp->qlen; | 937 | rsp->orphan_qlen += rdp->qlen; |
| 916 | rdp->qlen = 0; | 938 | rdp->qlen = 0; |
| 917 | spin_unlock(&rsp->onofflock); /* irqs remain disabled. */ | 939 | raw_spin_unlock(&rsp->onofflock); /* irqs remain disabled. */ |
| 918 | } | 940 | } |
| 919 | 941 | ||
| 920 | /* | 942 | /* |
| @@ -925,10 +947,10 @@ static void rcu_adopt_orphan_cbs(struct rcu_state *rsp) | |||
| 925 | unsigned long flags; | 947 | unsigned long flags; |
| 926 | struct rcu_data *rdp; | 948 | struct rcu_data *rdp; |
| 927 | 949 | ||
| 928 | spin_lock_irqsave(&rsp->onofflock, flags); | 950 | raw_spin_lock_irqsave(&rsp->onofflock, flags); |
| 929 | rdp = rsp->rda[smp_processor_id()]; | 951 | rdp = rsp->rda[smp_processor_id()]; |
| 930 | if (rsp->orphan_cbs_list == NULL) { | 952 | if (rsp->orphan_cbs_list == NULL) { |
| 931 | spin_unlock_irqrestore(&rsp->onofflock, flags); | 953 | raw_spin_unlock_irqrestore(&rsp->onofflock, flags); |
| 932 | return; | 954 | return; |
| 933 | } | 955 | } |
| 934 | *rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_list; | 956 | *rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_list; |
| @@ -937,7 +959,7 @@ static void rcu_adopt_orphan_cbs(struct rcu_state *rsp) | |||
| 937 | rsp->orphan_cbs_list = NULL; | 959 | rsp->orphan_cbs_list = NULL; |
| 938 | rsp->orphan_cbs_tail = &rsp->orphan_cbs_list; | 960 | rsp->orphan_cbs_tail = &rsp->orphan_cbs_list; |
| 939 | rsp->orphan_qlen = 0; | 961 | rsp->orphan_qlen = 0; |
| 940 | spin_unlock_irqrestore(&rsp->onofflock, flags); | 962 | raw_spin_unlock_irqrestore(&rsp->onofflock, flags); |
| 941 | } | 963 | } |
| 942 | 964 | ||
| 943 | /* | 965 | /* |
| @@ -953,23 +975,23 @@ static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp) | |||
| 953 | struct rcu_node *rnp; | 975 | struct rcu_node *rnp; |
| 954 | 976 | ||
| 955 | /* Exclude any attempts to start a new grace period. */ | 977 | /* Exclude any attempts to start a new grace period. */ |
| 956 | spin_lock_irqsave(&rsp->onofflock, flags); | 978 | raw_spin_lock_irqsave(&rsp->onofflock, flags); |
| 957 | 979 | ||
| 958 | /* Remove the outgoing CPU from the masks in the rcu_node hierarchy. */ | 980 | /* Remove the outgoing CPU from the masks in the rcu_node hierarchy. */ |
| 959 | rnp = rdp->mynode; /* this is the outgoing CPU's rnp. */ | 981 | rnp = rdp->mynode; /* this is the outgoing CPU's rnp. */ |
| 960 | mask = rdp->grpmask; /* rnp->grplo is constant. */ | 982 | mask = rdp->grpmask; /* rnp->grplo is constant. */ |
| 961 | do { | 983 | do { |
| 962 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 984 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 963 | rnp->qsmaskinit &= ~mask; | 985 | rnp->qsmaskinit &= ~mask; |
| 964 | if (rnp->qsmaskinit != 0) { | 986 | if (rnp->qsmaskinit != 0) { |
| 965 | if (rnp != rdp->mynode) | 987 | if (rnp != rdp->mynode) |
| 966 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 988 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 967 | break; | 989 | break; |
| 968 | } | 990 | } |
| 969 | if (rnp == rdp->mynode) | 991 | if (rnp == rdp->mynode) |
| 970 | need_report = rcu_preempt_offline_tasks(rsp, rnp, rdp); | 992 | need_report = rcu_preempt_offline_tasks(rsp, rnp, rdp); |
| 971 | else | 993 | else |
| 972 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 994 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 973 | mask = rnp->grpmask; | 995 | mask = rnp->grpmask; |
| 974 | rnp = rnp->parent; | 996 | rnp = rnp->parent; |
| 975 | } while (rnp != NULL); | 997 | } while (rnp != NULL); |
| @@ -980,12 +1002,12 @@ static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp) | |||
| 980 | * because invoking rcu_report_unblock_qs_rnp() with ->onofflock | 1002 | * because invoking rcu_report_unblock_qs_rnp() with ->onofflock |
| 981 | * held leads to deadlock. | 1003 | * held leads to deadlock. |
| 982 | */ | 1004 | */ |
| 983 | spin_unlock(&rsp->onofflock); /* irqs remain disabled. */ | 1005 | raw_spin_unlock(&rsp->onofflock); /* irqs remain disabled. */ |
| 984 | rnp = rdp->mynode; | 1006 | rnp = rdp->mynode; |
| 985 | if (need_report & RCU_OFL_TASKS_NORM_GP) | 1007 | if (need_report & RCU_OFL_TASKS_NORM_GP) |
| 986 | rcu_report_unblock_qs_rnp(rnp, flags); | 1008 | rcu_report_unblock_qs_rnp(rnp, flags); |
| 987 | else | 1009 | else |
| 988 | spin_unlock_irqrestore(&rnp->lock, flags); | 1010 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 989 | if (need_report & RCU_OFL_TASKS_EXP_GP) | 1011 | if (need_report & RCU_OFL_TASKS_EXP_GP) |
| 990 | rcu_report_exp_rnp(rsp, rnp); | 1012 | rcu_report_exp_rnp(rsp, rnp); |
| 991 | 1013 | ||
| @@ -1144,11 +1166,9 @@ void rcu_check_callbacks(int cpu, int user) | |||
| 1144 | /* | 1166 | /* |
| 1145 | * Scan the leaf rcu_node structures, processing dyntick state for any that | 1167 | * Scan the leaf rcu_node structures, processing dyntick state for any that |
| 1146 | * have not yet encountered a quiescent state, using the function specified. | 1168 | * have not yet encountered a quiescent state, using the function specified. |
| 1147 | * Returns 1 if the current grace period ends while scanning (possibly | 1169 | * The caller must have suppressed start of new grace periods. |
| 1148 | * because we made it end). | ||
| 1149 | */ | 1170 | */ |
| 1150 | static int rcu_process_dyntick(struct rcu_state *rsp, long lastcomp, | 1171 | static void force_qs_rnp(struct rcu_state *rsp, int (*f)(struct rcu_data *)) |
| 1151 | int (*f)(struct rcu_data *)) | ||
| 1152 | { | 1172 | { |
| 1153 | unsigned long bit; | 1173 | unsigned long bit; |
| 1154 | int cpu; | 1174 | int cpu; |
| @@ -1158,13 +1178,13 @@ static int rcu_process_dyntick(struct rcu_state *rsp, long lastcomp, | |||
| 1158 | 1178 | ||
| 1159 | rcu_for_each_leaf_node(rsp, rnp) { | 1179 | rcu_for_each_leaf_node(rsp, rnp) { |
| 1160 | mask = 0; | 1180 | mask = 0; |
| 1161 | spin_lock_irqsave(&rnp->lock, flags); | 1181 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 1162 | if (rnp->completed != lastcomp) { | 1182 | if (!rcu_gp_in_progress(rsp)) { |
| 1163 | spin_unlock_irqrestore(&rnp->lock, flags); | 1183 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 1164 | return 1; | 1184 | return; |
| 1165 | } | 1185 | } |
| 1166 | if (rnp->qsmask == 0) { | 1186 | if (rnp->qsmask == 0) { |
| 1167 | spin_unlock_irqrestore(&rnp->lock, flags); | 1187 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 1168 | continue; | 1188 | continue; |
| 1169 | } | 1189 | } |
| 1170 | cpu = rnp->grplo; | 1190 | cpu = rnp->grplo; |
| @@ -1173,15 +1193,14 @@ static int rcu_process_dyntick(struct rcu_state *rsp, long lastcomp, | |||
| 1173 | if ((rnp->qsmask & bit) != 0 && f(rsp->rda[cpu])) | 1193 | if ((rnp->qsmask & bit) != 0 && f(rsp->rda[cpu])) |
| 1174 | mask |= bit; | 1194 | mask |= bit; |
| 1175 | } | 1195 | } |
| 1176 | if (mask != 0 && rnp->completed == lastcomp) { | 1196 | if (mask != 0) { |
| 1177 | 1197 | ||
| 1178 | /* rcu_report_qs_rnp() releases rnp->lock. */ | 1198 | /* rcu_report_qs_rnp() releases rnp->lock. */ |
| 1179 | rcu_report_qs_rnp(mask, rsp, rnp, flags); | 1199 | rcu_report_qs_rnp(mask, rsp, rnp, flags); |
| 1180 | continue; | 1200 | continue; |
| 1181 | } | 1201 | } |
| 1182 | spin_unlock_irqrestore(&rnp->lock, flags); | 1202 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 1183 | } | 1203 | } |
| 1184 | return 0; | ||
| 1185 | } | 1204 | } |
| 1186 | 1205 | ||
| 1187 | /* | 1206 | /* |
| @@ -1191,32 +1210,26 @@ static int rcu_process_dyntick(struct rcu_state *rsp, long lastcomp, | |||
| 1191 | static void force_quiescent_state(struct rcu_state *rsp, int relaxed) | 1210 | static void force_quiescent_state(struct rcu_state *rsp, int relaxed) |
| 1192 | { | 1211 | { |
| 1193 | unsigned long flags; | 1212 | unsigned long flags; |
| 1194 | long lastcomp; | ||
| 1195 | struct rcu_node *rnp = rcu_get_root(rsp); | 1213 | struct rcu_node *rnp = rcu_get_root(rsp); |
| 1196 | u8 signaled; | ||
| 1197 | u8 forcenow; | ||
| 1198 | 1214 | ||
| 1199 | if (!rcu_gp_in_progress(rsp)) | 1215 | if (!rcu_gp_in_progress(rsp)) |
| 1200 | return; /* No grace period in progress, nothing to force. */ | 1216 | return; /* No grace period in progress, nothing to force. */ |
| 1201 | if (!spin_trylock_irqsave(&rsp->fqslock, flags)) { | 1217 | if (!raw_spin_trylock_irqsave(&rsp->fqslock, flags)) { |
| 1202 | rsp->n_force_qs_lh++; /* Inexact, can lose counts. Tough! */ | 1218 | rsp->n_force_qs_lh++; /* Inexact, can lose counts. Tough! */ |
| 1203 | return; /* Someone else is already on the job. */ | 1219 | return; /* Someone else is already on the job. */ |
| 1204 | } | 1220 | } |
| 1205 | if (relaxed && | 1221 | if (relaxed && ULONG_CMP_GE(rsp->jiffies_force_qs, jiffies)) |
| 1206 | (long)(rsp->jiffies_force_qs - jiffies) >= 0) | 1222 | goto unlock_fqs_ret; /* no emergency and done recently. */ |
| 1207 | goto unlock_ret; /* no emergency and done recently. */ | ||
| 1208 | rsp->n_force_qs++; | 1223 | rsp->n_force_qs++; |
| 1209 | spin_lock(&rnp->lock); | 1224 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ |
| 1210 | lastcomp = rsp->gpnum - 1; | ||
| 1211 | signaled = rsp->signaled; | ||
| 1212 | rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS; | 1225 | rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS; |
| 1213 | if(!rcu_gp_in_progress(rsp)) { | 1226 | if(!rcu_gp_in_progress(rsp)) { |
| 1214 | rsp->n_force_qs_ngp++; | 1227 | rsp->n_force_qs_ngp++; |
| 1215 | spin_unlock(&rnp->lock); | 1228 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
| 1216 | goto unlock_ret; /* no GP in progress, time updated. */ | 1229 | goto unlock_fqs_ret; /* no GP in progress, time updated. */ |
| 1217 | } | 1230 | } |
| 1218 | spin_unlock(&rnp->lock); | 1231 | rsp->fqs_active = 1; |
| 1219 | switch (signaled) { | 1232 | switch (rsp->signaled) { |
| 1220 | case RCU_GP_IDLE: | 1233 | case RCU_GP_IDLE: |
| 1221 | case RCU_GP_INIT: | 1234 | case RCU_GP_INIT: |
| 1222 | 1235 | ||
| @@ -1224,45 +1237,38 @@ static void force_quiescent_state(struct rcu_state *rsp, int relaxed) | |||
| 1224 | 1237 | ||
| 1225 | case RCU_SAVE_DYNTICK: | 1238 | case RCU_SAVE_DYNTICK: |
| 1226 | 1239 | ||
| 1240 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ | ||
| 1227 | if (RCU_SIGNAL_INIT != RCU_SAVE_DYNTICK) | 1241 | if (RCU_SIGNAL_INIT != RCU_SAVE_DYNTICK) |
| 1228 | break; /* So gcc recognizes the dead code. */ | 1242 | break; /* So gcc recognizes the dead code. */ |
| 1229 | 1243 | ||
| 1230 | /* Record dyntick-idle state. */ | 1244 | /* Record dyntick-idle state. */ |
| 1231 | if (rcu_process_dyntick(rsp, lastcomp, | 1245 | force_qs_rnp(rsp, dyntick_save_progress_counter); |
| 1232 | dyntick_save_progress_counter)) | 1246 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ |
| 1233 | goto unlock_ret; | 1247 | if (rcu_gp_in_progress(rsp)) |
| 1234 | /* fall into next case. */ | ||
| 1235 | |||
| 1236 | case RCU_SAVE_COMPLETED: | ||
| 1237 | |||
| 1238 | /* Update state, record completion counter. */ | ||
| 1239 | forcenow = 0; | ||
| 1240 | spin_lock(&rnp->lock); | ||
| 1241 | if (lastcomp + 1 == rsp->gpnum && | ||
| 1242 | lastcomp == rsp->completed && | ||
| 1243 | rsp->signaled == signaled) { | ||
| 1244 | rsp->signaled = RCU_FORCE_QS; | 1248 | rsp->signaled = RCU_FORCE_QS; |
| 1245 | rsp->completed_fqs = lastcomp; | 1249 | break; |
| 1246 | forcenow = signaled == RCU_SAVE_COMPLETED; | ||
| 1247 | } | ||
| 1248 | spin_unlock(&rnp->lock); | ||
| 1249 | if (!forcenow) | ||
| 1250 | break; | ||
| 1251 | /* fall into next case. */ | ||
| 1252 | 1250 | ||
| 1253 | case RCU_FORCE_QS: | 1251 | case RCU_FORCE_QS: |
| 1254 | 1252 | ||
| 1255 | /* Check dyntick-idle state, send IPI to laggarts. */ | 1253 | /* Check dyntick-idle state, send IPI to laggarts. */ |
| 1256 | if (rcu_process_dyntick(rsp, rsp->completed_fqs, | 1254 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
| 1257 | rcu_implicit_dynticks_qs)) | 1255 | force_qs_rnp(rsp, rcu_implicit_dynticks_qs); |
| 1258 | goto unlock_ret; | ||
| 1259 | 1256 | ||
| 1260 | /* Leave state in case more forcing is required. */ | 1257 | /* Leave state in case more forcing is required. */ |
| 1261 | 1258 | ||
| 1259 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ | ||
| 1262 | break; | 1260 | break; |
| 1263 | } | 1261 | } |
| 1264 | unlock_ret: | 1262 | rsp->fqs_active = 0; |
| 1265 | spin_unlock_irqrestore(&rsp->fqslock, flags); | 1263 | if (rsp->fqs_need_gp) { |
| 1264 | raw_spin_unlock(&rsp->fqslock); /* irqs remain disabled */ | ||
| 1265 | rsp->fqs_need_gp = 0; | ||
| 1266 | rcu_start_gp(rsp, flags); /* releases rnp->lock */ | ||
| 1267 | return; | ||
| 1268 | } | ||
| 1269 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ | ||
| 1270 | unlock_fqs_ret: | ||
| 1271 | raw_spin_unlock_irqrestore(&rsp->fqslock, flags); | ||
| 1266 | } | 1272 | } |
| 1267 | 1273 | ||
| 1268 | #else /* #ifdef CONFIG_SMP */ | 1274 | #else /* #ifdef CONFIG_SMP */ |
| @@ -1290,7 +1296,7 @@ __rcu_process_callbacks(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 1290 | * If an RCU GP has gone long enough, go check for dyntick | 1296 | * If an RCU GP has gone long enough, go check for dyntick |
| 1291 | * idle CPUs and, if needed, send resched IPIs. | 1297 | * idle CPUs and, if needed, send resched IPIs. |
| 1292 | */ | 1298 | */ |
| 1293 | if ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0) | 1299 | if (ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies)) |
| 1294 | force_quiescent_state(rsp, 1); | 1300 | force_quiescent_state(rsp, 1); |
| 1295 | 1301 | ||
| 1296 | /* | 1302 | /* |
| @@ -1304,7 +1310,7 @@ __rcu_process_callbacks(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 1304 | 1310 | ||
| 1305 | /* Does this CPU require a not-yet-started grace period? */ | 1311 | /* Does this CPU require a not-yet-started grace period? */ |
| 1306 | if (cpu_needs_another_gp(rsp, rdp)) { | 1312 | if (cpu_needs_another_gp(rsp, rdp)) { |
| 1307 | spin_lock_irqsave(&rcu_get_root(rsp)->lock, flags); | 1313 | raw_spin_lock_irqsave(&rcu_get_root(rsp)->lock, flags); |
| 1308 | rcu_start_gp(rsp, flags); /* releases above lock */ | 1314 | rcu_start_gp(rsp, flags); /* releases above lock */ |
| 1309 | } | 1315 | } |
| 1310 | 1316 | ||
| @@ -1335,6 +1341,9 @@ static void rcu_process_callbacks(struct softirq_action *unused) | |||
| 1335 | * grace-period manipulations above. | 1341 | * grace-period manipulations above. |
| 1336 | */ | 1342 | */ |
| 1337 | smp_mb(); /* See above block comment. */ | 1343 | smp_mb(); /* See above block comment. */ |
| 1344 | |||
| 1345 | /* If we are last CPU on way to dyntick-idle mode, accelerate it. */ | ||
| 1346 | rcu_needs_cpu_flush(); | ||
| 1338 | } | 1347 | } |
| 1339 | 1348 | ||
| 1340 | static void | 1349 | static void |
| @@ -1369,7 +1378,7 @@ __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu), | |||
| 1369 | unsigned long nestflag; | 1378 | unsigned long nestflag; |
| 1370 | struct rcu_node *rnp_root = rcu_get_root(rsp); | 1379 | struct rcu_node *rnp_root = rcu_get_root(rsp); |
| 1371 | 1380 | ||
| 1372 | spin_lock_irqsave(&rnp_root->lock, nestflag); | 1381 | raw_spin_lock_irqsave(&rnp_root->lock, nestflag); |
| 1373 | rcu_start_gp(rsp, nestflag); /* releases rnp_root->lock. */ | 1382 | rcu_start_gp(rsp, nestflag); /* releases rnp_root->lock. */ |
| 1374 | } | 1383 | } |
| 1375 | 1384 | ||
| @@ -1387,7 +1396,7 @@ __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu), | |||
| 1387 | force_quiescent_state(rsp, 0); | 1396 | force_quiescent_state(rsp, 0); |
| 1388 | rdp->n_force_qs_snap = rsp->n_force_qs; | 1397 | rdp->n_force_qs_snap = rsp->n_force_qs; |
| 1389 | rdp->qlen_last_fqs_check = rdp->qlen; | 1398 | rdp->qlen_last_fqs_check = rdp->qlen; |
| 1390 | } else if ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0) | 1399 | } else if (ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies)) |
| 1391 | force_quiescent_state(rsp, 1); | 1400 | force_quiescent_state(rsp, 1); |
| 1392 | local_irq_restore(flags); | 1401 | local_irq_restore(flags); |
| 1393 | } | 1402 | } |
| @@ -1520,7 +1529,7 @@ static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 1520 | 1529 | ||
| 1521 | /* Has an RCU GP gone long enough to send resched IPIs &c? */ | 1530 | /* Has an RCU GP gone long enough to send resched IPIs &c? */ |
| 1522 | if (rcu_gp_in_progress(rsp) && | 1531 | if (rcu_gp_in_progress(rsp) && |
| 1523 | ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0)) { | 1532 | ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies)) { |
| 1524 | rdp->n_rp_need_fqs++; | 1533 | rdp->n_rp_need_fqs++; |
| 1525 | return 1; | 1534 | return 1; |
| 1526 | } | 1535 | } |
| @@ -1545,10 +1554,9 @@ static int rcu_pending(int cpu) | |||
| 1545 | /* | 1554 | /* |
| 1546 | * Check to see if any future RCU-related work will need to be done | 1555 | * Check to see if any future RCU-related work will need to be done |
| 1547 | * by the current CPU, even if none need be done immediately, returning | 1556 | * by the current CPU, even if none need be done immediately, returning |
| 1548 | * 1 if so. This function is part of the RCU implementation; it is -not- | 1557 | * 1 if so. |
| 1549 | * an exported member of the RCU API. | ||
| 1550 | */ | 1558 | */ |
| 1551 | int rcu_needs_cpu(int cpu) | 1559 | static int rcu_needs_cpu_quick_check(int cpu) |
| 1552 | { | 1560 | { |
| 1553 | /* RCU callbacks either ready or pending? */ | 1561 | /* RCU callbacks either ready or pending? */ |
| 1554 | return per_cpu(rcu_sched_data, cpu).nxtlist || | 1562 | return per_cpu(rcu_sched_data, cpu).nxtlist || |
| @@ -1556,21 +1564,6 @@ int rcu_needs_cpu(int cpu) | |||
| 1556 | rcu_preempt_needs_cpu(cpu); | 1564 | rcu_preempt_needs_cpu(cpu); |
| 1557 | } | 1565 | } |
| 1558 | 1566 | ||
| 1559 | /* | ||
| 1560 | * This function is invoked towards the end of the scheduler's initialization | ||
| 1561 | * process. Before this is called, the idle task might contain | ||
| 1562 | * RCU read-side critical sections (during which time, this idle | ||
| 1563 | * task is booting the system). After this function is called, the | ||
| 1564 | * idle tasks are prohibited from containing RCU read-side critical | ||
| 1565 | * sections. | ||
| 1566 | */ | ||
| 1567 | void rcu_scheduler_starting(void) | ||
| 1568 | { | ||
| 1569 | WARN_ON(num_online_cpus() != 1); | ||
| 1570 | WARN_ON(nr_context_switches() > 0); | ||
| 1571 | rcu_scheduler_active = 1; | ||
| 1572 | } | ||
| 1573 | |||
| 1574 | static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL}; | 1567 | static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL}; |
| 1575 | static atomic_t rcu_barrier_cpu_count; | 1568 | static atomic_t rcu_barrier_cpu_count; |
| 1576 | static DEFINE_MUTEX(rcu_barrier_mutex); | 1569 | static DEFINE_MUTEX(rcu_barrier_mutex); |
| @@ -1659,7 +1652,7 @@ rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp) | |||
| 1659 | struct rcu_node *rnp = rcu_get_root(rsp); | 1652 | struct rcu_node *rnp = rcu_get_root(rsp); |
| 1660 | 1653 | ||
| 1661 | /* Set up local state, ensuring consistent view of global state. */ | 1654 | /* Set up local state, ensuring consistent view of global state. */ |
| 1662 | spin_lock_irqsave(&rnp->lock, flags); | 1655 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 1663 | rdp->grpmask = 1UL << (cpu - rdp->mynode->grplo); | 1656 | rdp->grpmask = 1UL << (cpu - rdp->mynode->grplo); |
| 1664 | rdp->nxtlist = NULL; | 1657 | rdp->nxtlist = NULL; |
| 1665 | for (i = 0; i < RCU_NEXT_SIZE; i++) | 1658 | for (i = 0; i < RCU_NEXT_SIZE; i++) |
| @@ -1669,7 +1662,7 @@ rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp) | |||
| 1669 | rdp->dynticks = &per_cpu(rcu_dynticks, cpu); | 1662 | rdp->dynticks = &per_cpu(rcu_dynticks, cpu); |
| 1670 | #endif /* #ifdef CONFIG_NO_HZ */ | 1663 | #endif /* #ifdef CONFIG_NO_HZ */ |
| 1671 | rdp->cpu = cpu; | 1664 | rdp->cpu = cpu; |
| 1672 | spin_unlock_irqrestore(&rnp->lock, flags); | 1665 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 1673 | } | 1666 | } |
| 1674 | 1667 | ||
| 1675 | /* | 1668 | /* |
| @@ -1687,7 +1680,7 @@ rcu_init_percpu_data(int cpu, struct rcu_state *rsp, int preemptable) | |||
| 1687 | struct rcu_node *rnp = rcu_get_root(rsp); | 1680 | struct rcu_node *rnp = rcu_get_root(rsp); |
| 1688 | 1681 | ||
| 1689 | /* Set up local state, ensuring consistent view of global state. */ | 1682 | /* Set up local state, ensuring consistent view of global state. */ |
| 1690 | spin_lock_irqsave(&rnp->lock, flags); | 1683 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 1691 | rdp->passed_quiesc = 0; /* We could be racing with new GP, */ | 1684 | rdp->passed_quiesc = 0; /* We could be racing with new GP, */ |
| 1692 | rdp->qs_pending = 1; /* so set up to respond to current GP. */ | 1685 | rdp->qs_pending = 1; /* so set up to respond to current GP. */ |
| 1693 | rdp->beenonline = 1; /* We have now been online. */ | 1686 | rdp->beenonline = 1; /* We have now been online. */ |
| @@ -1695,7 +1688,7 @@ rcu_init_percpu_data(int cpu, struct rcu_state *rsp, int preemptable) | |||
| 1695 | rdp->qlen_last_fqs_check = 0; | 1688 | rdp->qlen_last_fqs_check = 0; |
| 1696 | rdp->n_force_qs_snap = rsp->n_force_qs; | 1689 | rdp->n_force_qs_snap = rsp->n_force_qs; |
| 1697 | rdp->blimit = blimit; | 1690 | rdp->blimit = blimit; |
| 1698 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 1691 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 1699 | 1692 | ||
| 1700 | /* | 1693 | /* |
| 1701 | * A new grace period might start here. If so, we won't be part | 1694 | * A new grace period might start here. If so, we won't be part |
| @@ -1703,14 +1696,14 @@ rcu_init_percpu_data(int cpu, struct rcu_state *rsp, int preemptable) | |||
| 1703 | */ | 1696 | */ |
| 1704 | 1697 | ||
| 1705 | /* Exclude any attempts to start a new GP on large systems. */ | 1698 | /* Exclude any attempts to start a new GP on large systems. */ |
| 1706 | spin_lock(&rsp->onofflock); /* irqs already disabled. */ | 1699 | raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */ |
| 1707 | 1700 | ||
| 1708 | /* Add CPU to rcu_node bitmasks. */ | 1701 | /* Add CPU to rcu_node bitmasks. */ |
| 1709 | rnp = rdp->mynode; | 1702 | rnp = rdp->mynode; |
| 1710 | mask = rdp->grpmask; | 1703 | mask = rdp->grpmask; |
| 1711 | do { | 1704 | do { |
| 1712 | /* Exclude any attempts to start a new GP on small systems. */ | 1705 | /* Exclude any attempts to start a new GP on small systems. */ |
| 1713 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 1706 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 1714 | rnp->qsmaskinit |= mask; | 1707 | rnp->qsmaskinit |= mask; |
| 1715 | mask = rnp->grpmask; | 1708 | mask = rnp->grpmask; |
| 1716 | if (rnp == rdp->mynode) { | 1709 | if (rnp == rdp->mynode) { |
| @@ -1718,11 +1711,11 @@ rcu_init_percpu_data(int cpu, struct rcu_state *rsp, int preemptable) | |||
| 1718 | rdp->completed = rnp->completed; | 1711 | rdp->completed = rnp->completed; |
| 1719 | rdp->passed_quiesc_completed = rnp->completed - 1; | 1712 | rdp->passed_quiesc_completed = rnp->completed - 1; |
| 1720 | } | 1713 | } |
| 1721 | spin_unlock(&rnp->lock); /* irqs already disabled. */ | 1714 | raw_spin_unlock(&rnp->lock); /* irqs already disabled. */ |
| 1722 | rnp = rnp->parent; | 1715 | rnp = rnp->parent; |
| 1723 | } while (rnp != NULL && !(rnp->qsmaskinit & mask)); | 1716 | } while (rnp != NULL && !(rnp->qsmaskinit & mask)); |
| 1724 | 1717 | ||
| 1725 | spin_unlock_irqrestore(&rsp->onofflock, flags); | 1718 | raw_spin_unlock_irqrestore(&rsp->onofflock, flags); |
| 1726 | } | 1719 | } |
| 1727 | 1720 | ||
| 1728 | static void __cpuinit rcu_online_cpu(int cpu) | 1721 | static void __cpuinit rcu_online_cpu(int cpu) |
| @@ -1806,11 +1799,17 @@ static void __init rcu_init_levelspread(struct rcu_state *rsp) | |||
| 1806 | */ | 1799 | */ |
| 1807 | static void __init rcu_init_one(struct rcu_state *rsp) | 1800 | static void __init rcu_init_one(struct rcu_state *rsp) |
| 1808 | { | 1801 | { |
| 1802 | static char *buf[] = { "rcu_node_level_0", | ||
| 1803 | "rcu_node_level_1", | ||
| 1804 | "rcu_node_level_2", | ||
| 1805 | "rcu_node_level_3" }; /* Match MAX_RCU_LVLS */ | ||
| 1809 | int cpustride = 1; | 1806 | int cpustride = 1; |
| 1810 | int i; | 1807 | int i; |
| 1811 | int j; | 1808 | int j; |
| 1812 | struct rcu_node *rnp; | 1809 | struct rcu_node *rnp; |
| 1813 | 1810 | ||
| 1811 | BUILD_BUG_ON(MAX_RCU_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */ | ||
| 1812 | |||
| 1814 | /* Initialize the level-tracking arrays. */ | 1813 | /* Initialize the level-tracking arrays. */ |
| 1815 | 1814 | ||
| 1816 | for (i = 1; i < NUM_RCU_LVLS; i++) | 1815 | for (i = 1; i < NUM_RCU_LVLS; i++) |
| @@ -1823,8 +1822,9 @@ static void __init rcu_init_one(struct rcu_state *rsp) | |||
| 1823 | cpustride *= rsp->levelspread[i]; | 1822 | cpustride *= rsp->levelspread[i]; |
| 1824 | rnp = rsp->level[i]; | 1823 | rnp = rsp->level[i]; |
| 1825 | for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) { | 1824 | for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) { |
| 1826 | spin_lock_init(&rnp->lock); | 1825 | raw_spin_lock_init(&rnp->lock); |
| 1827 | lockdep_set_class(&rnp->lock, &rcu_node_class[i]); | 1826 | lockdep_set_class_and_name(&rnp->lock, |
| 1827 | &rcu_node_class[i], buf[i]); | ||
| 1828 | rnp->gpnum = 0; | 1828 | rnp->gpnum = 0; |
| 1829 | rnp->qsmask = 0; | 1829 | rnp->qsmask = 0; |
| 1830 | rnp->qsmaskinit = 0; | 1830 | rnp->qsmaskinit = 0; |
| @@ -1876,7 +1876,7 @@ do { \ | |||
| 1876 | 1876 | ||
| 1877 | void __init rcu_init(void) | 1877 | void __init rcu_init(void) |
| 1878 | { | 1878 | { |
| 1879 | int i; | 1879 | int cpu; |
| 1880 | 1880 | ||
| 1881 | rcu_bootup_announce(); | 1881 | rcu_bootup_announce(); |
| 1882 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR | 1882 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR |
| @@ -1896,8 +1896,8 @@ void __init rcu_init(void) | |||
| 1896 | * or the scheduler are operational. | 1896 | * or the scheduler are operational. |
| 1897 | */ | 1897 | */ |
| 1898 | cpu_notifier(rcu_cpu_notify, 0); | 1898 | cpu_notifier(rcu_cpu_notify, 0); |
| 1899 | for_each_online_cpu(i) | 1899 | for_each_online_cpu(cpu) |
| 1900 | rcu_cpu_notify(NULL, CPU_UP_PREPARE, (void *)(long)i); | 1900 | rcu_cpu_notify(NULL, CPU_UP_PREPARE, (void *)(long)cpu); |
| 1901 | } | 1901 | } |
| 1902 | 1902 | ||
| 1903 | #include "rcutree_plugin.h" | 1903 | #include "rcutree_plugin.h" |
diff --git a/kernel/rcutree.h b/kernel/rcutree.h index d2a0046f63b2..1439eb504c22 100644 --- a/kernel/rcutree.h +++ b/kernel/rcutree.h | |||
| @@ -90,12 +90,12 @@ struct rcu_dynticks { | |||
| 90 | * Definition for node within the RCU grace-period-detection hierarchy. | 90 | * Definition for node within the RCU grace-period-detection hierarchy. |
| 91 | */ | 91 | */ |
| 92 | struct rcu_node { | 92 | struct rcu_node { |
| 93 | spinlock_t lock; /* Root rcu_node's lock protects some */ | 93 | raw_spinlock_t lock; /* Root rcu_node's lock protects some */ |
| 94 | /* rcu_state fields as well as following. */ | 94 | /* rcu_state fields as well as following. */ |
| 95 | long gpnum; /* Current grace period for this node. */ | 95 | unsigned long gpnum; /* Current grace period for this node. */ |
| 96 | /* This will either be equal to or one */ | 96 | /* This will either be equal to or one */ |
| 97 | /* behind the root rcu_node's gpnum. */ | 97 | /* behind the root rcu_node's gpnum. */ |
| 98 | long completed; /* Last grace period completed for this node. */ | 98 | unsigned long completed; /* Last GP completed for this node. */ |
| 99 | /* This will either be equal to or one */ | 99 | /* This will either be equal to or one */ |
| 100 | /* behind the root rcu_node's gpnum. */ | 100 | /* behind the root rcu_node's gpnum. */ |
| 101 | unsigned long qsmask; /* CPUs or groups that need to switch in */ | 101 | unsigned long qsmask; /* CPUs or groups that need to switch in */ |
| @@ -161,11 +161,11 @@ struct rcu_node { | |||
| 161 | /* Per-CPU data for read-copy update. */ | 161 | /* Per-CPU data for read-copy update. */ |
| 162 | struct rcu_data { | 162 | struct rcu_data { |
| 163 | /* 1) quiescent-state and grace-period handling : */ | 163 | /* 1) quiescent-state and grace-period handling : */ |
| 164 | long completed; /* Track rsp->completed gp number */ | 164 | unsigned long completed; /* Track rsp->completed gp number */ |
| 165 | /* in order to detect GP end. */ | 165 | /* in order to detect GP end. */ |
| 166 | long gpnum; /* Highest gp number that this CPU */ | 166 | unsigned long gpnum; /* Highest gp number that this CPU */ |
| 167 | /* is aware of having started. */ | 167 | /* is aware of having started. */ |
| 168 | long passed_quiesc_completed; | 168 | unsigned long passed_quiesc_completed; |
| 169 | /* Value of completed at time of qs. */ | 169 | /* Value of completed at time of qs. */ |
| 170 | bool passed_quiesc; /* User-mode/idle loop etc. */ | 170 | bool passed_quiesc; /* User-mode/idle loop etc. */ |
| 171 | bool qs_pending; /* Core waits for quiesc state. */ | 171 | bool qs_pending; /* Core waits for quiesc state. */ |
| @@ -221,14 +221,14 @@ struct rcu_data { | |||
| 221 | unsigned long resched_ipi; /* Sent a resched IPI. */ | 221 | unsigned long resched_ipi; /* Sent a resched IPI. */ |
| 222 | 222 | ||
| 223 | /* 5) __rcu_pending() statistics. */ | 223 | /* 5) __rcu_pending() statistics. */ |
| 224 | long n_rcu_pending; /* rcu_pending() calls since boot. */ | 224 | unsigned long n_rcu_pending; /* rcu_pending() calls since boot. */ |
| 225 | long n_rp_qs_pending; | 225 | unsigned long n_rp_qs_pending; |
| 226 | long n_rp_cb_ready; | 226 | unsigned long n_rp_cb_ready; |
| 227 | long n_rp_cpu_needs_gp; | 227 | unsigned long n_rp_cpu_needs_gp; |
| 228 | long n_rp_gp_completed; | 228 | unsigned long n_rp_gp_completed; |
| 229 | long n_rp_gp_started; | 229 | unsigned long n_rp_gp_started; |
| 230 | long n_rp_need_fqs; | 230 | unsigned long n_rp_need_fqs; |
| 231 | long n_rp_need_nothing; | 231 | unsigned long n_rp_need_nothing; |
| 232 | 232 | ||
| 233 | int cpu; | 233 | int cpu; |
| 234 | }; | 234 | }; |
| @@ -237,12 +237,11 @@ struct rcu_data { | |||
| 237 | #define RCU_GP_IDLE 0 /* No grace period in progress. */ | 237 | #define RCU_GP_IDLE 0 /* No grace period in progress. */ |
| 238 | #define RCU_GP_INIT 1 /* Grace period being initialized. */ | 238 | #define RCU_GP_INIT 1 /* Grace period being initialized. */ |
| 239 | #define RCU_SAVE_DYNTICK 2 /* Need to scan dyntick state. */ | 239 | #define RCU_SAVE_DYNTICK 2 /* Need to scan dyntick state. */ |
| 240 | #define RCU_SAVE_COMPLETED 3 /* Need to save rsp->completed. */ | 240 | #define RCU_FORCE_QS 3 /* Need to force quiescent state. */ |
| 241 | #define RCU_FORCE_QS 4 /* Need to force quiescent state. */ | ||
| 242 | #ifdef CONFIG_NO_HZ | 241 | #ifdef CONFIG_NO_HZ |
| 243 | #define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK | 242 | #define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK |
| 244 | #else /* #ifdef CONFIG_NO_HZ */ | 243 | #else /* #ifdef CONFIG_NO_HZ */ |
| 245 | #define RCU_SIGNAL_INIT RCU_SAVE_COMPLETED | 244 | #define RCU_SIGNAL_INIT RCU_FORCE_QS |
| 246 | #endif /* #else #ifdef CONFIG_NO_HZ */ | 245 | #endif /* #else #ifdef CONFIG_NO_HZ */ |
| 247 | 246 | ||
| 248 | #define RCU_JIFFIES_TILL_FORCE_QS 3 /* for rsp->jiffies_force_qs */ | 247 | #define RCU_JIFFIES_TILL_FORCE_QS 3 /* for rsp->jiffies_force_qs */ |
| @@ -256,6 +255,9 @@ struct rcu_data { | |||
| 256 | 255 | ||
| 257 | #endif /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */ | 256 | #endif /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */ |
| 258 | 257 | ||
| 258 | #define ULONG_CMP_GE(a, b) (ULONG_MAX / 2 >= (a) - (b)) | ||
| 259 | #define ULONG_CMP_LT(a, b) (ULONG_MAX / 2 < (a) - (b)) | ||
| 260 | |||
| 259 | /* | 261 | /* |
| 260 | * RCU global state, including node hierarchy. This hierarchy is | 262 | * RCU global state, including node hierarchy. This hierarchy is |
| 261 | * represented in "heap" form in a dense array. The root (first level) | 263 | * represented in "heap" form in a dense array. The root (first level) |
| @@ -277,12 +279,19 @@ struct rcu_state { | |||
| 277 | 279 | ||
| 278 | u8 signaled ____cacheline_internodealigned_in_smp; | 280 | u8 signaled ____cacheline_internodealigned_in_smp; |
| 279 | /* Force QS state. */ | 281 | /* Force QS state. */ |
| 280 | long gpnum; /* Current gp number. */ | 282 | u8 fqs_active; /* force_quiescent_state() */ |
| 281 | long completed; /* # of last completed gp. */ | 283 | /* is running. */ |
| 284 | u8 fqs_need_gp; /* A CPU was prevented from */ | ||
| 285 | /* starting a new grace */ | ||
| 286 | /* period because */ | ||
| 287 | /* force_quiescent_state() */ | ||
| 288 | /* was running. */ | ||
| 289 | unsigned long gpnum; /* Current gp number. */ | ||
| 290 | unsigned long completed; /* # of last completed gp. */ | ||
| 282 | 291 | ||
| 283 | /* End of fields guarded by root rcu_node's lock. */ | 292 | /* End of fields guarded by root rcu_node's lock. */ |
| 284 | 293 | ||
| 285 | spinlock_t onofflock; /* exclude on/offline and */ | 294 | raw_spinlock_t onofflock; /* exclude on/offline and */ |
| 286 | /* starting new GP. Also */ | 295 | /* starting new GP. Also */ |
| 287 | /* protects the following */ | 296 | /* protects the following */ |
| 288 | /* orphan_cbs fields. */ | 297 | /* orphan_cbs fields. */ |
| @@ -292,10 +301,8 @@ struct rcu_state { | |||
| 292 | /* going offline. */ | 301 | /* going offline. */ |
| 293 | struct rcu_head **orphan_cbs_tail; /* And tail pointer. */ | 302 | struct rcu_head **orphan_cbs_tail; /* And tail pointer. */ |
| 294 | long orphan_qlen; /* Number of orphaned cbs. */ | 303 | long orphan_qlen; /* Number of orphaned cbs. */ |
| 295 | spinlock_t fqslock; /* Only one task forcing */ | 304 | raw_spinlock_t fqslock; /* Only one task forcing */ |
| 296 | /* quiescent states. */ | 305 | /* quiescent states. */ |
| 297 | long completed_fqs; /* Value of completed @ snap. */ | ||
| 298 | /* Protected by fqslock. */ | ||
| 299 | unsigned long jiffies_force_qs; /* Time at which to invoke */ | 306 | unsigned long jiffies_force_qs; /* Time at which to invoke */ |
| 300 | /* force_quiescent_state(). */ | 307 | /* force_quiescent_state(). */ |
| 301 | unsigned long n_force_qs; /* Number of calls to */ | 308 | unsigned long n_force_qs; /* Number of calls to */ |
| @@ -319,8 +326,6 @@ struct rcu_state { | |||
| 319 | #define RCU_OFL_TASKS_EXP_GP 0x2 /* Tasks blocking expedited */ | 326 | #define RCU_OFL_TASKS_EXP_GP 0x2 /* Tasks blocking expedited */ |
| 320 | /* GP were moved to root. */ | 327 | /* GP were moved to root. */ |
| 321 | 328 | ||
| 322 | #ifdef RCU_TREE_NONCORE | ||
| 323 | |||
| 324 | /* | 329 | /* |
| 325 | * RCU implementation internal declarations: | 330 | * RCU implementation internal declarations: |
| 326 | */ | 331 | */ |
| @@ -335,7 +340,7 @@ extern struct rcu_state rcu_preempt_state; | |||
| 335 | DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data); | 340 | DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data); |
| 336 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ | 341 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ |
| 337 | 342 | ||
| 338 | #else /* #ifdef RCU_TREE_NONCORE */ | 343 | #ifndef RCU_TREE_NONCORE |
| 339 | 344 | ||
| 340 | /* Forward declarations for rcutree_plugin.h */ | 345 | /* Forward declarations for rcutree_plugin.h */ |
| 341 | static void rcu_bootup_announce(void); | 346 | static void rcu_bootup_announce(void); |
| @@ -347,6 +352,7 @@ static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, | |||
| 347 | unsigned long flags); | 352 | unsigned long flags); |
| 348 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ | 353 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ |
| 349 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR | 354 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR |
| 355 | static void rcu_print_detail_task_stall(struct rcu_state *rsp); | ||
| 350 | static void rcu_print_task_stall(struct rcu_node *rnp); | 356 | static void rcu_print_task_stall(struct rcu_node *rnp); |
| 351 | #endif /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */ | 357 | #endif /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */ |
| 352 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp); | 358 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp); |
| @@ -367,5 +373,6 @@ static int rcu_preempt_needs_cpu(int cpu); | |||
| 367 | static void __cpuinit rcu_preempt_init_percpu_data(int cpu); | 373 | static void __cpuinit rcu_preempt_init_percpu_data(int cpu); |
| 368 | static void rcu_preempt_send_cbs_to_orphanage(void); | 374 | static void rcu_preempt_send_cbs_to_orphanage(void); |
| 369 | static void __init __rcu_init_preempt(void); | 375 | static void __init __rcu_init_preempt(void); |
| 376 | static void rcu_needs_cpu_flush(void); | ||
| 370 | 377 | ||
| 371 | #endif /* #else #ifdef RCU_TREE_NONCORE */ | 378 | #endif /* #ifndef RCU_TREE_NONCORE */ |
diff --git a/kernel/rcutree_plugin.h b/kernel/rcutree_plugin.h index 37fbccdf41d5..464ad2cdee00 100644 --- a/kernel/rcutree_plugin.h +++ b/kernel/rcutree_plugin.h | |||
| @@ -62,6 +62,15 @@ long rcu_batches_completed(void) | |||
| 62 | EXPORT_SYMBOL_GPL(rcu_batches_completed); | 62 | EXPORT_SYMBOL_GPL(rcu_batches_completed); |
| 63 | 63 | ||
| 64 | /* | 64 | /* |
| 65 | * Force a quiescent state for preemptible RCU. | ||
| 66 | */ | ||
| 67 | void rcu_force_quiescent_state(void) | ||
| 68 | { | ||
| 69 | force_quiescent_state(&rcu_preempt_state, 0); | ||
| 70 | } | ||
| 71 | EXPORT_SYMBOL_GPL(rcu_force_quiescent_state); | ||
| 72 | |||
| 73 | /* | ||
| 65 | * Record a preemptable-RCU quiescent state for the specified CPU. Note | 74 | * Record a preemptable-RCU quiescent state for the specified CPU. Note |
| 66 | * that this just means that the task currently running on the CPU is | 75 | * that this just means that the task currently running on the CPU is |
| 67 | * not in a quiescent state. There might be any number of tasks blocked | 76 | * not in a quiescent state. There might be any number of tasks blocked |
| @@ -102,7 +111,7 @@ static void rcu_preempt_note_context_switch(int cpu) | |||
| 102 | /* Possibly blocking in an RCU read-side critical section. */ | 111 | /* Possibly blocking in an RCU read-side critical section. */ |
| 103 | rdp = rcu_preempt_state.rda[cpu]; | 112 | rdp = rcu_preempt_state.rda[cpu]; |
| 104 | rnp = rdp->mynode; | 113 | rnp = rdp->mynode; |
| 105 | spin_lock_irqsave(&rnp->lock, flags); | 114 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 106 | t->rcu_read_unlock_special |= RCU_READ_UNLOCK_BLOCKED; | 115 | t->rcu_read_unlock_special |= RCU_READ_UNLOCK_BLOCKED; |
| 107 | t->rcu_blocked_node = rnp; | 116 | t->rcu_blocked_node = rnp; |
| 108 | 117 | ||
| @@ -123,7 +132,7 @@ static void rcu_preempt_note_context_switch(int cpu) | |||
| 123 | WARN_ON_ONCE(!list_empty(&t->rcu_node_entry)); | 132 | WARN_ON_ONCE(!list_empty(&t->rcu_node_entry)); |
| 124 | phase = (rnp->gpnum + !(rnp->qsmask & rdp->grpmask)) & 0x1; | 133 | phase = (rnp->gpnum + !(rnp->qsmask & rdp->grpmask)) & 0x1; |
| 125 | list_add(&t->rcu_node_entry, &rnp->blocked_tasks[phase]); | 134 | list_add(&t->rcu_node_entry, &rnp->blocked_tasks[phase]); |
| 126 | spin_unlock_irqrestore(&rnp->lock, flags); | 135 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 127 | } | 136 | } |
| 128 | 137 | ||
| 129 | /* | 138 | /* |
| @@ -180,7 +189,7 @@ static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, unsigned long flags) | |||
| 180 | struct rcu_node *rnp_p; | 189 | struct rcu_node *rnp_p; |
| 181 | 190 | ||
| 182 | if (rnp->qsmask != 0 || rcu_preempted_readers(rnp)) { | 191 | if (rnp->qsmask != 0 || rcu_preempted_readers(rnp)) { |
| 183 | spin_unlock_irqrestore(&rnp->lock, flags); | 192 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 184 | return; /* Still need more quiescent states! */ | 193 | return; /* Still need more quiescent states! */ |
| 185 | } | 194 | } |
| 186 | 195 | ||
| @@ -197,8 +206,8 @@ static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, unsigned long flags) | |||
| 197 | 206 | ||
| 198 | /* Report up the rest of the hierarchy. */ | 207 | /* Report up the rest of the hierarchy. */ |
| 199 | mask = rnp->grpmask; | 208 | mask = rnp->grpmask; |
| 200 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 209 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 201 | spin_lock(&rnp_p->lock); /* irqs already disabled. */ | 210 | raw_spin_lock(&rnp_p->lock); /* irqs already disabled. */ |
| 202 | rcu_report_qs_rnp(mask, &rcu_preempt_state, rnp_p, flags); | 211 | rcu_report_qs_rnp(mask, &rcu_preempt_state, rnp_p, flags); |
| 203 | } | 212 | } |
| 204 | 213 | ||
| @@ -248,10 +257,10 @@ static void rcu_read_unlock_special(struct task_struct *t) | |||
| 248 | */ | 257 | */ |
| 249 | for (;;) { | 258 | for (;;) { |
| 250 | rnp = t->rcu_blocked_node; | 259 | rnp = t->rcu_blocked_node; |
| 251 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 260 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 252 | if (rnp == t->rcu_blocked_node) | 261 | if (rnp == t->rcu_blocked_node) |
| 253 | break; | 262 | break; |
| 254 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 263 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 255 | } | 264 | } |
| 256 | empty = !rcu_preempted_readers(rnp); | 265 | empty = !rcu_preempted_readers(rnp); |
| 257 | empty_exp = !rcu_preempted_readers_exp(rnp); | 266 | empty_exp = !rcu_preempted_readers_exp(rnp); |
| @@ -265,7 +274,7 @@ static void rcu_read_unlock_special(struct task_struct *t) | |||
| 265 | * Note that rcu_report_unblock_qs_rnp() releases rnp->lock. | 274 | * Note that rcu_report_unblock_qs_rnp() releases rnp->lock. |
| 266 | */ | 275 | */ |
| 267 | if (empty) | 276 | if (empty) |
| 268 | spin_unlock_irqrestore(&rnp->lock, flags); | 277 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 269 | else | 278 | else |
| 270 | rcu_report_unblock_qs_rnp(rnp, flags); | 279 | rcu_report_unblock_qs_rnp(rnp, flags); |
| 271 | 280 | ||
| @@ -295,29 +304,73 @@ void __rcu_read_unlock(void) | |||
| 295 | if (--ACCESS_ONCE(t->rcu_read_lock_nesting) == 0 && | 304 | if (--ACCESS_ONCE(t->rcu_read_lock_nesting) == 0 && |
| 296 | unlikely(ACCESS_ONCE(t->rcu_read_unlock_special))) | 305 | unlikely(ACCESS_ONCE(t->rcu_read_unlock_special))) |
| 297 | rcu_read_unlock_special(t); | 306 | rcu_read_unlock_special(t); |
| 307 | #ifdef CONFIG_PROVE_LOCKING | ||
| 308 | WARN_ON_ONCE(ACCESS_ONCE(t->rcu_read_lock_nesting) < 0); | ||
| 309 | #endif /* #ifdef CONFIG_PROVE_LOCKING */ | ||
| 298 | } | 310 | } |
| 299 | EXPORT_SYMBOL_GPL(__rcu_read_unlock); | 311 | EXPORT_SYMBOL_GPL(__rcu_read_unlock); |
| 300 | 312 | ||
| 301 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR | 313 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR |
| 302 | 314 | ||
| 315 | #ifdef CONFIG_RCU_CPU_STALL_VERBOSE | ||
| 316 | |||
| 317 | /* | ||
| 318 | * Dump detailed information for all tasks blocking the current RCU | ||
| 319 | * grace period on the specified rcu_node structure. | ||
| 320 | */ | ||
| 321 | static void rcu_print_detail_task_stall_rnp(struct rcu_node *rnp) | ||
| 322 | { | ||
| 323 | unsigned long flags; | ||
| 324 | struct list_head *lp; | ||
| 325 | int phase; | ||
| 326 | struct task_struct *t; | ||
| 327 | |||
| 328 | if (rcu_preempted_readers(rnp)) { | ||
| 329 | raw_spin_lock_irqsave(&rnp->lock, flags); | ||
| 330 | phase = rnp->gpnum & 0x1; | ||
| 331 | lp = &rnp->blocked_tasks[phase]; | ||
| 332 | list_for_each_entry(t, lp, rcu_node_entry) | ||
| 333 | sched_show_task(t); | ||
| 334 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | ||
| 335 | } | ||
| 336 | } | ||
| 337 | |||
| 338 | /* | ||
| 339 | * Dump detailed information for all tasks blocking the current RCU | ||
| 340 | * grace period. | ||
| 341 | */ | ||
| 342 | static void rcu_print_detail_task_stall(struct rcu_state *rsp) | ||
| 343 | { | ||
| 344 | struct rcu_node *rnp = rcu_get_root(rsp); | ||
| 345 | |||
| 346 | rcu_print_detail_task_stall_rnp(rnp); | ||
| 347 | rcu_for_each_leaf_node(rsp, rnp) | ||
| 348 | rcu_print_detail_task_stall_rnp(rnp); | ||
| 349 | } | ||
| 350 | |||
| 351 | #else /* #ifdef CONFIG_RCU_CPU_STALL_VERBOSE */ | ||
| 352 | |||
| 353 | static void rcu_print_detail_task_stall(struct rcu_state *rsp) | ||
| 354 | { | ||
| 355 | } | ||
| 356 | |||
| 357 | #endif /* #else #ifdef CONFIG_RCU_CPU_STALL_VERBOSE */ | ||
| 358 | |||
| 303 | /* | 359 | /* |
| 304 | * Scan the current list of tasks blocked within RCU read-side critical | 360 | * Scan the current list of tasks blocked within RCU read-side critical |
| 305 | * sections, printing out the tid of each. | 361 | * sections, printing out the tid of each. |
| 306 | */ | 362 | */ |
| 307 | static void rcu_print_task_stall(struct rcu_node *rnp) | 363 | static void rcu_print_task_stall(struct rcu_node *rnp) |
| 308 | { | 364 | { |
| 309 | unsigned long flags; | ||
| 310 | struct list_head *lp; | 365 | struct list_head *lp; |
| 311 | int phase; | 366 | int phase; |
| 312 | struct task_struct *t; | 367 | struct task_struct *t; |
| 313 | 368 | ||
| 314 | if (rcu_preempted_readers(rnp)) { | 369 | if (rcu_preempted_readers(rnp)) { |
| 315 | spin_lock_irqsave(&rnp->lock, flags); | ||
| 316 | phase = rnp->gpnum & 0x1; | 370 | phase = rnp->gpnum & 0x1; |
| 317 | lp = &rnp->blocked_tasks[phase]; | 371 | lp = &rnp->blocked_tasks[phase]; |
| 318 | list_for_each_entry(t, lp, rcu_node_entry) | 372 | list_for_each_entry(t, lp, rcu_node_entry) |
| 319 | printk(" P%d", t->pid); | 373 | printk(" P%d", t->pid); |
| 320 | spin_unlock_irqrestore(&rnp->lock, flags); | ||
| 321 | } | 374 | } |
| 322 | } | 375 | } |
| 323 | 376 | ||
| @@ -388,11 +441,11 @@ static int rcu_preempt_offline_tasks(struct rcu_state *rsp, | |||
| 388 | lp_root = &rnp_root->blocked_tasks[i]; | 441 | lp_root = &rnp_root->blocked_tasks[i]; |
| 389 | while (!list_empty(lp)) { | 442 | while (!list_empty(lp)) { |
| 390 | tp = list_entry(lp->next, typeof(*tp), rcu_node_entry); | 443 | tp = list_entry(lp->next, typeof(*tp), rcu_node_entry); |
| 391 | spin_lock(&rnp_root->lock); /* irqs already disabled */ | 444 | raw_spin_lock(&rnp_root->lock); /* irqs already disabled */ |
| 392 | list_del(&tp->rcu_node_entry); | 445 | list_del(&tp->rcu_node_entry); |
| 393 | tp->rcu_blocked_node = rnp_root; | 446 | tp->rcu_blocked_node = rnp_root; |
| 394 | list_add(&tp->rcu_node_entry, lp_root); | 447 | list_add(&tp->rcu_node_entry, lp_root); |
| 395 | spin_unlock(&rnp_root->lock); /* irqs remain disabled */ | 448 | raw_spin_unlock(&rnp_root->lock); /* irqs remain disabled */ |
| 396 | } | 449 | } |
| 397 | } | 450 | } |
| 398 | return retval; | 451 | return retval; |
| @@ -516,7 +569,7 @@ static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp) | |||
| 516 | unsigned long flags; | 569 | unsigned long flags; |
| 517 | unsigned long mask; | 570 | unsigned long mask; |
| 518 | 571 | ||
| 519 | spin_lock_irqsave(&rnp->lock, flags); | 572 | raw_spin_lock_irqsave(&rnp->lock, flags); |
| 520 | for (;;) { | 573 | for (;;) { |
| 521 | if (!sync_rcu_preempt_exp_done(rnp)) | 574 | if (!sync_rcu_preempt_exp_done(rnp)) |
| 522 | break; | 575 | break; |
| @@ -525,12 +578,12 @@ static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp) | |||
| 525 | break; | 578 | break; |
| 526 | } | 579 | } |
| 527 | mask = rnp->grpmask; | 580 | mask = rnp->grpmask; |
| 528 | spin_unlock(&rnp->lock); /* irqs remain disabled */ | 581 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
| 529 | rnp = rnp->parent; | 582 | rnp = rnp->parent; |
| 530 | spin_lock(&rnp->lock); /* irqs already disabled */ | 583 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ |
| 531 | rnp->expmask &= ~mask; | 584 | rnp->expmask &= ~mask; |
| 532 | } | 585 | } |
| 533 | spin_unlock_irqrestore(&rnp->lock, flags); | 586 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 534 | } | 587 | } |
| 535 | 588 | ||
| 536 | /* | 589 | /* |
| @@ -545,11 +598,11 @@ sync_rcu_preempt_exp_init(struct rcu_state *rsp, struct rcu_node *rnp) | |||
| 545 | { | 598 | { |
| 546 | int must_wait; | 599 | int must_wait; |
| 547 | 600 | ||
| 548 | spin_lock(&rnp->lock); /* irqs already disabled */ | 601 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ |
| 549 | list_splice_init(&rnp->blocked_tasks[0], &rnp->blocked_tasks[2]); | 602 | list_splice_init(&rnp->blocked_tasks[0], &rnp->blocked_tasks[2]); |
| 550 | list_splice_init(&rnp->blocked_tasks[1], &rnp->blocked_tasks[3]); | 603 | list_splice_init(&rnp->blocked_tasks[1], &rnp->blocked_tasks[3]); |
| 551 | must_wait = rcu_preempted_readers_exp(rnp); | 604 | must_wait = rcu_preempted_readers_exp(rnp); |
| 552 | spin_unlock(&rnp->lock); /* irqs remain disabled */ | 605 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
| 553 | if (!must_wait) | 606 | if (!must_wait) |
| 554 | rcu_report_exp_rnp(rsp, rnp); | 607 | rcu_report_exp_rnp(rsp, rnp); |
| 555 | } | 608 | } |
| @@ -594,13 +647,13 @@ void synchronize_rcu_expedited(void) | |||
| 594 | /* force all RCU readers onto blocked_tasks[]. */ | 647 | /* force all RCU readers onto blocked_tasks[]. */ |
| 595 | synchronize_sched_expedited(); | 648 | synchronize_sched_expedited(); |
| 596 | 649 | ||
| 597 | spin_lock_irqsave(&rsp->onofflock, flags); | 650 | raw_spin_lock_irqsave(&rsp->onofflock, flags); |
| 598 | 651 | ||
| 599 | /* Initialize ->expmask for all non-leaf rcu_node structures. */ | 652 | /* Initialize ->expmask for all non-leaf rcu_node structures. */ |
| 600 | rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) { | 653 | rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) { |
| 601 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 654 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 602 | rnp->expmask = rnp->qsmaskinit; | 655 | rnp->expmask = rnp->qsmaskinit; |
| 603 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 656 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 604 | } | 657 | } |
| 605 | 658 | ||
| 606 | /* Snapshot current state of ->blocked_tasks[] lists. */ | 659 | /* Snapshot current state of ->blocked_tasks[] lists. */ |
| @@ -609,7 +662,7 @@ void synchronize_rcu_expedited(void) | |||
| 609 | if (NUM_RCU_NODES > 1) | 662 | if (NUM_RCU_NODES > 1) |
| 610 | sync_rcu_preempt_exp_init(rsp, rcu_get_root(rsp)); | 663 | sync_rcu_preempt_exp_init(rsp, rcu_get_root(rsp)); |
| 611 | 664 | ||
| 612 | spin_unlock_irqrestore(&rsp->onofflock, flags); | 665 | raw_spin_unlock_irqrestore(&rsp->onofflock, flags); |
| 613 | 666 | ||
| 614 | /* Wait for snapshotted ->blocked_tasks[] lists to drain. */ | 667 | /* Wait for snapshotted ->blocked_tasks[] lists to drain. */ |
| 615 | rnp = rcu_get_root(rsp); | 668 | rnp = rcu_get_root(rsp); |
| @@ -713,6 +766,16 @@ long rcu_batches_completed(void) | |||
| 713 | EXPORT_SYMBOL_GPL(rcu_batches_completed); | 766 | EXPORT_SYMBOL_GPL(rcu_batches_completed); |
| 714 | 767 | ||
| 715 | /* | 768 | /* |
| 769 | * Force a quiescent state for RCU, which, because there is no preemptible | ||
| 770 | * RCU, becomes the same as rcu-sched. | ||
| 771 | */ | ||
| 772 | void rcu_force_quiescent_state(void) | ||
| 773 | { | ||
| 774 | rcu_sched_force_quiescent_state(); | ||
| 775 | } | ||
| 776 | EXPORT_SYMBOL_GPL(rcu_force_quiescent_state); | ||
| 777 | |||
| 778 | /* | ||
| 716 | * Because preemptable RCU does not exist, we never have to check for | 779 | * Because preemptable RCU does not exist, we never have to check for |
| 717 | * CPUs being in quiescent states. | 780 | * CPUs being in quiescent states. |
| 718 | */ | 781 | */ |
| @@ -734,7 +797,7 @@ static int rcu_preempted_readers(struct rcu_node *rnp) | |||
| 734 | /* Because preemptible RCU does not exist, no quieting of tasks. */ | 797 | /* Because preemptible RCU does not exist, no quieting of tasks. */ |
| 735 | static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, unsigned long flags) | 798 | static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, unsigned long flags) |
| 736 | { | 799 | { |
| 737 | spin_unlock_irqrestore(&rnp->lock, flags); | 800 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
| 738 | } | 801 | } |
| 739 | 802 | ||
| 740 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ | 803 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ |
| @@ -745,6 +808,14 @@ static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, unsigned long flags) | |||
| 745 | * Because preemptable RCU does not exist, we never have to check for | 808 | * Because preemptable RCU does not exist, we never have to check for |
| 746 | * tasks blocked within RCU read-side critical sections. | 809 | * tasks blocked within RCU read-side critical sections. |
| 747 | */ | 810 | */ |
| 811 | static void rcu_print_detail_task_stall(struct rcu_state *rsp) | ||
| 812 | { | ||
| 813 | } | ||
| 814 | |||
| 815 | /* | ||
| 816 | * Because preemptable RCU does not exist, we never have to check for | ||
| 817 | * tasks blocked within RCU read-side critical sections. | ||
| 818 | */ | ||
| 748 | static void rcu_print_task_stall(struct rcu_node *rnp) | 819 | static void rcu_print_task_stall(struct rcu_node *rnp) |
| 749 | { | 820 | { |
| 750 | } | 821 | } |
| @@ -884,3 +955,113 @@ static void __init __rcu_init_preempt(void) | |||
| 884 | } | 955 | } |
| 885 | 956 | ||
| 886 | #endif /* #else #ifdef CONFIG_TREE_PREEMPT_RCU */ | 957 | #endif /* #else #ifdef CONFIG_TREE_PREEMPT_RCU */ |
| 958 | |||
| 959 | #if !defined(CONFIG_RCU_FAST_NO_HZ) | ||
| 960 | |||
| 961 | /* | ||
| 962 | * Check to see if any future RCU-related work will need to be done | ||
| 963 | * by the current CPU, even if none need be done immediately, returning | ||
| 964 | * 1 if so. This function is part of the RCU implementation; it is -not- | ||
| 965 | * an exported member of the RCU API. | ||
| 966 | * | ||
| 967 | * Because we have preemptible RCU, just check whether this CPU needs | ||
| 968 | * any flavor of RCU. Do not chew up lots of CPU cycles with preemption | ||
| 969 | * disabled in a most-likely vain attempt to cause RCU not to need this CPU. | ||
| 970 | */ | ||
| 971 | int rcu_needs_cpu(int cpu) | ||
| 972 | { | ||
| 973 | return rcu_needs_cpu_quick_check(cpu); | ||
| 974 | } | ||
| 975 | |||
| 976 | /* | ||
| 977 | * Check to see if we need to continue a callback-flush operations to | ||
| 978 | * allow the last CPU to enter dyntick-idle mode. But fast dyntick-idle | ||
| 979 | * entry is not configured, so we never do need to. | ||
| 980 | */ | ||
| 981 | static void rcu_needs_cpu_flush(void) | ||
| 982 | { | ||
| 983 | } | ||
| 984 | |||
| 985 | #else /* #if !defined(CONFIG_RCU_FAST_NO_HZ) */ | ||
| 986 | |||
| 987 | #define RCU_NEEDS_CPU_FLUSHES 5 | ||
| 988 | static DEFINE_PER_CPU(int, rcu_dyntick_drain); | ||
| 989 | static DEFINE_PER_CPU(unsigned long, rcu_dyntick_holdoff); | ||
| 990 | |||
| 991 | /* | ||
| 992 | * Check to see if any future RCU-related work will need to be done | ||
| 993 | * by the current CPU, even if none need be done immediately, returning | ||
| 994 | * 1 if so. This function is part of the RCU implementation; it is -not- | ||
| 995 | * an exported member of the RCU API. | ||
| 996 | * | ||
| 997 | * Because we are not supporting preemptible RCU, attempt to accelerate | ||
| 998 | * any current grace periods so that RCU no longer needs this CPU, but | ||
| 999 | * only if all other CPUs are already in dynticks-idle mode. This will | ||
| 1000 | * allow the CPU cores to be powered down immediately, as opposed to after | ||
| 1001 | * waiting many milliseconds for grace periods to elapse. | ||
| 1002 | * | ||
| 1003 | * Because it is not legal to invoke rcu_process_callbacks() with irqs | ||
| 1004 | * disabled, we do one pass of force_quiescent_state(), then do a | ||
| 1005 | * raise_softirq() to cause rcu_process_callbacks() to be invoked later. | ||
| 1006 | * The per-cpu rcu_dyntick_drain variable controls the sequencing. | ||
| 1007 | */ | ||
| 1008 | int rcu_needs_cpu(int cpu) | ||
| 1009 | { | ||
| 1010 | int c = 0; | ||
| 1011 | int thatcpu; | ||
| 1012 | |||
| 1013 | /* Don't bother unless we are the last non-dyntick-idle CPU. */ | ||
| 1014 | for_each_cpu_not(thatcpu, nohz_cpu_mask) | ||
| 1015 | if (thatcpu != cpu) { | ||
| 1016 | per_cpu(rcu_dyntick_drain, cpu) = 0; | ||
| 1017 | per_cpu(rcu_dyntick_holdoff, cpu) = jiffies - 1; | ||
| 1018 | return rcu_needs_cpu_quick_check(cpu); | ||
| 1019 | } | ||
| 1020 | |||
| 1021 | /* Check and update the rcu_dyntick_drain sequencing. */ | ||
| 1022 | if (per_cpu(rcu_dyntick_drain, cpu) <= 0) { | ||
| 1023 | /* First time through, initialize the counter. */ | ||
| 1024 | per_cpu(rcu_dyntick_drain, cpu) = RCU_NEEDS_CPU_FLUSHES; | ||
| 1025 | } else if (--per_cpu(rcu_dyntick_drain, cpu) <= 0) { | ||
| 1026 | /* We have hit the limit, so time to give up. */ | ||
| 1027 | per_cpu(rcu_dyntick_holdoff, cpu) = jiffies; | ||
| 1028 | return rcu_needs_cpu_quick_check(cpu); | ||
| 1029 | } | ||
| 1030 | |||
| 1031 | /* Do one step pushing remaining RCU callbacks through. */ | ||
| 1032 | if (per_cpu(rcu_sched_data, cpu).nxtlist) { | ||
| 1033 | rcu_sched_qs(cpu); | ||
| 1034 | force_quiescent_state(&rcu_sched_state, 0); | ||
| 1035 | c = c || per_cpu(rcu_sched_data, cpu).nxtlist; | ||
| 1036 | } | ||
| 1037 | if (per_cpu(rcu_bh_data, cpu).nxtlist) { | ||
| 1038 | rcu_bh_qs(cpu); | ||
| 1039 | force_quiescent_state(&rcu_bh_state, 0); | ||
| 1040 | c = c || per_cpu(rcu_bh_data, cpu).nxtlist; | ||
| 1041 | } | ||
| 1042 | |||
| 1043 | /* If RCU callbacks are still pending, RCU still needs this CPU. */ | ||
| 1044 | if (c) { | ||
| 1045 | raise_softirq(RCU_SOFTIRQ); | ||
| 1046 | per_cpu(rcu_dyntick_holdoff, cpu) = jiffies; | ||
| 1047 | } | ||
| 1048 | return c; | ||
| 1049 | } | ||
| 1050 | |||
| 1051 | /* | ||
| 1052 | * Check to see if we need to continue a callback-flush operations to | ||
| 1053 | * allow the last CPU to enter dyntick-idle mode. | ||
| 1054 | */ | ||
| 1055 | static void rcu_needs_cpu_flush(void) | ||
| 1056 | { | ||
| 1057 | int cpu = smp_processor_id(); | ||
| 1058 | unsigned long flags; | ||
| 1059 | |||
| 1060 | if (per_cpu(rcu_dyntick_drain, cpu) <= 0) | ||
| 1061 | return; | ||
| 1062 | local_irq_save(flags); | ||
| 1063 | (void)rcu_needs_cpu(cpu); | ||
| 1064 | local_irq_restore(flags); | ||
| 1065 | } | ||
| 1066 | |||
| 1067 | #endif /* #else #if !defined(CONFIG_RCU_FAST_NO_HZ) */ | ||
diff --git a/kernel/rcutree_trace.c b/kernel/rcutree_trace.c index 9d2c88423b31..d45db2e35d27 100644 --- a/kernel/rcutree_trace.c +++ b/kernel/rcutree_trace.c | |||
| @@ -50,7 +50,7 @@ static void print_one_rcu_data(struct seq_file *m, struct rcu_data *rdp) | |||
| 50 | { | 50 | { |
| 51 | if (!rdp->beenonline) | 51 | if (!rdp->beenonline) |
| 52 | return; | 52 | return; |
| 53 | seq_printf(m, "%3d%cc=%ld g=%ld pq=%d pqc=%ld qp=%d", | 53 | seq_printf(m, "%3d%cc=%lu g=%lu pq=%d pqc=%lu qp=%d", |
| 54 | rdp->cpu, | 54 | rdp->cpu, |
| 55 | cpu_is_offline(rdp->cpu) ? '!' : ' ', | 55 | cpu_is_offline(rdp->cpu) ? '!' : ' ', |
| 56 | rdp->completed, rdp->gpnum, | 56 | rdp->completed, rdp->gpnum, |
| @@ -105,7 +105,7 @@ static void print_one_rcu_data_csv(struct seq_file *m, struct rcu_data *rdp) | |||
| 105 | { | 105 | { |
| 106 | if (!rdp->beenonline) | 106 | if (!rdp->beenonline) |
| 107 | return; | 107 | return; |
| 108 | seq_printf(m, "%d,%s,%ld,%ld,%d,%ld,%d", | 108 | seq_printf(m, "%d,%s,%lu,%lu,%d,%lu,%d", |
| 109 | rdp->cpu, | 109 | rdp->cpu, |
| 110 | cpu_is_offline(rdp->cpu) ? "\"N\"" : "\"Y\"", | 110 | cpu_is_offline(rdp->cpu) ? "\"N\"" : "\"Y\"", |
| 111 | rdp->completed, rdp->gpnum, | 111 | rdp->completed, rdp->gpnum, |
| @@ -155,13 +155,13 @@ static const struct file_operations rcudata_csv_fops = { | |||
| 155 | 155 | ||
| 156 | static void print_one_rcu_state(struct seq_file *m, struct rcu_state *rsp) | 156 | static void print_one_rcu_state(struct seq_file *m, struct rcu_state *rsp) |
| 157 | { | 157 | { |
| 158 | long gpnum; | 158 | unsigned long gpnum; |
| 159 | int level = 0; | 159 | int level = 0; |
| 160 | int phase; | 160 | int phase; |
| 161 | struct rcu_node *rnp; | 161 | struct rcu_node *rnp; |
| 162 | 162 | ||
| 163 | gpnum = rsp->gpnum; | 163 | gpnum = rsp->gpnum; |
| 164 | seq_printf(m, "c=%ld g=%ld s=%d jfq=%ld j=%x " | 164 | seq_printf(m, "c=%lu g=%lu s=%d jfq=%ld j=%x " |
| 165 | "nfqs=%lu/nfqsng=%lu(%lu) fqlh=%lu oqlen=%ld\n", | 165 | "nfqs=%lu/nfqsng=%lu(%lu) fqlh=%lu oqlen=%ld\n", |
| 166 | rsp->completed, gpnum, rsp->signaled, | 166 | rsp->completed, gpnum, rsp->signaled, |
| 167 | (long)(rsp->jiffies_force_qs - jiffies), | 167 | (long)(rsp->jiffies_force_qs - jiffies), |
| @@ -215,12 +215,12 @@ static const struct file_operations rcuhier_fops = { | |||
| 215 | static int show_rcugp(struct seq_file *m, void *unused) | 215 | static int show_rcugp(struct seq_file *m, void *unused) |
| 216 | { | 216 | { |
| 217 | #ifdef CONFIG_TREE_PREEMPT_RCU | 217 | #ifdef CONFIG_TREE_PREEMPT_RCU |
| 218 | seq_printf(m, "rcu_preempt: completed=%ld gpnum=%ld\n", | 218 | seq_printf(m, "rcu_preempt: completed=%ld gpnum=%lu\n", |
| 219 | rcu_preempt_state.completed, rcu_preempt_state.gpnum); | 219 | rcu_preempt_state.completed, rcu_preempt_state.gpnum); |
| 220 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ | 220 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ |
| 221 | seq_printf(m, "rcu_sched: completed=%ld gpnum=%ld\n", | 221 | seq_printf(m, "rcu_sched: completed=%ld gpnum=%lu\n", |
| 222 | rcu_sched_state.completed, rcu_sched_state.gpnum); | 222 | rcu_sched_state.completed, rcu_sched_state.gpnum); |
| 223 | seq_printf(m, "rcu_bh: completed=%ld gpnum=%ld\n", | 223 | seq_printf(m, "rcu_bh: completed=%ld gpnum=%lu\n", |
| 224 | rcu_bh_state.completed, rcu_bh_state.gpnum); | 224 | rcu_bh_state.completed, rcu_bh_state.gpnum); |
| 225 | return 0; | 225 | return 0; |
| 226 | } | 226 | } |
diff --git a/kernel/resource.c b/kernel/resource.c index af96c1e4b54b..24e9e60c1459 100644 --- a/kernel/resource.c +++ b/kernel/resource.c | |||
| @@ -188,6 +188,36 @@ static int __release_resource(struct resource *old) | |||
| 188 | return -EINVAL; | 188 | return -EINVAL; |
| 189 | } | 189 | } |
| 190 | 190 | ||
| 191 | static void __release_child_resources(struct resource *r) | ||
| 192 | { | ||
| 193 | struct resource *tmp, *p; | ||
| 194 | resource_size_t size; | ||
| 195 | |||
| 196 | p = r->child; | ||
| 197 | r->child = NULL; | ||
| 198 | while (p) { | ||
| 199 | tmp = p; | ||
| 200 | p = p->sibling; | ||
| 201 | |||
| 202 | tmp->parent = NULL; | ||
| 203 | tmp->sibling = NULL; | ||
| 204 | __release_child_resources(tmp); | ||
| 205 | |||
| 206 | printk(KERN_DEBUG "release child resource %pR\n", tmp); | ||
| 207 | /* need to restore size, and keep flags */ | ||
| 208 | size = resource_size(tmp); | ||
| 209 | tmp->start = 0; | ||
| 210 | tmp->end = size - 1; | ||
| 211 | } | ||
| 212 | } | ||
| 213 | |||
| 214 | void release_child_resources(struct resource *r) | ||
| 215 | { | ||
| 216 | write_lock(&resource_lock); | ||
| 217 | __release_child_resources(r); | ||
| 218 | write_unlock(&resource_lock); | ||
| 219 | } | ||
| 220 | |||
| 191 | /** | 221 | /** |
| 192 | * request_resource - request and reserve an I/O or memory resource | 222 | * request_resource - request and reserve an I/O or memory resource |
| 193 | * @root: root resource descriptor | 223 | * @root: root resource descriptor |
| @@ -303,8 +333,10 @@ int walk_system_ram_range(unsigned long start_pfn, unsigned long nr_pages, | |||
| 303 | static int find_resource(struct resource *root, struct resource *new, | 333 | static int find_resource(struct resource *root, struct resource *new, |
| 304 | resource_size_t size, resource_size_t min, | 334 | resource_size_t size, resource_size_t min, |
| 305 | resource_size_t max, resource_size_t align, | 335 | resource_size_t max, resource_size_t align, |
| 306 | void (*alignf)(void *, struct resource *, | 336 | resource_size_t (*alignf)(void *, |
| 307 | resource_size_t, resource_size_t), | 337 | const struct resource *, |
| 338 | resource_size_t, | ||
| 339 | resource_size_t), | ||
| 308 | void *alignf_data) | 340 | void *alignf_data) |
| 309 | { | 341 | { |
| 310 | struct resource *this = root->child; | 342 | struct resource *this = root->child; |
| @@ -330,7 +362,7 @@ static int find_resource(struct resource *root, struct resource *new, | |||
| 330 | tmp.end = max; | 362 | tmp.end = max; |
| 331 | tmp.start = ALIGN(tmp.start, align); | 363 | tmp.start = ALIGN(tmp.start, align); |
| 332 | if (alignf) | 364 | if (alignf) |
| 333 | alignf(alignf_data, &tmp, size, align); | 365 | tmp.start = alignf(alignf_data, &tmp, size, align); |
| 334 | if (tmp.start < tmp.end && tmp.end - tmp.start >= size - 1) { | 366 | if (tmp.start < tmp.end && tmp.end - tmp.start >= size - 1) { |
| 335 | new->start = tmp.start; | 367 | new->start = tmp.start; |
| 336 | new->end = tmp.start + size - 1; | 368 | new->end = tmp.start + size - 1; |
| @@ -358,8 +390,10 @@ static int find_resource(struct resource *root, struct resource *new, | |||
| 358 | int allocate_resource(struct resource *root, struct resource *new, | 390 | int allocate_resource(struct resource *root, struct resource *new, |
| 359 | resource_size_t size, resource_size_t min, | 391 | resource_size_t size, resource_size_t min, |
| 360 | resource_size_t max, resource_size_t align, | 392 | resource_size_t max, resource_size_t align, |
| 361 | void (*alignf)(void *, struct resource *, | 393 | resource_size_t (*alignf)(void *, |
| 362 | resource_size_t, resource_size_t), | 394 | const struct resource *, |
| 395 | resource_size_t, | ||
| 396 | resource_size_t), | ||
| 363 | void *alignf_data) | 397 | void *alignf_data) |
| 364 | { | 398 | { |
| 365 | int err; | 399 | int err; |
diff --git a/kernel/sched.c b/kernel/sched.c index 3a8fb30a91b1..3218f5213717 100644 --- a/kernel/sched.c +++ b/kernel/sched.c | |||
| @@ -645,6 +645,11 @@ static inline int cpu_of(struct rq *rq) | |||
| 645 | #endif | 645 | #endif |
| 646 | } | 646 | } |
| 647 | 647 | ||
| 648 | #define rcu_dereference_check_sched_domain(p) \ | ||
| 649 | rcu_dereference_check((p), \ | ||
| 650 | rcu_read_lock_sched_held() || \ | ||
| 651 | lockdep_is_held(&sched_domains_mutex)) | ||
| 652 | |||
| 648 | /* | 653 | /* |
| 649 | * The domain tree (rq->sd) is protected by RCU's quiescent state transition. | 654 | * The domain tree (rq->sd) is protected by RCU's quiescent state transition. |
| 650 | * See detach_destroy_domains: synchronize_sched for details. | 655 | * See detach_destroy_domains: synchronize_sched for details. |
| @@ -653,7 +658,7 @@ static inline int cpu_of(struct rq *rq) | |||
| 653 | * preempt-disabled sections. | 658 | * preempt-disabled sections. |
| 654 | */ | 659 | */ |
| 655 | #define for_each_domain(cpu, __sd) \ | 660 | #define for_each_domain(cpu, __sd) \ |
| 656 | for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent) | 661 | for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent) |
| 657 | 662 | ||
| 658 | #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) | 663 | #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) |
| 659 | #define this_rq() (&__get_cpu_var(runqueues)) | 664 | #define this_rq() (&__get_cpu_var(runqueues)) |
| @@ -1531,7 +1536,7 @@ static unsigned long target_load(int cpu, int type) | |||
| 1531 | 1536 | ||
| 1532 | static struct sched_group *group_of(int cpu) | 1537 | static struct sched_group *group_of(int cpu) |
| 1533 | { | 1538 | { |
| 1534 | struct sched_domain *sd = rcu_dereference(cpu_rq(cpu)->sd); | 1539 | struct sched_domain *sd = rcu_dereference_sched(cpu_rq(cpu)->sd); |
| 1535 | 1540 | ||
| 1536 | if (!sd) | 1541 | if (!sd) |
| 1537 | return NULL; | 1542 | return NULL; |
| @@ -4888,7 +4893,7 @@ static void run_rebalance_domains(struct softirq_action *h) | |||
| 4888 | 4893 | ||
| 4889 | static inline int on_null_domain(int cpu) | 4894 | static inline int on_null_domain(int cpu) |
| 4890 | { | 4895 | { |
| 4891 | return !rcu_dereference(cpu_rq(cpu)->sd); | 4896 | return !rcu_dereference_sched(cpu_rq(cpu)->sd); |
| 4892 | } | 4897 | } |
| 4893 | 4898 | ||
| 4894 | /* | 4899 | /* |
diff --git a/kernel/smp.c b/kernel/smp.c index f10408422444..9867b6bfefce 100644 --- a/kernel/smp.c +++ b/kernel/smp.c | |||
| @@ -12,8 +12,6 @@ | |||
| 12 | #include <linux/smp.h> | 12 | #include <linux/smp.h> |
| 13 | #include <linux/cpu.h> | 13 | #include <linux/cpu.h> |
| 14 | 14 | ||
| 15 | static DEFINE_PER_CPU(struct call_single_queue, call_single_queue); | ||
| 16 | |||
| 17 | static struct { | 15 | static struct { |
| 18 | struct list_head queue; | 16 | struct list_head queue; |
| 19 | raw_spinlock_t lock; | 17 | raw_spinlock_t lock; |
| @@ -33,12 +31,14 @@ struct call_function_data { | |||
| 33 | cpumask_var_t cpumask; | 31 | cpumask_var_t cpumask; |
| 34 | }; | 32 | }; |
| 35 | 33 | ||
| 34 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct call_function_data, cfd_data); | ||
| 35 | |||
| 36 | struct call_single_queue { | 36 | struct call_single_queue { |
| 37 | struct list_head list; | 37 | struct list_head list; |
| 38 | raw_spinlock_t lock; | 38 | raw_spinlock_t lock; |
| 39 | }; | 39 | }; |
| 40 | 40 | ||
| 41 | static DEFINE_PER_CPU(struct call_function_data, cfd_data); | 41 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct call_single_queue, call_single_queue); |
| 42 | 42 | ||
| 43 | static int | 43 | static int |
| 44 | hotplug_cfd(struct notifier_block *nfb, unsigned long action, void *hcpu) | 44 | hotplug_cfd(struct notifier_block *nfb, unsigned long action, void *hcpu) |
| @@ -256,7 +256,7 @@ void generic_smp_call_function_single_interrupt(void) | |||
| 256 | } | 256 | } |
| 257 | } | 257 | } |
| 258 | 258 | ||
| 259 | static DEFINE_PER_CPU(struct call_single_data, csd_data); | 259 | static DEFINE_PER_CPU_SHARED_ALIGNED(struct call_single_data, csd_data); |
| 260 | 260 | ||
| 261 | /* | 261 | /* |
| 262 | * smp_call_function_single - Run a function on a specific CPU | 262 | * smp_call_function_single - Run a function on a specific CPU |
diff --git a/kernel/softirq.c b/kernel/softirq.c index a09502e2ef75..7c1a67ef0274 100644 --- a/kernel/softirq.c +++ b/kernel/softirq.c | |||
| @@ -500,22 +500,17 @@ EXPORT_SYMBOL(tasklet_kill); | |||
| 500 | */ | 500 | */ |
| 501 | 501 | ||
| 502 | /* | 502 | /* |
| 503 | * The trampoline is called when the hrtimer expires. If this is | 503 | * The trampoline is called when the hrtimer expires. It schedules a tasklet |
| 504 | * called from the hrtimer interrupt then we schedule the tasklet as | 504 | * to run __tasklet_hrtimer_trampoline() which in turn will call the intended |
| 505 | * the timer callback function expects to run in softirq context. If | 505 | * hrtimer callback, but from softirq context. |
| 506 | * it's called in softirq context anyway (i.e. high resolution timers | ||
| 507 | * disabled) then the hrtimer callback is called right away. | ||
| 508 | */ | 506 | */ |
| 509 | static enum hrtimer_restart __hrtimer_tasklet_trampoline(struct hrtimer *timer) | 507 | static enum hrtimer_restart __hrtimer_tasklet_trampoline(struct hrtimer *timer) |
| 510 | { | 508 | { |
| 511 | struct tasklet_hrtimer *ttimer = | 509 | struct tasklet_hrtimer *ttimer = |
| 512 | container_of(timer, struct tasklet_hrtimer, timer); | 510 | container_of(timer, struct tasklet_hrtimer, timer); |
| 513 | 511 | ||
| 514 | if (hrtimer_is_hres_active(timer)) { | 512 | tasklet_hi_schedule(&ttimer->tasklet); |
| 515 | tasklet_hi_schedule(&ttimer->tasklet); | 513 | return HRTIMER_NORESTART; |
| 516 | return HRTIMER_NORESTART; | ||
| 517 | } | ||
| 518 | return ttimer->function(timer); | ||
| 519 | } | 514 | } |
| 520 | 515 | ||
| 521 | /* | 516 | /* |
diff --git a/kernel/srcu.c b/kernel/srcu.c index 818d7d9aa03c..bde4295774c8 100644 --- a/kernel/srcu.c +++ b/kernel/srcu.c | |||
| @@ -34,6 +34,30 @@ | |||
| 34 | #include <linux/smp.h> | 34 | #include <linux/smp.h> |
| 35 | #include <linux/srcu.h> | 35 | #include <linux/srcu.h> |
| 36 | 36 | ||
| 37 | static int init_srcu_struct_fields(struct srcu_struct *sp) | ||
| 38 | { | ||
| 39 | sp->completed = 0; | ||
| 40 | mutex_init(&sp->mutex); | ||
| 41 | sp->per_cpu_ref = alloc_percpu(struct srcu_struct_array); | ||
| 42 | return sp->per_cpu_ref ? 0 : -ENOMEM; | ||
| 43 | } | ||
| 44 | |||
| 45 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | ||
| 46 | |||
| 47 | int __init_srcu_struct(struct srcu_struct *sp, const char *name, | ||
| 48 | struct lock_class_key *key) | ||
| 49 | { | ||
| 50 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | ||
| 51 | /* Don't re-initialize a lock while it is held. */ | ||
| 52 | debug_check_no_locks_freed((void *)sp, sizeof(*sp)); | ||
| 53 | lockdep_init_map(&sp->dep_map, name, key, 0); | ||
| 54 | #endif /* #ifdef CONFIG_DEBUG_LOCK_ALLOC */ | ||
| 55 | return init_srcu_struct_fields(sp); | ||
| 56 | } | ||
| 57 | EXPORT_SYMBOL_GPL(__init_srcu_struct); | ||
| 58 | |||
| 59 | #else /* #ifdef CONFIG_DEBUG_LOCK_ALLOC */ | ||
| 60 | |||
| 37 | /** | 61 | /** |
| 38 | * init_srcu_struct - initialize a sleep-RCU structure | 62 | * init_srcu_struct - initialize a sleep-RCU structure |
| 39 | * @sp: structure to initialize. | 63 | * @sp: structure to initialize. |
| @@ -44,13 +68,12 @@ | |||
| 44 | */ | 68 | */ |
| 45 | int init_srcu_struct(struct srcu_struct *sp) | 69 | int init_srcu_struct(struct srcu_struct *sp) |
| 46 | { | 70 | { |
| 47 | sp->completed = 0; | 71 | return init_srcu_struct_fields(sp); |
| 48 | mutex_init(&sp->mutex); | ||
| 49 | sp->per_cpu_ref = alloc_percpu(struct srcu_struct_array); | ||
| 50 | return (sp->per_cpu_ref ? 0 : -ENOMEM); | ||
| 51 | } | 72 | } |
| 52 | EXPORT_SYMBOL_GPL(init_srcu_struct); | 73 | EXPORT_SYMBOL_GPL(init_srcu_struct); |
| 53 | 74 | ||
| 75 | #endif /* #else #ifdef CONFIG_DEBUG_LOCK_ALLOC */ | ||
| 76 | |||
| 54 | /* | 77 | /* |
| 55 | * srcu_readers_active_idx -- returns approximate number of readers | 78 | * srcu_readers_active_idx -- returns approximate number of readers |
| 56 | * active on the specified rank of per-CPU counters. | 79 | * active on the specified rank of per-CPU counters. |
| @@ -100,15 +123,12 @@ void cleanup_srcu_struct(struct srcu_struct *sp) | |||
| 100 | } | 123 | } |
| 101 | EXPORT_SYMBOL_GPL(cleanup_srcu_struct); | 124 | EXPORT_SYMBOL_GPL(cleanup_srcu_struct); |
| 102 | 125 | ||
| 103 | /** | 126 | /* |
| 104 | * srcu_read_lock - register a new reader for an SRCU-protected structure. | ||
| 105 | * @sp: srcu_struct in which to register the new reader. | ||
| 106 | * | ||
| 107 | * Counts the new reader in the appropriate per-CPU element of the | 127 | * Counts the new reader in the appropriate per-CPU element of the |
| 108 | * srcu_struct. Must be called from process context. | 128 | * srcu_struct. Must be called from process context. |
| 109 | * Returns an index that must be passed to the matching srcu_read_unlock(). | 129 | * Returns an index that must be passed to the matching srcu_read_unlock(). |
| 110 | */ | 130 | */ |
| 111 | int srcu_read_lock(struct srcu_struct *sp) | 131 | int __srcu_read_lock(struct srcu_struct *sp) |
| 112 | { | 132 | { |
| 113 | int idx; | 133 | int idx; |
| 114 | 134 | ||
| @@ -120,31 +140,27 @@ int srcu_read_lock(struct srcu_struct *sp) | |||
| 120 | preempt_enable(); | 140 | preempt_enable(); |
| 121 | return idx; | 141 | return idx; |
| 122 | } | 142 | } |
| 123 | EXPORT_SYMBOL_GPL(srcu_read_lock); | 143 | EXPORT_SYMBOL_GPL(__srcu_read_lock); |
| 124 | 144 | ||
| 125 | /** | 145 | /* |
| 126 | * srcu_read_unlock - unregister a old reader from an SRCU-protected structure. | ||
| 127 | * @sp: srcu_struct in which to unregister the old reader. | ||
| 128 | * @idx: return value from corresponding srcu_read_lock(). | ||
| 129 | * | ||
| 130 | * Removes the count for the old reader from the appropriate per-CPU | 146 | * Removes the count for the old reader from the appropriate per-CPU |
| 131 | * element of the srcu_struct. Note that this may well be a different | 147 | * element of the srcu_struct. Note that this may well be a different |
| 132 | * CPU than that which was incremented by the corresponding srcu_read_lock(). | 148 | * CPU than that which was incremented by the corresponding srcu_read_lock(). |
| 133 | * Must be called from process context. | 149 | * Must be called from process context. |
| 134 | */ | 150 | */ |
| 135 | void srcu_read_unlock(struct srcu_struct *sp, int idx) | 151 | void __srcu_read_unlock(struct srcu_struct *sp, int idx) |
| 136 | { | 152 | { |
| 137 | preempt_disable(); | 153 | preempt_disable(); |
| 138 | srcu_barrier(); /* ensure compiler won't misorder critical section. */ | 154 | srcu_barrier(); /* ensure compiler won't misorder critical section. */ |
| 139 | per_cpu_ptr(sp->per_cpu_ref, smp_processor_id())->c[idx]--; | 155 | per_cpu_ptr(sp->per_cpu_ref, smp_processor_id())->c[idx]--; |
| 140 | preempt_enable(); | 156 | preempt_enable(); |
| 141 | } | 157 | } |
| 142 | EXPORT_SYMBOL_GPL(srcu_read_unlock); | 158 | EXPORT_SYMBOL_GPL(__srcu_read_unlock); |
| 143 | 159 | ||
| 144 | /* | 160 | /* |
| 145 | * Helper function for synchronize_srcu() and synchronize_srcu_expedited(). | 161 | * Helper function for synchronize_srcu() and synchronize_srcu_expedited(). |
| 146 | */ | 162 | */ |
| 147 | void __synchronize_srcu(struct srcu_struct *sp, void (*sync_func)(void)) | 163 | static void __synchronize_srcu(struct srcu_struct *sp, void (*sync_func)(void)) |
| 148 | { | 164 | { |
| 149 | int idx; | 165 | int idx; |
| 150 | 166 | ||
diff --git a/kernel/sys.c b/kernel/sys.c index 26a6b73a6b85..18bde979f346 100644 --- a/kernel/sys.c +++ b/kernel/sys.c | |||
| @@ -222,6 +222,7 @@ SYSCALL_DEFINE2(getpriority, int, which, int, who) | |||
| 222 | if (which > PRIO_USER || which < PRIO_PROCESS) | 222 | if (which > PRIO_USER || which < PRIO_PROCESS) |
| 223 | return -EINVAL; | 223 | return -EINVAL; |
| 224 | 224 | ||
| 225 | rcu_read_lock(); | ||
| 225 | read_lock(&tasklist_lock); | 226 | read_lock(&tasklist_lock); |
| 226 | switch (which) { | 227 | switch (which) { |
| 227 | case PRIO_PROCESS: | 228 | case PRIO_PROCESS: |
| @@ -267,6 +268,7 @@ SYSCALL_DEFINE2(getpriority, int, which, int, who) | |||
| 267 | } | 268 | } |
| 268 | out_unlock: | 269 | out_unlock: |
| 269 | read_unlock(&tasklist_lock); | 270 | read_unlock(&tasklist_lock); |
| 271 | rcu_read_unlock(); | ||
| 270 | 272 | ||
| 271 | return retval; | 273 | return retval; |
| 272 | } | 274 | } |
diff --git a/kernel/trace/trace_kprobe.c b/kernel/trace/trace_kprobe.c index 6ea90c0e2c96..50b1b8239806 100644 --- a/kernel/trace/trace_kprobe.c +++ b/kernel/trace/trace_kprobe.c | |||
| @@ -689,7 +689,7 @@ static int create_trace_probe(int argc, char **argv) | |||
| 689 | return -EINVAL; | 689 | return -EINVAL; |
| 690 | } | 690 | } |
| 691 | /* an address specified */ | 691 | /* an address specified */ |
| 692 | ret = strict_strtoul(&argv[0][2], 0, (unsigned long *)&addr); | 692 | ret = strict_strtoul(&argv[1][0], 0, (unsigned long *)&addr); |
| 693 | if (ret) { | 693 | if (ret) { |
| 694 | pr_info("Failed to parse address.\n"); | 694 | pr_info("Failed to parse address.\n"); |
| 695 | return ret; | 695 | return ret; |
diff --git a/kernel/trace/trace_stack.c b/kernel/trace/trace_stack.c index 678a5120ee30..f4bc9b27de5f 100644 --- a/kernel/trace/trace_stack.c +++ b/kernel/trace/trace_stack.c | |||
| @@ -157,6 +157,7 @@ stack_max_size_write(struct file *filp, const char __user *ubuf, | |||
| 157 | unsigned long val, flags; | 157 | unsigned long val, flags; |
| 158 | char buf[64]; | 158 | char buf[64]; |
| 159 | int ret; | 159 | int ret; |
| 160 | int cpu; | ||
| 160 | 161 | ||
| 161 | if (count >= sizeof(buf)) | 162 | if (count >= sizeof(buf)) |
| 162 | return -EINVAL; | 163 | return -EINVAL; |
| @@ -171,9 +172,20 @@ stack_max_size_write(struct file *filp, const char __user *ubuf, | |||
| 171 | return ret; | 172 | return ret; |
| 172 | 173 | ||
| 173 | local_irq_save(flags); | 174 | local_irq_save(flags); |
| 175 | |||
| 176 | /* | ||
| 177 | * In case we trace inside arch_spin_lock() or after (NMI), | ||
| 178 | * we will cause circular lock, so we also need to increase | ||
| 179 | * the percpu trace_active here. | ||
| 180 | */ | ||
| 181 | cpu = smp_processor_id(); | ||
| 182 | per_cpu(trace_active, cpu)++; | ||
| 183 | |||
| 174 | arch_spin_lock(&max_stack_lock); | 184 | arch_spin_lock(&max_stack_lock); |
| 175 | *ptr = val; | 185 | *ptr = val; |
| 176 | arch_spin_unlock(&max_stack_lock); | 186 | arch_spin_unlock(&max_stack_lock); |
| 187 | |||
| 188 | per_cpu(trace_active, cpu)--; | ||
| 177 | local_irq_restore(flags); | 189 | local_irq_restore(flags); |
| 178 | 190 | ||
| 179 | return count; | 191 | return count; |
| @@ -206,7 +218,13 @@ t_next(struct seq_file *m, void *v, loff_t *pos) | |||
| 206 | 218 | ||
| 207 | static void *t_start(struct seq_file *m, loff_t *pos) | 219 | static void *t_start(struct seq_file *m, loff_t *pos) |
| 208 | { | 220 | { |
| 221 | int cpu; | ||
| 222 | |||
| 209 | local_irq_disable(); | 223 | local_irq_disable(); |
| 224 | |||
| 225 | cpu = smp_processor_id(); | ||
| 226 | per_cpu(trace_active, cpu)++; | ||
| 227 | |||
| 210 | arch_spin_lock(&max_stack_lock); | 228 | arch_spin_lock(&max_stack_lock); |
| 211 | 229 | ||
| 212 | if (*pos == 0) | 230 | if (*pos == 0) |
| @@ -217,7 +235,13 @@ static void *t_start(struct seq_file *m, loff_t *pos) | |||
| 217 | 235 | ||
| 218 | static void t_stop(struct seq_file *m, void *p) | 236 | static void t_stop(struct seq_file *m, void *p) |
| 219 | { | 237 | { |
| 238 | int cpu; | ||
| 239 | |||
| 220 | arch_spin_unlock(&max_stack_lock); | 240 | arch_spin_unlock(&max_stack_lock); |
| 241 | |||
| 242 | cpu = smp_processor_id(); | ||
| 243 | per_cpu(trace_active, cpu)--; | ||
| 244 | |||
| 221 | local_irq_enable(); | 245 | local_irq_enable(); |
| 222 | } | 246 | } |
| 223 | 247 | ||
