blob: 66eca94e4ada5f23408a338dc51813671d6b7d19 [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. Biedermandbec2842016-07-30 13:58:49 -050072 { }
73};
74#endif /* CONFIG_SYSCTL */
75
76bool setup_userns_sysctls(struct user_namespace *ns)
77{
78#ifdef CONFIG_SYSCTL
79 struct ctl_table *tbl;
80 setup_sysctl_set(&ns->set, &set_root, set_is_seen);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050081 tbl = kmemdup(user_table, sizeof(user_table), GFP_KERNEL);
Eric W. Biedermandbec2842016-07-30 13:58:49 -050082 if (tbl) {
Eric W. Biederman25f9c082016-08-08 14:41:52 -050083 int i;
84 for (i = 0; i < UCOUNT_COUNTS; i++) {
85 tbl[i].data = &ns->ucount_max[i];
86 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050087 ns->sysctls = __register_sysctl_table(&ns->set, "user", tbl);
Eric W. Biedermandbec2842016-07-30 13:58:49 -050088 }
89 if (!ns->sysctls) {
90 kfree(tbl);
91 retire_sysctl_set(&ns->set);
92 return false;
93 }
94#endif
95 return true;
96}
97
98void retire_userns_sysctls(struct user_namespace *ns)
99{
100#ifdef CONFIG_SYSCTL
101 struct ctl_table *tbl;
102
103 tbl = ns->sysctls->ctl_table_arg;
104 unregister_sysctl_table(ns->sysctls);
105 retire_sysctl_set(&ns->set);
106 kfree(tbl);
107#endif
108}
109
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500110static struct ucounts *find_ucounts(struct user_namespace *ns, kuid_t uid, struct hlist_head *hashent)
111{
112 struct ucounts *ucounts;
113
114 hlist_for_each_entry(ucounts, hashent, node) {
115 if (uid_eq(ucounts->uid, uid) && (ucounts->ns == ns))
116 return ucounts;
117 }
118 return NULL;
119}
120
121static struct ucounts *get_ucounts(struct user_namespace *ns, kuid_t uid)
122{
123 struct hlist_head *hashent = ucounts_hashentry(ns, uid);
124 struct ucounts *ucounts, *new;
125
126 spin_lock(&ucounts_lock);
127 ucounts = find_ucounts(ns, uid, hashent);
128 if (!ucounts) {
129 spin_unlock(&ucounts_lock);
130
131 new = kzalloc(sizeof(*new), GFP_KERNEL);
132 if (!new)
133 return NULL;
134
135 new->ns = ns;
136 new->uid = uid;
137 atomic_set(&new->count, 0);
138
139 spin_lock(&ucounts_lock);
140 ucounts = find_ucounts(ns, uid, hashent);
141 if (ucounts) {
142 kfree(new);
143 } else {
144 hlist_add_head(&new->node, hashent);
145 ucounts = new;
146 }
147 }
148 if (!atomic_add_unless(&ucounts->count, 1, INT_MAX))
149 ucounts = NULL;
150 spin_unlock(&ucounts_lock);
151 return ucounts;
152}
153
154static void put_ucounts(struct ucounts *ucounts)
155{
156 if (atomic_dec_and_test(&ucounts->count)) {
157 spin_lock(&ucounts_lock);
158 hlist_del_init(&ucounts->node);
159 spin_unlock(&ucounts_lock);
160
161 kfree(ucounts);
162 }
163}
164
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500165static inline bool atomic_inc_below(atomic_t *v, int u)
166{
167 int c, old;
168 c = atomic_read(v);
169 for (;;) {
170 if (unlikely(c >= u))
171 return false;
172 old = atomic_cmpxchg(v, c, c+1);
173 if (likely(old == c))
174 return true;
175 c = old;
176 }
177}
178
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500179struct ucounts *inc_ucount(struct user_namespace *ns, kuid_t uid,
180 enum ucount_type type)
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500181{
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500182 struct ucounts *ucounts, *iter, *bad;
183 struct user_namespace *tns;
184 ucounts = get_ucounts(ns, uid);
185 for (iter = ucounts; iter; iter = tns->ucounts) {
186 int max;
187 tns = iter->ns;
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500188 max = READ_ONCE(tns->ucount_max[type]);
189 if (!atomic_inc_below(&iter->ucount[type], max))
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500190 goto fail;
191 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500192 return ucounts;
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500193fail:
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500194 bad = iter;
195 for (iter = ucounts; iter != bad; iter = iter->ns->ucounts)
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500196 atomic_dec(&iter->ucount[type]);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500197
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500198 put_ucounts(ucounts);
199 return NULL;
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500200}
201
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500202void dec_ucount(struct ucounts *ucounts, enum ucount_type type)
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500203{
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500204 struct ucounts *iter;
205 for (iter = ucounts; iter; iter = iter->ns->ucounts) {
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500206 int dec = atomic_dec_if_positive(&iter->ucount[type]);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500207 WARN_ON_ONCE(dec < 0);
208 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500209 put_ucounts(ucounts);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500210}
211
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500212static __init int user_namespace_sysctl_init(void)
213{
214#ifdef CONFIG_SYSCTL
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500215 static struct ctl_table_header *user_header;
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500216 static struct ctl_table empty[1];
217 /*
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500218 * It is necessary to register the user directory in the
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500219 * default set so that registrations in the child sets work
220 * properly.
221 */
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500222 user_header = register_sysctl("user", empty);
223 BUG_ON(!user_header);
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500224 BUG_ON(!setup_userns_sysctls(&init_user_ns));
225#endif
226 return 0;
227}
228subsys_initcall(user_namespace_sysctl_init);
229
230