1 // SPDX-License-Identifier: GPL-2.0-only !! 1 /*
>> 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 */
2 7
3 #include <linux/stat.h> 8 #include <linux/stat.h>
4 #include <linux/sysctl.h> 9 #include <linux/sysctl.h>
5 #include <linux/slab.h> 10 #include <linux/slab.h>
6 #include <linux/cred.h> 11 #include <linux/cred.h>
7 #include <linux/hash.h> 12 #include <linux/hash.h>
8 #include <linux/kmemleak.h> <<
9 #include <linux/user_namespace.h> 13 #include <linux/user_namespace.h>
10 14
11 struct ucounts init_ucounts = { <<
12 .ns = &init_user_ns, <<
13 .uid = GLOBAL_ROOT_UID, <<
14 .count = ATOMIC_INIT(1), <<
15 }; <<
16 <<
17 #define UCOUNTS_HASHTABLE_BITS 10 15 #define UCOUNTS_HASHTABLE_BITS 10
18 static struct hlist_head ucounts_hashtable[(1 16 static struct hlist_head ucounts_hashtable[(1 << UCOUNTS_HASHTABLE_BITS)];
19 static DEFINE_SPINLOCK(ucounts_lock); 17 static DEFINE_SPINLOCK(ucounts_lock);
20 18
21 #define ucounts_hashfn(ns, uid) 19 #define ucounts_hashfn(ns, uid) \
22 hash_long((unsigned long)__kuid_val(ui 20 hash_long((unsigned long)__kuid_val(uid) + (unsigned long)(ns), \
23 UCOUNTS_HASHTABLE_BITS) 21 UCOUNTS_HASHTABLE_BITS)
24 #define ucounts_hashentry(ns, uid) \ 22 #define ucounts_hashentry(ns, uid) \
25 (ucounts_hashtable + ucounts_hashfn(ns 23 (ucounts_hashtable + ucounts_hashfn(ns, uid))
26 24
27 25
28 #ifdef CONFIG_SYSCTL 26 #ifdef CONFIG_SYSCTL
29 static struct ctl_table_set * 27 static struct ctl_table_set *
30 set_lookup(struct ctl_table_root *root) 28 set_lookup(struct ctl_table_root *root)
31 { 29 {
32 return ¤t_user_ns()->set; 30 return ¤t_user_ns()->set;
33 } 31 }
34 32
35 static int set_is_seen(struct ctl_table_set *s 33 static int set_is_seen(struct ctl_table_set *set)
36 { 34 {
37 return ¤t_user_ns()->set == set; 35 return ¤t_user_ns()->set == set;
38 } 36 }
39 37
40 static int set_permissions(struct ctl_table_he 38 static int set_permissions(struct ctl_table_header *head,
41 const struct ctl_ta !! 39 struct ctl_table *table)
42 { 40 {
43 struct user_namespace *user_ns = 41 struct user_namespace *user_ns =
44 container_of(head->set, struct 42 container_of(head->set, struct user_namespace, set);
45 int mode; 43 int mode;
46 44
47 /* Allow users with CAP_SYS_RESOURCE u 45 /* Allow users with CAP_SYS_RESOURCE unrestrained access */
48 if (ns_capable(user_ns, CAP_SYS_RESOUR 46 if (ns_capable(user_ns, CAP_SYS_RESOURCE))
49 mode = (table->mode & S_IRWXU) 47 mode = (table->mode & S_IRWXU) >> 6;
50 else 48 else
51 /* Allow all others at most read-only 49 /* Allow all others at most read-only access */
52 mode = table->mode & S_IROTH; 50 mode = table->mode & S_IROTH;
53 return (mode << 6) | (mode << 3) | mod 51 return (mode << 6) | (mode << 3) | mode;
54 } 52 }
55 53
56 static struct ctl_table_root set_root = { 54 static struct ctl_table_root set_root = {
57 .lookup = set_lookup, 55 .lookup = set_lookup,
58 .permissions = set_permissions, 56 .permissions = set_permissions,
59 }; 57 };
60 58
61 static long ue_zero = 0; !! 59 static int zero = 0;
62 static long ue_int_max = INT_MAX; !! 60 static int int_max = INT_MAX;
63 !! 61 #define UCOUNT_ENTRY(name) \
64 #define UCOUNT_ENTRY(name) !! 62 { \
65 { !! 63 .procname = name, \
66 .procname = name, !! 64 .maxlen = sizeof(int), \
67 .maxlen = sizeof(long) !! 65 .mode = 0644, \
68 .mode = 0644, !! 66 .proc_handler = proc_dointvec_minmax, \
69 .proc_handler = proc_doulong !! 67 .extra1 = &zero, \
70 .extra1 = &ue_zero, !! 68 .extra2 = &int_max, \
71 .extra2 = &ue_int_max, <<
72 } 69 }
73 static struct ctl_table user_table[] = { 70 static struct ctl_table user_table[] = {
74 UCOUNT_ENTRY("max_user_namespaces"), 71 UCOUNT_ENTRY("max_user_namespaces"),
75 UCOUNT_ENTRY("max_pid_namespaces"), 72 UCOUNT_ENTRY("max_pid_namespaces"),
76 UCOUNT_ENTRY("max_uts_namespaces"), 73 UCOUNT_ENTRY("max_uts_namespaces"),
77 UCOUNT_ENTRY("max_ipc_namespaces"), 74 UCOUNT_ENTRY("max_ipc_namespaces"),
78 UCOUNT_ENTRY("max_net_namespaces"), 75 UCOUNT_ENTRY("max_net_namespaces"),
79 UCOUNT_ENTRY("max_mnt_namespaces"), 76 UCOUNT_ENTRY("max_mnt_namespaces"),
80 UCOUNT_ENTRY("max_cgroup_namespaces"), 77 UCOUNT_ENTRY("max_cgroup_namespaces"),
81 UCOUNT_ENTRY("max_time_namespaces"), <<
82 #ifdef CONFIG_INOTIFY_USER 78 #ifdef CONFIG_INOTIFY_USER
83 UCOUNT_ENTRY("max_inotify_instances"), 79 UCOUNT_ENTRY("max_inotify_instances"),
84 UCOUNT_ENTRY("max_inotify_watches"), 80 UCOUNT_ENTRY("max_inotify_watches"),
85 #endif 81 #endif
86 #ifdef CONFIG_FANOTIFY !! 82 { }
87 UCOUNT_ENTRY("max_fanotify_groups"), <<
88 UCOUNT_ENTRY("max_fanotify_marks"), <<
89 #endif <<
90 }; 83 };
91 #endif /* CONFIG_SYSCTL */ 84 #endif /* CONFIG_SYSCTL */
92 85
93 bool setup_userns_sysctls(struct user_namespac 86 bool setup_userns_sysctls(struct user_namespace *ns)
94 { 87 {
95 #ifdef CONFIG_SYSCTL 88 #ifdef CONFIG_SYSCTL
96 struct ctl_table *tbl; 89 struct ctl_table *tbl;
97 <<
98 BUILD_BUG_ON(ARRAY_SIZE(user_table) != <<
99 setup_sysctl_set(&ns->set, &set_root, 90 setup_sysctl_set(&ns->set, &set_root, set_is_seen);
100 tbl = kmemdup(user_table, sizeof(user_ 91 tbl = kmemdup(user_table, sizeof(user_table), GFP_KERNEL);
101 if (tbl) { 92 if (tbl) {
102 int i; 93 int i;
103 for (i = 0; i < UCOUNT_COUNTS; 94 for (i = 0; i < UCOUNT_COUNTS; i++) {
104 tbl[i].data = &ns->uco 95 tbl[i].data = &ns->ucount_max[i];
105 } 96 }
106 ns->sysctls = __register_sysct !! 97 ns->sysctls = __register_sysctl_table(&ns->set, "user", tbl);
107 <<
108 } 98 }
109 if (!ns->sysctls) { 99 if (!ns->sysctls) {
110 kfree(tbl); 100 kfree(tbl);
111 retire_sysctl_set(&ns->set); 101 retire_sysctl_set(&ns->set);
112 return false; 102 return false;
113 } 103 }
114 #endif 104 #endif
115 return true; 105 return true;
116 } 106 }
117 107
118 void retire_userns_sysctls(struct user_namespa 108 void retire_userns_sysctls(struct user_namespace *ns)
119 { 109 {
120 #ifdef CONFIG_SYSCTL 110 #ifdef CONFIG_SYSCTL
121 const struct ctl_table *tbl; !! 111 struct ctl_table *tbl;
122 112
123 tbl = ns->sysctls->ctl_table_arg; 113 tbl = ns->sysctls->ctl_table_arg;
124 unregister_sysctl_table(ns->sysctls); 114 unregister_sysctl_table(ns->sysctls);
125 retire_sysctl_set(&ns->set); 115 retire_sysctl_set(&ns->set);
126 kfree(tbl); 116 kfree(tbl);
127 #endif 117 #endif
128 } 118 }
129 119
130 static struct ucounts *find_ucounts(struct use 120 static struct ucounts *find_ucounts(struct user_namespace *ns, kuid_t uid, struct hlist_head *hashent)
131 { 121 {
132 struct ucounts *ucounts; 122 struct ucounts *ucounts;
133 123
134 hlist_for_each_entry(ucounts, hashent, 124 hlist_for_each_entry(ucounts, hashent, node) {
135 if (uid_eq(ucounts->uid, uid) 125 if (uid_eq(ucounts->uid, uid) && (ucounts->ns == ns))
136 return ucounts; 126 return ucounts;
137 } 127 }
138 return NULL; 128 return NULL;
139 } 129 }
140 130
141 static void hlist_add_ucounts(struct ucounts * !! 131 static struct ucounts *get_ucounts(struct user_namespace *ns, kuid_t uid)
142 { <<
143 struct hlist_head *hashent = ucounts_h <<
144 spin_lock_irq(&ucounts_lock); <<
145 hlist_add_head(&ucounts->node, hashent <<
146 spin_unlock_irq(&ucounts_lock); <<
147 } <<
148 <<
149 static inline bool get_ucounts_or_wrap(struct <<
150 { <<
151 /* Returns true on a successful get, f <<
152 return !atomic_add_negative(1, &ucount <<
153 } <<
154 <<
155 struct ucounts *get_ucounts(struct ucounts *uc <<
156 { <<
157 if (!get_ucounts_or_wrap(ucounts)) { <<
158 put_ucounts(ucounts); <<
159 ucounts = NULL; <<
160 } <<
161 return ucounts; <<
162 } <<
163 <<
164 struct ucounts *alloc_ucounts(struct user_name <<
165 { 132 {
166 struct hlist_head *hashent = ucounts_h 133 struct hlist_head *hashent = ucounts_hashentry(ns, uid);
167 struct ucounts *ucounts, *new; 134 struct ucounts *ucounts, *new;
168 bool wrapped; <<
169 135
170 spin_lock_irq(&ucounts_lock); 136 spin_lock_irq(&ucounts_lock);
171 ucounts = find_ucounts(ns, uid, hashen 137 ucounts = find_ucounts(ns, uid, hashent);
172 if (!ucounts) { 138 if (!ucounts) {
173 spin_unlock_irq(&ucounts_lock) 139 spin_unlock_irq(&ucounts_lock);
174 140
175 new = kzalloc(sizeof(*new), GF 141 new = kzalloc(sizeof(*new), GFP_KERNEL);
176 if (!new) 142 if (!new)
177 return NULL; 143 return NULL;
178 144
179 new->ns = ns; 145 new->ns = ns;
180 new->uid = uid; 146 new->uid = uid;
181 atomic_set(&new->count, 1); !! 147 new->count = 0;
182 148
183 spin_lock_irq(&ucounts_lock); 149 spin_lock_irq(&ucounts_lock);
184 ucounts = find_ucounts(ns, uid 150 ucounts = find_ucounts(ns, uid, hashent);
185 if (ucounts) { 151 if (ucounts) {
186 kfree(new); 152 kfree(new);
187 } else { 153 } else {
188 hlist_add_head(&new->n 154 hlist_add_head(&new->node, hashent);
189 get_user_ns(new->ns); !! 155 ucounts = new;
190 spin_unlock_irq(&ucoun <<
191 return new; <<
192 } 156 }
193 } 157 }
194 wrapped = !get_ucounts_or_wrap(ucounts !! 158 if (ucounts->count == INT_MAX)
>> 159 ucounts = NULL;
>> 160 else
>> 161 ucounts->count += 1;
195 spin_unlock_irq(&ucounts_lock); 162 spin_unlock_irq(&ucounts_lock);
196 if (wrapped) { <<
197 put_ucounts(ucounts); <<
198 return NULL; <<
199 } <<
200 return ucounts; 163 return ucounts;
201 } 164 }
202 165
203 void put_ucounts(struct ucounts *ucounts) !! 166 static void put_ucounts(struct ucounts *ucounts)
204 { 167 {
205 unsigned long flags; 168 unsigned long flags;
206 169
207 if (atomic_dec_and_lock_irqsave(&ucoun !! 170 spin_lock_irqsave(&ucounts_lock, flags);
>> 171 ucounts->count -= 1;
>> 172 if (!ucounts->count)
208 hlist_del_init(&ucounts->node) 173 hlist_del_init(&ucounts->node);
209 spin_unlock_irqrestore(&ucount !! 174 else
210 put_user_ns(ucounts->ns); !! 175 ucounts = NULL;
211 kfree(ucounts); !! 176 spin_unlock_irqrestore(&ucounts_lock, flags);
212 } !! 177
>> 178 kfree(ucounts);
213 } 179 }
214 180
215 static inline bool atomic_long_inc_below(atomi !! 181 static inline bool atomic_inc_below(atomic_t *v, int u)
216 { 182 {
217 long c, old; !! 183 int c, old;
218 c = atomic_long_read(v); !! 184 c = atomic_read(v);
219 for (;;) { 185 for (;;) {
220 if (unlikely(c >= u)) 186 if (unlikely(c >= u))
221 return false; 187 return false;
222 old = atomic_long_cmpxchg(v, c !! 188 old = atomic_cmpxchg(v, c, c+1);
223 if (likely(old == c)) 189 if (likely(old == c))
224 return true; 190 return true;
225 c = old; 191 c = old;
226 } 192 }
227 } 193 }
228 194
229 struct ucounts *inc_ucount(struct user_namespa 195 struct ucounts *inc_ucount(struct user_namespace *ns, kuid_t uid,
230 enum ucount_type ty 196 enum ucount_type type)
231 { 197 {
232 struct ucounts *ucounts, *iter, *bad; 198 struct ucounts *ucounts, *iter, *bad;
233 struct user_namespace *tns; 199 struct user_namespace *tns;
234 ucounts = alloc_ucounts(ns, uid); !! 200 ucounts = get_ucounts(ns, uid);
235 for (iter = ucounts; iter; iter = tns- 201 for (iter = ucounts; iter; iter = tns->ucounts) {
236 long max; !! 202 int max;
237 tns = iter->ns; 203 tns = iter->ns;
238 max = READ_ONCE(tns->ucount_ma 204 max = READ_ONCE(tns->ucount_max[type]);
239 if (!atomic_long_inc_below(&it !! 205 if (!atomic_inc_below(&iter->ucount[type], max))
240 goto fail; 206 goto fail;
241 } 207 }
242 return ucounts; 208 return ucounts;
243 fail: 209 fail:
244 bad = iter; 210 bad = iter;
245 for (iter = ucounts; iter != bad; iter 211 for (iter = ucounts; iter != bad; iter = iter->ns->ucounts)
246 atomic_long_dec(&iter->ucount[ !! 212 atomic_dec(&iter->ucount[type]);
247 213
248 put_ucounts(ucounts); 214 put_ucounts(ucounts);
249 return NULL; 215 return NULL;
250 } 216 }
251 217
252 void dec_ucount(struct ucounts *ucounts, enum 218 void dec_ucount(struct ucounts *ucounts, enum ucount_type type)
253 { 219 {
254 struct ucounts *iter; 220 struct ucounts *iter;
255 for (iter = ucounts; iter; iter = iter 221 for (iter = ucounts; iter; iter = iter->ns->ucounts) {
256 long dec = atomic_long_dec_if_ !! 222 int dec = atomic_dec_if_positive(&iter->ucount[type]);
257 WARN_ON_ONCE(dec < 0); 223 WARN_ON_ONCE(dec < 0);
258 } 224 }
259 put_ucounts(ucounts); 225 put_ucounts(ucounts);
260 } 226 }
261 227
262 long inc_rlimit_ucounts(struct ucounts *ucount <<
263 { <<
264 struct ucounts *iter; <<
265 long max = LONG_MAX; <<
266 long ret = 0; <<
267 <<
268 for (iter = ucounts; iter; iter = iter <<
269 long new = atomic_long_add_ret <<
270 if (new < 0 || new > max) <<
271 ret = LONG_MAX; <<
272 else if (iter == ucounts) <<
273 ret = new; <<
274 max = get_userns_rlimit_max(it <<
275 } <<
276 return ret; <<
277 } <<
278 <<
279 bool dec_rlimit_ucounts(struct ucounts *ucount <<
280 { <<
281 struct ucounts *iter; <<
282 long new = -1; /* Silence compiler war <<
283 for (iter = ucounts; iter; iter = iter <<
284 long dec = atomic_long_sub_ret <<
285 WARN_ON_ONCE(dec < 0); <<
286 if (iter == ucounts) <<
287 new = dec; <<
288 } <<
289 return (new == 0); <<
290 } <<
291 <<
292 static void do_dec_rlimit_put_ucounts(struct u <<
293 struct ucounts <<
294 { <<
295 struct ucounts *iter, *next; <<
296 for (iter = ucounts; iter != last; ite <<
297 long dec = atomic_long_sub_ret <<
298 WARN_ON_ONCE(dec < 0); <<
299 next = iter->ns->ucounts; <<
300 if (dec == 0) <<
301 put_ucounts(iter); <<
302 } <<
303 } <<
304 <<
305 void dec_rlimit_put_ucounts(struct ucounts *uc <<
306 { <<
307 do_dec_rlimit_put_ucounts(ucounts, NUL <<
308 } <<
309 <<
310 long inc_rlimit_get_ucounts(struct ucounts *uc <<
311 { <<
312 /* Caller must hold a reference to uco <<
313 struct ucounts *iter; <<
314 long max = LONG_MAX; <<
315 long dec, ret = 0; <<
316 <<
317 for (iter = ucounts; iter; iter = iter <<
318 long new = atomic_long_add_ret <<
319 if (new < 0 || new > max) <<
320 goto unwind; <<
321 if (iter == ucounts) <<
322 ret = new; <<
323 max = get_userns_rlimit_max(it <<
324 /* <<
325 * Grab an extra ucount refere <<
326 * the rlimit count was previo <<
327 */ <<
328 if (new != 1) <<
329 continue; <<
330 if (!get_ucounts(iter)) <<
331 goto dec_unwind; <<
332 } <<
333 return ret; <<
334 dec_unwind: <<
335 dec = atomic_long_sub_return(1, &iter- <<
336 WARN_ON_ONCE(dec < 0); <<
337 unwind: <<
338 do_dec_rlimit_put_ucounts(ucounts, ite <<
339 return 0; <<
340 } <<
341 <<
342 bool is_rlimit_overlimit(struct ucounts *ucoun <<
343 { <<
344 struct ucounts *iter; <<
345 long max = rlimit; <<
346 if (rlimit > LONG_MAX) <<
347 max = LONG_MAX; <<
348 for (iter = ucounts; iter; iter = iter <<
349 long val = get_rlimit_value(it <<
350 if (val < 0 || val > max) <<
351 return true; <<
352 max = get_userns_rlimit_max(it <<
353 } <<
354 return false; <<
355 } <<
356 <<
357 static __init int user_namespace_sysctl_init(v 228 static __init int user_namespace_sysctl_init(void)
358 { 229 {
359 #ifdef CONFIG_SYSCTL 230 #ifdef CONFIG_SYSCTL
360 static struct ctl_table_header *user_h 231 static struct ctl_table_header *user_header;
361 static struct ctl_table empty[1]; 232 static struct ctl_table empty[1];
362 /* 233 /*
363 * It is necessary to register the use 234 * It is necessary to register the user directory in the
364 * default set so that registrations i 235 * default set so that registrations in the child sets work
365 * properly. 236 * properly.
366 */ 237 */
367 user_header = register_sysctl_sz("user !! 238 user_header = register_sysctl("user", empty);
368 kmemleak_ignore(user_header); 239 kmemleak_ignore(user_header);
369 BUG_ON(!user_header); 240 BUG_ON(!user_header);
370 BUG_ON(!setup_userns_sysctls(&init_use 241 BUG_ON(!setup_userns_sysctls(&init_user_ns));
371 #endif 242 #endif
372 hlist_add_ucounts(&init_ucounts); <<
373 inc_rlimit_ucounts(&init_ucounts, UCOU <<
374 return 0; 243 return 0;
375 } 244 }
376 subsys_initcall(user_namespace_sysctl_init); 245 subsys_initcall(user_namespace_sysctl_init);
377 246
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.