pid_namespace.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379
  1. /*
  2. * Pid namespaces
  3. *
  4. * Authors:
  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
  8. *
  9. */
  10. #include <linux/pid.h>
  11. #include <linux/pid_namespace.h>
  12. #include <linux/user_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>
  19. #include <linux/export.h>
  20. #define BITS_PER_PAGE (PAGE_SIZE*8)
  21. struct pid_cache {
  22. int nr_ids;
  23. char name[16];
  24. struct kmem_cache *cachep;
  25. struct list_head list;
  26. };
  27. static LIST_HEAD(pid_caches_lh);
  28. static DEFINE_MUTEX(pid_caches_mutex);
  29. static struct kmem_cache *pid_ns_cachep;
  30. /*
  31. * creates the kmem cache to allocate pids from.
  32. * @nr_ids: the number of numerical ids this pid will have to carry
  33. */
  34. static struct kmem_cache *create_pid_cachep(int nr_ids)
  35. {
  36. struct pid_cache *pcache;
  37. struct kmem_cache *cachep;
  38. mutex_lock(&pid_caches_mutex);
  39. list_for_each_entry(pcache, &pid_caches_lh, list)
  40. if (pcache->nr_ids == nr_ids)
  41. goto out;
  42. pcache = kmalloc(sizeof(struct pid_cache), GFP_KERNEL);
  43. if (pcache == NULL)
  44. goto err_alloc;
  45. snprintf(pcache->name, sizeof(pcache->name), "pid_%d", nr_ids);
  46. cachep = kmem_cache_create(pcache->name,
  47. sizeof(struct pid) + (nr_ids - 1) * sizeof(struct upid),
  48. 0, SLAB_HWCACHE_ALIGN, NULL);
  49. if (cachep == NULL)
  50. goto err_cachep;
  51. pcache->nr_ids = nr_ids;
  52. pcache->cachep = cachep;
  53. list_add(&pcache->list, &pid_caches_lh);
  54. out:
  55. mutex_unlock(&pid_caches_mutex);
  56. return pcache->cachep;
  57. err_cachep:
  58. kfree(pcache);
  59. err_alloc:
  60. mutex_unlock(&pid_caches_mutex);
  61. return NULL;
  62. }
  63. static void proc_cleanup_work(struct work_struct *work)
  64. {
  65. struct pid_namespace *ns = container_of(work, struct pid_namespace, proc_work);
  66. pid_ns_release_proc(ns);
  67. }
  68. /* MAX_PID_NS_LEVEL is needed for limiting size of 'struct pid' */
  69. #define MAX_PID_NS_LEVEL 32
  70. static struct pid_namespace *create_pid_namespace(struct user_namespace *user_ns,
  71. struct pid_namespace *parent_pid_ns)
  72. {
  73. struct pid_namespace *ns;
  74. unsigned int level = parent_pid_ns->level + 1;
  75. int i;
  76. int err;
  77. if (level > MAX_PID_NS_LEVEL) {
  78. err = -EINVAL;
  79. goto out;
  80. }
  81. err = -ENOMEM;
  82. ns = kmem_cache_zalloc(pid_ns_cachep, GFP_KERNEL);
  83. if (ns == NULL)
  84. goto out;
  85. ns->pidmap[0].page = kzalloc(PAGE_SIZE, GFP_KERNEL);
  86. if (!ns->pidmap[0].page)
  87. goto out_free;
  88. ns->pid_cachep = create_pid_cachep(level + 1);
  89. if (ns->pid_cachep == NULL)
  90. goto out_free_map;
  91. err = proc_alloc_inum(&ns->proc_inum);
  92. if (err)
  93. goto out_free_map;
  94. kref_init(&ns->kref);
  95. ns->level = level;
  96. ns->parent = get_pid_ns(parent_pid_ns);
  97. ns->user_ns = get_user_ns(user_ns);
  98. INIT_WORK(&ns->proc_work, proc_cleanup_work);
  99. set_bit(0, ns->pidmap[0].page);
  100. atomic_set(&ns->pidmap[0].nr_free, BITS_PER_PAGE - 1);
  101. for (i = 1; i < PIDMAP_ENTRIES; i++)
  102. atomic_set(&ns->pidmap[i].nr_free, BITS_PER_PAGE);
  103. return ns;
  104. out_free_map:
  105. kfree(ns->pidmap[0].page);
  106. out_free:
  107. kmem_cache_free(pid_ns_cachep, ns);
  108. out:
  109. return ERR_PTR(err);
  110. }
  111. static void destroy_pid_namespace(struct pid_namespace *ns)
  112. {
  113. int i;
  114. proc_free_inum(ns->proc_inum);
  115. for (i = 0; i < PIDMAP_ENTRIES; i++)
  116. kfree(ns->pidmap[i].page);
  117. put_user_ns(ns->user_ns);
  118. kmem_cache_free(pid_ns_cachep, ns);
  119. }
  120. struct pid_namespace *copy_pid_ns(unsigned long flags,
  121. struct user_namespace *user_ns, struct pid_namespace *old_ns)
  122. {
  123. if (!(flags & CLONE_NEWPID))
  124. return get_pid_ns(old_ns);
  125. if (task_active_pid_ns(current) != old_ns)
  126. return ERR_PTR(-EINVAL);
  127. return create_pid_namespace(user_ns, old_ns);
  128. }
  129. static void free_pid_ns(struct kref *kref)
  130. {
  131. struct pid_namespace *ns;
  132. ns = container_of(kref, struct pid_namespace, kref);
  133. destroy_pid_namespace(ns);
  134. }
  135. void put_pid_ns(struct pid_namespace *ns)
  136. {
  137. struct pid_namespace *parent;
  138. while (ns != &init_pid_ns) {
  139. parent = ns->parent;
  140. if (!kref_put(&ns->kref, free_pid_ns))
  141. break;
  142. ns = parent;
  143. }
  144. }
  145. EXPORT_SYMBOL_GPL(put_pid_ns);
  146. void zap_pid_ns_processes(struct pid_namespace *pid_ns)
  147. {
  148. int nr;
  149. int rc;
  150. struct task_struct *task, *me = current;
  151. /* Ignore SIGCHLD causing any terminated children to autoreap */
  152. spin_lock_irq(&me->sighand->siglock);
  153. me->sighand->action[SIGCHLD - 1].sa.sa_handler = SIG_IGN;
  154. spin_unlock_irq(&me->sighand->siglock);
  155. /*
  156. * The last thread in the cgroup-init thread group is terminating.
  157. * Find remaining pid_ts in the namespace, signal and wait for them
  158. * to exit.
  159. *
  160. * Note: This signals each threads in the namespace - even those that
  161. * belong to the same thread group, To avoid this, we would have
  162. * to walk the entire tasklist looking a processes in this
  163. * namespace, but that could be unnecessarily expensive if the
  164. * pid namespace has just a few processes. Or we need to
  165. * maintain a tasklist for each pid namespace.
  166. *
  167. */
  168. read_lock(&tasklist_lock);
  169. nr = next_pidmap(pid_ns, 1);
  170. while (nr > 0) {
  171. rcu_read_lock();
  172. task = pid_task(find_vpid(nr), PIDTYPE_PID);
  173. if (task && !__fatal_signal_pending(task))
  174. send_sig_info(SIGKILL, SEND_SIG_FORCED, task);
  175. rcu_read_unlock();
  176. nr = next_pidmap(pid_ns, nr);
  177. }
  178. read_unlock(&tasklist_lock);
  179. /* Firstly reap the EXIT_ZOMBIE children we may have. */
  180. do {
  181. clear_thread_flag(TIF_SIGPENDING);
  182. rc = sys_wait4(-1, NULL, __WALL, NULL);
  183. } while (rc != -ECHILD);
  184. /*
  185. * sys_wait4() above can't reap the TASK_DEAD children.
  186. * Make sure they all go away, see free_pid().
  187. */
  188. for (;;) {
  189. set_current_state(TASK_UNINTERRUPTIBLE);
  190. if (pid_ns->nr_hashed == 1)
  191. break;
  192. schedule();
  193. }
  194. __set_current_state(TASK_RUNNING);
  195. if (pid_ns->reboot)
  196. current->signal->group_exit_code = pid_ns->reboot;
  197. acct_exit_ns(pid_ns);
  198. return;
  199. }
  200. #ifdef CONFIG_CHECKPOINT_RESTORE
  201. static int pid_ns_ctl_handler(struct ctl_table *table, int write,
  202. void __user *buffer, size_t *lenp, loff_t *ppos)
  203. {
  204. struct pid_namespace *pid_ns = task_active_pid_ns(current);
  205. struct ctl_table tmp = *table;
  206. if (write && !ns_capable(pid_ns->user_ns, CAP_SYS_ADMIN))
  207. return -EPERM;
  208. /*
  209. * Writing directly to ns' last_pid field is OK, since this field
  210. * is volatile in a living namespace anyway and a code writing to
  211. * it should synchronize its usage with external means.
  212. */
  213. tmp.data = &pid_ns->last_pid;
  214. return proc_dointvec_minmax(&tmp, write, buffer, lenp, ppos);
  215. }
  216. extern int pid_max;
  217. static int zero = 0;
  218. static struct ctl_table pid_ns_ctl_table[] = {
  219. {
  220. .procname = "ns_last_pid",
  221. .maxlen = sizeof(int),
  222. .mode = 0666, /* permissions are checked in the handler */
  223. .proc_handler = pid_ns_ctl_handler,
  224. .extra1 = &zero,
  225. .extra2 = &pid_max,
  226. },
  227. { }
  228. };
  229. static struct ctl_path kern_path[] = { { .procname = "kernel", }, { } };
  230. #endif /* CONFIG_CHECKPOINT_RESTORE */
  231. int reboot_pid_ns(struct pid_namespace *pid_ns, int cmd)
  232. {
  233. if (pid_ns == &init_pid_ns)
  234. return 0;
  235. switch (cmd) {
  236. case LINUX_REBOOT_CMD_RESTART2:
  237. case LINUX_REBOOT_CMD_RESTART:
  238. pid_ns->reboot = SIGHUP;
  239. break;
  240. case LINUX_REBOOT_CMD_POWER_OFF:
  241. case LINUX_REBOOT_CMD_HALT:
  242. pid_ns->reboot = SIGINT;
  243. break;
  244. default:
  245. return -EINVAL;
  246. }
  247. read_lock(&tasklist_lock);
  248. force_sig(SIGKILL, pid_ns->child_reaper);
  249. read_unlock(&tasklist_lock);
  250. do_exit(0);
  251. /* Not reached */
  252. return 0;
  253. }
  254. static void *pidns_get(struct task_struct *task)
  255. {
  256. struct pid_namespace *ns;
  257. rcu_read_lock();
  258. ns = get_pid_ns(task_active_pid_ns(task));
  259. rcu_read_unlock();
  260. return ns;
  261. }
  262. static void pidns_put(void *ns)
  263. {
  264. put_pid_ns(ns);
  265. }
  266. static int pidns_install(struct nsproxy *nsproxy, void *ns)
  267. {
  268. struct pid_namespace *active = task_active_pid_ns(current);
  269. struct pid_namespace *ancestor, *new = ns;
  270. if (!ns_capable(new->user_ns, CAP_SYS_ADMIN) ||
  271. !nsown_capable(CAP_SYS_ADMIN))
  272. return -EPERM;
  273. /*
  274. * Only allow entering the current active pid namespace
  275. * or a child of the current active pid namespace.
  276. *
  277. * This is required for fork to return a usable pid value and
  278. * this maintains the property that processes and their
  279. * children can not escape their current pid namespace.
  280. */
  281. if (new->level < active->level)
  282. return -EINVAL;
  283. ancestor = new;
  284. while (ancestor->level > active->level)
  285. ancestor = ancestor->parent;
  286. if (ancestor != active)
  287. return -EINVAL;
  288. put_pid_ns(nsproxy->pid_ns);
  289. nsproxy->pid_ns = get_pid_ns(new);
  290. return 0;
  291. }
  292. static unsigned int pidns_inum(void *ns)
  293. {
  294. struct pid_namespace *pid_ns = ns;
  295. return pid_ns->proc_inum;
  296. }
  297. const struct proc_ns_operations pidns_operations = {
  298. .name = "pid",
  299. .type = CLONE_NEWPID,
  300. .get = pidns_get,
  301. .put = pidns_put,
  302. .install = pidns_install,
  303. .inum = pidns_inum,
  304. };
  305. static __init int pid_namespaces_init(void)
  306. {
  307. pid_ns_cachep = KMEM_CACHE(pid_namespace, SLAB_PANIC);
  308. #ifdef CONFIG_CHECKPOINT_RESTORE
  309. register_sysctl_paths(kern_path, pid_ns_ctl_table);
  310. #endif
  311. return 0;
  312. }
  313. __initcall(pid_namespaces_init);