2005-04-17 05:20:36 +07:00
|
|
|
/*
|
2008-08-02 16:55:55 +07:00
|
|
|
* arch/arm/include/asm/mmu_context.h
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
|
|
|
* Copyright (C) 1996 Russell King.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* Changelog:
|
|
|
|
* 27-06-1996 RMK Created
|
|
|
|
*/
|
|
|
|
#ifndef __ASM_ARM_MMU_CONTEXT_H
|
|
|
|
#define __ASM_ARM_MMU_CONTEXT_H
|
|
|
|
|
2005-11-17 00:23:57 +07:00
|
|
|
#include <linux/compiler.h>
|
2008-11-30 00:35:51 +07:00
|
|
|
#include <linux/sched.h>
|
2005-11-07 02:47:04 +07:00
|
|
|
#include <asm/cacheflush.h>
|
2008-08-11 00:10:19 +07:00
|
|
|
#include <asm/cachetype.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <asm/proc-fns.h>
|
|
|
|
|
2006-06-30 02:17:15 +07:00
|
|
|
void __check_kvm_seq(struct mm_struct *mm);
|
|
|
|
|
2007-05-17 16:19:23 +07:00
|
|
|
#ifdef CONFIG_CPU_HAS_ASID
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* On ARMv6, we have the following structure in the Context ID:
|
|
|
|
*
|
|
|
|
* 31 7 0
|
|
|
|
* +-------------------------+-----------+
|
|
|
|
* | process ID | ASID |
|
|
|
|
* +-------------------------+-----------+
|
|
|
|
* | context ID |
|
|
|
|
* +-------------------------------------+
|
|
|
|
*
|
|
|
|
* The ASID is used to tag entries in the CPU caches and TLBs.
|
|
|
|
* The context ID is used by debuggers and trace logic, and
|
|
|
|
* should be unique within all running processes.
|
|
|
|
*/
|
2007-05-09 02:03:09 +07:00
|
|
|
#define ASID_BITS 8
|
|
|
|
#define ASID_MASK ((~0) << ASID_BITS)
|
|
|
|
#define ASID_FIRST_VERSION (1 << ASID_BITS)
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
extern unsigned int cpu_last_asid;
|
2010-01-27 01:09:42 +07:00
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
DECLARE_PER_CPU(struct mm_struct *, current_mm);
|
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
void __init_new_context(struct task_struct *tsk, struct mm_struct *mm);
|
|
|
|
void __new_context(struct mm_struct *mm);
|
|
|
|
|
|
|
|
static inline void check_context(struct mm_struct *mm)
|
|
|
|
{
|
2010-01-27 01:09:42 +07:00
|
|
|
/*
|
|
|
|
* This code is executed with interrupts enabled. Therefore,
|
|
|
|
* mm->context.id cannot be updated to the latest ASID version
|
|
|
|
* on a different CPU (and condition below not triggered)
|
|
|
|
* without first getting an IPI to reset the context. The
|
|
|
|
* alternative is to take a read_lock on mm->context.id_lock
|
|
|
|
* (after changing its type to rwlock_t).
|
|
|
|
*/
|
2005-04-17 05:20:36 +07:00
|
|
|
if (unlikely((mm->context.id ^ cpu_last_asid) >> ASID_BITS))
|
|
|
|
__new_context(mm);
|
2006-06-30 02:17:15 +07:00
|
|
|
|
|
|
|
if (unlikely(mm->context.kvm_seq != init_mm.context.kvm_seq))
|
|
|
|
__check_kvm_seq(mm);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
#define init_new_context(tsk,mm) (__init_new_context(tsk,mm),0)
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
2006-06-30 02:17:15 +07:00
|
|
|
static inline void check_context(struct mm_struct *mm)
|
|
|
|
{
|
2009-07-24 18:34:56 +07:00
|
|
|
#ifdef CONFIG_MMU
|
2006-06-30 02:17:15 +07:00
|
|
|
if (unlikely(mm->context.kvm_seq != init_mm.context.kvm_seq))
|
|
|
|
__check_kvm_seq(mm);
|
2009-07-24 18:34:56 +07:00
|
|
|
#endif
|
2006-06-30 02:17:15 +07:00
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
#define init_new_context(tsk,mm) 0
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define destroy_context(mm) do { } while(0)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is called when "tsk" is about to enter lazy TLB mode.
|
|
|
|
*
|
|
|
|
* mm: describes the currently active mm context
|
|
|
|
* tsk: task which is entering lazy tlb
|
|
|
|
* cpu: cpu number which is entering lazy tlb
|
|
|
|
*
|
|
|
|
* tsk->mm will be NULL
|
|
|
|
*/
|
|
|
|
static inline void
|
|
|
|
enter_lazy_tlb(struct mm_struct *mm, struct task_struct *tsk)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is the actual mm switch as far as the scheduler
|
|
|
|
* is concerned. No registers are touched. We avoid
|
|
|
|
* calling the CPU specific function when the mm hasn't
|
|
|
|
* actually changed.
|
|
|
|
*/
|
|
|
|
static inline void
|
|
|
|
switch_mm(struct mm_struct *prev, struct mm_struct *next,
|
|
|
|
struct task_struct *tsk)
|
|
|
|
{
|
2006-06-21 02:46:52 +07:00
|
|
|
#ifdef CONFIG_MMU
|
2005-04-17 05:20:36 +07:00
|
|
|
unsigned int cpu = smp_processor_id();
|
|
|
|
|
2008-06-13 16:28:36 +07:00
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
/* check for possible thread migration */
|
2009-09-24 22:34:49 +07:00
|
|
|
if (!cpumask_empty(mm_cpumask(next)) &&
|
|
|
|
!cpumask_test_cpu(cpu, mm_cpumask(next)))
|
2008-06-13 16:28:36 +07:00
|
|
|
__flush_icache_all();
|
|
|
|
#endif
|
2009-09-24 22:34:49 +07:00
|
|
|
if (!cpumask_test_and_set_cpu(cpu, mm_cpumask(next)) || prev != next) {
|
2010-01-27 01:09:42 +07:00
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
struct mm_struct **crt_mm = &per_cpu(current_mm, cpu);
|
|
|
|
*crt_mm = next;
|
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
check_context(next);
|
|
|
|
cpu_switch_mm(next->pgd, next);
|
2005-11-04 03:32:45 +07:00
|
|
|
if (cache_is_vivt())
|
2009-09-24 22:34:49 +07:00
|
|
|
cpumask_clear_cpu(cpu, mm_cpumask(prev));
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
2006-06-21 02:46:52 +07:00
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
#define deactivate_mm(tsk,mm) do { } while (0)
|
|
|
|
#define activate_mm(prev,next) switch_mm(prev, next, NULL)
|
|
|
|
|
2010-08-27 10:10:50 +07:00
|
|
|
/*
|
|
|
|
* We are inserting a "fake" vma for the user-accessible vector page so
|
|
|
|
* gdb and friends can get to it through ptrace and /proc/<pid>/mem.
|
|
|
|
* But we also want to remove it before the generic code gets to see it
|
|
|
|
* during process exit or the unmapping of it would cause total havoc.
|
|
|
|
* (the macro is used as remove_vma() is static to mm/mmap.c)
|
|
|
|
*/
|
|
|
|
#define arch_exit_mmap(mm) \
|
|
|
|
do { \
|
|
|
|
struct vm_area_struct *high_vma = find_vma(mm, 0xffff0000); \
|
|
|
|
if (high_vma) { \
|
|
|
|
BUG_ON(high_vma->vm_next); /* it should be last */ \
|
|
|
|
if (high_vma->vm_prev) \
|
|
|
|
high_vma->vm_prev->vm_next = NULL; \
|
|
|
|
else \
|
|
|
|
mm->mmap = NULL; \
|
|
|
|
rb_erase(&high_vma->vm_rb, &mm->mm_rb); \
|
|
|
|
mm->mmap_cache = NULL; \
|
|
|
|
mm->map_count--; \
|
|
|
|
remove_vma(high_vma); \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
static inline void arch_dup_mmap(struct mm_struct *oldmm,
|
|
|
|
struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif
|