提交 baf8f0f8 编写于 作者: P Pavel Emelianov 提交者: Linus Torvalds

pid namespaces: dynamic kmem cache allocator for pid namespaces

Add kmem_cache to pid_namespace to allocate pids from.

Since both implementations expand the struct pid to carry more numerical
values each namespace should have separate cache to store pids of different
sizes.

Each kmem cache is name "pid_<NR>", where <NR> is the number of numerical ids
on the pid.  Different namespaces with same level of nesting will have same
caches.

This patch has two FIXMEs that are to be fixed after we reach the consensus
about the struct pid itself.

The first one is that the namespace to free the pid from in free_pid() must be
taken from pid.  Now the init_pid_ns is used.

The second FIXME is about the cache allocation.  When we do know how long the
object will be then we'll have to calculate this size in create_pid_cachep.
Right now the sizeof(struct pid) value is used.

[akpm@linux-foundation.org: coding-style repair]
Signed-off-by: NPavel Emelianov <xemul@openvz.org>
Acked-by: NCedric Le Goater <clg@fr.ibm.com>
Acked-by: NSukadev Bhattiprolu <sukadev@us.ibm.com>
Cc: Kirill Korotaev <dev@openvz.org>
Cc: "Eric W. Biederman" <ebiederm@xmission.com>
Cc: Herbert Poetzl <herbert@13thfloor.at>
Signed-off-by: NAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: NLinus Torvalds <torvalds@linux-foundation.org>
上级 a05f7b15
...@@ -20,6 +20,7 @@ struct pid_namespace { ...@@ -20,6 +20,7 @@ struct pid_namespace {
struct pidmap pidmap[PIDMAP_ENTRIES]; struct pidmap pidmap[PIDMAP_ENTRIES];
int last_pid; int last_pid;
struct task_struct *child_reaper; struct task_struct *child_reaper;
struct kmem_cache *pid_cachep;
}; };
extern struct pid_namespace init_pid_ns; extern struct pid_namespace init_pid_ns;
......
...@@ -32,7 +32,6 @@ ...@@ -32,7 +32,6 @@
#define pid_hashfn(nr) hash_long((unsigned long)nr, pidhash_shift) #define pid_hashfn(nr) hash_long((unsigned long)nr, pidhash_shift)
static struct hlist_head *pid_hash; static struct hlist_head *pid_hash;
static int pidhash_shift; static int pidhash_shift;
static struct kmem_cache *pid_cachep;
struct pid init_struct_pid = INIT_STRUCT_PID; struct pid init_struct_pid = INIT_STRUCT_PID;
int pid_max = PID_MAX_DEFAULT; int pid_max = PID_MAX_DEFAULT;
...@@ -176,11 +175,16 @@ static int next_pidmap(struct pid_namespace *pid_ns, int last) ...@@ -176,11 +175,16 @@ static int next_pidmap(struct pid_namespace *pid_ns, int last)
fastcall void put_pid(struct pid *pid) fastcall void put_pid(struct pid *pid)
{ {
struct pid_namespace *ns;
if (!pid) if (!pid)
return; return;
/* FIXME - this must be the namespace this pid lives in */
ns = &init_pid_ns;
if ((atomic_read(&pid->count) == 1) || if ((atomic_read(&pid->count) == 1) ||
atomic_dec_and_test(&pid->count)) atomic_dec_and_test(&pid->count))
kmem_cache_free(pid_cachep, pid); kmem_cache_free(ns->pid_cachep, pid);
} }
EXPORT_SYMBOL_GPL(put_pid); EXPORT_SYMBOL_GPL(put_pid);
...@@ -208,12 +212,14 @@ struct pid *alloc_pid(void) ...@@ -208,12 +212,14 @@ struct pid *alloc_pid(void)
struct pid *pid; struct pid *pid;
enum pid_type type; enum pid_type type;
int nr = -1; int nr = -1;
struct pid_namespace *ns;
pid = kmem_cache_alloc(pid_cachep, GFP_KERNEL); ns = current->nsproxy->pid_ns;
pid = kmem_cache_alloc(ns->pid_cachep, GFP_KERNEL);
if (!pid) if (!pid)
goto out; goto out;
nr = alloc_pidmap(current->nsproxy->pid_ns); nr = alloc_pidmap(ns);
if (nr < 0) if (nr < 0)
goto out_free; goto out_free;
...@@ -230,7 +236,7 @@ struct pid *alloc_pid(void) ...@@ -230,7 +236,7 @@ struct pid *alloc_pid(void)
return pid; return pid;
out_free: out_free:
kmem_cache_free(pid_cachep, pid); kmem_cache_free(ns->pid_cachep, pid);
pid = NULL; pid = NULL;
goto out; goto out;
} }
...@@ -365,6 +371,56 @@ struct pid *find_ge_pid(int nr) ...@@ -365,6 +371,56 @@ struct pid *find_ge_pid(int nr)
} }
EXPORT_SYMBOL_GPL(find_get_pid); EXPORT_SYMBOL_GPL(find_get_pid);
struct pid_cache {
int nr_ids;
char name[16];
struct kmem_cache *cachep;
struct list_head list;
};
static LIST_HEAD(pid_caches_lh);
static DEFINE_MUTEX(pid_caches_mutex);
/*
* creates the kmem cache to allocate pids from.
* @nr_ids: the number of numerical ids this pid will have to carry
*/
static struct kmem_cache *create_pid_cachep(int nr_ids)
{
struct pid_cache *pcache;
struct kmem_cache *cachep;
mutex_lock(&pid_caches_mutex);
list_for_each_entry (pcache, &pid_caches_lh, list)
if (pcache->nr_ids == nr_ids)
goto out;
pcache = kmalloc(sizeof(struct pid_cache), GFP_KERNEL);
if (pcache == NULL)
goto err_alloc;
snprintf(pcache->name, sizeof(pcache->name), "pid_%d", nr_ids);
cachep = kmem_cache_create(pcache->name,
/* FIXME add numerical ids here */
sizeof(struct pid), 0, SLAB_HWCACHE_ALIGN, NULL);
if (cachep == NULL)
goto err_cachep;
pcache->nr_ids = nr_ids;
pcache->cachep = cachep;
list_add(&pcache->list, &pid_caches_lh);
out:
mutex_unlock(&pid_caches_mutex);
return pcache->cachep;
err_cachep:
kfree(pcache);
err_alloc:
mutex_unlock(&pid_caches_mutex);
return NULL;
}
struct pid_namespace *copy_pid_ns(unsigned long flags, struct pid_namespace *old_ns) struct pid_namespace *copy_pid_ns(unsigned long flags, struct pid_namespace *old_ns)
{ {
BUG_ON(!old_ns); BUG_ON(!old_ns);
...@@ -412,5 +468,7 @@ void __init pidmap_init(void) ...@@ -412,5 +468,7 @@ void __init pidmap_init(void)
set_bit(0, init_pid_ns.pidmap[0].page); set_bit(0, init_pid_ns.pidmap[0].page);
atomic_dec(&init_pid_ns.pidmap[0].nr_free); atomic_dec(&init_pid_ns.pidmap[0].nr_free);
pid_cachep = KMEM_CACHE(pid, SLAB_PANIC); init_pid_ns.pid_cachep = create_pid_cachep(1);
if (init_pid_ns.pid_cachep == NULL)
panic("Can't create pid_1 cachep\n");
} }
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册