]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Read-Copy Update mechanism for mutual exclusion | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or modify | |
5 | * it under the terms of the GNU General Public License as published by | |
6 | * the Free Software Foundation; either version 2 of the License, or | |
7 | * (at your option) any later version. | |
8 | * | |
9 | * This program is distributed in the hope that it will be useful, | |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
13 | * | |
14 | * You should have received a copy of the GNU General Public License | |
15 | * along with this program; if not, write to the Free Software | |
16 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | |
17 | * | |
01c1c660 | 18 | * Copyright IBM Corporation, 2001 |
1da177e4 LT |
19 | * |
20 | * Authors: Dipankar Sarma <[email protected]> | |
21 | * Manfred Spraul <[email protected]> | |
22 | * | |
23 | * Based on the original work by Paul McKenney <[email protected]> | |
24 | * and inputs from Rusty Russell, Andrea Arcangeli and Andi Kleen. | |
25 | * Papers: | |
26 | * http://www.rdrop.com/users/paulmck/paper/rclockpdcsproof.pdf | |
27 | * http://lse.sourceforge.net/locking/rclock_OLS.2001.05.01c.sc.pdf (OLS2001) | |
28 | * | |
29 | * For detailed explanation of Read-Copy Update mechanism see - | |
30 | * http://lse.sourceforge.net/locking/rcupdate.html | |
31 | * | |
32 | */ | |
33 | #include <linux/types.h> | |
34 | #include <linux/kernel.h> | |
35 | #include <linux/init.h> | |
36 | #include <linux/spinlock.h> | |
37 | #include <linux/smp.h> | |
38 | #include <linux/interrupt.h> | |
39 | #include <linux/sched.h> | |
40 | #include <asm/atomic.h> | |
41 | #include <linux/bitops.h> | |
1da177e4 | 42 | #include <linux/completion.h> |
1da177e4 LT |
43 | #include <linux/percpu.h> |
44 | #include <linux/notifier.h> | |
1da177e4 | 45 | #include <linux/cpu.h> |
9331b315 | 46 | #include <linux/mutex.h> |
01c1c660 | 47 | #include <linux/module.h> |
1da177e4 | 48 | |
01c1c660 PM |
49 | struct rcu_synchronize { |
50 | struct rcu_head head; | |
51 | struct completion completion; | |
1da177e4 | 52 | }; |
1da177e4 | 53 | |
01c1c660 | 54 | static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL}; |
21a1ea9e | 55 | static atomic_t rcu_barrier_cpu_count; |
9331b315 | 56 | static DEFINE_MUTEX(rcu_barrier_mutex); |
21a1ea9e DS |
57 | static struct completion rcu_barrier_completion; |
58 | ||
fbf6bfca PM |
59 | /* |
60 | * Awaken the corresponding synchronize_rcu() instance now that a | |
61 | * grace period has elapsed. | |
62 | */ | |
01c1c660 | 63 | static void wakeme_after_rcu(struct rcu_head *head) |
21a1ea9e | 64 | { |
01c1c660 PM |
65 | struct rcu_synchronize *rcu; |
66 | ||
67 | rcu = container_of(head, struct rcu_synchronize, head); | |
68 | complete(&rcu->completion); | |
21a1ea9e | 69 | } |
1da177e4 LT |
70 | |
71 | /** | |
01c1c660 | 72 | * synchronize_rcu - wait until a grace period has elapsed. |
1da177e4 | 73 | * |
01c1c660 PM |
74 | * Control will return to the caller some time after a full grace |
75 | * period has elapsed, in other words after all currently executing RCU | |
1da177e4 LT |
76 | * read-side critical sections have completed. RCU read-side critical |
77 | * sections are delimited by rcu_read_lock() and rcu_read_unlock(), | |
78 | * and may be nested. | |
79 | */ | |
01c1c660 | 80 | void synchronize_rcu(void) |
1da177e4 | 81 | { |
01c1c660 | 82 | struct rcu_synchronize rcu; |
1da177e4 | 83 | |
01c1c660 PM |
84 | init_completion(&rcu.completion); |
85 | /* Will wake me after RCU finished */ | |
86 | call_rcu(&rcu.head, wakeme_after_rcu); | |
a241ec65 | 87 | |
01c1c660 PM |
88 | /* Wait for it */ |
89 | wait_for_completion(&rcu.completion); | |
c32e0660 | 90 | } |
01c1c660 | 91 | EXPORT_SYMBOL_GPL(synchronize_rcu); |
c32e0660 | 92 | |
ab4720ec DS |
93 | static void rcu_barrier_callback(struct rcu_head *notused) |
94 | { | |
95 | if (atomic_dec_and_test(&rcu_barrier_cpu_count)) | |
96 | complete(&rcu_barrier_completion); | |
97 | } | |
98 | ||
99 | /* | |
100 | * Called with preemption disabled, and from cross-cpu IRQ context. | |
101 | */ | |
102 | static void rcu_barrier_func(void *notused) | |
103 | { | |
104 | int cpu = smp_processor_id(); | |
01c1c660 | 105 | struct rcu_head *head = &per_cpu(rcu_barrier_head, cpu); |
ab4720ec | 106 | |
ab4720ec DS |
107 | atomic_inc(&rcu_barrier_cpu_count); |
108 | call_rcu(head, rcu_barrier_callback); | |
109 | } | |
110 | ||
111 | /** | |
112 | * rcu_barrier - Wait until all the in-flight RCUs are complete. | |
113 | */ | |
114 | void rcu_barrier(void) | |
115 | { | |
116 | BUG_ON(in_interrupt()); | |
9331b315 IM |
117 | /* Take cpucontrol mutex to protect against CPU hotplug */ |
118 | mutex_lock(&rcu_barrier_mutex); | |
ab4720ec DS |
119 | init_completion(&rcu_barrier_completion); |
120 | atomic_set(&rcu_barrier_cpu_count, 0); | |
e0ecfa79 PM |
121 | /* |
122 | * The queueing of callbacks in all CPUs must be atomic with | |
123 | * respect to RCU, otherwise one CPU may queue a callback, | |
124 | * wait for a grace period, decrement barrier count and call | |
125 | * complete(), while other CPUs have not yet queued anything. | |
126 | * So, we need to make sure that grace periods cannot complete | |
127 | * until all the callbacks are queued. | |
128 | */ | |
129 | rcu_read_lock(); | |
ab4720ec | 130 | on_each_cpu(rcu_barrier_func, NULL, 0, 1); |
e0ecfa79 | 131 | rcu_read_unlock(); |
ab4720ec | 132 | wait_for_completion(&rcu_barrier_completion); |
9331b315 | 133 | mutex_unlock(&rcu_barrier_mutex); |
ab4720ec DS |
134 | } |
135 | EXPORT_SYMBOL_GPL(rcu_barrier); | |
136 | ||
1da177e4 LT |
137 | void __init rcu_init(void) |
138 | { | |
01c1c660 | 139 | __rcu_init(); |
1da177e4 LT |
140 | } |
141 |