diff options
author | Linus Torvalds <torvalds@linux-foundation.org> | 2015-04-13 13:27:28 -0400 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2015-04-13 13:27:28 -0400 |
commit | cc76ee75a9d3201eeacc576d17fbc1511f673010 (patch) | |
tree | 9505405c270718c491840ae7d0da0521386ce939 | |
parent | 9c65e12a55fea2da50f4069ec0dc47c50b7bd2bb (diff) | |
parent | 58995a9a5b292458f94a2356b8c878230fa56fe0 (diff) |
Merge branch 'locking-core-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/tip/tip
Pull core locking changes from Ingo Molnar:
"Main changes:
- jump label asm preparatory work for PowerPC (Anton Blanchard)
- rwsem optimizations and cleanups (Davidlohr Bueso)
- mutex optimizations and cleanups (Jason Low)
- futex fix (Oleg Nesterov)
- remove broken atomicity checks from {READ,WRITE}_ONCE() (Peter
Zijlstra)"
* 'locking-core-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/tip/tip:
powerpc, jump_label: Include linux/jump_label.h to get HAVE_JUMP_LABEL define
jump_label: Allow jump labels to be used in assembly
jump_label: Allow asm/jump_label.h to be included in assembly
locking/mutex: Further simplify mutex_spin_on_owner()
locking: Remove atomicy checks from {READ,WRITE}_ONCE
locking/rtmutex: Rename argument in the rt_mutex_adjust_prio_chain() documentation as well
locking/rwsem: Fix lock optimistic spinning when owner is not running
locking: Remove ACCESS_ONCE() usage
locking/rwsem: Check for active lock before bailing on spinning
locking/rwsem: Avoid deceiving lock spinners
locking/rwsem: Set lock ownership ASAP
locking/rwsem: Document barrier need when waking tasks
locking/futex: Check PF_KTHREAD rather than !p->mm to filter out kthreads
locking/mutex: Refactor mutex_spin_on_owner()
locking/mutex: In mutex_spin_on_owner(), return true when owner changes
-rw-r--r-- | Makefile | 1 | ||||
-rw-r--r-- | arch/arm/include/asm/jump_label.h | 5 | ||||
-rw-r--r-- | arch/arm64/include/asm/jump_label.h | 8 | ||||
-rw-r--r-- | arch/mips/include/asm/jump_label.h | 7 | ||||
-rw-r--r-- | arch/powerpc/platforms/powernv/opal-wrappers.S | 2 | ||||
-rw-r--r-- | arch/powerpc/platforms/pseries/hvCall.S | 2 | ||||
-rw-r--r-- | arch/powerpc/platforms/pseries/lpar.c | 2 | ||||
-rw-r--r-- | arch/s390/include/asm/jump_label.h | 3 | ||||
-rw-r--r-- | arch/sparc/include/asm/jump_label.h | 5 | ||||
-rw-r--r-- | arch/x86/include/asm/jump_label.h | 5 | ||||
-rw-r--r-- | include/linux/compiler.h | 16 | ||||
-rw-r--r-- | include/linux/jump_label.h | 21 | ||||
-rw-r--r-- | include/linux/seqlock.h | 6 | ||||
-rw-r--r-- | kernel/futex.c | 2 | ||||
-rw-r--r-- | kernel/locking/mcs_spinlock.h | 6 | ||||
-rw-r--r-- | kernel/locking/mutex.c | 51 | ||||
-rw-r--r-- | kernel/locking/osq_lock.c | 14 | ||||
-rw-r--r-- | kernel/locking/rtmutex.c | 2 | ||||
-rw-r--r-- | kernel/locking/rwsem-spinlock.c | 7 | ||||
-rw-r--r-- | kernel/locking/rwsem-xadd.c | 98 | ||||
-rw-r--r-- | kernel/locking/rwsem.c | 22 | ||||
-rw-r--r-- | kernel/locking/rwsem.h | 20 | ||||
-rw-r--r-- | lib/lockref.c | 2 |
23 files changed, 160 insertions, 147 deletions
@@ -779,6 +779,7 @@ KBUILD_ARFLAGS := $(call ar-option,D) | |||
779 | # check for 'asm goto' | 779 | # check for 'asm goto' |
780 | ifeq ($(shell $(CONFIG_SHELL) $(srctree)/scripts/gcc-goto.sh $(CC)), y) | 780 | ifeq ($(shell $(CONFIG_SHELL) $(srctree)/scripts/gcc-goto.sh $(CC)), y) |
781 | KBUILD_CFLAGS += -DCC_HAVE_ASM_GOTO | 781 | KBUILD_CFLAGS += -DCC_HAVE_ASM_GOTO |
782 | KBUILD_AFLAGS += -DCC_HAVE_ASM_GOTO | ||
782 | endif | 783 | endif |
783 | 784 | ||
784 | include $(srctree)/scripts/Makefile.kasan | 785 | include $(srctree)/scripts/Makefile.kasan |
diff --git a/arch/arm/include/asm/jump_label.h b/arch/arm/include/asm/jump_label.h index 70f9b9bfb1f9..5f337dc5c108 100644 --- a/arch/arm/include/asm/jump_label.h +++ b/arch/arm/include/asm/jump_label.h | |||
@@ -1,7 +1,7 @@ | |||
1 | #ifndef _ASM_ARM_JUMP_LABEL_H | 1 | #ifndef _ASM_ARM_JUMP_LABEL_H |
2 | #define _ASM_ARM_JUMP_LABEL_H | 2 | #define _ASM_ARM_JUMP_LABEL_H |
3 | 3 | ||
4 | #ifdef __KERNEL__ | 4 | #ifndef __ASSEMBLY__ |
5 | 5 | ||
6 | #include <linux/types.h> | 6 | #include <linux/types.h> |
7 | 7 | ||
@@ -27,8 +27,6 @@ l_yes: | |||
27 | return true; | 27 | return true; |
28 | } | 28 | } |
29 | 29 | ||
30 | #endif /* __KERNEL__ */ | ||
31 | |||
32 | typedef u32 jump_label_t; | 30 | typedef u32 jump_label_t; |
33 | 31 | ||
34 | struct jump_entry { | 32 | struct jump_entry { |
@@ -37,4 +35,5 @@ struct jump_entry { | |||
37 | jump_label_t key; | 35 | jump_label_t key; |
38 | }; | 36 | }; |
39 | 37 | ||
38 | #endif /* __ASSEMBLY__ */ | ||
40 | #endif | 39 | #endif |
diff --git a/arch/arm64/include/asm/jump_label.h b/arch/arm64/include/asm/jump_label.h index 076a1c714049..c0e5165c2f76 100644 --- a/arch/arm64/include/asm/jump_label.h +++ b/arch/arm64/include/asm/jump_label.h | |||
@@ -18,11 +18,12 @@ | |||
18 | */ | 18 | */ |
19 | #ifndef __ASM_JUMP_LABEL_H | 19 | #ifndef __ASM_JUMP_LABEL_H |
20 | #define __ASM_JUMP_LABEL_H | 20 | #define __ASM_JUMP_LABEL_H |
21 | |||
22 | #ifndef __ASSEMBLY__ | ||
23 | |||
21 | #include <linux/types.h> | 24 | #include <linux/types.h> |
22 | #include <asm/insn.h> | 25 | #include <asm/insn.h> |
23 | 26 | ||
24 | #ifdef __KERNEL__ | ||
25 | |||
26 | #define JUMP_LABEL_NOP_SIZE AARCH64_INSN_SIZE | 27 | #define JUMP_LABEL_NOP_SIZE AARCH64_INSN_SIZE |
27 | 28 | ||
28 | static __always_inline bool arch_static_branch(struct static_key *key) | 29 | static __always_inline bool arch_static_branch(struct static_key *key) |
@@ -39,8 +40,6 @@ l_yes: | |||
39 | return true; | 40 | return true; |
40 | } | 41 | } |
41 | 42 | ||
42 | #endif /* __KERNEL__ */ | ||
43 | |||
44 | typedef u64 jump_label_t; | 43 | typedef u64 jump_label_t; |
45 | 44 | ||
46 | struct jump_entry { | 45 | struct jump_entry { |
@@ -49,4 +48,5 @@ struct jump_entry { | |||
49 | jump_label_t key; | 48 | jump_label_t key; |
50 | }; | 49 | }; |
51 | 50 | ||
51 | #endif /* __ASSEMBLY__ */ | ||
52 | #endif /* __ASM_JUMP_LABEL_H */ | 52 | #endif /* __ASM_JUMP_LABEL_H */ |
diff --git a/arch/mips/include/asm/jump_label.h b/arch/mips/include/asm/jump_label.h index fdbff44e5482..608aa57799c8 100644 --- a/arch/mips/include/asm/jump_label.h +++ b/arch/mips/include/asm/jump_label.h | |||
@@ -8,9 +8,9 @@ | |||
8 | #ifndef _ASM_MIPS_JUMP_LABEL_H | 8 | #ifndef _ASM_MIPS_JUMP_LABEL_H |
9 | #define _ASM_MIPS_JUMP_LABEL_H | 9 | #define _ASM_MIPS_JUMP_LABEL_H |
10 | 10 | ||
11 | #include <linux/types.h> | 11 | #ifndef __ASSEMBLY__ |
12 | 12 | ||
13 | #ifdef __KERNEL__ | 13 | #include <linux/types.h> |
14 | 14 | ||
15 | #define JUMP_LABEL_NOP_SIZE 4 | 15 | #define JUMP_LABEL_NOP_SIZE 4 |
16 | 16 | ||
@@ -39,8 +39,6 @@ l_yes: | |||
39 | return true; | 39 | return true; |
40 | } | 40 | } |
41 | 41 | ||
42 | #endif /* __KERNEL__ */ | ||
43 | |||
44 | #ifdef CONFIG_64BIT | 42 | #ifdef CONFIG_64BIT |
45 | typedef u64 jump_label_t; | 43 | typedef u64 jump_label_t; |
46 | #else | 44 | #else |
@@ -53,4 +51,5 @@ struct jump_entry { | |||
53 | jump_label_t key; | 51 | jump_label_t key; |
54 | }; | 52 | }; |
55 | 53 | ||
54 | #endif /* __ASSEMBLY__ */ | ||
56 | #endif /* _ASM_MIPS_JUMP_LABEL_H */ | 55 | #endif /* _ASM_MIPS_JUMP_LABEL_H */ |
diff --git a/arch/powerpc/platforms/powernv/opal-wrappers.S b/arch/powerpc/platforms/powernv/opal-wrappers.S index 0509bca5e830..fcbe899fe299 100644 --- a/arch/powerpc/platforms/powernv/opal-wrappers.S +++ b/arch/powerpc/platforms/powernv/opal-wrappers.S | |||
@@ -9,11 +9,11 @@ | |||
9 | * 2 of the License, or (at your option) any later version. | 9 | * 2 of the License, or (at your option) any later version. |
10 | */ | 10 | */ |
11 | 11 | ||
12 | #include <linux/jump_label.h> | ||
12 | #include <asm/ppc_asm.h> | 13 | #include <asm/ppc_asm.h> |
13 | #include <asm/hvcall.h> | 14 | #include <asm/hvcall.h> |
14 | #include <asm/asm-offsets.h> | 15 | #include <asm/asm-offsets.h> |
15 | #include <asm/opal.h> | 16 | #include <asm/opal.h> |
16 | #include <asm/jump_label.h> | ||
17 | 17 | ||
18 | .section ".text" | 18 | .section ".text" |
19 | 19 | ||
diff --git a/arch/powerpc/platforms/pseries/hvCall.S b/arch/powerpc/platforms/pseries/hvCall.S index ccd53f91e8aa..74b5b8e239c8 100644 --- a/arch/powerpc/platforms/pseries/hvCall.S +++ b/arch/powerpc/platforms/pseries/hvCall.S | |||
@@ -7,12 +7,12 @@ | |||
7 | * as published by the Free Software Foundation; either version | 7 | * as published by the Free Software Foundation; either version |
8 | * 2 of the License, or (at your option) any later version. | 8 | * 2 of the License, or (at your option) any later version. |
9 | */ | 9 | */ |
10 | #include <linux/jump_label.h> | ||
10 | #include <asm/hvcall.h> | 11 | #include <asm/hvcall.h> |
11 | #include <asm/processor.h> | 12 | #include <asm/processor.h> |
12 | #include <asm/ppc_asm.h> | 13 | #include <asm/ppc_asm.h> |
13 | #include <asm/asm-offsets.h> | 14 | #include <asm/asm-offsets.h> |
14 | #include <asm/ptrace.h> | 15 | #include <asm/ptrace.h> |
15 | #include <asm/jump_label.h> | ||
16 | 16 | ||
17 | .section ".text" | 17 | .section ".text" |
18 | 18 | ||
diff --git a/arch/powerpc/platforms/pseries/lpar.c b/arch/powerpc/platforms/pseries/lpar.c index b5682fd6c984..b7a67e3d2201 100644 --- a/arch/powerpc/platforms/pseries/lpar.c +++ b/arch/powerpc/platforms/pseries/lpar.c | |||
@@ -26,7 +26,7 @@ | |||
26 | #include <linux/dma-mapping.h> | 26 | #include <linux/dma-mapping.h> |
27 | #include <linux/console.h> | 27 | #include <linux/console.h> |
28 | #include <linux/export.h> | 28 | #include <linux/export.h> |
29 | #include <linux/static_key.h> | 29 | #include <linux/jump_label.h> |
30 | #include <asm/processor.h> | 30 | #include <asm/processor.h> |
31 | #include <asm/mmu.h> | 31 | #include <asm/mmu.h> |
32 | #include <asm/page.h> | 32 | #include <asm/page.h> |
diff --git a/arch/s390/include/asm/jump_label.h b/arch/s390/include/asm/jump_label.h index 58642fd29c87..2b77e235b5fb 100644 --- a/arch/s390/include/asm/jump_label.h +++ b/arch/s390/include/asm/jump_label.h | |||
@@ -1,6 +1,8 @@ | |||
1 | #ifndef _ASM_S390_JUMP_LABEL_H | 1 | #ifndef _ASM_S390_JUMP_LABEL_H |
2 | #define _ASM_S390_JUMP_LABEL_H | 2 | #define _ASM_S390_JUMP_LABEL_H |
3 | 3 | ||
4 | #ifndef __ASSEMBLY__ | ||
5 | |||
4 | #include <linux/types.h> | 6 | #include <linux/types.h> |
5 | 7 | ||
6 | #define JUMP_LABEL_NOP_SIZE 6 | 8 | #define JUMP_LABEL_NOP_SIZE 6 |
@@ -39,4 +41,5 @@ struct jump_entry { | |||
39 | jump_label_t key; | 41 | jump_label_t key; |
40 | }; | 42 | }; |
41 | 43 | ||
44 | #endif /* __ASSEMBLY__ */ | ||
42 | #endif | 45 | #endif |
diff --git a/arch/sparc/include/asm/jump_label.h b/arch/sparc/include/asm/jump_label.h index ec2e2e2aba7d..cc9b04a2b11b 100644 --- a/arch/sparc/include/asm/jump_label.h +++ b/arch/sparc/include/asm/jump_label.h | |||
@@ -1,7 +1,7 @@ | |||
1 | #ifndef _ASM_SPARC_JUMP_LABEL_H | 1 | #ifndef _ASM_SPARC_JUMP_LABEL_H |
2 | #define _ASM_SPARC_JUMP_LABEL_H | 2 | #define _ASM_SPARC_JUMP_LABEL_H |
3 | 3 | ||
4 | #ifdef __KERNEL__ | 4 | #ifndef __ASSEMBLY__ |
5 | 5 | ||
6 | #include <linux/types.h> | 6 | #include <linux/types.h> |
7 | 7 | ||
@@ -22,8 +22,6 @@ l_yes: | |||
22 | return true; | 22 | return true; |
23 | } | 23 | } |
24 | 24 | ||
25 | #endif /* __KERNEL__ */ | ||
26 | |||
27 | typedef u32 jump_label_t; | 25 | typedef u32 jump_label_t; |
28 | 26 | ||
29 | struct jump_entry { | 27 | struct jump_entry { |
@@ -32,4 +30,5 @@ struct jump_entry { | |||
32 | jump_label_t key; | 30 | jump_label_t key; |
33 | }; | 31 | }; |
34 | 32 | ||
33 | #endif /* __ASSEMBLY__ */ | ||
35 | #endif | 34 | #endif |
diff --git a/arch/x86/include/asm/jump_label.h b/arch/x86/include/asm/jump_label.h index 6a2cefb4395a..a4c1cf7e93f8 100644 --- a/arch/x86/include/asm/jump_label.h +++ b/arch/x86/include/asm/jump_label.h | |||
@@ -1,7 +1,7 @@ | |||
1 | #ifndef _ASM_X86_JUMP_LABEL_H | 1 | #ifndef _ASM_X86_JUMP_LABEL_H |
2 | #define _ASM_X86_JUMP_LABEL_H | 2 | #define _ASM_X86_JUMP_LABEL_H |
3 | 3 | ||
4 | #ifdef __KERNEL__ | 4 | #ifndef __ASSEMBLY__ |
5 | 5 | ||
6 | #include <linux/stringify.h> | 6 | #include <linux/stringify.h> |
7 | #include <linux/types.h> | 7 | #include <linux/types.h> |
@@ -30,8 +30,6 @@ l_yes: | |||
30 | return true; | 30 | return true; |
31 | } | 31 | } |
32 | 32 | ||
33 | #endif /* __KERNEL__ */ | ||
34 | |||
35 | #ifdef CONFIG_X86_64 | 33 | #ifdef CONFIG_X86_64 |
36 | typedef u64 jump_label_t; | 34 | typedef u64 jump_label_t; |
37 | #else | 35 | #else |
@@ -44,4 +42,5 @@ struct jump_entry { | |||
44 | jump_label_t key; | 42 | jump_label_t key; |
45 | }; | 43 | }; |
46 | 44 | ||
45 | #endif /* __ASSEMBLY__ */ | ||
47 | #endif | 46 | #endif |
diff --git a/include/linux/compiler.h b/include/linux/compiler.h index 1b45e4a0519b..0e41ca0e5927 100644 --- a/include/linux/compiler.h +++ b/include/linux/compiler.h | |||
@@ -192,29 +192,16 @@ void ftrace_likely_update(struct ftrace_branch_data *f, int val, int expect); | |||
192 | 192 | ||
193 | #include <uapi/linux/types.h> | 193 | #include <uapi/linux/types.h> |
194 | 194 | ||
195 | static __always_inline void data_access_exceeds_word_size(void) | ||
196 | #ifdef __compiletime_warning | ||
197 | __compiletime_warning("data access exceeds word size and won't be atomic") | ||
198 | #endif | ||
199 | ; | ||
200 | |||
201 | static __always_inline void data_access_exceeds_word_size(void) | ||
202 | { | ||
203 | } | ||
204 | |||
205 | static __always_inline void __read_once_size(const volatile void *p, void *res, int size) | 195 | static __always_inline void __read_once_size(const volatile void *p, void *res, int size) |
206 | { | 196 | { |
207 | switch (size) { | 197 | switch (size) { |
208 | case 1: *(__u8 *)res = *(volatile __u8 *)p; break; | 198 | case 1: *(__u8 *)res = *(volatile __u8 *)p; break; |
209 | case 2: *(__u16 *)res = *(volatile __u16 *)p; break; | 199 | case 2: *(__u16 *)res = *(volatile __u16 *)p; break; |
210 | case 4: *(__u32 *)res = *(volatile __u32 *)p; break; | 200 | case 4: *(__u32 *)res = *(volatile __u32 *)p; break; |
211 | #ifdef CONFIG_64BIT | ||
212 | case 8: *(__u64 *)res = *(volatile __u64 *)p; break; | 201 | case 8: *(__u64 *)res = *(volatile __u64 *)p; break; |
213 | #endif | ||
214 | default: | 202 | default: |
215 | barrier(); | 203 | barrier(); |
216 | __builtin_memcpy((void *)res, (const void *)p, size); | 204 | __builtin_memcpy((void *)res, (const void *)p, size); |
217 | data_access_exceeds_word_size(); | ||
218 | barrier(); | 205 | barrier(); |
219 | } | 206 | } |
220 | } | 207 | } |
@@ -225,13 +212,10 @@ static __always_inline void __write_once_size(volatile void *p, void *res, int s | |||
225 | case 1: *(volatile __u8 *)p = *(__u8 *)res; break; | 212 | case 1: *(volatile __u8 *)p = *(__u8 *)res; break; |
226 | case 2: *(volatile __u16 *)p = *(__u16 *)res; break; | 213 | case 2: *(volatile __u16 *)p = *(__u16 *)res; break; |
227 | case 4: *(volatile __u32 *)p = *(__u32 *)res; break; | 214 | case 4: *(volatile __u32 *)p = *(__u32 *)res; break; |
228 | #ifdef CONFIG_64BIT | ||
229 | case 8: *(volatile __u64 *)p = *(__u64 *)res; break; | 215 | case 8: *(volatile __u64 *)p = *(__u64 *)res; break; |
230 | #endif | ||
231 | default: | 216 | default: |
232 | barrier(); | 217 | barrier(); |
233 | __builtin_memcpy((void *)p, (const void *)res, size); | 218 | __builtin_memcpy((void *)p, (const void *)res, size); |
234 | data_access_exceeds_word_size(); | ||
235 | barrier(); | 219 | barrier(); |
236 | } | 220 | } |
237 | } | 221 | } |
diff --git a/include/linux/jump_label.h b/include/linux/jump_label.h index 98f923b6a0ea..f4de473f226b 100644 --- a/include/linux/jump_label.h +++ b/include/linux/jump_label.h | |||
@@ -45,6 +45,12 @@ | |||
45 | * same as using STATIC_KEY_INIT_FALSE. | 45 | * same as using STATIC_KEY_INIT_FALSE. |
46 | */ | 46 | */ |
47 | 47 | ||
48 | #if defined(CC_HAVE_ASM_GOTO) && defined(CONFIG_JUMP_LABEL) | ||
49 | # define HAVE_JUMP_LABEL | ||
50 | #endif | ||
51 | |||
52 | #ifndef __ASSEMBLY__ | ||
53 | |||
48 | #include <linux/types.h> | 54 | #include <linux/types.h> |
49 | #include <linux/compiler.h> | 55 | #include <linux/compiler.h> |
50 | #include <linux/bug.h> | 56 | #include <linux/bug.h> |
@@ -55,7 +61,7 @@ extern bool static_key_initialized; | |||
55 | "%s used before call to jump_label_init", \ | 61 | "%s used before call to jump_label_init", \ |
56 | __func__) | 62 | __func__) |
57 | 63 | ||
58 | #if defined(CC_HAVE_ASM_GOTO) && defined(CONFIG_JUMP_LABEL) | 64 | #ifdef HAVE_JUMP_LABEL |
59 | 65 | ||
60 | struct static_key { | 66 | struct static_key { |
61 | atomic_t enabled; | 67 | atomic_t enabled; |
@@ -66,13 +72,18 @@ struct static_key { | |||
66 | #endif | 72 | #endif |
67 | }; | 73 | }; |
68 | 74 | ||
69 | # include <asm/jump_label.h> | ||
70 | # define HAVE_JUMP_LABEL | ||
71 | #else | 75 | #else |
72 | struct static_key { | 76 | struct static_key { |
73 | atomic_t enabled; | 77 | atomic_t enabled; |
74 | }; | 78 | }; |
75 | #endif /* CC_HAVE_ASM_GOTO && CONFIG_JUMP_LABEL */ | 79 | #endif /* HAVE_JUMP_LABEL */ |
80 | #endif /* __ASSEMBLY__ */ | ||
81 | |||
82 | #ifdef HAVE_JUMP_LABEL | ||
83 | #include <asm/jump_label.h> | ||
84 | #endif | ||
85 | |||
86 | #ifndef __ASSEMBLY__ | ||
76 | 87 | ||
77 | enum jump_label_type { | 88 | enum jump_label_type { |
78 | JUMP_LABEL_DISABLE = 0, | 89 | JUMP_LABEL_DISABLE = 0, |
@@ -203,3 +214,5 @@ static inline bool static_key_enabled(struct static_key *key) | |||
203 | } | 214 | } |
204 | 215 | ||
205 | #endif /* _LINUX_JUMP_LABEL_H */ | 216 | #endif /* _LINUX_JUMP_LABEL_H */ |
217 | |||
218 | #endif /* __ASSEMBLY__ */ | ||
diff --git a/include/linux/seqlock.h b/include/linux/seqlock.h index f5df8f687b4d..5f68d0a391ce 100644 --- a/include/linux/seqlock.h +++ b/include/linux/seqlock.h | |||
@@ -108,7 +108,7 @@ static inline unsigned __read_seqcount_begin(const seqcount_t *s) | |||
108 | unsigned ret; | 108 | unsigned ret; |
109 | 109 | ||
110 | repeat: | 110 | repeat: |
111 | ret = ACCESS_ONCE(s->sequence); | 111 | ret = READ_ONCE(s->sequence); |
112 | if (unlikely(ret & 1)) { | 112 | if (unlikely(ret & 1)) { |
113 | cpu_relax(); | 113 | cpu_relax(); |
114 | goto repeat; | 114 | goto repeat; |
@@ -127,7 +127,7 @@ repeat: | |||
127 | */ | 127 | */ |
128 | static inline unsigned raw_read_seqcount(const seqcount_t *s) | 128 | static inline unsigned raw_read_seqcount(const seqcount_t *s) |
129 | { | 129 | { |
130 | unsigned ret = ACCESS_ONCE(s->sequence); | 130 | unsigned ret = READ_ONCE(s->sequence); |
131 | smp_rmb(); | 131 | smp_rmb(); |
132 | return ret; | 132 | return ret; |
133 | } | 133 | } |
@@ -179,7 +179,7 @@ static inline unsigned read_seqcount_begin(const seqcount_t *s) | |||
179 | */ | 179 | */ |
180 | static inline unsigned raw_seqcount_begin(const seqcount_t *s) | 180 | static inline unsigned raw_seqcount_begin(const seqcount_t *s) |
181 | { | 181 | { |
182 | unsigned ret = ACCESS_ONCE(s->sequence); | 182 | unsigned ret = READ_ONCE(s->sequence); |
183 | smp_rmb(); | 183 | smp_rmb(); |
184 | return ret & ~1; | 184 | return ret & ~1; |
185 | } | 185 | } |
diff --git a/kernel/futex.c b/kernel/futex.c index 2a5e3830e953..2579e407ff67 100644 --- a/kernel/futex.c +++ b/kernel/futex.c | |||
@@ -900,7 +900,7 @@ static int attach_to_pi_owner(u32 uval, union futex_key *key, | |||
900 | if (!p) | 900 | if (!p) |
901 | return -ESRCH; | 901 | return -ESRCH; |
902 | 902 | ||
903 | if (!p->mm) { | 903 | if (unlikely(p->flags & PF_KTHREAD)) { |
904 | put_task_struct(p); | 904 | put_task_struct(p); |
905 | return -EPERM; | 905 | return -EPERM; |
906 | } | 906 | } |
diff --git a/kernel/locking/mcs_spinlock.h b/kernel/locking/mcs_spinlock.h index d1fe2ba5bac9..75e114bdf3f2 100644 --- a/kernel/locking/mcs_spinlock.h +++ b/kernel/locking/mcs_spinlock.h | |||
@@ -78,7 +78,7 @@ void mcs_spin_lock(struct mcs_spinlock **lock, struct mcs_spinlock *node) | |||
78 | */ | 78 | */ |
79 | return; | 79 | return; |
80 | } | 80 | } |
81 | ACCESS_ONCE(prev->next) = node; | 81 | WRITE_ONCE(prev->next, node); |
82 | 82 | ||
83 | /* Wait until the lock holder passes the lock down. */ | 83 | /* Wait until the lock holder passes the lock down. */ |
84 | arch_mcs_spin_lock_contended(&node->locked); | 84 | arch_mcs_spin_lock_contended(&node->locked); |
@@ -91,7 +91,7 @@ void mcs_spin_lock(struct mcs_spinlock **lock, struct mcs_spinlock *node) | |||
91 | static inline | 91 | static inline |
92 | void mcs_spin_unlock(struct mcs_spinlock **lock, struct mcs_spinlock *node) | 92 | void mcs_spin_unlock(struct mcs_spinlock **lock, struct mcs_spinlock *node) |
93 | { | 93 | { |
94 | struct mcs_spinlock *next = ACCESS_ONCE(node->next); | 94 | struct mcs_spinlock *next = READ_ONCE(node->next); |
95 | 95 | ||
96 | if (likely(!next)) { | 96 | if (likely(!next)) { |
97 | /* | 97 | /* |
@@ -100,7 +100,7 @@ void mcs_spin_unlock(struct mcs_spinlock **lock, struct mcs_spinlock *node) | |||
100 | if (likely(cmpxchg(lock, node, NULL) == node)) | 100 | if (likely(cmpxchg(lock, node, NULL) == node)) |
101 | return; | 101 | return; |
102 | /* Wait until the next pointer is set */ | 102 | /* Wait until the next pointer is set */ |
103 | while (!(next = ACCESS_ONCE(node->next))) | 103 | while (!(next = READ_ONCE(node->next))) |
104 | cpu_relax_lowlatency(); | 104 | cpu_relax_lowlatency(); |
105 | } | 105 | } |
106 | 106 | ||
diff --git a/kernel/locking/mutex.c b/kernel/locking/mutex.c index 94674e5919cb..4cccea6b8934 100644 --- a/kernel/locking/mutex.c +++ b/kernel/locking/mutex.c | |||
@@ -25,7 +25,7 @@ | |||
25 | #include <linux/spinlock.h> | 25 | #include <linux/spinlock.h> |
26 | #include <linux/interrupt.h> | 26 | #include <linux/interrupt.h> |
27 | #include <linux/debug_locks.h> | 27 | #include <linux/debug_locks.h> |
28 | #include "mcs_spinlock.h" | 28 | #include <linux/osq_lock.h> |
29 | 29 | ||
30 | /* | 30 | /* |
31 | * In the DEBUG case we are using the "NULL fastpath" for mutexes, | 31 | * In the DEBUG case we are using the "NULL fastpath" for mutexes, |
@@ -217,44 +217,35 @@ ww_mutex_set_context_slowpath(struct ww_mutex *lock, | |||
217 | } | 217 | } |
218 | 218 | ||
219 | #ifdef CONFIG_MUTEX_SPIN_ON_OWNER | 219 | #ifdef CONFIG_MUTEX_SPIN_ON_OWNER |
220 | static inline bool owner_running(struct mutex *lock, struct task_struct *owner) | ||
221 | { | ||
222 | if (lock->owner != owner) | ||
223 | return false; | ||
224 | |||
225 | /* | ||
226 | * Ensure we emit the owner->on_cpu, dereference _after_ checking | ||
227 | * lock->owner still matches owner, if that fails, owner might | ||
228 | * point to free()d memory, if it still matches, the rcu_read_lock() | ||
229 | * ensures the memory stays valid. | ||
230 | */ | ||
231 | barrier(); | ||
232 | |||
233 | return owner->on_cpu; | ||
234 | } | ||
235 | |||
236 | /* | 220 | /* |
237 | * Look out! "owner" is an entirely speculative pointer | 221 | * Look out! "owner" is an entirely speculative pointer |
238 | * access and not reliable. | 222 | * access and not reliable. |
239 | */ | 223 | */ |
240 | static noinline | 224 | static noinline |
241 | int mutex_spin_on_owner(struct mutex *lock, struct task_struct *owner) | 225 | bool mutex_spin_on_owner(struct mutex *lock, struct task_struct *owner) |
242 | { | 226 | { |
227 | bool ret = true; | ||
228 | |||
243 | rcu_read_lock(); | 229 | rcu_read_lock(); |
244 | while (owner_running(lock, owner)) { | 230 | while (lock->owner == owner) { |
245 | if (need_resched()) | 231 | /* |
232 | * Ensure we emit the owner->on_cpu, dereference _after_ | ||
233 | * checking lock->owner still matches owner. If that fails, | ||
234 | * owner might point to freed memory. If it still matches, | ||
235 | * the rcu_read_lock() ensures the memory stays valid. | ||
236 | */ | ||
237 | barrier(); | ||
238 | |||
239 | if (!owner->on_cpu || need_resched()) { | ||
240 | ret = false; | ||
246 | break; | 241 | break; |
242 | } | ||
247 | 243 | ||
248 | cpu_relax_lowlatency(); | 244 | cpu_relax_lowlatency(); |
249 | } | 245 | } |
250 | rcu_read_unlock(); | 246 | rcu_read_unlock(); |
251 | 247 | ||
252 | /* | 248 | return ret; |
253 | * We break out the loop above on need_resched() and when the | ||
254 | * owner changed, which is a sign for heavy contention. Return | ||
255 | * success only when lock->owner is NULL. | ||
256 | */ | ||
257 | return lock->owner == NULL; | ||
258 | } | 249 | } |
259 | 250 | ||
260 | /* | 251 | /* |
@@ -269,7 +260,7 @@ static inline int mutex_can_spin_on_owner(struct mutex *lock) | |||
269 | return 0; | 260 | return 0; |
270 | 261 | ||
271 | rcu_read_lock(); | 262 | rcu_read_lock(); |
272 | owner = ACCESS_ONCE(lock->owner); | 263 | owner = READ_ONCE(lock->owner); |
273 | if (owner) | 264 | if (owner) |
274 | retval = owner->on_cpu; | 265 | retval = owner->on_cpu; |
275 | rcu_read_unlock(); | 266 | rcu_read_unlock(); |
@@ -343,7 +334,7 @@ static bool mutex_optimistic_spin(struct mutex *lock, | |||
343 | * As such, when deadlock detection needs to be | 334 | * As such, when deadlock detection needs to be |
344 | * performed the optimistic spinning cannot be done. | 335 | * performed the optimistic spinning cannot be done. |
345 | */ | 336 | */ |
346 | if (ACCESS_ONCE(ww->ctx)) | 337 | if (READ_ONCE(ww->ctx)) |
347 | break; | 338 | break; |
348 | } | 339 | } |
349 | 340 | ||
@@ -351,7 +342,7 @@ static bool mutex_optimistic_spin(struct mutex *lock, | |||
351 | * If there's an owner, wait for it to either | 342 | * If there's an owner, wait for it to either |
352 | * release the lock or go to sleep. | 343 | * release the lock or go to sleep. |
353 | */ | 344 | */ |
354 | owner = ACCESS_ONCE(lock->owner); | 345 | owner = READ_ONCE(lock->owner); |
355 | if (owner && !mutex_spin_on_owner(lock, owner)) | 346 | if (owner && !mutex_spin_on_owner(lock, owner)) |
356 | break; | 347 | break; |
357 | 348 | ||
@@ -490,7 +481,7 @@ static inline int __sched | |||
490 | __ww_mutex_lock_check_stamp(struct mutex *lock, struct ww_acquire_ctx *ctx) | 481 | __ww_mutex_lock_check_stamp(struct mutex *lock, struct ww_acquire_ctx *ctx) |
491 | { | 482 | { |
492 | struct ww_mutex *ww = container_of(lock, struct ww_mutex, base); | 483 | struct ww_mutex *ww = container_of(lock, struct ww_mutex, base); |
493 | struct ww_acquire_ctx *hold_ctx = ACCESS_ONCE(ww->ctx); | 484 | struct ww_acquire_ctx *hold_ctx = READ_ONCE(ww->ctx); |
494 | 485 | ||
495 | if (!hold_ctx) | 486 | if (!hold_ctx) |
496 | return 0; | 487 | return 0; |
diff --git a/kernel/locking/osq_lock.c b/kernel/locking/osq_lock.c index c112d00341b0..dc85ee23a26f 100644 --- a/kernel/locking/osq_lock.c +++ b/kernel/locking/osq_lock.c | |||
@@ -98,7 +98,7 @@ bool osq_lock(struct optimistic_spin_queue *lock) | |||
98 | 98 | ||
99 | prev = decode_cpu(old); | 99 | prev = decode_cpu(old); |
100 | node->prev = prev; | 100 | node->prev = prev; |
101 | ACCESS_ONCE(prev->next) = node; | 101 | WRITE_ONCE(prev->next, node); |
102 | 102 | ||
103 | /* | 103 | /* |
104 | * Normally @prev is untouchable after the above store; because at that | 104 | * Normally @prev is untouchable after the above store; because at that |
@@ -109,7 +109,7 @@ bool osq_lock(struct optimistic_spin_queue *lock) | |||
109 | * cmpxchg in an attempt to undo our queueing. | 109 | * cmpxchg in an attempt to undo our queueing. |
110 | */ | 110 | */ |
111 | 111 | ||
112 | while (!ACCESS_ONCE(node->locked)) { | 112 | while (!READ_ONCE(node->locked)) { |
113 | /* | 113 | /* |
114 | * If we need to reschedule bail... so we can block. | 114 | * If we need to reschedule bail... so we can block. |
115 | */ | 115 | */ |
@@ -148,7 +148,7 @@ unqueue: | |||
148 | * Or we race against a concurrent unqueue()'s step-B, in which | 148 | * Or we race against a concurrent unqueue()'s step-B, in which |
149 | * case its step-C will write us a new @node->prev pointer. | 149 | * case its step-C will write us a new @node->prev pointer. |
150 | */ | 150 | */ |
151 | prev = ACCESS_ONCE(node->prev); | 151 | prev = READ_ONCE(node->prev); |
152 | } | 152 | } |
153 | 153 | ||
154 | /* | 154 | /* |
@@ -170,8 +170,8 @@ unqueue: | |||
170 | * it will wait in Step-A. | 170 | * it will wait in Step-A. |
171 | */ | 171 | */ |
172 | 172 | ||
173 | ACCESS_ONCE(next->prev) = prev; | 173 | WRITE_ONCE(next->prev, prev); |
174 | ACCESS_ONCE(prev->next) = next; | 174 | WRITE_ONCE(prev->next, next); |
175 | 175 | ||
176 | return false; | 176 | return false; |
177 | } | 177 | } |
@@ -193,11 +193,11 @@ void osq_unlock(struct optimistic_spin_queue *lock) | |||
193 | node = this_cpu_ptr(&osq_node); | 193 | node = this_cpu_ptr(&osq_node); |
194 | next = xchg(&node->next, NULL); | 194 | next = xchg(&node->next, NULL); |
195 | if (next) { | 195 | if (next) { |
196 | ACCESS_ONCE(next->locked) = 1; | 196 | WRITE_ONCE(next->locked, 1); |
197 | return; | 197 | return; |
198 | } | 198 | } |
199 | 199 | ||
200 | next = osq_wait_next(lock, node, NULL); | 200 | next = osq_wait_next(lock, node, NULL); |
201 | if (next) | 201 | if (next) |
202 | ACCESS_ONCE(next->locked) = 1; | 202 | WRITE_ONCE(next->locked, 1); |
203 | } | 203 | } |
diff --git a/kernel/locking/rtmutex.c b/kernel/locking/rtmutex.c index 6357265a31ad..b73279367087 100644 --- a/kernel/locking/rtmutex.c +++ b/kernel/locking/rtmutex.c | |||
@@ -349,7 +349,7 @@ static inline struct rt_mutex *task_blocked_on_lock(struct task_struct *p) | |||
349 | * | 349 | * |
350 | * @task: the task owning the mutex (owner) for which a chain walk is | 350 | * @task: the task owning the mutex (owner) for which a chain walk is |
351 | * probably needed | 351 | * probably needed |
352 | * @deadlock_detect: do we have to carry out deadlock detection? | 352 | * @chwalk: do we have to carry out deadlock detection? |
353 | * @orig_lock: the mutex (can be NULL if we are walking the chain to recheck | 353 | * @orig_lock: the mutex (can be NULL if we are walking the chain to recheck |
354 | * things for a task that has just got its priority adjusted, and | 354 | * things for a task that has just got its priority adjusted, and |
355 | * is waiting on a mutex) | 355 | * is waiting on a mutex) |
diff --git a/kernel/locking/rwsem-spinlock.c b/kernel/locking/rwsem-spinlock.c index 2555ae15ec14..3a5048572065 100644 --- a/kernel/locking/rwsem-spinlock.c +++ b/kernel/locking/rwsem-spinlock.c | |||
@@ -85,6 +85,13 @@ __rwsem_do_wake(struct rw_semaphore *sem, int wakewrite) | |||
85 | 85 | ||
86 | list_del(&waiter->list); | 86 | list_del(&waiter->list); |
87 | tsk = waiter->task; | 87 | tsk = waiter->task; |
88 | /* | ||
89 | * Make sure we do not wakeup the next reader before | ||
90 | * setting the nil condition to grant the next reader; | ||
91 | * otherwise we could miss the wakeup on the other | ||
92 | * side and end up sleeping again. See the pairing | ||
93 | * in rwsem_down_read_failed(). | ||
94 | */ | ||
88 | smp_mb(); | 95 | smp_mb(); |
89 | waiter->task = NULL; | 96 | waiter->task = NULL; |
90 | wake_up_process(tsk); | 97 | wake_up_process(tsk); |
diff --git a/kernel/locking/rwsem-xadd.c b/kernel/locking/rwsem-xadd.c index 2f7cc4076f50..3417d0172a5d 100644 --- a/kernel/locking/rwsem-xadd.c +++ b/kernel/locking/rwsem-xadd.c | |||
@@ -14,8 +14,9 @@ | |||
14 | #include <linux/init.h> | 14 | #include <linux/init.h> |
15 | #include <linux/export.h> | 15 | #include <linux/export.h> |
16 | #include <linux/sched/rt.h> | 16 | #include <linux/sched/rt.h> |
17 | #include <linux/osq_lock.h> | ||
17 | 18 | ||
18 | #include "mcs_spinlock.h" | 19 | #include "rwsem.h" |
19 | 20 | ||
20 | /* | 21 | /* |
21 | * Guide to the rw_semaphore's count field for common values. | 22 | * Guide to the rw_semaphore's count field for common values. |
@@ -186,6 +187,13 @@ __rwsem_do_wake(struct rw_semaphore *sem, enum rwsem_wake_type wake_type) | |||
186 | waiter = list_entry(next, struct rwsem_waiter, list); | 187 | waiter = list_entry(next, struct rwsem_waiter, list); |
187 | next = waiter->list.next; | 188 | next = waiter->list.next; |
188 | tsk = waiter->task; | 189 | tsk = waiter->task; |
190 | /* | ||
191 | * Make sure we do not wakeup the next reader before | ||
192 | * setting the nil condition to grant the next reader; | ||
193 | * otherwise we could miss the wakeup on the other | ||
194 | * side and end up sleeping again. See the pairing | ||
195 | * in rwsem_down_read_failed(). | ||
196 | */ | ||
189 | smp_mb(); | 197 | smp_mb(); |
190 | waiter->task = NULL; | 198 | waiter->task = NULL; |
191 | wake_up_process(tsk); | 199 | wake_up_process(tsk); |
@@ -258,6 +266,7 @@ static inline bool rwsem_try_write_lock(long count, struct rw_semaphore *sem) | |||
258 | RWSEM_ACTIVE_WRITE_BIAS) == RWSEM_WAITING_BIAS) { | 266 | RWSEM_ACTIVE_WRITE_BIAS) == RWSEM_WAITING_BIAS) { |
259 | if (!list_is_singular(&sem->wait_list)) | 267 | if (!list_is_singular(&sem->wait_list)) |
260 | rwsem_atomic_update(RWSEM_WAITING_BIAS, sem); | 268 | rwsem_atomic_update(RWSEM_WAITING_BIAS, sem); |
269 | rwsem_set_owner(sem); | ||
261 | return true; | 270 | return true; |
262 | } | 271 | } |
263 | 272 | ||
@@ -270,15 +279,17 @@ static inline bool rwsem_try_write_lock(long count, struct rw_semaphore *sem) | |||
270 | */ | 279 | */ |
271 | static inline bool rwsem_try_write_lock_unqueued(struct rw_semaphore *sem) | 280 | static inline bool rwsem_try_write_lock_unqueued(struct rw_semaphore *sem) |
272 | { | 281 | { |
273 | long old, count = ACCESS_ONCE(sem->count); | 282 | long old, count = READ_ONCE(sem->count); |
274 | 283 | ||
275 | while (true) { | 284 | while (true) { |
276 | if (!(count == 0 || count == RWSEM_WAITING_BIAS)) | 285 | if (!(count == 0 || count == RWSEM_WAITING_BIAS)) |
277 | return false; | 286 | return false; |
278 | 287 | ||
279 | old = cmpxchg(&sem->count, count, count + RWSEM_ACTIVE_WRITE_BIAS); | 288 | old = cmpxchg(&sem->count, count, count + RWSEM_ACTIVE_WRITE_BIAS); |
280 | if (old == count) | 289 | if (old == count) { |
290 | rwsem_set_owner(sem); | ||
281 | return true; | 291 | return true; |
292 | } | ||
282 | 293 | ||
283 | count = old; | 294 | count = old; |
284 | } | 295 | } |
@@ -287,60 +298,67 @@ static inline bool rwsem_try_write_lock_unqueued(struct rw_semaphore *sem) | |||
287 | static inline bool rwsem_can_spin_on_owner(struct rw_semaphore *sem) | 298 | static inline bool rwsem_can_spin_on_owner(struct rw_semaphore *sem) |
288 | { | 299 | { |
289 | struct task_struct *owner; | 300 | struct task_struct *owner; |
290 | bool on_cpu = false; | 301 | bool ret = true; |
291 | 302 | ||
292 | if (need_resched()) | 303 | if (need_resched()) |
293 | return false; | 304 | return false; |
294 | 305 | ||
295 | rcu_read_lock(); | 306 | rcu_read_lock(); |
296 | owner = ACCESS_ONCE(sem->owner); | 307 | owner = READ_ONCE(sem->owner); |
297 | if (owner) | 308 | if (!owner) { |
298 | on_cpu = owner->on_cpu; | 309 | long count = READ_ONCE(sem->count); |
299 | rcu_read_unlock(); | 310 | /* |
300 | 311 | * If sem->owner is not set, yet we have just recently entered the | |
301 | /* | 312 | * slowpath with the lock being active, then there is a possibility |
302 | * If sem->owner is not set, yet we have just recently entered the | 313 | * reader(s) may have the lock. To be safe, bail spinning in these |
303 | * slowpath, then there is a possibility reader(s) may have the lock. | 314 | * situations. |
304 | * To be safe, avoid spinning in these situations. | 315 | */ |
305 | */ | 316 | if (count & RWSEM_ACTIVE_MASK) |
306 | return on_cpu; | 317 | ret = false; |
307 | } | 318 | goto done; |
308 | 319 | } | |
309 | static inline bool owner_running(struct rw_semaphore *sem, | ||
310 | struct task_struct *owner) | ||
311 | { | ||
312 | if (sem->owner != owner) | ||
313 | return false; | ||
314 | |||
315 | /* | ||
316 | * Ensure we emit the owner->on_cpu, dereference _after_ checking | ||
317 | * sem->owner still matches owner, if that fails, owner might | ||
318 | * point to free()d memory, if it still matches, the rcu_read_lock() | ||
319 | * ensures the memory stays valid. | ||
320 | */ | ||
321 | barrier(); | ||
322 | 320 | ||
323 | return owner->on_cpu; | 321 | ret = owner->on_cpu; |
322 | done: | ||
323 | rcu_read_unlock(); | ||
324 | return ret; | ||
324 | } | 325 | } |
325 | 326 | ||
326 | static noinline | 327 | static noinline |
327 | bool rwsem_spin_on_owner(struct rw_semaphore *sem, struct task_struct *owner) | 328 | bool rwsem_spin_on_owner(struct rw_semaphore *sem, struct task_struct *owner) |
328 | { | 329 | { |
330 | long count; | ||
331 | |||
329 | rcu_read_lock(); | 332 | rcu_read_lock(); |
330 | while (owner_running(sem, owner)) { | 333 | while (sem->owner == owner) { |
331 | if (need_resched()) | 334 | /* |
332 | break; | 335 | * Ensure we emit the owner->on_cpu, dereference _after_ |
336 | * checking sem->owner still matches owner, if that fails, | ||
337 | * owner might point to free()d memory, if it still matches, | ||
338 | * the rcu_read_lock() ensures the memory stays valid. | ||
339 | */ | ||
340 | barrier(); | ||
341 | |||
342 | /* abort spinning when need_resched or owner is not running */ | ||
343 | if (!owner->on_cpu || need_resched()) { | ||
344 | rcu_read_unlock(); | ||
345 | return false; | ||
346 | } | ||
333 | 347 | ||
334 | cpu_relax_lowlatency(); | 348 | cpu_relax_lowlatency(); |
335 | } | 349 | } |
336 | rcu_read_unlock(); | 350 | rcu_read_unlock(); |
337 | 351 | ||
352 | if (READ_ONCE(sem->owner)) | ||
353 | return true; /* new owner, continue spinning */ | ||
354 | |||
338 | /* | 355 | /* |
339 | * We break out the loop above on need_resched() or when the | 356 | * When the owner is not set, the lock could be free or |
340 | * owner changed, which is a sign for heavy contention. Return | 357 | * held by readers. Check the counter to verify the |
341 | * success only when sem->owner is NULL. | 358 | * state. |
342 | */ | 359 | */ |
343 | return sem->owner == NULL; | 360 | count = READ_ONCE(sem->count); |
361 | return (count == 0 || count == RWSEM_WAITING_BIAS); | ||
344 | } | 362 | } |
345 | 363 | ||
346 | static bool rwsem_optimistic_spin(struct rw_semaphore *sem) | 364 | static bool rwsem_optimistic_spin(struct rw_semaphore *sem) |
@@ -358,7 +376,7 @@ static bool rwsem_optimistic_spin(struct rw_semaphore *sem) | |||
358 | goto done; | 376 | goto done; |
359 | 377 | ||
360 | while (true) { | 378 | while (true) { |
361 | owner = ACCESS_ONCE(sem->owner); | 379 | owner = READ_ONCE(sem->owner); |
362 | if (owner && !rwsem_spin_on_owner(sem, owner)) | 380 | if (owner && !rwsem_spin_on_owner(sem, owner)) |
363 | break; | 381 | break; |
364 | 382 | ||
@@ -432,7 +450,7 @@ struct rw_semaphore __sched *rwsem_down_write_failed(struct rw_semaphore *sem) | |||
432 | 450 | ||
433 | /* we're now waiting on the lock, but no longer actively locking */ | 451 | /* we're now waiting on the lock, but no longer actively locking */ |
434 | if (waiting) { | 452 | if (waiting) { |
435 | count = ACCESS_ONCE(sem->count); | 453 | count = READ_ONCE(sem->count); |
436 | 454 | ||
437 | /* | 455 | /* |
438 | * If there were already threads queued before us and there are | 456 | * If there were already threads queued before us and there are |
diff --git a/kernel/locking/rwsem.c b/kernel/locking/rwsem.c index e2d3bc7f03b4..205be0ce34de 100644 --- a/kernel/locking/rwsem.c +++ b/kernel/locking/rwsem.c | |||
@@ -9,29 +9,9 @@ | |||
9 | #include <linux/sched.h> | 9 | #include <linux/sched.h> |
10 | #include <linux/export.h> | 10 | #include <linux/export.h> |
11 | #include <linux/rwsem.h> | 11 | #include <linux/rwsem.h> |
12 | |||
13 | #include <linux/atomic.h> | 12 | #include <linux/atomic.h> |
14 | 13 | ||
15 | #ifdef CONFIG_RWSEM_SPIN_ON_OWNER | 14 | #include "rwsem.h" |
16 | static inline void rwsem_set_owner(struct rw_semaphore *sem) | ||
17 | { | ||
18 | sem->owner = current; | ||
19 | } | ||
20 | |||
21 | static inline void rwsem_clear_owner(struct rw_semaphore *sem) | ||
22 | { | ||
23 | sem->owner = NULL; | ||
24 | } | ||
25 | |||
26 | #else | ||
27 | static inline void rwsem_set_owner(struct rw_semaphore *sem) | ||
28 | { | ||
29 | } | ||
30 | |||
31 | static inline void rwsem_clear_owner(struct rw_semaphore *sem) | ||
32 | { | ||
33 | } | ||
34 | #endif | ||
35 | 15 | ||
36 | /* | 16 | /* |
37 | * lock for reading | 17 | * lock for reading |
diff --git a/kernel/locking/rwsem.h b/kernel/locking/rwsem.h new file mode 100644 index 000000000000..870ed9a5b426 --- /dev/null +++ b/kernel/locking/rwsem.h | |||
@@ -0,0 +1,20 @@ | |||
1 | #ifdef CONFIG_RWSEM_SPIN_ON_OWNER | ||
2 | static inline void rwsem_set_owner(struct rw_semaphore *sem) | ||
3 | { | ||
4 | sem->owner = current; | ||
5 | } | ||
6 | |||
7 | static inline void rwsem_clear_owner(struct rw_semaphore *sem) | ||
8 | { | ||
9 | sem->owner = NULL; | ||
10 | } | ||
11 | |||
12 | #else | ||
13 | static inline void rwsem_set_owner(struct rw_semaphore *sem) | ||
14 | { | ||
15 | } | ||
16 | |||
17 | static inline void rwsem_clear_owner(struct rw_semaphore *sem) | ||
18 | { | ||
19 | } | ||
20 | #endif | ||
diff --git a/lib/lockref.c b/lib/lockref.c index ecb9a665ec19..494994bf17c8 100644 --- a/lib/lockref.c +++ b/lib/lockref.c | |||
@@ -18,7 +18,7 @@ | |||
18 | #define CMPXCHG_LOOP(CODE, SUCCESS) do { \ | 18 | #define CMPXCHG_LOOP(CODE, SUCCESS) do { \ |
19 | struct lockref old; \ | 19 | struct lockref old; \ |
20 | BUILD_BUG_ON(sizeof(old) != 8); \ | 20 | BUILD_BUG_ON(sizeof(old) != 8); \ |
21 | old.lock_count = ACCESS_ONCE(lockref->lock_count); \ | 21 | old.lock_count = READ_ONCE(lockref->lock_count); \ |
22 | while (likely(arch_spin_value_unlocked(old.lock.rlock.raw_lock))) { \ | 22 | while (likely(arch_spin_value_unlocked(old.lock.rlock.raw_lock))) { \ |
23 | struct lockref new = old, prev = old; \ | 23 | struct lockref new = old, prev = old; \ |
24 | CODE \ | 24 | CODE \ |