2005-09-26 02:04:21 -04:00
|
|
|
/*
|
|
|
|
* MMU context allocation for 64-bit kernels.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2004 Anton Blanchard, IBM Corp. <anton@samba.org>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/idr.h>
|
2009-11-02 07:02:30 -05:00
|
|
|
#include <linux/module.h>
|
2005-09-26 02:04:21 -04:00
|
|
|
|
|
|
|
#include <asm/mmu_context.h>
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(mmu_context_lock);
|
2010-02-07 07:30:12 -05:00
|
|
|
static DEFINE_IDA(mmu_context_ida);
|
2005-09-26 02:04:21 -04:00
|
|
|
|
2008-12-18 14:13:24 -05:00
|
|
|
/*
|
|
|
|
* The proto-VSID space has 2^35 - 1 segments available for user mappings.
|
|
|
|
* Each segment contains 2^28 bytes. Each context maps 2^44 bytes,
|
|
|
|
* so we can support 2^19-1 contexts (19 == 35 + 28 - 44).
|
|
|
|
*/
|
|
|
|
#define NO_CONTEXT 0
|
|
|
|
#define MAX_CONTEXT ((1UL << 19) - 1)
|
|
|
|
|
2009-11-02 07:02:30 -05:00
|
|
|
int __init_new_context(void)
|
2005-09-26 02:04:21 -04:00
|
|
|
{
|
|
|
|
int index;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
again:
|
2010-02-07 07:30:12 -05:00
|
|
|
if (!ida_pre_get(&mmu_context_ida, GFP_KERNEL))
|
2005-09-26 02:04:21 -04:00
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
spin_lock(&mmu_context_lock);
|
2010-02-07 07:30:12 -05:00
|
|
|
err = ida_get_new_above(&mmu_context_ida, 1, &index);
|
2005-09-26 02:04:21 -04:00
|
|
|
spin_unlock(&mmu_context_lock);
|
|
|
|
|
|
|
|
if (err == -EAGAIN)
|
|
|
|
goto again;
|
|
|
|
else if (err)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
if (index > MAX_CONTEXT) {
|
2006-06-27 08:46:09 -04:00
|
|
|
spin_lock(&mmu_context_lock);
|
2010-02-07 07:30:12 -05:00
|
|
|
ida_remove(&mmu_context_ida, index);
|
2006-06-27 08:46:09 -04:00
|
|
|
spin_unlock(&mmu_context_lock);
|
2005-09-26 02:04:21 -04:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2009-11-02 07:02:30 -05:00
|
|
|
return index;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(__init_new_context);
|
|
|
|
|
|
|
|
int init_new_context(struct task_struct *tsk, struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
int index;
|
|
|
|
|
|
|
|
index = __init_new_context();
|
|
|
|
if (index < 0)
|
|
|
|
return index;
|
|
|
|
|
2007-05-08 02:27:27 -04:00
|
|
|
/* The old code would re-promote on fork, we don't do that
|
|
|
|
* when using slices as it could cause problem promoting slices
|
|
|
|
* that have been forced down to 4K
|
|
|
|
*/
|
2007-08-15 02:51:18 -04:00
|
|
|
if (slice_mm_new_context(mm))
|
2007-05-08 02:27:27 -04:00
|
|
|
slice_set_user_psize(mm, mmu_virtual_psize);
|
2009-11-26 13:56:04 -05:00
|
|
|
subpage_prot_init_new_context(mm);
|
2007-08-15 02:33:55 -04:00
|
|
|
mm->context.id = index;
|
2005-09-26 02:04:21 -04:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-11-02 07:02:30 -05:00
|
|
|
void __destroy_context(int context_id)
|
2005-09-26 02:04:21 -04:00
|
|
|
{
|
|
|
|
spin_lock(&mmu_context_lock);
|
2010-02-07 07:30:12 -05:00
|
|
|
ida_remove(&mmu_context_ida, context_id);
|
2005-09-26 02:04:21 -04:00
|
|
|
spin_unlock(&mmu_context_lock);
|
2009-11-02 07:02:30 -05:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(__destroy_context);
|
2005-09-26 02:04:21 -04:00
|
|
|
|
2009-11-02 07:02:30 -05:00
|
|
|
void destroy_context(struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
__destroy_context(mm->context.id);
|
2009-11-26 13:56:04 -05:00
|
|
|
subpage_prot_free(mm);
|
2005-09-26 02:04:21 -04:00
|
|
|
mm->context.id = NO_CONTEXT;
|
|
|
|
}
|