blob: c761cdba2a2d816b70ee1dcb4f2c0ffcf056df43 [file] [log] [blame]
Eric W. Biedermandbec2842016-07-30 13:58:49 -05001/*
2 * This program is free software; you can redistribute it and/or
3 * modify it under the terms of the GNU General Public License as
4 * published by the Free Software Foundation, version 2 of the
5 * License.
6 */
7
8#include <linux/stat.h>
9#include <linux/sysctl.h>
10#include <linux/slab.h>
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050011#include <linux/hash.h>
Eric W. Biedermandbec2842016-07-30 13:58:49 -050012#include <linux/user_namespace.h>
13
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050014#define UCOUNTS_HASHTABLE_BITS 10
15static struct hlist_head ucounts_hashtable[(1 << UCOUNTS_HASHTABLE_BITS)];
16static DEFINE_SPINLOCK(ucounts_lock);
17
18#define ucounts_hashfn(ns, uid) \
19 hash_long((unsigned long)__kuid_val(uid) + (unsigned long)(ns), \
20 UCOUNTS_HASHTABLE_BITS)
21#define ucounts_hashentry(ns, uid) \
22 (ucounts_hashtable + ucounts_hashfn(ns, uid))
23
24
Eric W. Biedermandbec2842016-07-30 13:58:49 -050025#ifdef CONFIG_SYSCTL
26static struct ctl_table_set *
27set_lookup(struct ctl_table_root *root)
28{
29 return &current_user_ns()->set;
30}
31
32static int set_is_seen(struct ctl_table_set *set)
33{
34 return &current_user_ns()->set == set;
35}
36
37static int set_permissions(struct ctl_table_header *head,
38 struct ctl_table *table)
39{
40 struct user_namespace *user_ns =
41 container_of(head->set, struct user_namespace, set);
42 int mode;
43
44 /* Allow users with CAP_SYS_RESOURCE unrestrained access */
45 if (ns_capable(user_ns, CAP_SYS_RESOURCE))
46 mode = (table->mode & S_IRWXU) >> 6;
47 else
48 /* Allow all others at most read-only access */
49 mode = table->mode & S_IROTH;
50 return (mode << 6) | (mode << 3) | mode;
51}
52
53static struct ctl_table_root set_root = {
54 .lookup = set_lookup,
55 .permissions = set_permissions,
56};
57
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -050058static int zero = 0;
59static int int_max = INT_MAX;
Eric W. Biederman25f9c082016-08-08 14:41:52 -050060#define UCOUNT_ENTRY(name) \
61 { \
62 .procname = name, \
63 .maxlen = sizeof(int), \
64 .mode = 0644, \
65 .proc_handler = proc_dointvec_minmax, \
66 .extra1 = &zero, \
67 .extra2 = &int_max, \
68 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050069static struct ctl_table user_table[] = {
Eric W. Biederman25f9c082016-08-08 14:41:52 -050070 UCOUNT_ENTRY("max_user_namespaces"),
Eric W. Biedermanf333c702016-08-08 14:08:36 -050071 UCOUNT_ENTRY("max_pid_namespaces"),
Eric W. Biedermanf7af3d12016-08-08 14:11:25 -050072 UCOUNT_ENTRY("max_uts_namespaces"),
Eric W. Biedermanaba35662016-08-08 14:20:23 -050073 UCOUNT_ENTRY("max_ipc_namespaces"),
Eric W. Biederman70328662016-08-08 14:33:23 -050074 UCOUNT_ENTRY("max_net_namespaces"),
Eric W. Biederman537f7cc2016-08-08 14:37:37 -050075 UCOUNT_ENTRY("max_mnt_namespaces"),
Eric W. Biedermand08311d2016-08-08 14:25:30 -050076 UCOUNT_ENTRY("max_cgroup_namespaces"),
Eric W. Biedermandbec2842016-07-30 13:58:49 -050077 { }
78};
79#endif /* CONFIG_SYSCTL */
80
81bool setup_userns_sysctls(struct user_namespace *ns)
82{
83#ifdef CONFIG_SYSCTL
84 struct ctl_table *tbl;
85 setup_sysctl_set(&ns->set, &set_root, set_is_seen);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050086 tbl = kmemdup(user_table, sizeof(user_table), GFP_KERNEL);
Eric W. Biedermandbec2842016-07-30 13:58:49 -050087 if (tbl) {
Eric W. Biederman25f9c082016-08-08 14:41:52 -050088 int i;
89 for (i = 0; i < UCOUNT_COUNTS; i++) {
90 tbl[i].data = &ns->ucount_max[i];
91 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050092 ns->sysctls = __register_sysctl_table(&ns->set, "user", tbl);
Eric W. Biedermandbec2842016-07-30 13:58:49 -050093 }
94 if (!ns->sysctls) {
95 kfree(tbl);
96 retire_sysctl_set(&ns->set);
97 return false;
98 }
99#endif
100 return true;
101}
102
103void retire_userns_sysctls(struct user_namespace *ns)
104{
105#ifdef CONFIG_SYSCTL
106 struct ctl_table *tbl;
107
108 tbl = ns->sysctls->ctl_table_arg;
109 unregister_sysctl_table(ns->sysctls);
110 retire_sysctl_set(&ns->set);
111 kfree(tbl);
112#endif
113}
114
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500115static struct ucounts *find_ucounts(struct user_namespace *ns, kuid_t uid, struct hlist_head *hashent)
116{
117 struct ucounts *ucounts;
118
119 hlist_for_each_entry(ucounts, hashent, node) {
120 if (uid_eq(ucounts->uid, uid) && (ucounts->ns == ns))
121 return ucounts;
122 }
123 return NULL;
124}
125
126static struct ucounts *get_ucounts(struct user_namespace *ns, kuid_t uid)
127{
128 struct hlist_head *hashent = ucounts_hashentry(ns, uid);
129 struct ucounts *ucounts, *new;
130
Nikolay Borisovc7556862017-01-20 15:21:35 +0200131 spin_lock_irq(&ucounts_lock);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500132 ucounts = find_ucounts(ns, uid, hashent);
133 if (!ucounts) {
Nikolay Borisovc7556862017-01-20 15:21:35 +0200134 spin_unlock_irq(&ucounts_lock);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500135
136 new = kzalloc(sizeof(*new), GFP_KERNEL);
137 if (!new)
138 return NULL;
139
140 new->ns = ns;
141 new->uid = uid;
Eric W. Biedermanee6f7ee2017-03-05 15:03:22 -0600142 new->count = 0;
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500143
Nikolay Borisovc7556862017-01-20 15:21:35 +0200144 spin_lock_irq(&ucounts_lock);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500145 ucounts = find_ucounts(ns, uid, hashent);
146 if (ucounts) {
147 kfree(new);
148 } else {
149 hlist_add_head(&new->node, hashent);
150 ucounts = new;
151 }
152 }
Eric W. Biedermanee6f7ee2017-03-05 15:03:22 -0600153 if (ucounts->count == INT_MAX)
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500154 ucounts = NULL;
Eric W. Biedermanee6f7ee2017-03-05 15:03:22 -0600155 else
156 ucounts->count += 1;
Nikolay Borisovc7556862017-01-20 15:21:35 +0200157 spin_unlock_irq(&ucounts_lock);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500158 return ucounts;
159}
160
161static void put_ucounts(struct ucounts *ucounts)
162{
Nikolay Borisovc7556862017-01-20 15:21:35 +0200163 unsigned long flags;
164
Eric W. Biedermanee6f7ee2017-03-05 15:03:22 -0600165 spin_lock_irqsave(&ucounts_lock, flags);
166 ucounts->count -= 1;
167 if (!ucounts->count)
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500168 hlist_del_init(&ucounts->node);
Eric W. Biedermanee6f7ee2017-03-05 15:03:22 -0600169 else
170 ucounts = NULL;
171 spin_unlock_irqrestore(&ucounts_lock, flags);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500172
Eric W. Biedermanee6f7ee2017-03-05 15:03:22 -0600173 kfree(ucounts);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500174}
175
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500176static inline bool atomic_inc_below(atomic_t *v, int u)
177{
178 int c, old;
179 c = atomic_read(v);
180 for (;;) {
181 if (unlikely(c >= u))
182 return false;
183 old = atomic_cmpxchg(v, c, c+1);
184 if (likely(old == c))
185 return true;
186 c = old;
187 }
188}
189
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500190struct ucounts *inc_ucount(struct user_namespace *ns, kuid_t uid,
191 enum ucount_type type)
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500192{
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500193 struct ucounts *ucounts, *iter, *bad;
194 struct user_namespace *tns;
195 ucounts = get_ucounts(ns, uid);
196 for (iter = ucounts; iter; iter = tns->ucounts) {
197 int max;
198 tns = iter->ns;
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500199 max = READ_ONCE(tns->ucount_max[type]);
200 if (!atomic_inc_below(&iter->ucount[type], max))
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500201 goto fail;
202 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500203 return ucounts;
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500204fail:
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500205 bad = iter;
206 for (iter = ucounts; iter != bad; iter = iter->ns->ucounts)
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500207 atomic_dec(&iter->ucount[type]);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500208
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500209 put_ucounts(ucounts);
210 return NULL;
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500211}
212
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500213void dec_ucount(struct ucounts *ucounts, enum ucount_type type)
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500214{
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500215 struct ucounts *iter;
216 for (iter = ucounts; iter; iter = iter->ns->ucounts) {
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500217 int dec = atomic_dec_if_positive(&iter->ucount[type]);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500218 WARN_ON_ONCE(dec < 0);
219 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500220 put_ucounts(ucounts);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500221}
222
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500223static __init int user_namespace_sysctl_init(void)
224{
225#ifdef CONFIG_SYSCTL
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500226 static struct ctl_table_header *user_header;
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500227 static struct ctl_table empty[1];
228 /*
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500229 * It is necessary to register the user directory in the
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500230 * default set so that registrations in the child sets work
231 * properly.
232 */
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500233 user_header = register_sysctl("user", empty);
Luis R. Rodriguezbaaa84b2017-05-23 21:53:47 -0400234 kmemleak_ignore(user_header);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500235 BUG_ON(!user_header);
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500236 BUG_ON(!setup_userns_sysctls(&init_user_ns));
237#endif
238 return 0;
239}
240subsys_initcall(user_namespace_sysctl_init);