sched: rt-group: interface
[GitHub/MotorolaMobilityLLC/kernel-slsi.git] / kernel / user.c
CommitLineData
1da177e4
LT
1/*
2 * The "user cache".
3 *
4 * (C) Copyright 1991-2000 Linus Torvalds
5 *
6 * We have a per-user structure to keep track of how many
7 * processes, files etc the user has claimed, in order to be
8 * able to have per-user limits for system resources.
9 */
10
11#include <linux/init.h>
12#include <linux/sched.h>
13#include <linux/slab.h>
14#include <linux/bitops.h>
15#include <linux/key.h>
4021cb27 16#include <linux/interrupt.h>
acce292c
CLG
17#include <linux/module.h>
18#include <linux/user_namespace.h>
1da177e4 19
aee16ce7
PE
20struct user_namespace init_user_ns = {
21 .kref = {
22 .refcount = ATOMIC_INIT(2),
23 },
24 .root_user = &root_user,
25};
26EXPORT_SYMBOL_GPL(init_user_ns);
27
1da177e4
LT
28/*
29 * UID task count cache, to get fast user lookup in "alloc_uid"
30 * when changing user ID's (ie setuid() and friends).
31 */
32
1da177e4
LT
33#define UIDHASH_MASK (UIDHASH_SZ - 1)
34#define __uidhashfn(uid) (((uid >> UIDHASH_BITS) + uid) & UIDHASH_MASK)
acce292c 35#define uidhashentry(ns, uid) ((ns)->uidhash_table + __uidhashfn((uid)))
1da177e4 36
e18b890b 37static struct kmem_cache *uid_cachep;
4021cb27
IM
38
39/*
40 * The uidhash_lock is mostly taken from process context, but it is
41 * occasionally also taken from softirq/tasklet context, when
42 * task-structs get RCU-freed. Hence all locking must be softirq-safe.
3fa97c9d
AM
43 * But free_uid() is also called with local interrupts disabled, and running
44 * local_bh_enable() with local interrupts disabled is an error - we'll run
45 * softirq callbacks, and they can unconditionally enable interrupts, and
46 * the caller of free_uid() didn't expect that..
4021cb27 47 */
1da177e4
LT
48static DEFINE_SPINLOCK(uidhash_lock);
49
50struct user_struct root_user = {
51 .__count = ATOMIC_INIT(1),
52 .processes = ATOMIC_INIT(1),
53 .files = ATOMIC_INIT(0),
54 .sigpending = ATOMIC_INIT(0),
1da177e4
LT
55 .locked_shm = 0,
56#ifdef CONFIG_KEYS
57 .uid_keyring = &root_user_keyring,
58 .session_keyring = &root_session_keyring,
59#endif
24e377a8 60#ifdef CONFIG_FAIR_USER_SCHED
4cf86d77 61 .tg = &init_task_group,
24e377a8 62#endif
1da177e4
LT
63};
64
5cb350ba
DG
65/*
66 * These routines must be called with the uidhash spinlock held!
67 */
40aeb400 68static void uid_hash_insert(struct user_struct *up, struct hlist_head *hashent)
5cb350ba
DG
69{
70 hlist_add_head(&up->uidhash_node, hashent);
71}
72
40aeb400 73static void uid_hash_remove(struct user_struct *up)
5cb350ba
DG
74{
75 hlist_del_init(&up->uidhash_node);
76}
77
40aeb400 78static struct user_struct *uid_hash_find(uid_t uid, struct hlist_head *hashent)
5cb350ba
DG
79{
80 struct user_struct *user;
81 struct hlist_node *h;
82
83 hlist_for_each_entry(user, h, hashent, uidhash_node) {
84 if (user->uid == uid) {
85 atomic_inc(&user->__count);
86 return user;
87 }
88 }
89
90 return NULL;
91}
92
24e377a8 93#ifdef CONFIG_FAIR_USER_SCHED
5cb350ba 94
24e377a8
SV
95static void sched_destroy_user(struct user_struct *up)
96{
97 sched_destroy_group(up->tg);
98}
99
100static int sched_create_user(struct user_struct *up)
101{
102 int rc = 0;
103
104 up->tg = sched_create_group();
105 if (IS_ERR(up->tg))
106 rc = -ENOMEM;
107
108 return rc;
109}
110
111static void sched_switch_user(struct task_struct *p)
112{
113 sched_move_task(p);
114}
115
b1a8c172
DG
116#else /* CONFIG_FAIR_USER_SCHED */
117
118static void sched_destroy_user(struct user_struct *up) { }
119static int sched_create_user(struct user_struct *up) { return 0; }
120static void sched_switch_user(struct task_struct *p) { }
121
122#endif /* CONFIG_FAIR_USER_SCHED */
123
124#if defined(CONFIG_FAIR_USER_SCHED) && defined(CONFIG_SYSFS)
125
eb41d946 126static struct kset *uids_kset; /* represents the /sys/kernel/uids/ directory */
b1a8c172
DG
127static DEFINE_MUTEX(uids_mutex);
128
5cb350ba
DG
129static inline void uids_mutex_lock(void)
130{
131 mutex_lock(&uids_mutex);
132}
24e377a8 133
5cb350ba
DG
134static inline void uids_mutex_unlock(void)
135{
136 mutex_unlock(&uids_mutex);
137}
24e377a8 138
eb41d946
KS
139/* uid directory attributes */
140static ssize_t cpu_shares_show(struct kobject *kobj,
141 struct kobj_attribute *attr,
142 char *buf)
5cb350ba 143{
eb41d946 144 struct user_struct *up = container_of(kobj, struct user_struct, kobj);
24e377a8 145
eb41d946 146 return sprintf(buf, "%lu\n", sched_group_shares(up->tg));
5cb350ba
DG
147}
148
eb41d946
KS
149static ssize_t cpu_shares_store(struct kobject *kobj,
150 struct kobj_attribute *attr,
151 const char *buf, size_t size)
5cb350ba 152{
eb41d946 153 struct user_struct *up = container_of(kobj, struct user_struct, kobj);
5cb350ba
DG
154 unsigned long shares;
155 int rc;
156
eb41d946 157 sscanf(buf, "%lu", &shares);
5cb350ba
DG
158
159 rc = sched_group_set_shares(up->tg, shares);
160
161 return (rc ? rc : size);
162}
163
eb41d946
KS
164static struct kobj_attribute cpu_share_attr =
165 __ATTR(cpu_share, 0644, cpu_shares_show, cpu_shares_store);
166
9f0c1e56
PZ
167static ssize_t cpu_rt_runtime_show(struct kobject *kobj,
168 struct kobj_attribute *attr,
169 char *buf)
170{
171 struct user_struct *up = container_of(kobj, struct user_struct, kobj);
172
173 return sprintf(buf, "%lu\n", sched_group_rt_runtime(up->tg));
174}
175
176static ssize_t cpu_rt_runtime_store(struct kobject *kobj,
177 struct kobj_attribute *attr,
178 const char *buf, size_t size)
179{
180 struct user_struct *up = container_of(kobj, struct user_struct, kobj);
181 unsigned long rt_runtime;
182 int rc;
183
184 sscanf(buf, "%lu", &rt_runtime);
185
186 rc = sched_group_set_rt_runtime(up->tg, rt_runtime);
187
188 return (rc ? rc : size);
189}
190
191static struct kobj_attribute cpu_rt_runtime_attr =
192 __ATTR(cpu_rt_runtime, 0644, cpu_rt_runtime_show, cpu_rt_runtime_store);
193
eb41d946
KS
194/* default attributes per uid directory */
195static struct attribute *uids_attributes[] = {
196 &cpu_share_attr.attr,
9f0c1e56 197 &cpu_rt_runtime_attr.attr,
eb41d946
KS
198 NULL
199};
200
201/* the lifetime of user_struct is not managed by the core (now) */
202static void uids_release(struct kobject *kobj)
5cb350ba 203{
eb41d946 204 return;
5cb350ba
DG
205}
206
eb41d946
KS
207static struct kobj_type uids_ktype = {
208 .sysfs_ops = &kobj_sysfs_ops,
209 .default_attrs = uids_attributes,
210 .release = uids_release,
211};
212
213/* create /sys/kernel/uids/<uid>/cpu_share file for this user */
214static int uids_user_create(struct user_struct *up)
1da177e4 215{
eb41d946 216 struct kobject *kobj = &up->kobj;
5cb350ba
DG
217 int error;
218
eb41d946 219 memset(kobj, 0, sizeof(struct kobject));
eb41d946 220 kobj->kset = uids_kset;
cf15126b
GKH
221 error = kobject_init_and_add(kobj, &uids_ktype, NULL, "%d", up->uid);
222 if (error) {
223 kobject_put(kobj);
5cb350ba 224 goto done;
cf15126b 225 }
5cb350ba 226
fb7dde37 227 kobject_uevent(kobj, KOBJ_ADD);
5cb350ba
DG
228done:
229 return error;
1da177e4
LT
230}
231
eb41d946 232/* create these entries in sysfs:
5cb350ba
DG
233 * "/sys/kernel/uids" directory
234 * "/sys/kernel/uids/0" directory (for root user)
235 * "/sys/kernel/uids/0/cpu_share" file (for root user)
236 */
eb41d946 237int __init uids_sysfs_init(void)
1da177e4 238{
0ff21e46 239 uids_kset = kset_create_and_add("uids", NULL, kernel_kobj);
eb41d946
KS
240 if (!uids_kset)
241 return -ENOMEM;
5cb350ba 242
eb41d946 243 return uids_user_create(&root_user);
1da177e4
LT
244}
245
5cb350ba
DG
246/* work function to remove sysfs directory for a user and free up
247 * corresponding structures.
248 */
249static void remove_user_sysfs_dir(struct work_struct *w)
1da177e4 250{
5cb350ba 251 struct user_struct *up = container_of(w, struct user_struct, work);
5cb350ba
DG
252 unsigned long flags;
253 int remove_user = 0;
1da177e4 254
5cb350ba
DG
255 /* Make uid_hash_remove() + sysfs_remove_file() + kobject_del()
256 * atomic.
257 */
258 uids_mutex_lock();
259
260 local_irq_save(flags);
261
262 if (atomic_dec_and_lock(&up->__count, &uidhash_lock)) {
263 uid_hash_remove(up);
264 remove_user = 1;
265 spin_unlock_irqrestore(&uidhash_lock, flags);
266 } else {
267 local_irq_restore(flags);
1da177e4
LT
268 }
269
5cb350ba
DG
270 if (!remove_user)
271 goto done;
272
eb41d946
KS
273 kobject_uevent(&up->kobj, KOBJ_REMOVE);
274 kobject_del(&up->kobj);
275 kobject_put(&up->kobj);
5cb350ba
DG
276
277 sched_destroy_user(up);
278 key_put(up->uid_keyring);
279 key_put(up->session_keyring);
280 kmem_cache_free(uid_cachep, up);
281
282done:
283 uids_mutex_unlock();
284}
285
286/* IRQs are disabled and uidhash_lock is held upon function entry.
287 * IRQ state (as stored in flags) is restored and uidhash_lock released
288 * upon function exit.
289 */
290static inline void free_user(struct user_struct *up, unsigned long flags)
291{
292 /* restore back the count */
293 atomic_inc(&up->__count);
294 spin_unlock_irqrestore(&uidhash_lock, flags);
295
296 INIT_WORK(&up->work, remove_user_sysfs_dir);
297 schedule_work(&up->work);
1da177e4
LT
298}
299
b1a8c172 300#else /* CONFIG_FAIR_USER_SCHED && CONFIG_SYSFS */
5cb350ba 301
eb41d946
KS
302int uids_sysfs_init(void) { return 0; }
303static inline int uids_user_create(struct user_struct *up) { return 0; }
5cb350ba
DG
304static inline void uids_mutex_lock(void) { }
305static inline void uids_mutex_unlock(void) { }
306
307/* IRQs are disabled and uidhash_lock is held upon function entry.
308 * IRQ state (as stored in flags) is restored and uidhash_lock released
309 * upon function exit.
310 */
311static inline void free_user(struct user_struct *up, unsigned long flags)
312{
313 uid_hash_remove(up);
314 spin_unlock_irqrestore(&uidhash_lock, flags);
315 sched_destroy_user(up);
316 key_put(up->uid_keyring);
317 key_put(up->session_keyring);
318 kmem_cache_free(uid_cachep, up);
319}
320
b1a8c172 321#endif
5cb350ba 322
1da177e4
LT
323/*
324 * Locate the user_struct for the passed UID. If found, take a ref on it. The
325 * caller must undo that ref with free_uid().
326 *
327 * If the user_struct could not be found, return NULL.
328 */
329struct user_struct *find_user(uid_t uid)
330{
331 struct user_struct *ret;
3fa97c9d 332 unsigned long flags;
acce292c 333 struct user_namespace *ns = current->nsproxy->user_ns;
1da177e4 334
3fa97c9d 335 spin_lock_irqsave(&uidhash_lock, flags);
acce292c 336 ret = uid_hash_find(uid, uidhashentry(ns, uid));
3fa97c9d 337 spin_unlock_irqrestore(&uidhash_lock, flags);
1da177e4
LT
338 return ret;
339}
340
341void free_uid(struct user_struct *up)
342{
3fa97c9d
AM
343 unsigned long flags;
344
36f57413
AM
345 if (!up)
346 return;
347
3fa97c9d 348 local_irq_save(flags);
5cb350ba
DG
349 if (atomic_dec_and_lock(&up->__count, &uidhash_lock))
350 free_user(up, flags);
351 else
36f57413 352 local_irq_restore(flags);
1da177e4
LT
353}
354
acce292c 355struct user_struct * alloc_uid(struct user_namespace *ns, uid_t uid)
1da177e4 356{
735de223 357 struct hlist_head *hashent = uidhashentry(ns, uid);
8eb703e4 358 struct user_struct *up, *new;
1da177e4 359
eb41d946 360 /* Make uid_hash_find() + uids_user_create() + uid_hash_insert()
5cb350ba
DG
361 * atomic.
362 */
363 uids_mutex_lock();
364
3fa97c9d 365 spin_lock_irq(&uidhash_lock);
1da177e4 366 up = uid_hash_find(uid, hashent);
3fa97c9d 367 spin_unlock_irq(&uidhash_lock);
1da177e4
LT
368
369 if (!up) {
e94b1766 370 new = kmem_cache_alloc(uid_cachep, GFP_KERNEL);
8eb703e4
PE
371 if (!new)
372 goto out_unlock;
5e8869bb 373
1da177e4
LT
374 new->uid = uid;
375 atomic_set(&new->__count, 1);
376 atomic_set(&new->processes, 0);
377 atomic_set(&new->files, 0);
378 atomic_set(&new->sigpending, 0);
2d9048e2 379#ifdef CONFIG_INOTIFY_USER
0eeca283
RL
380 atomic_set(&new->inotify_watches, 0);
381 atomic_set(&new->inotify_devs, 0);
382#endif
970a8645 383#ifdef CONFIG_POSIX_MQUEUE
1da177e4 384 new->mq_bytes = 0;
970a8645 385#endif
1da177e4
LT
386 new->locked_shm = 0;
387
8eb703e4
PE
388 if (alloc_uid_keyring(new, current) < 0)
389 goto out_free_user;
1da177e4 390
8eb703e4
PE
391 if (sched_create_user(new) < 0)
392 goto out_put_keys;
24e377a8 393
8eb703e4
PE
394 if (uids_user_create(new))
395 goto out_destoy_sched;
5cb350ba 396
1da177e4
LT
397 /*
398 * Before adding this, check whether we raced
399 * on adding the same user already..
400 */
3fa97c9d 401 spin_lock_irq(&uidhash_lock);
1da177e4
LT
402 up = uid_hash_find(uid, hashent);
403 if (up) {
5cb350ba
DG
404 /* This case is not possible when CONFIG_FAIR_USER_SCHED
405 * is defined, since we serialize alloc_uid() using
406 * uids_mutex. Hence no need to call
407 * sched_destroy_user() or remove_user_sysfs_dir().
408 */
1da177e4
LT
409 key_put(new->uid_keyring);
410 key_put(new->session_keyring);
411 kmem_cache_free(uid_cachep, new);
412 } else {
413 uid_hash_insert(new, hashent);
414 up = new;
415 }
3fa97c9d 416 spin_unlock_irq(&uidhash_lock);
1da177e4
LT
417
418 }
5cb350ba
DG
419
420 uids_mutex_unlock();
421
1da177e4 422 return up;
8eb703e4
PE
423
424out_destoy_sched:
425 sched_destroy_user(new);
426out_put_keys:
427 key_put(new->uid_keyring);
428 key_put(new->session_keyring);
429out_free_user:
430 kmem_cache_free(uid_cachep, new);
431out_unlock:
432 uids_mutex_unlock();
433 return NULL;
1da177e4
LT
434}
435
436void switch_uid(struct user_struct *new_user)
437{
438 struct user_struct *old_user;
439
440 /* What if a process setreuid()'s and this brings the
441 * new uid over his NPROC rlimit? We can check this now
442 * cheaply with the new uid cache, so if it matters
443 * we should be checking for it. -DaveM
444 */
445 old_user = current->user;
446 atomic_inc(&new_user->processes);
447 atomic_dec(&old_user->processes);
448 switch_uid_keyring(new_user);
449 current->user = new_user;
24e377a8 450 sched_switch_user(current);
45c18b0b
LT
451
452 /*
453 * We need to synchronize with __sigqueue_alloc()
454 * doing a get_uid(p->user).. If that saw the old
455 * user value, we need to wait until it has exited
456 * its critical region before we can free the old
457 * structure.
458 */
459 smp_mb();
460 spin_unlock_wait(&current->sighand->siglock);
461
1da177e4
LT
462 free_uid(old_user);
463 suid_keys(current);
464}
465
aee16ce7 466#ifdef CONFIG_USER_NS
28f300d2
PE
467void release_uids(struct user_namespace *ns)
468{
469 int i;
470 unsigned long flags;
471 struct hlist_head *head;
472 struct hlist_node *nd;
473
474 spin_lock_irqsave(&uidhash_lock, flags);
475 /*
476 * collapse the chains so that the user_struct-s will
477 * be still alive, but not in hashes. subsequent free_uid()
478 * will free them.
479 */
480 for (i = 0; i < UIDHASH_SZ; i++) {
481 head = ns->uidhash_table + i;
482 while (!hlist_empty(head)) {
483 nd = head->first;
484 hlist_del_init(nd);
485 }
486 }
487 spin_unlock_irqrestore(&uidhash_lock, flags);
488
489 free_uid(ns->root_user);
490}
aee16ce7 491#endif
1da177e4
LT
492
493static int __init uid_cache_init(void)
494{
495 int n;
496
497 uid_cachep = kmem_cache_create("uid_cache", sizeof(struct user_struct),
20c2df83 498 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
1da177e4
LT
499
500 for(n = 0; n < UIDHASH_SZ; ++n)
735de223 501 INIT_HLIST_HEAD(init_user_ns.uidhash_table + n);
1da177e4
LT
502
503 /* Insert the root user immediately (init already runs as root) */
3fa97c9d 504 spin_lock_irq(&uidhash_lock);
acce292c 505 uid_hash_insert(&root_user, uidhashentry(&init_user_ns, 0));
3fa97c9d 506 spin_unlock_irq(&uidhash_lock);
1da177e4
LT
507
508 return 0;
509}
510
511module_init(uid_cache_init);