1
2
3
4
5
6
7
8
9
10
11#include <linux/pid.h>
12#include <linux/pid_namespace.h>
13#include <linux/syscalls.h>
14#include <linux/err.h>
15#include <linux/acct.h>
16
17#define BITS_PER_PAGE (PAGE_SIZE*8)
18
19struct pid_cache {
20 int nr_ids;
21 char name[16];
22 struct kmem_cache *cachep;
23 struct list_head list;
24};
25
26static LIST_HEAD(pid_caches_lh);
27static DEFINE_MUTEX(pid_caches_mutex);
28static struct kmem_cache *pid_ns_cachep;
29
30
31
32
33
34
35static struct kmem_cache *create_pid_cachep(int nr_ids)
36{
37 struct pid_cache *pcache;
38 struct kmem_cache *cachep;
39
40 mutex_lock(&pid_caches_mutex);
41 list_for_each_entry(pcache, &pid_caches_lh, list)
42 if (pcache->nr_ids == nr_ids)
43 goto out;
44
45 pcache = kmalloc(sizeof(struct pid_cache), GFP_KERNEL);
46 if (pcache == NULL)
47 goto err_alloc;
48
49 snprintf(pcache->name, sizeof(pcache->name), "pid_%d", nr_ids);
50 cachep = kmem_cache_create(pcache->name,
51 sizeof(struct pid) + (nr_ids - 1) * sizeof(struct upid),
52 0, SLAB_HWCACHE_ALIGN, NULL);
53 if (cachep == NULL)
54 goto err_cachep;
55
56 pcache->nr_ids = nr_ids;
57 pcache->cachep = cachep;
58 list_add(&pcache->list, &pid_caches_lh);
59out:
60 mutex_unlock(&pid_caches_mutex);
61 return pcache->cachep;
62
63err_cachep:
64 kfree(pcache);
65err_alloc:
66 mutex_unlock(&pid_caches_mutex);
67 return NULL;
68}
69
70static struct pid_namespace *create_pid_namespace(struct pid_namespace *parent_pid_ns)
71{
72 struct pid_namespace *ns;
73 unsigned int level = parent_pid_ns->level + 1;
74 int i;
75
76 ns = kmem_cache_zalloc(pid_ns_cachep, GFP_KERNEL);
77 if (ns == NULL)
78 goto out;
79
80 ns->pidmap[0].page = kzalloc(PAGE_SIZE, GFP_KERNEL);
81 if (!ns->pidmap[0].page)
82 goto out_free;
83
84 ns->pid_cachep = create_pid_cachep(level + 1);
85 if (ns->pid_cachep == NULL)
86 goto out_free_map;
87
88 kref_init(&ns->kref);
89 ns->level = level;
90 ns->parent = get_pid_ns(parent_pid_ns);
91
92 set_bit(0, ns->pidmap[0].page);
93 atomic_set(&ns->pidmap[0].nr_free, BITS_PER_PAGE - 1);
94
95 for (i = 1; i < PIDMAP_ENTRIES; i++)
96 atomic_set(&ns->pidmap[i].nr_free, BITS_PER_PAGE);
97
98 return ns;
99
100out_free_map:
101 kfree(ns->pidmap[0].page);
102out_free:
103 kmem_cache_free(pid_ns_cachep, ns);
104out:
105 return ERR_PTR(-ENOMEM);
106}
107
108static void destroy_pid_namespace(struct pid_namespace *ns)
109{
110 int i;
111
112 for (i = 0; i < PIDMAP_ENTRIES; i++)
113 kfree(ns->pidmap[i].page);
114 kmem_cache_free(pid_ns_cachep, ns);
115}
116
117struct pid_namespace *copy_pid_ns(unsigned long flags, struct pid_namespace *old_ns)
118{
119 if (!(flags & CLONE_NEWPID))
120 return get_pid_ns(old_ns);
121 if (flags & (CLONE_THREAD|CLONE_PARENT))
122 return ERR_PTR(-EINVAL);
123 return create_pid_namespace(old_ns);
124}
125
126void free_pid_ns(struct kref *kref)
127{
128 struct pid_namespace *ns, *parent;
129
130 ns = container_of(kref, struct pid_namespace, kref);
131
132 parent = ns->parent;
133 destroy_pid_namespace(ns);
134
135 if (parent != NULL)
136 put_pid_ns(parent);
137}
138
139void zap_pid_ns_processes(struct pid_namespace *pid_ns)
140{
141 int nr;
142 int rc;
143 struct task_struct *task;
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158 read_lock(&tasklist_lock);
159 nr = next_pidmap(pid_ns, 1);
160 while (nr > 0) {
161 rcu_read_lock();
162
163
164
165
166
167
168 task = pid_task(find_vpid(nr), PIDTYPE_PID);
169 if (task)
170 force_sig(SIGKILL, task);
171
172 rcu_read_unlock();
173
174 nr = next_pidmap(pid_ns, nr);
175 }
176 read_unlock(&tasklist_lock);
177
178 do {
179 clear_thread_flag(TIF_SIGPENDING);
180 rc = sys_wait4(-1, NULL, __WALL, NULL);
181 } while (rc != -ECHILD);
182
183 acct_exit_ns(pid_ns);
184 return;
185}
186
187static __init int pid_namespaces_init(void)
188{
189 pid_ns_cachep = KMEM_CACHE(pid_namespace, SLAB_PANIC);
190 return 0;
191}
192
193__initcall(pid_namespaces_init);
194