Commit 4eaffdd5 authored by Andy Lutomirski's avatar Andy Lutomirski Committed by Ingo Molnar

x86/mm: Improve switch_mm() barrier comments

My previous comments were still a bit confusing and there was a
typo. Fix it up.
Reported-by: default avatarPeter Zijlstra <peterz@infradead.org>
Signed-off-by: default avatarAndy Lutomirski <luto@kernel.org>
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Borislav Petkov <bp@alien8.de>
Cc: Brian Gerst <brgerst@gmail.com>
Cc: Dave Hansen <dave.hansen@linux.intel.com>
Cc: Denys Vlasenko <dvlasenk@redhat.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: stable@vger.kernel.org
Fixes: 71b3c126 ("x86/mm: Add barriers and document switch_mm()-vs-flush synchronization")
Link: http://lkml.kernel.org/r/0a0b43cdcdd241c5faaaecfbcc91a155ddedc9a1.1452631609.git.luto@kernel.orgSigned-off-by: default avatarIngo Molnar <mingo@kernel.org>
parent 65cacec1
...@@ -132,14 +132,16 @@ static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, ...@@ -132,14 +132,16 @@ static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next,
* be sent, and CPU 0's TLB will contain a stale entry.) * be sent, and CPU 0's TLB will contain a stale entry.)
* *
* The bad outcome can occur if either CPU's load is * The bad outcome can occur if either CPU's load is
* reordered before that CPU's store, so both CPUs much * reordered before that CPU's store, so both CPUs must
* execute full barriers to prevent this from happening. * execute full barriers to prevent this from happening.
* *
* Thus, switch_mm needs a full barrier between the * Thus, switch_mm needs a full barrier between the
* store to mm_cpumask and any operation that could load * store to mm_cpumask and any operation that could load
* from next->pgd. This barrier synchronizes with * from next->pgd. TLB fills are special and can happen
* remote TLB flushers. Fortunately, load_cr3 is * due to instruction fetches or for no reason at all,
* serializing and thus acts as a full barrier. * and neither LOCK nor MFENCE orders them.
* Fortunately, load_cr3() is serializing and gives the
* ordering guarantee we need.
* *
*/ */
load_cr3(next->pgd); load_cr3(next->pgd);
...@@ -188,9 +190,8 @@ static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, ...@@ -188,9 +190,8 @@ static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next,
* tlb flush IPI delivery. We must reload CR3 * tlb flush IPI delivery. We must reload CR3
* to make sure to use no freed page tables. * to make sure to use no freed page tables.
* *
* As above, this is a barrier that forces * As above, load_cr3() is serializing and orders TLB
* TLB repopulation to be ordered after the * fills with respect to the mm_cpumask write.
* store to mm_cpumask.
*/ */
load_cr3(next->pgd); load_cr3(next->pgd);
trace_tlb_flush(TLB_FLUSH_ON_TASK_SWITCH, TLB_FLUSH_ALL); trace_tlb_flush(TLB_FLUSH_ON_TASK_SWITCH, TLB_FLUSH_ALL);
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment