blob: 866850e2eb9292f15fa2ca977929f250a8d75ba6 [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. Biedermandbec2842016-07-30 13:58:49 -050073 { }
74};
75#endif /* CONFIG_SYSCTL */
76
77bool setup_userns_sysctls(struct user_namespace *ns)
78{
79#ifdef CONFIG_SYSCTL
80 struct ctl_table *tbl;
81 setup_sysctl_set(&ns->set, &set_root, set_is_seen);
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050082 tbl = kmemdup(user_table, sizeof(user_table), GFP_KERNEL);
Eric W. Biedermandbec2842016-07-30 13:58:49 -050083 if (tbl) {
Eric W. Biederman25f9c082016-08-08 14:41:52 -050084 int i;
85 for (i = 0; i < UCOUNT_COUNTS; i++) {
86 tbl[i].data = &ns->ucount_max[i];
87 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -050088 ns->sysctls = __register_sysctl_table(&ns->set, "user", tbl);
Eric W. Biedermandbec2842016-07-30 13:58:49 -050089 }
90 if (!ns->sysctls) {
91 kfree(tbl);
92 retire_sysctl_set(&ns->set);
93 return false;
94 }
95#endif
96 return true;
97}
98
99void retire_userns_sysctls(struct user_namespace *ns)
100{
101#ifdef CONFIG_SYSCTL
102 struct ctl_table *tbl;
103
104 tbl = ns->sysctls->ctl_table_arg;
105 unregister_sysctl_table(ns->sysctls);
106 retire_sysctl_set(&ns->set);
107 kfree(tbl);
108#endif
109}
110
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500111static struct ucounts *find_ucounts(struct user_namespace *ns, kuid_t uid, struct hlist_head *hashent)
112{
113 struct ucounts *ucounts;
114
115 hlist_for_each_entry(ucounts, hashent, node) {
116 if (uid_eq(ucounts->uid, uid) && (ucounts->ns == ns))
117 return ucounts;
118 }
119 return NULL;
120}
121
122static struct ucounts *get_ucounts(struct user_namespace *ns, kuid_t uid)
123{
124 struct hlist_head *hashent = ucounts_hashentry(ns, uid);
125 struct ucounts *ucounts, *new;
126
127 spin_lock(&ucounts_lock);
128 ucounts = find_ucounts(ns, uid, hashent);
129 if (!ucounts) {
130 spin_unlock(&ucounts_lock);
131
132 new = kzalloc(sizeof(*new), GFP_KERNEL);
133 if (!new)
134 return NULL;
135
136 new->ns = ns;
137 new->uid = uid;
138 atomic_set(&new->count, 0);
139
140 spin_lock(&ucounts_lock);
141 ucounts = find_ucounts(ns, uid, hashent);
142 if (ucounts) {
143 kfree(new);
144 } else {
145 hlist_add_head(&new->node, hashent);
146 ucounts = new;
147 }
148 }
149 if (!atomic_add_unless(&ucounts->count, 1, INT_MAX))
150 ucounts = NULL;
151 spin_unlock(&ucounts_lock);
152 return ucounts;
153}
154
155static void put_ucounts(struct ucounts *ucounts)
156{
157 if (atomic_dec_and_test(&ucounts->count)) {
158 spin_lock(&ucounts_lock);
159 hlist_del_init(&ucounts->node);
160 spin_unlock(&ucounts_lock);
161
162 kfree(ucounts);
163 }
164}
165
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500166static inline bool atomic_inc_below(atomic_t *v, int u)
167{
168 int c, old;
169 c = atomic_read(v);
170 for (;;) {
171 if (unlikely(c >= u))
172 return false;
173 old = atomic_cmpxchg(v, c, c+1);
174 if (likely(old == c))
175 return true;
176 c = old;
177 }
178}
179
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500180struct ucounts *inc_ucount(struct user_namespace *ns, kuid_t uid,
181 enum ucount_type type)
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500182{
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500183 struct ucounts *ucounts, *iter, *bad;
184 struct user_namespace *tns;
185 ucounts = get_ucounts(ns, uid);
186 for (iter = ucounts; iter; iter = tns->ucounts) {
187 int max;
188 tns = iter->ns;
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500189 max = READ_ONCE(tns->ucount_max[type]);
190 if (!atomic_inc_below(&iter->ucount[type], max))
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500191 goto fail;
192 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500193 return ucounts;
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500194fail:
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500195 bad = iter;
196 for (iter = ucounts; iter != bad; iter = iter->ns->ucounts)
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500197 atomic_dec(&iter->ucount[type]);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500198
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500199 put_ucounts(ucounts);
200 return NULL;
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500201}
202
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500203void dec_ucount(struct ucounts *ucounts, enum ucount_type type)
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500204{
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500205 struct ucounts *iter;
206 for (iter = ucounts; iter; iter = iter->ns->ucounts) {
Eric W. Biederman25f9c082016-08-08 14:41:52 -0500207 int dec = atomic_dec_if_positive(&iter->ucount[type]);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500208 WARN_ON_ONCE(dec < 0);
209 }
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500210 put_ucounts(ucounts);
Eric W. Biedermanb376c3e2016-08-08 13:41:24 -0500211}
212
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500213static __init int user_namespace_sysctl_init(void)
214{
215#ifdef CONFIG_SYSCTL
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500216 static struct ctl_table_header *user_header;
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500217 static struct ctl_table empty[1];
218 /*
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500219 * It is necessary to register the user directory in the
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500220 * default set so that registrations in the child sets work
221 * properly.
222 */
Eric W. Biedermanf6b2db12016-08-08 13:54:50 -0500223 user_header = register_sysctl("user", empty);
224 BUG_ON(!user_header);
Eric W. Biedermandbec2842016-07-30 13:58:49 -0500225 BUG_ON(!setup_userns_sysctls(&init_user_ns));
226#endif
227 return 0;
228}
229subsys_initcall(user_namespace_sysctl_init);
230
231