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