5 * (C) 2007 Pavel Emelyanov <xemul@openvz.org>, OpenVZ, SWsoft Inc.
6 * (C) 2007 Sukadev Bhattiprolu <sukadev@us.ibm.com>, IBM
7 * Many thanks to Oleg Nesterov for comments and help
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 #include <linux/slab.h>
17 #include <linux/proc_fs.h>
18 #include <linux/reboot.h>
20 #define BITS_PER_PAGE (PAGE_SIZE*8)
25 struct kmem_cache *cachep;
26 struct list_head list;
29 static LIST_HEAD(pid_caches_lh);
30 static DEFINE_MUTEX(pid_caches_mutex);
31 static struct kmem_cache *pid_ns_cachep;
34 * creates the kmem cache to allocate pids from.
35 * @nr_ids: the number of numerical ids this pid will have to carry
38 static struct kmem_cache *create_pid_cachep(int nr_ids)
40 struct pid_cache *pcache;
41 struct kmem_cache *cachep;
43 mutex_lock(&pid_caches_mutex);
44 list_for_each_entry(pcache, &pid_caches_lh, list)
45 if (pcache->nr_ids == nr_ids)
48 pcache = kmalloc(sizeof(struct pid_cache), GFP_KERNEL);
52 snprintf(pcache->name, sizeof(pcache->name), "pid_%d", nr_ids);
53 cachep = kmem_cache_create(pcache->name,
54 sizeof(struct pid) + (nr_ids - 1) * sizeof(struct upid),
55 0, SLAB_HWCACHE_ALIGN, NULL);
59 pcache->nr_ids = nr_ids;
60 pcache->cachep = cachep;
61 list_add(&pcache->list, &pid_caches_lh);
63 mutex_unlock(&pid_caches_mutex);
64 return pcache->cachep;
69 mutex_unlock(&pid_caches_mutex);
73 static struct pid_namespace *create_pid_namespace(struct pid_namespace *parent_pid_ns)
75 struct pid_namespace *ns;
76 unsigned int level = parent_pid_ns->level + 1;
79 ns = kmem_cache_zalloc(pid_ns_cachep, GFP_KERNEL);
83 ns->pidmap[0].page = kzalloc(PAGE_SIZE, GFP_KERNEL);
84 if (!ns->pidmap[0].page)
87 ns->pid_cachep = create_pid_cachep(level + 1);
88 if (ns->pid_cachep == NULL)
93 ns->parent = get_pid_ns(parent_pid_ns);
95 set_bit(0, ns->pidmap[0].page);
96 atomic_set(&ns->pidmap[0].nr_free, BITS_PER_PAGE - 1);
98 for (i = 1; i < PIDMAP_ENTRIES; i++)
99 atomic_set(&ns->pidmap[i].nr_free, BITS_PER_PAGE);
101 err = pid_ns_prepare_proc(ns);
103 goto out_put_parent_pid_ns;
105 #ifdef CONFIG_SECURITY_YAMA
106 ns->ptrace_scope = parent_pid_ns->ptrace_scope;
107 ns->protected_sticky_symlinks =
108 parent_pid_ns->protected_sticky_symlinks;
109 ns->protected_nonaccess_hardlinks =
110 parent_pid_ns->protected_nonaccess_hardlinks;
115 out_put_parent_pid_ns:
116 put_pid_ns(parent_pid_ns);
118 kfree(ns->pidmap[0].page);
120 kmem_cache_free(pid_ns_cachep, ns);
125 static void destroy_pid_namespace(struct pid_namespace *ns)
129 for (i = 0; i < PIDMAP_ENTRIES; i++)
130 kfree(ns->pidmap[i].page);
131 kmem_cache_free(pid_ns_cachep, ns);
134 struct pid_namespace *copy_pid_ns(unsigned long flags, struct pid_namespace *old_ns)
136 if (!(flags & CLONE_NEWPID))
137 return get_pid_ns(old_ns);
138 if (flags & (CLONE_THREAD|CLONE_PARENT))
139 return ERR_PTR(-EINVAL);
140 return create_pid_namespace(old_ns);
143 void free_pid_ns(struct kref *kref)
145 struct pid_namespace *ns, *parent;
147 ns = container_of(kref, struct pid_namespace, kref);
150 destroy_pid_namespace(ns);
156 void zap_pid_ns_processes(struct pid_namespace *pid_ns)
160 struct task_struct *task;
163 * The last thread in the cgroup-init thread group is terminating.
164 * Find remaining pid_ts in the namespace, signal and wait for them
167 * Note: This signals each threads in the namespace - even those that
168 * belong to the same thread group, To avoid this, we would have
169 * to walk the entire tasklist looking a processes in this
170 * namespace, but that could be unnecessarily expensive if the
171 * pid namespace has just a few processes. Or we need to
172 * maintain a tasklist for each pid namespace.
175 read_lock(&tasklist_lock);
176 nr = next_pidmap(pid_ns, 1);
180 task = pid_task(find_vpid(nr), PIDTYPE_PID);
181 if (task && !__fatal_signal_pending(task))
182 send_sig_info(SIGKILL, SEND_SIG_FORCED, task);
186 nr = next_pidmap(pid_ns, nr);
188 read_unlock(&tasklist_lock);
191 clear_thread_flag(TIF_SIGPENDING);
192 rc = sys_wait4(-1, NULL, __WALL, NULL);
193 } while (rc != -ECHILD);
196 current->signal->group_exit_code = pid_ns->reboot;
198 acct_exit_ns(pid_ns);
202 static int pid_ns_ctl_handler(struct ctl_table *table, int write,
203 void __user *buffer, size_t *lenp, loff_t *ppos)
205 struct ctl_table tmp = *table;
207 if (write && !capable(CAP_SYS_ADMIN))
211 * Writing directly to ns' last_pid field is OK, since this field
212 * is volatile in a living namespace anyway and a code writing to
213 * it should synchronize its usage with external means.
216 tmp.data = ¤t->nsproxy->pid_ns->last_pid;
217 return proc_dointvec(&tmp, write, buffer, lenp, ppos);
220 static struct ctl_table pid_ns_ctl_table[] = {
222 .procname = "ns_last_pid",
223 .maxlen = sizeof(int),
224 .mode = 0666, /* permissions are checked in the handler */
225 .proc_handler = pid_ns_ctl_handler,
230 static struct ctl_path kern_path[] = { { .procname = "kernel", }, { } };
232 int reboot_pid_ns(struct pid_namespace *pid_ns, int cmd)
234 if (pid_ns == &init_pid_ns)
238 case LINUX_REBOOT_CMD_RESTART2:
239 case LINUX_REBOOT_CMD_RESTART:
240 pid_ns->reboot = SIGHUP;
243 case LINUX_REBOOT_CMD_POWER_OFF:
244 case LINUX_REBOOT_CMD_HALT:
245 pid_ns->reboot = SIGINT;
251 read_lock(&tasklist_lock);
252 force_sig(SIGKILL, pid_ns->child_reaper);
253 read_unlock(&tasklist_lock);
261 static __init int pid_namespaces_init(void)
263 pid_ns_cachep = KMEM_CACHE(pid_namespace, SLAB_PANIC);
264 register_sysctl_paths(kern_path, pid_ns_ctl_table);
268 __initcall(pid_namespaces_init);