userns: Allow unprivileged reboot
[GitHub/mt8127/android_kernel_alcatel_ttab.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>
9984de1a 17#include <linux/export.h>
acce292c 18#include <linux/user_namespace.h>
98f842e6 19#include <linux/proc_fs.h>
1da177e4 20
59607db3
SH
21/*
22 * userns count is 1 for root user, 1 for init_uts_ns,
23 * and 1 for... ?
24 */
aee16ce7 25struct user_namespace init_user_ns = {
22d917d8
EB
26 .uid_map = {
27 .nr_extents = 1,
28 .extent[0] = {
29 .first = 0,
30 .lower_first = 0,
4b06a81f 31 .count = 4294967295U,
22d917d8
EB
32 },
33 },
34 .gid_map = {
35 .nr_extents = 1,
36 .extent[0] = {
37 .first = 0,
38 .lower_first = 0,
4b06a81f 39 .count = 4294967295U,
22d917d8
EB
40 },
41 },
f76d207a
EB
42 .projid_map = {
43 .nr_extents = 1,
44 .extent[0] = {
45 .first = 0,
46 .lower_first = 0,
47 .count = 4294967295U,
48 },
49 },
aee16ce7 50 .kref = {
59607db3 51 .refcount = ATOMIC_INIT(3),
aee16ce7 52 },
783291e6
EB
53 .owner = GLOBAL_ROOT_UID,
54 .group = GLOBAL_ROOT_GID,
98f842e6 55 .proc_inum = PROC_USER_INIT_INO,
aee16ce7
PE
56};
57EXPORT_SYMBOL_GPL(init_user_ns);
58
1da177e4
LT
59/*
60 * UID task count cache, to get fast user lookup in "alloc_uid"
61 * when changing user ID's (ie setuid() and friends).
62 */
63
7b44ab97
EB
64#define UIDHASH_BITS (CONFIG_BASE_SMALL ? 3 : 7)
65#define UIDHASH_SZ (1 << UIDHASH_BITS)
1da177e4
LT
66#define UIDHASH_MASK (UIDHASH_SZ - 1)
67#define __uidhashfn(uid) (((uid >> UIDHASH_BITS) + uid) & UIDHASH_MASK)
7b44ab97 68#define uidhashentry(uid) (uidhash_table + __uidhashfn((__kuid_val(uid))))
1da177e4 69
e18b890b 70static struct kmem_cache *uid_cachep;
7b44ab97 71struct hlist_head uidhash_table[UIDHASH_SZ];
4021cb27
IM
72
73/*
74 * The uidhash_lock is mostly taken from process context, but it is
75 * occasionally also taken from softirq/tasklet context, when
76 * task-structs get RCU-freed. Hence all locking must be softirq-safe.
3fa97c9d
AM
77 * But free_uid() is also called with local interrupts disabled, and running
78 * local_bh_enable() with local interrupts disabled is an error - we'll run
79 * softirq callbacks, and they can unconditionally enable interrupts, and
80 * the caller of free_uid() didn't expect that..
4021cb27 81 */
1da177e4
LT
82static DEFINE_SPINLOCK(uidhash_lock);
83
783291e6 84/* root_user.__count is 1, for init task cred */
1da177e4 85struct user_struct root_user = {
783291e6 86 .__count = ATOMIC_INIT(1),
1da177e4
LT
87 .processes = ATOMIC_INIT(1),
88 .files = ATOMIC_INIT(0),
89 .sigpending = ATOMIC_INIT(0),
1da177e4 90 .locked_shm = 0,
7b44ab97 91 .uid = GLOBAL_ROOT_UID,
1da177e4
LT
92};
93
5cb350ba
DG
94/*
95 * These routines must be called with the uidhash spinlock held!
96 */
40aeb400 97static void uid_hash_insert(struct user_struct *up, struct hlist_head *hashent)
5cb350ba
DG
98{
99 hlist_add_head(&up->uidhash_node, hashent);
100}
101
40aeb400 102static void uid_hash_remove(struct user_struct *up)
5cb350ba
DG
103{
104 hlist_del_init(&up->uidhash_node);
105}
106
7b44ab97 107static struct user_struct *uid_hash_find(kuid_t uid, struct hlist_head *hashent)
3959214f
KS
108{
109 struct user_struct *user;
110 struct hlist_node *h;
111
112 hlist_for_each_entry(user, h, hashent, uidhash_node) {
7b44ab97 113 if (uid_eq(user->uid, uid)) {
3959214f
KS
114 atomic_inc(&user->__count);
115 return user;
116 }
117 }
118
119 return NULL;
120}
121
5cb350ba
DG
122/* IRQs are disabled and uidhash_lock is held upon function entry.
123 * IRQ state (as stored in flags) is restored and uidhash_lock released
124 * upon function exit.
125 */
18b6e041 126static void free_user(struct user_struct *up, unsigned long flags)
571428be 127 __releases(&uidhash_lock)
5cb350ba
DG
128{
129 uid_hash_remove(up);
130 spin_unlock_irqrestore(&uidhash_lock, flags);
5cb350ba
DG
131 key_put(up->uid_keyring);
132 key_put(up->session_keyring);
133 kmem_cache_free(uid_cachep, up);
134}
135
1da177e4
LT
136/*
137 * Locate the user_struct for the passed UID. If found, take a ref on it. The
138 * caller must undo that ref with free_uid().
139 *
140 * If the user_struct could not be found, return NULL.
141 */
7b44ab97 142struct user_struct *find_user(kuid_t uid)
1da177e4
LT
143{
144 struct user_struct *ret;
3fa97c9d 145 unsigned long flags;
1da177e4 146
3fa97c9d 147 spin_lock_irqsave(&uidhash_lock, flags);
7b44ab97 148 ret = uid_hash_find(uid, uidhashentry(uid));
3fa97c9d 149 spin_unlock_irqrestore(&uidhash_lock, flags);
1da177e4
LT
150 return ret;
151}
152
153void free_uid(struct user_struct *up)
154{
3fa97c9d
AM
155 unsigned long flags;
156
36f57413
AM
157 if (!up)
158 return;
159
3fa97c9d 160 local_irq_save(flags);
5cb350ba
DG
161 if (atomic_dec_and_lock(&up->__count, &uidhash_lock))
162 free_user(up, flags);
163 else
36f57413 164 local_irq_restore(flags);
1da177e4
LT
165}
166
7b44ab97 167struct user_struct *alloc_uid(kuid_t uid)
1da177e4 168{
7b44ab97 169 struct hlist_head *hashent = uidhashentry(uid);
8eb703e4 170 struct user_struct *up, *new;
1da177e4 171
3fa97c9d 172 spin_lock_irq(&uidhash_lock);
1da177e4 173 up = uid_hash_find(uid, hashent);
3fa97c9d 174 spin_unlock_irq(&uidhash_lock);
1da177e4
LT
175
176 if (!up) {
354a1f4d 177 new = kmem_cache_zalloc(uid_cachep, GFP_KERNEL);
8eb703e4
PE
178 if (!new)
179 goto out_unlock;
5e8869bb 180
1da177e4
LT
181 new->uid = uid;
182 atomic_set(&new->__count, 1);
1da177e4
LT
183
184 /*
185 * Before adding this, check whether we raced
186 * on adding the same user already..
187 */
3fa97c9d 188 spin_lock_irq(&uidhash_lock);
1da177e4
LT
189 up = uid_hash_find(uid, hashent);
190 if (up) {
191 key_put(new->uid_keyring);
192 key_put(new->session_keyring);
193 kmem_cache_free(uid_cachep, new);
194 } else {
195 uid_hash_insert(new, hashent);
196 up = new;
197 }
3fa97c9d 198 spin_unlock_irq(&uidhash_lock);
1da177e4 199 }
5cb350ba 200
1da177e4 201 return up;
8eb703e4 202
8eb703e4 203out_unlock:
8eb703e4 204 return NULL;
1da177e4
LT
205}
206
1da177e4
LT
207static int __init uid_cache_init(void)
208{
209 int n;
210
211 uid_cachep = kmem_cache_create("uid_cache", sizeof(struct user_struct),
20c2df83 212 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
1da177e4
LT
213
214 for(n = 0; n < UIDHASH_SZ; ++n)
7b44ab97 215 INIT_HLIST_HEAD(uidhash_table + n);
1da177e4
LT
216
217 /* Insert the root user immediately (init already runs as root) */
3fa97c9d 218 spin_lock_irq(&uidhash_lock);
7b44ab97 219 uid_hash_insert(&root_user, uidhashentry(GLOBAL_ROOT_UID));
3fa97c9d 220 spin_unlock_irq(&uidhash_lock);
1da177e4
LT
221
222 return 0;
223}
224
225module_init(uid_cache_init);